Log in

Relevant bibliographies by topics / Tarski's world (Computer program)

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Tarski's world (Computer program)'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Tarski's world (Computer program).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Tarski's world (Computer program)"

1

Goldson, Doug, Steve Reeves, Jon Barwise, and John Etchemendy. "The Language of First-Order Logic, including the Macintosh Program Tarski's World." Philosophical Quarterly 44, no. 175 (April 1994): 272. http://dx.doi.org/10.2307/2219757.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Raitt, David. "World Watch." Electronic Library 14, no. 2 (February 1, 1996): 165–66. http://dx.doi.org/10.1108/eb045462.

Full text

Abstract:

World Watch is a nifty little software package for Windows which displays world and regional maps showing cities and the local time for various locations selected by the user. In addition, a dynamic illuminated pattern in the centre of the map shows those areas of the world currently experiencing daylight. The pattern highlights the progress of seasons, displays sunrise and sunset as they happen and automatically adjusts to summer or daylight saving time. World Watch also doubles as a very nice screen saver which utilises all the functions of the program. The package contains a 3.5″ disk and user manual (pretty good), and installing the program is simplicity itself — simply insert the diskette and follow instructions, and in an instant the program is ready for use and/or customisation. There is the possibility to use small fonts (as opposed to the Windows system fonts), though these fonts are not mentioned in the manual. Besides how to operate and customise World Watch, the user manual also provides some technical information on how the program works, a glossary of terms, and the coordinates and time relative to GMT of the cities included in the package.

APA, Harvard, Vancouver, ISO, and other styles

3

Yonezawa, A. "The Real World Computing Program: MITI's Next Computer Research Initiative." Science 258, no. 5082 (October 23, 1992): 581–82. http://dx.doi.org/10.1126/science.258.5082.581.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

RANDOLPH, Justus J., and Pasi J. ERONEN. "Program and Evaluation Planning Light: Planning in the Real World." Informatics in Education 6, no. 1 (April 15, 2007): 189–96. http://dx.doi.org/10.15388/infedu.2007.13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ye, Jiaxi, Bin Zhang, Ruilin Li, Chao Feng, and Chaojing Tang. "Program State Sensitive Parallel Fuzzing for Real World Software." IEEE Access 7 (2019): 42557–64. http://dx.doi.org/10.1109/access.2019.2905744.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Scott, Ralph L. "Wired to the World: Firewalls." North Carolina Libraries 61, no. 3 (January 20, 2009): 109. http://dx.doi.org/10.3776/ncl.v61i3.168.

Full text

Abstract:

An antivirus program continuously monitors your computer to detect a virus, which is automatically deleted and/or quarantined. Firewall programs, on the other hand, block access to your computer from the Internet and prevent hackers from planting a worm or other type of malicious software in your computer. Firewalls protect your data, your computer, and your name from corruption. Stories are legion about the Internet being used to seize control of a computer identity to do things such as send out fake e-mails in your name canceling final exams, insulting your boss, and ordering merchandise such as ten pizzas to be delivered to your office. A good firewall will prevent such aremote seizure of your computer.

APA, Harvard, Vancouver, ISO, and other styles

7

Khalil, Wisama, Rezia Maria Molfino, and Valentina Resaz. "EMARO: A European Contribution in Shaping the Future World Roboticists." Journal of Robotics and Mechatronics 23, no. 5 (October 20, 2011): 871–80. http://dx.doi.org/10.20965/jrm.2011.p0871.

Full text

Abstract:

In this report we present the European Master in Advanced Robotics (EMARO) Master’s Course. This course has been developed and accepted in the Erasmus Mundus European program framework. This program [1] is a cooperation and mobility program of the European Union in the field of higher education which promotes the European Union as a centre of excellence in learning worldwide. It aims at enhancing the quality in European higher education and at promoting intercultural understanding through cooperation with non European countries. The Erasmus Mundus programprovides a response to the challenges of globalisation faced by European higher education today, in particular the need to adapt education systems to the demands of the knowledge society and to enhance the attractiveness and visibility of European higher education worldwide. The Erasmus Mundus program supports high-quality European Master’s Courses by providing very attractive grants for students having excellent academic results from around the world to engage in graduate study at EMARO institutions. It also provides scholarships to scholars for conduct teaching and research assignments and scholarly work related to masters’ topics at partner institutions.

APA, Harvard, Vancouver, ISO, and other styles

8

