A new enhanced dynamic logic using multiple-input floating-gate MOS(FGMOS) transistors is presented. The circuit technique is designed using an n-channel multiple-input FGMOS pull down logic tree instead of the nMOS logic tree in the conventional enhanced differential cascode voltage switch logic (EDCVSL) circuit. The logic tree of EDCVSL is dramatically simplified by utilizing multiple-input FGMOS transistors. The proposed dynamic logic does not require complementary inputs, and keeps the benefits of EDCVSL. A simple synthesis technique of the n-channel multiple-input FGMOS logic tree by employing summation signal is given. HSPICE simulations using TSMC 0.35μm 2-ploy 4-metal CMOS technology have verified the effectiveness of the proposed circuits.
{"title":"An Enhanced Dynamic Switch Logic with Floating-Gate MOS Transistors","authors":"G. Hang, Danyan Zhang, Xuanchang Zhou, X. You","doi":"10.1109/CIS.2013.69","DOIUrl":"https://doi.org/10.1109/CIS.2013.69","url":null,"abstract":"A new enhanced dynamic logic using multiple-input floating-gate MOS(FGMOS) transistors is presented. The circuit technique is designed using an n-channel multiple-input FGMOS pull down logic tree instead of the nMOS logic tree in the conventional enhanced differential cascode voltage switch logic (EDCVSL) circuit. The logic tree of EDCVSL is dramatically simplified by utilizing multiple-input FGMOS transistors. The proposed dynamic logic does not require complementary inputs, and keeps the benefits of EDCVSL. A simple synthesis technique of the n-channel multiple-input FGMOS logic tree by employing summation signal is given. HSPICE simulations using TSMC 0.35μm 2-ploy 4-metal CMOS technology have verified the effectiveness of the proposed circuits.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"21 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":"131412284","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 deal with some real-world problems, the uncertainty reasoning for Semantic Web has been widely studied, though lots of researchers tend to combine fuzzy theory with Description Logic Programs (DLP) and Semantic Web Rule Language (SWRL). Since probability theory is more suitable than fuzzy logic to make prediction about event from a state of partial knowledge, a probabilistic extension of SWRL, named Bayes-SWRL, is introduced in this paper. Based on the syntax and model-theoretic semantic defined for Bayes-SWRL, we propose a probabilistic reasoning algorithm, which is employed to implement the prototype reasoner of Bayes-SWRL. In addition, we point out some constrains of Bayes-SWRL that users should pay attention to.
{"title":"Bayes-SWRL: A Probabilistic Extension of SWRL","authors":"Yu Liu, Shihong Chen, Shuoming Li, Yunhua Wang","doi":"10.1109/CIS.2013.153","DOIUrl":"https://doi.org/10.1109/CIS.2013.153","url":null,"abstract":"In order to deal with some real-world problems, the uncertainty reasoning for Semantic Web has been widely studied, though lots of researchers tend to combine fuzzy theory with Description Logic Programs (DLP) and Semantic Web Rule Language (SWRL). Since probability theory is more suitable than fuzzy logic to make prediction about event from a state of partial knowledge, a probabilistic extension of SWRL, named Bayes-SWRL, is introduced in this paper. Based on the syntax and model-theoretic semantic defined for Bayes-SWRL, we propose a probabilistic reasoning algorithm, which is employed to implement the prototype reasoner of Bayes-SWRL. In addition, we point out some constrains of Bayes-SWRL that users should pay attention to.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"7 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":"124129189","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}
Guangcheng Liang, L. Liao, Xin Xu, Jianguang Du, Guoqiang Li, Henglong Zhao
In this paper we present a new vulnerability-targeted black box fuzzing approach to effectively detect errors in the program. Unlike the standard fuzzing techniques that randomly change bytes of the input file, our approach remarkably reduces the fuzzing range by utilizing an efficient dynamic taint analysis technique. It locates the regions of seed files that affect the values used at the hazardous points. Thus it enables to pay more attention to deep errors in the core of the program. Because our approach is directly targeted to the specific potential vulnerabilities, most of the detected errors are with vulnerability signatures. Besides, this approach does not need the information of the input file format in advance. So it is especially appropriate for testing applications with complex and highly structured input file formats. We design and implement a prototype, Taint Fuzz, to realize this approach. The experiments demonstrate that Taint Fuzz can effectively expose more errors with much lower time cost and much smaller number of input samples compared with the standard fuzzer.
{"title":"Effective Fuzzing Based on Dynamic Taint Analysis","authors":"Guangcheng Liang, L. Liao, Xin Xu, Jianguang Du, Guoqiang Li, Henglong Zhao","doi":"10.1109/CIS.2013.135","DOIUrl":"https://doi.org/10.1109/CIS.2013.135","url":null,"abstract":"In this paper we present a new vulnerability-targeted black box fuzzing approach to effectively detect errors in the program. Unlike the standard fuzzing techniques that randomly change bytes of the input file, our approach remarkably reduces the fuzzing range by utilizing an efficient dynamic taint analysis technique. It locates the regions of seed files that affect the values used at the hazardous points. Thus it enables to pay more attention to deep errors in the core of the program. Because our approach is directly targeted to the specific potential vulnerabilities, most of the detected errors are with vulnerability signatures. Besides, this approach does not need the information of the input file format in advance. So it is especially appropriate for testing applications with complex and highly structured input file formats. We design and implement a prototype, Taint Fuzz, to realize this approach. The experiments demonstrate that Taint Fuzz can effectively expose more errors with much lower time cost and much smaller number of input samples compared with the standard fuzzer.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"24 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":"124083627","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}
3D reconstruction is one of the research focus of computer vision and widely applied in various fields. The main steps of 3D reconstruction include image acquisition, image selection, feature point extraction and matching, calculation of camera parameters and 3D coordinates of the scene, and production of dense 3D scene models. Of all the steps, the image selection step is necessary and important. In this paper, a new 3D reconstruction algorithm consisting of four main steps is proposed and its main contribution is that the image selection step uses a new effective method. The new image selection method first uses structure-from-motion (SFM) algorithms to calculate the position and attitude of each camera, and then calculates the contributed value to 3D reconstruction of each image, finally selects images according to the contributed value of each image and their effects on contributed values of other images. Experimental results show that the 3D reconstruction algorithm proposed in this paper can reconstruct target scenes very well.
{"title":"3D Reconstruction through Measure Based Image Selection","authors":"Chao Yang, F. Zhou, X. Bai","doi":"10.1109/CIS.2013.86","DOIUrl":"https://doi.org/10.1109/CIS.2013.86","url":null,"abstract":"3D reconstruction is one of the research focus of computer vision and widely applied in various fields. The main steps of 3D reconstruction include image acquisition, image selection, feature point extraction and matching, calculation of camera parameters and 3D coordinates of the scene, and production of dense 3D scene models. Of all the steps, the image selection step is necessary and important. In this paper, a new 3D reconstruction algorithm consisting of four main steps is proposed and its main contribution is that the image selection step uses a new effective method. The new image selection method first uses structure-from-motion (SFM) algorithms to calculate the position and attitude of each camera, and then calculates the contributed value to 3D reconstruction of each image, finally selects images according to the contributed value of each image and their effects on contributed values of other images. Experimental results show that the 3D reconstruction algorithm proposed in this paper can reconstruct target scenes very well.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"4 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":"126184792","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}
Attribute based signature scheme is an important cryptographic primitive which provides a powerful way for users to control their privacy. Due Attribute based signature scheme is an important cryptographic primitive which provides a powerful way for users to control their privacy. Due to the fact that it can reduce the bandwidth needed to transmit attribute based signatures and the time needed to verify the signature at the same time, attribute based multi-signature scheme (ABMS) is proposed in this paper. We also formalized ABMS scheme and proved the security of this scheme in the standard model. The analysis shows that our ABMS scheme has less signature length and needs less computing verification than the traditional ABS scheme. to the fact that it can reduce the bandwidth needed to transmit attribute based signatures and the time needed to verify the signature at the same time, attribute based multi-signature scheme(ABMS) is proposed in this paper. We also formalized ABMS scheme and proved the security of this scheme in the standard model. The analysis shows that our ABMS scheme has less signature length and needs less computing verification than the traditional ABS scheme.
{"title":"Attribute Based Multi-signature Scheme in the Standard Model","authors":"Ximeng Liu, Jianfeng Ma, Qi Li, Jinbo Xiong, Faliang Huang","doi":"10.1109/CIS.2013.161","DOIUrl":"https://doi.org/10.1109/CIS.2013.161","url":null,"abstract":"Attribute based signature scheme is an important cryptographic primitive which provides a powerful way for users to control their privacy. Due Attribute based signature scheme is an important cryptographic primitive which provides a powerful way for users to control their privacy. Due to the fact that it can reduce the bandwidth needed to transmit attribute based signatures and the time needed to verify the signature at the same time, attribute based multi-signature scheme (ABMS) is proposed in this paper. We also formalized ABMS scheme and proved the security of this scheme in the standard model. The analysis shows that our ABMS scheme has less signature length and needs less computing verification than the traditional ABS scheme. to the fact that it can reduce the bandwidth needed to transmit attribute based signatures and the time needed to verify the signature at the same time, attribute based multi-signature scheme(ABMS) is proposed in this paper. We also formalized ABMS scheme and proved the security of this scheme in the standard model. The analysis shows that our ABMS scheme has less signature length and needs less computing verification than the traditional ABS scheme.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"47 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":"128929358","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 prosperity of content-oriented social media services has raised the new chances for understanding users' social behaviors. Different from traditional social networks, the links in social media are usually influenced by user references rather than the real world connections, thus the traditional methods based on social network evolvement may fail to reveal the adequate links. Meanwhile, the existing link prediction algorithms considering both social topology and nodes attributes might be too much computationally complex. To deal with these challenges, in this paper, we propose a two steps link prediction framework, in which a filter is functioned to select the candidates firstly, and then the adapted Supervised Random Walk (SRW) is executed to rank the candidates for prediction. Experiments on the real world data set of social media indicate that our framework could effectively and efficiently predict the appropriate links, which outperforms the baselines including ordinary SRW with acceptable margin.
{"title":"Random Walk with Pre-filtering for Social Link Prediction","authors":"Ting Jin, Tong Xu, Enhong Chen, Qi Liu, Haiping Ma, Jingsong Lv, Guoping Hu","doi":"10.1109/CIS.2013.36","DOIUrl":"https://doi.org/10.1109/CIS.2013.36","url":null,"abstract":"The prosperity of content-oriented social media services has raised the new chances for understanding users' social behaviors. Different from traditional social networks, the links in social media are usually influenced by user references rather than the real world connections, thus the traditional methods based on social network evolvement may fail to reveal the adequate links. Meanwhile, the existing link prediction algorithms considering both social topology and nodes attributes might be too much computationally complex. To deal with these challenges, in this paper, we propose a two steps link prediction framework, in which a filter is functioned to select the candidates firstly, and then the adapted Supervised Random Walk (SRW) is executed to rank the candidates for prediction. Experiments on the real world data set of social media indicate that our framework could effectively and efficiently predict the appropriate links, which outperforms the baselines including ordinary SRW with acceptable margin.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"22 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":"129169190","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 two-side optimal Matching between employees and positions is considered in the optimal configuration of human resource in construction enterprise using the two-sided matching theory. Based the two-sided evaluation index system between Employees and Positions, the two-sided matching degree is defined by calculating the distance of evaluation information with ideal value. A multi-objective optimization model is constructed to maximize the two-sided satisfaction degree. Finally, a numerical example of the project manager's configuration for a construction enterprise is given to illustrate the practicality and effectiveness of the proposed approach.
{"title":"Research on the Optimal Configuration of Human Resource in Construction Enterprise Based on Two-Side Matching","authors":"Jinling Du, Dalian Liu, Meisheng Zhang","doi":"10.1109/CIS.2013.184","DOIUrl":"https://doi.org/10.1109/CIS.2013.184","url":null,"abstract":"The two-side optimal Matching between employees and positions is considered in the optimal configuration of human resource in construction enterprise using the two-sided matching theory. Based the two-sided evaluation index system between Employees and Positions, the two-sided matching degree is defined by calculating the distance of evaluation information with ideal value. A multi-objective optimization model is constructed to maximize the two-sided satisfaction degree. Finally, a numerical example of the project manager's configuration for a construction enterprise is given to illustrate the practicality and effectiveness of the proposed approach.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"281 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":"133010503","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}
Due to the inherent autonomy and heterogeneity of component Web services it is difficult to predict the behavior of the overall composite service. Besides, the performance of the composed application is determined by the performance of the involved component web services. Therefore, the behavior conformance and non-functional quality of service (QoS) properties are crucial for selecting the web services to take part in the composition. The behavior conformance of component services is the guarantee of the correctness of Web service composition, and QoS properties can identify the best candidate web services from a set of functionally-equivalent services. In this paper, two formal judgmental rules are presented, which check conformance of local behavior of every component service to global interaction. We also use skyline computation to select services for composition effectively and efficiently, reducing the number of candidate services to be considered. We also define aggregation functions, and use a Multiple Attribute Decision Making approach for the utility function to achieve Qos-based optimal service selection. We evaluate our approach experimentally using both real and synthetically generated datasets.
{"title":"Conformance Checking and QoS Optimizing of Web Service Composition","authors":"Guojun Zhang","doi":"10.1109/CIS.2013.171","DOIUrl":"https://doi.org/10.1109/CIS.2013.171","url":null,"abstract":"Due to the inherent autonomy and heterogeneity of component Web services it is difficult to predict the behavior of the overall composite service. Besides, the performance of the composed application is determined by the performance of the involved component web services. Therefore, the behavior conformance and non-functional quality of service (QoS) properties are crucial for selecting the web services to take part in the composition. The behavior conformance of component services is the guarantee of the correctness of Web service composition, and QoS properties can identify the best candidate web services from a set of functionally-equivalent services. In this paper, two formal judgmental rules are presented, which check conformance of local behavior of every component service to global interaction. We also use skyline computation to select services for composition effectively and efficiently, reducing the number of candidate services to be considered. We also define aggregation functions, and use a Multiple Attribute Decision Making approach for the utility function to achieve Qos-based optimal service selection. We evaluate our approach experimentally using both real and synthetically generated datasets.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"6 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":"126637460","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 paper further investigates the computational problem and complexity of predicting Ribonucleic Acid structure. In order to find a way to optimize the Ribonucleic Acid pseudoknotted structure, we investigate the Ribonucleic Acid pseudoknotted structure based on thermal dynamic model, computational methods, minimum free energy are adopted to predict Ribonucleic Acid structure. The contribution of this paper is to obtain an efficient Approximation algorithm for finding RNA pseudoknotted structure, compared with other algorithms, the algorithm takes O(n3) time and O(n2) space. The experimental test in PseudoBase shows that the algorithm is more effective and exact than other algorithms, and the algorithm can predict arbitrary pseudoknots. And we also give a proof of existing 1+e (e>0) Polynomial Time Approximation Scheme(PTAS) in Searching Maximum Number of Stackings.
{"title":"An Approximation Scheme for RNA Folding Structure Prediction Including Pseudoknots","authors":"Zhendong Liu, Daming Zhu, Wei Cui, Nan Liu","doi":"10.1109/CIS.2013.9","DOIUrl":"https://doi.org/10.1109/CIS.2013.9","url":null,"abstract":"The paper further investigates the computational problem and complexity of predicting Ribonucleic Acid structure. In order to find a way to optimize the Ribonucleic Acid pseudoknotted structure, we investigate the Ribonucleic Acid pseudoknotted structure based on thermal dynamic model, computational methods, minimum free energy are adopted to predict Ribonucleic Acid structure. The contribution of this paper is to obtain an efficient Approximation algorithm for finding RNA pseudoknotted structure, compared with other algorithms, the algorithm takes O(n3) time and O(n2) space. The experimental test in PseudoBase shows that the algorithm is more effective and exact than other algorithms, and the algorithm can predict arbitrary pseudoknots. And we also give a proof of existing 1+e (e>0) Polynomial Time Approximation Scheme(PTAS) in Searching Maximum Number of Stackings.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"2 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":"128132589","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 set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product. We study the finite-step realizability of the joint/generalized spectral radius of a pair of n × n square matrices. Let Σ = {A, B} where A,B are n × n matrices and B is a rank-one matrix. Then we have ρ(Σ)= max:t,s ρ(AtBs)1/(s+t). That is to say, Σ have the finiteness property where the maximum is attained at (t, s) with the optimal sequence AtBs.
{"title":"The Finiteness Conjecture for the Joint Spectral Radius of a Pair of Matrices","authors":"Shuoting Wang, Jiechang Wen","doi":"10.1109/CIS.2013.174","DOIUrl":"https://doi.org/10.1109/CIS.2013.174","url":null,"abstract":"A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product. We study the finite-step realizability of the joint/generalized spectral radius of a pair of n × n square matrices. Let Σ = {A, B} where A,B are n × n matrices and B is a rank-one matrix. Then we have ρ(Σ)= max:t,s ρ(A<sup>t</sup>B<sup>s</sup>)<sup>1/(s+t)</sup>. That is to say, Σ have the finiteness property where the maximum is attained at (t, s) with the optimal sequence A<sup>t</sup>B<sup>s</sup>.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"28 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":"132800961","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
扫码关注我们
求助内容：
应助结果提醒方式：