The University of Texas at Austin. Austin, Texas December Abstract. programs in which operations of dierent processes mayoverlap.
|
|
- Melvin Phillips
- 7 years ago
- Views:
Transcription
1 Atomc Semantcs of Nonatomc Programs James H. Anderson Mohamed G. Gouda Department of Computer Scences The Unversty of Texas at Austn Austn, Texas December 1987 Abstract We argue that t s possble, and sometmes useful, to reason about nonatomc programs wthn the conventonal atomc mel of concurrency. 1 Intructon Most of the proof meths that have been proposed for reasonng about concurrent programs are developed wthn the atomc mel of concurrency [Ho 72, LS 84, MP 84, OG 76]. Ths mel s based on the assumpton that no two operatons n a concurrent program are executed at the same tme. Hence, the resultng proof theory may seem nadequate for reasonng about programs n whch operatons of derent processes mayoverlap. In ths paper, we show to the contrary that t s possble to reason about such programs wthn the atomc mel of concurrency. Work supported n part by Oce of Naval Research Contract N K
2 2 Nonatomc Programs A concurrent program conssts of two or more sequental processes that access a set of program varables. A program state s a mappng from the program varables and program counters to values. A process s a sequence of operatons, each ofwhch s ether atomc or nonatomc. An atomc operaton s a relaton on the set of program states that s, an atomc operaton causes a sngle transton between a par of states. A nonatomc operaton s a sequence of atomc operatons that s, a nonatomc operaton may cause several state transtons. Intutvely, the executon of an atomc operaton s nstantaneous and does not overlap the executon of another atomc operaton, whereas the executon of a nonatomc operaton lasts for an arbtrary, but nte, per of tme and may overlap the executon of other operatons. If each process n a concurrent program conssts only of atomc operatons, then the program s called atomc otherwse, t s called nonatomc. Each program varable s ether global or local: a varable s global f t s accessed by more than one process, and local f t s accessed by only one process. Snce each process s sequental, we may assume that an operaton that accesses no global varable s atomc. By contrast, an operaton that does access a global varable may be nonatomc. In ths note, we consder a class of nonatomc programs n whch processes communcate only by readng and wrtng global varables. For now, we assume that the value of each globalvarable ranges over a nte doman f0 ::: M ; 1g, for some M called the range of the global varable. (Later, n Secton 5, we relax ths restrcton.) We also assume that each varable s wrtten by only one process. Furthermore, we assume that global varables are accessed accordng to the followng rules. 1. (Atomcty) Each operaton ether reads or wrtes at most one global varable. An operaton that reads a global varable s atomc, and an operaton that wrtes a global varable s nonatomc. 2. (Readng Whle Wrtng) If a read of a global varable occurs whle the varable s beng wrtten, then the read operaton returns an arbtrary value from the value doman of the varable. 3. (Exclusve Readng) If a read of a global varable does not occur whle the varable s beng wrtten, then the read operaton returns the most recently wrtten value. 2
3 For convenence, each nonatomc wrte operaton s dstngushed by the specal syntax: wrte v to x where x s a global varable, and v s the value beng wrtten. 3 Semantcs In [La 77], Lamport denes the semantcs of the nonatomc wrte operaton \wrte v to x" by the atomc program fragment hx :=? hx := v where \h" and \" enclose the atomc operatons, and \?" s an ndetermnate value. Furthermore, a read operaton that reads x when x =? returns an arbtrary value from the value doman of x. Therefore, the semantcs of a read operaton that reads x must be augmented to allow the possblty of x =?. In partcular, the value of x must now bevewed as a relaton nstead of a functon. We would lke to suggest an alternatve approach to denng the semantcs of the nonatomc wrte operaton \wrte v to x". In ths approach, t s unnecessary to redene the semantcs of a read operaton. Instead, the semantcs of the wrte operaton s dened by a nondetermnstc program fragment along wth a farness condton. The program fragmentsasfollows: do htrue! x := x +1mulo M [] htrue! x := v ext where M s the range of x, and the second branch of the do- loop s called the ext branch. The farness condton can be stated as follows. If the ext branch s contnuously enabled, then t s eventually executed. Ths condton guarantees that the program fragment termnates n a nte tme, and, consequently, the duraton of the correspondng nonatomc wrte operaton s nte. 3
4 local var k: 1::N whle true do hnoncrtcal Secton 1: wrte true to a[] 2: hk := 1 3: whle hk ; 1 do 4: f ha[k] then 5: wrte false to a[] 6: whle ha[k] do 7: hskp 8: hgoto 1 9: hk := k +1 10: hk := +1 11: whle hk N do 12: whle ha[k] do 13: hskp 14: hk := k +1 15: hcrtcal Secton 16: wrte false to a[] 4 Vercaton Fgure 1: Process P of a nonatomc program. The above semantcs suggests the followng meth for verfyng that a nonatomc program P satses some asserton, under some farness condton F. Frst, translate the par (P F) nto a par (P 0 F 0 ), where P 0 s an atomc program. Second, show thatp 0 satses the requred asserton under the farness condton F 0. Snce P 0 s atomc, ths step can be accomplshed usng tradtonal proof meths,.e. nvarants and well-founded sets [MP 84]. As an example, consder the one-bt mutual excluson program gven n [La 86a]. The program, call t P, conssts of N processes, P 1 ::: P N,that communcate va a global boolean array a[1::n] each element n the array s ntally false. The ce for process P s shown n Fgure 1, and the farness condton F assocated wth P s true. 4
5 As dscussed earler, the par (P F) can be translated nto a par (P 0 F 0 ). The ce for process P 0 n the resultng program P 0 s shown n Fgure 2. The farness condton F 0 s as follows: If any ext branch s contnuously enabled, then t s eventually executed. Now, to prove that program P satses the mutual excluson property S [ 8 j : 6= j : :(P at f15g^p j at f15g) ] at each of ts reachable states, t s sucenttoshow that the atomc program P 0 satses S at each of ts reachable states. (Farness s not needed n provng mutual excluson, snce t s a safety property.) Ths can be done by ndng a sutable nvarant ofp 0. To ths end, let k denote the local varable k of process P, 0 and let z be an auxlary varable of process P 0 dened as follows: ( 1 f P 0 at f9 14g z = 0 otherwse Then, the requred nvarant s as follows. nvarant ofp 0 s left to the reader.) (Provng that t s ndeed an J S ^ S 1 ^ S 2 ^ S 3 ^ S 4 where S 1 [ 8 :: P 0 at f2::4 9::15g )a[] ] S 2 [ 8 :: P 0 at f15g )k >N ] S 3 [ 8 :: P 0 at f10g )k ] S 4 [ 8 :: P 0 at f3 4 9::15g )( 8j : j 6= ^ j<k + z : :a[j] _ P 0 j at f g _(k j + z j ) )] We used an nterestng \heurstc" n order to deduce the nvarant J. We rst deduced an nvarant I for the nonatomc program (Fgure 1), under the assumpton that each \wrte true to a[]" and \wrte false to a[]" s an atomc operaton. We then \massaged" ths nvarant to get J. The requred massagng was slght, snce I was very close to J already n fact, I S ^ S 1 ^ S 2 ^ S 3 ^ R, where R [ 8 :: P at f3 4 9::15g )( 8j : j 6= ^ j<k + z : :a[j] _ P j at f2g_(k j + z j ) )] 5
6 local var k: 1::N whle htrue do hnoncrtcal Secton 1: do htrue! a[]:=:a[] [] htrue! a[] :=true ext 2: hk := 1 3: whle hk ; 1 do 4: f ha[k] then 5: do htrue! a[] :=:a[] [] htrue! a[] :=false ext 6: whle ha[k] do 7: hskp 8: hgoto 1 9: hk := k +1 10: hk := +1 11: whle hk N do 12: whle ha[k] do 13: hskp 14: hk := k +1 15: hcrtcal Secton 16: do htrue! a[]:=:a[] [] htrue! a[] :=false ext Fgure 2: Process P 0 of an equvalent atomc program. 6
7 5 Concludng Remarks Our approach can be extended to reason about nonatomc wrtes to unbounded global varables. For example, the semantcs of a nonatomc wrte to an nteger varable x can be dened by the program fragment do htrue! x := x +1 [] htrue! x := x ; 1 [] htrue! x := v ext along wth the obvous farness condton. The semantcs that we proposed n Secton 3 s, n fact, the semantcs of a wrte operaton of a safe regster. A safe regster s the most prmtve regster n a herarchy of regsters dened by Lamport [La 86b] t satses only one constrant: a read of a safe regster must return the most recently wrtten value f t does not \overlap" a wrte of the regster. Another regster n Lamport's herarchy s the regular regster. A regular regster s a safe regster that satses one addtonal constrant: a read of a regular regster that overlaps a wrte of the regster must return ether the \old" or the \new" value. The operaton \wrte v to x", where x s a regular regster, can be dened by the program fragment u := x do htrue! x := u [] htrue! x := v [] htrue! x := v ext along wth the usual farness condton. Ths example llustrates the fact that our approach s general enough to reason about a varety of shared objects. The semantcs that we suggest s useful for provng safety propertes (whch specfy that somethng wll not occur) and progress propertes (whch specfy that somethng wll occur). However, t s not partcularly useful for provng possblty propertes (whch specfy that somethng may occur). For example, consder a read of a shared varable that occurs whle the varable's value s beng changed from 0 to 200. To prove that the read may return the value 500, at least 500 atomc steps are requred. An alternatve semantcs, whch s more convenent for provng possblty propertes, s obtaned 7
8 by usng a nondetermnstc selecton functon. In partcular, \wrte v to x" can be dened by the followng program fragment along wth the usual farness condton: do htrue! x := select(doman(x)) [] htrue! x := v ext where select(:::) s the selecton functon, and doman(x) returns the value doman of the varable x. Recently, Lamport has proposed a proof theory for reasonng about nonatomc programs n whch the mplementaton of the nonatomc operatons n terms of atomc operatons s left unspeced [La 83, La 87]. Thus, ths proof theory allows mplementaton decsons to be deferred, n contrast to our approach n whch mplementaton decsons are made a pror. On the other hand, our approach allows one to reason about program correctness wthn the conventonal atomc framework, nstead of appealng to a new theory. Acknowledgements We are thankful to L. Lamport, C. Lengauer, M. Merrtt, F. Schneder, and the referees for ther helpful comments on ths note. References [Ho 72] Hoare, C.A.R., \Towards a Theory of Parallel Programmng," Operatng Systems Technques, Hoare and Perott (Eds.), Academc Press, New York, [La 77] Lamport, L., \Provng the Correctness of Multprocess Programs," IEEE Transactons on Software Engneerng, Vol. SE-3, No. 2, pp , March [La 83] Lamport, L., \Reasonng About Nonatomc Operatons," Proceedngs of the 10th Annual ACM SIGACT-SIGPLAN Symposum on Prncples of Programmng Languages, pp , [La 86a] Lamport, L., \The Mutual Excluson Problem, Parts I and II," Journal of the ACM,Vol. 23, No. 2, pp , Aprl
9 [La 86b] Lamport, L., \On Interprocess Communcaton, Parts I and II," Dstrbuted Computng, Vol. 1, pp , [La 87] Lamport, L., \wn and sn: Predcate Transformers for Concurrency," Techncal Report, Systems Research Center, Dgtal Equpment Corporaton, May [LS 84] Lamport, L., and Schneder, F., \The Hoare Logc of CSP, and All That," ACM Transactons on Programmng Languages and Systems, Vol. 6, No. 2, pp , Aprl [MP 84] Manna, Z., and Pnuel, A., \Adequate Proof Prncples for Invarance and Lveness Propertes of Concurrent Programs," Scence of Computer Programmng, Vol. 4, pp , [OG 76] Owck, S., and Gres, D., \An Axomatc Proof Technque for Parallel Programs I," Acta Informatca, Vol. 6, pp ,
Recurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set
More information1 Example 1: Axis-aligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationNON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia
To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationSUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW.
SUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW. Lucía Isabel García Cebrán Departamento de Economía y Dreccón de Empresas Unversdad de Zaragoza Gran Vía, 2 50.005 Zaragoza (Span) Phone: 976-76-10-00
More information+ + + - - This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationLecture 3: Force of Interest, Real Interest Rate, Annuity
Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and
More informationConferencing protocols and Petri net analysis
Conferencng protocols and Petr net analyss E. ANTONIDAKIS Department of Electroncs, Technologcal Educatonal Insttute of Crete, GREECE ena@chana.tecrete.gr Abstract: Durng a computer conference, users desre
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationImplementation of Boolean Functions through Multiplexers with the Help of Shannon Expansion Theorem
Internatonal Journal o Computer pplcatons (975 8887) Volume 62 No.6, January 23 Implementaton o Boolean Functons through Multplexers wth the Help o Shannon Expanson Theorem Saurabh Rawat Graphc Era Unversty.
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationActivity Scheduling for Cost-Time Investment Optimization in Project Management
PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng
More informationPower-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationFORMAL ANALYSIS FOR REAL-TIME SCHEDULING
FORMAL ANALYSIS FOR REAL-TIME SCHEDULING Bruno Dutertre and Vctora Stavrdou, SRI Internatonal, Menlo Park, CA Introducton In modern avoncs archtectures, applcaton software ncreasngly reles on servces provded
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationA Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
More informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationAddendum to: Importing Skill-Biased Technology
Addendum to: Importng Skll-Based Technology Arel Bursten UCLA and NBER Javer Cravno UCLA August 202 Jonathan Vogel Columba and NBER Abstract Ths Addendum derves the results dscussed n secton 3.3 of our
More informationPSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12
14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationA Dynamic Energy-Efficiency Mechanism for Data Center Networks
A Dynamc Energy-Effcency Mechansm for Data Center Networks Sun Lang, Zhang Jnfang, Huang Daochao, Yang Dong, Qn Yajuan A Dynamc Energy-Effcency Mechansm for Data Center Networks 1 Sun Lang, 1 Zhang Jnfang,
More informationRate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer
More information21 Vectors: The Cross Product & Torque
21 Vectors: The Cross Product & Torque Do not use our left hand when applng ether the rght-hand rule for the cross product of two vectors dscussed n ths chapter or the rght-hand rule for somethng curl
More informationSingle and multiple stage classifiers implementing logistic discrimination
Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,
More information1.1 The University may award Higher Doctorate degrees as specified from time-to-time in UPR AS11 1.
HIGHER DOCTORATE DEGREES SUMMARY OF PRINCIPAL CHANGES General changes None Secton 3.2 Refer to text (Amendments to verson 03.0, UPR AS02 are shown n talcs.) 1 INTRODUCTION 1.1 The Unversty may award Hgher
More informationA new look at atomic broadcast in the asynchronous. crash-recovery model
A new look at atomc broadcast n the asynchronous crash-recovery model Sergo Mena André Schper École Polytechnque Fédérale de Lausanne (EPFL) Dstrbuted Systems Laboratory CH-1015 Lausanne, Swtzerland Tel.:
More information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More informationSurvey on Virtual Machine Placement Techniques in Cloud Computing Environment
Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center
More informationSection 5.4 Annuities, Present Value, and Amortization
Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today
More informationResearch of concurrency control protocol based on the main memory database
Research of concurrency control protocol based on the man memory database Abstract Yonghua Zhang * Shjazhuang Unversty of economcs, Shjazhuang, Shjazhuang, Chna Receved 1 October 2014, www.cmnt.lv The
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationRELIABILITY, RISK AND AVAILABILITY ANLYSIS OF A CONTAINER GANTRY CRANE ABSTRACT
Kolowrock Krzysztof Joanna oszynska MODELLING ENVIRONMENT AND INFRATRUCTURE INFLUENCE ON RELIABILITY AND OPERATION RT&A # () (Vol.) March RELIABILITY RIK AND AVAILABILITY ANLYI OF A CONTAINER GANTRY CRANE
More informationComplete Fairness in Secure Two-Party Computation
Complete Farness n Secure Two-Party Computaton S. Dov Gordon Carmt Hazay Jonathan Katz Yehuda Lndell Abstract In the settng of secure two-party computaton, two mutually dstrustng partes wsh to compute
More informationL10: Linear discriminants analysis
L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss
More informationAn MILP model for planning of batch plants operating in a campaign-mode
An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationCALL ADMISSION CONTROL IN WIRELESS MULTIMEDIA NETWORKS
CALL ADMISSION CONTROL IN WIRELESS MULTIMEDIA NETWORKS Novella Bartoln 1, Imrch Chlamtac 2 1 Dpartmento d Informatca, Unverstà d Roma La Sapenza, Roma, Italy novella@ds.unroma1.t 2 Center for Advanced
More informationData Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationAnalysis of Energy-Conserving Access Protocols for Wireless Identification Networks
From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC-97), March 2-23, 1997. 1 Analyss of Energy-Conservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara
More informationMinimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures
Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationA Hierarchical Reliability Model of Service-Based Software System
2009 33rd Annual IEEE Internatonal Computer Software and Applcatons Conference A Herarchcal Relablty Model of Servce-Based Software System Lun Wang, Xaoyng Ba, Lzhu Zhou Department of Computer Scence and
More informationCross-Domain Authorization Management Model for Multi- Levels Hybrid Cloud Computing
Internatonal Journal of Securty and Its Applcatons, pp.343-352 http://dx.do.org/10.14257/sa.2015.9.12.33 Cross-Doman Authorzaton Management Model for Mult- Levels Hybrd Cloud Computng L Na 1, Dong Yun-We
More information1. Measuring association using correlation and regression
How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a
More informationHow To Calculate The Accountng Perod Of Nequalty
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More informationAPPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho
More informationVerifying Multi-threaded Software using SMT-based Context-Bounded Model Checking
Verfyng Mult-threaded Software usng SMT-based Context-Bounded Model Checkng Lucas Cordero Unversty of Southampton lcc08r@ecs.soton.ac.uk Bernd Fscher Unversty of Southampton b.fscher@ecs.soton.ac.uk ABSTRACT
More informationSPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:
SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and
More informationHedging Interest-Rate Risk with Duration
FIXED-INCOME SECURITIES Chapter 5 Hedgng Interest-Rate Rsk wth Duraton Outlne Prcng and Hedgng Prcng certan cash-flows Interest rate rsk Hedgng prncples Duraton-Based Hedgng Technques Defnton of duraton
More informationTraffic-light a stress test for life insurance provisions
MEMORANDUM Date 006-09-7 Authors Bengt von Bahr, Göran Ronge Traffc-lght a stress test for lfe nsurance provsons Fnansnspetonen P.O. Box 6750 SE-113 85 Stocholm [Sveavägen 167] Tel +46 8 787 80 00 Fax
More informationResearch Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization
Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationSome literature also use the term Process Control
A Formal Approach for Internal Controls Complance n Busness Processes Koumars Namr 1, Nenad Stojanovc 2 1 SAP Research Center CEC Karlsruhe, SAP AG, Vncenz-Preßntz-Str.1 76131 Karlsruhe, Germany Koumars.Namr@sap.com
More informationNOTE: The Flatpak version has the same pinouts (Connection Diagram) as the Dual In-Line Package. *MR for LS160A and LS161A *SR for LS162A and LS163A
BCD DECADE COUNTERS/ 4-BIT BINARY COUNTERS The LS160A/ 161A/ 162A/ 163A are hgh-speed 4-bt synchronous counters. They are edge-trggered, synchronously presettable, and cascadable MSI buldng blocks for
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationA DATA MINING APPLICATION IN A STUDENT DATABASE
JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul
More informationTesting Database Programs using Relational Symbolic Execution
Testng Database Programs usng Relatonal Symbolc Executon Mchaël Marcozz 1, Wm Vanhoof, Jean-Luc Hanaut Faculty of Computer Scence Unversty of Namur Rue Grandgagnage, 21 5000 Namur, Belgum Abstract Symbolc
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION
More informationIDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS
IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS Chrs Deeley* Last revsed: September 22, 200 * Chrs Deeley s a Senor Lecturer n the School of Accountng, Charles Sturt Unversty,
More informationRESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.
ICSV4 Carns Australa 9- July, 007 RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract
More informationREGULAR MULTILINEAR OPERATORS ON C(K) SPACES
REGULAR MULTILINEAR OPERATORS ON C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. The purpose of ths paper s to characterze the class of regular contnuous multlnear operators on a product of
More informationQoS-based Scheduling of Workflow Applications on Service Grids
QoS-based Schedulng of Workflow Applcatons on Servce Grds Ja Yu, Rakumar Buyya and Chen Khong Tham Grd Computng and Dstrbuted System Laboratory Dept. of Computer Scence and Software Engneerng The Unversty
More informationAn ILP Formulation for Task Mapping and Scheduling on Multi-core Architectures
An ILP Formulaton for Task Mappng and Schedulng on Mult-core Archtectures Yng Y, We Han, Xn Zhao, Ahmet T. Erdogan and Tughrul Arslan Unversty of Ednburgh, The Kng's Buldngs, Mayfeld Road, Ednburgh, EH9
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika.
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationPERRON FROBENIUS THEOREM
PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()
More informationTo manage leave, meeting institutional requirements and treating individual staff members fairly and consistently.
Corporate Polces & Procedures Human Resources - Document CPP216 Leave Management Frst Produced: Current Verson: Past Revsons: Revew Cycle: Apples From: 09/09/09 26/10/12 09/09/09 3 years Immedately Authorsaton:
More informationWe assume your students are learning about self-regulation (how to change how alert they feel) through the Alert Program with its three stages:
Welcome to ALERT BINGO, a fun-flled and educatonal way to learn the fve ways to change engnes levels (Put somethng n your Mouth, Move, Touch, Look, and Lsten) as descrbed n the How Does Your Engne Run?
More informationThe program for the Bachelor degrees shall extend over three years of full-time study or the parttime equivalent.
Bachel of Commerce Bachel of Commerce (Accountng) Bachel of Commerce (Cpate Fnance) Bachel of Commerce (Internatonal Busness) Bachel of Commerce (Management) Bachel of Commerce (Marketng) These Program
More informationOn-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features
On-Lne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: ruoyu.l@skf.com
More informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang
More informationEmbedding lattices in the Kleene degrees
F U N D A M E N T A MATHEMATICAE 62 (999) Embeddng lattces n the Kleene degrees by Hsato M u r a k (Nagoya) Abstract. Under ZFC+CH, we prove that some lattces whose cardnaltes do not exceed ℵ can be embedded
More informationMean Molecular Weight
Mean Molecular Weght The thermodynamc relatons between P, ρ, and T, as well as the calculaton of stellar opacty requres knowledge of the system s mean molecular weght defned as the mass per unt mole of
More informationFisher Markets and Convex Programs
Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and
More informationApplication of Multi-Agents for Fault Detection and Reconfiguration of Power Distribution Systems
1 Applcaton of Mult-Agents for Fault Detecton and Reconfguraton of Power Dstrbuton Systems K. Nareshkumar, Member, IEEE, M. A. Choudhry, Senor Member, IEEE, J. La, A. Felach, Senor Member, IEEE Abstract--The
More informationA Crossplatform ECG Compression Library for Mobile HealthCare Services
A Crossplatform ECG Compresson Lbrary for Moble HealthCare Servces Alexander Borodn, Yulya Zavyalova Department of Computer Scence Petrozavodsk State Unversty Petrozavodsk, Russa {aborod, yzavyalo}@cs.petrsu.ru
More informationA Probabilistic Theory of Coherence
A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More informationImplementation of Deutsch's Algorithm Using Mathcad
Implementaton of Deutsch's Algorthm Usng Mathcad Frank Roux The followng s a Mathcad mplementaton of Davd Deutsch's quantum computer prototype as presented on pages - n "Machnes, Logc and Quantum Physcs"
More informationRing structure of splines on triangulations
www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon
More informationEfficient Project Portfolio as a tool for Enterprise Risk Management
Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse
More informationMooring Pattern Optimization using Genetic Algorithms
6th World Congresses of Structural and Multdscplnary Optmzaton Ro de Janero, 30 May - 03 June 005, Brazl Moorng Pattern Optmzaton usng Genetc Algorthms Alonso J. Juvnao Carbono, Ivan F. M. Menezes Luz
More informationAn Inductive Fuzzy Classification Approach applied to Individual Marketing
An Inductve Fuzzy Classfcaton Approach appled to Indvdual Marketng Mchael Kaufmann, Andreas Meer Abstract A data mnng methodology for an nductve fuzzy classfcaton s ntroduced. The nducton step s based
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationExamensarbete. Rotating Workforce Scheduling. Caroline Granfeldt
Examensarbete Rotatng Workforce Schedulng Carolne Granfeldt LTH - MAT - EX - - 2015 / 08 - - SE Rotatng Workforce Schedulng Optmerngslära, Lnköpngs Unverstet Carolne Granfeldt LTH - MAT - EX - - 2015
More informationReal-Time Process Scheduling
Real-Tme Process Schedulng ktw@cse.ntu.edu.tw (Real-Tme and Embedded Systems Laboratory) Independent Process Schedulng Processes share nothng but CPU Papers for dscussons: C.L. Lu and James. W. Layland,
More informationPeriod and Deadline Selection for Schedulability in Real-Time Systems
Perod and Deadlne Selecton for Schedulablty n Real-Tme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng
More informationVERIFICATION OF BUSINESS RULES USING LOGIC PROGRAMMING MEANS
Sesson 3. Formalzaton and Smulaton of Busness Systems VERIFICATION OF BUSINESS RULES USING LOGIC PROGRAMMING MEANS Henrkas Pranevcus, Regna Msevcene Kaunas Unversty of Technology, Department of Busness
More information