检索结果-南通市图书馆

Applied Mathematics(A Journal of Chinese Universities) 2021年第3期36卷 412-419页

作者： CAO Zhen-bin WANG Meng Department of Mathematics Zhejiang UniversityHangzhou 310027China

In[3],Chen,Deng,Ding and Fan proved that the fractional power dissipative operator is bounded on Lebesgue spaces Lp(Rn),Hardy spaces Hp(Rn)and general mixed norm spaces,which implies almost everywhere convergence of such *** this paper,we study the rate of convergence on fractional power dissipative operator on some sobolev type spaces.

关键词： convergence speed dissipative operator sobolev type spaces

维普期刊数据库

Adaptive Simplified Chicken Swarm Optimization Based on Inverted S-Shaped Inertia Weight

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2022年第2期31卷 367-386页

作者： GU Yanchun LU Haiyan XIANG Lei SHEN Wanqiang School of Science Jiangnan University Wuxi Engineering Technology Research Center for Biological Computing Jiangnan University

Considering the issues of premature convergence and low solution accuracy in solving high-dimensional problems with the basic chicken swarm optimization algorithm, an adaptive simplified chicken swarm optimization algorithm based on inverted S-shaped inertia weight(ASCSO-S) is proposed. Firstly, a simplified chicken swarm optimization algorithm is presented by removing all the chicks from the chicken swarm. Secondly, an inverted S-shaped inertia weight is designed and introduced into the updating process of the roosters and hens to dynamically adjust their moving step size and thus to improve the convergence speed and solution accuracy of the algorithm. Thirdly, in order to enhance the exploration ability of the algorithm, an adaptive updating strategy is added to the updating process of the *** experiments on 21 classical test functions show that ASCSO-S is superior to the other comparison algorithms in terms of convergence speed, solution accuracy, and solution stability. In addition, ASCSO-S is applied to the parameter estimation of Richards model, and the test results indicate that ASCSO-S has the best fitting results compared with other three algorithms.

关键词： particle swarm optimisation solution stability adaptive simplified chicken swarm optimization algorithm parameter estimation Richards model solution accuracy swarm intelligence inverted S-shaped inertia weight convergence speed adaptive updating strategy convergence updating process ASCSO-S

求解网格方程的SOR迭代法之收敛速度与条件数的关系

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

高等学校计算数学学报 2005年第S1期 210-214页

作者：刘播吉林大学数学学院长春 130012

在求解线性代数方程组 Au=b (1) 时,系数矩阵A的条件数除了对求解的稳定性有重要影响外,在用迭代法求解时,对收敛速度亦有重要影响．

关键词： Grid Functions SOR iterative method convergence speed condition Number.

Digital and analog hybrid control in adaptive interference cancellation system

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2010年第6期17卷 1-10页

作者： JIANG Yun-hao ZHAO Zhi-hua TANG Jian LI Wen-lu XIAO Huan College of Electrical and Electronic Engineering Huazhong Utliversity of Science and Technology Wuhan 430074 China National Key Laboratory for Vessel Integrated Power System Technology Naval University of Engineering Wuhan 430033 China

The digital proportion control is introduced to improve the performance of the analog adaptive interference cancellation system （ICS）. For the high frequency parts of the signals after multiplier are not required,the sampling frequency need not satisfy the sampling theorem for high frequency. Because the sampling,calculation and output expend time in digital control,the ideal condition,delay condition and delay-wait condition are taken into account. Through analyzing the system model with three conditions,we gain the stable conditions of the system,the optimization step factors that can make the system converge fastest and the formulas of the interference cancellation ratios （ICRs）. One step convergence can be accomplished under ideal condition,whereas the system can not converge in one step under delay condition and delay-wait condition. The calculation results show the convergence speed of delay-wait condition is slower than that of delay condition. The ICR is improved with the increase of the step factor which is in stable bound,but the convergence speed is decreased if the step factor exceeds the optimization step factor. In order to avoid that confine,the method of amending the steady state weight to improve the ICR is proposed. The analyses are in agreement with the computer simulations.

关键词： digital and analog hybrid control adaptive interference cancellation weight ICR convergence speed

维普期刊数据库

Model free optimization of building cooling water systems with refined action space

在线全文

学校读者我要写书评

暂无评论

Building Simulation 2023年第4期16卷 615-627页

作者： Qiaofeng Xiong Zhengwei Li Wenxia Cai Zhechao Wang School of Mechanical Engineering Tongji University ShanghaiChina Key Laboratory of Performance Evolution and Control for Engineering Structures of Ministry of Education Tongji UniversityShanghaiChina

Deep Q Network(DQN)is an efficient model-free optimization method,and has the potential to be used in building cooling water ***,due to the high dimension of actions,this method requires a complex neural ***,both the required number of training samples and the length of convergence period are barriers for real ***,penalty function based exploration may lead to unsafe actions,causing the application of this optimization method even more *** solve these problems,an approach to limit the action space within a safe area is proposed in this *** of all,the action space for cooling towers and pumps are separated into two ***,for each type of equipment,the action space is further divided into safe and unsafe *** a result,the convergence speed is significantly *** with the traditional DQN method in a simulation environment validated by real data,the proposed method is able to save the convergence time by 1 episode(one cooling season).The results in this paper suggest that,the proposed DQN method can achieve a much quicker learning speed without any undesired consequences,and therefore is more suitable to be used in projects without pre-learning stage.

关键词： building cooling water system cooling tower cooling water pump DQN controller convergence speed

A Whale Optimization Algorithm with Distributed Collaboration and Reverse Learning Ability

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2023年第6期75卷 5965-5986页

作者： Zhedong Xu Yongbo Su Fang Yang Ming Zhang School of Architecture and Civil Engineering Anhui Polytechnic UniversityWuhu241000China

Due to the development of digital transformation,intelligent algorithms are getting more and more *** whale optimization algorithm(WOA)is one of swarm intelligence optimization algorithms and is widely used to solve practical engineering optimization ***,with the increased dimensions,higher requirements are put forward for algorithm *** double population whale optimization algorithm with distributed collaboration and reverse learning ability(DCRWOA)is proposed to solve the slow convergence speed and unstable search accuracy of the WOA algorithm in optimization *** the DCRWOA algorithm,the novel double population search strategy is ***,the reverse learning strategy is adopted in the population search process to help individuals quickly jump out of the non-ideal search *** experi-ments are carried out using standard test functions with different dimensions(10,50,100,200).The optimization case of shield construction parameters is also used to test the practical application performance of the proposed *** results show that the DCRWOA algorithm has higher optimization accuracy and stability,and the convergence speed is significantly ***,the proposed DCRWOA algorithm provides a better method for solving practical optimization problems.

关键词： Whale optimization algorithm double population cooperation distribution reverse learning convergence speed

Energy-Efficient Mapping for 3D NoC Using Logistic Function Based Adaptive Genetic Algorithms

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2014年第2期23卷 254-262页

作者： WANG Jiawen LI Li WANG Zhongfeng ZHANG Rong ZHANG Yuang Institute of VLSI Design LAPEM Nanjing University

The problem of mapping application tasks is one of key issues in 3D Network on chip(3D NoC) design. A novel Logistic function based adaptive genetic algorithm(LFAGA) is proposed for energy-aware mapping of homogeneous 3D NoC. We formulate the mapping problem and show the Standard genetic algorithm(SGA). The LFAGA is presented in detail with the goal of obtaining higher convergence speed while preventing the premature convergence. Experimental results indicate that the proposed LFAGA is more efficient than previously proposed Chaos-genetic mapping algorithm(CGMAP). In the experiments, a randomly generated task graph of size 27 is mapped to a 3D NoC of size 3×3×3, the convergence speed of LFAGA is 2.55 times faster than CGMAP in the best condition. When the task size increases to 64 and the 3D NoC size extends to 4×4×4, LFAGA is 2.31 times faster compared to CGMAP. For the No C sizes in the range from 3×3×2 to 4×4×4, solutions obtained by the LFAGA are consistently better than the CGMAP. For example, in the experiment of size 4×4×4, the improvement of final result reaches 30.0% in term of energy consumption. For a real application of size 3×4×2, 18.6% of energy saving can be achieved and the convergence speed is 1.58 times faster than that of the CGMAP.

关键词： Energy-aware mapping 3D NoC Logisitc function Adaptive genetic algorithm convergence speed

Effect of spatial spectrum overlap on Fourier ptychographic microscopy

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Innovative Optical Health Sciences 2017年第2期10卷 11-22页

作者： Qiulan Liu Cuifang Kuang Yue Fang Peng Xiu Yicheng Li Ruixin Wen Xu Linu State Key Laboratory of Modern Optical Instrumentation College of Optical Science and Engineering Zhejiang University Hangzhou 310027 P.R.China Collaborative Innovation Center of Extreme Optics Shanxi University Taiyuan030006P.R.China

Fourier ptychographic microscopy(FPM)is a newly developed imaging technique which stands out by virtue of its high-resolution and wide *** improves a microscope's imaging perfor-mance beyond the diffraction limit of the employed optical components by illuminating the sample with oblique waves of different incident angles,similar to the concept of synthetic *** propose to use an objective lens with high-NA to generate oblique illuminating waves in *** demonstrate utilizing an objective lens with higher NA to iluminate the sample leads to better resolution by simulations,in which a resolution of 0.28 pum is achieved by using a high-NA illuminating objective lens(NA=1.49)and a low-NA collecting objective lens(NA=0.2)in coherent imaging(λ=488 nm).We then deeply study FPM's exact relevance of convergence speed to spatial spectrum overlap in frequency *** simulation results show that an overlap of about 60%is the optimal choice to acquire a high-quality recovery(520*520 pixels)with about 2 min's computing *** addition,we testify the robustness of the algorithm of FPM to additive noises and its suitability for phase objects,which further proves FPM's potential application in biomedical imaging.

关键词： Fourier ptychographic microscopy synthetic aperture convergence speed spatial spectrum overlap.

Replica horizontal-shuffled iterative decoding of low-density parity-check codes

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2010年第6期17卷 32-40页

作者： YANG Yang HUANG Jian-zhong TONG Sheng WANG Xin-mei State Key Laboratory of Integrated Service Networks Xidian University Xi'an 710071 China Department of Electrical and Computer Engineering University of Connecticut Storrs CT 06269 USA

For practical considerations,it is essential to accelerate the convergence speed of the decoding algorithm used in an iterative decoding system. In this paper,replica versions of horizontal-shuffled decoding algorithms for low-density parity-check （LDPC） codes are proposed to improve the convergence speed of the original versions. The extrinsic information transfer （EXIT） chart technique is extended to the proposed algorithms to predict their convergence behavior. Both EXIT chart analysis and numerical results show that replica plain horizontal-shuffled （RPHS） decoding converges much faster than both plain horizontal-shuffled （PHS） decoding and the standard belief-propagation （BP） decoding. Furthermore,it is also revealed that replica group horizontal-shuffled （RGHS） decoding can increase the parallelism of RPHS decoding as well as preserve its high convergence speed if an equivalence condition is satisfied,and is thus suitable for hardware implementation.

关键词： replica shuffled decoding LDPC codes EXIT chart convergence speed

维普期刊数据库