This paper built the forecasting model that can predict the temperature, pressure and flow along natural gas pipeline according to pipe flow equations. Improved Euler method is used to solve these equations. The changes of gas velocity and temperature along pipeline are included to improve the accuracy and precision of the simulation. A MATLAB program has been developed to implement the algorithm. Comparisons between this program and the professional gas pipeline simulation software show that the proposed algorithm in this paper has higher accuracy.
{"title":"Steady-State Model and Its Application in Natural Gas during Transportation in Pipeline","authors":"Yan Hongdong, You Yun","doi":"10.1109/ICCIS.2012.291","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.291","url":null,"abstract":"This paper built the forecasting model that can predict the temperature, pressure and flow along natural gas pipeline according to pipe flow equations. Improved Euler method is used to solve these equations. The changes of gas velocity and temperature along pipeline are included to improve the accuracy and precision of the simulation. A MATLAB program has been developed to implement the algorithm. Comparisons between this program and the professional gas pipeline simulation software show that the proposed algorithm in this paper has higher accuracy.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132409637","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}
This paper describes and discusses the computational rationality of formal analysis on cryptographic protocols, which is based on the computational rationality theorem of formal encrypt on Abadi-Rowgaway. Analysis of group key distribution protocol shows that the theorem has strong analytical ability to the protocols alternative attacks. The paper presents formal methods on group key distribution protocols, and the formal definition of security in the computational method. Finally, it proves its rationality.
{"title":"Computational Rationality of Formal Analysis on Cryptographic Protocols","authors":"S. Liu, J. Ye","doi":"10.1109/ICCIS.2012.111","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.111","url":null,"abstract":"This paper describes and discusses the computational rationality of formal analysis on cryptographic protocols, which is based on the computational rationality theorem of formal encrypt on Abadi-Rowgaway. Analysis of group key distribution protocol shows that the theorem has strong analytical ability to the protocols alternative attacks. The paper presents formal methods on group key distribution protocols, and the formal definition of security in the computational method. Finally, it proves its rationality.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133693019","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}
In order to study the limitation of the amount of vehicles in Beijing and especially the impact of "Lottery" policy for controlling the car growth in Beijing, a mathematic model was built to simulate the current car growth in Beijing and compare the growth model with the Logistic growth model to see if it is effective to control the rapid growth of vehicles in Beijing by using these limitations and the new car policy. As a result, the model shows that the limitation of cars in Beijing as well as the "Lottery" policy in Beijing is effective ways to help slow down the fast growth of cars in Beijing. Moreover, based on the model in this paper, five suggestions to improve transport problems were given.
{"title":"A Study of the Impact of Limitation of the Amount of Vehicles in Beijing Based on Mathematic Modeling","authors":"Hao-min Zhang, Bo-ying Shi","doi":"10.1109/ICCIS.2012.49","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.49","url":null,"abstract":"In order to study the limitation of the amount of vehicles in Beijing and especially the impact of \"Lottery\" policy for controlling the car growth in Beijing, a mathematic model was built to simulate the current car growth in Beijing and compare the growth model with the Logistic growth model to see if it is effective to control the rapid growth of vehicles in Beijing by using these limitations and the new car policy. As a result, the model shows that the limitation of cars in Beijing as well as the \"Lottery\" policy in Beijing is effective ways to help slow down the fast growth of cars in Beijing. Moreover, based on the model in this paper, five suggestions to improve transport problems were given.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130405984","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}
Radio frequency identification (RFID) technology is a non-contact automatic identification technology. The basic principle of RFID is coupled with radio frequency signal and the spatial transmission characteristics. From object recognition to achieve automatic recognition, RFID has the advantages of being effective, diversity, high capacity, low cost, anti-pollution, penetrating and so on. However, current RFID authentication protocols cannot defend against DoS attack. This paper proposes Rapdos, a novel mutual authentication protocol, which is based on the use of symmetric encryption and dynamic update key to prevent the DoS attack. The experiment has validated that Rapdos has provided good security for RFID system, and can defeat location privacy attack, relay attack, eavesdropping attack, denial-of-service attack, and solve problems of RFID security privacy.
{"title":"Rapdos: A RFID Authentication Protocol for Defending against DoS","authors":"Zhao Wang, Xuesong Zhang, Zhong Chen","doi":"10.1109/ICCIS.2012.215","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.215","url":null,"abstract":"Radio frequency identification (RFID) technology is a non-contact automatic identification technology. The basic principle of RFID is coupled with radio frequency signal and the spatial transmission characteristics. From object recognition to achieve automatic recognition, RFID has the advantages of being effective, diversity, high capacity, low cost, anti-pollution, penetrating and so on. However, current RFID authentication protocols cannot defend against DoS attack. This paper proposes Rapdos, a novel mutual authentication protocol, which is based on the use of symmetric encryption and dynamic update key to prevent the DoS attack. The experiment has validated that Rapdos has provided good security for RFID system, and can defeat location privacy attack, relay attack, eavesdropping attack, denial-of-service attack, and solve problems of RFID security privacy.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116887973","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}
This paper deals with the approximate merging problem of two adjacent DP curves with different degrees by a single curve. We first transform the DP curves into the Bézier curves. Then, we merge Bézier curves. Finally, we transform the Bézier curve back into the DP curve. In the end of this paper, numerical examples are provided to demonstrate the validity and efficiency of our algorithms.
{"title":"Approximate Merging of a Pair of DP Curves","authors":"Huahui Cai, Yan Cheng","doi":"10.1109/ICCIS.2012.88","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.88","url":null,"abstract":"This paper deals with the approximate merging problem of two adjacent DP curves with different degrees by a single curve. We first transform the DP curves into the Bézier curves. Then, we merge Bézier curves. Finally, we transform the Bézier curve back into the DP curve. In the end of this paper, numerical examples are provided to demonstrate the validity and efficiency of our algorithms.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131189984","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}
Trust relationship and assessment are two challenges of constructing large scale trust network for web viral marketing applications. Because different customers have different needs and expectations in different aspects of the service and due to the customer's self-property, trading amount, trading time, trading evaluation and trading risk perception factors, etc. The trust assessment among customers is hard to measure and difficult to give accurate quantification. In order to solve the problem, in this paper, a customer trust network model based on the above factors and combined with cognitive theories and methods of e-Business is implemented and three strategies, customer occupation based construction strategy, customer domain based construction strategy and customer occupation and domain based construction strategy, are used for constructing trust network. During the construction process, the method of trust computation in each strategy is introduced. The Experiment results show that the model and these strategies can reduce the complexity of trust relationship and with guaranteed trust value as a premise, improve the coverage rate of trust network.
{"title":"Web Viral Marketing Based Construction Strategy of Customer Trust Network","authors":"Xiufeng Xia, Ying Li, Lihui Cong","doi":"10.1109/ICCIS.2012.363","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.363","url":null,"abstract":"Trust relationship and assessment are two challenges of constructing large scale trust network for web viral marketing applications. Because different customers have different needs and expectations in different aspects of the service and due to the customer's self-property, trading amount, trading time, trading evaluation and trading risk perception factors, etc. The trust assessment among customers is hard to measure and difficult to give accurate quantification. In order to solve the problem, in this paper, a customer trust network model based on the above factors and combined with cognitive theories and methods of e-Business is implemented and three strategies, customer occupation based construction strategy, customer domain based construction strategy and customer occupation and domain based construction strategy, are used for constructing trust network. During the construction process, the method of trust computation in each strategy is introduced. The Experiment results show that the model and these strategies can reduce the complexity of trust relationship and with guaranteed trust value as a premise, improve the coverage rate of trust network.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131411806","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}
The mechanism and rule of fluid flow through porous medium about multi-layer complex fault block oil reservoir's developing through benching-horizontal well is completed. On the basis of mathmatical model in transient period, this paper established a mathmatical model about benching-horizontal well which pass through multi-layer reservoirs unconnected reciprocally coupled with reservoir. We resoluted this model through Laplace transforming, Stehfest inverting and conjugate gradient method. Compared with the computational solution from saphir, this model is of high reliability. Through this model on a given fault block oil reservoir, we can compute the downhole-pressure and deliverability distribution in different producing periods. This model presented some theory basis for the study on reservoir engineer of multi-layer complex fault block oil reservoir's developing through benching-horizontal well.
{"title":"The Study on Mathmatical Model of Fluid Flow through Porous Medium about Multi-layer Fault Block Oil Reservoir Coupling with Benching-Horizontal Well","authors":"Pang Jin, Lei Guanglun, Zhang Liya, Tang Huijie","doi":"10.1109/ICCIS.2012.355","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.355","url":null,"abstract":"The mechanism and rule of fluid flow through porous medium about multi-layer complex fault block oil reservoir's developing through benching-horizontal well is completed. On the basis of mathmatical model in transient period, this paper established a mathmatical model about benching-horizontal well which pass through multi-layer reservoirs unconnected reciprocally coupled with reservoir. We resoluted this model through Laplace transforming, Stehfest inverting and conjugate gradient method. Compared with the computational solution from saphir, this model is of high reliability. Through this model on a given fault block oil reservoir, we can compute the downhole-pressure and deliverability distribution in different producing periods. This model presented some theory basis for the study on reservoir engineer of multi-layer complex fault block oil reservoir's developing through benching-horizontal well.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128419460","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}
Si-qing Sheng, Junsheng Li, Xin Wu, Lei Hou, L. Fan
As for the graphical modeling software of current domestic power system, it used mostly to be the stand-alone edition or based on C/S (client-server) mode. Compared with the B/S (browser/server) mode, there are some shortcomings in software installation, upgrade and maintenance. This paper aims at developing the graphical modeling software of power system, which is based on the B/S mode, making most use of the latest research result of on computer technology, web technology and Ajax technology. Then the software turns to be very suitable for power system's graphic modeling, meanwhile, it enable to greatly improve the designers' working efficiency, with and has some realistic and utilizing value.
{"title":"Design and Realization of the Graphic System of Power System Based on Browser/Server Model","authors":"Si-qing Sheng, Junsheng Li, Xin Wu, Lei Hou, L. Fan","doi":"10.1109/ICCIS.2012.123","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.123","url":null,"abstract":"As for the graphical modeling software of current domestic power system, it used mostly to be the stand-alone edition or based on C/S (client-server) mode. Compared with the B/S (browser/server) mode, there are some shortcomings in software installation, upgrade and maintenance. This paper aims at developing the graphical modeling software of power system, which is based on the B/S mode, making most use of the latest research result of on computer technology, web technology and Ajax technology. Then the software turns to be very suitable for power system's graphic modeling, meanwhile, it enable to greatly improve the designers' working efficiency, with and has some realistic and utilizing value.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134379827","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}
Traditional DBT system is hard to accelerate by introducing a customized processor core because the startup overhead is hard to eliminate. In this paper, we concentrate on how to choose a suitable layout of the DBT core in a dual-core system. We analyze the tradeoff between the frequency and the memory bandwidth of the DBT core through an analytical model, and simulated 4 different and usual layouts of dual-core DBT in experiments. Finally, the validation of our model is verified through experimental results: the dual-core DBT framework can sharply reduce the startup overhead and speedup the translation-execution process by about 12%. Moreover, we also found the relationship between the code expand rate and the communication overhead: the performance of a program with high code expand rate is not sensitive to the communication speed of the platform.
{"title":"Dual-Core Architecture for Dynamic Binary Translation System: Tradeoff between Frequency and Bandwidth","authors":"Xu Fan, Shen Li, W. Zhiying","doi":"10.1109/ICCIS.2012.133","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.133","url":null,"abstract":"Traditional DBT system is hard to accelerate by introducing a customized processor core because the startup overhead is hard to eliminate. In this paper, we concentrate on how to choose a suitable layout of the DBT core in a dual-core system. We analyze the tradeoff between the frequency and the memory bandwidth of the DBT core through an analytical model, and simulated 4 different and usual layouts of dual-core DBT in experiments. Finally, the validation of our model is verified through experimental results: the dual-core DBT framework can sharply reduce the startup overhead and speedup the translation-execution process by about 12%. Moreover, we also found the relationship between the code expand rate and the communication overhead: the performance of a program with high code expand rate is not sensitive to the communication speed of the platform.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134500156","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}
Solving of large sparse matrix linear equations is always the research focus of scientific and engineering calculation field. With the sparsity and symmetry characteristics of coefficient matrix, Compressed Sparse Row (CSR) is adopted in the storage of large sparse matrix linear equations. Under the condition of CSR, Symmetrica Successive Over Relaxations-Preconditioned Conjugate Gradient method (SSOR-PCG) is employed in the solution of large sparse matrix linear equations.
{"title":"Storage and Solving of Large Sparse Matrix Linear Equations","authors":"Chao Liu, Junmin Ye, Yining Ma","doi":"10.1109/ICCIS.2012.293","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.293","url":null,"abstract":"Solving of large sparse matrix linear equations is always the research focus of scientific and engineering calculation field. With the sparsity and symmetry characteristics of coefficient matrix, Compressed Sparse Row (CSR) is adopted in the storage of large sparse matrix linear equations. Under the condition of CSR, Symmetrica Successive Over Relaxations-Preconditioned Conjugate Gradient method (SSOR-PCG) is employed in the solution of large sparse matrix linear equations.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133056207","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
扫码关注我们
求助内容：
应助结果提醒方式：