Yingjie Xia, Guang-hua Song, Yao Zheng, Jun Ni, Mingzhe Zhu
{"title":"A Small World Overlay P2P Transfer System with Role-Based and Reputation-Based Access Control Policies","authors":"Yingjie Xia, Guang-hua Song, Yao Zheng, Jun Ni, Mingzhe Zhu","doi":"10.1109/ICICSE.2008.7","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.7","url":null,"abstract":"This paper introduces a small world overlay Peer- to-peer (P2P) transfer system with role based and reputation based access control policies, through which we are able to solve several serious problems existed in traditional P2P systems, like resource piracy, user privacy and network jam. The role based access control policy is implemented by the certificate based cryptography, e.g. X509. The reputation based access control policy consists of artificial scoring and automatic scoring components, corresponding to the quality and quantity evaluation of the transfer resources respectively. This system, upon the two policies and the adaptive small world overlay P2P topology, can restrict the peer's role and select a more credible peer to upload and download without any loss of performance, for the reason of the dramatic topology. Indeed it provides a secure, controllable and efficient resource transfer community.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122682536","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}
{"title":"An Intelligent Agent-Based Architecture for Chance Discovery System Applications","authors":"Yuezhu Xu, Daxin Liu, Jin Zhang, Liping Qu","doi":"10.1109/ICICSE.2008.40","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.40","url":null,"abstract":"The discovery of chances (risks or opportunities) can have a significant impact on decision making. We develop an intelligent system to discover relative chances with respect to a particular chance seeker (agent). Agent, as autonomous entities which either work on their own or cooperate with others, and agent architectures have enormous potentials to be applied in such critical system. In this article, first we investigate the very fundamental concepts of chance discovery and intelligent agent technology. Then, we make use of the concepts and integrate them into a state-of-the-art, intelligent architecture for chance discovery system, called intelligent agent-based chance discovery. The graphical representation of this model is intent to help the reader understand the concept much better. After explaining the suggested model in full details, we discussions and concluding remarks regarding the proposed system are provided at the end of the paper.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122796187","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}
{"title":"Hierarchical Object-Oriented Petri Net Modeling Method Based on Ontology","authors":"Feng Xiaoning, Wang Zhuo, Yin Guisheng","doi":"10.1109/ICICSE.2008.97","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.97","url":null,"abstract":"This paper presents a Hierarchical Object-Oriented Petri Net (HOOPN) modeling method based on Ontology that should not only enable sharing Petri nets models on the Semantic Web but also present a high level Petri net. Previous work on formal methods for representing Petri nets mainly focuses on modeling and analyzing aspects or formats for Petri net model interchange. However, such efforts do not provide a suitable model description for using Petri nets on the Semantic Web. This paper uses the HOOPN with the Ontology concepts as a starting point for implementing the Petri net ontology. Moreover this paper uses HOOPN as the Petri net model method. HOOPN supports a wide range of Object-Oriented features including abstract, encapsulated and modularized objects, object interaction by message passing, inheritance, and polymorphism.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122926698","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}
{"title":"Hierarchical Small-World P2P Networks","authors":"Guisheng Yin, Shen Jie, Xianghui Wang","doi":"10.1109/ICICSE.2008.94","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.94","url":null,"abstract":"In order to increase the efficiency of routing and querying, decrease the maintenance cost of structure P2P network, a hierarchical small-world P2P networks (HSN) with low maintenance cost is proposed in this paper, which describe the methods about how to create and maintenance a P2P network. To demonstrate the value of HSN, this paper simulates Chord and HSN with different networks size and system parameters, and the result shows that (1) the route latency of HSN is smaller than O(logN) , where is the number of nodes in the P2P networks, (2) HSN maintenance cost decreased nearly the half of the Chord.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"49 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114027906","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}
{"title":"A Fast Multi-level Algorithm for Drawing Large Undirected Graphs","authors":"Weihua Zhou, Jingwei Huang","doi":"10.1109/ICICSE.2008.27","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.27","url":null,"abstract":"Graph drawing is a standard means for visualizing the relational information. This paper presents a fast algorithm for drawing large undirected graphs with straight-line edges, which employs the multi-level method as the framework of the algorithm and adopts the force-directed algorithm combined with bary-centralizing method to refine the single-level layouts. As far as we know, it is the first attempt to introduce this kind of combination. Also, the other two speed-up methods, constraint-normalization and quad-tree space decomposition, are used. Systematic experiments suggest its high performance and nice results. It is extremely fast and can nicely draw 10,000 vertex graphs in approximately 5 seconds and 1000,000 vertex graphs in approximately 11 minutes. The comparison with the well-known algorithms proves its validity and practicality. Furthermore, the presented algorithm is easy to implement, and its techniques can be generalized to speed up general force-directed algorithms.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114399275","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}
{"title":"Personalized E-Commerce Recommendation Based on Ontology","authors":"Peiguang Lin, Feng Yang, Xiao Yu, Qunling Xu","doi":"10.1109/ICICSE.2008.69","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.69","url":null,"abstract":"The current collaborative recommendation approaches mainly measure users' similarity by comparing user's entire interests and don't consider user's interest quality, especially interest span. With so many goods in the E-commerce web site, how to get the needed product quickly so as to promote the efficiency of E-commerce system? This paper presented a personalized recommendation method based on ontology. To improve the precision, we firstly divided users' interests into long-time interests and short-time interests; and then by use of the principle of partial similarity, the recommendation mechanism and algorithm were given. Lastly, based on the method above, a prototype system was presented and the system test was done. Experimental results indicate that this method can recommend related products in the majority to target users and it can be practical.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124802849","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}
{"title":"The Inverse Protein Folding Process by Artificial Life Approaches","authors":"Weixin Kang, J. Zhang, Maozu Guo, Wei Peng","doi":"10.1109/ICICSE.2008.64","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.64","url":null,"abstract":"We discuss general implications of artificial life approaches to protein folding which makes an attempt at simulating the actual folding process rather than just trying to predict its final result. A new inverse folding method is presented that tries to determine the unknown proteins from tertiary structure to protein sequence by model the folding process. The method of protein inverse folding is based on 3D off lattice model with united atom. The folding process model and discovery of protein folding pathway is discussed by three artificial life approaches from protein tertiary to series of residues. The comparison and relation of the three artificial life approaches are also analyzed and it is found out: the inverse folding method is absolutely new method, and it is viable and excited.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126541873","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}
Jing Wang, Yanbo Han, Shuying Yan, Wanghu Chen, Guang Ji
{"title":"VINCA4Science: A Personal Workflow System for e-Science","authors":"Jing Wang, Yanbo Han, Shuying Yan, Wanghu Chen, Guang Ji","doi":"10.1109/ICICSE.2008.20","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.20","url":null,"abstract":"The uncertain and diversified nature of scientific research often prohibits scientists from pre-defining a common full-fledged workflow. It would help if end users are allowed to individually construct and execute personal workflows on the basis of a common skeleton. In such a personal workflow, scientists can do experiments in a \"trail-and-error\" manner, and keep provenance information for future analysis and reuse. Driven by these wishes, we proposed an approach to personal workflow and developed a supporting system called VINCA4Science. A synthesized view of local and networked resources is conceptualized, and a knowledge- based service recommendation mechanism is realized for guiding workflow construction. Tryout applications in bioinformatics research show that VINCA4Science helps to improve programming efficiency and quality, provide flexible management control, and therefore improve scientific productivity.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129989877","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}
{"title":"Towards a Novel In-community Healthcare Monitoring System over Wireless Sensor Networks","authors":"Julong Pan, Shanping Li, Zhendong Wu","doi":"10.1109/ICICSE.2008.33","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.33","url":null,"abstract":"Recently, new technological advances in biosensors, micro electro mechanical systems (MEMS) and wireless communications have enabled the design of low-cost, miniature, lightweight and intelligent physiological sensor nodes. These nodes, capable of sensing, processing and communicating one or more vital signs, can be seamlessly integrated into wireless body sensor network for health monitoring. Using different forms of communication technologies (such as WLAN, Bluetooth, ZigBee, Satellite, GSM/GPRS, 3G, WiMax, etc.), these networks promise to revolutionize healthcare by allowing inexpensive, non-invasive, continuous, ambulatory health monitoring with almost real-time updates of medical records via the Internet. The objective of this paper is to provide a snapshot of the applications of wireless sensor networks in healthcare monitoring. After analyzing a common three-tier architecture, a novel in-community healthcare monitoring system is introduced and studied. A brief review of the spectrum of these applications and the potential benefits of these efforts are also presented.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125069222","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}
{"title":"Applying a Novel Combined Classifier for Hypertext Classification in Pornographic Web Filtering","authors":"Zhong Gao, Guanming Lu, Hao Dong, Shutong Wang, Haibo Wang, Xiaopei Wei","doi":"10.1109/ICICSE.2008.88","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.88","url":null,"abstract":"As the Web expands exponentially, there are a flood of pornographic Web sites on the Internet. Thus effective Web filtering systems are essential. Web filtering based on hypertext classification has become one of the important techniques to handle and filter inappropriate information on the Web. Hypertext classification, that is the automatic classification of Web documents into predefined classes, came to elevate humans from that task. However, how to improve the performance of the hypertext classification under the situation of noisy data is still a challenging problem. In this paper, we propose a new approach for hypertext classification in Web filtering, which uses a novel support vector machine and K-nearest neighbor (KNN-SVM) to remove noisy training examples. The experimental results show that the generalization performance and the accuracy of classification are improved significantly compared to that of the traditional SVM classifier, and adapt to engineering applications.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126893881","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}