Cash, B. "The Last Place in the World - Copyright Protection for Computer Software in New Zealand." Victoria University of Wellington Law Review 27, no. 3 (November 3, 1997): 391. http://dx.doi.org/10.26686/vuwlr.v27i3.6109.

Full text

Abstract:

Computer technology - whether it is hardware, software or the internet - is the headache that just won't go away for anyone grappling with the law of intellectual property. With the Copyright Act 1994, the New Zealand legislature attempted to meet some of the challenges but it largely avoided the issue, passing the headache onto the judiciary should any tricky issues arise. One such issue is copyright protection for computer programs. The Copyright Act 1994 makes it clear that computer programs are protected as a literary work but how far does that protection extend (or how far do we carry the fiction that a computer program is literary work)? This article attempts to second guess what level of protection our courts might provide. It argues that New Zealand has shown a willingness to protect functional items and would protect the "look and feel" of a program, providing a level of protection which courts in the United States have considered undesirable.

APA, Harvard, Vancouver, ISO, and other styles

9

Sun, Xiaobing, Xiangyue Liu, Bin Li, Bixin Li, David Lo, and Lingzhi Liao. "Clustering Classes in Packages for Program Comprehension." Scientific Programming 2017 (2017): 1–15. http://dx.doi.org/10.1155/2017/3787053.

Full text

Abstract:

During software maintenance and evolution, one of the important tasks faced by developers is to understand a system quickly and accurately. With the increasing size and complexity of an evolving system, program comprehension becomes an increasingly difficult activity. Given a target system for comprehension, developers may first focus on the package comprehension. The packages in the system are of different sizes. For small-sized packages in the system, developers can easily comprehend them. However, for large-sized packages, they are difficult to understand. In this article, we focus on understanding these large-sized packages and propose a novel program comprehension approach for large-sized packages, which utilizes the Latent Dirichlet Allocation (LDA) model to cluster large-sized packages. Thus, these large-sized packages are separated as small-sized clusters, which are easier for developers to comprehend. Empirical studies on four real-world software projects demonstrate the effectiveness of our approach. The results show that the effectiveness of our approach is better than Latent Semantic Indexing- (LSI-) and Probabilistic Latent Semantic Analysis- (PLSA-) based clustering approaches. In addition, we find that the topic that labels each cluster is useful for program comprehension.

APA, Harvard, Vancouver, ISO, and other styles

10

Peifer, R. W. "Integrating Digital Multimedia, Computer-based Instruction, and the World Wide Web into an Introductory Biology Curriculum." HortScience 31, no. 4 (August 1996): 697b—697. http://dx.doi.org/10.21273/hortsci.31.4.697b.

Full text

Abstract:

During the past 6 years, the General Biology Program at the Univ. of Minnesota has been exploring the use of computer-based multimedia to improve the quality of undergraduate instruction in large undergraduate courses. Our project has created an image library of about 3500 computer graphics, animations, and digital video sequences for lecture support, as well as the software to present and manage this image library. During the past 3 years, students have used computers for modeling, simulation, and problem-solving activities in the laboratory of our evolution and ecology undergraduate course. Most recently, we have begun to integrate the World Wide Web into our curriculum in a variety of ways. This presentation demonstrates the comprehensive way in which our Program has combined these “new” information technologies into our introductory courses. The general applicability of this approach to any discipline will be discussed.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Tarski's world (Computer program)"

1

Hengstebeck, Sandra Marie. "Presentations world wide systems." CSUSB ScholarWorks, 2001. https://scholarworks.lib.csusb.edu/etd-project/1922.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Beaulac, Jacqueline. "Interactive multimedia composition on the World Wide Web : a solution for musicians using Java." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=33270.

Full text

Abstract:

This thesis attempts to gauge the strengths and limitations of the Java programming language in terms of its use in the production of multimedia compositions: in particular, the ways in which Java supports the creation of interactive, non-deterministic musical works. An original solution to the problem of multimedia design is presented: a hierarchically defined, basic, yet flexible scripting language that is interpreted using Java. This scripting language allows the user to incorporate his/her own media into a coherent and interactive form using a small set of simple keywords and basic operators. It also allows new functionality to be added by advanced users with a basic knowledge of Java. By investigating how such a scripting language may be implemented, the extent to which Java may be applied towards multimedia applications in general is revealed.

APA, Harvard, Vancouver, ISO, and other styles

3

