42187803
Incremental Techniques for Efficient Normalization of Nonlinear Rewrite Systems
In [8] we described a nonlinear pattern-matching algorithm with the best known worst-case and optimal average-case time complexity. In this paper we first report on some experiments conducted on our algorithm. Based on these experiments we believe that our algorithm is useful in speeding up normalization of nonlinear rewrite systems even when it has a small number (≥5) of rewrite rules.
100663548
La 0.5 Sr 0.5 CoO 3 electrode technology for Pb(Zr,Ti)O 3 thin film nonvolatile memories
Abstract Oxide electrode technology is investigated for optimization of Pb(Zr,Ti)O 3 (PZT) thin film capacitor properties for high density nonvolatile memory applications. PZT thin film capacitors with RF sputter deposited La 0.5 Sr 0.5 CoO 3 (LSCO) electrodes have been characterized with respect to the following parameters: initial dielectric hysteresis loop characteristics, fatigue performance, microstructure and imprint behavior. Our studies have determined that the fatigue of PZT capacitors with LSCO electrodes is less sensitive to B site cation ratio and underlying electrode stack technology than with RuO 2 electrodes. Doping PZT thin films with Nb (PNZT) improves imprint behavior of LSCO//PZT//LSCO capacitors considerably. We have demonstrated that PNZT 4/30/70 // LSCO capacitors thermally processed at either 550°C or 675°C have almost identical initial hysteresis properties and exhibit essentially no fatigue out to approximately 10 10 cycles.
6173091
Automata-driven indexing of Prolog clauses
Indexing Prolog clauses is an important optimization step that reduces the number of clauses on which unification will be performed and can avoid the pushing of a choice point. It is quite desirable to increase the number of functors used in indexing as this can considerably reduce the size of the filtered set. However this can cause an enormous increase in running time if indexing is done naively. This paper describes a new technique for indexing that utilizes all the functors in a clause-head. More importantly, in spite of using all the functors, this technique is still able to quickly select relevant clause-heads at run time. This is made possible primarily by a finite-state automaton that guides the indexing process. The automaton is constructed at compile time by preprocessing all the clause-heads.
61774575
A simple method to test the stability of 2-D recursive digital filters of second order
62235624
An efficient approach to stochastic jobshop scheduling: algorithms and empirical investigations
Abstract Jobshop scheduling is one of the important classes of problems planning. The jobshop represents a common manufacturing environment, in which a set of machines is used to process a stream of jobs arriving randomly. The stochastic arrival pattern of the jobs, their processing sequences, and processing times render the scheduling of jobs a complex and difficult task. Furthermore, the scheduling task involves multiple conflicting objectives such as the minimization of the flow time, lateness and the number of late jobs among others. In this research,we develop a framework for the efficient scheduling of jobs considering these multiple objectives. The motivation for this research arises from the good performance of the interactive man-machine scheduling systems in achieving significant levels of attainment in the set of objectives, simultaneously. We develop scheduling strategies to the man-machine approach in this research. The algorithms developed in this research have been extensively tested and evaluated against the traditional scheduling methods using simulation studies. The results show that the proposed approach is efficient and viable for solving practical scheduling problems in the presence of multiple objectives.
560868
An Optimal Algorithm for the Orienteering Tour Problem
Orienteering is a sport in which a competitor selects a path from a start to a destination, visiting control points along the path. Each control point has an associated score, and the travel between control points involves a certain cost. The problem is to select a set of control points to visit, so that the total score is maximized subject to a budget constraint on total cost. Several versions of this problem exist. In the version considered in this research, the start and the destination are the same, and the problem is to construct a subtour of the set of control points. The orienteering problem is a variant of the traveling salesman problem, and arises in vehicle routing and production scheduling situations. This problem has been shown to be NP-hard in the literature. We develop an optimal algorithm to solve this problem, using Lagrangean relaxation within a branch-and-bound framework. The Lagrangean relaxation is solved by a degree-constrained spanning tree procedure. Characteristics of the Lagrangea...
137267326
Thin Film Ferroelectric Materials and Devices
From the Publisher: 
Thin Film Ferroelectric Materials and Devices is a compilation of current research and development in two very important ferroelectric device technologies, namely ferroelectrics for Dynamic Random Access Memories (DRAM's) and Non-Volatile Ferroelectric Random Access Memories (NV-FRAM's). Given the rapid pace of development and the broad scope of the general topic of ferroelectric materials, readers will benefit from such a focused presentation. Thin Film Ferroelectric Materials and Devices will be of great value to materials and device scientists, device and process engineers, students, and postdoctoral associates. Furthermore, this compilation will serve as a concise introduction for new entrants to this exciting field.
60708157
Multicriteria jobshop scheduling
Abstract Jobshop scheduling is one of the important classes of problems in production planning. The jobshop represents a common manufacturing environmental, in which a set of machines is used to process a stream of jobs arriving randomly. The stochastic arrival pattern of the jobs, their processing sequences, and processing times render the scheduling of jobs in a jobshop a complex and difficult task. Furthermore, the scheduling task involves multiple conflicting objectives such as the minimization of the flow time, lateness and the number of late jobs among others. In this research, we develop a framework for the efficient scheduling of jobs in the presence of these multiple objectives. The motivation for this research arises from the good performance of the interactive man-machine scheduling systems in achieving significant levels of attainment in the set of objectives, simultaneously. We develop scheduling strategies similar to the man-machine approach in this research.