In this paper we empirically investigate the impact of an idle limit on a distributed system. A series of experiments was conducted to examine the effect of introducing an idle limit into the power management system for a cluster. The experiments tested the total power consumption of the cluster, as well as the number of times the nodes were cycled between power states. The idle limit was not proven to have an impact on the total power consumption, however, it was shown to have an impact on the number of power transitions. In some cases the addition of the idle limit was able to reduce the number of power transitions by 80%.
{"title":"An Empirical Study on the Impact of an Idle Limit in Distributed Systems","authors":"Karl Smith, Jeffrey M. Galloway, Susan V. Vrbsky","doi":"10.1109/ITNG.2012.162","DOIUrl":"https://doi.org/10.1109/ITNG.2012.162","url":null,"abstract":"In this paper we empirically investigate the impact of an idle limit on a distributed system. A series of experiments was conducted to examine the effect of introducing an idle limit into the power management system for a cluster. The experiments tested the total power consumption of the cluster, as well as the number of times the nodes were cycled between power states. The idle limit was not proven to have an impact on the total power consumption, however, it was shown to have an impact on the number of power transitions. In some cases the addition of the idle limit was able to reduce the number of power transitions by 80%.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"35 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":"134421958","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}
In this paper we present a large scale longitudinal analysis of the ASN network particularly studying evolution of its size, degree distribution and clustering. The analyzed ASN snapshot encompasses information collected and from a variety of sources over the course of five years. The study reveals several interesting trends about the evolutionary state of the ASN.
{"title":"A Large Scale Evolutionary Analysis of the Internet Autonomous System Network","authors":"Craig Stewart, J. Khan","doi":"10.1109/ITNG.2012.25","DOIUrl":"https://doi.org/10.1109/ITNG.2012.25","url":null,"abstract":"In this paper we present a large scale longitudinal analysis of the ASN network particularly studying evolution of its size, degree distribution and clustering. The analyzed ASN snapshot encompasses information collected and from a variety of sources over the course of five years. The study reveals several interesting trends about the evolutionary state of the ASN.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"60 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":"123517516","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}
As today's students become savvy users of Internet technologies, educators are taking this opportunity to motivate learning and foster engagement through the use of Web 2.0 software such as classroom blogs. This study explores the reasons and benefits behind moving classroom logs to valuable public, proposes a SEO-friendly design approach that focus on five aspects. The study demonstrate show to design and implement a SEO-friendly classroom blog for higher education through a case study.
{"title":"Can You See Me Now? Design SEO-friendly Classroom Blogs for Reaching Valuable Public","authors":"Xuesong Zhang","doi":"10.1109/ITNG.2012.71","DOIUrl":"https://doi.org/10.1109/ITNG.2012.71","url":null,"abstract":"As today's students become savvy users of Internet technologies, educators are taking this opportunity to motivate learning and foster engagement through the use of Web 2.0 software such as classroom blogs. This study explores the reasons and benefits behind moving classroom logs to valuable public, proposes a SEO-friendly design approach that focus on five aspects. The study demonstrate show to design and implement a SEO-friendly classroom blog for higher education through a case study.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"77 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":"121604624","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}
The paper presents three new algorithms for multiple string pattern matching using hashing tables: a suffix search (SS), a suffix-prefix search (SPS), and a suffix-middle-prefix search (SMPS). It takes O(|P|) time and space preprocessing where |P| is the sum of all pattern lengths. They search for a fixed-length pattern m in a text with length |t| takes O(|t| |P|) in the worst case, O(|t|) in an average case, and O(|t|/m) in the best case. Furthermore, their attempting times are less than of traditional algorithms.
{"title":"New Hashing-Based Multiple String Pattern Matching Algorithms","authors":"Chouvalit Khancome, V. Boonjing","doi":"10.1109/ITNG.2012.34","DOIUrl":"https://doi.org/10.1109/ITNG.2012.34","url":null,"abstract":"The paper presents three new algorithms for multiple string pattern matching using hashing tables: a suffix search (SS), a suffix-prefix search (SPS), and a suffix-middle-prefix search (SMPS). It takes O(|P|) time and space preprocessing where |P| is the sum of all pattern lengths. They search for a fixed-length pattern m in a text with length |t| takes O(|t| |P|) in the worst case, O(|t|) in an average case, and O(|t|/m) in the best case. Furthermore, their attempting times are less than of traditional algorithms.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"33 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":"129892794","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 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}
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}
Vehicle-to-grid research explores the possibility of centrally coordinating the charging behaviour of electric-drive vehicles and of employing such vehicles as a distributed grid resource. As such, they could be used both to improve the power grid's reliability and to store excess renewable energy. The information observable by the central coordination instance, however, can be a threat to the privacy of vehicle owners. In this work, we investigate when the observed information allows for vehicles to be distinguished and traced between stops and when not so that vehicles will mix with each other. Specifically, we analyse the role of battery information and reveal how it can influence vehicle mixing. Furthermore, we consider information minimisation, suppression, and generalisation and discuss their effects both on vehicle mixing and on service functionality. Lastly, we show that parking lots and garages naturally provide the conditions necessary for vehicle mixing and give an evaluation of mixing for this context.
{"title":"Location Privacy for Vehicle-to-Grid Interaction through Battery Management","authors":"Mark Stegelmann, D. Kesdogan","doi":"10.1109/ITNG.2012.93","DOIUrl":"https://doi.org/10.1109/ITNG.2012.93","url":null,"abstract":"Vehicle-to-grid research explores the possibility of centrally coordinating the charging behaviour of electric-drive vehicles and of employing such vehicles as a distributed grid resource. As such, they could be used both to improve the power grid's reliability and to store excess renewable energy. The information observable by the central coordination instance, however, can be a threat to the privacy of vehicle owners. In this work, we investigate when the observed information allows for vehicles to be distinguished and traced between stops and when not so that vehicles will mix with each other. Specifically, we analyse the role of battery information and reveal how it can influence vehicle mixing. Furthermore, we consider information minimisation, suppression, and generalisation and discuss their effects both on vehicle mixing and on service functionality. Lastly, we show that parking lots and garages naturally provide the conditions necessary for vehicle mixing and give an evaluation of mixing for this context.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"134 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":"122390672","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
扫码关注我们
求助内容：
应助结果提醒方式：