Greedy search algorithm based two stage energy saving technique for dense LTE-A HetNets

2017 ◽  
Author(s):  
Harini Narasimhan ◽  
Rohit Kashyap ◽  
A. V. Vikram ◽  
R. C. Deepthi ◽  
Prashant Wali
Keyword(s):  
Energy Saving ◽  
Search Algorithm ◽  
Greedy Search ◽  
Two Stage ◽  
Energy Saving Technique

Two-stage IPv6 route search algorithm based on perfect-Hash table and multibit-trie

2013 ◽  
Vol 33 (5) ◽  
pp. 1194-1196
Author(s):  
Fei DU ◽  
Zhiguo DONG ◽  
Lin MIAO ◽  
Yupeng TUO
Keyword(s):  
Search Algorithm ◽  
Hash Table ◽  
Two Stage ◽  
Route Search

scholarly journals A Compound Wind Power Forecasting Strategy Based on Clustering, Two-Stage Decomposition, Parameter Optimization, and Optimal Combination of Multiple Machine Learning Approaches

Energies ◽  
2019 ◽  
Vol 12 (18) ◽  
pp. 3586 ◽  
Author(s):  
Sizhou Sun ◽  
Jingqi Fu ◽  
Ang Li
Keyword(s):  
Wind Power ◽  
Large Scale ◽  
Wind Farm ◽  
Search Algorithm ◽  
Interpolation Method ◽  
Least Square ◽  
Support Vector ◽  
Two Stage ◽  
Wind Power Forecasting ◽  
Power Forecasting

Given the large-scale exploitation and utilization of wind power, the problems caused by the high stochastic and random characteristics of wind speed make researchers develop more reliable and precise wind power forecasting (WPF) models. To obtain better predicting accuracy, this study proposes a novel compound WPF strategy by optimal integration of four base forecasting engines. In the forecasting process, density-based spatial clustering of applications with noise (DBSCAN) is firstly employed to identify meaningful information and discard the abnormal wind power data. To eliminate the adverse influence of the missing data on the forecasting accuracy, Lagrange interpolation method is developed to get the corrected values of the missing points. Then, the two-stage decomposition (TSD) method including ensemble empirical mode decomposition (EEMD) and wavelet transform (WT) is utilized to preprocess the wind power data. In the decomposition process, the empirical wind power data are disassembled into different intrinsic mode functions (IMFs) and one residual (Res) by EEMD, and the highest frequent time series IMF1 is further broken into different components by WT. After determination of the input matrix by a partial autocorrelation function (PACF) and normalization into [0, 1], these decomposed components are used as the input variables of all the base forecasting engines, including least square support vector machine (LSSVM), wavelet neural networks (WNN), extreme learning machine (ELM) and autoregressive integrated moving average (ARIMA), to make the multistep WPF. To avoid local optima and improve the forecasting performance, the parameters in LSSVM, ELM, and WNN are tuned by backtracking search algorithm (BSA). On this basis, BSA algorithm is also employed to optimize the weighted coefficients of the individual forecasting results that produced by the four base forecasting engines to generate an ensemble of the forecasts. In the end, case studies for a certain wind farm in China are carried out to assess the proposed forecasting strategy.

Two-stage in situ gas stripping for enhanced butanol fermentation and energy-saving product recovery

2013 ◽  
Vol 135 ◽  
pp. 396-402 ◽  
Author(s):  
Chuang Xue ◽  
Jingbo Zhao ◽  
Fangfang Liu ◽  
Congcong Lu ◽  
Shang-Tian Yang ◽  
...  
Keyword(s):  
Energy Saving ◽  
Product Recovery ◽  
Gas Stripping ◽  
Two Stage ◽  
Butanol Fermentation

scholarly journals Language Semantics Interpretation with an Interaction-Based Recurrent Neural Network

2021 ◽  
Vol 3 (4) ◽  
pp. 922-945
Author(s):  
Shaw-Hwa Lo ◽  
Yiqiao Yin
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Language Processing ◽  
Text Classification ◽  
Search Algorithm ◽  
Greedy Search ◽  
Text Documents ◽  
Engineering Technique ◽  
Language Semantics ◽  
Sequential Models

Text classification is a fundamental language task in Natural Language Processing. A variety of sequential models are capable of making good predictions, yet there is a lack of connection between language semantics and prediction results. This paper proposes a novel influence score (I-score), a greedy search algorithm, called Backward Dropping Algorithm (BDA), and a novel feature engineering technique called the “dagger technique”. First, the paper proposes to use the novel influence score (I-score) to detect and search for the important language semantics in text documents that are useful for making good predictions in text classification tasks. Next, a greedy search algorithm, called the Backward Dropping Algorithm, is proposed to handle long-term dependencies in the dataset. Moreover, the paper proposes a novel engineering technique called the “dagger technique” that fully preserves the relationship between the explanatory variable and the response variable. The proposed techniques can be further generalized into any feed-forward Artificial Neural Networks (ANNs) and Convolutional Neural Networks (CNNs), and any neural network. A real-world application on the Internet Movie Database (IMDB) is used and the proposed methods are applied to improve prediction performance with an 81% error reduction compared to other popular peers if I-score and “dagger technique” are not implemented.

Evaluation of Bayesian Network Structure Learning Using Elephant Swarm Water Search Algorithm

2020 ◽  
pp. 139-159
Author(s):  
Shahab Wahhab Kareem ◽  
Mehmet Cudi Okur
Keyword(s):  
Simulated Annealing ◽  
Bayesian Network ◽  
Network Structure ◽  
Structure Learning ◽  
Search Algorithm ◽  
Confusion Matrix ◽  
Data Sets ◽  
Greedy Search ◽  
Bayesian Network Structure ◽  
Bayesian Network Structure Learning

Bayesian networks are useful analytical models for designing the structure of knowledge in machine learning which can represent probabilistic dependency relationships among the variables. The authors present the Elephant Swarm Water Search Algorithm (ESWSA) for Bayesian network structure learning. In the algorithm; Deleting, Reversing, Inserting, and Moving are used to make the ESWSA for reaching the optimal structure solution. Mainly, water search strategy of elephants during drought periods is used in the ESWSA algorithm. The proposed method is compared with Pigeon Inspired Optimization, Simulated Annealing, Greedy Search, Hybrid Bee with Simulated Annealing, and Hybrid Bee with Greedy Search using BDeu score function as a metric for all algorithms. They investigated the confusion matrix performances of these techniques utilizing various benchmark data sets. As presented by the results of evaluations, the proposed algorithm achieves better performance than the other algorithms and produces better scores as well as the better values.

Sign in / Sign up

Export Citation Format

Share Document