{"title":"Study on Electromagnetic Radiation of Ultra-High Voltage Power Transmission Line","authors":"Yuan Shangzun, L. Pengfei, Nie Ling","doi":"10.1109/ICCSIT.2008.92","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.92","url":null,"abstract":"With the rapid development of electric undertaking and the expansion of town scale, ultra-high voltage (such as ac 1000 kv, dc 800 kv) power transmission lines are coming to our lives. And with the development of ultra-high voltage power transmission line, the ultra-high voltage transformer substation will appear in the place with dense population and the electromagnetic pollution of this transmission and transformer equipment and its infection to the natives arouse the great concern from the society. In the other hand, the natives are afraid of the electromagnetic pollution and oppose the power construction, which brings about many unnecessary troubles. To study the situation of electromagnetic pollution due to the transmission and transformer equipment needs many measurements in the field. This paper focuses on electromagnetic radiation of ultra-high voltage power transmission line. Firstly, investigate the condition of being recognized of electromagnetic radiation and analyze the pollution status of environment and human body due to electromagnetic radiation. And then, study the electric and magnetic field under the transmission line by the method of equivalent charges and put forward the prevention policy to the electromagnetic radiation in the engineering of ultra-high voltage power transmission and transforming.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"61 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":"122949857","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":"DYNA-RANK: Efficient Calculation and Updation of PageRank","authors":"Mandar Kale, P. S. Thilagam","doi":"10.1109/ICCSIT.2008.118","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.118","url":null,"abstract":"The decision of the ranking of web page is very important in web, as its growing and changing very rapidly. Ranking of the results in a search engine for a query plays crucial role for huge database like Web, where one query can have millions of results. The browsing nature of web will mostly depend on the ranking of the search results. The existing approaches for calculating pagerank values are mostly centralized and the ones which are distributed, are not being used for practical purposes because of the scalability reasons. The centralized approaches considers total web as one graph and they calculate the pagerank values of total graph after certain time period, which takes long execution time and can be in days. In the same way updating the graph also compels to recalculate all the pagerank values of all the pages in the graph. This suggests possible applicability of the distributed algorithm to pagerank computations as a replacement for the centralized pagerank calculation algorithm. Considering the importance of the \"Ranking\" in searching context, our approach DYNA-RANK, focuses upon efficiently calculating and updating Google's pagerank vector using \"peer to peer\" system. The changes in the web structure will be handled incrementally amongst the peers. DYNA-RANK produces the relative pagerank on each peer. DYNA-RANK is proven to take less computation time and less number of iterations compared to centralized approach.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"14 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":"127708131","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":"Development of Machine Vision System Based on BP Neural Network Self-learning","authors":"Ge Dong-yuan, Yao Xifan, Zhang Qing","doi":"10.1109/ICCSIT.2008.190","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.190","url":null,"abstract":"The precision of machine vision calibration is affected by those factors such as the loss of depth information, distortion of camera lens, and errors caused by image processing. In this paper machine vision system is developed by means of BP neural network with self- learning. There are 4 inputs, which are the image coordinates of a match point in left and right camera, and 3 outputs in the network. The sum square of errors between the outputs of the network and actual coordinates in world system is taken as performance index. The network weights are tuned in the light of gradient descend method and can be achieved stable value while the given sum square of errors is reached. Thus each projection matrix of two cameras of machine vision system can be replaced by the weights and the activation function of the neural network, and calibration of system is finished. Finally, the precision analysis is carried out for the system.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"24 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":"127905367","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":"Risk Analysis of the Association Rules in the Incremental Mining Based on the Weighted Model","authors":"Ying Mei, Liangsheng Zhu","doi":"10.1109/ICCSIT.2008.73","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.73","url":null,"abstract":"This paper presents the weighted model in the incremental mining algorithm and proposes risk analysis of the strong association rules for trend forecasting. We also analyze the risk degree of the lost rules based on the incremental mining. In practical application, the new method improves the precision of the incremental mining and efficiently uses the mining results for the factual decision-making and trend forecasting.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"35 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":"127907729","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 of an Information Intelligent System based on Web Data Mining","authors":"Xinlin Zhang, Xiangdong Yin","doi":"10.1109/ICCSIT.2008.178","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.178","url":null,"abstract":"How to efficiently use the vast amounts of information on the Web to make the information processing intelligent, personalized and automatic is the most important applications of the current data mining technology. In this paper, Web data mining process is introduced from the view of function, an intelligent mining system of network information is built with combining the data mining and artificial intelligence technologies and the functions of the various subsystems of it are also introduced.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"27 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":"121284535","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 Iron Difficiency Anemia Blue and Red Cell Number Calculating by Intictinal villi Tissue Slide Images Enhancing and Processing","authors":"B. Alhadidi, H. Fakhouri","doi":"10.1109/ICCSIT.2008.105","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.105","url":null,"abstract":"Iron deficiency anemia is defined as hemoglobin concentration in blood less than 135 g/dl in adult male and less than 11.5 g/dl in females it has many symptoms (weakness, lethargy, palpitation) and less hemoglobin means less carrying oxygen to the body, the analysis of the Red blood cells that is found in the villi cells in the small intestine will give a lot of useful information about iron deficiency anemia, but the problem that this analysis is still until this century done manually and finding an algorithm to make the process of the slide image analysis automated will make a change in the analysis process so in This paper we presents a new implemented algorithm that achieves an automated way for the analysis of images taken for intestine villi and this algorithm will count the number blue and the red stained cells blood cells that contain iron in each villi alone and also calculate the percentage of blue cells and red cells in the image and this will give a lot of information that is useful and it starts from the step the follow villi image cropping and determining the ROI that we want to count the number in it and this ROI should be a complete villi or part of it.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"35 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":"117340339","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":"Education and Educational Administration: A Technological Perspective","authors":"J. Meenakumari","doi":"10.1109/ICCSIT.2008.165","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.165","url":null,"abstract":"In the present Knowledge era, technology has a vital role to play in all fields, including education. Technology enables providing effective and pervasive media for life-long and personalized learning experiences. The advancements in telecommunication at a rapid pace have also paved the way for technology-based education systems and educational administration. The absorption of technology in education systems have fuelled the concept of \"any education anytime and anywhere\" and also about \"technology for education\" rather than limiting to \"technological education\". This paper provides a process model and a technical model for a technology-based education system. The process model highlights the processes building up a technology-based education system. The technology model for deploying e-administration in higher educational institutions is also discussed together with a survey report justifying that technology-based learning and technology-based administration are not available in totality.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"29 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":"115672539","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":"Speech Packet Concealment Techniques Based on Time-Scale Modification for VoIP","authors":"V.P. Bhute, Urmila Shrawankar","doi":"10.1109/ICCSIT.2008.183","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.183","url":null,"abstract":"With the availability of large bandwidth and high data rates the transmission of data, voice and video over the Internet is gaining popularity. Voice-over-IP (VoIP) uses packetized transmission of speech over the Internet (IP network). However, at the receiving end; packets are missing due to network delay, network congestion (jitter) and network errors. This packet loss degrades the quality of speech at the receiving end of a voice transmission system in an IP network. Since the voice transmission is a real-time process, the receiver cannot request for retransmission of the missing packets. This causes a need for reconstruction of the lost packet. Concealment algorithms, either transmitter or receiver based, are used to replace these lost packets. The goal of this paper is to review the different PLC algorithm on the receiver side.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"245 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":"114504390","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 Practical Design of Gabor Filter Applied to Licence Plate Character Recognition","authors":"Hua Xu, Zheng Ma","doi":"10.1109/ICCSIT.2008.68","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.68","url":null,"abstract":"An approach of vehicle license plate recognition (VLPR) based on Gabor filter is presented in this paper. The parameters of Gabor filter are different from most traditional ways in the field. The novel way enables us to concisely model the statistical dependencies, and achieve a more reliable and local model using blocks. Firstly, the accurate position of license plate must be extracted from the original image, and each character must be segmented from the segmented license plate. Then, we propose a new simple and fast way, which based on many traditional algorithms of biology recognition, to design these parameters of Gabor filter. Be detected by Gabor filters, the features of each to-test character are represented as a set of the corresponding coefficients. The last step is to classify these to-test characters by the Euclidean distance between the coefficient vectors of the to-test characters and templates. Experiments are conducted on 120 images taken from various illumination situations and experimental results show that the approach is feasible and applicable.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"73 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":"116180534","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 Study on the Mining Algorithm of Fast Association Rules for the XML Data","authors":"Gongxin Wu","doi":"10.1109/ICCSIT.2008.89","DOIUrl":"https://doi.org/10.1109/ICCSIT.2008.89","url":null,"abstract":"It presents an efficient mining algorithm FreqtTree for discovering all frequent patterns from XML data, and then considers mining global frequent patterns from XML data in distributed environment in this paper. First of all, the XML files are transferred to DOM tree, and then it mines all the frequent patterns from the DOM tree. It's a high efficient algorithm because it adopts the right extension technology and scans the DOM tree only one time. After that, it describes the distributed association rule data mining algorithm DFreqtTree based on DOM tree. At last, this algorithm is implemented and analyzed by Java language.","PeriodicalId":109229,"journal":{"name":"2008 International Conference on Computer Science and Information Technology","volume":"30 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":"114915064","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}