Metaheuristic Optimization‐Based Sliding Mode Control With Modified Perturb and Observe for Controlling MPPT of a PV Interfaced Grid Connected System by Anupama Ganguly (22502969)

“…These two performance figures for various transition instances demonstrate that the suggested MPPT algorithm can determine the global MPP for the new shading pattern (SP) when it shifts from a uniform state to a partially shaded condition at 4s (middle of the <i>x</i>‐axis).…”

Multidimensional Gains for Stochastic Approximation by Saab, Samer S.

“…Instead of a scalar step size, we use an iterate-dependent matrix gain to effectively weigh the different elements associated with the noisy observations. …”
Get full text
Get full text
Get full text
Get full text

Power system output feedback stabilizer design via geneticalgorithms by Abdel-Magid, Y.L.

“…In the second method, the problem of selecting the output feedback gains is converted to a simple optimization problem with an eigenvalue based objective function, which is solved by a genetic algorithm. …”
Get full text
Get full text

Autonomous Robot Navigation Based On Recurrent Neural Networks by Al-Sagban, Mariam Qusai

Get full text

UAV Trajectory Planning for Data Collection from Time-Constrained IoT Devices by Samir, Moataz

“…We demonstrate the favourable characteristics of the proposed algorithms via extensive simulation results and analysis as a function of various system parameters, with benchmarking against two greedy algorithms based on distance and deadline metrics.…”
Get full text
Get full text
Get full text
Get full text

Modeling of magnetization curves for computer-aided design by Abuelma’atti, M.T.

“…A simple algorithm is presented for obtaining the coefficients of the sine-series function for modelling the magnetization curves of magnetic materials. …”
Get full text
Get full text

Robust tuning of power system stabilizers in multimachine powersystems by Abdel-Magid, Y.L.

“…The problem of selecting the stabilizer parameters is converted to a simple optimization problem with an eigenvalue-based objective function, which is solved by a tabu search algorithm. …”
Get full text
Get full text

Rate Adaptation in Dynamic Adaptive Video Streaming Over HTTP by Abdelhafez, Nada

Get full text

Adaptive cooperative control of nonlinear multi-agent systems with uncertain time-varying control directions and dead-zone nonlinearity by Maryam Shahriari-kahkeshi (17269051)

“…It is assumed that no prior knowledge about the uncertain nonlinearities of agents, disturbances, dead-zone parameters, magnitude and sign of the control gain is available. In this paper, a Nussbaum function is used to deal with the unknown time-varying control directions problem and a disturbance-like term in the dead-zone description is approximated by an adaptive TSK-type fuzzy system. …”

Fragment-based computational protein structure prediction by Mansour, Nashat

“…The method is based on a two-phase Scatter Search algorithm that minimizes the energy function. …”
Get full text
Get full text
Get full text

Economic Production Lot-Sizing For An Unreliable Machine Under Imperfect Age-Based Maintenance Policy by El-Ferik, S

“…Numerical results are provided to illustrate both the use of the algorithm in the study of the optimal cost function and the latter's sensitivity to different changes in cost factors. …”
Get full text

Scatter search metaheuristic for homology based protein structure prediction. (c2015) by Stamboulian, Mouses Hrag

“…We assess our algorithm on a total of 11 proteins whose structures are present in the Protein Data Bank (PDB) and which has been used in previous literature. …”
Get full text
Get full text

Design Optimization of Inductive Power Transfer Systems Considering Bifurcation and Equivalent AC Resistance for Spiral Coils by Alireza Namadmalan (16864236)

“…Based on the FEM simulations, a new approximation method using separation of variables is proposed as a function of spiral coil's main parameters. …”

The maximum common subgraph problem by Abu-Khzam, Faisal N.

“…The result is an algorithm whose run time is bounded by a function exponential in the order of the smaller cover rather than in the order of the smaller graph.…”
Get full text
Get full text
Get full text
Get full text

AGEomics Biomarkers and Machine Learning—Realizing the Potential of Protein Glycation in Clinical Diagnostics by Naila Rabbani (291722)

“…In this review, I describe the utility of AGEomics biomarkers and provide evidence why these are close to the phenotype of a condition or disease compared to other metabolites and metabolomic approaches and how to train and test algorithms for clinical diagnostic and screening applications with high accuracy, sensitivity and specificity using machine learning approaches.…”

Weak-coupling, strong-coupling and large-order parametrization of the hypergeometric-Meijer approximants by Abouzeid M. Shalaby (16810695)

“…The divergent_pF_p-2 series are then resummed via their representation in terms of the Meijer-G function. The choice of _pF_p-2 accelerates the convergence even with only weak-coupling information as input. …”

Resources Allocation for Drones Tracking Utilizing Agent-Based Proximity Policy Optimization by De Rochechouart, Maxence

“…In particular, the Proximity Policy Optimization (PPO) reinforcement algorithm is used to discover a policy for sensor selection that results in optimum sensor resource allocation. …”
Get full text

Multi-Modal Emotion Aware System Based on Fusion of Speech and Brain Information by M. Ghoniem, Rania

“…For classifying unimodal data of either speech or EEG, a hybrid fuzzy c-means-genetic algorithm-neural network model is proposed, where its fitness function finds the optimal fuzzy cluster number reducing the classification error. …”
Get full text
Get full text

On the parameterized parallel complexity and the vertex cover problem by Abu-Khzam, Faisal N.

“…In particular, we present a parallel algorithm that outperforms the best known parallel algorithm for this problem: using O(m) instead of O(n2) parallel processors, the running time improves from 4logn+O(kk) to O(k⋅log3n) , where m is the number of edges, n is the number of vertices of the input graph, and k is an upper bound of the size of the sought vertex cover. …”
Get full text
Get full text
Get full text
Get full text

Timing influenced general-cell genetic floorplanner by Sait, Sadiq M.

“…The floorplanner works in two phases. In the first phase we use the genetic algorithm and restrict the modules to be rigid and the floorplan to have slicing structure. …”
Get full text