نتایج جستجو برای: adaptive matching circuit

تعداد نتایج: 406207  

2009
C. Kral

From the rating plate data of an induction motor the nominal efficiency can be determined. Without detailed knowledge of equivalent circuit parameters, partial load behavior cannot be computed. Therefore, a combined calculation and estimation scheme is presented, where the consistent parameters of an equivalent circuit are elaborated, exactly matching the nominal operating point. From these par...

2009
C. Kral C. Grabner

From the rating plate data of an induction motor the nominal efficiency can be determined. Without detailed knowledge of equivalent circuit parameters, partial load behavior cannot be computed. Therefore, a combined calculation and estimation scheme is presented, where the consistent parameters of an equivalent circuit are elaborated, exactly matching the nominal operating point. From these par...

2016
Xiongren Xiao Zheng Tian Cheng Xu Zhiqi Li Xiaodong Wang

Aiming at the trade-off between accuracy and efficiency in current local stereo matching, a fast stereo matching method based on adaptive window is proposed. The census transform combined with absolute differences (AD) is used for matching cost initialization. Then an iterative cost aggregation based on exponential step adaptive weight (ESAW) is adopted to improve the parallelism and execution ...

2013
M.Lakshmi Prasanna

Steganography is a method of hiding secret messages into a cover-media such that an unintended observer will not be aware of the existence of the hidden messages. The carrier of steganography can be various kinds of digital media such as image, audio, and video, etc. Digital images are widely transmitted over the Internet; therefore, they often serve as a carrier for covert communication. A goo...

2013

This supplement contains all necessary detailed proofs and a worst-case theoretical analysis in support of the main article. 7 Proof of theorem 1 Proof 1 In the first iteration, the algorithm is clearly solving Ĝ = argminG∈Gb h(G). Let G∗ = arg minG∈Gb s(G). Clearly, the number of stars is less than the Hamming distance s(G) ≤ h(G) for any G. Since Ĝ is the minimizer of h(G), we have h(Ĝ) ≤ h(G...

Journal: :The lancet. Psychiatry 2014
Oliver J Robinson Marissa Krimsky Lynne Lieberman Phillip Allen Katherine Vytal Christian Grillon

BACKGROUND We have delineated, across four prior studies, the role of positive dorsal medial prefrontal/anterior cingulate cortex (dmPFC/ACC)-amygdala circuit coupling during aversive processing in healthy individuals under stress. This translational circuit, termed the 'aversive amplification circuit', is thought to drive adaptive, harm-avoidant behavior in threatening environments. Here, in a...

2012
Xibing Li Jianjia Wang

To automatically detect SMT (surface mount technology) electronic modules, algorithms are investigated for geometry and shape features, module matching and detection in PCB (printed-circuit board) components. First, geometry and shape features of SMT electronic modules are presented. Then matching technology and process for SMT electronic modules are studied through optimization searching algor...

2002
B. A. Cetiner R. Coccioli B. Housmand Franco De Flaviis T. Itoh

A scalable lumped element equivalent circuit of a pre-matched, multifinger FET cell is proposed. The model is derived using a global modeling approach that exploits both circuit and full wave analysis, accounting for phase delay along gate and drain manifolds. The availability of such model is useful to perform fast performance analysis and optimization of the pre-matching network.

Journal: :Games and Economic Behavior 2009
Glenn Ellison Drew Fudenberg Lorens A. Imhof

This paper studies the effect of randomness in per-period matching on the long-run outcome of non-equilibrium adaptive processes. If there are many matchings between each strategy revision, the randomness due to matching will be small; our question is when a very small noise due to matching has a negligible effect. We study two different senses of this idea, and provide sufficient conditions fo...

2013
Krzysztof Choromanski Tony Jebara Kui Tang

The adaptive anonymity problem is formalized where each individual shares their data along with an integer value to indicate their personal level of desired privacy. This problem leads to a generalization of k-anonymity to the b-matching setting. Novel algorithms and theory are provided to implement this type of anonymity. The relaxation achieves better utility, admits theoretical privacy guara...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید