Concerning Predictability in Dependable Componentbased Systems: Classification of Quality Attributes

Size: px
Start display at page:

Download "Concerning Predictability in Dependable Componentbased Systems: Classification of Quality Attributes"

Transcription

1 Concernng Predctablty n Dependable Componentbased Systems: Classfcaton of Qualty Attrbutes Ivca Crnovc 1, Magnus Larsson 2 1 Mälardalen Unversty, Department of Computer Scence and Engneerng Box 883, Västerås, Sweden vca.crnovc@mdh.se 2 ABB Corporate Research, Västerås, Sweden magnus.larsson@mdh.se Abstract. One of the man objectves of developng component-based software systems s to enable buldng systems by ntegraton of components whch are perceved as blac boxes. Whle the constructon part of the ntegraton usng component nterfaces s a standard part of all component models, the predcton of the qualty attrbutes of the component compostons s not fully developed. Ths decreases sgnfcantly the value of the component-based approach to buldng dependable systems. When t s not possble to predct the value of a partcular attrbute of a system on the bass of the specfcatons of the system components, the system must be subjected to other procedures, often costly, to determne ths value emprcally. However, all qualty attrbutes do not have the same characterstcs; nor s t possble to predct the behavor of all the propertes of a composton from the propertes of the components. Ths paper classfes dfferent types of relatons between the qualty attrbutes of components and those of ther compostons. The types of relatons are classfed accordng to the possblty of predctng the propertes of compostons from the propertes of the components and accordng to the mpacts of other factors such as system envronment or software archtecture. Such a classfcaton can ndcate the efforts whch would be requred to predct the system attrbutes that are essental for system dependablty and n ths way, the feasblty of the component-based approach n developng dependable systems. 1 Introducton Component-based development (CBD) s of great nterest to the software engneerng communty and has acheved consderable success n many engneerng domans. CBD, has been extensvely used for several years n destop envronments, offce applcatons, e-busness and n general n Internet- and web-based dstrbuted applcatons. The component technologes (for example COM/DCOM, CORBA, EJB and.net) used n these domans orgnate from object-orented (OO) technques. The basc prncples of the OO approach, such as encapsulaton and class specfcaton

2 have been further extended; the mportance of component nterfaces has ncreased; a component nterface s treated as a component specfcaton and the component mplementaton s treated as a blac box. A component nterface s also the means of ntegratng the component n an assembly. Component technologes nclude the support of component deployment nto a system through the component nterface. On the other hand, the management of components qualty attrbutes has not been supported by these technologes. In the domans n whch these technologes are wdely used, the qualty attrbutes have not been of prmary nterest and have not been explctly addressed n the component technologes, they have nstead been treated separately from the appled component-based technologes. Component-based approach s a large extend related to software archtecture. A use of a component-based technology helps n avodng of an archtectural msmatch by standardzng certan archtectural decsons. A software component model specfes rules for component composton and nteroperaton and n ths way smplfes the development process and smlar to software archtecture maes t possble to reason about qualty propertes to large extent ndependently of a partcular applcaton. The man dfference between a component-based approach and software archtectureorented approach s the focus on reusablty of already exstng components vs. topdown approach for dentfyng the components. In many other domans, for example dependable systems, CBD s utlzed to a lesser degree for a number of dfferent reasons. One s the dffculty of mplementng the same component technologes n dfferent domans because of dfferent system constrants. Another reason s the unclear dstncton between system components whch nclude both hardware and software parts and software components whch may be encapsulated n system components or dstrbuted through several system components (n ths artcle when we refer to components we assume software components ). Fnally an mportant reason s the nablty of component-based technologes to deal wth qualty attrbutes as requred n these domans. For dependable systems, a number of qualty attrbutes are at least as mportant as the functons they provde, and the development efforts related to them are most often greater than the efforts related to the mplementaton of partcular functons. If the advantages of componentbased technologes are lmted to the functonal doman only and cannot be utlzed n the doman of qualty attrbutes, or, even worse, ntroduce dffcultes n the management of qualty attrbutes, these technologes cannot be successfully utlzed n the development of dependable systems. Some of the man advantages of CBD are reusablty, hgher abstracton level and separaton of the system development process from the component development process. These advantages have however mplcatons related to other aspects of software and system development. The fnal success of the utlzaton of CBD depends not only on ts advantages but also on these mplcatons the degree to whch they are postve and negatve. Snce for dependable systems, partcular qualty attrbutes are of the greatest mportance, a queston whch arses s to what extent does CBD nfluence the achevement of these propertes: CBD can ntroduce new dffcultes, t can be rrelevant for those propertes, or can have a postve effect. For ths reason t s of nterest to analyze the ablty of CBD to cope wth requrements related to qualty attrbutes.

3 Component-based software engneerng (CBSE) faces two types of problems n dealng wth qualty attrbutes. The frst, common to all software development, s the fact that the qualty attrbutes are often mprecsely defned or very dffcult to measure. The second, specfc to component-based systems, s the dffculty of relatng system propertes to component propertes. In CBD one requrement s that components should be selected and ntegrated n an automatc and effcent way. Ths goal s acheved for the functonal part; components are selected and ntegrated through ther nterfaces. The queston s f a smlar approach can be appled to qualty attrbutes. For component-based systems crucal questons n relaton to qualty attrbutes are the followng: Gven the system qualty attrbutes requred, whch propertes are requred of the components concerned? Gven a set of component propertes, whch system propertes are predctable? How can the qualty attrbutes of a system be accurately predcted, from the qualty attrbutes of components whch are determned wth a certan accuracy. To whch extent, and under whch constrants are the emergng system propertes (.e. the system propertes non-exstent on the component level) determned by the component propertes? These and smlar questons have been addressed at a seres of CBSE worshops [1], and partcular models of certan propertes have been analyzed [2,3], but so far very lttle wor has been done n the systematzaton and classfcaton of qualty attrbutes n accordance wth the questons above. Although there are other classfcatons of qualty attrbutes such as [4-7], these have not consdered the predctablty aspect of the qualty attrbutes. Some system propertes can be derved drectly from the component propertes; others mght requre a complex model, related to the component model and the system archtecture. Some system propertes, such as safety, do not exst on the component level and mght be the result of a complex combnaton of the system nteracton wth ts envronment, system archtecture and component model. In ths paper, our ntenton s to demonstrate the dversty of qualty attrbutes and the dfferent methodologes whch can be used for predctng system behavor from the propertes of the components nvolved. These propertes can be classfed accordng to the ablty of component-based technologes to specfy them and provde methods for expressng ther compostons,.e. the ablty to predct the propertes of component assembles. Such a classfcaton ndcates the feasblty of the componentbased approach for buldng dependable systems. The paper s organzed as follows: Secton 2 dentfes the types of propertes accordng to the prncples for predctng the propertes of component assembles. Secton 3 dscusses the possblty of defnng component composton n a recursve way. Secton 4 provdes a lst of many qualty attrbutes and classfes them accordng to the compostonal prncples dscussed n the prevous sectons. Fnally, secton 5 exemplfes the reasonng by showng qualty attrbutes for safety-crtcal systems.

4 2 Classfcaton of Propertes A great number of qualty attrbutes are encountered n Software engneerng. They are classfed n many dfferent ways, frequently n a non-orthogonal manner. One example of classfcaton s related to the system lfe cycle: Run-tme propertes (vsble and measurable durng the program executon) and lfe-cycle propertes (those that characterze dfferent phases n a development and mantenance process). The classfcaton we consder here s related to composablty. We classfy propertes accordng to the prncples appled n dervng the system propertes from the propertes of the components nvolved. Instead of the term system, we shall use a generc term Assembly (A) whch smply denotes a set of nteractng components. Such an assembly can be a part of a software system (for example a functonal unt, or a subsystem), or the entre system. The only characterstc we want to relate to an assembly s a set of ntegrated components. Some propertes, however, cannot be related only to an assembly, but are explctly related to the entre system and ts nteracton wth the envronment. In such cases we refer to a System (S). Accordng to composton prncples we can dstngush the followng types of propertes: a. Drectly composable propertes. A property of an assembly whch s a functon of, and only of the same property of the components nvolved. b. Archtecture-related propertes. A property of an assembly whch s a functon of the same property of the components and of the software archtecture. c. Derved propertes. A property of an assembly whch depends on several dfferent propertes of the components. d. Usage-depended propertes. A property of an assembly whch s determned by ts usage profle. e. System envronment context propertes. A property whch s determned by other propertes and by the state of the system envronment. Let us dscuss these cases and gve examples n the followng subsectons. a. Drectly composable propertes Defnton: A drectly composable property of an assembly s a functon of, and only of the same property of the components. P = property, A = assembly, c = component A = { c } P( A) = f ( P( c )); N Note that the property of the assembly s the same as the component property. Further, the component technology s not explctly specfed n the relaton (1). However (1)

5 t s obvous that the functon f tself s dependent on the technology snce the mechansms to assemble components s provded by the component technology. An example of a property of ths type s the statc memory sze of a component or an assembly, ths s also nown as the memory footprnt. The smplest composton model s the calculaton of the statc memory of an assembly as the sum of the memores used by each component: n M ( A) = M ( c ) = 1 M = memory sze, A = assembly, c = components The functon M(c ) s dfferent for dfferent technologes. For example n the case of the separaton of composton tme from run-tme whch s usually used n embedded systems, M(c ) wll be a constant, possbly parameterzed by confguraton factors. In such cases the statc memory sze of an assembly wll be a constant. A more complcated model can be found n the Koala component model [8], n whch addtonal parameters, such as sze of glue code, nterface parameterzaton and dversty are taen nto account (.e. the parameters determned by the component technology used). The equaton (2) s also vald for a dynamc memory, wth the dfference that M(c ) s not a constant, but a functon whch may depend on the usage profle. When usng a partcular technology, ths functon may be lmted or budgeted. In such a case the total amount of memory can be calculated. n = 1 (2) M ( A) M max ( ) (3) The propertes of ths type can be calculated drectly from the component propertes and the partcular technology. There are no other assumptons and therefore these propertes are the easest to specfy and calculate. Ths does not mean that the composton functons are easy or even possble to express formally. However the fact that the property s vsble on component and assembly level, and that the assembly property s dependent only on the component propertes smplfes the predcton procedure. Ths s vald ether for measurements or for dentfyng restrctons whch wll mae t possble to reason about the composton. c b. Archtecture-related Propertes Defnton: An archtecture-related property of an assembly s a functon of the same property of the components and of the software archtecture. SA = software archtectureture, x = connectons P( A) = f ( P( c ), SA( c, x ));, N (4)

6 In ths case the assembly propertes depend not only on the component propertes but on the archtectural structure. The software archtecture s often used as a means for mprovng partcular propertes wthout changng the component propertes. These types of propertes can be tuned by dfferent archtectural solutons or varatons. An example of such a property s a performance predctablty model for J2EE (Java 2 Platform, Enterprse Edton) applcaton. A typcal applcaton mplemented n ths technology would be a dstrbuted web-based applcaton n whch the varablty n scalablty s acheved by t beng possble to add new clents and new computatonal (busness) components to the server as llustrated n Fgure 1. To acheve concurrency the components are executed n dfferent threads. A possble extenson varaton of ths archtecture s the possblty to nclude several nodes wth web servers and busness applcatons. The performance of the system shown n the Fgure 1 s related to the number of clents and the number of server components. A typcal requrement for such applcatons s the performance and scalablty,.e. the dependences between the performance and number of clents and actve busness components. Clent ter Web server ter Busness logc ter Data ter Web server Data access components Data Busness components Varablty ponts Fg. 1. A typcal mult-ter archtecture wth clent and servers varablty ponts affectng the performance qualty attrbute Accordng to [9,10] the tme per transacton T/N expressed n (5) depends on several factors related to the system archtecture: The frst factor comes from the concurrent requests that compete for servce from the server component. Ths ncludes the networ bandwdth and underlyng transport mechansms. The second factor descrbes a case n whch accepted requests compete for a thread to execute the busness components. The thrd factor results from concurrent access to the database by the concurrent server threads. The frst factor s proportonal to the number of clents, the second to the number of clents and nversely proportonal to the number of threads (.e. number of components on the server) and the thrd factor s proportonal to the number of the threads.

