With the development and application of E-commerce, influences of the Network market to Economy and Society are increasingly wide and profound. Based on their essential contacts between the Network market and Government's regulation, the Government's regulation of the Network market has many functions such as fair competition, substantive justice and the maximization of social benefits. In order to fulfill its functions, the premise and basis of the Government's regulation should include regulation according to law, proper regulation and supervision. Many positive and effective measures are to be taken for the Government's regulation, including the improvement of legislation, strict law enforcement and supervision strengthening.
{"title":"The Functions of Government's Regulation in Network","authors":"Xiaoming Hu","doi":"10.1109/BCGIN.2011.127","DOIUrl":"https://doi.org/10.1109/BCGIN.2011.127","url":null,"abstract":"With the development and application of E-commerce, influences of the Network market to Economy and Society are increasingly wide and profound. Based on their essential contacts between the Network market and Government's regulation, the Government's regulation of the Network market has many functions such as fair competition, substantive justice and the maximization of social benefits. In order to fulfill its functions, the premise and basis of the Government's regulation should include regulation according to law, proper regulation and supervision. Many positive and effective measures are to be taken for the Government's regulation, including the improvement of legislation, strict law enforcement and supervision strengthening.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125149626","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 this paper, the tree model is different from the known models. We prove the strong law of large numbers and the asymptotic equipartition property (AEP) for finite homogeneous Markov chains indexed by this tree. The results generalize some known results.
{"title":"The Asymptotic Equipartition Property for Homogeneous Markov Chains Indexed by Trees","authors":"Weicai Peng","doi":"10.1109/BCGIN.2011.96","DOIUrl":"https://doi.org/10.1109/BCGIN.2011.96","url":null,"abstract":"In this paper, the tree model is different from the known models. We prove the strong law of large numbers and the asymptotic equipartition property (AEP) for finite homogeneous Markov chains indexed by this tree. The results generalize some known results.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130180572","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 this paper, we mainly discuss about k_means and k_medoids algorithm and debate the good properties and shortcomings of the both algorithms, then propose the improving measures for k_medoids algorithm. The main idea is that the method which generates centres of k_medoids algorithm replaced by the way which generates centres of k_means. The computational cost of the improved algorithm is a compromise between k_means and k_medoids. Finding the 'noise' data in the objects data by examining the distance value vector is another point of the improved algorithm. We examine the improved k_medoids algorithm's performance in the relevant experiment, and draw the conclusion.
{"title":"An Improved Method for K_Medoids Algorithm","authors":"Shaoyu Qiao, Xinyu Geng, Min Wu","doi":"10.1109/BCGIN.2011.116","DOIUrl":"https://doi.org/10.1109/BCGIN.2011.116","url":null,"abstract":"In this paper, we mainly discuss about k_means and k_medoids algorithm and debate the good properties and shortcomings of the both algorithms, then propose the improving measures for k_medoids algorithm. The main idea is that the method which generates centres of k_medoids algorithm replaced by the way which generates centres of k_means. The computational cost of the improved algorithm is a compromise between k_means and k_medoids. Finding the 'noise' data in the objects data by examining the distance value vector is another point of the improved algorithm. We examine the improved k_medoids algorithm's performance in the relevant experiment, and draw the conclusion.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127266504","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}
With the development of e-government (e-gov), it is continuously discussed on how to enhance the effectiveness and efficiency of e-gov service (EGS) at a suitable cost. The purpose of this article is to develop the theoretical links from the capability management views and empirically examine the associations between capability antecedents and e-government content service capability (CSC). Then empirical investigations on the proposed models and related hypotheses were carried out using CFA based on observed data. Furthermore, structural equation model (SEM) was adopted to explore the impact paths. The paths analysis results might have some practical values to management and improvement of EGS capability.
{"title":"Impact Antecedents of e-government Content Service Capability: An Exploratory Empirical Study","authors":"Guangwei Hu, Wenwen Pan, Jie Wang, Jin Shi","doi":"10.1109/BCGIN.2011.55","DOIUrl":"https://doi.org/10.1109/BCGIN.2011.55","url":null,"abstract":"With the development of e-government (e-gov), it is continuously discussed on how to enhance the effectiveness and efficiency of e-gov service (EGS) at a suitable cost. The purpose of this article is to develop the theoretical links from the capability management views and empirically examine the associations between capability antecedents and e-government content service capability (CSC). Then empirical investigations on the proposed models and related hypotheses were carried out using CFA based on observed data. Furthermore, structural equation model (SEM) was adopted to explore the impact paths. The paths analysis results might have some practical values to management and improvement of EGS capability.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127368108","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}
Wang Gui-fen, Ren Yan, Duan Long-zhen, Zou Zhi-xin, Zhang Xu, Zhan Yun-qiao, Liang Wei-song
Collaborative filtering algorithm is one of the most successful recommender technologies and has been widely adopted in recommender systems. However, the traditional collaborative filtering always suffers from sparsity problem of dataset. Item resource has hierarchy itself, and people's interests are centralized in several hierarchies. In addition, rating is multivariate with several factors: user's interest and item's quality etc. The proposed algorithm makes corresponding modification based on the traditional algorithm with the ideas above. Experimental results show that the algorithm can guarantee the accuracy of the system recommended by the case, effectively alleviate the data sparsity problem.
{"title":"An Optimized Collaborative Filtering Approach with Item Hierarchy-Interestingness","authors":"Wang Gui-fen, Ren Yan, Duan Long-zhen, Zou Zhi-xin, Zhang Xu, Zhan Yun-qiao, Liang Wei-song","doi":"10.1109/BCGIN.2011.168","DOIUrl":"https://doi.org/10.1109/BCGIN.2011.168","url":null,"abstract":"Collaborative filtering algorithm is one of the most successful recommender technologies and has been widely adopted in recommender systems. However, the traditional collaborative filtering always suffers from sparsity problem of dataset. Item resource has hierarchy itself, and people's interests are centralized in several hierarchies. In addition, rating is multivariate with several factors: user's interest and item's quality etc. The proposed algorithm makes corresponding modification based on the traditional algorithm with the ideas above. Experimental results show that the algorithm can guarantee the accuracy of the system recommended by the case, effectively alleviate the data sparsity problem.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129657506","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}
Recently, as more and more applications of peer-to-peer network (P2P network) appeared on file sharing and information retrieving, many researchers made great efforts in studying its search mechanism and algorithm design. In this paper, we establish a novel Differential Coefficient Dynamics Model of file transmission in P2P network using system dynamics method based on dynamics characteristics of P2P network. The threshold value of a certain file in P2P network transmission is calculated. We also analyze the influence of some important parameters to the file transmission, such as locate successful rate among servents, entering and withdrawing rate of servents and forget rate of servents.
{"title":"Study of File Diffusion in P2P Network Using Dynamic Model","authors":"Min Ma, Quansheng Wu","doi":"10.1109/BCGIN.2011.128","DOIUrl":"https://doi.org/10.1109/BCGIN.2011.128","url":null,"abstract":"Recently, as more and more applications of peer-to-peer network (P2P network) appeared on file sharing and information retrieving, many researchers made great efforts in studying its search mechanism and algorithm design. In this paper, we establish a novel Differential Coefficient Dynamics Model of file transmission in P2P network using system dynamics method based on dynamics characteristics of P2P network. The threshold value of a certain file in P2P network transmission is calculated. We also analyze the influence of some important parameters to the file transmission, such as locate successful rate among servents, entering and withdrawing rate of servents and forget rate of servents.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129673686","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}
The inventory and procuring decisions are very important to any enterprise. This paper constructs the operational coefficient order model on the basis of profit-making efficiency and the comprehensive classification order model, through the analysis of general inventory order model starting from economic order quantity model. These models have some commonality and guidance and are given to point out the scope of the validity. The results from numerical examples illustrate the effectiveness of the proposed method.
{"title":"The Model Study of General Inventory Order Model in Supply Chain","authors":"Hualing Liu, Sun Cihai, Xiongyi Li, Huarui Liu","doi":"10.1109/BCGIN.2011.52","DOIUrl":"https://doi.org/10.1109/BCGIN.2011.52","url":null,"abstract":"The inventory and procuring decisions are very important to any enterprise. This paper constructs the operational coefficient order model on the basis of profit-making efficiency and the comprehensive classification order model, through the analysis of general inventory order model starting from economic order quantity model. These models have some commonality and guidance and are given to point out the scope of the validity. The results from numerical examples illustrate the effectiveness of the proposed method.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124494532","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}
On the basis of competitive advantageous theory, self-organization theory and entropy theory, the dynamic factors are elaborated on, from four aspects, namely knowledge factor, innovation factor, interest factor and relation factor. And the alliance knowledge entropy, innovation entropy, interest entropy and relation entropy are set up as alliance entropy. From the above, the paper builds synergy dynamic model of strategic alliance based on alliance entropy, defines the connotation of synergy mechanism and analyzes the mutual coupling relationship of alliance synergy mechanisms.
{"title":"Analysis on Strategic Alliance for Forming Synergy Mechanism Based on Alliance Entropy","authors":"Meng Qi, Han Bin","doi":"10.1109/BCGIN.2011.113","DOIUrl":"https://doi.org/10.1109/BCGIN.2011.113","url":null,"abstract":"On the basis of competitive advantageous theory, self-organization theory and entropy theory, the dynamic factors are elaborated on, from four aspects, namely knowledge factor, innovation factor, interest factor and relation factor. And the alliance knowledge entropy, innovation entropy, interest entropy and relation entropy are set up as alliance entropy. From the above, the paper builds synergy dynamic model of strategic alliance based on alliance entropy, defines the connotation of synergy mechanism and analyzes the mutual coupling relationship of alliance synergy mechanisms.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122694608","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}
A Virtual Training System of radioactive aerosol 's concentration measurement is constructed based on Virtual Reality. Firstly, 3-d geometric models about radioactive aerosol's outer environment, detector, intelligent scaler and air sampling pump etc. are constructed, the general radioactive law based on face radioactive source is presented. These models are driving in general program platform using human computer interaction technology. Furthermore, there are several functions about database sharing, fault diagnosis, examining evaluation and on-time help which realize the whole system virtual training. Program show this training system avoids "nuclear fear" psychology and improves staff's training effect.
{"title":"Design and Implementation of the Radioactive Aerosol's Concentration Measurement System Based on Virtual Training","authors":"Hui Wei-hua, Huang Chang-qiang, Di Da-li","doi":"10.1109/BCGIN.2011.134","DOIUrl":"https://doi.org/10.1109/BCGIN.2011.134","url":null,"abstract":"A Virtual Training System of radioactive aerosol 's concentration measurement is constructed based on Virtual Reality. Firstly, 3-d geometric models about radioactive aerosol's outer environment, detector, intelligent scaler and air sampling pump etc. are constructed, the general radioactive law based on face radioactive source is presented. These models are driving in general program platform using human computer interaction technology. Furthermore, there are several functions about database sharing, fault diagnosis, examining evaluation and on-time help which realize the whole system virtual training. Program show this training system avoids \"nuclear fear\" psychology and improves staff's training effect.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"140 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123144100","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}
As a language for the electronic communication of business and financial data, XBRL is popular with many countries and organizations. For the storage and query problem of taxonomies and instances, which meet the XBRL 2.1 Specification, a storage and query mechanism of XBRL data based on native XML database, Native XBRL Storage and Query Approach, is proposed and achieved in this paper. Theoretical analysis and experimental results show that this mechanism could improve the query efficiency of financial reporting in a database effectively.
{"title":"A Storage and Query Mechanism of XBRL Data Based on Native XML Database","authors":"Wenli Wang, Min Huang, Zhen Wang","doi":"10.1109/BCGIN.2011.131","DOIUrl":"https://doi.org/10.1109/BCGIN.2011.131","url":null,"abstract":"As a language for the electronic communication of business and financial data, XBRL is popular with many countries and organizations. For the storage and query problem of taxonomies and instances, which meet the XBRL 2.1 Specification, a storage and query mechanism of XBRL data based on native XML database, Native XBRL Storage and Query Approach, is proposed and achieved in this paper. Theoretical analysis and experimental results show that this mechanism could improve the query efficiency of financial reporting in a database effectively.","PeriodicalId":127523,"journal":{"name":"2011 International Conference on Business Computing and Global Informatization","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128494525","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
扫码关注我们
求助内容：
应助结果提醒方式：