| Sample search results for: ab inition calcultaions |
| 1 | Encoding probabilistic causal models in probabilistic action language PAL Chitta Baral and Nam Tran | ||
|
Summary: given above, and let us denote its encoding in PAL by D(M). Let init¬ab = {initially ¬ab(A)¬ab(B) ¬ab... (C) ¬ab(D)}. For any u and w literals of U and W: P(initially {u, w}|init¬ab, initially D) = P (u,w) 1... -(1-p)(1-q) if u = U or w = W, 0 if u = ¬U and w = ¬W. (4.12) P(¬D ... |
|||
|
Source: Baral, Chitta - Department of Computer Science and Engineering, Arizona State University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 2 | Relat ional Operat ors if (condit ion) st at ement | ||
|
Summary: at ement s; } if (i>j +1) print f ( i is big\ n ) if (i>(j +1)) print f ( i is big\ n ) f loat a,b; if (a... == b) print f (³a = b\ n ) if (f abs(a-b) <1.e-6) print f (³a = b\ n ) include |
|||
|
Source: Barkana, Rennan - Department of Astronomy and Astrophysics, Tel-Aviv University |
|||
|
Collection: Physics |
|||
| 3 | Behaviour and Instantiation of High-Level Net Processes 1 | ||
|
Summary: we study marked AHL-occurrence nets (K; INIT ), where K is an AHL-occurrence net and INIT is a set... of markings of the input places of K. We say that K is enabled for init 2 INIT if there is a complete #12;ring... sequence s : init #3; ! #15;, where completeness means that each ... |
|||
|
Source: Technische Universität Berlin, Theoretische Informatik / Formale Spezifikation (TFS) |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 4 | Semantics and Verification of Software Lecture 18: Dataflow Analysis I | ||
|
Summary: init : Cmd L returns the initial label of a statement: init([skip]l) := l init([x := a]l) := l init(c1... ;c2) := init(c1) init(if [b]l then c1 else c2) := l init(while [b]l do c) := l Semantics... ): Definition 18.3 (Initial and final labels) The ... |
|||
|
Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH) |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 5 | A Process-Algebraic Approach to Workflow Specification and Refinement | ||
|
Summary: as channels communicating data objects synchronously between the process and the environment. For example a.b... : A · init.n } as the set of events representing workflow triggers and { n : A · work.n } as the set... over P A. P(a, X ) = init.a work.a |||b : X · init.b Skip The process description P(a, ... |
|||
|
Source: Gibbons, Jeremy - Computing Laboratory, University of Oxford |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 6 | Contract-Based Discovery and Adaptation of Web Services | ||
|
Summary: and Adaptation of Web Services 5 feasible. For example, it would be reasonable to expect that a.b. b.a., namely... for sequences of output actions. In general, it should be possible to replace a service with contract a.b... an a message from the client. Conversely, it should not be possible to replace a service with contract a.b |
|||
|
Source: Torino, Università di - Dipartimento di Informatica |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 7 | Java Virtual Machine and Bytecode Verifier Gerwin Klein | ||
|
Summary: entry of Obj C fs Class C | Arr T len entries T.[]" init_vars :: "('a × ty) list => ('a ; val)" "init... (vav)[:: ]lT" apply (unfold lconf_def) apply auto done lemma lconf_init_vars_lemma [rule_format (no_asm)]: " x... _of (map ((f,ft). (f, dv ft)) fs) f = Some v R v T))" apply( induct_tac "fs") apply auto done lemma ... |
|||
|
Source: Klein, Gerwin - National ICT Australia (NICTA) |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 8 | Encoding probabilistic causal model in probabilistic action language Nam Tran and Chitta Baral | ||
|
Summary: us denote its encoding in PAL by D(M). Let us denote that init¬ab = {initially ¬ab(A), ¬ab(B), ¬ab... (C), ¬ab(D)} . Then for any u and w literals of U and W: P(initially {u, w}|init¬ab, initially D) = P (u... ,w) 1-(1-p)(1-q) if u = U or w = W, 0 if u = ¬U and ... |
|||
|
Source: Baral, Chitta - Department of Computer Science and Engineering, Arizona State University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 9 | Java Virtual Machine and Bytecode Verifier Object Initialization | ||
|
Summary: _Framework Product SemilatAlg Typing_Framework_err Opt JType Init TrivLat JVMType Effect EffectMono BVSpec Typing... constdefs obj_ty :: "obj => ty" "obj_ty obj == Class (fst obj)" init_vars :: "('a × ty) list => ('a ; val... )" "init_vars == map_of o map ((n,T). (n,default_val T))" types aheap = "loc ; obj" -- "heap" used |
|||
|
Source: Klein, Gerwin - National ICT Australia (NICTA) |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 10 | Java Source and Bytecode Formalizations in Isabelle: Java VerifiCard Project Deliverables | ||
|
Summary: JType Init TrivLat JVMType Effect EffectMono BVSpec JVM Correct BVSpecTypeSafe BVNoTypeError BVExample... constdefs obj_ty :: "obj => ty" "obj_ty obj == Class (fst obj)" init_vars :: "('a × ty) list => ('a ; val... )" "init_vars == map_of o map ((n,T). (n,default_val T))" types aheap = "loc ; obj" -- "heap" used |
|||
|
Source: Cengarle, María Victoria - Institut für Informatik, Technische Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 11 | Towards a Unified Model for Workflow Processes Peter Y. H. Wong | ||
|
Summary: reservation) in WSCI [3] START = start (init.fault SKIP (init.request (init.fault SKIP init.end SKIP... '(accept,reply) FAULT = SP'(fault,errors) APPROVE = SP'(approve,reply) REPLY = SP'(reply,end) END = init.end done SKIP... init.fault ... |
|||
|
Source: Narasayya, Vivek - Data Management, Exploration and Mining Group, Microsoft Research |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 12 | Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be | ||
|
Summary: but is expressible in LTL or CTL. Unfortunately, the language of (Z, Init) contains a sequence of the form (ab p c) n... described in Fig. 1 is not flat, but it is post # flattable from the initial configuration Init 0 = N 4... . The reachability set from Init 0 is obtained by the flat trace t 1 .t # 2 .t ... |
|||
|
Source: Encrenaz-Tiphène, Emmanuelle - Laboratoire d'Informatique, Université Pierre-et-Marie-Curie, Paris 6 |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 13 | Initializer lists WP wording (WG21/N2531=J16/08-0041) Doc No: WG21/N2531=J16/08-0041 | ||
|
Summary: of N2385. In 8.5 [dcl.init], change initializer: #12;Initializer lists WP wording (WG21/N2532=J16... -expression { initializer-list ,opt } { } init-list initializer-list: initializer-clause ...opt initializer... -list , initializer-clause ...opt direct-initializer: ( expression-list ) untyped-init-list ... |
|||
|
Source: Stroustrup, Bjarne - AT&T Labs & Department of Computer Science and Engineering, Texas A&M University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 14 | Java Virtual Machine and Bytecode Verifier Subroutines | ||
|
Summary: initialization in the JVM, we tag each location with the current init status. The tags use an extended type... the superclass constructor has to be called of. datatype init_ty = Init ty | UnInit cname nat | PartInit cname... name and fields constdefs obj_ty :: "obj => ty" "obj_ty obj ... |
|||
|
Source: Klein, Gerwin - National ICT Australia (NICTA) |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 15 | Emmanuelle Encrenaz Alain Finkel | ||
|
Summary: the initial configuration Init0 = N4. The reachability set from Init0 is obtained by the flat trace t1.t 2.t 3... is not flat. Init is the initial state, defined as follows: Init = {s N14 | s1 + s2 + s3 + s4 + s6 + s7 + s8... + s9 + s10 + s11 + s12 = 0 s5 = s13 s13 > 0 s14 > 0}. ... |
|||
|
Source: Ecoles Normales Supérieures de Cachan, Laboratoire Spécification et Vérification |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 16 | A Process Semantics for BPMN Peter Y.H. Wong Jeremy Gibbons | ||
|
Summary: Skip) Y = ( j : J · P(j) P(j)) within (Y |[ Y ]| X ) \ {|init|} where for each j in J, the process P... Skip ||| Cn(T \ { i, j })) Cn(T) = #T = 1 & (2(i, j) : T · i j init.reserve Skip) 2 #T > 1 & IC(T) 2... init.reserve Skip MTask = [{ init.reserve }](i, j) : Ts · ((i starts.verify j ... |
|||
|
Source: Gibbons, Jeremy - Computing Laboratory, University of Oxford; Jeavons, Peter - Computing Laboratory, University of Oxford |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 17 | Report No.: 91-15 January 22, 2001 Title: Global Optimization of H1 -norm of Parameter-dependent | ||
|
Summary: in a rectangle Q init = [l 1 ; u 1 ] #2; [l 2 ; u 2 ] #2; #1; #1; #1; #2; [l m ; um ]. A block diagram... norm of the system, denoted by H max and de#12;ned as H max (Q init ) = max q2Q init ( max w(t)6=0 kzk... RMS kwkRMS ) = max q2Q init kP cl (q)k 1 ; where k #1; k 1 refers to the H1 -norm: kGk1 = sup Re ... |
|||
|
Source: Balakrishnan, Venkataramanan "Ragu" - School of Electrical and Computer Engineering, Purdue University |
|||
|
Collection: Engineering |
|||
| 18 | , -CNRS JRL NEO Ee Sian Florent LAMIRAUX -CNRS JRL -CNRS JRL, | ||
|
Summary: robot HRP-2 are reported. [1] [2] [3] HRP-2 init... Robot W T _ Table initRobot T_ Can initRobot T_ Can initRobot T_ Can initRobot R_ Table... initRobot T_ Table initRobot ... |
|||
|
Source: Lamiraux, Florent - Laboratoire d'Analyse et d'Architecture des Systèmes du CNRS |
|||
|
Collection: Engineering |
|||
| 19 | Workshop on Monolingual Text-To-Text Generation, pages 6473, Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics, pages 6473, | ||
|
Summary: -based sentence compression. At the core of moving toward full ab- straction, we need to redefine INITs so... - sentation relies on the concept of Information Items (INIT), which we define as the smallest element... of Information Items (INIT) to help define the abstract representation. An ... |
|||
|
Source: Association for Computational Linguistics (ACL) Anthology |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 20 | Politecnico di Milano Facolt di Ingegneria Industriale | ||
|
Summary: libreria di MATLAB/Octave a parte la funzione abs(x) per il calcolo del valore assoluto di x. #12... ricorsivo [tmp_r tmp_err] = sqrt1(z,n-1); r = 0.5 * (tmp_r + z / tmp_r); err = abs(r - tmp_r); end function... (sum(estraiAntiDiagonale(a, 1, c) ~= 0) > 1) ris = false; return; end end end function vet = estraiDiagonale(a, ... |
|||
|
Source: Di Nitto, Elisabetta - Dipartimento di Elettronica e Informazione, Politecnico di Milano |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 21 | Guaranteeing Correctness and Availability in P2P Range Indices Prakash Linga, Adina Crainiceanu, Johannes Gehrke, Jayavel Shanmugasudaram | ||
|
Summary: of the API methods is therefore associated with a start and an end operation. For example, init... the scan range). The start and end operations asso- ciated with scanRange are initScanRangei(p1, lb, ub... , lb, ub) OH 1. os = initScanRangei(p1, lb, ub) H oe 2. o scanOps(i) p r o = scanRangei(p, p1, r |
|||
|
Source: Cornell University, Cornell Database Systems Project; Shanmugasundaram, Jayavel - Department of Computer Science, Cornell University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 22 | Theoretical Computer Science 8 (1979) 161-175. @ North-Holland Publishing Company | ||
|
Summary: OPERATORS RELATED TO INIT Helmut PRODINGER and Friedrich J. URBANEK Institut fir Mathematische Logik und... 1977 Revised March 1978 Abstract. The language operator Init( {x :there is a y, such that xy EL... ,there are language operators, for which definitionsstructurallysimilarto those of Init and Anf can be given. 0 |
|||
|
Source: Prodinger, Helmut - Department of Mathematical Sciences, University of Stellenbosch |
|||
|
Collection: Mathematics |
|||
| 23 | Veri ed Bytecode Veri ers Gerwin Klein, Tobias Nipkow | ||
|
Summary: OPERATORS RELATED TO INIT Helmut PRODINGER and Friedrich J. URBANEK Institut fir Mathematische Logik und... 1977 Revised March 1978 Abstract. The language operator Init( {x :there is a y, such that xy EL... ,there are language operators, for which definitionsstructurallysimilarto those of Init and Anf can be given. 0 |
|||
|
Source: Nipkow, Tobias - Institut für Informatik, Technische Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 24 | Verified Bytecode Verifiers Gerwin Klein, Tobias Nipkow | ||
|
Summary: OPERATORS RELATED TO INIT Helmut PRODINGER and Friedrich J. URBANEK Institut fir Mathematische Logik und... 1977 Revised March 1978 Abstract. The language operator Init( {x :there is a y, such that xy EL... ,there are language operators, for which definitionsstructurallysimilarto those of Init and Anf can be given. 0 |
|||
|
Source: Klein, Gerwin - National ICT Australia (NICTA); Nipkow, Tobias - Institut für Informatik, Technische Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 25 | An Algebraic Framework for Modelling and Verifying Microprocessors using HOL | ||
|
Summary: condition placed upon a data abstraction is expressed by the HOL predicate ONTO_INIT Abs init init', which... holds when the composition of abstraction and implementation initialisation (Abs o init... '):'a'b is surjective with respect to the range of the ... |
|||
|
Source: de Gispert, Adrià - Machine Intelligence Laboratory, Department of Engineering, University of Cambridge |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 26 | INSTITUT POLYTECHNIQUE DE GRENOBLE N attribu par la bibliothque | ||
|
Summary: condition placed upon a data abstraction is expressed by the HOL predicate ONTO_INIT Abs init init', which... holds when the composition of abstraction and implementation initialisation (Abs o init... '):'a'b is surjective with respect to the range of the ... |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 27 | Java Source and Bytecode Formalizations in Isabelle: Java VerifiCard Project Deliverables | ||
|
Summary: Typing_Framework_err Kildall_Lift Opt JType Init TrivLat JVMType Effect EffectMonoBVSpec JVMCorrect BVSpecTypeSafe [Pure] [HOL... _ty entry case entry of Obj C fs Class C | Arr T len entries T.[]" init_vars :: "('a × ty) list => ('a... ; val)" "init_vars map_of map ((n,T). (n,default_val T))" consts the_obj :: "heap_entry ... |
|||
|
Source: Cengarle, María Victoria - Institut für Informatik, Technische Universität München |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 28 | Contract-directed Synthesis of Simple Orchestrators Luca Padovani | ||
|
Summary: , whereas it can get stuck when interacting with a+b because such service does not offer c after b... that the service can receive a; dually for a,a . The orchestrator f = a,a makes the client above compliant with a+b... transforming service contracts: the relation f : a a+b states that every client satisfied by a is also |
|||
|
Source: Torino, Università di - Dipartimento di Informatica |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 29 | Submitted to DOI: 10.1002/smll.((please add manuscript number)) | ||
|
Summary: T T k k k k + + + = = + + + , , 0 0 1 1 air Ab Ag ox tot init tot init Agair Ab ox air air air... by , air Ab Ag ox tot init Agair Ab ox air air air ox T T T T k TT T T k k k k + + + = + + + (3) From... it is summarized in Figure S4. Gate ... |
|||
|
Source: Korea Advanced Institute of Science and Technology, Department of Chemical and Biomolecular Engineering, Metabolic & Biomolecular Engineering National Research Laboratory |
|||
|
Collection: Engineering ; Biotechnology |
|||
| 30 | Application and Problem Class Documentation for UG Version The UG Group | ||
|
Summary: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 48 Init... Diffusion : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 49 Init... Disc : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 50 ... |
|||
|
Source: Multigrid Network (MGNet) Preprints |
|||
|
Collection: Mathematics ; Computer Technologies and Information Sciences |
|||
| 31 | For the MIS: Used External Functions: NONE | ||
|
Summary: Constants: NONE Exported Functions Name Input Type Output Type Exceptions init int invalid put comp notinit... , notfound State Variables s:comp seq max:int is init:Boolean := false State Transformations init... (n:int) Exceptions: n 0 invalid Transition: max := n s := <> is init := true put(c:comp) ... |
|||
|
Source: Carette, Jacques - Department of Computing and Software, McMaster University |
|||
|
Collection: Computer Technologies and Information Sciences ; Mathematics |
|||
| 32 | AUGUSTUS as ab initio method Mario Stanke | ||
|
Summary: AUGUSTUS as ab initio method Mario Stanke Institut f¨ur Mikrobiologie und Genetik Universit¨at G... ¨ottingen Germany AUGUSTUS as ab initio method p.1/8 #12;Application Flow Input: DNA sequence s AUGUSTUS... algorithm This parse defines the predicted gene structure (only CDS, 1 transcript). AUGUSTUS as ab initio |
|||
|
Source: Foissac, Sylvain - Centre de Regulació Genòmica, Barcelona |
|||
|
Collection: Biotechnology |
|||
| 33 | Cauchy problem and quasistationary limit for the MaxwellLandauLifschitz and MaxwellBloch equations | ||
|
Summary: ) and commuting the derivative # t with (Id-P ) and # -1 · l. We therefore have to consider initial data U init... as they exist. We shall write U init := (u init , v init ) with u init := (u init,1 , u init,2 ). Definition 2... to (11)(14). ... |
|||
|
Source: Dumas, Eric - Institut Fourier, Université Joseph Fourier Grenoble-I |
|||
|
Collection: Mathematics |
|||
| 34 | Software Radio Aditya Khosla, Suresh Sitaula | ||
|
Summary: is repeated in the generic map for functional simulation 00030 -- 00031 attribute INIT_00 : string; 00032... attribute INIT_01 : string; 00033 attribute INIT_02 : string; 00034 attribute INIT_03 : string; 00035... attribute INIT_04 : string; 00036 attribute INIT_05 : ... |
|||
|
Source: Li, Fei-Fei - Department of Computer Science, Stanford University |
|||
|
Collection: Engineering ; Computer Technologies and Information Sciences |
|||
| 35 | Yet Another Encoding of TLA in Isabelle Stephan Merz | ||
|
Summary: ''u .= v'' == ''op =[u,v]'' ''A .? B'' == ''op ?[A,B]'' ''--[x,y,z]'' == ''--[x, --[y... =? state'' Init :: ''action =? temporal'' Box :: ''('w::world) form =? temporal'' (''([]())'' [40] 40) Dmd... that name states. Function Init promotes actions to temporal formulas; such a typeconversion function |
|||
|
Source: Merz, Stephan - INRIA & Laboratoire Lorrain de Recherche en Informatique et ses Applications (Loria), Université Henri Poincaré -Nancy-Université |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 36 | A Modular Derivation Strategy via Fusion and Tupling | ||
|
Summary: (fi\Lambda != 0 , inits(xs))) where a fi\Lambda b = max2(a+b,0) = f apply scan law : map(fi != 0 ,inits... specification are given below. segs([x]) = [x] segs(x:xs) = inits(x:xs)++segs(xs) inits([x]) = [x] inits... (x:xs) = [x]:map((x:),inits(xs)) ... |
|||
|
Source: Yamamoto, Hirosuke - Department of Complexity Science and Engineering, University of Tokyo |
|||
|
Collection: Engineering |
|||
| 37 | Slicing Abstractions Ingo Bruckner1 | ||
|
Summary: .avacs.org). #12;pc=0 pc=1pc=2 pc=3 init requestready up down moveUp moveDn ready ready Fig. 1. Control flow graph... . Initial condition, error condition, and transitions of a simple elevator. init pc=0 currentMax input... of Figure 2: there are four abstract nodes, corresponding to the four different evaluations of init (a |
|||
|
Source: Habel, Annegret - Department für Informatik, Carl von Ossietzky Universität Oldenburg |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 38 | Guarded operations, refinement and simulation Steve Reeves and David Streader | ||
|
Summary: .a 1 2 3 4 5 A.b 1 2 3 4 5 A.c 1 2 3 4 5 final · Fig. 1. A.p T initA; A.a T ; A.b T ; A.c ;finalA 3... . · · C.init X A.init X r A.b X A.a X C.a X C.b X C.final X A.final X Fig. 2. Backward simulation... that act on private state State plus two ... |
|||
|
Source: Streader, David - Department of Computer Science, University of Waikato |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 39 | ANNALS OF MATHEMATICS, COMPUTING & TELEINFORMATICS, VOL 1, NO 3, 2005, PP XXYY 1 Dynamic aspects of retrenchments through | ||
|
Summary: abs ops LOCAL INSTANCE Bags CONSTANTS Elem init(St) # = St = EmptyBag TypeInvariant(St) # = Is... a predicate usually called Init. . The set of transitions, using action predicates. An action is a formula... trs). MODULE trs CONSTANTS S isSys # = # S = [data ## S .data, init ## S .init , ... |
|||
|
Source: Banach, Richard - School of Computer Science, University of Manchester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 40 | Computing the Minimum Stability Degree of Parameterdependent Linear Systems \Lambda | ||
|
Summary: = p. We will also assume that q lies in a rectangle Q init = [l 1 ; u 1 ] \Theta [l 2 ; u 2 ] \Theta... system (1) make sense for all q 2 Q init , that is, do we have det(I \Gamma D\Delta) 6= 0 for all q 2 Q... init ; (4) or equivalently, does the rational function A(q) have no singularities in the rect angle Q |
|||
|
Source: Balemi, Silvano - Dipartimento Tecnologie Innovative, Scuola Universitaria Professionale della Svizzera Italiana |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 41 | Working Paper Series ISSN 1177-777X | ||
|
Summary: by the solid lines in Fig. 1 (ignore anything involving for now). init · p = a;b;c 1 2 3 4 5 A.a 1 2 3 4 5 A.b... 1 2 3 4 5 A.c 1 2 3 4 5 final · Figure 1: A.p T initA; A.a T ; A.b T ; A.c ;finalA The simple... on private state State plus two special operations: init that ... |
|||
|
Source: Streader, David - Department of Computer Science, University of Waikato |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 42 | Introduction into Python Python 5: Classes, Exceptions, Generators and more | ||
|
Summary: spaces: 1. built-in names (such as abs()) 2. global names of a module 3. local names in functions Note... ++, this is done with a concept called constructors, but in Python, the mechanism is different. Use __init... (self)__ method to define the initializer. More Details: introduce method such as: Code def __init__(self): self |
|||
|
Source: Polani, Daniel - School of Computer Science, University of Hertfordshire |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 43 | SPECIFICATION OF DYNAMIC RECONFIGURATION IN THE CONTEXT | ||
|
Summary: for each channel name in (AnB) (BnA). For any other name a 2 A\B, merge performs an instantaneous... has a set of initial ports Init; these are the ports D knows initially. Additionally, D may... recursively gain access to new ports: The ports received via the input ports in Init, via input ports received |
|||
|
Source: Stølen, Ketil - Institutt for Informatikk, Universitetet i Oslo |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 44 | An Introduction to Object-Z Graeme Smith | ||
|
Summary: [Item] items : seq Item count : N QueueInit [Item] Queue[Item] items = h i count = 0 Join[Item] #1;Queue... with environment Queue[Item] #22; (count ; INIT ; Join; Leave) items : seq Item count : N INIT items = h i count... is identi#12;ed by the keyword INIT . It com- prises only a predicate part and assumes ... |
|||
|
Source: Smith, Graeme - School of Information Technology and Electrical Engineering, University of Queensland |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 45 | Towards Using Game Semantics for Cryptoprotocol | ||
|
Summary: (SignKC-1(C::KC)) init1,init2,init3.[knows(init1) knows(init2) knows(init3) snd(Extinit2(init3)) = init2... structures (e.g. a->b) No pointers usage and arithmetic. Can verify e.g. using Isabelle that ... |
|||
|
Source: Jurjens, Jan - Fakultät für Elektrotechnik und Informationstechnik, Universität Dortmund |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 46 | Code Security Analysis of a Biometric Authentication System | ||
|
Summary: infrastructure (packet_send, buffer_copy, ...) · data structures (e.g. a->b) Factor out pointers usage. Transform... 11 Example: Translation to Logic knows(N) knows(KC) knows(SignKC-1(C::KC)) init1,init2,init3.[knows(init... 1) knows(init2) ... |
|||
|
Source: Jurjens, Jan - Fakultät für Elektrotechnik und Informationstechnik, Universität Dortmund |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 47 | From Causal Theories to Logic Programs (Sometimes) | ||
|
Summary: ways: -- if f 2 F , then init(f ), meaning that fluent f holds in the initial situation... axiom of the form: poss oe ' 0 where ' 0 is a formula consisting only of propositions of the form init... action and ' is a situation calculus formula obtained from ' 0 by replacing in it each occurrence of init |
|||
|
Source: Wang, Kewen - School of Information and Communication Technology, Griffith University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 48 | From Causal Theories to Logic Programs (Sometimes) | ||
|
Summary: ways: -- if f 2 F , then init(f), meaning that fluent f holds in the initial situation... axiom of the form: poss oe ' 0 where ' 0 is a formula consisting only of propositions of the form init... action and ' is a situation calculus formula obtained from ' 0 by replacing in it each occurrence of init |
|||
|
Source: Wu, Dekai - Department of Computer Science, Hong Kong University of Science and Technology |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 49 | Vol. 48 No. SIG 0(PRO 34) 2007 shift/reset | ||
|
Summary: T[s] S T[s S] . init(n,T, ,S) 0 n m, T , n 1, · · · , n S n S1, · · · , Sn init(0, T, , S... ) = T init(n + 1, T, , S) = (1,(1, S1, S1), init(n, T, , S )) S S init 3, 4 n shift reset n (, (, S, S... ), ) ?? a, b, c, d, i A, B, C, D, X, Si , T[r] T T[r2 ] T[r X] T X T[r2 X] ... |
|||
|
Source: Kameyama, Yukiyoshi - Department of Computer Science, University of Tsukuba |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 50 | Laboratoire Bordelais de Recherche en Informatique UMR CNRS 5800 Universite de Bordeaux | ||
|
Summary: -algorithm that is based on recognizable partition ab- stractions. We give sufficient conditions for the termination... . We recapitulate fifo systems in Section 2 and define their partition ab- stractions in Section 3... two sets Init C and Bad C of configurations, a path from Init to Bad is any path c0 l0 ... |
|||
|
Source: Sutre, Grégoire - Laboratoire Bordelais de Recherche en Informatique, Domaine Universitaire |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 51 | Contract-based discovery of Web services modulo simple orchestrators | ||
|
Summary: with a+b because such service does not offer c after b. The relation a a + b characterizes so... such that - , and similarly for =; let init() def = { | =}. Definition 2.1 (strong compliance). A system is a pair... either a or b is also satisfied by a service that systematically offers a. On the other hand a.(b + d) ... |
|||
|
Source: Torino, Università di - Dipartimento di Informatica |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 52 | Regular Model Checking Using Inference of Regular Languages | ||
|
Summary: ) q , - q for every q Q, (2) if (q,a,b,q ) , then q a,b - q , and (3) if q w,u -- q and q a,b - q... , a regular set of initial configurations Init described by a finite automaton, and a set of "bad... (Init) (or an overapproximation of it) and then check whether (Init)Bad = /0. Problem ... |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 53 | Automatic Web Service Composition with Abstraction and Refinement | ||
|
Summary: Figure 1: Travel agency system A web service w is a 5-tuple (X , XI , XO , Init, T) where: · X... for every variable in XI . · XO X is a finite set of output variables. · Init(X ) is an initial predicate... on this assumption, a set W = {w1, · · · , wn} of web services can be represented by a tuple (X , XI , XO , Init, T |
|||
|
Source: Lee, Dongwon - College of Information Sciences and Technology, Pennsylvania State University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 54 | Input Section Father's ident. (if a clone) | ||
|
Summary: .sav' cen_00012_p=par project.proFile: ret = cen(O_010_00, $ O_012_00, $ cen_00012_p, $ INIT=cen_00012... _c) IF ret NE 0 THEN ProjectMsg, "cen" ret = rec(O_012_00, $ O_014_00, $ rec_00014_p, $ INIT... =rec_00014_c) IF ret NE 0 THEN ProjectMsg, "rec" ret = tfl(O_014_00, $ O_027_00, $ tfl_00027_p, $ INIT |
|||
|
Source: Fini, Luca - Osservatorio Astrofisico di Arcetri |
|||
|
Collection: Physics |
|||
| 55 | Application and Problem Class Documentation for UG Version The UG Group | ||
|
Summary: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47 Init... Diffusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48 Init... Disc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 ... |
|||
|
Source: Multigrid Network (MGNet) Preprints |
|||
|
Collection: Mathematics ; Computer Technologies and Information Sciences |
|||
| 56 | THE DRIVING PHILOSOPHERS Distributed Programming Laboratory | ||
|
Summary: : pendingRequests.init £ ¤ pendingRequests.init 9A@B ' D entryRoundC 11: else 12: pending... by instantiating the canvas in Figure 3 with the following predicates: predInit Serial 768# %¢ min@ b$AB C ED... is defined by the following predicates: predInit x-Fair ... |
|||
|
Source: Guerraoui, Rachid - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 57 | Z Isabelle/HOL-Z , Burkhart Wolff, David Basin, | ||
|
Summary: birthday known birthday birthday InitBirthdayBook == [BirthdayBook | known = ] InitBirthdayBook Birthday... (i) = names(j) InitBirthdayBook1 == [BirthdayBook1 | hwm = 0] AddBirthday1 AddBirthday AddBirthday1 Birthday... Cinit · Aop Cop Abs Abs BirthdayBook BirthdayBook1 known = {i : ... |
|||
|
Source: Basin, David - Departement Informatik, Eidgenössische Technische Hochschule Zürich (ETHZ) |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 58 | Compiler Construction Lecture 26: Code Optimization | ||
|
Summary: labels) Labels are connected via control-flow edges Formally: initial label init : Cmd Lab final labels... .3 C = [z := 1]1; while [x > 0]2 do [z := z*y]3; [x := x-1]4 init(C) = 1 final(C) = {2} flow(C) = {(1... Control Flow II Example 26.3 C = [z := 1]1; while [x > 0]2 do [z := z*y]3; [x := x-1]4 init(C) = 1 final |
|||
|
Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH) |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 59 | Extrapolation-based Path Invariants for Abstraction Refinement of Fifo Systems | ||
|
Summary: partition ab- stractions. We give sufficient conditions for the termination of Cegar by constraining... 2 and define their partition ab- stractions in Section 3. Refinement and extrapolation... two sets Init C and Bad C of configurations, a path from Init to Bad is any path c0 l0 - · · · lh-1 |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 60 | Extrapolation-based Path Invariants for Abstraction Refinement of Fifo Systems | ||
|
Summary: partition ab- stractions. We give sufficient conditions for the termination of Cegar by constraining... . We recapitulate fifo systems in Section 2 and define their partition ab- stractions in Section 3... two sets Init C and Bad C of configurations, a path from Init to Bad is any path c0 l0 - · · · lh-1 |
|||
|
Source: Sutre, Grégoire - Laboratoire Bordelais de Recherche en Informatique, Domaine Universitaire |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 61 | NonRestoring Integer Square Root: A Case Study in Design by Principled | ||
|
Summary: the state using the function init, then updating the state on each iteration of the loop by calling... the definition of state, init and update may change. The SML code that calls the square root at each level is... : fun sqrt n radicand = iterate update (n1) (init n radicand) The iterate function performs iteration |
|||
|
Source: Cornell University, Department of Computer Science, Nuprl Project |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 62 | Non-Restoring Integer Square Root: A Case Study in Design by Principled | ||
|
Summary: . The algorithm works by ini- tializing the state using the function init, then updating the state on each... of transformations. At each level the de nition of state, init and update may change. The SML code that calls... the square root at each level is: fun sqrt n radicand = iterate update n-1 init n radicand The iterate |
|||
|
Source: Cornell University, Department of Computer Science, Nuprl Project |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 63 | Minimally and Maximally Abstract Retrenchments C. Jeske, R. Banach | ||
|
Summary: abstract and concrete systems, which we shall call Abs and Conc respectively. Each system will be described... . For Abs the state space will be denoted by U with typical element u. OpsA will be the set of operation... stpOpA (u, i, u, o). InitA(u) is the predicate that will represent the initialisation op- eration |
|||
|
Source: Banach, Richard - School of Computer Science, University of Manchester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 64 | 2010 Adobe Systems Incorporated. All Rights Reserved. Introduction to GIL, | ||
|
Summary: Rights Reserved. template |
|||
|
Source: Soatto, Stefano - Computer Science Department, University of California at Los Angeles |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 65 | 18 ANNALS OF MATHEMATICS, COMPUTING & TELEINFORMATICS, VOL 1, NO 3, 2005, PP 18-26 Dynamic aspects of retrenchments through | ||
|
Summary: abs ops LOCAL INSTANCE Bags CONSTANTS Elem init(St) = St = EmptyBag TypeInvariant(St) = Is... state and its outputs. MODULE abs EXTENDS abs ops LOCAL INSTANCE Bags VARIABLES i, U , o Init = init... usually called Init. · The set of ... |
|||
|
Source: Banach, Richard - School of Computer Science, University of Manchester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 66 | MLGMPIDL: OCaml interface for GMP and MPFR libraries (version 1.1) | ||
|
Summary: init : unit -> 'a tt val init2 : int -> 'a tt val realloc2 : t -> int -> unit 2.3 Assignement Functions... val swap : t -> t -> unit 2.4 Combined Initialization and Assignment Functions C documentation[http://gmplib.org/manual/Simultaneous-Integer-Init... -_0026-Assign.html#Simultaneous-Integer val ... |
|||
|
Source: Jeannet, Bertrand - Laboratoire dInformatique de Grenoble, Université Joseph Fourier Grenoble-I |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 67 | Interface Synthesis for Embedded Applications in a CoDesign Environment | ||
|
Summary: in MICKEY. Consider two pro- cesses A,B and C,D operating concurrently Fig 2a. Since we are considering... Wait:1 Wait:2 Init C Init D e3/Stop C e4/ Stop D Init C A B C D (a) (b) Figure 2: Concurrent processes... to initialize the device to the required ISR-e1 POP B ISR-e3 Stop C Init D ... |
|||
|
Source: Technische Universität Dortmund, Fakultät für Informatik, Informatik 12 |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 68 | KR-Techniques for General Game Playing | ||
|
Summary: Moves a b c d e f g h i j ka/b a/b a/aa/a b/aa/b a/b a/ba/a a/a a/a a/aa/a a/b b/b b/a b/b b/b b... logic program whose signature includes the following game-independent vocabulary: role(player) init... (oplayer) <= #12;Describing a Game: Initial Position A GDL description P encodes s1 = { : P ... |
|||
|
Source: Thielscher, Michael - Fakultät Informatik, Technische Universität Dresden |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 69 | Verification of Low-level Crypto-Protocol Implementations Using Automated Theorem Proving | ||
|
Summary: otherwise, but for space reasons we have to ab- stract from this latter aspect in our current treatment... flow graph us- ing the aiCall tool [Abs04] which is compiled to first-order logic axioms giving... values to vari- #12;C:Client S:Server init(Ni, KC, SignK-1 C (C::KC)) resp {SignK-1 S (kj ::N )}K , Sign |
|||
|
Source: Jurjens, Jan - Fakultät für Elektrotechnik und Informationstechnik, Universität Dortmund |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 70 | Dynamic aspects of retrenchments through temporal logic | ||
|
Summary: #12; module abs ops local instance Bags constants Elem init(St) # = St = EmptyBag Type... and its outputs. module abs extends abs ops local instance Bags variables i , U , o Init # = init(U ) Put... to introduce the following: #21; The set of initial states, using a ... |
|||
|
Source: Banach, Richard - School of Computer Science, University of Manchester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 71 | NFFT Reference Manual Generated by Doxygen 1.4.4 | ||
|
Summary: input/output vectors. · #define FFTW_INIT (1U<< 10) If this flag is set, fftw_init... the definition. · void nfft_adjoint (nfft_plan ths) Computes an adjoint NFFT, see the definition. · void nfft_init... _1d (nfft_plan ths, int N1, int M) Initialisation of a transform plan, wrapper d=1. · void ... |
|||
|
Source: Potts, Daniel - Fakultät für Mathematik, Technische Universität Chemnitz |
|||
|
Collection: Mathematics |
|||
| 72 | Filtering Retrenchments into Refinements Retrenchment is a weakening of model based refinement | ||
|
Summary: ([v¢]) Û ($ v Î [v¢] . Init C (v)). Lemma 7.1 If the Abs and Conc steps u (i, Op A , o)> u¢ and v... reliable by the theory of refinement, the ab stract model is transformed into code in a manner that can... . There will be an abstract system Abs and a concrete one Conc (that will be related by ... |
|||
|
Source: Banach, Richard - School of Computer Science, University of Manchester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 73 | Laboratoire Bordelais de Recherche en Informatique UMR CNRS 5800 Universite de Bordeaux | ||
|
Summary: semi-algorithm that is based on recognizable partition ab- stractions. We give sufficient conditions... , by an exact backward computation along the reached sets. Two parametrized automata ab- straction schemes... two sets Init C and Bad C of configurations, a path from Init to Bad is any path c0 l0 - · · ... |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 74 | Filtering Retrenchments into Refinements Retrenchment is a weakening of model based refinement | ||
|
Summary: A(u)), and InitFC([v]) ( v [v] · InitC(v)). Lemma 7.1 If the Abs and Conc steps u -(i, OpA, o)-> u and v -(j, Op... reliable by the theory of refinement, the ab- stract model is transformed into code in a manner that can... . There will be an abstract system Abs and a concrete one ... |
|||
|
Source: Banach, Richard - School of Computer Science, University of Manchester |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 75 | On the Construction of Multiphase Communicating Protocols * | ||
|
Summary: commit, aborted or is undecided. Phase inquire(2; 1) is similar. neg ab1 ab2 sent1 sent2 +ab1 init... abort abort +ab2 init fail sent init recd block block enq1 +enq1 +com1 com1 +blk blk ab1 ... |
|||
|
Source: Singh, Gurdip - Department of Computing and Information Sciences, Kansas State University |
|||
|
Collection: Mathematics ; Computer Technologies and Information Sciences |
|||
| 76 | A Random Number Generator Based on Isogenies Operations He Debiao*, Chen Jianhua, Hu Jin | ||
|
Summary: by 1548 34 55 as well. We can define the composition [2] of routes { }iA a= and { }iB b= as { }i iAB a b... = + . It's easy to get that routes are commutative: AB = BA. The computation of iosgeny between elliptic... is (1), the parameters is following. 1) pF : the finite field; 2) initE : an initial elliptic curve, its |
|||
|
Source: International Association for Cryptologic Research (IACR) - Cryptology ePrint Archive |
|||
|
Collection: Multidisciplinary Databases and Resources |
|||
| 77 | 1Sun 12 Apr 1992 [14:36] 1 ACTION DEFINITIONS | ||
|
Summary: A and B, we define A·B to be the action such that s[[A·B]]t = r : s[[A]]r r[[B]]t If v is the n... not occur free in A or B, then A·B = w : A(w/v ) B(w/v) For an action A, integer i > 0 Ai = IF i = 1... [[A]]s The following relations hold (A·B)-1 = (B-1 )·(A-1 ) (A+ )-1 = (A-1 )+ (A )-1 = (A-1 ) (in any action ... |
|||
|
Source: Lamport ,Leslie - Microsoft Research |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 78 | HMSC UML SDs Case-Study: EasyShop 2IW05 Software Specification | ||
|
Summary: Init Comm Fail Success msc System msc Init RecInitSenderInit Mousavi: Software Specification... #12;HMSC UML SDs Case-Study: EasyShop Repetition (with exit) Init Comm Fail Success msc System Mousavi... exit) Init Comm Fail Mousavi: Software Specification - Behavioral Specification ... |
|||
|
Source: Mousavi, Mohammad - Wiskunde en Informatica, Technische Universiteit Eindhoven |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 79 | Accurate and Efficient Fault Simulation of Realistic CMOS Network Breaks | ||
|
Summary: frames. Let ab denote one of the nine values of our logic algebra, where a; b 2 f0; 1; Xg, and a and b... at the nodes in FCN at t init is the same as the charge stored at t final , where t init denotes the beginning... differences are determined by the worst case voltage differences from t init to t final . ... |
|||
|
Source: Larrabee, Tracy - Department of Computer Engineering, University of California at Santa Cruz |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 80 | PUBLICKEY CRYPTOSYSTEM BASED ON Alexander Rostovtsev and Anton Stolbunov | ||
|
Summary: is representable as (7a) or (7b): p = a 2 + |D|b 2 , (7a) p = |D| + 1 4 a 2 + |D|ab + |D|b 2 , (7b) then the number... . Then the class AB corresponds to product of the ideals AB. The set of the ideal classes is the Abelian group... = {b i } as AB = {a i + b i }. Routes are commutative: ... |
|||
|
Source: International Association for Cryptologic Research (IACR) - Cryptology ePrint Archive |
|||
|
Collection: Multidisciplinary Databases and Resources |
|||
| 81 | Limiting Behavior of Markov Chains with Eager Attractors Parosh Aziz Abdulla | ||
|
Summary: the initial configuration q init # (channels initially empty) in the PLCS i# it is reachable in the Minsky ma... chine. (One needs to make sure that a total reset in any other controlstate than q init leads... to configuration q init # again without visiting q acc .) By adding a transi tion from q acc back to q ... |
|||
|
Source: Ìayr, Richard - School of Informatics, University of Edinburgh |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 82 | Laboratoire Bordelais de Recherche en Informatique UMR CNRS 5800 Universite de Bordeaux | ||
|
Summary: in the refinement step of our Cegar semi-algorithm that is based on recognizable partition ab- stractions. We give... their partition ab- stractions in Section 3. Refinement and extrapolation-based generation of path invariants... that is a simple path if ci = cj for all 0 i < j h. For any two sets Init C and Bad C of ... |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 83 | Information-Requirements Grammar: A Theory of the Structure of Competence for Interaction | ||
|
Summary: with this constraint. In Figure 1a, a cognitive init must overlap in time with the motor process that it causes... . The period of time during which information flows from the init to the click is illustrated with a faded... connector, representing the cascade, between them. In Figure 1b, the flow of information between the init |
|||
|
Source: Lewis, Richard - Departments of Psychology & Electrical Engineering and Computer Science, University of Michigan |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 84 | Universit Pierre et Marie Curie Master M1 "Mathmatiques et Applications" Priode 2 -2009/2010 Programmation en C/C++ | ||
|
Summary: (w, 1, 3, 2); cout << "u:\t" << u << endl; 16 u.init (44); cout << "u:\t" << u << endl; 18 cout << "v... des classes dérivées d'une classe abstraite AbsVect. La classe abstraite AbsVect On rappelle qu... AbsVect qui contient un champ protégé n dans lequel sera ... |
|||
|
Source: Benaych-Georges, Florent - Laboratoire de Probabilités et Modèles Aléatoires, Université Pierre-et-Marie-Curie, Paris 6 |
|||
|
Collection: Mathematics |
|||
| 85 | Dependent Type Theory of Stateful Higher-Order Functions | ||
|
Summary: :A. seleq(init, x, v1) && seleq(init, y, v2) ==> HId(mem, upd(upd(init, x, v2), y, v1))} = fn x. fn y... the computation has finished. Thus, the postcondition must depend on two heap variables init and mem which denote... that the heap variable mem from the precondition, and the heap variable ... |
|||
|
Source: Morrisett, Greg - School of Engineering and Applied Sciences, Harvard University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 86 | Journal of Artificial Intelligence Research 36 (2009) 471-511 Submitted 7/09; published 12/09 The Role of Macros in Tractable Planning | ||
|
Summary: as follows. Section 2 introduces notation and def- initions. Section 3 introduces the class IR of inverted... of the left operand. A planning problem is a tuple P = V, init, goal, A , where V is the set of variables... , init is an initial state, goal is a partial goal state, and A is a set of actions. An action a = pre |
|||
|
Source: Jonsson, Anders - Departament de Tecnologia, Universitat Pompeu Fabra |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 87 | 1 H^PKSVM 3 1.1 !^PKSVM '~^ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 | ||
|
Summary: /x.txt","no","Data/newdata/wdbc/y.txt","no"); §1.1.4 Nêâ é?n'êâcIx§¦&¤kêâ'ýéÑØv1" test.Scaling(init... ,Testing_error=0; vector |
|||
|
Source: Li, Tiejun - School of Mathematical Sciences, Peking University |
|||
|
Collection: Mathematics |
|||
| 88 | Dependent Type Theory of Stateful Higher-Order Functions Aleksandar Nanevski and Greg Morrisett | ||
|
Summary: :A. seleq(init, x, v1) && seleq(init, y, v2) ==> HId(mem, upd(upd(init, x, v2), y, v1))} = fn x. fn y... the computation has finished. Thus, the postcondition must depend on two heap variables init and mem which denote... that the heap variable mem from the precondition, and the heap variable ... |
|||
|
Source: Nanevski, Aleksandar - Madrid Institute for Advanced Studies in Software Development Technologies (IMDEA Software Institute) |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 89 | The must preorder revisited an algebraic theory for web services contracts | ||
|
Summary: . (Other languages, such as the Ab- stract business processes in the Web Service Business Execution... } : a.(bc), which happen to be equivalent according to , would produce the contracts {a, b, c} : a.b a... .c and {a, b, c} : a.(b + c), respectively, but only the latter one does actually satisfy the clients |
|||
|
Source: Torino, Università di - Dipartimento di Informatica |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 90 | Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets # | ||
|
Summary: positions above the current one: G# = ¬F¬#. The initial formulae LocTL init # (· · ·) are defined... with # # LocTL# (· · ·) and A # #. An initial formula # # LocTL init # (· · ·) defines the language L(#) = {t... # R | t |= #} and we say that a trace language L # R is expressible in LocTL init |
|||
|
Source: Ecoles Normales Supérieures de Cachan, Laboratoire Spécification et Vérification |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 91 | INFINITY 2005 Preliminary Version Abstract Regular Tree Model Checking | ||
|
Summary: their states having an equal language of trees up to some bounded height. Then, we propose an ab- straction... transducer . We are given a tree automaton Init encoding the set of initial states. For safety properties... problem consists in deciding whether (L(Init)) L(Bad) = (1) This problem is in general undecidable (an |
|||
|
Source: Ecole Polytechnique, Centre de mathématiques |
|||
|
Collection: Mathematics |
|||
| 92 | Behavioural Subtyping for a TypeTheoretic Model of Objects | ||
|
Summary: with s; m) For SC j Sig I or SC j (Class I with meth; init) with I(X) = f: : : ; l : A!B; : : :g: \Gamma... of the methods, and an initial state. An example of a class type is CounterClass = (Class CounterI with init; m... ) where init = fx = 1g m = s:fx : Natg: fget = s:x; count = fx = s:x + 1gg ... |
|||
|
Source: Kent, University of - Computing Laboratory |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 93 | StreamIt: A Language for Streaming Applications William Thies, Michal Karczmarek, and Saman Amarasinghe | ||
|
Summary: -Verlag class FIRFilter extends Filter { float[] weights; int N; void init(float[] weights) { set... .pop(); output.push(sum); } } class Main extends Pipeline { void init() { add(new DataSource()); add... be declared in the filter's init function. If a filter violates the declared rates, StreamIt throws a runtime |
|||
|
Source: Amarasinghe, Saman - Computer Science and Artificial Intelligence Laboratory & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT); Wood, David A. - Department of Computer Sciences, University of Wisconsin at Madison |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 94 | Named Entity Recognition: A Maximum Entropy Approach Using Global Information | ||
|
Summary: Feature Starts with a capital Mr. InitCap- letter, ends with a period Period Contains only one A One... Cap capital letter All capital letters and CORP. AllCaps- period Period Contains a digit AB3, Contain- 747... and Zone: If the token starts with a capi- tal letter (initCaps), then an additional feature ... |
|||
|
Source: Association for Computational Linguistics (ACL) Anthology; Ng, Hwee Tou - Department of Computational Science, National University of Singapore |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 95 | Published: April 21, 2011 r 2011 American Chemical Society 4941 dx.doi.org/10.1021/jp110435p |J. Phys. Chem. A 2011, 115, 49414950 | ||
|
Summary: An alternative approach is to use ab initio molecular dynamics (AI-MD) for RD simulations of reacting systems... reaction InitA. b Reaction energies (kcal/mol) from ReaxFF and QM are compared. #12;4944 dx.doi.org/10... initial decom- position reactions, as shown in Table 1. · InitA: The initial reaction A involves ring |
|||
|
Source: Goddard III, William A. - Materials and Process Simulation Center & Department of Chemistry, California Institute of Technology |
|||
|
Collection: Materials Science |
|||
| 96 | Type Systems, Software Architecture and Testing Stuart O. Anderson | ||
|
Summary: that the input to gen is a pair: fun specsys gen p1 p2 init = let fun fm a b = a,b fun gob NEXT t = t in sys gen... syserr p2 init = let fun p1 a = a fun gen a = a fun fm a b = a,b fun gob NEXT t = t in sys gen p1 p2 fm... 'b and type constructors that generate new types from old: e.g. ... |
|||
|
Source: Richardson, Debra J. - School of Information and Computer Science, University of California, Irvine |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 97 | Verified Java Bytecode Verification Gerwin Klein | ||
|
Summary: instantiiert wird. Diese decken s¨amtliche interessanten Eigenschaften der Java-Plattform ab: Klassen, Objekte |
|||
|
Source: Klein, Gerwin - National ICT Australia (NICTA) |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 98 | Under consideration for publication in Formal Aspects of Computing HYPE: Hybrid modelling by | ||
|
Summary: , Informatics Forum, 10 Crichton Street, Edinburgh EH8 9AB. e-mail: Vashti.Galpin@ed.ac.uk #12;2 V. Galpin, L... , const).Heat + init : (h, 0, const).Heat This is a summation of prefixes. Each prefix consists of two... values of variables. In the example, the events are on, switching on; off, switching off and init |
|||
|
Source: Hillston, Jane - School of Informatics, University of Edinburgh |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 99 | CS 352 Midterm Two (3/12/09) name__________________ | ||
|
Summary: /12/09) name__________________ #12;1. Given the following grammar: S > AB A > cAa | + B... > Bb | b (1). Present the rightmost derivation for string c+abb. S>AB>ABb>Abb>cAabb>c+abb (2... $ Shift $Ab b$ reduce ... |
|||
|
Source: Zhang, Xiangyu - Department of Computer Sciences, Purdue University |
|||
|
Collection: Computer Technologies and Information Sciences |
|||
| 100 | Equipe Logical LIX, Ecole Polytechnique | ||
|
Summary: AB = 0 ## A = B Signed area S : Point # Point # Point # F SABC = S CAB SABC = - SBAC Chasles... 'axiom SABC = 0 # AB + BC = AC Dimension # A, B, C : Point, SABC #= 0 SABC = SDBC + SADC + SABD Construction... #r : F #P : P oint, SABP = 0 # AP = rAB A #= B # SABP = 0 # AP = rAB # SABP # = 0 # AP # = ... |
|||
|
Source: Narboux, Julien - Département Informatique, Université de Strasbourg |
|||
|
Collection: Computer Technologies and Information Sciences |
|||