{"title":"Software Dependability Evaluation Model Based on Fuzzy Theory","authors":"Shi Huiling, M. Jun, Zou Feng-yi","doi":"10.1109/ICCSIT.2008.52","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.52","url":null,"abstract":"Through the foundation of a universal dependability indicator system and making use of the fuzzy synthesized evaluation method, a dependability evaluation model is established to solve the problem of software dependability evaluation. The feasibility and effectiveness of this model is proved by a representative example. It provides an effective method for software dependability evaluation.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131061126","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 Authentication Service for Collaborative Manufacturing","authors":"Min Li, Yi-sheng Zhang, Niansheng Cheng","doi":"10.1109/ICCSIT.2008.166","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.166","url":null,"abstract":"In modern Collaborative Manufacturing, different security mechanisms of systems bring usage complexities and security risks. Grid Security Infrastructure (GSI) enables secure authentication and communication over computer networks. It is designed and developed on the technology of Java GSS-API, JAAS, Kerberos. The key technologies such as integrating with application server are specially discussed. The application in a blanking processing factory verifies the practicability of the security service.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134071952","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":"Fault-Tolerance Ring Network on Chip without Buffer","authors":"Zhang Li-guo, Du Huimin, H. Jungang","doi":"10.1109/ICCSIT.2008.19","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.19","url":null,"abstract":"The paper brings forward a hierarchical ring NoC (network on chip) topology whose links are divided into two groups of rings for fault-tolerance. Each group of ring contains one control-ring and one data ring. Control-ring propagates the information of routing, link error and error control of all nodes using packet switching. Data-ring exchanges data using circuit switching. Three pipeline stages architecture without buffer is presented that minimizes the delay of communications among nodes. Ring network adopts time division multiplexing and priority mechanism to implement space division multiplexing of bandwidth and fair routing. Simulation results show that the architecture can efficiently avoid traffic congestion, deadlock and starvation and ensure full use of bandwidth.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132392071","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":"Hash Partitioned apriori in Parallel and Distributed Data Mining Environment with Dynamic Data Allocation Approach","authors":"Sujni Paul, V. Saravanan","doi":"10.1109/ICCSIT.2008.63","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.63","url":null,"abstract":"Parallel system is mainly composed of parallel algorithms which are cost optimal. In this paper a parallel algorithm the hash partitioned apriori (HPA) is taken into consideration. HPA partitions the candidate itemsets among processors using a hash function, like the hash join in relational databases. HPA effectively utilizes the whole memory space of all the processors, hence it works well for large scale data mining in a parallel and distributed environment. The optimization technique of dynamic data allocation is discussed for the execution of this application. This technique is applied in a parallel and distributed environment. Writing parallel data mining algorithms in a distributed environment is a non-trivial task. The main purpose of the proposed method is to meet certain challenges associated with parallel and distributed data mining such as (i) minimizing I/O (ii) Increasing processing speed (iii) Communication cost.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132518848","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 Developmental Design of the Intelligent Slave Station Based on the Profibus-DP Fieldbus","authors":"Lingxia Liu, Q. Song, Xiangdong Chen","doi":"10.1109/ICCSIT.2008.12","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.12","url":null,"abstract":"As the communication network used to connect the automation equipment like instrument and controller in the manufacturing field, the fieldbus technology is a new distributed control technology appeared during ninetieth decade. Accompanied with the digital period coming, the fieldbus control will become the main trend in the industrial automation. It designs the intelligent slave based on Profibus-DP field bus technology in this paper. It consists of the design of microprocessor and communication interface chip, and the implementation of the remote control.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130237297","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":"Filtering Algorithm of the False Features for Fingerprint Images Based on Wavelet Transform","authors":"Z. Baohua, W. Yaping","doi":"10.1109/ICCSIT.2008.134","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.134","url":null,"abstract":"According to the characteristics of fingerprint images, combined with the human visual properties, this paper presents a de-noising algorithm of fingerprint image processing to decrease the influence of noises. Based on the different characteristics between the noise points and image features, the algorithm decreased the noises of the source images and filtered the corresponding noise coefficients after the wavelet decomposition. As for the coefficient matrices following the wavelet decomposition, after calculating all local gradients of the coefficients, we established the algorithm by using the local gradients of the source images as the judgment basis, and chose the highest Gradient coefficient in the different directions of the source images as the final fusion coefficient. The experimental results indicate that the algorithm can promote the SNR of the source images, protect the details of the images and improve the visual effects.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116380948","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":"TSPI: A Tuplespace Based Parallel Programming Library","authors":"Bei Zhou, Lei Wang, Yong-zhong Huang","doi":"10.1109/ICCSIT.2008.71","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.71","url":null,"abstract":"As a network middleware, Tuplespace provides a powerful way for distributed computing. Having used the TSpaces implementation, we describe the design and implementation of TSPI, a Tuplespace based parallel programming library which can be called in C. Especially, TSPI supports some important functions such as reliability, high performance, computers joining and quitting dynamically. Furthermore, the corresponding parallel program structure is proposed. Compared with MPI, TSPI is simple, supporting dynamic environment and load balance.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134207404","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":"Automation of Toll Gate and Vehicle Tracking","authors":"J. Krishnamurthy, N. Mohan, R. Hegde","doi":"10.1109/ICCSIT.2008.148","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.148","url":null,"abstract":"Toll gate Automation and Vehicle Tracking is designed to automatically keep track of the vehicle's movement, record the time and the details like Owner's name, date of registration, vehicle model etc. This system is very useful for automatic vehicle tracking, time management and also for automation of Toll gate. This paper explains the implementation of Toll Gate Automation which is a step towards improving the Tracking & monitoring of vehicles, traveling in predetermined routes. In this system, a computerized system automatically identifies an approaching vehicle and records the vehicle number & Time. If the vehicle belongs to the authorized person/group, it automatically opens the Toll Gate and a predetermined amount is automatically deducted from its account.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134213620","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":"Settings of Algorithm Parameters in Ant Colony Algorithm","authors":"Wang Zhi-he","doi":"10.1109/ICCSIT.2008.94","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.94","url":null,"abstract":"The relevant parameters in the ant colony algorithm have great impact on algorithm performance and various parameters are closely linked, and a good parameter combination will increase the overall search capability and convergence of algorithm. At present, the parameter settings of the ant colony algorithm are determined relying on experience and experiments which have heavy workload and it is difficult to get the optimal combination of parameters. On the basis of the idea that algorithm parameters are uniformly designed, a combination of representative experimental points (parameter values) is selected for experimental design, and a satisfactory combination of algorithm parameters is found with fewer number of experiments, so that the optimum operating performance can be realized by the algorithm. The simulation experiments show that the method is feasible and effective.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133887277","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}
Hung-Min Sun, Bying-He Ku, Chung-Chi Wu, Ting-Yu Lin
{"title":"Improvement of VQ Index Compression with Relative Index Tables","authors":"Hung-Min Sun, Bying-He Ku, Chung-Chi Wu, Ting-Yu Lin","doi":"10.1109/ICCSIT.2008.17","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.17","url":null,"abstract":"Image vector quantization (VQ) has many current applications, like speech and image compression, and envisioned applications, such as digital watermarking, data hiding and speaker identification. In this paper, we propose a novel lossless compression algorithm, called ISAIAL, to improve the coding efficiency of image VQ. Given an image, VQ produce an index map by quantizing the image block by block, and the main idea of the ISAIAL is to exploit the inter-block correlation in the index domain. We introduce new coding structures, relative index tables, for encoding the index map of VQ. For each code word of the code book, there is a corresponding relative index table that records the indices, which will probably appear in the next block. Two valid methods are introduced for establishing relative index tables.We also show that our ISAIAL is lossless, i.e., the index map can be reconstructed without any distortion. By the experiments, the proposed methods did decrease the bitrate apparently as compared to the conventional VQ andsome commercial lossless compressors, such as rar, zip andarj.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133799189","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}