Pub Date : 2009-12-28DOI: 10.1109/ICACIA.2009.5361067
Xintian Liu, Huanguo Hu, Yi Yang, Lihui Zhao, Changhong Liu, Hui Guo, Yansong Wang
McPherson Suspension is researched with multi-body dynamics and Suspension Kinematics theory. When the front rubber bushing stiffness of lower control arm is changed, the suspension performance is analyzed and discussed in the vertical bounce, roll bounce, brake force and drive force. The conclusion is drawn that stiffness of front rubber bushing in all directions has no effect on the suspension performance in the vertical bounce and roll bounce. In the brake force and drive force radical stiffness of rubber bushing has heavy effect on the suspension performance and axial and torsion stiffness of rubber bushing has a little effect on the suspension performance.
{"title":"Performance analysis of front rubber bushing stiffness of lower control arm on McPherson Suspension","authors":"Xintian Liu, Huanguo Hu, Yi Yang, Lihui Zhao, Changhong Liu, Hui Guo, Yansong Wang","doi":"10.1109/ICACIA.2009.5361067","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361067","url":null,"abstract":"McPherson Suspension is researched with multi-body dynamics and Suspension Kinematics theory. When the front rubber bushing stiffness of lower control arm is changed, the suspension performance is analyzed and discussed in the vertical bounce, roll bounce, brake force and drive force. The conclusion is drawn that stiffness of front rubber bushing in all directions has no effect on the suspension performance in the vertical bounce and roll bounce. In the brake force and drive force radical stiffness of rubber bushing has heavy effect on the suspension performance and axial and torsion stiffness of rubber bushing has a little effect on the suspension performance.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"51 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":"121575913","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.5361119
Ling Wang, Yun Liu, Q. Peng
In this paper we consider the problem of detecting of primary users (PU) including transmitter and receiver in cognitive radio (CR) networks. In ordinary situation, it is difficult to detect whether the primary receiver exists even where the receiver is. In this work we propose a novel system design combined with CR mobile station and base station to cooperatively detect the location of primary transmitter and to estimate the protection region of primary receiver. The path loss model then is applied to calculate the protection region. Finally, simulation results are presented for the given path loss parameter and noise fluctuate.
{"title":"Cooperative detecting primary users by mobile and base station in cognitive radio networks","authors":"Ling Wang, Yun Liu, Q. Peng","doi":"10.1109/ICACIA.2009.5361119","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361119","url":null,"abstract":"In this paper we consider the problem of detecting of primary users (PU) including transmitter and receiver in cognitive radio (CR) networks. In ordinary situation, it is difficult to detect whether the primary receiver exists even where the receiver is. In this work we propose a novel system design combined with CR mobile station and base station to cooperatively detect the location of primary transmitter and to estimate the protection region of primary receiver. The path loss model then is applied to calculate the protection region. Finally, simulation results are presented for the given path loss parameter and noise fluctuate.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"6 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":"121879314","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.5361066
Xiu-Jun Geng, Xiao-Junlu
PCI Local bus is a widely used high-speed bus protocol and PnP(plug and play) supported. This paper presents a implementation method of PCI Expansion ROM which is based on a Raid disk controller card. A debug method is given, and some notes in this implementation are discussed.
{"title":"The implementation of PCI Expansion ROM for raid controller card","authors":"Xiu-Jun Geng, Xiao-Junlu","doi":"10.1109/ICACIA.2009.5361066","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361066","url":null,"abstract":"PCI Local bus is a widely used high-speed bus protocol and PnP(plug and play) supported. This paper presents a implementation method of PCI Expansion ROM which is based on a Raid disk controller card. A debug method is given, and some notes in this implementation are discussed.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"129 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":"127388566","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.5361159
Zhan Su, Yuanming Wu
ESRT protocol is a transport solution that seeks to achieve reliable event detection solution with minimum energy expenditure and congestion resolution. Depending on the current network state, it configures the reporting frequency rate f for the next time interval. Due to the dynamic properties of the networks, the adjustment always has a delay. A prediction-based ESRT (PBESRT) protocol is presented to improve the performance of the networks. It can predict the flow rate of the next time interval, and then adjust the reporting frequency rate f. The performance of prediction-based ESRT protocol depends on the accuracy of predictors. It has been proved that FARIMA model is an effective method in network traffic prediction. Simulation compared PBESRT with the original ESRT. Then the performance of each protocol is studied at deferent Hurst parameters value. The result shows that PBESRT converges to state OOR with less time intervals, starting from some special states. More importantly, the network with PBESRT protocol runs more time intervals at state OOR. As the Hurst parameter increasing, the OOR rate of each protocol increases, the improvement PBESRT to ESRT decreases yet.
{"title":"PBESRT: Prediction-based Event-to-Sink Reliable transport in WSN","authors":"Zhan Su, Yuanming Wu","doi":"10.1109/ICACIA.2009.5361159","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361159","url":null,"abstract":"ESRT protocol is a transport solution that seeks to achieve reliable event detection solution with minimum energy expenditure and congestion resolution. Depending on the current network state, it configures the reporting frequency rate f for the next time interval. Due to the dynamic properties of the networks, the adjustment always has a delay. A prediction-based ESRT (PBESRT) protocol is presented to improve the performance of the networks. It can predict the flow rate of the next time interval, and then adjust the reporting frequency rate f. The performance of prediction-based ESRT protocol depends on the accuracy of predictors. It has been proved that FARIMA model is an effective method in network traffic prediction. Simulation compared PBESRT with the original ESRT. Then the performance of each protocol is studied at deferent Hurst parameters value. The result shows that PBESRT converges to state OOR with less time intervals, starting from some special states. More importantly, the network with PBESRT protocol runs more time intervals at state OOR. As the Hurst parameter increasing, the OOR rate of each protocol increases, the improvement PBESRT to ESRT decreases yet.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"4 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":"122245728","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.5361107
Jie Hao, Yu-jie Hao, Jiayu Chang, Jianping Li
Along with the development of Internet/Intranet application, more and more sensitive data is transmitted through the network. In order to prevent the critical data from being divulged and guarantee the security of information, we should pay more attention to the surveillance of network traffic. With this motivation, we present an efficient TCP flow reassembling algorithm which is the key of dataflow processing. Through this method, it is possible to get a whole idea of every TCP flow and providing a good reference to judgment. Testing of a prototype based on PF_RING demonstrated that our mechanism take a good performance in linux kernel 2.6.28.
{"title":"An efficient tcp flow reassembling algorithm based on PF_RING","authors":"Jie Hao, Yu-jie Hao, Jiayu Chang, Jianping Li","doi":"10.1109/ICACIA.2009.5361107","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361107","url":null,"abstract":"Along with the development of Internet/Intranet application, more and more sensitive data is transmitted through the network. In order to prevent the critical data from being divulged and guarantee the security of information, we should pay more attention to the surveillance of network traffic. With this motivation, we present an efficient TCP flow reassembling algorithm which is the key of dataflow processing. Through this method, it is possible to get a whole idea of every TCP flow and providing a good reference to judgment. Testing of a prototype based on PF_RING demonstrated that our mechanism take a good performance in linux kernel 2.6.28.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"87 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":"127581996","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.5361116
Ting-Hong Yang, Yi-Chuan Wang, Peng-Fei Xu, Chunlin Wang
We investigate the problem of family energy consumption in the process of replacing landline phones with cell phones. We found that cell phones consume much less energy than landline phones. We adopted U.S as our study samples. We applied Gompertz function to predict the cell phone diffusion trend in the U.S and hence simulate energy consumption by family phones during this process. Our results indicate that the transition stage will end at 2011, while energy consumption by phones declines monotonously during this period.
{"title":"The diffusion of cellphone and landline phone","authors":"Ting-Hong Yang, Yi-Chuan Wang, Peng-Fei Xu, Chunlin Wang","doi":"10.1109/ICACIA.2009.5361116","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361116","url":null,"abstract":"We investigate the problem of family energy consumption in the process of replacing landline phones with cell phones. We found that cell phones consume much less energy than landline phones. We adopted U.S as our study samples. We applied Gompertz function to predict the cell phone diffusion trend in the U.S and hence simulate energy consumption by family phones during this process. Our results indicate that the transition stage will end at 2011, while energy consumption by phones declines monotonously during this period.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"18 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":"128117312","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.5361094
Yang Yang, Jinlong Wang, Qi-hui Wu
The SINR balancing problem involving joint beamforming and power control is considered in the cognitive radio network, wherein the single-input multi-output multiple access channels are assumed. Subject to two sets of constraints: the interference temperature constraints of primary users and the peak transmission power constraints of cognitive users, a low-complexity joint beamforming and power control algorithm called semi-decoupled multi-constraint power allocation with constraints preselection (SDMCPA-CP) for SINR balancing is proposed. Compared with the existing algorithm, the proposed SDMCPA-CP can reduce the number of matrix inversions and matrix eigenvalue decompositions significantly, while still provide the optimal balanced SINR level for all the cognitive users. In addition, based on SDMCPA-CP, a two-phase search (TPS) algorithm for the number of antenna is further presented. With TPS algorithm, the minimal number of antenna which satisfies the above two sets of constraints as well as the QoS requirements of all the CUs could be found fast.
{"title":"Low-complexity joint beamforming and power control for SINR balancing and number of antenna considerations in cognitive radio","authors":"Yang Yang, Jinlong Wang, Qi-hui Wu","doi":"10.1109/ICACIA.2009.5361094","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361094","url":null,"abstract":"The SINR balancing problem involving joint beamforming and power control is considered in the cognitive radio network, wherein the single-input multi-output multiple access channels are assumed. Subject to two sets of constraints: the interference temperature constraints of primary users and the peak transmission power constraints of cognitive users, a low-complexity joint beamforming and power control algorithm called semi-decoupled multi-constraint power allocation with constraints preselection (SDMCPA-CP) for SINR balancing is proposed. Compared with the existing algorithm, the proposed SDMCPA-CP can reduce the number of matrix inversions and matrix eigenvalue decompositions significantly, while still provide the optimal balanced SINR level for all the cognitive users. In addition, based on SDMCPA-CP, a two-phase search (TPS) algorithm for the number of antenna is further presented. With TPS algorithm, the minimal number of antenna which satisfies the above two sets of constraints as well as the QoS requirements of all the CUs could be found fast.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"24 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":"133378040","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.5361129
Ming-yan Chen, Wei Li
Characters analysis for space target is the basis of target modeling. Here I analyzed the precession characters of axis-symmetry and non-axis-symmetry targets in midcourse, gave some simple models and computational formulas on precession parameter for targets such as true warhead, bait with same profile, metallic air balloon, space fragment and mother cabin. It has more significance on modeling and simulation for characters of targets in midcourse.
{"title":"Precession character study of space target in midcourse","authors":"Ming-yan Chen, Wei Li","doi":"10.1109/ICACIA.2009.5361129","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361129","url":null,"abstract":"Characters analysis for space target is the basis of target modeling. Here I analyzed the precession characters of axis-symmetry and non-axis-symmetry targets in midcourse, gave some simple models and computational formulas on precession parameter for targets such as true warhead, bait with same profile, metallic air balloon, space fragment and mother cabin. It has more significance on modeling and simulation for characters of targets in midcourse.","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":"131887966","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.5361093
Qinghui Zeng, Juan Yang, Zhixing Huang
As the most important component of pervasive computing, context-aware system gets more and more attention from the researchers. One of the basic technologies used to implement the contexts' description and reasoning in context-aware systems is ontology which has the big advantage at knowledge presenting and sharing. However, the shortage of the existent methods with ontology is obvious that most of them are predefined which makes them too fixed to provide the flexible services. In this paper, a Distributed Active Service Providing System (DASPS) is proposed to provide more accurate and more proper services to the end users in an active manner through ontology based contexts' similarity comparison. Moreover, a semantic-adaptive service choosing machine (Sasrc_Ma) is used in DASPS to improve the accuracy of the contexts' similarity which can dynamically adjust its computing result to satisfy the real situation of the users by considering the forwarding feedbacks of users. An effective negotiating mechanism is used to solve the conflicts occurred in this distributed application when dealing with the concurrent transactions.
{"title":"To intelligently serve users with Distributed Active Service Providing System","authors":"Qinghui Zeng, Juan Yang, Zhixing Huang","doi":"10.1109/ICACIA.2009.5361093","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361093","url":null,"abstract":"As the most important component of pervasive computing, context-aware system gets more and more attention from the researchers. One of the basic technologies used to implement the contexts' description and reasoning in context-aware systems is ontology which has the big advantage at knowledge presenting and sharing. However, the shortage of the existent methods with ontology is obvious that most of them are predefined which makes them too fixed to provide the flexible services. In this paper, a Distributed Active Service Providing System (DASPS) is proposed to provide more accurate and more proper services to the end users in an active manner through ontology based contexts' similarity comparison. Moreover, a semantic-adaptive service choosing machine (Sasrc_Ma) is used in DASPS to improve the accuracy of the contexts' similarity which can dynamically adjust its computing result to satisfy the real situation of the users by considering the forwarding feedbacks of users. An effective negotiating mechanism is used to solve the conflicts occurred in this distributed application when dealing with the concurrent transactions.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"35 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":"133287166","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.5361118
Ze-Gui Ying, Wei Ren, Jianping Li
Communication network has been shown as a key factor to influence system performance even under the same coordination algorithm. Although many distributed algorithm designs have been proved to be feasible to make up some functions in the large scale networks as claimed, for example, recovering the network from link failure or node failure, the efficiency of recovery in different network topologies based on social networks has never been tested. In this paper, we have made an initial effort to find how network topologies influence a standard network recovery policy, such as MPLS algorithm. Those interesting discoveries are helpful to predict the performance of network recovery and in turn to be useful for optimizing recovery mechanism.
{"title":"Effects of topologies on network recovery","authors":"Ze-Gui Ying, Wei Ren, Jianping Li","doi":"10.1109/ICACIA.2009.5361118","DOIUrl":"https://doi.org/10.1109/ICACIA.2009.5361118","url":null,"abstract":"Communication network has been shown as a key factor to influence system performance even under the same coordination algorithm. Although many distributed algorithm designs have been proved to be feasible to make up some functions in the large scale networks as claimed, for example, recovering the network from link failure or node failure, the efficiency of recovery in different network topologies based on social networks has never been tested. In this paper, we have made an initial effort to find how network topologies influence a standard network recovery policy, such as MPLS algorithm. Those interesting discoveries are helpful to predict the performance of network recovery and in turn to be useful for optimizing recovery mechanism.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"30 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":"130617694","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
扫码关注我们
求助内容：
应助结果提醒方式：