By using electromagnetic field theory and calculus of variations, the mathematic model of double-fed variable-speed constant-frequency(VSCF) wind generators was established firstly in this paper, and the two-dimensional transient electromagnetic field finite element method(FEM) was presented. To satisfy the requirement of VSCF, the electromagnetic field was coupled with the outside circuit in FEM calculation, and the stator terminal voltage was taken as the convergence condition. Rotor exciting current was iterating calculated, and the performance of double-fed wind generators at different speed and different load was analyzed. Then the obtained results were compared with the experimental data, from which it could be seen that the calculated results satisfy the engineering requirements well. All these provide some useful reference for the design and analysis of wind power generation system
{"title":"Calculation and Analysis of Double-Fed VSCF Induction Generator Operating Performance","authors":"P. Cheng, Weili Li, Wenbiao Chen, D. Xia","doi":"10.1109/CIS.2007.119","DOIUrl":"https://doi.org/10.1109/CIS.2007.119","url":null,"abstract":"By using electromagnetic field theory and calculus of variations, the mathematic model of double-fed variable-speed constant-frequency(VSCF) wind generators was established firstly in this paper, and the two-dimensional transient electromagnetic field finite element method(FEM) was presented. To satisfy the requirement of VSCF, the electromagnetic field was coupled with the outside circuit in FEM calculation, and the stator terminal voltage was taken as the convergence condition. Rotor exciting current was iterating calculated, and the performance of double-fed wind generators at different speed and different load was analyzed. Then the obtained results were compared with the experimental data, from which it could be seen that the calculated results satisfy the engineering requirements well. All these provide some useful reference for the design and analysis of wind power generation system","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123433030","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 identification of T-cell epitopes is important for vaccine development. An epitope is a peptide segment that can bind to both a T-cell receptor and a major histocompatibility complex (MHC) molecule. The prediction of MHC binding peptides is a crucial part of the epitopes identification. This paper presents a novel Multi-Objective Evolutionary Algorithm (MOEA) to predict MHC class II binding peptides. The optimal search strategy of MOEA is used to find a position specific scoring matrix which can present MHC class II binding peptides quantitative motif. The performance of the new algorithm has been evaluated with benchmark datasets
{"title":"Prediction of MHC Class II Binding Peptides Using a Multi-Objective Evolutionary Algorithm","authors":"Wang Lian, Liu Juan, Luo Fei","doi":"10.1109/CIS.2007.180","DOIUrl":"https://doi.org/10.1109/CIS.2007.180","url":null,"abstract":"The identification of T-cell epitopes is important for vaccine development. An epitope is a peptide segment that can bind to both a T-cell receptor and a major histocompatibility complex (MHC) molecule. The prediction of MHC binding peptides is a crucial part of the epitopes identification. This paper presents a novel Multi-Objective Evolutionary Algorithm (MOEA) to predict MHC class II binding peptides. The optimal search strategy of MOEA is used to find a position specific scoring matrix which can present MHC class II binding peptides quantitative motif. The performance of the new algorithm has been evaluated with benchmark datasets","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"24 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123499804","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}
Aiming at the problem of blind source separation of the communication signals, we propose a step size optimization equivariant adaptive source separation via independence (SO-EASI) algorithm basing on the EASI block based algorithm. This algorithm adjusts the step-size by the steepest descent method and thereby greatly increases its convergence speed whatever value the step-size is initialized. Simulation results show that SO-EASI algorithm can effectively blindly separate the communication signals and these results also support the expected improvement in convergence speed of the approach.
{"title":"Step-Size Optimization EASI Algorithm for Blind Source Separation","authors":"Weihong Fu, Xiaoniu Yang, Naian Liu","doi":"10.1109/CIS.2007.15","DOIUrl":"https://doi.org/10.1109/CIS.2007.15","url":null,"abstract":"Aiming at the problem of blind source separation of the communication signals, we propose a step size optimization equivariant adaptive source separation via independence (SO-EASI) algorithm basing on the EASI block based algorithm. This algorithm adjusts the step-size by the steepest descent method and thereby greatly increases its convergence speed whatever value the step-size is initialized. Simulation results show that SO-EASI algorithm can effectively blindly separate the communication signals and these results also support the expected improvement in convergence speed of the approach.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121893693","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 matching results of traditional ASM are greatly affected by the model initial position. An improper position will lead algorithm to fail. To enhance the accuracy of feature detection, a Quick Rough Positioning Model(QRPM) algorithm is proposed, which makes use of the image and model gray information to calculate the similar coefficient between the model and the region detected. Coarse and fine explorations are adopted to extract the rough region, where the initial model will be set. Experimental results show that the improved algorithm can effectively enhance the accuracy in facial feature points' calibration, and avoid the ASM results falling into the local minimum.
{"title":"Improved Facial Feature Points Calibration Algorithm Based on ASM","authors":"Liming Dai, Miao Liu, Yuanyuan Chen","doi":"10.1109/CIS.2007.206","DOIUrl":"https://doi.org/10.1109/CIS.2007.206","url":null,"abstract":"The matching results of traditional ASM are greatly affected by the model initial position. An improper position will lead algorithm to fail. To enhance the accuracy of feature detection, a Quick Rough Positioning Model(QRPM) algorithm is proposed, which makes use of the image and model gray information to calculate the similar coefficient between the model and the region detected. Coarse and fine explorations are adopted to extract the rough region, where the initial model will be set. Experimental results show that the improved algorithm can effectively enhance the accuracy in facial feature points' calibration, and avoid the ASM results falling into the local minimum.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117230638","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 puts forward a new method of discretizing continuous attributes. Compared with the traditional approach, the method, proposed in this paper, can make the number of the obtained classes be more moderate, as well as the lost information be fewer. And then a simple attribute reduction algorithm is developed in continuous information systems. Finally, a real example is used to illustrate its feasibility and effectiveness, respectively.
{"title":"A New Attribute Reduction Algorithm in Continuous Information Systems","authors":"Yuejin Lv, Hong-yun Zhang, Fen Quan, Zhi-cheng Chen","doi":"10.1109/CIS.2007.191","DOIUrl":"https://doi.org/10.1109/CIS.2007.191","url":null,"abstract":"This paper puts forward a new method of discretizing continuous attributes. Compared with the traditional approach, the method, proposed in this paper, can make the number of the obtained classes be more moderate, as well as the lost information be fewer. And then a simple attribute reduction algorithm is developed in continuous information systems. Finally, a real example is used to illustrate its feasibility and effectiveness, respectively.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126175420","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}
Accurate traffic classification for different P2P applications is fundamental to numerous network activities, from security monitoring, capacity planning and provisioning to service differentiation. However, current P2P applications use dynamic port numbers, HTTP masquerading and inaccessible payload to prevent being identified. The paper proposed an accurate P2P identification system using Decision Tree algorithms (J48 and REPTree) on the basis of effective feature selection. The experimental results show that our scheme is of better accuracy, less computational complexity and it is robust enough to deal with the unknown P2P traffic. With the merits, the scheme can suit the real-time active detection environment, such as monitoring network attacks camouflaged with P2P traffic and service differentiation.
{"title":"P2P Traffic Identification Technique","authors":"Li Jun, Shunyi Zhang, Shidong Liu, Xuan Ye","doi":"10.1109/CIS.2007.178","DOIUrl":"https://doi.org/10.1109/CIS.2007.178","url":null,"abstract":"Accurate traffic classification for different P2P applications is fundamental to numerous network activities, from security monitoring, capacity planning and provisioning to service differentiation. However, current P2P applications use dynamic port numbers, HTTP masquerading and inaccessible payload to prevent being identified. The paper proposed an accurate P2P identification system using Decision Tree algorithms (J48 and REPTree) on the basis of effective feature selection. The experimental results show that our scheme is of better accuracy, less computational complexity and it is robust enough to deal with the unknown P2P traffic. With the merits, the scheme can suit the real-time active detection environment, such as monitoring network attacks camouflaged with P2P traffic and service differentiation.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124752320","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 presents a fuzzy modulator for the PMSM step motion control to modulate the current vector duration to improve the response speed and reduce the torque ripple of the system, on the basis of analyzing the principle of step motion control and introducing the fuzzy logic in. The results of simulation and experiment suggest that the presented approach can cut down the torque ripple and improve the control performance and the positioning precision.
{"title":"On Fuzzy Modulator for the PMSM Step Motion Control","authors":"Zhao-ming Lei, Hexu Sun, Yanzong Dong, Yi Zheng","doi":"10.1109/CIS.2007.36","DOIUrl":"https://doi.org/10.1109/CIS.2007.36","url":null,"abstract":"The paper presents a fuzzy modulator for the PMSM step motion control to modulate the current vector duration to improve the response speed and reduce the torque ripple of the system, on the basis of analyzing the principle of step motion control and introducing the fuzzy logic in. The results of simulation and experiment suggest that the presented approach can cut down the torque ripple and improve the control performance and the positioning precision.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128237986","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 concept of Zaps, two-round witness indistinguish- able proofs, was introduced by Dwork and Naor in 2000. They constructed Zaps based on non-interactive zero- knowledge proof. This left open the following problem: does there exist a non-interactive Zaps? Barak et al. and Groth et al. answered this question affirmatively under the assumption of the existence of Hitting Set Generators against co-nondeterministic circuits and Decisional Linear Assumption, respectively. In this paper, we will construct ef- ficient non-interactive Zaps under the existence of one-way function. In 2006, Chase and Lysyanskaya defined and con- structed signatures of knowledge based on non-interactive zero-knowledge proof. We prove that their signature is not secure and point out that they exist under the existence of trapdoor permutation. Feige and Shamir stated that digi- tal signature cannot be zero-knowledge(otherwise they are forgeable) and it can be witness hiding. In this paper, we will revise the definition of the signatures of knowledge by using witness hiding protocol and construct them under the existence of one-way function.
Zaps的概念是由Dwork和Naor在2000年提出的，它是两轮证人不可区分的证明。他们基于非交互式零知识证明构造了Zaps。这留下了以下问题:是否存在非交互式的Zaps?Barak et al.和growth et al.分别在针对共不确定性电路和决策线性假设的hit Set Generators存在的假设下肯定地回答了这个问题。本文将构造单向函数存在下的高效非交互zap。2006年，Chase和Lysyanskaya定义并构造了基于非交互式零知识证明的知识签名。我们证明了它们的签名是不安全的，并指出它们存在于活门排列的存在条件下。Feige和Shamir指出，数字签名不能是零知识(否则它们是可伪造的)，它可以是证人隐藏。本文将利用证人隐藏协议修改知识签名的定义，并在单向函数存在的条件下构造知识签名。
{"title":"Efficient Zaps and Signatures of Knowledge","authors":"Chunming Tang, D. Pei, Z. Yao","doi":"10.1109/CIS.2007.108","DOIUrl":"https://doi.org/10.1109/CIS.2007.108","url":null,"abstract":"The concept of Zaps, two-round witness indistinguish- able proofs, was introduced by Dwork and Naor in 2000. They constructed Zaps based on non-interactive zero- knowledge proof. This left open the following problem: does there exist a non-interactive Zaps? Barak et al. and Groth et al. answered this question affirmatively under the assumption of the existence of Hitting Set Generators against co-nondeterministic circuits and Decisional Linear Assumption, respectively. In this paper, we will construct ef- ficient non-interactive Zaps under the existence of one-way function. In 2006, Chase and Lysyanskaya defined and con- structed signatures of knowledge based on non-interactive zero-knowledge proof. We prove that their signature is not secure and point out that they exist under the existence of trapdoor permutation. Feige and Shamir stated that digi- tal signature cannot be zero-knowledge(otherwise they are forgeable) and it can be witness hiding. In this paper, we will revise the definition of the signatures of knowledge by using witness hiding protocol and construct them under the existence of one-way function.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129827644","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 work presents a new Markov random field (MRF) framework for image segmentation by incorporating exact contexts in the label field as well as the observed data. On the one hand, the new framework presents MRF with adaptive neighborhood (MRF-AN) system to model adaptively the contextual information of the hidden label field. On the other hand, the new framework models observations via a conditional random field (CRF), which incorporates the contextual information in observed data. The new MRF framework with the dual adaptive contextual information offers several advantages over the conventional framework. In this work, we demonstrate the advantages in an application of detail preservation in image segmentation.
{"title":"A New MRF Framework with Dual Adaptive Contexts for Image Segmentation","authors":"P. Zhong, Fangchen Liu, Runsheng Wang","doi":"10.1109/CIS.2007.192","DOIUrl":"https://doi.org/10.1109/CIS.2007.192","url":null,"abstract":"This work presents a new Markov random field (MRF) framework for image segmentation by incorporating exact contexts in the label field as well as the observed data. On the one hand, the new framework presents MRF with adaptive neighborhood (MRF-AN) system to model adaptively the contextual information of the hidden label field. On the other hand, the new framework models observations via a conditional random field (CRF), which incorporates the contextual information in observed data. The new MRF framework with the dual adaptive contextual information offers several advantages over the conventional framework. In this work, we demonstrate the advantages in an application of detail preservation in image segmentation.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132415992","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}
Subspace methods such as principal component analysis (PCA) and linear discriminant analysis (LDA) extract the features based on space domain. Transformation such as discrete cosine transform (DCT) extracts features based on frequency domain. In this paper, we present two parallel models which intend to utilize the features extracted from frequency and space domain of facial images. Both features are combined under a fusion based scheme. FERET database is chosen to evaluate the performance of the proposed method. Simulation results indicate that the proposed method outperforms other traditional methods and enhance the representation of facial image under low-dimensional features.
{"title":"New Parallel Models for Face Recognition","authors":"Heng Fui Liau, K. Seng, Yee Wan Wong, L. Ang","doi":"10.1109/CIS.2007.221","DOIUrl":"https://doi.org/10.1109/CIS.2007.221","url":null,"abstract":"Subspace methods such as principal component analysis (PCA) and linear discriminant analysis (LDA) extract the features based on space domain. Transformation such as discrete cosine transform (DCT) extracts features based on frequency domain. In this paper, we present two parallel models which intend to utilize the features extracted from frequency and space domain of facial images. Both features are combined under a fusion based scheme. FERET database is chosen to evaluate the performance of the proposed method. Simulation results indicate that the proposed method outperforms other traditional methods and enhance the representation of facial image under low-dimensional features.","PeriodicalId":127238,"journal":{"name":"2007 International Conference on Computational Intelligence and Security (CIS 2007)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123196433","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
扫码关注我们
求助内容：
应助结果提醒方式：