A Language for Task Orchestration and its Semantic Properties
|
|
- Ami Walker
- 6 years ago
- Views:
Transcription
1 DEPARTMENT OF COMPUTER SCIENCES A Language for Task Orchestration and its Semantic Properties David Kitchin, William Cook and Jayadev Misra Department of Computer Science University of Texas at Austin dkitchin,wcook,misra@cs.utexas.edu web: UNIVERSITY OF TEXAS AT AUSTIN 0
2 DEPARTMENT OF COMPUTER SCIENCES Overview of Orc Orchestration language. Invoke services by calling sites Manage time-outs, priorities, and failures Structured concurrent programming. A Program execution calls sites, publishes values. Simple calculus, with only 3 combinators. Semantics described by labeled transition system and traces Easy to create and terminate processes Prototype implementation available. UNIVERSITY OF TEXAS AT AUSTIN 1
3 DEPARTMENT OF COMPUTER SCIENCES Structure of Orc Expression Simple: just a site call, ÆÆ µ Publishes the value returned by the site. composition of two Orc expressions: do and in parallel Symmetric composition for all Ü from do Ü Piping for some Ü from do ÛÖ Ü¾ Asymmetric composition UNIVERSITY OF TEXAS AT AUSTIN 2
4 DEPARTMENT OF COMPUTER SCIENCES Symmetric composition: ÆÆ : calls both ÆÆ and simultaneously. Publishes values returned by both sites. ( ¼, ½ or ¾ values) Evaluate and independently. Publish all values from both. No direct communication or interaction between and. They may communicate only through sites. UNIVERSITY OF TEXAS AT AUSTIN 3
5 Ü µ Ý Ùµ DEPARTMENT OF COMPUTER SCIENCES Pipe: Ü For all values published by do. Publish only the values from. ÆÆ Ü ÑÐ Ö Üµ ÆÆ Call. Bind result (if any) to Ü. ÑÐ Ö Call ܵ. Publish the value, if any, returned by ÑÐ. ÆÆ µ Ü ÑÐ Ö Üµ May ÑÐ call twice. Publishes up to two values from ÑÐ. Notation: Write for Ü if Ü unused in. Precedence: Ü Ý Ù UNIVERSITY OF TEXAS AT AUSTIN 4
6 DEPARTMENT OF COMPUTER SCIENCES Schematic of piping f g0 g1 g2 Figure 1: Schematic of Ü UNIVERSITY OF TEXAS AT AUSTIN 5
7 DEPARTMENT OF COMPUTER SCIENCES Asymmetric parallel composition: ÛÖ Ü¾ µ For some value published by do. Publish only the values from. ܵ ÛÖ Ü¾ ÆÆ µ ÑÐ Ö Ü Binds to the first value ÆÆ from. Evaluate and in parallel. Site calls that Ü need are suspended; other site calls proceed. Å Æ Üµµ ÛÖ Ü¾ When returns a value, assign it to Ü and terminate. Resume suspended calls. Values published by are the values of ÛÖ Ü¾ µ. UNIVERSITY OF TEXAS AT AUSTIN 6
8 DEPARTMENT OF COMPUTER SCIENCES Some Fundamental Sites ¼: never responds. ÐØ Ü Ý µ: returns a tuple of its argument values. µ: boolean, returns a signal if is true; remains silent if is false. ËÒÐ returns a signal immediately. Same as trueµ. ÊØÑÖ Øµ: integer Ø, Ø ¼, returns a signal Ø time units later. UNIVERSITY OF TEXAS AT AUSTIN 7
9 ÅÐÇÒ µ ѵ ÛÖ Ñ¾ ÆÆ µ ÑРص ÅÐÄÓÓÔ ÊØÑÖ Øµ ÅÐÄÓÓÔ Øµ ÅÐÇÒ µ DEPARTMENT OF COMPUTER SCIENCES Expression Definition Expression is called like a procedure. May publish many ÅÐÄÓÓÔ values. does not publish a value. Site calls are strict; expression calls non-strict. UNIVERSITY OF TEXAS AT AUSTIN 8
10 DEPARTMENT OF COMPUTER SCIENCES Metronome Publish a signal at every time unit. ÅØÖÓÒÓÑ ËÒÐ ÊØÑÖ ½µ ÅØÖÓÒÓÑ S R S R Publish Ò signals. Å ¼µ ¼ Å Òµ ËÒÐ ÊØÑÖ ½µ Å Ò ½µ UNIVERSITY OF TEXAS AT AUSTIN 9
11 ØÐÐÝ Å Å˵ Å ÐØ ½µ ÊØÑÖ ½¼µ ÐØ ¼µ Ù¾ ØÐÐÝ Å˵ Ú¾ DEPARTMENT OF COMPUTER SCIENCES Recursive definition with time-out Call a list of sites. Count the number of responses received within 10 time units. ØÐÐÝ µ ÐØ ¼µ Ú Ù where UNIVERSITY OF TEXAS AT AUSTIN 10
12 DEPARTMENT OF COMPUTER SCIENCES Time-out Return Ü trueµ if Å returns Ü before Ø, and falseµ otherwise. µ ÐØ Þ where µ¾ Þ Ü ÐØ Ü trueµ Å ÊØÑÖ Øµ Ü ÐØ Ü falseµ UNIVERSITY OF TEXAS AT AUSTIN 11
13 DEPARTMENT OF COMPUTER SCIENCES Fork-join parallelism Call Å and Æ in parallel. Return their values as a tuple after both respond. Úµ ÐØ Ù Ù¾ Å where Ú¾ Æ UNIVERSITY OF TEXAS AT AUSTIN 12
14 µ DEPARTMENT OF COMPUTER SCIENCES Barrier Synchronization in Å Æ and start only after both Å and Æ complete. ( ÐØ Ù Úµ where Ù¾ Å Ú¾ Æ ) UNIVERSITY OF TEXAS AT AUSTIN 13
15 DEPARTMENT OF COMPUTER SCIENCES Arbitration In CCS: «È É In Orc: µ È µ É where ÐÔ ÐØ trueµ Ø ÐØ falseµ ¾ Orc does not permit non-deterministic internal choice. UNIVERSITY OF TEXAS AT AUSTIN 14
16 DEPARTMENT OF COMPUTER SCIENCES Priority Publish Æ s response asap, but no earlier than 1 unit from now. ÐÝ ÊØÑÖ ½µ ÐØ Ùµµ ÛÖ Ù¾ Æ Call Å, Æ together. Å If responds within one unit, take its response. Else, pick the first response. ÐØ Üµ ÛÖ Ü¾ Å Ðݵ UNIVERSITY OF TEXAS AT AUSTIN 15
17 Ø Üµ Ø Ýµ ÓÖ Ü Ýµ Þ¾ Šܾ DEPARTMENT OF COMPUTER SCIENCES Parallel or Sites Å and Æ return booleans. Compute their parallel or. Ø µ µ ÐØ trueµ: returns true if is true; silent otherwise. Ø Ýµ ÓÖ Ü Ýµ Ø Üµ where ܾ Šݾ Æ To return just one value: ÐØ Þµ where ݾ Æ UNIVERSITY OF TEXAS AT AUSTIN 16
18 DEPARTMENT OF COMPUTER SCIENCES Formal Syntax ¾ ÜÔÖ ::= Å Ôµ Site call Ôµ Expression call Ü Sequential composition Symmetric composition ÛÖ Ü¾ Asymmetric composition Ô ¾ ØÙÐ ::= Ü Ú Å Ò ::= ܵ UNIVERSITY OF TEXAS AT AUSTIN 17
19 DEPARTMENT OF COMPUTER SCIENCES Transitions, Events ¼ : may engage in event and transit to ¼. Base events ::= Ú publish ÚÒØ internal event Å Úµ Site call with handle Ú Response Response is outside the control of Orc. UNIVERSITY OF TEXAS AT AUSTIN 18
20 Úµ Å Úµ Å Ú ÐØ Úµ DEPARTMENT OF COMPUTER SCIENCES Rules for Site Call fresh Ú ¼ ÐØ Úµ UNIVERSITY OF TEXAS AT AUSTIN 19
21 ¼ ¼ ¼ ¼ DEPARTMENT OF COMPUTER SCIENCES Symmetric Composition UNIVERSITY OF TEXAS AT AUSTIN 20
22 Ú ¼ DEPARTMENT OF COMPUTER SCIENCES Piping ¼ Ú Ü ¼ Ü Ü ¼ Ü µ ÚÜ UNIVERSITY OF TEXAS AT AUSTIN 21
23 ¼ Ú ¼ ÚÜ ÛÖ Ü¾ ¼ DEPARTMENT OF COMPUTER SCIENCES Asymmetric Composition ÛÖ Ü¾ ¼ ÛÖ Ü¾ ÛÖ Ü¾ ¼ Ú ÛÖ Ü¾ UNIVERSITY OF TEXAS AT AUSTIN 22
24 DEPARTMENT OF COMPUTER SCIENCES Expression Call ܵ ¾ ÔÜ Ôµ UNIVERSITY OF TEXAS AT AUSTIN 23
25 Úµ Å Úµ Å Ú ÐØ Úµ ¼ ¼ ¼ ¼ Ú ¼ Ú ¼ ¼ ÚÜ ÛÖ Ü¾ ¼ DEPARTMENT OF COMPUTER SCIENCES Rules ¼ Ú fresh Ü ¼ Ü Ü ¼ Ü µ ÚÜ Ú ¼ ÐØ Úµ ÛÖ Ü¾ ¼ ÛÖ Ü¾ ÛÖ Ü¾ ܵ ¾ ¼ Ú ÔÜ ÛÖ Ü¾ Ôµ UNIVERSITY OF TEXAS AT AUSTIN 24
26 Šܵ ÐØ Üµµ Ý Ê Ýµµ ÛÖ Ü¾ Æ Ëµ Šܵ ÐØ Üµµ Ý Ê Ýµµ ÛÖ Ü¾ Æ µ Šܵ ÐØ Üµµ Ý Ê Ýµµ ÛÖ Ü¾ Ð µ Ð Ð Ð ÐØ µ; Ð Ð ÐØ µ Šܵ ÐØ Üµµ Ý Ê Ýµµ ÛÖ Ü¾ ÐØ µ µ DEPARTMENT OF COMPUTER SCIENCES Example Ë Call Ë : ; Æ Ë Ë Æ Ë Ë Ð Æ Æ Call UNIVERSITY OF TEXAS AT AUSTIN 25
27 Šܵ ÐØ Üµµ Ý Ê Ýµµ ÛÖ Ü¾ ÐØ µ µ ¼; ÐØ µ Å µ ÐØ µµ Ý Ê Ýµ Å µ ¼µ Ý Ê Ýµµ Ê µ ¼ DEPARTMENT OF COMPUTER SCIENCES Example ÐØ µ ¼; Å µ ÐØ µ Å µ ¼; ÐØ µ Ú ¼ implies Ý ¼ Ý µ ÚÝ Ò µ Ê Ê call with (5) argument Å µ ¼µ Ý Ê Ýµµ Ò UNIVERSITY OF TEXAS AT AUSTIN 26
28 Ò Ò Ò ÐØ µ Å µ ¼µ Ý Ê Ýµµ ÐØ µ ÐØ µ ¼ Å µ ¼µ Ý Ê Ýµµ ¼ DEPARTMENT OF COMPUTER SCIENCES Example Å µ ¼µ Ý Ê Ýµµ Ò The sequence of events: Ë Æ Ð Ð Ê Ò µ Ò The sequence minus events: Ë Æ Ð Ð Ê Ò µ Ò UNIVERSITY OF TEXAS AT AUSTIN 27
29 µ ¼ DEPARTMENT OF COMPUTER SCIENCES Executions and Traces Define µ ¼¼ ¼¼ µ ¼, ¼ is an execution of. µ Given A trace is an execution minus events. The set of executions of (and traces) are prefix-closed. UNIVERSITY OF TEXAS AT AUSTIN 28
30 ¼ Ü ¼ DEPARTMENT OF COMPUTER SCIENCES Laws, using strong bisimulation ¼ µ µ Ü Ý µ Ü µ Ý, if is Ü-free. µ Ü Ü Ü µ ÛÖ Ü¾ ÛÖ Ü¾ µ, if is Ü-free. Ý µ ÛÖ Ü¾ ÛÖ Ü¾ µ Ý, if is Ü-free. ÛÖ Ü¾ µ ÛÖ Ý¾ ÛÖ Ý¾ µ ÛÖ Ü¾, if is Ý -free, is Ü-free. UNIVERSITY OF TEXAS AT AUSTIN 29
31 1. Ü Ü 2. Ü Ü ÛÖ Ü¾ ÛÖ Ü¾ 3. ÛÖ Ü¾ ÛÖ Ü¾ DEPARTMENT OF COMPUTER SCIENCES Relation is an equality Given, show UNIVERSITY OF TEXAS AT AUSTIN 30
32 Then we can t show ÐØ Üµ ÐØ Ýµ ÐØ Ýµ ÐØ Üµ DEPARTMENT OF COMPUTER SCIENCES Treatment of Free Variables Closed Open expression: No free variable. expression: Has free variable. Law holds only if both and are closed. ÐØ Üµ ¼ Otherwise: But ÐØ ½µ Ü ¼ ÐØ ½µ Ü ÐØ Üµ UNIVERSITY OF TEXAS AT AUSTIN 31
33 ÚÜ DEPARTMENT OF COMPUTER SCIENCES Substitution Event ÚÜ ÚÜ (SUBST) Now, ½Ü ÐØ Üµ ÐØ ½µ. So, ÐØ Üµ ¼ From ÚÜ ÚÜ, we can not conclude: Earlier rules apply to base events only. ÚÜ UNIVERSITY OF TEXAS AT AUSTIN 32
34 DEPARTMENT OF COMPUTER SCIENCES Traces as Denotations Define Orc combinators over trace sets, Ë and Ì. Define: Ë Ì, Ë Ü Ì, Ë ÛÖ Ü¾ Ì. Notation: is the set of traces of. Theorem Ü Ü ÛÖ Ü¾ ÛÖ Ü¾ UNIVERSITY OF TEXAS AT AUSTIN 33
35 1. Ü 2. Ü Ü Ü ÛÖ Ü¾ 3. ÛÖ Ü¾ ÛÖ Ü¾ ÛÖ Ü¾ DEPARTMENT OF COMPUTER SCIENCES Expressions are equal if their trace sets are equal Define: if. Theorem (Combinators preserve ) Given and any combinator :, Specifically, given UNIVERSITY OF TEXAS AT AUSTIN 34
36 DEPARTMENT OF COMPUTER SCIENCES Monotonicity, Continuity Define: Ú if. Theorem (Monotonicity) Ú Given and any combinator Ú, Ú Chain : ¼ Ú ½ Ú ½. Ø Theorem: µ Ø µ. Theorem: Ø µ Ø µ. UNIVERSITY OF TEXAS AT AUSTIN 35
37 ¼ Å ½ Å ¼ Ë Ê Å, ¼ DEPARTMENT OF COMPUTER SCIENCES Least Fixed Point Å Ë Ê Å Å is the least upper bound of the chain Å ¼ Ú Å ½ Ú UNIVERSITY OF TEXAS AT AUSTIN 36
38 DEPARTMENT OF COMPUTER SCIENCES Weak Bisimulation ÒÐ Ü ÐØ Üµ UNIVERSITY OF TEXAS AT AUSTIN 37
39 DEPARTMENT OF COMPUTER SCIENCES Theoretical Justification for Simplicity of Orc Simple trace semantics. Monotonicity, continuity of the combinators. Least fixed point characterizations of recursive definitions. Enjoys properties of functional programs, yet highly non-detrministic. UNIVERSITY OF TEXAS AT AUSTIN 38
40 DEPARTMENT OF COMPUTER SCIENCES Extensions Time Synchrony Immediate sites UNIVERSITY OF TEXAS AT AUSTIN 39
Narrowing confidence interval width of PAC learning risk function by algorithmic inference
Narrowing confidence interval width of PAC learning risk function by algorithmic inference Bruno Apolloni, Dario Malchiodi Dip. di Scienze dell Informazione, Università degli Studi di Milano Via Comelico
More informationApplications of Discrete Mathematics to the Analysis of Algorithms
Applications of Discrete Mathematics to the Analysis of Algorithms Conrado Martínez Univ. Politècnica de Catalunya, Spain May 2007 Goal Given some algorithm taking inputs from some set Á, we would like
More informationRandomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity
Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity László Babai Peter G. Kimmel Department of Computer Science The University of Chicago 1100 East 58th Street Chicago,
More informationBlock vs. Stream cipher
Block vs. Stream cipher Idea of a block cipher: partition the text into relatively large (e.g. 128 bits) blocks and encode each block separately. The encoding of each block generally depends on at most
More informationOperational domain theory and topology of a sequential programming language
Operational domain theory and topology of a sequential programming language Martín Escardó Ho Weng Kin School of Computer Science, University of Birmingham, UK, revised 17th October 2005 Abstract A number
More informationFast Fourier Transform Solvers and Preconditioners for Quadratic Spline Collocation
Fast Fourier Transform Solvers and Preconditioners for Quadratic Spline Collocation Christina C. Christara and Kit Sun Ng Department of Computer Science University of Toronto Toronto, Ontario M5S 3G4,
More informationEquality and Monodic First-Order Temporal Logic
Equality and Monodic First-Order Temporal Logic Anatoli Degtyarev, Michael Fisher, and Alexei Lisitsa Logic and Computation Group, Department of Computer Science University of Liverpool, Liverpool L69
More informationLund Institute of Technology Centre for Mathematical Sciences Mathematical Statistics
Lund Institute of Technology Centre for Mathematical Sciences Mathematical Statistics STATISTICAL METHODS FOR SAFETY ANALYSIS FMS065 ÓÑÔÙØ Ö Ü Ö Ì ÓÓØ ØÖ Ô Ð ÓÖ Ø Ñ Ò Ý Ò Ò ÐÝ In this exercise we will
More informationÇÙÐ Ò ½º ÅÙÐ ÔÐ ÔÓÐÝÐÓ Ö Ñ Ò Ú Ö Ð Ú Ö Ð ¾º Ä Ò Ö Ö Ù Ð Ý Ó ËÝÑ ÒÞ ÔÓÐÝÒÓÑ Ð º Ì ÛÓ¹ÐÓÓÔ ÙÒÖ Ö Ô Û Ö Ö ÖÝ Ñ ¹ ÝÓÒ ÑÙÐ ÔÐ ÔÓÐÝÐÓ Ö Ñ
ÅÙÐ ÔÐ ÔÓÐÝÐÓ Ö Ñ Ò ÝÒÑ Ò Ò Ö Ð Ö Ò Ó Ò Ö ÀÍ ÖÐ Òµ Ó Ò ÛÓÖ Û Ö Ò ÖÓÛÒ Ö Ú ½ ¼¾º ¾½ Û Åº Ä Ö Ö Ú ½ ¼¾º ¼¼ Û Äº Ñ Ò Ëº Ï ÒÞ ÖÐ Å ÒÞ ½ º¼ º¾¼½ ÇÙÐ Ò ½º ÅÙÐ ÔÐ ÔÓÐÝÐÓ Ö Ñ Ò Ú Ö Ð Ú Ö Ð ¾º Ä Ò Ö Ö Ù Ð Ý Ó ËÝÑ
More informationThe Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies Parikshit Gopalan Georgia Tech. parik@cc.gatech.edu Phokion G. Kolaitis Ý IBM Almaden. kolaitis@us.ibm.com Christos
More informationHomomorphism Preservation Theorem. Albert Atserias Universitat Politècnica de Catalunya Barcelona, Spain
Homomorphism Preservation Theorem Albert Atserias Universitat Politècnica de Catalunya Barcelona, Spain Structure of the talk 1. Classical preservation theorems 2. Preservation theorems in finite model
More informationu x + u y = x u . u(x, 0) = e x2 The characteristics satisfy dx dt = 1, dy dt = 1
Õ 83-25 Þ ÛÐ Þ Ð ÚÔÜØ Þ ÝÒ Þ Ô ÜÞØ ¹ 3 Ñ Ð ÜÞ u x + u y = x u u(x, 0) = e x2 ÝÒ Þ Ü ÞØ º½ dt =, dt = x = t + c, y = t + c 2 We can choose c to be zero without loss of generality Note that each characteristic
More informationVARIATIONAL CALCULUS IN SPACE OF MEASURES AND OPTIMAL DESIGN
Chapter 1 VARIATIONAL CALCULUS IN SPACE OF MEASURES AND OPTIMAL DESIGN Ilya Molchanov Department of Statistics University of Glasgow ilya@stats.gla.ac.uk www.stats.gla.ac.uk/ ilya Sergei Zuyev Department
More informationSME 3023 Applied Numerical Methods
UNIVERSITI TEKNOLOGI MALAYSIA SME 3023 Applied Numerical Methods Ordinary Differential Equations Abu Hasan Abdullah Faculty of Mechanical Engineering Sept 2012 Abu Hasan Abdullah (FME) SME 3023 Applied
More informationMargin Maximizing Loss Functions
Margin Maximizing Loss Functions Saharon Rosset, Ji Zhu and Trevor Hastie Department of Statistics Stanford University Stanford, CA, 94305 saharon, jzhu, hastie@stat.stanford.edu Abstract Margin maximizing
More informationhal , version 1-27 Mar 2014
Author manuscript, published in "2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), New York, NY. : United States (2005)" 2 More formally, we denote by
More informationA Spatial Logic for Concurrency
A Spatial Logic for Concurrency (Part I) Luís Caires Departamento de Informática FCT/UNL, Lisboa, Portugal Luca Cardelli Microsoft Research, Cambridge, UK Abstract We present a logic that can express properties
More informationLA PRISE DE CALAIS. çoys, çoys, har - dis. çoys, dis. tons, mantz, tons, Gas. c est. à ce. C est à ce. coup, c est à ce
> ƒ? @ Z [ \ _ ' µ `. l 1 2 3 z Æ Ñ 6 = Ð l sl (~131 1606) rn % & +, l r s s, r 7 nr ss r r s s s, r s, r! " # $ s s ( ) r * s, / 0 s, r 4 r r 9;: < 10 r mnz, rz, r ns, 1 s ; j;k ns, q r s { } ~ l r mnz,
More informationGeneral Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations
General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations OFER ARIELI AND ARNON AVRON, Department of Computer Science, School of Mathematical Sciences, Tel-Aviv University,
More informationCONVEX OPTIMIZATION OVER POSITIVE POLYNOMIALS AND FILTER DESIGN. Y. Genin, Y. Hachez, Yu. Nesterov, P. Van Dooren
CONVEX OPTIMIZATION OVER POSITIVE POLYNOMIALS AND FILTER DESIGN Y. Genin, Y. Hachez, Yu. Nesterov, P. Van Dooren CESAME, Université catholique de Louvain Bâtiment Euler, Avenue G. Lemaître 4-6 B-1348 Louvain-la-Neuve,
More informationQuantum Algorithms for Element Distinctness
Quantum Algorithms for Element Distinctness Harry Buhrman Christoph Dürr Þ Mark Heiligman Ü Peter Høyer ß Frédéric Magniez Miklos Santha Ronald de Wolf ÝÝ Abstract We present several applications of quantum
More informationSKMM 3023 Applied Numerical Methods
UNIVERSITI TEKNOLOGI MALAYSIA SKMM 3023 Applied Numerical Methods Ordinary Differential Equations ibn Abdullah Faculty of Mechanical Engineering Òº ÙÐÐ ÚºÒÙÐÐ ¾¼½ SKMM 3023 Applied Numerical Methods Ordinary
More informationFrequency domain representation and singular value decomposition
EOLSS Contribution 643134 Frequency domain representation and singular value decomposition AC Antoulas Department of Electrical and Computer Engineering Rice University Houston, Texas 77251-1892, USA e-mail:
More informationThis document has been prepared by Sunder Kidambi with the blessings of
Ö À Ö Ñ Ø Ò Ñ ÒØ Ñ Ý Ò Ñ À Ö Ñ Ò Ú º Ò Ì ÝÊ À Å Ú Ø Å Ê ý Ú ÒØ º ÝÊ Ú Ý Ê Ñ º Å º ² ºÅ ý ý ý ý Ö Ð º Ñ ÒÜ Æ Å Ò Ñ Ú «Ä À ý ý This document has been prepared by Sunder Kidambi with the blessings of Ö º
More informationA New Category for Semantics
A New Category for Semantics Andrej Bauer and Dana Scott June 2001 Domain theory for denotational semantics is over thirty years old. There are many variations on the idea and many interesting constructs
More informationF O R SOCI AL WORK RESE ARCH
7 TH EUROPE AN CONFERENCE F O R SOCI AL WORK RESE ARCH C h a l l e n g e s i n s o c i a l w o r k r e s e a r c h c o n f l i c t s, b a r r i e r s a n d p o s s i b i l i t i e s i n r e l a t i o n
More informationForward and Backward Chaining in Linear Logic
Forward and Backward Chaining in Linear Logic James Harland ½ David Pym ¾ Michael Winikoff ½ ½ Department of Computer Science, Royal Melbourne Institute of Technology ¾ Queen Mary and Westfield College,
More informationSelf-Testing Polynomial Functions Efficiently and over Rational Domains
Chapter 1 Self-Testing Polynomial Functions Efficiently and over Rational Domains Ronitt Rubinfeld Madhu Sudan Ý Abstract In this paper we give the first self-testers and checkers for polynomials over
More informationFramework for functional tree simulation applied to 'golden delicious' apple trees
Purdue University Purdue e-pubs Open Access Theses Theses and Dissertations Spring 2015 Framework for functional tree simulation applied to 'golden delicious' apple trees Marek Fiser Purdue University
More informationarxiv: v1 [math.dg] 19 Mar 2012
BEREZIN-TOEPLITZ QUANTIZATION AND ITS KERNEL EXPANSION XIAONAN MA AND GEORGE MARINESCU ABSTRACT. We survey recent results [33, 34, 35, 36] about the asymptotic expansion of Toeplitz operators and their
More information! " # $! % & '! , ) ( + - (. ) ( ) * + / 0 1 2 3 0 / 4 5 / 6 0 ; 8 7 < = 7 > 8 7 8 9 : Œ Š ž P P h ˆ Š ˆ Œ ˆ Š ˆ Ž Ž Ý Ü Ý Ü Ý Ž Ý ê ç è ± ¹ ¼ ¹ ä ± ¹ w ç ¹ è ¼ è Œ ¹ ± ¹ è ¹ è ä ç w ¹ ã ¼ ¹ ä ¹ ¼ ¹ ±
More informationRandom Matrices and Transfer Matrix Techniques for the Integer Quantum Hall Effect
Random Matrices and Transfer Matrix Techniques for the Integer Quantum Hall Effect Dissertation zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften an der Mathematisch-Naturwissenschaftlichen
More informationA Generalization of Principal Component Analysis to the Exponential Family
A Generalization of Principal Component Analysis to the Exponential Family Michael Collins Sanjoy Dasgupta Robert E. Schapire AT&T Labs Research 8 Park Avenue, Florham Park, NJ 7932 mcollins, dasgupta,
More informationOptimal Routing Policy in Two Deterministic Queues
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Optimal Routing Policy in Two Deterministic Queues Bruno Gaujal Emmanuel Hyon N 3997 Septembre 2000 THÈME 1 ISSN 0249-6399 ISRN INRIA/RR--3997--FR+ENG
More informationMonodic Temporal Resolution
Monodic Temporal Resolution ANATOLY DEGTYAREV Department of Computer Science, King s College London, London, UK. and MICHAEL FISHER and BORIS KONEV Department of Computer Science, University of Liverpool,
More informationAn EM algorithm for Batch Markovian Arrival Processes and its comparison to a simpler estimation procedure
An EM algorithm for Batch Markovian Arrival Processes and its comparison to a simpler estimation procedure Lothar Breuer (breuer@info04.uni-trier.de) University of Trier, Germany Abstract. Although the
More informationAn Example file... log.txt
# ' ' Start of fie & %$ " 1 - : 5? ;., B - ( * * B - ( * * F I / 0. )- +, * ( ) 8 8 7 /. 6 )- +, 5 5 3 2( 7 7 +, 6 6 9( 3 5( ) 7-0 +, => - +< ( ) )- +, 7 / +, 5 9 (. 6 )- 0 * D>. C )- +, (A :, C 0 )- +,
More informationOn Urquhart s C Logic
On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced
More informationObservations on the Stability Properties of Cooperative Systems
1 Observations on the Stability Properties of Cooperative Systems Oliver Mason and Mark Verwoerd Abstract We extend two fundamental properties of positive linear time-invariant (LTI) systems to homogeneous
More informationDenotational semantics
Denotational semantics Semantics and Application to Program Verification Antoine Miné École normale supérieure, Paris year 2015 2016 Course 4 4 March 2016 Course 4 Denotational semantics Antoine Miné p.
More informationSKMM 3023 Applied Numerical Methods
SKMM 3023 Applied Numerical Methods Solution of Nonlinear Equations ibn Abdullah Faculty of Mechanical Engineering Òº ÙÐÐ ÚºÒÙÐÐ ¾¼½ SKMM 3023 Applied Numerical Methods Solution of Nonlinear Equations
More informationAnalysis of Spectral Kernel Design based Semi-supervised Learning
Analysis of Spectral Kernel Design based Semi-supervised Learning Tong Zhang IBM T. J. Watson Research Center Yorktown Heights, NY 10598 Rie Kubota Ando IBM T. J. Watson Research Center Yorktown Heights,
More informationCost Distribution Shaping: The Relations Between Bode Integral, Entropy, Risk-Sensitivity, and Cost Cumulant Control
Cost Distribution Shaping: The Relations Between Bode Integral, Entropy, Risk-Sensitivity, and Cost Cumulant Control Chang-Hee Won Abstract The cost function in stochastic optimal control is viewed as
More informationProving observational equivalence with ProVerif
Proving observational equivalence with ProVerif Bruno Blanchet INRIA Paris-Rocquencourt Bruno.Blanchet@inria.fr based on joint work with Martín Abadi and Cédric Fournet and with Vincent Cheval June 2015
More informationOn the Performance of Random Vector Quantization Limited Feedback Beamforming in a MISO System
1 On the Performance of Random Vector Quantization Limited Feedback Beamforming in a MISO System Chun Kin Au-Yeung, Student Member, IEEE, and David J. Love, Member, IEEE Abstract In multiple antenna wireless
More informationTwo-scale homogenization of a hydrodynamic Elrod-Adams model
March 2004 1 Two-scale homogenization of a hydrodynamic Elrod-Adams model G. Bayada MAPLY CNRS UMR-5585 / LAMCOS CNRS UMR-5514, INSA Lyon, 69621 Villeurbanne cedex, France S. Martin MAPLY CNRS UMR-5585,
More informationSME 3023 Applied Numerical Methods
UNIVERSITI TEKNOLOGI MALAYSIA SME 3023 Applied Numerical Methods Solution of Nonlinear Equations Abu Hasan Abdullah Faculty of Mechanical Engineering Sept 2012 Abu Hasan Abdullah (FME) SME 3023 Applied
More informationHITCHIN KOBAYASHI CORRESPONDENCE, QUIVERS, AND VORTICES INTRODUCTION
ËÁ Ì ÖÛÒ ËÖĐÓÒÖ ÁÒØÖÒØÓÒÐ ÁÒ ØØÙØ ÓÖ ÅØÑØÐ ÈÝ ÓÐØÞÑÒÒ ¹½¼¼ ÏÒ Ù ØÖ ÀØÒßÃÓÝ ÓÖÖ ÓÒÒ ÉÙÚÖ Ò ÎÓÖØ ÄÙ ÐÚÖÞßÓÒ ÙÐ Ç Ö ÖßÈÖ ÎÒÒ ÈÖÖÒØ ËÁ ½¾ ¾¼¼ µ ÂÒÙÖÝ ½ ¾¼¼ ËÙÓÖØ Ý Ø Ù ØÖÒ ÖÐ ÅÒ ØÖÝ Ó ÙØÓÒ ËÒ Ò ÙÐØÙÖ ÚÐÐ Ú
More informationCausality and Boundary of wave solutions
Causality and Boundary of wave solutions IV International Meeting on Lorentzian Geometry Santiago de Compostela, 2007 José Luis Flores Universidad de Málaga Joint work with Miguel Sánchez: Class. Quant.
More informationModal Logics of Topological Relations
Ö Ò ÍÒÚÖ ØÝ Ó ÌÒÓÐÓÝ ÁÒ ØØÙØ ÓÖ ÌÓÖØÐ ÓÑÔÙØÖ ËÒ Ö ÓÖ ÙØÓÑØ ÌÓÖÝ ÄÌËßÊÔÓÖØ Modal Logics of Topological Relations Carsten Lutz and Frank Wolter LTCS-Report 04-05 ÄÖ ØÙÐ ĐÙÖ ÙØÓÑØÒØÓÖ ÁÒ ØØÙØ ĐÙÖ ÌÓÖØ ÁÒÓÖÑØ
More informationLearnability and the Doubling Dimension
Learnability and the Doubling Dimension Yi Li Genome Institute of Singapore liy3@gis.a-star.edu.sg Philip M. Long Google plong@google.com Abstract Given a set of classifiers and a probability distribution
More informationLecture 16: Modern Classification (I) - Separating Hyperplanes
Lecture 16: Modern Classification (I) - Separating Hyperplanes Outline 1 2 Separating Hyperplane Binary SVM for Separable Case Bayes Rule for Binary Problems Consider the simplest case: two classes are
More informationPeriodic monopoles and difference modules
Periodic monopoles and difference modules Takuro Mochizuki RIMS, Kyoto University 2018 February Introduction In complex geometry it is interesting to obtain a correspondence between objects in differential
More informationAn Improved Quantum Fourier Transform Algorithm and Applications
An Improved Quantum Fourier Transform Algorithm and Applications Lisa Hales Group in Logic and the Methodology of Science University of California at Berkeley hales@cs.berkeley.edu Sean Hallgren Ý Computer
More informationCramér-Rao Bounds for Parametric Shape Estimation in Inverse Problems
Cramér-Rao Bounds for Parametric Shape Estimation in Inverse Problems Jong Chul Ye Philips Research - USA 345 Scarborough Road Briarcliff Manor, NY 10510 Yoram Bresler and Pierre Moulin Coordinated Science
More informationRedoing the Foundations of Decision Theory
Redoing the Foundations of Decision Theory Joe Halpern Cornell University Joint work with Larry Blume and David Easley Economics Cornell Redoing the Foundations of Decision Theory p. 1/21 Decision Making:
More informationSemantics and Verification
Semantics and Verification Lecture 2 informal introduction to CCS syntax of CCS semantics of CCS 1 / 12 Sequential Fragment Parallelism and Renaming CCS Basics (Sequential Fragment) Nil (or 0) process
More informationKing s Research Portal
King s Research Portal DOI: 10.1007/3-540-45616-3_7 Document Version Peer reviewed version Link to publication record in King's Research Portal Citation for published version (APA): Degtyarev, A., Fisher,
More informationFront-end. Organization of a Modern Compiler. Middle1. Middle2. Back-end. converted to control flow) Representation
register allocation instruction selection Code Low-level intermediate Representation Back-end Assembly array references converted into low level operations, loops converted to control flow Middle2 Low-level
More information: œ Ö: =? À =ß> real numbers. œ the previous plane with each point translated by : Ðfor example,! is translated to :)
â SpanÖ?ß@ œ Ö =? > @ À =ß> real numbers : SpanÖ?ß@ œ Ö: =? > @ À =ß> real numbers œ the previous plane with each point translated by : Ðfor example, is translated to :) á In general: Adding a vector :
More informationBooks. Book Collection Editor. Editor. Name Name Company. Title "SA" A tree pattern. A database instance
"! # #%$ $ $ & & & # ( # ) $ + $, -. 0 1 1 1 2430 5 6 78 9 =?
More informationF(jω) = a(jω p 1 )(jω p 2 ) Û Ö p i = b± b 2 4ac. ω c = Y X (jω) = 1. 6R 2 C 2 (jω) 2 +7RCjω+1. 1 (6jωRC+1)(jωRC+1) RC, 1. RC = p 1, p
ÓÖ Ò ÊÄ Ò Ò Û Ò Ò Ö Ý ½¾ Ù Ö ÓÖ ÖÓÑ Ö ÓÒ Ò ÄÈ ÐØ Ö ½¾ ½¾ ½» ½½ ÓÖ Ò ÊÄ Ò Ò Û Ò Ò Ö Ý ¾ Á b 2 < 4ac Û ÒÒÓØ ÓÖ Þ Û Ö Ð Ó ÒØ Ó Û Ð Ú ÕÙ Ö º ËÓÑ Ñ ÐÐ ÕÙ Ö Ö ÓÒ Ò º Ù Ö ÓÖ ½¾ ÓÖ Ù Ö ÕÙ Ö ÓÖ Ò ØÖ Ò Ö ÙÒØ ÓÒ
More informationCitation Osaka Journal of Mathematics. 43(2)
TitleIrreducible representations of the Author(s) Kosuda, Masashi Citation Osaka Journal of Mathematics. 43(2) Issue 2006-06 Date Text Version publisher URL http://hdl.handle.net/094/0396 DOI Rights Osaka
More information3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 REDCLIFF MUNICIPAL PLANNING COMMISSION FOR COMMENT/DISCUSSION DATE: TOPIC: April 27 th, 2018 Bylaw 1860/2018, proposed amendments to the Land Use Bylaw regarding cannabis
More informationLars Schmidt-Thieme, Information Systems and Machine Learning Lab (ISMLL), Institute BW/WI & Institute for Computer Science, University of Hildesheim
Course on Information Systems 2, summer term 2010 0/29 Information Systems 2 Information Systems 2 5. Business Process Modelling I: Models Lars Schmidt-Thieme Information Systems and Machine Learning Lab
More informationEXTRACT THE PLASTIC PROPERTIES OF METALS US- ING REVERSE ANALYSIS OF NANOINDENTATION TEST
47 3 Vol.47 No.3 211 Ê 3 321 326 ACTA METALLURGICA SINICA Mar. 211 pp.321 326 ±Á Æ ½ Å³Æ ¹ 1 Î 1 ÏÍ 1 1 Ì 2 Ë 1 1 ¾ Þº, ¾ 324 2 ¾ ³» Í Þº, ¾ 324 Æ ± Ó Ó ÆÏÞØ,  ¼ ± È Á ÅÛ ÖÝÛ, Ó Ó Ï ¼ ±. º Ì Ï, Á ÅÛ ÖÝÛ
More informationIntegrability in QCD and beyond
Integrability in QCD and beyond Vladimir M. Braun University of Regensburg thanks to Sergey Derkachov, Gregory Korchemsky and Alexander Manashov KITP, QCD and String Theory Integrability in QCD and beyond
More informationLABELLED DEDUCTION. SEÁN MATTHEWS Max-Planck-Insitut für Informatik. LUCA VIGANÒ University of Freiburg
LABELLED DEDUCTN LABELLED DEDUCTN Edited by DAVD BASN University of Freiburg MARCELL D AGSTN University of Ferrara DV M GABBAY King s College SEÁN MATTHEWS Max-Planck-nsitut für nformatik LUCA VGANÒ University
More informationESE601: Hybrid Systems. Introduction to verification
ESE601: Hybrid Systems Introduction to verification Spring 2006 Suggested reading material Papers (R14) - (R16) on the website. The book Model checking by Clarke, Grumberg and Peled. What is verification?
More informationBilateral Proofs of Safety and Progress Properties of Concurrent Programs (Working Draft)
Bilateral Proofs of Safety and Progress Properties of Concurrent Programs (Working Draft) Jayadev Misra December 18, 2015 Contents 1 Introduction 3 2 Program and Execution Model 4 2.1 Program Structure..........................
More informationT i t l e o f t h e w o r k : L a M a r e a Y o k o h a m a. A r t i s t : M a r i a n o P e n s o t t i ( P l a y w r i g h t, D i r e c t o r )
v e r. E N G O u t l i n e T i t l e o f t h e w o r k : L a M a r e a Y o k o h a m a A r t i s t : M a r i a n o P e n s o t t i ( P l a y w r i g h t, D i r e c t o r ) C o n t e n t s : T h i s w o
More informationA Functional Quantum Programming Language
A Functional Quantum Programming Language Thorsten Altenkirch University of Nottingham based on joint work with Jonathan Grattage and discussions with V.P. Belavkin supported by EPSRC grant GR/S30818/01
More informationEntropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors Omer Reingold Ý Salil Vadhan Þ Avi Wigderson Ü February 23, 2001 Abstract The main contribution of this work is
More informationPlanning for Reactive Behaviors in Hide and Seek
University of Pennsylvania ScholarlyCommons Center for Human Modeling and Simulation Department of Computer & Information Science May 1995 Planning for Reactive Behaviors in Hide and Seek Michael B. Moore
More informationThe Scale Factor: A New Degree of Freedom in Phase Type Approximation
The Scale Factor: A New Degree of Freedom in Phase Type Approximation Andrea Bobbio DISTA, Università del Piemonte Orientale, Alessandria, Italy,bobbio@unipmn.it András Horváth, Miklós Telek Dept. of Telecommunications,
More informationBlock-tridiagonal matrices
Block-tridiagonal matrices. p.1/31 Block-tridiagonal matrices - where do these arise? - as a result of a particular mesh-point ordering - as a part of a factorization procedure, for example when we compute
More informationProofs Involving Quantifiers. Proof Let B be an arbitrary member Proof Somehow show that there is a value
Proofs Involving Quantifiers For a given universe Y : Theorem ÐaBÑ T ÐBÑ Theorem ÐbBÑ T ÐBÑ Proof Let B be an arbitrary member Proof Somehow show that there is a value of Y. Call it B œ +, say Þ ÐYou can
More informationETIKA V PROFESII PSYCHOLÓGA
P r a ž s k á v y s o k á š k o l a p s y c h o s o c i á l n í c h s t u d i í ETIKA V PROFESII PSYCHOLÓGA N a t á l i a S l o b o d n í k o v á v e d ú c i p r á c e : P h D r. M a r t i n S t r o u
More informationWorst case complexity of the optimal LLL algorithm
Worst case complexity of the optimal LLL algorithm ALI AKHAVI GREYC - Université de Caen, F-14032 Caen Cedex, France aliakhavi@infounicaenfr Abstract In this paper, we consider the open problem of the
More informationConcurrent Processes and Reaction
Concurrent Processes and Reaction Overview External and internal actions Observations Concurrent process expressions Structural congruence Reaction References Robin Milner, Communication and Concurrency
More information" #$ P UTS W U X [ZY \ Z _ `a \ dfe ih j mlk n p q sr t u s q e ps s t x q s y i_z { U U z W } y ~ y x t i e l US T { d ƒ ƒ ƒ j s q e uˆ ps i ˆ p q y
" #$ +. 0. + 4 6 4 : + 4 ; 6 4 < = =@ = = =@ = =@ " #$ P UTS W U X [ZY \ Z _ `a \ dfe ih j mlk n p q sr t u s q e ps s t x q s y i_z { U U z W } y ~ y x t i e l US T { d ƒ ƒ ƒ j s q e uˆ ps i ˆ p q y h
More informationAn Introduction to Optimal Control Applied to Disease Models
An Introduction to Optimal Control Applied to Disease Models Suzanne Lenhart University of Tennessee, Knoxville Departments of Mathematics Lecture1 p.1/37 Example Number of cancer cells at time (exponential
More informationWhat does the partial order "mean"?
What does the partial order "mean"? Domain theory developed by Dana Scott and Gordon Plotkin in the late '60s use partial order to represent (informally): approximates carries more information than better
More informationCorrelation at Low Temperature: I. Exponential Decay
Correlation at Low Temperature: I. Exponential Decay Volker Bach FB Mathematik; Johannes Gutenberg-Universität; D-55099 Mainz; Germany; email: vbach@mathematik.uni-mainz.de Jacob Schach Møller Ý Département
More informationAn Operational Semantics for the Dataflow Algebra. A. J. Cowling
Verification and Testing Research Group, Department of Computer Science, University of Sheffield, Regent Court, 211, Portobello Street, Sheffield, S1 4DP, United Kingdom Email: A.Cowling @ dcs.shef.ac.uk
More informationOptimal Control of PDEs
Optimal Control of PDEs Suzanne Lenhart University of Tennessee, Knoville Department of Mathematics Lecture1 p.1/36 Outline 1. Idea of diffusion PDE 2. Motivating Eample 3. Big picture of optimal control
More informationSoft-decision Decoding of Chinese Remainder Codes
Soft-decision Decoding of Chinese Remainder Codes Venkatesan Guruswami Amit Sahai Ý Madhu Sudan Þ Abstract Given Ò relatively prime integers Ô Ô Ò and an integer Ò, the Chinese Remainder Code, ÊÌ É ÔÔÒ,
More informationAutomatic Control III (Reglerteknik III) fall Nonlinear systems, Part 3
Automatic Control III (Reglerteknik III) fall 20 4. Nonlinear systems, Part 3 (Chapter 4) Hans Norlander Systems and Control Department of Information Technology Uppsala University OSCILLATIONS AND DESCRIBING
More informationLoop parallelization using compiler analysis
Loop parallelization using compiler analysis Which of these loops is parallel? How can we determine this automatically using compiler analysis? Organization of a Modern Compiler Source Program Front-end
More informationConnection equations with stream variables are generated in a model when using the # $ % () operator or the & ' %
7 9 9 7 The two basic variable types in a connector potential (or across) variable and flow (or through) variable are not sufficient to describe in a numerically sound way the bi-directional flow of matter
More informationETNA Kent State University
Electronic Transactions on Numerical Analysis. Volume 17, pp. 76-92, 2004. Copyright 2004,. ISSN 1068-9613. ETNA STRONG RANK REVEALING CHOLESKY FACTORIZATION M. GU AND L. MIRANIAN Ý Abstract. For any symmetric
More informationModels of Concurrency
Models of Concurrency GERARDO SCHNEIDER UPPSALA UNIVERSITY DEPARTMENT OF INFORMATION TECHNOLOGY UPPSALA, SWEDEN Thanks to Frank Valencia Models of Concurrency p.1/57 Concurrency is Everywhere Concurrent
More informationG54FOP: Lecture 17 & 18 Denotational Semantics and Domain Theory III & IV
G54FOP: Lecture 17 & 18 Denotational Semantics and Domain Theory III & IV Henrik Nilsson University of Nottingham, UK G54FOP: Lecture 17 & 18 p.1/33 These Two Lectures Revisit attempt to define denotational
More informationUNIQUE FJORDS AND THE ROYAL CAPITALS UNIQUE FJORDS & THE NORTH CAPE & UNIQUE NORTHERN CAPITALS
Q J j,. Y j, q.. Q J & j,. & x x. Q x q. ø. 2019 :. q - j Q J & 11 Y j,.. j,, q j q. : 10 x. 3 x - 1..,,. 1-10 ( ). / 2-10. : 02-06.19-12.06.19 23.06.19-03.07.19 30.06.19-10.07.19 07.07.19-17.07.19 14.07.19-24.07.19
More informationTemporal logics and explicit-state model checking. Pierre Wolper Université de Liège
Temporal logics and explicit-state model checking Pierre Wolper Université de Liège 1 Topics to be covered Introducing explicit-state model checking Finite automata on infinite words Temporal Logics and
More informationImproving the Berlekamp algorithm for binomials x n a
Improving the Berlekamp algorithm for binomials x n a Ryuichi Harasawa Yutaka Sueyoshi Aichi Kudo Nagasaki University July 19, 2012 1 2 3 Idea Example Procedure after applying the proposed mehod 4 Theoretical
More informationMax. Input Power (W) Input Current (Arms) Dimming. Enclosure
Product Overview XI025100V036NM1M Input Voltage (Vac) Output Power (W) Output Voltage Range (V) Output urrent (A) Efficiency@ Max Load and 70 ase Max ase Temp. ( ) Input urrent (Arms) Max. Input Power
More informationCommunication and Concurrency: CCS
Communication and Concurrency: CCS R. Milner, A Calculus of Communicating Systems, 1980 cours SSDE Master 1 Why calculi? Prove properties on programs and languages Principle: tiny syntax, small semantics,
More informationCommunicating Parallel Processes. Stephen Brookes
Communicating Parallel Processes Stephen Brookes Carnegie Mellon University Deconstructing CSP 1 CSP sequential processes input and output as primitives named parallel composition synchronized communication
More informationA Proposal for Requirement Engineering
A Proposal for Requirement Engineering Fumio Negoro The Institute of Computer Based Software Methodology and Technology 3-11-3 Takanawa, Minato-ku, Tokyo 108-0074, Japan f-negoro@lyee.co.jp http://www.lyee.co.jp
More information