IEEE Conference Anthology最新文献

筛选
英文 中文
Multi-level topic detection algorithm for Netnews Specials 面向网络新闻专题的多层次主题检测算法
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784968
Yuanying Peng, Zhiqing Lin, Bo Xiao, Chuang Zhang
{"title":"Multi-level topic detection algorithm for Netnews Specials","authors":"Yuanying Peng, Zhiqing Lin, Bo Xiao, Chuang Zhang","doi":"10.1109/ANTHOLOGY.2013.6784968","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784968","url":null,"abstract":"This paper investigates the topic detection method in Netnews Specials Detection (NSD). We found that when the traditional clustering algorithms are used in NSD, the same topic is usually split into several pieces and the result is not satisfying. So a new algorithm is proposed which uses a multi-level model, better suited for NSD. Firstly, such algorithm elevates the accuracy of single-layer clustering by introducing hot search words, a selective dictionary, and an advanced weight formula. Secondly, the multiple-level model not only avoids the problem of topic over-split but also establishes a structure for Netnews Specials, which lays the foundation for quick viewing, positioning and retrieval. Experimental results show that the algorithm in the real test corpus have high accuracy, doing a better job than the traditional clustering method.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128359940","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
Integration schedule of agile satellite based on improved ant colony algorithm 基于改进蚁群算法的敏捷卫星集成调度
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6785040
Zhenzhen Yan, Yingwu Chen
{"title":"Integration schedule of agile satellite based on improved ant colony algorithm","authors":"Zhenzhen Yan, Yingwu Chen","doi":"10.1109/ANTHOLOGY.2013.6785040","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6785040","url":null,"abstract":"Integration schedule of agile satellite is a highly complex combinatorial optimization problem. Pointed at the long time-window brought by the three degrees of freedom of agile satellite, combined with the dynamic store capacity in the integration schedule, a mixed integer program model is built. Then an improved ant colony algorithm is proposed to solve this problem. And local search mechanism is introduced to speed up the convergence of ant colony algorithm. Finally, multiple instances are tested. The result shows that the proposed improved ant colony algorithm is effective in solving the integration schedule of agility satellite.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128559163","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
Bounds on the rate of uniform convergence of learning processes about samples corrupted by noise on credibility space 可信度空间上被噪声破坏的样本学习过程的一致收敛率的界限
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784929
Chun-Qin Zhang, Peng Wang
{"title":"Bounds on the rate of uniform convergence of learning processes about samples corrupted by noise on credibility space","authors":"Chun-Qin Zhang, Peng Wang","doi":"10.1109/ANTHOLOGY.2013.6784929","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784929","url":null,"abstract":"The bounds on the rate of convergence of learning processes play an important role in statistical learning theory. However, the researches about them presently only focus on probability measure (additive measure) space. And the samples we deal with are supposed to be noise-free. This paper explores the statistical learning theory on credibility space. The theory of consistency of the empirical risk minimization principle when samples are corrupted by noise is established on credibility space; the bounds on the rate of uniform convergence of learning processes about samples corrupted by noise is proposed and proven on the non-additive measure space.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"1992 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128607311","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 kernel-based sampling to train SVM with imbalanced data set 基于核采样的支持向量机训练方法
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784693
Zhi-qiang Zeng, Shunzhi Zhu
{"title":"A kernel-based sampling to train SVM with imbalanced data set","authors":"Zhi-qiang Zeng, Shunzhi Zhu","doi":"10.1109/ANTHOLOGY.2013.6784693","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784693","url":null,"abstract":"Out-class sampling working together with in-class sampling is a popular strategy to train Support Vector Machine (SVM) classifier with imbalanced data sets. However, it may lead to some inconsistency because the sampling strategy and SVM work in different space. This paper presents a kernel-based over-sampling approach to overcome the drawback. The method first preprocesses the data using both in-class and out-class sampling to generate minority instances in the feature space, then the pre-images of the synthetic samples are found based on a distance relation between input space and feature space. Finally, these pre-images are appended to the original minority class data set to train a SVM. Experiments on real data sets indicate that compared with existing over-sampling technique, the samples generated by the proposed strategy have the higher quality. As a result, the effectiveness of classification by SVM with imbalanced data sets is improved.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129592410","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 meet-in-the-middle attack on the LBlock cipher 对LBlock密码的中间相遇攻击
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784717
Yongzhuang Wei, Chongmao Su, Chun-guang Ma
{"title":"A meet-in-the-middle attack on the LBlock cipher","authors":"Yongzhuang Wei, Chongmao Su, Chun-guang Ma","doi":"10.1109/ANTHOLOGY.2013.6784717","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784717","url":null,"abstract":"LBlock is a new lightweight Block cipher which was proposed by Wu and Zhang at ACNS2011. The block size of LBlock is 64 bits and its key size is 80 bits. It was reported that the cipher is very suitable for many resource constrained environments (for instance RFID and sensor networking) which usually have weak computation ability, strict power constraints, or a small storage space and so on. In this paper, the security of LBlock cipher against a meet-in-the-middle attack is examined. An 11-round distinguisher is constructed by using the structure of LBlock encryption algorithm. Moreover, it is shown that 19-round LBlock is breakable with a data complexity of 238 chosen plaintexts and a time complexity of 265 19-round LBlock encryptions. This is the first known evaluation of the LBlock cipher against a meet-in-the - middle attack.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129598322","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 balanced model and optimization of NOx emission and boiler efficiency at a coal-fired utility boiler 燃煤电站锅炉NOx排放与锅炉效率平衡模型及优化
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784853
Wang Xu, Chang Tai-hua
{"title":"The balanced model and optimization of NOx emission and boiler efficiency at a coal-fired utility boiler","authors":"Wang Xu, Chang Tai-hua","doi":"10.1109/ANTHOLOGY.2013.6784853","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784853","url":null,"abstract":"In order to meet the requirement of high efficiency and low emission in boiler operations, a hybrid model is established based on experimental data and combined with BP neural network. This model uses the adjustable operation parameters of boiler as inputs and chooses NOx emission and boiler efficiency as outputs to achieve the prediction of NOx emission and thermal efficiency. And it optimizes the combustion process by using genetic algorithm. The results show that it is an applicable and effective numerical optimization method.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127282258","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
An autonomous vehicle following approach - The virtual flexible bar model 一种自动驾驶车辆跟随方法——虚拟柔性杆模型
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784742
Z. Lu, Bing Li, Jianhua Wang, Weihai Chen
{"title":"An autonomous vehicle following approach - The virtual flexible bar model","authors":"Z. Lu, Bing Li, Jianhua Wang, Weihai Chen","doi":"10.1109/ANTHOLOGY.2013.6784742","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784742","url":null,"abstract":"An improved virtual flexible bar algorithm which aims at improving the trajectory tracking accuracy of automatic vehicle following system is proposed in this paper. To achieve successful vehicle following, the algorithm mainly consists two parts: the flexible bar which can fit the leader vehicle's trajectory and the force acting in the flexible bar which pull the follower vehicle to track the leader's trajectory besides adjusting the velocity and acceleration of the follower according to the motion state of the leader. In order to maintain the smooth motion of the follower and make sure that the follower could carry out the commands transmitted from the controller accurately, an adaptive trajectory tracking control is also implemented. The simulated experimental results validate that the follower is able to trail the trajectories of the leader vehicle keep the error within an satisfied limits meanwhile maintaining a safe following distance.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129928960","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
An optimization strategy of resource management in Virtualization cloud platform 虚拟化云平台中资源管理的优化策略
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784754
Shuai Gao, Ting-lei Huang, Guo-ning Gan
{"title":"An optimization strategy of resource management in Virtualization cloud platform","authors":"Shuai Gao, Ting-lei Huang, Guo-ning Gan","doi":"10.1109/ANTHOLOGY.2013.6784754","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784754","url":null,"abstract":"Virtualization and cloud computing platform brought the new combination of resources integration and use mode. Cloud computing distributes computing tasks to large pools consists of computing resources to make all kinds of application system could acquire services according to need; The Virtualization technology can greatly improve the efficiency and availability of resources and application in cloud computing system, and greatly simplified IT infrastructure, optimize resource and reduce the risk. In order to reduce the spending of virtual machines in the virtualization environment, improve the virtualization implementation efficiency, based on the virtual cloud platform, we propose a computing resources load balance management strategy based on the time axis and introduce the CPU time assignment algorithm.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130142477","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 case for the cloud storage system supporting sensitive data application 云存储系统支持敏感数据应用案例
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784871
Jiangjiang Wu, Cong Liu, Jun Ma, Yong Cheng, Jiangchun Ren, Zhiying Wang
{"title":"A case for the cloud storage system supporting sensitive data application","authors":"Jiangjiang Wu, Cong Liu, Jun Ma, Yong Cheng, Jiangchun Ren, Zhiying Wang","doi":"10.1109/ANTHOLOGY.2013.6784871","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784871","url":null,"abstract":"With more and more users are willing to store their data in the cloud storage system, while they get many benefits from the cloud, their data faces potential serious security threats, especially about the sensitive data applications. In this paper, we analyze the unique security requirements of the sensitive data application in the cloud, and we propose improved structure for the typical cloud storage system architecture. The hardware USBKey is introduced to the architecture for purpose of enhancing user identity security and interaction security between the users and the cloud storage system. Moreover, drawn on the idea of data active protection, a data security container is introduced to the system to enhancing the security of the data transmission process; by encapsulating the encrypted data, increasing appropriate access control and data management functions, we turn the static data blocks into a dynamic executable data security container. Then, we design security enhanced cloud storage terminal software architecture to adapt to the user's specific requirements, and its functions and components can be customizable; moreover, the architecture can detect whether the execution environment is accord with the pre-defined environment requirements.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132412801","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
Mixed communication method for data gathering and aggregation in wireless sensor networks 无线传感器网络中数据采集和聚合的混合通信方法
IEEE Conference Anthology Pub Date : 1900-01-01 DOI: 10.1109/ANTHOLOGY.2013.6784805
Hui-yong Yuan, Siqing Yang, Jiansheng Xie
{"title":"Mixed communication method for data gathering and aggregation in wireless sensor networks","authors":"Hui-yong Yuan, Siqing Yang, Jiansheng Xie","doi":"10.1109/ANTHOLOGY.2013.6784805","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784805","url":null,"abstract":"Clustering provides an effective way for prolonging the lifetime of a sensor network. However, when cluster heads transmit their data to the sink via multi-hop communication, the cluster heads closer to the sink are burdened with heavy relay traffic and tend to die early. Alternatively, if all cluster heads transmit data to the sink via single-hop communication, the cluster heads further from the sink will die much more quickly than those closer to the sink. To balance the cluster heads energy consumption, we present a mixed communication method where the cluster heads can transmit data to the sink in either single-hop or multi-hop. The simulation results show that our method outperforms LEACH and HEED in terms of network lifetime by balancing energy consumption.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132038835","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
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学术官方微信