{"title":"A Unified Addressing Schema for Hexagonal and Honeycomb Networks with Isomorphic Cayley Graphs","authors":"Mingxin He, W. Xiao","doi":"10.1109/IMSCCS.2006.24","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.24","url":null,"abstract":"As interconnection architectures, the regular six-degree hexagonal networks and the regular three-degree honeycomb networks have been widely investigated. For the lack of a proper addressing schema, some published routing algorithms are very complicated and the topological properties of some complex hexagonal and honeycomb related architectures are not well known. In this paper, a unified addressing schema for hexagonal and honeycomb meshes is proposed; two Cayley graphs isomorphic to the two meshes are presented as a formal foundation for the addressing schema. Using the suggested addressing schema, simple distance formulas and concise shortest-path routing algorithms of the two meshes are developed. The routing algorithms may be directly applied in real interconnection networks such as cellular networks. The models based on the unified addressing schema and the two isomorphic Caylay graphs established a concise and elegant foundation to investigate complex hexagonal and honeycomb related networks","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126650048","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 on Compression Method Based on Integer Wavelet Transform and SPIHT for Historical Data in Process Industry","authors":"Peng Jiang, Qingbo Huang, Yaguang Kong, Li Chai","doi":"10.1109/IMSCCS.2006.116","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.116","url":null,"abstract":"To compress historical data in process industry and reduce data storage, a new compression method based on integer wavelet transform and SPIHT (set partitioning in hierarchical trees) was proposed. Wavelet coefficients and temporal orientation trees were obtained by utilizing integer wavelet transform to decompose the original data into five layers. Encoding the wavelet coefficient by SPIHT, the bit plane was exported. After encoding the bit plane by adaptive arithmetic encoder yielded higher compression ratio. The method doesn't need float operation and uses the comparability of wavelet coefficients in each scale. Simulation results show that the features of the method were low computation complexity, fast compression rate, high compression ratio and small reconstruction difference, when it is applied to the compression decompression process of temperature signals from a paper mill","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127044631","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 Integrated Photogrammetric System with Metric Digital Camera and Total Station","authors":"Z. Zhan, Zuxun Zhang, Jianqing Zhang","doi":"10.1109/IMSCCS.2006.34","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.34","url":null,"abstract":"This paper presents several new issues of an integrated photogrammetric system: photo total station system (PTSS), which was first presented on the XXth ISPRS that installs metric digital camera on total station together with digital photogrammetric software. Because of the automatic obtainment of the photos' exterior orientation elements during the observation with total station, true non-contact measurement can be possible. The main focuses are on comparison with other similar instruments, New offset calibration method, Panorama mosaic and building reconstruction, 3D reconstruction with control photo and software design","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115244902","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":"Structural Pattern Analysis for Texture Synthesis","authors":"Yizhe Li, Guoliang Chen, Qilong Zheng","doi":"10.1109/IMSCCS.2006.129","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.129","url":null,"abstract":"Sample based texture synthesis allows the generation of arbitrarily sized textures based on a small sample image. One main drawback of the technique is that a new pixel or patch is selected only considering local information in the generated texture. Thus structural error can't assure to be avoided for structural textures. To accelerate texture synthesis process and to avoid structural mismatch in the output picture, we present in this paper a structural pattern analysis (SPA) algorithm and a texture synthesis method using the algorithm. The pattern analysis tool also quantizes the texture randomness in macro scope view. It can be used in other applications such as automatic texture classification and quality evaluation of synthesized texture. We illustrate our result with some examples","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116807883","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":"Deployment of One-Sided Communication Technique for Parallel Computing in Katsevich CT Image Reconstruction","authors":"Tao He, J. Ni, Junjun Deng, Hengyong Yu, Ge Wang","doi":"10.1109/IMSCCS.2006.54","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.54","url":null,"abstract":"This paper focuses on the implementation of parallel approach of Katsevich CT image reconstruction algorithm using one-sided communication technique. One-sided communication is a new feature provided by MPI-2 standard. It natively supports new network techniques such as InfiniBand and Myrinet. In this project, we implement three kinds of one-sided approaches for Katsevich algorithm. The results are compared the other P2P models on the performance metrics speedup, efficiency, and cost","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116826349","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":"River Change Detection Based on Remote Sensing Image and Vector","authors":"Lina Zhu, Jianqing Zhang, Light Pa","doi":"10.1109/IMSCCS.2006.121","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.121","url":null,"abstract":"Updating geographical database is an important task which can be realized by change detection. Objects of change detection usually include residential areas, roads, rivers, and so on. Because of different geometrical shapes and physical properties, different objects have different change detection methods. This paper aims at river change detection and introduces a compositive method composed of wall is filter, pattern classifying, region growing, morphology, etc","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124370414","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":"Minimum Diameter Application Layer Multicast Tree Algorithm","authors":"Yanhua Wu, Yunze Cai, Jinjie Huang, Xiaoming Xu","doi":"10.1109/IMSCCS.2006.87","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.87","url":null,"abstract":"High communication delay is an obstacle of the application of ALM (application layer multicast) technology. Traditional MST problem trying to get a tree with a small tree weight is not fit for ALM. ALM requires the multicast tree has minimum tree diameter, which determines the communicate period of real-time application systems such as DVE and video conferencing system. Based on this point an amended algorithm of Prim algorithm named MDT is presented in this paper. It tries to find a spanning tree for a certain number of nodes with a shortest tree diameter. The algorithm process is discussed in detail and the fake codes are also given out in this paper. A series of simulation experiments had been taken to check the rightness of this algorithm. Algorithm analysis and simulation results have proved that MDT algorithm gets its initial object. Some disadvantages of MDT algorithm are also discussed in the conclusions section","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132279751","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 Hopfield Neural Network Based Algorithm for RNA Secondary Structure Prediction","authors":"Qi Liu, X. Ye, Yin Zhang","doi":"10.1109/IMSCCS.2006.9","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.9","url":null,"abstract":"In this paper a Hopfield neural network (HNN) based parallel algorithm is presented for predicting the secondary structure of ribonucleic acids (RNA). The HNN here is used to find the near-maximum independent set of an adjacent graph made of RNA base pairs and then compute the stable secondary structure of RNA. We modified the motion equation proposed in paper to reflect more biological essence of RNA secondary structure in which the ther mo dynamic parameters of base pair is used in our algorithm to control the variation rate of inhibitory and encouragement terms in the equation. Comparisons with the algorithm presented in paper and other two classical prediction methods (Zuker 's and Nussinov 's) show that our method is more sensitive and specific. In addition, our algorithm can be very efficient and be applied to sequences up to several thousands of base long with more degree of parallelism","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129255057","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":"Efficient Frame Rate Control Algorithm and Its Implementation","authors":"Haibin Shen, Junfeng Fan","doi":"10.1109/IMSCCS.2006.57","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.57","url":null,"abstract":"The frame rate control (FRC) is designed for displaying color level on STN panels. According to a pixel's color level, it controls its ON/OFF state in different frames. In this paper, we proposed a spatial expanded FRC (SEFRC) algorithm, which expanded the traditional FRC algorithm on single pixel to the whole panel, and therefore efficiently inhibited the flicker noise. This FRC algorithm had been integrated into a LCD controller, which had been taped out by SMIC. The result shows that SEFRC has good hardware characteristics with only negligible silicon cost","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133277972","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":"Noisy Speech Enhancement Based on Discrete Sine Transform","authors":"Xueyao Li, Hua Xie, Bailing Cheng","doi":"10.1109/IMSCCS.2006.91","DOIUrl":"https://doi.org/10.1109/IMSCCS.2006.91","url":null,"abstract":"When the speech signal and the random noise are transformed with discrete sine transform (DST), the discrete sine transform coefficients at the low frequency regions are predominantly speech, and at the high frequency regions are predominantly noise. According to this, a new speech enhancement method based discrete sine transform is proposed in this paper. The level of the trace of the signal present in the high frequency region of DST coefficients is estimated to obtain the threshold parameter, and after the signal-to-noise ratio estimation and speech present probability is calculated, an improved method is adopted. The experiment results show that it is an effective speech enhanced method","PeriodicalId":202629,"journal":{"name":"First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115751070","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}