32 research outputs found
A primal-dual semidefinite programming algorithm tailored to the variational determination of the two-body density matrix
The quantum many-body problem can be rephrased as a variational determination
of the two-body reduced density matrix, subject to a set of N-representability
constraints. The mathematical problem has the form of a semidefinite program.
We adapt a standard primal-dual interior point algorithm in order to exploit
the specific structure of the physical problem. In particular the matrix-vector
product can be calculated very efficiently. We have applied the proposed
algorithm to a pairing-type Hamiltonian and studied the computational aspects
of the method. The standard N-representability conditions perform very well for
this problem.Comment: 24 pages, 5 figures, submitted to the Journal of Computational
Physic
The half-life of Fr in Si and Au at 4K and at mK temperatures
The half-life of the decaying nucleus Fr was determined in
different environments, i.e. embedded in Si at 4 K, and embedded in Au at 4 K
and about 20 mK. No differences in half-life for these different conditions
were observed within 0.1%. Furthermore, we quote a new value for the absolute
half-life of Fr of t = 286.1(10) s, which is of comparable
precision to the most precise value available in literature
Ambient-aware continuous care through semantic context dissemination
Background: The ultimate ambient-intelligent care room contains numerous sensors and devices to monitor the patient, sense and adjust the environment and support the staff. This sensor-based approach results in a large amount of data, which can be processed by current and future applications, e. g., task management and alerting systems. Today, nurses are responsible for coordinating all these applications and supplied information, which reduces the added value and slows down the adoption rate. The aim of the presented research is the design of a pervasive and scalable framework that is able to optimize continuous care processes by intelligently reasoning on the large amount of heterogeneous care data.
Methods: The developed Ontology-based Care Platform (OCarePlatform) consists of modular components that perform a specific reasoning task. Consequently, they can easily be replicated and distributed. Complex reasoning is achieved by combining the results of different components. To ensure that the components only receive information, which is of interest to them at that time, they are able to dynamically generate and register filter rules with a Semantic Communication Bus (SCB). This SCB semantically filters all the heterogeneous care data according to the registered rules by using a continuous care ontology. The SCB can be distributed and a cache can be employed to ensure scalability.
Results: A prototype implementation is presented consisting of a new-generation nurse call system supported by a localization and a home automation component. The amount of data that is filtered and the performance of the SCB are evaluated by testing the prototype in a living lab. The delay introduced by processing the filter rules is negligible when 10 or fewer rules are registered.
Conclusions: The OCarePlatform allows disseminating relevant care data for the different applications and additionally supports composing complex applications from a set of smaller independent components. This way, the platform significantly reduces the amount of information that needs to be processed by the nurses. The delay resulting from processing the filter rules is linear in the amount of rules. Distributed deployment of the SCB and using a cache allows further improvement of these performance results
A step counting hill climbing algorithm
This paper presents a new single-parameter local search heuristic named Step Counting Hill Climbing algorithm (SCHC). It is a very simple method in which the current cost serves as an acceptance bound for a number of consecutive steps. This is the only parameter in the method that should be set up by the user. Furthermore, the counting of steps can be organized in different ways; therefore the proposed method can generate a large number of variants and also extensions. In this paper, we investigate the behaviour of the three basic variants of SCHC on the university exam timetabling problem. Our experiments demonstrate that the proposed method shares the main properties with the Late Acceptance Hill Climbing method, namely its convergence time is proportional to the value of its parameter and a non-linear rescaling of a problem does not affect its search performance. However, our new method has two additional advantages: a more flexible acceptance condition and better overall performance. In this study we compare the new method with Late Acceptance Hill Climbing, Simulated Annealing and Great Deluge Algorithm. The Step Counting Hill Climbing has shown the strongest performance on the most of our benchmark problems used
RHAMM/HMMR (CD168) is not an ideal target antigen for immunotherapy of acute myeloid leukemia
A Semantic Driven Approach for Requirements Verification
Requirements Engineering (RE) is a key discipline for the success of software projects. Consistency, completeness, and accuracy are the requirements quality properties to be guaranteed by the verification task in RE. An overview of the actual trends in RE is briefly summarized, focusing more closely on the requirements verification quality properties. Completeness results is the most difficult property to guarantee. It is hard to capture the software behavior against the whole external context. In the last years, research has focused its attention to the application of semantic Web techniques to the different tasks of RE. The adoption of ontologies seems promising to achieve the proper level of formalism and to argue on quality properties. This paper presents a survey of the main concepts that need to be accounted for requirement verification, and proposes an ontological engineering approach to demonstrate the overlapping of requirements against the external context