Wright, Madeleine. "A detailed investigation of interoperability for web services." Thesis, Rhodes University, 2006. http://hdl.handle.net/10962/d1004832.

Full text

Abstract:

The thesis presents a qualitative survey of web services' interoperability, offering a snapshot of development and trends at the end of 2005. It starts by examining the beginnings of web services in earlier distributed computing and middleware technologies, determining the distance from these approaches evident in current web-services architectures. It establishes a working definition of web services, examining the protocols that now seek to define it and the extent to which they contribute to its most crucial feature, interoperability. The thesis then considers the REST approach to web services as being in a class of its own, concluding that this approach to interoperable distributed computing is not only the simplest but also the most interoperable. It looks briefly at interoperability issues raised by technologies in the wider arena of Service Oriented Architecture. The chapter on protocols is complemented by a chapter that validates the qualitative findings by examining web services in practice. These have been implemented by a variety of toolkits and on different platforms. Included in the study is a preliminary examination of JAX-WS, the replacement for JAX-RPC, which is still under development. Although the main language of implementation is Java, the study includes services in C# and PHP and one implementation of a client using a Firefox extension. The study concludes that different forms of web service may co-exist with earlier middleware technologies. While remaining aware that there are still pitfalls that might yet derail the movement towards greater interoperability, the conclusion sounds an optimistic note that recent cooperation between different vendors may yet result in a solution that achieves interoperability through core web-service standards.

APA, Harvard, Vancouver, ISO, and other styles

4

Pai, Neelesh G. "Making real-time precision adjustments to world-wide chip production." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/50091.

Full text

Abstract:

Thesis (M.B.A.)--Massachusetts Institute of Technology, Sloan School of Management; and, (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science; in conjunction with the Leaders for Manufacturing Program at MIT, 2009.
Includes bibliographical references (p. 94-95).
Intel has recently embarked on a mission to improve its supply chain responsiveness. Currently production lead times are around 4 months requiring a forecast a quarter out. Most customer demand changes happen within lead time since customers only know their demand a few weeks before shipment. While stable production plans help maintain factory utilization rates their inflexibility can also lead to missed revenue opportunities or unneeded inventory. The challenge then is to make planning processes agile enough to react to late demand changes. The FAB has a 2-3 month throughput time or latency. The subsequent Assembly-Test (ATM) operation has a 1-2 month latency. Increasing competition requires the striking of a balance between competitive service levels and excess inventory. This Thesis looks to develop ways of making more real-time tactical demand updates to production plans used by the global factory network to improve Supply Chain Responsiveness. Using business analytics and organizational processes analysis, ways of making late demand changes to the production plan are evaluated. The project focuses on Intel's global ATM network due to its proximity to end customer demand. A holistic solution to use available intelligence is proposed. The focus is on creating data visibility across the supply chain and on putting feedback loops in planning processes to intercept planning processes at various points with new information as and when it becomes available.
(cont.) Issues examined include demand signal generation, the choice of different demand signals, solver algorithms to convert demand inputs to a global production plan, inventory target setting and implementation in production plan and finally ATM processes such as SDD (delayed product differentiation at the semi-finished goods warehouse) for Product Mix and volume determination. The hypothesis is that this will lead to a better understanding of the interaction between various planning processes.
by Neelesh Pai.
S.M.
M.B.A.

APA, Harvard, Vancouver, ISO, and other styles

5

Hayakawa, Hajime. "International Usability, Design Guidelines and Effectiveness of a World Wide Web-Based Instructional Program for High School Students in a Cross-Culture Learning Environment." NSUWorks, 1999. http://nsuworks.nova.edu/gscis_etd/574.

Full text

Abstract:

The recent growth of the Internet and the World Wide Web (WWW) has resulted in a vast array of on-line courseware and educational Web sites. Unfortunately, as a large percentage of this information is written in English, non-English speakers are unable to access it. Information written in other languages is likewise unavailable to many native English speakers. Therefore, in order to maximize the usefulness of educational material on the Web, it is necessary to design and implement cross-cultural, bilingual or multilingual Web sites and instructional programs. This study was designed to contribute to the area of bilingual learning on the Web. The researcher developed and evaluated three types of mathematics courseware: an English-only version, a Japanese-only version, and a bilingual version. While both the bilingual and English-only courseware enabled Japanese students with a basic knowledge of English to learn both quadratic equations and mathematical terms in English, the research found that the bilingual version was the most effective courseware for learning both mathematics and English simultaneously. Formative and summative evaluations were conducted in order to improve the program and determine the effectiveness of the bilingual courseware. As the courseware was implemented and evaluated, design guidelines were generated and the issue of courseware usability was explored.

APA, Harvard, Vancouver, ISO, and other styles

6

Anand, Saswat. "Techniques to facilitate symbolic execution of real-world programs." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/44733.

Full text

Abstract:

The overall goal of this research is to reduce the cost of software development and improve the quality of software. Symbolic execution is a program-analysis technique that is used to address several problems that arise in developing high-quality software. Despite the fact that the symbolic execution technique is well understood, and performing symbolic execution on simple programs is straightforward, it is still not possible to apply the technique to the general class of large, real-world software. A symbolic-execution system can be effectively applied to large, real-world software if it has at least the two features: efficiency and automation. However, efficient and automatic symbolic execution of real-world programs is a lofty goal because of both theoretical and practical reasons. Theoretically, achieving this goal requires solving an intractable problem (i.e., solving constraints). Practically, achieving this goal requires overwhelming effort to implement a symbolic-execution system that can precisely and automatically symbolically execute real-world programs. This research makes three major contributions. 1. Three new techniques that address three important problems of symbolic execution. Compared to existing techniques, the new techniques * reduce the manual effort that may be required to symbolically execute those programs that either generate complex constraints or parts of which cannot be symbolically executed due to limitations of a symbolic-execution system. * improve the usefulness of symbolic execution (e.g., expose more bugs in a program) by enabling discovery of more feasible paths within a given time budget. 2. A novel approach that uses symbolic execution to generate test inputs for Apps that run on modern mobile devices such as smartphones and tablets. 3. Implementations of the above techniques and empirical results obtained from applying those techniques to real-world programs that demonstrate their effectiveness.

APA, Harvard, Vancouver, ISO, and other styles

7

Chen, Kevin Tzu-Jung. "Javaserver page, Java servlet and JavaBean technology: Online real estate company." CSUSB ScholarWorks, 2002. https://scholarworks.lib.csusb.edu/etd-project/2204.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Praritsantik, Supachai. "Web-based interactive self-evaluation system for computer science in generic tutorial system for the sciences project." CSUSB ScholarWorks, 2002. https://scholarworks.lib.csusb.edu/etd-project/2273.

Full text

Abstract:

The goal of this master project is to promote and facilitate the use of new web-based and Java-based technologies in the development of self-evaluation systems for computer science; in particular, analysis of sorting algorithms.

APA, Harvard, Vancouver, ISO, and other styles

9

Bussa, Naga Raju. "WVU - interactive web based distance learning tool." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=1116.

Full text

Abstract:

Thesis (M.S.)--West Virginia University, 1999.
Title from document title page. Document formatted into pages; contains v, 245 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 114-115).

