نتایج جستجو برای: linear combination
تعداد نتایج: 839535 فیلتر نتایج به سال:
nowadays in trade and economic issues, prediction is proposed as the most important branch of science. existence of effective variables, caused various sectors of the economic and business executives to prefer having mechanisms which can be used in their decisions. in recent years, several advances have led to various challenges in the science of forecasting. economical managers in various fi...
A novel contact-first approach for III–V FinFETs and trigate MOSFETs is presented. In this process, the metal contact is sputtered on the as-grown semiconductor heterostructure, and the contact metal is used as a part of the fin dryetch mask. We demonstrate this technique in Mo/n+-InGaAs contact structures with fin widths in the range of 50 to 300 nm. We have measured contact resistance in the ...
It is shown how previously reported bond energy equations (Van Hooydonk, 1973) can be re generated starting from the assumptions (i) that the valence-orbital energy of an element in a bond can be expressed as a function of its occupancy number (Iczkowski-Margrave, 1961) and (ii) that the potential around an atom in a bond vanishes as soon as its valence orbital is doubly occupied (Ferreira, 19...
Describing the binding energy of both d and s valence electrons within the LCAO formalism, and by including repulsive Born-Mayer type interactions, we study the structural stability of the reconstructed and unreconstructed Pt(ll0) surfaces. Our main result is that amongst the various models for the (1 x2) reconstruction the “Bonzel-Ferrer” model is unfavoured, while the “missing-row” model seem...
The GVW algorithm, presented by Gao et al., is a signature-based algorithm for computing Gröbner bases. In this paper, a variant of GVW is presented. This new algorithm is called a monomial-oriented GVW algorithm or mo-GVW algorithm for short. The moGVW algorithm presents a new frame of GVW and regards labeled monomials instead of labeled polynomials as basic elements of the algorithm. Being di...
چکیده ندارد.
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted classes in which theestigateCede(ome)Tj 24.2204 0 Td y dominanc628041 0 Td (comple)T7112 0 Td ( 0 Td n)Tj 10937457 0 Tdis the atslaw78.6Tj -4Cede(ome)Tj 24.2204 0 Td y lar gxington,944j 47.215.9ominanc39040.0242 (c Td T 18...
Statistical methods for carrying out asymptotic inferences (tests or confidence intervals) relative to one or two independent binomial proportions are very frequent. However, inferences about a linear combination of K independent proportions L = Σβ(i)p(i) (in which the first two are special cases) have had very little attention paid to them (focused exclusively on the classic Wald method). In t...
A new, fast, spectrally selective steady-state free precession (SSFP) imaging method is presented. Combining k-space data from SSFP sequences with certain phase schedules of radiofrequency excitation pulses permits manipulation of the spectral selectivity of the image. For example, lipid and water can be resolved. The contrast of each image depends on both T1 and T2, and the relative contributi...
A well established technique to improve the classification performances is to combine more classifiers. However, the possible combination rules proposed up to now generally try to decrease the classification error rate, which is a performance measure not suitable in many real situations and particularly when dealing with two class problems. In this case, an effective instrument to analyze the d...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید