{"title":"Stochastic Game Theoretic Method of Quantification for Network Situational Awareness","authors":"Huiqiang Wang, Ying Liang, Xiaowu Liu","doi":"10.1109/ICICSE.2008.55","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.55","url":null,"abstract":"Stochastic game theory is proposed to apply to the research on network situational awareness (NSA),and then a novel quantification method of NSA based on analysis of network service states is proposed. In this paper, network offense-defense game model including both the attacker and the defender in it is constructed; and game mathematical modeling of network situation is realized; the payoff of the both sides in the game is quantified according to the specific application, and the game situations is obtained by analyzing network service state. Finally, simulation experiments are done to validate the Nash equilibrium's existing, at which point both of the sides get a balance between their payoffs and by which the current stable network security state is reflected, finally the quantification of NSA is achieved.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"77 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":"121166621","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}
Ning Cao, Yazhe Tang, Dan Wang, Kaili Zhang, Lin Shen
{"title":"CoS-Based Grid QoS Description Language","authors":"Ning Cao, Yazhe Tang, Dan Wang, Kaili Zhang, Lin Shen","doi":"10.1109/ICICSE.2008.78","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.78","url":null,"abstract":"In service-oriented grid environment, seamless quality of service (QoS) delivery is one of its most important objectives. To reduce the overhead of QoS management, this paper proposes a CoS-based grid QoS description language (CGDL) and a corresponding Grid QoS management framework (CGMF). As a lightweight service level agreement (SLA), Class of Service (CoS) is predefined by the grid service provider to detail grid QoS. CGDL is to specify CoSs and to present mapping relationships between different QoS layers. Based on Web services resource framework (WSRF) and XML, CGDL is compatible with Web service definition language (WSDL) which is used for describing functions of services. CGMF is founded on both CGDL and mobile agent for monitoring grid QoS. A grid service of file storage is presented to show how to manage grid QoS with the help of CGDL. The result shows that CGDL effectively reduces the negotiating cost using a few CoSs instead of complex SLAs.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"20 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":"115724685","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}
Xiaoxiao Liu, Tao Zhou, Jingbo Shao, Haijun Li, Huiling Lu
{"title":"A New Domino Logic Synthesis Approach","authors":"Xiaoxiao Liu, Tao Zhou, Jingbo Shao, Haijun Li, Huiling Lu","doi":"10.1109/ICICSE.2008.79","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.79","url":null,"abstract":"Domino logic is the most popular dynamic logic, but the high crosstalk noise, area and power penalties limit its application. In this paper, a new domino logic synthesis approach was proposed, which considered all the crosstalk immunity of OR gate, low switching activity of AND gate, and post-layout logic optimization. Experimental results show that our algorithm can effectively reduce crosstalk noise and area overhead while maintaining low power.","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":"124598527","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}
Haiwei Pan, Qilong Han, Guisheng Yin, Wei Zhang, Jianzhong Li, Jun Ni
{"title":"A ROI-Based Mining Method with Medical Domain Knowledge Guidance","authors":"Haiwei Pan, Qilong Han, Guisheng Yin, Wei Zhang, Jianzhong Li, Jun Ni","doi":"10.1109/ICICSE.2008.91","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.91","url":null,"abstract":"Image mining is a growing research focus and is more than just an extension of data mining to image domain but an interdisciplinary endeavor. Very few people have systematically investigated this field. Mining association rules in medical images is an important part in domain- specific application image mining because there are several technical aspects which make this problem challenging. In this paper, we firstly incorporate the domain knowledge into the ROI extraction algorithm and ROI clustering algorithm, then we extend the concept of association rule based on ROI and image in medical images, and propose two algorithms to discover frequent item-sets and mine interesting association rules from medical images. Some interesting results are obtained by our program and we believe many of the problems we come across are likely to appear in other domains.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"79 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":"114857159","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":"Adaptive Morphological Method for Clutter Elimination to Enhance and Detect Infrared Small Target","authors":"X. Bai, F. Zhou, Yongchun Xie, Ting Jin","doi":"10.1109/ICICSE.2008.28","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.28","url":null,"abstract":"To overcome the affection of heavy clutter and dim target intensity on small target detection, an efficient morphological method through clutter elimination is proposed. The proposed adaptive method imports the property of the target region into the morphological operations, which apparently improves the performance of the method and can largely enhance the dim small target. So, the target can be easily detected through a target detection algorithm, which is proposed based on the adaptive morphological method for clutter elimination. Experiments show that the proposed method can accurately eliminate the clutter background, and thus largely enhance and efficiently detect the small target.","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":"115530994","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":"Research on Hierarchial Fuzzy Behavior Learning of Autonomous Robot","authors":"Ziying Zhang, Rubo Zhang, Xin Liu","doi":"10.1109/ICICSE.2008.60","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.60","url":null,"abstract":"Aiming at the changing and dynamic unstructured environments of autonomous robot, this paper analyses these kinds of effects on robot in details and thus presents a local plan architecture based on hierarchical fuzzy logic to implement the basic navigation behaviors and the coordination between these behaviors to produce a type-2 hierarchical fuzzy logic control. The problem is solved that the number of the rules increase exponentially with the number of variables involved. Experiments show that this approach is helpful and reliable especially to path planning of autonomous robot.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"21 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":"122883915","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":"Semantic CayNET: A New Semantic P2P Network","authors":"Zhaoquan Cai, Wenhong Wei","doi":"10.1109/ICICSE.2008.83","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.83","url":null,"abstract":"P2P and semantic Web together provide a paradigm shift for searching information on Internet, currently limited to simple keyword-based searches. Semantic P2P network enabled P2P network incorporate semantics into routing and searching by taking advantage of available metadata at peer level. In this paper, we propose a P2P network architecture CayNET firstly, and show searching method in this P2P network. Then, we introduce Semantic Web into the suggested P2P network architecture and propose a new Semantic P2P network, which has ability of quick matching search, and enable a peer connect many semantic clusters to improve file browsing function.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"26 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":"127624017","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":"Study on Requirement Testing Method Based on Alpha-Beta Cut-Off Procedure","authors":"Gang Liu, Shaobin Huang, Xiufeng Piao","doi":"10.1109/ICICSE.2008.36","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.36","url":null,"abstract":"During the system development, whatever the requirements analysis is, along with developing process, changing requirements always cause the enlargement of the workload and cost. We mainly carried on a research to the method of requirement testing. We adopted the method of requirement fractionizing, and established the requirement tree for fractionized requirements. Then we carried on an operation on the tree. At the procedure of the traversal and searching to the tree, we put each node record of the requirement tree into a table, and examined ambiguity and redundancy of the requirement through adopting match algorithm in the table. Through analyzing data correlation, we gave out the detection to functional deficiency. In the end, we used the alpha-beta procedure to cut off the branches of a requirement tree, to reduce the complexity of traversal algorithm, and to guarantee the algorithm executable.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"7 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":"127814143","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":"View-Dependent and Visual Attention Based Level of Detail","authors":"Si-Liang Yu, J. Zhang","doi":"10.1109/ICICSE.2008.58","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.58","url":null,"abstract":"The level of detail (LOD) technology was proposed in image rendering systems. It is different from most performance optimization techniques for real-time performance, we optimize the image quality. In this paper we propose a novel LOD technique, which determines the level of detail based on not only the view point but also the visual importance. With this technique, an improvement in the perceptual quality of a rendered image would result, for the same overall number of polygons being rendered.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"20 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":"124611990","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 Web Service Cooperative Scheduling Model for Workflow Management System","authors":"Bin Zeng, Tao Hu, Lin Kong","doi":"10.1109/ICICSE.2008.43","DOIUrl":"https://doi.org/10.1109/ICICSE.2008.43","url":null,"abstract":"Based on the fact that Web service dynamically changes and rapidly increases in the Internet, a task-oriented service cooperative scheduling model is proposed. In the model, Web service composition is scheduled in terms of interacting components, namely, task and services under the constraint of resources. The scheduling model focuses on the competence of Web service composition under the constraint of workload, available resources and interdependence of tasks within a workflow. The consistent model of composition behavior is based on the degree to which different Web services fit together. Experimental results demonstrate that the scheduling model could effectively improve the success ratio of workflow, and preferably combine the Web service resource in the Internet. It is suitable for the application demands in the virtual computing environment.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"134 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":"121365610","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}