Compounds I, II and III, were used as models resembling gear systems (bods connecting CR3 groups to the skeletal molecule are parallel) in surveying the potential energy surface for their internal rotation. The magnitude of the barriers calculated for averaging the NMR signals, placed these compounds in the range of measurement accessible by dynamic NMR spectroscopy (which is cur...

Fluid-based network traffic models are attractive due to their execution efficiency. They run much faster than the corresponding discrete-event packet-oriented simulation, especially when we study the aggregate traffic behavior of large-scale network scenarios. The efficiency, however, comes at a cost—fluid modeling does not include packet-level details. The ability to accurately capture the in...

Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicability, despite recent impressive gains in performance, remains limited. One way to deal with limitations of answer-set programming is to exploit parallelism. In this paper, we design and implement a parallel algorithm, par...

In the 1980s it was believed computer performance was best improved by creating faster and more e cient processors. This idea was challenged by parallel processing, which in essence means linking together two or more computers to jointly solve a computational problem. Since the early 1990s there has been an increasing trend to move away from expensive and specialized proprietary parallel superc...

This paper overviews a proposed architecture for adaptive parallel logic referred to as ASOCS (Adaptive Self-Organizing Concurrent System). The ASOCS approach is based on an adaptive network composed of many simple computing elements which operate in a parallel asynchronous fashion. Problem specification is given to the system by presenting if-then rules in the form of boolean conjunctions. Rul...

The need to quickly locate, gather, and store the vast amount of material in the Web necessitates parallel computing. In this paper, we propose two models, based on multi-constraint graph-partitioning, for efficient data-parallel Web crawling. The models aim to balance the amount of data downloaded and stored by each processor as well as balancing the number of page requests made by the process...