APA, Harvard, Vancouver, ISO, and other styles

10

Reddy, Neeta. "Java prototype of hypercard bibliography past implementation and present choices." CSUSB ScholarWorks, 2002. https://scholarworks.lib.csusb.edu/etd-project/2071.

Full text

Abstract:

This project was started with JDK Version 1.0 and was later upgraded to version JDK Version 1.2.2, to create a graphical user interface using the Abstract Window Toolkit (AWT) to a HyperCard bibliography of software engineering. The bibliographic index tool is designed to facilitate searching for text and is run as a Java applet. It presents an alphabetically ordered list of author names and subjects. With the bibliography index tool one can manipulate a bibliographic list directly over the World Wide Web on a computer that lists electronic bibliographies.

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Tarski's world (Computer program)"

1

Barwise, Jon. The language of first-order logic: Including the IBM-compatible Windows version of Tarski's World 4.0. 3rd ed. Stanford: Center for the Study of Language and Information, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jon, Barwise. Tarski's world 3.0: Including the Macintosh program. Stanford, CA: Center for the Study of Language and Information, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

1952-, Etchemendy John, ed. The language of first-order logic: Including the Macintosh program Tarski's world. 2nd ed. Stanford, CA: Center for the Study of Language and Information, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kvern, Olav Martin. Real world FreeHand 8. Berkeley, CA: Macromedia Press, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

