نتایج جستجو برای: k out of n sub systems
تعداد نتایج: 21408122 فیلتر نتایج به سال:
in this study reference as one of the five cohesive devices in the achievement of textuality in english and persian narrative/descripitive written texts is focused on and analysed . to do so , the theoretical framework elaborated by halliday and hasan (1976) and its version adapted by the writer to match the sub-types of reference in farsi are applied to the analysis of reference in english and...
The density (d), speed of sound (u) and electrolytic conductivity (Λ) for systems containing acetaminophen, ionic liquid {1-octyl-3-methyl imidazolium bromide, [OMIm] Br} and water have been measured at T = 293.15-308.15 K. The measured data have been applied to calculate, standard partial molar volume ( ), Hepler’s constant , apparent molar isentropic compressibility...
the purpose of the present study is to find out whether bilinguals of khuzestan-arab origin or monolinguals of iranian origin code-switch during learning or speaking english and which group is more susceptible to code-switch. to this end, the students of 24 classes from high schools and pre- university centers were screened out, and interviewed and their voices and code-switchings were recorded...
growing demands and requires of high data rate systems cause significant increase of high frequency systems for wideband communication applications. as mixers are one of the main blocks of each receivers and its performance has great impact on receiver’s performance; in this thesis, a new solution for ku-band (12-18 ghz) mixer design in tsmc 0.18 µm is presented. this mixer has high linearity a...
In this paper we study the steady state availability of main k-out-of-n: F and secondary subsystems having general repair time distribution. When more than k units of main subsystem fail, then the main subsystem shuts off the secondary subsystem. The life time distributions of the main units and that of secondary subsystem are exponentially distributed. A repair facility having single repairman...
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید