This paper is to discuss several fields: the importance to mobile phone game, the prospect of LBS, the bottlenecks of LBS development, techniques of LBS being utilized currently, the features among different LBS techniques and apply LBS for developers.
{"title":"Location Based Service Application in Mobile Phone Serious Game","authors":"Chen Xin","doi":"10.1109/JCAI.2009.203","DOIUrl":"https://doi.org/10.1109/JCAI.2009.203","url":null,"abstract":"This paper is to discuss several fields: the importance to mobile phone game, the prospect of LBS, the bottlenecks of LBS development, techniques of LBS being utilized currently, the features among different LBS techniques and apply LBS for developers.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115267120","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}
Recommender systems represent personalized services that aim at predicting users’ interest on information items available in the application domain. Collaborative filtering technique has been proved to be one of the most successful techniques in recommendation systems in recent years. Poor quality is one major challenge in collaborative filtering recommender systems. Sparsity of users’ ratings is the major reason causing the poor quality. To solve this problem, this paper proposed an item based collaborative filtering recommendation algorithm using the rough set theory prediction. This method employs rough set theory to fill the vacant ratings of the user-item matrix where necessary. Then it utilizes the item based collaborative filtering to produce the recommendation. The experiments were made on a common data set using different filtering algorithms. The results show that the proposed recommender algorithm combining rough set theory and item based collaborative filtering can improve the accuracy of the collaborative filtering recommendation system.
{"title":"An Item Based Collaborative Filtering Recommendation Algorithm Using Rough Set Prediction","authors":"Ping Su, Hongwu Ye","doi":"10.1109/JCAI.2009.155","DOIUrl":"https://doi.org/10.1109/JCAI.2009.155","url":null,"abstract":"Recommender systems represent personalized services that aim at predicting users’ interest on information items available in the application domain. Collaborative filtering technique has been proved to be one of the most successful techniques in recommendation systems in recent years. Poor quality is one major challenge in collaborative filtering recommender systems. Sparsity of users’ ratings is the major reason causing the poor quality. To solve this problem, this paper proposed an item based collaborative filtering recommendation algorithm using the rough set theory prediction. This method employs rough set theory to fill the vacant ratings of the user-item matrix where necessary. Then it utilizes the item based collaborative filtering to produce the recommendation. The experiments were made on a common data set using different filtering algorithms. The results show that the proposed recommender algorithm combining rough set theory and item based collaborative filtering can improve the accuracy of the collaborative filtering recommendation system.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125039442","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}
Construction project bidding is a kind of transaction way of construction project the most widely used ,the bidding is a closed price auction, the game among the bidders and the tenders belongs to a kind of non-cooperation and incomplete static game and so does it among the tenders. According to the special rules of bidding, the game theory is put into construction project bidding ,the game model of bidding mechanism is set up, the game process of a non-cooperation and incomplete information static is analyzed among the tenders according with the different strategies of tendering price, the conclusion can be drawn to be applied to construction project bidding , which can realize “the incentive and compatibility constraints ” and “personal participating in constraints”. Meanwhile, the moral hazard and the adverse selection can be avoided. At last, the great degree of equilibrium and the PARETO optimization can be achieved.
{"title":"Study on the Game Mechanism of Construction Project Bidding","authors":"Jian-Bing Liu, H. Ren, Xiao-Jian Guo","doi":"10.1109/JCAI.2009.28","DOIUrl":"https://doi.org/10.1109/JCAI.2009.28","url":null,"abstract":"Construction project bidding is a kind of transaction way of construction project the most widely used ,the bidding is a closed price auction, the game among the bidders and the tenders belongs to a kind of non-cooperation and incomplete static game and so does it among the tenders. According to the special rules of bidding, the game theory is put into construction project bidding ,the game model of bidding mechanism is set up, the game process of a non-cooperation and incomplete information static is analyzed among the tenders according with the different strategies of tendering price, the conclusion can be drawn to be applied to construction project bidding , which can realize “the incentive and compatibility constraints ” and “personal participating in constraints”. Meanwhile, the moral hazard and the adverse selection can be avoided. At last, the great degree of equilibrium and the PARETO optimization can be achieved.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123320087","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}
This paper presented an accounting and charging system based Open Grid Services Architecture (OGSA), which developed with an emphasis on a consistent data model and easy integration into existing scheduling at a few independent resources providers to use under various grid environment. This accounting and charging system mainly addresses to resolve the problem of accounting and charging of resources usage unde rgrid environment and provides good quality of services for users.This paper will introduce the basic implementing mechanism,collecting process of resources usage information, resource reservation, resource price policy and etc.
{"title":"An Accounting and Charging System for Grid","authors":"Y. Qiu, Jianhua Adu","doi":"10.1109/JCAI.2009.168","DOIUrl":"https://doi.org/10.1109/JCAI.2009.168","url":null,"abstract":"This paper presented an accounting and charging system based Open Grid Services Architecture (OGSA), which developed with an emphasis on a consistent data model and easy integration into existing scheduling at a few independent resources providers to use under various grid environment. This accounting and charging system mainly addresses to resolve the problem of accounting and charging of resources usage unde rgrid environment and provides good quality of services for users.This paper will introduce the basic implementing mechanism,collecting process of resources usage information, resource reservation, resource price policy and etc.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126601706","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}
Duplicated web pages responded by search engines not only waste valuable storage, but also aggravate burdens of users’ browse. Web page de-duplication can effectively improve the information retrieval. This paper proposes pretreatment of web pages to improve the effectiveness and efficiency of web page de-duplication based on feature code according to the principle of data clearing. This paper features that ranking feature code to reduce the comparison times of the system and space and time complexity. Experiments show that this method has a promising prospect in eliminating large-scale duplicated web pages.
{"title":"A Web Page De-duplication Algorithm Based on Data Clearing","authors":"Jian-ming Lin, Dong-sheng Liu, Shi-wen Gao, Wei Chen","doi":"10.1109/JCAI.2009.181","DOIUrl":"https://doi.org/10.1109/JCAI.2009.181","url":null,"abstract":"Duplicated web pages responded by search engines not only waste valuable storage, but also aggravate burdens of users’ browse. Web page de-duplication can effectively improve the information retrieval. This paper proposes pretreatment of web pages to improve the effectiveness and efficiency of web page de-duplication based on feature code according to the principle of data clearing. This paper features that ranking feature code to reduce the comparison times of the system and space and time complexity. Experiments show that this method has a promising prospect in eliminating large-scale duplicated web pages.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126865831","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}
currently those algorithms to mine the alarm association rules are limited to the minimal support, so that they can only obtain the association rules among the frequently occurring alarms. This paper proposes a new mining algorithm based on spectral graph theory. The algorithms firstly sets up alarm association model with time series; Secondly, it regards alarms database as a high-dimensional structure and treats alarms with associated characteristics as part of it. The algorithm discovers the underlying mapping low-dimensional structure embedding in high-dimensional space based on spectral graph theory. Experimental results based on synthetic and real datasets demonstrates that this algorithm not only discoveries association among alarms, but also acquires the fault in the telecommunications network based on the spectral graph transformation.
{"title":"Alarm Association Algorithms Based on Spectral Graph Theory","authors":"Qianfang Xu, Jun Guo","doi":"10.1109/JCAI.2009.187","DOIUrl":"https://doi.org/10.1109/JCAI.2009.187","url":null,"abstract":"currently those algorithms to mine the alarm association rules are limited to the minimal support, so that they can only obtain the association rules among the frequently occurring alarms. This paper proposes a new mining algorithm based on spectral graph theory. The algorithms firstly sets up alarm association model with time series; Secondly, it regards alarms database as a high-dimensional structure and treats alarms with associated characteristics as part of it. The algorithm discovers the underlying mapping low-dimensional structure embedding in high-dimensional space based on spectral graph theory. Experimental results based on synthetic and real datasets demonstrates that this algorithm not only discoveries association among alarms, but also acquires the fault in the telecommunications network based on the spectral graph transformation.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126934593","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}
There is a lot of limitations in the traditional process of mould design and manufacturing. With the development of the science and technology, especially in the field of the computer, CAE technology begins to be applied widely in the process of modern mould design and manufacturing. The results of CAE simulation analysis of injection molding can provide reliable and optimized reference data for mould design and manufacturing. Applying CAE simulation analysis technology of injection molding can not only increase the probability of success in mould test but also improve greatly the quality of mould design and manufacturing. In this paper, the injection molding process of mobile phone front shell is analyzed. The best position of gate is discussed by using the Moldflow software. The optimized design scheme of feed system is determined in view of the particular structure of the plastic part. Then the simulation flow analysis of injection molding is carried into execution. On the basis of CAE analysis of injection molding, the whole injection mould structure is designed and the working procedure of injection mould is stated.
{"title":"Optimized Design of Injection Mould for Mobile Phone Front Shell Based on CAE Technology","authors":"Guijian Huang, Xuemei Li, Xiao-yu Wu, Jibin Li","doi":"10.1109/JCAI.2009.218","DOIUrl":"https://doi.org/10.1109/JCAI.2009.218","url":null,"abstract":"There is a lot of limitations in the traditional process of mould design and manufacturing. With the development of the science and technology, especially in the field of the computer, CAE technology begins to be applied widely in the process of modern mould design and manufacturing. The results of CAE simulation analysis of injection molding can provide reliable and optimized reference data for mould design and manufacturing. Applying CAE simulation analysis technology of injection molding can not only increase the probability of success in mould test but also improve greatly the quality of mould design and manufacturing. In this paper, the injection molding process of mobile phone front shell is analyzed. The best position of gate is discussed by using the Moldflow software. The optimized design scheme of feed system is determined in view of the particular structure of the plastic part. Then the simulation flow analysis of injection molding is carried into execution. On the basis of CAE analysis of injection molding, the whole injection mould structure is designed and the working procedure of injection mould is stated.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"502 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116380267","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}
Based on the latest research of neo-institutional economics, the frontier of corporate governance is extended, and the concept of “venture capital governance” is brought forward. Game theory is applied systemically in this paper to discuss all stages of venture capital governance. Especially, we analyze the aspect of participation in the management of venture business by means of game theory. It is necessary and possible for the venture capitalist to participate in the management of the venture-backed firm, which contains the strategic, financing, and operation management, etc. On the basis of the literature review, we analyze the mechanisms and the patterns of the venture capitalist’s post-investment activities. A longer venture capitalist's participation in a firm may increase its value while also increasing costs for the venture capitalist. After deeply investigating the venture capitalist’s active and the enterpriser’s choices involved, we set up the static and dynamic models to analyze how their activities impact on each other and what the equilibrium result is.
{"title":"Multi-agent and Multi-stage Game Analysis of Venture Capital Governance and Management","authors":"Xiaojun Wu, Yu Gu","doi":"10.1109/JCAI.2009.152","DOIUrl":"https://doi.org/10.1109/JCAI.2009.152","url":null,"abstract":"Based on the latest research of neo-institutional economics, the frontier of corporate governance is extended, and the concept of “venture capital governance” is brought forward. Game theory is applied systemically in this paper to discuss all stages of venture capital governance. Especially, we analyze the aspect of participation in the management of venture business by means of game theory. It is necessary and possible for the venture capitalist to participate in the management of the venture-backed firm, which contains the strategic, financing, and operation management, etc. On the basis of the literature review, we analyze the mechanisms and the patterns of the venture capitalist’s post-investment activities. A longer venture capitalist's participation in a firm may increase its value while also increasing costs for the venture capitalist. After deeply investigating the venture capitalist’s active and the enterpriser’s choices involved, we set up the static and dynamic models to analyze how their activities impact on each other and what the equilibrium result is.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122398866","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}
In intrusion detection data set is high dimensional, which leads to low processing speed for intrusion detection algorithms, but it holds many features affecting little for detection. To address the above issue, a two-step feature selection algorithm is proposed in this paper. Depending on the definition of relevant feature and redundant feature and using mutual information as criterion, it firstly eliminates the irrelevant features and then eliminates the redundant features. With low time complexity, the feature selection algorithm independent of detection algorithm could easily balance the detection accuracy and the number of features through threshold. Experiments over networks connection records from authoritative data set KDD CUP 1999 were implemented for several detection algorithms to evaluate the proposed method. The results show the algorithm could effectively select features, ensure detection accuracy and improve processing speed.
在入侵检测中，数据集是高维的，这导致入侵检测算法的处理速度较慢，但它具有许多对检测影响不大的特征。为了解决上述问题，本文提出了一种两步特征选择算法。根据相关特征和冗余特征的定义，以互信息为准则，先去除了无关特征，再去除了冗余特征。独立于检测算法的特征选择算法具有较低的时间复杂度，可以很容易地通过阈值平衡检测精度和特征数量。在权威数据集KDD CUP 1999的网络连接记录上进行了几种检测算法的实验，以评估所提出的方法。结果表明，该算法能够有效地选择特征，保证检测精度，提高处理速度。
{"title":"A Two-step Feature Selection Algorithm Adapting to Intrusion Detection","authors":"Lizhong Xiao, Y. Liu","doi":"10.1109/JCAI.2009.214","DOIUrl":"https://doi.org/10.1109/JCAI.2009.214","url":null,"abstract":"In intrusion detection data set is high dimensional, which leads to low processing speed for intrusion detection algorithms, but it holds many features affecting little for detection. To address the above issue, a two-step feature selection algorithm is proposed in this paper. Depending on the definition of relevant feature and redundant feature and using mutual information as criterion, it firstly eliminates the irrelevant features and then eliminates the redundant features. With low time complexity, the feature selection algorithm independent of detection algorithm could easily balance the detection accuracy and the number of features through threshold. Experiments over networks connection records from authoritative data set KDD CUP 1999 were implemented for several detection algorithms to evaluate the proposed method. The results show the algorithm could effectively select features, ensure detection accuracy and improve processing speed.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122712885","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}
Vehicle type recognition is an active subject in the area of computer pattern recognition, which has been a focus in reach for the last couple of decades because of its wide potential application. And Edge detection is an important step for vehicle type recognition, a vehicle type recognition method based on Sobel was proposed. Also discussed are the vehicle vector and the vehicle recognize process. Experiments have been conducted for vehicle video. The result shows that the vehicle edge could be detected easily by the Sobel operator, and the vehicle feature can be extracted in short time. So, the Sobel operator can be good fit for vehicle type recognition.
{"title":"Reach on Sobel Operator for Vehicle Recognition","authors":"Weihua Wang","doi":"10.1109/JCAI.2009.54","DOIUrl":"https://doi.org/10.1109/JCAI.2009.54","url":null,"abstract":"Vehicle type recognition is an active subject in the area of computer pattern recognition, which has been a focus in reach for the last couple of decades because of its wide potential application. And Edge detection is an important step for vehicle type recognition, a vehicle type recognition method based on Sobel was proposed. Also discussed are the vehicle vector and the vehicle recognize process. Experiments have been conducted for vehicle video. The result shows that the vehicle edge could be detected easily by the Sobel operator, and the vehicle feature can be extracted in short time. So, the Sobel operator can be good fit for vehicle type recognition.","PeriodicalId":154425,"journal":{"name":"2009 International Joint Conference on Artificial Intelligence","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122735744","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：