OBJECTIVE Automatic therapeutic substitution (ATS) is a mechanism that, upon patient hospitalization, prompts the pharmacist to exchange an equivalent formulary drug for a nonformulary medication, typically without prescriber contact. In facilities utilizing ATS, there is the possibility that physicians and patients may be unaware of the substitution, potentially leading to drug-drug interactio...

Temporal logic of knowledge is a combination of temporal and epistemic logic that has been shown to be very useful in areas such as distributed systems, security, and multi-agent systems. However, the complexity of the logic can be prohibitive. We here develop a refined version of such a logic and associated tableau procedure with improved complexity but where important classes of specification...

Fully coherent searches (over realistic ranges of parameter space and year-long observation times) for unknown sources of continuous gravitational waves are computationally prohibitive. Less expensive hierarchical searches divide the data into shorter segments which are analyzed coherently, then detection statistics from different segments are combined incoherently. The novel method presented h...

• b b b Bonfim, S. Pizzini, K. Mackay, S. David, b A. Fontaine, b A. San Miguel, c J. P. Iti6, ~ M .Gauthier, d A. Polian d determines the evolution of interatomic distances with pressure. In the past, the study of single crystals was prohibitive due to the extremely small spot required. The dimensions of the GaSe crystal in this experiment were 100x 100x20 gm 3. GaSe belongs to the III-VI laye...

The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we propose a new parallel meta heuristic algorithm based on the Tabu Search (TS) for the resolution of the 0-1 MKP. We show that, in addition to reducing execution time, parallel processing can perform automatically and dynam...

Achieving joint objectives by teams of cooperative planning agents requires significant coordination and communication efforts. For a single-agent system facing a plan failure in a dynamic environment, arguably, attempts to repair the failed plan in general do not straightforwardly bring any benefit in terms of time complexity. However, in multi-agent settings the communication complexity might...

Large-scale text datasets have long eluded a family of particularly elegant and effective clustering methods that exploits the power of pair-wise similarities between data points due to the prohibitive cost, timeand space-wise, in operating on a similarity matrix, where the state-of-the-art is at best quadratic in time and in space. We present an extremely fast and simple method also using the ...

Using Euclidean constraints to model large 3D environment is made possible. This has been a challenging issue for many years. Using such knowledge, not only enlarges the number of feasible cases but it also provides perfect results, unreachable formerly. We deal with a limited set of constraints composed of incidence relations, parallelism, and orthogonality. Those knowledges are given manually...

There is a large class of applications in computational structural biology for which atomic-level representation is crucial for understanding the underlying biological phenomena, yet explicit atomic-level modeling is computationally prohibitive. Computational protein design, homology modeling, protein interaction prediction, docking and structure recognition are among these applications. Models...