{"title":"Noise Undressing and Information Identifying of the Financial Correlation Matrix","authors":"Jianqiang Sun","doi":"10.1109/ISCSCT.2008.345","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.345","url":null,"abstract":"We apply the random-matrix approach to undress the noise of the cross correlation matrix constructed from Shanghai Stock Exchange (SSE) for the period 2001-2008. The empirical evidence shows that, about 7.4% of the eigenvalues fall out the RMT bounds, and the eigenvalues within the bounds agree with the universal properties of random matrix, implying a large degree of noise in the correlation matrix. We also find that SSE has a particularly high value of the largest eigenvalues of 209.26, which is significantly different from other exchanges.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115977801","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":"Design and Implementation of Generalized R-Tree","authors":"Hui Li, Shiguang Ju, Weihe Chen","doi":"10.1109/ISCSCT.2008.317","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.317","url":null,"abstract":"Contemporary multi-dimensional database technology is severely limited at managing indexed data types of keys for many advanced application. Here, we present an elaborate retrieval method to extend the traditional R-tree, and we call it Generalized R-Tree(GRT). It can serve as an indexing structure in some multi-dimensional database systems. This method mainly addresses the problem of that traditional R-tree only index coordinate data but useless for ADTs. It means that GRT realizing the extensibility of indexed keys. GRT not only has common facilities of R-tree, but also leaves users a set of key-methods. So users can make use of them to help express their requirements to system. The advantage of this method is that it is easily extensible both in data types it can index and in the query predicates it can support, making retrieve processing more flexible and more extensible. It opens the application of R-tree to general extensibility. We also provide a simple method implementation procedure to illustrate the flexibility of GRT.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116752894","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 for Packaged Granary Grain Quantity Intelligent Reckoning","authors":"Ying Lin, Yong Liu, Yueheng Sun, Yanhong Sun","doi":"10.1109/ISCSCT.2008.66","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.66","url":null,"abstract":"A scheme for packaged granary grain quantity intelligent reckoning based on image processing was proposed in this paper. According to the actual scene, the grain bag characteristic outline -- the boundary of the counter-band of light was presented and taken as the analysis object. An algorithm combining Canny operator with image morphological thinning are used to extract the outline. Then, a counting algorithm which integrates mode theory and variance analysis technology is presented for the quantity second-judgment. The experimental results indicate that by accurately extracting the characteristic outline and counting the number of the characteristic outline, the algorithm presents an effective method for grain quantity detection with high recognition precision and efficiency.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115356832","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":"Large Scale Scenes Reconstruction from Multiple Views","authors":"Shi Limin, Zhang Feng, Zhenhui Xu, Zhanyi Hu","doi":"10.1109/ISCSCT.2008.323","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.323","url":null,"abstract":"In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by matching key points across images. Then it builds a tetrahedral decomposition of space by computing the 3D Delaunay triangulation of the 3D point set. Finally, a triangular mesh of the scene is extracted by labeling Delaunay tetrahedra as inside or outside. A globally optimal label assignment is efficiently found as a minimum cut solution in a graph. Experimental results demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125980176","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}
Lin Liangfang, Zeng Tao, Yu Yongquan, Lin Shangfang
{"title":"Extension Cluster Prediction Model Used in Predicting Wastewater Emissions","authors":"Lin Liangfang, Zeng Tao, Yu Yongquan, Lin Shangfang","doi":"10.1109/ISCSCT.2008.179","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.179","url":null,"abstract":"This paper use the concept of matter-element and correlation function to establish a prediction model based on the extension of the cluster, and apply the model to forecast the wastewater emissions. Applied results show that this method is scientific and reliable.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127249906","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":"Algorithm Research of Face Image Gender Classification Based on 2-D Gabor Wavelet Transform and SVM","authors":"Wang Chuan-xu, Liu Yun, Li Zuo-yong","doi":"10.1109/ISCSCT.2008.204","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.204","url":null,"abstract":"Gender classification is one of the most challenging problems in the field of pattern recognition. The pixel-based gray image recognition method is quite sensitive to illumination variation and has high dimensions for computation. PCA-based image feature recognition algorithm can reduce the image dimension, but it is only on the basis of optimal entropy to choose face features which neglects the different gender information between the male and female. In order to overcome the disturbance of non-essential information such as illumination variations and facial expression changing, a new algorithm is proposed in this paper. That is, the 2-D Gabor transform is used for extracting the face features; a new method is put forwards to decrease dimensions of Gabor transform output for speeding up SVM training; finally gender recognition is accomplished with SVM classifier. Good performance of gender classification test is achieved on a relative large scale and low-resolution face database.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123663698","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":"Extending Sliding-Window Semantics over Data Streams","authors":"Leisong Chen, Guoping Lin","doi":"10.1109/ISCSCT.2008.187","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.187","url":null,"abstract":"Data stream processing is now commonplace in applications such as network monitoring, sensor networks, telecommunications data management, Web personalization, manufacturing and others. The continuous sliding-window query model is used widely in data stream management systems. However, the existing sliding window query models fail to answer some of the queries that qualify a certain condition. In this paper, we extended the existing sliding window to general scenarios by adding a new class of sliding window operator, termed condition-based sliding window. The condition can be defined over any attribute of data stream tuple in an out of order manner. We discuss the semantics of the operator and show that above method performs well for queries that qualify a certain condition.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121484974","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 Novel Method for Qualitative Modeling and Simulation Based on XML","authors":"C. Shao, Pengfei Chen, Lizhong Wang, Fangfang Liu","doi":"10.1109/ISCSCT.2008.156","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.156","url":null,"abstract":"The qualitative simulation field has developed remarkably in theory of algorithms, while relatively backward in modeling methodology. In this paper, a novel qualitative modeling and simulation approach based on XML (extensive markup language) is proposed, which greatly improves the efficiency of modeling, enhances the reusability, scalability and standardization of qualitative modeling and simulation. On the basis of theory studying of qualitative simulation algorithms and component-connection modeling, the model library design proposal is described by XML markup language. Some specific instances of the model fragments are introduced in relation to components of qualitative simulation model. The component-connection library (XML documents) will be parsed and transformed into a qualitative simulation QDE (qualitative differential equation), which is the input and initialization of qualitative simulation process.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121807831","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":"Termination of Nested Loop","authors":"Bin Wu, Zhongqin Bi","doi":"10.1109/ISCSCT.2008.58","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.58","url":null,"abstract":"The verification of termination is a difficult problem. While most of the recent work on automated termination proofs focuses on the construction of linear ranking functions for unnested loops, we present an algorithm based on region graphs to prove termination of nested loops. The method can prove the termination of terminating nested loops that may not have linear ranking function. For the programs we have considered, this approach converges faster and sufficiently.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122812470","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":"An Improved PSO Algorithm and its Application to Grid Scheduling Problem","authors":"Yan-ping Bu, Zhou Wei, Jin-shou Yu","doi":"10.1109/ISCSCT.2008.93","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.93","url":null,"abstract":"With the advent of the grid, task scheduling in heterogeneous environments becomes more and more important. The model of grid scheduling is analyzed in this paper. The optimal objective is to minimize the total completing time. This paper presents an improved particle swarm optimization (PSO) algorithm with discrete coding rule for grid scheduling problem. The improved PSO algorithm can keep all the advantages of the standard PSO, such as implementation simplicity, low computational burden, and few control parameters, etc. A set of experiments show that the algorithm is stable and presents low variability. The preliminary results obtained in this research are auspicious. We also tested the improved PSO algorithm against the MaxMin heuristic and found that improved PSO outperforms MaxMin by the total makespan and other performance.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122954534","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}