Search results for "RDW"
showing 10 items of 1401 documents
Excel Table with differentially expressed genes parasite success and attack from Ant behaviour and brain gene expression of defending hosts depend on…
2019
Parasite success and attack no Attack
Reusability and modularity in transactional workflows
1997
Abstract Workflow management techniques have become an intensive area of research in information systems. In large scale workflow systems modularity and reusability of existing task structures with context dependent (parameterized) task execution are essential components of a successful application. In this paper we study the issues related to management of modular transactional workflows, i.e., workflows that reuse component tasks and thus avoid redundancy in design. The notion of parameterized transactional properties of workflow tasks is introduced and analyzed, and the underlying architectural issues are discussed.
Some recent contributions to routing and location problems
2003
CORAL 2003, a Conference on Routing and Location, washeld in Puerto de la Cruz (Tenerife, Spain) from February24–26, 2003. A wonderful place, close to the black sand ofthe beach, and a nice temperature welcomed a group ofsenior and young researchers from Canada, England,France, Germany, and Spain. Social activities were alsoprovided and sponsored by the Cabildo Insular de Tenerife(the local government) and TITSA (the public bus transpor-tation company on the island). The conference corre-sponded to the third annual meeting of a research project,funded by the Spanish Ministry of Science and Technology,developing a Decision Support System for Vehicle Routingand Facility Location Problems (SAD…
Probabilistic Logic under Coherence‚ Model−Theoretic Probabilistic Logic‚ and Default Reasoning in System P
2016
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model-theoretic probabilistic reasoning and to default reasoning in System P. In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System P. That is, we provide a new probabilistic semantics for System P, which neither uses infinitesimal probabilities nor atomic bound (or bi…
On new efficient algorithms for PIMC and PIMD
2002
Abstract The properties of various algorithms, estimators, and high-temperature density matrix (HTDM) decompositions relevant for path integral simulations are discussed. It is shown that Fourier accelerated path integral molecular dynamics (PIMD) completely eliminates slowing down with increasing Trotter number P . A new primitive estimator of the kinetic energy for use in PIMD simulations is found to behave less pathologically than the original virial estimator. In particular, its variance does not increase significantly with P . Two non-primitive HTDM decompositions are compared as well: one decomposition used in the Takahashi Imada algorithm and another one based on an effective propaga…
Random Slicing: Efficient and Scalable Data Placement for Large-Scale Storage Systems
2014
The ever-growing amount of data requires highly scalable storage solutions. The most flexible approach is to use storage pools that can be expanded and scaled down by adding or removing storage devices. To make this approach usable, it is necessary to provide a solution to locate data items in such a dynamic environment. This article presents and evaluates the Random Slicing strategy, which incorporates lessons learned from table-based, rule-based, and pseudo-randomized hashing strategies and is able to provide a simple and efficient strategy that scales up to handle exascale data. Random Slicing keeps a small table with information about previous storage system insert and remove operations…
Cylindrical optical microcavities: Basic properties and sensor applications
2011
Abstract A detailed theoretical analysis of the basic properties of whispering-gallery modes (WGM) of thin capillaries is presented. The sensitivity of the resonances, as well as the Q factor is analyzed as a function of the structural parameters of the capillary and the refractive index inside the capillary. A practical application where thin capillaries are used for the measurement of glucose concentration in water is presented as a chemical sensor demonstrator. A best sensitivity of 1.24 nm/% of glucose concentration in water is reported, which corresponds to more than 850 nm/RIU. Additionally, different experimental approaches are discussed to improve the sensitivity and the detection l…
Conceptual design of the TRACE detector readout using a compact, dead time-less analog memory ASIC
2015
[EN] The new TRacking Array for light Charged particle Ejectiles (TRACE) detector system requires monitorization and sampling of all pulses in a large number of channels with very strict space and power consumption restrictions for the front-end electronics and cabling. Its readout system is to be based on analog memory ASICs with 64 channels each that sample a View the MathML source window of the waveform of any valid pulses at 200 MHz while discarding any other signals and are read out at 50 MHz with external ADC digitization. For this purpose, a new, compact analog memory architecture is described that allows pulse capture with zero dead time in any channel while vastly reducing the tota…
A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem
2013
[EN] The min-max k -vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly service all the required edges in a windy graph. This is a very difficult problem, for which a branch-and-cut algorithm has already been proposed, providing good results when the number of vehicles is small. In this article, we present a branch-price-and-cut method capable of obtaining optimal solutions for this problem when the number of vehicles is larger for the same set of required edges. Extensive computational results on instances from the literature are presented.
Optimisation of direct digital frequency synthesisers based on CORDIC
2001
Methods to simplify digital frequency synthesizers based on the co-ordinate rotation digital computer (CORDIC) algorithm are presented. Application of these methods leads to performance enhancement, compared with the topologies previously proposed in the literature. For a given output precision, hardware resources are reduced and spur-free dynamic range is increased.