Model-based testing is a process of generating tests for a test target based on a behavioral model. In many cases, suitable models do not exist and building these from scratch is a costly effort. A potential approach to bootstrap this process is to generate models with reverse-engineering methods. Potential sources of information for such models include user sessions, existing test cases, and field data. All of these can be seen as different forms of test data. However, using existing test cases as a basis to create a model for test generation raises the question of what is the benefit over the previously existing tests. This paper aims to answer this question by evaluating the benefits in terms of a practical case study.
{"title":"Using Reverse-Engineered Test-Based Models to Generate More Tests: Where is the Sense in That?","authors":"T. Kanstrén, Éric Piel, H. Groß","doi":"10.1109/ITNG.2012.42","DOIUrl":"https://doi.org/10.1109/ITNG.2012.42","url":null,"abstract":"Model-based testing is a process of generating tests for a test target based on a behavioral model. In many cases, suitable models do not exist and building these from scratch is a costly effort. A potential approach to bootstrap this process is to generate models with reverse-engineering methods. Potential sources of information for such models include user sessions, existing test cases, and field data. All of these can be seen as different forms of test data. However, using existing test cases as a basis to create a model for test generation raises the question of what is the benefit over the previously existing tests. This paper aims to answer this question by evaluating the benefits in terms of a practical case study.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130826485","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Social Book marking (SBM) is one of the most widely used Web services. An SBM website displays and shares each user's bookmarks. The SBM service aggregates the number of users who bookmark a given Web page and provides useful information as a result of these aggregations. However, an increase in the popularity of the SBM service and in the number of the users of the SBM service results in an increase in the amount of SBM SPAM. In addition, the SBM service generates irrelevant information to many users because of the aggregation of a large number of bookmarks, we call this problem "SBM pollution." In this paper, we propose a method for countering the problem of SBM pollution based on the degree of bookmark similarity. The proposed method creates blacklists that contain lists of users having a high degree of bookmark similarity. Based on the created blacklists, the number of bookmarks of the Web pages influenced by SBM pollution is reduced. From the results of the performance evaluation, we show that our method reduces the number of bookmarks of most Web pages influenced by the SBM pollution to a great extent.
{"title":"Performance Evaluation of a Countering Method to Social Bookmarking Pollution Based on Degree of Bookmark Similarity","authors":"H. Hisamatsu, T. Hatanaka","doi":"10.1109/ITNG.2012.144","DOIUrl":"https://doi.org/10.1109/ITNG.2012.144","url":null,"abstract":"Social Book marking (SBM) is one of the most widely used Web services. An SBM website displays and shares each user's bookmarks. The SBM service aggregates the number of users who bookmark a given Web page and provides useful information as a result of these aggregations. However, an increase in the popularity of the SBM service and in the number of the users of the SBM service results in an increase in the amount of SBM SPAM. In addition, the SBM service generates irrelevant information to many users because of the aggregation of a large number of bookmarks, we call this problem \"SBM pollution.\" In this paper, we propose a method for countering the problem of SBM pollution based on the degree of bookmark similarity. The proposed method creates blacklists that contain lists of users having a high degree of bookmark similarity. Based on the created blacklists, the number of bookmarks of the Web pages influenced by SBM pollution is reduced. From the results of the performance evaluation, we show that our method reduces the number of bookmarks of most Web pages influenced by the SBM pollution to a great extent.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121611737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Devon M. Simmonds, Mark Lanter, Lyle Scott, A. Young, Selin Benli, A. Herrmann
Many universities are taking advantage of distance education technology in order to provide more learning opportunities for students. This paper describes the design of an interactive classroom environment called White Board. For ease of navigability and access to instructional material, the software is designed with multiple windows and tabs in the basic user interface. The design enables users to access all course data without having to navigate away from the homepage. Windows are updated individually to avoid refreshing the whole page when changing tabs or loading material. Principles of design, results and future directions are presented.
{"title":"Exploring Model-Based Design","authors":"Devon M. Simmonds, Mark Lanter, Lyle Scott, A. Young, Selin Benli, A. Herrmann","doi":"10.1109/ITNG.2012.156","DOIUrl":"https://doi.org/10.1109/ITNG.2012.156","url":null,"abstract":"Many universities are taking advantage of distance education technology in order to provide more learning opportunities for students. This paper describes the design of an interactive classroom environment called White Board. For ease of navigability and access to instructional material, the software is designed with multiple windows and tabs in the basic user interface. The design enables users to access all course data without having to navigate away from the homepage. Windows are updated individually to avoid refreshing the whole page when changing tabs or loading material. Principles of design, results and future directions are presented.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122166772","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Both legitimate users and attackers use web resources to realize their goals. These goals are either desired or malicious in terms of the role of the users. This paper presents a novel approach for testing web security by focusing on the web resources used/exploited by both legitimate users and attackers.
{"title":"Annotating Resources in Sequence Diagrams for Testing Web Security","authors":"Weifeng Xu, Lin Deng, Qing Zheng","doi":"10.1109/ITNG.2012.78","DOIUrl":"https://doi.org/10.1109/ITNG.2012.78","url":null,"abstract":"Both legitimate users and attackers use web resources to realize their goals. These goals are either desired or malicious in terms of the role of the users. This paper presents a novel approach for testing web security by focusing on the web resources used/exploited by both legitimate users and attackers.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"606 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116387449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Geographic routing based on greedy forwarding at node level and planar graph routing at overlay level is more efficient than both being performed at node level, especially when topology changes frequently. Overlay graphs based on geographic clusters constructed for wireless networks, modeled as 2D graphs, are generally nonplanar and planar graph routing applied on such overlay graphs may fail. Existing planarization algorithms create planar overlay graphs, when the network graphs obey assumptions like Unit Disk Graph (UDG) property. However, in real wireless networks due to radio range irregularities they fail to create connected planar graphs for connected network graphs. We propose a new planarization algorithm for overlay graphs based on the localized link removal and addition based planarization algorithm. Theoretical analysis shows that planarized graphs created by our algorithm are always planar and connected for connected UDG modeled networks. Evaluation of our algorithm on Log Normal Shadowing model, a realistic wireless model, shows that our algorithm creates connected networks in almost all simulations. Moreover, the probability of getting planar graphs is really high compared to the existing planarization algorithms.
特别是在拓扑结构频繁变化的情况下，节点级贪婪转发的地理路由和覆盖级平面图路由的效率都高于节点级。基于地理聚类为无线网络构建的覆盖图，建模为二维图，通常是非平面的，在这种覆盖图上应用平面图路由可能会失败。现有的平面化算法在网络图服从单位磁盘图(Unit Disk Graph, UDG)等属性的前提下，生成平面叠加图。然而，在实际的无线网络中，由于无线电范围的不规则性，它们不能为连通的网络图创建连通的平面图。提出了一种基于局部链路去除和加法的叠加图平面化算法。理论分析表明，对于连通的UDG模型网络，我们的算法生成的平面化图始终是平面且连通的。我们的算法在对数正态阴影模型(一个真实的无线模型)上的评估表明，我们的算法在几乎所有的模拟中都能创建连接网络。而且，与现有的平面化算法相比，得到平面图的概率非常高。
{"title":"Planarization of Geographic Cluster-based Overlay Graphs in Realistic Wireless Networks","authors":"Emi Mathews","doi":"10.1109/ITNG.2012.22","DOIUrl":"https://doi.org/10.1109/ITNG.2012.22","url":null,"abstract":"Geographic routing based on greedy forwarding at node level and planar graph routing at overlay level is more efficient than both being performed at node level, especially when topology changes frequently. Overlay graphs based on geographic clusters constructed for wireless networks, modeled as 2D graphs, are generally nonplanar and planar graph routing applied on such overlay graphs may fail. Existing planarization algorithms create planar overlay graphs, when the network graphs obey assumptions like Unit Disk Graph (UDG) property. However, in real wireless networks due to radio range irregularities they fail to create connected planar graphs for connected network graphs. We propose a new planarization algorithm for overlay graphs based on the localized link removal and addition based planarization algorithm. Theoretical analysis shows that planarized graphs created by our algorithm are always planar and connected for connected UDG modeled networks. Evaluation of our algorithm on Log Normal Shadowing model, a realistic wireless model, shows that our algorithm creates connected networks in almost all simulations. Moreover, the probability of getting planar graphs is really high compared to the existing planarization algorithms.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121416062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. Zulkernine, P. Bertoli, M. Pistore, A. Friesen, J. Lemcke, Bernhard Thimmel, O. Geisau
Business today is increasingly becoming service-driven. A service represents either a part of or a complete business process, which in turn depicts the life cycle of a Business Object (BO). A number of actions constrained by a set of business policies cause the BO to transit from an initial state to a final state during its life cycle. The constraints would vary for different customized business processes. To engineer reliable service based systems it is crucial to verify the reachability of the desired final states of the BO model against a given set of constraints. We propose the formal specification of a constraint-driven BO model, and thereby, present a verification tool to validate the life cycle of the BO model given a set of constraints. The core object and its constraint-driven life cycle are modeled separately for flexibility and customizability. We also define a language specification to represent our BO model and the business goals. The specification is automatically interpreted by our verification tool, which outputs a graphical view of the life cycle and a textual report of the validation results.
{"title":"A Constraint-Driven Business Object Model for Service-Based Business Processes","authors":"F. Zulkernine, P. Bertoli, M. Pistore, A. Friesen, J. Lemcke, Bernhard Thimmel, O. Geisau","doi":"10.1109/ITNG.2012.170","DOIUrl":"https://doi.org/10.1109/ITNG.2012.170","url":null,"abstract":"Business today is increasingly becoming service-driven. A service represents either a part of or a complete business process, which in turn depicts the life cycle of a Business Object (BO). A number of actions constrained by a set of business policies cause the BO to transit from an initial state to a final state during its life cycle. The constraints would vary for different customized business processes. To engineer reliable service based systems it is crucial to verify the reachability of the desired final states of the BO model against a given set of constraints. We propose the formal specification of a constraint-driven BO model, and thereby, present a verification tool to validate the life cycle of the BO model given a set of constraints. The core object and its constraint-driven life cycle are modeled separately for flexibility and customizability. We also define a language specification to represent our BO model and the business goals. The specification is automatically interpreted by our verification tool, which outputs a graphical view of the life cycle and a textual report of the validation results.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"55 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120920415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present a new method for localizing the position of the heart from Cine MRI images. This method depends on calculating the summation of the difference between images of a specific slice that we work on it, then applying thresholding on the resulting image to get the region of interest. To validate our method, we compare between our results and results of another method used in localizing the position of the heart which depends on the standard deviation. We worked on images of 14 different patients, come from STACOM database. We achieved by this method good results in determining the position of the heart. This method has different advantages like: it works on different contrast images, fast, and fully automatic.
{"title":"Region of Interest Localization of Cardiac Structure from Cine MRI Images","authors":"Marwa M. A. Hadhoud, M. Eladawy, A. Seddik","doi":"10.1109/ITNG.2012.10","DOIUrl":"https://doi.org/10.1109/ITNG.2012.10","url":null,"abstract":"In this paper, we present a new method for localizing the position of the heart from Cine MRI images. This method depends on calculating the summation of the difference between images of a specific slice that we work on it, then applying thresholding on the resulting image to get the region of interest. To validate our method, we compare between our results and results of another method used in localizing the position of the heart which depends on the standard deviation. We worked on images of 14 different patients, come from STACOM database. We achieved by this method good results in determining the position of the heart. This method has different advantages like: it works on different contrast images, fast, and fully automatic.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121367108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. M. Gonçalves, Rejane Pereira da Silva Gonçalves
This paper take a closer look at the aspects of the actual implementation, dissemination and use of social networks to obtain as a result of increased quality and improving service to customers of a Service Desk in a generic service desk of a hypothetical data center.
{"title":"Using Social Networks to Improve the Performance of a Service Desk","authors":"J. M. Gonçalves, Rejane Pereira da Silva Gonçalves","doi":"10.1109/ITNG.2012.74","DOIUrl":"https://doi.org/10.1109/ITNG.2012.74","url":null,"abstract":"This paper take a closer look at the aspects of the actual implementation, dissemination and use of social networks to obtain as a result of increased quality and improving service to customers of a Service Desk in a generic service desk of a hypothetical data center.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125668454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Vehicular ad-hoc network (VANET) is a technology for building a robust ad-hoc network between mobile vehicles as well as, between vehicles and roadside unit (RSU). Data communication on the roads is becoming further interesting, as the number of vehicles equipped with computing technologies and wireless communication devices increase. In this paper we study the vehicle - RSU communication. It is noticeable that vehicles request various data from RSU but however urgent requests should have higher priority to be served. Some vehicles may ask for the same data, if we can postpone some requested data and multicast it before the deadlines, several requests may be served through a single multicast. We propose a scheduling algorithm to download data from RSU using multicast technique in order to serve multiple requests, regarding the priority of data. Simulation result indicates that method the proposed method can provide desirable performance and higher quality of service.
{"title":"A Scheduling Algorithm for Downloading Data from RSU Using Multicast Technique","authors":"S. Sahebgharani, M. Shahverdy","doi":"10.1109/ITNG.2012.59","DOIUrl":"https://doi.org/10.1109/ITNG.2012.59","url":null,"abstract":"Vehicular ad-hoc network (VANET) is a technology for building a robust ad-hoc network between mobile vehicles as well as, between vehicles and roadside unit (RSU). Data communication on the roads is becoming further interesting, as the number of vehicles equipped with computing technologies and wireless communication devices increase. In this paper we study the vehicle - RSU communication. It is noticeable that vehicles request various data from RSU but however urgent requests should have higher priority to be served. Some vehicles may ask for the same data, if we can postpone some requested data and multicast it before the deadlines, several requests may be served through a single multicast. We propose a scheduling algorithm to download data from RSU using multicast technique in order to serve multiple requests, regarding the priority of data. Simulation result indicates that method the proposed method can provide desirable performance and higher quality of service.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126843144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This article examines the basic concepts and offers an analysis of the strengths and weaknesses of common XML watermarking methods. It presents a notational system to describe XML documents and its structures. Then, this notation is used to describe multi-valued dependencies in XML documents and its properties. These concepts are used to present a framework to watermark XML documents using multi-valued dependencies. It also offers suggestions on where future research would benefit in this area.
{"title":"Watermarking XML Structures Using Multi-valued Dependencies","authors":"J. U. Quevedo-Torrero, G. Erickson","doi":"10.1109/ITNG.2012.120","DOIUrl":"https://doi.org/10.1109/ITNG.2012.120","url":null,"abstract":"This article examines the basic concepts and offers an analysis of the strengths and weaknesses of common XML watermarking methods. It presents a notational system to describe XML documents and its structures. Then, this notation is used to describe multi-valued dependencies in XML documents and its properties. These concepts are used to present a framework to watermark XML documents using multi-valued dependencies. It also offers suggestions on where future research would benefit in this area.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126788039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：