Pub Date : 2013-01-01Epub Date: 2013-11-27DOI: 10.1016/j.aasri.2013.10.061
Leilei Li , Jingfeng Feng , Jianhui He , Jonathon A. Chambers
In this work, an adaptive algorithm with variable tap-length is proposed for diffusion networks, where all nodes exchange information with their connected group without a fusion center and utilize both exchanged information and their local observation to make their individual estimations. Based on a fractional tap-length solution and the fully distributed structure of networks, we propose the algorithm to resolve the estimation problems on both tap-length and tap-weights. The proposed algorithm with adaptive tap-length structure enables the networks to reduce communication energy and network resources. The convergence properties of this algorithm are confirmed by the simulation results.
{"title":"A Distributed Variable Tap-length Algorithm within Diffusion Adaptive Networks","authors":"Leilei Li , Jingfeng Feng , Jianhui He , Jonathon A. Chambers","doi":"10.1016/j.aasri.2013.10.061","DOIUrl":"10.1016/j.aasri.2013.10.061","url":null,"abstract":"<div><p>In this work, an adaptive algorithm with variable tap-length is proposed for diffusion networks, where all nodes exchange information with their connected group without a fusion center and utilize both exchanged information and their local observation to make their individual estimations. Based on a fractional tap-length solution and the fully distributed structure of networks, we propose the algorithm to resolve the estimation problems on both tap-length and tap-weights. The proposed algorithm with adaptive tap-length structure enables the networks to reduce communication energy and network resources. The convergence properties of this algorithm are confirmed by the simulation results.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 77-84"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.061","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79922849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-01-01Epub Date: 2013-11-27DOI: 10.1016/j.aasri.2013.10.082
Wenxuan Shi , Maoqiang Xie
Spam and spam filters are contrarious components of a complex interdependent social ecosystem. Traditional spam filtering techniques or systems are usually designed and deployed individually that neglect the distributed and bulk characteristics of spam. This paper proposes a reputation-based collaborative anti-spam approach. This approach, adopting fingerprinting technique, evaluating reporters’ trust, achieved better performance and robustness than the state-of-the-art in comparison experiments on several known email corpora.
{"title":"A Reputation-based Collaborative Approach for Spam Filtering","authors":"Wenxuan Shi , Maoqiang Xie","doi":"10.1016/j.aasri.2013.10.082","DOIUrl":"10.1016/j.aasri.2013.10.082","url":null,"abstract":"<div><p>Spam and spam filters are contrarious components of a complex interdependent social ecosystem. Traditional spam filtering techniques or systems are usually designed and deployed individually that neglect the distributed and bulk characteristics of spam. This paper proposes a reputation-based collaborative anti-spam approach. This approach, adopting fingerprinting technique, evaluating reporters’ trust, achieved better performance and robustness than the state-of-the-art in comparison experiments on several known email corpora.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 220-227"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.082","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88061971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper first describes the relationship between the smart grid and smart AVC. By some problems of the conventional AVC's practical application connecting with the actual situation of the current grid development, this paper points out that the traditional AVC is unable to adapt to the development needs of the current grid and the tendency of intelligent AVC development.Through the research and the comprehensive exposition of the embedded Smart AVC, including intelligent AVC's new features, it points out that the future development direction of the Smart AVC and some features needs.
{"title":"The Research of the Transition from Traditional AVC to Smart AVC","authors":"Huizhong Xu , Xiaoqun Ding , Jing Shi , Guangyu Chen","doi":"10.1016/j.aasri.2013.10.002","DOIUrl":"10.1016/j.aasri.2013.10.002","url":null,"abstract":"<div><p>This paper first describes the relationship between the smart grid and smart AVC. By some problems of the conventional AVC's practical application connecting with the actual situation of the current grid development, this paper points out that the traditional AVC is unable to adapt to the development needs of the current grid and the tendency of intelligent AVC development.Through the research and the comprehensive exposition of the embedded Smart AVC, including intelligent AVC's new features, it points out that the future development direction of the Smart AVC and some features needs.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"4 ","pages":"Pages 2-8"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.002","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80912736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-01-01Epub Date: 2013-11-27DOI: 10.1016/j.aasri.2013.10.072
Hamdi Hassen , Maher Khemakhem
This paper proposes a robust, efficient and scalable distributed Arabic handwriting OCR system based on a parallel FastDTW algorithm via cloud computing technologies. The three techniques Hadoop, MapReduce and Cascading are used to implement the parallel FastDTW algorithm. The experiments were deployed on Amazon EC2 Elastic Map Reduce and Amazon Simple Storage Service (S3) using a large scaled dataset built from the IFN/ENIT database.
基于并行FastDTW算法,利用云计算技术,提出了一种鲁棒、高效、可扩展的分布式阿拉伯手写OCR系统。采用Hadoop、MapReduce和Cascading三种技术实现并行FastDTW算法。实验部署在Amazon EC2 Elastic Map Reduce和Amazon Simple Storage Service (S3)上,使用从IFN/ENIT数据库构建的大型数据集。
{"title":"Large Distributed Arabic Handwriting Recognition System based on the Combination of FastDTW Algorithm and Map-reduce Programming Model via Cloud Computing Technologies","authors":"Hamdi Hassen , Maher Khemakhem","doi":"10.1016/j.aasri.2013.10.072","DOIUrl":"10.1016/j.aasri.2013.10.072","url":null,"abstract":"<div><p>This paper proposes a robust, efficient and scalable distributed Arabic handwriting OCR system based on a parallel FastDTW algorithm via cloud computing technologies. The three techniques Hadoop, MapReduce and Cascading are used to implement the parallel FastDTW algorithm. The experiments were deployed on Amazon EC2 Elastic Map Reduce and Amazon Simple Storage Service (S3) using a large scaled dataset built from the IFN/ENIT database.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 156-163"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.072","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90566629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-01-01Epub Date: 2013-11-27DOI: 10.1016/j.aasri.2013.10.079
Yingfei Wu , Zhenming Yuan , Dibin Zhou , Yizhou Cai
Traditional method to learn Chinese calligraphy needs long hour's practice and the practice process often makes learners feel boring. And learners cannot get instant evaluation result during training. In this paper we introduce a new mobile Chinese Calligraphic training system based on virtual reality. The system is inspired by the way of tradition way to learn calligraphy which includes three main steps: a) learning stroke order of character; b) copying writing; c) real writing. Firstly the system demonstrates the right stroke order of calligraphic character with 2D and 3D mode. Secondly learner can write on iPad screen to practice copying writing. Meanwhile the leaner's writing track will be captured and evaluated according the similarity. The result of user studies shows that our system can successfully guide learners to improve their writing skills and motive them to learn calligraphy.
{"title":"A Mobile Chinese Calligraphic Training System Using Virtual Reality Technology","authors":"Yingfei Wu , Zhenming Yuan , Dibin Zhou , Yizhou Cai","doi":"10.1016/j.aasri.2013.10.079","DOIUrl":"10.1016/j.aasri.2013.10.079","url":null,"abstract":"<div><p>Traditional method to learn Chinese calligraphy needs long hour's practice and the practice process often makes learners feel boring. And learners cannot get instant evaluation result during training. In this paper we introduce a new mobile Chinese Calligraphic training system based on virtual reality. The system is inspired by the way of tradition way to learn calligraphy which includes three main steps: a) learning stroke order of character; b) copying writing; c) real writing. Firstly the system demonstrates the right stroke order of calligraphic character with 2D and 3D mode. Secondly learner can write on iPad screen to practice copying writing. Meanwhile the leaner's writing track will be captured and evaluated according the similarity. The result of user studies shows that our system can successfully guide learners to improve their writing skills and motive them to learn calligraphy.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 200-208"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.079","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83993813","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-01-01Epub Date: 2013-11-27DOI: 10.1016/j.aasri.2013.10.067
Bi-lin Shao , Gen-qing Bian , Wei-qi Zhang
Focusing on the existing location technology limited the performance of the algorithm, distributed data location strategies DLPSL based on weights of jump table is presented to solve the efficiency problem. Weights are added to nodes of jump table, so that the high rate of location of the storage node priority is found to short the search path, and improve the storage and location efficiency. System analysis shows that, the node's insertion, deleting, and location on DLPSL are more efficient than single-linked list storage structure and skip graphic. Its time complexity is 0(log n), and space complexity is 0(n).
{"title":"The Method of Distribute Data Storage and Location on Weights of Jump Table","authors":"Bi-lin Shao , Gen-qing Bian , Wei-qi Zhang","doi":"10.1016/j.aasri.2013.10.067","DOIUrl":"10.1016/j.aasri.2013.10.067","url":null,"abstract":"<div><p>Focusing on the existing location technology limited the performance of the algorithm, distributed data location strategies DLPSL based on weights of jump table is presented to solve the efficiency problem. Weights are added to nodes of jump table, so that the high rate of location of the storage node priority is found to short the search path, and improve the storage and location efficiency. System analysis shows that, the node's insertion, deleting, and location on DLPSL are more efficient than single-linked list storage structure and skip graphic. Its time complexity is <em>0(log n)</em>, and space complexity is <em>0(n)</em>.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"5 ","pages":"Pages 120-125"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.067","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80535913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-01-01Epub Date: 2013-11-27DOI: 10.1016/j.aasri.2013.10.040
Bingchuan Yuan, John Herbert
When pervasive computing is used to provide technology-driven assistive healthcare, there is a need for the system to be as sophisticated and adaptable as possible, while also being as transparent as possible for both subject and caregivers. A personalized, extensible hybrid reasoning framework has been implemented for the CARA (Context Aware Real-time Assistant) system which aims to satisfy these design goals. It provides context-aware sensor data fusion (including medical and environmental sensors) and incorporates anomaly detection mechanisms that support Activity of Daily Living (ADL) analysis and alert generation. The hybrid reasoning architecture incorporates both rule-based and case-based reasoning; this enables CARA to be more robust and to adapt to a changing environment by continuously retraining with new cases. The rules used for anomaly detection in a smart-home situation are given in a structured natural language, allowing subject or caregiver to inspect and, if appropriate, modify these rules; this supports the goal of transparency. For the case-based reasoning part, attention is drawn to the transparency issues that arise in the evaluation criteria used and interpretation of results.
{"title":"Transparency Issues in a Hybrid Reasoning Architecture for Assistive Healthcare","authors":"Bingchuan Yuan, John Herbert","doi":"10.1016/j.aasri.2013.10.040","DOIUrl":"10.1016/j.aasri.2013.10.040","url":null,"abstract":"<div><p>When pervasive computing is used to provide technology-driven assistive healthcare, there is a need for the system to be as sophisticated and adaptable as possible, while also being as transparent as possible for both subject and caregivers. A personalized, extensible hybrid reasoning framework has been implemented for the CARA (Context Aware Real-time Assistant) system which aims to satisfy these design goals. It provides context-aware sensor data fusion (including medical and environmental sensors) and incorporates anomaly detection mechanisms that support Activity of Daily Living (ADL) analysis and alert generation. The hybrid reasoning architecture incorporates both rule-based and case-based reasoning; this enables CARA to be more robust and to adapt to a changing environment by continuously retraining with new cases. The rules used for anomaly detection in a smart-home situation are given in a structured natural language, allowing subject or caregiver to inspect and, if appropriate, modify these rules; this supports the goal of transparency. For the case-based reasoning part, attention is drawn to the transparency issues that arise in the evaluation criteria used and interpretation of results.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"4 ","pages":"Pages 268-274"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.040","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72852762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The accuracy of the interpolation method for identification of nonlinear dynamical systems based on the Volterra model in the frequency domain is studied. To highlight the n-th partial component in the response of the system to the test signal the n-th partial derivative of the response using the test signal amplitude is found and its value is taken at zero. The polyharmonic signals are used as test ones. The algorithmic and software toolkit is developed for identification processes. This toolkit is used to construct the informational model of test system. The model is built as a first, second and third order amplitude–frequency characteristics and phase–frequency characteristics. The comparison of obtained characteristics with standard is given.
{"title":"Identification Accuracy of Nonlinear System based on Volterra Model in Frequency Domain","authors":"Pavlenko Vitaliy, Fomin Aleksandr, Pavlenko Sergey, Grigorenko Yuriy","doi":"10.1016/j.aasri.2013.10.044","DOIUrl":"10.1016/j.aasri.2013.10.044","url":null,"abstract":"<div><p>The accuracy of the interpolation method for identification of nonlinear dynamical systems based on the Volterra model in the frequency domain is studied. To highlight the n-th partial component in the response of the system to the test signal the n-th partial derivative of the response using the test signal amplitude is found and its value is taken at zero. The polyharmonic signals are used as test ones. The algorithmic and software toolkit is developed for identification processes. This toolkit is used to construct the informational model of test system. The model is built as a first, second and third order amplitude–frequency characteristics and phase–frequency characteristics. The comparison of obtained characteristics with standard is given.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"4 ","pages":"Pages 297-305"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.044","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78147011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-01-01Epub Date: 2013-11-27DOI: 10.1016/j.aasri.2013.10.010
Shivnarayan Patidar, Ram Bilas Pachori
In this paper, we present a new method for analysis of cardiac sound signals containing murmurs using constrained tunable-Q wavelet transform (TQWT). The fundamental heart sounds (FHS) and murmurs are separately reconstructed by suitably constraining TQWT. The segmentation of reconstructed murmurs into heart beat cycles is achieved using cardiac sound characteristic wave-form (CSCW) of reconstructed FHS. The frequency domain based approximate entropy, spectral entropy, Lempel-Ziv complexity, and time domain Shannon entropy are computed for each segmented heart beat cycles for least squares support vector machine (LS-SVM) based classification. The experimental results are included to show the effectiveness of the proposed method.
本文提出了一种利用约束可调q小波变换(TQWT)分析含杂音的心音信号的新方法。通过对TQWT进行适当的约束,分别对心音和杂音进行重构。利用重构FHS的心音特征波形(CSCW)实现了重构杂音的心跳周期分割。基于最小二乘支持向量机(least squares support vector machine, LS-SVM)对每段心跳周期进行分类,计算基于频域的近似熵、谱熵、Lempel-Ziv复杂度和时域Shannon熵。实验结果表明了该方法的有效性。
{"title":"Constrained Tunable-Q Wavelet Transform based Analysis of Cardiac Sound Signals","authors":"Shivnarayan Patidar, Ram Bilas Pachori","doi":"10.1016/j.aasri.2013.10.010","DOIUrl":"10.1016/j.aasri.2013.10.010","url":null,"abstract":"<div><p>In this paper, we present a new method for analysis of cardiac sound signals containing murmurs using constrained tunable-Q wavelet transform (TQWT). The fundamental heart sounds (FHS) and murmurs are separately reconstructed by suitably constraining TQWT. The segmentation of reconstructed murmurs into heart beat cycles is achieved using cardiac sound characteristic wave-form (CSCW) of reconstructed FHS. The frequency domain based approximate entropy, spectral entropy, Lempel-Ziv complexity, and time domain Shannon entropy are computed for each segmented heart beat cycles for least squares support vector machine (LS-SVM) based classification. The experimental results are included to show the effectiveness of the proposed method.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"4 ","pages":"Pages 57-63"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.010","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81748793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-01-01Epub Date: 2013-11-27DOI: 10.1016/j.aasri.2013.10.005
Ricardo Soto , Stéphane Caro , Broderick Crawford
In robotics, pose errors are known as positional and rotational errors of a given mechanical system. Those errors are commonly produced by the play among joined components, commonly known as joint clearances. Predicting pose errors can be done via the formulation of two optimization models holding continuous domains, which belong to the NP-Hard class of problems. This paper focuses on providing rigorous and reliable solution to this problem by using constraint programing.
{"title":"On the Pursuit of Reliable Solutions for a Robotic Optimization Problem","authors":"Ricardo Soto , Stéphane Caro , Broderick Crawford","doi":"10.1016/j.aasri.2013.10.005","DOIUrl":"10.1016/j.aasri.2013.10.005","url":null,"abstract":"<div><p>In robotics, pose errors are known as positional and rotational errors of a given mechanical system. Those errors are commonly produced by the play among joined components, commonly known as joint clearances. Predicting pose errors can be done via the formulation of two optimization models holding continuous domains, which belong to the NP-Hard class of problems. This paper focuses on providing rigorous and reliable solution to this problem by using constraint programing.</p></div>","PeriodicalId":100008,"journal":{"name":"AASRI Procedia","volume":"4 ","pages":"Pages 26-30"},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.aasri.2013.10.005","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80755614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}