A flexible and recoverable client/server database event notification system

A software architecture is presented that allows client application programs to interact with a DBMS server in a flexible and powerful way, using either direct, volatile messages, or messages sent via recoverable queues. Normal requests from clients to the server and replies from the server to clients can be transmitted using direct or recoverable messages. In addition, an application event notification mechanism is provided, whereby client applications running anywhere on the network can register for events, and when those events are raised, the clients are notified. A novel parameter passing mechanism allows a set of tuples to be included in an event notification. The event mechanism is particularly useful in an active DBMS, where events can be raised by triggers to signal running application programs. Received July 21, 1995 / Accepted May 30, 1996     

Multiple biological sequence alignment in heterogeneous multicore clusters with user-selectable task allocation policies

Multiple Sequence Alignment (MSA) is an important problem in Bioinformatics that aims to align more than two sequences in order to emphasize similarity regions. This problem is known to be NP-Hard, so heuristic methods are used to solve it. DIALIGN-TX is an iterative heuristic method for MSA that generates alignments by concatenating ungapped regions with high similarity. Usually, the first phase of MSA algorithms is parallelized by distributing several independent tasks among the nodes. Even though heterogeneous multicore clusters are becoming very common nowadays, very few task allocation policies were proposed for this type of architecture. This paper proposes an MPI/OpenMP master/slave parallel strategy to run DIALIGN-TX in heterogeneous multicore clusters, with several allocation policies. We show that an appropriate choice of the master node has great impact on the overall system performance. Also, the results obtained in a heterogeneous multicore cluster composed of 4 nodes (30 cores), with real sequence sets show that the execution time can be drastically reduced when the appropriate allocation policy is used.     

Controlling Spin Qubits in Quantum Dots

We review progress on the spintronics proposal for quantum computing where the quantum bits (qubits) are implemented with electron spins. We calculate the exchange interaction of coupled quantum dots and present experiments, where the exchange coupling is measured via transport. Then, experiments on single spins on dots are described, where long spin relaxation times, on the order of a millisecond, are observed. We consider spin-orbit interaction as sources of spin decoherence and find theoretically that also long decoherence times are expected. Further, we describe the concept of spin filtering using quantum dots and show data of successful experiments. We also show an implementation of a read out scheme for spin qubits and define how qubits can be measured with high precision. Then, we propose new experiments, where the spin decoherence time and the Rabi oscillations of single electrons can be measured via charge transport through quantum dots. Finally, all these achievements have promising applications both in conventional and quantum information processing. PACS: 03.67.Lx, 03.67.Mn, 73.23.Hk, 85.35.Be     

The Connectionist Inductive Learning and Logic Programming System

This paper presents the Connectionist Inductive Learning and Logic Programming System (C-IL²P). C-IL²P is a new massively parallel computational model based on a feedforward Artificial Neural Network that integrates inductive learning from examples and background knowledge, with deductive learning from Logic Programming. Starting with the background knowledge represented by a propositional logic program, a translation algorithm is applied generating a neural network that can be trained with examples. The results obtained with this refined network can be explained by extracting a revised logic program from it. Moreover, the neural network computes the stable model of the logic program inserted in it as background knowledge, or learned with the examples, thus functioning as a parallel system for Logic Programming. We have successfully applied C-IL²P to two real-world problems of computational biology, specifically DNA sequence analyses. Comparisons with the results obtained by some of the main neural, symbolic, and hybrid inductive learning systems, using the same domain knowledge, show the effectiveness of C-IL²P.     

Diagnosability of repairable faults

The diagnosis problem for discrete event systems consists in deciding whether some fault event occurred or not in the system, given partial observations on the run of that system. Diagnosability checks whether a correct diagnosis can be issued in bounded time after a fault, for all faulty runs of that system. This problem appeared two decades ago and numerous facets of it have been explored, mostly for permanent faults. It is known for example that diagnosability of a system can be checked in polynomial time, while the construction of a diagnoser is exponential. The present paper examines the case of transient faults, that can appear and be repaired. Diagnosability in this setting means that the occurrence of a fault should always be detected in bounded time, but also before the fault is repaired, in order to prepare for the detection of the next fault or to take corrective measures while they are needed. Checking this notion of diagnosability is proved to be PSPACE-complete. It is also shown that faults can be reliably counted provided the system is diagnosable for faults and for repairs.     

Supplementary anti-hepatitis C virus (HCV) testing with 2nd and 3rd generation recombinant immunoblot assay and matrix applied to enzyme immunoassay positive sera and comparison with HCV-RNA detection

Following the same general principles of its two predecessors in 1973 and 1986, the 1996 National Roadside Survey of weekend, nighttime drivers in the 48 contiguous states interviewed and breath tested over 6000 noncommercial four-wheel vehicle operators between September 6 and November 9, 1996. Results indicated that the total number of drinking drivers fell by about one-third between 1986 and 1996; however, there was no significant change in the number of drivers at blood alcohol concentrations (BACs) at or above 0.05. Compared to 1973, the proportion of women drivers on the roads during weekend nights has increased significantly. Moreover, relative to males, the proportion of female drivers who have been drinking has increased over the last decade. The number of drivers under the age of 21 with a BAC at or above 0.10 decreased significantly from 1986 to 1996.     

The development of drawing in children with congenital focal brain injury: evidence for limited functional recovery

Children with pre- or perinatal injury to right hemisphere (RH) brain regions show impairment of spatial integrative functions similar to that observed among adults with comparable injury. Unlike adults, children show considerable improvement with development on a range of spatial construction tasks which require spatial integration. Such gains could reflect true recovery of spatial integrative abilities. Alternatively, the improvement could be more limited in scope, reflecting the development of compensatory strategies which are task specific and allow the children to circumvent, rather than overcome, their primary spatial disorders. The studies presented here examined this distinction within the context of drawing tasks in which the child was first asked to draw a house and then an impossible house. The impossible house task was designed to examine the extent to which children rely on graphic formulas in generating organized drawings. The results showed that while all of the children with RH injury make considerable progress in free drawing into the school age period, they are very reliant on the use of graphic formulas. When given a task which requires them to alter their drawings, they did not change the spatial configuration of the depicted object. Rather they found alternate ways to render the object 'impossible'.