Fragment based protein structure prediction. (c2013) by Terzian, Meghrig Ohanes

“…The method is based on a two-phase Scatter Search metaheuristic that minimizes the energy function. Backbone fragments selections extracted from the Robetta server are followed by side chain selections, extracted from the Dunbrack Library. …”
Get full text
Get full text

Attacking ElGamal based cryptographic algorithms using Pollard's rho algorithm by El-Kassar, A. N.

“…In this work we implement the classical and modified ElGamal cryptosystem to compare and to test their functionality, reliability and security. To test the security of the algorithms we use a famous attack algorithm called Pollard's rho algorithm that works in the domain of natural integers. …”
Get full text
Get full text
Get full text
Get full text

An Introduction to the Special Issue “Protein Glycation in Food, Nutrition, Health and Disease” by Naila Rabbani (291722)

“…The keynote speaker was Lasker Laureate Professor Kazutoshi Mori, speaking on the unfolded protein response, and there were sessions on: glycation in obesity, diabetes, and diabetic complications; glycation in food; glycation through the life course—from maternal bonding to aging; glycation in plants—physiology, function, and food security; glycation in the COVID-19 response; glycation analytics and chemistry; glycation in kidney disease, cancer, and mental health; glycation-related imaging, diagnostic algorithms, and therapeutics; and methods and models in glycation research. …”

Evolution Of Activation Functions for Neural Architecture Search by Nader, Andrew

“…However, to the best of our knowledge, the design of new activation functions has mostly been done by hand. In this work, we propose the use of a self-adaptive evolutionary algorithm that searches for new activation functions using a genetic programming approach, and we compare the performance of the obtained activation functions to ReLU. …”
Get full text
Get full text
Get full text

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

“…Determining a protein’s structure is a challenging goal in structural bioinformatics, offering important insight towards understanding the function of a protein. …”
Get full text
Get full text

Evolutionary Algorithms for VLSIMultiobjective Netlist Partitioning by Sait, Sadiq M.

“…The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. …”
Get full text

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

“…The term AGEomics is defined as multiplexed quantitation of spontaneous modification of proteins damage and other usually low-level modifications associated with a change of structure and function—for example, citrullination and transglutamination. …”

Accuracy of an internationally validated genetic-guided warfarin dosing algorithm compared to a clinical algorithm in an Arab population by Amr M. Fahmi (21632909)

“…After reaching warfarin maintenance dose, the dose was recalculated using the GWD and median absolute error (MAE) and the percentage of warfarin doses within 20% of the actual dose were calculated and compared for the two algorithms. </p><h3>Results</h3><p dir="ltr">The study enrolled 130 patients from 12 Arabian countries. …”

Particle swarm optimization approach for protein structure prediction in the 3D HP model by Mansour, Nashat

“…Starting from a small set of candidate solutions, our algorithm efficiently explores the search space and returns 3D protein structures with minimal energy. …”
Get full text
Get full text
Get full text

An improved kernelization algorithm for r-Set Packing by Abu-Khzam, Faisal N.

“…In particular, the number of elements in a 3-Set Packing kernel is improved from a cubic function of the parameter to a quadratic one.…”
Get full text
Get full text
Get full text

Belief selection in point-based planning algorithms for POMDPs by Azar, Danielle

“…Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value function can be derived by interpolation from the values of a specially selected set of points. …”
Get full text
Get full text
Get full text
Get full text

Improving the Secure Socket Layer Protocol by modifying its Authentication function by El-Kassar, A. N.

“…In this paper, we propose a modification of RSA from the domain of integers to the domain of Gaussian arithmetic to be applied to the first function of SSL that would give more secure communication. …”
Get full text
Get full text
Get full text
Get full text

A new genetic algorithm approach for unit commitment by Mantawy, A.H.

“…A fitness function is constructed from the total operating cost of the generating units without penalty terms. …”
Get full text
Get full text

Evolutionary algorithms for VLSI multi-objective netlist partitioning by Sait, Sadiq M.

“…The problem of partitioning appears in several areas ranging from VLSI, parallel programming to molecular biology. …”
Get full text

A Comparative Study of Elgamal Based Cryptographic Algorithms by Haraty, Ramzi A.

“…In this work we implement the classical and modified ElGamal cryptosystem to compare and to test their functionality, reliability and security. To test the security of the algorithms we use a famous attack algorithm called Baby-Step-Giant algorithm which works in the domain of natural integers. …”
Get full text
Get full text
Get full text

A genetic-based algorithm for fuzzy unit commitment model by Mantawy, A.H.

“…In the implementation for the GA, coding of the UCP solutions is based on mixing binary and decimal representations. A fitness function is constructed from the total operating cost of the generating units plus a penalty term determined due to the fuzzy load and spinning reserve membership functions. …”
Get full text
Get full text

A comparative study of RSA based digital signature algorithms by Haraty, Ramzi A.

“…We implement the classical and modified RSA cryptosystem to compare and to test their functionality, reliability and security. To test the security of the algorithms we implement attack algorithms to solve the factorization problem in Z, Z[<i>i</i>] and F[<i>x</i>]. …”
Get full text
Get full text
Get full text
Get full text

Mobile robots obstacles avoidance using dynamic window approach by Abubakr, Omer Ali

Get full text

Spherical cavity-expansion forcing function in PRONTO 3D for application to penetration problems by Tabbara, Mazen R.

“…In this spirit, a forcing function which is derived from a spherical-cavity expansion analysis has been implemented in PRONTO 3D. …”
Get full text
Get full text
Get full text

Evolutionary algorithms, simulated annealing and tabu search: a comparative study by Youssef, H.

“…Abstract Evolutionary algorithms, simulated annealing (SA), and tabu search (TS) are general iterative algorithms for combinatorial optimization. …”
Get full text