| Sample search results for: a-i showed severe |
| 1 | Eigenvalue inclusion regions from inverses of shifted matrices | ||
|
Summary: ) The following theorem shows that this inclusion is in fact an equality. 4 #12;Theorem 3 (A) = C \(A) 1 W((A - I... )-1) + . Proof: Suppose we have z C \(A). We still need to show that z / 1 W((A - I)-1) + for some... ,j(A). Similar to Proposition 4, the sets ... |
|||
|
Source: Eindhoven, Technische Universiteit - Department of Mathematics and Computing Science, Analysis Section |
|||
|
Collection: Engineering |
|||
| 2 | ccsd-00004069,version1-25Jan2005 Hopf Structure and Green Ansatz of | ||
|
Summary: algebra generated by the creation a+i and annihilation a- i operators for i = 1, . . . , n subject... to the relations [[a+i , a- j ], a+k ] = 2k j a+i [[a+i , a+j ], a+k ] = 0 [[a+i , a- j ], a- k ] = -2i ka- j [[a... are ... |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 3 | Mathematical Research Letters 8, 1-10 (2001) INFINITE TOWERS OF TREE LATTICES | ||
|
Summary: for many helpful discussions and suggestions. §1. The setting An edge-indexed graph (A, i) consists... to an edge-indexed graph I(A) = (A, i) whose indices are the indices of the edge-groups as subgroups... an edge-indexed graph (A, i), a graph of groups A such that ... |
|||
|
Source: Carbone, Lisa - Department of Mathematics, Rutgers University |
|||
|
Collection: Mathematics |
|||
| 4 | Generalized Index-Set Splitting Christopher Barton1 | ||
|
Summary: et al. for(i=0; i<100; i++) { if(i < m) A[i] = A[i] * 2; else A[i] = A[i] * 5; B[i] = A[i]*A[i... ]; } for(i=0; i |
|||
|
Source: Amaral, José Nelson - Department of Computing Science, University of Alberta |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 5 | Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing | ||
|
Summary: of a target in camera A is denoted by xA,i t , where i = 1, ..., M is the index of targets, and t is the time... index. We denote the image observation of xA,i t by zA,i t , the set of all states up to time t by xA,i... 0:t , where xA,i 0 is the initial- ization prior, and the set of all ... |
|||
|
Source: Schonfeld, Dan - Department of Electrical and Computer Engineering, University of Illinois at Chicago |
|||
|
Collection: Physics ; Computer Technologies and Information Sciences |
|||
| 6 | Eigenvalue inclusion regions from inverses of shifted matrices | ||
|
Summary: theorem shows that this inclusion is in fact an equality. Theorem 2 (A) = C \(A) 1 W((A - I)-1) + . Proof... : Suppose we have z C \(A). We still need to show that z / 1 W((A - I)-1) + for some choice of C \(A... ) and 1/K((A-I)-1 ) avoid , as ... |
|||
|
Source: Hochstenbach, Michiel - Wiskunde en Informatica, Technische Universiteit Eindhoven |
|||
|
Collection: Mathematics |
|||
| 7 | A Reverse Holder Type Inequality for the Logarithmic Mean | ||
|
Summary: ). If # is convex (g(A n ) - g(A 0 )) # # f(A n ) - f(A 0 ) g(A n ) - g(A 0 ) # # n # i=1 (g(A i ) - g(A i-1... )) # # f(A i ) - f(A i-1 ) g(A i ) - g(A ... |
|||
|
Source: Heidel, Jack - Department of Mathematics, University of Nebraska-Omaha |
|||
|
Collection: Mathematics |
|||
| 8 | Journal of Pure and Applied Algebra 199 (2005) 219234 www.elsevier.com/locate/jpaa | ||
|
Summary: up several times in the proof and it is worthwhile to give it its own name. A general A/I (again... and since A is a flat B-module, we have that (NiBA)/(Ni-1BA) = (Ni/Ni-1)BA = B/nBA = TG. This shows that A/I... A- modules. The proof shows that in this case MI /mMI is the graded dual of ... |
|||
|
Source: Linder, Tamás - Department of Mathematics and Statistics, Queen's University (Kingston) |
|||
|
Collection: Engineering |
|||
| 9 | LOWDIMENSIONAL UNITARY REPRESENTATIONS OF B 3 Abstract. We characterize all simple unitarizable representations of the braid | ||
|
Summary: , multiplying by e A,i on the left and by e A,j on the right shows # ij e A,i e B,1 e A,j = 0. But e B,1 e A,i e... by a simple computation, we will show the details for only one: (1) (e A,i e A,j ) = (e A,j )(e A,i ). (2... , B}. That is, e ... |
|||
|
Source: Tuba, Imre - Department of Mathematics and Statistics, San Diego State University |
|||
|
Collection: Mathematics |
|||
| 10 | An extension of Kleene's and Ochma'nski's theorems to infinite traces 1 | ||
|
Summary: defined. Now we show that \Lambda is injective. Let t 1 ; t 2 2 M 1 (A; I). Suppose that \Gamma D (t i... verification shows that if ¸w and ¸ t verify (1) then the mapping \Psi : A \Lambda =¸w \Gamma! M(A; I... We shall show that 3 I (j 1 ; j ... |
|||
|
Source: Ecoles Normales Supérieures de Cachan, Laboratoire Spécification et Vérification |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 11 | IMO 2007, Problem 1 Tom Verhoeff | ||
|
Summary: real numbers, ( i :: |x.i - a.i|) d 2 . (1) (b) Show that there is an ascending sequence x of n real... ) is to prove (1), which can be restated as ( i :: |x.i - a.i| d/2) (4) The definition of d involves several... numbers with ( i :: |x.i - a.i|) = d 2 . (2) Note the different ranges ... |
|||
|
Source: Verhoeff, Tom - Wiskunde en Informatica, Technische Universiteit Eindhoven |
|||
|
Collection: Computer Technologies and Information Sciences ; Multidisciplinary Databases and Resources |
|||
| 12 | Excision in the cohomology of Banach algebras with coefficients in dual | ||
|
Summary: ) . . . . To show this one can define, for n 0, the bounded linear operators: Ln :A hA((A+/I) ^(n+2) , (X/IX) ) Cn... A A/I 0 such that I has a bounded approximate identity and for every Banach A-bimodule X such that IX... (A, X) Hn(A/I, X/IX) Hn-1(I, IX) . . . and continuous cohomology groups · · ... |
|||
|
Source: White, Michael C. - School of Mathematics and Statistics, University of Newcastle upon Tyne |
|||
|
Collection: Mathematics |
|||
| 13 | Three States and a Plan: The A.I. of F.E.A.R. 1 Game Developers Conference 2006 | ||
|
Summary: in the GOAP working group of the A.I. Interface Standards Committee [AIISC]. We made several changes in order... Three States and a Plan: The A.I. of F.E.A.R. 1 Game Developers Conference 2006 Three States... and a Plan: The A.I. of F.E.A.R. Jeff Orkin Monolith Productions / M.I.T. Media Lab, Cognitive ... |
|||
|
Source: Massachusetts Institute of Technology (MIT), Media Laboratory, Software Agents Group |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 14 | Solutions, exercises in Chapter 8 April 12, 2009 | ||
|
Summary: in A. For any a, b L {} define a b iff a = b or a < b and [a, b) I or b < a and [b, a) I. Show... ) I. So is transitive. To show that A/I is isomorphic to Intalg(X\{}) we will apply Exercise E3... is an ideal in A. By Theorems 7.9 and 7.10, |A/I| = ... |
|||
|
Source: Monk, Don - Department of Mathematics, University of Colorado at Boulder |
|||
|
Collection: Mathematics |
|||
| 15 | PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | ||
|
Summary: Ji:L---+L~, and we denote afIJi by a(i) and afIJi by a(i) for each a E L. We say that aU) is proper if aU) ELi... ' that is, if a(i) ~Ob' and similarly a(i) is proper if a(i) ELi' that is, if a(i) ~ 1b. Observe that if... , under the convention of [1], ... |
|||
|
Source: Gratzer, George - Department of Mathematics, University of Manitoba |
|||
|
Collection: Mathematics |
|||
| 16 | Marek Balcerzak, Institute of Mathematics, # Lodz Technical University, | ||
|
Summary: representation. We compare inner MBrepresentability of #A, I# with several proper ties of #A, I# considered... )# for some F # A. By [BBRW, prop. 1.2] to prove that S(A \ I) = S(F) it is enough to show that the families... ... |
|||
|
Source: Ciesielski, Krzysztof Chris - Department of Mathematics, West Virginia University |
|||
|
Collection: Mathematics |
|||
| 17 | Marek Balcerzak, Institute of Mathematics, Lodz Technical University, al. Politechniki 11, I-2, 90-924 Lodz, Poland, and Faculty of Mathematics, | ||
|
Summary: -representability of A, I with several proper- ties of A, I considered by Baldwin. We show that A is inner MB... .2] to prove that S(A \ I) = S(F) it is enough to show that the families A \ I and F are ... |
|||
|
Source: Ciesielski, Krzysztof Chris - Department of Mathematics, West Virginia University |
|||
|
Collection: Mathematics |
|||
| 18 | Stretched m-primary ideals Maria Evelina Rossi Giuseppe Valla | ||
|
Summary: example shows that, in the above theorem, the condition < h+1-(A/I) cannot be relaxed. 13 #12;Example 2... + I2/(xA : I2) I = K - 3 and the conclusion follows. The following example show that the bound given... be written as e(I) = (I/I2 ) - (d - 1)(A/I) + K - ... |
|||
|
Source: Rossi, Maria Evelina - Dipartimento di Matematica, Università degli Studi di Genova |
|||
|
Collection: Mathematics |
|||
| 19 | w\Delta\Theta\Lambda\Xi\Pi\Sigma\Upsilon\Phi\Omega fffi flffiij `' ae/!'' #$%&' ()+,. /012 345!yA---Faculty of Informatics | ||
|
Summary: i , j), we can easily emulate his attack by s # a i ! s(a i , j) # (remember that s(a i , j... ) is the j th a i successor of s). The defender's response t a i ! t(a i , #) is emulated by t # a i ! t(a ... |
|||
|
Source: Ìayr, Richard - School of Informatics, University of Edinburgh |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 20 | TREE LATTICE SUBGROUPS LISA CARBONE, LEIGH COBBS AND GABRIEL ROSENBERG | ||
|
Summary: -lattices ( , ) with , starting from `edge- indexed graphs' (A , i ) and (A, i) which correspond to the edge-indexed quotient... a pair of X-lattices ( , ) with , starting from `edge-indexed graphs' (A , i ) and (A, i) ... |
|||
|
Source: Carbone, Lisa - Department of Mathematics, Rutgers University |
|||
|
Collection: Mathematics |
|||
| 21 | Why is Simulation Harder Than Bisimulation? Antonn Kucera #1 and Richard Mayr 2 | ||
|
Summary: i , j), we can easily emulate his attack by s # a i # s(a i , j) # (remember that s(a i , j... ) is the j th a i successor of s). The defender's response t a i # t(a i , #) is emulated by t # a i # t(a ... |
|||
|
Source: Ìayr, Richard - School of Informatics, University of Edinburgh |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 22 | Correlated Equilibria in Graphical Games Sham Kakade | ||
|
Summary: conditional ex pectation property. Let P ja i #17; Pr ~ A#24;P [A1 ; :::; An jA i = a i ] denote... the conditional distribution over actions given the event that A i = a i . Let ~a[i : b] be the vector ~a... is a distribution P (~a) over actions satisfying 8i 2 f1; :::; ng; 8a i ; a 0 ... |
|||
|
Source: Plotkin, Joshua B. - Department of Biology, University of Pennsylvania |
|||
|
Collection: Biology and Medicine |
|||
| 23 | Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components | ||
|
Summary: is said to be Parter (resp. neutral, downer) if the multiplicity of as an eigenvalue of A(i) is one more... observed. Examples are given. 1 Introduction Throughout, A will be an n-by-n Hermitian matrix and A(i) its... . Because of the interlacing inequalities [HJ, Ch. 4], |mA() - mA(i)()| 1, and all 3 values of mA() - ... |
|||
|
Source: Sutton, Brian - Department of Mathematics, Randolph-Macon College |
|||
|
Collection: Mathematics |
|||
| 24 | A Structured Synchronization and Communication Model Fitting Irregular Data Accesses \Lambda | ||
|
Summary: computes S from local data and sends it to index 2. Index 2 receives it and adds it to A[i]. Each task... S from T his \Gamma 1 into R; (0; 0)(0; 2i + 1)(0; 0) A[i] := A[i] +R; (0; 0)(0; 2i + 1)(0; 0) end; (0; 0... of clarity, we focus on a subclass of sequential programs called simple programs. 16 #12; for i = 1 to N do ... |
|||
|
Source: Melin, Emmanuel - Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 25 | Global Roundings of Sequences Benjamin Doerr | ||
|
Summary: ) and = k #3;. We show that 1 < P i2[k] (a i b i ) #20; for all k 2 [n], which implies b = rd(a; k #3... ) such that the rounding error j P i2I (a i b i )j is less than one in all intervals I #18; f1; : : : ; ng. We give... @numerik.uni-kiel.de 1 #12; put disc(a; b) = max I j P ... |
|||
|
Source: Doerr, Benjamin - Max-Planck-Institut für Informatik |
|||
|
Collection: Mathematics |
|||
| 26 | Bayesian Network Classification with Continuous Attributes: Getting the Best of Both Discretization and Parametric Fitting | ||
|
Summary: ) for each joint value of its parents. Standard arguments (e.g., see [1]) show that we can rewrite S(A i j Pa(A... in these instances of the data where Pa(A i ) take a particular value. Standard arguments also show that we maximize... , that is, ... |
|||
|
Source: Friedman, Nir - School of Computer Science and Engineering, Hebrew University of Jerusalem |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 27 | Bayesian Network Classification with Continuous Attributes: Getting the Best of Both Discretization and Parametric Fitting | ||
|
Summary: ) for each joint value of its parents. Standard arguments (e.g., see [1]) show that we can rewrite S(A i j Pa(A... in these instances of the data where Pa(A i ) take a particular value. Standard arguments also show that we maximize... , that is, ... |
|||
|
Source: Lee, Thomas J. "Tom" - Artificial Intelligence Center, SRI International |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 28 | Locating Restricted Facilities on Binary Maps Mugurel Ionut Andreica, Politehnica University of | ||
|
Summary: : +++++ ++ ++ == = otherwise1)},j1,SQ(i1),jSQ(i,j),1,min{SQ(i1 j))A(i,1)j1,(A(i orj))A(i,1)j(A(i,orj))A(i,j)1,(A(iif1, n... with the upper right corner at (i,j): +++++ ++ =+=+ == = otherwise1)},j1,CB(i1),jCB(i,j),1,min{CB(i1 j))A(i... ,1)j1,(A(i ... |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 29 | The Least Hoffman's Error Bound for Linear Inequality System | ||
|
Summary: (u). (d) su + t0eu 2 ext(St0) 8t02 (0, fi). To show (a), suppose to the contrary that E* 6= span {a*i: i... Abstract Let E be a normed space, a*1, . .,.a*m2 E*, c1, . .,.cm 2 R and S = {x 2 E|<a*i, x... > - ci 0, 1 i m} 6= ;. Let o* = inf{o 0 : dist(x, S) ... |
|||
|
Source: Ng, Kung Fu - Department of Mathematics, Chinese University of Hong Kong |
|||
|
Collection: Mathematics |
|||
| 30 | Dynamical evolution of RayleighTaylor and RichtmyerMeshkov mixing fronts Baolian Cheng | ||
|
Summary: . #4# to obtain t ##t 0 ## 1 2a i ln # 1#a i #V i ### f i0 1#a i #V i ## , #6# where f i0 #(1#a i #V i0... # #)/(1#a i #V i0 # #) , #V i0 # ###V i #(t 0 #)#, and t 0 ##t#(t#t 0 ) are ... |
|||
|
Source: New York at Stoney Brook, State University of - Department of Applied Mathematics and Statistics |
|||
|
Collection: Mathematics |
|||
| 31 | DEGREE SEMIGROUP AND THE ABHYANKAR-MOH-SUZUKI S. VENEREAU | ||
|
Summary: has, by definition, deg a ki+1 (i) = ki+1 deg a(i) deg K[a]<(i) but one can even show that this holds... denote by K[a] the subspace K + Ka + Ka2 + · · · + Kai-1 . 3. -sequences Definition. Let D0 D... in particular #deg K[a] <i = i i = 1, · · · , ... |
|||
|
Source: Basel, Universität - Departement Mathematik |
|||
|
Collection: Mathematics |
|||
| 32 | Role of the anterior insula in task-level control and focal attention Steven M. Nelson Nico U. F. Dosenbach | ||
|
Summary: or sensation, showed the aI and dorsal anterior cingulate cortex (dACC) to be most commonly activated across... /event-related fMRI data from 10 different tasks (Dosenbach et al. 2006), and found that the bilateral aI showed... , maintenance and errors). These rs-fcMRI analyses also showed ... |
|||
|
Source: Washington University in St. Louis, Department of Psychology, Cognitive Control and Psychopathology Laboratory; Wheeler, Mark E. - Center for the Neural Basis of Cognition & Department of Psychology, University of Pittsburgh |
|||
|
Collection: Biology and Medicine |
|||
| 33 | OVERLAPPING SELFAFFINE SETS OF KAKEYA TYPE AKI AND PABLO SHMERKIN | ||
|
Summary: .3) A straightforward calculation shows that, for i # I, | det(A i )| - 8# < | det(B i )| < | det(A i )| + 8#, whence... (#)# 1 (A i ) # . We conclude |#| # # 2 | sin(#)| # # 2 cos(#) # 2 (A i )/# 1 ... |
|||
|
Source: Jyväskylä, University of - Department of Mathematics |
|||
|
Collection: Mathematics |
|||
| 34 | Operator algebras and topological quantum field theory | ||
|
Summary: connected set I, which is call* *ed an in- terval. So we have an assignment A(I) of a von Neumann algebra... of the axioms. For intervals I ae J, we require A(I) ae A(J). Since A(I) should be an alge* *bra... = yx for x 2 A(I), y 2 A(J) if I and J are disjoint. The * *origin of this requirement |
|||
|
Source: Kawahigashi, Yasuyuki - Graduate School of Mathematical Sciences, University of Tokyo |
|||
|
Collection: Mathematics |
|||
| 35 | An Authorization Logic with Explicit Time1 Henry DeYoung Deepak Garg Frank Pfenning | ||
|
Summary: , it suffices to show that for every interval i such that I i, B[i] follows from the linear hypothesis A[i... from both hybrid logics [11, 33] and constraint-based logics [23, 34] to allow formulas of the form A@I... ," written A[[I]]. Following prior work on security logics [18], we would like to go a step ... |
|||
|
Source: Andrews, Peter B. - Department of Mathematical Sciences, Carnegie Mellon University; Carnegie Mellon University, School of Computer Science |
|||
|
Collection: Computer Technologies and Information Sciences ; Mathematics |
|||
| 36 | Lipeomorphisms, sets of bounded variation and integrals | ||
|
Summary: " the images #8;(A i \A) regular. In Lemma 4.2, which is the most delicate lemma of this paper, we deal... -equivalent partitions (or pre-partitions) if they are both partitions (or pre-partitions), jA i j=c #20; jA 0 i j #20... ; cjA i j; jjA ... |
|||
|
Source: Buczolich, Zoltán - Institute of Mathematics, Eötvös Loránd University |
|||
|
Collection: Mathematics |
|||
| 37 | SOBRIETY IN n JOE MASHBURN | ||
|
Summary: ). Therefore we get the following. a((i)) = a((i)) a((i + 1)) = a((i + 1)) b((i)) = b((i)) = b((i)) b((i + 1... )) = b((i + 1)) = b((i + 1)) c((i)) = c((i)) = c((i + 1)) = c((i + 1)) a((i))c((i + 1)) = a((i))c((i + 1... )) a((i + 1))c((i)) = ... |
|||
|
Source: Mashburn, Joe - Department of Mathematics, University of Dayton |
|||
|
Collection: Mathematics |
|||
| 38 | Comprehensive Exam Algorithms and Data Structures General directions: Answer 3 of the following 4 questions. Each problem is worth 10 points. | ||
|
Summary: . For any 1 i n, the elements accessible from i are defined to be A[i], A[A[i]], A[A[A[i]]], A[A[A[A[i... , these are the k lightest edges in E. Given G, w, and an integer k, show how to efficiently determine whether... in shortest paths from your home location s V to your work location ... |
|||
|
Source: Zhou, Yuanyuan - Department of Computer Science and Engineering, University of California at San Diego |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 39 | Subjective expected utility without preferences$ | ||
|
Summary: , a-i) (i, a-i). This shows that Ar implies . Hence, the order topology generated by Ar is coarser... such that (i, a-i) A and (i, a-i) U (this notion of influence of a state is similar to the classical notion... product. B1 (1-Linearity) For all i, j N, all , and all a, b X, ... |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 40 | Problem 10362 (American Mathematical Monthly, Vol.101, February 1994) | ||
|
Summary: 's define xo d = (A - I)-1 u Rn \ {0} and prove that x0 is a fixed point of Su A, hence an eigenvector... < (A - I)x0, Ax0 > (A - I)x0 () But, since A is orthogonal 2 < (A - I)x0, Ax0 > = < ... |
|||
|
Source: Tauraso, Roberto - Dipartimento di Matematica, Università di Roma Tor Vergata |
|||
|
Collection: Mathematics |
|||
| 41 | A Lower Bound on the Probability of a Finite Union of Events with Applications \Lambda | ||
|
Summary: i )'s and the pairwise event probabilities P(A i `` A j )'s. This bound is shown to be always... A i ! N X i=1 / ` i P (A i ) 2 P N j=1 P (A i `` A j ) + (1 \Gamma ` i )P (A i ) + (1 \Gamma ` i )P... ... |
|||
|
Source: Alajaji, Fady - Department of Mathematics and Statistics, Queen's University (Kingston); Linder, Tamás - Department of Mathematics and Statistics, Queen's University (Kingston) |
|||
|
Collection: Engineering |
|||
| 42 | Analysis of Algorithms CS 3343 Lecture Three | ||
|
Summary: use key < A[i+2], together with A[i] < A[i+2], A[1..i] is sorted, and A[i+2..j] is sorted to show... InsertionSort(A, n) { for j = 2 to n { key = A[j]; i = j - 1; while (i > 0) and (A[i] > key) { A[i+1] = A[i... ]; ... |
|||
|
Source: Winsborough, William H. - Department of Computer Science, University of Texas at San Antonio |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 43 | Syntactic Cut-Elimination for Common Knowledge Kai Brunnler and Thomas Studer | ||
|
Summary: by the following grammar: A ::= p | ¯p | (A A) | (A A) | iA | iA | A | A , where 1 i h. The formula i... tree whose nodes are marked with multisets of 3 #12;{a, ¯a} {A} {B} {A B} {A, B} {A B} i {[A]i} { iA... } i { iA, [, A]i} { ... |
|||
|
Source: Jäger, Gerhard - Institut für Informatik und angewandte Mathematik, Universität Bern |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 44 | Analysis of Algorithms CS 3343 Lecture Five | ||
|
Summary: { key = A[j]; i = j - 1; while (i > 0) and (A[i] > key) { A[i+1] = A[i]; i = i 1; } A[i+1] = key... of the array that is sorted · Inner-loop invariant: 1. A[1..i] is sorted 2. A[i+2..j] is sorted 3. i+2 j key... < A[i+2] 4. i+2 j ... |
|||
|
Source: Winsborough, William H. - Department of Computer Science, University of Texas at San Antonio |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 45 | Logic: An Authorization Logic with Explicit Henry DeYoung | ||
|
Summary: interval, as in A@I. logic also adopts techniques from constraint-based reasoning [26, 37] to manage... a judgment form that relativizes truth to a time interval. We choose to write A[I] for the judgment meaning... , and the logics' rich expressive power is demonstrated through several examples. Finally, a proof checker |
|||
|
Source: Reddy, Raj - School of Computer Science, Carnegie Mellon University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 46 | A Logic for Reasoning About Time-Dependent Access Control Policies | ||
|
Summary: , and the logics' rich expressive power is demonstrated through several examples. Finally, a proof checker... applicability to natural time-dependent policies is demonstrated. Second, the linear version of logic shows... practical contribution. The natural deduction proof checker presented shows that a full-fledged PCA |
|||
|
Source: Carnegie Mellon University, School of Computer Science |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 47 | Analysis of Algorithms CS 5633 Lecture Three | ||
|
Summary: ; while (i > 0) and (A[i] > key) { A[i+1] = A[i]; i = i 1; } A[i+1] = key } } Insertion Sort 1 i j Key... [j] into the sorted sequence A[1..j-1] while (i > 0) and (A[i] > key) { A[i+1] = A[i]; i = i 1; } A[i+1] ... |
|||
|
Source: Winsborough, William H. - Department of Computer Science, University of Texas at San Antonio |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 48 | A Game Theoretic Approach to Efficient Power Management in Sensor Networks | ||
|
Summary: actions ai Ai = {0, 1}. Given an action profile a = (a1, . . . , an), we define a-i be the action profile... of all sensors but sensor i; i.e. a-i = (a1, . . . , ai-1, ai+1, . . . , an). Accordingly, let A-i = Q j6... to maximize their common payoff, i.e., given an action profile a-i, sensor i's set of best ... |
|||
|
Source: Garcia, Alfredo - Department of Systems and Information Engineering, University of Virginia |
|||
|
Collection: Engineering |
|||
| 49 | CHARACTERIZATION OF NON-MINIMAL TREE ACTIONS Lisa Carbone and Laura Ciobanu | ||
|
Summary: ;4. Structure of non-minimal actions. In this section we show that a finite edge-indexed quotient graph (A, i... of Theorem (4.3) shows that any dominant rooted edge-indexed tree (T, i, a) in (A, i) is removed during... . Then A naturally gives rise to an ... |
|||
|
Source: Carbone, Lisa - Department of Mathematics, Rutgers University |
|||
|
Collection: Mathematics |
|||
| 50 | Subspace extraction for matrix functions Marlis Hochbruck a | ||
|
Summary: eigenproblem (A - I)-1 x = ( - )-1 x. (2.1) Given a search space Vk, we look for approximate eigenpairs (, v... ), v Vk, with a (Petrov)Galerkin condition of the form (A - I)-1 v - ( - )-1 v Uk. 3 #12;Here, Uk... of a (presumably large) matrix. This can be done by the test space Uk = ... |
|||
|
Source: Hochstenbach, Michiel - Wiskunde en Informatica, Technische Universiteit Eindhoven |
|||
|
Collection: Mathematics |
|||
| 51 | Analysis of Algorithms CS 5633 Lecture Four | ||
|
Summary: 3343 Lecture 3 3 InsertionSort(A, n) { for j = 2 to n { key = A[j]; i = j - 1; while (i > 0) and (A[i... ] > key) { A[i+1] = A[i]; i = i 1; } A[i+1] = key } } Insertion Sort 1 i j Key goes heresorted 18... -loop invariant: 1. A[1..i] is sorted 2. A[i+2..j] is sorted 3. i+2 j key ... |
|||
|
Source: Winsborough, William H. - Department of Computer Science, University of Texas at San Antonio |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 52 | Optimal Choice of Granularity In Commonsense Estimation | ||
|
Summary: ; a i . Thus, a + i = 3a i . 3. Let us now show that if two intervals from an optimal granulation... is called optimal if it cannot be improved. Theorem 1. In an optimal granulation, I i = [a i ; a i+1... ], where a i+1 = 3a i . (For reader's ... |
|||
|
Source: Hobbs, Jerry R. - Information Sciences Institute, University of Southern California |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 53 | On the Structure and Representation Theory of Rational Chiral Conformal Theories | ||
|
Summary: satisfies ~E(x x) c-1/2 x x x A(~I). We are done as soon as we show that ~E restricts to a normal... and define I(x) = c KQ P (x), x A(I). (4.2) We must now show that this is well defined, i.e. independent... A(S). Here we can apply Lemma 4.2 and conclude c KQ P (x) = c KS R(x) x ... |
|||
|
Source: Proudfoot, Nicholas - Department of Mathematics, University of Oregon |
|||
|
Collection: Mathematics |
|||
| 54 | Scotet E, Martinez LO, Grant E, Barbaras R, Jeno P, Guiraud M, Monsarrat B, Saulquin X, Maillet S, Esteve JP, Lopez F, Perret B, Collet X, Bonneville M, | ||
|
Summary: A-I. Immunity 22: 71-80 Tumor Recognition following Vgamma9Vdelta2 T Cell Receptor Interactions... with a Surface F1-ATPase-Related Structure and Apolipoprotein A-I 1 Emmanuel Scotet, 2 Laurent Martinez, 1 Ethan... of apolipoprotein A-I as demonstrated by surface plasmon resonance. Moreover, the presence of apolipoprotein ... |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 55 | Program Simpli cation as a Means of Approximating Undecidable Propositions | ||
|
Summary: -condition is 1 #21;#27;:8i:0 #20; i < MAX:#27;(A) # i #20; b The hypothesis is that the program computes... =A[0]; 3 for(i=0;i |
|||
|
Source: Binkley, David W. - Computer Science Department, Loyola College in Maryland; Harman, Mark - Department of Computer Science, King's College London; Hierons, Rob - Department of Information Systems and Computing, Brunel University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 56 | Laboratoire d'Analyse et Modlisation de Systmes pour l'Aide la Dcision | ||
|
Summary: in the expression of (13) shows that it implies lineari. Conversely, suppose that (xi, a-i) A and (yi, b... Unsatisfactory ones. We say that an attribute i N is influent for A , U if there are xi, yi Xi and a-i X... -i such that (xi, a-i) A and (yi, a-i) U . We say that an attribute ... |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 57 | In defence of the maximum entropy inference J.Paris and A.Vencovsk a | ||
|
Summary: w0 (S #18; + f w(A i $ #18;) = 1 g); and the result follows. #4; There are several other approaches... i 1 ; :::; A i n ) stand for the Lindenbaum Algebra on SL(A i 1 ; :::; A i n ), so the ele- ments... of this algebra are the equivalence classes #18; = f #30; 2 ... |
|||
|
Source: Paris, Jeff - Department of Mathematics, University of Manchester |
|||
|
Collection: Mathematics |
|||
| 58 | Syntactic Cut-Elimination for Common Knowledge Kai Brunnler and Thomas Studer | ||
|
Summary: grammar: A ::= p | ¯p | (A A) | (A A) | iA | iA | A | A , where 1 i h. The formula iA is read... iA, i, , ¯B ... 2k k B, ... 1k< B, cut iA, i, , Here the inference rule above the cut... , cut A, , ... |
|||
|
Source: Jäger, Gerhard - Institut für Informatik und angewandte Mathematik, Universität Bern |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 59 | BOUNDS FOR CASTELNUOVO-MUMFORD REGULARITY IN TERMS OF DEGREES OF DEFINING EQUATIONS | ||
|
Summary: graded A-module, we set ai(M) := max{µ | Hi m(M)µ = 0}, bi(M) := max{µ | TorA i (M, k)µ = 0... ] Let I A be an homogeneous ideal and X := Proj(A/I). Then reg(I) = reg(inrev-lex(I)) if either: (1... } where is a general linear form. Then reg(M) µ + dimk H0 m(M)µ µ + dimk Mµ. Applied to M := A/I |
|||
|
Source: Chardin, Marc - Institut de Mathématiques de Jussieu, Université Pierre-et-Marie-Curie, Paris 6 |
|||
|
Collection: Mathematics |
|||
| 60 | Random Taylor hypothesis and the behavior of local and convective accelerations in isotropic turbulence | ||
|
Summary: PDFs of (a,aI) lines A, B , and PDFs of (a,aS) lines C,D at R 38 and 240. The inset shows the same PDFs... and in the atmospheric surface layer.29 Figure 6 shows information analogous to that in Fig. 5, but for the vectors a, aI... shows that the PDF of (a,aI) has a ... |
|||
|
Source: Yeung, P. K. - School of Aerospace Engineering, Georgia Institute of Technology |
|||
|
Collection: Engineering |
|||
| 61 | Appears in Science of Computer Programming 27 (1996) 119-137. Systolic Arrays for the Recognition | ||
|
Summary: as: b(i) ( j : 0 j < N : a(i + j) = a(i + Pj)), i 0. (1) Several instances of this problem (or... -1(i) at its disposal for the computation of bn(i+1). To provide a(i+N+1-2n) we have several options... (i) "segment a[i..i+N) is P-invariant", i 0, where b ... |
|||
|
Source: Schoenmakers, Berry - Wiskunde en Informatica, Technische Universiteit Eindhoven |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 62 | Auditory CNS Processing and Plasticity Audiology $;, | ||
|
Summary: -enhanced 'clear' stimuli [from Cunningham et aI., Clin Neurophysiol, 2001]. dren showed significantly reduced P2-N... the nature and origin of auditory deficits affecting communication [Bradlow et aI., 1999; Carrell et aI... ., 1999; Cunningham et aI., 2000b, 2001; Koch et ... |
|||
|
Source: Kraus, Nina - Departments of Communication Sciences and Disorders & Neurobiology and Physiology, Northwestern University |
|||
|
Collection: Biology and Medicine |
|||
| 63 | Data Streams: Algorithms and Applications by S. Muthukrishnan | ||
|
Summary: , where at arrives at time t. This stream describes some underlying signal, A[i] for i [1, N] for some... Heavy Hitters Consider the cash register model. Estimating maxi A[i] is impossible in o(N) space... and only items i such that A[i] > (1/k + 1) ||A||1 must store (N) bits. Thus, we allow some approximation |
|||
|
Source: Willsky, Alan S. - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT) |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 64 | Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots | ||
|
Summary: , i , j, j such that neither (i, j) nor (i , j ) cuts any alignment edge (formally A[i..i ]×[1..|S2... |] = A[1..|S1|]×[j..j ]), we define the subalignment A(i, i ; j, j ) of A by A[i..i ]×[j..j ]. An arc... , pL 2 ), (pR 1 , pR 2 ) A, i.e. when the arcs p1 and p2 are matched by A. The ... |
|||
|
Source: Will, Sebastian - Lehrstuhl für Bioinformatik, Institut für Informatik, Albert-Ludwigs-Universität Freiburg |
|||
|
Collection: Computer Technologies and Information Sciences ; Biology and Medicine |
|||
| 65 | A Unified Compiler Framework for Work and Data F. Kuijlman, H.J. Sips, C. van Reeuwijk, and W.J.A. Denissen | ||
|
Summary: ]; foreach (i :- 0:N) A[i] = A[i] + B[i] * C[i]; The iterations of the example can be done in parallel... have introduced the independent annotation: <$independent$> foreach (i :- 0:N) A[i] = A[i] + B[i] * C... [(cyclic @i)]$> A[i] = A[i] + B[i] * C[i]; The ... |
|||
|
Source: Langendoen, Koen - Elektrotechniek, Wiskunde en Informatica, Technische Universiteit Delft |
|||
|
Collection: Engineering ; Computer Technologies and Information Sciences |
|||
| 66 | An analysis of permutations in arrays Valentin Perrelle and Nicolas Halbwachs | ||
|
Summary: (x) is 1 knowing that i = j or i = j is essential to know whether an assignment to A[i] may or must affect... -dimensional array, indexed from 1 to |A| (the size of A). Then ^A denotes the multiset of contents of A, i.e., ^A... = x. |A| i=1 x,A[i] , where x,y = (if x = ... |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 67 | Mechanisms for (Mis)allocating Scientific Credit Jon Kleinberg | ||
|
Summary: to work on project ai. As is standard, we denote by a-i the strategy vector a without the ith coordinate... and by j, a-i the strategy vector a1, . . . , ai-1, j, ai+1, . . . , an. We use Kj(a) to denote the set... )-smooth if for every two strategy vectors a and b, we have iN ui(bi, a-i) u(b) - µu(a). The following is a useful |
|||
|
Source: Keinan, Alon - Department of Biological Statistics and Computational Biology, Cornell University |
|||
|
Collection: Biology and Medicine |
|||
| 68 | Buffer Optimal Static Scheduling with a Throughput Constraint for Synchronous Dataflow Applications | ||
|
Summary: smaller buffer requirement. As an input graph, we used Fig. 1 (a). Since [11] performs 1: ft(A,I) $== st(A,I... )+T :- exectime(A,T), invocation(A,I). 2: fireable(A,I,B,J) :- I*X |
|||
|
Source: Ha, Soonhoi - School of Computer Science and Engineering, Seoul National University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 69 | Analysis of Algorithms CS 3343 Lecture Two | ||
|
Summary: ; while (i > 0) and (A[i] > key) { A[i+1] = A[i]; i = i 1; } A[i+1] = key } } Insertion Sort 1 i j Key... { key = A[j]; i = j - 1; Insert A[j] into the sorted sequence A[1..j-1] while (i > 0) and (A[i] > key... ) { A[i+1] = A[i]; i = ... |
|||
|
Source: Winsborough, William H. - Department of Computer Science, University of Texas at San Antonio |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 70 | Counting nonintersecting lattice paths with turns C. Krattenthalery | ||
|
Summary: if no two of them have a point in common. Theorem 1. Let Ai = (A(i)1, A(i)2) and Ei = (E(i)1, E(i)2... as considered by Conca [4], see [11]. Theorem 2. Let Ai = (A(i)1, A(i)2) and Ei = (E(i)1, E(i)2) be lattice... , E(1)1< E(2)1< . .<.E(r)1, E(1)2 E(2)2 . . .E(r)2, and ... |
|||
|
Source: Krattenthaler, Christian - Fakultät für Mathematik, Universität Wien |
|||
|
Collection: Mathematics |
|||
| 71 | Reaching Envy-free States in Distributed Negotiation Settings Yann Chevaleyre Ulle Endriss Sylvia Estivie Nicolas Maudet | ||
|
Summary: of indivisible resources R. · An allocation A is a partitioning of R amongst the agents. Example: A(i) = {r5, r7... (A) = vi(A(i)) = 577.8 -- agent i is pretty happy · Agents may engage in negotiation to exchange resources... such that vi(A )-vi(A) > p(i) for all i A, except possibly p(i) = 0 for agents i with A(i) = A (i |
|||
|
Source: Endriss, Ulle - Institute for Logic Language and Computation, Universiteit van Amsterdam |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 72 | STA 410S/2102S: Practice questions for 1st test These do not cover all the topics that may be on the test | ||
|
Summary: [i,i] <- sqrt (A[i,i]) } else { U[i,i] <- sqrt (A[i,i] - sum(U[1:(i-1),i]^2)) } if (i A[i,j] / U[i,i] } else { U[i,j] <- (A[i,j] - sum(U[1:(i-1),i]*U[1:(i-1),j])) / U... ; from which ^y = X ^ = X(XT X)-1 XT y = Hy where H is called the hat ... |
|||
|
Source: Reid, Nancy - Department of Statistics, University of Toronto |
|||
|
Collection: Mathematics |
|||
| 73 | The Hopf ring for P(n) Douglas C. Ravenel | ||
|
Summary: ;for (K, J) A+ n which is obvious. (a)(ii). First we apply V i to see we need only show (aI [vK ]b... want to show (V q (aI [vK ]bJ-k )) b(1+k-q) = V q (aI [vK ]bJ-k )p-1 V q (aI [vK ]bJ-k ) b(1+k... until later. We want to show that all of ... |
|||
|
Source: Ravenel, Douglas - Department of Mathematics, University of Rochester |
|||
|
Collection: Mathematics |
|||
| 74 | THE HOPF RING FOR P(n) DOUGLAS C. RAVENEL AND W. STEPHEN WILSON | ||
|
Summary: (J) > m(I) = q then we want to show (V q (aI [vK ]bJ-k )) b(1+k-q) = V q (aI [vK ]bJ-k )p-1 V q (aI [v... later. We want to show that all of the proposed targets, aI [vK ]bJ with i0 = 0 such that (K, J) An - A... will define some special elements e P(n)1(P(n) 1 ... |
|||
|
Source: Wilson, W. Stephen - Department of Mathematics, Johns Hopkins University |
|||
|
Collection: Mathematics |
|||
| 75 | DIMACS Technical Report 2000-33 September, 2000 | ||
|
Summary: ; : : : ; B l g be two families of sets such that jA i j = a, jB i j = b and jA i \ B i j #20; c for any 1 #20... ; i #20; l, and jA i \ B j j > c for any 1 #20; i 6= j #20; l. Then, l #20; #18; a + b 2c a c #19... and where we assumed that the pairs ... |
|||
|
Source: Rutgers University, Center for Discrete Mathematics and Theoretical Computer Science |
|||
|
Collection: Mathematics ; Computer Technologies and Information Sciences |
|||
| 76 | PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | ||
|
Summary: and infinite joins in L. Let C3 ={O, 1, 2} be the 3-element chain. For every (a, i) E K X C3, we define... a lattice S(a,i) as follows: (80) S(a,O) is the lattice La with the new zero W a· (81) S(a,l} is a Boolean... E a' !(a,I),(a,2) maps S(a,l) into S(a,2): { (O,a) if x = (0,a), (F4) ... |
|||
|
Source: Gratzer, George - Department of Mathematics, University of Manitoba |
|||
|
Collection: Mathematics |
|||
| 77 | ON THE DISTRIBUTION OF ZEROS OF THE HURWITZ ZETA-FUNCTION | ||
|
Summary: T, 1 - a + iT, 1 - a + i. By the calculus of residues (3) holds and 1 2i C (s)(s, )ds = 1 2i a+iT a+i... + 1-a+iT a+iT + 1-a+i 1-a+iT + a+i 1-a-i (s)(s, )ds(6) =: 4 j=1 Ij, #12;ON THE DISTRIBUTION OF ZEROS... ... |
|||
|
Source: Garunkstis, Ramunas - Department of Probability Theory and Number Theory, Vilnius University |
|||
|
Collection: Mathematics |
|||
| 78 | Array Data Flow Analysis for LoadStore Optimizations in FineGrain Architectures y z | ||
|
Summary: the references forming a live range. As illustrated in Figure 2, the value of A[i + 4] is defined in the k th... , resulting in more precise analysis. For example, the definition of A[2 \Theta i] kills the value of A[i + 4... ] from the k th iteration only two and four iterations later. Thus, the definition of A[i + 4 |
|||
|
Source: Bodik, Rastisla - Department of Electrical Engineering and Computer Sciences, University of California at Berkeley |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 79 | On Array Theory of Bounded Elements Min Zhou1,2,3 | ||
|
Summary: : Input a : array of [0..255] for i 0 to 255 do b[i] 0; for i 0 to |a| - 1 do b[a[i]] b[a[i]] + 1; k... if there is an index i such that a[i] = v. Or, more formally, vi.(b[v] > 0 a[i] = v) must hold at the end... as 0 and 1. Given an array variable a, we use a[i] to denote the ... |
|||
|
Source: Wang, Bow-Yaw - Institute of Information Science, Academia Sinica (Taiwan) |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 80 | LOW-DIMENSIONAL UNITARY REPRESENTATIONS OF B3 Abstract. We characterize all simple unitarizable representations of the braid | ||
|
Summary: . For i = j, multiplying by eA,i on the left and by eA,j on the right shows ijeA,ieB,1eA,j = 0. But eB,1e... , where M {A, B}. That is, eM,i = j=i M - j i - j = P (d) i (M) j=i(i - j) . Note that eA,i and e... is real. #12;4 IMRE TUBA Proposition 2.2. S = {eA,ieB,1eA,j | 1 i, j d, i = j} {eA,i | 1 i d |
|||
|
Source: Tuba, Imre - Department of Mathematics and Statistics, San Diego State University |
|||
|
Collection: Mathematics |
|||
| 81 | Minimizing Inter-Iteration Dependencies for Loop Pipelining Timothy W. O'Neil Edwin H.-M. Sha | ||
|
Summary: the loop's parallel schedule in Figure 1(b). DOALL i x =a[i]+b[i] /* 1 */ a[i+1]=x /* 2 */ b[i] =b[i]+1... /* 3 */ a[i+3]=a[i+1]-1 /* 4 */ a[i+2]=a[i+1]+1 /* 5 */ (a) 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2... that instructions within it- erations are being ... |
|||
|
Source: Sha, Edwin - Department of Computer Science, University of Texas at Dallas |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 82 | TESTS ON CONDUCTED ELECTRICAL NOISE ON A STORAGE RING DC-DC CONVERTER CABINET | ||
|
Summary: -;~I'Lj,~!,{j:u;lJ..!wm""'t./+ I-~lc-----+-I--+--+-----j-'""'"-'le''JL;t'"----11 i I II I I Converter Ground - SOmA I Division... Power System Ground - 8mA I Division Converter Ground - SOmA I Division C.M. Load Current - SOOmA ... |
|||
|
Source: Kemner, Ken - Biosciences Division, Argonne National Laboratory |
|||
|
Collection: Environmental Sciences and Ecology ; Environmental Management and Restoration Technologies |
|||
| 83 | R u t c o r R e p o r t | ||
|
Summary: B 1 ; : : : ; B l g be two families of sets such that jA i j = a, jB i j = b and jA i `` B i j c... for any 1 i l, and jA i `` B j j ? c for any 1 i 6= j l. Then, l ` a + b \Gamma 2c a \Gamma c... and where we assumed that the pairs ... |
|||
|
Source: Rutgers University, Rutgers Center for Operations Research |
|||
|
Collection: Engineering |
|||
| 84 | Technical Report CS-2002-01 A Graph Uni cation Machine for NL Parsing | ||
|
Summary: on the stack. 12: if A[i 1 ] = Generation then 13: j A[i 1 + 1] fF cellg 14: if A[j] = Generation then 15... one node is a leaf node: 25: if A[i 1 ] #21; 0 and A[i 1 + 2] = 0 then fi 1 is leafg 26: A[i 1... ] Generation; A[i 1 + 1] i 2 fforward to i 2 g 27: ... |
|||
|
Source: Keselj, Vlado - Faculty of Computer Science, Dalhousie University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 85 | Theory and Algorithms for the Generation and Validation of Speculative Loop Optimizations | ||
|
Summary: 4 gives several ex amples and shows the results of applying the algorithms in Section 3... 2: Rule PERMUTE for reordering loop transformations for i = 1 to N for j = 1 to M A[i+k, j+1] = A[i... , j] + 1 =) for j = 1 to M for i = 1 to N A[i+k, j+1] = A[i, j] + 1 ... |
|||
|
Source: Barrett, Clark W. - Computer Science Department, Courant Institute of Mathematical Sciences, New York University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 86 | Iterated Regret Minimization: A New Solution Concept | ||
|
Summary: # if the action profile #a is played. A (mixed) strategy for player i is a probability distribution # i # #(A i... ) (where, as usual, we denote by #(X) the set of distributions on the set X). Let # i = #(A i ) denote... notation, we let an action a i # A i also denote the pure strategy # i # ... |
|||
|
Source: Halpern, Joseph Y. - Department of Computer Science, Cornell University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 87 | Analysis of Algorithms CS 3343 Lecture Four | ||
|
Summary: · Inner-loop invariant: 1. A[1..i] is sorted 2. A[i+2..j] is sorted 3. i+2 j key < A[i+2] 4. i+2 j A[i... ] A[i+2] 5. 0 i · Initialization 1. Follows from outer-loop invariant 2. Trivial (initially... to Prove the Inner-loop Invariant is Maintained? · Inner-loop invariant: 1. A[1..i] is sorted 2. ... |
|||
|
Source: Winsborough, William H. - Department of Computer Science, University of Texas at San Antonio |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 88 | Appeared in Proceedings of First International ACM/IEEE Symposium on Code Generation and Optimization, 2003 Optimizing Memory Accesses For Spatial Computation | ||
|
Summary: with the fol- lowing example: void f(unsigned*p, unsigned a[], int i) { if (p) a[i] += *p; else a[i] = 1; a[i... ] <<= a[i+1]; } This program uses a[i] as a temporary variable. We have compiled this program using... stored in a[i] (two stores and one load). The ... |
|||
|
Source: Budiu, Mihai - Microsoft Research Silicon Valley |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 89 | Optimizing Memory Accesses For Spatial Computation Mihai Budiu and Seth C. Goldstein | ||
|
Summary: with the fol- lowing example: void f(unsigned*p, unsigned a[], int i) { if (p) a[i] += *p; else a[i] = 1; a[i... ] <<= a[i+1]; } This program uses a[i] as a temporary variable. We have compiled this program using... stored in a[i] (two stores and one load). The ... |
|||
|
Source: Goldstein, Seth Copen - School of Computer Science, Carnegie Mellon University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 90 | Computer Science 1 (4003-231) Reduction & All-Gather | ||
|
Summary: ? 18 Antiproton Motion 19 for i = 0 to n-1: p[i] = (random(0..R), random(0..R)) v[i] = 0 a[i] = 0 m = 0... -1: for j = 0 to n-1, j neq i: d = p[i] p[j] a[i] = a[i] + d*Q/|d|^3 for i = 0 to n-1: a[i] = a[i... ] + B*(v(y)[i], v(x)[i]) p[i] = p[i] + dt*v[i] + ... |
|||
|
Source: Kwon, Minseok "James" - Department of Computer Science, Rochester Institute of Technology |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 91 | Bull. Fr. Pche Piscic. (2006) 380-381 : 991-1000 --991 --GENETIC ANALYSIS FOR CONSERVATION OF AUSTROPOTAMOBIUS | ||
|
Summary: results showed that two subspecies overlap in Marches Region of Italy, A. i. carsicus and A. i... subspecies described for A. italicus. Our results confirmed the presence of both subspecies A. i. carsicus (M... 1 & M2) and ... |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 92 | SUBNORMAL AND HYPONORMAL GENERATORS OF NATHAN S. FELDMAN AND PAUL MCGUIRE | ||
|
Summary: \e(A). For example the following Theorem shows that if ind(A - I) = 0 for some / e(A), then the essential spectrum... of disjoint Jordan curves, C (A) has a subnormal generator if and only if ind(A - I) = 0 for some C \ e... of the Fredholm index function, ind(A - ... |
|||
|
Source: Feldman, Nathan S. - Department of Mathematics, Washington and Lee University |
|||
|
Collection: Mathematics |
|||
| 93 | Discrete Applied Mathematics 100 (2000) 155167 The complexity of irredundant sets parameterized by size | ||
|
Summary: ¡ ÿ6k}: The vertex set V of G is next described. V = A B C; where A = k i=1 A(i); A(i) = {a[i; j; u... also deÿne the following sets: A(i; u) = {a[i; j; u; r]: j {1; : : : ; k}; j = i; 1 6 r 6 3k2 }; A(i... ; j) = {a[i; j; u; r]: u V; 1 6 r ... |
|||
|
Source: Raman, Venkatesh - Institute of Mathematical Sciences, Chennai, India |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 94 | Mitochondrial DNA structure of the Iberian populations of the white-clawed crayfish, Austropotamobius italicus italicus (Faxon, 1914) | ||
|
Summary: -species are accepted: A. i. carsicus M. Karaman, 1962 A. i. carinthiacus Albrecht, 1981, A. i. italicus (Faxon, 1914... ) and A. i. meridionalis (Fratini et al., 2005). The sub-species A. ... |
|||
|
Source: Carranza, Salvador - Institut de Biologia Evolutiva, Universitat Pompeu Fabra |
|||
|
Collection: Biology and Medicine |
|||
| 95 | TOPOLOGICAL DYNAMICS ON MODULI SPACES II JOSEPH P. PREVITE AND EUGENE Z. XIA | ||
|
Summary: i ; A g+i i is Spin(2) and then shows that there exists j such that hA i ; A g+i A j i is not Spin(2... DYNAMICS ON MODULI SPACES II 9 is D and one wants to show that there exists j such that hA i ; A g+i A j i... is generic. One must not only ... |
|||
|
Source: Previte, Joseph P. - Penn State Erie, The Behrend College |
|||
|
Collection: Mathematics |
|||
| 96 | Conformal quantum field theory and Yasuyuki Kawahigashi | ||
|
Summary: a canonical embedding of A(I) into C (A), we regard A(I) as a subalgebra of C (A). One can show that we have... by the Grants-in-Aid for Scientific Research, JSPS. #12;a family of von Neumann algebras A(I) on a fixed Hilbert... , we have A(I) A(J). This axiom is called isotony and means ... |
|||
|
Source: Kawahigashi, Yasuyuki - Graduate School of Mathematical Sciences, University of Tokyo |
|||
|
Collection: Mathematics |
|||
| 97 | Check-and Red List of bryophytes of the Czech Republic (2003) Seznam a Cerven seznam mechorost Cesk republiky (2003) | ||
|
Summary: laxifolia (Hook.) Spruce CR [C2a(i)] Found recently at several sites in the National Park Bohemian... ] Campylophyllum sommerfeltii (Myr.) Hedenäs EN [B2ab(iii); C2a(i)] Found recently several times at the same... hellerianum (Nees ex Lindenb.) R. M. Schust. CR [B1ab(iii,iv,v)+2ab(iii,iv,v); ... |
|||
|
Source: Kucera, Jan - Department of Botany, Faculty of Biological Sciences, University of South Bohemia |
|||
|
Collection: Environmental Sciences and Ecology |
|||
| 98 | THE IDEAL ENVELOPE OF AN OPERATOR ALGEBRA DAVID P. BLECHER AND MASAYOSHI KANEDA | ||
|
Summary: with a right contractive approximate identity (r.c.a.i.). Conversely, we show here tha* *t operator... * *ontractive approximate identity' to `r.c.a.i.' (resp. `l.c.a.i.'). In x2 of our paper we show... )K, if A has a r.c.a.* *i.. ... |
|||
|
Source: Kaneda, Masayoshi - Department of Mathematics, University of California, Irvine |
|||
|
Collection: Mathematics |
|||
| 99 | Optimizing Nested Loops with Loop Distribution and Loop Fusion Department of Computer Science and Engineering | ||
|
Summary: without jeopardizing the code size. endfor endfor for i=0, N for j=0, M A[i,j]=A[i,j]*2+1; endfor for j=0... , M B[i,j]=B[i,j-1]*3; endfor for j=0, M C[i,j]=(A[i,j+1]+B[i,j+1])/2; D[i,j]=B[i,j]*3; endfor for j=0... , M E[i,j]=C[i,j-2]+5; F[i,j]=(C[i,j-1]+D[i,j+1])/2; (a) C[i,M]=(A[i,M+2]+B[i,M+1])/2; E[i,M]=C[i,M-2 |
|||
|
Source: Sha, Edwin - Department of Computer Science, University of Texas at Dallas |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 100 | Fourier Analysis of Genetic Algorithms Walter A. Kosters a , Joost N. Kok a and Patrik Flor een b | ||
|
Summary: are of the following form. For any complex number a and subsets i and x of a #12;nite universe U we de#12;ne G a;i (x... of a #12;nite universe U we de#12;ne G a;i (x) = a jjinxjj : Here jjsjj denotes the number of elements... i (x) and Walsh products R i (x) are special cases: B i (x) = lim a#0 G a;i (x) = 8 > < > : 1 ... |
|||
|
Source: Kosters, Walter - Leiden Institute of Advanced Computer Science, Universiteit Leiden |
|||
|
Collection: Computer Technologies and Information Sciences |
|||