{"title":"Research on Knowledge Base of Science and Technology","authors":"Xing Chen, Kun Hong, Hai-tao Wang","doi":"10.1109/ICCIS.2010.82","DOIUrl":"https://doi.org/10.1109/ICCIS.2010.82","url":null,"abstract":"Statistics of science and technology is not only a daily task of technology sector, but also an important reference for government decision. How it is possible to deal statistics data by computer system automatically? It is a goal for information system specialists and scientific and technical workers. We studied many documentations and reports of statistics for science and technology in Kunming and other province. So we provided a knowledge base of statistics based categories theory and ontology, and found the computing principle on the knowledge base. Our innovation is the way to build the knowledge base for statistics of science and technology which can accommodate all the statistics information of concepts and specification and design and perform strategies people desired. This paper provided ideas to statistics computing automatically.","PeriodicalId":227848,"journal":{"name":"2010 International Conference on Computational and Information Sciences","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123500479","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":"Pornographic Audios Detection Using MFCC Features and Vector Quantization","authors":"Zhiyi Qu, Jing Yu, Qiang Niu","doi":"10.1109/ICCIS.2010.228","DOIUrl":"https://doi.org/10.1109/ICCIS.2010.228","url":null,"abstract":"Identifying the phonetic characteristics of speakers is an important branch of speech recognition. The audition system of human being is an ideal speaker recognition system. MFCC (Mel-frequency cepstral coefficients) characterizes the auditory features of humans effectively, and thus has been widely used in practice. This paper explores applying MFCC and VQ (vector quantization) algorithms on the pornographic audios detection. Firstly, MFCC of selected pornographic audios are extracted and then encoded into codebooks using VQ algorithm, Secondly, all of the codebooks obtained will be averaged to get an average codebook, Finally, the type of any newly input audio belonging to, either pornographic or non-pornographic, will be determined by measuring the Euclidean distance between the average codebook and its own codebook. Experiment results show that the algorithm can detect pornographic audios effectively.","PeriodicalId":227848,"journal":{"name":"2010 International Conference on Computational and Information Sciences","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123630766","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":"ABC-ACO for Perishable Food Vehicle Routing Problem with Time Windows","authors":"Weiwei Gong, Zetian Fu","doi":"10.1109/ICCIS.2010.311","DOIUrl":"https://doi.org/10.1109/ICCIS.2010.311","url":null,"abstract":"This paper identifies the key aspects of perishable food distribution problem in metropolis. A multi-objective model of vehicle routing problem with time window is constructed including fixed vehicle cost, operation cost, shelf life loss and default cost. In order to reduce the increase distribution cost via meeting the time window, two-generation Ant Colony Optimization with ABC customer classification (ABC-ACO) is applied to solve the problem. The computational results show that the ACO with targeted customer classification is 20.8% faster and with 15.9% cost reduction.","PeriodicalId":227848,"journal":{"name":"2010 International Conference on Computational and Information Sciences","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116289144","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 Sampling Inspection Method Based on Sequential Posterior Odd Test","authors":"Zhaoyong Mao, Baowei Song","doi":"10.1109/ICCIS.2010.46","DOIUrl":"https://doi.org/10.1109/ICCIS.2010.46","url":null,"abstract":"From the view point of the sample size can be reduced greatly by using the sequential posterior odd test (SPOT) method. Combining with the sampling inspection, a sampling inspection method for pass-fail data distribution based on SPOT was discussed in detail. The main contribution of this paper is that the proposed method combined the excellencies of SPOT method and sampling inspection method, so which not only can reduce the sample size due to making effectively use of the prior information, but also can very easily make sampling inspection project. A special sampling inspection case was presented, through computer simulation, the result shows that the proposed method is feasible, and demonstrates that it is better than traditional sampling inspection method for effective to reduce the sample size.","PeriodicalId":227848,"journal":{"name":"2010 International Conference on Computational and Information Sciences","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124375579","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":"Improved Adaptive Convex Combination of Least Mean Square (LMS) Algorithm","authors":"Wei Wang, Chuankun Mu, Hongru Song, Miao Yu","doi":"10.1109/ICCIS.2010.145","DOIUrl":"https://doi.org/10.1109/ICCIS.2010.145","url":null,"abstract":"In the normal adaptive convex combination of least mean square algorithm (CLMS), the rule for modifying mixing parameter is based on the steepest descent method. When the algorithm converges, it will generate zigzag phenomena, which can make the convergence speed become slowly. To solve this problem, a new method that combines steepest descent method with damp Newton method for the mixing parameter is presented in this paper. The improved method can get faster convergence speed as well as retain the properties of normal convex combination algorithm. The results of comparison and simulation verify that the improved method has faster convergence speed and better performance.","PeriodicalId":227848,"journal":{"name":"2010 International Conference on Computational and Information Sciences","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122257497","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 Costs Allocation Method for Reverse Logistic of Discarded Appliances","authors":"Lu Ying-jin, Jiao Lu","doi":"10.1109/ICCIS.2010.325","DOIUrl":"https://doi.org/10.1109/ICCIS.2010.325","url":null,"abstract":"We develop a model that presents an alternative to waste appliances with firms that cooperate with each other under incomplete contracts, and setting up a costs allocation method for the reverse logistics of discarded appliances in this paper. We find that the total generated value is Pareto optimum if appliances firms cooperate and distribute the recycled costs of waste appliances following the Shapley value solution. Finally, an example is given to show the feasibility and availability of the developed method.","PeriodicalId":227848,"journal":{"name":"2010 International Conference on Computational and Information Sciences","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121603291","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 Construction of Topic-Based Learning Websites: From the Practice of Designing a Learning Website","authors":"Lei He, Xiaoyu Zhang, Liang Wang, L. Xu","doi":"10.1109/ICCIS.2010.192","DOIUrl":"https://doi.org/10.1109/ICCIS.2010.192","url":null,"abstract":"To provide an autonomous learning platform for the students who are interested in web design, the authors of this article and a team of senior undergraduate students established a learning website on the campus network of Tibet Institute for Nationalities. This article first sum up the achievement and problems of the learning website, then proposes a new system framework on topic-based learning websites building. The framework, based on Web2.0, is more open and interactive and can offer personalized learning services to individual learners of different levels.","PeriodicalId":227848,"journal":{"name":"2010 International Conference on Computational and Information Sciences","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131396740","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":"Performance Evaluation of OPS Contention Resolution Scheme Based on SPC Wavelength Conversion","authors":"Mian Zheng, Siwei Ji","doi":"10.1109/ICCIS.2010.227","DOIUrl":"https://doi.org/10.1109/ICCIS.2010.227","url":null,"abstract":"The contention resolution scheme based on single-per-channel (SPC) wavelength conversion is proposed in optical packet switching (OPS) system. The packet loss probability in the scheme is analyzed in theory and the numerical results are shown. The results indicate the packet loss probability can be reduced with the increase of wavelength converters used in contention resolution. The effect of performance improvement by increasing wavelength converters at the low-load condition is better than that at the high-load condition. Furthermore, the impact from the system parameters, such as the number of optical wavelength and input ports, is analyzed based on the proposed model. The increase of optical wavelength per fiber improves the performance rapidly, but the increase of input fibers causes the performance degradation insignificantly.","PeriodicalId":227848,"journal":{"name":"2010 International Conference on Computational and Information Sciences","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131698102","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":"Stabilized Finite Element Method for Vorticity_Velocity_Pressure Formulation of the Stationary Navier-Stokes Equations","authors":"Hong-e Li, Zhu Rui","doi":"10.1109/ICCIS.2010.341","DOIUrl":"https://doi.org/10.1109/ICCIS.2010.341","url":null,"abstract":"In this paper, formulated interms of vorticity, velocity and pressure, the stationary Navier-Stokes equations are discretized by stabilized finiteele mentm ethods. The method is consistent and stable for any combination of discrete vorticity, velocity and pressure spaces without requiring the B-B condition. The existence and uniqueness of the continuous and discrete solutions are proved in the case of sufficient viscosity or small data. The convergence and the optimal error rate are obtained.","PeriodicalId":227848,"journal":{"name":"2010 International Conference on Computational and Information Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130907908","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 of an Improved Genetic Algorithm in Logistics Freight Vehicle Routing Problem","authors":"Y. Bao, Chunlin He, Zhiyong Zhou, Xiang Jin","doi":"10.1109/ICCIS.2010.340","DOIUrl":"https://doi.org/10.1109/ICCIS.2010.340","url":null,"abstract":"Logistics traffic scheduling is a key job for logistics activity, but there are some weak points, e.g. local optimum, premature convergence and slow convergence while we employ the traditional genetic algorithm to analyze that problem. Therefore, we need to improve the genetic algorithm to solve the vehicle routing problem. This paper builds up a mathematical model for the traffic scheduling problems and advance an improved gene arithmetic. We simulate that model and the results from the simulation show the improvements are advanced and practical, and the model can improve the efficiency to find the optimal distribution path and save the transportation costs.","PeriodicalId":227848,"journal":{"name":"2010 International Conference on Computational and Information Sciences","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132906911","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}