AUTOMATIC TEST CASE GENERATION USING UML MODELS
|
|
- Rosanna Harris
- 5 years ago
- Views:
Transcription
1 Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering, Pune Univerity 1 jainagar7@gmail.com, 2 khuhbulalwani8@gmail.com, 3 nikitakm@gmail.com, 4 gadekarbhagya@gmail.com Abtract- We preent a tet cae generation technique uing UML model. We ue the feature of UML activity diagram and ue cae diagram which include the object and their activitie. All the condition, meage, are included in the tet cae. Our model derive tet cae uing full predicate coverage criteria. We contruct Concurrent Control Flow Graph (CCFG) from activity diagram. We focu on generating tet cae on equence of action and the actor performing thee action. The generated tet cae from our ytem can be ued for integration and ytem teting. The tet cae generated are uitable for detecting object interaction. Keyword- Activity Diagram, Full Predicate Coverage Criteria, Uml, Ue Cae. I. INTRODUCTION Software teting play a crucial tep in auring oftware quality. It erve the purpoe of quality aurance, verification and validation. Studie indicate that 50% of cot for oftware development i given to teting. Generation of tet cae i a time conuming proce. Hence, automation i an important iue. There are two main approache to generate tet cae. One approach i generating tet cae from and deign pecification. The econd approach i uing ource code. Mot of the and high-level deign of oftware are documented in the form of model. Thee model can be ued for tet cae generation of the ytem by automated mean. UML diagram may be decompoed into everal interconnected interaction diagram. For generating tet equence, Activity diagram i alone not enough to decide the different component, i.e., input, expected output, etc. Hence we need ue cae diagram to realize actor. The paper tart ection II a an introduction to the baic concept like UML diagram ued, CCFP, etc. The III ection cover a literature urvey of exiting ytem. The IV ection dicue the propoed ytem. In thi ection, we build graph, find tet equence and generate tet cae in tabular form. Section V conclude the paper. II. BASIC CONCEPTS UML Model: 1. Ue cae: A ue cae i an abtraction of a ytem repone to external input. It accomplihe a tak that i important from uer point of view. Thu, a ue cae focue on only thoe feature viible at the external interface of a ytem. A ue cae intance define particular input value and expected reult. Ue cae diagram do not preent architectural model, uerinterface model or workflow model. Ue cae cenario are uually not executed in arbitrary order. Some ue cae cenario need to be executed before other. They may have <<extend>> and <<include>> dependencie a well a equential dependencie which tem from the logic of the buine proce that the ytem upport. Hence, data come in or goe out of the ytem through ue cae. An actor give input and receive output information through ue cae. Thu, we can have dependencie and contraint between ue cae for each actor. So ue cae diagram can be ornamented with extra ad-hoc information to how relationhip and dependencie among ue cae of a ytem. Ue cae modeling i a different and complementary way of eliciting and documenting. The ue cae model provide a prime ource for object and clae. Ue cae conit of actor and role. An actor pecifie a role that ome external entity adopt when interacting with your ytem directly. A pecification of equence of action, including variant equence and error equence, that a ytem, ubytem or cla can perform by interacting with outide actor. [4]. Ue cae lack the following neceary element of tet deign: 1) Domain Definition of each variable that participate in a ue cae. 2) Required input/output relationhip among ue cae variable (called parameter). 3) Sequential Contraint among ue cae. The diagram below how the ue cae diagram of one of the module of Hopital Management Sytem. Automatic Tet Cae Generation Uing UML Model 30
2 Volume-2, Iue-6, June-2014 Figure 1. Ue cae Diagram of Hopital management ytem. 2. Activity diagram: Activity diagram are OO Flowchart. Activity diagram allow you to model a proce a an activity that conit of a collection of node connected by edge.an activity can be attached to any modeling element for the purpoe of modeling it behavior. The element provide the context for the activity, and the activity may refer to feature of it context. Activitie are typically attached to ue cae, clae, interface, component, collaboration,. In our model we are attaching the activity diagram to ue cae. Help to identify which object doe what activity. Activity diagram how the work flow of a ytem. The unique capability of activity diagram i that they let you model a proce without having to pecify the tatic tructure of clae and object that realize that proce. An example of activity diagram i a hown below: Figure 2. Activity Diagram of Hopital management ytem. Automatic Tet Cae Generation Uing UML Model 31
3 The above activity diagram i of Hopital Management Sytem. It how the work flow of the Hopital Management Sytem. Full-Predicate-Coverage-Criterion (FPC): A tet et T atifie the full predicate coverage criterion if and only if for each claue c in each condition in a equence diagram there exit t1 in T uch that t1 caue c to evaluate to TRUE and there exit t2 in T uch that t2 caue c to evaluate to FALSE while all other claue in the condition have value uch that the value of the condition will alway be the ame a the claue under tet [5]. Thi criterion require all the predicate are checked i.e. all poible combination of the different predicate in the condition are checked. Concurrent Control Flow Path (CCFP): A CCFP i made by travering from the initial node to the final node and concatenating all the node in the path. Similar to conventional CFP, pecial conideration regarding deciion node hould be made in term of condition and loop, i.e. two different CCFP for true/fale edge of a condition hould be derived. III. A LITERATURE SURVEY OF EXISTING SYSTEM The approach propoed by Tonella et al. [6] generate tet cae baed on UML equence diagram that are revere engineered from the code under tet. Samuel et al. [7] preented a novel methodology for tet cae generation baed on UML equence diagram. They create meage dependence graph (MDG) from UML equence diagram. Edge marking dynamic licing method i applied on MDG to create lice. Baed on the lice created with repect to each predicate on the equence diagram, tet data are generated. They have ued a tet adequacy criterion named lice coverage criterion. IV. PROPOSED SYSTEM: Volume-2, Iue-6, June-2014 Our propoed approach for tet cae generation i baed on the artifact produced at the end of the analyi tage of the development. The artifact include ue cae diagram and activity diagram for each ue cae. The approach require the pecification of uch equential contraint in the form of an activity diagram. Our propoed model ha the following tep to generate tet cae: 1) Convert the activity diagram given to activity graph. 2) Extracting CCFP from Activity Graph. 3) Generate Tet equence from the activity graph. 4) Finally uing the ue cae diagram and the equence to generate the tet cae. Step 1: In thi graph, the vertice are the ue cae or action node in the activity graph and the dependency edge are the edge between the activity action node. The fork and join node are deleted while contructing it. The Activity Graph of the activity diagram (Figure 2) of Hopital management i a follow. They generate tet cae for cluter/integration level teting. Sharma et al. [8] tranformed a UML ue cae diagram into a graph called ue cae diagram graph (UDG) and equence diagram into a graph called the equence diagram graph (SDG) and then integrating UDG and SDG to form the Sytem Teting Graph (STG). The STG i then travered to generate tet cae for ytem teting. They have ued tate-baed tranition path coverage criteria for tet cae generation. Nayak et.al. [9] Propoed an approach of yntheizing tet data from the information embedded in model element uch a cla diagram and equence diagram. They ued OCL contraint. In their approach, they annotated a equence diagram with attribute and contraint information derived from cla diagram and OCL contraint and map it onto a tructured compoite graph called SCG. The tet pecification are then generated from SCG Figure 3. Activity Graph of correponding Activity diagram in Figure 2. Step 2: Extracting CCFP from Activity Graph: The next tep i extracting Concurrent Control Flow Path from the CCFG. All the different branche taken are identified and all poible concurrent path are derived. If the number of branche i n, then the number of different poible path can go up to 2*n. In the above example, we obtain five different path. The different poible path obtained are Automatic Tet Cae Generation Uing UML Model 32
4 1) A-B-C-E. 2) A-B-C-D-F. 3) A-B-C-D-G-I. 4) A-B-C-D-G-H-J-K. Step 3: To derive activity equence Depth-Firt earch i ued. The algorithm ued to generate thi equence i: Input: Activity Diagram Output: Tet Sequence Let TS be Tet Sequence. Let PD be Parameterized Dependencie. Step 1: Travere the activity diagram uing Depthfirt Search. Step 2: If loop preent Step 3: Make one iteration. Step 4: End if. Step 5: for each pair (A, B) of intantiated equence in PD Step 6: TS= Merge (A, B) Step 7: Store all Tet Sequence TS. Step 8: End. The tet equence generated i: 1) Viit doctor-provide - - Iue dicharge advice-end. 2) Viit doctor-provide-repot-check check tet -precribe tet-end. 3) Viit doctor-provide -check check tet -check -precribe medicine-end. 4) Viit doctor-provide -check check tet -check -chedule -patient confirm -perform -end. The tet equence i alo known a flow. Step 4: The tet equence i diplayed. Uing the Ue cae Diagram the actor and their activitie are determined and the tet cae are generated in a tabular form. The table conit of the following information. 1) The actor /actor involved. 2) The action performed by the actor/actor. 3) Condition. 4) Next action to be performed. Volume-2, Iue-6, June-2014 Viit doctor Provide Provide tet tet, nure, nure, patient, nure, patient, nure Precribe tet Precribe tet CONCLUSION Ye Report poitive Report negative More tet More tet not Ye Operatio n Operatio n not Ye Ye Ye tet Iue dicharge advice Precribe tet End Precribe medicine End The tet cae in tabular form for the dicued example of hopital management ytem are a follow: Actor Action performed Conditio n Next action to be performed patient Viit doctor Ye Provide We have preented a trategy for integration teting which combine information from ue cae and activity diagram. Our approach exercie object interaction in the context of ue cae dependencie to fulfill the of the uer. The generated tet cae may lead to the part of the tet cae for ytem teting by combining it for all ue cae cenario together without mine it eparately. Our propoed technique ue XML, which i latet de-facto tandard for exchanging UML model. Automatic Tet Cae Generation Uing UML Model 33
5 REFERENCES [1] R.V. Binder. Teting Object-Oriented Sytem Model, Pattern And Tool. Object Technology Serie. Addiion Weley, Reading, Maachuett, October [2] S. Muchnick, Advanced Compiler Deign And Implementation, Firt Ed., Morgan Kaufmann, [3] P.L. Navarro, D.S. Ruiz And G.M. Perez, A Propoal For Automatic Teting Of Gui Baed On Annotated Ue Cae Advance In Software Engineering., Vol. 2010, Article ID , Doi: /2010/671284, [4] Jim Arlow, Ila Neutadt, UML 2 And The Unified Proce, Principle, Object-Oriented And Deign, Second Edition, Pearon Education. [5] S. Ghoh, R. France, C. Braganza, N. Kawane, A. Andrew, O.Pilkaln, Yet Adequacy Aement For UML Deign Volume-2, Iue-6, June-2014 Model Teting, In Proceeding Of 14 th International Sympoium In Software Reliability Engineering (ISSRE), pp.332,2003. [6] Tonella, P., Potrich, A. Revere Engineering Of The Interaction Diagram From C++ Code, In Proceeding Of IEEE International Conference On Software Maintenance, pp ,2003. [7] Philip Samuel, Rajib Mall, A vel Tet Cae Deign Technique Uing Dynamic Slicing Of UML Sequence Diagram e-informatica: Software Engineering Journal, Volume 2, Iue 1, [8] M. Sarma, R. Mall, Automatic Tet Cae Geneatin From UML Model,IEEE Computer Society, Pp , [9] A. Nayak And D. Samanta, Automatic Tet Data Synthei Uing UML Sequence Diagram. Journal Of Object Technology, Vol.09,.2, Pp , March-April Automatic Tet Cae Generation Uing UML Model 34
Laboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationAn Approach to a Test Oracle for XML Query Testing
An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,
More informationKeywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE
Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent
More informationEdits in Xylia Validity Preserving Editing of XML Documents
dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationA QoS-aware Service Composition Approach based on Semantic Annotations and Integer Programming
A QoS-aware Service Compoition Approach baed on Semantic Annotation and Integer Programming I. INTRODUCTION Service Oriented Architecture (SOA) i a widely adopted paradigm for developing ditributed application
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationIntegration of Digital Test Tools to the Internet-Based Environment MOSCITO
Integration of Digital Tet Tool to the Internet-Baed Environment MOSCITO Abtract Current paper decribe a new environment MOSCITO for providing acce to tool over the internet. The environment i built according
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationFloating Point CORDIC Based Power Operation
Floating Point CORDIC Baed Power Operation Kazumi Malhan, Padmaja AVL Electrical and Computer Engineering Department School of Engineering and Computer Science Oakland Univerity, Rocheter, MI e-mail: kmalhan@oakland.edu,
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory Univerity of Nebraka-Lincoln Email: yzheng choueiry@ce.unl.edu Abtract.
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationmapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee
Reolving Deadlock for Pipelined Stream Application on Network-on-Chip Xiaohang Wang 1,2, Peng Liu 1 1 Department of Information Science and Electronic Engineering, Zheiang Univerity Hangzhou, Zheiang,
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationA Basic Prototype for Enterprise Level Project Management
A Baic Prototype for Enterprie Level Project Management Saurabh Malgaonkar, Abhay Kolhe Computer Engineering Department, Mukeh Patel School of Technology Management & Engineering, NMIMS Univerity, Mumbai,
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationComputer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder
Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationSource Code (C) Phantom Support Sytem Generic Front-End Compiler BB CFG Code Generation ANSI C Single-threaded Application Phantom Call Identifier AEB
Code Partitioning for Synthei of Embedded Application with Phantom André C. Nácul, Tony Givargi Department of Computer Science Univerity of California, Irvine {nacul, givargi@ic.uci.edu ABSTRACT In a large
More informationProving Temporal Properties of Z Specifications Using Abstraction
Proving Temporal Propertie of Z Specification Uing Abtraction Graeme Smith and Kirten Winter Software Verification Reearch Centre Univerity of Queenland 4072, Autralia {mith, kirten}@vrc.uq.edu.au Abtract.
More informationCS201: Data Structures and Algorithms. Assignment 2. Version 1d
CS201: Data Structure and Algorithm Aignment 2 Introduction Verion 1d You will compare the performance of green binary earch tree veru red-black tree by reading in a corpu of text, toring the word and
More informationService and Network Management Interworking in Future Wireless Systems
Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationHow to. write a paper. The basics writing a solid paper Different communities/different standards Common errors
How to write a paper The baic writing a olid paper Different communitie/different tandard Common error Reource Raibert eay My grammar point Article on a v. the Bug in writing Clarity Goal Conciene Calling
More informationShortest Paths with Single-Point Visibility Constraint
Shortet Path with Single-Point Viibility Contraint Ramtin Khoravi Mohammad Ghodi Department of Computer Engineering Sharif Univerity of Technology Abtract Thi paper tudie the problem of finding a hortet
More informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationDynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array
Dynamically Reconfigurable Neuron Architecture for the Implementation of Self- Organizing Learning Array Januz A. Starzyk,Yongtao Guo, and Zhineng Zhu School of Electrical Engineering & Computer Science
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationFrequency Table Computation on Dataflow Architecture
Frequency Table Computation on Dataflow Architecture P. Škoda *, V. Sruk **, and B. Medved Rogina * * Ruđer Bošković Intitute, Zagreb, Croatia ** Faculty of Electrical Engineering and Computing, Univerity
More informationChapter S:II (continued)
Chapter S:II (continued) II. Baic Search Algorithm Sytematic Search Graph Theory Baic State Space Search Depth-Firt Search Backtracking Breadth-Firt Search Uniform-Cot Search AND-OR Graph Baic Depth-Firt
More informationarxiv: v1 [cs.ds] 27 Feb 2018
Incremental Strong Connectivity and 2-Connectivity in Directed Graph Louka Georgiadi 1, Giueppe F. Italiano 2, and Niko Parotidi 2 arxiv:1802.10189v1 [c.ds] 27 Feb 2018 1 Univerity of Ioannina, Greece.
More informationSIMIT 7. Component Type Editor (CTE) User manual. Siemens Industrial
SIMIT 7 Component Type Editor (CTE) Uer manual Siemen Indutrial Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationSoftware Agent (SA) to guarantee QoS for multi constrain applications in all-ip networks
Software Agent (SA) to guarantee QoS for multi contrain application in all-ip network Kazi Khaled Al-Zahid and Mituji Matumoto GITS, Waeda Univerity 94 Waeda Univ. Bldg. A-308, 1011Okuboyama Nihitomida
More informationApplication of Social Relation Graphs for Early Detection of Transient Spammers
Radolaw rendel and Henryk Krawczyk Application of Social Relation raph for Early Detection of Tranient Spammer RADOSLAW RENDEL and HENRYK KRAWCZYK Electronic, Telecommunication and Informatic Department
More informationDelaunay Triangulation: Incremental Construction
Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More information(12) Patent Application Publication (10) Pub. No.: US 2013/ A1. Dhar et al. (43) Pub. Date: Jun. 6, 2013 NY (US) (57) ABSTRACT
(19) United State US 2013 0145314A1 (12) Patent Application Publication (10) Pub. No.: US 2013/0145314 A1 Dhar et al. (43) Pub. Date: Jun. 6, 2013 (54) SYSTEMAND METHOD FORCHANGEABLE (52) U.S. Cl. FOCUS
More informationPolicy-based Injection of Private Traffic into a Public SDN Testbed
Intitut für Techniche Informatik und Kommunikationnetze Adrian Friedli Policy-baed Injection of Private Traffic into a Public SDN Tetbed Mater Thei MA-2013-12 Advior: Dr. Bernhard Ager, Vaileio Kotroni
More informationETSI TS V ( )
TS 122 153 V14.4.0 (2017-05) TECHNICAL SPECIFICATION Digital cellular telecommunication ytem (Phae 2+) (GSM); Univeral Mobile Telecommunication Sytem (UMTS); LTE; Multimedia priority ervice (3GPP TS 22.153
More informationAnalytical Redundancy and Fuzzy Inference in AUV Fault Detection and Compensation
Analytical Redundancy and Fuzzy Inference in AUV Fault Detection and Compenation A. J. Healey Profeor and Director Center for AUV Reearch Naval Potgraduate School Monterey, CA 93953 healey@me.np.navy.mil
More informationTemporal Abstract Interpretation. To have a continuum of program analysis techniques ranging from model-checking to static analysis.
Temporal Abtract Interpretation Patrick COUSOT DI, École normale upérieure 45 rue d Ulm 75230 Pari cedex 05, France mailto:patrick.couot@en.fr http://www.di.en.fr/ couot and Radhia COUSOT LIX École polytechnique
More informationFormal Specification and Verification Techniques for RISC Pipeline Conflicts
The Computer Journal Vol. 38, No., 1995 Oxford Univerity Pre, pp. 111-10 Formal Specification and Verification Technique for RISC Pipeline Conflict Sofiène Tahar and Ramayya Kumar* Intitut für Rechnerentwurf
More informationCERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu
CERIAS Tech Report 2003-15 EFFICIENT PARALLEL ALGORITHMS FOR PLANAR t-graphs by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daecu Center for Education and Reearch in Information Aurance and Security,
More informationAalborg Universitet. Published in: Proceedings of the Working Conference on Advanced Visual Interfaces
Aalborg Univeritet Software-Baed Adjutment of Mobile Autotereocopic Graphic Uing Static Parallax Barrier Paprocki, Martin Marko; Krog, Kim Srirat; Kritofferen, Morten Bak; Krau, Martin Publihed in: Proceeding
More informationA reduced reference image quality metric based on feature fusion and neural networks
Univerity of Wollongong Reearch Online Faculty of Engineering and Information Science - Paper: Part A Faculty of Engineering and Information Science 2011 A reduced reference image quality metric baed on
More informationData Mining with Linguistic Thresholds
Int. J. Contemp. Math. Science, Vol. 7, 22, no. 35, 7-725 Data Mining with Linguitic Threhold Tzung-Pei Hong Department of Electrical Engineering National Univerity of Kaohiung Kaohiung, Taiwan, R.O.C.
More informationA Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong
4th International Conference on Machinery, Material and Computing Technology (ICMMCT 2016) A Load Balancing Model baed on Load-aware for Ditributed Controller Fengjun Shang, Wenjuan Gong College of Compute
More informationA Fast Association Rule Algorithm Based On Bitmap and Granular Computing
A Fat Aociation Rule Algorithm Baed On Bitmap and Granular Computing T.Y.Lin Xiaohua Hu Eric Louie Dept. of Computer Science College of Information Science IBM Almaden Reearch Center San Joe State Univerity
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationISSN: (Online) Volume 3, Issue 4, April 2015 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 3, Iue 4, April 2015 International Journal Advance Reearch in Computer Science and Management Studie Reearch Article / Survey Paper / Cae Study Available online at: www.ijarcm.com
More informationA Sparse Shared-Memory Multifrontal Solver in SCAD Software
Proceeding of the International Multiconference on ISBN 978-83-6080--9 Computer Science and Information echnology, pp. 77 83 ISSN 896-709 A Spare Shared-Memory Multifrontal Solver in SCAD Software Sergiy
More informationAnalysis of the results of analytical and simulation With the network model and dynamic priority Unchecked Buffer
International Reearch Journal of Applied and Baic Science 218 Available online at www.irjab.com ISSN 2251-838X / Vol, 12 (1): 49-53 Science Explorer Publication Analyi of the reult of analytical and imulation
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationVerifying Simulink Diagrams Via A Hybrid Hoare Logic Prover
Verifying Simulink Diagram Via A Hybrid Hoare Logic Prover Liang Zou, Naijun Zhan Martin Fränzle and Shuling Wang Department of Information State Key Lab. of Comp. Sci. Oldenburg Univerity Intitute of
More informationA TOPSIS based Method for Gene Selection for Cancer Classification
Volume 67 No17, April 2013 A TOPSIS baed Method for Gene Selection for Cancer Claification IMAbd-El Fattah,WIKhedr, KMSallam, 1 Department of Statitic, 3 Department of Deciion upport, 2 Department of information
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationA New Approach to Pipeline FFT Processor
A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationA Study of a Variable Compression Ratio and Displacement Mechanism Using Design of Experiments Methodology
A Study of a Variable Compreion Ratio and Diplacement Mechanim Uing Deign of Experiment Methodology Shugang Jiang, Michael H. Smith, Maanobu Takekohi Abtract Due to the ever increaing requirement for engine
More informationA Fast Association Rule Algorithm Based on Bitmap Computing with Multiple Minimum Supports using Maximum Constraints
A Fat Aociation Rule Algorithm Baed on Bitmap Computing with Multiple Minimum Support uing Maximum Contraint Jyothi Patil, and Dr. V.D.Mytri Abtract Mining aociation rule from databae i a timeconuming
More informationSIMIT 7. Profinet IO Gateway. User Manual
SIMIT 7 Profinet IO Gateway Uer Manual Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult are only non-binding uggetion
More informationDWH Performance Tuning For Better Reporting
DWH Performance Tuning For Better Sandeep Bhargava Reearch Scholar Naveen Hemrajani Aociate Profeor Dineh Goyal Aociate Profeor Subhah Gander IT Profeional ABSTRACT: The concept of data warehoue deal in
More informationKinematics Programming for Cooperating Robotic Systems
Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,
More informationModelling the impact of cyber attacks on the traffic control centre of an urban automobile transport system by means of enhanced cybersecurity
Modelling the impact of cyber attack on the traffic control centre of an urban automobile tranport ytem by mean of enhanced cyberecurity Yoana Ivanova 1,* 1 Bulgarian Academy of Science, Intitute of ICT,
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
113 New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory, Univerity of Nebraka-Lincoln {yzheng,choueiry}@ce.unl.edu Abtract.
More informationelse end while End References
621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized
More informationA Local Mobility Agent Selection Algorithm for Mobile Networks
A Local Mobility Agent Selection Algorithm for Mobile Network Yi Xu Henry C. J. Lee Vrizlynn L. L. Thing Intitute for Infocomm Reearch, 21 Heng Mui Keng Terrace, Singapore 119613 Email: {yxu, hlee, vriz}@i2r.a-tar.edu.g
More informationPerformance Evaluation of search engines via user efforts measures
IJCSI International Journal of Computer Science Iue, Vol. 9, Iue 4, No, July 01 www.ijcsi.org 437 Performance Evaluation of earch engine via uer effort meaure Raeh Kumar Goutam 1 and Sanay K. Dwivedi 1
More informationAspects of Formal and Graphical Design of a Bus System
Apect of Formal and Graphical Deign of a Bu Sytem Tiberiu Seceleanu Univerity of Turku, Dpt. of Information Technology Turku, Finland tiberiu.eceleanu@utu.fi Tomi Weterlund Turku Centre for Computer Science
More informationKeywords: Defect detection, linear phased array transducer, parameter optimization, phased array ultrasonic B-mode imaging testing.
Send Order for Reprint to reprint@benthamcience.ae 488 The Open Automation and Control Sytem Journal, 2014, 6, 488-492 Open Acce Parameter Optimization of Linear Phaed Array Tranducer for Defect Detection
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationImage authentication and tamper detection using fragile watermarking in spatial domain
International Journal of Advanced Reearch in Computer Engineering & Technology (IJARCET) Volume 6, Iue 7, July 2017, ISSN: 2278 1323 Image authentication and tamper detection uing fragile watermarking
More informationSCHEDULE DOCUMENT CONNECT MPLS SERVICES PUBLIC NODE4 LIMITED 17/07/2017
SCHEDULE DOCUMENT CONNECT MPLS SERVICES PUBLIC NODE4 LIMITED 17/07/017 SCHEDULE DOCUMENT CONNECT MPLS SERVICES Additional term, Service Decription & Service Level Agreement for ConnectMPLS Service 1. SERVICE
More informationFinite Elements Method in Split Hopkinson Pressure Bar developing process
6th WSEAS International Conference on SYSTEM SCIENCE and SIMULATION in ENGINEERING, Venice, Italy, November 1-3, 007 63 Finite Element Method in Split Hopkinon Preure Bar developing proce ROTARIU ADRIAN
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationDomain-Specific Modeling for Rapid System-Wide Energy Estimation of Reconfigurable Architectures
Domain-Specific Modeling for Rapid Sytem-Wide Energy Etimation of Reconfigurable Architecture Seonil Choi 1,Ju-wookJang 2, Sumit Mohanty 1, Viktor K. Praanna 1 1 Dept. of Electrical Engg. 2 Dept. of Electronic
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More information(12) Patent Application Publication (10) Pub. No.: US 2003/ A1
US 2003O196031A1 (19) United State (12) Patent Application Publication (10) Pub. No.: US 2003/0196031 A1 Chen (43) Pub. Date: Oct. 16, 2003 (54) STORAGE CONTROLLER WITH THE DISK Related U.S. Application
More informationContents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course:
Content Shortet path Algorithm and Network 21/211 The hortet path problem: Statement Verion Application Algorithm (for ingle ource p problem) Reminder: relaxation, Dijktra, Variant of Dijktra, Bellman-Ford,
More informationParameters, UVM, Coverage & Emulation Take Two and Call Me in the Morning
Parameter, UVM, Coverage & Emulation Take Two and Call Me in the Morning Michael Horn Mentor Graphic Corporation Colorado, USA Mike_Horn@mentor.com Bryan Ramirez Mentor Graphic Corporation Colorado, USA
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More informationCSE 250B Assignment 4 Report
CSE 250B Aignment 4 Report March 24, 2012 Yuncong Chen yuncong@c.ucd.edu Pengfei Chen pec008@ucd.edu Yang Liu yal060@c.ucd.edu Abtract In thi project, we implemented the recurive autoencoder (RAE) a decribed
More information