Pub Date : 2016-03-31DOI: 10.2991/ijndc.2016.4.2.2
Ayako Hayashi, T. Hochin, Hiroki Nomiya
This paper proposes archaeological distribution map system sharing archaeological information. Many archaeologists want to analyze the distribution of relics and/or remains. Excavation information, however, cannot be opened until verification and research are completed. Archaeological information sources are heterogeneous and distributed. This paper addresses to these problems through handling aggregate information, clarifying common schema and the structure of log data, and uploading data during a computer in on-line. Execution examples show the possibility of this kind of system.
{"title":"Archaeological Distribution Map System Using Aggregate Information from Heterogeneous Information Sources","authors":"Ayako Hayashi, T. Hochin, Hiroki Nomiya","doi":"10.2991/ijndc.2016.4.2.2","DOIUrl":"https://doi.org/10.2991/ijndc.2016.4.2.2","url":null,"abstract":"This paper proposes archaeological distribution map system sharing archaeological information. Many archaeologists want to analyze the distribution of relics and/or remains. Excavation information, however, cannot be opened until verification and research are completed. Archaeological information sources are heterogeneous and distributed. This paper addresses to these problems through handling aggregate information, clarifying common schema and the structure of log data, and uploading data during a computer in on-line. Execution examples show the possibility of this kind of system.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125098389","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}
Pub Date : 2016-03-31DOI: 10.2991/ijndc.2016.4.2.5
Yongzhi Wang, Jinpeng Wei, M. Srivatsa, Yucong Duan, Wencai Du
Large-scale adoption of MapReduce applications on public clouds is hindered by the lack of trust on the participating virtual machines deployed on the public cloud. In this paper, we propose IntegrityMR, a multi-public clouds architecture-based solution, which performs the MapReduce-based result integrity check techniques at two alternative layers: the task layer and the application layer. Our experimental results show that solutions in both layers offer a high result integrity but non-negligible performance overheads.
{"title":"IntegrityMR: Exploring Result Integrity Assurance Solutions for Big Data Computing Applications","authors":"Yongzhi Wang, Jinpeng Wei, M. Srivatsa, Yucong Duan, Wencai Du","doi":"10.2991/ijndc.2016.4.2.5","DOIUrl":"https://doi.org/10.2991/ijndc.2016.4.2.5","url":null,"abstract":"Large-scale adoption of MapReduce applications on public clouds is hindered by the lack of trust on the participating virtual machines deployed on the public cloud. In this paper, we propose IntegrityMR, a multi-public clouds architecture-based solution, which performs the MapReduce-based result integrity check techniques at two alternative layers: the task layer and the application layer. Our experimental results show that solutions in both layers offer a high result integrity but non-negligible performance overheads.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132497001","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}
Pub Date : 2016-03-31DOI: 10.2991/ijndc.2016.4.2.4
Shota Imai, Shun Shiramatsu, Tadachika Ozono, T. Shintani
We propose an extended Web displaying system based on multiple tablet devices to help users to conduct collaborative works anywhere without a large display. Users can use multiple tablet devices as a pseudo mobile large display on demand by using our system. For example, users can make discussions by using Web applications anywhere. We present management methods of the arranged displays and two types of synchronous messages. One uses positional information and the other uses operational information for Web page synchronization. We show two applications based on the extended Web displaying system, a piano score system and a map viewer system.
{"title":"An Extended Web Displaying System based on Multiple Tablet Devices","authors":"Shota Imai, Shun Shiramatsu, Tadachika Ozono, T. Shintani","doi":"10.2991/ijndc.2016.4.2.4","DOIUrl":"https://doi.org/10.2991/ijndc.2016.4.2.4","url":null,"abstract":"We propose an extended Web displaying system based on multiple tablet devices to help users to conduct collaborative works anywhere without a large display. Users can use multiple tablet devices as a pseudo mobile large display on demand by using our system. For example, users can make discussions by using Web applications anywhere. We present management methods of the arranged displays and two types of synchronous messages. One uses positional information and the other uses operational information for Web page synchronization. We show two applications based on the extended Web displaying system, a piano score system and a map viewer system.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131427582","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}
Pub Date : 2015-11-01DOI: 10.2991/ijndc.2015.3.4.3
H. Park, K. Kim, Manyun Kim, H. Youn
Recently, SSD caching is widely studied for VM-based systems. In this paper we propose a novel hypervisor-based SSD caching scheme, employing a new metric to accurately determine the demand on SSD cache space of each VM. Computer simulation confirms that it substantially improves the accuracy of cache space allocation compared to the existing schemes. It also allows comparable hit ratio as the existing schemes with less amount of SSD cache for the VMs.
{"title":"Enhanced Hypervisor-based SSD Cache with Dynamic Cache Scanning and Allocation for Virtualized Cloud System","authors":"H. Park, K. Kim, Manyun Kim, H. Youn","doi":"10.2991/ijndc.2015.3.4.3","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.4.3","url":null,"abstract":"Recently, SSD caching is widely studied for VM-based systems. In this paper we propose a novel hypervisor-based SSD caching scheme, employing a new metric to accurately determine the demand on SSD cache space of each VM. Computer simulation confirms that it substantially improves the accuracy of cache space allocation compared to the existing schemes. It also allows comparable hit ratio as the existing schemes with less amount of SSD cache for the VMs.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125726286","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}
Pub Date : 2015-11-01DOI: 10.2991/ijndc.2015.3.4.4
Ryosuke Yamanishi, Ryoya Fujimoto, Y. Iwahori, R. Woodham
This paper proposes a hybrid approach of ontology and image clustering to automatically generate hierarchic image database. In the field of computer vision, ”generic object recognition” is one of the most important topics. Generic object recognition needs three types of research: feature extraction, pattern recognition, and database preparation; this paper targets at database preparation. The proposed approach considers both object semantic and visual features in images. In the proposed approach, the semantic is covered by ontology framework, and the visual similarity is covered by image clustering based on Gaussian Mixture Model. The image database generated by the proposed approach covered over 4,800 concepts (where 152 concepts have more than 100 images) and its structure was hierarchic. Through the subjective evaluation experiment, whether images in the database were correctly mapped or not was examined. The results of the experiment showed over 84% precision in average. It was suggested that the generated image database was sufficiently practicable as learning database for generic object recognition.
{"title":"Hybrid Approach of Ontology and Image Clustering for Automatic Generation of Hierarchic Image Database","authors":"Ryosuke Yamanishi, Ryoya Fujimoto, Y. Iwahori, R. Woodham","doi":"10.2991/ijndc.2015.3.4.4","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.4.4","url":null,"abstract":"This paper proposes a hybrid approach of ontology and image clustering to automatically generate hierarchic image database. In the field of computer vision, ”generic object recognition” is one of the most important topics. Generic object recognition needs three types of research: feature extraction, pattern recognition, and database preparation; this paper targets at database preparation. The proposed approach considers both object semantic and visual features in images. In the proposed approach, the semantic is covered by ontology framework, and the visual similarity is covered by image clustering based on Gaussian Mixture Model. The image database generated by the proposed approach covered over 4,800 concepts (where 152 concepts have more than 100 images) and its structure was hierarchic. Through the subjective evaluation experiment, whether images in the database were correctly mapped or not was examined. The results of the experiment showed over 84% precision in average. It was suggested that the generated image database was sufficiently practicable as learning database for generic object recognition.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124732425","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}
Pub Date : 2015-11-01DOI: 10.2991/ijndc.2015.3.4.6
Xianda Chen, Youngho Suh, Seung Wan Kim, H. Youn
This paper proposes an efficient handover scheme considering the asymmetric characteristics of macro and pico cells in LTE-A HetNet. The proposed scheme detects a suitable target eNB for handover using a multi-criteria decision making algorithm and the mobility information of user equipment (UE). A prompt handover is triggered for the UE if the received power is too low or the downlink SINR is below a threshold, avoiding radio link failure. The simulation results reveal that the proposed scheme significantly enhances goodput while reducing packet loss and unnecessary handover.
{"title":"Handover Management based on Asymmetric Nature of LTE-A HetNet using MCDM Algorithm","authors":"Xianda Chen, Youngho Suh, Seung Wan Kim, H. Youn","doi":"10.2991/ijndc.2015.3.4.6","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.4.6","url":null,"abstract":"This paper proposes an efficient handover scheme considering the asymmetric characteristics of macro and pico cells in LTE-A HetNet. The proposed scheme detects a suitable target eNB for handover using a multi-criteria decision making algorithm and the mobility information of user equipment (UE). A prompt handover is triggered for the UE if the received power is too low or the downlink SINR is below a threshold, avoiding radio link failure. The simulation results reveal that the proposed scheme significantly enhances goodput while reducing packet loss and unnecessary handover.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116902697","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}
Pub Date : 2015-11-01DOI: 10.2991/ijndc.2015.3.4.2
K. Kim, Manyun Kim, Jihyeon Choi, H. Youn
In this paper we propose an energy efficient clustering algorithm for maximizing the lifetime of WSNs. The proposed scheme decides the cluster head based on the energy level of the nodes, while tree topology is adopted to connect the nodes inside each cluster. A new model for deciding an optimal number of clusters is also derived. Computer simulation reveals that the proposed scheme significantly extends the network lifetime and message delivery ratio compared to the existing schemes.
{"title":"An Energy Efficient Clustering Algorithm for Maximizing the Lifetime of Wireless Sensor Network","authors":"K. Kim, Manyun Kim, Jihyeon Choi, H. Youn","doi":"10.2991/ijndc.2015.3.4.2","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.4.2","url":null,"abstract":"In this paper we propose an energy efficient clustering algorithm for maximizing the lifetime of WSNs. The proposed scheme decides the cluster head based on the energy level of the nodes, while tree topology is adopted to connect the nodes inside each cluster. A new model for deciding an optimal number of clusters is also derived. Computer simulation reveals that the proposed scheme significantly extends the network lifetime and message delivery ratio compared to the existing schemes.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122125484","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}
Pub Date : 2015-11-01DOI: 10.2991/ijndc.2015.3.4.1
A. Bossard, K. Kaneko
As reflected by the TOP500 list, hypercubes are popular interconnection networks for massively parallel systems, the main reason being the simplicity and ease of implementation of this network topology. In order to retain performance high and avoid bottleneck situation, routing algorithms are critical for these high-performance systems. Furthermore, disjoint path routing is a very desirable property of such communication algorithms. Effectively, selecting mutually node-disjoint paths guarantees that notorious parallel processing issues such as deadlocks, livelocks and starvations shall never occur. In this paper, we describe a routing algorithm for hypercubes that, given a bit constraint, selects internally node-disjoint paths between any pair of nodes satisfying the constraint, and such that the selected paths all satisfy the constraint. The introduction of such bit constraint enables the selection of multiple sets of disjoint paths between several node pairs each satisfying a distinct bit constraint, which is impossible with conventional routing algorithms. Selecting simultaneously disjoint paths between different node pairs induces increased communication performance and system dependability. The correctness and complexities of the described algorithm are formally proved, and analysis of the algorithm performance in practice is conducted by empirical evaluation.
{"title":"A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint","authors":"A. Bossard, K. Kaneko","doi":"10.2991/ijndc.2015.3.4.1","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.4.1","url":null,"abstract":"As reflected by the TOP500 list, hypercubes are popular interconnection networks for massively parallel systems, the main reason being the simplicity and ease of implementation of this network topology. In order to retain performance high and avoid bottleneck situation, routing algorithms are critical for these high-performance systems. Furthermore, disjoint path routing is a very desirable property of such communication algorithms. Effectively, selecting mutually node-disjoint paths guarantees that notorious parallel processing issues such as deadlocks, livelocks and starvations shall never occur. In this paper, we describe a routing algorithm for hypercubes that, given a bit constraint, selects internally node-disjoint paths between any pair of nodes satisfying the constraint, and such that the selected paths all satisfy the constraint. The introduction of such bit constraint enables the selection of multiple sets of disjoint paths between several node pairs each satisfying a distinct bit constraint, which is impossible with conventional routing algorithms. Selecting simultaneously disjoint paths between different node pairs induces increased communication performance and system dependability. The correctness and complexities of the described algorithm are formally proved, and analysis of the algorithm performance in practice is conducted by empirical evaluation.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127527277","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}
Pub Date : 2015-08-01DOI: 10.2991/ijndc.2015.3.3.7
Reo Kishi, Takahiro Hayashi
While many interfaces for gaze writing (text entry by eye gaze) are available today, these interfaces are just a replacement of a keyboard. For more efficient gaze writing, this paper proposes a novel gaze writing system which has two kinds of gaze writing interfaces: (1) an interface for text entry and (2) an interface for text copy and paste. The interface for text entry was selected from conventional interfaces based on experiments of workload evaluation of beginner users. The interface for text copy and paste, which is newly developed in our study, enables a user to specify a text range and paste the text to a desired position with only gaze interaction. To overcome the lack of accuracy of gaze pointing, the proposed system adopts the model of two step cursor control, which processes initial cursor setting and adjustment in turn. The experimental results have shown that the proposed interface makes gaze writing more efficiently.
{"title":"Development of an Effective Gaze Writing System with an Interface for Text Copy and Paste","authors":"Reo Kishi, Takahiro Hayashi","doi":"10.2991/ijndc.2015.3.3.7","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.3.7","url":null,"abstract":"While many interfaces for gaze writing (text entry by eye gaze) are available today, these interfaces are just a replacement of a keyboard. For more efficient gaze writing, this paper proposes a novel gaze writing system which has two kinds of gaze writing interfaces: (1) an interface for text entry and (2) an interface for text copy and paste. The interface for text entry was selected from conventional interfaces based on experiments of workload evaluation of beginner users. The interface for text copy and paste, which is newly developed in our study, enables a user to specify a text range and paste the text to a desired position with only gaze interaction. To overcome the lack of accuracy of gaze pointing, the proposed system adopts the model of two step cursor control, which processes initial cursor setting and adjustment in turn. The experimental results have shown that the proposed interface makes gaze writing more efficiently.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124998384","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}
Pub Date : 2015-08-01DOI: 10.2991/ijndc.2015.3.3.1
M. Alodib
Cloud computing is an emerging model of business computing that can be used to maintain configurable resources such as processors, networks, storage, operating systems, databases, and servers. Service oriented Architecture (SoA) is one of most successful paradigms deployed over the Cloud; is a layered architecture to organize software resources as services and to facilitate their deployment, discovery, and combination to produce new services. The coordination of innovations carried out between these services is a key challenge of SoA, as any failings in such services could result in a lack of availability, which may violate Service Level Agreements, leading to financial penalties or customer dissatisfaction. A service known as the Protocol service can be introduced and integrated within a system to coordinate innovations. This service may then be linked with a service called the Access Control Policies (AC_Policies) service, which identifies permissions of invocation of the Protocol service. Next, a real-time Business Activity Monitoring (BAM ) dashboard is automatically generated to supervise the process of assigning the Access Control Policies, along with the status of the executions of Web services. This approach is achieved by harnessing the capability of the Model-Driven Architecture (MDA) to facilitate the automatic generation of services. As a proof of concept, this approach is implemented as a plugin.
{"title":"Towards a Monitoring Framework for the Automatic Integration of the Access Control Policies for Web Services","authors":"M. Alodib","doi":"10.2991/ijndc.2015.3.3.1","DOIUrl":"https://doi.org/10.2991/ijndc.2015.3.3.1","url":null,"abstract":"Cloud computing is an emerging model of business computing that can be used to maintain configurable resources such as processors, networks, storage, operating systems, databases, and servers. Service oriented Architecture (SoA) is one of most successful paradigms deployed over the Cloud; is a layered architecture to organize software resources as services and to facilitate their deployment, discovery, and combination to produce new services. The coordination of innovations carried out between these services is a key challenge of SoA, as any failings in such services could result in a lack of availability, which may violate Service Level Agreements, leading to financial penalties or customer dissatisfaction. A service known as the Protocol service can be introduced and integrated within a system to coordinate innovations. This service may then be linked with a service called the Access Control Policies (AC_Policies) service, which identifies permissions of invocation of the Protocol service. Next, a real-time Business Activity Monitoring (BAM ) dashboard is automatically generated to supervise the process of assigning the Access Control Policies, along with the status of the executions of Web services. This approach is achieved by harnessing the capability of the Model-Driven Architecture (MDA) to facilitate the automatic generation of services. As a proof of concept, this approach is implemented as a plugin.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115528892","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}