نتایج جستجو برای: group model

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

2000
Achim Blumensath Erich Grädel

We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collection of automata. Moreover, they admit effective (in fact automatic) evaluation of all first-order queries. Therefore, automatic structures provide an interesting framework for extending many algorithmic and logical method...

2002
Jan-Peter Hazebrouck Franz-Josef Heinen

Abläufe in der Auftragsabwicklung. Zur Verkürzung der Abwicklungszeiten und um die Zusammenarbeit mit Kunden, Konsortialpartnern und Lieferanten zu verbessern führt die Ferrostaal neue internetbasierte Kommunikationsund Engineering-Verfahren ein. Wesentliche Bausteine sind hierbei das Projektmanagement, das Wissensmanagement, die Kollaborationsplattform und das kollaborative CAD sowie die Anbin...

2016
Yasir Iqbal Ronny Thomale Francesco Parisen Toldin Stephan Rachel Johannes Reuther

Yasir Iqbal, ∗ Ronny Thomale, † Francesco Parisen Toldin, ‡ Stephan Rachel, § and Johannes Reuther 4, ¶ Institute for Theoretical Physics and Astrophysics, Julius-Maximilians University of Würzburg, Am Hubland, D-97074 Würzburg, Germany Institut für Theoretische Physik, Technische Universität Dresden, D-01062 Dresden, Germany Dahlem Center for Complex Quantum Systems and Fachbereich Physik, Fre...

2003
Valeri Perminov

The problem of forest fire initiation were carried out, including development of a mathematical model for description of heat and mass transfer processes at crown forest fire initiation, taking into account the mutual influence of differences strata of forest. Mathematical model of forest fire was based on an analysis of experimental data and using concept and methods from reactive media mechan...

Journal: :CoRR 2007
Ayan Mahalanobis

The MOR cryptosystem [9] is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a p-group, a cryptosystem was built in [4]. It seems resoanable to assume the cryptosystem is as secure as the El-Gamal cryptosystem over finite fields. A natural question arises can one make a better cryptosystem using p-groups? In this paper we show that the answer is no.

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

the present research was conducted to explore the effect of employing two language teaching approaches, i.e. schema-based instruction (sbi) and translation-based instruction (tbi), on vocabulary knowledge, structure and reading comprehension ability of forty one female students learning english in grade one senior high school in rivash, kuhsorkh, iran. while sbi focuses on schemata, i.e. words ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان 1390

we commence by using from a new norm on l1(g) the -algebra of all integrable functions on locally compact group g, to make the c-algebra c(g). consequently, we find its dual b(g), which is a banach algebra so-called fourier-stieltjes algebra, in the set of all continuous functions on g. we consider most of important basic theorems about this algebra. this consideration leads to a rather com...

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

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