نتایج جستجو برای: reduced trace

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

Journal: :wavelets and linear algebra 0
hossein momenaee kermani department of pure mathematics, faculty of mathematics and computer, shahid bahonar university of kerman

in this paper we study triangularization of collections of matrices whose entries come from a finite-dimensional division ring. first, we give a generalization of guralnick's theorem to the case of finite-dimensional division rings and then we show that in this case the reduced trace function is a suitable alternative for trace function by presenting two triangularization results. the firs...

In this paper we study triangularization of collections of matrices whose entries come from a finite-dimensional division ring. First, we give a generalization of Guralnick's theorem to the case of finite-dimensional division rings and then we show that in this case the reduced trace function is a suitable alternative for trace function by presenting two triangularization results. The first one...

2007
Predrag Cvitanović

Trace formulas relate short time dynamics (unstable periodic orbits) to long time invariant state space densities (natural measure). Higher dimensional dynamics requires inclusion of higherdimensional compact invariant sets, such as partially hyperbolic invariant tori, into trace formulas. A trace formula for a partially hyperbolic (N +1)-dimensional compact manifold invariant under a global co...

Journal: :Algorithms 2014
Antonella Santone Gigliola Vaglini

Temporal logic has become a well-established method for specifying the behavior of distributed systems. In this paper, we interpret a temporal logic over a partial order model that is a trace system. The satisfaction of the formulae is directly defined on traces on the basis of rewriting rules; so, the graph representation of the system can be completely avoided; moreover, a method is presented...

Journal: :Logical Methods in Computer Science 2017
David Baelde Stéphanie Delaune Lucca Hirschi

Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without replication) by means of symbolic execution and constraint solving. However, this does not suffice to obtain practical tools. Current prototypes suffer ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده ادبیات و علوم انسانی دکتر علی شریعتی 1392

هدف این مطالعه تعیین کردن این مساله است که آیا فراگیران فارسی زبان قادر به تطبیق پارامتری ضمیر موصولی that در جملات ساده و پیچیده ی انگلیسی در سایه اصل دستور جهانی هستند یا خیر. به علاوه نقش جنسیت در رابطه با آزمون تشخیص درستی یا نادرستی جملات دستوری مورد بررسی قرار گرفت. داده ها از 54 دانشجوی فراگیر زبان انگلیسی در دانشگاه فردوسی مشهد گردآوری شد. شرکت کنندگان در آزمون شامل 28 زن (51.85 درصد)و ...

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

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