نتایج جستجو برای: constrained probability orbit

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

In a network that has the potential to block some paths, choosing a reliable path, so that its survival probability is high, is an important and practical issue. The importance of this issue is very considerable in critical situations such as natural disasters, floods and earthquakes. In the case of the reliable path, survival or blocking of each arc on a network in critical situations is an un...

A. Iranmanesh F. Bardestani

An algebraic construction for constant dimension subspace codes is called orbit code. It arises as the orbits under the action of a subgroup of the general linear group on subspaces in an ambient space. In particular orbit codes of a Singer subgroup of the general linear group has investigated recently. In this paper, we consider the normalizer of a Singer subgroup of the general linear group a...

2013
Juhyun Lee Jae Hong Lee

In this paper, the underlay cognitive relay network over double Rayleigh fading channels is investigated. For this network, we consider two cases: limited power case and unlimited power case. In the limited power case, the power of secondary user is constrained. On the other hand, the power of secondary user is not constrained in the unlimited power case. We derive the exact and approximate out...

2004
ALESSIA GUALANDRIS ANDREA POSSENTI

We explore the origin of the Galactic high latitude black hole X-ray binary XTE J1118+480, and in particular its birth location and the magnitude of the kick received by the black hole upon formation in the supernova explosion. Our analysis is constrained by the evolutionary state of the companion star, the observed limits on the orbital inclination, the Galactic position and the peculiar veloc...

Journal: :Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics 2000
Place Arrowsmith

Recent work on a symbolic approach to the calculation of probability distributions arising in the application of the Ott-Grebogi-Yorke strategy to transiently chaotic tent maps is extended to the case of control to a nontrivial periodic orbit. Closed forms are derived for the probability of control being achieved and the average number of iterations to control when it occurs. Both single-compon...

2009
URSULA HAMENSTÄDT

Let T (S) be the Teichmüller space of an oriented surface S of finite type. We discuss the action of subgroups of the mapping class group of S on the CAT(0)-boundary of the completion of T (S) with respect to the Weil-Petersson metric. We show that the set of invariant Borel probability measures for the Weil-Petersson flow on moduli space which are supported on a closed orbit is dense in the sp...

2008
Mathieu Sablik

We study the dynamics of the action of cellular automata on the set of shiftinvariant probability measures according two points of view. First, the robustness of the simulation of a cellular automaton on a random configuration can be viewed considering the sensitivity to initial condition in the space of shift-invariant probability measures. Secondly we consider the evolution of the quantity of...

Journal: :فیزیک زمین و فضا 0
محمدرضا سیف دانشجوی دکتری ژئودزی، گروه مهندسی نقشه¬برداری، پردیس دانشکده¬های فنی، دانشگاه تهران، ایران محمدعلی شریفی استادیار، گروه مهندسی نقشه¬برداری، پردیس دانشکده¬های فنی، دانشگاه تهران، ایران مسعود عباس هادی دانش آموخته کارشناسی ارشد ژئودزی، گروه مهندسی نقشه¬برداری، پردیس دانشکده¬های فنی، دانشگاه تهران، ایران

satellite orbit determination is a method of determining the state vector, i.e., position and velocity, of a low earth orbiting (leo) satellite or interplanetary spacecraft. during the past two decades, many satellites with various applications including geodetic applications have been launched at low altitudes. for instance, topex / poseidon, champ, grace and goce are the examples of the geode...

Journal: :IEEE Trans. Signal Processing 2015
Wei-Chiang Li Tsung-Hui Chang Chong-Yung Chi

This paper studies the coordinated beamforming (CoBF) design in the multiple-input single-output interference channel, assuming only channel distribution information given a priori at the transmitters. The CoBF design is formulated as an optimization problem that maximizes a predefined system utility, e.g., the weighted sum rate or the weighted max-min-fairness (MMF) rate, subject to constraint...

2013
David R. Easterling Layne T. Watson Naren Ramakrishnan M. Shahriar Hossain

Many algorithms for constrained clustering have been developed in the literature that aim to balance vector quantization requirements of cluster prototypes against the discrete satisfaction requirements of constraint (must-link or cannot-link) sets. A significant amount of research has been devoted to designing new algorithms for constrained clustering and understanding when constraints help cl...

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

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