This paper defines the Non-Blocking Atomic Commitment problem in a message-passing asynchronous system and determines a failure detector to solve the problem. This failure detector, which we call the modal failure detector star, and which we denote by M*, is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector ¡ÞP. The paper shows that at any environment, the problem is solvable with M*.
{"title":"Non-blocking Atomic Commitment Algorithm in Asynchronous Distributed Systems with Unreliable Failure Detectors","authors":"Sunghoon Park, Jea-Yep Lee, Su-Chang Yu","doi":"10.1109/ITNG.2013.13","DOIUrl":"https://doi.org/10.1109/ITNG.2013.13","url":null,"abstract":"This paper defines the Non-Blocking Atomic Commitment problem in a message-passing asynchronous system and determines a failure detector to solve the problem. This failure detector, which we call the modal failure detector star, and which we denote by M*, is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector ¡ÞP. The paper shows that at any environment, the problem is solvable with M*.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"37 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":"121010364","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}
Recursive Hyper spheric Classification (RHC) can accurately and succinctly classify large datasets by dissecting labeled vectors into their constituent groups, or hyper spheres. While RHC is a powerful classification tool, coupling RHC with other linear classifiers enhances the ability and accuracy of the classification system, improving recognition of unlabeled vectors. In this paper, RHC is paired with Linear Discriminant Analysis (LDA) for improved classification and recognition rates.
{"title":"Coupling Recursive Hyperspheric Classification with Linear Discriminant Analysis for Improved Results","authors":"S. B. Reed, Tyson R. C. Reed, S. Dascalu","doi":"10.1109/ITNG.2013.91","DOIUrl":"https://doi.org/10.1109/ITNG.2013.91","url":null,"abstract":"Recursive Hyper spheric Classification (RHC) can accurately and succinctly classify large datasets by dissecting labeled vectors into their constituent groups, or hyper spheres. While RHC is a powerful classification tool, coupling RHC with other linear classifiers enhances the ability and accuracy of the classification system, improving recognition of unlabeled vectors. In this paper, RHC is paired with Linear Discriminant Analysis (LDA) for improved classification and recognition rates.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"251 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":"125642775","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}
Kênia Santos de Oliveira, Joyce M. S. França, M. S. Soares
Aspect-oriented programming was proposed in order to handle crosscutting concerns in an efficient way. Initial proposals in this field were applied to source code. Later on, aspects were considered to be applied in other phases of software development, such as within software architecture. There are several advantages in identifying aspects at the architectural level such as reducing costs of software maintenance and preserving the notion of aspects in the development process ensuring traceability. Whereas different stakeholders need to view the system from various perspectives, the proposal of a software architecture in multiple views is essential. Therefore, this article proposes an aspect oriented software architecture model with multiple views to define the structure of aspect oriented software. An extension of the SysML modeling language is applied to model the architectural views.
{"title":"Extensions of SysML for Modeling an Aspect Oriented Software Architecture with Multiple Views","authors":"Kênia Santos de Oliveira, Joyce M. S. França, M. S. Soares","doi":"10.1109/ITNG.2013.105","DOIUrl":"https://doi.org/10.1109/ITNG.2013.105","url":null,"abstract":"Aspect-oriented programming was proposed in order to handle crosscutting concerns in an efficient way. Initial proposals in this field were applied to source code. Later on, aspects were considered to be applied in other phases of software development, such as within software architecture. There are several advantages in identifying aspects at the architectural level such as reducing costs of software maintenance and preserving the notion of aspects in the development process ensuring traceability. Whereas different stakeholders need to view the system from various perspectives, the proposal of a software architecture in multiple views is essential. Therefore, this article proposes an aspect oriented software architecture model with multiple views to define the structure of aspect oriented software. An extension of the SysML modeling language is applied to model the architectural views.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"54 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":"133687550","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}
Muhammed Al-Qahtani, Mansour Al-Qahtani, Hatim Al-Misehal
The goal of this paper is to identify factors that affect e-Learners' satisfaction in a large corporation in Saudi Arabia. By adopting an organisational/technological perspective to the e-Learning system, the existing body of literature on e-Learning was reviewed and a suitable theoretical model was selected as an initial theoretical framework characterising various underlying factors for the e-Learners' satisfaction in today's workplace environments in general. Through four semi-structured interviews with employees selected from the case study organisation the current study attempts to identify additional factors that may be relevant to the large Middle Eastern corporations. This in turn will facilitate development of a survey questionnaire that crosses distinctively different cultures, which constitutes the author's future study.
{"title":"Learner Satisfaction of E-Learning in Workplace: Case of Oil Company in Middle East","authors":"Muhammed Al-Qahtani, Mansour Al-Qahtani, Hatim Al-Misehal","doi":"10.1109/ITNG.2013.47","DOIUrl":"https://doi.org/10.1109/ITNG.2013.47","url":null,"abstract":"The goal of this paper is to identify factors that affect e-Learners' satisfaction in a large corporation in Saudi Arabia. By adopting an organisational/technological perspective to the e-Learning system, the existing body of literature on e-Learning was reviewed and a suitable theoretical model was selected as an initial theoretical framework characterising various underlying factors for the e-Learners' satisfaction in today's workplace environments in general. Through four semi-structured interviews with employees selected from the case study organisation the current study attempts to identify additional factors that may be relevant to the large Middle Eastern corporations. This in turn will facilitate development of a survey questionnaire that crosses distinctively different cultures, which constitutes the author's future study.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"24 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":"134264457","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 discusses the user-defined inverted index design, analysis and measurement in Boolean rule-based entity resolution (ER) systems. The features of Boolean rule-based ER system will be described first and followed by how to design user-defined inverted index for better performance. An illustration of alignment of index and matching rules will be given. Also, there will be a discussion of three index measurements: reduction ratio, index precision and recall. The final part gives two suggested strategies for designing the index.
{"title":"User-Defined Inverted Index in Boolean, Rule-Based Entity Resolution Systems","authors":"Yinle Zhou, J. Talburt, E. D. Nelson","doi":"10.1109/ITNG.2013.93","DOIUrl":"https://doi.org/10.1109/ITNG.2013.93","url":null,"abstract":"This paper discusses the user-defined inverted index design, analysis and measurement in Boolean rule-based entity resolution (ER) systems. The features of Boolean rule-based ER system will be described first and followed by how to design user-defined inverted index for better performance. An illustration of alignment of index and matching rules will be given. Also, there will be a discussion of three index measurements: reduction ratio, index precision and recall. The final part gives two suggested strategies for designing the index.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"20 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":"115060378","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 proposes an IEEE 802.21 Media Independent Handover (MIH) functionality assisted Proxy Mobile IPv6 (PMIPv6) mechanism for reducing handover latency and signaling cost in heterogeneous wireless networks. The proposed mechanism comes to support fast vertical handover for the mobile node (MN) irrespective of the presence or absence of MIH functionality as well as IP mobility functionality. That is, the MN does not need to be participated in any MIH related signaling for handover procedure, which can be consistent with the essential objective of the PMIPv6. The base station with MIH functionality performs handover on behalf of the MN. Therefore, the proposed mechanism can reduce burden and power consumption of MNs with limited resource and battery power. In addition, the analytical evaluation shows that the proposed mechanism can outperform the existing mechanism in terms of handover latency and total number of over-the-air signaling messages. Thus, the proposed mechanism can be expected to reduce the packet loss and the bandwidth consumption of wireless links during handover procedure comparing with the existing mechanism.
{"title":"An IEEE 802.21 MIH Functionality Assisted Proxy Mobile IPv6 for Reducing Handover Latency and Signaling Cost","authors":"P. Kim, Mun-Suck Jang, E. Lee","doi":"10.1109/ITNG.2013.107","DOIUrl":"https://doi.org/10.1109/ITNG.2013.107","url":null,"abstract":"This paper proposes an IEEE 802.21 Media Independent Handover (MIH) functionality assisted Proxy Mobile IPv6 (PMIPv6) mechanism for reducing handover latency and signaling cost in heterogeneous wireless networks. The proposed mechanism comes to support fast vertical handover for the mobile node (MN) irrespective of the presence or absence of MIH functionality as well as IP mobility functionality. That is, the MN does not need to be participated in any MIH related signaling for handover procedure, which can be consistent with the essential objective of the PMIPv6. The base station with MIH functionality performs handover on behalf of the MN. Therefore, the proposed mechanism can reduce burden and power consumption of MNs with limited resource and battery power. In addition, the analytical evaluation shows that the proposed mechanism can outperform the existing mechanism in terms of handover latency and total number of over-the-air signaling messages. Thus, the proposed mechanism can be expected to reduce the packet loss and the bandwidth consumption of wireless links during handover procedure comparing with the existing mechanism.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"46 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":"115179197","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 will find the numerical solution of partial differential equations by using the finite element method with Riesz bases that are elevated from ortho normal bases. Especially for the two-dimensional cases, we also propose another way to solve a matrix-valued equation (Lyapunov equation). Moreover, we give the precise inverse formula for symmetric block tridiagonal Toeplitz matrices. To conclude, we present some numerical results that show the usefulness of the elevated bases.
{"title":"On the Finite Element Method with Riesz Bases and Its Applications to Some Partial Differential Equations","authors":"N. Fukuda, T. Kinoshita, Takayuki Kubo","doi":"10.1109/ITNG.2013.121","DOIUrl":"https://doi.org/10.1109/ITNG.2013.121","url":null,"abstract":"In this paper, we will find the numerical solution of partial differential equations by using the finite element method with Riesz bases that are elevated from ortho normal bases. Especially for the two-dimensional cases, we also propose another way to solve a matrix-valued equation (Lyapunov equation). Moreover, we give the precise inverse formula for symmetric block tridiagonal Toeplitz matrices. To conclude, we present some numerical results that show the usefulness of the elevated bases.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"69 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":"115538504","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 conduct a Systematic Mapping Study to categorize the primary research papers in architectural analysis. Systematic mapping studies can change the research perspective in an area and they can help to find the ignored researched areas. The objective of this study is to investigate the techniques used in papers on architectural analysis, identify the current trends, and provide suggestions for the future research studies. We search for papers published within the last ten years in the following databases: IEEE Explorer, ACM Digital Library, Science Direct, and Wiley. We conclude that more validation and evaluation research is needed to provide a better foundation for architectural analysis.
{"title":"A Systematic Mapping Study on Architectural Analysis","authors":"C. Catal, Muratcan Atalay","doi":"10.1109/ITNG.2013.102","DOIUrl":"https://doi.org/10.1109/ITNG.2013.102","url":null,"abstract":"We conduct a Systematic Mapping Study to categorize the primary research papers in architectural analysis. Systematic mapping studies can change the research perspective in an area and they can help to find the ignored researched areas. The objective of this study is to investigate the techniques used in papers on architectural analysis, identify the current trends, and provide suggestions for the future research studies. We search for papers published within the last ten years in the following databases: IEEE Explorer, ACM Digital Library, Science Direct, and Wiley. We conclude that more validation and evaluation research is needed to provide a better foundation for architectural analysis.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"126 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":"115689406","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 Search-based test input generator produces a high volume of auto-generated test inputs. However, manually checking a test oracle for these test inputs is impractical due to the lacking of a systematic way to produce corresponding expected results automatically. This paper presents a mining approach to build decision tree models containing the estimated expected results for checking a test oracle. We first choose a subset of the auto-generated test inputs as a training set. Then, we mine the training set to generate a decision tree from which the estimated expected results can be retrieved. For evaluation purpose, we have applied our approach to two legacy examples, Triangle and Next Date. Our controlled experiments have shown that the mining approach is able to generate highly accurate behavioral models and achieve strong fault detectability.
{"title":"Mining Auto-generated Test Inputs for Test Oracle","authors":"Weifeng Xu, Hanlin Wang, Tao Ding","doi":"10.1109/ITNG.2013.126","DOIUrl":"https://doi.org/10.1109/ITNG.2013.126","url":null,"abstract":"A Search-based test input generator produces a high volume of auto-generated test inputs. However, manually checking a test oracle for these test inputs is impractical due to the lacking of a systematic way to produce corresponding expected results automatically. This paper presents a mining approach to build decision tree models containing the estimated expected results for checking a test oracle. We first choose a subset of the auto-generated test inputs as a training set. Then, we mine the training set to generate a decision tree from which the estimated expected results can be retrieved. For evaluation purpose, we have applied our approach to two legacy examples, Triangle and Next Date. Our controlled experiments have shown that the mining approach is able to generate highly accurate behavioral models and achieve strong fault detectability.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"254 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":"114652868","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}
R. Goswami, S. K. Chakraborty, A. Bhunia, C. Bhunia
Realizing the time variant key or variable key from session to session is the key challenge in achieving perfect security [1-2]. Automatic Variable Key (AVK) is a novel approach to realize time variant key. In AVK, key is generated for use between the sender and the receiver in using a simple computation technique as proposed by Bhunia [3-5]. The AVK was widely experimented by other researchers that established the superiority of AVK over a single / fixed key [6-10]. In this paper we propose two new techniques for generating time variant key. Our techniques ensure better randomness among the successive two keys so generated.
{"title":"New Approach towards Generation of Automatic Variable Key to Achieve Perfect Security","authors":"R. Goswami, S. K. Chakraborty, A. Bhunia, C. Bhunia","doi":"10.1109/ITNG.2013.82","DOIUrl":"https://doi.org/10.1109/ITNG.2013.82","url":null,"abstract":"Realizing the time variant key or variable key from session to session is the key challenge in achieving perfect security [1-2]. Automatic Variable Key (AVK) is a novel approach to realize time variant key. In AVK, key is generated for use between the sender and the receiver in using a simple computation technique as proposed by Bhunia [3-5]. The AVK was widely experimented by other researchers that established the superiority of AVK over a single / fixed key [6-10]. In this paper we propose two new techniques for generating time variant key. Our techniques ensure better randomness among the successive two keys so generated.","PeriodicalId":320262,"journal":{"name":"2013 10th International Conference on Information Technology: New Generations","volume":"39 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":"121688931","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
扫码关注我们
求助内容：
应助结果提醒方式：