NEURAL-NETWORK-AIDED DESIGN OF AUTOMOBILE EXHAUST CATALYSTS

A priori design of catalysts is not yet possible. Such task would demand unavailable scientific knowledge of the correlations among synthesis parameters and resulting solid state and surface structures, on the one hand, and among those atomic-level structural details and their catalytic functions, on the other hand. To avoid testing every possible combination, therefore, the applied chemist or chemical engineer must identify empirical correlations underlying the existing experimental data base.

The ability of artificial neural networks to identify complex correlations and to predict the result of experiments has recently generated considerable interest in various areas of science and engineering. In this paper, neural networks are used to identify composition-performance relationships in automobile exhaust catalysts.

This work employs an artificial neural network technique to do a sensitivity analysis of the conversions of pollutant gases as a function of the catalyst composition and the operating conditions. This approach converges on the optimum catalyst composition and operating condition in order to produce specified conversions of carbon monoxide, hydrocarbons and nitrogen oxides, to carbon dioxide, water and di-nitrogen respectively.     

Structure–property relationship of HTPB-based propellants. III. Optimization trials with varying levels of diol–triol contents

A systematic study has been conducted on a composite solid propellant formulation using hydroxyl-terminated polybutadiene (HTPB) prepolymer with varying molecular weights and hydroxyl values. Fairly extensive regions of resin parameters have been studied. Contours of important propellant properties have been laid down. In this set of experiments, varying levels of diol and triol contents were used at two different NCO/OH ratios to arrive at the optimum level needed for different grades of HTPB resin. It is seen that different grades of HTPB resin require varying levels of diol–triol contents to give similar properties for the end product. Also, for the best performance, varying the diol–triol ratio at the optimum level of the diol–triol content is necessary. © 1994 John Wiley & Sons, Inc.     

In-Situ interactive image-based model building for Augmented Reality from a handheld device

Three-dimensional models of objects and their creation process are central for a variety of applications in Augmented Reality. In this article, we present a system that is designed for in-situ modeling using interactive techniques for two generic versions of handheld devices equipped with cameras. The system allows online building of 3D wireframe models through a combination of user interaction and automated methods. In particular, we concentrate in rigorous evaluation of the two devices and interaction methods in the context of 3D feature selection. We present the key components of our system, discuss our findings and results and identify design recommendations.     

An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application tasks with dependences. These applications exhibit both task and data parallelism, and combining these two (also called mixed parallelism) has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task and data parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the task graph, the runtime estimates and scalability characteristics of the tasks, and the intertask data communication volumes. A locality-conscious scheduling strategy is used to improve intertask data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications and synthetic graphs shows that our algorithm consistently generates schedules with a lower makespan as compared to Critical Path Reduction (CPR) and Critical Path and Allocation (CPA), two previously proposed scheduling algorithms. Our algorithm also produces schedules that have a lower makespan than pure task- and data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.     

Iterative control approach to high-speed force-distance curve measurement using AFM: time-dependent response of PDMS example

Force-distance curve measurements using atomic force microscope (AFM) has been widely used in a broad range of areas. However, currently force-curve measurements are hampered the its low speed of AFM. In this article, a novel inversion-based iterative control technique is proposed to dramatically increase the speed of force-curve measurements. Experimental results are presented to show that by using the proposed control technique, the speed of force-curve measurements can be increased by over 80 times--with no loss of spatial resolution--on a commercial AFM platform and with a standard cantilever. High-speed force curve measurements using this control technique are utilized to quantitatively study the time-dependent elastic modulus of poly(dimethylsiloxane) (PDMS). The force-curves employ a broad spectrum of push-in (load) rates, spanning two-order differences. The elastic modulus measured at low-speed compares well with the value obtained from dynamic mechanical analysis (DMA) test, and the value of the elastic modulus increases as the push-in rate increases, signifying that a faster external deformation rate transitions the viscoelastic response of PDMS from that of a rubbery material toward a glassy one.     

Symbolic modular deadlock analysis

Methods in object-oriented concurrent libraries often encapsulate internal synchronization details. As a result of information hiding, clients calling the library methods may cause thread safety violations by invoking methods in an unsafe manner. This is frequently a cause of deadlocks. Given a concurrent library, we present a technique for inferring interface contracts that specify permissible concurrent method calls and patterns of aliasing among method arguments. In this work, we focus on deriving contracts that guarantee deadlock-free execution for the methods in the library. The contracts also help client developers by documenting required assumptions about the library methods. Alternatively, the contracts can be statically enforced in the client code to detect potential deadlocks in the client. Our technique combines static analysis with a symbolic encoding scheme for tracking lock dependencies, allowing us to synthesize contracts using a SMT solver. Additionally, we investigate extensions of our technique to reason about deadlocks in libraries that employ signaling primitives such as wait-notify for cooperative synchronization. Our prototype tool analyzes over a million lines of code for some widely-used Java libraries within an hour, thus demonstrating its scalability and efficiency. Furthermore, the contracts inferred by our approach have been able to pinpoint real deadlocks in clients, i.e. deadlocks that have been a part of bug-reports filed by users and developers of client code.     

Specifications for decidable hybrid games

We introduce STORMED hybrid games (SHG), a generalization of STORMED hybrid systems, Vladimerou et al. (2008) [33], which have natural specifications that allow rich continuous dynamics and various decidable properties. We solve the control problem for SHG using a reduction to bisimulation on finite game graphs. This generalizes to a greater family of games, which includes o-minimal hybrid games, Bouyer et al. (2006) [6]. We also solve the optimal-cost reachability problem for Weighted SHG and prove decidability of WCTL for Weighted STORMED hybrid systems.     

Theorem Proving Guided Development of Formal Assertions in a Resource-Constrained Scheduler for High-Level Synthesis

This paper presents a formal specification and a proof of correctness for the widely-used Force-Directed List Scheduling (FDLS) algorithm for resource-constrained scheduling of data flow graphs in high-level synthesis systems. The proof effort is conducted using a higher-order logic theorem prover. During the proof effort many interesting properties of the FDLS algorithm are discovered. These properties are formally stated and proved in a higher-order logic theorem proving environment. These properties constitute a detailed set of formal assertions and invariants that should hold at various steps in the FDLS algorithm. They are then inserted as programming assertions in the implementation of the FDLS algorithm in a production-strength high-level synthesis system. When turned on, the programming assertions (1) certify whether a specific run of the FDLS algorithm produced correct schedules and, (2) in the event of failure, help discover and isolate programming errors in the FDLS implementation.We present a detailed example and several experiments to demonstrate the effectiveness of these assertions in discovering and isolating errors. Based on this experience, we discuss the role of the formal theorem proving exercise in developing a useful set of assertions for embedding in the scheduler code and argue that in the absence of such a formal proof checking effort, discovering such a useful set of assertions would have been an arduous if not impossible task.     

First-Principles Investigation on Electronic Transport Properties of Tungsten Nitride Nanoribbon Based Molecular Device

The electronic transport property of tungsten nitride nanoribbon-based molecular device is investigated using density functional theory. The study on electronic transport properties are discussed in terms of device density of states and transmission spectrum of the nanoribbon. The scattering region of the nanoribbon is placed between the electrodes. For different bias voltages, the transport properties are studied. The contribution due to various orbitals leads to the peak maximum in device density of states. The transmission spectrum and transmission pathway provides insight to the transmission of charge under various bias conditions. The maximum peak in the transmission spectrum corresponds to the variation in transmission of charge with different bias voltage. The reported results will pave the way to improve the performance in the field of nanoelectronics.