نتایج جستجو برای: realization constraint
تعداد نتایج: 115655 فیلتر نتایج به سال:
the present study was carried on to investigate the use of face-keeping strategies in reaction to complaints by male and female in two different cultures, persian and american english. to see if apology strategies are affected by cultural, contextual preferences and gender of interlocutors in two distinct languages of persian and american english. the hypotheses to be tested were 1) ifids, acce...
Electroweak baryogenesis could be very efficient at the end of an electroweakscale inflation. Reheating that followed inflation could create a highly nonequilibrium plasma, in which the baryon number violating transitions were rapid. In addition, the time-dependent motions of the scalar degrees of freedom could provide the requisite CP violation. If the final reheat temperature was below 100 Ge...
This paper addresses the problem of designing a submodule of a given system ofcommunicating I/O automata. The problem may be formulated mathematically by theequation (C||X)rA under the constraint IX=In, where C represents the specification of theknown part of the system, called the context, A represents the specification of the whole system,X represents the specification of the ...
BACKGROUND To increase the signal to noise ratio (SNR) and to suppress directional noise in front-end signal acquisition, microphone array technologies are being applied in the cochlear implant (CI). Due to size constraints, the dual microphone-based system is most suitable for actual application. However, direct application of the array technology will result in the low frequency roll-off prob...
We show that finding a graph realization with the minimum Randić index for a given degree sequence is solvable in polynomial time by formulating the problem as a minimum weight perfect b-matching problem. However, the realization found via this reduction is not guaranteed to be connected. Approximating the minimum weight b-matching problem subject to a connectivity constraint is shown to be NP-...
In some technological frameworks, such as Charge Routing Networks (CRN)... ............DA CAMBIARE .... In some technological frameworks, such as Charge Routing Networks (CRN), or fiber-optic filters, only positive state space realizations of digital signal processing algorithms, such as filters or control laws, can be implemented. On the other hand, the imposition of an a priori positivity con...
In some technologicalframe-works, such as Charge Routing Networks (CRNs) ,or fiber-optic filters, only positive state-space realizations of digital signal processing algorithms, such as filters or control laws, can be implemented. On the other hand, the imposition of an a priori positivity constraint on the processing algorithm is a too strong design limitation. For this reason, some authors st...
In some technological frame-works, such as Charge Routing Networks (CRNs), or fiber-optic filters, only positive state–space realizations of digital signal processing algorithms, such as filters or control laws, can be implemented. On the other hand, the imposition of an a priori positivity constraint on the processing algorithm is a too strong design limitation. For this reason, some authors s...
We present a verification methodology for cooperating traffic agents covering analysis of cooperation strategies, realization of strategies through control, and implementation of control. For each layer, we provide dedicated approaches to formal verification of safety and stability properties of the design. The range of employed verification techniques invoked to span this verification space in...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید