A Formal Hybrid Analysis Technique for Composite Web Services Verification

Size: px
Start display at page:

Download "A Formal Hybrid Analysis Technique for Composite Web Services Verification"

Transcription

1 A Formal Hybrid Analysis Tehnique for Composite Web Servies Verifiation MAY HAIDAR 1,2, HICHAM H. HALLAL 1 1 Computer Siene Department / Department of Eletrial Engineering Fahad Bin Sultan University P.O Box Tabuk, SAUDI ARABIA 2 Département d informatique et de la reherhe operationnelle Université de Montréal Pavillon André-Aisenstadt, CP 6128 su Centre-Ville, Montréal QC, H3C 3J7 CANADA {mhaidar,hhallal}@fbsu.edu.sa Abstrat: - In this work, we propose to develop an integrated formal framework where both stati and dynami analysis tehniques omplement eah other in enhaning the verifiation proess of an existing web servies based appliation. The proposed framework onsists of three omponents. A Library of Property Patterns, whih we intend to build on existing work and ompile a library and a lassifiation of web servies properties (patterns and antipatterns). These would inlude BPEL4WS and WISCI requirements in the form of property patterns whih an be instantiated in different ontexts and for different purposes like verifying orretness, seurity, and performane related issues. The property library will be based on an easy to use template that depits mainly the type, formal model, and example of a property. The seond omponent is the development of Stati Analysis Tehniques that inlude diret ode inspetion, abstration based tehniques, and model based tehniques. The third omponent is the development of dynami analysis tehniques that inlude extrating behavioral models of appliations from observed exeutions and verifying them (mainly using model heking) against behavioral properties. These properties speify defets that annot be deteted using stati analysis tehniques. We elaborate in this paper the formal approah used to extrat an automata based model of a web servie omposition from exeution traes that are observed and olleted using a monitoring tool. We also outline the omponents of a prototype to realize the proposed approahes for stati analysis, modeling, and dynami verifiation of the appliations under test. In this paper we present the initial implementation of the dynami approah. Key-Words: - Stati Analysis, Dynami Analysis, Property Patterns, Web Servies, Model Cheking, Automata Models 1 Introdution Businesses are inreasingly adopting servie orientation to shape the arhiteture of their enterprise solutions and to inrease the effiieny of their software appliations. At the foundation of this ever more popular paradigm, web servies are heavily used to enhane deentralization and ross platform and language portability. The power of servies resides mainly in the high degree of dynamism and flexibility they exhibit throughout their lifeyle: publiation, disovery, and binding are all dynami ativities that make a servie an evolving entity apable of adapting to ontinuously hanging and new requirements. In addition, ompositions of servies, whih an also be dynami, have added to the power of servies in building larger enterprise solutions for heterogeneous businesses. However, the fast paed growth of servie implementation and deployment in various ontexts has resulted in a growing gap between the development and verifiation of servie based appliations. On one hand, stati analysis tehniques [1, 13] remain insuffiient to detet behavioral flaws and defets that are exhibited only when servies, espeially omposite ones, are exeuted. In partiular, suh tehniques fae two major problems: diffiulty of generating exeutable ISSN: Volume 2, 2017

2 models that an be used in the analysis, and limited overage of defets that are exhibited only during runtime, e.g., onurreny inurred problems. On the other hand, dynami and runtime tehniques, whih depend mainly on monitoring, an only laim to detet errors and flaws in the observable behavior of a servie, or a dynami omposition of servies. Currently, formal methods have gained momentum as a reliable solution to automate the analysis of various systems. In partiular, software development ommunities are inreasingly adopting formal tehniques to perform different development ativities suh as requirement definition and eluidation, modeling and model transformation, testing, and property verifiation [14,17]. For example, model heking has been used to verify various properties on models of systems. Model heking an be fully automati and produe ounterexamples that point to the violations when a model does not satisfy a given property. Yet, as is the ase for most formal analysis methods, adoption of model heking tools remains relatively limited due mainly to problems like the lak of formal models, the inherent state spae explosion problem, and the lak of proper justifiation for its use espeially for lasses of properties whose verifiation does not explore onurrent behavior of the models Error! Referene soure not found.error! Referene soure not found.. Yet, for many distributed appliations and properties, espeially those speified in terms of events issued by onurrent proesses, the need for model heking beomes lear and outweighs the doubts ast over its use. Formal verifiation tehniques are urrently used in several domains inluding ommuniation systems, software and program analysis [13], and web based appliations [2, 14]. In the ase of omposite Web Servies, the reasoning about the use of model heking is similar. While analyzing simple web servies does not neessarily require the use of model heking tehniques, the use of model heking in the analysis of web servies featuring underlying dynamially omposite servies is learly needed and justified. The latter is speifially true for servies whose omposition is speified through WS-BPEL [20] (Web Servies Business Proess Exeution Language) and WSCI [21] (Web Servies Choreography Interfae). As to the lak of models, espeially in the ase of inaessible ode, analysis in general has been applied to the traes an appliation/system produes when it is used. For this, predefined properties are used to analyze the appliation under test using model heking, when needed, or less omplex tehniques like searh based methods or even manual inspetion. In this paper, we propose to develop an integrated formal framework where both stati and dynami analysis tehniques omplement eah other in enhaning the property testing proess of an existing web servies based appliation. 2 Formal Framework We develop an integrated formal framework as illustrated in Figure 1, where both stati and dynami analysis tehniques omplement eah other in enhaning the verifiation proess of an existing web servies based appliation. The proposed framework onsists of the following main omponents. Library of Formal Speifiations Quality Requirements Library of Patterns / Antipatterns Web Servies Code Formal Speifiations Exeution Traes Automated Formal Models Extration Communiating Automata Based Model Model Cheking Figure 1. Formal Framework for Web Servie Composition Analysis 2.1 Library of Property Patterns Patterns have long been used in the development of software appliations, and servie oriented arhitetures as well, sine they introdue lever and insightful ways to solve ommon problems. Along with patterns, whih are intended to failitate the design and development proesses, the term antipattern is defined. An antipattern is simply a solution to a problem that does not work as intended (in terms of orretness and/or effiieny). Tool Stati and Dynami Modeling Formal Verifiation Property Results: 1. Satisfied 2. Counter Example ISSN: Volume 2, 2017

3 Following the definition, efforts exist to doument antipatterns in atalogs (similar to design patterns) so that they an be avoided. In the proposed framework, we intend to build on existing work [7,8,13,16,17] and ompile a library and a lassifiation of web servies properties (patterns and antipatterns). The lassifiation of properties will be hierarhial: stati/dynami, orretness/funtional, style/performane, et. Suh lassifiation should help developers identify the antipatterns to better avoid them, and testers detet them in the appliation using the appropriate tehniques. On the other hand, doumented properties, whih would inlude BPEL4WS and WISCI requirements in the form of property patterns, an be instantiated in different ontexts and for different purposes like verifying orretness, seurity, and performane related issues. The property library will be based on an easy to use template that depits mainly the type, formal model, and example of a property. For example, in our previous work [16,17], we have defined a pattern template and identified 119 patterns and property speifiation for the verifiation of Web appliations (WAs). Figure 2 shows an example of suh patterns. Eah pattern is speified in Linear Temporal Logi (LTL), whih makes it diretly usable in many model hekers. ID Pattern desription Category Page Attributes LTL Mapping Comments Soure FGS6 Banking information is entered no more than one before submitting form Funtional General Seurity and Authentiation Banking_info: Boolean identifying the presene of fields for banking information Submit: identifiation of page where form submit ation exists PreedeneGlobally (( ( banking_info) W (banking_info W (G (banking_info)))), submit) Newly introdued Figure 2. Example of Web Appliations Speifiation Patterns 2.2 Stati Analysis Approah In general, stati analysis tehniques for software, mainly targeting (ompiled) ode and/or existing speifiations or textual desriptions, are independent of speifi input data sets or individual exeution paths. They are usually lassified into: 1. Diret ode inspetion, where suspiious ode segments are diretly identified in the ode (through linear sanning for example). 2. Abstration based tehniques, where ode representations (lass diagrams, all graphs, et.) are used to math the exhibition of ertain predefined patterns (or antipatterns). In the ase of web servies based appliations; stati analysis tehniques would be applied to the available douments ontaining the desriptions of individual and omposite servies. In doing this, we follow in the steps of the work in [13]; the main deviation being the ustomization of the antipattern library developed to handle mutlithreaded Java appliations to the ontext of web servies and web servies ompositions. In addition, the library will be extended to over patterns/antipatterns like the one shown in Figure 2. However, some omplex faults annot be deteted with stati analysis approahes or only at a high ost (like deadloks). Moreover, stati analysis tehniques are prone to produing signifiant numbers of false warnings (mainly false positives) while not being able to detet some behavioral errors like in the ase of exeption handling. This justifies the need for the third omponent, a set of dynami analysis tehniques. 2.3 Dynami Analysis Approah Dynami Analysis tehniques have emerged as omplementary to stati analysis tehniques, espeially when onurreny and large arhitetural strutures of appliations make the latter ineffiient and rather inomplete. Dynami analysis tehniques do not neessarily rely on existing speifiations or textual desriptions of the appliations under test. Instead, they are applied to exeutable behavioral models that are derived from the appliation s observed exeutions (traes or logfiles). Suh approah to analysis is partiularly effiient in the ase of web servies based appliations; often haraterized by their readiness to ompose web servies, espeially dynamially. The ommuniation between web servies normally uses Internet protools, suh as HTTP, SMTP, and ISSN: Volume 2, 2017

4 FTP. However, all messages an be strutured aording to SOAP (Simple Objet Aess Protool) whih is a protool speifiation for exhanging strutured information in the implementation of web servies. Although many standards have been introdued to address the problem of web servie omposition, inluding BPEL4WS (Business Proess Exeution Language for Web Servies) and WSCI (Web Servie Choreography Interfae), they address mainly the desription and exeution of workflow speifiations for web servie ompositions. Yet, they are not suffiient to support automated verifiation tehniques based on stati analysis. The proposed tehniques inlude extrating behavioral models of appliations from observed exeutions and verifying them (mainly using model heking) against behavioral properties speifying defets that annot be deteted using stati analysis tehniques. The known tehniques in the field inlude: 1. Offline (postmortem) tehniques, where reorded exeutions of an appliation are stored and later used in modeling and verifying the appliation under test. 2. Online (runtime) tehniques, where an appliation under test is analyzed as the exeutions are generated. In our previous work [14,16], we designed a framework for formal modeling and verifiation of web appliations WAs using the model heker Spin. We interepted HTTP requests/responses that depit the behavior of web appliations and extrated ommuniating automata models translated into Promela (the modeling language of Spin). The properties verified inluded properties of onurrent behavior of WAs featuring multiple displays (windows/frames). We use a similar approah for model extrations from behavioral exeutions of omposite Web servies. The major differene is the availability of multiple traes reording the behavior of different servies in the omposition. The olleted traes from all servies are analyzed and abstrated as ommuniating automata models depiting the behavior of the respetive servies. Eah automaton (inferred from a single trae) depits the behavior of one servie where requests are modeled as events and responses as states. Events will be distinguished as loal and ommon. Common events represent ommuniations among the servies in a omposition. It is important to note that while the dynami approah in this paper relies on model heking, models are derived from the observed behavior of the appliation. Thus, the approah ould be seen as passive testing. Sine results of verifiation ould be ompromised when a WSUT does not meet the assumptions desribed previously, this approah does not eliminate the need for traditional testing and should be onsidered as a omplimentary ativity rather than an alternative. For instane, the approah ould be enhaned by additional testing of the appliation with model heking ounterexamples, in order to verify whether properties are indeed violated. Also, behavioral models derived by this approah enable model based test generation Error! Referene soure not found.error! Referene soure not found.. In this paper, we propose a model heking based approah to the verifiation of web servies omposition whose soure ode is inaessible against user defined properties. The model of the appliation under test is obtained from traes of the web servies exeution while properties of interest relate to both the business logi and ergonomis of the web servies. More speifially, the proposed approah breaks down into the following main steps: 1. Modeling the Web servies omposition in a language aeptable by a hosen model heker. We use Spin Error! Referene soure not found., the open soure model heker that is used in many researh and industrial projets. As desribed earlier, we use the exeution traes of the web servies omposition reorded using a relevant monitoring tool, e.g., a proxy server that is apable of interepting HTTP and SOAP ommuniations. The traes are then onverted into a ommuniating automata model representing the behavior of all the omponents of the web servies based appliation. 2. Speifying properties of interest. These properties an represent both desired and undesired behaviors of the web servies. Properties will be mainly user defined and expressed in the property speifiation language of Spin, LTL. 3. Cheking the obtained model against the given properties. To do so, Spin omputes the omposition of all the omponent automata in the derived model and builds a graph ontaining the global states of the appliation. The graph is then inspeted against the language of a property for ontainment. ISSN: Volume 2, 2017

5 3 Automated Model Extration of Web Servies The purpose of building a formal model for a web servie under test (WSUT) is to verify whether the servie omposition exhibits ertain predefined properties using model heking tehniques. It is assumed in this paper that the properties speified in a temporal logi of a hosen model heker are omposed of atomi propositions and for eah SOAP/HTTP servie request, the value of eah proposition is uniquely determined by the ontent of the servie response. These propositions refer to attributes that are user defined and have to be heked (and of ourse refleted in a model). Attributes an be of various types, for instane: a numerial type to ount the ourrenes of a ertain element, a string type to denote the domain name of a response. To build a formal model of a web servie omposition whose soure ode is aessible, one may use abstration tehniques developed in software reverse engineering following a the stati, white box approah Error! Referene soure not found.error! Referene soure not found. as desribed in the previous setion. However, the soure ode is not always available, or aess to the ode ould breah opyrights or trade serets (espeially when verifiation is performed by a third party). Moreover, a web servie omposition an be written using different languages and even different paradigms whih makes stati analysis diffiult to perform. When the ode is not available for modeling, one an build a formal model following a dynami, blak-box based approah, by exeuting the appliation and using only the observations of an external behavior of the servie omposition Error! Referene soure not found. over a ertain period of time. Verifiation of suh models (resulting from finite trae of an appliation) is alled run-time verifiation Error! Referene soure not found.error! Referene soure not found.. In ase of web servies that rely on the SOAP or HTTP protool onsidered in this work, an observable behavior onsists of requests and responses, assuming that the flow of requests and responses between a lient side and a server in the WSUT is observable. One possible way of ahieving this is to use a proxy server Error! Referene soure not found.. A proxy server monitors the traffi between the lient and the server and reords it in proxy logs. The proxy logs, i.e., traes, ontain the requests for omposing servies and the responses to these requests. In the next setion, we present our approah to derive automata based models from traes of web servies. 3.1 Modeling Approah Figure 3 shows the workflow of the proposed approah. The main omponents are: A Monitoring module. It interepts SOAP/HTTP requests and responses during the navigation of the WSUT performed by the user/rawler. An analysis module. It takes the interepted traes as input and generates an automata model in XML/Promela. This module is realized as a prototype tool whih is desribed in Setion 4. A model heking module, in this ase Spin. It verifies user defined properties against the generated model and produes a ounterexample for eah violated property. Properties to Chek SOAP/HTTP Requests /Responses Graphial User Interfae Formal Speifiations SPIN Model Cheker Monitor / Intereptor SOAP/HTTP Reader Servie Analyzer & Modeler System in XML/PROMELA XML/Promela Generator Property Results: 1. Satisfied 2. Violated Figure 3. Workflow of the approah Communiating Automata Model With this approah, a behavior of a WSUT, alled an exeution session, aka Request/Response Sequene (RRS), is interpreted as a possible sequene of web servies responses intermittent with the orresponding requests. Usually, many of these requests are triggered by the user s ations (liking links, submitting forms), while others an be triggered by the servie itself. 3.2 Exeution Session as Communiating Automata Here, the method for modeling an observed exeution session by a system of ommuniating automata is desribed in general. Further development of the detailed model will be attempted in the future. Given the exeution session, first loal a s 0 f 1 f s 2 1 s 2 2 u 0 u 1 u 2 b f 1 v 0 v 1 f 2 ISSN: Volume 2, 2017

6 exeution sessions that orrespond to the behaviors of the omposition web servies of the WSUT are determined, eah of whih is modeled by an automaton. Automata ommuniate synhronously by rendezvous, exeuting ommon (rendezvous) ations. Suh ommuniation is formalized by the parallel omposition operator on automata. Formally, two ommuniating automata A 1 = < S 1, s 01, 1, T 1 > and A 2 = < S 2, s 02, 2, T 2 > are omposed using the operator. The resulting automaton, denoted A 1 A 2, is a tuple < S, s 0,, T >, where s 0 = (s 01, s 02 ) and s 0 S; = 1 2 ; and S S 1 S 2 and T are the smallest sets whih satisfy the following rules: If (s 1, e, s' 1 ) T 1, e 2, and (s 1, s 2 ) S, then (s' 1, s 2 ) S, and ((s 1, s 2 ), e, (s' 1, s 2 )) T. If (s 2, e, s' 2 ) T 2, e 1, and (s 1, s 2 ) S, then (s 1, s' 2 ) S, and ((s 1, s 2 ), e, (s 1, s' 2 )) T. If (s 1, e, s' 1 ) T 1, (s 2, e, s' 2 ) T 2, and (s 1, s 2 ) S, then (s' 1, s' 2 ) S, and ((s 1, s 2 ), e, (s' 1, s' 2 )) T. The omposition is assoiative and an be applied to finitely many automata. Loal Exeution Sessions. An exeution session represents the behavior of ommuniating servies denoted o 1, o 2,, o k, where o 1 orresponds to the main omposing servie and k is the number of ommuniating servies. Given an exeution session, the number of ommuniating entities k and their relationship are determined and a proedure is used to partition the browsing session into loal exeution session, denoted (RRS 1,, RRS k ). 4 Implementation of the Approah The implementation of the proposed framework inludes the following main tasks: 1. Surveying the literature and ommon praties of various developers of web servies based appliations to ompile a set of most frequently enountered properties (patterns and antipatterns). 2. Formulation of properties in speifiation languages that an be used in both stati and dynami analysis tehniques. 3. Identifying proper stati analysis tehniques for eah lass of properties and evaluating their effiieny and robustness. In partiular, this task inludes identifying the proper abstrations, along with methods to extrat them, to be used in deteting orresponding antipatterns in the ode. 4. Reord exeution traes from the appliations under test. This task inludes studying the instrumentation based and intereption based tehniques. 5. Extrating models from monitored exeutions. This inludes extrating models from ompleted traes and inremental models in the ase of runtime analysis that an be used in known model heking tools. 6. Integrating the ompiled library and developed tools in a user friendly toolset whih masks the details of the underlying analysis tehniques form the users and makes the dissemination of the produed framework easier. The proposed framework is implemented using Spin model heker [18]. The automata models are represented using Promela language and the patterns/antipatterns are represented in LTL. We use the Java Elipse environment for the toolset implementation. The omplete toolset will inlude integrated omponents as follows: a. A library of ompiled patterns/antipatterns translated in LTL. b. Exeution intereption and monitoring: the tool interepts requests and responses of a web servies omposition using an open soure proxy 1. The monitoring module an operate in two modes: online and offline mode. In online mode, the monitor interepts the exeutions and feeds them to the analysis module. In the offline mode, the monitor registers an exeution trae in a log file.. Property based attribute seletion: through the graphial user interfae of the tool, a number of predefined attributes that haraterize web servies are provided. The user seleted attributes are evaluated in eah web servie and are refleted in the automata model. d. Analyzing exeution traes and model generation: the tool parses and analyzes the exeution traes and evaluates the user defined attributes in eah visited page. An internal data struture of the automata model of the web servies omposition is built. The model an be generated either in Promela language or XML- Promela. 1 SOLEX, Web Appliation Testing with Elipse. ISSN: Volume 2, 2017

7 e. Automata model visualization and statistial data: the tool has a model visualization feature. The built model of a web servies omposition an be visualized in two different graphial modes as well as one textual model. In the graphial mode, whih is based on existing Java graph libraries, both single automaton, and ommuniating automata models are visualized, whih an be manipulated by the user. For instane, the user an zoom in/out, pik displayed states and drag them, visualize the ontent of eah state, and optionally show/hide transition labels. Also, the tool provides numerial data about the model, namely the number of proesses (automata), total number of states, total number of transitions. Figure 4 illustrates our initial toolset prototype for the dynami modeling of Web servies. Figure 4. Prototype Tool for Web Servies Monitoring and Modelling 5 Related Work Run time verifiation of software appliations has grown as a major field overing major ativities related to the development of software. At the same time, webbed, and web servie-based, appliations have gained a lot of attention in many researh ativities both in aademia and in the industry given the role suh appliations have in the shaping of today s eonomy based on e-ommere and e- servies. Our related work that is losely onneted to this new proposed work is published in [8,14,16,18]. We have implemented an integrated formal framework for run-time verifiation of web appliations. Results were interesting and we were able to verify properties that ould not be verified using other approahes. Reently, a large body of researh has been produed with a fous on formal modeling of web servies based appliations in order to indue automation in the analysis of the developed appliations against some predefined properties speified from the desription and requirements texts. Derived models are often generated from textual desriptions of appliations (BPEL, BPEL4WS, and WSCI), and an be used mainly to hek stati properties that relate to the struture and ontent of the appliation, usually desribed as a omposition of servies. Examples of suh researh inlude the work of Foster et al. [1,2], whih models BPEL desriptions as Finite State Proess models, whih an be verified against properties that are mainly derived from design speifiations written in UML notations like the Message Sequene Chart (MSC) or ativity diagrams. Properties sought for verifiation inlude mostly semanti failures and diffiulties in providing neessary ompensation handling sequenes that are tough to detet diretly in ommon workflow languages like BPEL. Other attempts have been desribed in the literature as well inluding the work of Breugel and Koshkina [3, 4] who introdue the BPE-alulus to apture ontrol flow in BPEL desriptions and programs. The servie desriptions in the proposed language allow for heking against properties like dead path elimination and ontrol yles. The verifiation, mainly formal model heking, is performed in the toolset Conurreny Workbenh (CWB). However, as disussed in Setion 1, proposed verifiation approahes based mainly on the stati analysis of an existing soure ode, where different types of models like EFA, Promela, and ommuniating FSMs [11, 12] are used, have their limitations and impratialities. Consequently, more efforts are being spent on performing run-time verifiation of web servie appliations based on monitoring and model extration. Also, [5] address the run-time monitoring of funtional harateristis of omposed Web servies, as well as for individual servies [6]. 6 Conlusion In this paper, we proposed an integrated formal framework for the analysis and verifiation of Web servies omposition. We propose a hybrid of both stati and dynami analysis tehniques, whih omplement eah other. We also intend to develop a library of patterns and antipatterns of interesting ISSN: Volume 2, 2017

8 speifiations of web servies. These speifiations will be automatially translatable to a formal speifiation language namely LTL. We presented the formal framework for run-time verifiation of Web servies omposition as well as the extrated automata model. Based on our previous experiene and the initial results obtained in the use of our formal approah for run-time verifiation, we believe that results of this proposed work are promising. Referenes [1] Foster, H. (2008). Tool Support for Safety Analysis of Servie Composition and Deployment Models. Proeedings of the 2008 IEEE International Conferene on Web Servies, pp IEEE Computer Soiety. [2] Foster, H., Uhitel, S., Magee, J., & Kramer, J. (2003). Model-based Verifiation of Web Servie Compositions. Pro. of 18th IEEE International Conferene on Automated Software Engineering, pp Montreal, Canada. [3] Koshkina, M., & van Breugel, F. (2004). Modeling and verifying web servie orhestration by means of the onurreny workbenh. SIGSOFT Software Engineering Notes, 29(5):1-10. ACM. [4] Van Breugel, F., & Koshkina, M. (2005). Dead- Path-Elimination in BPEL4WS. Proeedings of the 5th International Conferene on Appliation of Conurreny to System Design, pp IEEE Computer Soiety. [5] Kallel, S., Char_, A., Dinkelaker, T., Mezini, M., Jmaiel, M.: Speifying and Monitoring Temporal Properties in Web servies Compositions. Proeedings of the 7th IEEE European Conferene on Web Servies (ECOWS). (2009). [6] Simmonds, J., Gan, Y., Chehik, M., Nejati, S., O'Farrell, B., Litani, E., Waterhouse, J.: Runtime Monitoring of Web Servie Conversations. IEEE Transations on Servies Computing. 99, (2009). [7] May Haydar, Sergiy Boroday, Alexandre Petrenko, and Houari Sahraoui. "Properties and Sopes in Web Model Cheking". In Pro. of 20th IEEE/ACM International Conferene on Automated Software Engineering (ASE 05). Long Beah, California, USA, November [8] May Haydar, Sergiy Boroday, Alexandre Petrenko, and Houari Sahraoui. "Propositional Sopes in Lenear Temporal Logi". In Pro. of 5th International Conferene on New Tehnologies of Distributed Systems (NOTERE 05). Gatineau, Quebe, Canada, August [9] Dwyer M, Avrunin GS, Corbett JC. Patterns in Property Speifiations for Finite-state Verifiation. 21st Int. Conferene on Software Engineering, May, [10] X. Fu et al, Analysis of interating BPEL web servies. 13th Int. World Wide Web Conferene, [11] Nakajima, S. (2006, May). Model-Cheking Behavioral Speifiation of BPEL Appliations. Proeedings of the International Workshop on Web Languages and Formal Methods, 2(151): ENTCS. [12] Fu, X., Bultan, T., & Su, J. (2004). Analysis of interating BPEL Web Servies. Proeedings of the 13th International World Wide Web Conferene, pp ACM Press. [13] H. H. Hallal, E. Alikaem, W. P. Tunney, S. Boroday, A. Petrenko,(2004) "Antipattern- Based Detetion of Defiienies in Java Multithreaded Software," qsi, pp , Quality Software, Fourth International Conferene on (QSIC'04). [14] Haydar, M., Petrenko, A. and Sahraoui, H. (2004) "Formal Verifiation of Web Appliations Modeled by Communiating Automata" In Proeedings of 24th IFIP WG 6.1 IFIP International Conferene on Formal Tehniques for Networked and Distributed Systems (FORTE 2004), pp Madrid, Spain. [LNCS, vol. 3235] [15] Boroday, S., Petrenko, A., Sing, J. and Hallal, H. (2005) "Dynami Analysis of Java Appliations for MultiThreaded Antipatterns" In Proeedings of the Third International Workshops on Dynamis Analysis (WODA 2005). St-Louis, MI, USA. [16] May Haydar. A Formal Framework for Run-Time Verifiation of Web Appliations: An Approah Supported by Sope Extended Linear Temporal Logi. VDM Verlag, Germany, September ISBN: [17] May Haydar, Houari Sahraoui, and Alexandre Petrenko. "Speifiation Patterns for Formal Web Verifiation". In Pro. of 8th International Conferene on Web Engineering (ICWE 08). Yorktown Heights, New York, USA, July [18] Gerarld Holzmann. The SPIN Model Cheker: Primer and Referene Manual. ISBN- 10: Addison-Wesley, Sptember ISSN: Volume 2, 2017

9 [19] A. Andrews, J. Offutt J, R. Alexander, Testing Web Appliations by Modeling with FSMs, Software Systems and Modeling, 4(3): , July [20] OASIS. (2007). OASIS Web Servies Business Proess Exeution Language. =wsbpel. [21] Arkin, A., Askary, S., Fordin, S., & al. (2002). Web Servie Choreography Interfae (WSCI) 1.0. Retrieved on April 10, 2005 from ISSN: Volume 2, 2017

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2

On - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2 On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,

More information

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract

Learning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and

More information

Verifying Interaction Protocol Compliance of Service Orchestrations

Verifying Interaction Protocol Compliance of Service Orchestrations Verifying Interation Protool Compliane of Servie Orhestrations Andreas Shroeder and Philip Mayer Ludwig-Maximilians-Universität Münhen, Germany {shroeda, mayer}@pst.ifi.lmu.de Abstrat. An important aspet

More information

Outline: Software Design

Outline: Software Design Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling

More information

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System

Algorithms, Mechanisms and Procedures for the Computer-aided Project Generation System Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department

More information

Extracting Partition Statistics from Semistructured Data

Extracting Partition Statistics from Semistructured Data Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk

More information

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT

DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT DETECTION METHOD FOR NETWORK PENETRATING BEHAVIOR BASED ON COMMUNICATION FINGERPRINT 1 ZHANGGUO TANG, 2 HUANZHOU LI, 3 MINGQUAN ZHONG, 4 JIAN ZHANG 1 Institute of Computer Network and Communiation Tehnology,

More information

Formal Verification by Model Checking

Formal Verification by Model Checking Formal Verifiation by Model Cheking Jonathan Aldrih Carnegie Mellon University Based on slides developed by Natasha Sharygina 15-413: Introdution to Software Engineering Fall 2005 3 Formal Verifiation

More information

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study

What are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The

More information

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating

Capturing Large Intra-class Variations of Biometric Data by Template Co-updating Capturing Large Intra-lass Variations of Biometri Data by Template Co-updating Ajita Rattani University of Cagliari Piazza d'armi, Cagliari, Italy ajita.rattani@diee.unia.it Gian Lua Marialis University

More information

Interconnection Styles

Interconnection Styles Interonnetion tyles oftware Design Following the Export (erver) tyle 2 M1 M4 M5 4 M3 M6 1 3 oftware Design Following the Export (Client) tyle e 2 e M1 M4 M5 4 M3 M6 1 e 3 oftware Design Following the Export

More information

Gray Codes for Reflectable Languages

Gray Codes for Reflectable Languages Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings

More information

Pipelined Multipliers for Reconfigurable Hardware

Pipelined Multipliers for Reconfigurable Hardware Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,

More information

- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger.

- 1 - S 21. Directory-based Administration of Virtual Private Networks: Policy & Configuration. Charles A Kunzinger. - 1 - S 21 Diretory-based Administration of Virtual Private Networks: Poliy & Configuration Charles A Kunzinger kunzinge@us.ibm.om - 2 - Clik here Agenda to type page title What is a VPN? What is VPN Poliy?

More information

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR

A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and

More information

Exploring the Commonality in Feature Modeling Notations

Exploring the Commonality in Feature Modeling Notations Exploring the Commonality in Feature Modeling Notations Miloslav ŠÍPKA Slovak University of Tehnology Faulty of Informatis and Information Tehnologies Ilkovičova 3, 842 16 Bratislava, Slovakia miloslav.sipka@gmail.om

More information

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks

A Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali

More information

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks

A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr

More information

A {k, n}-secret Sharing Scheme for Color Images

A {k, n}-secret Sharing Scheme for Color Images A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University

More information

Partial Character Decoding for Improved Regular Expression Matching in FPGAs

Partial Character Decoding for Improved Regular Expression Matching in FPGAs Partial Charater Deoding for Improved Regular Expression Mathing in FPGAs Peter Sutton Shool of Information Tehnology and Eletrial Engineering The University of Queensland Brisbane, Queensland, 4072, Australia

More information

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)

Automatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425) Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University

More information

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments

RAC 2 E: Novel Rendezvous Protocol for Asynchronous Cognitive Radios in Cooperative Environments 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communiations 1 RAC 2 E: Novel Rendezvous Protool for Asynhronous Cognitive Radios in Cooperative Environments Valentina Pavlovska,

More information

A Novel Validity Index for Determination of the Optimal Number of Clusters

A Novel Validity Index for Determination of the Optimal Number of Clusters IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers

More information

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications

System-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis

More information

The SODA AOSE Methodology

The SODA AOSE Methodology The SODA AOSE Methodology Multiagent Systems LM Sistemi Multiagente LM Ambra Molesini & Andrea Omiini {ambra.molesini, andrea.omiini}@unibo.it Dipartimento di Informatia Sienza e Ingegneria (DISI) Alma

More information

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center

Constructing Transaction Serialization Order for Incremental. Data Warehouse Refresh. Ming-Ling Lo and Hui-I Hsiao. IBM T. J. Watson Research Center Construting Transation Serialization Order for Inremental Data Warehouse Refresh Ming-Ling Lo and Hui-I Hsiao IBM T. J. Watson Researh Center July 11, 1997 Abstrat In typial pratie of data warehouse, the

More information

HEXA: Compact Data Structures for Faster Packet Processing

HEXA: Compact Data Structures for Faster Packet Processing Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for

More information

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines

The Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer

More information

Test Case Generation from UML State Machines

Test Case Generation from UML State Machines Test Case Generation from UML State Mahines Dirk Seifert To ite this version: Dirk Seifert. Test Case Generation from UML State Mahines. [Researh Report] 2008. HAL Id: inria-00268864

More information

A Novel Timestamp Ordering Approach for Co-existing Traditional and Cooperative Transaction Processing

A Novel Timestamp Ordering Approach for Co-existing Traditional and Cooperative Transaction Processing A Novel Timestamp Ordering Approah for Co-existing Traditional and Cooperative Transation Proessing Author Sun, Chengzheng, Zhang, Y., Kambayashi, Y., Yang, Y. Published 1998 Conferene Title Proeedings

More information

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections

SVC-DASH-M: Scalable Video Coding Dynamic Adaptive Streaming Over HTTP Using Multiple Connections SVC-DASH-M: Salable Video Coding Dynami Adaptive Streaming Over HTTP Using Multiple Connetions Samar Ibrahim, Ahmed H. Zahran and Mahmoud H. Ismail Department of Eletronis and Eletrial Communiations, Faulty

More information

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0

CA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0 Implementation Proven Professional Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer

More information

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering

Volume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm

More information

A service-oriented UML profile with formal support

A service-oriented UML profile with formal support A servie-oriented UML profile with formal support Roberto Bruni 1, Matthias Hölzl 3, Nora Koh 2,3, Alberto Lluh Lafuente 1, Philip Mayer 3, Ugo Montanari 1, and Andreas Shroeder 3 1 University of Pisa,

More information

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks

Unsupervised Stereoscopic Video Object Segmentation Based on Active Contours and Retrainable Neural Networks Unsupervised Stereosopi Video Objet Segmentation Based on Ative Contours and Retrainable Neural Networks KLIMIS NTALIANIS, ANASTASIOS DOULAMIS, and NIKOLAOS DOULAMIS National Tehnial University of Athens

More information

Incremental Mining of Partial Periodic Patterns in Time-series Databases

Incremental Mining of Partial Periodic Patterns in Time-series Databases CERIAS Teh Report 2000-03 Inremental Mining of Partial Periodi Patterns in Time-series Dataases Mohamed G. Elfeky Center for Eduation and Researh in Information Assurane and Seurity Purdue University,

More information

Approximate logic synthesis for error tolerant applications

Approximate logic synthesis for error tolerant applications Approximate logi synthesis for error tolerant appliations Doohul Shin and Sandeep K. Gupta Eletrial Engineering Department, University of Southern California, Los Angeles, CA 989 {doohuls, sandeep}@us.edu

More information

CleanUp: Improving Quadrilateral Finite Element Meshes

CleanUp: Improving Quadrilateral Finite Element Meshes CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)

More information

Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8

Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8 Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4

More information

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,

More information

Mining effective design solutions based on a model-driven approach

Mining effective design solutions based on a model-driven approach ata Mining VI 463 Mining effetive design solutions based on a model-driven approah T. Katsimpa 2, S. Sirmakessis 1,. Tsakalidis 1,2 & G. Tzimas 1,2 1 Researh ademi omputer Tehnology Institute, Hellas 2

More information

Chapter 2: Introduction to Maple V

Chapter 2: Introduction to Maple V Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard

More information

Parametric Abstract Domains for Shape Analysis

Parametric Abstract Domains for Shape Analysis Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University

More information

Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis

Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Journal of Computer Siene 4 (): 9-97, 008 ISSN 549-3636 008 Siene Publiations Fuzzy Meta Node Fuzzy Metagraph and its Cluster Analysis Deepti Gaur, Aditya Shastri and Ranjit Biswas Department of Computer

More information

Reducing Runtime Complexity of Long-Running Application Services via Dynamic Profiling and Dynamic Bytecode Adaptation for Improved Quality of Service

Reducing Runtime Complexity of Long-Running Application Services via Dynamic Profiling and Dynamic Bytecode Adaptation for Improved Quality of Service Reduing Runtime Complexity of Long-Running Appliation Servies via Dynami Profiling and Dynami Byteode Adaptation for Improved Quality of Servie ABSTRACT John Bergin Performane Engineering Laboratory University

More information

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer

Cross-layer Resource Allocation on Broadband Power Line Based on Novel QoS-priority Scheduling Function in MAC Layer Communiations and Networ, 2013, 5, 69-73 http://dx.doi.org/10.4236/n.2013.53b2014 Published Online September 2013 (http://www.sirp.org/journal/n) Cross-layer Resoure Alloation on Broadband Power Line Based

More information

This fact makes it difficult to evaluate the cost function to be minimized

This fact makes it difficult to evaluate the cost function to be minimized RSOURC LLOCTION N SSINMNT In the resoure alloation step the amount of resoures required to exeute the different types of proesses is determined. We will refer to the time interval during whih a proess

More information

13.1 Numerical Evaluation of Integrals Over One Dimension

13.1 Numerical Evaluation of Integrals Over One Dimension 13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied

More information

CA Privileged Identity Manager r12.x (CA ControlMinder) Implementation Proven Professional Exam (CAT-480) Study Guide Version 1.5

CA Privileged Identity Manager r12.x (CA ControlMinder) Implementation Proven Professional Exam (CAT-480) Study Guide Version 1.5 Proven Professional Exam (CAT-480) Study Guide Version 1.5 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer

More information

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application

Performance of Histogram-Based Skin Colour Segmentation for Arms Detection in Human Motion Analysis Application World Aademy of Siene, Engineering and Tehnology 8 009 Performane of Histogram-Based Skin Colour Segmentation for Arms Detetion in Human Motion Analysis Appliation Rosalyn R. Porle, Ali Chekima, Farrah

More information

Establishing Secure Ethernet LANs Using Intelligent Switching Hubs in Internet Environments

Establishing Secure Ethernet LANs Using Intelligent Switching Hubs in Internet Environments Establishing Seure Ethernet LANs Using Intelligent Swithing Hubs in Internet Environments WOEIJIUNN TSAUR AND SHIJINN HORNG Department of Eletrial Engineering, National Taiwan University of Siene and Tehnology,

More information

COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems

COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems COSSIM An Integrated Solution to Address the Simulator Gap for Parallel Heterogeneous Systems Andreas Brokalakis Synelixis Solutions Ltd, Greee brokalakis@synelixis.om Nikolaos Tampouratzis Teleommuniation

More information

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays

Analysis of input and output configurations for use in four-valued CCD programmable logic arrays nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,

More information

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks

A Dual-Hamiltonian-Path-Based Multicasting Strategy for Wormhole-Routed Star Graph Interconnection Networks A Dual-Hamiltonian-Path-Based Multiasting Strategy for Wormhole-Routed Star Graph Interonnetion Networks Nen-Chung Wang Department of Information and Communiation Engineering Chaoyang University of Tehnology,

More information

Accommodations of QoS DiffServ Over IP and MPLS Networks

Accommodations of QoS DiffServ Over IP and MPLS Networks Aommodations of QoS DiffServ Over IP and MPLS Networks Abdullah AlWehaibi, Anjali Agarwal, Mihael Kadoh and Ahmed ElHakeem Department of Eletrial and Computer Department de Genie Eletrique Engineering

More information

Detection and Recognition of Non-Occluded Objects using Signature Map

Detection and Recognition of Non-Occluded Objects using Signature Map 6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,

More information

Facility Location: Distributed Approximation

Facility Location: Distributed Approximation Faility Loation: Distributed Approximation Thomas Mosibroda Roger Wattenhofer Distributed Computing Group PODC 2005 Where to plae ahes in the Internet? A distributed appliation that has to dynamially plae

More information

A Visualization Technique for Unit Testing and Static Checking with Caller Callee Relationships

A Visualization Technique for Unit Testing and Static Checking with Caller Callee Relationships A Visualization Tehnique for Unit Testing and Stati Cheking with Caller Callee Relationships Yuko Muto, Kozo Okano, Shinji Kusumoto Graduate Shool of Information Siene and Tehnology Osaka University Suita,

More information

High-level synthesis under I/O Timing and Memory constraints

High-level synthesis under I/O Timing and Memory constraints Highlevel synthesis under I/O Timing and Memory onstraints Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn, Eri Martin To ite this version: Philippe Coussy, Gwenolé Corre, Pierre Bomel, Eri Senn,

More information

XML Data Streams. XML Stream Processing. XML Stream Processing. Yanlei Diao. University of Massachusetts Amherst

XML Data Streams. XML Stream Processing. XML Stream Processing. Yanlei Diao. University of Massachusetts Amherst XML Stream Proessing Yanlei Diao University of Massahusetts Amherst XML Data Streams XML is the wire format for data exhanged online. Purhase orders http://www.oasis-open.org/ommittees/t_home.php?wg_abbrev=ubl

More information

Automated System for the Study of Environmental Loads Applied to Production Risers Dustin M. Brandt 1, Celso K. Morooka 2, Ivan R.

Automated System for the Study of Environmental Loads Applied to Production Risers Dustin M. Brandt 1, Celso K. Morooka 2, Ivan R. EngOpt 2008 - International Conferene on Engineering Optimization Rio de Janeiro, Brazil, 01-05 June 2008. Automated System for the Study of Environmental Loads Applied to Prodution Risers Dustin M. Brandt

More information

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY

COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary

More information

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT?

3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? 3-D IMAGE MODELS AND COMPRESSION - SYNTHETIC HYBRID OR NATURAL FIT? Bernd Girod, Peter Eisert, Marus Magnor, Ekehard Steinbah, Thomas Wiegand Te {girod eommuniations Laboratory, University of Erlangen-Nuremberg

More information

Detecting Outliers in High-Dimensional Datasets with Mixed Attributes

Detecting Outliers in High-Dimensional Datasets with Mixed Attributes Deteting Outliers in High-Dimensional Datasets with Mixed Attributes A. Koufakou, M. Georgiopoulos, and G.C. Anagnostopoulos 2 Shool of EECS, University of Central Florida, Orlando, FL, USA 2 Dept. of

More information

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller

Trajectory Tracking Control for A Wheeled Mobile Robot Using Fuzzy Logic Controller Trajetory Traking Control for A Wheeled Mobile Robot Using Fuzzy Logi Controller K N FARESS 1 M T EL HAGRY 1 A A EL KOSY 2 1 Eletronis researh institute, Cairo, Egypt 2 Faulty of Engineering, Cairo University,

More information

CA Privileged Access Manager 3.x Proven Implementation Professional Exam (CAT-661) Study Guide Version 1.0

CA Privileged Access Manager 3.x Proven Implementation Professional Exam (CAT-661) Study Guide Version 1.0 Exam (CAT-661) Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFMATION 2018 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

Make your process world

Make your process world Automation platforms Modion Quantum Safety System Make your proess world a safer plae You are faing omplex hallenges... Safety is at the heart of your proess In order to maintain and inrease your ompetitiveness,

More information

A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering

A Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,

More information

Gradient based progressive probabilistic Hough transform

Gradient based progressive probabilistic Hough transform Gradient based progressive probabilisti Hough transform C.Galambos, J.Kittler and J.Matas Abstrat: The authors look at the benefits of exploiting gradient information to enhane the progressive probabilisti

More information

the data. Structured Principal Component Analysis (SPCA)

the data. Structured Principal Component Analysis (SPCA) Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving

More information

Automatic Generation of Transaction-Level Models for Rapid Design Space Exploration

Automatic Generation of Transaction-Level Models for Rapid Design Space Exploration Automati Generation of Transation-Level Models for Rapid Design Spae Exploration Dongwan Shin, Andreas Gerstlauer, Junyu Peng, Rainer Dömer and Daniel D. Gajski Center for Embedded Computer Systems University

More information

International Journal of Advancements in Research & Technology, Volume 3, Issue 3, March-2014 ISSN

International Journal of Advancements in Research & Technology, Volume 3, Issue 3, March-2014 ISSN International Journal of Advanements in Researh & Tehnology, Volume 3, Issue 3, Marh-204 ISSN 2278-773 47 Phrase Based Doument Retrieving y Comining Suffix Tree index data struture and Boyer- Moore faster

More information

Episode 12: TCP/IP & UbiComp

Episode 12: TCP/IP & UbiComp Episode 12: TCP/IP & UbiComp Hannes Frey and Peter Sturm University of Trier Outline Introdution Mobile IP TCP and Mobility Conlusion Referenes [1] James D. Solomon, Mobile IP: The Unplugged, Prentie Hall,

More information

Exploiting Enriched Contextual Information for Mobile App Classification

Exploiting Enriched Contextual Information for Mobile App Classification Exploiting Enrihed Contextual Information for Mobile App Classifiation Hengshu Zhu 1 Huanhuan Cao 2 Enhong Chen 1 Hui Xiong 3 Jilei Tian 2 1 University of Siene and Tehnology of China 2 Nokia Researh Center

More information

Colouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G.

Colouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G. Colouring ontat graphs of squares and retilinear polygons de Berg, M.T.; Markovi, A.; Woeginger, G. Published in: nd European Workshop on Computational Geometry (EuroCG 06), 0 Marh - April, Lugano, Switzerland

More information

Batch Auditing for Multiclient Data in Multicloud Storage

Batch Auditing for Multiclient Data in Multicloud Storage Advaned Siene and Tehnology Letters, pp.67-73 http://dx.doi.org/0.4257/astl.204.50. Bath Auditing for Multilient Data in Multiloud Storage Zhihua Xia, Xinhui Wang, Xingming Sun, Yafeng Zhu, Peng Ji and

More information

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else

timestamp, if silhouette(x, y) 0 0 if silhouette(x, y) = 0, mhi(x, y) = and mhi(x, y) < timestamp - duration mhi(x, y), else 3rd International Conferene on Multimedia Tehnolog(ICMT 013) An Effiient Moving Target Traking Strateg Based on OpenCV and CAMShift Theor Dongu Li 1 Abstrat Image movement involved bakground movement and

More information

Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks

Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks Displaement-based Route Update Strategies for Proative Routing Protools in Mobile Ad Ho Networks Mehran Abolhasan 1 and Tadeusz Wysoki 1 1 University of Wollongong, NSW 2522, Australia E-mail: mehran@titr.uow.edu.au,

More information

Video Data and Sonar Data: Real World Data Fusion Example

Video Data and Sonar Data: Real World Data Fusion Example 14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu

More information

mahines. HBSP enhanes the appliability of the BSP model by inorporating parameters that reet the relative speeds of the heterogeneous omputing omponen

mahines. HBSP enhanes the appliability of the BSP model by inorporating parameters that reet the relative speeds of the heterogeneous omputing omponen The Heterogeneous Bulk Synhronous Parallel Model Tiani L. Williams and Rebea J. Parsons Shool of Computer Siene University of Central Florida Orlando, FL 32816-2362 fwilliams,rebeag@s.uf.edu Abstrat. Trends

More information

CA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1

CA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1 Exam (CAT-600) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized

More information

Verification of Parameterized Concurrent Programs By Modular Reasoning about Data and Control

Verification of Parameterized Concurrent Programs By Modular Reasoning about Data and Control Verifiation of Parameterized Conurrent Programs By Modular Reasoning about Data and Control Azadeh Farzan Zahary Kinaid University of Toronto azadeh,zkinaid@s.toronto.edu Abstrat In this paper, we onsider

More information

Zippy - A coarse-grained reconfigurable array with support for hardware virtualization

Zippy - A coarse-grained reconfigurable array with support for hardware virtualization Zippy - A oarse-grained reonfigurable array with support for hardware virtualization Christian Plessl Computer Engineering and Networks Lab ETH Zürih, Switzerland plessl@tik.ee.ethz.h Maro Platzner Department

More information

Creating Adaptive Web Sites Through Usage-Based Clustering of URLs

Creating Adaptive Web Sites Through Usage-Based Clustering of URLs Creating Adaptive Web Sites Through Usage-Based Clustering of URLs Bamshad Mobasher Dept. of Computer Siene, DePaul University, Chiago, IL mobasher@s.depaul.edu Robert Cooley, Jaideep Srivastava Dept.

More information

Allocating Rotating Registers by Scheduling

Allocating Rotating Registers by Scheduling Alloating Rotating Registers by Sheduling Hongbo Rong Hyunhul Park Cheng Wang Youfeng Wu Programming Systems Lab Intel Labs {hongbo.rong,hyunhul.park,heng..wang,youfeng.wu}@intel.om ABSTRACT A rotating

More information

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality

Multi-Piece Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality INTERNATIONAL CONFERENCE ON MANUFACTURING AUTOMATION (ICMA200) Multi-Piee Mold Design Based on Linear Mixed-Integer Program Toward Guaranteed Optimality Stephen Stoyan, Yong Chen* Epstein Department of

More information

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization

Self-Adaptive Parent to Mean-Centric Recombination for Real-Parameter Optimization Self-Adaptive Parent to Mean-Centri Reombination for Real-Parameter Optimization Kalyanmoy Deb and Himanshu Jain Department of Mehanial Engineering Indian Institute of Tehnology Kanpur Kanpur, PIN 86 {deb,hjain}@iitk.a.in

More information

An Efficient and Scalable Approach to CNN Queries in a Road Network

An Efficient and Scalable Approach to CNN Queries in a Road Network An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,

More information

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1.

Abstract. Key Words: Image Filters, Fuzzy Filters, Order Statistics Filters, Rank Ordered Mean Filters, Channel Noise. 1. Fuzzy Weighted Rank Ordered Mean (FWROM) Filters for Mixed Noise Suppression from Images S. Meher, G. Panda, B. Majhi 3, M.R. Meher 4,,4 Department of Eletronis and I.E., National Institute of Tehnology,

More information

Performance Benchmarks for an Interactive Video-on-Demand System

Performance Benchmarks for an Interactive Video-on-Demand System Performane Benhmarks for an Interative Video-on-Demand System. Guo,P.G.Taylor,E.W.M.Wong,S.Chan,M.Zukerman andk.s.tang ARC Speial Researh Centre for Ultra-Broadband Information Networks (CUBIN) Department

More information

Parallelizing Frequent Web Access Pattern Mining with Partial Enumeration for High Speedup

Parallelizing Frequent Web Access Pattern Mining with Partial Enumeration for High Speedup Parallelizing Frequent Web Aess Pattern Mining with Partial Enumeration for High Peiyi Tang Markus P. Turkia Department of Computer Siene Department of Computer Siene University of Arkansas at Little Rok

More information

Australian Journal of Basic and Applied Sciences. A new Divide and Shuffle Based algorithm of Encryption for Text Message

Australian Journal of Basic and Applied Sciences. A new Divide and Shuffle Based algorithm of Encryption for Text Message ISSN:1991-8178 Australian Journal of Basi and Applied Sienes Journal home page: www.ajbasweb.om A new Divide and Shuffle Based algorithm of Enryption for Text Message Dr. S. Muthusundari R.M.D. Engineering

More information

Multiple-Criteria Decision Analysis: A Novel Rank Aggregation Method

Multiple-Criteria Decision Analysis: A Novel Rank Aggregation Method 3537 Multiple-Criteria Deision Analysis: A Novel Rank Aggregation Method Derya Yiltas-Kaplan Department of Computer Engineering, Istanbul University, 34320, Avilar, Istanbul, Turkey Email: dyiltas@ istanbul.edu.tr

More information

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem

Calculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion

More information

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu

More information

Direct-Mapped Caches

Direct-Mapped Caches A Case for Diret-Mapped Cahes Mark D. Hill University of Wisonsin ahe is a small, fast buffer in whih a system keeps those parts, of the ontents of a larger, slower memory that are likely to be used soon.

More information

Introductory Programming, IMM, DTU Systematic Software Test. Software test (afprøvning) Motivation. Structural test and functional test

Introductory Programming, IMM, DTU Systematic Software Test. Software test (afprøvning) Motivation. Structural test and functional test Introdutory Programming, IMM, DTU Systemati Software Test Peter Sestoft a Programs often ontain unintended errors how do you find them? Strutural test Funtional test Notes: Systemati Software Test, http://www.dina.kvl.dk/

More information

Visualization of patent analysis for emerging technology

Visualization of patent analysis for emerging technology Available online at www.sienediret.om Expert Systems with Appliations Expert Systems with Appliations 34 (28) 84 82 www.elsevier.om/loate/eswa Visualization of patent analysis for emerging tehnology Young

More information

Dynamic Backlight Adaptation for Low Power Handheld Devices 1

Dynamic Backlight Adaptation for Low Power Handheld Devices 1 Dynami Baklight Adaptation for ow Power Handheld Devies 1 Sudeep Pasriha, Manev uthra, Shivajit Mohapatra, Nikil Dutt and Nalini Venkatasubramanian 444, Computer Siene Building, Shool of Information &

More information

1. Introduction. 2. The Probable Stope Algorithm

1. Introduction. 2. The Probable Stope Algorithm 1. Introdution Optimization in underground mine design has reeived less attention than that in open pit mines. This is mostly due to the diversity o underground mining methods and omplexity o underground

More information