نتایج جستجو برای: prohibited by

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

Journal: :Proceedings in applied mathematics & mechanics 2023

We consider the problem of realigning a space telescope from one observation target to next in presence prohibited directions. More specifically, we want steer – modelled as gyrostat an initial attitude at rest final within fixed time interval. During motion, line sight must be kept away forbidden directions towards bright objects like sun, moon or earth due power thermal requirements. The kine...

Journal: :Clinical chemistry 2005
Hongwu Du Moutian Wu Weiping Yang Gu Yuan Yimin Sun Yuan Lu Shan Zhao Qingyun Du Jun Wang Sheng Yang Mangen Pan Ying Lu Shan Wang Jing Cheng

BACKGROUND Doping in sports has become a serious problem. Gas chromatography-mass spectrometry (GC-MS) serves as an effective reference method, but it is limited by low throughput and is therefore not suitable for large-scale screening. Use of protein chips for high-throughput screening of all athletes for prohibited substances could become an important complementary tool to GC-MS. METHODS We...

2007
MICHAEL I. NORTON SAMUEL R. SOMMERS SARA BRAUNER

The United States Supreme Court has restricted attorneys from considering the gender and race of potential jurors in their use of peremptory challenges—the practice by which jurors may be removed from a jury without explanation or evidence of potential bias. We propose that forbidding peremptories based on social category information not only fails to decrease biased jury selection, but also en...

2003
I N SUN R. O. C.

K e y w o r d s C r y p t o g r a p h y , Data security, Information theory, Secret sharing scheme. 1 . I N T R O D U C T I O N In 1987, I to et al. [1] desc r ibed a genera l m e t h o d of secret shar ing cal led Secret Sharing Scheme (SSS) which allows a m a s t e r key to be sha red among a finite set of p a r t i c i p a n t s in such a way t h a t on ly ce r ta in prespecif ied subse ts o...

1996
Lev Zakrevski Sharad Jaiswal Lev Levitin Mark Karpovsky

* This work has been supported by NSF grant MIP-9630096 Abstract In this paper we consider the problem of deadlock-free wormhole unicast routing in networks with irregular topologies. To prevent deadlocks, for each router some input/output pairs (turns) have to be prohibited. We analyze the problem of minimizing the number of prohibited turns for providing deadlock-free routing. A new algorithm...

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

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