期刊文献+
共找到17篇文章
< 1 >
每页显示 20 50 100
Real-Time Automatic Scaling Method of Oblique Ionogram Parameters Based on Morphological Operator and Inversion Technique 被引量:1
1
作者 HU Yaogai SONG Huan ZOU Xianjian 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2015年第4期323-328,共6页
Automatic scaling ionogram can get the parameters of ionogram which are vital to ionosphere detecting. In this paper, a new method is proposed to scale F2 layer trace automatically from oblique ionogram based on morph... Automatic scaling ionogram can get the parameters of ionogram which are vital to ionosphere detecting. In this paper, a new method is proposed to scale F2 layer trace automatically from oblique ionogram based on morphological operator and inversion technique. This method is verified through the comparison of actual detecting data with statistical analysis. The results show that the proposed automatic scaling method has high acceptable rate and is suitable for scaling oblique ionogram with different high angle wave states. It is fast and precise to fit O-mode echoes in F2 layer without the influence from F1 layer. This method could be applied in real-time ionospheric oblique sounding research with high reliability and versatility. 展开更多
关键词 parameters inversion oblique ionogram automatic scaling hybrid genetic algorithm(HGA)
原文传递
THE EFFECTIVENESS OF GENETIC ALGORITHM IN CAPTURING CONDITIONAL NONLINEAR OPTIMAL PERTURBATION WITH PARAMETERIZATION “ON-OFF” SWITCHES INCLUDED BY A MODEL 被引量:2
2
作者 方昌銮 郑琴 《Journal of Tropical Meteorology》 SCIE 2009年第1期13-19,共7页
In the typhoon adaptive observation based on conditional nonlinear optimal perturbation (CNOP), the ‘on-off’ switch caused by moist physical parameterization in prediction models prevents the conventional adjoint me... In the typhoon adaptive observation based on conditional nonlinear optimal perturbation (CNOP), the ‘on-off’ switch caused by moist physical parameterization in prediction models prevents the conventional adjoint method from providing correct gradient during the optimization process. To address this problem, the capture of CNOP, when the "on-off" switches are included in models, is treated as non-smooth optimization in this study, and the genetic algorithm (GA) is introduced. After detailed algorithm procedures are formulated using an idealized model with parameterization "on-off" switches in the forcing term, the impacts of "on-off" switches on the capture of CNOP are analyzed, and three numerical experiments are conducted to check the effectiveness of GA in capturing CNOP and to analyze the impacts of different initial populations on the optimization result. The result shows that GA is competent for the capture of CNOP in the context of the idealized model with parameterization ‘on-off’ switches in this study. Finally, the advantages and disadvantages of GA in capturing CNOP are analyzed in detail. 展开更多
关键词 dynamic meteorology typhoon adaptive observation genetic algorithm conditional nonlinear optimal perturbation switches moist physical parameterization
在线阅读 下载PDF
Effects of transmitter-related parameter settings on ranging accuracy for IR-UWB systems
3
作者 吴绍华 张钦宇 张乃通 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2010年第1期51-57,共7页
For impulse radio ultra-wideband (IR-UWB) ranging systems,effects of the settings of transmitter-related parameters, which include the pulse shape, the bandwidth and the pulse repetition interval (PRI), on ranging acc... For impulse radio ultra-wideband (IR-UWB) ranging systems,effects of the settings of transmitter-related parameters, which include the pulse shape, the bandwidth and the pulse repetition interval (PRI), on ranging accuracy were studied through theoretical analysis and simulations. Both the match-filtering based coherent TOA estimation algorithm and the energy-detection based non-coherent algorithm were used during simulations. Results show that the pulse shape has the least effect on the ranging accuracy. Increasing the pulse bandwidth can improve the ranging performance, but the performance is hardly improved any more when the bandwidth is increased beyond a certain level. PRI should be set long enough to guarantee the accurate ranging, because when PRI is shorter than the maximum excess delay of the channel, the ranging accuracy will be deteriorated by inter-pulse interference. 展开更多
关键词 IR-UWB ranging TOA estimation algorithm parameter setting match-filtering energy-detection
在线阅读 下载PDF
Optimization and Simulation of Plastic Injection Process using Genetic Algorithm and Moldflow 被引量:15
4
作者 Sigit Yoewono Martowibowo Agung Kaswadi 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2017年第2期398-406,共9页
The use of plastic-based products is continuously increasing. The increasing demands for thinner products, lower production costs, yet higher product quality has triggered an increase in the number of research project... The use of plastic-based products is continuously increasing. The increasing demands for thinner products, lower production costs, yet higher product quality has triggered an increase in the number of research projects on plastic molding processes. An important branch of such research is focused on mold cooling system. Conventional cooling systems are most widely used because they are easy to make by using conventional machining processes. However, the non-uniform cooling processes are considered as one of their weaknesses. Apart from the conven- tional systems, there are also conformal cooling systems that are designed for faster and more uniform plastic mold cooling. In this study, the conformal cooling system is applied for the production of bowl-shaped product made of PP AZ564. Optimization is conducted to initiate machine setup parameters, namely, the melting temperature, injection pressure, holding pressure and holding time. The genetic algorithm method and Moldflow were used to optimize the injection process parameters at a minimum cycle time. It is found that, an optimum injection molding processes could be obtained by setting the parameters to the following values: TM=180℃; Pinj = 20MPa; Phold= 16MPa and thold=8s, with a cycle time of 14.11 s. Experiments using the conformal cooling system yielded an average cycle time of 14.19 s. The studied conformal cooling system yielded a volumetric shrinkage of 5.61% and the wall shear stress was found at 0.17 MPa. The difference between the cycle time obtained through simulations and experiments using the conformal cooling system was insignificant (below 1%). Thus, combining process parameters optimization and simulations by using genetic algorithm method with Moldflow can be considered as valid. 展开更多
关键词 Conformal cooling parameters optimization Genetic algorithm MOLDFLOW Cycle time
在线阅读 下载PDF
Real-time fault detection method based on belief rule base for aircraft navigation system 被引量:14
5
作者 Zhao Xin Wang Shicheng +2 位作者 Zhang Jinsheng Fan Zhiliang Min Haibo 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2013年第3期717-729,共13页
Real-time and accurate fault detection is essential to enhance the aircraft navigation system’s reliability and safety. The existent detection methods based on analytical model draws back at simultaneously detecting ... Real-time and accurate fault detection is essential to enhance the aircraft navigation system’s reliability and safety. The existent detection methods based on analytical model draws back at simultaneously detecting gradual and sudden faults. On account of this reason, we propose an online detection solution based on non-analytical model. In this article, the navigation system fault detection model is established based on belief rule base (BRB), where the system measuring residual and its changing rate are used as the inputs of BRB model and the fault detection function as the output. To overcome the drawbacks of current parameter optimization algorithms for BRB and achieve online update, a parameter recursive estimation algorithm is presented for online BRB detection model based on expectation maximization (EM) algorithm. Furthermore, the proposed method is verified by navigation experiment. Experimental results show that the proposed method is able to effectively realize online parameter evaluation in navigation system fault detection model. The output of the detection model can track the fault state very well, and the faults can be diagnosed in real time and accurately. In addition, the detection ability, especially in the probability of false detection, is superior to offline optimization method, and thus the system reliability has great improvement. 展开更多
关键词 Belief rule base Fault detection Fault tolerant control Integrated navigation parameter recursive estimation algorithm
原文传递
Stability of multiple fans in mine ventilation networks 被引量:6
6
作者 El-Nagdy K.A. 《International Journal of Mining Science and Technology》 SCIE EI 2013年第4期558-560,共3页
In large mines,single fan is usually not enough to ventilate all the working areas.Single mine-fan approach cannot be directly applied to multiple-fan networks because the present of multiple pressures and air quantit... In large mines,single fan is usually not enough to ventilate all the working areas.Single mine-fan approach cannot be directly applied to multiple-fan networks because the present of multiple pressures and air quantities associated with each fan in the network.Accordingly,each fan in a multiple-fan system has its own mine characteristic curve,or a subsystem curve.Under some consideration,the conventional concept of a mine characteristic curve of a single-fan system can be directly extended to that of a particular fan within a multiple-fan system.In this paper the mutual effect of the fans on each other and their effect on the stability of the ventilation network were investigated by Hardy Cross algorithm combined with a switching-parameters technique.To show the validity and reliability of this algorithm,the stability of the ventilation system of Abu-Tartur Mine(one of the largest underground mine in Egypt)has been studied. 展开更多
关键词 Mine ventilation Multiple fan ventilated network Hardy Cross algorithm Switching parameters technique Abu-Tartur Mine
在线阅读 下载PDF
A method for aircraft magnetic interference compensation based on small signal model and LMS algorithm 被引量:4
7
作者 Zhou Jianjun Lin Chunsheng Chen Hao 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2014年第6期1578-1585,共8页
Aeromagnetic interference could not be compensated effectively if the precision of parameters which are solved by the aircraft magnetic field model is low. In order to improve the compensation effect under this condit... Aeromagnetic interference could not be compensated effectively if the precision of parameters which are solved by the aircraft magnetic field model is low. In order to improve the compensation effect under this condition, a method based on small signal model and least mean square(LMS) algorithm is proposed. According to the method, the initial values of adaptive filter's weight vector are calculated with the solved model parameters through small signal model at first,then the small amount of direction cosine and its derivative are set as the input of the filter, and the small amount of the interference is set as the filter's expected vector. After that, the aircraft magnetic interference is compensated by LMS algorithm. Finally, the method is verified by simulation and experiment. The result shows that the compensation effect can be improved obviously by the LMS algorithm when original solved parameters have low precision. The method can further improve the compensation effect even if the solved parameters have high precision. 展开更多
关键词 Adaptive filter Aeromagnetic survey Aircraft magnetic interference Least mean square algorithm Magnetic interference compensation Model parameter
原文传递
Adaptive backtracking search optimization algorithm with pattern search for numerical optimization 被引量:6
8
作者 Shu Wang Xinyu Da +1 位作者 Mudong Li Tong Han 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2016年第2期395-406,共12页
The backtracking search optimization algorithm(BSA) is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powe... The backtracking search optimization algorithm(BSA) is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts: the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA's important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014(IEEE CEC2014) over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm. 展开更多
关键词 evolutionary algorithm backtracking search optimization algorithm(BSA) Hooke-Jeeves pattern search parameter adaption numerical optimization
在线阅读 下载PDF
Parrondo's paradox for chaos control and anticontrol of fractional-order systems
9
作者 Marius-F Danca Wallace K S Tang 《Chinese Physics B》 SCIE EI CAS CSCD 2016年第1期507-513,共7页
We present the generalized forms of Parrondo's paradox existing in fractional-order nonlinear systems.The gener-alization is implemented by applying a parameter switching(PS)algorithm to the corresponding initial ... We present the generalized forms of Parrondo's paradox existing in fractional-order nonlinear systems.The gener-alization is implemented by applying a parameter switching(PS)algorithm to the corresponding initial value problems associated with the fractional-order nonlinear systems.The PS algorithm switches a system parameter within a specific set of N≥2 values when solving the system with some numerical integration method.It is proven that any attractor of the concerned system can be approximated numerically.By replacing the words"winning"and"loosing"in the classical Parrondo's paradox with"order"and"chaos",respectively,the PS algorithm leads to the generalized Parrondo's paradox:chaos_(1)+chaos_(2)+…+chaos_(N)=order and order_(1)+order_(2)+…+order_(N)=chaos.Finally,the concept is well demon-strated with the results based on the fractional-order Chen system. 展开更多
关键词 Parrondo's paradox chaos control parameter switching algorithm fractional-order Chen system
原文传递
Effective prediction of DEA model by neural network
10
作者 孙佰清 董靖巍 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2009年第5期683-686,共4页
In this paper,a fast neural network model for the forecasting of effective points by DEA model is proposed,which is based on the SPDS training algorithm.The SPDS training algorithm overcomes the drawbacks of slow conv... In this paper,a fast neural network model for the forecasting of effective points by DEA model is proposed,which is based on the SPDS training algorithm.The SPDS training algorithm overcomes the drawbacks of slow convergent speed and partially minimum result for BP algorithm.Its training speed is much faster and its forecasting precision is much better than those of BP algorithm.By numeric examples,it is showed that adopting the neural network model in the forecasting of effective points by DEA model is valid. 展开更多
关键词 multi-layer neural network single parameter dynamic searching algorithm BP algorithm DEA forecasting
在线阅读 下载PDF
Some Open Problems in Parameterized Complexity Related to the Work of Jianer Chen 被引量:1
11
作者 Michael Ralph Fellows 《Tsinghua Science and Technology》 SCIE EI CAS 2014年第4期325-328,共4页
This short paper highlights some open problems related to the work of Jianer Chen in the area of parameterized/multivariate algorithmics.
关键词 parameterized complexity multivariate algorithmics open problems
原文传递
Kernelization in Parameterized Computation: A Survey
12
作者 Qilong Feng Qian Zhou +1 位作者 Wenjun Li Jianxin Wang 《Tsinghua Science and Technology》 SCIE EI CAS 2014年第4期338-345,共8页
Parameterized computation is a new method dealing with NP-hard problems, which has attracted a lot of attentions in theoretical computer science. As a practical preprocessing method for NP-hard problems, kernelizaiton... Parameterized computation is a new method dealing with NP-hard problems, which has attracted a lot of attentions in theoretical computer science. As a practical preprocessing method for NP-hard problems, kernelizaiton in parameterized computation has recently become an active research area. In this paper, we discuss several kernelizaiton techniques, such as crown decomposition, planar graph vertex partition, randomized methods, and kernel lower bounds, which have been used widely in the kernelization of many hard problems. 展开更多
关键词 parameterized computation kernelization parameterized algorithm NP-hard
原文传递
Social Choice Meets Graph Drawing: How to Get Subexponential Time Algorithms for Ranking and Drawing Problems
13
作者 Henning Fernau Fedor V.Fomin +3 位作者 Daniel Lokshtanov Matthias Mnich Geevarghese Philip Saket Saurabh 《Tsinghua Science and Technology》 SCIE EI CAS 2014年第4期374-386,共13页
We analyze a common feature of p-Kemeny AGGregation(p-KAGG) and p-One-Sided Crossing Minimization(p-OSCM) to provide new insights and findings of interest to both the graph drawing community and the social choice ... We analyze a common feature of p-Kemeny AGGregation(p-KAGG) and p-One-Sided Crossing Minimization(p-OSCM) to provide new insights and findings of interest to both the graph drawing community and the social choice community. We obtain parameterized subexponential-time algorithms for p-KAGG—a problem in social choice theory—and for p-OSCM—a problem in graph drawing. These algorithms run in time O*(2O(√k log k)),where k is the parameter, and significantly improve the previous best algorithms with running times O.1.403k/and O.1.4656k/, respectively. We also study natural "above-guarantee" versions of these problems and show them to be fixed parameter tractable. In fact, we show that the above-guarantee versions of these problems are equivalent to a weighted variant of p-directed feedback arc set. Our results for the above-guarantee version of p-KAGG reveal an interesting contrast. We show that when the number of "votes" in the input to p-KAGG is odd the above guarantee version can still be solved in time O*(2O(√k log k)), while if it is even then the problem cannot have a subexponential time algorithm unless the exponential time hypothesis fails(equivalently, unless FPT D M[1]). 展开更多
关键词 Kemeny aggregation one-sided crossing minimization parameterized complexity subexponential-time algorithms social choice theory graph drawing directed feedback arc set
原文传递
Parameterized Algorithmics for Computational Social Choice:Nine Research Challenges
14
作者 Robert Bredereck Jiehua Chen +3 位作者 Piotr Faliszewski Jiong Guo Rolf Niedermeier Gerhard J.Woeginger 《Tsinghua Science and Technology》 SCIE EI CAS 2014年第4期358-373,共16页
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science,and Social Science on the one side, and Mathematics and Computer Science(including Artificial Intelligence and ... Computational Social Choice is an interdisciplinary research area involving Economics, Political Science,and Social Science on the one side, and Mathematics and Computer Science(including Artificial Intelligence and Multiagent Systems) on the other side. Typical computational problems studied in this field include the vulnerability of voting procedures against attacks, or preference aggregation in multi-agent systems. Parameterized Algorithmics is a subfield of Theoretical Computer Science seeking to exploit meaningful problem-specific parameters in order to identify tractable special cases of in general computationally hard problems. In this paper, we propose nine of our favorite research challenges concerning the parameterized complexity of problems appearing in this context. This work is dedicated to Jianer Chen, one of the strongest problem solvers in the history of parameterized algorithmics,on the occasion of his 60 th birthday. 展开更多
关键词 NP-hard problems parameterized complexity fixed-parameter tractability kernelization exact algorithms voting decision making cake cutting
原文传递
Optimized extreme learning machine for urban land cover classification using hyperspectral imagery 被引量:2
15
作者 Hongjun SU Shufang TIAN +3 位作者 Yue CAI Yehua SHENG Chen CHEN Maryam NAJAFIAN 《Frontiers of Structural and Civil Engineering》 SCIE EI CSCD 2017年第4期765-773,共9页
This work presents a new urban land cover classification framework using the firefly algorithm (FA) optimized extreme learning machine (ELM). FA is adopted to optimize the regularization coefficient C and Ganssian... This work presents a new urban land cover classification framework using the firefly algorithm (FA) optimized extreme learning machine (ELM). FA is adopted to optimize the regularization coefficient C and Ganssian kernel σ for kernel ELM. Additionally, effectiveness of spectral features derived from an FA-based band selection algorithm is studied for the proposed classification task. Three sets of hyperspectral databases were recorded using different sensors, namely HYDICE, HyMap, and AVIRIS. Our study shows that the proposed method outperforms traditional classification algorithms such as SVM and reduces computational cost significantly. 展开更多
关键词 extreme learning machine firefly algorithm parameters optimization hyperspectral image classification
原文传递
Digital twin modeling method for lithium-ion batteries based on data-mechanism fusion driving 被引量:1
16
作者 Chao Lyu Shaochun Xu +1 位作者 Junfu Li Michael Pecht 《Green Energy and Intelligent Transportation》 2024年第5期52-69,共18页
Lithium-ion batteries have been rapidly developed as clean energy sources in many industrial fields,such as new energy vehicles and energy storage.The core issues hindering their further promotion and application are ... Lithium-ion batteries have been rapidly developed as clean energy sources in many industrial fields,such as new energy vehicles and energy storage.The core issues hindering their further promotion and application are reliability and safety.A digital twin model that maps onto the physical entity of the battery with high simulation accuracy helps to monitor internal states and improve battery safety.This work focuses on developing a digital twin model via a mechanism-data-driven parameter updating algorithm to increase the simulation accuracy of the internal and external characteristics of the full-time domain battery under complex working conditions.An electrochemical model is first developed with the consideration of how electrode particle size impacts battery characteristics.By adding the descriptions of temperature distribution and particle-level stress,a multi-particle size electrochemical-thermal-mechanical coupling model is established.Then,considering the different electrical and thermal effect among individual cells,a model for the battery pack is constructed.A digital twin model construction method is finally developed and verified with battery operating data. 展开更多
关键词 Lithium-ion battery Multi-particle size electrochemical-thermalmechanical coupling model Online model parameter updating algorithm Digital twin
原文传递
Dynamic Dominating Set and Turbo-Charging Greedy Heuristics
17
作者 Rodney G.Downey Judith Egan +2 位作者 Michael R.Fellows Frances A.Rosamond Peter Shaw 《Tsinghua Science and Technology》 SCIE EI CAS 2014年第4期329-337,共9页
The main purpose of this paper is to exposit two very different,but very general,motivational schemes in the art of parameterization and a concrete example connecting them.We introduce a dynamic version of the DOMINAT... The main purpose of this paper is to exposit two very different,but very general,motivational schemes in the art of parameterization and a concrete example connecting them.We introduce a dynamic version of the DOMINATING SET problem and prove that it is fixed-parameter tractable(FPT).The problem is motivated by settings where problem instances evolve.It also arises in the quest to improve a natural greedy heuristic for the DOMINATING SET problem. 展开更多
关键词 KERNELIZATION multivariate algorithms parameterized algorithms turbo-charging HEURISTICS
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部