773323
Intelligent computer integrated manufacturing (I-CIM): Research perspectives
Abstract Manufacturing automation has progressed through various stages from simple data transfer to the intelligence-intensive systems. The future of CIM relies heavily on intelligence-intensive systems because manufacturing is no longer confined to one local site and manufacturing systems have become complex because of their global nature. In this article, the authors study the future manufacturing environment as a collaborative effort. The essential characteristics-the requirements for integration from a process and communication perspective-are identified as are steps in the process requiring further study. Finally, Intelligent-Computer Integrated Manufacturing (I-CIM) scenarios are presented for specific problems.
6732453
Enterprise computing environments and cost assessment
120648016
Theory of convex cones in multicriteria decision making
We develop the theory of convex polyhedral cones in the objective-function space of a multicriteria decision problem. The convex cones are obtained from the decision-maker's pairwise judgments of decision alternatives and are applicable to any quasiconcave utility function. Therefore, the cones can be used in any progressively articulated solution procedure that employs pairwise comparisons. The cones represent convex sets of solutions that are inferior to known solutions to a multicriteria problem. Therefore, these convex sets can be eliminated from consideration while solving the problem. We develop the underlying theory and a framework for representing knowledge about the decision-maker's preference structure using convex cones. This framework can be adopted in the interactive solution of any multicriteria problem after taking into account the characteristics of the problem and the solution procedure. Our computational experience with different multicriteria problems shows that this approach is both viable and efficient in solving practical problems of moderate size.
316216
The Distribution Problem with Carrier Service: A Dual Based Penalty Approach
The distribution problem with carrier service is an important optimization problem that often arises in vehicle routing. The problem arises in the distribution of commodities from a central facility to a set of geographically distributed locations. Each location has a certain demand, the distribution vehicle has a load capacity, and the entire operation should be completed within a certain time. An outside carrier is available for direct service of locations from the central facility. The problem is to determine a feasible tour for the company vehicle and the locations to be served by the outside carrier such that the total cost of the operations is minimized. We model this problem and develop a solution technique using valid inequalities. A key feature of the solution approach is that it can easily be extended to solve similar problems with any type and number of side constraints as encountered in the current model. The algorithm has been extensively tested and computational results for problems having u...
32066139
Topographically discounted Internet infrastructure resources: a panel study and econometric analysis
The Internet infrastructure is increasingly utilized for the provision and delivery of a variety of services. The rapid growth and substantial demand fluctuations of the supported services are placing strain on the service providers to effectively manage their infrastructure resources. Capacity Provision Network (CPN) is a market-driven mechanism that enables the service providers to efficiently allocate, share and trade service capabilities. Central to the operation of CPN is the notion of discounted capacities which capture the underlying topology of the Internet. It serves as a practical instrument for service providers to evaluate the utility of capacity services available at remote sites vis-à-vis the capacities available locally and from the content providers. We conducted an Internet based longitudinal field experiment to empirically assess and validate the critical properties of discount factors. Our analysis reveals that discount factors exhibit markedly lower volatility than network delays, and are more stable over seasonal and temporal trend patterns. The results related to size effects suggest that sharing and trade agreements with larger content can be particularly effective. Our finding on the existence of the concavity property points to the ability of intermediation services to enhance the overall gains from resource sharing arrangements.
13648716
EARS: An online bibliographic search and retrieval system based on ordered explosion
Abstract Ergonomics Abstracts Retrieval System (EARS) is an online bibliographic information search and retrieval system using the hierarchical subject classification of the Ergonomics Abstracts . EARS is designed using an inverted file organization and is implemented on CDC-Cyber. The data base of abstracts is organized using a fixed-length record format, where each logical record corresponds to a variable number of fixed-length physical records. Accordingly, an index for the identification of physical records from the logical records is used. The data base is inverted on a three-level hierarchical classification scheme and postings files are used for data base inversion. The data base is accessed after selectively traversing a 4-layer structure of indexes and postings files. EARS provides facilities to perform combinations of searches, limited searches, and certain editing functions. The system is currently used extensively by the Western New York Human Factors research community. The logical and physical designs of EARS, its interactive operational features, and its current expansions are described in this paper.
14332724
Simultaneous Optimization of Design Tolerance and Total Cost for a Piston and Cylinder Assembly
Rapid changes in the market place have led designers and manufacturers to continuously develop new products to satisfy the demands of more exigent customers. Therefore, to be competitive, designers and manufacturers have to perform those steps accurately to ensure final Product quality and manufacturing cost. So Product quality and manufacturing cost have a significant impact on Tolerance. A more scientific approach is often desirable for better performance to overcome this Tolerance problem. In this paper, Design and machining tolerances have been allocated based on optimum total machining cost. New global nonlinear optimization techniques called Pattern Search algorithm and Genetic algorithm have been implemented to find the optimal tolerance allocation and total cost. Finally with respect to total cost both the methods have been compared.
35337405
A dynamic learning model for on-line quality control using the TAGUCHI approach
Abstract An important philosophy of quality control due to Taguchi rests on the belief that, once quality is designed into the product and the process, very little inspection is necessary. Taguchi evaluates quality in terms of costs incurred, including inspection and adjustment costs apart from quality loss. Using these costs, he determines an optimal interval for periodic inspection of products. At each inspection, the first item on the process line is checked for defects. If no defects are found, the process is assumed to be under control. On the other hand, if the first item turns out to be defective, the process is immediately stopped and adjusted. The underlying assumption here is that, once a defect is observed, it is construed that the process has drifted and all subsequent items are defective. This article challenges the underlying assumption by recognizing that the observation of one defective item does not necessarily imply that the process is out of control. Noisy signals may occur as a result ...
5663050
Term Matching on Parallel Computers
Term matching is an important problem that arises very often in term rewriting and in functional and equational programming. We present a new parallel algorithm for the term-matching problem on the EREW (exclusive read, exclusive write) model of parallel computation. Our algorithm assumes a string representation of the two terms as its input. The string representation is first transformed into two labeled ordered trees, and term matching is then performed on these two trees. If n is the length of the input terms, then for any constant ϵ (0 < ϵ ≤ 1) our algorithm uses O(n1-ϵ) processors and takes O(nϵlogn) time. If ϵ = 0, the same algorithm will run in O(log2 n) time. The only other known parallel algorithm for this problem, due to Dwork, Kanellakis, and Stockmeyer, requires O(n2) processors and takes either O(logn) or O(log2n) time. However, their algorithm uses the stronger CREW (concurrent read, exclusive write) model of parallel computation and assumes a DAG (directed acyclic graph) representation of the two terms as its input. On the CRCW (concurrent read, concurrent write) model our algorithm requires n processors and O(log n) time.
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.
10449411
Multistage Indexing Algorithms for Speeding Prolog Execution
In a previous article we proposed a new and efficient indexing technique that utilizes all the functors in the clause-heads and the goal. The salient feature of this technique is that the selected clause-head unifies (modulo nonlinearity)with the goal. As a consequence, our technique results in sharper discrimination, fewer choice points and reduced backtracking. A naı̈ve and direct implementation of our indexing algorithms considerably slowed down the execution speeds of a wide range of programs typically seen in practice. This is because it handled deep and shallow terms, terms with few indexable arguments, small and large procedures uniformly. To beneficially extend the applicability of our algorithms we need mechanisms that are ‘sensitive’ to term structures and size and complexity of procedures. We accomplish this in theν-ALS compiler by carefully decomposing our indexing process intomultiple stages . The operations performed by these stages increase in complexity ranging from first argument indexing to unification (modulo nonlinearity). Further the indexing process can be terminated at any stage if it is not beneficial to continue further. We have now completed the design and implementation of ν-ALS. Using it we have enhanced the performance of a broad range of programs typically encountered in practice. Our experience strongly suggests that indexing based on unification (modulo nonlinearity) is a viable idea in practice and that a broad spectrum of useful programs can realize all of its benefits.