2012 Ninth International Conference on Information Technology - New Generations最新文献

筛选
英文 中文
Using Reverse-Engineered Test-Based Models to Generate More Tests: Where is the Sense in That? 使用基于逆向工程测试的模型生成更多测试:其中的意义在哪里?
T. Kanstrén, Éric Piel, H. Groß
{"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}
引用次数: 0
A Constraint-Driven Business Object Model for Service-Based Business Processes 基于服务的业务流程的约束驱动业务对象模型
F. Zulkernine, P. Bertoli, M. Pistore, A. Friesen, J. Lemcke, Bernhard Thimmel, O. Geisau
{"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}
引用次数: 2
Region of Interest Localization of Cardiac Structure from Cine MRI Images 基于MRI影像的心脏结构感兴趣区域定位
Marwa M. A. Hadhoud, M. Eladawy, A. Seddik
{"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}
引用次数: 3
Annotating Resources in Sequence Diagrams for Testing Web Security 在序列图中标注资源用于测试Web安全性
Weifeng Xu, Lin Deng, Qing Zheng
{"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}
引用次数: 2
Design of a FPGA-based Timing Sharing Architecture for Sound Rendering Applications 基于fpga的声音渲染时序共享架构设计
Tan Yiyu, Y. Inoguchi, Yukinori Sato, Y. Iwaya, Hiroshi Matsuoka, M. Otani, T. Tsuchiya
{"title":"Design of a FPGA-based Timing Sharing Architecture for Sound Rendering Applications","authors":"Tan Yiyu, Y. Inoguchi, Yukinori Sato, Y. Iwaya, Hiroshi Matsuoka, M. Otani, T. Tsuchiya","doi":"10.1109/ITNG.2012.110","DOIUrl":"https://doi.org/10.1109/ITNG.2012.110","url":null,"abstract":"Sound rendering applications are data-intensive and memory-intensive as a sound space increases. To speed up computation and extend the simulated area, a sound rendering system based on the two-dimensional Digital Huygens Model (DHM) with timing sharing architecture is designed and implemented by a Field Programmable Gate Array (FPGA) chip XC5VLX330T. Compared with the DHM system with the traditional parallel architecture, the proposed system implemented by a FPGA chip extends about 20 times in simulated area, and speeds up 1.47 times against the software simulation carried out in a computer with an AMD Phenom 9500 Quad-core processor (2.2 GHz) and 4GB RAM. The system is relatively easy to cascade many FPGA chips to work in parallel in real applications.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"1 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":"121128858","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}
引用次数: 3
Planarization of Geographic Cluster-based Overlay Graphs in Realistic Wireless Networks 现实无线网络中基于地理聚类的覆盖图平面化
Emi Mathews
{"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}
引用次数: 4
Excessive Use of the Internet and Gender: The Case for University Students in Jordan 网络过度使用与性别:约旦大学生案例
Y. Eyadat
{"title":"Excessive Use of the Internet and Gender: The Case for University Students in Jordan","authors":"Y. Eyadat","doi":"10.1109/ITNG.2012.83","DOIUrl":"https://doi.org/10.1109/ITNG.2012.83","url":null,"abstract":"The primary purpose of this study was to determine the level of internet use as it varies by gender among university students in Jordan. A random sample of 278 students from one university located in the Northern part of Jordan responded to a valid and reliable instrument developed by the researcher. Results of the study indicated that university students under study experienced excessive use of the internet as indicated by the overall mean value and the results indicated that the university students under excessive use of the internet neglect household responsibilities and neglect exams and courses to spend more time online. Results also indicated that there were no significant differences in the excessive use of the internet based on differences in gender. The study ended by offering a number of recommendations for the field of study.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"71 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":"127383499","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}
引用次数: 0
Performance Evaluation of a Countering Method to Social Bookmarking Pollution Based on Degree of Bookmark Similarity 基于书签相似度的社会书签污染防治方法性能评价
H. Hisamatsu, T. Hatanaka
{"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}
引用次数: 0
A Computational Teaching Approach through the Use of a Narrative Technique and a Comic Strip 运用叙事技巧和连环画的计算教学方法
Mario Masayuki Takeda, F. S. Marcondes, Í. S. Vega, Elizabete Briani Macedo Gara, Luciano Gaspar
{"title":"A Computational Teaching Approach through the Use of a Narrative Technique and a Comic Strip","authors":"Mario Masayuki Takeda, F. S. Marcondes, Í. S. Vega, Elizabete Briani Macedo Gara, Luciano Gaspar","doi":"10.1109/ITNG.2012.104","DOIUrl":"https://doi.org/10.1109/ITNG.2012.104","url":null,"abstract":"This article presents a computational teaching approach through the use of OCC-RDD narrative technique for the elaboration of a comic strip. Our aim is to achieve level 1 (Knowledge) of the cognitive dimension of Bloom's Taxonomy. An illustration of the use of such technique is presented along this article. Starting from a sequence of scenes, a comic strip was elaborated in order to teach concepts of software modeling.","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":"130692063","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}
引用次数: 7
Software Security: The Dangerous Afterthought 软件安全:危险的事后考虑
C. Steward, Luay A. Wahsheh, Aftab Ahmad, J. Graham, Cheryl V. Hinds, Aurelia T. Williams, S. J. DeLoatch
{"title":"Software Security: The Dangerous Afterthought","authors":"C. Steward, Luay A. Wahsheh, Aftab Ahmad, J. Graham, Cheryl V. Hinds, Aurelia T. Williams, S. J. DeLoatch","doi":"10.1109/ITNG.2012.60","DOIUrl":"https://doi.org/10.1109/ITNG.2012.60","url":null,"abstract":"As users of many different types of software, one of the last things we think about when deciding which is best for the task at hand is the security of the software. This of course depends on the type of software as well. If it is banking or tax software then, security is of concern. However, in most cases the thought rarely crosses the average users mind. That is until something happens to the system or information the system may hold. This way of thinking is very similar to the way some software is created. The software's features, usability, and interface are normally at the forefront. On the other hand the software's security is just an afterthought for many developers. While software is developed in a very intricate process, it does not currently stress security. In this paper, we will describe different approaches that have been recently researched to help create more secure software. Although these approaches will be introduced separately, using a combination of two or all three together would be the most secure combination.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"137 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":"130876317","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}
引用次数: 7
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信