7 T / N = ax + b x y + cy T / N = executon tme per transacton x = number of clents; y = number of components a, b, c = proportonal factors for a partcular mplementaton The form of the equaton shows that t s possble to calculate the optmal number of threads n relaton to the number of clents to acheve a mnmum respond tme per transacton. (5) c. Derved Propertes Defnton: A derved property of an assembly s a property that depends on several dfferent propertes of the components. P( A) = f ( P ( c ), P ( c ), L, P ( c ));, N P = assembly property P... P = component propertes (6) In the same way that a functon of an assembly s more than the sum of the component functons, there are propertes that are the result of the composton of dfferent component propertes. An example of such a property n a real-tme system s the end-to-end deadlne (a maxmal response tme) that s a functon of dfferent component propertes, such as worst case executon tme (WCET) and executon perod as shown n the followng example. Let us consder real-tme port-based component models wth provded and requred nterfaces and nterfaces to an underlyng operatng system or I/O devces, as dscussed n [11-13]. In these models, components are mplemented as tass, parts of a tas or a set of tass. An assembly consstng of two components, where every component s realzed as a tas s shown on fgure 2. Each basc component ncludes propertes such as WCET and executon perod. A composton of ths smple model s acheved by connectng ports and dentfyng provded and requred nterfaces. The queston s whether we can calculate WCET for an assembly of components executng wth dfferent perods. In a case n whch the executon perods are the same, ths would be possble. In a case n whch these perods are dfferent, we cannot specfy WCET of the assembly, but we can specfy end-to-end deadlne and a perod. An end-to end deadlne s the maxmum tme nterval between the start of the frst component n an assembly and the fnsh of the last component n the assembly. The assembly perod wll be a number to whch the components perods are dvsors.

8 Input ports A C1 wcet1 f1 C2 wcet2 f2 Output ports Fg. 2. Composton of port-based components Emergng propertes,.e. propertes that are pertnent on a system (or an assembly) level but are not vsble on the component level are of specal nterest n ths category. For such propertes the major challenge s to dentfy the propertes of the components that have mpact on them. d. Usage-dependent Propertes Defnton: A Usage-dependent property of an assembly s a property whch s determned by ts usage profle. P ( A, U P U U = =, = ) = f ( P( c, U, property for a partcular usage profle assembly usageprofle ));, N component usageprofle The behavor of an assembly and consequently of a system depends not only on the nternal propertes of the components and ther composton but also on the partcular use of the system. A usage profle U whch determnes a partcular property P must be transformed to the usage profle U, to determne the propertes of the components. Propertes of ths type ntroduce partcular problems as they depend on the use of the system. Ths means that the component developers must predct as far as possble the use of the component n dfferent systems whch may not yet exst. A second problem s the transfer of the usage profle from the assembly (or from the system) to the component. Even f the usage profle on the assembly level (U ) s specfed, the usage profle for the components (U, ) s not easly determned especally when the assembly (and the system) confguraton s not nown. A partcular problem wth ths type of property s the lmted possblty of reusng measured and derved propertes. If the usage profle s changed, the propertes must be re-calculated or re-measured. An example of such a property s relablty whch s based on a usage profle. The queston arsng here s the possblty of reusng prevous specfcatons of the property [11]. The frst thought would be that ths s possble (7)

9 f the doman of the new usage profle s a sub-doman of an old usage profle. In ths case the value of a property wll be wthn the range of possble values of the property for the old usage profle, the local maxmum and mnmum value beng n the range of values for the old usage profle (see Fg. 3). P(U) P P l U l-mn U l U l-max U -mn U U -max Fg. 3. Property for dfferent usage profles If the new requrements are equal of or less strngent than the old requrements, we can use the property value from the old usage profle. Ths means, for example, that we do not need to measure the component propertes. U l U P mn ( A, U ) Pl ( A, U l ) P max ( A, U ) (8) In a case n whch a property s expressed as a statstcal value (such as a mean value), the property value n a partcular nterval can be changed n an unwanted drecton; Fg 3 llustrates an example n whch the mean value of the property P(U) n the nterval [U l-mn, U l-max ] s lower than n the entre nterval [U -mn, U -max ], although the mnmum value s hgher. For certan propertes (such as avalablty) n certan domans (for example multmeda) the average plays a more mportant role than mn or max values. e. System Envronment Context Propertes Defnton: A System Envronment Context property s a property whch s determned by other propertes and by the state of the system envronment.

10 P ( S, U U l S = System U,, E ) = f ( P ( c, U l, = System usage profle; E = Envronment context ), E ); = Component usage profle l,, l N (9) The property depends not only on the system property determned by the usage profle, but also the envronment n whch the system s used. An example of such a property s safety. As the safety property s related to the potental catastrophe, t s obvous that n dfferent crcumstances, the same property may have dfferent degrees of safety even for the same usage profle. We can argue that these propertes are out of the scope of the predctable assembly, but as such propertes are also dependent on component propertes, ths relaton s mportant. The analyss approach for such propertes s opposte to the composton; the system envronment and the system propertes defne the requrements for component propertes. A system can exhbt numerous propertes and certanly not all of them have the same characterstcs; some are easy to perceve and measure whle others are very dffcult to analyze, or measure (for nstance admnstrablty). Analyzable propertes, whch can be measured, are potental canddates for automatc reasonng about the behavor of a system. Propertes that depend on the envronment n whch a system s deployed are generally hard to derve from the component propertes. 3 Assembles and Systems We have used the generc term assembly for a set of ntegrated components. In the prevous secton t s shown that specfcaton of some propertes should dstngush between an assembly and a system. A system s n general much more than a set of components; a system s a set of software programs and ther nter-dependences deployed on computer hardware. A system s usually seen as a complete program or many programs and computers worng together to provde a functon and nteractng wth ts envronment. In several models the assembly s nterpreted by a runtme framewor that nstantates and executes the applcaton or system. Very seldom s an assembly of components an applcaton or a system of ts own, somethng that understands and can run ths assembly must be provded. Nevertheless, a software system may consst of a set of assembles, whch turns out to be a set of components. Several questons arse when composng assembles: Can the assembles composed be treated as components n the new assembly, or are they treated n the new assembly as a set of the orgnal components loosng the assembly dentty. An deal stuaton would be to have a means of usng a herarchcal and recursve model whch permts the same reasonng on all levels of the herarchy. In most of the exstng component-based technologes ths s not possble to acheve.

11 There are two nds of assembles supported by exstng component technologes. The frst s the 1st order assembly whch s not treated as a component n the component model. Ths type of assembly s merely a set of components ntegrated together, creatng an applcaton or a part of an applcaton. In ths case an assembly s seen as a vrtual boundary of the component set and not as a separate entty. The second type of assembly s herarchcal whch means that the assembly, created from components, s treated as a new component nsde the component model. There are dfferent crtera whch must be satsfed f an assembly s to be treated as a component. The basc crtera are the followng: Operatonal (constructon) nterface; Component deployment; Component qualty attrbutes. Operatonal Interface The operatonal nterface s the smplest part of the herarchcal composton. A component model should provde a means of constructng an nterface for the assembly from the ntegrated components. Several component technologes provde support for managng assembles. One example s port-based archtectures for components [11]. In such models components have specfed source and sn ports whch are attached to the ports of other components. It s easy to magne that the result of the composton of these components can be treated as a new component. Although t s mportant that the new nterface of the assembly must be specfed and mplemented n the same manner as those of the components themselves, the assembly s not otherwse defned n the same component model. Some component models provde support n creatng assembles on the archtecture defnton language (ADL) level. Other component models use composton languages that have composton and component notatons. The Koala component model [8], s one example that ncludes an ADL and programmng language whch descrbes the components and connectons between them. Koala however never creates the real assembles, source code components are used nstead and an applcaton/assembly s generated by the descrpton n ADL,.e. there are no bnary components as n, for nstance,.net technology. Another example s COM whch, by means of ts aggregate faclty, provdes support by bundlng several components nto a new one. Ths new component does not have a bnary representaton but from the users pont of vew t behaves as any other COM component. Component deployment To obtan ndependent deployment of components, the components must be pacaged ndependently and n a unform manner conformng to the component model. In the case of an assembly of ndependent components, t s not easy to pacage the complete assembly and to treat t as a component because there s no component type whch matches the assembly. Every component has a component type or unque dentfer specfed n a type repostory. For nstance, COM uses the wndows regstry to store the component dentfers and the defned nterface dentfers.

