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

2009 2nd IEEE International Conference on Computer Science and Information Technology最新文献

筛选
英文 中文
J2EE-based human resources s management information system design and implementation 基于j2ee的人力资源管理信息系统的设计与实现
2009 2nd IEEE International Conference on Computer Science and Information Technology Pub Date : 2009-09-11 DOI: 10.1109/ICCSIT.2009.5234604
Gui Ying, Tang Bin, Gao Xiao-hui
{"title":"J2EE-based human resources s management information system design and implementation","authors":"Gui Ying, Tang Bin, Gao Xiao-hui","doi":"10.1109/ICCSIT.2009.5234604","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234604","url":null,"abstract":"In this paper, through the research on enterprise human resources s and software engineering theoretical knowledge, using J2EE platform technology, a new flexible, high-effect, expandable enterprise human resources s management system framework is designed and then implemented. This system not only can successfully resolve a large number of practical problems the enterprise human resources management faced to improve human resources management efficiency, but also the information system is simple and easy to implement, has strong features such as easy to expand, easy to maintain, flexible and secure.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124475878","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
Research of capacity optimizing model on wireless mesh networks 无线网状网络容量优化模型研究
2009 2nd IEEE International Conference on Computer Science and Information Technology Pub Date : 2009-09-11 DOI: 10.1109/ICCSIT.2009.5234802
Shuqiang Huang, Qi-lun Zheng
{"title":"Research of capacity optimizing model on wireless mesh networks","authors":"Shuqiang Huang, Qi-lun Zheng","doi":"10.1109/ICCSIT.2009.5234802","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234802","url":null,"abstract":"As a new type of wireless network architecture, because of its self-organization, and support multi-hop and heterogeneous networks, Wireless Mesh networks has played an important role in building “wireless cities” and become an research spot in academia and industry. In practical applications, network capacity is the most important need and high network throughput is the most important network performance parameter. As a wireless Mesh network basic issue, network capacity associates the physical characteristics of the network, topology, routing algorithm and channel allocation scheme at all levels. Aiming the question of wireless Mesh network capacity, the paper proposes a hierarchy optimization model from bottom to up and a series of optimization ways based on programming theory. the main content in this paper includes: (1) Optimizing link-channel scheduling strategy, studying the wireless Mesh network channel allocation algorithm, and an interference-based model and linear programming channel allocation and routing joint algorithm is proposed; (2) research of network scalability, taking into account the network coverage and performance at the same time, the paper presents a mixed integer nonlinear programming algorithm for the deployment of the AP; (3) research of gateway deploying strategy, a linear programming based heuristic algorithm gateway deployment is proposed. Research on these issues of network capacity optimization will improve the performance of networks and promote the development of wireless mesh networks; it also has certain significance in the engineering practice.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125715742","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
Research on distributed cooperative CAE analysis platform construction 分布式协同CAE分析平台构建研究
2009 2nd IEEE International Conference on Computer Science and Information Technology Pub Date : 2009-09-11 DOI: 10.1109/ICCSIT.2009.5234429
Yongming Wang, Xiaoliu Yu
{"title":"Research on distributed cooperative CAE analysis platform construction","authors":"Yongming Wang, Xiaoliu Yu","doi":"10.1109/ICCSIT.2009.5234429","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234429","url":null,"abstract":"Based on requirements analysis of distributed cooperative CAE, this paper proposed a distributed cooperative CAE analysis platform architecture, which has four functional modules and uses a three layered architecture: user layer, logic layer and data resource layer. Some key techniques used in the platform were discussed, including cooperative CAE analysis tools, cooperative CAE management tools, CAD/CAE integrated modeling techniques considering the finite element analysis features in CAD model, optimization method of operating speed and network security of the platform, which uses a multi-layered security architecture based on IP Security Protocol (IPSec), Virtual Private Network (VPN) and Security Socket Layer (SSL). The above-mentioned techniques support the Distributed Cooperative CAE analysis platform construction and operation.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125924007","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
Semi-supervised visual object tracking by label propagation 基于标签传播的半监督视觉目标跟踪
2009 2nd IEEE International Conference on Computer Science and Information Technology Pub Date : 2009-09-11 DOI: 10.1109/ICCSIT.2009.5234885
Junheng Huang, W. Zhang, Guangri Quan, Dongjie Zhu
{"title":"Semi-supervised visual object tracking by label propagation","authors":"Junheng Huang, W. Zhang, Guangri Quan, Dongjie Zhu","doi":"10.1109/ICCSIT.2009.5234885","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234885","url":null,"abstract":"Recently, object tracking is viewed as a foreground/background two-class classification problem. In this paper, we propose a non-parameter approach to model the observation model for tracking via graph, which is a semi-supervised approach. More specially, the topology structure of graph is carefully designed to reflect the properties of the sample's distribution during tracking. In predication, the confidence of sample's label is propagation via random walk with restart (RWR), which can utilize labeled or unlabeled samples easily. The primary advantage of our algorithm is that it keeps the appearance of object in graph model, which can easily model the multi-modal of object appearance. Experimental results demonstrate that, compared with two state of the art methods, the proposed tracking algorithm is more effective, especially in dynamically changing and clutter scenes.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126125519","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
An improvement in the restoring division algorithm (Needy Restoring Division Algorithm) 恢复除法算法的改进(需要恢复除法算法)
2009 2nd IEEE International Conference on Computer Science and Information Technology Pub Date : 2009-09-11 DOI: 10.1109/ICCSIT.2009.5234956
Nitish Aggarwal, Kartik Asooja, S. S. Verma, Sapna Negi
{"title":"An improvement in the restoring division algorithm (Needy Restoring Division Algorithm)","authors":"Nitish Aggarwal, Kartik Asooja, S. S. Verma, Sapna Negi","doi":"10.1109/ICCSIT.2009.5234956","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234956","url":null,"abstract":"An improvement in the current restoring computer division algorithm which minimizes the number of restorations performed by the computer. Currently, restoration is checked after each shifting of the register but Needy Restoring Division Algorithm checks restoration only when it is needed. The needless restorations are removed by the use of an extra register. This removal decreases the time for the division than taken in the current restoring division algorithm considerably.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124809021","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}
引用次数: 20
A Ranking Theory for Uncertain Data with Constraints 带约束的不确定数据排序理论
2009 2nd IEEE International Conference on Computer Science and Information Technology Pub Date : 2009-09-11 DOI: 10.1109/ICCSIT.2009.5234622
Chonghai Wang, Li-Yan Yuan, Jia-Huai You
{"title":"A Ranking Theory for Uncertain Data with Constraints","authors":"Chonghai Wang, Li-Yan Yuan, Jia-Huai You","doi":"10.1109/ICCSIT.2009.5234622","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234622","url":null,"abstract":"We develop a theory of top-K ranking for objects whose values may be uncertain, incomplete, or difficult to be characterized quantitatively, but between which some constraints may be required to be satisfied. We present our ranking theory for discrete space, continuous space, and the general case with probability distributions and complex constraints. The central question to be addressed is how to define the relative strengths of top-K object sequences. We show that top-K ranking defined this way in continuous space is closely related to the analysis and computation of high dimensional polyhedra, and as a consequence, the methods for the latter can be applied to compute the support ratios of top-K object sequences so that the best can be chosen.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124820791","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
Feature extraction for image recognition and computer vision 用于图像识别和计算机视觉的特征提取
2009 2nd IEEE International Conference on Computer Science and Information Technology Pub Date : 2009-09-11 DOI: 10.1109/ICCSIT.2009.5235014
Xudong Jiang
{"title":"Feature extraction for image recognition and computer vision","authors":"Xudong Jiang","doi":"10.1109/ICCSIT.2009.5235014","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5235014","url":null,"abstract":"Feature extraction and classifier design are two main processing blocks in all pattern recognition and computer vision systems. For visual patterns, extracting robust and discriminative features from image is the most difficult yet the most critical step. Several typical and advanced approaches of feature extraction from image are explored, some of which are analyzed in depth. Various techniques of feature extraction from image are organized in four categories: human expert knowledge based methods, image local structure based approaches, image global structure based techniques and machine learning based statistical approaches. We will show examples of applying these feature extraction approaches to solve problems of the image based biometrics, including fingerprint verification/identification and face detection/recognition. These illustrative application examples unveil the ideas, principles and advancements of feature extraction techniques and demonstrate their effectiveness and limitations in solving real-world problems.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128521633","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}
引用次数: 36
Improved graph cuts for patch-based texture synthesis 改进了基于补丁的纹理合成的图形切割
2009 2nd IEEE International Conference on Computer Science and Information Technology Pub Date : 2009-09-11 DOI: 10.1109/ICCSIT.2009.5234981
Kun Zou, Yueqiao Li, Zan Li, Rong Li, Xiang Xu
{"title":"Improved graph cuts for patch-based texture synthesis","authors":"Kun Zou, Yueqiao Li, Zan Li, Rong Li, Xiang Xu","doi":"10.1109/ICCSIT.2009.5234981","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234981","url":null,"abstract":"In the context of patch-based texture synthesis, this paper presents an improvement to the graph cut, a technique to optimize the patch boundaries in overlap regions. Instead of implementing the traditional minimum cut to minimize the accumulated errors along patch boundaries, a non-scalar metric is introduced to measure the errors of the cutting paths. According to this metric, the low-cost cuts tend to steer clear of high cost regions rather than taking short cuts through them, as can sometimes happen in the traditional minimum cut. Moreover, the resulting cutting paths are more circuitous and difficult to perceive by the human eye. Accordingly, a fast algorithm is proposed to conduct this new minimum cut. Experimental results show that the improved graph cuts produce more seamless textures.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128263395","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
Combining wavelet transform and Orthogonal Centroid Algorithm for ear recognition 结合小波变换和正交质心算法的人耳识别
2009 2nd IEEE International Conference on Computer Science and Information Technology Pub Date : 2009-09-11 DOI: 10.1109/ICCSIT.2009.5234392
Zhao Hai-long, Mu Zhi-chun
{"title":"Combining wavelet transform and Orthogonal Centroid Algorithm for ear recognition","authors":"Zhao Hai-long, Mu Zhi-chun","doi":"10.1109/ICCSIT.2009.5234392","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234392","url":null,"abstract":"In recent years, automatic ear recognition has become a popular research. Effective feature extraction is one of the most important steps in Content-based ear image retrieval applications. In this paper, a new approach is proposed that the low frequency sub-images are obtained by utilizing two-dimensional wavelet transform and then the features are extracted by applying Orthogonal Centroid Algorithm to the low frequency sub-images. The experimental results on USTB ear database prove that the proposed method can overcome the Small Sample Size problem and get better performance of recognition speed than conventional PCA+LDA algorithm.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128658973","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}
引用次数: 20
Traffic pattern based performance comparison of two reactive routing protocols for Ad hoc networks using NS2 基于流量模式的两种基于NS2的Ad hoc网络响应路由协议性能比较
2009 2nd IEEE International Conference on Computer Science and Information Technology Pub Date : 2009-09-11 DOI: 10.1109/ICCSIT.2009.5234702
Suresh Kumar, R. Rathy, D. Pandey
{"title":"Traffic pattern based performance comparison of two reactive routing protocols for Ad hoc networks using NS2","authors":"Suresh Kumar, R. Rathy, D. Pandey","doi":"10.1109/ICCSIT.2009.5234702","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234702","url":null,"abstract":"Ad hoc networks are characterized by wireless connectivity, continuous changing topology, distributed operations and ease of deployment. Routing in Ad hoc networks is a challenge due to mobility and thus is a current area of research. We compare two reactive routing protocols by considering multiple performance metrics to bring out their relative merits. Both DSR and AODV share similar on demand behavior, but the protocols internal mechanism leads to significant performance differences. We have analyzed the performance of protocols by varying network load, mobility and type of traffic (CBR, TCP). A detailed simulation has been done using NS2. We consider packet delivery fraction, normalized routing load, average delay, routing overhead, and packet loss as metrics for performance analysis of these protocols.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129589057","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}
引用次数: 54
首页 上一页 下一页 尾页
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学术官方微信