A paralleldistributed scheme is presented for coding random patterns generated via iteration of contraction mappings. The scheme is implemented by a decentralized computational process an distributed parameter system...
详细信息
ISBN:
(纸本)0818678704
A paralleldistributed scheme is presented for coding random patterns generated via iteration of contraction mappings. The scheme is implemented by a decentralized computational process an distributed parameter system. The distributed parameter system generates a representation of missing probability for attractor as the basis of design of contraction mappings. The local minimals of missing probability is extracted and aggregated as the decentralized representation of contraction mappings. The coding scheme is verified through computer simulation.
This abstract presents the contents of the tutorial and practical demonstration of CORBA, Web und databases to he hold at the DEXA 2000 Workshop on parallel and distributeddatabases.
ISBN:
(纸本)0769506801
This abstract presents the contents of the tutorial and practical demonstration of CORBA, Web und databases to he hold at the DEXA 2000 Workshop on parallel and distributeddatabases.
Tracking and tracing individual items is a new and emerging trend in many industries. Driven by maturing technologies such as Radio-Frequency Identification (RFID) and upcoming standards such as the Electronic Product...
详细信息
ISBN:
(纸本)9780769525778
Tracking and tracing individual items is a new and emerging trend in many industries. Driven by maturing technologies such as Radio-Frequency Identification (RFID) and upcoming standards such as the Electronic Product Code (EPC) a rapidly increasing number of enterprises are collecting vast amounts of tracking data. To enable traceability over the entire life-cycle of items data has to be shared across independent and possibly competing enterprises. The need to simultaneously compete and cooperate requires a traceability system design that allows companies to share their traceability data while maintaining complete sovereignty over what is shared and with whom. Based on an extensive study of traceability applications, we introduce the formal concept of traceability networks and highlight the technical challenges involved in sharing data in such a network. To address these challenges, we present an innovative combination of query processing techniques from P2P networks and distributed as well as paralleldatabases with confidentiality enforcement techniques.
Earth science (ES) applications handle very large geospatial data sets and interactive response time is required by its query processing. Spatial selection is one of the very important basic operations for gee-spatial...
详细信息
ISBN:
(纸本)0769511538
Earth science (ES) applications handle very large geospatial data sets and interactive response time is required by its query processing. Spatial selection is one of the very important basic operations for gee-spatial databases. It retrieves all the objects that intersect with a given point or rectangle. This paper presents a novel approach for the parallel processing of spatial selection of very large geospatial databases using partitioned parallelism. To evaluate this approach, we use the Extended Sequoia 2000 benchmark, which has real world data and real queries. In addition, we use an actual object database management system, ShusseUo, which we developed previously. The experimental results of parallel processing of spatial selection show good speed-up.
High performance servers and high-speed networks will form the backbone of the infra-structure required for distributed multimedia information systems. Given that the goal of such a server is to support hundreds of in...
详细信息
ISBN:
(纸本)0818677937
High performance servers and high-speed networks will form the backbone of the infra-structure required for distributed multimedia information systems. Given that the goal of such a server is to support hundreds of interactive data streams simultaneously, various tradeoffs are possible with respect to the storage of data on secondary memory, and its retrieval therefrom. In this paper we identify and evaluate these tradeoffs. Ive evaluate the effect of varying the stripe factor and also the performance of batched retrieval of disk-resident data. We develop a methodology to predict the stream capacity of such a series The evaluation is done for both uniform and skewed access patterns. Experimental results on the Intel Paragon computer are presented.
Efficient execution of applications requires insight into how the system features impact the performance of the application. For distributedsystems, the task of gaining this insight is complicated by the complexity o...
详细信息
ISBN:
(纸本)0769507840
Efficient execution of applications requires insight into how the system features impact the performance of the application. For distributedsystems, the task of gaining this insight is complicated by the complexity of the system features. This insight generally results from significant experimental analysis and possibly the development of performance models. This paper presents the Prophesy project, an infrastructure that aids in gaining this needed insight based upon one's experience and that of others. The core component of Prophesy is a relational database that allows for the recording of performance data, system features and application details.
Most work on database integration has considered only support for data retrieval, not support for updates, and often the use for a special semantically rich data model has been required. The authors present an approac...
详细信息
ISBN:
(纸本)0818608935
Most work on database integration has considered only support for data retrieval, not support for updates, and often the use for a special semantically rich data model has been required. The authors present an approach to database integration which supports updates and which uses only the standard relational data model. Many of the ideas used in this approach are applicable to database integration in the context of other data models as well.
Detecting malware during execution using machine learning models presents some hard-to-solve problems relating to data set construction seldom discussed in the literature. We identify, name these problems and show our...
详细信息
ISBN:
(纸本)9781665432818
Detecting malware during execution using machine learning models presents some hard-to-solve problems relating to data set construction seldom discussed in the literature. We identify, name these problems and show our solutions to them in the form of Curator, a specialized distributed system for detonating potentially malicious programs, extracting behavior information, and correctly labeling said behavior to construct an accurate, consistent, and reliable data set. We demonstrate Curator's need by using generated data sets to train machine learning models based on Naive Bayes, Logistic Regression, and Random Forests. Our work is currently focused on the Windows operating system.
Normality, consitancy criteria stronger than sequentiality and equivalant to linearizability for the unary operations case, has the main advantage that it avoids the use of the "global real-time ordering". T...
详细信息
ISBN:
(纸本)0769517609
Normality, consitancy criteria stronger than sequentiality and equivalant to linearizability for the unary operations case, has the main advantage that it avoids the use of the "global real-time ordering". This work presents the first algorithm that implements normality without using strong communication primitives (i.e. atomic broadcast or global clock syncronization). Moreover, our implementation allows the dynamic changes of the system configuration, handles replication and refers the general case of multi-object operations. Although the use of terms as client or server our algorithm is entirely based on a peer-to-peer approach.
Vector prefix and reduction are collective communication primitives in which all processors must cooperate. We present two parallel algorithms, the direct algorithm and the split algorithm, for vector prefix and reduc...
详细信息
ISBN:
(纸本)0818684038
Vector prefix and reduction are collective communication primitives in which all processors must cooperate. We present two parallel algorithms, the direct algorithm and the split algorithm, for vector prefix and reduction computation on coarse-grained, distributed-memory parallel machines. Our algorithms are relatively architecture independent and can be used effectively in many applications such as Pack/Unpack, Array Prefix/Reduction Functions, and Array Combining Scatter Functions, which are defined in Fortran 90 and in High Performance Fortran. Experimental results on the CM-5 are presented.
暂无评论