2010 2nd International Conference on Information Technology Convergence and Services最新文献

筛选
英文 中文
An Efficient Approach for Vertical Handover between WLAN and EVDO 一种有效的WLAN与EVDO垂直切换方法
Khurram Javed, Umar Saleem, Khalid Hussain, M. Sher
{"title":"An Efficient Approach for Vertical Handover between WLAN and EVDO","authors":"Khurram Javed, Umar Saleem, Khalid Hussain, M. Sher","doi":"10.1109/ITCS.2010.5581287","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581287","url":null,"abstract":"The IEEE 802.11 based wireless LAN (WLAN) is most widely used for the real time communication such as Voice over IP (VOIP) video conferencing and etc. As the wireless internet access is increasing day by day by the combination of different small regions which are served by one operator or one Access Terminal. So there is the problem of mobility that a Mobile Node (MN) may move from one network to other network, also there is the problem of connectivity. To maintain the connectivity of a established call between two different networks using mobility management we proposed an efficient algorithm which maintain the real time connection as well as preventing the data loss during transition. We experiment our proposed algorithm by using a redundant buffer which store the data in transition mode and vanish the alternate data bits when the connection is establish with the network. The alternate data bit is also send for the same time as the time taken by the redundant buffer to disappear the data. This process saves our data in the transition time.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123611272","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
Quantum-Inspired Electromagnetism-Like Mechanism for Solving 0/1 Knapsack Problem 求解0/1背包问题的量子启发类电磁学机制
Chih-Cheng Chang, Chi-Yuan Chen, Cheng-Wei Fan, H. Chao, Yao-Hsin Chou
{"title":"Quantum-Inspired Electromagnetism-Like Mechanism for Solving 0/1 Knapsack Problem","authors":"Chih-Cheng Chang, Chi-Yuan Chen, Cheng-Wei Fan, H. Chao, Yao-Hsin Chou","doi":"10.1109/ITCS.2010.5581278","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581278","url":null,"abstract":"In this paper, we propose a novel evolutionary computing method which is called quantum-inspired electromagnetism-like mechanism (QEM) to solve 0/1 knapsack problem. QEM is based on the electromagnetism theory and using the characteristic of quantum computing. It can rapidly and efficiently find out the optimal solution of combination optimization problem. We compare the conventional genetic algorithm (CGA), quantum-inspired genetic algorithm (QGA), quantum-inspired electromagnetism-like mechanism algorithm (QEM). The experiment results show that the QEM is better than CGA, EM and QGA in general cases.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125576607","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
Extracting Search Intentions from Web Search Logs 从Web搜索日志中提取搜索意图
Kinam Park, Taemin Lee, Soonyoung Jung, Sangyep Nam, Heuiseok Lim
{"title":"Extracting Search Intentions from Web Search Logs","authors":"Kinam Park, Taemin Lee, Soonyoung Jung, Sangyep Nam, Heuiseok Lim","doi":"10.1109/ITCS.2010.5581286","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581286","url":null,"abstract":"Web search users complain of inaccurate results of the current search engines. Most of inaccurate results are from failing to understand user???s search goal. This paper proposes a method to mine user???s intentions and to build an intention map representing their information needs. It selects intention features from search logs obtained from previous search sessions on a given query and extracts user???s intentions by using clustering and labeling algorithms. The mined user???s intentions on the query are represented in an intention map. For the efficiency analysis of intention maps, we extracted user intentions using 2,600 search log data of a current domestic commercial web search engine. The experimental results using a web search engine with the intention maps show statistically significant improvements in user satisfaction scores.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121979309","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
Anonymous Access Control Framework Based on Group Signature 基于群签名的匿名访问控制框架
Yun-kyung Lee, Sokjun Lee, J. Hwang, Byung-ho Chung, Deok-Gyu Lee
{"title":"Anonymous Access Control Framework Based on Group Signature","authors":"Yun-kyung Lee, Sokjun Lee, J. Hwang, Byung-ho Chung, Deok-Gyu Lee","doi":"10.1109/ITCS.2010.5581260","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581260","url":null,"abstract":"Anonymous authentication is a method for privacy protection in web service. But, the nature of anonymous authentication, access control of service is seemed impossible because it doesn???t know the user???s characteristics. In our paper, we propose an anonymous authorization framework which uses qualification certificate and anonymous authentication based on Short Group Signatures. Also, our qualification certificate is used as payment token. By using our proposed authorization protocol, users can use anonymous authentication, anonymous authorization, and anonymous payment in web service.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114841469","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
Acquiring Korean Lexical Entry from a Raw Corpus 从原始语料库中获取韩语词汇条目
WonHee Yu, Kinam Park, Soonyoung Jung, Heuiseok Lim
{"title":"Acquiring Korean Lexical Entry from a Raw Corpus","authors":"WonHee Yu, Kinam Park, Soonyoung Jung, Heuiseok Lim","doi":"10.1109/ITCS.2010.5581289","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581289","url":null,"abstract":"This paper proposes a computational lexical entry acquisition model based on a representation model of the mental lexicon. The proposed model acquires lexical entries from a raw corpus by unsupervised learning like human. The model is composed of full-form and morpheme acquisition modules. In the full-from acquisition module, core full-forms are automatically acquired according to the frequency and recency thresholds. In the morpheme acquisition module, a repeatedly occurring substring in different full-forms is chosen as a candidate morpheme. Then, the candidate is corroborated as a morpheme by using the entropy measure of syllables in the string. The experimental results with a Korean corpus of which size is about 16 million full-forms show that the model successively acquires major full-forms and morphemes with the precision of 100% and 99.04%, respectively.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131197316","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
Real-Time Vehicle Type Recognition for a Traffic Monitoring System 交通监控系统的实时车辆类型识别
Dariusz Król
{"title":"Real-Time Vehicle Type Recognition for a Traffic Monitoring System","authors":"Dariusz Król","doi":"10.1109/ITCS.2010.5581270","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581270","url":null,"abstract":"This paper presents the main modules of the system to efficiently recognize type of the vehicles. The entry results are in line with our expectations. The proposed system achieves good performances on a test set containing over 3500 vehicle images and the detection rate is about 93% when it was compared with the measurements done by a human expert. Moreover, it is not sensitive to variation in time, weather and light condition. The computational complexity is low and the algorithm can work in real time.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116931979","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
Lifetime Maximization Considering Connectivity and Overlapped Targets in Wireless Sensor Networks 考虑连通性和目标重叠的无线传感器网络生命周期最大化
Yong-hwan Kim, Youn-Hee Han, Chang-Min Mun, Chan Yeol Park, Doosoon Park
{"title":"Lifetime Maximization Considering Connectivity and Overlapped Targets in Wireless Sensor Networks","authors":"Yong-hwan Kim, Youn-Hee Han, Chang-Min Mun, Chan Yeol Park, Doosoon Park","doi":"10.1109/ITCS.2010.5581290","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581290","url":null,"abstract":"A critical issue in wireless sensor networks is an energy-efficiency since the sensor batteries have limited energy power and, in most cases, are not rechargeable. The most practical manner relate to this issue is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. Especially, CTC (Connected Target Coverage) problem has been considered as a representative energy-efficiency problem considering connectivity as well as target coverage. In this paper, we propose a new energy consumption model considering overlapped targets and create a new problem, OTCC (Overlapped Target and Connected Coverage) problem of which objective is to maximize the network lifetime based on the new energy consumption model. Also, we present SPT (Shortest Path based on Targets)-Greedy algorithm to solve the problem. Our simulation results show that SPT-Greedy algorithm performs much better than the previous algorithm in terms of the network lifetime.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126589005","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}
引用次数: 12
Classifying of Objectionable Contents with Various Audio Signal Features 基于不同音频信号特征的不良内容分类
Jae-Deok Lim, S. Han, Byeongcheol Choi, ChoelHoon Lee, Byungho Chung
{"title":"Classifying of Objectionable Contents with Various Audio Signal Features","authors":"Jae-Deok Lim, S. Han, Byeongcheol Choi, ChoelHoon Lee, Byungho Chung","doi":"10.1109/ITCS.2010.5581261","DOIUrl":"https://doi.org/10.1109/ITCS.2010.5581261","url":null,"abstract":"The rapid development of multimedia related technologies and internet infrastructure have made general users can create, edit, and post their contents and can easily access any content that they desire. But it also leads to the harmful side effects that are creation and uncontrolled distribution of objectionable contents. Especially it is very serious for pornographic contents that are more than about 70% of objectionable contents. The objectionable contents mean the pornographic contents in this paper. Most of the related studies are focused on image-based approaches and there are few studies based on audio-based approaches. In this paper, we try to classify objectionable contents based on various audio signal features. The audio signal features used in this paper are perceptual features that are spectral properties, MFCC based feature set and TDMFCC based feature set. For the reasonable results, we define the audio-based objectionable contents model and then construct dataset according to the defined model. For training and classifying dataset of two classes, objectionable and nonobjectionable class, SVM classifier is used. TDMFCC based feature set has a good performance of accurate rate with SVM classifier, about 95%, and the results show that it is very effective to detect and classify the objectionable contents based on audio features.","PeriodicalId":166169,"journal":{"name":"2010 2nd International Conference on Information Technology Convergence and Services","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124844421","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
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学术官方微信