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}
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.
{"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}
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.
{"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}
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.
{"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}
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}
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}
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.
{"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}
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.
{"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}
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.
{"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}
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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：