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

2008 IEEE 8th International Conference on Computer and Information Technology Workshops最新文献

筛选
英文 中文
Continuous Sensor Data Mining Model and System Design 连续传感器数据挖掘模型与系统设计
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.108
D. Chai, Long Jin, K. Bae, B. Hwang, K. Ryu
{"title":"Continuous Sensor Data Mining Model and System Design","authors":"D. Chai, Long Jin, K. Bae, B. Hwang, K. Ryu","doi":"10.1109/CIT.2008.WORKSHOPS.108","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.108","url":null,"abstract":"The sensor data, which is inputted from sensor network, is stream data having continuous and infinite properties. The previous data mining techniques canpsilat directly be used in the sensor data mining because of these properties of sensor data. Also, most of application services in the sensor network are only event alert services which perceive the events from sensors and alert the events to the supervisor. In this paper, we define continuous sensor data mining model and design a system based on the model. The system can service useful knowledge by continuous sensor data mining using gathered data from sensor in the sensor network. First, we classify sensor data to the three data types, which are each simple sensor data, continuous sensor data, and sensor event data, and define sensor data mining models about outlier analysis, pattern analysis, and prediction analysis. After the definition of model, we design a system which can be used in application services like u-Silvercare, Sea Ranching Program, City Environment Management, etc., based on these mining models in sensor network environment.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126646597","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
Action Recognition Unrestricted by Location and Viewpoint Variation 不受位置和视点变化限制的动作识别
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.41
Feiyue Huang, Guangyou Xu
{"title":"Action Recognition Unrestricted by Location and Viewpoint Variation","authors":"Feiyue Huang, Guangyou Xu","doi":"10.1109/CIT.2008.WORKSHOPS.41","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.41","url":null,"abstract":"Action recognition is a popular research topic in computer vision. So far most of proposed algorithms are under assumptions of fixed location and viewpoint of the subject, which are usually not valid in practical environment where the subject might roam in the field. To address the difficulties of action recognition tolerating location and view angle variation, we propose an \"Adapted Envelop Shape\" based approach, which is a posture invariance representation and extendible to multi-camera environment. Further Adapted Envelop Shape is used as input vector for Hidden Markov Model to train and recognize actions. Our method has following desirable properties: 1) Exact camera calibration is not needed. 2) Action recognition is view point and location invariant. 3) Automatic switch of cameras according to human location makes visible area more wide. 4) Partially occlusion or out of sight of human body is tolerable. Experimental results also demonstrate the effectiveness of our method.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127008750","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
Packets Delay Analysis Based on Simplified Scheduling Theoretical Model for Wireless Networks 基于简化调度理论模型的无线网络数据包延迟分析
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.43
Yan Li, Guangxi Zhu, F. Gao, T. Xu
{"title":"Packets Delay Analysis Based on Simplified Scheduling Theoretical Model for Wireless Networks","authors":"Yan Li, Guangxi Zhu, F. Gao, T. Xu","doi":"10.1109/CIT.2008.WORKSHOPS.43","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.43","url":null,"abstract":"A simple and easy-to-implement analytical model for scheduling algorithm is proposed. Packets delay can be easily calculated with this analytical model but the computational complexity is reduced more compared with other popular methods such as Laplace-Stieltjes transform or Probability Generating Function. Two theoretical analyses on the basis of the proposed model are presented. The results are compared with the simulation results under different loads. Some significative results are reported.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132280298","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 New Visual Attention Model Using Texture and Object Features 基于纹理和物体特征的视觉注意模型
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.8
Hsuan-Ying Chen, Jin-Jang Leou
{"title":"A New Visual Attention Model Using Texture and Object Features","authors":"Hsuan-Ying Chen, Jin-Jang Leou","doi":"10.1109/CIT.2008.WORKSHOPS.8","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.8","url":null,"abstract":"Human perception tends to firstly pick attended regions which correspond to prominent objects in an image. Visual attention detection simulates the behavior of the human visual system (HVS) and detects the regions of interest (ROIs) in the image. In this study, a new visual attention model containing the texture and object models (parts) is proposed. As compared with existing texture models, the proposed texture model has better visual detection performance and low computational complexity, whereas the proposed object model can extract all the ROIs in an image. The proposed visual attention model can generate high-quality spatial saliency maps in an effective manner. Based on the experimental results obtained in this study, as compared with Hu's model, the proposed model has better performance and low computational complexity.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115395602","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
One-Sided Message Passing Programming Model for Unstructured Peer-to-Peer Computing System 非结构化点对点计算系统的单侧消息传递规划模型
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.66
Hai Jin, F. Luo, Qin Zhang, Xiaofei Liao, Hao Zhang
{"title":"One-Sided Message Passing Programming Model for Unstructured Peer-to-Peer Computing System","authors":"Hai Jin, F. Luo, Qin Zhang, Xiaofei Liao, Hao Zhang","doi":"10.1109/CIT.2008.WORKSHOPS.66","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.66","url":null,"abstract":"The programming is still a challenging issue for the high performance distributed computing (HPDC) platform, and it is critical to the popularity of peer-to-peer (P2P) based HPDC systems. Therefore, this paper focuses on the design and implementation of OMP, a one-sided message passing programming model for unstructured P2P computing system, P2HP. Based on taskspsila execution flow, P2HP provides a one-sided point-to-point message-passing communication library, and a software development kit with rich APIs for applicationspsila parallelization. Furthermore, a serial sequence alignment algorithm is parallelized with OMP in P2HP. The evaluation shows that OMP makes P2HP practical and efficient.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116042125","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
Search Results Clustering in Chinese Context Based on a New Suffix Tree 基于新后缀树的中文上下文搜索结果聚类
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.63
Jiangning Wu, Zhijiang Wang
{"title":"Search Results Clustering in Chinese Context Based on a New Suffix Tree","authors":"Jiangning Wu, Zhijiang Wang","doi":"10.1109/CIT.2008.WORKSHOPS.63","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.63","url":null,"abstract":"Searching for information by search engines has been gaining popularity in recent years. However, results returned by most Chinese Web search engines usually reach up to thousands or even millions documents, so search results clustering is of critical need for on-line grouping of similar documents to improve user experience while searching collections of Web pages and facilitate browsing Chinese Web pages in a more compact and thematic form. This paper presents a new suffix tree clustering (STC) algorithm for Web search results clustering, which is more suitable for Chinese context. It is built in terms of Chinese words, of which meaningless phrases are ignored by an efficient strategy we proposed. Meanwhile the Chinese synonymy is introduced into the suffix tree to improve the quality of the clusters. Experiments show that the proposed novel STC algorithm has a better performance in precision and speed than original STC.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126152404","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
Analysis of Pattern Recognition Algorithms Using Associative Memory Approach: A Comparative Study between the Hopfield Network and Distributed Hierarchical Graph Neuron (DHGN) 基于联想记忆方法的模式识别算法分析——Hopfield网络与分布式分层图神经元(DHGN)的比较研究
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.65
A. Amin, R. Mahmood, A.I. Khan
{"title":"Analysis of Pattern Recognition Algorithms Using Associative Memory Approach: A Comparative Study between the Hopfield Network and Distributed Hierarchical Graph Neuron (DHGN)","authors":"A. Amin, R. Mahmood, A.I. Khan","doi":"10.1109/CIT.2008.WORKSHOPS.65","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.65","url":null,"abstract":"In this paper, we conduct a comparative analysis of two associative memory-based pattern recognition algorithms. We compare the established Hopfield network algorithm with our novel Distributed Hierarchical Graph Neuron (DHGN) algorithm. The computational complexity and recall efficiency aspects of these algorithms are discussed. The results show that DHGN offers lower computational complexity with better recall efficiency compared to the Hopfield network.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"135 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128794433","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
CNCnet IP Telephone Remote Auto-Recharge System Based on MultiAgent 基于多agent的CNCnet IP电话远程自动充值系统
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.10
J. Han
{"title":"CNCnet IP Telephone Remote Auto-Recharge System Based on MultiAgent","authors":"J. Han","doi":"10.1109/CIT.2008.WORKSHOPS.10","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.10","url":null,"abstract":"To realize the auto operation of the remote recharge process of IP telephone and the low-balance add-fund notice of IP account, an IP telephone remote auto-recharge system based on multiagent is developed by the author. This system can effectively implement IP telephone remote auto-recharge and auto-voice playing to notice users to add fund and can lead the related IP telephone service information into computer management. In this paper, the author mainly introduces the design method of intelligent remote auto-recharge based on multiagent technology, the resolved technical problems and the characteristics of system application.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"72 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126108732","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 Vulnerability and Exploit Independent Approach for Attack Path Prediction 一种独立于漏洞和利用的攻击路径预测方法
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.73
S. Malhotra, S. Bhattacharya, S.K. Ghosh
{"title":"A Vulnerability and Exploit Independent Approach for Attack Path Prediction","authors":"S. Malhotra, S. Bhattacharya, S.K. Ghosh","doi":"10.1109/CIT.2008.WORKSHOPS.73","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.73","url":null,"abstract":"Network Security has gained an ever increasing importance today because of the increased dependence on the networks. One way to assess the threats to the networks is through the use of the attack graphs. However, because of their sheer enormity and complexity the analysis becomes difficult. Given an attack graph the identification of a probable attack path still remains an issue. This paper presents an attack path identification methodology which is both efficient and scalable. The proposed approach is based on the attack surface measure of the individual hosts comprising the network and the access levels between them and it identifies the attack path independent of the vulnerabilities or the exploits that may exist.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114895924","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}
引用次数: 13
Asymmetric Web Service Operation Matching in Structural-Level Similarity Measure 结构级相似性度量中的非对称Web服务操作匹配
2008 IEEE 8th International Conference on Computer and Information Technology Workshops Pub Date : 2008-07-08 DOI: 10.1109/CIT.2008.WORKSHOPS.50
He Lingjuan, Liu Lianchen, Wu Cheng
{"title":"Asymmetric Web Service Operation Matching in Structural-Level Similarity Measure","authors":"He Lingjuan, Liu Lianchen, Wu Cheng","doi":"10.1109/CIT.2008.WORKSHOPS.50","DOIUrl":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.50","url":null,"abstract":"A structural-level Web service operation matching method with asymmetric characteristic is proposed in this paper. Our work focuses on the data-type matching based on XML schema, and the problem is a labeled tree edit distance calculation. We introduce the asymmetric characteristic of matching into the tree edit distance model and it can effectively improve the top-k precision of the fetching result set of operations.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131131287","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
首页 上一页 下一页 尾页
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学术官方微信