{"title":"A PSO Algorithm with the Improved Diversity for Feedforward Neural Networks","authors":"Tong-Yue Gu, Shiguang Ju, Fei Han","doi":"10.1109/IITSI.2009.34","DOIUrl":"https://doi.org/10.1109/IITSI.2009.34","url":null,"abstract":"In this paper, an improved particle swarm optimization (PSO) with the improved diversity is proposed to train feedforward neural networks (FNN). In this algorithm, first, the PSO algorithm is used to train the FNN. Second, when the particle swarm is trapped into local minima or loses its diversity, each particle in the swarm and its best position (Pb) are interrupted by a random function in order to improve the diversity of population, and the best position (Pg¬) of all particles remains unchanged. Third, the PSO algorithm with the new population is used to search the better global optimum. The proposed algorithm improves the diversity of the swarm and has good convergence performance. Finally, the experimental results are given to verify the efficiency and effectiveness of our proposed learning algorithm.","PeriodicalId":308774,"journal":{"name":"2009 Second International Symposium on Intelligent Information Technology and Security Informatics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124374211","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":"Fuzzy Comprehensive Evaluation Model Based on SVM","authors":"Sidong Xian","doi":"10.1109/IITSI.2009.28","DOIUrl":"https://doi.org/10.1109/IITSI.2009.28","url":null,"abstract":"The fuzzy comprehensive evaluation has the extensive application both in theory and practice, how to reasonably quantify the weights of different evaluation indexes in the fuzzy system is the key problem of it. In this text , a new method namely supper vector machine fuzzy comprehensive evaluation(SVM-FCEM),which can be to calculate the weight of the elements by the method of SVM structuring classification, is established, based on introducing the theory of SVM in briefly. the application shows that this method is stable, and the calculation result is objective.","PeriodicalId":308774,"journal":{"name":"2009 Second International Symposium on Intelligent Information Technology and Security Informatics","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122644077","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 Rapid Acquisition Algorithm of WSN-aided GPS Location","authors":"Weizheng Ren","doi":"10.1109/IITSI.2009.16","DOIUrl":"https://doi.org/10.1109/IITSI.2009.16","url":null,"abstract":"Traditional global positioning system (GPS) is not suitable for indoor location environments. A wireless sensor network (WSN)-aided GPS location algorithm is put forward in this paper in order to realize seamless connection between indoor and outdoor locations and shorten search and acquisition time of GPS signal. The algorithm utilizes auxiliary location information obtained from GPS reference station by the WSN to determine the range of satellites available and realize the rapid acquisition of GPS signal. Simulation results show that GPS signal acquisition time is significantly decreased compared with that based on the traditional GPS.","PeriodicalId":308774,"journal":{"name":"2009 Second International Symposium on Intelligent Information Technology and Security Informatics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131583589","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 Web Services-based Meat-production Track and Traceability System","authors":"Shougang Ren, Huanliang Xu, Guanghong Zhou","doi":"10.1109/IITSI.2009.12","DOIUrl":"https://doi.org/10.1109/IITSI.2009.12","url":null,"abstract":"The Web services-based meat track & traceability system is divided into three phases based on the flowing process of meat production: growing of livestock, butchering and processing of meat and marketing of finished product. Based on the contents and mode of information, it includes track and traceability within certain phase and that between phases. Tracking within a certain phase is to determine the business key points by analysis of meat production process and identify them by 1-d and 2-d mixed bar code and layer data identification method. While traceability is to embed the 1-d bar code of various business key points into the 2-d code to cover the whole production lifecycle backwardly. The track and traceability between phases is to realize the seamless connection and information sharing of physically-distributed and formally-isomerous meat product data based on the Web services technology, so that the user can operate logically on an integrated interface. On such base, an evolvable track and traceability system applicable to meat production is designed and realized.","PeriodicalId":308774,"journal":{"name":"2009 Second International Symposium on Intelligent Information Technology and Security Informatics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130781948","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":"On an Open Problem of C. C. Chen","authors":"Kun-lun Zhang, Dong-Hai Li","doi":"10.1109/IITSI.2009.33","DOIUrl":"https://doi.org/10.1109/IITSI.2009.33","url":null,"abstract":"This paper investigates the length of sublattice-lattice of finite distributive lattice. The following result is proved. For finite distributive lattices L and K$, then l_*(Sub(Ltimes K)) = l_*(Sub(L)) + l_*(Sub(K)). Therefore, we have solved the Problem 1 of C.C.Chen in [1].","PeriodicalId":308774,"journal":{"name":"2009 Second International Symposium on Intelligent Information Technology and Security Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130668575","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}
Zheng-wei Hu, Dong-xing Duan, Zhi-yuan Xie, Xing Yang
{"title":"Pipeline Design of Transformation between Floating Point Numbers Based on IEEE754 Standard and 32-bit Integer Numbers","authors":"Zheng-wei Hu, Dong-xing Duan, Zhi-yuan Xie, Xing Yang","doi":"10.1109/IITSI.2009.27","DOIUrl":"https://doi.org/10.1109/IITSI.2009.27","url":null,"abstract":"A pipeline design method for transformation between floating point numbers based on IEEE754 standard and 32-bit integer numbers was proposed. There are two kinds of pipelines. One is for double-precision or single-precision floating point numbers transform into integer numbers and other is for integer numbers transform into double precision or single-precision floating point numbers. In this method hardware cost was reduced through double-precision floating point numbers and single-precision floating point numbers sharing one data path. Shifting and rounding was simplified through setting the initial value of exponent. Special numbers were also discussed and corresponding signals were defined in this method. The leading zero detection method for this method was described and a leading zero detection unit for 32-bit numbers was designed. A module of the pipeline design method proposed in this paper was designed with VHDL and EP2C35F484C6 is the target device of implementation. The source utilization and maximum frequency of this module were estimated. The simulation results were discussed. The quality of this method was confirmed by these results.","PeriodicalId":308774,"journal":{"name":"2009 Second International Symposium on Intelligent Information Technology and Security Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129580000","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":"Performance Evaluation on Uniform Interactive Markov Chains","authors":"Xiying Zhao","doi":"10.1109/IITSI.2009.41","DOIUrl":"https://doi.org/10.1109/IITSI.2009.41","url":null,"abstract":"The models we considered in this paper are uniformed nondeterminism interactive Markov chains (IMCs). To give the performance specification of IMCs, we first give an algorithm to compute the optimize path probability to reach a set of goal states within a given time bound on an IMC MD, which describing until operator. Using an action-based logic called aCSL the properties of interesting over the IMCs models are described. The correctness of our describing method is proved. It is an extension of performance evaluation pure continue-time Markov chains.","PeriodicalId":308774,"journal":{"name":"2009 Second International Symposium on Intelligent Information Technology and Security Informatics","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114673046","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 Soft Handover Mechanism Using DCHs in High-Speed Downlink Packet Access Networks","authors":"TaeHoon Lee, Sunghoon Seo, Joo-Seok Song","doi":"10.1109/IITSI.2009.42","DOIUrl":"https://doi.org/10.1109/IITSI.2009.42","url":null,"abstract":"In 3GPP (Third Generation Partnership Project) Release5 (R5), HSDPA (High-Speed Downlink Packet Access) has been standardized to enhance the data rate of downlink packet transmission on top of WCDMA (Wideband CodeDivision Multiple Access) network. Even HSDPA supports up to 10 Mbps data rate through HS-DSCHs (High Speed-Downlink Shared Channels), an UE (User Equipment) suffers from significant handover latency since HSDPA standard does not supporting soft handover. Therefore, in this paper, we propose a new soft handover mechanism for HSDPA to reduce the handover latency by utilizing DCH (DedicatedChannel) instead of HS-DSCH. Simulation results show that the proposed soft handover mechanism reduces the packet IAT (Inter Arrival Time) less than 15 msec while HSDPA’s hard handover suffers from 190 msec packet IAT. It means that the proposed mechanism guarantees the minimum packet IAT requirement of the typical VoIP service in 20 msec. Furthermore, the proposed mechanism employees no service disruption for the data connection while an UE performs the soft handover procedure.","PeriodicalId":308774,"journal":{"name":"2009 Second International Symposium on Intelligent Information Technology and Security Informatics","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123554207","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}