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":"44 1","pages":"0"},"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}
Texture and edge information are equally important to identification of most of natural images. In view of the weakness of the existing integer order differential operators that it can't extract texture information from the images, this study developed a fractional differential algorithm, which can extract texture and marginal information simultaneously, based on settlement of the drift problem of fractional differential operator. Experimental results showed that our algorithm can not only extract texture information but also extract more edge information than the traditional algorithms.
{"title":"The Improved Fractional Order Differential Image Information Extraction Algorithm","authors":"Mingliang Hou, Yuran Liu, Yanglie Fu","doi":"10.1109/ICCIS.2012.330","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.330","url":null,"abstract":"Texture and edge information are equally important to identification of most of natural images. In view of the weakness of the existing integer order differential operators that it can't extract texture information from the images, this study developed a fractional differential algorithm, which can extract texture and marginal information simultaneously, based on settlement of the drift problem of fractional differential operator. Experimental results showed that our algorithm can not only extract texture information but also extract more edge information than the traditional algorithms.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132077264","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":"178 1","pages":"0"},"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}
The wellbore dynamic pressure waves are produced in the perforation liquid after the shaped charges are initiated and then fiercely strike the gunstring, packer, casing and artificial bottom. The impact and damage effect only depend on the amplitude and holding time of dynamic pressures. This paper discusses the simplification of perforators' explosion with gun in the oil well. On the basis of simplification model, the finite element method is applied to compute the wellbore dynamic pressure under different working conditions. The simulation results indicate that peak compression enhances and the duration of platform pressures obviously prolongs with the perforators' amount once detonated increasing. The holding time of platform pressure clearly prolongs with the accretion of perforator's explosive charge mass. The peak compression and holding time of reflection waves decrease with the augment of distance between the end of tubing and artificial bottom. The peak compression and holding time must be lowered if possible to avoid undesirable failures and damage during perforating operation.
{"title":"Numerical Computation of Wellbore Dynamic Pressure during Perforating","authors":"C. Li, Ming-yong Ma","doi":"10.1109/ICCIS.2012.192","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.192","url":null,"abstract":"The wellbore dynamic pressure waves are produced in the perforation liquid after the shaped charges are initiated and then fiercely strike the gunstring, packer, casing and artificial bottom. The impact and damage effect only depend on the amplitude and holding time of dynamic pressures. This paper discusses the simplification of perforators' explosion with gun in the oil well. On the basis of simplification model, the finite element method is applied to compute the wellbore dynamic pressure under different working conditions. The simulation results indicate that peak compression enhances and the duration of platform pressures obviously prolongs with the perforators' amount once detonated increasing. The holding time of platform pressure clearly prolongs with the accretion of perforator's explosive charge mass. The peak compression and holding time of reflection waves decrease with the augment of distance between the end of tubing and artificial bottom. The peak compression and holding time must be lowered if possible to avoid undesirable failures and damage during perforating operation.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133822844","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":"77 1","pages":"0"},"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}
As a Platform as a Service (PaaS) designer, we should satisfy customers' demands of resources and to save resources in a cloud at the same time. In PaaS, one of the main problems is that if one of virtual machines' (VM) workload increases fast in a host, other VMs' performance characteristics may be influenced negatively. To solve the performance isolation problem, this paper gives a method. In this method, we use an algorithm to forecast all VMs' resources usage at first. Then we find which VMs' workloads may increase fast in future. We move these VMs to hosts which have more resources and other VMs' performance characteristics will not be affected at the same time. So the main problem now is which hosts we should use to move these VMs as mentioned above to. In this paper, we use Dynamic Programming method to solve this problem. So, with all of these algorithms, in this paper, we propose a strategy to solve Performance Isolation problem in PaaS.
{"title":"A Method for Solving the Performance Isolation Problem in PaaS Based on Forecast and Dynamic Programming","authors":"Jiayang Yu, R. Rao","doi":"10.1109/ICCIS.2012.23","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.23","url":null,"abstract":"As a Platform as a Service (PaaS) designer, we should satisfy customers' demands of resources and to save resources in a cloud at the same time. In PaaS, one of the main problems is that if one of virtual machines' (VM) workload increases fast in a host, other VMs' performance characteristics may be influenced negatively. To solve the performance isolation problem, this paper gives a method. In this method, we use an algorithm to forecast all VMs' resources usage at first. Then we find which VMs' workloads may increase fast in future. We move these VMs to hosts which have more resources and other VMs' performance characteristics will not be affected at the same time. So the main problem now is which hosts we should use to move these VMs as mentioned above to. In this paper, we use Dynamic Programming method to solve this problem. So, with all of these algorithms, in this paper, we propose a strategy to solve Performance Isolation problem in PaaS.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117306630","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}
As one of the major commercial innovations in recent years, websites for group purchase have experienced a fast booming in domestic market. However, they have fell into a predicament because of the excessive competition. Analyzing the operating characteristics of these websites according to the Theory of Two-sided Markets, this paper finds out that one of the factors that limits the group-purchase websites from developing is the customer scale trap. Studying the platform mode of e-commerce in terms of network externalities, it further puts forward a new opinion, i.e., overcoming the trap through the accumulation of platform customer utility.
{"title":"Research on the \"Customer Scale Trap\" of Group-Purchase Websites' Business Mode","authors":"Chunying Cui","doi":"10.1109/ICCIS.2012.256","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.256","url":null,"abstract":"As one of the major commercial innovations in recent years, websites for group purchase have experienced a fast booming in domestic market. However, they have fell into a predicament because of the excessive competition. Analyzing the operating characteristics of these websites according to the Theory of Two-sided Markets, this paper finds out that one of the factors that limits the group-purchase websites from developing is the customer scale trap. Studying the platform mode of e-commerce in terms of network externalities, it further puts forward a new opinion, i.e., overcoming the trap through the accumulation of platform customer utility.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115224415","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}
With the development of distributed simulation technology, firstly this paper based on the service-oriented technology, presents a service-oriented network simulation construction and operation models to meet the future military system simulation new demands. Secondly, we particularly present relevant research on the network simulation supporting platform and interrelated core services, focusing on operation support platform architecture and construction and operation of the simulation application services under the architecture. End of the paper gives the key technologies analysis for future explanation of the operation support platform, including multi-CoST Management, virtual scheduling and simulation core services management.
{"title":"Research on Service-Oriented Network Simulation and Operation of Supporting Platform","authors":"Li Jianning, Yu Jie, Sun Liyang","doi":"10.1109/ICCIS.2012.255","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.255","url":null,"abstract":"With the development of distributed simulation technology, firstly this paper based on the service-oriented technology, presents a service-oriented network simulation construction and operation models to meet the future military system simulation new demands. Secondly, we particularly present relevant research on the network simulation supporting platform and interrelated core services, focusing on operation support platform architecture and construction and operation of the simulation application services under the architecture. End of the paper gives the key technologies analysis for future explanation of the operation support platform, including multi-CoST Management, virtual scheduling and simulation core services management.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115392400","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":"119 1","pages":"0"},"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}
Qilianshan tunnel is a key project on Lanzhou-Xinjiang passenger dedicated line, located in Gansu province in the Northwest China. It is subjected to geo-stress in soft rock with rich water. Anisotropic mechanical-hydraulic coupling model was performed to investigate the energy density, effective stress and maximum shear stress, displacements and plastic zone of surrounding rock. Consequently, research results show that estimating pore water pressure distribution is important during construction. Energy, effective stress and the maximum shear stress accumulation zone occur and the peak value is located at 2.1 m from side wall. The displacement of crown is most and reaches to 7 cm which is less than ultimate displacement in teams of Code of Design on Tunnel of Railway. Extracted deformation ahead of working face is significantly affected when the distance is less than 8 m. Transversal plastic zone is mainly located at crown, shoulder and invert. The depth of it is 4 m. Pore water pressure and energy distribution ahead of working face increases firstly, and then it reduces. The peak value is located at 10 m ahead of working face. Not only does the analysis method fit for Qilianshan tunnel, but it can be a reference for similar geological engineering.
{"title":"Anisotropic Mechanical-Hydraulic Coupling for Deep Buried Tunnel in Soft Rock with Rich Water","authors":"Ben-guo He, Zhiqiang Zhang, Tengfei Ma","doi":"10.1109/ICCIS.2012.76","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.76","url":null,"abstract":"Qilianshan tunnel is a key project on Lanzhou-Xinjiang passenger dedicated line, located in Gansu province in the Northwest China. It is subjected to geo-stress in soft rock with rich water. Anisotropic mechanical-hydraulic coupling model was performed to investigate the energy density, effective stress and maximum shear stress, displacements and plastic zone of surrounding rock. Consequently, research results show that estimating pore water pressure distribution is important during construction. Energy, effective stress and the maximum shear stress accumulation zone occur and the peak value is located at 2.1 m from side wall. The displacement of crown is most and reaches to 7 cm which is less than ultimate displacement in teams of Code of Design on Tunnel of Railway. Extracted deformation ahead of working face is significantly affected when the distance is less than 8 m. Transversal plastic zone is mainly located at crown, shoulder and invert. The depth of it is 4 m. Pore water pressure and energy distribution ahead of working face increases firstly, and then it reduces. The peak value is located at 10 m ahead of working face. Not only does the analysis method fit for Qilianshan tunnel, but it can be a reference for similar geological engineering.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116265246","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
扫码关注我们
求助内容：
应助结果提醒方式：