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

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

筛选
英文 中文
Femtocell Frequency Planning Scheme in Cellular Networks Based on Soft Frequency Reuse 基于软频率复用的蜂窝网络飞蜂窝频率规划方案
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.39
Yeon-Don Jeong, Ju Yong Lee, M. Chung, Tae-Jin Lee, Hyunseung Choo
{"title":"Femtocell Frequency Planning Scheme in Cellular Networks Based on Soft Frequency Reuse","authors":"Yeon-Don Jeong, Ju Yong Lee, M. Chung, Tae-Jin Lee, Hyunseung Choo","doi":"10.1109/CYBERC.2010.39","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.39","url":null,"abstract":"Femtocell is an attractive solution for operators to overcome the indoor coverage problem and to offload the growing traffic within macro cells. However, when femtocells are deployed in the existing macro cell environments, co-channel interference (CCI) may occur between the macro cell and femtocells. This CCI severely degrades the performance of femtocell and macro cell. Therefore, we propose a femtocell frequency allocation method in the macro cell network based on soft frequency reuse (SFR) scheme in downlink. We investigate the performance of macro cell and femtocell according to the power ratio in SFR scheme. Simulation results show that the proposed femtocell deployment does not affect the performance of macro cell users.","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":"115745714","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}
引用次数: 16
Detecting and Visualizing the Dispute Structure of the Replying Comments in the Internet Forum Sites 互联网论坛网站回帖争议结构的检测与可视化
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.90
Yun-Jung Lee, J. Shim, Hwan-Gue Cho, G. Woo
{"title":"Detecting and Visualizing the Dispute Structure of the Replying Comments in the Internet Forum Sites","authors":"Yun-Jung Lee, J. Shim, Hwan-Gue Cho, G. Woo","doi":"10.1109/CYBERC.2010.90","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.90","url":null,"abstract":"Comparing with the existing web pages, one of the popular features of blogs and the web discussion boards is the capability of the interactive communication among users. In online communities such as web logs or Internet discussion boards, users can read articles, as well as write some comments to the articles to express his/her opinion. These kinds of replying comments become an important means of communication between the author who writes the article and the readers of it. Sometimes, we can find new information that does not appear in the contents of the article by reading comments posted to the article. Also, we can figure out various opinions in comments by reading controversial comments. Popular articles, however, frequently get up to thousands of comments, which is too much to be read in a reasonable time. Especially, to find dispute relations in the comments, we have no alternative but to read all the comments. Although there have been several studies to extract an opinion or a controversy from comments or social networks, most of them tend to be dependent on the language used or the typing errors of the contents. In this reason, we propose a method for extracting the dispute relations from comments and visualizing them including the involved commenters. Since comments written by disputing commenters tend to appear in turns, we consider only the order of commenters to detect pairs of commenters in disputing. So, our method is not affected by the language used nor typos in comments. Also, the dispute relations are visualized by an undirected graph, and it is helpful to grasp the degree of controversy intuitively. According to the experimental results, our method is able to detect dispute couples of commenters about 79% on average. Also, we could find unusual commenters such as spammers or bursty commenters as well as a structure of controversy in comments.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"50 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":"120898653","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}
引用次数: 7
An Attempt to Find Neighbors 试图寻找邻居
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.64
Yong Shi, Ryan Rosenblum
{"title":"An Attempt to Find Neighbors","authors":"Yong Shi, Ryan Rosenblum","doi":"10.1109/CYBERC.2010.64","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.64","url":null,"abstract":"In this paper, we present our continuous research on similarity search problems. Previously we proposed PanKNN[18]which is a novel technique that explores the meaning of K nearest neighbors from a new perspective, redefines the distances between data points and a given query point Q, and efficiently and effectively selects data points which are closest to Q. It can be applied in various data mining fields. In this paper, we present our approach to solving the similarity search problem in the presence of obstacles. We apply the concept of obstacle points and process the similarity search problems in a different way. This approach can assist to improve the performance of existing data analysis approaches.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"29 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":"116170381","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
Performance Evaluation of Transparent Persistence Layer in Java Applications Java应用程序中透明持久层的性能评估
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.15
Z. Zhou, Zhiang Chen
{"title":"Performance Evaluation of Transparent Persistence Layer in Java Applications","authors":"Z. Zhou, Zhiang Chen","doi":"10.1109/CYBERC.2010.15","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.15","url":null,"abstract":"Nowadays, there are many technologies supporting object-relational mapping (ORM) for J2EE technology. Based on different persistence mechanisms, this article compares three methods of database accessing in performance, easy programming, and portability. The testing results indicate it would increase management efficiency and performance when combining both Hibernate and Spring frameworks. With the integration of lightweight frameworks, it is easy to develop novel interfaces for accessing distributed databases in transaction.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"30 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":"115407607","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}
引用次数: 6
Heuristic Methods for Filtering Newly Coined Profanities Using Phylogenetic Analysis 用系统发育分析筛选新造脏话的启发式方法
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.70
T. Yoon, Sun-young Park, Woo-Keun Chung, Hwan-Gue Cho
{"title":"Heuristic Methods for Filtering Newly Coined Profanities Using Phylogenetic Analysis","authors":"T. Yoon, Sun-young Park, Woo-Keun Chung, Hwan-Gue Cho","doi":"10.1109/CYBERC.2010.70","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.70","url":null,"abstract":"We proposed a smart filtering system for newly coined profanities, using approximate string searching and sequence alignment. However there are a lot of coined profanities. For example, game portal Nexon has a forbidden word list of 60,000 words, so even our system still requires too much computational time for application to a real-time chat system. Therefore we need to manage a profanity database, discard redundancy and divide the elements into several groups by priority. In this paper, we propose a management algorithm for a profanity database. We use phylogenetic analysis, make evolution trees and classify profanities. We compare input words and a root of a group. We decrease the elements of the database from 6302 to 2229.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"344 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":"116357862","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
New ID-Based Signcryption Scheme and Its Applications in Key Update Protocols of MANET 基于id的新签名加密方案及其在MANET密钥更新协议中的应用
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.53
Zhang Chuanrong, Liu Weijiang
{"title":"New ID-Based Signcryption Scheme and Its Applications in Key Update Protocols of MANET","authors":"Zhang Chuanrong, Liu Weijiang","doi":"10.1109/CYBERC.2010.53","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.53","url":null,"abstract":"Key management is a most important issue in MANET. Signcryption, as a new cryptographic technique, which combines the functions of digital signature and encryption algorithm for authenticity and confidentiality in an efficient way, is very useful to secure key management in MANET. For design secure and efficient ID-based and threshold key management protocols in MANET, in this paper, we propose a new ID-based signcryption scheme which is efficient in terms of both the communication overhead and the computational requirement. As an application of it, a private key update protocol in ID-based and threshold key management of MANET using this signcryption scheme is given. This protocol improves the security and efficiency of the previous protocols in MANET owing to the use of our ID-based signcryption scheme from bilinear pairings.","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":"129651455","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
A Dynamic Network Robustness Evaluation Method in Cyberspace Based on Perron-Frobenius Eigenvalue 基于Perron-Frobenius特征值的网络鲁棒性动态评价方法
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.41
Yin Wang, Zhiyu Huang
{"title":"A Dynamic Network Robustness Evaluation Method in Cyberspace Based on Perron-Frobenius Eigenvalue","authors":"Yin Wang, Zhiyu Huang","doi":"10.1109/CYBERC.2010.41","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.41","url":null,"abstract":"Cyberspace has become a promising research topic in recent years. One of the key problems to be solved is to evaluate the robustness of the networked nodes, that is, how the network enhance the system performance and how to measure the contribution quantitatively, which plays a crucial role in both network plan and security sectors. In this article, we proposed two methods to measure network robustness called A-PFE and W-PFE based on Perron-Frobenius theorem. Simulations have shown that the proposed W-PFE method can effectively reflect the dynamic network robustness when the network changes. Moreover, it has the further advantage of simple calculation and clear physical concept characteristics, comparing with traditional methods such as exploratory data analysis.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"31 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":"127364927","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
A High-Performance Scalable Computing System on the RapidIO Interconnect Architecture 基于RapidIO互联架构的高性能可扩展计算系统
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.59
Yong Zhang, Yong Wang, Ping Zhang
{"title":"A High-Performance Scalable Computing System on the RapidIO Interconnect Architecture","authors":"Yong Zhang, Yong Wang, Ping Zhang","doi":"10.1109/CYBERC.2010.59","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.59","url":null,"abstract":"In order to meet the demanding requirements of calability, adaptability and computational capability of next-generation signal-processing system, a flexible and high performance signal-processing odule based on Serial RapidIO (SRIO) interconnect and Advanced Mezzanine Card (AMC) modules is developed. RapidIO is a packet-switched nterconnect intended primarily as an intra-system interface, allowing chip-to-chip and board-to-board communications at 10 Gigabit per second performance levels. The AMC specification is defined by PCI Industrial Computer Manufacturer Group (PICMG) and mainly covers the base-level requirements for a wide-range of high-speed mezzanine cards optimized for, but not limited to, Advanced Telecommunications Computing Architecture (ATCA) Carriers systems. With this versatile module, massively parallel multi-processor computing system is feasible. A prototype of 12 modules is introduced and an application of this computing system in MIMO-OFDM system is covered.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"18 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":"126951100","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
Beamforming for Sonar Based on Highlight Model 基于高光模型的声纳波束形成
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.86
Shen Liu, Bing Li, Xucheng Chang
{"title":"Beamforming for Sonar Based on Highlight Model","authors":"Shen Liu, Bing Li, Xucheng Chang","doi":"10.1109/CYBERC.2010.86","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.86","url":null,"abstract":"The highlight model can be expressed by transfer function when the echoes obey the linear acoustic law. This paper aims to present a new beam forming method based on highlight model via the combination of transfer function of highlight model and beam forming technology. Information such as the azimuth of target can be obtained by beam forming using a few highlight. And this paper simulates the beam pattern by using conventional beam forming under the condition that there does not exist interference, and Minimum Variance Distortion less Response beam forming under the condition that there exist the interference. The results show the feasibility of this method.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"122 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":"116212933","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
Mining Non-redundant Rules for Redescription Datasets Based on FCA 基于FCA的重描述数据集非冗余规则挖掘
2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery Pub Date : 2010-10-10 DOI: 10.1109/CYBERC.2010.14
Yuanyuan Wei, Min Wei
{"title":"Mining Non-redundant Rules for Redescription Datasets Based on FCA","authors":"Yuanyuan Wei, Min Wei","doi":"10.1109/CYBERC.2010.14","DOIUrl":"https://doi.org/10.1109/CYBERC.2010.14","url":null,"abstract":"The notions and algorithms of generating basis for exactness rules and the proper basis for conditional rules of redescription database are presented using closure operator of Galois connection based on the operations of formal concept analysis (FCA). It is demonstrated that constructed rules of redescription database are minimal non-redundant. At the same time, a new algorithm, i.e. non-redundant rules method (NRRM), is employed to discover minimal non-redundant exactness, and the conditional rules are addressed. In addition, part numerical computation program and detailed resolution of NRRM algorithm are presented to verify the proposed theorem. It is found that the theorem has good application to practical cases.","PeriodicalId":315132,"journal":{"name":"2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"47 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":"127006109","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
下一页 尾页
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学术官方微信