发布求助
文献互助 智能选刊 最新文献

2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery最新文献

筛选
英文 中文
Effect of Finite State AMC on the Practicality of Dual Feedback Bandwidth Request Control 有限状态AMC对双反馈带宽请求控制实用性的影响
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.69
N. Q. Tuan, D. Nguyen
{"title":"Effect of Finite State AMC on the Practicality of Dual Feedback Bandwidth Request Control","authors":"N. Q. Tuan, D. Nguyen","doi":"10.1109/CYBERC.2010.69","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.69","url":null,"abstract":"Dual feedback control algorithm has proved to allow the base station to respond quickly and efficiently to the uplink bandwidth request in broadband wireless access (BWA) networks. In this algorithm the bandwidth request is calculated based on both the length of the backlogged queue and the mismatch between packet arrival and service rates. However, the physical channel quality, SNR, does not play any role in the algorithm, therefore the algorithm is sub optimal with respect to bandwidth utilization. Under fading conditions modern BWA networks employ adaptive modulation and coding (AMC) which has only a finite number of discrete service rates to grant to subscribers. In this paper, we examine the effect of AMC in WiMAX using the Finite State Markov Channel model on the practicality and efficiency of the dual feedback bandwidth request control algorithm.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133290221","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
Parallel MLFMA Performance Analysis Using Performance Analysis Toolsets 并行MLFMA性能分析使用性能分析工具集
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.76
Caiping Liang, Tong Weiqin, Hu Yue, Cui Yanbao
{"title":"Parallel MLFMA Performance Analysis Using Performance Analysis Toolsets","authors":"Caiping Liang, Tong Weiqin, Hu Yue, Cui Yanbao","doi":"10.1109/CYBERC.2010.76","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.76","url":null,"abstract":"The Fast Multipole Method (FMM) and Multi- Level Fast Multipole Algorithm (MLFMA) have been used to solve electromagnetic scattering problems for many years. Parallel implementations of MLFMA is currently a hot topic because it is capable of solving scattering problems with tens of millions of unknowns, with complexity O(NlogN), where N is the number of unknowns. In this paper, we discuss a new perfectly parallel implementation of MLFMA. With the increasing of unknowns and the complexity of computing objects, the program behaviors especially the communication behaviors become chaotic. Thus, it is necessary to discover the bottleneck and the inefficient regions using existing parallel implementation performance analysis toolsets. The main focus of the present paper is to discuss how we use Scalasca (an open source professional analysis toolset) and other analysis tools to analyze our parallel MLFMA implementation, find the bottlenecks and inefficient parts of the implementation and accordingly optimize and modify the code. The paper highlights some necessary tricks that we employed and without which the use of Scalasca to analyze the program would have been impossible.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132231668","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 Efficient Algorithm of Hot Events Detection in Text Streams 一种有效的文本流热事件检测算法
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.65
Junliang Bai, Jun Guo, Guang Chen, Weiran Xu, Gang Du
{"title":"An Efficient Algorithm of Hot Events Detection in Text Streams","authors":"Junliang Bai, Jun Guo, Guang Chen, Weiran Xu, Gang Du","doi":"10.1109/CYBERC.2010.65","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.65","url":null,"abstract":"Hot events detection in text streams has drawn increasing attention in recent sequential data mining works. Different from traditional TDT task which find all the real events’ cluster, hot events detection only identify hot events concerned by public. This paper proposes a novel approach to identify those events based on burst terms, terms co-occurrence and generative probabilistic model. Experiments with huge text stream sets crawled from WWW suggest that our algorithm can work on-line and identify hot events effectively and efficiently.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134380390","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}
引用次数: 2
A Study on Test Platform for Verifying New Wireless Networking Technologies via Hardware-in-Loop Simulation 基于硬件在环仿真的新型无线网络技术测试平台研究
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.23
Lijun Zu, Ping Wang, Jing Han, Fuqiang Liu, Qing Ai, Yusheng Ji
{"title":"A Study on Test Platform for Verifying New Wireless Networking Technologies via Hardware-in-Loop Simulation","authors":"Lijun Zu, Ping Wang, Jing Han, Fuqiang Liu, Qing Ai, Yusheng Ji","doi":"10.1109/CYBERC.2010.23","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.23","url":null,"abstract":"For designing a wireless network, field test is mostly preferred for researchers to test and evaluate the system performance. However, it is expensive for field constructions and thus it is not affordable for most researchers. Software simulation is another option. However, the results by simulation may be undesirably biased away the true. This paper proposes a new method to trade off between resource consumption and test veracity, which constructs a hardware-in-loop simulation platform by integrating theoretic computation, computer simulation and hardware-based test. This platform can be used to verify wireless networking technologies, while resource is reduced greatly at the same time.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122389779","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
Internet Key Exchange Protocol Simulation of HAIPE in Security Network 安全网络中Internet密钥交换协议HAIPE仿真
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.52
Chuanfu Zhang, Jiang Yu, Wanzhong Sun, Jinhai Su
{"title":"Internet Key Exchange Protocol Simulation of HAIPE in Security Network","authors":"Chuanfu Zhang, Jiang Yu, Wanzhong Sun, Jinhai Su","doi":"10.1109/CYBERC.2010.52","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.52","url":null,"abstract":"The High Assurance Internet Protocol Encrypt or (HAIPE) Interoperability Specification is developed by the US Department of Defense to permit enclaves equipped with compliant gateways to communicate securely over un-trusted networks. Using Internet Key Exchange (IKE), HAIPEs can establish automated security associations (SA) for this device instead of manually establishing. The additional HAIPEs have an effect upon the network performance to some extent when the security of network is enhanced. In order to quantify the impact of HAIPEs on the end-to-end performance of networks, we designed a cryptographic key agreement protocol simulation scenario to emulate the process of dynamic negotiating security information to establish SAs, and some typical application was configured to execute simulation. This paper describes the HAIPE IKE model and presents a IKE protocol simulation. The simulation results show the process of HAIPEs IKE protocol and the impact of HAIPEs on network performance, and validate the correctness these models.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130209771","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}
引用次数: 2
Exchanging Course Content Mechanism for Moodle LMS Moodle LMS课程内容交换机制
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.91
Ching-Tsorng Tsai, H. Lin, Ming-Hung Hung, Chia-Feng Lin, S. Yuan
{"title":"Exchanging Course Content Mechanism for Moodle LMS","authors":"Ching-Tsorng Tsai, H. Lin, Ming-Hung Hung, Chia-Feng Lin, S. Yuan","doi":"10.1109/CYBERC.2010.91","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.91","url":null,"abstract":"Moodle is an open source and one of the most popular learning management systems (LMS) currently. Developers can customize functionality and modules for educating purpose. When integrating with other systems, developers have to deal with the barrier that comes from Moodle servers with different version or other human resource system. Therefore it will be valuable for allowing teachers who are at different places to exchanging teaching materials. To solve these problems, a set of Course Communication services based on web service were built. With these services, developers can more easily build connection among Moodle servers and other kinds of systems. In addition, A Moodle module called OpenMoodle is also developed. With this module, instructors can exchange course materials and teach collaboratively with other educators and monitor student’s learning status by holding course materials locally. In addition, students can acquire material from multiple resources.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117078528","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
A New Top-Down Algorithm for Tree Inclusion 一种新的自顶向下的树包含算法
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.60
Yangjun Chen, Yibin Chen
{"title":"A New Top-Down Algorithm for Tree Inclusion","authors":"Yangjun Chen, Yibin Chen","doi":"10.1109/CYBERC.2010.60","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.60","url":null,"abstract":"We consider the following tree-matching problem: Given labeled, ordered trees P and T, can P be obtained from T by deleting nodes? Deleting a node v entails removing all edges incident to v and, if v has a parent u, replacing the edges from u to v by edges from u to the children of v. This problem has a lot of applications in the computer engineering, such as XML tree pattern query evaluation, video content-based retrieval, as well as in computational biology, and data mining. The best known algorithm for this problem needs O(|T|Þ|leaves(P)|) time and O(|leaves(P)|Þmin{DT, |leaves(T)|} + |T| + |P|) space, where leaves(T) (resp. leaves(P)) stands for the number of the leaves of T (resp. P), and DT (resp. DP) for the height of T (resp. P). In this paper, we present a new algorithm that requires O(|T|Þmin{DP, |leaves(P)|}) time and O(|T| + |P|) space.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121230991","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}
引用次数: 2
WSN Design and Implementation in a Tea Plantation for Drought Monitoring 茶园干旱监测无线传感器网络的设计与实现
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.36
Daozong Sun, Sheng Jiang, Weixing Wang, Jingchi Tang
{"title":"WSN Design and Implementation in a Tea Plantation for Drought Monitoring","authors":"Daozong Sun, Sheng Jiang, Weixing Wang, Jingchi Tang","doi":"10.1109/CYBERC.2010.36","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.36","url":null,"abstract":"A Wireless sensor network ???WSN??? was designed and deployed in a tea plantation with the purpose of drought monitoring. The sensing nodes were designed, which are composed of an ATmega128L micro-processor, a CC2420 transmit-receive module etc. A WSN gateway layout scheme based on ARM was demonstrated. The networking experiments were conducted in laboratory with Mesh Routing Protocol to examine the network performance. Test results show that the performance of Quality of Service (QoS) declined with network scale extending from 5, 10, 15 to 20 nodes. Simultaneously, the topology formation time, the topology stabilization time and the topology reconstruction time got prolonged. The entrance of a new node did little effects on routing performance of a steady-going WSN. Diamond shaped node deployment was compared and adopted. Tests in tea plantation showed that the system is stable and packet Loss Rate (PLR) goes up when data transmission interval varied from 10s, 20s, 30s to 40s.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121365759","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}
引用次数: 13
Scenario-Based Approach for Blackbox Load Testing of Online Game Servers 基于场景的网络游戏服务器黑盒负载测试方法
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.54
Chang-Sik Cho, Dong-Chun Lee, Kang-Min Sohn, Changjoon Park, Ji-Hoon Kang
{"title":"Scenario-Based Approach for Blackbox Load Testing of Online Game Servers","authors":"Chang-Sik Cho, Dong-Chun Lee, Kang-Min Sohn, Changjoon Park, Ji-Hoon Kang","doi":"10.1109/CYBERC.2010.54","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.54","url":null,"abstract":"Simply having a large beta test cannot consistently provide stability and performance to game servers, which are major issues in online game development. Therefore, test automations have been used in order to reduce the testing time of online games by simulating highly repetitive tasks and emulating server loads. However, in previous approaches, black box testing and scenario-based testing are not supported because they use prerecorded packets of real players as templates, or reuse a subset of the main game client for the test client. In this paper, we propose black box testing and scenario-based testing of online games as well as simple load testing. Instead of rewriting the virtual client dummy code, only the game description language and virtual game map are redefined when a new game is to be tested. In addition, an actual testing environment can be mimicked more closely, because complex and various scenarios such as attack, party play, and waypoint movement can be tested through combining actions. We have applied our tools on several online games to verify the effectiveness of our method.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124137089","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}
引用次数: 15
Recognition of Facial Expression Using Centroid Neural Network 基于质心神经网络的面部表情识别
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.94
Dong-Chul Park, H. Thuy, Dong-Min Woo, Yunsik Lee
{"title":"Recognition of Facial Expression Using Centroid Neural Network","authors":"Dong-Chul Park, H. Thuy, Dong-Min Woo, Yunsik Lee","doi":"10.1109/CYBERC.2010.94","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.94","url":null,"abstract":"A novel approach to recognize facial expressions from static images is proposed in this paper. The local binary pattern (LBP) operator is adopted as an effective feature extraction tool for facial image data. An unsupervised competitive neural network, called a centroid neural network with x2 distance measure, CNN-x2, is then utilized as the classification tool for the histogram data obtained by the LBP operator on facial image data. The proposed recognition scheme is applied to the JAFFE database and compared with several conventional approaches to facial expression recognition problems. The results show that the proposed recognition scheme compares favorably with conventional approaches in terms of recognition accuracy.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131421812","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信