This paper has proposed novel aspect algebra for Graph -- semantic based Aspect Model called GAM. The GAM provides formal representation of Aspect Oriented System (AOS) concepts like join points, advices, Point Cut etc. using graph based semantics. On the other hand, the proposed algebra is comprised of set of operators defined on conceptual semantics of AOS. Those operators are used to conceptualize the different operational semantics of cross cutting concerns in Aspect Oriented System design and will play a crucial role on realization of weaving mechanism formally at model level.
{"title":"Aspect Algebra: The Operational Semantics for Aspect Oriented Software","authors":"A. Sarkar, N. Debnath","doi":"10.1109/ITNG.2012.28","DOIUrl":"https://doi.org/10.1109/ITNG.2012.28","url":null,"abstract":"This paper has proposed novel aspect algebra for Graph -- semantic based Aspect Model called GAM. The GAM provides formal representation of Aspect Oriented System (AOS) concepts like join points, advices, Point Cut etc. using graph based semantics. On the other hand, the proposed algebra is comprised of set of operators defined on conceptual semantics of AOS. Those operators are used to conceptualize the different operational semantics of cross cutting concerns in Aspect Oriented System design and will play a crucial role on realization of weaving mechanism formally at model level.","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":"126550977","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}
High performance and energy-efficient storage systems are essential for mobile data-intensive applications such as remote surgery and mobile data center. Existing mobile storage systems consist of an array of independent small form factor hard disks connected to a host by a storage interface in a mobile computing environment. Although hard disks are cost-effective and can provide huge capacity and high-throughput, they have some intrinsic limitations such as long access latencies, high annual disk replacement rates, fragile physical characteristics, and energy-inefficiency. Compared with hard disk drives, solid state disks (SSD) are much more energy-efficient, and can offer much faster access times. A major concern on current solid state disk is its relatively higher price. In this paper, we developed hybrid mobile disk architecture HyBuM that integrates an array of solid state disks with buffer disks and an array of mobile disks. The most recently used data will be cached in the solid state disks, the second most popular data will be stored in the buffer disks, and the least used data sets will be stored in the mobile disk array. Experimental results demonstratively show that HyBuM provides significant energy saving for mobile storage systems such as laptops, mobile phones, and PDA compared to two existing non hybrid architecture.
{"title":"HyBuM: Hybrid Energy Efficient Architecture for Mobile Storage Systems","authors":"Mais Nijim, Young Lee, K. Bellam","doi":"10.1109/ITNG.2012.37","DOIUrl":"https://doi.org/10.1109/ITNG.2012.37","url":null,"abstract":"High performance and energy-efficient storage systems are essential for mobile data-intensive applications such as remote surgery and mobile data center. Existing mobile storage systems consist of an array of independent small form factor hard disks connected to a host by a storage interface in a mobile computing environment. Although hard disks are cost-effective and can provide huge capacity and high-throughput, they have some intrinsic limitations such as long access latencies, high annual disk replacement rates, fragile physical characteristics, and energy-inefficiency. Compared with hard disk drives, solid state disks (SSD) are much more energy-efficient, and can offer much faster access times. A major concern on current solid state disk is its relatively higher price. In this paper, we developed hybrid mobile disk architecture HyBuM that integrates an array of solid state disks with buffer disks and an array of mobile disks. The most recently used data will be cached in the solid state disks, the second most popular data will be stored in the buffer disks, and the least used data sets will be stored in the mobile disk array. Experimental results demonstratively show that HyBuM provides significant energy saving for mobile storage systems such as laptops, mobile phones, and PDA compared to two existing non hybrid architecture.","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":"124349234","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 widespread use of the internet and communication networks has increased electronic learning (E-Learning) at the expense of face-to-face learning. This increase was supported by the use of learning management systems such as Blackboard, Moodle, and WebCT. Kuwait University introduced the use of Blackboard in 2005 to be used by faculty members in support of their hybrid or blended teaching experience. Before the introduction of Blackboard, many faculty members used and continue to use Yahoo Groups as a simple alternative to learning management systems. This paper measures the perceptions of Kuwait University students of the use of Yahoo Groups as compared to Blackboard across level of education. A total of 102 students participated in the study by answering a structured questionnaire followed by a focus group to discuss the advantages and disadvantages of using Yahoo Groups vs. Blackboard. The results showed a great division across level of education, while the great majority of undergraduate students favor the use of Yahoo Groups over Blackboard, a narrow majority of graduate students favor the use of Blackboard. Yahoo Groups scored higher on simplicity, ease of use, and accessibility while Blackboard scored higher on student participation in the discussions and submitting assignments.
{"title":"Student Perceptions of Learning Management Systems in a University Environment: Yahoo Groups vs Blackboard","authors":"Samir N. Hamade","doi":"10.1109/ITNG.2012.126","DOIUrl":"https://doi.org/10.1109/ITNG.2012.126","url":null,"abstract":"The widespread use of the internet and communication networks has increased electronic learning (E-Learning) at the expense of face-to-face learning. This increase was supported by the use of learning management systems such as Blackboard, Moodle, and WebCT. Kuwait University introduced the use of Blackboard in 2005 to be used by faculty members in support of their hybrid or blended teaching experience. Before the introduction of Blackboard, many faculty members used and continue to use Yahoo Groups as a simple alternative to learning management systems. This paper measures the perceptions of Kuwait University students of the use of Yahoo Groups as compared to Blackboard across level of education. A total of 102 students participated in the study by answering a structured questionnaire followed by a focus group to discuss the advantages and disadvantages of using Yahoo Groups vs. Blackboard. The results showed a great division across level of education, while the great majority of undergraduate students favor the use of Yahoo Groups over Blackboard, a narrow majority of graduate students favor the use of Blackboard. Yahoo Groups scored higher on simplicity, ease of use, and accessibility while Blackboard scored higher on student participation in the discussions and submitting assignments.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"16 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":"121650336","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 more sustainable energy generation is integrated into power grid, the control of power flow in an efficient and effective manner becomes more and more essential. A new innovative device is presented that allows the control of line power flow without the high harmonics and efficiency losses of traditional methods. This paper presents the dynamic response and the harmonics of a laboratory prototype Virtual Air Gap Variable Reactor (VAG-VR) and compares them with those of a thyristor controlled reactor (TCR). Variable Reactors have many applications in the power industry. Their use allows control of line power flow, voltage regulation, as well as damping of power oscillations and sub synchronous resonances. A variable reactor is most commonly implemented as a TCR by switching in and out a constant reactance to achieve an averaged variable reactance. By using a virtual air gap, implementation of a continuously variable reactance is possible with a better dynamic response and without introducing the harmonics created by the thyristor switching of a TCR.
{"title":"Harmonics and Dynamic Response of a Virtual Air Gap Variable Reactor","authors":"D. Dolan, P. Lehn","doi":"10.1109/ITNG.2012.39","DOIUrl":"https://doi.org/10.1109/ITNG.2012.39","url":null,"abstract":"As more sustainable energy generation is integrated into power grid, the control of power flow in an efficient and effective manner becomes more and more essential. A new innovative device is presented that allows the control of line power flow without the high harmonics and efficiency losses of traditional methods. This paper presents the dynamic response and the harmonics of a laboratory prototype Virtual Air Gap Variable Reactor (VAG-VR) and compares them with those of a thyristor controlled reactor (TCR). Variable Reactors have many applications in the power industry. Their use allows control of line power flow, voltage regulation, as well as damping of power oscillations and sub synchronous resonances. A variable reactor is most commonly implemented as a TCR by switching in and out a constant reactance to achieve an averaged variable reactance. By using a virtual air gap, implementation of a continuously variable reactance is possible with a better dynamic response and without introducing the harmonics created by the thyristor switching of a TCR.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"156 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":"123330378","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}
A novel fast-locking DPLL based on the Successive-Approximation Register (SAR) is presented and modeled using SPICE. The DPLL has two distinct stages of operation: 1) A coarse-tuning stage which employs frequency tracking to bring the VCO and reference frequencies close to each other and 2) a fine tuning stage which uses conventional phase tracking to achieve a complete lock. The coarse-tuning stage consists of a frequency comparator, a SAR, and a D/A converter (DAC). The architecture of the SAR DPLL has been designed and simulated in 250nm SPICE. The fast-locking DPLL was found to be 1.5 to 3 times faster than the conventional DPLL.
{"title":"A Novel SAR Fast-Locking Digital PLL: SPICE Modeling and Simulations","authors":"M. Wagdy, Robin Sur","doi":"10.1109/ITNG.2012.108","DOIUrl":"https://doi.org/10.1109/ITNG.2012.108","url":null,"abstract":"A novel fast-locking DPLL based on the Successive-Approximation Register (SAR) is presented and modeled using SPICE. The DPLL has two distinct stages of operation: 1) A coarse-tuning stage which employs frequency tracking to bring the VCO and reference frequencies close to each other and 2) a fine tuning stage which uses conventional phase tracking to achieve a complete lock. The coarse-tuning stage consists of a frequency comparator, a SAR, and a D/A converter (DAC). The architecture of the SAR DPLL has been designed and simulated in 250nm SPICE. The fast-locking DPLL was found to be 1.5 to 3 times faster than the conventional DPLL.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"792 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120931995","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 propose a protocol based on quantum teleportation and measurement-based computation allowing clients to conduct blind computation on the server with less information of input, output and computation revealed. Our protocol also requires less quantum resources on clients. There are two phases in our protocol, i.e., preparation and computation. Since we apply the small operation unit of an entanglement pair instead of cluster states or quantum gates, the server is able to serve more clients with limited resources, and provide flexible computation power and thus distribute his tasks with flexibility. The proposed protocol provides a new way to achieve blind computation with few quantum resources on clients and conceal clients' information from potential eavesdroppers. Moreover, to the best of our knowledge, the proposed protocol is the first to consider the reduction of the additional load on the server, and provides better scalability, flexibility and reliability for quantum blind computation.
{"title":"Quantum Blind Computation with Teleportation-based Computation","authors":"Nai-Hui Chia, Chia-Hung Chien, W. Chung, S. Kuo","doi":"10.1109/ITNG.2012.149","DOIUrl":"https://doi.org/10.1109/ITNG.2012.149","url":null,"abstract":"We propose a protocol based on quantum teleportation and measurement-based computation allowing clients to conduct blind computation on the server with less information of input, output and computation revealed. Our protocol also requires less quantum resources on clients. There are two phases in our protocol, i.e., preparation and computation. Since we apply the small operation unit of an entanglement pair instead of cluster states or quantum gates, the server is able to serve more clients with limited resources, and provide flexible computation power and thus distribute his tasks with flexibility. The proposed protocol provides a new way to achieve blind computation with few quantum resources on clients and conceal clients' information from potential eavesdroppers. Moreover, to the best of our knowledge, the proposed protocol is the first to consider the reduction of the additional load on the server, and provides better scalability, flexibility and reliability for quantum blind computation.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"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":"132942004","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}
Castalia is among the specialized simulators that researchers in the area of low power personal networks utilize for various purposes. However, the lack of visualization tool for any simulator causes the decrease of thorough studies carried out. Aiming at further facilitating Castalia simulator, the current study introduces a network visualizer, CNA, which is designed and implemented for animating simulation scenarios produced by Castalia. The proposed animator is designed so that it performs all the operations necessary for animating a simulated network. It includes several features from supporting various trace files to software capabilities which are outlined in details. The case studies prove the precision and proper functioning of the proposed animator.
{"title":"Castalia Network Animator (CNA): A Visualization Tool for Castalia Wireless Sensor Network Simulator","authors":"Adib Rastegarnia, Vahid Solouk","doi":"10.1109/ITNG.2012.15","DOIUrl":"https://doi.org/10.1109/ITNG.2012.15","url":null,"abstract":"Castalia is among the specialized simulators that researchers in the area of low power personal networks utilize for various purposes. However, the lack of visualization tool for any simulator causes the decrease of thorough studies carried out. Aiming at further facilitating Castalia simulator, the current study introduces a network visualizer, CNA, which is designed and implemented for animating simulation scenarios produced by Castalia. The proposed animator is designed so that it performs all the operations necessary for animating a simulated network. It includes several features from supporting various trace files to software capabilities which are outlined in details. The case studies prove the precision and proper functioning of the proposed animator.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"126 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":"133457391","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}
Packet Reversed Packet Combining (PRPC) Scheme corrects error if occurs at same bit location. A Modified Packet Combining (MPC) Scheme corrects double or higher bit errors. Some previous studies on three schemes namely PRPC, MPC and MPC with PRPC found that they offer higher throughput over basic stop and wait ARQ protocol. We find that in practical ranges of packet size, window size and bit error rate, the schemes offer higher throughput than that of basic GBN.
{"title":"Packet Reversed Packet Combining Scheme: A Thorough Analysis","authors":"C. Bhunia, A. Bhunia","doi":"10.1109/ITNG.2012.89","DOIUrl":"https://doi.org/10.1109/ITNG.2012.89","url":null,"abstract":"Packet Reversed Packet Combining (PRPC) Scheme corrects error if occurs at same bit location. A Modified Packet Combining (MPC) Scheme corrects double or higher bit errors. Some previous studies on three schemes namely PRPC, MPC and MPC with PRPC found that they offer higher throughput over basic stop and wait ARQ protocol. We find that in practical ranges of packet size, window size and bit error rate, the schemes offer higher throughput than that of basic GBN.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"29 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":"133254497","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}
Lin and Chan proposed reversible secret sharing scheme in 2010. The advantages of this scheme are as follows: a low distortion, high capacity of shadow images and usage of the reversible method. However, this scheme has some problems. First, the number of participants is limited because of modulus prime number m. Second, the overflow can occur by additional operations in the embedding procedure. Finally, the coefficient of (t-1)-th degree polynomial can be zero due to the property of the cover image pixel. The proposed scheme solves these problems of the Lin and Chan's scheme. In order to solve these problems, a new polynomial technique are utilized in the proposed scheme. In the experimental results, PSNR of their scheme is decreased with the increase of embedding capacity. However, in the proposed scheme, even if the embedding capacity increase, PSNR value of about 45dB or more is maintained uniformly.
{"title":"A Reversible Secret Sharing Scheme Based on GF(2^8)","authors":"Dong-Hyun Kim, Gil-Je Lee, M. Park, K. Yoo","doi":"10.1109/ITNG.2012.101","DOIUrl":"https://doi.org/10.1109/ITNG.2012.101","url":null,"abstract":"Lin and Chan proposed reversible secret sharing scheme in 2010. The advantages of this scheme are as follows: a low distortion, high capacity of shadow images and usage of the reversible method. However, this scheme has some problems. First, the number of participants is limited because of modulus prime number m. Second, the overflow can occur by additional operations in the embedding procedure. Finally, the coefficient of (t-1)-th degree polynomial can be zero due to the property of the cover image pixel. The proposed scheme solves these problems of the Lin and Chan's scheme. In order to solve these problems, a new polynomial technique are utilized in the proposed scheme. In the experimental results, PSNR of their scheme is decreased with the increase of embedding capacity. However, in the proposed scheme, even if the embedding capacity increase, PSNR value of about 45dB or more is maintained uniformly.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"17 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":"128555676","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 paper presents a case study of the design of a hybrid SQL data storage combined with procedural programming language processing (HSPPL) system for the analysis of large graphs. The HSPPL system was evaluated against a system with SQL data storage combined with SQL language processing (SQL), and against a system with internal memory storage combined with procedural programming language processing (PPL). In one experiment, the three systems were used to perform a shortest path analysis on six test graphs which varied in size and density. The HSPPL system was significantly faster than the SQL system and was able to handle graphs larger than those that could be handled by the PPL system, but the HSPPL system was significantly slower than the PPL system. In a second experiment, the three systems were used to perform graph partitioning on four benchmark problems. The results of the partitioning produced by the three systems were not statistically different. The results suggest that an HSPPL system for analyzing large graphs is feasible and may be particularly useful in situations where a graph under analysis is too large to fit into host machine main memory.
{"title":"A Hybrid System for Analyzing Very Large Graphs","authors":"J. McCaffrey","doi":"10.1109/ITNG.2012.43","DOIUrl":"https://doi.org/10.1109/ITNG.2012.43","url":null,"abstract":"This paper presents a case study of the design of a hybrid SQL data storage combined with procedural programming language processing (HSPPL) system for the analysis of large graphs. The HSPPL system was evaluated against a system with SQL data storage combined with SQL language processing (SQL), and against a system with internal memory storage combined with procedural programming language processing (PPL). In one experiment, the three systems were used to perform a shortest path analysis on six test graphs which varied in size and density. The HSPPL system was significantly faster than the SQL system and was able to handle graphs larger than those that could be handled by the PPL system, but the HSPPL system was significantly slower than the PPL system. In a second experiment, the three systems were used to perform graph partitioning on four benchmark problems. The results of the partitioning produced by the three systems were not statistically different. The results suggest that an HSPPL system for analyzing large graphs is feasible and may be particularly useful in situations where a graph under analysis is too large to fit into host machine main memory.","PeriodicalId":117236,"journal":{"name":"2012 Ninth International Conference on Information Technology - New Generations","volume":"4 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":"128086625","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
扫码关注我们
求助内容：
应助结果提醒方式：