1948-, Cohen Sandee, ed. Real world Illustrator 9. Berkeley, Calif: Peachpit, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mine, Mark R. Virtual world construction using ISAAC. [Orlando, Fla.?]: Link Foundation, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Real world Adobe Illustrator CS3. Berkeley, Calif: Peachpit, 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Real world Adobe Illustrator CS4. Berkeley, CA: Peachpit, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Real world Adobe Illustrator CS5. Berkeley, CA: Peachpit Press, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Golding, Mordy. Real world Adobe Illustrator CS4. Berkeley, CA: Peachpit, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Tarski's world (Computer program)"

1

Berliner, Hans J. "Backgammon Computer Program Beats World Champion." In Computer Games I, 29–43. New York, NY: Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4613-8716-9_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Popyack, Jeffrey L., and Nira Herrmann. "Why everyone should know how to program a computer." In World Conference on Computers in Education VI, 603–12. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-0-387-34844-5_57.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Shi, Xiaomu, Yu-Fu Fu, Jiaxiang Liu, Ming-Hsien Tsai, Bow-Yaw Wang, and Bo-Yin Yang. "CoqQFBV: A Scalable Certified SMT Quantifier-Free Bit-Vector Solver." In Computer Aided Verification, 149–71. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_7.

Full text

Abstract:

AbstractWe present a certified SMT QF_BV solver CoqQFBV built from a verified bit blasting algorithm, Kissat, and the verified SAT certificate checker GratChk in this paper. Our verified bit blasting algorithm supports the full QF_BV logic of SMT-LIB; it is specified and formally verified in the proof assistant Coq . We compare CoqQFBV with CVC4, Bitwuzla, and Boolector on benchmarks from the QF_BV division of the single query track in the 2020 SMT Competition, and real-world cryptographic program verification problems. CoqQFBV surprisingly solves more program verification problems with certification than the 2020 SMT QF_BV division winner Bitwuzla without certification.

APA, Harvard, Vancouver, ISO, and other styles

4

Altukhova, Natalia, and Elena Vasilieva. "The Ecosystem of Training the Future Leaders of the Digital World: Results of the Inclusion of “Internet Entrepreneurship” in the Educational Program of the University of Economics." In Communications in Computer and Information Science, 57–66. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-78273-3_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Cogumbreiro, Tiago, Julien Lange, Dennis Liew Zhen Rong, and Hannah Zicarelli. "Checking Data-Race Freedom of GPU Kernels, Compositionally." In Computer Aided Verification, 403–26. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_19.

Full text

Abstract:

AbstractGPUs offer parallelism as a commodity, but they are difficult to program correctly. Static analyzers that guarantee data-race freedom (DRF) are essential to help programmers establish the correctness of their programs (kernels). However, existing approaches produce too many false alarms and struggle to handle larger programs. To address these limitations we formalize a novel compositional analysis for DRF, based on access memory protocols. These protocols are behavioral types that codify the way threads interact over shared memory.Our work includes fully mechanized proofs of our theoretical results, the first mechanized proofs in the field of DRF analysis for GPU kernels. Our theory is implemented in , a tool that outperforms the state-of-the-art. Notably, it can correctly verify at least $$1.42{\times }$$ 1.42 × more real-world kernels, and it exhibits a linear growth in 4 out of 5 experiments, while others grow exponentially in all 5 experiments.

APA, Harvard, Vancouver, ISO, and other styles

6

Munksgaard, Philip, Svend Lund Breddam, Troels Henriksen, Fabian Cristian Gieseke, and Cosmin Oancea. "Dataset Sensitive Autotuning of Multi-versioned Code Based on Monotonic Properties." In Lecture Notes in Computer Science, 3–23. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83978-9_1.

Full text

Abstract:

AbstractFunctional languages allow rewrite-rule systems that aggressively generate a multitude of semantically-equivalent but differently-optimized code versions. In the context of GPGPU execution, this paper addresses the important question of how to compose these code versions into a single program that (near-)optimally discriminates them across different datasets. Rather than aiming at a general autotuning framework reliant on stochastic search, we argue that in some cases, a more effective solution can be obtained by customizing the tuning strategy for the compiler transformation producing the code versions.We present a simple and highly-composable strategy which requires that the (dynamic) program property used to discriminate between code versions conforms with a certain monotonicity assumption. Assuming the monotonicity assumption holds, our strategy guarantees that if an optimal solution exists it will be found. If an optimal solution doesn’t exist, our strategy produces human tractable and deterministic results that provide insights into what went wrong and how it can be fixed.We apply our tuning strategy to the incremental-flattening transformation supported by the publicly-available Futhark compiler and compare with a previous black-box tuning solution that uses the popular OpenTuner library. We demonstrate the feasibility of our solution on a set of standard datasets of real-world applications and public benchmark suites, such as Rodinia and FinPar. We show that our approach shortens the tuning time by a factor of $$6\times $$ 6 × on average, and more importantly, in five out of eleven cases, it produces programs that are (as high as $$10\times $$ 10 × ) faster than the ones produced by the OpenTuner-based technique.