12 The component deployment and the component nstantaton are two separate actvtes; the component type s deployed and a component s subsequently nstantated from the type. Ths approach dffers from hardware components for whch the actual component s wred together wth other hardware components onto the board. The hardware components are deployed and nstantated at the same tme. Once nstalled, the software component can be nstantated many tmes. To nstantate an assembly means to nstantate components whch mght be already deployed. Ths fact maes t mpossble to treat assembles as ndependent unts of deployment. In the Koala component model, a new component, whch may nclude other components, can be specfed, so n that respect there are herarchcal assembles of components. When a complete system of components s desgned, Koala uses a compler whch, gven the descrpton of the assembly, produces the actual bnary output. Ths output s however not treated as a component n the model, as t s the fnal product. The model was desgned to produce applcatons, not to produce new bnary components. New components are added to the system n the form of source code, and component specfcatons. Component qualty attrbutes Wth respect to qualty attrbutes and herarchcal composton, t may be ased f t s possble to treat qualty attrbutes of assembles n the same way as qualty attrbutes of components. The queston s partally answered n the frst secton t depends on the type of the property. In many cases the property and the way to use t n composton reasonng wll be the same. The way to obtan the property value mght be dfferent. Theoretcally the property value of an assembly can be derved from the component propertes. In ths way a property of an assembly of assembles wll be a composton of assembly and component property functons. For example, the propertes of type (a) from the secton 2 wll be derved n the followng way: P( A ) = f ( P( A ) = f ( f ( P( c )));, N A P = property, A A a a = { A }; A = assembes, = { c } a = assembly of assembles c = components For the memory consumpton case n equaton (2), we have: (10) = 1 n M ( A ) = M ( A ) = M ( c ) (11) a = 1 j= 1 For emergng propertes, t s n general not possble to acheve recurson. The same s vald for component propertes whch are not relevant on the assembly level. We can conclude that the recursve compostons of components are very restrcted, whch s understandable from the defnton of a component. A component s defned as a unt of composton and treated as a blac box. Internal structure or nternal composton can completely dffer from the assembly or system structure and composton of components. j

13 4 Composablty of Qualty Attrbutes The lterature contans dfferent names for system (and component) propertes: nonfunctonal propertes, extra-functonal propertes, or qualty attrbutes. When dentfyng a partcular property of a system or of a component we use the term property, and when referrng to these propertes n general, we use the term qualty attrbute. Ths secton outlnes several dfferent qualty attrbutes and explans how they are classfed accordng to the fve types outlned n the frst secton. Qualty attrbutes can be complex and at a hgher level or they can be more tangble and concrete. Complex attrbutes are, for example, dependablty or performance whle tangble attrbutes could be, for example, memory footprnt, scalablty or avalablty. The complex attrbutes consst of several more tangble attrbutes, and as a consequence the complex attrbutes are harder to classfy n one category only. Apart from the fve categores presented n ths paper there are other means of classfcaton. For nstance, attrbutes can be placed n two classes, namely, whether they can be observed at run tme or not. Press et al show such a mappng of qualty attrbutes from the runtme observable perspectve [6]. To demonstrate that there are dfferent qualty attrbutes n the varous categores we have assembled a table (Table 1) showng the classfcaton of the attrbutes. The qualty attrbutes are manly taen from [4,6,14-16]. Accordng to [7] certan attrbutes grouped together consttute complex attrbutes. As these attrbutes are vaguely defned, and we have n some cases slghtly modfed them to acheve better consstency, n the table they are desgnated as concerns. Stll some nconsstences remaned: for example mantanablty s defned as a concern and as an attrbute. Such nconsstences are the result of havng dfferent requrements, prortes, development processes and focus when performng the categorzaton. The table shows the domnant type of composton and possbly another related composton type.. For each attrbute there s one domnant type of composton, mared wth an xx that has the greatest mpact on the partcular attrbute. Other related composton types, not as domnant, are mared n the table wth a sngle x. When dentfyng the most mportant types of compostons for each qualty attrbute we have ased the followng questons: 1. Is ths attrbute a property of a component or only of an assembly/system? A negatve answer ndcates that the property s derved from many dfferent component propertes or has system characterstcs. On the other hand, an affrmatve answer ndcates that the property mght be drectly composable. 2. If the attrbute s a property of a component, wll the same attrbute be present at the assembly of such components? If ths s true, are there some other propertes or factors that have (vsble) mpact on the attrbute of an assembly. If there are no such attrbutes then the property s drectly composable. 3. What s the most mportant mpact on ths attrbute on the assembly level? Ths clearly ndcates the type of composton.

14 Ths mples that a deployment of a component-based approach n a development process may mpact on many qualty attrbutes. 5 Composablty of dependablty attrbutes To llustrate the attrbute classfcaton, we tae dependablty as an example. Dependablty s defned as the ablty of a system to delver servce that can be trusted and the ablty of a system to avod falures that are more severe and frequent than are acceptable to the users. Dependablty s the man qualty attrbute when buldng safety-crtcal systems. (.e. those systems n whch falure can cause human casualtes). In most cases, safety-crtcal systems are hard real-tme systems (.e. systems n whch the tmng requrements must be met), and embedded systems (.e. a combnaton of software and hardware), whch mples a number of tmng and resource constrants. Such systems requre rgorous development procedures and software archtecture whch can mae them as predctable as possble. Dependablty s a complex attrbute consstng of sx man qualty attrbutes, namely, avalablty, relablty, safety, confdentalty, ntegrty and mantanablty. The questons of nterest to component-based software engneerng or development are: Whch of the dependablty propertes are emergng or derved system propertes, whch are both system and component propertes? How are these propertes n a component-based system related to component propertes? To whch extent (and how) can these propertes can be determned from component propertes? To whch extent can the uncertanty of the predctablty of these propertes be mnmzed and how much s t related to the uncertanty of the component propertes? The followng s a short analyss and classfcaton of the dependablty propertes. 5.1 Relablty The defnton of Relablty orgnates from the probablty that a system wll fal wthn a gven perod of tme. Relablty s nversely proportonal to ths probablty as mean tme to falure (MTTF) and t s defned for a specfed perod of tme under stated condtons. The probablty of falure s drectly dependent on the usage profle and context of the module under consderaton.

15 MTTF( A) = 1 ( ) A = module (component,assembly,module) P f P f A = probablty that module A fals per tme unt (12) The module can be a system, or an assembly or a component, so the relaton between the relablty of an assembly and a component can be expressed by (4) and, because of the fact that the relablty s measured under stated condtons, a usage profle must be specfed, whch s expressed by (6). The domnant type of mpact on relablty s the usage profle but relablty s also dependent on the software archtecture and how components are assembled; a fault-tolerant redundant archtecture mproves the relablty of the assembly of components. One possble approach to the calculaton of the relablty of an assembly s to use the followng elements [17,18]: Relablty of the components Informaton that has been obtaned by testng and analyss of the component gven a context and usage profle Path nformaton (usage paths) Informaton that ncludes usage profle and the assembly structure. Combned, t can gve a probablty of executon of each component, for example by usng Marov chans. It s noteworthy that even f the relablty of the components are nown t s very hard to now f sde effects tae place that wll affect an assembly of the components, e.g. f the components wrte n a memory space used by another component that causes a falure. A model based on these assumptons needs the means for calculatng or measurng component relablty and an archtecture whch permts analyss of the executon path. Component models that specfy provded and requred nterface, or mplement a port-based nterface mae t possble to develop a model for specfyng the usage paths. Ths s an example n whch the defnton of the component model facltates the procedure of dealng wth the qualty attrbute. One nown problem n the use of Marov chans n modelng usage s the rapd growth of the chan and complexty [17]. The problem can be solved because the relablty permts a herarchcal approach. The system relablty can be analyzed by (re)usng the relablty nformaton of the assembles and components (whch can be derved or measured) Avalablty Avalablty s defned as the probablty of a module beng avalable when needed. Formally, t s defned as the mean tme to falure dvded by the mean tme between falures (MTBF), whch n turn s the sum of the MTTF and the mean tme to repar (MTTR): Avalablty( A) = MTTF ( A) MTTF ( A) + MTTR( A) A = module (component, assembly,module) (13) From (13) we can see that avalablty s related to relablty. In the same way as relablty, avalablty can be obtaned by measurements through the usage profles. It

16 s however not the same property; For example a module can be consdered to have good avalablty f t has relatvely poor relablty but requres lttle tme to repar. Also, an assembly, or a component can be relable but not avalable, for example due to lac of resources (the component may need to wat for the resource to start). MTTR s related to a means to attan the dependablty,.e., t s related to fault tolerance, fault forecastng and fault removal. All these terms are not formally specfed and cannot be drectly measured. The dfference between relablty and avalablty s that avalablty s dependent on the dynamc state of the system the avalablty of an assembly cannot be derved from the avalablty of the components n the way that ts relablty can be derved from the relablty of ts components. Further, f avalablty s treated n a larger context, non run-tme propertes or qualty attrbutes must be taen nto a consderaton. Avalablty s related to the mantenance and support of the components consttutng the assembly. Factors such as these are very mportant n determnng f or not a component s to be selected for ncluson n a system. It s mportant to reduce the mean tme to repar by all means. 5.3 Safety Safety s a property nvolvng the nteracton of a system wth the envronment and the possble consequences of the system falure. It s a system property, nether a component nor an assembly property. Its safety depends on where and how the system s deployed. For example, a system controllng a robot could cause harm to a human beng f a fault leads to uncontrolled robot movement. Safety s ncreased by nstallng the robot n a cell whch cannot be entered durng operatons. Snce safety s a system property that s dependent on the system s envronment, a means for analyzng safety s a top-down approach, a decomposton rather than composton. In the analyss process, the components attrbutes are used as selecton crtera or are dentfed as demands that should be met. For ths reason a componentbased approach mght not have the apparent advantage on the contrary, f the startng dea s a reuse of exstng components, the components attrbutes cause new constrants and n ths way mght decrease the system safety. However, when the constrants are dentfed and unambguously related to the constrants on the system level, the system safety can ncrease. Also, some propertes, such as relablty, mght mprove the accuracy of the system safety predcton, especally f nown or measured when used n other applcatons. 5.4 Confdentalty and Integrty A system would not be dependable f unauthorzed access or, even worse, unauthorzed alteratons of the system data, was easy or even permtted. Hence securty aspects, confdentalty and ntegrty, defned as follows [15] apply to dependable systems. Confdentalty s defned as a measure of the absence of unauthorzed dsclosure of nformaton;

17 Integrty s defned as the absence of mproper system state alteratons. From the defntons t s apparent that these propertes are not drectly measurable, and ths s the man obstacle to the development of a theory for ther predcton. Integrty s a prerequste for avalablty, relablty and safety, but need not be so for confdentalty or mantanablty. Confdentalty and ntegrty are emergng system propertes that can be tested and analyzed on the system and archtectural level but not on the component level. Usage profles can be used for testng and analyss, but t s mpossble to automatcally derve these propertes from the component propertes. 5.5 Mantanablty Mantanablty s defned as the capacty to undergo repars and modfcatons. Mantenance s of three dfferent types, correctve, adaptve and perfectve mantenance [15]. Correctve mantenance s the removal of faults, thereby mprovng the relablty of components under the condton that no new faults are ntroduced. Adaptve mantenance s performed when a component s modfed to meet modfcatons n the target envronment. Perfectve or preventve mantenance addresses mprovements of the components n response to users or desgners nput. Mantanablty s related to the actvtes of people and not of the system tself. Component technologes mght provde support for dynamc upgradng/deployment of components whch can mprove the mantanablty of a system. In ths case the mantanablty s much a matter of component technology, and not of the component tself. The system archtecture thus has an mpact on mantenance. Component technologes certanly affect correctve and adaptve mantenance but not perfectve mantenance to the same degree. A component-based archtecture mght be easer to adapt to envronmental changes because of ts natural modularty. A more modular archtecture mght facltate, dependng on the relatonshps between the components, the removal of faults n correctve mantenance but for efforts to perfect the mplementaton, a component model s of lesser mportance. For nstance, a need to replace all macros n the code wth templates does not depend on the component model. As the classfcaton n table 1 ndcates, most mantanablty attrbutes are probably drectly composable or archtecture-related. There are many parameters that can be measured and then used to estmate the mantanablty of a code (for example McCabe Metrcs for complexty [19]). These parameters can be dentfed for each component. It s however not clear how these parameters can be defned on the assembly level. One possblty s to defne a mean value of all components normalzed per lnes of code. 6. Concluson A full advantage of component-based approach wll be acheved when not only the functonal parts are reused, but also when ths approach leads to easer and more

18 accurate predctablty of the system behavor. When systems are desgned and buld from components, many system attrbutes can be derved from the component propertes, ths beng more accurate f a support for defnng and measurements of the attrbutes are bult n the component technologes. However, a predctablty of attrbutes does not depend only of component models but also on the attrbutes themselves. For each property, a theory of the property, ts relaton to component model, composton rules and an overall context related to the requrements must be nown. The qualty attrbutes can be classfed wth respect to types of composton, n whch each type s characterzed by the requred nput for obtanng predctablty on the system level. Some types show clear composable characterstcs, whle others are not drectly related to compostons. The exstng component models dffer consderably and how the assembles and components attrbutes are treated wll be hghly dependent on these models, especally for those propertes that are drectly composable or are related to the archtecture. For example, f the component model has ndependently deployable components wth a 1st order assembly model, t s lely that the propertes of the components cannot be propagated further than the assembly level wthout consderng the envronment. In spte of dversty of propertes, technologes, and theores, t should be possble to create reference framewors that by dentfyng type of composablty of attrbutes can help n estmaton of accuracy and efforts requred for buldng component-based systems n a predctable way. References [1] Crnovc I., Schmdt H., Stafford J., and Wallnau K. C., "5th Worshop on Component-Based Software Engneerng: Benchmars for Predctable Assembly", In Software Engneerng Notes, volume 27, ssue 5, [2] Moreno G. A., Hssam S. A., and Wallnau K. C., "Statstcal Models for Emprcal Component Propertes and Assembly-Level Property Predctons: Toward Standard Labelng", In Proceedngs of 5th Worshop on component based software engneerng, [3] Stafford J. and mcgregor J., "Issues n Predctng the Relablty of Composed Components", In Proceedngs of 5th worshop on component based software engneerng, [4] Svahnberg M., Supportng Software Archtecture Evoluton, Ph.D. Thess, Blenge Insttute of Technology, Sweden, [5] Dromey G.R., "A Model for Software Product Qualty", In IEEE Transacton on Software Engneerng, volume 21, ssue 2, 1995.

19 [6] Press O., Wegmann A., and Wong J., "On Qualty Attrbute Based Software Engneerng", In Proceedngs of EUROMICRO 2001 CBSE worshop, [7] ISO/IEC, Informaton technology - Software product qualty - Part 1: Qualty model, report ISO/IEC FDIS :2000 (E), ISO, [8] van Ommerng R., "The Koala Component Model", n Crnovc I. and Larsson M. (edtors): Buldng Relable Component-Based Software Systems, ISBN , Artech House, [9] Yan L., Gorton I., Lu A., and Chen S., "Evaluatng the scalablty of enterprse javabeans technology", In Proceedngs of 9th Asa-Pacfc Software Engneerng Conference, IEEE, [10] Jogalear P. and Woodsde M., "Evaluatng the Scalablty of Dstrbuted Systems", In IEEE Transactons on Parallel & Dstrbuted Systems, volume 11, ssue 6, [11] Crnovc I. and Larsson M., Buldng Relable Component-Based Software Systems, ISBN , Artech House, [12] Hssam S. A., Huda J., Ivers J., Klen M., Larsson M., Moreno G. A., Northrop L., Plaosh D., Stafford J., Wallnau K. C., and Wood W., Predctable Assembly of Substaton Automaton Systems: An Experence Report, report CMU/SEI-2002-TR-031, Software Engneerng Insttute, Carnege Mellon Unversty, [13] Wall A., Larsson M., and Norström C., "Towards an Impact Analyss for Component Based Real-Tme Product Lne Archtectures", In Proceedngs of Euromcro Conference on Component Based Software Engneerng, [14] Bass L., Clements P., and Kazman R., Software Archtecture n Practce (2nd edton), ISBN , Addson-Wesley, [15] Avžens A., Lapre J.-C., and Randell B., "Fundamental Concepts of Computer System Dependablty", In Proceedngs of IARP/IEEE-RAS Worshop on Robot Dependablty: Technologcal Challenge of Dependable, Robots n Human Envronments, [16] Kazman R., Bass L., Abowd G., and Webb M., "SAAM: A Method for Analyzng the Propertes of Software Archtectures", In Proceedngs of The 16th Internatonal Conference on Software Engneerng, [17] Schmdt H. and Reussner R. H., " Parametrzed Comtracts and Adapter Synthess", In Proceedngs of 5th ICSE worshop on CBSE, 2001.

20 [18] Schmdt H., "Trustworthy components: compostonalty and predcton", In Journal of Systems & Software, volume 65, ssue 3, [19] McCabe T.J., A Complexty Measure, IEEE Transacton on Software Engneerng, volume 2, 1976.

Petri Net Based Software Dependability Engineering

Petri Net Based Software Dependability Engineering Proc. RELECTRONIC 95, Budapest, pp. 181-186; October 1995 Petr Net Based Software Dependablty Engneerng Monka Hener Brandenburg Unversty of Technology Cottbus Computer Scence Insttute Postbox 101344 D-03013

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

A Resources Virtualization Approach Supporting Uniform Access to Heterogeneous Grid Resources 1

A Resources Virtualization Approach Supporting Uniform Access to Heterogeneous Grid Resources 1 A Resources Vrtualzaton Approach Supportng Unform Access to Heterogeneous Grd Resources 1 Cunhao Fang 1, Yaoxue Zhang 2, Song Cao 3 1 Tsnghua Natonal Labatory of Inforamaton Scence and Technology 2 Department

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Review of approximation techniques

Review of approximation techniques CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

Model Integrated Computing: A Framework for Creating Domain Specific Design Environments

Model Integrated Computing: A Framework for Creating Domain Specific Design Environments Model Integrated Computng: A Framework for Creatng Doman Specfc Desgn Envronments James R. DAVIS Vanderblt Unversty, Insttute for Software Integrated Systems Nashvlle, TN 37203, USA ABSTRACT Model Integrated

More information

Maintaining temporal validity of real-time data on non-continuously executing resources

Maintaining temporal validity of real-time data on non-continuously executing resources Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Ontology Generator from Relational Database Based on Jena

Ontology Generator from Relational Database Based on Jena Computer and Informaton Scence Vol. 3, No. 2; May 2010 Ontology Generator from Relatonal Database Based on Jena Shufeng Zhou (Correspondng author) College of Mathematcs Scence, Laocheng Unversty No.34

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

Verification by testing

Verification by testing Real-Tme Systems Specfcaton Implementaton System models Executon-tme analyss Verfcaton Verfcaton by testng Dad? How do they know how much weght a brdge can handle? They drve bgger and bgger trucks over

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

an assocated logc allows the proof of safety and lveness propertes. The Unty model nvolves on the one hand a programmng language and, on the other han

an assocated logc allows the proof of safety and lveness propertes. The Unty model nvolves on the one hand a programmng language and, on the other han UNITY as a Tool for Desgn and Valdaton of a Data Replcaton System Phlppe Quennec Gerard Padou CENA IRIT-ENSEEIHT y Nnth Internatonal Conference on Systems Engneerng Unversty of Nevada, Las Vegas { 14-16

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Specifying Database Updates Using A Subschema

Specifying Database Updates Using A Subschema Specfyng Database Updates Usng A Subschema Sona Rstć, Pavle Mogn 2, Ivan Luovć 3 Busness College, V. Perća 4, 2000 Nov Sad, Yugoslava sdrstc@uns.ns.ac.yu 2 Vctora Unversty of Wellngton, School of Mathematcal

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Real-Time Systems. Real-Time Systems. Verification by testing. Verification by testing

Real-Time Systems. Real-Time Systems. Verification by testing. Verification by testing EDA222/DIT161 Real-Tme Systems, Chalmers/GU, 2014/2015 Lecture #8 Real-Tme Systems Real-Tme Systems Lecture #8 Specfcaton Professor Jan Jonsson Implementaton System models Executon-tme analyss Department

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

CONCURRENT OPTIMIZATION OF MULTI RESPONCE QUALITY CHARACTERISTICS BASED ON TAGUCHI METHOD. Ümit Terzi*, Kasım Baynal

CONCURRENT OPTIMIZATION OF MULTI RESPONCE QUALITY CHARACTERISTICS BASED ON TAGUCHI METHOD. Ümit Terzi*, Kasım Baynal CONCURRENT OPTIMIZATION OF MUTI RESPONCE QUAITY CHARACTERISTICS BASED ON TAGUCHI METHOD Ümt Terz*, Kasım Baynal *Department of Industral Engneerng, Unversty of Kocael, Vnsan Campus, Kocael, Turkey +90

More information

A Background Subtraction for a Vision-based User Interface *

A Background Subtraction for a Vision-based User Interface * A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton

More information

3. CR parameters and Multi-Objective Fitness Function

3. CR parameters and Multi-Objective Fitness Function 3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft

More information

Evaluation of Parallel Processing Systems through Queuing Model

Evaluation of Parallel Processing Systems through Queuing Model ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT 3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ

More information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.

More information

Advanced Computer Networks

Advanced Computer Networks Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans

More information

ACM SIGSOFT Software Engineering Notes Page 1 May 2006 Volume 31 Number 3

ACM SIGSOFT Software Engineering Notes Page 1 May 2006 Volume 31 Number 3 ACM SIGSOFT Software Engneerng Notes Page 1 May 2006 Volume 31 Number 3 Abstract STCIM: A Dynamc Granularty Orented and Stablty Based Component Identfcaton Method Zhong-Je Wang, De-Chen Zhan, Xao-Fe Xu

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Composition of UML Described Refactoring Rules *

Composition of UML Described Refactoring Rules * Composton of UML Descrbed Refactorng Rules * Slavsa Markovc Swss Federal Insttute of Technology Department of Computer Scence Software Engneerng Laboratory 05 Lausanne-EPFL Swtzerland e-mal: Slavsa.Markovc@epfl.ch

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Lecture 4: Principal components

Lecture 4: Principal components /3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness

More information

Design and Implementation of an Energy Efficient Multimedia Playback System

Design and Implementation of an Energy Efficient Multimedia Playback System Desgn and Implementaton of an Energy Effcent Multmeda Playback System Zhjan Lu, John Lach, Mrcea Stan, Kevn Skadron, Departments of Electrcal and Computer Engneerng and Computer Scence, Unversty of Vrgna

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Using the Multiple-Clue approach for system testing on AIRBUS FAL (Final Assembly Line)

Using the Multiple-Clue approach for system testing on AIRBUS FAL (Final Assembly Line) Usng the Multple-Clue approach for system testng on AIRBUS FAL (Fnal Assembly Lne) Fassely Doumba, Odle Laurent, Dder Atger AIRBUS France 316 route de Bayonne 31060 Toulouse Cedex 09 {Frstname.Name}@arbus.com

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , 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 information

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

Assembler. Building a Modern Computer From First Principles.

Assembler. Building a Modern Computer From First Principles. Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought

More information

Professional competences training path for an e-commerce major, based on the ISM method

Professional competences training path for an e-commerce major, based on the ISM method World Transactons on Engneerng and Technology Educaton Vol.14, No.4, 2016 2016 WIETE Professonal competences tranng path for an e-commerce maor, based on the ISM method Ru Wang, Pn Peng, L-gang Lu & Lng

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST

MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN, ICED 07 28-31 AUGUST 2007, CITE DES SCIENCES ET DE L'INDUSTRIE, PARIS, FRANCE MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAIMIZE PRODUCT VARIETY AND

More information

Hybrid Non-Blind Color Image Watermarking

Hybrid Non-Blind Color Image Watermarking Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,

More information

MODELING THE CONDITION OF BUILDINGS BY REAL FUZZY SETS

MODELING THE CONDITION OF BUILDINGS BY REAL FUZZY SETS Int. Journal for Housng Scence, Vol.38, No.1 pp.13-23, 2014 Publshed n the Unted States MODELING THE CONDITION OF BUILDINGS BY REAL FUZZY SETS Ádám BUKOVICS Szécheny István Unversty Department of Structural

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Notes on Organizing Java Code: Packages, Visibility, and Scope

Notes on Organizing Java Code: Packages, Visibility, and Scope Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

Real-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems

Real-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems Real-tme Fault-tolerant Schedulng Algorthm for Dstrbuted Computng Systems Yun Lng, Y Ouyang College of Computer Scence and Informaton Engneerng Zheang Gongshang Unversty Postal code: 310018 P.R.CHINA {ylng,

More information

(1) The control processes are too complex to analyze by conventional quantitative techniques.

(1) The control processes are too complex to analyze by conventional quantitative techniques. Chapter 0 Fuzzy Control and Fuzzy Expert Systems The fuzzy logc controller (FLC) s ntroduced n ths chapter. After ntroducng the archtecture of the FLC, we study ts components step by step and suggest a

More information

Multigranular Simulation of Heterogeneous Embedded Systems

Multigranular Simulation of Heterogeneous Embedded Systems Multgranular Smulaton of Heterogeneous Embedded Systems Adtya Agrawal Insttute for Software Integrated Systems Vanderblt Unversty Nashvlle, TN - 37235 1 615 343 7567 adtya.agrawal@vanderblt.edu Akos Ledecz

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Backpropagation: In Search of Performance Parameters

Backpropagation: In Search of Performance Parameters Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information