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

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

筛选
英文 中文
Big Data Analytics in the Public Sector: Improving the Strategic Planning in World Class Universities 公共部门的大数据分析:改善世界一流大学的战略规划
2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2013-10-10 DOI: 10.1109/CyberC.2013.33
J. A. Amorim, S. F. Andler, Per M. Gustavsson, O. L. Agostinho
{"title":"Big Data Analytics in the Public Sector: Improving the Strategic Planning in World Class Universities","authors":"J. A. Amorim, S. F. Andler, Per M. Gustavsson, O. L. Agostinho","doi":"10.1109/CyberC.2013.33","DOIUrl":"https://doi.org/10.1109/CyberC.2013.33","url":null,"abstract":"This paper presents an application in Information Fusion related to Analytics and fusion of Big Data. The approach involves the analysis of specific aspects of the management of a Brazilian university and the proposition of a new framework that may be useful mainly for universities focused on improving their strategic planning while having excellence in operational execution. The framework intends to be used for the development of new decision support systems that integrate \"past data\" with \"real time data\". The research methodology emphasizes induction with the collection of qualitative data in order to move from observed facts to theory. The main result is the framework itself while future work may involve the development and the validation of the new system.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131559956","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}
引用次数: 5
Dynamic Collaborative Change Point Detection in Wireless Sensor Networks 无线传感器网络中的动态协同变点检测
2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2013-10-10 DOI: 10.1109/CyberC.2013.64
M. Haghighi, Chris J. Musselle
{"title":"Dynamic Collaborative Change Point Detection in Wireless Sensor Networks","authors":"M. Haghighi, Chris J. Musselle","doi":"10.1109/CyberC.2013.64","DOIUrl":"https://doi.org/10.1109/CyberC.2013.64","url":null,"abstract":"With wireless sensor networks (WSN) now readily available and capable of monitoring multiple physical phenomena over time, large volumes of data can now easily be generated in the form of multiple co-evolving data streams. This presents a number of challenging tasks for the analyst, who often seeks to monitor such data in real-time for the purposes of summarisation, anomaly detection and prediction. WSNs often suffer from severe resource constraints that prevent them from applying computational algorithms on large datasets as in conventional systems. Sensomax is an agent-based and object-oriented WSN middleware, which is capable of executing multiple concurrent applications based on their required operational paradigm. Its component-based architecture features seamless integration of light-weight computational algorithms at different levels throughout the network. This paper presents the preliminary work on a novel algorithm capable of detecting significant change points, or \"points of interest\" in an unsupervised fashion across multiple data streams in parallel. The algorithm is based on an incremental dimensionality reduction approach known as subspace tracking. Sensomax exploits this algorithm to detect the change points and dynamically respond to the applications' demands whilst executing concurrent applications, switching operational paradigms and reorganising at cluster and network levels.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134449316","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
Toward High-Payoff Nash Equilibria for Interference Game between Body Area Networks 体域网络间干扰博弈的高收益纳什均衡研究
2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2013-10-10 DOI: 10.1109/CyberC.2013.80
Lusheng Wang, Qingfeng Zhou, Hai Lin
{"title":"Toward High-Payoff Nash Equilibria for Interference Game between Body Area Networks","authors":"Lusheng Wang, Qingfeng Zhou, Hai Lin","doi":"10.1109/CyberC.2013.80","DOIUrl":"https://doi.org/10.1109/CyberC.2013.80","url":null,"abstract":"Interference between adjacent body area networks (BANs), leading to dramatic performance degradation of the whole system, is always an unsolved issue. In this paper, we study the interference game in which BANs adjust their resource allocation strategies to avoid putting highly interfering sensors into the same time slots. Dickhaut-Kaplan algorithm is used to enumerate all the Nash equilibria (NE) of the game between 2 BANs with 3 sensors each. We find that a number of NE with different payoffs usually exist. This study motivates us to design algorithm for achieving high-payoff NE in the future work.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130774002","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
A Novel Rule Matching Algorithm Based on Improved Twig Pattern 一种基于改进小枝模式的规则匹配算法
2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2013-10-10 DOI: 10.1109/CyberC.2013.91
Yongwei Wang, Yunan Liu, Rongcai Zhao, Cheng Si, Shuai Liu
{"title":"A Novel Rule Matching Algorithm Based on Improved Twig Pattern","authors":"Yongwei Wang, Yunan Liu, Rongcai Zhao, Cheng Si, Shuai Liu","doi":"10.1109/CyberC.2013.91","DOIUrl":"https://doi.org/10.1109/CyberC.2013.91","url":null,"abstract":"Current twig pattern matching algorithms are based on the preorder traversal, which leads to numerous redundant nodes. In this paper, a new rule matching algorithm based on the post-order-traversal twig pattern is proposed. In the new algorithm, Post-order traversal to the request tree is used which can promptly suspend the matching of redundant nodes. Analysis and experiments show that the new algorithm effectively reduces the scale of the output, decreases the elapsed time of matching, avoids lots of redundant paths and nodes and increases the efficiency of the rules matching.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114083346","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
Flow-Based P2P Network Traffic Classification Using Machine Learning 使用机器学习的基于流量的P2P网络流量分类
2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2013-10-10 DOI: 10.1109/CyberC.2013.75
S. Tapaswi, Arpit Gupta
{"title":"Flow-Based P2P Network Traffic Classification Using Machine Learning","authors":"S. Tapaswi, Arpit Gupta","doi":"10.1109/CyberC.2013.75","DOIUrl":"https://doi.org/10.1109/CyberC.2013.75","url":null,"abstract":"With the introduction of new and new services in the market every day, the internet is growing rapidly. The network traffic generated by these network protocols and applications needs to be categorised which is an important task of network management. Among these, p2p has the largest share of the bandwidth. This great demand in the bandwidth has increased the importance of network traffic engineering. So, in order to meet the current demand and develop new architectures which help in improving the network performance, a broad understanding of the network traffic properties is required. The flow based methods classify p2p and non-p2p traffic using the characteristics of flows on the internet. In this paper, Naïve Bayes estimator is used to categorize the traffic into p2p and non-p2p. Our results show that with the right set of features and good training data, high level of accuracy is achievable with the simplest of Naïve Bayes estimator.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126788632","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
Traffic-Differentiated Two-Hop Routing for QoS in Wireless Sensor Networks 面向无线传感器网络QoS的流量差分两跳路由
2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2013-10-10 DOI: 10.1109/CyberC.2013.68
T. Shivaprakash, K. B. Raja, K. Venugopal, S. S. Iyengar, L. Patnaik
{"title":"Traffic-Differentiated Two-Hop Routing for QoS in Wireless Sensor Networks","authors":"T. Shivaprakash, K. B. Raja, K. Venugopal, S. S. Iyengar, L. Patnaik","doi":"10.1109/CyberC.2013.68","DOIUrl":"https://doi.org/10.1109/CyberC.2013.68","url":null,"abstract":"This paper proposes a Traffic-Differentiated Two-Hop Routing protocol for Quality of Service (QoS) in Wireless Sensor Networks (WSNs). It targets WSN applications having different types of data traffic with several priorities. The protocol achieves to increase packet reception ratio (PRR) and reduce end-to-end delay while considering multi-queue priority policy, two-hop neighborhood information, link reliability and power efficiency. The protocol is modular and utilizes effective methods for estimating the link metrics. Numerical results show that the proposed protocol is a feasible solution to addresses QoS service differentiation for traffic with different priorities.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115062528","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}
引用次数: 3
The Architecture of ProMe Instant Question Answering System ProMe即时问答系统的体系结构
2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2013-10-01 DOI: 10.1109/CyberC.2013.46
Guangzhi Zhang, Tao Jiang, R. Bie, Xiaochun Liu, Zhichun Wang, Junyang Rao
{"title":"The Architecture of ProMe Instant Question Answering System","authors":"Guangzhi Zhang, Tao Jiang, R. Bie, Xiaochun Liu, Zhichun Wang, Junyang Rao","doi":"10.1109/CyberC.2013.46","DOIUrl":"https://doi.org/10.1109/CyberC.2013.46","url":null,"abstract":"An instant question answering system ProMe is proposed in this paper which sets automated question answering system as prototype and combines with the search engines and instant messenger. For any question queried by a user, ProMe looks for the answers in the flow of three methods. The first one is to match questions in FAQ database with TF-IDF (Term Frequency-Inverse Document Frequency) algorithm. If still not found, submit it to some search engines and get the answers by extracting information from the web pages returned by the search engine. If the answer is not found or not satisfied after evaluation, it will be sent to other users who are probably interested in it through instant messengers, and get the final answers. Experimental results show that ProMe greatly improves the effectiveness of the automated question answering systems. It can be applied for information searching to provide real-time and personalized information search services for mobile Internet users.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130458065","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
The mServices GUI Architectures Design for the mLearning System 移动学习系统的mServices GUI架构设计
2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2013-10-01 DOI: 10.1109/CyberC.2013.47
Zhanlin Ji, Yongli An, Ivan Ganchev, M. O'Droma
{"title":"The mServices GUI Architectures Design for the mLearning System","authors":"Zhanlin Ji, Yongli An, Ivan Ganchev, M. O'Droma","doi":"10.1109/CyberC.2013.47","DOIUrl":"https://doi.org/10.1109/CyberC.2013.47","url":null,"abstract":"The design of a mobile services (mServices) Graphical User Interface (GUI) architecture for use in mobile eLearning (mLearning) systems is presented in this paper. The architecture is developed based on the Google Web Toolkit (GWT) - a development toolkit for building and optimizing complex multi-platform web-based applications. It is well suited for developing different mService applications, i.e., mTest, mLecture, mLibrary, etc. The architecture is implemented with the Observer and the Model View Controller (MVC) design patterns. Together with the Twitter's bootstrap Cascading Style Sheets level three (CSS3), the created mService applications can run in the modern browsers, i.e., Chrome, Fire fox, Internet Explorer, Opera, and Safari.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126992761","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
Efficiency of Command and Control in Cyberspace: Visit from the Perspective of Complexity Theory 网络空间指挥控制效率:复杂性理论视角下的考察
2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2013-10-01 DOI: 10.1109/CyberC.2013.74
G. Wang, Yi Yang, Qinhua Ren, Runnian Ma
{"title":"Efficiency of Command and Control in Cyberspace: Visit from the Perspective of Complexity Theory","authors":"G. Wang, Yi Yang, Qinhua Ren, Runnian Ma","doi":"10.1109/CyberC.2013.74","DOIUrl":"https://doi.org/10.1109/CyberC.2013.74","url":null,"abstract":"To envision the evolution of cyberspace, the efficiency of command and control (C2) in cyberspace is investigated from the perspective of complexity theory. Compared with platform operation and network centric operation, the mechanism of C2 in cyberspace is characterized in C2 flow and information flow. In detail, C2 in cyberspace possesses more complex enterprises networks, better information-sharing and agility advantage. To evaluate the efficiency of C2, three models based on complex network are presented, i.e. information network efficiency model, command coordination efficiency model, and effect efficiency model. The simulation validates the feasibility and validity of efficiency evaluation models and methods.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115460427","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
Sketch Based Anomaly Detection Scheme in Wireless Sensor Networks 基于草图的无线传感器网络异常检测方案
2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2013-10-01 DOI: 10.1109/CyberC.2013.66
Guorui Li, Y. Wang
{"title":"Sketch Based Anomaly Detection Scheme in Wireless Sensor Networks","authors":"Guorui Li, Y. Wang","doi":"10.1109/CyberC.2013.66","DOIUrl":"https://doi.org/10.1109/CyberC.2013.66","url":null,"abstract":"The constrained capacity of wireless sensor nodes and harsh, unattended deploy environments make the data collected by sensor nodes usually unreliable. In this paper, we propose a sketch based anomaly detection scheme in order to detect the anomaly data values. It first partitions the whole sensor network into several clusters in which the cluster members are physically adjacent and data correlated. Then, the cluster header collects the count-min sketch of each cluster member and compares it with its own sketch in the form of kullback-leibler divergence. The experiment shows that the proposed anomaly detection scheme can provide a high detection accuracy ratio and a low false alarm ratio.","PeriodicalId":133756,"journal":{"name":"2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"9 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115932665","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}
引用次数: 5
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信