期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
Application of formal languages in polynomial transformations of instances between NP-complete problems 被引量:1
1
作者 Jorge A. RUIZ-VANOYE Joaquín PREZ-ORTEGA +5 位作者 Rodolfo A. PAZOS RANGEL Ocotlán DíAZ-PARRA Héctor J. FRAIRE-HUACUJA Juan FRAUSTO-SOLíS Gerardo REYES-SALGADO Laura CRUZ-REYES 《Journal of Zhejiang University-Science C(Computers and Electronics)》 SCIE EI 2013年第8期623-633,共11页
We propose the usage of formal languages for expressing instances of NP-complete problems for their application in polynomial transformations. The proposed approach, which consists of using formal language theory for ... We propose the usage of formal languages for expressing instances of NP-complete problems for their application in polynomial transformations. The proposed approach, which consists of using formal language theory for polynomial transformations, is more robust, more practical, and faster to apply to real problems than the theory of polynomial transformations. In this paper we propose a methodology for transforming instances between NP-complete problems, which differs from Garey and Johnson's. Unlike most transformations which are used for proving that a problem is NP-complete based on the NP-completeness of another problem, the proposed approach is intended for extrapolating some known characteristics, phenomena, or behaviors from a problem A to another problem B. This extrapolation could be useful for predicting the performance of an algorithm for solving B based on its known performance for problem A, or for taking an algorithm that solves A and adapting it to solve B. 展开更多
关键词 Formal languages polynomial transformations NP-COMPLETENESS
原文传递
Polynomial Analysis of DH Secrete Key and Bit Security
2
作者 JIANGZheng-tao XUWen-li WANGYu-min 《Wuhan University Journal of Natural Sciences》 EI CAS 2005年第1期239-242,共4页
In this paper, we lower the upper bound of the number of solutions of oracletransformation polynomial F(x) over GF(q) So one can also recover all the secrete keys with fewercalls We use our generalized ' even-and-... In this paper, we lower the upper bound of the number of solutions of oracletransformation polynomial F(x) over GF(q) So one can also recover all the secrete keys with fewercalls We use our generalized ' even-and-odd test' method to recover the least significant p-adic'bits' of representations of the Lucas Cryptosystem secret keys x Finally, we analyze the EfficientCompact Subgroup Trace Representation (XTR) Diffic-Hellmen secrete keys and point out that if theorder of XIR-subgroup has a specialform then all the bits of the secrete key of XIR ean be recoveredform any bit of the exponent x. 展开更多
关键词 public-key cryptosystem security analysis polynomial transformation bitsecurity DIFFIE-HELLMAN ORACLE
在线阅读 下载PDF
A Characterization of MRA Based Wavelet Frames Generated by the Walsh Polynomials
3
作者 Firdous A. Shah Sunita Goyal 《Analysis in Theory and Applications》 CSCD 2016年第2期164-173,共10页
Extension Principles play a significant role in the construction of MRA based wavelet frames and have attracted much attention for their potential applications in various scientific fields. A novel and simple procedur... Extension Principles play a significant role in the construction of MRA based wavelet frames and have attracted much attention for their potential applications in various scientific fields. A novel and simple procedure for the construction of tight wavelet frames generated by the Walsh polynomials using Extension Principles was recently considered by Shah in [Tight wavelet frames generated by the Walsh poly- nomials, Int. J. Wavelets, Multiresolut. Inf. Process., 11(6) (2013), 1350042]. In this paper, we establish a complete characterization of tight wavelet frames generated by the Walsh polynomials in terms of the polyphase matrices formed by the polyphase components of the Walsh polynomials. 展开更多
关键词 FRAME wavelet frame polyphase matrix extension principles Walsh polynomial Walsh-Fourier transform.
在线阅读 下载PDF
Space Transformation-Based Interdependency Modelling for Probabilistic Load Flow Analysis of Power Systems
4
作者 李雪 陈豪杰 +1 位作者 路攀 杜大军 《Journal of Donghua University(English Edition)》 EI CAS 2016年第5期734-739,共6页
Dependence among random input variables affects importantly the results of probabilistic load flow(PLF),system economic operation,and system security.To solve this problem,the main objectiveness of the paper is to ana... Dependence among random input variables affects importantly the results of probabilistic load flow(PLF),system economic operation,and system security.To solve this problem,the main objectiveness of the paper is to analyze the performance of several schemes for simulating correlated variables combined with the point estimate method(PEM).Unlike the existing works that considering one single scheme combined with Monte Carlo simulation(MCS) or PEM,by neglecting the correlation among random input variables,four schemes were presented for disposing the dependence of correlated random variables,including Nataf transformation /polynomial normal transformation(PINT) combined with orthogonal transformation(OT) / elementary transformation(ET).Combining with the 2m+1 approach of PEM,a space transformation-based formulation was proposed and adopted for solving the PLF.The proposed approach is applied in the modified IEEE 30-bus system while considering correlated wind generations and load demands.Numerical results show the effectiveness of the proposed approach compared with those obtained from the MCS.Results also show that the scheme of combining Nataf transformation and ET with PEM provides the best performance. 展开更多
关键词 transformation probabilistic considering polynomial elementary transformed formulation applying instance simulating
在线阅读 下载PDF
Probabilistic Load Flow Calculation of Power System Integrated with Wind Farm Based on Kriging Model 被引量:1
5
作者 Lu Li Yuzhen Fan +1 位作者 Xinglang Su Gefei Qiu 《Energy Engineering》 EI 2021年第3期565-580,共16页
Because of the randomness and uncertainty,integration of large-scale wind farms in a power system will exert significant influences on the distribution of power flow.This paper uses polynomial normal transformation me... Because of the randomness and uncertainty,integration of large-scale wind farms in a power system will exert significant influences on the distribution of power flow.This paper uses polynomial normal transformation method to deal with non-normal random variable correlation,and solves probabilistic load flow based on Kriging method.This method is a kind of smallest unbiased variance estimation method which estimates unknown information via employing a point within the confidence scope of weighted linear combination.Compared with traditional approaches which need a greater number of calculation times,long simulation time,and large memory space,Kriging method can rapidly estimate node state variables and branch current power distribution situation.As one of the generator nodes in the western Yunnan power grid,a certain wind farm is chosen for empirical analysis.Results are used to compare with those by Monte Carlo-based accurate solution,which proves the validity and veracity of the model in wind farm power modeling as output of the actual turbine through PSD-BPA. 展开更多
关键词 Probabilistic load flow Kriging model wind turbine clusters polynomial normal transformation CORRELATION
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部