Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713061
Wei Liu, D. Huang, Leyuan Zhang
For better user personalization, this paper explores the collecting and processing method of network users' behavior data with multi-source heterogeneity and analyzes network user behavior on the basis of context by the theory called Situation Awareness. Then, a new efficient algorithm is presented by using internet context to ensure the model of user interest auxiliary. Further, a structure model of analysing network user behavior based on context-aware is designed. All above has provided an effective technical way for discovering the characteristic and changing law of the network user interest.
{"title":"Analysis of network user behavior","authors":"Wei Liu, D. Huang, Leyuan Zhang","doi":"10.1109/YCICT.2010.5713061","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713061","url":null,"abstract":"For better user personalization, this paper explores the collecting and processing method of network users' behavior data with multi-source heterogeneity and analyzes network user behavior on the basis of context by the theory called Situation Awareness. Then, a new efficient algorithm is presented by using internet context to ensure the model of user interest auxiliary. Further, a structure model of analysing network user behavior based on context-aware is designed. All above has provided an effective technical way for discovering the characteristic and changing law of the network user interest.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114985556","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713054
Tang Quan-hua, Lei Jine
A new method for median computation was proposed based on a measure-integral model of median. At first the measure-integral model employs a step function to extend the array for median. Then the definition of function median is presented conforming to the definition of an array's median. The relationship between median and measure-integral is deduced and an algorithm is gained. To search the measure space fast we compress the measure space and get the compressed measure-integral. This is extended to multi-level compressing method at last. At last the start point to search is discussed to reduce the search distance. Experiments and analysis show that computing median with measure-integral has higher speed than known algorithms.
{"title":"A median computing algorithm based on multi-level space compressed measure-integral","authors":"Tang Quan-hua, Lei Jine","doi":"10.1109/YCICT.2010.5713054","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713054","url":null,"abstract":"A new method for median computation was proposed based on a measure-integral model of median. At first the measure-integral model employs a step function to extend the array for median. Then the definition of function median is presented conforming to the definition of an array's median. The relationship between median and measure-integral is deduced and an algorithm is gained. To search the measure space fast we compress the measure space and get the compressed measure-integral. This is extended to multi-level compressing method at last. At last the start point to search is discussed to reduce the search distance. Experiments and analysis show that computing median with measure-integral has higher speed than known algorithms.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115133926","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713108
Heng Wang, M. Yu, Ping Wang
As WSNs are energy constraint networks, how to eliminate transmission collisions and keep high energy efficiency are as crucial as the accuracy of a clock when selecting synchronization scheme. To achieve the goal, we propose a novel synchronization scheme-FDSS (Follow Data Stream Synchronization). In FDSS, time stamp will be added into the data and ACK frame when a selected node (SN) communicates with the reference node, while other normal nodes will achieve synchronization by overhearing the two frames and using the time information in them. There are no special frames for synchronization, and FDSS can reduce the communication overhead to the minimum. This paper introduces the basic concept of FDSS and investigates how to choose the selected node (SN) to carry time stamp in deterministic scheduled WSNs according to sensors' demanded synchronization period and data packet interval.
由于无线传感器网络是能量约束网络，在选择同步方案时，如何消除传输冲突并保持高能量效率与时钟精度同等重要。为了实现这一目标，我们提出了一种新的同步方案——fdss (Follow Data Stream synchronization)。在FDSS中，当选定节点(SN)与参考节点通信时，在数据帧和ACK帧中加入时间戳，其他正常节点通过监听这两帧并利用其中的时间信息实现同步。没有用于同步的特殊帧，FDSS可以将通信开销降至最低。介绍了FDSS的基本概念，研究了在确定性调度的wsn中，如何根据传感器所需的同步周期和数据包间隔选择携带时间戳的选定节点。
{"title":"The Follow Data Stream Synchronization protocol for deterministic wireless sensor networks","authors":"Heng Wang, M. Yu, Ping Wang","doi":"10.1109/YCICT.2010.5713108","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713108","url":null,"abstract":"As WSNs are energy constraint networks, how to eliminate transmission collisions and keep high energy efficiency are as crucial as the accuracy of a clock when selecting synchronization scheme. To achieve the goal, we propose a novel synchronization scheme-FDSS (Follow Data Stream Synchronization). In FDSS, time stamp will be added into the data and ACK frame when a selected node (SN) communicates with the reference node, while other normal nodes will achieve synchronization by overhearing the two frames and using the time information in them. There are no special frames for synchronization, and FDSS can reduce the communication overhead to the minimum. This paper introduces the basic concept of FDSS and investigates how to choose the selected node (SN) to carry time stamp in deterministic scheduled WSNs according to sensors' demanded synchronization period and data packet interval.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127321297","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713074
Yu Wang, Bin Li, Zhengdong Li
Large-scale global optimization (LSGO) is a very important and challenging task in optimization domain, which is embedded in many scientific and engineering applications. Previously, the cooperative co-evolution (CC) is a usual and effective choice for LSGO problems. In this paper, aim at more fully exploring the flexibility and potential of CC strategy, an adaptive CC (ACC) is designed to handle LSGO problems. The advantages of ACC compared with the classical CC strategies are experimentally verified on a set of widely used large scale function optimization problems.
大规模全局优化(Large-scale global optimization, LSGO)是优化领域中一项非常重要且具有挑战性的任务，在许多科学和工程应用中都有广泛的应用。以往，合作协同进化(CC)是解决LSGO问题的一种常用而有效的选择。为了更充分地挖掘CC策略的灵活性和潜力，本文设计了一种自适应CC (ACC)来处理LSGO问题。在一组广泛应用的大规模函数优化问题上，实验验证了ACC策略相对于经典CC策略的优势。
{"title":"Adaptive cooperative co-evolution for large scale global optimization","authors":"Yu Wang, Bin Li, Zhengdong Li","doi":"10.1109/YCICT.2010.5713074","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713074","url":null,"abstract":"Large-scale global optimization (LSGO) is a very important and challenging task in optimization domain, which is embedded in many scientific and engineering applications. Previously, the cooperative co-evolution (CC) is a usual and effective choice for LSGO problems. In this paper, aim at more fully exploring the flexibility and potential of CC strategy, an adaptive CC (ACC) is designed to handle LSGO problems. The advantages of ACC compared with the classical CC strategies are experimentally verified on a set of widely used large scale function optimization problems.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115079153","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713131
Junjie Ma, Han Wan, Xiaopeng Gao, Xiang Long
We present the design of time parallel trace-driven cache simulation for the purpose of evaluating different cache architectures. Due to the long simulation cycles, traditional sequential simulation methods are no longer practical. An obvious way to achieve fast parallel simulation is time parallel. It splits the whole trace into small slices which are assigned to parallel processors for concurrent simulation. In this paper, we introduce a novel time parallel multi-configuration simulation on single pass method. It exploits time partitioning as the main sources of parallelism and takes the full advantage of the computational capability offered by the Compute Unified Device Architecture (CUDA) on the GPU. Our experimental results demonstrate that the cache simulator based on GPU platform gains 1.91× performance improvement compared to traditional serial algorithm.
{"title":"GPU-based time parallel cache simulator","authors":"Junjie Ma, Han Wan, Xiaopeng Gao, Xiang Long","doi":"10.1109/YCICT.2010.5713131","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713131","url":null,"abstract":"We present the design of time parallel trace-driven cache simulation for the purpose of evaluating different cache architectures. Due to the long simulation cycles, traditional sequential simulation methods are no longer practical. An obvious way to achieve fast parallel simulation is time parallel. It splits the whole trace into small slices which are assigned to parallel processors for concurrent simulation. In this paper, we introduce a novel time parallel multi-configuration simulation on single pass method. It exploits time partitioning as the main sources of parallelism and takes the full advantage of the computational capability offered by the Compute Unified Device Architecture (CUDA) on the GPU. Our experimental results demonstrate that the cache simulator based on GPU platform gains 1.91× performance improvement compared to traditional serial algorithm.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117010502","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713077
Zhou Xiao-feng, Shi Hai-bo, Shang Wen-li
In the experiments of the transmission fault diagnosis, acquiring vibration signals from three measurement locations by multi-sensors. Using improved fastICA algorithm to de-nosing and order analysis algorithm to get the order spectrum, the paper proposed two evaluation indexes. According to the experiment result by using evaluation indexes, the fault characteristics contained in the vibration signals from three measurement locations are different. Then, the best location can be chosen as measurement location to improve the accuracy of fault diagnosis.
{"title":"The evaluation method of sensor location for transmission fault diagnosis","authors":"Zhou Xiao-feng, Shi Hai-bo, Shang Wen-li","doi":"10.1109/YCICT.2010.5713077","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713077","url":null,"abstract":"In the experiments of the transmission fault diagnosis, acquiring vibration signals from three measurement locations by multi-sensors. Using improved fastICA algorithm to de-nosing and order analysis algorithm to get the order spectrum, the paper proposed two evaluation indexes. According to the experiment result by using evaluation indexes, the fault characteristics contained in the vibration signals from three measurement locations are different. Then, the best location can be chosen as measurement location to improve the accuracy of fault diagnosis.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128659363","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713085
Guohui Li, Hong Yang
In order to improve tracking estimation accuracy of square-root unscented Kalman particle filter (SRUKFPF), a new particle filter algorithm of update SRUKF based on iterated measurements is proposed. The algorithm produces the important density function of particle filter using maximum posteriori estimate of iterated square-root unscented Kalman filter, and amends the state covariance using Levenberg-Marquardt method, so that the observed information of particle is effectively used. This is more consistent with the posterior probability distribution of true state. Simulation results show that estimation performance of the proposed algorithm is much better than standard particle filter (PF), unscented particle filter (UPF) and square root unscented Kalman particle filter (SRUKFPF).
{"title":"Iterated square root unscented Kalman particle filter","authors":"Guohui Li, Hong Yang","doi":"10.1109/YCICT.2010.5713085","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713085","url":null,"abstract":"In order to improve tracking estimation accuracy of square-root unscented Kalman particle filter (SRUKFPF), a new particle filter algorithm of update SRUKF based on iterated measurements is proposed. The algorithm produces the important density function of particle filter using maximum posteriori estimate of iterated square-root unscented Kalman filter, and amends the state covariance using Levenberg-Marquardt method, so that the observed information of particle is effectively used. This is more consistent with the posterior probability distribution of true state. Simulation results show that estimation performance of the proposed algorithm is much better than standard particle filter (PF), unscented particle filter (UPF) and square root unscented Kalman particle filter (SRUKFPF).","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128023357","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713149
Huoling Luo, F. Jia, Z. Zheng, Q. Hu, Yongzhong Xu
A surgical navigation system based on IGSTK (Image-Guided Surgical Toolkit) that guide medical robot to drill pedicle screw into vertebra precisely is presented. The surgical location device used is NDI Polaris Vicra® optical tracking system and the assistance robot is KUKA® Robot KR 5 sixx R650. Message communication between the navigation system and KUKA robot is implemented based on OpenIGTLink protocol client-server model. Multiple tracked tools can be tracked automatically by state-machine mechanism in a safe manner. To overcome the line of sight limitation of optical tracking system, a new instrument that we called it two-face instrument model has developed to enlarge the rotation angle of the tracked tool. The experiment showed that the navigation could guide robot to execute precise surgical operation in a simple and safe mode.
{"title":"An IGSTK-based surgical navigation system connected with medical robot","authors":"Huoling Luo, F. Jia, Z. Zheng, Q. Hu, Yongzhong Xu","doi":"10.1109/YCICT.2010.5713149","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713149","url":null,"abstract":"A surgical navigation system based on IGSTK (Image-Guided Surgical Toolkit) that guide medical robot to drill pedicle screw into vertebra precisely is presented. The surgical location device used is NDI Polaris Vicra® optical tracking system and the assistance robot is KUKA® Robot KR 5 sixx R650. Message communication between the navigation system and KUKA robot is implemented based on OpenIGTLink protocol client-server model. Multiple tracked tools can be tracked automatically by state-machine mechanism in a safe manner. To overcome the line of sight limitation of optical tracking system, a new instrument that we called it two-face instrument model has developed to enlarge the rotation angle of the tracked tool. The experiment showed that the navigation could guide robot to execute precise surgical operation in a simple and safe mode.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133902451","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713140
Zhong Chen, Xianda Zhang, Liang Zeng
In this paper, we consider a cognitive radio (CR) system in non-ideal fading wireless channels and propose a cooperative spectrum sensing scheme based on coherent multiple access channel (MAC) serving as an alternative way to improve the cooperative spectrum sensing performance. We assume that the gains of the observations and transmission channels are all known which is available since we use standard preamble-aided channel estimation techniques to require channel state information. The key feature of the proposed scheme is that energy of the observations is transmitted by amplify and forward transmission from cognitive users (CUs) to a fusion center (FC) and a linear combiner at FC. Optimal weighting coefficients of the proposed scheme are got by maximizing the detection probability under a target false alarm probability and transmit power constraint. The effectiveness of the proposed scheme is verified by the simulations.
{"title":"An optimal cooperative spectrum sensing scheme based on linear coherent MAC under interference temperature constraints","authors":"Zhong Chen, Xianda Zhang, Liang Zeng","doi":"10.1109/YCICT.2010.5713140","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713140","url":null,"abstract":"In this paper, we consider a cognitive radio (CR) system in non-ideal fading wireless channels and propose a cooperative spectrum sensing scheme based on coherent multiple access channel (MAC) serving as an alternative way to improve the cooperative spectrum sensing performance. We assume that the gains of the observations and transmission channels are all known which is available since we use standard preamble-aided channel estimation techniques to require channel state information. The key feature of the proposed scheme is that energy of the observations is transmitted by amplify and forward transmission from cognitive users (CUs) to a fusion center (FC) and a linear combiner at FC. Optimal weighting coefficients of the proposed scheme are got by maximizing the detection probability under a target false alarm probability and transmit power constraint. The effectiveness of the proposed scheme is verified by the simulations.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133362262","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}
Pub Date : 2010-11-01DOI: 10.1109/YCICT.2010.5713138
Dong Yan, Xiaoping Zeng, Kai Zhang
A new fuzzy genetic algorithm (FGA) is developed to optimize Hilbert fractal defected ground structure (HDGS), designed bandstop filter. The genetic operators (crossover and mutation) are self-adaptively adjusted by fuzzy controller of the algorithm, so convergent character and global optimization are improved. Fitness function is constructed by the HDGS stopband and pass-band transmission characteristics S21. S21 is obtained by using PML- FDTD method. To 500M-3GHz band center frequency of 2.4GHz, 200MHz bandwidth, the band stop filter is designed to target. The simulation results show that this method than the traditional genetic algorithm, faster convergence rate, and bandstop filter designed HDGS with large stop-band insertion loss and return loss, flat pass-band characteristics.
{"title":"HDGS bandstop filter design by FGA","authors":"Dong Yan, Xiaoping Zeng, Kai Zhang","doi":"10.1109/YCICT.2010.5713138","DOIUrl":"https://doi.org/10.1109/YCICT.2010.5713138","url":null,"abstract":"A new fuzzy genetic algorithm (FGA) is developed to optimize Hilbert fractal defected ground structure (HDGS), designed bandstop filter. The genetic operators (crossover and mutation) are self-adaptively adjusted by fuzzy controller of the algorithm, so convergent character and global optimization are improved. Fitness function is constructed by the HDGS stopband and pass-band transmission characteristics S21. S21 is obtained by using PML- FDTD method. To 500M-3GHz band center frequency of 2.4GHz, 200MHz bandwidth, the band stop filter is designed to target. The simulation results show that this method than the traditional genetic algorithm, faster convergence rate, and bandstop filter designed HDGS with large stop-band insertion loss and return loss, flat pass-band characteristics.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127246299","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
扫码关注我们
求助内容：
应助结果提醒方式：