نتایج جستجو برای: max strongly top module
تعداد نتایج: 449007 فیلتر نتایج به سال:
This paper aims to improve the response performance of min-max modular classifier by a module selection policy for two-class classification during recognition. We propose an efficient base classifier selection algorithm. We show that the quadratic complexity of original min-max modular classifier can fall onto the level of linear complexity in the number of base-classifier modules for each inpu...
we have devided the thesis in to five chapters. the first recollects facts from purely algebraic theory of jordan algebras and also basic properties of jb and jb* - algebras which are needed in the sequel. in the second chapter we extend to jb* - algebras, a classical result due to cleveland [8]. this result shows shows the weakness of jb* - norm topology on a jb* - algebera. in chapter three, ...
In this paper we consider various encoding problems for range queries on arrays. In these problems, the goal is that the encoding occupies the information theoretic minimum space required to answer a particular set of range queries. Given an array A[1..n] a range top-k query on an arbitrary range [i, j] ⊆ [1, n] asks us to return the ordered set of indices {`1, ..., `k} such that A[`m] is the m...
A computational model of attention and situation awareness (SA) was developed and used to predict pilot errors in the task of taxiing from runway to terminal. The model incorporates a lowlevel perception/attention module and a higher-level belief-updating module. Attentional scanning is controlled by bottom-up and top-down processes, with the effectiveness of top-down guidance varying as a func...
Abstraction is key to understanding and reasoning about large computer systems. Abstraction is easy to achieve if the relevant data structures are disjoint, but rather difficult when they are partially shared, as is the case for concurrent modules. We present a program logic for reasoning abstractly about data structures that gives us a fiction of disjointness and permits compositional reasonin...
Abstraction is key to understanding and reasoning about large computer systems. Abstraction is simple to achieve if the relevant data structures are disjoint, but rather difficult when they are partially shared, as is often the case for concurrent modules. We present a program logic for reasoning abstractly about data structures that provides a fiction of disjointness and permits compositional ...
Machine learning models based on convolutional neural networks have been used for predicting space groups of crystal structures from their atomic pair distribution function (PDF). However, the PDFs to train model are calculated using a fixed set parameters that reflect specific experimental conditions, and accuracy when given generated with different choices these is unknown. In this paper, we ...
A portable thermal chamber with a volume of only 2.5 l capable of reaching temperatures over the −5C to 70C range was designed and constructed. In order to make the thermal chamber lightweight and portable, two series connected thermoelectric modules were used as actuators since their size and performance characteristics allow the portability and precise temperature control. The PID control pro...
Given a graph G, a subset M of V (G) is a module of G if for each v ∈ V (G) ∖M , v is adjacent to all the elements of M or adjacent to none of them. For instance, V (G), ∅ and {v} (v ∈ V (G)) are modules of G called trivial. Given a graph G, ωM(G) (respectively αM(G)) denotes the largest integer m such that there is a module M of G which is a clique (respectively a stable) set in G with ∣M ∣ = ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید