In search of CS2(H2O)n = 1–4 clusters

Gaussian-3 and MP2/aug-cc-pVnZ methods have been used to calculate geometries and thermochemistry of CS2(H2O)n, where n = 1–4. An extensive molecular dynamics search followed by optimization using these two methods located two dimers, six trimers, six tetramers, and two pentamers. The MP2/aug-cc-pVDZ structure matched best with the experimental result for the CS2(H2O) dimer, showing that diffuse functions are necessary to model the interactions found in this complex. For larger CS2(H2O)n clusters, the MP2/aug-cc-pVDZ minima are significantly different from the MP2(full)/6-31G* structures, revealing that the G3 model chemistry is not suitable for investigation of sulfur containing van der Waals complexes. Based on the MP2/aug-cc-pVTZ free energies, the concentration of saturated water in the atmosphere and the average amount of CS2 in the atmosphere, the concentrations of these clusters are predicted to be on the order of 105CS2(H2O) clusters∙cm−3 and 102 CS2(H2O)2 clusters∙cm−3 at 298.15 K. The MP2/aug-cc-pVDZ scaled harmonic and anharmonic frequencies of the most abundant dimer cluster at 298 K are presented, along with the MP2/aug-cc-pVDZ scaled harmonic frequencies for the CS2(H2O)n structures predicted to be present in a low-temperature molecular beam experiment.

Global Search for Minimum Energy (H2O)n Clusters, n = 3−5

The Gaussian-3 (G3) model chemistry method has been used to calculate the relative ΔG° values for all possible conformers of neutral clusters of water, (H2O)n, where n = 3−5. A complete 12-fold conformational search around each hydrogen bond produced 144, 1728, and 20 736 initial starting structures of the water trimer, tetramer, and pentamer. These structures were optimized with PM3, followed by HF/6-31G* optimization, and then with the G3 model chemistry. Only two trimers are present on the G3 potential energy hypersurface. We identified 5 tetramers and 10 pentamers on the potential energy and free-energy hypersurfaces at 298 K. None of these 17 structures were linear; all linear starting models folded into cyclic or three-dimensional structures. The cyclic pentamer is the most stable isomer at 298 K. On the basis of this and previous studies, we expect the cyclic tetramers and pentamers to be the most significant cyclic water clusters in the atmosphere.

Space trajectories optimization using variable-chromosome-length genetic algorithms

The problem of optimal design of a multi-gravity-assist space trajectories, with free number of deep space maneuvers (MGADSM) poses multi-modal cost functions. In the general form of the problem, the number of design variables is solution dependent. To handle global optimization problems where the number of design variables varies from one solution to another, two novel genetic-based techniques are introduced: hidden genes genetic algorithm (HGGA) and dynamic-size multiple population genetic algorithm (DSMPGA). In HGGA, a fixed length for the design variables is assigned for all solutions. Independent variables of each solution are divided into effective and ineffective (hidden) genes. Hidden genes are excluded in cost function evaluations. Full-length solutions undergo standard genetic operations. In DSMPGA, sub-populations of fixed size design spaces are randomly initialized. Standard genetic operations are carried out for a stage of generations. A new population is then created by reproduction from all members based on their relative fitness. The resulting sub-populations have different sizes from their initial sizes. The process repeats, leading to increasing the size of sub-populations of more fit solutions. Both techniques are applied to several MGADSM problems. They have the capability to determine the number of swing-bys, the planets to swing by, launch and arrival dates, and the number of deep space maneuvers as well as their locations, magnitudes, and directions in an optimal sense. The results show that solutions obtained using the developed tools match known solutions for complex case studies. The HGGA is also used to obtain the asteroids sequence and the mission structure in the global trajectory optimization competition (GTOC) problem. As an application of GA optimization to Earth orbits, the problem of visiting a set of ground sites within a constrained time frame is solved. The J2 perturbation and zonal coverage are considered to design repeated Sun-synchronous orbits. Finally, a new set of orbits, the repeated shadow track orbits (RSTO), is introduced. The orbit parameters are optimized such that the shadow of a spacecraft on the Earth visits the same locations periodically every desired number of days.

A COMPARATIVE STUDY OF HEURISTIC OPTIMIZATION ALGORITHMS

Heuristic optimization algorithms are of great importance for reaching solutions to various real world problems. These algorithms have a wide range of applications such as cost reduction, artificial intelligence, and medicine. By the term cost, one could imply that that cost is associated with, for instance, the value of a function of several independent variables. Often, when dealing with engineering problems, we want to minimize the value of a function in order to achieve an optimum, or to maximize another parameter which increases with a decrease in the cost (the value of this function). The heuristic cost reduction algorithms work by finding the optimum values of the independent variables for which the value of the function (the “cost”) is the minimum. There is an abundance of heuristic cost reduction algorithms to choose from. We will start with a discussion of various optimization algorithms such as Memetic algorithms, force-directed placement, and evolution-based algorithms. Following this initial discussion, we will take up the working of three algorithms and implement the same in MATLAB. The focus of this report is to provide detailed information on the working of three different heuristic optimization algorithms, and conclude with a comparative study on the performance of these algorithms when implemented in MATLAB. In this report, the three algorithms we will take in to consideration will be the non-adaptive simulated annealing algorithm, the adaptive simulated annealing algorithm, and random restart hill climbing algorithm. The algorithms are heuristic in nature, that is, the solution these achieve may not be the best of all the solutions but provide a means to reach a quick solution that may be a reasonably good solution without taking an indefinite time to implement.

A computer-aided diagnostic system to characterize CT focal liver lesions: design and optimization of a neural network classifier

In this paper, a computer-aided diagnostic (CAD) system for the classification of hepatic lesions from computed tomography (CT) images is presented. Regions of interest (ROIs) taken from nonenhanced CT images of normal liver, hepatic cysts, hemangiomas, and hepatocellular carcinomas have been used as input to the system. The proposed system consists of two modules: the feature extraction and the classification modules. The feature extraction module calculates the average gray level and 48 texture characteristics, which are derived from the spatial gray-level co-occurrence matrices, obtained from the ROIs. The classifier module consists of three sequentially placed feed-forward neural networks (NNs). The first NN classifies into normal or pathological liver regions. The pathological liver regions are characterized by the second NN as cyst or "other disease." The third NN classifies "other disease" into hemangioma or hepatocellular carcinoma. Three feature selection techniques have been applied to each individual NN: the sequential forward selection, the sequential floating forward selection, and a genetic algorithm for feature selection. The comparative study of the above dimensionality reduction methods shows that genetic algorithms result in lower dimension feature vectors and improved classification performance.

GRASP with Hybrid Path Relinking for Bi-Objective Winner Determination in Combinatorial Transportation Auctions

The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper's task of selecting a subset of the submitted bids which efficiently trades off total procurement cost against expected carrier performance. To solve this bi-objective winner determination problem, we propose a Pareto-based greedy randomized adaptive search procedure (GRASP). As a post-optimizer we use a path relinking procedure which is hybridized with branch-and-bound. Several variants of this algorithm are evaluated by means of artificial test instances which comply with important real-world characteristics. The two best variants prove superior to a previously published Pareto-based evolutionary algorithm.

Entwicklung eines Konzepts zum Lagermanagement mit Optimierungsansätzen auf Ebene eines neuen Regalbediengerätes

Die Grundidee hinter dem neuen Regalbediengerät ist die Minimierung der zu bewegenden Last durch die Verwendung einer seilbasierten Stewart-Gough-Plattform (SGP). Das klassische Regalbediengerät (RBG) wird dabei durch eine Plattform ersetzt, die an bis zu acht vorgespannten Seilen befestigt ist. Unterstützt wird diese Bauform durch eine abgestimmte Steuerungssoftware, die es ermöglicht die Vorteile des RBG optimal zu nutzen. Das hier mit Software vorgestellte Konzept regelt die Vorgehensweise zur Optimierung von Ein- und Auslagerungsaufträgen in einem Lagerregal, sowie die Optimierung der Fachbelegung in Zeiten ohne direkten Auftrag. Es beinhaltet dabei Mechanismen, die bestimmen wann Aufträge abgearbeitet werden, in welcher Reihenfolge und in welchen Kombinationen. Ziel ist es Ein- und Auslagerungsaufträge so zu kombinieren, dass möglichst effizient und schnell gearbeitet wird.

Spinal cerebrospinal fluid leak as the cause of chronic subdural hematomas in nongeriatric patients

OBJECT The etiology of chronic subdural hematoma (CSDH) in nongeriatric patients (≤ 60 years old) often remains unclear. The primary objective of this study was to identify spinal CSF leaks in young patients, after formulating the hypothesis that spinal CSF leaks are causally related to CSDH. METHODS All consecutive patients 60 years of age or younger who underwent operations for CSDH between September 2009 and April 2011 at Bern University Hospital were included in this prospective cohort study. The patient workup included an extended search for a spinal CSF leak using a systematic algorithm: MRI of the spinal axis with or without intrathecal contrast application, myelography/fluoroscopy, and postmyelography CT. Spinal pathologies were classified according to direct proof of CSF outflow from the intrathecal to the extrathecal space, presence of extrathecal fluid accumulation, presence of spinal meningeal cysts, or no pathological findings. The primary outcome was proof of a CSF leak. RESULTS Twenty-seven patients, with a mean age of 49.6 ± 9.2 years, underwent operations for CSDH. Hematomas were unilateral in 20 patients and bilateral in 7 patients. In 7 (25.9%) of 27 patients, spinal CSF leakage was proven, in 9 patients (33.3%) spinal meningeal cysts in the cervicothoracic region were found, and 3 patients (11.1%) had spinal cysts in the sacral region. The remaining 8 patients (29.6%) showed no pathological findings. CONCLUSIONS The direct proof of spinal CSF leakage in 25.9% of patients suggests that spinal CSF leaks may be a frequent cause of nongeriatric CSDH.

Search for long-lived, heavy particles in final states with a muon and multi-track displaced vertex in proton–proton collisions at View the MathML sources=7 TeV with the ATLAS detector

A search for the direct production of charginos and neutralinos in final states with three electrons or muons and missing transverse momentum is presented. The analysis is based on 4.7 fb(-1) of root s = 7 TeV proton-proton collision data delivered by the Large Hadron Collider and recorded with the ATLAS detector. Observations are consistent with Standard Model expectations in three signal regions that are either depleted or enriched in Z-boson decays. Upper limits at 95% confidence level are set in R-parity conserving phenomenological minimal supersymmetric models and in simplified models, significantly extending previous results.

Search for charginos nearly mass-degenerate with the lightest neutralino based on a disappearing-track signature in pp collisions at sqrts = 8 TeV with the ATLAS detector

A search is presented for direct chargino production based on a disappearing-track signature using 20.3  fb−1 of proton-proton collisions at s√=8  TeV collected with the ATLAS experiment at the LHC. In anomaly-mediated supersymmetry breaking (AMSB) models, the lightest chargino is nearly mass degenerate with the lightest neutralino and its lifetime is long enough to be detected in the tracking detectors by identifying decays that result in tracks with no associated hits in the outer region of the tracking system. Some models with supersymmetry also predict charginos with a significant lifetime. This analysis attains sensitivity for charginos with a lifetime between 0.1 and 10 ns, and significantly surpasses the reach of the LEP experiments. No significant excess above the background expectation is observed for candidate tracks with large transverse momentum, and constraints on chargino properties are obtained. In the AMSB scenarios, a chargino mass below 270 GeV is excluded at 95% confidence level.

A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector

This paper deals with “The Enchanted Journey,” which is a daily event tour booked by Bollywood-film fans. During the tour, the participants visit original sites of famous Bollywood films at various locations in Switzerland; moreover, the tour includes stops for lunch and shopping. Each day, up to five buses operate the tour. For operational reasons, however, two or more buses cannot stay at the same location simultaneously. Further operative constraints include time windows for all activities and precedence constraints between some activities. The planning problem is how to compute a feasible schedule for each bus. We implement a two-step hierarchical approach. In the first step, we minimize the total waiting time; in the second step, we minimize the total travel time of all buses. We present a basic formulation of this problem as a mixed-integer linear program. We enhance this basic formulation by symmetry-breaking constraints, which reduces the search space without loss of generality. We report on computational results obtained with the Gurobi Solver. Our numerical results show that all relevant problem instances can be solved using the basic formulation within reasonable CPU time, and that the symmetry-breaking constraints reduce that CPU time considerably.

Search for pair-produced third-generation squarks decaying via charm quarks or in compressed supersymmetric scenarios in pp collisions at √s=8 TeV with the ATLAS detector

Results of a search for supersymmetry via direct production of third-generation squarks are reported, using 20.3  fb −1 of proton-proton collision data at √s =8  TeV recorded by the ATLAS experiment at the LHC in 2012. Two different analysis strategies based on monojetlike and c -tagged event selections are carried out to optimize the sensitivity for direct top squark-pair production in the decay channel to a charm quark and the lightest neutralino (t 1 →c+χ ˜ 0 1 ) across the top squark–neutralino mass parameter space. No excess above the Standard Model background expectation is observed. The results are interpreted in the context of direct pair production of top squarks and presented in terms of exclusion limits in the m ˜t 1, m ˜ X0 1 ) parameter space. A top squark of mass up to about 240 GeV is excluded at 95% confidence level for arbitrary neutralino masses, within the kinematic boundaries. Top squark masses up to 270 GeV are excluded for a neutralino mass of 200 GeV. In a scenario where the top squark and the lightest neutralino are nearly degenerate in mass, top squark masses up to 260 GeV are excluded. The results from the monojetlike analysis are also interpreted in terms of compressed scenarios for top squark-pair production in the decay channel t ˜ 1 →b+ff ′ +χ ˜ 0 1 and sbottom pair production with b ˜ 1 →b+χ ˜ 0 1 , leading to a similar exclusion for nearly mass-degenerate third-generation squarks and the lightest neutralino. The results in this paper significantly extend previous results at colliders.

Optimization of TRPV6 Calcium Channel Inhibitors Using a 3D Ligand-Based Virtual Screening Method

Herein, we report the discovery of the first potent and selective inhibitor of TRPV6, a calcium channel overexpressed in breast and prostate cancer, and its use to test the effect of blocking TRPV6-mediated Ca2+-influx on cell growth. The inhibitor was discovered through a computational method, xLOS, a 3D-shape and pharmacophore similarity algorithm, a type of ligand-based virtual screening (LBVS) method described briefly here. Starting with a single weakly active seed molecule, two successive rounds of LBVS followed by optimization by chemical synthesis led to a selective molecule with 0.3 μM inhibition of TRPV6. The ability of xLOS to identify different scaffolds early in LBVS was essential to success. The xLOS method may be generally useful to develop tool compounds for poorly characterized targets.

Global Optimization with Sparse and Local Gaussian Process Models

We present a novel surrogate model-based global optimization framework allowing a large number of function evaluations. The method, called SpLEGO, is based on a multi-scale expected improvement (EI) framework relying on both sparse and local Gaussian process (GP) models. First, a bi-objective approach relying on a global sparse GP model is used to determine potential next sampling regions. Local GP models are then constructed within each selected region. The method subsequently employs the standard expected improvement criterion to deal with the exploration-exploitation trade-off within selected local models, leading to a decision on where to perform the next function evaluation(s). The potential of our approach is demonstrated using the so-called Sparse Pseudo-input GP as a global model. The algorithm is tested on four benchmark problems, whose number of starting points ranges from 102 to 104. Our results show that SpLEGO is effective and capable of solving problems with large number of starting points, and it even provides significant advantages when compared with state-of-the-art EI algorithms.

Analysis of Synthetic Diamond Wafer Interferograms Using a Parallelized Simulated Annealing Algorithm

Diamonds are known for both their beauty and their durability. Jefferson National Lab in Newport News, VA has found a way to utilize the diamond's strength to view the beauty of the inside of the atomic nucleus with the hopes of finding exotic forms of matter. By firing very fast electrons at a diamond sheet no thicker than a human hair, high energy particles of light known as photons are produced with a high degree of polarization that can illuminate the constituents of the nucleus known as quarks. The University of Connecticut Nuclear Physics group has responsibility for crafting these extremely thin, high quality diamond wafers. These wafers must be cut from larger stones that are about the size of a human finger, and then carefully machined down to the final thickness. The thinning of these diamonds is extremely challenging, as the diamond's greatest strength also becomes its greatest weakness. The Connecticut Nuclear Physics group has developed a novel technique to assist industrial partners in assessing the quality of the final machining steps, using a technique based on laser interferometry. The images of the diamond surface produced by the interferometer encode the thickness and shape of the diamond surface in a complex way that requires detailed analysis to extract. We have developed a novel software application to analyze these images based on the method of simulated annealing. Being able to image the surface of these diamonds without requiring costly X-ray diffraction measurements allows rapid feedback to the industrial partners as they refine their thinning techniques. Thus, by utilizing a material found to be beautiful by many, the beauty of nature can be brought more clearly into view.