首页 > 最新文献

Int. J. Networked Distributed Comput.最新文献

英文 中文
Archaeological Distribution Map System Using Aggregate Information from Heterogeneous Information Sources 基于异构信息源信息聚合的考古分布图系统
Pub Date : 2016-03-31 DOI: 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}
引用次数: 0
IntegrityMR: Exploring Result Integrity Assurance Solutions for Big Data Computing Applications IntegrityMR:探索大数据计算应用的结果完整性保证解决方案
Pub Date : 2016-03-31 DOI: 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.
MapReduce应用程序在公共云上的大规模采用受到了对部署在公共云上的参与虚拟机缺乏信任的阻碍。在本文中,我们提出了一种基于多公共云架构的解决方案IntegrityMR,它在任务层和应用层两个可选层执行基于mapreduce的结果完整性检查技术。我们的实验结果表明,两层的解决方案都提供了高的结果完整性,但不可忽略的性能开销。
{"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}
引用次数: 1
An Extended Web Displaying System based on Multiple Tablet Devices 基于多平板设备的扩展Web显示系统
Pub Date : 2016-03-31 DOI: 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.
我们提出了一种基于多个平板设备的扩展Web显示系统,帮助用户在没有大屏幕的情况下随时随地进行协作工作。通过使用我们的系统,用户可以根据需要使用多个平板设备作为伪移动大显示器。例如,用户可以在任何地方使用Web应用程序进行讨论。提出了排列显示和两种同步消息的管理方法。一个使用位置信息,另一个使用操作信息进行Web页面同步。我们展示了两个基于扩展Web显示系统的应用程序,一个钢琴乐谱系统和一个地图查看器系统。
{"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}
引用次数: 0
Enhanced Hypervisor-based SSD Cache with Dynamic Cache Scanning and Allocation for Virtualized Cloud System 虚拟化云系统基于虚拟化环境的增强SSD Cache,支持动态扫描和分配
Pub Date : 2015-11-01 DOI: 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.
近年来,基于虚拟机的系统对SSD缓存进行了广泛的研究。在本文中,我们提出了一种新的基于虚拟机管理程序的SSD缓存方案,采用一种新的度量来准确地确定每个虚拟机对SSD缓存空间的需求。计算机仿真结果表明,与现有方案相比,该方案大大提高了缓存空间分配的准确性。它还允许与现有方案相比的命中率,而虚拟机的SSD缓存数量较少。
{"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}
引用次数: 0
Hybrid Approach of Ontology and Image Clustering for Automatic Generation of Hierarchic Image Database 层次化图像数据库自动生成的本体与图像聚类混合方法
Pub Date : 2015-11-01 DOI: 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.
提出了一种基于本体和图像聚类的分层图像数据库自动生成方法。在计算机视觉领域,“通用目标识别”是一个重要的研究课题。通用目标识别需要三个方面的研究:特征提取、模式识别和数据库准备;本文针对数据库的编制。该方法同时考虑了图像中的对象语义和视觉特征。该方法采用本体框架覆盖语义相似性,基于高斯混合模型的图像聚类覆盖视觉相似性。该方法生成的图像数据库涵盖了4800多个概念(其中152个概念有超过100张图像),其结构是分层的。通过主观评价实验,检验数据库中的图像是否被正确映射。实验结果表明,平均精度在84%以上。结果表明,所生成的图像数据库作为通用目标识别的学习数据库是可行的。
{"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}
引用次数: 1
Handover Management based on Asymmetric Nature of LTE-A HetNet using MCDM Algorithm 基于MCDM算法的LTE-A HetNet非对称切换管理
Pub Date : 2015-11-01 DOI: 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.
本文提出了一种考虑LTE-A HetNet中宏蜂窝和微蜂窝不对称特性的高效切换方案。该方案利用多准则决策算法和用户设备的移动信息,检测出合适的目标eNB进行切换。当接收到的功率过低或下行信噪比低于阈值时,会触发终端的快速切换,避免射频链路故障。仿真结果表明,该方案在减少丢包和不必要的切换的同时,显著提高了good - put。
{"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}
引用次数: 2
An Energy Efficient Clustering Algorithm for Maximizing the Lifetime of Wireless Sensor Network 一种优化无线传感器网络生存期的高效聚类算法
Pub Date : 2015-11-01 DOI: 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.
在本文中,我们提出了一种节能的聚类算法来最大化wsn的生存期。该方案根据节点的能量等级确定簇头,并采用树形拓扑结构连接簇内节点。本文还推导了一个确定最优簇数的新模型。计算机仿真表明,与现有方案相比,该方案显著延长了网络生存期和消息传递率。
{"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}
引用次数: 3
A Routing Algorithm Solving the Container Problem in a Hypercube with Bit Constraint 一种解决位约束超立方体中容器问题的路由算法
Pub Date : 2015-11-01 DOI: 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.
正如TOP500列表所反映的那样,超立方体是大规模并行系统的流行互连网络,主要原因是这种网络拓扑的简单性和易于实现。为了保持高性能和避免瓶颈情况,路由算法是这些高性能系统的关键。此外,不相交路径路由是这种通信算法非常理想的特性。有效地,选择相互节点不相交的路径保证了臭名昭著的并行处理问题,如死锁、活锁和饥饿永远不会发生。本文描述了一种超立方体的路由算法,在给定位约束的情况下,选择满足约束的任意节点对之间的内部节点不相交路径,并且所选路径都满足约束。这种位约束的引入使得在满足不同位约束的多个节点对之间选择多组不相交的路径成为可能,这在传统的路由算法中是不可能的。在不同节点对之间选择同时不相交的路径可以提高通信性能和系统可靠性。正式证明了所描述算法的正确性和复杂性,并通过经验评价对算法在实践中的性能进行了分析。
{"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}
引用次数: 4
Development of an Effective Gaze Writing System with an Interface for Text Copy and Paste 具有文本复制粘贴界面的高效注视书写系统的开发
Pub Date : 2015-08-01 DOI: 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.
虽然现在有许多用于凝视书写(通过眼睛凝视输入文本)的接口,但这些接口只是键盘的替代品。为了提高注视书写的效率,本文提出了一种新的注视书写系统,该系统具有两种注视书写接口:(1)文本输入接口和(2)文本复制粘贴接口。通过对初级用户工作量评估的实验,从传统界面中选择文本输入界面。本文研究中新开发的文本复制粘贴界面,用户只需进行凝视交互,即可指定文本范围并将文本粘贴到所需位置。为克服注视指向精度不足的问题,该系统采用两步光标控制模型,依次进行初始光标的设置和调整。实验结果表明,该接口提高了注视书写的效率。
{"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}
引用次数: 1
Towards a Monitoring Framework for the Automatic Integration of the Access Control Policies for Web Services 面向Web服务访问控制策略自动集成的监控框架
Pub Date : 2015-08-01 DOI: 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.
云计算是一种新兴的业务计算模型,可用于维护处理器、网络、存储、操作系统、数据库和服务器等可配置资源。面向服务的体系结构(SoA)是部署在云上最成功的范例之一;是一种分层架构,用于将软件资源组织为服务,并促进其部署、发现和组合以生成新服务。在这些服务之间进行的创新的协调是SoA的一个关键挑战,因为此类服务中的任何失败都可能导致可用性的缺乏,这可能违反服务水平协议,从而导致经济处罚或客户不满。可以在系统中引入并集成称为协议服务的服务,以协调创新。然后可以将此服务与称为访问控制策略(AC_Policies)服务的服务链接,该服务标识协议服务的调用权限。接下来,将自动生成实时业务活动监视(BAM)指示板,以监督分配访问控制策略的过程以及Web服务执行的状态。这种方法是通过利用模型驱动体系结构(MDA)的功能来促进服务的自动生成来实现的。作为概念证明,这种方法是作为插件实现的。
{"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}
引用次数: 2
期刊
Int. J. Networked Distributed Comput.
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1