APA, Harvard, Vancouver, ISO, and other styles

7

Khedr, Haitham, James Ferlez, and Yasser Shoukry. "PEREGRiNN: Penalized-Relaxation Greedy Neural Network Verifier." In Computer Aided Verification, 287–300. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_13.

Full text

Abstract:

AbstractNeural Networks (NNs) have increasingly apparent safety implications commensurate with their proliferation in real-world applications: both unanticipated as well as adversarial misclassifications can result in fatal outcomes. As a consequence, techniques of formal verification have been recognized as crucial to the design and deployment of safe NNs. In this paper, we introduce a new approach to formally verify the most commonly considered safety specifications for ReLU NNs – i.e. polytopic specifications on the input and output of the network. Like some other approaches, ours uses a relaxed convex program to mitigate the combinatorial complexity of the problem. However, unique in our approach is the way we use a convex solver not only as a linear feasibility checker, but also as a means of penalizing the amount of relaxation allowed in solutions. In particular, we encode each ReLU by means of the usual linear constraints, and combine this with a convex objective function that penalizes the discrepancy between the output of each neuron and its relaxation. This convex function is further structured to force the largest relaxations to appear closest to the input layer; this provides the further benefit that the most “problematic” neurons are conditioned as early as possible, when conditioning layer by layer. This paradigm can be leveraged to create a verification algorithm that is not only faster in general than competing approaches, but is also able to verify considerably more safety properties; we evaluated PEREGRiNN on a standard MNIST robustness verification suite to substantiate these claims.

APA, Harvard, Vancouver, ISO, and other styles

8

Clayton, John F. "Education, the Internet, and the World Wide Web." In Encyclopedia of Human Computer Interaction, 175–78. IGI Global, 2006. http://dx.doi.org/10.4018/978-1-59140-562-7.ch028.

Full text

Abstract:

The development of the Internet has a relatively brief and well-documented history (Cerf, 2001; Griffiths, 2001; Leiner et al., 2000; Tyson, 2002). The initial concept was first mooted in the early 1960s. American computer specialists visualized the creation of a globally interconnected set of computers through which everyone quickly could access data and programs from any node, or place, in the world. In the early 1970s, a research project initiated by the United States Department of Defense investigated techniques and technologies to interlink packet networks of various kinds. This was called the Internetting project, and the system of connected networks that emerged from the project was known as the Internet. The initial networks created were purpose-built (i.e., they were intended for and largely restricted to closed specialist communities of research scholars). However, other scholars, other government departments, and the commercial sector realized the system of protocols developed during this research (Transmission Control Protocol [TCP] and Internet Protocol [IP], collectively known as the TCP/IP Protocol Suite) had the potential to revolutionize data and program sharing in all parts of the community. A flurry of activity, beginning with the National Science Foundation (NSF) network NSFNET in 1986, over the last two decades of the 20th century created the Internet as we know it today. In essence, the Internet is a collection of computers joined together with cables and connectors following standard communication protocols.

APA, Harvard, Vancouver, ISO, and other styles

9

Fabro, João A., Sérgio L. Stebel, L. V. R. Arruda, Flávio Neves, Ana Paula F. D. Barbosa-Póvoa, and Susana Relvas. "A Mixed Integer Linear Program decomposition solution to the scheduling activities in a real-world pipeline used to transport heavy oil derivatives." In Computer Aided Chemical Engineering, 595–600. Elsevier, 2013. http://dx.doi.org/10.1016/b978-0-444-63234-0.50100-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Entin, Eileen B., Jason Sidman, and Lisa Neal. "Development of Online Distributed Training." In Computer-Supported Collaborative Learning, 180–97. IGI Global, 2008. http://dx.doi.org/10.4018/978-1-59904-753-9.ch009.

Full text

Abstract:

