{"title":"A Control Model of Region Economy and Its Multiplier Effect Analysis for China Exhibition Industry","authors":"Haiqing Hu, Dan Zhang","doi":"10.1109/WMWA.2009.37","DOIUrl":"https://doi.org/10.1109/WMWA.2009.37","url":null,"abstract":"This paper used the principle, thought and method of system theories and cybernetics, constructed an economic control model of region exhibition industry, and found control structure of the model; and thought the exhibition economic system is composed of the direct income subsystem and indirect income subsystem which are connected in series. Furthermore, this paper thoroughly analyzed the parallel mutual relations between each sub-subsystem of direct income subsystem, as well as the multiple feedback relations of indirect income system and so on.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"439 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122886615","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":"Web Text Knowledge Fusion","authors":"Sikang Hu, Yuanda Cao","doi":"10.1109/WMWA.2009.61","DOIUrl":"https://doi.org/10.1109/WMWA.2009.61","url":null,"abstract":"There is still no complete and unified theoretical model for studying the research issues such as redundancy, localization, and fuzziness existed in the fusion of web text knowledge. To this end, this paper proposes a fusion framework, called Web Pages Knowledge Fusion Framework (WPKFF). It presents the semantic description of attribute fusion rules, description information fusion rules and attribute-value and description information fusion rules. These rules provide a feasible model and a knowledge base for succeeding induction and reasoning.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128024873","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 New Service-Based Computing Security Model with Neural Cryptography","authors":"Dong Hu","doi":"10.1109/WMWA.2009.7","DOIUrl":"https://doi.org/10.1109/WMWA.2009.7","url":null,"abstract":"In this paper, we present a new service-based computing security model, which is combined with neural cryptography. Service-based computing is a new and hot research point for telecommunication and computer scientist. Neural cryptography is a new way to create shared secret key. The existed system architecture mentions little about security. The paper presents a new security model, and we discuss the model design based on neural cryptography in the end.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129920903","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 Peer-to-Peer Based Web Service Discovery Mechanism","authors":"Yunsong Tan","doi":"10.1109/WMWA.2009.71","DOIUrl":"https://doi.org/10.1109/WMWA.2009.71","url":null,"abstract":"The Web Services infrastructure is a distributed computing environment for service-sharing. In this environment, resource discovery is required as a primitive functionality for users to be able to locate the services, the shared resources. This paper presents a peer-to-peer (P2P) indexing system for automatic discovery of services over distributed environments. Our solution is based on P2P technologies that proved to be scalable, efficient and robust solutions for distributed systems.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121340277","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":"Mapping the Intellectual Structure of Enterprise S&T Text: A Case Study","authors":"Hongjiang Yue, Ningsheng Hu","doi":"10.1109/WMWA.2009.41","DOIUrl":"https://doi.org/10.1109/WMWA.2009.41","url":null,"abstract":"Science and Technology (S&T) information presents a rich resource, essential for managing modern enterprises research and development (R&D). The goal of this paper is proposed to discover useful intelligence implicit in enterprises of electronic text sources based on text mining techniques. IBM Co. R&D literature infrastructure was obtained using bibliometrics and literature of the co-keyword network was visualized. It show how co-word analysis techniques can be used to study R&D in enterprises. The results of the study can help support strategic decision-making on the direction of S&T programs in enterprises.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121348080","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 Demand Partitioning Based Topology Aggregation Mechanism for Scalable QoS Guarantee","authors":"Yue Han, Zengji Liu, Zhiliang Qiu, Quan Zhou","doi":"10.1109/WMWA.2009.43","DOIUrl":"https://doi.org/10.1109/WMWA.2009.43","url":null,"abstract":"In addressing the scalability and accuracy tradeoff in topology aggregation mechanisms with delay and bandwidth constraints in hierarchical networks, we propose a demand partitioning based topology aggregation mechanism called dominative points based topology aggregation (DPTA). The main drawback of traditional approaches is that these approaches use lines or curves to approximately represent the staircase which consists of representative points so that the performance degrades obviously as the number of representative points increases. However, DPTA uses dominative points to construct a new staircase according to the demand partitioning, so as to obtain the O(1) space complexity and avoid performance degradation as the network expands. Firstly, we perform demand partitioning for the arrival requests. Secondly, the representative points are further aggregated to fewer amounts of dominative points. Based on the dominative points, DTPA eliminates the influence of the inaccuracy information accumulation on the performance of the topology aggregation process. Lastly, optimal allocation of available bandwidth is presented to maximize the number of accepted requests. Simulation results show that the proposed mechanism can guarantee lower delay deviation, higher success ratio with lower crankback ratio and accept more requests than the traditional approaches.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124397879","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":"Dynamic Probabilistic Packet Marking Based on PPM","authors":"Bo Feng, Guo Fan, Yu Min","doi":"10.1109/WMWA.2009.44","DOIUrl":"https://doi.org/10.1109/WMWA.2009.44","url":null,"abstract":"Most of the probability of packet marking(PPM) have existed many problems such as the lost of marking information, the difficulties to reconstruct attack path, low accuracy and so on. In this work, we present a new approach, called dynamic probabilistic packet marking (DPPM), to further improve the effectiveness o fPPM. Instead of using a fixed marking probability, we propose to judge whether the packet has been marked or not then choose a proper marking probability. DPPM may solve most of the problems in PPM method. Formal analysis indicates that DPPM outperforms PPM in most aspects.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125292307","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":"Automatic Attack Scenario Construction by Mining Meta-alert Sequences","authors":"Guo Fan, Yu Min","doi":"10.1109/WMWA.2009.13","DOIUrl":"https://doi.org/10.1109/WMWA.2009.13","url":null,"abstract":"Researchers have been using intrusion scenarios tore present complicated attack procedures at a high abstract level, while, to our best knowledge, none is able to produce the scenarios online. An automatic intrusion scenario construction method is proposed in the paper. According to the source and destination IP pair, and priority of the raw alerts, the method firstly clusters them into different meta-alert sequences, from which frequent closed sequences are mined to construct scenarios, after that, correlation rules between scenarios are mined based on their support.Experiments on Darpa99 and Darpa2000 shows the method can be used to effectively discover attack procedures and run online.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127737492","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":"Application of Reinforcement Learning in Decoupling Producer-Consumer Problem Based on Combined Grey Neural Networks","authors":"Zhiming Qu","doi":"10.1109/WMWA.2009.21","DOIUrl":"https://doi.org/10.1109/WMWA.2009.21","url":null,"abstract":"The exploration of the location-identity split has studied SMPs, and current trends suggest that the analysis of voice-over-IP will soon emerge. The RBF neural network, grey model and combined grey neural model are introduced. Through the theoretical and experimental analysis in the research, the emulation of the UNIVAC computer is argued, which embodies the theoretical principles of hardware and architecture. In order to address this obstacle, it proposes a novel system for the investigation of telephony (SASIN). In conclusion, it is used to argue that a search can be made wireless, metamorphic, and self-learning. Practically, the application combined grey neural networks model in reinforcement leaning in decoupling producer-consumer problem proves to be reasonable.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115900784","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 Case Retrieval Strategy Based on Hierarchical Clustering","authors":"Shixia Ma, Jibiao Li, Dan Liu","doi":"10.1109/WMWA.2009.52","DOIUrl":"https://doi.org/10.1109/WMWA.2009.52","url":null,"abstract":"Case-based reasoning technology has been widely applied in many areas. This study first clustered thecae base according to hierarchy, then on the foundation of which designed a retrieval strategy based on non-isomorphic case base, analyzed the hierarchal clustering rules of case base, and mainly discussed the case retrieval strategy based on clustering. The results of the experiment show that this method can efficiently improve the utilization rate of cases in case base as well as the success rate of thecae retrieval.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115580817","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}