An overview of artificial intelligence and robotics. Volume 1: Artificial intelligence. Part B: Applications

Artificial Intelligence (AI) is an emerging technology that has recently attracted considerable attention. Many applications are now under development. This report, Part B of a three part report on AI, presents overviews of the key application areas: Expert Systems, Computer Vision, Natural Language Processing, Speech Interfaces, and Problem Solving and Planning. The basic approaches to such systems, the state-of-the-art, existing systems and future trends and expectations are covered

Automating Program Verification and Repair Using Invariant Analysis and Test Input Generation

Software bugs are a persistent feature of daily life---crashing web browsers, allowing cyberattacks, and distorting the results of scientific computations. One approach to improving software uses program invariants---mathematical descriptions of program behaviors---to verify code and detect bugs. Current invariant generation techniques lack support for complex yet important forms of invariants, such as general polynomial relations and properties of arrays. As a result, we lack the ability to conduct precise analysis of programs that use this common data structure. This dissertation presents DIG, a static and dynamic analysis framework for discovering several useful classes of program invariants, including (i) nonlinear polynomial relations, which are fundamental to many scientific applications; disjunctive invariants, (ii) which express branching behaviors in programs; and (iii) properties about multidimensional arrays, which appear in many practical applications. We describe theoretical and empirical results showing that DIG can efficiently and accurately find many important invariants in real-world uses, e.g., polynomial properties in numerical algorithms and array relations in a full AES encryption implementation. Automatic program verification and synthesis are long-standing problems in computer science. However, there has been a lot of work on program verification and less so on program synthesis. Consequently, important synthesis tasks, e.g., generating program repairs, remain difficult and time-consuming. This dissertation proves that certain formulations of verification and synthesis are equivalent, allowing for direct applications of techniques and tools between these two research areas. Based on these ideas, we develop CETI, a tool that leverages existing verification techniques and tools for automatic program repair. Experimental results show that CETI can have higher success rates than many other standard program repair methods

Abstracts on Radio Direction Finding (1899 - 1995)

The files on this record represent the various databases that originally composed the CD-ROM issue of "Abstracts on Radio Direction Finding" database, which is now part of the Dudley Knox Library's Abstracts and Selected Full Text Documents on Radio Direction Finding (1899 - 1995) Collection. (See Calhoun record https://calhoun.nps.edu/handle/10945/57364 for further information on this collection and the bibliography). Due to issues of technological obsolescence preventing current and future audiences from accessing the bibliography, DKL exported and converted into the three files on this record the various databases contained in the CD-ROM. The contents of these files are: 1) RDFA_CompleteBibliography_xls.zip [RDFA_CompleteBibliography.xls: Metadata for the complete bibliography, in Excel 97-2003 Workbook format; RDFA_Glossary.xls: Glossary of terms, in Excel 97-2003 Workbookformat; RDFA_Biographies.xls: Biographies of leading figures, in Excel 97-2003 Workbook format]; 2) RDFA_CompleteBibliography_csv.zip [RDFA_CompleteBibliography.TXT: Metadata for the complete bibliography, in CSV format; RDFA_Glossary.TXT: Glossary of terms, in CSV format; RDFA_Biographies.TXT: Biographies of leading figures, in CSV format]; 3) RDFA_CompleteBibliography.pdf: A human readable display of the bibliographic data, as a means of double-checking any possible deviations due to conversion

Superstructure Optimization of Multiple Cyclone Arrangements Using Mixed Integer Nonlinear Programming

