期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
On Multiplicative Generators of n-Dimensional Overlap Functions 被引量:1
1
作者 Hai Xie 《Applied Mathematics》 2020年第11期1061-1069,共9页
In this paper, inspired by the multiplicative generators of overlap functions, we mainly propose the concepts of multiplicative generator pairs of n-dimensional overlap functions, in order to extend the dimensionality... In this paper, inspired by the multiplicative generators of overlap functions, we mainly propose the concepts of multiplicative generator pairs of n-dimensional overlap functions, in order to extend the dimensionality of overlap functions from 2 to n. We present the condition under which the pair (<strong>g, h</strong>) can multiplicatively generate an n-dimensional overlap function <em><strong>O</strong></em><sub><strong>g,h</strong></sub><strong>.</strong> we focus on the homogeneity and idempotency property on multiplicatively generated n-dimensional overlap functions. 展开更多
关键词 n-Dimensional Overlap Functions Overlap Functions Multiplicative generators
下载PDF
Generalized multiple time windows model based parallel machine scheduling for TDRSS 被引量:1
2
作者 LIN Peng KUANG Lin-ling +3 位作者 CHEN Xiang YAN Jian LU Jian-hua WANG Xiao-juan 《Journal of Beijing Institute of Technology》 EI CAS 2016年第3期382-391,共10页
The scheduling efficiency of the tracking and data relay satellite system(TDRSS)is strictly limited by the scheduling degrees of freedom(DoF),including time DoF defined by jobs' flexible time windows and spatial ... The scheduling efficiency of the tracking and data relay satellite system(TDRSS)is strictly limited by the scheduling degrees of freedom(DoF),including time DoF defined by jobs' flexible time windows and spatial DoF brought by multiple servable tracking and data relay satellites(TDRSs).In this paper,ageneralized multiple time windows(GMTW)model is proposed to fully exploit the time and spatial DoF.Then,the improvements of service capability and job-completion probability based on the GMTW are theoretically proved.Further,an asymmetric path-relinking(APR)based heuristic job scheduling framework is presented to maximize the usage of DoF provided by the GMTW.Simulation results show that by using our proposal 11%improvement of average jobcompletion probability can be obtained.Meanwhile,the computing time of the time-to-target can be shorten to 1/9 of the GRASP. 展开更多
关键词 parallel machine scheduling problem with generalized multiple time windows (PMGMTW) positive/negative adaptive subsequence adjustment (p/n-ASA) evolutionary asymmetric key-path-relinking (EvAKPR)
下载PDF
Application of Multiple Mean Generational Function Method to Typhoon Prediction over the Western North Pacific
3
作者 Qing Chen Shuyun Yang +1 位作者 Yufang Liao Nengjin Chen 《Meteorological and Environmental Research》 CAS 2013年第4期26-28,共3页
[ Objective] The multiple mean generational function (MMGF) method was applied to forecast the annual number of typhoons (TYs) over the Western North Pacific (WNP). [Method]The method yields a number of predicto... [ Objective] The multiple mean generational function (MMGF) method was applied to forecast the annual number of typhoons (TYs) over the Western North Pacific (WNP). [Method]The method yields a number of predictors by mean generational function based on the rolling 50- year data of TYs frequency and sunspot number, and was repeated to generate forecasts year after year by optimal subset regression. [ Result] The results showed a reasonably high predictive ability dudng period 2000 -2010, with an average root mean square (RMSE) value of 1.92 and a mean absolute error (MAE) value of 1.64. [ Conclusion] Although the MMGF method needs further validation in the practical operation, it already has strong potential for the improvement of skill at forecasting annual frequency of TYs in the WNP. 展开更多
关键词 TYPHOONS multiple mean generational function PREDICTION China
下载PDF
Creation of radially polarized optical fields with multiple controllable parameters using a vectorial optical field generator 被引量:1
4
作者 Sichao Zhou Shiyi Wang +2 位作者 Jian Chen Guanghao Rui Qiwen Zhan 《Photonics Research》 SCIE EI 2016年第5期35-39,共5页
A vectorial optical field generator(VOF-Gen) based on two reflective phase-only liquid crystal spatial light modulators enables the creation of an arbitrary optical complex field. In this work, the capabilities of the... A vectorial optical field generator(VOF-Gen) based on two reflective phase-only liquid crystal spatial light modulators enables the creation of an arbitrary optical complex field. In this work, the capabilities of the VOF-Gen in terms of manipulating the spatial distributions of phase, amplitude, and polarization are experimentally demonstrated by generating a radially polarized optical field consisted of five annular rings, the focusing properties of which are also numerically studied with vectorial diffraction theory. By carefully adjusting the relative amplitude and phase between the adjacent rings, an optical needle field with purely longitudinal polarization can be produced in the focal region of a high numerical aperture lens. The versatile method presented in this work can be easily extended to the generation of a vectorial optical field with any desired complex distributions. 展开更多
关键词 Creation of radially polarized optical fields with multiple controllable parameters using a vectorial optical field generator SLM
原文传递
THE MULTIPLICATIVE COMPLEXITY AND ALGORITHM OF THE GENERALIZED DISCRETE FOURIER TRANSFORM(GFT)
5
作者 Y.H. Zeng(7th Department, National University of Defence Technology, Changsha, China) 《Journal of Computational Mathematics》 SCIE CSCD 1995年第4期351-356,共6页
In this paper, we have proved that the lower bound of the number of real multiplications for computing a length 2(t) real GFT(a,b) (a = +/-1/2, b = 0 or b = +/-1/2, a = 0) is 2(t+1) - 2t - 2 and that for computing a l... In this paper, we have proved that the lower bound of the number of real multiplications for computing a length 2(t) real GFT(a,b) (a = +/-1/2, b = 0 or b = +/-1/2, a = 0) is 2(t+1) - 2t - 2 and that for computing a length 2t real GFT(a,b)(a = +/-1/2, b = +/-1/2) is 2(t+1) - 2. Practical algorithms which meet the lower bounds of multiplications are given. 展开更多
关键词 DCT II THE MULTIPLICATIVE COMPLEXITY AND ALGORITHM OF THE GENERALIZED DISCRETE FOURIER TRANSFORM Math GFT
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部