Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361151
D. Qiu, De-jiang Zhang, W. You, Niaona Zhang, Hui Li
Radial Basis Function (RBF) neural network is used to predict the blast furnace hot metal based on its characteristics such as fast convergence and global optimization. As hot metal silicon content had close relationship with furnace temperature, the change of temperature in furnace was reflected indirectly by hot metal silicon content. Newrbe function in Matlab was applied for function approximation. Normalized data of normal production for a long period was used for training and simulation. The results showed that the hitting rate of prediction for silicon content was improved. The application of RBF neural network prediction model in blast furnace could forecast Si-content, judge the trend of temperature and realize the control of blast furnace temperature, which was advantageous to energy saving. Moreover, the model can monitor multi-objects simultaneously and provide guidance for blast furnace process
{"title":"AN application of prediction model in blast furnace hot metal silicon content based on neural network","authors":"D. Qiu, De-jiang Zhang, W. You, Niaona Zhang, Hui Li","doi":"10.1109/ICACIA.2009.5361151","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361151","url":null,"abstract":"Radial Basis Function (RBF) neural network is used to predict the blast furnace hot metal based on its characteristics such as fast convergence and global optimization. As hot metal silicon content had close relationship with furnace temperature, the change of temperature in furnace was reflected indirectly by hot metal silicon content. Newrbe function in Matlab was applied for function approximation. Normalized data of normal production for a long period was used for training and simulation. The results showed that the hitting rate of prediction for silicon content was improved. The application of RBF neural network prediction model in blast furnace could forecast Si-content, judge the trend of temperature and realize the control of blast furnace temperature, which was advantageous to energy saving. Moreover, the model can monitor multi-objects simultaneously and provide guidance for blast furnace process","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129248710","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}
Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361121
Zhi-yong Zhang, Guangming Hu
Knowledge of topology in wireless sensor networks is significant for networkmanagement _and maintenance. In this paper, a conditional probability of data loss theorem is proposedfor wireless sensor networks based on the data aggregation paradigm.al probability of data loss therem iIt reveals the relationship between conditional probabilities of sensor data loss given different conditions. Based on this theorem, we propose a novel algorithm to infer topologies of sensor networks using end-to-end loss measurements. The algorithm does not incur any additional burden toon the network. A large number of networks are simulated in different scenarios with NS-2. The results show that our proposed algorithm can identify more than 95% of topologies within a small data collection rounds.
{"title":"Data aggregation based topology inference for wireless sensor networks","authors":"Zhi-yong Zhang, Guangming Hu","doi":"10.1109/ICACIA.2009.5361121","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361121","url":null,"abstract":"Knowledge of topology in wireless sensor networks is significant for networkmanagement _and maintenance. In this paper, a conditional probability of data loss theorem is proposedfor wireless sensor networks based on the data aggregation paradigm.al probability of data loss therem iIt reveals the relationship between conditional probabilities of sensor data loss given different conditions. Based on this theorem, we propose a novel algorithm to infer topologies of sensor networks using end-to-end loss measurements. The algorithm does not incur any additional burden toon the network. A large number of networks are simulated in different scenarios with NS-2. The results show that our proposed algorithm can identify more than 95% of topologies within a small data collection rounds.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131360788","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}
Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361163
Zhanghong Hao, You-xi Tang, Jin-Xiang Xia
In this paper, we develop a distributed cooperative spectrum sensing algorithm based on network code to decrease the need for bandwidth in cognitive radios. The model of the distributed cooperative spectrum sensing is analyzed, and the algorithm of distributed scheme based on network code is described. The simulation results show that compared with the distributed scheme without network code and the non-cooperative one, the throughput of secondary users is increased apparently, and also, the probability of detection of the distributed scheme with network code is improved about 10% and 20%, respectively, further, the optimal sensing time is shorter about 82% and 88%, respectively.
{"title":"A distributed cooperative spectrum sensing based on network code in cognitive radios","authors":"Zhanghong Hao, You-xi Tang, Jin-Xiang Xia","doi":"10.1109/ICACIA.2009.5361163","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361163","url":null,"abstract":"In this paper, we develop a distributed cooperative spectrum sensing algorithm based on network code to decrease the need for bandwidth in cognitive radios. The model of the distributed cooperative spectrum sensing is analyzed, and the algorithm of distributed scheme based on network code is described. The simulation results show that compared with the distributed scheme without network code and the non-cooperative one, the throughput of secondary users is increased apparently, and also, the probability of detection of the distributed scheme with network code is improved about 10% and 20%, respectively, further, the optimal sensing time is shorter about 82% and 88%, respectively.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121788317","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}
Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361072
Zheng Qiao, Hu Wei-dong, Liu Li
In the field of embedded wireless data communication system, such as remote measurement and control, wireless meter reading, information appliances, wireless mouse or keyboard, it usually needs to design a small custom protocol to directly access the hardware. To solve this problem, designed an embedded wireless data communication protocol, Using special data frame format to solve unreliable data link problem, Using roll-call polling methods to achieve multi-point access, Using UART to achieve transceiver between MCU and RF chip, Using stop-waiting protocol to achieve the flow and error control.
{"title":"An embedded short-range wireless data communication protocol design","authors":"Zheng Qiao, Hu Wei-dong, Liu Li","doi":"10.1109/ICACIA.2009.5361072","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361072","url":null,"abstract":"In the field of embedded wireless data communication system, such as remote measurement and control, wireless meter reading, information appliances, wireless mouse or keyboard, it usually needs to design a small custom protocol to directly access the hardware. To solve this problem, designed an embedded wireless data communication protocol, Using special data frame format to solve unreliable data link problem, Using roll-call polling methods to achieve multi-point access, Using UART to achieve transceiver between MCU and RF chip, Using stop-waiting protocol to achieve the flow and error control.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115987719","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}
Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361152
Desong Wang, Jianping Li
Recently, Khan et al. proposed an efficient and practical chaotic hash-based fingerprint biometric remote user authentication scheme on mobile devices. Unfortunately, Yoon-Yoo demonstrated that Khan et al.'s scheme was vulnerable to a privileged insider attack and an impersonation attack by using lost or stolen mobile devices. To isolate such problems, Yoon-Yoo proposed an improvement to Khan et al.'s scheme. However, the two authentication schemes required synchronized clocks between the user and the remote system server because of using timestamps in authentication process. Actually, it is fairly complicated to achieve time concurrency mechanism; and network environment and transmission delay is unpredictable, so some drawbacks exist in their scheme. To overcome those weaknesses, a new fingerprint-based remote user authentication scheme using mobile devices is proposed. The proposed scheme can safely achieve mutual authentication between the users and the remote system. Compared with other related schemes, the proposed scheme not only is secure and efficient but also can provide good characteristics. Hence, our proposed scheme can be easily realized in the practical environment.
{"title":"A new fingerprint-based remote user authentication scheme using mobile devices","authors":"Desong Wang, Jianping Li","doi":"10.1109/ICACIA.2009.5361152","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361152","url":null,"abstract":"Recently, Khan et al. proposed an efficient and practical chaotic hash-based fingerprint biometric remote user authentication scheme on mobile devices. Unfortunately, Yoon-Yoo demonstrated that Khan et al.'s scheme was vulnerable to a privileged insider attack and an impersonation attack by using lost or stolen mobile devices. To isolate such problems, Yoon-Yoo proposed an improvement to Khan et al.'s scheme. However, the two authentication schemes required synchronized clocks between the user and the remote system server because of using timestamps in authentication process. Actually, it is fairly complicated to achieve time concurrency mechanism; and network environment and transmission delay is unpredictable, so some drawbacks exist in their scheme. To overcome those weaknesses, a new fingerprint-based remote user authentication scheme using mobile devices is proposed. The proposed scheme can safely achieve mutual authentication between the users and the remote system. Compared with other related schemes, the proposed scheme not only is secure and efficient but also can provide good characteristics. Hence, our proposed scheme can be easily realized in the practical environment.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127815420","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}
Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361103
Lei Ming, Li Ren, Zhao Di, Haipeng He
The topology mismatching is one of major factors that cause the low efficiency in P2P system and the consumption of large quantity of network bandwidth, while peer aggregation is a kind of practical way to make topology matching. This paper firstly introduces a multilevel marked system. According to the marked symbol, peers can progressively find theirs neighbor peers in a better way to achieve the goal of aggregation. Then we build a simulation environment to analyze its performance, the experimental results show that this method can implement peer aggregation rapidly and well adapt to the turbulence caused by peer failure.
{"title":"Peer aggregation using marks with dynamic and multilevel organization","authors":"Lei Ming, Li Ren, Zhao Di, Haipeng He","doi":"10.1109/ICACIA.2009.5361103","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361103","url":null,"abstract":"The topology mismatching is one of major factors that cause the low efficiency in P2P system and the consumption of large quantity of network bandwidth, while peer aggregation is a kind of practical way to make topology matching. This paper firstly introduces a multilevel marked system. According to the marked symbol, peers can progressively find theirs neighbor peers in a better way to achieve the goal of aggregation. Then we build a simulation environment to analyze its performance, the experimental results show that this method can implement peer aggregation rapidly and well adapt to the turbulence caused by peer failure.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121571885","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}
Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361120
Xiao-tian Xiang, Qi-hui Wu
Traffic driven based load balancing routing scheme in CogMesh network is proposed. SMC (secondary mesh client) accessing to CMR (cognitive mesh router) using Ad Hoc way is considered in the paper. A novel routing metric was proposed to describe the load state of a path, which was suitable for traffic demand. Choosing a light-loaded route and a light-loaded link guarantees a lower end-to-end delay time and a higher data rate with the consideration of different traffic demand. From the simulation, a significant improvement of end-to-end delay and data rate were got compared with OPTIMAL[9] and DORP[10], which are constraint with end-to-end delay.
{"title":"Traffic driven based load balancing routing scheme in CogMesh network","authors":"Xiao-tian Xiang, Qi-hui Wu","doi":"10.1109/ICACIA.2009.5361120","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361120","url":null,"abstract":"Traffic driven based load balancing routing scheme in CogMesh network is proposed. SMC (secondary mesh client) accessing to CMR (cognitive mesh router) using Ad Hoc way is considered in the paper. A novel routing metric was proposed to describe the load state of a path, which was suitable for traffic demand. Choosing a light-loaded route and a light-loaded link guarantees a lower end-to-end delay time and a higher data rate with the consideration of different traffic demand. From the simulation, a significant improvement of end-to-end delay and data rate were got compared with OPTIMAL[9] and DORP[10], which are constraint with end-to-end delay.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130643674","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}
Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361102
Yuan Tang, Jian-ping Li
The potential of wide-area distributed computing systems has not been fully exploited. Resource virtualization gradually is used to promote its computing performance. However, the existing of NAT in networks hinders the communication among distributed systems. This paper argues a structure to solve the obscured connectivity problems with combining virtual machines and virtual networks, and presents an idea of overlay structure, which overcomes the NAT limitation in distributed systems. The overlay structure can support a number of links among guest operating systems in virtual machines, even if the virtual machine monitor is configured as NAT network.
{"title":"Towards overlay network in virtual computing environment","authors":"Yuan Tang, Jian-ping Li","doi":"10.1109/ICACIA.2009.5361102","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361102","url":null,"abstract":"The potential of wide-area distributed computing systems has not been fully exploited. Resource virtualization gradually is used to promote its computing performance. However, the existing of NAT in networks hinders the communication among distributed systems. This paper argues a structure to solve the obscured connectivity problems with combining virtual machines and virtual networks, and presents an idea of overlay structure, which overcomes the NAT limitation in distributed systems. The overlay structure can support a number of links among guest operating systems in virtual machines, even if the virtual machine monitor is configured as NAT network.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124402304","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}
Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361164
Yanguo Zhang, Xiao-Jun Lu
The consistent proof of operation in finite field is presented by studying mathematical operations in Galois Field(28) and comparing Rijndael algorithm with Reed-Solomon algorithm in this paper. The explanation for various operations is given from the perspective of polynomial multiply, especially paying more attention to multiplication operation. Through analysis of mathematical operations, author proves that the basic operations for different implementation approaches in Galois Field(28) are consistent essentially.
{"title":"The operation consistency study for Rijndael algorithm and reed-solonmon algorithm in Galois Field(28)","authors":"Yanguo Zhang, Xiao-Jun Lu","doi":"10.1109/ICACIA.2009.5361164","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361164","url":null,"abstract":"The consistent proof of operation in finite field is presented by studying mathematical operations in Galois Field(28) and comparing Rijndael algorithm with Reed-Solomon algorithm in this paper. The explanation for various operations is given from the perspective of polynomial multiply, especially paying more attention to multiplication operation. Through analysis of mathematical operations, author proves that the basic operations for different implementation approaches in Galois Field(28) are consistent essentially.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121277351","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}
Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361083
Jiuhe Zhong, Yi-De Zhang
Speech analysis and synthesis is an important technology in the audio processing. In this paper, a modified speech analysis and synthesis system is proposed. It adopts more abundant excitation signal which include smooth part and compensation impulse. The smooth part is the envelope curve of unvoiced sounds and the compensation impulse is represented by the peaks during pitch period. Compared with the single impulse that repeats with pitch period and the pure white noise, these signals can reflect the tone changes and characters in the period of original speech more accurately. And they make it possible for modified system to synthesize high quality speech by employing less order filter. The experimental result indicates that the modified system has advance in both speech quality and intelligibility without increasing much in code rate. For most speech, it has a good effect on recovery.
{"title":"A modified speech analysis&synthesis system","authors":"Jiuhe Zhong, Yi-De Zhang","doi":"10.1109/ICACIA.2009.5361083","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361083","url":null,"abstract":"Speech analysis and synthesis is an important technology in the audio processing. In this paper, a modified speech analysis and synthesis system is proposed. It adopts more abundant excitation signal which include smooth part and compensation impulse. The smooth part is the envelope curve of unvoiced sounds and the compensation impulse is represented by the peaks during pitch period. Compared with the single impulse that repeats with pitch period and the pure white noise, these signals can reflect the tone changes and characters in the period of original speech more accurately. And they make it possible for modified system to synthesize high quality speech by employing less order filter. The experimental result indicates that the modified system has advance in both speech quality and intelligibility without increasing much in code rate. For most speech, it has a good effect on recovery.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129227984","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：