The gas-solid cyclone has been remarkably widely used among all types of industrial gas-cleaning devices. Many studies have been conducted and reported excessive experimental, theoretical, and computational research aimed at understanding and predicting the performance of cyclones. However, the majority of these works have only focused on the development of single cyclones. In the meantime, the use of multiple cyclones can be considered as one solution to the demands of obtaining the best pollution control strategies to achieve a minimum level of pollution reduction. This has motivated the development of effective formulation for the cyclone arrangement problem. In this work a new optimization model of multiple cyclone arrangement is presented. The key idea is to present the capability of General Algebraic Modeling System (GAMS) software in obtaining the optimal number and dimensions of the cyclone, and the best cyclone arrangement for a certain condition with respect to the minimum total cost, including the operating cost and the capital cost. The proposed model of nonlinear programming (NLP) and mixed integer nonlinear programming (MINLP) has been successfully applied to different case studies. The NLP model is applied to an NPK (Nitrogen, Phosphorus, and Potassium) fertilizer plant to find the optimal number and dimensions of the 1D3D, 2D2D, and 1D2D cyclones arranged either in parallel or series. In another case study with the total flow rate of 165 m3/s of a stream to be processed in a paper mill, the best cyclone arrangement of parallel-series for three different combinations of the 1D3D and 2D2D cyclone is obtained through the use of MINLP modeling. The results show that different types of cyclones, applied in NPK fertilizer plant, result in different optimal numbers of cyclones. Each type of cyclone (i.e., 1D3D, 2D2D, and 1D2D) has an alternative that can be arranged either in parallel or in series configuration. Furthermore, different values used for the upper bound of D and N in the proposed MINLP model, result in a different cyclone arrangement of parallel-series selected as the optimal solution. The cyclone of 2D2D+2D2D arranged in parallel-series is found to be more economical and efficient compared to other arrangements

Radar Technology

In this book “Radar Technology”, the chapters are divided into four main topic areas: Topic area 1: “Radar Systems” consists of chapters which treat whole radar systems, environment and target functional chain. Topic area 2: “Radar Applications” shows various applications of radar systems, including meteorological radars, ground penetrating radars and glaciology. Topic area 3: “Radar Functional Chain and Signal Processing” describes several aspects of the radar signal processing. From parameter extraction, target detection over tracking and classification technologies. Topic area 4: “Radar Subsystems and Components” consists of design technology of radar subsystem components like antenna design or waveform design

Geneplanner: A Prototype of an expert system to assist with chemical DNA gene synthesis planning

Expert systems are a popular area of artificial intelligence. The development of an expert system involves the selection of an appropriate problem, acquisition of knowledge from the expert, selection of control mechanisms and knowledge repre sentations, selection of tools, implementation, and testing. This thesis describes the development of a prototype expert system in the area of genetic engineering. The prototype system suggests the fragments of DNA to chemically synthesize and the steps for joining these fragments in order to make a gene. The system follows the hueristic rules of an expert to select the fragments and strategy for synthesis, backtracking where necessary. After reviewing expert systems and the problem area, the thesis focuses on the development process. Each of the steps is discussed, and the iterative nature of implementation, testing, and refinement is displayed. Results are reviewed, showing Geneplanner to handle simple to moder ate cases fairly well. Finally, shortcomings are discussed and future enhancements are suggested

Computer Aided Verification

This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications

Automated synthesis and debugging of declarative models in alloy

In theory, formal specifications offer numerous benefits in developing more reliable software. In practice however, the use of specifications is rather limited, and practitioners often consider them more trouble than they are worth. Indeed, manually writing detailed specifications using notations that have unfamiliar syntax and semantics can be a daunting task -- even for experienced programmers. We introduce a new automated approach for synthesis of desired specifications and debugging of faulty specifications using given examples that capture the essence of desired properties and serve as test cases. Our focus is specifications written in the declarative language Alloy -- a first-order logic based on relations with transitive closure, and its SAT-based analysis engine. Our key insight is that a test-driven foundation enables modern approaches to synthesis and debugging of imperative code to serve as a basis for developing novel analogous techniques for declarative specifications. For synthesis, we build on equivalence in relational algebra and introduce techniques for generating candidate Alloy expressions. We also introduce a technique to complete a partial Alloy model with holes using constraint solving. For locating faults in buggy specifications, we build on mutation-based fault localization and introduce techniques for locating likely faulty nodes in the abstract syntax tree of the faulty specification. Moreover, we integrate our expression generation and fault localization techniques to introduce a technique for automated specification repair. We experimentally evaluate our techniques using several Alloy models as subjects, including those with real faults. The results show that our techniques are effective at synthesis and debugging of the subjects. We believe our techniques provide an important step towards increasing the role of formal specifications in developing more reliable software and realizing their promise.Electrical and Computer Engineerin