نتایج جستجو برای: regimental commander
تعداد نتایج: 1359 فیلتر نتایج به سال:
The Defense Advanced Research Projects Agency (DARPA) Real-time Adversarial Intelligence and Decision-making (RAID) program is investigating the feasibility of " reading the mind of the enemy " – to estimate and anticipate, in real-time, the enemy's likely goals, deceptions, actions, movements and positions. This program focuses specifically on urban battles at echelons of battalion and below. ...
In this paper, we establish the Černý-Pin conjecture for automata with the property that their transition monoid cannot recognize the language {a, b}∗ab{a, b}∗. For the subclass of automata whose transition monoids have the property that each regular J -class is a subsemigroup, we give a tight bound on lengths of reset words for synchronizing automata thereby answering a question of Volkov.
We study a model of species survival recently proposed by Michael and Volkov. We interpret it as a variant of empirical processes, in which the sample size is random and when decreasing, samples of smallest numerical values are removed. Micheal and Volkov proved that the empirical distributions converge to the sample distribution conditioned not to be below a certain threshold. We prove a funct...
Yuri Gaididei, ∗ Volodymyr P. Kravchuk, 2, † Franz G. Mertens, ‡ Oleksandr V. Pylypovskyi, § Avadh Saxena, ¶ Denis D. Sheka, ∗∗ and Oleksii M. Volkov †† Bogolyubov Institute for Theoretical Physics, 03143 Kyiv, Ukraine Leibniz-Institut für Festkörperund Werkstoffforschung, IFW Dresden, D-01171 Dresden, Germany Physics Institute, University of Bayreuth, 95440 Bayreuth, Germany Taras Shevchenko N...
A.A. Kim, M.G. Mazarakis, V.A. Sinebryukhov, B.M. Kovalchuk, V.A. Visir, S. N. Volkov, F. Bayol, A.N. Bastrikov, V. G. Durakov, S. V. Frolov, V.M. Alexeenko, D.H. McDaniel, W. E. Fowler, K. LeChien, C. Olson, W.A. Stygar, K.W. Struve, J. Porter, and R.M. Gilgenbach Institute of High Current Electronics, Russian Academy of Sciences, Tomsk 634055, Russia Sandia National Laboratories, Albuquerque,...
We introduce a simple technique for proving the transience of certain processes defined on the random tree G generated by a supercritical branching process. We prove the transience for once-reinforced random walks on G, that is, a generalization of a result of Durrett, Kesten and Limic [Probab. Theory Related Fields 122 (2002) 567– 592]. Moreover, we give a new proof for the transience of a fam...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید