In this paper we propose approach for special data post-processing, based on Recursive Spline Smoothing method, adapted to image reconstruction. The description of the special MATLAB program package is presented. Constructed algorithms and programs are applied to compound structures reconstruction. Necessity of reconstruction of compound structures appears in different applications. As a rule, tomography images are used for this purpose. However, obtained result usually contains significant visible noise. To eliminate such noise specific approach is applied for structures, which have piecewise constant characteristics with known values. It consists in Recursive Spline Smoothing and includes also projection of the pre-reconstructed data to the known set of values with respect to the absolute or relative criterion.
{"title":"Image Recovery by Recursive Spline Smoothing and Application to Recognition of Compound Structures","authors":"A. Grebénnikov","doi":"10.1109/ITNG.2012.12","DOIUrl":"https://doi.org/10.1109/ITNG.2012.12","url":null,"abstract":"In this paper we propose approach for special data post-processing, based on Recursive Spline Smoothing method, adapted to image reconstruction. The description of the special MATLAB program package is presented. Constructed algorithms and programs are applied to compound structures reconstruction. Necessity of reconstruction of compound structures appears in different applications. As a rule, tomography images are used for this purpose. However, obtained result usually contains significant visible noise. To eliminate such noise specific approach is applied for structures, which have piecewise constant characteristics with known values. It consists in Recursive Spline Smoothing and includes also projection of the pre-reconstructed data to the known set of values with respect to the absolute or relative criterion.","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":"128865989","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 deals with constructions of covering arrays which are extremely useful in software testing in order to guarantee 3-way coverage of parameter values, while trying to minimize the number of test cases. A practical limitation in the realm of testing is budget. In most software development environments, time, computing and human resources needed to perform the testing of a component is strictly limited. In order to deal with such situations, we consider the problem of creating the best possible test suite (covering the maximum number of 3-tuples) within a fixed number of test cases. This paper proposes a method of constructing strength three covering arrays with budget constraints.
{"title":"Software Testing with Budget Constraints","authors":"S. Maity","doi":"10.1109/ITNG.2012.44","DOIUrl":"https://doi.org/10.1109/ITNG.2012.44","url":null,"abstract":"This article deals with constructions of covering arrays which are extremely useful in software testing in order to guarantee 3-way coverage of parameter values, while trying to minimize the number of test cases. A practical limitation in the realm of testing is budget. In most software development environments, time, computing and human resources needed to perform the testing of a component is strictly limited. In order to deal with such situations, we consider the problem of creating the best possible test suite (covering the maximum number of 3-tuples) within a fixed number of test cases. This paper proposes a method of constructing strength three covering arrays with budget constraints.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"95 5 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":"127988505","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}
Valid diagnosis of Schizophrenia continues to be a difficult task. Diagnosis tools based on new developments in brain imaging are not yet a part of accepted Schizophrenia diagnosis criteria. This paper presents some of the challenges involved, some of the progress made, and an approach entitled Tract-Based Spacial Statistics (TBSS) which intends to avoid many of the issues of traditional voxel-based morphometry, region of interest, and tractography approaches to brain image analysis. A parallel machine architecture is also proposed to help meet the computational needs of Tract-Based Spacial Statistics.
{"title":"Brain Imaging for Diagnosis of Schizophrenia: Challenges, Successes and a Research Road Map","authors":"Jack O. Shelton, H. Arabnia","doi":"10.1109/ITNG.2012.125","DOIUrl":"https://doi.org/10.1109/ITNG.2012.125","url":null,"abstract":"Valid diagnosis of Schizophrenia continues to be a difficult task. Diagnosis tools based on new developments in brain imaging are not yet a part of accepted Schizophrenia diagnosis criteria. This paper presents some of the challenges involved, some of the progress made, and an approach entitled Tract-Based Spacial Statistics (TBSS) which intends to avoid many of the issues of traditional voxel-based morphometry, region of interest, and tractography approaches to brain image analysis. A parallel machine architecture is also proposed to help meet the computational needs of Tract-Based Spacial Statistics.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"109 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114025459","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}
We present a description of a virtual machine and byte code that have been designed around the goal of optimized execution on highly variable, heterogeneous hardware, instead of having goals such as small byte codes as was the objective of the Java Virtual Machine. The approach used here is to combine elements of the Dalvik virtual machine with concepts from the Open CL heterogeneous computing platform, along with an annotation system so that the results of complex compile time analysis can be available to the Just-In-Time compiler. We provide a flexible annotation format so that the set of annotations can be expanded as the field of heterogeneous computing continues to grow.
{"title":"Virtual Machine and Bytecode for Optimization on Heterogeneous Systems","authors":"Kerry A. Seitz, Mark C. Lewis","doi":"10.1109/ITNG.2012.116","DOIUrl":"https://doi.org/10.1109/ITNG.2012.116","url":null,"abstract":"We present a description of a virtual machine and byte code that have been designed around the goal of optimized execution on highly variable, heterogeneous hardware, instead of having goals such as small byte codes as was the objective of the Java Virtual Machine. The approach used here is to combine elements of the Dalvik virtual machine with concepts from the Open CL heterogeneous computing platform, along with an annotation system so that the results of complex compile time analysis can be available to the Just-In-Time compiler. We provide a flexible annotation format so that the set of annotations can be expanded as the field of heterogeneous computing continues to grow.","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":"129755805","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}
Using pre-processor directives is an important step in writing programs in languages that include C++ and Java. We examine the use of pre-processor directives with the goal of making a beginning programming language pedagogically effective. We propose a set of compiler directives that can be used in teaching a programming language similar to C++ so that student's programming productivity increases by discouraging them from using irrelevant/confusing constructs and error-prone syntax. The proposed directives are structured into three groups: (i) error-checks, (ii) debugging-aids, and (iii) file-merging directives.
{"title":"Useful Compiler Directives for Teaching Programming","authors":"J. Minor, L. Gewali","doi":"10.1109/ITNG.2012.128","DOIUrl":"https://doi.org/10.1109/ITNG.2012.128","url":null,"abstract":"Using pre-processor directives is an important step in writing programs in languages that include C++ and Java. We examine the use of pre-processor directives with the goal of making a beginning programming language pedagogically effective. We propose a set of compiler directives that can be used in teaching a programming language similar to C++ so that student's programming productivity increases by discouraging them from using irrelevant/confusing constructs and error-prone syntax. The proposed directives are structured into three groups: (i) error-checks, (ii) debugging-aids, and (iii) file-merging directives.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"38 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":"129838799","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}
Adverse drug reactions (ADRs) represent a serious worldwide problem. Current post-marketing ADR detection approaches largely rely on spontaneous reports filed by various healthcare professionals such as physicians, pharmacists et.al.. Underreporting is a serious deficiency of these methods - the actually reported adverse events represent less than 10% of all cases. Studies show that two important reasons that cause the underreporting are: 1) healthcare professionals are unaware of encountered ADRs, especially for those unusual ADRs, 2) they are too busy to voluntarily report ADRs since it takes a lot of time to fill out the reporting forms. This paper addresses these two issues by developing a high performance agent-based ADR reporting system. The system can 1) help healthcare professionals detect the causal relationship between a drug and an ADR by analyzing patients' electronic records, 2) make the reporting much easier by automatically linking the patients' electronic data with the reporting form.
{"title":"A High Performance Agent-Based System for Reporting Suspected Adverse Drug Reactions","authors":"Yanqing Ji, Fangyang Shen, John Tran","doi":"10.1109/ITNG.2012.111","DOIUrl":"https://doi.org/10.1109/ITNG.2012.111","url":null,"abstract":"Adverse drug reactions (ADRs) represent a serious worldwide problem. Current post-marketing ADR detection approaches largely rely on spontaneous reports filed by various healthcare professionals such as physicians, pharmacists et.al.. Underreporting is a serious deficiency of these methods - the actually reported adverse events represent less than 10% of all cases. Studies show that two important reasons that cause the underreporting are: 1) healthcare professionals are unaware of encountered ADRs, especially for those unusual ADRs, 2) they are too busy to voluntarily report ADRs since it takes a lot of time to fill out the reporting forms. This paper addresses these two issues by developing a high performance agent-based ADR reporting system. The system can 1) help healthcare professionals detect the causal relationship between a drug and an ADR by analyzing patients' electronic records, 2) make the reporting much easier by automatically linking the patients' electronic data with the reporting form.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"95 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":"126984109","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}
Enterprise Resource Planning (ERP) systems provide a unified solution for streamlining the operations and flow of information across multiple divisions of an organization. Most of the functionality in ERP systems is master-data driven, and hence the migration of data from legacy systems to ERP is a very important activity during development. Such data must be correctly migrated so that integration and acceptance testing of specific functionalities can be performed. However, the high complexity of ERP systems, coupled with the large volume of data involved, make ERP data conversion an immense challenge for software practitioners. In this paper we tackle the ERP data conversion problem using a test-first approach. The approach seeks to identify and correct data mapping errors and anomalies prior to initiating the data conversion process. Fixing such errors early can avoid having failures occur during data conversion, thereby resulting in cost and time savings. In an effort to further reduce the length of time spent converting large volumes of data, we perform parallel execution of the data conversion program. We have conducted an industrial case study that applies our approach to two ERP projects with favorable results.
{"title":"Applying Test-First and Parallel Processing Techniques to ERP Data Conversion","authors":"Talukdar S. Asgar, Mohammed Akour, Tariq M. King","doi":"10.1109/ITNG.2012.46","DOIUrl":"https://doi.org/10.1109/ITNG.2012.46","url":null,"abstract":"Enterprise Resource Planning (ERP) systems provide a unified solution for streamlining the operations and flow of information across multiple divisions of an organization. Most of the functionality in ERP systems is master-data driven, and hence the migration of data from legacy systems to ERP is a very important activity during development. Such data must be correctly migrated so that integration and acceptance testing of specific functionalities can be performed. However, the high complexity of ERP systems, coupled with the large volume of data involved, make ERP data conversion an immense challenge for software practitioners. In this paper we tackle the ERP data conversion problem using a test-first approach. The approach seeks to identify and correct data mapping errors and anomalies prior to initiating the data conversion process. Fixing such errors early can avoid having failures occur during data conversion, thereby resulting in cost and time savings. In an effort to further reduce the length of time spent converting large volumes of data, we perform parallel execution of the data conversion program. We have conducted an industrial case study that applies our approach to two ERP projects with favorable results.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"19 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":"121321313","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}
Video games, from the very beginning, were made as cartoon images that represented the type of fantasy people wished to be in. Whether the genre was a First Person Shooter or a Role Playing Game, gamers around the world could use their minds to become involved in the situation. With the ever-growing trend in technology, people are able to communicate with fellow gamers from around the world. The reality is that video games and computer gaming of the future would literally blow us all away. They would be so real and so robust that one would be hooked up to them all day. A game in the future would set us up as a perpetual winner, conquer all our fears, challenge us to go beyond anything we've ever dreamed of. That is the future of video games. But in order to achieve these innovations in video games, gaming technology should advance rapidly in the next few years to cache on gamers' interests. In this paper, I have discussed few of those futuristic ideas that would help advance the gaming world.
{"title":"Innovations in Art and Production: Sound, Modeling and Animation","authors":"V. Janarthanan","doi":"10.1109/ITNG.2012.80","DOIUrl":"https://doi.org/10.1109/ITNG.2012.80","url":null,"abstract":"Video games, from the very beginning, were made as cartoon images that represented the type of fantasy people wished to be in. Whether the genre was a First Person Shooter or a Role Playing Game, gamers around the world could use their minds to become involved in the situation. With the ever-growing trend in technology, people are able to communicate with fellow gamers from around the world. The reality is that video games and computer gaming of the future would literally blow us all away. They would be so real and so robust that one would be hooked up to them all day. A game in the future would set us up as a perpetual winner, conquer all our fears, challenge us to go beyond anything we've ever dreamed of. That is the future of video games. But in order to achieve these innovations in video games, gaming technology should advance rapidly in the next few years to cache on gamers' interests. In this paper, I have discussed few of those futuristic ideas that would help advance the gaming world.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"39 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":"129370043","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}
Hard drive storage has been made cheaper, faster and larger. Disk storage technology in general has seen incredible advances including reduction in size, an increase in real density, and an increase in internal data rates, but the future of hard disk technology is uncertain. Biological cells are amazing machines. Cells store DNA, the information that is used to create life, and manufacture proteins. This paper proposes using a biological cell as a computer storage device much like a hard drive stores user data today.
{"title":"Biological Cells as Storage Devices","authors":"Ralph DeFrangesco","doi":"10.1109/ITNG.2012.154","DOIUrl":"https://doi.org/10.1109/ITNG.2012.154","url":null,"abstract":"Hard drive storage has been made cheaper, faster and larger. Disk storage technology in general has seen incredible advances including reduction in size, an increase in real density, and an increase in internal data rates, but the future of hard disk technology is uncertain. Biological cells are amazing machines. Cells store DNA, the information that is used to create life, and manufacture proteins. This paper proposes using a biological cell as a computer storage device much like a hard drive stores user data today.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"45 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":"116408403","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 an intrusion detection system which exploits pattern recognition techniques to model the usage patterns of authenticated users and uses it to detect intrusions in wireless networks. The key idea behind the proposed intrusion detection system is the identification of discriminative features from users activity data and use them to identify intrusions in wireless networks. The detection module uses PCA technique to accumulate interested statistical variables and compares them with the thresholds derived from users activities data. When the variables exceed the estimated thresholds, an alarm is raised to alert about a possible intrusion in the network. The novelty of the proposed system lies in its light-weight design which requires less processing and memory resources and it can be used in real-time environment.
{"title":"An Activity Pattern Based Wireless Intrusion Detection System","authors":"Nur Al Hasan Haldar, M. Abulaish, Syed Asim Pasha","doi":"10.1109/ITNG.2012.68","DOIUrl":"https://doi.org/10.1109/ITNG.2012.68","url":null,"abstract":"In this paper, we present an intrusion detection system which exploits pattern recognition techniques to model the usage patterns of authenticated users and uses it to detect intrusions in wireless networks. The key idea behind the proposed intrusion detection system is the identification of discriminative features from users activity data and use them to identify intrusions in wireless networks. The detection module uses PCA technique to accumulate interested statistical variables and compares them with the thresholds derived from users activities data. When the variables exceed the estimated thresholds, an alarm is raised to alert about a possible intrusion in the network. The novelty of the proposed system lies in its light-weight design which requires less processing and memory resources and it can be used in real-time environment.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"28 3 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":"126207884","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
扫码关注我们
求助内容：
应助结果提醒方式：