Search results for " set"
showing 10 items of 2095 documents
Design methods of multithreaded architectures for multicore microcontrollers
2011
The development of electronic technology today has allowed the implementation of complex architectures, which led to the emergence of multicore processors technology. Multicore architectures are built from superscalar and multithreaded processors. Integrating new technologies in embedded applications requires the development of multicore processors that can be integrated into a smaller area like a classic microcontroller. These processors must manage fewer resources and be able to manage multiple tasks simultaneously. In this paper we present a method of modeling, simulation and evaluation of two multithreaded architectures with limited resources, which could be integrated into embedded sys…
Spectral evolution simulation on leading multi-socket, multicore platforms
2011
Spectral evolution simulations based on the observed Very Long Baseline Interferometry (VLBI) radio-maps are of paramount importance to understand the nature of extragalactic objects in astrophysics. This work analyzes the performance and scaling of a spectral evolution algorithm on three leading multi-socket, multi-core architectures. We evaluate three parallel models with different levels of data-sharing: a sharing approach, a privatizing approach and a hybrid approach. Our experiments show that the data-privatizing model is reasonably efficient on medium scale multi-socket, multi-core systems (up to 48 cores) while regardless algorithmic and scheduling optimizations, sharing approach is …
SWAPHI-LS: Smith-Waterman Algorithm on Xeon Phi coprocessors for Long DNA Sequences
2014
As an optimal method for sequence alignment, the Smith-Waterman (SW) algorithm is widely used. Unfortunately, this algorithm is computationally demanding, especially for long sequences. This has motivated the investigation of its acceleration on a variety of high-performance computing platforms. However, most work in the literature is only suitable for short sequences. In this paper, we present SWAPHI-LS, the first parallel SW algorithm exploiting emerging Xeon Phi coprocessors to accelerate the alignment of long DNA sequences. In SWAPHI-LS, we have investigated three parallelization approaches (naive, tiled, and distributed) in order to deeply explore the inherent parallelism within Xeon P…
The logic of the construction of rural politics: political discourses on rurality in norway
2009
Two competing discourses emerge from a careful reading of parliamentary debates in Norway on rural development. One regards rural values as intrinsic, while the other regards the rural as an actor ...
Internal Test Sets Studies in a Group of Antimalarials
2006
Topological indices have been applied to build QSAR models for a set of 20 an- timalarial cyclic peroxy cetals. In order to evalua te the reliability of the proposed linear models leave-n-out and Internal Test Sets (ITS) approaches have b een considered. The pro- posed procedure resulted in a robust and consensued prediction equation and here it is shown why it is superior to the employed standard c ross-validation algorithms involving multilinear regression models.
The European Union's Proposal for an International Investment Court: Significance, Innovations and Challenges Ahead
2016
International audience; Rampant discontent with the current system that governs the protection of international investment and the functioning of investment tribunals has led to a widespread view that there is an urgent need for reform. This is particularly pronounced in the context of investor-state dispute settlement (ISDS). The European Union (EU) has responded to this need by proposing the creation of an international investment court. With its political weight, the EU confers unprecedented legitimacy on the critics of the current ISDS system and reveals investment dispute settlement in the light of public international law, breaking with its background in commercial litigation. The art…
Rough Pragmatic Description Logic
2013
In this chapter, a rough description logic is built on the basis of a pragmatic standpoint of representation of knowledge. The pragmatic standpoint has influenced the acceptance of a broader definition of the semantic network than that appearing in the literature. The definition of the semantic network is a motivation of the introduced semantics of the language of the descriptive logic. First, the theoretical framework of representation of knowledge that was proposed in the papers [24,25] is adjusted to the description of data processing. The pragmatic system of knowledge representation is determined, as well as situations of semantic adequacy and semantic inadequacy for represented knowled…
Fuzzy Logic, Knowledge and Natural Language
2012
This is an introductive study on what Fuzzy Logic is, on the difference between Fuzzy Logic and the other many-valued calculi and on the possible relationship between Fuzzy Logic and the complex sciences. Fuzzy Logic is nowadays a very popular logic methodology. Different kinds of applications in cybernetics, in software programming and its growing use in medicine seems to make Fuzzy Logic, according to someone, the “new” logic of science and technology. In his enthusiastic panegyric of Fuzzy Logic, Kosko (1993) argues that after thirty years from the birth of this calculus, it is time to declare the new era of Fuzzy Logic and to forget the old era of classical logic. I think that this poin…
Theoretical rotational constants of MeCnN species
1990
Abstract By means of SCF HF “ab initio” calculations with STO-3G and 6-31G basis sets, the geometric parameters of methylcyanopolyynes (MeCnN n=3, 5, 7 and 9) have been obtained. B0=0.3748 GHz for MeC7N and B0=0.2708 GHz for MeC9N, with a STO-3G basis set, were obtained. Both species, unstable in the laboratory, are still undetected in the interstellar medium, although their existence is very probable.
Cooperative Inventory control
2005
In multi-retailer inventory control the possibility of sharing setup costs motivates communication and coordination among the retailers. We solve the problem of finding suboptimal distributed reordering policies that minimize setup, ordering, storage, and shortage costs incurred by the retailers over a finite horizon. Neuro-dynamic programming (NDP) reduces the computational complexity of the solution algorithm from exponential to polynomial on the number of retailers.