نتایج جستجو برای: very highly suitable
تعداد نتایج: 1281925 فیلتر نتایج به سال:
Since electronic commerce transaction are characterised by their highly communicative character, the Language-Action-perspective proves to be very suitable to provide a deep-structure analysis because it concentrates on the essential aspects of an electronic commerce transaction rather than the form. In this paper, we present a layered pattern definition language, based on various L/A-perspecti...
A new multiphase sinusoidal oscillator is presented. The circuit realization uses the four-terminal floating nullor(FTFN)to generate arbitrary n current sinusoidal signals equally spaced in phase. The proposed circuit consists of n CCCIIs, n grounded capacitors and 2n grounded resistors. The oscillation condition and oscillation frequency are independently controlled. The former depends on the ...
In this paper, we propose an incremental classification algorithm which uses a multi-resolution data representation to find adaptive nearest neighbors of a test point. The algorithm achieves excellent performance by using small classifier ensembles where approximation error bounds are guaranteed for each ensemble size. The very low update cost of our incremental classifier makes it highly suita...
This work presents a method of computing Voigt functions and their derivatives, to high accuracy, on a uniform grid. It is based on an adaptation of Fourier-transform based convolution. The relative error of the result decreases as the fourth power of the computational effort. Because of its use of highly vectorizable operations for its core, it can be implemented very efficiently in scripting ...
A straightforward efficient computer algorithm for synthesizing multiple-output NAND (NOR) switching networks is presented which takes practical fan-in and fan-out limitations of logic gates into account. The algorithm is highly iterative and hence is very suitable for realizing large-size switching functions by a digital computer. The algorithm has been programmed in Fortran and a great deal o...
Differential evolution (DE) is an efficient populational meta-heuristic optimization algorithm that has been applied to many difficult real world problems. Due to the relative simplicity of its operations and real encoded data structures, it is very suitable for a parallel implementation on multicore systems and on the GPUs that nowadays reach peak performance of hundreds and thousands of giga ...
The increasing complexity of (distributed) information systems requires new solutions for dealing with access control problems. In particular, information systems are based on a large number of resources, with very complex structure, that must be accessed by a large variety of users. Traditional and instance based solutions are not adequate. In this paper, we propose a new approach to the probl...
For attribute data with (very) low rates of defectives, attractive control charts can be based on the maximum of subsequent groups of r failure times, for some suitable r ≥ 1, like r = 5. Such charts combine good performance with often highly needed robustness, as they allow a nonparametric adaptation already for Phase I samples of ordinary size. In the present paper we address the problem of e...
This paper introduces a new approach to morpho-syntactic analysis through Humor 99 (High-speed Unification Mo.rphology), a reversible and unification-based morphological analyzer which has already been integrated with a variety of industrial applications. Humor 99 successfully copes with problems of agglutinative (e.g. Hungarian, Turkish, Estonian) and other (highly) inflectional languages (e.g...
The identification and study of protein's function in several model organisms is carried out using both nuclear and cytoplasmic extracts. For a long time, Drosophila's embryos have represented the main source for protein extractions, although in the last year, the importance of collecting proteins extracts also from larval tissues has also been understood. Here we report a very simple protocol,...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید