Design and development of an emulated human cognition using novel 3D neural networks

This paper describes the development of an Emulated Human Cognition (EHC) which is designed and based on a replicated human brain with a right- and a left- hand lobe, one a deductive side and the other a generic one. Right-hand lobe consists of a newly designed Artificial Neural Network (ANN) with a multi-hidden layer topology. Left-hand lobe is a newly designed 3-dimensional cellular neural network. The input variables presented to the EHC are immediately analysed for it to decide which lobe should be activated. The EHC, when fully developed, has almost an unlimited memory capacity and is capable of immediate recall of any data in its almost unlimited memory locations. EHC has been used in several applications where neural networks have been used to establish relationship between two or more sets of variables. In this paper the EHC has been used to forecast demand for a given product

Synthesis of Recursive ADT Transformations from Reusable Templates

Recent work has proposed a promising approach to improving scalability of program synthesis by allowing the user to supply a syntactic template that constrains the space of potential programs. Unfortunately, creating templates often requires nontrivial effort from the user, which impedes the usability of the synthesizer. We present a solution to this problem in the context of recursive transformations on algebraic data-types. Our approach relies on polymorphic synthesis constructs: a small but powerful extension to the language of syntactic templates, which makes it possible to define a program space in a concise and highly reusable manner, while at the same time retains the scalability benefits of conventional templates. This approach enables end-users to reuse predefined templates from a library for a wide variety of problems with little effort. The paper also describes a novel optimization that further improves the performance and scalability of the system. We evaluated the approach on a set of benchmarks that most notably includes desugaring functions for lambda calculus, which force the synthesizer to discover Church encodings for pairs and boolean operations

JOINING SEQUENCE ANALYSIS AND OPTIMIZATION FOR IMPROVED GEOMETRICAL QUALITY

Disturbances in the manufacturing and assembly processes cause geometrical variation from the ideal geometry. This variation eventually results in functional and aesthetic problems in the final product. Being able to control the disturbances is the desire of the manufacturing industry. \ua0 Joining sequences impact the final geometrical outcome in an assembly considerably. To optimize the sequence for improved geometrical outcome is both experimentally and computationally expensive. In the simulation-based approaches, based on the finite element method, a large number of sequences need to be evaluated.\ua0 In this thesis, the simulation-based joining sequence optimization using non-rigid variation simulation is studied. Initially, the limitation of the applied algorithms in the literature has been addressed. A rule-based optimization approach based on meta-heuristic algorithms and heuristic search methods is introduced to increase the previously applied algorithms\u27 time-efficiency and accuracy. Based on the identified rules and heuristics, a reduced formulation of the sequence optimization is introduced by identifying the critical points for geometrical quality. A subset of the sequence problem is identified and solved in this formulation.\ua0 For real-time optimization of the joining sequence problem, time-efficiency needs to be further enhanced by parallel computations. By identifying the sequence-deformation behavior in the assemblies, black-box surrogate models are introduced, enabling parallel evaluations and accurate approximation of the geometrical quality. Based on this finding, a deterministic stepwise search algorithm for rapid identification of the optimal sequence is introduced.\ua0 Furthermore, a numerical approach to identify the number, location from a set of alternatives, and sequence of the critical joining points for geometrical quality is introduced. Finally, the cause of the various deformations achieved by joining sequences is identified. A time-efficient non-rigid variation simulation approach for evaluating the geometrical quality with respect to the sequences is proposed. \ua0 The results achieved from the studies presented indicate that the simulation-based real-time optimization of the joining sequences is achievable through a parallelized search algorithm and a rapid evaluation of the sequences. The critical joining points for geometrical quality are identified while the sequence is optimized. The results help control the assembly process with respect to the joining operation, improve the geometrical quality, and save significant computational time

Applying Formal Methods to Networking: Theory, Techniques and Applications

Despite its great importance, modern network infrastructure is remarkable for the lack of rigor in its engineering. The Internet which began as a research experiment was never designed to handle the users and applications it hosts today. The lack of formalization of the Internet architecture meant limited abstractions and modularity, especially for the control and management planes, thus requiring for every new need a new protocol built from scratch. This led to an unwieldy ossified Internet architecture resistant to any attempts at formal verification, and an Internet culture where expediency and pragmatism are favored over formal correctness. Fortunately, recent work in the space of clean slate Internet design---especially, the software defined networking (SDN) paradigm---offers the Internet community another chance to develop the right kind of architecture and abstractions. This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications. In this paper, we present a self-contained tutorial of the formidable amount of work that has been done in formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial

Software Development Technologies for Reactive, Real-Time, and Hybrid Systems

The research is directed towards the design and implementation of a comprehensive deductive environment for the development of high-assurance systems, especially reactive (concurrent, real-time, and hybrid) systems. Reactive systems maintain an ongoing interaction with their environment, and are among the most difficult to design and verify. The project aims to provide engineers with a wide variety of tools within a single, general, formal framework in which the tools will be most effective. The entire development process is considered, including the construction, transformation, validation, verification, debugging, and maintenance of computer systems. The goal is to automate the process as much as possible and reduce the errors that pervade hardware and software development