Using data flow analysis for the reliability assessment of safety-critical software systems
|
|
- Carmel Miller
- 6 years ago
- Views:
Transcription
1 Recent Researces in Circuits, Systems, Communications and Computers Using data fow anaysis for te reiabiity assessment of safety-critica software systems BÖRCSÖK J., SCHAEFER S. Department of Computer Arcitecture and System Programming University Kasse, Wiemsöer Aee 71, D Kasse GERMANY Abstract: Reiabiity anaysis for safety-critica software systems often needs additiona expert knowedge, because of te sma data-sets avaiabe. A Bayesian approac is used to deveop a reiabiity mode based on expert knowedge and sma data-sets. Te expert knowedge is obtained wit data fow anaysis. Certain variabes in te program code are examined to cacuate teir probabiity of causing a faiure. Tese additiona information are incorporated into a suitabe distribution function to be abe cacuate reiabiity caracteristics wit greater precision. Key-Words: software reiabiity, bayesian reiabiity, static anaysis, vaue anaysis, abstract interpretation 1 Introduction 1.1 Motivation Safety-critica software as to be deveoped according to standards and as to be certified. Terefore it is necessary to ave exact cacuations of te required reiabiity parameters. Te usua software reiabiity modes use faiure data-sets to estimate te parameters of te underying mode. Tis metod is often not suitabe for safety-critica software, because of te sma data-sets tat are avaiabe. Safety-critica software as a ig degree of maturity, wen data coection begins, so tat ony a few faiures if any can be recorded. 1.2 Requiring additiona information Terefore it is necessary to deveop a reiabiity mode tat accounts for tis ack of data. A reiabiity mode for safety-critica systems requires terefore additiona information. Te additiona information can be derived from different areas of te software deveopment process. Experience from past projects can be integrated into te mode, data from software projects tat beave simiar or are deveoped under simiar conditions is existent, expert knowedge is avaiabe, tat was generated from code reviews and inspections or te software can be subjected to static anaysis. Because of te ig compexity of modern safety-critica software systems e.g. te source code of modern infusion pumps can be comprised of up to 170,000 ines of code [6], compete code reviews are not feasibe. On te oter and it is not possibe to use data from former or simiar projects, because even sma canges e.g. in te operationa profie makes it impossibe to extrapoate to te project tat is examined. 1.3 Reated Work A compreensive study of software reiabiity modes and te underying matematica structures is given in [7] and [8], atoug te specia conditions of safety-critica software is not taken into considerations in tese works. [9] examines different reiabiity modes on te basis of scarce faiure data from safety-critica space sutte software, but does not incorporate any extra information into te cacuations. Static anaysis is in [1] appied to safety-critica software, but is mosty used to examine certain caracteristics of te software rater tan use it to cacuate its reiabiity. 2 Static anaysis Static anaysis as none of te aforementioned restrictions tat are making it ard to use knowedge from past experience. It can be automaticay appied to a arge code basis and te resuts can processed automaticay. Static anaysis anayses te source code of te system, witout executing it. For ISBN:
2 Recent Researces in Circuits, Systems, Communications and Computers our purpose its aim is to verify specific data dependent caracteristics tat can ead to fauts in a running system and subsequenty to faiures. Typica data dependent fauts are: Division by zero, Pointer anaysis, Buffer overruns or Vaue anaysis. Because every non-trivia probem in a compex system is undecidabe it is impossibe to proof te aforementioned caracteristics. Tis often resuts in a tradeoff between fase positives and fase negatives tat as to be baanced. In spite of tis static anaysis yieds usefu resuts. It gives probabiities for occurrence of certain kinds of fauts tat can be incorporated into te reiabiity mode. Wit te use of abstract interpretation it is possibe too derive sound resuts Vaue Anaysis Wit te use of abstract interpretation [2] it is possibe to perform vaue anaysis. Abstract interpretation aows approximating te concrete semantics of a system. Te concrete semantics of a program describes a possibe executions of tis program. It is not possibe to infer directy te required information from te program because a non-trivia caracteristics are undecidabe for te concrete semantics. Te abstract interpretation constructs conservative approximations wit a superset, te so-caed abstract semantics from te concrete semantics, e.g. te abstract information of a certain integer vaue coud be: odd, even, negative or te restriction to an interva. Te advantage of abstract interpretation is due to its soundness, i.e. a property tat is proven in te abstract semantic ods in te concrete semantics, tus avoiding fase positives. In addition abstract interpretation is precise enoug to avoid too many fase negatives Abstract interpretation consists of two functions α and γ. Te function α is caed te abstraction function. It maps te concrete state of a date to an abstract vaue. Te function γ is te concretization function, wic maps te abstract vaue into concrete vaues. Te functions α and γ form a gaois connection: S γ (a) iff α(s) a (1) were S is a concrete state and a is a abstract property, e.g. negative/non-negative. Te gaois connection aows te abstract interpretation to be exact, because if α and γ are monotone (1) yieds: S γ α (S) and α γ (a) a (2) wit te restriction α γ(a)=a for te rigt term of (2) tis gives proof tat an abstract interpretation is exact. Te vaue anaysis tries to compute a possibe vaues for a program variabe for every eement of te concrete semantics wit abstract interpretation. Tere are two basic approaces: 1 Constant propagation: Te exact vaue of te variabe is known or tere is no information at a for tis variabe. 2 Interva anaysis: Te abstract property a is defined as an interva. Te vaue of te variabe is witin te range of tis interva or it is not. [4]) describes a genera framework for interva anaysis. In [10] an impementation for te genera framework is given. Tis impementation is used as an exampe in tis paper to demonstrate te feasibiity of tis approac. An own impementation wit possibe improvements is intended for future work. Te impementation in [10] uses forward and backward propagation to ave more precise resuts, wic means tat te source code is anayzed twice. Te first iteration expores te code from start to end and te second iteration from end to start. An exampe transfer function is given to iustrate te vaue anaysis. An interva for an variabe x is given as <x,x >. Possibe operations on sets are defined, ike unions and intersections, e.g. x, x > < y y >=< max( x, y ),min( x, y ) > (3) <, An addition in te concrete semantics is ten computabe in te abstract domain: x = y+ z S y = y < x z, x z > α( S) z = z < x y, x y > α( S) (4) x = x < y + z, x + z > α( S) Te direction of te arrow describes if forward or backward propagation is computed. Te transfer functions for oter operations in te concrete domain are obtained in a simiar fasion. For every variabe for wic tis is requested a vaue anaysis can be done. Te interva tat is examined is ere te range tat is representabe on te given system. On a 32 bit system te resuting interva for an unsigned integer is <0,2 32 >. If te variabe does not exceed or underruns tis interva in te abstract domain no underfow or underfow is possibe. Tus tis variabe can not cause a faut in any program state. After te static anaysis information is avaiabe wic variabes are safe, i.e. can never cause fauts and wic variabes are unsafe, i.e. tey can cause fauts but do not necessariy cause probems. ISBN:
3 Recent Researces in Circuits, Systems, Communications and Computers Usuay it is too expensive to execute vaue anaysis for every program variabe. Te software or reiabiity engineer as to fag te variabes tat are safety critica and ave to be examined. Te resuting information is ten incorporated into te reiabiity mode as prior information, wic is independent from te registered faiure-data. 3 Bayesian reiabiity 3.1 Principes Te common approac to add extra information into a reiabiity mode is troug bayesian reiabiity. Te difference to te cassic frequentist approac is tat te Bayesian approac yieds a confidence interva for te estimated parameters of te reiabiity mode. Tis gives additiona certainty in te cacuated vaues for faiure rate or faiure intensity. Te Bayesian approac is based upon four density functions wit te foowing reation: f ( x λ) λ) g ( λ x) = (5) 0 f ( x λ) λ) dλ were λ x) is te posteriori distribution. Tis is te fundamenta distribution for te software reiabiity mode. Te parameters are x as te coected dat in tis case te recorded faiure times and λ as te estimated parameters of te mode. Te posteriori distribution gives te most ikey parameters given te recorded faiure times. Te prior distribution is given by λ). Tis te initia estimate of te parameters before any faiure times are coected. Te form of te prior distribution is cosen because of te underying constraints or because of matematica convenience. Te prior distribution contains te information from te static anaysis. Te function f(x λ) is caed te ikeiood function. It describes te probabiity of te occurrence of te coected data given te parameter of te mode. Te denominator of equation (5) is caed te margina distribution and it represents a normaizing factor for te posteriori distribution. A compete teoretica background of Bayesian reiabiity is given in [3]. 3.2 Discrete Case In te discrete case te software tat is to be anayzed as ony discrete runs. It is a piece of code tat wi be executed on demand and performs a specific function, e.g. safety measures. It wi ten be suspended unti te next demand of te software arises. Te interesting parameter is te probabiity tat tis software modue wi fai on demand. Te parameters λ and x in equation (5) can ten be interpreted as parameters of bernoui trias p Te parameter p denotes te probabiity tat an event occurs. Here an event is te faiure of te software. Te number of trias tat ave successfu outcomes is represented by k. Te software is tested wit a certain amount of runs n. Te trias were an event, i.e. a faiure, as occurred are recorded and can be used to directy estimate p or to use tese parameters as input for te ikeiood function. For te atter case te ikeiood function is regarded as a binomia distribution n k n k f ( p k) = Pr( K = k) = p (1 (6) k Figure 1 sows two binomia distributions wit different probabiities. Te direct consideration of te number of runs of te software is often not possibe, because for safety-critica software tere is not enoug data avaiabe. Due to te fact tat for safety-critica software ony a imited number of faiure times or even no faiure times at a can be measured it is not possibe to infer reiabe mode parameters from a direct maximum ikeiood procedure. Furtermore a iger precision of te parameters is expected wit te use of prior information. Fig. 1: Two exampes of a binomia distribution 3.3 Continuous case Te second approac considers te run of te software as continuous, i.e. tere are no competed runs as in te previous section. Tat aows for a time dependent anaysis so tat time dependent ISBN:
4 Recent Researces in Circuits, Systems, Communications and Computers reiabiity caracteristics ike MTTF, faiure rate or faiure intensity can be cacuated. A distribution tat is often used because of its fexibiity and it s matematicay tractabiity is te gamma distribution Ga( as a prior distribution: a b a 1 bλ λ) = λ; b= ) = λ e (7) a) Te parameters of equation (7) are a te so caed sape parameter and b te rate parameter, and te function Г(a) denotes te gamma function. Te fexibiity stems from te fact tat, wit te gamma distribution it is possibe to mode increasing, decreasing and constant faiure rates. For a=1 te gamma distribution becomes te exponentia distribution wic is used to mode constant faiure rates. If te sape parameter is a<1 te resuting faiure rates are decreasing and for a>1 te faiures are increasing. Fig. 2: Four different densities of te gamma distribution Te parameters a and b ave to be estimated based on te vaue anaysis. In order to do tat an assumption, regarding te software ife cyce, to determine parameter a as to be made. If every error tat caused an faiure is found and fixed witout introducing new errors or if te error-introducing rate is smaer tan te fixing rate te faiure rate of te software over its ife time is decreasing and terefore te sape parameter as to be smaer tan 1. Accordingy if te software underies software entropy te code becomes ess reiabe and tis resuts in increasing faiure rates and a>1. If te faiures are ony recorded, but no error-fixing are performed te code basis is uncanged and a=1 wit a constant faiure rate. [5] Te parameter b represents te rate of te distribution. As an initia estimate te ratio of unsafe to safe variabes can be used. Te practicaity of tis ratio can be improved by using te number of executions of unsafe and safe variabes as underying ratio. Since not every execution of an unsafe variabe eads to an erroneous program state, it is necessary to use a proportionaity factor tat refects te probabiity tat an execution of an unsafe variabe resuts in an error. Tis proportionaity factor can be found troug empirica data or wit expert knowedge. 4 Appication 4.1 Appication of te discrete case Te vaue anaysis gives information about a fraction of variabes in te code tat can cause errors and subsequenty faiures, i.e. every time a variabe tat was fagged unsafe is executed tere is a sma probabiity of a faiure. Tis beavior can be used to mode te prior distribution of equation (5). For te form of te prior distribution usuay a distribution is cosen tat beongs to te same famiy as te posterior distribution. Te prior distribution is ten caed a conjugate prior in respect to te ikeiood. Te beta distribution can be used as a conjugate prior for te binomia distributed ikeiood function in equation (6): a 1 b 1 g ( = Be( = p (1 (8) a) Te parameters a and b of tis distribution are cosen as te ratio of unsafe v u to overa variabes v a and vice versa. Te rationae beind tis is as foows. Te ratio a=v u /v a describes te initia trust into te system on te basis of te static anaysis. Even wit no actua run of te software te probabiity of faiure is sma wen tere are ony a sma number of unsafe variabes, wic coud cause teses faiures, in comparison to te overa number of variabes. Te second parameter is used in a simiar fasion. Te ratio b=v a /v u describes te statistica spread of te distribution. Tis ratio is supposed to be arge, wic in turn makes te spread smaer. Te fact tat bot parameters are dependent of eac oter can be negected, because tis specific prior distribution is cosen due to it s matematicay convenience and ony one parameter is needed. Equations (6) and (8) are used to derive te posterior distribution. Ten equation (5) becomes: ISBN:
5 Recent Researces in Circuits, Systems, Communications and Computers p b, k) = 1 0 n p k n k p k k (1 (1 n k n k Be( Be( dp (9) After integration te denominator in (9) gives te beta-binomia distribution and wit transformation and simpifying tis resuts in: k+ a 1 b k 1 p x') = p (1 k+ a) b k)) (10) p x') = Be(( k+ a),( b k)) wit x as te set of parameters (b,k) Exampe On-demand software is tested 100 times. Two faiures are recorded. Te resuting MLE for te corresponding binomia distribution yieds p=k/n=0.02. Te mean and te standard deviation of te cassica approac to estimate p are µ=2 and σ 2 =1.4. Te software consists of 1000 variabes tat are anayzed, for wic 10 of tese variabes are fagged as potentiay unsafe. Te resuting initia prior Beta distribution = Be(0.01,100). For te posteriori distribution foows p x )=Be(2.01,198). Te mean and te standard deviation for te bayesian approac wit static anaysis are µ=0.01 and σ 2 = Specia Case If te on-demand software is tested 100 times and no faiure is recorded it is not possibe to cacuate a meaningfu probabiity for te binomia distribution, because p =0 and terefore µ=0 and σ 2 =0, wic impies error-free software wic is not reaistic assumption. If te bayesian metod is used wit te same prior distribution as in te above section te resuting distribution as meaningfu parameters µ= and σ 2 =0.005, wic are usabe to determine reiabiity caracteristics. 4.2 Appication of te continuous case In te continuous case te prior distribution is modeed by te gamma distribution. Te gamma distribution can act as te conjugate prior for different ikeiood functions. A widey used distribution in reiabiity engineering is te exponentia function f Ex(λ) = λe (-λt). Te use of te gamma distribution Ga( as prior and of te exponentia Ex(λ) as ikeiood yieds te foowing gamma distributed posteriori distribution: n ( b+ T ) λ b, n, T) = λ n) λ b, n, T) = Ga( n, b+ T) e r 1 ( b+ T ) λ (11) were n and T consists of te information tat comes from testing te software, n is te number of faiures tat are recorded and T is tota test time or te sum of faiure times t i. Te parameter a of te prior distribution is estabised troug te assumption on te software ife-cyce. An increasing faiure rate is assumed wit a=1.5. Parameter b takes te vaue of te ratio of te safe and unsafe variabes tat are anayzed in te vaue anaysis step Exampe Te exampe of te section is used again, but te software is tested for 100 ours, instead of 100 trias. Two faiures are recorded at 30 ours and 60 ours. If te exponentia mode is used directy wit n= 2 and T= 30+60, te maximum ikeiood estimate for λ is n/t= Tis can be interpreted as te faiure rate of te system. Te mean, wic is te mean time to faiure (MTTF) and te standard deviation are µ=mttf=45 and σ 2 =45. For te Bayesian approac te number of anayzed variabes tat are safe is 1000 and 10 unsafe variabes are found. Te resuting posterior distribution is Ga(3.5,190), wit MTTF= 665 and σ 2 = Specia Case Anaog to te discrete case tere is no possibiity to cacuate meaningfu vaues for te MTTF for te exponentia distribution if tere are no faiures recorded. Te prior distribution can be used to estimate parameter, wic can ten be refined wit te ikeiood function even wen no furter faiures occur. 5 Concusion Te exampe cacuations for te discrete and te continuous case sow promising resuts. In bot cases te estimated reiabiity is arger witin te bayesian approac. Te trust in tese resuts is furtermore increased as te standard deviations are smaer, wen using te bayesian metod wit static anaysis. Te cassic metods fai to produce usefu reiabiity measurements wen no faiure data is recorded, wic is often te case, wen testing software for safety critica systems. Te vaue anaysis aows making reasonabe estimates for ISBN:
6 Recent Researces in Circuits, Systems, Communications and Computers prior distributions so tat usefu reiabiity caracteristics can be cacuated. 6 Future Work Te teoretica considerations ave to be verified wit rea systems. It is necessary to investigate faiure data tat stems from safety-critica software and to compare tese wit te syntetic resuts. For tis purpose an impementation of te vaue anaysis is necessary tat can anayze te software in an efficient and precise way. Wit te acieved resuts te parameter of te prior distributions can be refined to gain more precise reiabiity caracteristics. References [1] Bancet B. et a A static anayzer for arge safety-critica software, Proceedings of te ACM SIGPLAN 2003 conference on Programming anguage design and impementation, June 09-11, 2003, San Diego: ACM [2] Cousot, P Abstract interpretation. ACM Computing Surveys Voume 28 Issue 2: , New York: ACM [3] Hamad M.S. et. A Bayesian Reiabiity, New York: Springer [4] Harrison, W.H Compier Anaysis of te Vaue Ranges for Variabes, IEEE Transactions on Software Engineering arcive Voume 3 Issue 3: , May 1977 Piscataway: IEEE Press [5] Jacobson, I. et. A., Object-oriented software engineering : a use case driven approac Wokingam Addison-Wesey [6] Jones, P. et a A Forma Metodsbased Verification Approac to Medica Device Software Anaysis. Embedded.com, February [7] Lyu, M.R Handbook of Software Reiabiity Engineering. New York: McGraw-Hi. [8] Pam, H System Software Reiabiity. London: Springer [9] Scneidewind, N., 2008 Comparison of Reiabiity and Testing Modes. Reiabiity, IEEE Transactions on Reiabiity Voume 57 Issue 4: Dec [10] Stepenson, M Bitwise: Optimizing Bitwidts Using Data-Range Propagation, Master Tesis, Massacusetts Institute of Tecnoogy ISBN:
Language Identification for Texts Written in Transliteration
Language Identification for Texts Written in Transiteration Andrey Chepovskiy, Sergey Gusev, Margarita Kurbatova Higher Schoo of Economics, Data Anaysis and Artificia Inteigence Department, Pokrovskiy
More informationLecture Notes for Chapter 4 Part III. Introduction to Data Mining
Data Mining Cassification: Basic Concepts, Decision Trees, and Mode Evauation Lecture Notes for Chapter 4 Part III Introduction to Data Mining by Tan, Steinbach, Kumar Adapted by Qiang Yang (2010) Tan,Steinbach,
More informationChapter Ten. Volumes and Surface Areas of Simple Solids
Capter Ten Voumes and Surface Areas of Simpe Soids We ook at o to cacuate te areas and perimeters of many geometric figures in te ast capter. As you get farter advanced in mat, you find cases ere you need
More informationModeling and Analysis of Adaptive Buffer Sharing Scheme for Consecutive Packet Loss Reduction in Broadband Networks
Internationa Journa of Eectrica and Eectronics Engineering 4:1 2010 Modeing and Anaysis of Adaptive Buffer Saring Sceme for Consecutive Packet Loss Reduction in Broadband Networks Saksi Kausa, R.K Sarma
More informationIncremental and Adaptive Clustering Stream Data over Sliding Window
Incrementa and Adaptive Custering Stream Data over Siding Window Xuan Hong Dang 1, Vincent C S Lee 1, Wee Keong Ng 2, and Kok Leong Ong 3 1 Monas University, Austraia, xdang;vincent.ee@infotec.monas.edu
More informationFast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation
P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,
More informationBounding Tree Cover Number and Positive Semidefinite Zero Forcing Number
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various
More information4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More informationAutomatic Grouping for Social Networks CS229 Project Report
Automatic Grouping for Socia Networks CS229 Project Report Xiaoying Tian Ya Le Yangru Fang Abstract Socia networking sites aow users to manuay categorize their friends, but it is aborious to construct
More information4.2 The Derivative. f(x + h) f(x) lim
4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially
More informationNearest Neighbor Learning
Nearest Neighbor Learning Cassify based on oca simiarity Ranges from simpe nearest neighbor to case-based and anaogica reasoning Use oca information near the current query instance to decide the cassification
More information, 1 1, A complex fraction is a quotient of rational expressions (including their sums) that result
RT. Complex Fractions Wen working wit algebraic expressions, sometimes we come across needing to simplify expressions like tese: xx 9 xx +, xx + xx + xx, yy xx + xx + +, aa Simplifying Complex Fractions
More information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
More informationMobile App Recommendation: Maximize the Total App Downloads
Mobie App Recommendation: Maximize the Tota App Downoads Zhuohua Chen Schoo of Economics and Management Tsinghua University chenzhh3.12@sem.tsinghua.edu.cn Yinghui (Catherine) Yang Graduate Schoo of Management
More informationSolutions to the Final Exam
CS/Math 24: Intro to Discrete Math 5//2 Instructor: Dieter van Mekebeek Soutions to the Fina Exam Probem Let D be the set of a peope. From the definition of R we see that (x, y) R if and ony if x is a
More informationNeural Network Enhancement of the Los Alamos Force Deployment Estimator
Missouri University of Science and Technoogy Schoars' Mine Eectrica and Computer Engineering Facuty Research & Creative Works Eectrica and Computer Engineering 1-1-1994 Neura Network Enhancement of the
More informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More informationProceedings of the International Conference on Systolic Arrays, San Diego, California, U.S.A., May 25-27, 1988 AN EFFICIENT ASYNCHRONOUS MULTIPLIER!
[1,2] have, in theory, revoutionized cryptography. Unfortunatey, athough offer many advantages over conventiona and authentication), such cock synchronization in this appication due to the arge operand
More informationFault Localization Using Tarantula
Class 20 Fault localization (cont d) Test-data generation Exam review: Nov 3, after class to :30 Responsible for all material up troug Nov 3 (troug test-data generation) Send questions beforeand so all
More informationDETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS
DETERMINING INTUITIONISTIC FUZZY DEGREE OF OVERLAPPING OF COMPUTATION AND COMMUNICATION IN PARALLEL APPLICATIONS USING GENERALIZED NETS Pave Tchesmedjiev, Peter Vassiev Centre for Biomedica Engineering,
More informationReplication of Virtual Network Functions: Optimizing Link Utilization and Resource Costs
Repication of Virtua Network Functions: Optimizing Link Utiization and Resource Costs Francisco Carpio, Wogang Bziuk and Admea Jukan Technische Universität Braunschweig, Germany Emai:{f.carpio, w.bziuk,
More informationMore on Functions and Their Graphs
More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in
More informationA Memory Grouping Method for Sharing Memory BIST Logic
A Memory Grouping Method for Sharing Memory BIST Logic Masahide Miyazai, Tomoazu Yoneda, and Hideo Fuiwara Graduate Schoo of Information Science, Nara Institute of Science and Technoogy (NAIST), 8916-5
More informationAs Michi Henning and Steve Vinoski showed 1, calling a remote
Reducing CORBA Ca Latency by Caching and Prefetching Bernd Brügge and Christoph Vismeier Technische Universität München Method ca atency is a major probem in approaches based on object-oriented middeware
More informationSection 1.2 The Slope of a Tangent
Section 1.2 Te Slope of a Tangent You are familiar wit te concept of a tangent to a curve. Wat geometric interpretation can be given to a tangent to te grap of a function at a point? A tangent is te straigt
More informationAn Introduction to Design Patterns
An Introduction to Design Patterns 1 Definitions A pattern is a recurring soution to a standard probem, in a context. Christopher Aexander, a professor of architecture Why woud what a prof of architecture
More informationMaking Wireless Networks MORAL
Tis paper was presented as part of te main tecnica program at IEEE INFOCOM Making Wireess Networks MORAL Nazif C. Tas Inteigent Systems and Contro Siemens Corporate Researc Princeton, NJ, 88 Nazif.Tas@Siemens.com
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More informationSelf-Control Cyclic Access with Time Division - A MAC Proposal for The HFC System
Sef-Contro Cycic Access with Time Division - A MAC Proposa for The HFC System S.M. Jiang, Danny H.K. Tsang, Samue T. Chanson Hong Kong University of Science & Technoogy Cear Water Bay, Kowoon, Hong Kong
More informationCESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm
Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer
More informationSection 2.3: Calculating Limits using the Limit Laws
Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give
More information2.8 The derivative as a function
CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in
More information1.4 RATIONAL EXPRESSIONS
6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions
More informationA Petrel Plugin for Surface Modeling
A Petre Pugin for Surface Modeing R. M. Hassanpour, S. H. Derakhshan and C. V. Deutsch Structure and thickness uncertainty are important components of any uncertainty study. The exact ocations of the geoogica
More informationReal-Time Image Generation with Simultaneous Video Memory Read/Write Access and Fast Physical Addressing
Rea-Time Image Generation with Simutaneous Video Memory Read/rite Access and Fast Physica Addressing Mountassar Maamoun 1, Bouaem Laichi 2, Abdehaim Benbekacem 3, Daoud Berkani 4 1 Department of Eectronic,
More informationDynamic Symbolic Execution of Distributed Concurrent Objects
Dynamic Symboic Execution of Distributed Concurrent Objects Andreas Griesmayer 1, Bernhard Aichernig 1,2, Einar Broch Johnsen 3, and Rudof Schatte 1,2 1 Internationa Institute for Software Technoogy, United
More informationDensity Estimation Over Data Stream
Density Estimation Over Data Stream Aoying Zou Dept. of Computer Science, Fudan University 22 Handan Rd. Sangai, 2433, P.R. Cina ayzou@fudan.edu.cn Ziyuan Cai Dept. of Computer Science, Fudan University
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
More informationSensitivity Analysis of Hopfield Neural Network in Classifying Natural RGB Color Space
Sensitivity Anaysis of Hopfied Neura Network in Cassifying Natura RGB Coor Space Department of Computer Science University of Sharjah UAE rsammouda@sharjah.ac.ae Abstract: - This paper presents a study
More informationUnsupervised Learning for Hierarchical Clustering Using Statistical Information
Unsupervised Learning for Hierarcical Clustering Using Statistical Information Masaru Okamoto, Nan Bu, and Tosio Tsuji Department of Artificial Complex System Engineering Hirosima University Kagamiyama
More informationApplication of Intelligence Based Genetic Algorithm for Job Sequencing Problem on Parallel Mixed-Model Assembly Line
American J. of Engineering and Appied Sciences 3 (): 5-24, 200 ISSN 94-7020 200 Science Pubications Appication of Inteigence Based Genetic Agorithm for Job Sequencing Probem on Parae Mixed-Mode Assemby
More informationNumerical Derivatives
Lab 15 Numerical Derivatives Lab Objective: Understand and implement finite difference approximations of te derivative in single and multiple dimensions. Evaluate te accuracy of tese approximations. Ten
More informationA METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS. A. C. Finch, K. J. Mackenzie, G. J. Balsdon, G. Symonds
A METHOD FOR GRIDLESS ROUTING OF PRINTED CIRCUIT BOARDS A C Finch K J Mackenzie G J Basdon G Symonds Raca-Redac Ltd Newtown Tewkesbury Gos Engand ABSTRACT The introduction of fine-ine technoogies to printed
More informationFuzzy Equivalence Relation Based Clustering and Its Use to Restructuring Websites Hyperlinks and Web Pages
Fuzzy Equivaence Reation Based Custering and Its Use to Restructuring Websites Hyperinks and Web Pages Dimitris K. Kardaras,*, Xenia J. Mamakou, and Bi Karakostas 2 Business Informatics Laboratory, Dept.
More informationLauricella hypergeometric and Pearson s system of partial difference equations
Goba Journa of Pure and Appied Matematics. ISSN 097-768 Voume, Number (07), pp. 7805 788 Researc India Pubications ttp://www.ripubication.com/gjpam.tm Lauricea ypergeometric and Pearson s system of partia
More informationAn Optimizing Compiler
An Optimizing Compier The big difference between interpreters and compiers is that compiers have the abiity to think about how to transate a source program into target code in the most effective way. Usuay
More informationThe Euler and trapezoidal stencils to solve d d x y x = f x, y x
restart; Te Euler and trapezoidal stencils to solve d d x y x = y x Te purpose of tis workseet is to derive te tree simplest numerical stencils to solve te first order d equation y x d x = y x, and study
More informationA Method for Calculating Term Similarity on Large Document Collections
$ A Method for Cacuating Term Simiarity on Large Document Coections Wofgang W Bein Schoo of Computer Science University of Nevada Las Vegas, NV 915-019 bein@csunvedu Jeffrey S Coombs and Kazem Taghva Information
More informationCubic smoothing spline
Cubic smooting spline Menu: QCExpert Regression Cubic spline e module Cubic Spline is used to fit any functional regression curve troug data wit one independent variable x and one dependent random variable
More informationAN EVOLUTIONARY APPROACH TO OPTIMIZATION OF A LAYOUT CHART
13 AN EVOLUTIONARY APPROACH TO OPTIMIZATION OF A LAYOUT CHART Eva Vona University of Ostrava, 30th dubna st. 22, Ostrava, Czech Repubic e-mai: Eva.Vona@osu.cz Abstract: This artice presents the use of
More informationEfficient Geometry-based Similarity Search of 3D Spatial Databases
Efficient Geometry-based Simiarity Search of 3D Spatia Databases Danie A Keim University of Hae-Wittenberg, Kurt-Mothes-Str 1, D-06120 Hae, Germany keim@informatikuni-haede Abstract Searching a database
More informationTopology-aware Key Management Schemes for Wireless Multicast
Topoogy-aware Key Management Schemes for Wireess Muticast Yan Sun, Wade Trappe,andK.J.RayLiu Department of Eectrica and Computer Engineering, University of Maryand, Coege Park Emai: ysun, kjriu@gue.umd.edu
More informationA Comparison of a Second-Order versus a Fourth- Order Laplacian Operator in the Multigrid Algorithm
A Comparison of a Second-Order versus a Fourth- Order Lapacian Operator in the Mutigrid Agorithm Kaushik Datta (kdatta@cs.berkeey.edu Math Project May 9, 003 Abstract In this paper, the mutigrid agorithm
More informationA New Supervised Clustering Algorithm Based on Min-Max Modular Network with Gaussian-Zero-Crossing Functions
2006 Internationa Joint Conference on Neura Networks Sheraton Vancouver Wa Centre Hote, Vancouver, BC, Canada Juy 16-21, 2006 A New Supervised Custering Agorithm Based on Min-Max Moduar Network with Gaussian-Zero-Crossing
More informationCollaborative Approach to Mitigating ARP Poisoning-based Man-in-the-Middle Attacks
Coaborative Approach to Mitigating ARP Poisoning-based Man-in-the-Midde Attacks Seung Yeob Nam a, Sirojiddin Djuraev a, Minho Park b a Department of Information and Communication Engineering, Yeungnam
More informationChinese Grain Production Forecasting Method Based on Particle Swarm Optimization-based Support Vector Machine
8 Recent Patents on Engineering 009, 3, 8-1 Cinese Grain Production Metod Based on Partice Swarm Optimization-based Support Vector Macine Seng-Wei Fei*, Yu-Bin Miao and Ceng-Liang Liu Scoo of Mecanica
More informationIntra- and Inter-Session Network Coding in Wireless Networks
Intra- and Inter-Session Network Coding in Wireless Networks Hulya Seferoglu, Member, IEEE, Atina Markopoulou, Member, IEEE, K K Ramakrisnan, Fellow, IEEE arxiv:857v [csni] 3 Feb Abstract In tis paper,
More informationLoad Balancing by MPLS in Differentiated Services Networks
Load Baancing by MPLS in Differentiated Services Networks Riikka Susitaiva, Jorma Virtamo, and Samui Aato Networking Laboratory, Hesinki University of Technoogy P.O.Box 3000, FIN-02015 HUT, Finand {riikka.susitaiva,
More informationInvestigating an automated method for the sensitivity analysis of functions
Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands
More informationComparison of the Efficiency of the Various Algorithms in Stratified Sampling when the Initial Solutions are Determined with Geometric Method
International Journal of Statistics and Applications 0, (): -0 DOI: 0.9/j.statistics.000.0 Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined
More informationComputing geodesic paths on manifolds
Proc. Natl. Acad. Sci. USA Vol. 95, pp. 8431 8435, July 1998 Applied Matematics Computing geodesic pats on manifolds R. Kimmel* and J. A. Setian Department of Matematics and Lawrence Berkeley National
More informationChapter 5 Combinational ATPG
Chapter 5 Combinationa ATPG 2 Outine Introduction to ATPG ATPG for Combinationa Circuits Advanced ATPG Techniques 3 Input and Output of an ATPG ATPG (Automatic Test Pattern Generation) Generate a set of
More informationAlpha labelings of straight simple polyominal caterpillars
Apha abeings of straight simpe poyomina caterpiars Daibor Froncek, O Nei Kingston, Kye Vezina Department of Mathematics and Statistics University of Minnesota Duuth University Drive Duuth, MN 82-3, U.S.A.
More informationChapter K. Geometric Optics. Blinn College - Physics Terry Honan
Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental
More informationThe (, D) and (, N) problems in double-step digraphs with unilateral distance
Electronic Journal of Grap Teory and Applications () (), Te (, D) and (, N) problems in double-step digraps wit unilateral distance C Dalfó, MA Fiol Departament de Matemàtica Aplicada IV Universitat Politècnica
More informationUtilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks
Utilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks Okan Yilmaz and Ing-Ray Cen Computer Science Department Virginia Tec {oyilmaz, ircen}@vt.edu
More informationBacking-up Fuzzy Control of a Truck-trailer Equipped with a Kingpin Sliding Mechanism
Backing-up Fuzzy Contro of a Truck-traier Equipped with a Kingpin Siding Mechanism G. Siamantas and S. Manesis Eectrica & Computer Engineering Dept., University of Patras, Patras, Greece gsiama@upatras.gr;stam.manesis@ece.upatras.gr
More informationComputer Graphics. - Shading & Texturing -
Computer Graphics - Shading & Texturing - Empirica BRDF Approximation Purey heuristic mode Initiay without units (vaues [0,1] r = r,a + r,d + r,s ( + r,m + r,t r,a : Ambient term Approximate indirect iumination
More informationPneumo-Mechanical Simulation of a 2 Dof Planar Manipulator
Pneumo-Mechanica Simuation of a 2 Dof Panar Manipuator Hermes GIBERTI, Simone CINQUEMANI Mechanica Engineering Department, Poitecnico di Miano, Campus Bovisa Sud, via La Masa 34, 2156, Miano, Itay ABSTRACT
More information12.2 Techniques for Evaluating Limits
335_qd /4/5 :5 PM Page 863 Section Tecniques for Evaluating Limits 863 Tecniques for Evaluating Limits Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing
More informationCoarticulation: An Approach for Generating Concurrent Plans in Markov Decision Processes
Coarticulation: An Approac for Generating Concurrent Plans in Markov Decision Processes Kasayar Roanimanes kas@cs.umass.edu Sridar Maadevan maadeva@cs.umass.edu Department of Computer Science, University
More informationFastest-Path Computation
Fastest-Path Computation DONGHUI ZHANG Coege of Computer & Information Science Northeastern University Synonyms fastest route; driving direction Definition In the United states, ony 9.% of the househods
More informationCommunicator for Mac Quick Start Guide
Communicator for Mac Quick Start Guide 503-968-8908 sterling.net training@sterling.net Pone Support 503.968.8908, option 2 pone-support@sterling.net For te most effective support, please provide your main
More informationMinimizing Memory Access By Improving Register Usage Through High-level Transformations
Minimizing Memory Access By Improving Register Usage Troug Hig-level Transformations San Li Scool of Computer Engineering anyang Tecnological University anyang Avenue, SIGAPORE 639798 Email: p144102711@ntu.edu.sg
More informationECEn 528 Prof. Archibald Lab: Dynamic Scheduling Part A: due Nov. 6, 2018 Part B: due Nov. 13, 2018
ECEn 528 Prof. Archibad Lab: Dynamic Scheduing Part A: due Nov. 6, 2018 Part B: due Nov. 13, 2018 Overview This ab's purpose is to expore issues invoved in the design of out-of-order issue processors.
More informationVERTICAL DIFFERENTIATION IN THE MARKET FOR SECURITY SOFTWARE
Pacific Asia Conference on Information Systems (PACIS) PACIS 009 Proceedings Association for Information Systems Year 009 VERTICAL DIFFERENTIATION IN THE MARKET FOR SECURITY SOFTWARE Debabrata Dey Guoying
More information12.2 TECHNIQUES FOR EVALUATING LIMITS
Section Tecniques for Evaluating Limits 86 TECHNIQUES FOR EVALUATING LIMITS Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing tecnique to evaluate its of
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More informationRDF Objects 1. Alex Barnell Information Infrastructure Laboratory HP Laboratories Bristol HPL November 27 th, 2002*
RDF Objects 1 Aex Barne Information Infrastructure Laboratory HP Laboratories Bristo HPL-2002-315 November 27 th, 2002* E-mai: Andy_Seaborne@hp.hp.com RDF, semantic web, ontoogy, object-oriented datastructures
More informationA Novel Serial/Parallel Pole Climbing/Manipulating Robot: Design, Kinematic Analysis and Workspace Optimization with Genetic Algorithm
A Nove Seria/Parae Poe Cimbing/Manipuating Robot: Design, Kinematic Anaysis and Workspace Optimiation wit Genetic Agoritm M. Tavakoi ζ, G.R Vosougi*, S. Bageri**, M.R. Zakerade ζ, H. Saarie ζ *Professor
More informationANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS
NTNN SPHRICL COORDINT SSTMS ND THIR PPLICTION IN COMBINING RSULTS FROM DIFFRNT NTNN ORINTTIONS llen C. Newell, Greg Hindman Nearfield Systems Incorporated 133. 223 rd St. Bldg. 524 Carson, C 9745 US BSTRCT
More informationTHE PERCENTAGE OCCUPANCY HIT OR MISS TRANSFORM
17th European Signa Processing Conference (EUSIPCO 2009) Gasgow, Scotand, August 24-28, 2009 THE PERCENTAGE OCCUPANCY HIT OR MISS TRANSFORM P. Murray 1, S. Marsha 1, and E.Buinger 2 1 Dept. of Eectronic
More informationFunctions. 6.1 Modular Programming. 6.2 Defining and Calling Functions. Gaddis: 6.1-5,7-10,13,15-16 and 7.7
Functions Unit 6 Gaddis: 6.1-5,7-10,13,15-16 and 7.7 CS 1428 Spring 2018 Ji Seaman 6.1 Moduar Programming Moduar programming: breaking a program up into smaer, manageabe components (modues) Function: a
More informationfile://j:\macmillancomputerpublishing\chapters\in073.html 3/22/01
Page 1 of 15 Chapter 9 Chapter 9: Deveoping the Logica Data Mode The information requirements and business rues provide the information to produce the entities, attributes, and reationships in ogica mode.
More informationMulti-Stack Boundary Labeling Problems
Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,
More informationMaterials: Whiteboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector.
Adam Clinc Lesson: Deriving te Derivative Grade Level: 12 t grade, Calculus I class Materials: Witeboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector. Goals/Objectives:
More informationLecture outline Graphics and Interaction Scan Converting Polygons and Lines. Inside or outside a polygon? Scan conversion.
Lecture outine 433-324 Graphics and Interaction Scan Converting Poygons and Lines Department of Computer Science and Software Engineering The Introduction Scan conversion Scan-ine agorithm Edge coherence
More informationArchive Software with value add services:
E-Mai Archive Software with vaue add services: Protect your emais from data oss through reasonabe and secure backup features. Increase the productivity of your team by using the integrated search engine
More informationLesson 6 MA Nick Egbert
Overview From kindergarten we all know ow to find te slope of a line: rise over run, or cange in over cange in. We want to be able to determine slopes of functions wic are not lines. To do tis we use te
More informationLink Registry Protocol Options
Link Registry Protoco Options Norman Finn, March 2017 HUAWEI TECHNOLOGIES CO., LTD. IEEE 802.1 TSN At east two obvious choices for P802.1CS Link Registration Protoco An IS-IS-ike protoco. TCP (Transmission
More informationTHE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM
THE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM SAMUEL OLU OLAGUNJU Adeyemi College of Education NIGERIA Email: lagsam04@aceondo.edu.ng ABSTRACT
More information5940 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 11, NOVEMBER 2014
5940 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 13, NO. 11, NOVEMBER 014 Topoogy-Transparent Scheduing in Mobie Ad Hoc Networks With Mutipe Packet Reception Capabiity Yiming Liu, Member, IEEE,
More informationAlternating Direction Implicit Methods for FDTD Using the Dey-Mittra Embedded Boundary Method
Te Open Plasma Pysics Journal, 2010, 3, 29-35 29 Open Access Alternating Direction Implicit Metods for FDTD Using te Dey-Mittra Embedded Boundary Metod T.M. Austin *, J.R. Cary, D.N. Smite C. Nieter Tec-X
More informationInterference and Diffraction of Light
Interference and Diffraction of Ligt References: [1] A.P. Frenc: Vibrations and Waves, Norton Publ. 1971, Capter 8, p. 280-297 [2] PASCO Interference and Diffraction EX-9918 guide (written by Ann Hanks)
More informationIntro to Programming & C Why Program? 1.2 Computer Systems: Hardware and Software. Why Learn to Program?
Intro to Programming & C++ Unit 1 Sections 1.1-3 and 2.1-10, 2.12-13, 2.15-17 CS 1428 Spring 2018 Ji Seaman 1.1 Why Program? Computer programmabe machine designed to foow instructions Program a set of
More informationAn Algorithm for Loopless Deflection in Photonic Packet-Switched Networks
An Algoritm for Loopless Deflection in Potonic Packet-Switced Networks Jason P. Jue Center for Advanced Telecommunications Systems and Services Te University of Texas at Dallas Ricardson, TX 75083-0688
More informationMYRA Face Detection and Face Recognition System
MYRA Face Detection and Face Recognition System Tibor Kövér, Dénes Víg, Zotán Vámossy Institute of Software Tecnoogy, Jon von Neumann Facuty of Informatics, Budapest Tec Bécsi út 96/B, H-1034 Budapest,
More informationNo connection establishment Do not perform Flow control Error control Retransmission Suitable for small request/response scenario E.g.
UDP & TCP 2018/3/26 UDP Header Characteristics of UDP No connection estabishment Do not perform Fow contro Error contro Retransmission Suitabe for sma request/response scenario E.g., DNS Remote Procedure
More informationExcel based finite difference modeling of ground water flow
Journal of Himalaan Eart Sciences 39(006) 49-53 Ecel based finite difference modeling of ground water flow M. Gulraiz Akter 1, Zulfiqar Amad 1 and Kalid Amin Kan 1 Department of Eart Sciences, Quaid-i-Azam
More information