The quantum algorithm by Harrow, Hassidim, and Lloyd solves a system of N linear equations and achieves exponential speedup over classical algorithms under certain conditions. The advantage to the algorithm is that log(N) rather than N registers are required. Given an N x N matrix A and vectors x and b, the quantum algorithm seeks to find x such that Ax = b. By representing vector b as a superposition of quantum states |b>, quantum phase estimation is used to find the corresponding eigenvalues of A. Applying the inverse Fourier transform, we solve for |x> such that |x> = A-1|b>. We model the algorithm using a quantum circuit diagram, with data qubits encoded using the Steane code for fault tolerant quantum phase estimation. Fresh ancilla for error correction are provided using an oracular pipelined ancilla architecture. We then analyze the classical and quantum resources needed for implementation. The significance of this case study is to examine how classical and quantum resources interact in implementing this algorithm. The issues raised in this analysis, such as fault tolerant phase estimation using pipelined ancilla, garbage collection, and the preparation of I/O registers to this architecture, will be explored in more detail in future research.
Harrow, Hassidim和Lloyd的量子算法解决了N个线性方程组，并在一定条件下实现了比经典算法指数级的加速。该算法的优点是需要log(N)而不是N个寄存器。给定一个N x N矩阵A和向量x和b，量子算法寻求找到x使Ax = b。通过将向量b表示为量子态的叠加|b>，量子相位估计用于找到A的相应特征值。应用傅里叶反变换，我们求解出|x>使得|x> = A-1|b>。我们使用量子电路图对算法进行建模，数据量子比特使用Steane编码进行容错量子相位估计。使用神谕式流水线辅助结构提供用于纠错的新辅助。然后我们分析了实现所需的经典资源和量子资源。本案例研究的意义在于研究经典资源和量子资源在实现该算法时如何相互作用。本分析中提出的问题，如使用流水线辅助设备进行容错阶段估计、垃圾收集和为该体系结构准备I/O寄存器，将在未来的研究中进行更详细的探讨。
{"title":"Analysis of Classical and Quantum Resources for the Quantum Linear Systems Algorithm","authors":"Jon Inouye","doi":"10.1109/ITNG.2013.117","DOIUrl":"https://doi.org/10.1109/ITNG.2013.117","url":null,"abstract":"The quantum algorithm by Harrow, Hassidim, and Lloyd solves a system of N linear equations and achieves exponential speedup over classical algorithms under certain conditions. The advantage to the algorithm is that log(N) rather than N registers are required. Given an N x N matrix A and vectors x and b, the quantum algorithm seeks to find x such that Ax = b. By representing vector b as a superposition of quantum states |b>, quantum phase estimation is used to find the corresponding eigenvalues of A. Applying the inverse Fourier transform, we solve for |x> such that |x> = A-1|b>. We model the algorithm using a quantum circuit diagram, with data qubits encoded using the Steane code for fault tolerant quantum phase estimation. Fresh ancilla for error correction are provided using an oracular pipelined ancilla architecture. We then analyze the classical and quantum resources needed for implementation. The significance of this case study is to examine how classical and quantum resources interact in implementing this algorithm. The issues raised in this analysis, such as fault tolerant phase estimation using pipelined ancilla, garbage collection, and the preparation of I/O registers to this architecture, will be explored in more detail in future research.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125412288","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 work described in this paper applies machine learning techniques, to a database of accommodative esotropic patients. Accommodative esotropia is an eye disease that when left untreated leads to blindness. Patients whose muscles deteriorate most often need corrective surgery in order to prevent this, since less invasive methods of treatment tend to fail in these patients. It is often difficult for physicians to determine apriori which patients will deteriorate enough to require surgery. Using a learn and prune methodology, decision tree analysis of accommodative esotropic patients led to the discovery of two conjunctive variables that predicted deterioration. The use of these variables produced better predictions, and gave insight to domain experts.
{"title":"An Ophthalmologist's Tool for Predicting Deterioration in Patients with Accommodative Esotropia","authors":"Susan P. Imberman, Sarah Zelikovitz, Irene Ludwig","doi":"10.1109/ITNG.2013.114","DOIUrl":"https://doi.org/10.1109/ITNG.2013.114","url":null,"abstract":"The work described in this paper applies machine learning techniques, to a database of accommodative esotropic patients. Accommodative esotropia is an eye disease that when left untreated leads to blindness. Patients whose muscles deteriorate most often need corrective surgery in order to prevent this, since less invasive methods of treatment tend to fail in these patients. It is often difficult for physicians to determine apriori which patients will deteriorate enough to require surgery. Using a learn and prune methodology, decision tree analysis of accommodative esotropic patients led to the discovery of two conjunctive variables that predicted deterioration. The use of these variables produced better predictions, and gave insight to domain experts.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125894689","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}
Nowadays e-commerce is being substituted by m-commerce with the strong push from smart phone. Android phone, iPhone, BlackBerry and Windows Phone are typical smart phone models. According to comScore [1] Android takes more than 50% and iPhones takes more than 31% of smart phone market share in US in 2012. This research paper focuses on Anti-Virus strategies on Android platform because it is the most popular smart phone platform, it is an open-source environment, and it has more applications than Apple Store. The anti-virus strategies will be introduced in two categories with three samples: static analysis and dynamic analysis. Detail descriptions about Stowaway, AASandbox and Droidbox are provided. The analyses of their advantages/disadvantages are followed. The research paper is focused to develop an outline of Android anti-virus strategies to individuals, government agencies and private sectors that are interested in and help you to decide which anti-virus application to choose.
{"title":"Investigation of Static and Dynamic Android Anti-virus Strategies","authors":"Yan Ma, M. Sharbaf","doi":"10.1109/ITNG.2013.62","DOIUrl":"https://doi.org/10.1109/ITNG.2013.62","url":null,"abstract":"Nowadays e-commerce is being substituted by m-commerce with the strong push from smart phone. Android phone, iPhone, BlackBerry and Windows Phone are typical smart phone models. According to comScore [1] Android takes more than 50% and iPhones takes more than 31% of smart phone market share in US in 2012. This research paper focuses on Anti-Virus strategies on Android platform because it is the most popular smart phone platform, it is an open-source environment, and it has more applications than Apple Store. The anti-virus strategies will be introduced in two categories with three samples: static analysis and dynamic analysis. Detail descriptions about Stowaway, AASandbox and Droidbox are provided. The analyses of their advantages/disadvantages are followed. The research paper is focused to develop an outline of Android anti-virus strategies to individuals, government agencies and private sectors that are interested in and help you to decide which anti-virus application to choose.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125930439","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 high-level contribution of this paper is the design of a benchmarking algorithm to determine a sequence of the longest-living stable data gathering trees for wireless mobile sensor networks (MSNs) such that the number of tree discoveries is the theoretical global minimum. Referred to as the Max. Stability-DG algorithm, the algorithm assumes the availability of the complete knowledge of future topology changes, and operates according to a greedy strategy: Whenever a new data gathering tree is needed at time instant t, determine a spanning tree that will exist for the longest time since t and derive a data gathering tree by conducting a Breadth First Search on the spanning tree. We prove the correctness of the Max. Stability-DG algorithm that it indeed determines the sequence of longest living stable data gathering trees. Since the Max. Stability-DG trees are based on spanning trees covering the entire network of live sensor nodes, the average lifetime and the number of tree discoveries incurred for the Max. Stability-DG trees will serve respectively as the upper bound and lower bound for any network-wide communication topology determined using any other algorithm for mobile sensor networks.
{"title":"A Benchmarking Algorithm to Determine Maximum Stability Data Gathering Trees for Wireless Mobile Sensor Networks","authors":"N. Meghanathan, Philip Mumford","doi":"10.1109/ITNG.2013.83","DOIUrl":"https://doi.org/10.1109/ITNG.2013.83","url":null,"abstract":"The high-level contribution of this paper is the design of a benchmarking algorithm to determine a sequence of the longest-living stable data gathering trees for wireless mobile sensor networks (MSNs) such that the number of tree discoveries is the theoretical global minimum. Referred to as the Max. Stability-DG algorithm, the algorithm assumes the availability of the complete knowledge of future topology changes, and operates according to a greedy strategy: Whenever a new data gathering tree is needed at time instant t, determine a spanning tree that will exist for the longest time since t and derive a data gathering tree by conducting a Breadth First Search on the spanning tree. We prove the correctness of the Max. Stability-DG algorithm that it indeed determines the sequence of longest living stable data gathering trees. Since the Max. Stability-DG trees are based on spanning trees covering the entire network of live sensor nodes, the average lifetime and the number of tree discoveries incurred for the Max. Stability-DG trees will serve respectively as the upper bound and lower bound for any network-wide communication topology determined using any other algorithm for mobile sensor networks.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130094329","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}
Software testing is considered one of the most expensive and critical phases of the software development. Formal testing approaches are extensively used for verifying the conformance of implementations to a given specification. These formal approaches usually generate a large amount of input test data which is costly in terms of time and effort. Techniques for reducing test input data are thus of the utmost importance. The contribution of this paper is to propose a framework for the reduction of test input data generated by a formal testing approach based on X-Machines. To achieve these objectives we have applied a well known statistical approach called Random Cluster Sampling on the test case set generated by a formal approach X-Machines. To exemplify our technique we have generated a test set for an X-Machine Microwave oven specification and then drew a sample from the test set by using the Random Cluster sampling technique. Based on the tolerated fault rate we have extracted conclusion about the accuracy of implementation.
{"title":"Random Cluster Sampling on X-Machines Test Cases","authors":"Yasir Imtiaz Khan, Sadia Kausar","doi":"10.1109/ITNG.2013.50","DOIUrl":"https://doi.org/10.1109/ITNG.2013.50","url":null,"abstract":"Software testing is considered one of the most expensive and critical phases of the software development. Formal testing approaches are extensively used for verifying the conformance of implementations to a given specification. These formal approaches usually generate a large amount of input test data which is costly in terms of time and effort. Techniques for reducing test input data are thus of the utmost importance. The contribution of this paper is to propose a framework for the reduction of test input data generated by a formal testing approach based on X-Machines. To achieve these objectives we have applied a well known statistical approach called Random Cluster Sampling on the test case set generated by a formal approach X-Machines. To exemplify our technique we have generated a test set for an X-Machine Microwave oven specification and then drew a sample from the test set by using the Random Cluster sampling technique. Based on the tolerated fault rate we have extracted conclusion about the accuracy of implementation.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115937573","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}
According to current views, object-oriented analysis and design focus mostly on system functionality, resulting in difficulties in maintenance and contradictions of the main principles of object orientation. Aspect-oriented software development proposes early specification of nonfunctional requirements. Many works have integrated an aspect-oriented approach into object-oriented modeling, for example, interdependent concern behavior is modeled using extended UML2 activity models. Without loss of generality, we suggest utilizing a new flow-based approach for describing a conceptual integrated picture, using an extended activity digram as a sample case to illustrate our proposed methodology.
{"title":"Alternative Representation of Aspects","authors":"S. Al-Fedaghi","doi":"10.1109/ITNG.2013.45","DOIUrl":"https://doi.org/10.1109/ITNG.2013.45","url":null,"abstract":"According to current views, object-oriented analysis and design focus mostly on system functionality, resulting in difficulties in maintenance and contradictions of the main principles of object orientation. Aspect-oriented software development proposes early specification of nonfunctional requirements. Many works have integrated an aspect-oriented approach into object-oriented modeling, for example, interdependent concern behavior is modeled using extended UML2 activity models. Without loss of generality, we suggest utilizing a new flow-based approach for describing a conceptual integrated picture, using an extended activity digram as a sample case to illustrate our proposed methodology.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"32 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120986227","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}
Intrusion detection system generates significant data about malicious activities run against network. Generated data by IDS are stored in IDS database. This data represent attacks scenarios history against network. Main goal of IDS system is to enhance network defense technologies. Other techniques are also used to enhance the defense of network such as Attack graph. Network attack graph are used for many goals such as attacker next attack step prediction. In this paper we propose a real time prediction methodology for predicting most possible attack steps and attack scenarios. Proposed methodology benefits from attacks history against network and from attack graph source data. it comes without considerable computation overload such as checking of attack plans library. It provides parallel prediction for parallel attack scenarios.
{"title":"Attack Scenario Prediction Methodology","authors":"Seraj Fayyad, C. Meinel","doi":"10.1109/ITNG.2013.16","DOIUrl":"https://doi.org/10.1109/ITNG.2013.16","url":null,"abstract":"Intrusion detection system generates significant data about malicious activities run against network. Generated data by IDS are stored in IDS database. This data represent attacks scenarios history against network. Main goal of IDS system is to enhance network defense technologies. Other techniques are also used to enhance the defense of network such as Attack graph. Network attack graph are used for many goals such as attacker next attack step prediction. In this paper we propose a real time prediction methodology for predicting most possible attack steps and attack scenarios. Proposed methodology benefits from attacks history against network and from attack graph source data. it comes without considerable computation overload such as checking of attack plans library. It provides parallel prediction for parallel attack scenarios.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121363218","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 design and description of a software testing tool utilizing the boundary value analysis is presented. The tool initially generates the test cases using the specifications of three selected functions and then automatically executes the test cases on these functions to evaluate correctness. The proposed tool uses the implementations of the triangle, next date and commission functions for the correctness evaluation. The potential application of the tool is also outlined.
{"title":"A Boundary Value Analysis Tool - Design and Description","authors":"N. Debnath, Adam Kruger, M. Alexander","doi":"10.1109/ITNG.2013.20","DOIUrl":"https://doi.org/10.1109/ITNG.2013.20","url":null,"abstract":"The design and description of a software testing tool utilizing the boundary value analysis is presented. The tool initially generates the test cases using the specifications of three selected functions and then automatically executes the test cases on these functions to evaluate correctness. The proposed tool uses the implementations of the triangle, next date and commission functions for the correctness evaluation. The potential application of the tool is also outlined.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128212850","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 networking is increasingly attracting the attention and interest of academics and researchers in the US and Europe. However, there is little research done outside these areas, especially in the Middle East and Arab countries. This paper aims to assess the perception and use of social networking sites (SNS) among university students in the state of Kuwait, and study their positive and negative impacts. The results showed a heavy use of Twitter and Facebook among university students who were viewing their sites more frequently than posting. The most positive impacts were better relation with family and friends and more involvement in social, political and cultural activities. Neglecting study/work and the time consumed are the two major drawbacks. The findings showed some lack of experience with social networking beyond entertainment, which confirms the need to educate students on the benefits of SNS and the quality of information found on these sites. Privacy issues should also be raised since the majority of students (70%) had uncontrolled accounts.
{"title":"Perception and Use of Social Networking Sites among Undergraduate Students in Kuwait","authors":"Samir N. Hamade","doi":"10.1109/ITNG.2013.67","DOIUrl":"https://doi.org/10.1109/ITNG.2013.67","url":null,"abstract":"Social networking is increasingly attracting the attention and interest of academics and researchers in the US and Europe. However, there is little research done outside these areas, especially in the Middle East and Arab countries. This paper aims to assess the perception and use of social networking sites (SNS) among university students in the state of Kuwait, and study their positive and negative impacts. The results showed a heavy use of Twitter and Facebook among university students who were viewing their sites more frequently than posting. The most positive impacts were better relation with family and friends and more involvement in social, political and cultural activities. Neglecting study/work and the time consumed are the two major drawbacks. The findings showed some lack of experience with social networking beyond entertainment, which confirms the need to educate students on the benefits of SNS and the quality of information found on these sites. Privacy issues should also be raised since the majority of students (70%) had uncontrolled accounts.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128496753","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}
Appropriate techniques for the development of application ontologies are needed and GAODT ("Goal-Oriented Application Ontology Development Technique") technique described in this article contributes to this purpose. GAODT translates the goals and facts in natural language expressing the requirements of a knowledge-based system into rules and facts in first-order logic. Next, this knowledge base is mapped to an application ontology. GAODT was evaluated through the development of a case study on the construction of the application ontology of a knowledge-based system for the domain of Intestate Succession. A software tool to support the application of GAODT was also developed.
{"title":"A Case Study on the Construction of Application Ontologies","authors":"Luis Eduardo Santos, R. Girardi, P. Novais","doi":"10.1109/ITNG.2013.95","DOIUrl":"https://doi.org/10.1109/ITNG.2013.95","url":null,"abstract":"Appropriate techniques for the development of application ontologies are needed and GAODT (\"Goal-Oriented Application Ontology Development Technique\") technique described in this article contributes to this purpose. GAODT translates the goals and facts in natural language expressing the requirements of a knowledge-based system into rules and facts in first-order logic. Next, this knowledge base is mapped to an application ontology. GAODT was evaluated through the development of a case study on the construction of the application ontology of a knowledge-based system for the domain of Intestate Succession. A software tool to support the application of GAODT was also developed.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"129 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134239324","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
扫码关注我们
求助内容：
应助结果提醒方式：