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

2009 Fourth International Conference on Computer Sciences and Convergence Information Technology最新文献

筛选
英文 中文
Probabilistic Encryption--A Practical Implementation 概率加密——一个实用的实现
2009 Fourth International Conference on Computer Sciences and Convergence Information Technology Pub Date : 2009-11-24 DOI: 10.1109/ICCIT.2009.216
Orhio Mark Creado, Yiling Wang, Xianping Wu, P. D. Le
{"title":"Probabilistic Encryption--A Practical Implementation","authors":"Orhio Mark Creado, Yiling Wang, Xianping Wu, P. D. Le","doi":"10.1109/ICCIT.2009.216","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.216","url":null,"abstract":"This paper aims to provide a practical implementation of a probabilistic cipher by extending on the algorithms by Fuchsbauer, Goldwasser and Micali. We provide details on designing and implementing the cipher and further support our understanding by providing a statistical analysis of our implementation for the key generation, encryption, and decryption times taken by the cipher for key sizes of 1024, 2048, and 4096 bits for varying message spaces of 750, 1500, 3000, and 5000 bits. The concept of 'inter-bit operating time' is introduced for the cipher which calculates time elapsed between two instances of an operation. We show the working of a probabilistic cipher purely from a practical standpoint to justify if its original algorithm is practically implementable.","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133641243","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 Comprehensive Assessment to the Human Resource Sustainable Development Based on Grey Cluster 基于灰色聚类的人力资源可持续发展综合评价
2009 Fourth International Conference on Computer Sciences and Convergence Information Technology Pub Date : 2009-11-24 DOI: 10.1109/ICCIT.2009.244
Wen-jie Lu, H. Yu, Yanan Wang
{"title":"A Comprehensive Assessment to the Human Resource Sustainable Development Based on Grey Cluster","authors":"Wen-jie Lu, H. Yu, Yanan Wang","doi":"10.1109/ICCIT.2009.244","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.244","url":null,"abstract":"Based on the existing assessment theory and model, a more scientific assessment index system of human resource sustainable development and assess model are structured. Then using this methods, this paper evaluates Hebei human resource sustainable development, especially Longitudinal comparing Hebei human resource sustainable development in 2006 with 2000 and 1996, the conclusion shows that 2006 and 2000 belongs to the middle level of sustainable development, and 1996 belongs to the weak level. But 2006 is closer to strong level than 2000. Finally some measure is given to improve Hebei human resource situation.","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130341530","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
Ant Colony System Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pick-Up 蚁群算法求解同时取货和送货车辆路径问题
2009 Fourth International Conference on Computer Sciences and Convergence Information Technology Pub Date : 2009-11-24 DOI: 10.1109/ICCIT.2009.264
Guillermo Cabrera G., Felipe Peralta
{"title":"Ant Colony System Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pick-Up","authors":"Guillermo Cabrera G., Felipe Peralta","doi":"10.1109/ICCIT.2009.264","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.264","url":null,"abstract":"Due to the increased demands for distribution/redistribution, recycling and repacking, there has been a significant change in the logistics process. This article presented an Ant Colony System (ACS) algorithm to solve a Vehicle Routing Problem with Simultaneous Delivery and Pick-up (VRPSDP). The objective of this problem is to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand of the customer population. To solve the VRPSDP model, ACS approach is based in the pheromone strategy, inspired in the natural Ants behavior. This behavior is assigned to vehicles, which move along the route on which the pheromone intensity is strong. The ACS algorithm provides good solutions and shows that it is a competitive method related with other heuristics or meta-heuristics that have been proposed in literature.","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130363279","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
User Personality Modeling in Game-Based Training System for Mine Accident Rescue Troop 基于游戏的矿山事故救援部队训练系统中的用户个性建模
2009 Fourth International Conference on Computer Sciences and Convergence Information Technology Pub Date : 2009-11-24 DOI: 10.1109/ICCIT.2009.139
Qian Cui, Xue-li Yu, Zhi Li, Chang-Neng Zhou
{"title":"User Personality Modeling in Game-Based Training System for Mine Accident Rescue Troop","authors":"Qian Cui, Xue-li Yu, Zhi Li, Chang-Neng Zhou","doi":"10.1109/ICCIT.2009.139","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.139","url":null,"abstract":"A game-based training system usually has its specific purpose. In our work, the system is designed for the mine accident rescue troop. When a mine accident happens, the conditions in the mine are extremely abominable, so the members are required not only to master the basic professional knowledge and skills but also to have good psychological diathesis, which are exactly our goals of designing this training system. In order to achieve the best results for each user, the personality model is applied to the system. In this paper, we firstly describe what the user’s personality model is. According to requirements of the system, we propose a user’s personality model. Moreover, we describe how we can use this model in the game-based training system and what we can benefit from the model. The requirements of psychological tests that used in the game and the expression of the user’s behaviors will be discussed, as well as the storage structure of the game log and user profile. At the end we make an experiment to test the correctness of personality traits descriptions gotten form personality model.","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114846856","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
Effective Lane Detection and Tracking Method Using Statistical Modeling of Color and Lane Edge-Orientation 基于颜色和车道边缘方向统计建模的有效车道检测与跟踪方法
2009 Fourth International Conference on Computer Sciences and Convergence Information Technology Pub Date : 2009-11-24 DOI: 10.4156/AISS.VOL2.ISSUE3.6
Jin-Wook Lee, Jae-Soo Cho
{"title":"Effective Lane Detection and Tracking Method Using Statistical Modeling of Color and Lane Edge-Orientation","authors":"Jin-Wook Lee, Jae-Soo Cho","doi":"10.4156/AISS.VOL2.ISSUE3.6","DOIUrl":"https://doi.org/10.4156/AISS.VOL2.ISSUE3.6","url":null,"abstract":"This paper proposes an effective lane detection and tracking method using statistical modeling of lane color and edge-orientation in the image sequence. At first, we will address some problem of classifying a pixel into two classes(lane or background) and detecting one exact lane. Generally, the probability of a pixel classification error conditioned on the distinctive feature vector can be decreased by selecting more distinctive features. A proposed pixel classifier model(Bayes decision rule for minimizing the probability of error) uses two distinctive features, lane color and edge-orientation, for classifying a lane pixel from background image. By estimating PDFs of each feature and continuously updating the estimated PDFs, we can effectively adapt the various road conditions and the different types of lane. The histogram of edge magnitudes with respect to edge-orientation will be used as the PDF for the lane edge orientation feature. Similarly, the color histogram of the HSV color model will be used as the PDF of the color feature. And, for the postprocessing, we will use the LMS algorithm in order to exclude misclassified pixels and decide one optimal lane position. Various comparative experimental results show that the proposed scheme is very effective in the lane detection and can be implemented in real-time.","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"245 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115854775","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}
引用次数: 49
A Relation between Self-Reciprocal Transformation and Normal Basis over Odd Characteristic Field 奇特征域上自倒易变换与正规基的关系
2009 Fourth International Conference on Computer Sciences and Convergence Information Technology Pub Date : 2009-11-24 DOI: 10.4156/AISS.VOL2.ISSUE3.1
S. Kobayashi, Y. Nogami, T. Sugimura
{"title":"A Relation between Self-Reciprocal Transformation and Normal Basis over Odd Characteristic Field","authors":"S. Kobayashi, Y. Nogami, T. Sugimura","doi":"10.4156/AISS.VOL2.ISSUE3.1","DOIUrl":"https://doi.org/10.4156/AISS.VOL2.ISSUE3.1","url":null,"abstract":"Let $q$ and $f(x)$ be an odd characteristic and an irreducible polynomial of degree $m$ over $•F{q}{}$, respectively. Then, suppose that $F(x)=x^mf(x+x^{-1})$ is irreducible over $•F{q}{}$. This paper shows that the conjugate zeros of $F(x)$ with respect to $•F{q}{}$ form a normal basis in $•F{q}{2m}$ if and only if those of $f(x)$ form a normal basis in $•F{q}{m}$ and the partial conjugates given as follows are linearly independent over $•F{q}{}$, •begin{equation} •{•gamma-•gamma^{-1},(•gamma-•gamma^{-1})^q, •cdots ,(•gamma-•gamma^{-1})^{q^{m-1}}•}, •end{equation} where $•gamma$ is a zero of $F(x)$ and thus a proper element in $•F{q}{2m}$. In addition, from the viewpoint of $q$--polynomial, this paper proposes an efficient method for checking whether or not the conjugate zeros of $F(x)$ satisfy the condition.","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115139620","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
Recaption Cost Based LFU Image Cache Algorithm and Application in WAP Browser 基于重捕获代价的LFU图像缓存算法及其在WAP浏览器中的应用
2009 Fourth International Conference on Computer Sciences and Convergence Information Technology Pub Date : 2009-11-24 DOI: 10.1109/ICCIT.2009.129
Huiguang Chen, Yunxiang Gao, Chuang-Bai Xiao, Chaoqin Gao, Li-qing Liu
{"title":"Recaption Cost Based LFU Image Cache Algorithm and Application in WAP Browser","authors":"Huiguang Chen, Yunxiang Gao, Chuang-Bai Xiao, Chaoqin Gao, Li-qing Liu","doi":"10.1109/ICCIT.2009.129","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.129","url":null,"abstract":"This paper presents the idea of recaption cost to characterize WAP sources of images and improve the classic cache removal policy. Then It gets a new policy of image caches, LFU based on recaption cost; using the algorithm in the wap browser, It adopts the strategy of destroying cached images when exiting the browser, in this way, it not only guarantees obtaining newest images when starting browser next time, but also improves the overall performance of the browser.","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115506999","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 Sealed-Bid Electronic Marketplace Bidding Auction Protocol by Using Ring Signature 基于环签名的密封竞价电子市场竞价拍卖协议
2009 Fourth International Conference on Computer Sciences and Convergence Information Technology Pub Date : 2009-11-24 DOI: 10.1109/ICCIT.2009.156
Wenbo Shi, Injoo Jang, H. Yoo
{"title":"A Sealed-Bid Electronic Marketplace Bidding Auction Protocol by Using Ring Signature","authors":"Wenbo Shi, Injoo Jang, H. Yoo","doi":"10.1109/ICCIT.2009.156","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.156","url":null,"abstract":"We modified the multi-agent negotiation test-bed auction scheme which was proposed by Collins et al. In 2004, Jaiswal et al. have modified Collins’s scheme, but Jaiswal’s scheme still has some security weaknesses: such as replay data attack and DOS (denial-of-service) attack, collision between customers and a certain supplier. So the proposed protocol tries to reduce DOS attack and avoid replay data attack by using improved ring signature scheme, also it achieves perfect anonymity. And it publishes an interpolating polynomial for sharing the determination process data and avoids collusion between a customer and a certain supplier. Furthermore, the proposed scheme relaxes the trust assumptions for three-party in Jaiswal’s scheme. According to comparison and analysis with other protocols, our proposed protocol shows good security","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"436 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123199043","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
An Inside Attacker Proof Intrusion Detection System 防内部攻击者入侵检测系统
2009 Fourth International Conference on Computer Sciences and Convergence Information Technology Pub Date : 2009-11-24 DOI: 10.1109/ICCIT.2009.158
Wenbo Shi, Injoo Jang, H. Yoo
{"title":"An Inside Attacker Proof Intrusion Detection System","authors":"Wenbo Shi, Injoo Jang, H. Yoo","doi":"10.1109/ICCIT.2009.158","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.158","url":null,"abstract":"Recently, an intrusion detection system which named CONFIDANT was proposed, which utilized file integrity analyzers and mobile agent for intrusion detection and aimed to detection of malicious activity by insiders. But CONFIDANT has vulnerabilities in security aspect, the sensor agents in the lowest echelon are easily compromised by malicious platforms. Therefore, we integrate a security mechanism which named clone agent protocol into CONFIDANT. We improved the structure of CONFIDANT to protect those agents and strengthen its security, make sure them finish their computation and detect malicious hosts even though there are a few malicious platforms.","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125029832","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
Duplicate Detection in Documents and WebPages Using Improved Longest Common Subsequence and Documents Syntactical Structures 基于改进最长公共子序列和文档语法结构的文档和网页重复检测
2009 Fourth International Conference on Computer Sciences and Convergence Information Technology Pub Date : 2009-11-24 DOI: 10.1109/ICCIT.2009.235
M. Elhadi, Amjad Al-Tobi
{"title":"Duplicate Detection in Documents and WebPages Using Improved Longest Common Subsequence and Documents Syntactical Structures","authors":"M. Elhadi, Amjad Al-Tobi","doi":"10.1109/ICCIT.2009.235","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.235","url":null,"abstract":"Duplicate Detection in Documents and WebPages using Improved Longest Common Subsequence and Documents Syntactical Structures","PeriodicalId":112416,"journal":{"name":"2009 Fourth International Conference on Computer Sciences and Convergence Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121607838","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}
引用次数: 39
首页 上一页 下一页 尾页
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学术官方微信