{"title":"A graded method for reasoning about n-valued R0 propositional logic","authors":"Qian Lan, Teng Ma","doi":"10.1109/CSAE.2011.5952710","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952710","url":null,"abstract":"The concept of pure truth degrees of propositions in the n-valued R0 logic system is introduced by means of infinite product of uniformly distributed probability spaces of cardinal n. Similarity degrees among formulas are proposed and a pseudo-metric is defined therefrom on the set of formulas. In the end, two kinds of approximate reasoning scheme are given and hence another possible framework suitable for developing graded reasoning in n-valued R0 propositional logic is established.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116423547","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}
S. Hassanpour, Y. Vejdanparast, Bahareh Asadi, P. Zargar
{"title":"Improving reliability of routing in Wireless Body Area Sensor Networks using Genetic Algorithm","authors":"S. Hassanpour, Y. Vejdanparast, Bahareh Asadi, P. Zargar","doi":"10.1109/CSAE.2011.5952540","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952540","url":null,"abstract":"Wireless Body Area Sensor Networks is a highly distributed network, which its nodes are the organizer itself and each of them has the ability of gathering and sending patient biomedical data to a terminal, which called sink. When data sent to sink from a path that does not have a distinct basis, the routing is an important challenge in Wireless Body Area Sensor Networks, also reliability and routing delay is considerable factors in these types of networks. A new method for improvement of routing which is using Genetic Algorithm proposed in this paper, such that for each of mentioned factors a weight based on their importance is specifying that have been repeated over the races and have improved the reliability and delay. Analysis and assess of proposed algorithm simulation results in MATLAB, show a remarkable improvement than other conventional methods.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122608484","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}
{"title":"A novel description of the reproducing kernel support vector machines","authors":"Lixiang Xu, B. Luo, Feng-hai Yu, Jin Xie","doi":"10.1109/CSAE.2011.5952940","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952940","url":null,"abstract":"Support vector machines (SVMs) and related kernel-based algorithms have become one of the most popular approaches for many machine learning problems. but little is known about the structure of their reproducing kernel Hilbert spaces (RKHS). In this work, based on Mercer's Theorem, the relation among reproducing kernel (RK) and Mercer kernel, and their roles in SVMs are discussed, corresponding to some important theorems and consequences are given. Furthermore, a novel framework of reproducing kernel support vector machines (RKSVM) is proposed. The simulation results are presented to illustrate the feasibility of the proposed method. Choosing a proper Mercer kernel for different tasks is an important factor for studying the result of the SVMs.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122635925","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}
{"title":"A new ontology for fault tolerance in QoS-enabled service oriented systems","authors":"Zahraa M. S. Almasslawi, Dawood M. S. Almasslawi","doi":"10.1109/CSAE.2011.5952811","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952811","url":null,"abstract":"Semantic web today is considered to be the extended limit of the World Wide Web and in recent years there has been promising advancements with great potential in the field of semantic computing. We see semantic applications emerging not only in web environment but in different industries to realize its utility in explicit expression of data in enterprises. This proved to have a rather excellent outcome in semantic web implementations but the true power of semantic web lies in service composition. Semantic web service composition could take the most advantage from the semantic data for finding the optimum combination of web services. Quality of Service (QoS) parameters are known as critical factors for selecting the web service with the best attributes but yet remain a statistic and metric form of data. QoS attributes are usually estimated trough formulas and mostly inaccurate which leads to composition failure and raises the need for fault tolerance and its mechanisms. So far there has been little work done to make the fault tolerance more compatible with the semantic web. In this paper we propose a more profound solution for this problem with the use of semantic web technologies for fault tolerance. A new ontology for fault tolerance is introduced which essentially improves the web service composition performance with providing a fault detection and recovery guidance system.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114477385","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}
{"title":"Development of educational camera games for children","authors":"Fei Xie, Shan Cai, Ben Cheng, Chao Chen","doi":"10.1109/CSAE.2011.5952697","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952697","url":null,"abstract":"By analyzing the educational effects of computer games on children's physical and mental development, this paper brings forward the guidelines for developing educational camera games, which consists of specifying target group, topics, objects, rules, outcomes and interaction style, and proposing an organization chart. The paper focuses on the computer vision-based interaction style, which combines the robustness improvement of moving object detection by an adaptive threshold, the moving object tracking based on modified contrast context histogram feature, and finally the gesture recognition based on the nearest neighbor. This novel design not only enables children to interact with the game world more naturally and directly, but facilitates some physical exercise meanwhile. Results show that this type of computer games can stimulate children's interest more effectively and supply them with more motivation to cope with learning.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"158 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122091327","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}
{"title":"Research on P2P routing model based on clustering and position of nodes","authors":"M. Hui, Yang Chen","doi":"10.1109/CSAE.2011.5952476","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952476","url":null,"abstract":"Studying at the existed P2P network,Aiming at the issues of communication latency increasing and network costs raising which caused by mismatch between logical topology and physical topology, combining with the clustering of P2P, the thesis proposes a three-tier P2P network model based on clustering and position of nodes in IPv6. In the model, neighbor nodes in physical topology compose domains, nodes with the same property compose a group in every domain, it chooses nodes with the best capability as the intelligent nodes of groups or as the routing nodes of domains by calculating the capability of nodes, and selects routing and forwards datum according to the property similarity and the resources routing table. Simulation result shows the model can shorten search latency, enhance the efficiency of resource search and recall ratio.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116676286","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}
Hongzhi Song, Zhaoming Ou, Yi Fu, Xiangxin Lin, Lei Yang
{"title":"Operational transformation algorithm with conflict detection and awareness methods for real-time collaborative editing in P2P environments","authors":"Hongzhi Song, Zhaoming Ou, Yi Fu, Xiangxin Lin, Lei Yang","doi":"10.1109/CSAE.2011.5952536","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952536","url":null,"abstract":"With the development of Computer Supported Cooperative Work (CSCW), groupware systems that support collaborative editing have been developing rapidly. Real-time collaborative editing system is groupware systems that allow groups of users from different sites to view and edit the same documents at the same time. Consistency maintenance is one of the most important challenges in the design of these systems. Many algorithms for consistency maintenance which have good performance with Client/Server mode can't work in Peer-to-Peer (P2P) environments. In this paper, we propose an operational transformation algorithm with conflict detection and awareness methods for real-time collaborative editing in P2P environments, where conflict awareness is a reasonable way to help users to solve conflict problems. We designed and implemented a real-time collaborative editor using our algorithm. The experiment results showed that our algorithm is viable and feasible.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117022350","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}
{"title":"The improvement of S-MAC based on dynamic duty cycle in wireless sensor network","authors":"Haigang Hu, Jie Min, Xiaodong Wang, Yu Zhou","doi":"10.1109/CSAE.2011.5953235","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5953235","url":null,"abstract":"Wireless sensor network is formed by a great deal of sensor nodes, which are generally battery-powered and may not recharge easily. Consequently, how to prolong the lifetime of the nodes is an important issue when designing protocol in wireless sensor network. However, lowering the energy consumption may result in higher latency. To address on such tradeoff, this paper proposes ADC-SMAC to improve S-MAC. ADC-MAC adjusts duty cycle dynamically based on utilization, average sleeping delay, the upper and lower bound of duty cycle. The experiment results show that our proposed ADC-SMAC saves energy about 43% and reduce latency by 65% from S-MAC in a chain topology. In the cross topology, ADC-SMAC also achieves 32%energy saving and 45%latency reduction from S-MAC.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129621741","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}
{"title":"Personalized anonymity in social networks data publication","authors":"Lihui Lan, Hua Jin, Yang Lu","doi":"10.1109/CSAE.2011.5953265","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5953265","url":null,"abstract":"Social networks consist of entities connected by links representing relations. Social networks applications have become popular for sharing information. Many social networks contain highly sensitive data. So some privacy preservation technologies are already proposed in social networks data publication. However, the existing technologies focus on a universal approach that exerts the same level of preservation for all entities, without catering for their concrete needs. Motivated by this, we present a k-neighborhood anonymous method based on the concept of personalized anonymity. We divide entities into sensitive and non-sensitive. The entities declare their publication requests when submitting data. Our technique performs the minimum modification on origin social networks for satisfying every entity's neighborhood privacy requirement and retains the largest amount of information from the published networks. We develop an algorithm against 1-neighborhood attack and execute experiments on the synthetic dataset to study the utility and publication quality.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129727817","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}
{"title":"A single neuron PID controller for tension control based on RBF NN identification","authors":"Wang Yu, Qi Xiao-yao, Zhuang Jiang","doi":"10.1109/CSAE.2011.5952659","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952659","url":null,"abstract":"Tension control in FGS (flexible graphite sheet) forming process is crucial to ensure product quality. Because the traditional PID controller is ineffective to regulate the tension when the radius of the unwinding roll is getting smaller, a single neuron adaptive PID controller based on RBFNN (Radial Basis Function neural network) identification is proposed to improve the system performance. RBFNN identifies accurate Jacobian information first and then the single neuron controller adjusts PID parameters is for implementation. The simulation results show that, compared to traditional PID controller, the method possesses the advantages of high precision, quick response and great adaptability and robustness.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128419462","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}