A methodology for the monitoring of power system security, developed with emphasis on the efficient processing of large amounts of data gathered through communication channels in real time, is presented. The approach ...
详细信息
A methodology for the monitoring of power system security, developed with emphasis on the efficient processing of large amounts of data gathered through communication channels in real time, is presented. The approach is based on the adaptive pattern recognition concept and its implementation on paralleldistributed computational architectures of artificial neural networks. Clusterwise continuous associative maps are established through data self-organization encompassing a variety of system operating regimes and topological configurations of the transmission network. Accurate and very fast information retrieval characterizes the real-time behavior of the distributed information processing system.
This paper presents a new paradigm for replication. Its major goal is to achieve performance similar to systems that do not employ replication and, at the same time, to offer the availability benefits that result from...
详细信息
An adaptive cache coherence mechanism exploits semantic information about the expected or observed access behavior of particular data objects. The authors contend that, in distributed shared-memory systems, adaptive c...
详细信息
ISBN:
(纸本)0818620471
An adaptive cache coherence mechanism exploits semantic information about the expected or observed access behavior of particular data objects. The authors contend that, in distributed shared-memory systems, adaptive cache coherence mechanisms will outperform static cache coherence mechanisms. They have examined the sharing and synchronization behavior of a variety of shared-memory parallel programs. It is found that the access patterns of a large percentage of shared data objects fall into a small number of categories for which efficient software coherence mechanisms exist. In addition, the authors have performed a simulation study that provides two examples of how an adaptive caching mechanism can take advantage of semantic information.
The algebra of qualified relations proposed by Ceri and Pelagatti supports pruning of distributed database queries, minimizing the number of sites involved in evaluation. Domain interval typing in the framework of for...
详细信息
The algebra of qualified relations proposed by Ceri and Pelagatti supports pruning of distributed database queries, minimizing the number of sites involved in evaluation. Domain interval typing in the framework of formal type inference subsumes this approach, pruning not only unsatisfiable subqueries involving fragmentation predicates, but also unsatisfiable subqueries mentioning any relation attribute.< >
Semi-joins have been introduced to reduce the cost of processing distributed queries. The determine the optimal semi-join processing strategy, one must consider both the reduction effect and the transmission overhead....
详细信息
Semi-joins have been introduced to reduce the cost of processing distributed queries. The determine the optimal semi-join processing strategy, one must consider both the reduction effect and the transmission overhead. Researchers have studied the problem of finding the optimal semi-join strategies for processing tree queries. Although a number algorithms have been proposed, they either have a very high complexity or only solve special cases. It is conjectured that the tree query processing problem is inherently difficult. The author formally answers this question by proving it NP-hard.< >
The paper presents a new paradigm for replication. Its major goal is to achieve performance similar to systems that do not employ replication and, at the same time, to offer the availability benefits that result from ...
详细信息
The paper presents a new paradigm for replication. Its major goal is to achieve performance similar to systems that do not employ replication and, at the same time, to offer the availability benefits that result from replication. The paradigm contributes two mechanisms. The first mechanism is an extended location service, for which it uses a logically centralized implementation. In addition, it modifies the traditional transaction-processing mechanism to interact with the location service inexpensively during transaction execution. The second mechanism is a priority-based, preemptive concurrency control algorithm which allows locks to be synchronously acquired at only a single replica. In addition, the paradigm exhibits desirable availability characteristics, satisfies the one-copy serializability correctness criterion and is easy to implement. For these reasons it is presented as a basis for designing efficient and highly available distributeddatabases.< >
In many connectionist applications training datasets lie usually selected randomly from databases. Such datasets are not guaranteed to represent the entire task domain fairly, and there is often a requirement to pre-p...
详细信息
In many connectionist applications training datasets lie usually selected randomly from databases. Such datasets are not guaranteed to represent the entire task domain fairly, and there is often a requirement to pre-process the dataset for compression and normalization. ConSTrainer is a window-based toolkit dedicated to the task of collecting and optimizing datasets for training connectionist networks. One of the most important features of ConSTrainer is its support for optimizing and validating training datasets. Two types of optimization features are examined in this paper: malicious training vector detection, and dataset compression. This paper describes ConSTrainer's facilities for optimizing connectionist datasets and demonstrates their utilization in a non-trivial application for diagnostic decision support in Histopathology.< >
The paper proposes a scheme, dependency propagation algorithm (DPA), to analyze the parallelism of production systems, which have certain conflict resolution strategies. The scheme, based on a marked high-level Petri ...
详细信息
The paper proposes a scheme, dependency propagation algorithm (DPA), to analyze the parallelism of production systems, which have certain conflict resolution strategies. The scheme, based on a marked high-level Petri net, is to find out which rules can be executed in parallel without changing the semantics of OPS5-like production systems. This DPA uses explicit dependency, implicit dependency with degree 1 and dependency propagation to construct dependency matrix and parallel executable matrix. The high probability partitioning algorithm considering both load balance and maximal parallel execution uses a parallel executable matrix to map production rules into a multiprocessing system. The parallel execution model exploits not only parallel matching but also parallel firing. The initial results reveal that the performance of production systems is greatly improved.< >
In main memory systems recovery becomes more complex mainly due to the volatility of main memory and the elimination of the separation of data storage (disk) and data processing locations (main memory). In a disk base...
详细信息
In main memory systems recovery becomes more complex mainly due to the volatility of main memory and the elimination of the separation of data storage (disk) and data processing locations (main memory). In a disk based database system, it is the disk copy that represents the stable database restored after a system failure; but in MDBSs, the main memory copy of the database must be recovered. The paper discusses the recovery issues in MDBSs and presents a somewhat detailed performance study of two recovery algorithms, one using a shadow approach and the other update-in-place.< >
暂无评论