{"title":"Design and implementation of code motion based on DAG code list","authors":"Hong-guang Zhang, Xu-Ze Lan","doi":"10.1109/ICCSIT.2009.5234719","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234719","url":null,"abstract":"Optimization functions are crucial to compiler design. Generally, compiler optimization divides into machine-independent optimization based on the interlanguage and machine-dependent optimization based on the object code. This paper presents an optimization scheme about code motion based on DAG code list and introduces the implementation of this scheme for a C compiler of 16-bit embedded CPU system.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"280 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127504829","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 Architecture for Internet Load Balancing Using Adaptive Packet Scheduling","authors":"M. Azath, R. W. Wahida Banu","doi":"10.1109/ICCSIT.2009.5234620","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234620","url":null,"abstract":"In this paper, we propose an architecture for load balancing, which contains an adaptive packet scheduler with a bursty traffic splitting algorithm. The scheduler has one classifier which classifies the flows into aggressive and normal flow. Aggressive flows are treated as high priority flows. Based on the buffer occupancy threshold, a trigger handler checks for load un-balance of the network and automatically triggers the load adapter. The load adapter reroutes the high-priority aggressive flows into the least loaded best path, using the bursty traffic splitter algorithm. The bursty traffic splitting algorithm splits the aggressive flows over multiple parallel paths, based on a split vector. In this algorithm, instead of switching packets or flows, it switches packet bursts. Since the packet bursts are smaller in size, the algorithm splits the traffic dynamically and accurately. At the same time, the condition forced on their latency difference, ensures that no packets are reordered. To achieve fair bandwidth allocations, load balancing is attained in the system since the high-rate aggressive traffic flows are splitted along multiple parallel paths. The proposed switching technique is executed in the edge and core routers. We will show by simulations, that our adaptive packet scheduler performs better than the standard fair-queuing techniques.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130095180","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 most probable scan mode decision for H.264/AVC inter picture coding","authors":"Jie Jia, Daeil Yoon, Hae-Kwang Kim","doi":"10.1109/ICCSIT.2009.5234771","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234771","url":null,"abstract":"Video coding standard H.264/AVC employs zig-zag scan and field scan to map transform coefficients from two dimensional matrix to one dimensional array. The zig-zag scan is used for transform coefficients in frame macroblocks (MBs), and the field scan is used in field MBs. This paper presents a most probable scan mode (MPSM) decision for H.264 inter picture coding. Besides the two scans, a horizontal scan is illustrated. For a 4×4 block, one out of the three scan modes is selected as the most probable one, and is used for the transform coefficient scan. Furthermore, an improved MPSM decision is discussed. Simulation results report that the proposed method yields an average of 1.15% bit rate reduction over the H.264 baseline profile.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130178566","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":"Mechanical fault diagnose of diesel engine based on bispectrum and Support Vector Machines","authors":"Yun-kui Xiao, Jianmin Mei, Ruili Zeng, Huimin Zhao, L. Tang, Huafei Huang","doi":"10.1109/ICCSIT.2009.5234916","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234916","url":null,"abstract":"The vibrant signal of diesel engine is analyzed by the method of bispectrum, and bispectral feature planes are searched along diagonal and parallel lines of diagonal at certain step in the bispectral modulus field, and the mean breadth value in bispectral feature planes are calculated as signal feature which is capable of describing the fault. The Support Vector Machines is used to diagnose the fault successfully by importing signal features as training samples. The experiment results show that, the noise in the vibrant signal of diesel engine can be eliminated by bispectrum and the signal feature can be extracted effectively; The signal features are perfectly described by feature planes and exist not only on diagonal and but also in the field besides the diagonal; Support Vector Machines can study effectively and diagnose successfully with limited fault samples.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"194-199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130686019","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 Hierarchical Application Layer Multicast algorithm for large-scale video broadcasting","authors":"Wang Yong, Wang Seng, Huang Xianying","doi":"10.1109/ICCSIT.2009.5234635","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234635","url":null,"abstract":"This paper proposes a new Hierarchical Application Layer Multicast (HALM) algorithm based on physical topology information of network, which is specifically designed for large-scale Video-broadcast services in Internet. The algorithm can make full use the incomplete topological Information to build effective overlay network. With according to the topological Information rather than random method to select neighbor peers, the algorithm has some well characters: low link press; Low Latency; significantly relieve the bandwidth consumption; good scalability, and so on. Using simulations, this paper shows that this algorithm offers a well-balanced solution that is better performance than existing algorithms like HMTP and HOMP in terms of some important data delivery parameters.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130775609","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 discovery of non-linear ranking functions of loop programs","authors":"Yi Li","doi":"10.1109/ICCSIT.2009.5234919","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234919","url":null,"abstract":"We present a method for the synthesis of non-linear ranking function of a program loop. Based on the region-based search, it reduces the non-linear ranking function discovering to the inequality checking. The inequality prover BOTTEMA then can be utilized to check validity for inequalities. In contrast to other approaches, the new approach can also discover the ranking function with the radicals due to BOTTEMA's distinct features. Several interesting examples are given to illustrate our technique.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"13 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132163096","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 efficiency complete algorithm for attribute reduction","authors":"Jiang Yu, Du Bin","doi":"10.1109/ICCSIT.2009.5234522","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234522","url":null,"abstract":"A complete algorithm for attribute reduction in rough set theory based on discernibility matrix was introduced. This algorithm was composed of algorithm1 and algorithm2. Algorithm1 is to select those important condition attributes based on attribute frequency function in every iteration. Algorithm2 removes redundancy and incompatibility attributes in R found out by algorithm1. The time complexity of the algorithms in the worst case was analyzed and the proof of its completeness was given. Algorithm1 and algorithm2 guarantee that the reduction is probable a smallest or smaller one.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132278859","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":"Impulse response of export price to production cost based on data mining","authors":"Yu Zhang, Yu Zhao, Chunjie Qi","doi":"10.1109/ICCSIT.2009.5234753","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234753","url":null,"abstract":"Influence of production cost on export price is always the hot topic of foreign trade research. Previous researches just use original series to establish models but not fully discover information content of time series signals. Taking China's citrus trade for example, the paper uses wavelet analysis to decompose production cost and export price into four series, which are trend, cycle, volatility and noise. After filtering noise, the paper forecasts the influence of trend, cycle and volatility of production cost on that of export price by using impulse response and variance decomposition which are based on VAR. Results show that in the long run, change trend and cycle of production cost's influence on that of export price is very significant, but the volatility of production cost's influence on that of citrus export price is very small.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127951526","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 insight on decision-making and commercial software solutions","authors":"Lubna.L Chowdhry, B. S. Chowdhry, Quintin Gee","doi":"10.1109/ICCSIT.2009.5234430","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234430","url":null,"abstract":"This paper reviews the need for strategic information by the business enterprise, the business executive and the information service provider, and answers the question whether commercially available software fulfils the organizational requirements. We also summarize how those requirements have been evolving throughout the past four decades.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129031309","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 Hermitian positive definite solution of matrix equations X + A* X− A = I","authors":"Peiyu Wei, Boxue Tan, Xueting Liu","doi":"10.1109/ICCSIT.2009.5234511","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234511","url":null,"abstract":"In this paper, we discuss the Hermitian positive definite solutions of the nonlinear matrix equation X + A* X− A = I. we give some necessary and sufficient conditions for the existence of a Hermitian positive definite solution of equation(1.1). Based on them, we also present some properties of the coefficient matrix A are presented and two equivalent equation of equation(1.1) when the matrix equation has a Hermitian positive definite solution. And construct an iterative methods for obtaining the Hermitian positive definite solutions of the equation are constructed.","PeriodicalId":342396,"journal":{"name":"2009 2nd IEEE International Conference on Computer Science and Information Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128855654","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}