6944670
Quality-oriented-maintenance for multiple interactive tooling components in discrete manufacturing processes
In discrete manufacturing processes such as stamping, assembly, or machining processes, product quality, often defined in terms of the dimensional integrity of work pieces, is jointly affected by multiple process variables. During the production phase, the states of tooling components, which are measured by adjustable process variables, are subject to possible random continuous drifts in their means & variances. These drifts of component states may significantly deteriorate product quality during production. Therefore, maintenance of the tooling components with consideration of both their continuous state drifts as well as catastrophic failures is crucial in assuring desired product quality & productivity. In contrast to traditional maintenance models where product quality has not been well addressed, especially for discrete manufacturing processes, a general quality-oriented-maintenance methodology is proposed in this paper to minimize the overall production costs. In this research, the total production cost includes product quality loss due to process drifts, productivity loss due to catastrophic failures, and maintenance costs. The quality-oriented-maintenance model is built based on a response model linking process variables with multidimensional product quality. It can be obtained either from engineering analysis for specific processes, or from statistical design of experiments. Three typical multi-component maintenance models are investigated under the general quality-oriented-maintenance framework. A case study for a sheet-metal stamping process is presented to demonstrate the effectiveness of the proposed methodology.
43007315
The impact of smart disks and spatial reuse property on RAID-5 storage systems
RAID storage systems using SCSI and traditional disk drives cannot meet the growing demand of new I/O intensive applications. New technologies such as smart disks and SSA are being proposed to improve the performance, scalability, and reliability of RAID systems. The objective of this work is to investigate the impact of smart disks and SSA's spatial reuse property on the performance of RAID-5 storage systems. In order to perform this work, we have enhanced CMU's RAIDframe simulator so that it accurately models the overhead of current SCSI and SSA protocols, and we have created smart disk models which include on-drive XOR logic and on-drive caches. We observe that neither smart disks alone nor spatial reuse property alone has much impact on RAID system performance. However, if smart disks and spatial reuse property are properly used in combination, RAID-5 system performance and scalability can be further enhanced. In particular, we propose a parity caching approach to improve the performance of small writes.
417212
Taxonomy of Data Prefetching for Multicore Processors
Data prefetching is an effective data access latency hiding technique to mask the CPU stall caused by cache misses and to bridge the performance gap between processor and memory. With hardware and/or software support, data prefetching brings data closer to a processor before it is actually needed. Many prefetching techniques have been developed for single-core processors. Recent developments in processor technology have brought multicore processors into mainstream. While some of the single-core prefetching techniques are directly applicable to multicore processors, numerous novel strategies have been proposed in the past few years to take advantage of multiple cores. This paper aims to provide a comprehensive review of the state-of-the-art prefetching techniques, and proposes a taxonomy that classifies various design concerns in developing a prefetching strategy, especially for multicore processors. We compare various existing methods through analysis as well.
12297104
CoStore: a reliable and highly available storage system using clusters
The CoStore cluster architecture is proposed to construct a reliable and highly available storage system. A prototype CoStore was implemented and its performance was measured with the cluster being mirrored in various network environments. The preliminary results demonstrate that there is little impact on performance if the cluster is mirrored in efficient campus network environments with high bandwidth and low latency. As a result the CoStore architecture considerably reinforces a storage system's preparedness for disaster recovery without sacrificing performance.
14925300
A Taxonomy of Data Prefetching Mechanisms
Data prefetching has been considered an effective way to mask data access latency caused by cache misses and to bridge the performance gap between processor and memory. With hardware and/or software support, data prefetching brings data closer to a processor before it is actually needed. Many prefetching techniques have been proposed in the last few years to reduce data access latency by taking advantage of multi-core architectures. In this paper, we propose a taxonomy that classifies various design concerns in developing a prefetching strategy. We discuss various prefetching strategies and issues that have to be considered in designing a prefetching strategy for multi-core processors.
61649411
Parallel I/O prefetching using MPI file caching and I/O signatures
Parallel I/O prefetching is considered to be effective in improving I/O performance. However, the effectiveness depends on determining patterns among future I/O accesses swiftly and fetching data in time, which is difficult to achieve in general. In this study, we propose an I/O signature-based prefetching strategy. The idea is to use a predetermined I/O signature of an application to guide prefetching. To put this idea to work, we first derived a classification of patterns and introduced a simple and effective signature notation to represent patterns. We then developed a toolkit to trace and generate I/O signatures automatically. Finally, we designed and implemented a thread-based client-side collective prefetching cache layer for MPI-IO library to support prefetching. A prefetching thread reads I/O signatures of an application and adjusts them by observing I/O accesses at runtime. Experimental results show that the proposed prefetching method improves I/O performance significantly for applications with complex patterns.
15013820
A Region Based Method to Automated Design of Multi-Piece Molds with Application to Rapid Tooling
Particularly for rapid tooling applications, delivering prototype parts with turn-aroun times of less than two weeks requires fast, proven mold design methods. We pre region-based approach to automated mold design that is suitable for simple twomolds (consisting of core and cavity), as well as molds with many additional mo sections. In our region-based approach, part faces are partitioned into regions, ea which can be formed by a single mold piece. The basic elements of our approac concave regions (generalized pockets) and convex faces since these elements are to the identification of regions. This paper focuses on the initial steps of automated design, including a problem formulation, methods for identifying the basic elements part faces, and combining them into regions. By seeking to minimize the number of pieces, different partitions of faces into regions are explored until the smallest numb regions is found. During this process, a linear programming problem is adopted finding a satisfactory parting direction of a region. Algorithms are presented for region generating and combining process. Our approach is illustrated with severa amples of industrial injection molded parts. @DOI: 10.1115/1.1505030 #
16254824
Trust Propagation in Small Worlds
The possibility of a massive, networked infrastructure of diverse entities partaking in collaborative applications with each other increases more and more with the proliferation of mobile devices and the development of ad hoc networking technologies. In this context, traditional security measures do not scale well. We aim to develop trust-based security mechanisms using small world concepts to optimise formation and propagation of trust amongst entities in these vast networks. In this regard, we surmise that in a very large mobile ad hoc network, trust, risk, and recommendations can be propagated through relatively short paths connecting entities. Our work describes the design of trust-formation and risk-assessment systems, as well as that of an entity recognition scheme, within the context of the small world network topology.
16631254
Using data mining techniques and rough set theory for language modeling
In this article, we propose a new postprocessing strategy, word suggestion, based on a multiple word trigger-pair language model for Chinese character recognizers. With the word suggestion strategy, Chinese character recognizers may even achieve a recognition rate greater than the top-n candidate recognition rate. To construct the multiple word trigger-pair model, data mining techniques are used to alleviate the intensive computation problem. Furthermore, rough set theory is first used in the study to discover negatively correlated relationships between words in order to prevent introducing wrong words in the process of word suggestion.
14204568
End-to-End Trust Starts with Recognition
Pervasive computing requires some level of trust to be established between entities. In this paper we argue for an entity recognition based approach to building this trust which differs from starting from more traditional authentication methods. We also argue for the concept of a ”pluggable” recognition module which allows different recognition schemes to be used in different circumstances. Finally, we propose that the trust in the underlying infrastructure has to be taken into account when considering end-to-end trust.
14185433
Affective Computing Model Based on Rough Fuzzy Sets
In human affective research, the fuzziness and roughness of the affective computing is the chief difficult. This paper builds a novel affective model based on rough fuzzy sets for the first time and presents a serial of static description results, which effectively solve the fuzzy and rough problems in affective computing. The model can realize the precision control of affective computing conveniently. Finally, the simulation shows that the results of the model for the affective static description are reasonable. This paper extends the results in (Yong Chen and Tong He, 2005) and lays the foundation of the affective computing in depth