首页 > 最新文献

HumanMachine Communication Journal最新文献

英文 中文
A Model of Learning Climate Formation Based on Small-World Network 基于小世界网络的学习气候形成模型
Q1 Social Sciences Pub Date : 2010-04-24 DOI: 10.1109/MVHI.2010.126
Zhou Li, Yuan-biao Zhang
Forming excellent learning climate is vital both for a school and for students. Traditional researches tend to analyze the problem in theory so that we can hardly find papers with precise mathematical models. In this paper, we construct a small-world network to represent the personal relation network among school students, and use all the students’ learning attitudes to represent the school’s learning climate. Based on it we build an learning climate formation model with considering students’ consistent degree, the friendly degree among students and the influences of teachers and parents. During the simulation, we analyze the effect of different impact factor on learning climate formation. It proves teachers and parents have a significant impact on the formation of learning climate. They should take appropriate measures to help students form favorable learning habits.
形成良好的学习氛围对学校和学生都至关重要。传统的研究倾向于从理论上分析问题,很难找到具有精确数学模型的论文。本文构建了一个小世界网络来代表学校学生之间的人际关系网络,用所有学生的学习态度来代表学校的学习氛围。在此基础上,构建了考虑学生一致度、学生友好度、教师和家长影响的学习氛围形成模型。在模拟过程中,分析了不同影响因子对学习气候形成的影响。这证明了教师和家长对学习氛围的形成有着重要的影响。他们应该采取适当的措施帮助学生养成良好的学习习惯。
{"title":"A Model of Learning Climate Formation Based on Small-World Network","authors":"Zhou Li, Yuan-biao Zhang","doi":"10.1109/MVHI.2010.126","DOIUrl":"https://doi.org/10.1109/MVHI.2010.126","url":null,"abstract":"Forming excellent learning climate is vital both for a school and for students. Traditional researches tend to analyze the problem in theory so that we can hardly find papers with precise mathematical models. In this paper, we construct a small-world network to represent the personal relation network among school students, and use all the students’ learning attitudes to represent the school’s learning climate. Based on it we build an learning climate formation model with considering students’ consistent degree, the friendly degree among students and the influences of teachers and parents. During the simulation, we analyze the effect of different impact factor on learning climate formation. It proves teachers and parents have a significant impact on the formation of learning climate. They should take appropriate measures to help students form favorable learning habits.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86823464","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
Multi-objective Ant Colony Optimization Algorithm for Shortest Route Problem 最短路径问题的多目标蚁群优化算法
Q1 Social Sciences Pub Date : 2010-04-24 DOI: 10.1109/MVHI.2010.67
Xiankun Sun, Xiaoming You, Sheng Liu
A novel Multi-objective Ant Colony Optimization algorithm for shortest route problem (MACO) is proposed. Firstly, the pheromone on every path segment is initialized to an initial value and ants are randomly distributed among cities. Secondly, self-adaptive operator is used, namely in prophase we use higher probability to explore more search space and to collect useful global information; otherwise in anaphase we use higher probability to accelerate convergence. MACO algorithm adopts self-adaptive operator to make the search scope reduced in anaphase, thus the search time of this algorithm is reduced greatly. Real shortest route results demonstrate the superiority of MACO in this paper.
针对最短路径问题,提出了一种新的多目标蚁群优化算法。首先,将每个路径段上的信息素初始化为初始值,并将蚂蚁随机分布在城市中。其次,采用自适应算子,即前期利用较高的概率探索更多的搜索空间,收集有用的全局信息;否则在后期我们使用更高的概率来加速收敛。MACO算法采用自适应算子使后期搜索范围缩小,从而大大缩短了算法的搜索时间。实际最短路由结果证明了MACO算法的优越性。
{"title":"Multi-objective Ant Colony Optimization Algorithm for Shortest Route Problem","authors":"Xiankun Sun, Xiaoming You, Sheng Liu","doi":"10.1109/MVHI.2010.67","DOIUrl":"https://doi.org/10.1109/MVHI.2010.67","url":null,"abstract":"A novel Multi-objective Ant Colony Optimization algorithm for shortest route problem (MACO) is proposed. Firstly, the pheromone on every path segment is initialized to an initial value and ants are randomly distributed among cities. Secondly, self-adaptive operator is used, namely in prophase we use higher probability to explore more search space and to collect useful global information; otherwise in anaphase we use higher probability to accelerate convergence. MACO algorithm adopts self-adaptive operator to make the search scope reduced in anaphase, thus the search time of this algorithm is reduced greatly. Real shortest route results demonstrate the superiority of MACO in this paper.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89168558","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}
引用次数: 8
The Network Security Issue of 3G Mobile Communication System Research 3G移动通信系统的网络安全问题研究
Q1 Social Sciences Pub Date : 2010-04-24 DOI: 10.1109/MVHI.2010.47
Wenqiong Yu
In this paper, real cases are cited to explain the security???crisis in current mobile telecommunication networks so as to heighten mobile communication users’ awareness of cell phone viruses and solutions to the security system of mobile communication network explained Now, the security system’s building of 3G mobile communication network is an important problem need to be solved soon. The research of this dissertation is focused on the security framework of 3G mobile communication networks, and it is very significant to construct the secure 3G information system in our country.
本文以实际案例对安全问题进行了说明。从而提高移动通信用户对手机病毒的认识,并对移动通信网络安全体系的解决方案进行阐述。现在,3G移动通信网络安全体系的建设是一个急需解决的重要问题。本文的研究重点是3G移动通信网络的安全框架,对构建我国安全的3G信息系统具有重要意义。
{"title":"The Network Security Issue of 3G Mobile Communication System Research","authors":"Wenqiong Yu","doi":"10.1109/MVHI.2010.47","DOIUrl":"https://doi.org/10.1109/MVHI.2010.47","url":null,"abstract":"In this paper, real cases are cited to explain the security???crisis in current mobile telecommunication networks so as to heighten mobile communication users’ awareness of cell phone viruses and solutions to the security system of mobile communication network explained Now, the security system’s building of 3G mobile communication network is an important problem need to be solved soon. The research of this dissertation is focused on the security framework of 3G mobile communication networks, and it is very significant to construct the secure 3G information system in our country.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77069188","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
Algorithms for Random Adjacency Matrixes Generation Used for Scheduling Algorithms Test 随机邻接矩阵生成算法,用于调度算法测试
Q1 Social Sciences Pub Date : 2010-04-24 DOI: 10.1109/MVHI.2010.190
Yingfeng Wang, Zhijing Liu, Wei Yan
In order to meet the testing requirements of task scheduling algorithms, this paper proposes two algorithms for generating random adjacency matrixes. One algorithm is used for generating random adjacency matrixes representing either directed cyclic graphs or directed acyclic graphs. The other algorithm is used for generating directed acyclic graphs only. The paper analyses the characters of elements of an adjacency matrix, and applies a square matrix with elements falling into a Gaussian distribution and the technique of descending order to achieve a random adjacency matrix. We conduct experiments on our algorithms using MATLAB. The experimental results show that the algorithms have high efficiencies, and adjacency matrixes which represent task graphs with dozens of nodes and dozens of edges can be generated in one minute. Those random adjacency matrixes generated by the algorithms are suited for task scheduling algorithms which use random adjacency matrixes to verify validities.
为了满足任务调度算法的测试要求,本文提出了两种随机邻接矩阵的生成算法。一种算法用于生成表示有向循环图或有向无环图的随机邻接矩阵。另一种算法仅用于生成有向无环图。本文分析了邻接矩阵中元素的特征,采用元素服从高斯分布的方阵和降序技术实现了随机邻接矩阵。我们使用MATLAB对我们的算法进行了实验。实验结果表明,该算法具有较高的效率,可以在1分钟内生成具有数十个节点和数十条边的任务图邻接矩阵。算法生成的随机邻接矩阵适用于使用随机邻接矩阵验证有效性的任务调度算法。
{"title":"Algorithms for Random Adjacency Matrixes Generation Used for Scheduling Algorithms Test","authors":"Yingfeng Wang, Zhijing Liu, Wei Yan","doi":"10.1109/MVHI.2010.190","DOIUrl":"https://doi.org/10.1109/MVHI.2010.190","url":null,"abstract":"In order to meet the testing requirements of task scheduling algorithms, this paper proposes two algorithms for generating random adjacency matrixes. One algorithm is used for generating random adjacency matrixes representing either directed cyclic graphs or directed acyclic graphs. The other algorithm is used for generating directed acyclic graphs only. The paper analyses the characters of elements of an adjacency matrix, and applies a square matrix with elements falling into a Gaussian distribution and the technique of descending order to achieve a random adjacency matrix. We conduct experiments on our algorithms using MATLAB. The experimental results show that the algorithms have high efficiencies, and adjacency matrixes which represent task graphs with dozens of nodes and dozens of edges can be generated in one minute. Those random adjacency matrixes generated by the algorithms are suited for task scheduling algorithms which use random adjacency matrixes to verify validities.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77677753","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}
引用次数: 14
Social Network Based Marketing in Mobile Phone Users' Community 基于社交网络的手机用户社区营销
Q1 Social Sciences Pub Date : 2010-04-24 DOI: 10.1109/MVHI.2010.11
Yang Liu, He Wan, Xuecheng Yang
The fast development of mobile communication network connects everyone and its network features make social network marketing suitable for mobile users’ community. Based on previous study of influencers and diffusion theory with related models, we can find proper methods to make strategies to apply social network marketing into mobile services application. The key in this process is to find the right influencers, launch effective advertising and control negative effect.
移动通信网络的快速发展连接着每一个人,它的网络特性使得社交网络营销适合于移动用户群体。基于前人对影响者和扩散理论的研究以及相关模型,我们可以找到合适的方法来制定将社交网络营销应用到移动服务应用中的策略。在这个过程中,关键是找到合适的影响者,投放有效的广告,控制负面影响。
{"title":"Social Network Based Marketing in Mobile Phone Users' Community","authors":"Yang Liu, He Wan, Xuecheng Yang","doi":"10.1109/MVHI.2010.11","DOIUrl":"https://doi.org/10.1109/MVHI.2010.11","url":null,"abstract":"The fast development of mobile communication network connects everyone and its network features make social network marketing suitable for mobile users’ community. Based on previous study of influencers and diffusion theory with related models, we can find proper methods to make strategies to apply social network marketing into mobile services application. The key in this process is to find the right influencers, launch effective advertising and control negative effect.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81112030","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 Geometric Method for the Path Generation of a Robot 机器人路径生成的几何方法
Q1 Social Sciences Pub Date : 2010-04-24 DOI: 10.1109/MVHI.2010.160
Linan Jiao, Zhaoyun Sun, A. Sha
In robot motion planning, Generalized Voronoi Diagram (GVD) is a kind of important geometric method for path generation. The method of figuring out GVD can be categorized into direct and approximated methods. The paper combines VDC (Van Der Corput) sampling sequence and an approximated method to design a GVD algorithm based on VDC sampling sequence. The algorithm improves common approximated GVD algorithm, sampling process is incremental and precision is controllable, thus current GVD algorithm performance is enhanced.
在机器人运动规划中,广义Voronoi图(GVD)是一种重要的路径生成几何方法。计算GVD的方法可分为直接法和近似法。本文结合VDC (Van Der Corput)采样序列和一种近似方法,设计了一种基于VDC采样序列的GVD算法。该算法改进了常用的近似GVD算法,采样过程是增量的,精度是可控的,从而提高了当前GVD算法的性能。
{"title":"A Geometric Method for the Path Generation of a Robot","authors":"Linan Jiao, Zhaoyun Sun, A. Sha","doi":"10.1109/MVHI.2010.160","DOIUrl":"https://doi.org/10.1109/MVHI.2010.160","url":null,"abstract":"In robot motion planning, Generalized Voronoi Diagram (GVD) is a kind of important geometric method for path generation. The method of figuring out GVD can be categorized into direct and approximated methods. The paper combines VDC (Van Der Corput) sampling sequence and an approximated method to design a GVD algorithm based on VDC sampling sequence. The algorithm improves common approximated GVD algorithm, sampling process is incremental and precision is controllable, thus current GVD algorithm performance is enhanced.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77268488","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
Gaussian Mixture Model Segmentation Algorithm for Remote Sensing Image 遥感图像高斯混合模型分割算法
Q1 Social Sciences Pub Date : 2010-04-24 DOI: 10.1109/MVHI.2010.152
Yimin Hou, Xiaoli Sun, Xiangmin Lun, Jianjun Lan
The paper proposed a novel method for remote sensing image segmentation based on mixture model. The remote sensing image data would be considered as Gaussian mixture model. The image segmentation result was corresponding to the image label field which was a Markov Random Field(MRF). So, the image segmentation procedure was transformed to a Maximum A Posteriori(MAP) problem by Beyesian theorem. The intensity difference and the spatial distance between the two pixels in the same clique were employed in the potential function. The Iterative Conditional Model(ICM) is employed to solve MAP. In the experiments, the method is compared with the traditional MRF segmentation method using ICM and simulate annealing(SA). The experiments proved that this algorithm was more efficient than the traditional MRF one.
提出了一种基于混合模型的遥感图像分割新方法。将遥感影像数据视为高斯混合模型。图像分割结果对应的图像标签字段为马尔可夫随机场(MRF)。因此,利用贝叶斯定理将图像分割过程转化为最大后验问题(MAP)。在势函数中使用了同一团中两个像素点的强度差和空间距离。采用迭代条件模型(ICM)求解MAP。在实验中,将该方法与传统的基于ICM和模拟退火(SA)的MRF分割方法进行了比较。实验证明,该算法比传统的磁流变函数算法效率更高。
{"title":"Gaussian Mixture Model Segmentation Algorithm for Remote Sensing Image","authors":"Yimin Hou, Xiaoli Sun, Xiangmin Lun, Jianjun Lan","doi":"10.1109/MVHI.2010.152","DOIUrl":"https://doi.org/10.1109/MVHI.2010.152","url":null,"abstract":"The paper proposed a novel method for remote sensing image segmentation based on mixture model. The remote sensing image data would be considered as Gaussian mixture model. The image segmentation result was corresponding to the image label field which was a Markov Random Field(MRF). So, the image segmentation procedure was transformed to a Maximum A Posteriori(MAP) problem by Beyesian theorem. The intensity difference and the spatial distance between the two pixels in the same clique were employed in the potential function. The Iterative Conditional Model(ICM) is employed to solve MAP. In the experiments, the method is compared with the traditional MRF segmentation method using ICM and simulate annealing(SA). The experiments proved that this algorithm was more efficient than the traditional MRF one.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86946122","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
Bismuth-film Glassy Carbon Electrode for the Determination of Lead by Differential Pulse Stripping Voltammetric 差分脉冲溶出伏安法测定铅的铋膜玻碳电极
Q1 Social Sciences Pub Date : 2010-04-24 DOI: 10.1109/MVHI.2010.140
H. Men, Shanshan Zhang, Ping Zhang, Shanrang Yang, Zhiming Xu
This paper presents a new technology using Bismuth-film to determinate lead instead of mercury film. It is proved in the experiment that, in the optimum measuring situation (when the pH is 4, deposition time is 150s, and the deposition potential is 0.8.), the lead concentration and stripping peak current shows a good linear relationship in the measuring range of 10 to 110ug/L, which is I=0.1002C+0.0539. The experimental analysis shows that the concentration of lead in tea samples is 1.667μg / g, and the recovery rate is 91.2% ~ 101.8%. It is proved that the method of bismuth film electrode is used to measure lead with advantages of convenience, speediness, sensitivity and accuracy, etc.
本文提出了用铋膜代替汞膜测定铅的新技术。实验证明,在最佳测量条件下(pH = 4,沉积时间为150s,沉积电位为0.8),铅浓度与溶出峰电流在10 ~ 110ug/L的测量范围内呈良好的线性关系,即I=0.1002C+0.0539。实验分析表明,茶叶样品中铅的浓度为1.667μg / g,回收率为91.2% ~ 101.8%。实践证明,采用铋膜电极法测量铅具有方便、快速、灵敏、准确等优点。
{"title":"Bismuth-film Glassy Carbon Electrode for the Determination of Lead by Differential Pulse Stripping Voltammetric","authors":"H. Men, Shanshan Zhang, Ping Zhang, Shanrang Yang, Zhiming Xu","doi":"10.1109/MVHI.2010.140","DOIUrl":"https://doi.org/10.1109/MVHI.2010.140","url":null,"abstract":"This paper presents a new technology using Bismuth-film to determinate lead instead of mercury film. It is proved in the experiment that, in the optimum measuring situation (when the pH is 4, deposition time is 150s, and the deposition potential is 0.8.), the lead concentration and stripping peak current shows a good linear relationship in the measuring range of 10 to 110ug/L, which is I=0.1002C+0.0539. The experimental analysis shows that the concentration of lead in tea samples is 1.667μg / g, and the recovery rate is 91.2% ~ 101.8%. It is proved that the method of bismuth film electrode is used to measure lead with advantages of convenience, speediness, sensitivity and accuracy, etc.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85676404","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
Research on Database Encryption of OA System OA系统数据库加密技术研究
Q1 Social Sciences Pub Date : 2010-04-24 DOI: 10.1109/MVHI.2010.79
Jianfei He, X. Guan
For the current database security issues of office automation system, A database encryption scheme is proposed in this paper, which according to authority, roles, and the different encryption granularity of the database, not only ensure data security, but also improve the efficiency of system management. In order to enhance the security of the database, using ECC (elliptic curve encryption algorithm) flexibly, fully ensure the store of sensitive data’s security. Through experiments and performance analysis, the method can ensure the security of the database effectively.
针对当前办公自动化系统中存在的数据库安全问题,本文提出了一种数据库加密方案,该方案根据数据库的权限、角色以及不同的加密粒度,既保证了数据的安全,又提高了系统管理的效率。为了增强数据库的安全性,灵活采用ECC(椭圆曲线加密算法),充分保证存储敏感数据的安全性。通过实验和性能分析,该方法可以有效地保证数据库的安全性。
{"title":"Research on Database Encryption of OA System","authors":"Jianfei He, X. Guan","doi":"10.1109/MVHI.2010.79","DOIUrl":"https://doi.org/10.1109/MVHI.2010.79","url":null,"abstract":"For the current database security issues of office automation system, A database encryption scheme is proposed in this paper, which according to authority, roles, and the different encryption granularity of the database, not only ensure data security, but also improve the efficiency of system management. In order to enhance the security of the database, using ECC (elliptic curve encryption algorithm) flexibly, fully ensure the store of sensitive data’s security. Through experiments and performance analysis, the method can ensure the security of the database effectively.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81708071","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
An Investigation of Two-Handed Manipulation and Related Techniques in Multi-touch Interaction 多点触控交互中双手操作及相关技术的研究
Q1 Social Sciences Pub Date : 2010-04-24 DOI: 10.1109/MVHI.2010.27
Xiaodan Jiao, H. Deng, Feng Wang
Multi-touch technique is a novel interactive technique that supports one finger or more to manipulate simultaneously. Thus, the bimanual interaction on the touch screen has been proved as a valuable input form with high degree of freedom (DOF). However, the drawbacks such as high error rate for target selection, hand fatigue and poor gesture extension critically limit the bimanual interaction on multi-touch environment. These drawbacks are mainly ascribed to the irrationality between hand input and software mapping, inconsistent gesture operation and immature gesture recognization techniques. In this paper1, we investigate the related literatures about two-handed interaction techniques in multi-touch devices and discuss the drawbacks of current two-handed interaction techniques. Finally, we present some promising directions for future research.
多点触控技术是一种支持单指或多指同时操作的新型交互技术。因此,在触摸屏上的人机交互被证明是一种有价值的高自由度输入形式。然而,目标选择错误率高、手部疲劳和手势扩展性差等缺点严重限制了多点触控环境下的人机交互。这些缺陷主要是由于手输入与软件映射的不合理、手势操作的不一致以及手势识别技术的不成熟。在本文中,我们研究了多点触控设备中双手交互技术的相关文献,并讨论了当前双手交互技术的缺陷。最后,对今后的研究方向进行了展望。
{"title":"An Investigation of Two-Handed Manipulation and Related Techniques in Multi-touch Interaction","authors":"Xiaodan Jiao, H. Deng, Feng Wang","doi":"10.1109/MVHI.2010.27","DOIUrl":"https://doi.org/10.1109/MVHI.2010.27","url":null,"abstract":"Multi-touch technique is a novel interactive technique that supports one finger or more to manipulate simultaneously. Thus, the bimanual interaction on the touch screen has been proved as a valuable input form with high degree of freedom (DOF). However, the drawbacks such as high error rate for target selection, hand fatigue and poor gesture extension critically limit the bimanual interaction on multi-touch environment. These drawbacks are mainly ascribed to the irrationality between hand input and software mapping, inconsistent gesture operation and immature gesture recognization techniques. In this paper1, we investigate the related literatures about two-handed interaction techniques in multi-touch devices and discuss the drawbacks of current two-handed interaction techniques. Finally, we present some promising directions for future research.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89723441","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}
引用次数: 10
期刊
HumanMachine Communication Journal
全部 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