In order to emphasize features in flow textures while preserving the orientation of flows in 2D fields, a new method to generate flow textures with non-uniform streamlets is proposed in this paper. In the method, a control grid is built and divided into different regions that reflect the complexity of the underlying flow field. The resulting regions are then used to control to the distribution of droplets and the corresponding calculation of streamlets involved in OLIC. By this means, streamlets are dense around salient flow features, while in other areas they are sparse. The disparity of streamlets highlights features in flow fields. Test results show that our method can achieve pleasing visual effect. It is flexible and superior to the original OLIC.
{"title":"Feature Emphasized OLIC for 2D Flow Visualization","authors":"Beichen Liu, Wenyao Zhang, Y. Wang, Yuezhu Pei","doi":"10.1109/CIS.2013.139","DOIUrl":"https://doi.org/10.1109/CIS.2013.139","url":null,"abstract":"In order to emphasize features in flow textures while preserving the orientation of flows in 2D fields, a new method to generate flow textures with non-uniform streamlets is proposed in this paper. In the method, a control grid is built and divided into different regions that reflect the complexity of the underlying flow field. The resulting regions are then used to control to the distribution of droplets and the corresponding calculation of streamlets involved in OLIC. By this means, streamlets are dense around salient flow features, while in other areas they are sparse. The disparity of streamlets highlights features in flow fields. Test results show that our method can achieve pleasing visual effect. It is flexible and superior to the original OLIC.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127535085","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 security of the RSA cryptosystem is based on the difficulty of integer factorization. The General Number Field Sieve (GNFS) is one of the state-of-the-art algorithms to solve this problem over 110 digits. The Montgomery Block Lanczos algorithm is often used for solving a large and sparse linear system over GF (2) in the GNFS. AS Graphics Processing Units (GPUs) can provide a significant increase in floating point operations and memory bandwidth over conventional Central Processing Units (CPUs), performing sparse matrix-vector multiplications with these co-processors can decrease the amount of time. In this paper, we will first improve the initialization way of the algorithm to avoid sudden breakdown in the very first stage. Because a very high possibility of failure caused by the random initialization way, we will design a pseudo random way to initialize the algorithm to generate more solutions than traditional Block Lanczos algorithm does. Based on massive research about present sparse matrix storage formats, we will parallelize the improved Block Lanczos algorithm using a newly designed hybrid sparse matrix format on GPUs. Finally, we analyze the cost of our algorithm theoretically. From the results, a speedup can be achieved on GPUs according to related experiments.
{"title":"An Improved Block Lanczos Algorithm to Solve Large and Sparse Matrixes on GPUs","authors":"Wenjuan Ying","doi":"10.1109/CIS.2013.104","DOIUrl":"https://doi.org/10.1109/CIS.2013.104","url":null,"abstract":"The security of the RSA cryptosystem is based on the difficulty of integer factorization. The General Number Field Sieve (GNFS) is one of the state-of-the-art algorithms to solve this problem over 110 digits. The Montgomery Block Lanczos algorithm is often used for solving a large and sparse linear system over GF (2) in the GNFS. AS Graphics Processing Units (GPUs) can provide a significant increase in floating point operations and memory bandwidth over conventional Central Processing Units (CPUs), performing sparse matrix-vector multiplications with these co-processors can decrease the amount of time. In this paper, we will first improve the initialization way of the algorithm to avoid sudden breakdown in the very first stage. Because a very high possibility of failure caused by the random initialization way, we will design a pseudo random way to initialize the algorithm to generate more solutions than traditional Block Lanczos algorithm does. Based on massive research about present sparse matrix storage formats, we will parallelize the improved Block Lanczos algorithm using a newly designed hybrid sparse matrix format on GPUs. Finally, we analyze the cost of our algorithm theoretically. From the results, a speedup can be achieved on GPUs according to related experiments.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133602936","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 uses statistical method to analyzing a budget to managing public financial resources, including revenue change, non tax resources, General Operating Fund Revenues, etc.
本文运用统计方法分析了预算对公共财政资源管理的影响，包括收入变化、非税资源、一般营运基金收入等。
{"title":"Managing Public Financial Resources in a Changing World: Analyzing a Budget","authors":"Ziqi Zhu","doi":"10.1109/CIS.2013.180","DOIUrl":"https://doi.org/10.1109/CIS.2013.180","url":null,"abstract":"This paper uses statistical method to analyzing a budget to managing public financial resources, including revenue change, non tax resources, General Operating Fund Revenues, etc.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131341285","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}
At present there is a wide range of evolutionary algorithms available to researchers and practitioners. Despite the great diversity of these algorithms, virtually all of the algorithms share one feature: they have been manually designed. Can evolutionary algorithms be designed automatically by computer? In this paper, a novel evolutionary algorithm based on automatically designing of genetic operators is presented to address this problem. The resulting algorithm not only explores solutions in the problem space, but also automatically generates genetic operators in the operator space for each generation. In order to verify the performance of the proposed algorithm, comprehensive experiments on 23 well-known benchmark optimization problems are conducted, and the results show that the proposed algorithm can outperform standard Differential Evolution (DE) algorithm.
{"title":"Evolutionary Algorithm Based on Automatically Designing of Genetic Operators","authors":"Dazhi Jiang, Chenfeng Peng, Zhun Fan","doi":"10.1109/CIS.2013.21","DOIUrl":"https://doi.org/10.1109/CIS.2013.21","url":null,"abstract":"At present there is a wide range of evolutionary algorithms available to researchers and practitioners. Despite the great diversity of these algorithms, virtually all of the algorithms share one feature: they have been manually designed. Can evolutionary algorithms be designed automatically by computer? In this paper, a novel evolutionary algorithm based on automatically designing of genetic operators is presented to address this problem. The resulting algorithm not only explores solutions in the problem space, but also automatically generates genetic operators in the operator space for each generation. In order to verify the performance of the proposed algorithm, comprehensive experiments on 23 well-known benchmark optimization problems are conducted, and the results show that the proposed algorithm can outperform standard Differential Evolution (DE) algorithm.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132573801","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}
Shuigui Huang, Wenwen Han, Xirong Que, Wendong Wang
The orientation of sentiment words plays an important role in the sentiment analysis, but existing methods have difficulty in classifying the orientation of Chinese words, especially for the newly emerged words in Internet. Most approaches are mining the association between sentiment words and seed words using the big corpora and manually labeled seed words with definite orientation. But less work has ever focused on the efficient seed words selection. As we observed, emoticons, which are widely used on social network because of the simplicity and visualization, are good indicators for sentiment orientation. Thus this paper proposes the sentiment word model based on emoticons, which built orientation model of sentiment words with the orientation of emoticons, and train the model with the SVM classifier. Meanwhile, this work proposes a high efficient way to automatically classify the orientation of emoticons. Experiments show the precision rate of emoticon classification could reach 93.6%, and that of sentiment words classification could be 81.5%.
{"title":"Polarity Identification of Sentiment Words Based on Emoticons","authors":"Shuigui Huang, Wenwen Han, Xirong Que, Wendong Wang","doi":"10.1109/CIS.2013.35","DOIUrl":"https://doi.org/10.1109/CIS.2013.35","url":null,"abstract":"The orientation of sentiment words plays an important role in the sentiment analysis, but existing methods have difficulty in classifying the orientation of Chinese words, especially for the newly emerged words in Internet. Most approaches are mining the association between sentiment words and seed words using the big corpora and manually labeled seed words with definite orientation. But less work has ever focused on the efficient seed words selection. As we observed, emoticons, which are widely used on social network because of the simplicity and visualization, are good indicators for sentiment orientation. Thus this paper proposes the sentiment word model based on emoticons, which built orientation model of sentiment words with the orientation of emoticons, and train the model with the SVM classifier. Meanwhile, this work proposes a high efficient way to automatically classify the orientation of emoticons. Experiments show the precision rate of emoticon classification could reach 93.6%, and that of sentiment words classification could be 81.5%.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128156012","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 this paper, we will present a block cipher circuit design against Power Analysis. This design consists of usual masking and hiding method. For XOR, permutation and other linear layer, masking method of protection is used, but for S-box and other non-linear layer, hiding method is used in the reason that masking requires a lot of hardware consumption. We accomplished hardware implementation and Power Analysis in our research, whose test results proved that the design had strong capacity against Power Analysis. 200, 000 curves were extracted in our attack simulation, and the key successfully resisted complete recovery.
{"title":"A Block Cipher Circuit Design against Power Analysis","authors":"Yuxiao Ling, Zheng Guo, Zhimin Zhang, Zhigang Mao, Zeleng Zhuang","doi":"10.1109/CIS.2013.101","DOIUrl":"https://doi.org/10.1109/CIS.2013.101","url":null,"abstract":"In this paper, we will present a block cipher circuit design against Power Analysis. This design consists of usual masking and hiding method. For XOR, permutation and other linear layer, masking method of protection is used, but for S-box and other non-linear layer, hiding method is used in the reason that masking requires a lot of hardware consumption. We accomplished hardware implementation and Power Analysis in our research, whose test results proved that the design had strong capacity against Power Analysis. 200, 000 curves were extracted in our attack simulation, and the key successfully resisted complete recovery.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134324754","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}
Considering the challenges in guaranteeing the reliability of a formal model which is established in according with system requirements specification written in natural language with ambiguities, a novel strategy is proposed to improve the correctness of formal model by separating requirement functions and data structures. Specifically, hybrid automata which can analyze system process symbolically are created to characterize system behaviors before formalization. Secondly, UML models are created to improve the accuracy of system structure. Lastly, an object-oriented formal model is established based on the hybrid automata and UML models.
{"title":"A Strategy to Improve the Reliability of Object-Oriented Formal Models","authors":"Guo Xie, F. Qian, Xinhong Hei","doi":"10.1109/CIS.2013.150","DOIUrl":"https://doi.org/10.1109/CIS.2013.150","url":null,"abstract":"Considering the challenges in guaranteeing the reliability of a formal model which is established in according with system requirements specification written in natural language with ambiguities, a novel strategy is proposed to improve the correctness of formal model by separating requirement functions and data structures. Specifically, hybrid automata which can analyze system process symbolically are created to characterize system behaviors before formalization. Secondly, UML models are created to improve the accuracy of system structure. Lastly, an object-oriented formal model is established based on the hybrid automata and UML models.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133825428","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}
A differential-algebraic equations (DAEs) model for solving convex quadratic programming (CQP) is studied in this paper. By using Frisch's logarithmic barrier function, the DAEs model is established and the corresponding relationships of the solutions to the proposed DAEs with the CQP problems is analyzed in details here. All the results shows that this new model is different from traditional optimization algorithms which tries to find optimal solutions by the classical discrete iterated sequence points as well as different from neural network method based on the ODEs which tries to find the optimal solutions by tracking trajectories of a set of ordinary differential equation systems. It is well-known that different numerical schemes to DAEs algorithm can lead to new algorithms or some classical iterated algorithms, for instance, the path-following interior point algorithm could be conducted by a scheme of the proposed DAEs algorithm. So, in this aspect, the conventional interior point method can be viewed as a special case of the new DAEs method. Hence, this DAEs model provides a promising alternative approach for solving convex quadratic programming problems.
{"title":"Differential-Algebraic Equations Model for Quadratic Programming","authors":"Ya-juan Yang, Quan-ju Zhang","doi":"10.1109/CIS.2013.41","DOIUrl":"https://doi.org/10.1109/CIS.2013.41","url":null,"abstract":"A differential-algebraic equations (DAEs) model for solving convex quadratic programming (CQP) is studied in this paper. By using Frisch's logarithmic barrier function, the DAEs model is established and the corresponding relationships of the solutions to the proposed DAEs with the CQP problems is analyzed in details here. All the results shows that this new model is different from traditional optimization algorithms which tries to find optimal solutions by the classical discrete iterated sequence points as well as different from neural network method based on the ODEs which tries to find the optimal solutions by tracking trajectories of a set of ordinary differential equation systems. It is well-known that different numerical schemes to DAEs algorithm can lead to new algorithms or some classical iterated algorithms, for instance, the path-following interior point algorithm could be conducted by a scheme of the proposed DAEs algorithm. So, in this aspect, the conventional interior point method can be viewed as a special case of the new DAEs method. Hence, this DAEs model provides a promising alternative approach for solving convex quadratic programming problems.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122369684","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 development of SOA, the complex problem can be solved by combining available individual services and ordering them to best suit user's requirements. Web services composition is widely used to business environment. With the features of inherent autonomy and heterogeneity for component Web services it is difficult to predict the behaviors of the overall composite service. Therefore, transactional properties and non-functional quality of service (QoS) properties are crucial for selecting the web services to take part in the composition. Transactional properties ensure reliability of composite Web service, and QoS properties can identify the best candidate web services from a set of functionally-equivalent services. In this paper we define a Colored Petri Net (CPN) model which involves transactional properties of Web services in the composition process. To ensure reliable and correct execution, unfolding processes of the CPN are followed. The execution of transactional composition Web service (TCWS) is formalized by CPN properties.
{"title":"A Petri Net Approach to Reliable Execution for Web Service Composition","authors":"Liping Chen, Guojun Zhang","doi":"10.1109/CIS.2013.29","DOIUrl":"https://doi.org/10.1109/CIS.2013.29","url":null,"abstract":"With development of SOA, the complex problem can be solved by combining available individual services and ordering them to best suit user's requirements. Web services composition is widely used to business environment. With the features of inherent autonomy and heterogeneity for component Web services it is difficult to predict the behaviors of the overall composite service. Therefore, transactional properties and non-functional quality of service (QoS) properties are crucial for selecting the web services to take part in the composition. Transactional properties ensure reliability of composite Web service, and QoS properties can identify the best candidate web services from a set of functionally-equivalent services. In this paper we define a Colored Petri Net (CPN) model which involves transactional properties of Web services in the composition process. To ensure reliable and correct execution, unfolding processes of the CPN are followed. The execution of transactional composition Web service (TCWS) is formalized by CPN properties.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122899488","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}
Lizhuo Liu, Lili Xie, Chenglong Hao, Xinhua Zheng, Bing Sun
A dynamic friction model which can be used in the aircraft anti-skid braking system is introduced. On one hand, this model has similiar steady-state characteristics compared with the static friction model, on the other hand, it captures transient characteristics of the tire and the runway in emergency braking control. Dynamics and characteristics of the tire and the runway are analyzed, the PID+PBM control law is designed in the aircraft braking system. Simulation results show that this dynamic model is feasible and effective, and the proposed model is accurate for description of the tire and the runway. It is a theoretical basis for the study and design of high performance aircraft anti-skid braking system.
{"title":"Analyzing of Dynamic Friction Model for the Tire and the Runway","authors":"Lizhuo Liu, Lili Xie, Chenglong Hao, Xinhua Zheng, Bing Sun","doi":"10.1109/CIS.2013.173","DOIUrl":"https://doi.org/10.1109/CIS.2013.173","url":null,"abstract":"A dynamic friction model which can be used in the aircraft anti-skid braking system is introduced. On one hand, this model has similiar steady-state characteristics compared with the static friction model, on the other hand, it captures transient characteristics of the tire and the runway in emergency braking control. Dynamics and characteristics of the tire and the runway are analyzed, the PID+PBM control law is designed in the aircraft braking system. Simulation results show that this dynamic model is feasible and effective, and the proposed model is accurate for description of the tire and the runway. It is a theoretical basis for the study and design of high performance aircraft anti-skid braking system.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128488868","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
扫码关注我们
求助内容：
应助结果提醒方式：