نتایج جستجو برای: od characterizable

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

Journal: :Theor. Comput. Sci. 1998
Rolf Niedermeier Peter Rossmanith

Hertrampf’s locally definable acceptance types show that many complexity classes can be defined in terms of polynomial time bounded NTM’s with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths etc. We introduce a modification of Hertrampf’s locally definable acceptance types which allows to get a larger number of characteriz...

1998
Rolf Niedermeier Peter Rossmanith

Hertrampf's locally de nable acceptance types show that many complexity classes can be de ned in terms of polynomial time bounded NTM's with simple local conditions on the nodes of its computation tree, rather than global concepts like number of accepting paths etc. We introduce a modi cation of Hertrampf's locally de nable acceptance types which allows to get a larger number of characterizable...

2016
Vladimir Kanovei

It is true in the Solovay model that every countable ordinal-definable set of sets of reals contains only ordinal-definable elements.

Journal: :CoRR 2012
Wei Mao Matthew Thill Babak Hassibi

It is well known that there is a one-to-one correspondence between the entropy vector of a collection of n random variables and a certain group-characterizable vector obtained from a finite group and n of its subgroups [1]. However, if one restricts attention to abelian groups then not all entropy vectors can be obtained. This is an explanation for the fact shown by Dougherty et al [2] that lin...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی خواجه نصیرالدین طوسی 1389

در این پایان نامه اثبات می کنیم تمام گروههای ساده ای که مرتبه آنها دقیقا توسط چهار عدد اول عاد می شود، بجز گروه ساده a_10 ،توسط مرتبه و الگوی درجه آنها سرشت پذیرند.و این نوع سرشت پذیری را od-سرشت پذیری می نامیم. بعلاوه od-سرشت پذیری گروه ساده (u-3(5 و گروههای وابسته به آن را مد نظر قرار می دهیم و اثبات میکنیم (u-3(5 و 2.(u-3(5 سرشت پذیر هستند در حالی که 3.( u-3(5سه مرتبه od-سرشت پذیر میباشد و د...

2002
Henning Fernau Agnes Radl

Function distinguishable languages were introduced as a new methodology of defining characterizable subclasses of the regular languages which are learnable from text. Here, we give details on the implementation and the analysis of the corresponding learning algorithms. We also discuss problems which might occur in practical applications.

Journal: :Australasian J. Combinatorics 2006
Ying Zhao Yejing Wang Jennifer Seberry

Some new amicable orthogonal designs of order 8 are found as part of a complete search of the equivalence classes for orthogonal designs OD(8; 1, 1, 1, 1), OD(8; 1, 1, 1, 4), OD(8; 1, 1, 2, 2), OD(8; 1, 1, 1, 2), OD (8; 1, 1, 2, 4), OD(8; 1, 1, 1, 3), OD(8; 1, 1, 2, 3), OD(8; 1, 1, 1, 5) and OD(8; 1, 1, 3, 3). 2000 Mathematics subject classification (Amer. Math. Soc.): 05B30, 15A36.

Journal: :Automatica 1986
Stephen Boyd S. S. Sastry

-Using Generalized Harmonic Analysis, a complete description of parameter convergence in Model Reference Adaptive Control (MRAC) is given in terms of the spectrum of the exogenous reference input signal. Roughly speaking, if the reference signal "contains enough frequencies" then the parameter vector converges to its correct value. If not, it converges to an easily characterizable subspace in p...

Journal: :Polish Journal of Cardio-Thoracic Surgery 2012

2010
DALIBOR DOLEŽAL

Fear of crime as a concept has been present in criminological literature for quite some time. Numerous researches have been undertaken in order to explain this phenomenon, but still, it remains unclear what exactly represents this concept. Because of this, the expert working in the Þ eld of crime prevention have been having difÞ culties in creating successful preventive programs of fear of crim...

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

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