نتایج جستجو برای: job control
تعداد نتایج: 1391473 فیلتر نتایج به سال:
Job portal is considerably useful for both job seekers and employers. It enables job seekers to look for an employment, to advance their careers, or to market themselves. As for the employers, they can post vacant positions to be filled with suitable employees. A certain job portal received numerous complaints regarding its features that were unable to fulfill the users' needs. These complaints...
Intention der Fachgruppe: Software garantiert häufig direkt die Sicherheit für Menschen. Ada wird in internationalen Sicherheitsstandards empfohlen und unterstützt in einzigartiger Weise moderne Analyse, Design und Programmiermethoden und damit die Entwicklung großer zuverlässiger Software-Systeme. Die Fachgruppe will über die Konzepte von Ada und deren Bedeutung für die Softwaretechnologie inf...
"! #$ &% '( #*)+! " , #* " /.0 /1 23 4 " %5 " 6! 57 28 9 5 :# ) % ; <=) > " 9 )? .A@B CEDE ")? FG '+ 9 , H "232 ) #I J.K " L7M )4 * # I.4 # 9 ) %5 "%" 4 > 52 # =! A 9 ;HN# 4! "!M 4 %" = O PCEDK )? QFL 'R "2 1 2P ) # S.Q 5 * +2T " * %5 , ")A 9 #*7 # 5)U ! # " V * % " /.0 / 2W 0 5! 23 )A K7A.X > A 9# ) %Y23 " Z ") " 9 ")? I. 9# = ")? 23! #I # " V 5 *#* # 5)& [# ) 9 0 3 ? "23! 0 # 5) " )? U > " 91...
Let G be a finite abelian group and F a field such that char(F) 6 | |G|. Denote by FG the group algebra of G over F. A (semisimple) abelian code is an ideal of FG. Two codes I1 and I2 of FG are G-equivalent if there exists an automorphism ψ of G whose linear extension to FG maps I1 onto I2. In this paper we give a necessary and sufficient condition for minimal abelian codes to be G-equivalent a...
We study the existence of quasi-representations of discrete groups G into unitary groups U(n) that induce prescribed partial maps K0(C ∗(G)) → Z on the K-theory of the group C*-algebra of G. We give conditions for a discrete group G under which the K-theory group of the classifying space BG consists entirely of almost flat classes.
Zur Erinnerung: Der (damalige) Arbeitskreis Test, Analyse und Verifikation von Software (TAV) der Fachgruppe Softwaretechnik wurde durch Andreas Spillner und Peter Liggesmeyer im Juni 1991 ins Leben gerufen. Das 8. Treffen im Oktober 1995 war dann das Gründungstreffen der Fachgruppe TAV. Dieses Jahr nun konnte die FG TAV ein Jubiläum feiern, denn das 25. Treffen fand am 15. und 16. Februar 2007...
The Littelmann path model gives a realisation of the crystals of integrable representations of symmetrizable Kac-Moody Lie algebras. Recent work of Gaussent-Littelmann [GL] and others [BG] [GR] has demonstrated a connection between this model and the geometry of the loop Grassmanian. The alcove walk model is a version of the path model which is intimately connected to the combinatorics of the a...
Let G be a group with cyclic commutator subgroup of order p and F a field of characteristic p. We obtain the description of the group algebras FG of Lie derived length 3.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید