The effect of multiple optima on the simple GA run-time complexity

Genetic algorithms are stochastic search algorithms that have been applied to optimization problems. In this paper we analyze the run-time complexity of a genetic algorithm when we are interested in one of a set of distinguished solutions. One such case occurs when multiple optima exist. We define the worst case scenario and derive a probabilistic worst case bound on the number of iterations required to find one of these multiple solutions of interest.     

Acoustic Analysis Findings in Objective Laryngopharyngeal Reflux Patients

OBJECTIVE: The aim of this study was to identify the effects of objective laryngopharyngeal reflux (LPR) on the acoustic parameters of patients by comparing their voice samples with that of control subjects. STUDY DESIGN: Prospective study in two tertiary reference hospitals. METHODS: 48 consecutive patients with symptoms related to LPR and 64 control subjects were included in the study. Suspected LPR patients underwent a 24-hour ambulatory pH monitoring, and 25 (52%) of them were shown to have objective LPR. Acoustical evaluation results of objective LPR patients were compared with that of symptomatic LPR patients and control subjects. RESULTS: All frequency perturbation values obtained from objective and symptomatic LPR patients were higher than the control subjects (P<0.01). Mean fundamental frequency, amplitude perturbation measures, and noise-to-harmonics ratio were not significantly different between groups. CONCLUSION: LPR patients have significantly different frequency perturbation values than control subjects.     

A single supplier–single retailer system with an order-up-to level inventory policy

We consider a two-level vendor-managed system in which external demand occurs only at a retailer and a supplier replenishes the retailer employing an order-up-to S policy over T periods. We present an O(T³) algorithm to coordinate the system when S is known. We also show that S can be optimized in O(aT³) time for an input parameter a.     

Temperature independent length optimization of L-band EDFAs providing flat gain

In this study, single stage (SS), double-stage (DS), and gain flattened (GF) DS L-band erbium-doped fiber amplifier (EDFA) configurations are designed in order to obtain a flat gain amplifier. Temperature dependence of the mentioned configurations is also analyzed. Maximum spectral dependence of EDFA gain with respect to temperature is obtained for SS EDFA design while smaller spectral dependence of gains is obtained for both DS and GF DS L-EDFA configurations. It is observed that the maximum temperature dependence is in the range of 1570-1580 nm band for all configurations. It has also been found that for all configurations, reducing the temperature has greater effect than raising the temperature on EDFA gain. The overall results show that a temperature independent L-band configuration has not been possible. However, for some signal wavelengths, the erbium-doped fiber (EDF) lengths at which the gain is temperature independent are observed.     

DC insulator dielectrophoretic applications in microdevice technology: a review

Dielectrophoresis is a noninvasive, nondestructive, inexpensive, and fast technique for the manipulation of bioparticles. Recent advances in the field of dielectrophoresis (DEP) have resulted in new approaches for characterizing the behavior of particles and cells using direct current (DC) electric fields. In such approaches, spatial nonuniformities are created in the channel by embedding insulating obstacles in the channel or flow field in order to perform separation or trapping. This emerging field of dielectrophoresis is commonly termed DC insulator dielectrophoresis (DC-iDEP), insulator-based dielectrophoresis (iDEP), or electrodeless dielectrophoresis (eDEP). In many microdevices, this form of dielectrophoresis has advantages over traditional AC-DEP, including single material microfabrication, remotely positioned electrodes, and reduced fouling of the test region. DC-iDEP applications have included disease detection, separation of cancerous cells from normal cells, and separation of live from dead bacteria. However, there is a need for a critical report to integrate these important research findings. The aim of this review is to provide an overview of the current state-of-art technology in the field of DC-iDEP for the separation and trapping of inert particles and cells. In this article, a review of the concepts and theory leading to the manipulation of particles via DC-iDEP is given, and insulating obstacle geometry designs and the characterization of device performance are discussed. This review compiles and compares the significant findings obtained by researchers in handling and manipulating particles.     

5-(Indol-2-yl)pyrazolo[3,4-b]pyridines as a New Family of TASK-3 Channel Blockers: A Pharmacophore-Based Regioselective Synthesis

TASK channels belong to the two-pore-domain potassium (K_2P) channels subfamily. These channels modulate cellular excitability, input resistance, and response to synaptic stimulation. TASK-channel inhibition led to membrane depolarization. TASK-3 is expressed in different cancer cell types and neurons. Thus, the discovery of novel TASK-3 inhibitors makes these bioactive compounds very appealing to explore new cancer and neurological therapies. TASK-3 channel blockers are very limited to date, and only a few heterofused compounds have been reported in the literature. In this article, we combined a pharmacophore hypothesis with molecular docking to address for the first time the rational design, synthesis, and evaluation of 5-(indol-2-yl)pyrazolo[3,4-b]pyridines as a novel family of human TASK-3 channel blockers. Representative compounds of the synthesized library were assessed against TASK-3 using Fluorometric imaging plate reader—Membrane Potential assay (FMP). Inhibitory properties were validated using two-electrode voltage-clamp (TEVC) methods. We identified one active hit compound (MM-3b) with our systematic pipeline, exhibiting an IC₅₀ ≈ 30 μM. Molecular docking models suggest that compound MM-3b binds to TASK-3 at the bottom of the selectivity filter in the central cavity, similar to other described TASK-3 blockers such as A1899 and PK-THPP. Our in silico and experimental studies provide a new tool to predict and design novel TASK-3 channel blockers.     

Hubbing and routing in postal delivery systems

We consider the combined hubbing and routing problem in postal delivery systems and develop an iterative two-stage solution procedure for the problem. In the first stage, hub locations are determined and postal offices are multiply allocated to the hubs. The second stage gives the routes in hub regions that alter the distances between points used in the hub-location problem. The procedure then iterates between two stages by updating the distances used in hubbing in order to produce a route-compatible hub configuration. Computational experience is reported for the test problems taken from the literature. For a case study Turkish postal delivery system data are utilized. As the case study is applied on a road network, a final stage, seeking improvements based on special structures in the routed network, is appended to the two-stage solution procedure.     

Lagrangean relaxation based heuristics for lot sizing with setup times

We consider a lot sizing problem with setup times where the objective is to minimize the total inventory carrying cost only. The demand is dynamic over time and there is a single resource of limited capacity. We show that the approaches implemented in the literature for more general versions of the problem do not perform well in this case. We examine the Lagrangean relaxation (LR) of demand constraints in a strong reformulation of the problem. We then design a primal heuristic to generate upper bounds and combine it with the LR problem within a subgradient optimization procedure. We also develop a simple branch and bound heuristic to solve the problem. Computational results on test problems taken from the literature show that our relaxation procedure produces consistently better solutions than the previously developed heuristics in the literature.     

Using support vector machines to learn the efficient set in multiple objective discrete optimization

We propose using support vector machines (SVMs) to learn the efficient set in multiple objective discrete optimization (MODO). We conjecture that a surface generated by SVM could provide a good approximation of the efficient set. As one way of testing this idea, we embed the SVM-approximated efficient set information into a Genetic Algorithm (GA). This is accomplished by using a SVM-based fitness function that guides the GA search. We implement our SVM-guided GA on the multiple objective knapsack and assignment problems. We observe that using SVM improves the performance of the GA compared to a benchmark distance based fitness function and may provide competitive results.     

The Fractional Fourier Transform and Harmonic Oscillation

The ath-order fractional Fourier transform is a generalization ofthe ordinary Fourier transform such that the zeroth-order fractionalFourier transform operation is equal to the identity operation and thefirst-order fractional Fourier transform is equal to the ordinaryFourier transform. This paper discusses the relationship of thefractional Fourier transform to harmonic oscillation; both correspondto rotation in phase space. Various important properties of thetransform are discussed along with examples of commontransforms. Some of the applications of the transform are brieflyreviewed.