This chapter discusses considerations and tradeoffs in designing and developing an online teamwork skills training program for geographically distributed instructors and students. The training program is grounded in principles of scenario-based learning, in which operationally realistic scenarios are used to engage students in actively forming links between classroom and real-world applications of key concepts. The chapter focuses on supporting active engagement of learners, and meaningful and thoughtful learner-learner interactions appropriate to the subject matter (Neal & Miller, 2006). We describe lessons learned in the development of a distributed training program that interleaves asynchronous and synchronous training modules (Neal & Miller, 2005) to leverage the advantages of both self-paced and group learning, provide opportunities to practice the teamwork concepts being trained, create social presence, and promote interaction and reflection among the course members.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Tarski's world (Computer program)"

1

"Program Committee." In 2016 World Symposium on Computer Applications & Research (WSCAR). IEEE, 2016. http://dx.doi.org/10.1109/wscar.2016.6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chun, Sang Myung. "Computer Program Development Predicting Engine Oil Consumption." In World Tribology Congress III. ASMEDC, 2005. http://dx.doi.org/10.1115/wtc2005-64248.

Full text

Abstract:

The oil consumption and blow-by gas through piston-cylinder-ring crevices have to be minimized. Meanwhile, the friction losses in the piston ring pack need to be reduced in order to improve fuel economy and engine performance. In these two aspects, study on the optimized design of the piston ring pack has to be carried out. The amounts of oil consumption and blow-by gas are important factors to decide whether an engine is operating under good conditions or not during engine development and engine life cycle. The purpose of this study is to develop a computer program predicting engine oil consumption and blow-by gas by calculating the amount of oil flowing into the combustion chamber and gas flow down to the crankcase through the piston ring pack. Using this program, the condition of an engine can be predicted in advance.

APA, Harvard, Vancouver, ISO, and other styles

3

Ioannides, E., L. E. Stacke, D. Fritzson, and I. Nakhimovski. "Multibody Rolling Bearing Calculations: Computer Program BEAST." In World Tribology Congress III. ASMEDC, 2005. http://dx.doi.org/10.1115/wtc2005-64337.

Full text

Abstract:

The need for rapid development of high efficiency jet engines and other mechanical systems has forced the pace of development of simulation tools so that the detailed behavior of the rolling element bearings can be simulated. This includes modeling of the motions, the exchanged forces, and heat between all the bearing components, i.e. rings, cage and rolling elements. The computer program BEAST is a multi-body computer program with sophisticated and robust modeling of the tribological contacts in the bearing where the exchange of forces between the bearing components takes place.

APA, Harvard, Vancouver, ISO, and other styles

4

Taghaddosi, Farzad, Judith M. Gallman, and Ramesh K. Agarwal. "ProRAPP: A Computer Program for Propeller/Rotor Noise Prediction." In World Aviation Congress & Exposition. 400 Commonwealth Drive, Warrendale, PA, United States: SAE International, 1998. http://dx.doi.org/10.4271/985523.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

"Program Committee." In 2017 4th Asia-Pacific World Congress on Computer Science and Engineering (APWC on CSE). IEEE, 2017. http://dx.doi.org/10.1109/apwconcse.2017.00008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

"Program Committee." In 2018 5th Asia-Pacific World Congress on Computer Science and Engineering (APWC on CSE). IEEE, 2018. http://dx.doi.org/10.1109/apwconcse.2018.00008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zhong, Run-yang, Qing-yun Dai, and Ke Zhou. "Plug-Universal Database-Aided Program Design." In 2009 WRI World Congress on Computer Science and Information Engineering. IEEE, 2009. http://dx.doi.org/10.1109/csie.2009.133.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Guoguang, Zhang. "LPSPS: A New Linear Programming Program." In 2009 WRI World Congress on Computer Science and Information Engineering. IEEE, 2009. http://dx.doi.org/10.1109/csie.2009.152.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kussul, Nataliia, Andrii Shelestov, Mykola Lavreniuk, Andrii Kolotii, and Vladimir Vasiliev. "Transparent Land Governance in Ukraine within World Bank Program." In 2019 IEEE 2nd Ukraine Conference on Electrical and Computer Engineering (UKRCON). IEEE, 2019. http://dx.doi.org/10.1109/ukrcon.2019.8879771.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Heineman, Mitchell C. "NetSTORM - A Computer Program for Rainfall-Runoff Simulation and Precipitation Analysis." In World Water and Environmental Resources Congress 2004. Reston, VA: American Society of Civil Engineers, 2004. http://dx.doi.org/10.1061/40737(2004)395.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!