Expedite random structure searching using objects from Wyckoff positions
Wang, Shu-Wei; Hsing, Cheng-Rong; Wei, Ching-Ming
2018-02-01
Random structure searching has been proved to be a powerful approach to search and find the global minimum and the metastable structures. A true random sampling is in principle needed yet it would be highly time-consuming and/or practically impossible to find the global minimum for the complicated systems in their high-dimensional configuration space. Thus the implementations of reasonable constraints, such as adopting system symmetries to reduce the independent dimension in structural space and/or imposing chemical information to reach and relax into low-energy regions, are the most essential issues in the approach. In this paper, we propose the concept of "object" which is either an atom or composed of a set of atoms (such as molecules or carbonates) carrying a symmetry defined by one of the Wyckoff positions of space group and through this process it allows the searching of global minimum for a complicated system to be confined in a greatly reduced structural space and becomes accessible in practice. We examined several representative materials, including Cd3As2 crystal, solid methanol, high-pressure carbonates (FeCO3), and Si(111)-7 × 7 reconstructed surface, to demonstrate the power and the advantages of using "object" concept in random structure searching.
Ramazani, Saba; Jackson, Delvin L.; Selmic, Rastko R.
2013-05-01
In search and surveillance operations, deploying a team of mobile agents provides a robust solution that has multiple advantages over using a single agent in efficiency and minimizing exploration time. This paper addresses the challenge of identifying a target in a given environment when using a team of mobile agents by proposing a novel method of mapping and movement of agent teams in a cooperative manner. The approach consists of two parts. First, the region is partitioned into a hexagonal beehive structure in order to provide equidistant movements in every direction and to allow for more natural and flexible environment mapping. Additionally, in search environments that are partitioned into hexagons, mobile agents have an efficient travel path while performing searches due to this partitioning approach. Second, we use a team of mobile agents that move in a cooperative manner and utilize the Tabu Random algorithm to search for the target. Due to the ever-increasing use of robotics and Unmanned Aerial Vehicle (UAV) platforms, the field of cooperative multi-agent search has developed many applications recently that would benefit from the use of the approach presented in this work, including: search and rescue operations, surveillance, data collection, and border patrol. In this paper, the increased efficiency of the Tabu Random Search algorithm method in combination with hexagonal partitioning is simulated, analyzed, and advantages of this approach are presented and discussed.
International Nuclear Information System (INIS)
Shlesinger, Michael F
2009-01-01
There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.
Ab initio random structure search for 13-atom clusters of fcc elements
International Nuclear Information System (INIS)
Chou, J P; Hsing, C R; Wei, C M; Cheng, C; Chang, C M
2013-01-01
The 13-atom metal clusters of fcc elements (Al, Rh, Ir, Ni, Pd, Pt, Cu, Ag, Au) were studied by density functional theory calculations. The global minima were searched for by the ab initio random structure searching method. In addition to some new lowest-energy structures for Pd 13 and Au 13 , we found that the effective coordination numbers of the lowest-energy clusters would increase with the ratio of the dimer-to-bulk bond length. This correlation, together with the electronic structures of the lowest-energy clusters, divides the 13-atom clusters of these fcc elements into two groups (except for Au 13 , which prefers a two-dimensional structure due to the relativistic effect). Compact-like clusters that are composed exclusively of triangular motifs are preferred for elements without d-electrons (Al) or with (nearly) filled d-band electrons (Ni, Pd, Cu, Ag). Non-compact clusters composed mainly of square motifs connected by some triangular motifs (Rh, Ir, Pt) are favored for elements with unfilled d-band electrons. (paper)
Computational prediction of muon stopping sites using ab initio random structure searching (AIRSS)
Liborio, Leandro; Sturniolo, Simone; Jochym, Dominik
2018-04-01
The stopping site of the muon in a muon-spin relaxation experiment is in general unknown. There are some techniques that can be used to guess the muon stopping site, but they often rely on approximations and are not generally applicable to all cases. In this work, we propose a purely theoretical method to predict muon stopping sites in crystalline materials from first principles. The method is based on a combination of ab initio calculations, random structure searching, and machine learning, and it has successfully predicted the MuT and MuBC stopping sites of muonium in Si, diamond, and Ge, as well as the muonium stopping site in LiF, without any recourse to experimental results. The method makes use of Soprano, a Python library developed to aid ab initio computational crystallography, that was publicly released and contains all the software tools necessary to reproduce our analysis.
Levy flights and random searches
Energy Technology Data Exchange (ETDEWEB)
Raposo, E P [Laboratorio de Fisica Teorica e Computacional, Departamento de Fisica, Universidade Federal de Pernambuco, Recife-PE, 50670-901 (Brazil); Buldyrev, S V [Department of Physics, Yeshiva University, New York, 10033 (United States); Da Luz, M G E [Departamento de Fisica, Universidade Federal do Parana, Curitiba-PR, 81531-990 (Brazil); Viswanathan, G M [Instituto de Fisica, Universidade Federal de Alagoas, Maceio-AL, 57072-970 (Brazil); Stanley, H E [Center for Polymer Studies and Department of Physics, Boston University, Boston, MA 02215 (United States)
2009-10-30
In this work we discuss some recent contributions to the random search problem. Our analysis includes superdiffusive Levy processes and correlated random walks in several regimes of target site density, mobility and revisitability. We present results in the context of mean-field-like and closed-form average calculations, as well as numerical simulations. We then consider random searches performed in regular lattices and lattices with defects, and we discuss a necessary criterion for distinguishing true superdiffusion from correlated random walk processes. We invoke energy considerations in relation to critical survival states on the edge of extinction, and we analyze the emergence of Levy behavior in deterministic search walks. Finally, we comment on the random search problem in the context of biological foraging.
Cover times of random searches
Chupeau, Marie; Bénichou, Olivier; Voituriez, Raphaël
2015-10-01
How long must one undertake a random search to visit all sites of a given domain? This time, known as the cover time, is a key observable to quantify the efficiency of exhaustive searches, which require a complete exploration of an area and not only the discovery of a single target. Examples range from immune-system cells chasing pathogens to animals harvesting resources, from robotic exploration for cleaning or demining to the task of improving search algorithms. Despite its broad relevance, the cover time has remained elusive and so far explicit results have been scarce and mostly limited to regular random walks. Here we determine the full distribution of the cover time for a broad range of random search processes, including Lévy strategies, intermittent strategies, persistent random walks and random walks on complex networks, and reveal its universal features. We show that for all these examples the mean cover time can be minimized, and that the corresponding optimal strategies also minimize the mean search time for a single target, unambiguously pointing towards their robustness.
Search along persistent random walks
International Nuclear Information System (INIS)
Friedrich, Benjamin M
2008-01-01
Optimal search strategies and their implementations in biological systems are a subject of active research. Here we study a search problem which is motivated by the hunt of sperm cells for the egg. We ask for the probability for an active swimmer to find a target under the condition that the swimmer starts at a certain distance from the target. We find that success probability is maximal for a certain level of fluctuations characterized by the persistence length of the swimming path of the swimmer. We derive a scaling law for the optimal persistence length as a function of the initial target distance and search time by mapping the search on a polymer physics problem
Efficient search by optimized intermittent random walks
International Nuclear Information System (INIS)
Oshanin, Gleb; Lindenberg, Katja; Wio, Horacio S; Burlatsky, Sergei
2009-01-01
We study the kinetics for the search of an immobile target by randomly moving searchers that detect it only upon encounter. The searchers perform intermittent random walks on a one-dimensional lattice. Each searcher can step on a nearest neighbor site with probability α or go off lattice with probability 1 - α to move in a random direction until it lands back on the lattice at a fixed distance L away from the departure point. Considering α and L as optimization parameters, we seek to enhance the chances of successful detection by minimizing the probability P N that the target remains undetected up to the maximal search time N. We show that even in this simple model, a number of very efficient search strategies can lead to a decrease of P N by orders of magnitude upon appropriate choices of α and L. We demonstrate that, in general, such optimal intermittent strategies are much more efficient than Brownian searches and are as efficient as search algorithms based on random walks with heavy-tailed Cauchy jump-length distributions. In addition, such intermittent strategies appear to be more advantageous than Levy-based ones in that they lead to more thorough exploration of visited regions in space and thus lend themselves to parallelization of the search processes.
Quantum random-walk search algorithm
International Nuclear Information System (INIS)
Shenvi, Neil; Whaley, K. Birgitta; Kempe, Julia
2003-01-01
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with O(√(N)) calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms
Random search for a dark resonance
DEFF Research Database (Denmark)
Kiilerich, Alexander Holm; Mølmer, Klaus
A pair of resonant laser fields can drive a three-level system into a dark state where it ceases to absorb and emit radiation due to destructive interference. We propose a scheme to search for this resonance by randomly changing the frequency of one of the fields each time a fluorescence photon...
Putungan, Darwin Barayang; Lin, Shi-Hsin
2018-01-01
In this work, we looked into the lowest energy structures of small lithium clusters (Lin, n = 5, 6, 7, 8) utilizing conventional PBE exchange-correlation functional, PBE with D2 dispersion correction and PBE with Tkatchenko and Scheffler (TS) dispersion correction, and searched using ab initio random structure searching. Results show that in general, dispersion-corrected PBE obtained similar lowest minima structures as those obtained via conventional PBE regardless of the type of implementation, although both D2 and TS found several high-energy isomers that conventional PBE did not arrive at, with TS in general giving more structures per energy range that could be attributed to its environment-dependent implementation. Moreover, D2 and TS dispersion corrections found a lowest energy geometry for Li8 cluster that is in agreement with the structure obtained via the typical benchmarking method diffusion Monte Carlo in a recent work. It is thus suggested that for much larger lithium clusters, utilization of dispersion correction could be of help in searching for lowest energy minima that is in close agreement with that of diffusion Monte Carlo results, but computationally inexpensive.
da Luz, Marcos G. E.; Grosberg, Alexander; Raposo, Ernesto P.; Viswanathan, Gandhi M.
2009-10-01
`I can't find my keys!' Who hasn't gone through this experience when leaving, in a hurry, to attend to some urgent matter? The keys could be in many different places. Unless one remembers where he or she has left the keys, the only solution is to look around, more or less randomly. Random searches are common because in many cases the locations of the specific targets are not known a priori. Indeed, such problems have been discussed in diverse contexts, attracting the interest of scientists from many fields, for example: the dynamical or stochastic search for a stable minimum in a complex energy landscape, relevant to systems such as glasses, protein (folding), and others; oil recovery from mature reservoirs; proteins searching for their specific target sites on DNA; animal foraging; survival at the edge of extinction due to low availability of energetic resources; automated searches of registers in high-capacity databases, search engine (e.g., `crawlers') that explore the internet; and even pizza delivery in a jammed traffic system of a medium-size town. In this way, the subject is interesting, challenging and has recently become an important scientific area of investigation. Although the applications are diverse, the underlying physical mechanisms are the same which will become clear in this special issue. Moreover, the inherent complexity of the problem, the abundance of ideas and methods found in this growing interdisciplinary field of research is studied in many areas of physics. In particular, the concepts and methods of statistical mechanics are particularly useful to the study of random searches. On one hand, it centres on how to find the global or local maxima of search efficiency functions with incomplete information. This is, of course, related to the long tradition in physics of using different conceptual and mathematical tools, such as variational methods, to extremize relevant quantities, e.g., energy, entropy and action. Such ideas and approaches are
Randomized Search Strategies With Imperfect Sensors
National Research Council Canada - National Science Library
Gage, Douglas W
1993-01-01
.... An important class of coverage applications are those that involve a search, in which a number of searching elements move about within a prescribed search area in order to find one or more target...
Search Path Evaluation Incorporating Object Placement Structure
National Research Council Canada - National Science Library
Baylog, John G; Wettergren, Thomas A
2007-01-01
This report describes a computationally robust approach to search path performance evaluation where the objects of search interest exhibit structure in the way in which they occur within the search space...
Greedy Local Search and Vertex Cover in Sparse Random Graphs
DEFF Research Database (Denmark)
Witt, Carsten
2009-01-01
. This work starts with a rigorous explanation for this claim based on the refined analysis of the Karp-Sipser algorithm by Aronson et al. Subsequently, theoretical supplements are given to experimental studies of search heuristics on random graphs. For c 1, a greedy and randomized local-search heuristic...... finds an optimal cover in polynomial time with a probability arbitrarily close to 1. This behavior relies on the absence of a giant component. As an additional insight into the randomized search, it is shown that the heuristic fails badly also on graphs consisting of a single tree component of maximum......Recently, various randomized search heuristics have been studied for the solution of the minimum vertex cover problem, in particular for sparse random instances according to the G(n, c/n) model, where c > 0 is a constant. Methods from statistical physics suggest that the problem is easy if c
Theory of Randomized Search Heuristics in Combinatorial Optimization
DEFF Research Database (Denmark)
The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS), the Metr......The rigorous mathematical analysis of randomized search heuristics(RSHs) with respect to their expected runtime is a growing research area where many results have been obtained in recent years. This class of heuristics includes well-known approaches such as Randomized Local Search (RLS...... analysis of randomized algorithms to RSHs. Mostly, the expected runtime of RSHs on selected problems is analzyed. Thereby, we understand why and when RSHs are efficient optimizers and, conversely, when they cannot be efficient. The tutorial will give an overview on the analysis of RSHs for solving...
Scattering quantum random-walk search with errors
International Nuclear Information System (INIS)
Gabris, A.; Kiss, T.; Jex, I.
2007-01-01
We analyze the realization of a quantum-walk search algorithm in a passive, linear optical network. The specific model enables us to consider the effect of realistic sources of noise and losses on the search efficiency. Photon loss uniform in all directions is shown to lead to the rescaling of search time. Deviation from directional uniformity leads to the enhancement of the search efficiency compared to uniform loss with the same average. In certain cases even increasing loss in some of the directions can improve search efficiency. We show that while we approach the classical limit of the general search algorithm by introducing random phase fluctuations, its utility for searching is lost. Using numerical methods, we found that for static phase errors the averaged search efficiency displays a damped oscillatory behavior that asymptotically tends to a nonzero value
Search for Directed Networks by Different Random Walk Strategies
Zhu, Zi-Qi; Jin, Xiao-Ling; Huang, Zhi-Long
2012-03-01
A comparative study is carried out on the efficiency of five different random walk strategies searching on directed networks constructed based on several typical complex networks. Due to the difference in search efficiency of the strategies rooted in network clustering, the clustering coefficient in a random walker's eye on directed networks is defined and computed to be half of the corresponding undirected networks. The search processes are performed on the directed networks based on Erdös—Rényi model, Watts—Strogatz model, Barabási—Albert model and clustered scale-free network model. It is found that self-avoiding random walk strategy is the best search strategy for such directed networks. Compared to unrestricted random walk strategy, path-iteration-avoiding random walks can also make the search process much more efficient. However, no-triangle-loop and no-quadrangle-loop random walks do not improve the search efficiency as expected, which is different from those on undirected networks since the clustering coefficient of directed networks are smaller than that of undirected networks.
Protein structural similarity search by Ramachandran codes
Directory of Open Access Journals (Sweden)
Chang Chih-Hung
2007-08-01
Full Text Available Abstract Background Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed, several methods have been designed to reduce three-dimensional protein structures to one-dimensional text strings that are then analyzed by traditional sequence alignment methods; however, the accuracy is usually sacrificed and the speed is still unable to match sequence similarity search tools. Here, we aimed to improve the linear encoding methodology and develop efficient search tools that can rapidly retrieve structural homologs from large protein databases. Results We propose a new linear encoding method, SARST (Structural similarity search Aided by Ramachandran Sequential Transformation. SARST transforms protein structures into text strings through a Ramachandran map organized by nearest-neighbor clustering and uses a regenerative approach to produce substitution matrices. Then, classical sequence similarity search methods can be applied to the structural similarity search. Its accuracy is similar to Combinatorial Extension (CE and works over 243,000 times faster, searching 34,000 proteins in 0.34 sec with a 3.2-GHz CPU. SARST provides statistically meaningful expectation values to assess the retrieved information. It has been implemented into a web service and a stand-alone Java program that is able to run on many different platforms. Conclusion As a database search method, SARST can rapidly distinguish high from low similarities and efficiently retrieve homologous structures. It demonstrates that the easily accessible linear encoding methodology has the potential to serve as a foundation for efficient protein structural similarity search tools. These search tools are supposed applicable to automated and high-throughput functional annotations or predictions for the ever increasing number of published protein structures in this post-genomic era.
Unbiased structural search of small copper clusters within DFT
International Nuclear Information System (INIS)
Cogollo-Olivo, Beatriz H.; Seriani, Nicola; Montoya, Javier A.
2015-01-01
Highlights: • We have been able to identify novel metastable structures for small Cu clusters. • We have shown that a linear structure reported for Cu_3 is actually a local maximum. • Some of the structures reported in literature are actually unstable within DFT. • Some of the isomer structures found shows the limits of educated guesses. - Abstract: The atomic structure of small Cu clusters with 3–6 atoms has been investigated by density functional theory and random search algorithm. New metastable structures have been found that lie merely tens of meV/atom above the corresponding ground state, and could therefore be present at thermodynamic equilibrium at room temperature or slightly above. Moreover, we show that the previously proposed linear configuration for Cu_3 is in fact a local maximum of the energy. Finally, we argue that the random search algorithm also provides qualitative information about the attraction basin of each structure in the energy landscape.
Decoherence in optimized quantum random-walk search algorithm
International Nuclear Information System (INIS)
Zhang Yu-Chao; Bao Wan-Su; Wang Xiang; Fu Xiang-Qun
2015-01-01
This paper investigates the effects of decoherence generated by broken-link-type noise in the hypercube on an optimized quantum random-walk search algorithm. When the hypercube occurs with random broken links, the optimized quantum random-walk search algorithm with decoherence is depicted through defining the shift operator which includes the possibility of broken links. For a given database size, we obtain the maximum success rate of the algorithm and the required number of iterations through numerical simulations and analysis when the algorithm is in the presence of decoherence. Then the computational complexity of the algorithm with decoherence is obtained. The results show that the ultimate effect of broken-link-type decoherence on the optimized quantum random-walk search algorithm is negative. (paper)
Effects of a random noisy oracle on search algorithm complexity
International Nuclear Information System (INIS)
Shenvi, Neil; Brown, Kenneth R.; Whaley, K. Birgitta
2003-01-01
Grover's algorithm provides a quadratic speed-up over classical algorithms for unstructured database or library searches. This paper examines the robustness of Grover's search algorithm to a random phase error in the oracle and analyzes the complexity of the search process as a function of the scaling of the oracle error with database or library size. Both the discrete- and continuous-time implementations of the search algorithm are investigated. It is shown that unless the oracle phase error scales as O(N -1/4 ), neither the discrete- nor the continuous-time implementation of Grover's algorithm is scalably robust to this error in the absence of error correction
Efficient protein structure search using indexing methods.
Kim, Sungchul; Sael, Lee; Yu, Hwanjo
2013-01-01
Understanding functions of proteins is one of the most important challenges in many studies of biological processes. The function of a protein can be predicted by analyzing the functions of structurally similar proteins, thus finding structurally similar proteins accurately and efficiently from a large set of proteins is crucial. A protein structure can be represented as a vector by 3D-Zernike Descriptor (3DZD) which compactly represents the surface shape of the protein tertiary structure. This simplified representation accelerates the searching process. However, computing the similarity of two protein structures is still computationally expensive, thus it is hard to efficiently process many simultaneous requests of structurally similar protein search. This paper proposes indexing techniques which substantially reduce the search time to find structurally similar proteins. In particular, we first exploit two indexing techniques, i.e., iDistance and iKernel, on the 3DZDs. After that, we extend the techniques to further improve the search speed for protein structures. The extended indexing techniques build and utilize an reduced index constructed from the first few attributes of 3DZDs of protein structures. To retrieve top-k similar structures, top-10 × k similar structures are first found using the reduced index, and top-k structures are selected among them. We also modify the indexing techniques to support θ-based nearest neighbor search, which returns data points less than θ to the query point. The results show that both iDistance and iKernel significantly enhance the searching speed. In top-k nearest neighbor search, the searching time is reduced 69.6%, 77%, 77.4% and 87.9%, respectively using iDistance, iKernel, the extended iDistance, and the extended iKernel. In θ-based nearest neighbor serach, the searching time is reduced 80%, 81%, 95.6% and 95.6% using iDistance, iKernel, the extended iDistance, and the extended iKernel, respectively.
Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift
DEFF Research Database (Denmark)
Lehre, Per Kristian; Witt, Carsten
2014-01-01
Drift analysis is one of the state-of-the-art techniques for the runtime analysis of randomized search heuristics (RSHs) such as evolutionary algorithms (EAs), simulated annealing etc. The vast majority of existing drift theorems yield bounds on the expected value of the hitting time for a target...
Optimal random search for a single hidden target.
Snider, Joseph
2011-01-01
A single target is hidden at a location chosen from a predetermined probability distribution. Then, a searcher must find a second probability distribution from which random search points are sampled such that the target is found in the minimum number of trials. Here it will be shown that if the searcher must get very close to the target to find it, then the best search distribution is proportional to the square root of the target distribution regardless of dimension. For a Gaussian target distribution, the optimum search distribution is approximately a Gaussian with a standard deviation that varies inversely with how close the searcher must be to the target to find it. For a network where the searcher randomly samples nodes and looks for the fixed target along edges, the optimum is either to sample a node with probability proportional to the square root of the out-degree plus 1 or not to do so at all.
Adiabatic quantum search algorithm for structured problems
International Nuclear Information System (INIS)
Roland, Jeremie; Cerf, Nicolas J.
2003-01-01
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover's algorithm. In this paper, we study how the structure of the search problem may be exploited to further improve the efficiency of these quantum adiabatic algorithms. We show that by nesting a partial search over a reduced set of variables into a global search, it is possible to devise quantum adiabatic algorithms with a complexity that, although still exponential, grows with a reduced order in the problem size
ARSTEC, Nonlinear Optimization Program Using Random Search Method
International Nuclear Information System (INIS)
Rasmuson, D. M.; Marshall, N. H.
1979-01-01
1 - Description of problem or function: The ARSTEC program was written to solve nonlinear, mixed integer, optimization problems. An example of such a problem in the nuclear industry is the allocation of redundant parts in the design of a nuclear power plant to minimize plant unavailability. 2 - Method of solution: The technique used in ARSTEC is the adaptive random search method. The search is started from an arbitrary point in the search region and every time a point that improves the objective function is found, the search region is centered at that new point. 3 - Restrictions on the complexity of the problem: Presently, the maximum number of independent variables allowed is 10. This can be changed by increasing the dimension of the arrays
Optimizing Event Selection with the Random Grid Search
Energy Technology Data Exchange (ETDEWEB)
Bhat, Pushpalatha C. [Fermilab; Prosper, Harrison B. [Florida State U.; Sekmen, Sezen [Kyungpook Natl. U.; Stewart, Chip [Broad Inst., Cambridge
2017-06-29
The random grid search (RGS) is a simple, but efficient, stochastic algorithm to find optimal cuts that was developed in the context of the search for the top quark at Fermilab in the mid-1990s. The algorithm, and associated code, have been enhanced recently with the introduction of two new cut types, one of which has been successfully used in searches for supersymmetry at the Large Hadron Collider. The RGS optimization algorithm is described along with the recent developments, which are illustrated with two examples from particle physics. One explores the optimization of the selection of vector boson fusion events in the four-lepton decay mode of the Higgs boson and the other optimizes SUSY searches using boosted objects and the razor variables.
Protein structure database search and evolutionary classification.
Yang, Jinn-Moon; Tung, Chi-Hua
2006-01-01
As more protein structures become available and structural genomics efforts provide structural models in a genome-wide strategy, there is a growing need for fast and accurate methods for discovering homologous proteins and evolutionary classifications of newly determined structures. We have developed 3D-BLAST, in part, to address these issues. 3D-BLAST is as fast as BLAST and calculates the statistical significance (E-value) of an alignment to indicate the reliability of the prediction. Using this method, we first identified 23 states of the structural alphabet that represent pattern profiles of the backbone fragments and then used them to represent protein structure databases as structural alphabet sequence databases (SADB). Our method enhanced BLAST as a search method, using a new structural alphabet substitution matrix (SASM) to find the longest common substructures with high-scoring structured segment pairs from an SADB database. Using personal computers with Intel Pentium4 (2.8 GHz) processors, our method searched more than 10 000 protein structures in 1.3 s and achieved a good agreement with search results from detailed structure alignment methods. [3D-BLAST is available at http://3d-blast.life.nctu.edu.tw].
Optimal Quantum Spatial Search on Random Temporal Networks.
Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser
2017-12-01
To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G(n,p), where p is the probability that any two given nodes are connected: After every time interval τ, a new graph G(n,p) replaces the previous one. We prove analytically that, for any given p, there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O(sqrt[n]), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.
Optimal Quantum Spatial Search on Random Temporal Networks
Chakraborty, Shantanav; Novo, Leonardo; Di Giorgio, Serena; Omar, Yasser
2017-12-01
To investigate the performance of quantum information tasks on networks whose topology changes in time, we study the spatial search algorithm by continuous time quantum walk to find a marked node on a random temporal network. We consider a network of n nodes constituted by a time-ordered sequence of Erdös-Rényi random graphs G (n ,p ), where p is the probability that any two given nodes are connected: After every time interval τ , a new graph G (n ,p ) replaces the previous one. We prove analytically that, for any given p , there is always a range of values of τ for which the running time of the algorithm is optimal, i.e., O (√{n }), even when search on the individual static graphs constituting the temporal network is suboptimal. On the other hand, there are regimes of τ where the algorithm is suboptimal even when each of the underlying static graphs are sufficiently connected to perform optimal search on them. From this first study of quantum spatial search on a time-dependent network, it emerges that the nontrivial interplay between temporality and connectivity is key to the algorithmic performance. Moreover, our work can be extended to establish high-fidelity qubit transfer between any two nodes of the network. Overall, our findings show that one can exploit temporality to achieve optimal quantum information tasks on dynamical random networks.
Fast Structural Search in Phylogenetic Databases
Directory of Open Access Journals (Sweden)
William H. Piel
2005-01-01
Full Text Available As the size of phylogenetic databases grows, the need for efficiently searching these databases arises. Thanks to previous and ongoing research, searching by attribute value and by text has become commonplace in these databases. However, searching by topological or physical structure, especially for large databases and especially for approximate matches, is still an art. We propose structural search techniques that, given a query or pattern tree P and a database of phylogenies D, find trees in D that are sufficiently close to P . The “closeness” is a measure of the topological relationships in P that are found to be the same or similar in a tree D in D. We develop a filtering technique that accelerates searches and present algorithms for rooted and unrooted trees where the trees can be weighted or unweighted. Experimental results on comparing the similarity measure with existing tree metrics and on evaluating the efficiency of the search techniques demonstrate that the proposed approach is promising
Intermittent random walks: transport regimes and implications on search strategies
International Nuclear Information System (INIS)
Gomez Portillo, Ignacio; Campos, Daniel; Méndez, Vicenç
2011-01-01
We construct a transport model for particles that alternate rests of random duration and flights with random velocities. The model provides a balance equation for the mesoscopic particle density obtained from the continuous-time random walk framework. By assuming power laws for the distributions of waiting times and flight durations (for any velocity distribution with finite moments) we have found that the model can yield all the transport regimes ranging from subdiffusion to ballistic depending on the values of the characteristic exponents of the distributions. In addition, if the exponents satisfy a simple relationship it is shown how the competition between the tails of the distributions gives rise to a diffusive transport. Finally, we explore how the details of this intermittent transport process affect the success probability in an optimal search problem where an individual searcher looks for a target distributed (heterogeneously) in space. All the results are conveniently checked with numerical simulations
Unbiased structural search of small copper clusters within DFT
Energy Technology Data Exchange (ETDEWEB)
Cogollo-Olivo, Beatriz H., E-mail: bcogolloo@unicartagena.edu.co [Maestría en Ciencias Físicas, Universidad de Cartagena, 130001 Cartagena de Indias, Bolívar (Colombia); Seriani, Nicola, E-mail: nseriani@ictp.it [Condensed Matter and Statistical Physics Section, The Abdus Salam ICTP, Strada Costiera 11, 34151 Trieste (Italy); Montoya, Javier A., E-mail: jmontoyam@unicartagena.edu.co [Instituto de Matemáticas Aplicadas, Universidad de Cartagena, 130001 Cartagena de Indias, Bolívar (Colombia); Associates Program, The Abdus Salam ICTP, Strada Costiera 11, 34151 Trieste (Italy)
2015-11-05
Highlights: • We have been able to identify novel metastable structures for small Cu clusters. • We have shown that a linear structure reported for Cu{sub 3} is actually a local maximum. • Some of the structures reported in literature are actually unstable within DFT. • Some of the isomer structures found shows the limits of educated guesses. - Abstract: The atomic structure of small Cu clusters with 3–6 atoms has been investigated by density functional theory and random search algorithm. New metastable structures have been found that lie merely tens of meV/atom above the corresponding ground state, and could therefore be present at thermodynamic equilibrium at room temperature or slightly above. Moreover, we show that the previously proposed linear configuration for Cu{sub 3} is in fact a local maximum of the energy. Finally, we argue that the random search algorithm also provides qualitative information about the attraction basin of each structure in the energy landscape.
Optimization by GRASP greedy randomized adaptive search procedures
Resende, Mauricio G C
2016-01-01
This is the first book to cover GRASP (Greedy Randomized Adaptive Search Procedures), a metaheuristic that has enjoyed wide success in practice with a broad range of applications to real-world combinatorial optimization problems. The state-of-the-art coverage and carefully crafted pedagogical style lends this book highly accessible as an introductory text not only to GRASP, but also to combinatorial optimization, greedy algorithms, local search, and path-relinking, as well as to heuristics and metaheuristics, in general. The focus is on algorithmic and computational aspects of applied optimization with GRASP with emphasis given to the end-user, providing sufficient information on the broad spectrum of advances in applied optimization with GRASP. For the more advanced reader, chapters on hybridization with path-relinking and parallel and continuous GRASP present these topics in a clear and concise fashion. Additionally, the book offers a very complete annotated bibliography of GRASP and combinatorial optimizat...
Search for a perfect generator of random numbers
International Nuclear Information System (INIS)
Musyck, E.
1977-01-01
Theoretical tests have been carried out by COVEYOU and MAC PHERSON to verify the applications of the LEHMER algorithm. In a similar way, a theoretical method is proposed to evaluate in a rigorous way the random character of numbers generated by a shift register. This theory introduces the concept of ''degree of randomness'' of the elements, taken in a definite order, of a shift register. It permits making the judicious choice of the elements of the shift register which will produce the bits of the random numbers. On the other hand, a calculation method is developed in order to verify the primitive character of any shift register of high complexity. A new test, called ''slice test'', of empirical and theoretical use is also described; it constitutes a significant contribution to the understanding of certain properties of pseudo-random sequences. As a practical example, a random number generator structure formed with 32 bits, built out of a shift register with 61 elements and 60 modulo-2 adder circuits was made. The author is convinced that this generator can be considered to be practically perfect for all empirical applications of random numbers, particularly for the solution of Monte-Carlo problems. (author)
Compressed Data Structures for Range Searching
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li; Vind, Søren Juhl
2015-01-01
matrices and web graphs. Our contribution is twofold. First, we show how to compress geometric repetitions that may appear in standard range searching data structures (such as K-D trees, Quad trees, Range trees, R-trees, Priority R-trees, and K-D-B trees), and how to implement subsequent range queries...... on the compressed representation with only a constant factor overhead. Secondly, we present a compression scheme that efficiently identifies geometric repetitions in point sets, and produces a hierarchical clustering of the point sets, which combined with the first result leads to a compressed representation...
Stochastic optimal foraging: tuning intensive and extensive dynamics in random searches.
Directory of Open Access Journals (Sweden)
Frederic Bartumeus
Full Text Available Recent theoretical developments had laid down the proper mathematical means to understand how the structural complexity of search patterns may improve foraging efficiency. Under information-deprived scenarios and specific landscape configurations, Lévy walks and flights are known to lead to high search efficiencies. Based on a one-dimensional comparative analysis we show a mechanism by which, at random, a searcher can optimize the encounter with close and distant targets. The mechanism consists of combining an optimal diffusivity (optimally enhanced diffusion with a minimal diffusion constant. In such a way the search dynamics adequately balances the tension between finding close and distant targets, while, at the same time, shifts the optimal balance towards relatively larger close-to-distant target encounter ratios. We find that introducing a multiscale set of reorientations ensures both a thorough local space exploration without oversampling and a fast spreading dynamics at the large scale. Lévy reorientation patterns account for these properties but other reorientation strategies providing similar statistical signatures can mimic or achieve comparable efficiencies. Hence, the present work unveils general mechanisms underlying efficient random search, beyond the Lévy model. Our results suggest that animals could tune key statistical movement properties (e.g. enhanced diffusivity, minimal diffusion constant to cope with the very general problem of balancing out intensive and extensive random searching. We believe that theoretical developments to mechanistically understand stochastic search strategies, such as the one here proposed, are crucial to develop an empirically verifiable and comprehensive animal foraging theory.
PARAMETRIC IDENTIFICATION OF STOCHASTIC SYSTEM BY NON-GRADIENT RANDOM SEARCHING
Directory of Open Access Journals (Sweden)
A. A. Lobaty
2017-01-01
Full Text Available At this moment we know a great variety of identification objects, tasks and methods and its significance is constantly increasing in various fields of science and technology. The identification problem is dependent on a priori information about identification object, besides that the existing approaches and methods of identification are determined by the form of mathematical models (deterministic, stochastic, frequency, temporal, spectral etc.. The paper considers a problem for determination of system parameters (identification object which is assigned by the stochastic mathematical model including random functions of time. It has been shown that while making optimization of the stochastic systems subject to random actions deterministic methods can be applied only for a limited approximate optimization of the system by taking into account average random effects and fixed structure of the system. The paper proposes an algorithm for identification of parameters in a mathematical model of the stochastic system by non-gradient random searching. A specific feature of the algorithm is its applicability practically to mathematic models of any type because the applied algorithm does not depend on linearization and differentiability of functions included in the mathematical model of the system. The proposed algorithm ensures searching of an extremum for the specified quality criteria in terms of external uncertainties and limitations while using random searching of parameters for a mathematical model of the system. The paper presents results of the investigations on operational capability of the considered identification method while using mathematical simulation of hypothetical control system with a priori unknown parameter values of the mathematical model. The presented results of the mathematical simulation obviously demonstrate the operational capability of the proposed identification method.
Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem.
Nallaperuma, Samadhi; Neumann, Frank; Sudholt, Dirk
2017-01-01
Randomized search heuristics are frequently applied to NP-hard combinatorial optimization problems. The runtime analysis of randomized search heuristics has contributed tremendously to our theoretical understanding. Recently, randomized search heuristics have been examined regarding their achievable progress within a fixed-time budget. We follow this approach and present a fixed-budget analysis for an NP-hard combinatorial optimization problem. We consider the well-known Traveling Salesperson Problem (TSP) and analyze the fitness increase that randomized search heuristics are able to achieve within a given fixed-time budget. In particular, we analyze Manhattan and Euclidean TSP instances and Randomized Local Search (RLS), (1+1) EA and (1+[Formula: see text]) EA algorithms for the TSP in a smoothed complexity setting, and derive the lower bounds of the expected fitness gain for a specified number of generations.
Azimzade, Youness; Mashaghi, Alireza
2017-12-01
Efficient search acts as a strong selective force in biological systems ranging from cellular populations to predator-prey systems. The search processes commonly involve finding a stationary or mobile target within a heterogeneously structured environment where obstacles limit migration. An open generic question is whether random or directionally biased motions or a combination of both provide an optimal search efficiency and how that depends on the motility and density of targets and obstacles. To address this question, we develop a simple model that involves a random walker searching for its targets in a heterogeneous medium of bond percolation square lattice and used mean first passage time (〈T 〉 ) as an indication of average search time. Our analysis reveals a dual effect of directional bias on the minimum value of 〈T 〉 . For a homogeneous medium, directionality always decreases 〈T 〉 and a pure directional migration (a ballistic motion) serves as the optimized strategy, while for a heterogeneous environment, we find that the optimized strategy involves a combination of directed and random migrations. The relative contribution of these modes is determined by the density of obstacles and motility of targets. Existence of randomness and motility of targets add to the efficiency of search. Our study reveals generic and simple rules that govern search efficiency. Our findings might find application in a number of areas including immunology, cell biology, ecology, and robotics.
Taking structure searches to the next dimension.
Schafferhans, Andrea; Rost, Burkhard
2014-07-08
Structure comparisons are now the first step when a new experimental high-resolution protein structure has been determined. In this issue of Structure, Wiederstein and colleagues describe their latest tool for comparing structures, which gives us the unprecedented power to discover crucial structural connections between whole complexes of proteins in the full structural database in real time. Copyright © 2014 Elsevier Ltd. All rights reserved.
Personalized search result diversification via structured learning
Liang, S.; Ren, Z.; de Rijke, M.
2014-01-01
This paper is concerned with the problem of personalized diversification of search results, with the goal of enhancing the performance of both plain diversification and plain personalization algorithms. In previous work, the problem has mainly been tackled by means of unsupervised learning. To
An adaptive random search for short term generation scheduling with network constraints.
Directory of Open Access Journals (Sweden)
J A Marmolejo
Full Text Available This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.
On the expected duration of a search for a fixed pattern in random data
DEFF Research Database (Denmark)
Nielsen, Peter Tolstrup
1973-01-01
An expression is obtained for the expected duration of a search to find a givenL-ary sequence in a semi-infinite stream of randomL-ary data. The search time is found to be an increasing function of the lengths of the "bifices" of the pattern, where the term bifix denotes a sequence which is both...
IMPROVING PERSONALIZED WEB SEARCH USING BOOKSHELF DATA STRUCTURE
Directory of Open Access Journals (Sweden)
S.K. Jayanthi
2012-10-01
Full Text Available Search engines are playing a vital role in retrieving relevant information for the web user. In this research work a user profile based web search is proposed. So the web user from different domain may receive different set of results. The main challenging work is to provide relevant results at the right level of reading difficulty. Estimating user expertise and re-ranking the results are the main aspects of this paper. The retrieved results are arranged in Bookshelf Data Structure for easy access. Better presentation of search results hence increases the usability of web search engines significantly in visual mode.
DEFF Research Database (Denmark)
Neumann, Frank; Witt, Carsten
2015-01-01
combinatorial optimization problem, namely makespan scheduling. We study the model of a strong adversary which is allowed to change one job at regular intervals. Furthermore, we investigate the setting of random changes. Our results show that randomized local search and a simple evolutionary algorithm are very...
Labrecque, Michel; Ratté, Stéphane; Frémont, Pierre; Cauchon, Michel; Ouellet, Jérôme; Hogg, William; McGowan, Jessie; Gagnon, Marie-Pierre; Njoya, Merlin; Légaré, France
2013-10-01
To compare the ability of users of 2 medical search engines, InfoClinique and the Trip database, to provide correct answers to clinical questions and to explore the perceived effects of the tools on the clinical decision-making process. Randomized trial. Three family medicine units of the family medicine program of the Faculty of Medicine at Laval University in Quebec city, Que. Fifteen second-year family medicine residents. Residents generated 30 structured questions about therapy or preventive treatment (2 questions per resident) based on clinical encounters. Using an Internet platform designed for the trial, each resident answered 20 of these questions (their own 2, plus 18 of the questions formulated by other residents, selected randomly) before and after searching for information with 1 of the 2 search engines. For each question, 5 residents were randomly assigned to begin their search with InfoClinique and 5 with the Trip database. The ability of residents to provide correct answers to clinical questions using the search engines, as determined by third-party evaluation. After answering each question, participants completed a questionnaire to assess their perception of the engine's effect on the decision-making process in clinical practice. Of 300 possible pairs of answers (1 answer before and 1 after the initial search), 254 (85%) were produced by 14 residents. Of these, 132 (52%) and 122 (48%) pairs of answers concerned questions that had been assigned an initial search with InfoClinique and the Trip database, respectively. Both engines produced an important and similar absolute increase in the proportion of correct answers after searching (26% to 62% for InfoClinique, for an increase of 36%; 24% to 63% for the Trip database, for an increase of 39%; P = .68). For all 30 clinical questions, at least 1 resident produced the correct answer after searching with either search engine. The mean (SD) time of the initial search for each question was 23.5 (7
Fatigue in Steel Structures under Random Loading
DEFF Research Database (Denmark)
Agerskov, Henning
1999-01-01
types of welded plate test specimens and full-scale offshore tubular joints. The materials that have been used are either conventional structural steel with a yield stress of ~ 360-410 MPa or high-strength steel with a yield stress of ~ 810-1010 MPa. The fatigue tests and the fracture mechanics analyses......Fatigue damage accumulation in steel structures under random loading is studied. The fatigue life of welded joints has been determined both experimentally and from a fracture mechanics analysis. In the experimental part of the investigation, fatigue test series have been carried through on various...... have been carried out using load histories, which are realistic in relation to the types of structures studied, i.e. primarily bridges, offshore structures and chimneys. In general, the test series carried through show a significant difference between constant amplitude and variable amplitude fatigue...
Emergence of an optimal search strategy from a simple random walk.
Sakiyama, Tomoko; Gunji, Yukio-Pegio
2013-09-06
In reports addressing animal foraging strategies, it has been stated that Lévy-like algorithms represent an optimal search strategy in an unknown environment, because of their super-diffusion properties and power-law-distributed step lengths. Here, starting with a simple random walk algorithm, which offers the agent a randomly determined direction at each time step with a fixed move length, we investigated how flexible exploration is achieved if an agent alters its randomly determined next step forward and the rule that controls its random movement based on its own directional moving experiences. We showed that our algorithm led to an effective food-searching performance compared with a simple random walk algorithm and exhibited super-diffusion properties, despite the uniform step lengths. Moreover, our algorithm exhibited a power-law distribution independent of uniform step lengths.
Stochastic search in structural optimization - Genetic algorithms and simulated annealing
Hajela, Prabhat
1993-01-01
An account is given of illustrative applications of genetic algorithms and simulated annealing methods in structural optimization. The advantages of such stochastic search methods over traditional mathematical programming strategies are emphasized; it is noted that these methods offer a significantly higher probability of locating the global optimum in a multimodal design space. Both genetic-search and simulated annealing can be effectively used in problems with a mix of continuous, discrete, and integer design variables.
Cooperative random Levy flight searches and the flight patterns of honeybees
International Nuclear Information System (INIS)
Reynolds, A.M.
2006-01-01
The most efficient Levy flight (scale-free) searching strategy for N independent searchers to adopt when target sites are randomly and sparsely distributed is identified. For N=1, it is well known that the optimal searching strategy is attained when μ=2, where the exponent μ characterizes the Levy distribution, P(l)=l -μ , of flight-lengths. For N>1, the optimal searching strategy is attained as μ->1. It is suggested that the orientation flights of honeybees can be understood within the context of such an optimal cooperative random Levy flight searching strategy. Upon returning to their hive after surveying a landscape honeybees can exchange information about the locations of target sites through the waggle dance. In accordance with observations it is predicted that the waggle dance can be disrupted without noticeable influence on a hive's ability to maintain weight when forage is plentiful
VES/TEM 1D joint inversion by using Controlled Random Search (CRS) algorithm
Bortolozo, Cassiano Antonio; Porsani, Jorge Luís; Santos, Fernando Acácio Monteiro dos; Almeida, Emerson Rodrigo
2015-01-01
Electrical (DC) and Transient Electromagnetic (TEM) soundings are used in a great number of environmental, hydrological, and mining exploration studies. Usually, data interpretation is accomplished by individual 1D models resulting often in ambiguous models. This fact can be explained by the way as the two different methodologies sample the medium beneath surface. Vertical Electrical Sounding (VES) is good in marking resistive structures, while Transient Electromagnetic sounding (TEM) is very sensitive to conductive structures. Another difference is VES is better to detect shallow structures, while TEM soundings can reach deeper layers. A Matlab program for 1D joint inversion of VES and TEM soundings was developed aiming at exploring the best of both methods. The program uses CRS - Controlled Random Search - algorithm for both single and 1D joint inversions. Usually inversion programs use Marquadt type algorithms but for electrical and electromagnetic methods, these algorithms may find a local minimum or not converge. Initially, the algorithm was tested with synthetic data, and then it was used to invert experimental data from two places in Paraná sedimentary basin (Bebedouro and Pirassununga cities), both located in São Paulo State, Brazil. Geoelectric model obtained from VES and TEM data 1D joint inversion is similar to the real geological condition, and ambiguities were minimized. Results with synthetic and real data show that 1D VES/TEM joint inversion better recovers simulated models and shows a great potential in geological studies, especially in hydrogeological studies.
International Nuclear Information System (INIS)
Lu Dawei; Peng Xinhua; Du Jiangfeng; Zhu Jing; Zou Ping; Yu Yihua; Zhang Shanmin; Chen Qun
2010-01-01
An important quantum search algorithm based on the quantum random walk performs an oracle search on a database of N items with O(√(phN)) calls, yielding a speedup similar to the Grover quantum search algorithm. The algorithm was implemented on a quantum information processor of three-qubit liquid-crystal nuclear magnetic resonance (NMR) in the case of finding 1 out of 4, and the diagonal elements' tomography of all the final density matrices was completed with comprehensible one-dimensional NMR spectra. The experimental results agree well with the theoretical predictions.
Online games: a novel approach to explore how partial information influences human random searches
Martínez-García, Ricardo; Calabrese, Justin M.; López, Cristóbal
2017-01-01
Many natural processes rely on optimizing the success ratio of a search process. We use an experimental setup consisting of a simple online game in which players have to find a target hidden on a board, to investigate how the rounds are influenced by the detection of cues. We focus on the search duration and the statistics of the trajectories traced on the board. The experimental data are explained by a family of random-walk-based models and probabilistic analytical approximations. If no initial information is given to the players, the search is optimized for cues that cover an intermediate spatial scale. In addition, initial information about the extension of the cues results, in general, in faster searches. Finally, strategies used by informed players turn into non-stationary processes in which the length of e ach displacement evolves to show a well-defined characteristic scale that is not found in non-informed searches.
Quasi-steady-state analysis of two-dimensional random intermittent search processes
Bressloff, Paul C.
2011-06-01
We use perturbation methods to analyze a two-dimensional random intermittent search process, in which a searcher alternates between a diffusive search phase and a ballistic movement phase whose velocity direction is random. A hidden target is introduced within a rectangular domain with reflecting boundaries. If the searcher moves within range of the target and is in the search phase, it has a chance of detecting the target. A quasi-steady-state analysis is applied to the corresponding Chapman-Kolmogorov equation. This generates a reduced Fokker-Planck description of the search process involving a nonzero drift term and an anisotropic diffusion tensor. In the case of a uniform direction distribution, for which there is zero drift, and isotropic diffusion, we use the method of matched asymptotics to compute the mean first passage time (MFPT) to the target, under the assumption that the detection range of the target is much smaller than the size of the domain. We show that an optimal search strategy exists, consistent with previous studies of intermittent search in a radially symmetric domain that were based on a decoupling or moment closure approximation. We also show how the decoupling approximation can break down in the case of biased search processes. Finally, we analyze the MFPT in the case of anisotropic diffusion and find that anisotropy can be useful when the searcher starts from a fixed location. © 2011 American Physical Society.
Quasi-steady-state analysis of two-dimensional random intermittent search processes
Bressloff, Paul C.; Newby, Jay M.
2011-01-01
We use perturbation methods to analyze a two-dimensional random intermittent search process, in which a searcher alternates between a diffusive search phase and a ballistic movement phase whose velocity direction is random. A hidden target is introduced within a rectangular domain with reflecting boundaries. If the searcher moves within range of the target and is in the search phase, it has a chance of detecting the target. A quasi-steady-state analysis is applied to the corresponding Chapman-Kolmogorov equation. This generates a reduced Fokker-Planck description of the search process involving a nonzero drift term and an anisotropic diffusion tensor. In the case of a uniform direction distribution, for which there is zero drift, and isotropic diffusion, we use the method of matched asymptotics to compute the mean first passage time (MFPT) to the target, under the assumption that the detection range of the target is much smaller than the size of the domain. We show that an optimal search strategy exists, consistent with previous studies of intermittent search in a radially symmetric domain that were based on a decoupling or moment closure approximation. We also show how the decoupling approximation can break down in the case of biased search processes. Finally, we analyze the MFPT in the case of anisotropic diffusion and find that anisotropy can be useful when the searcher starts from a fixed location. © 2011 American Physical Society.
Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation
DEFF Research Database (Denmark)
Witt, Carsten
2012-01-01
The analysis of randomized search heuristics on classes of functions is fundamental for the understanding of the underlying stochastic process and the development of suitable proof techniques. Recently, remarkable progress has been made in bounding the expected optimization time of the simple (1...
Fitness levels with tail bounds for the analysis of randomized search heuristics
DEFF Research Database (Denmark)
Witt, Carsten
2014-01-01
The fitness-level method, also called the method of f-based partitions, is an intuitive and widely used technique for the running time analysis of randomized search heuristics. It was originally defined to prove upper and lower bounds on the expected running time. Recently, upper tail bounds were...
SA-Search: a web tool for protein structure mining based on a Structural Alphabet.
Guyon, Frédéric; Camproux, Anne-Claude; Hochez, Joëlle; Tufféry, Pierre
2004-07-01
SA-Search is a web tool that can be used to mine for protein structures and extract structural similarities. It is based on a hidden Markov model derived Structural Alphabet (SA) that allows the compression of three-dimensional (3D) protein conformations into a one-dimensional (1D) representation using a limited number of prototype conformations. Using such a representation, classical methods developed for amino acid sequences can be employed. Currently, SA-Search permits the performance of fast 3D similarity searches such as the extraction of exact words using a suffix tree approach, and the search for fuzzy words viewed as a simple 1D sequence alignment problem. SA-Search is available at http://bioserv.rpbs.jussieu.fr/cgi-bin/SA-Search.
Directory of Open Access Journals (Sweden)
Vikram Kumar Kamboj
2016-04-01
Full Text Available In recent years, global warming and carbon dioxide (CO2 emission reduction have become important issues in India, as CO2 emission levels are continuing to rise in accordance with the increased volume of Indian national energy consumption under the pressure of global warming, it is crucial for Indian government to impose the effective policy to promote CO2 emission reduction. Challenge of supplying the nation with high quality and reliable electrical energy at a reasonable cost, converted government policy into deregulation and restructuring environment. This research paper presents aims to presents an effective solution for energy and environmental problems of electric power using an efficient and powerful hybrid optimization algorithm: Hybrid Harmony search-random search algorithm. The proposed algorithm is tested for standard IEEE-14 bus, -30 bus and -56 bus system. The effectiveness of proposed hybrid algorithm is compared with others well known evolutionary, heuristics and meta-heuristics search algorithms. For multi-objective unit commitment, it is found that as there are conflicting relationship between cost and emission, if the performance in cost criterion is improved, performance in the emission is seen to deteriorate.
Search-based model identification of smart-structure damage
Glass, B. J.; Macalou, A.
1991-01-01
This paper describes the use of a combined model and parameter identification approach, based on modal analysis and artificial intelligence (AI) techniques, for identifying damage or flaws in a rotating truss structure incorporating embedded piezoceramic sensors. This smart structure example is representative of a class of structures commonly found in aerospace systems and next generation space structures. Artificial intelligence techniques of classification, heuristic search, and an object-oriented knowledge base are used in an AI-based model identification approach. A finite model space is classified into a search tree, over which a variant of best-first search is used to identify the model whose stored response most closely matches that of the input. Newly-encountered models can be incorporated into the model space. This adaptativeness demonstrates the potential for learning control. Following this output-error model identification, numerical parameter identification is used to further refine the identified model. Given the rotating truss example in this paper, noisy data corresponding to various damage configurations are input to both this approach and a conventional parameter identification method. The combination of the AI-based model identification with parameter identification is shown to lead to smaller parameter corrections than required by the use of parameter identification alone.
SA-Search: a web tool for protein structure mining based on a Structural Alphabet
Guyon, Frédéric; Camproux, Anne-Claude; Hochez, Joëlle; Tufféry, Pierre
2004-01-01
SA-Search is a web tool that can be used to mine for protein structures and extract structural similarities. It is based on a hidden Markov model derived Structural Alphabet (SA) that allows the compression of three-dimensional (3D) protein conformations into a one-dimensional (1D) representation using a limited number of prototype conformations. Using such a representation, classical methods developed for amino acid sequences can be employed. Currently, SA-Search permits the performance of f...
Intermittent random walks for an optimal search strategy: one-dimensional case
International Nuclear Information System (INIS)
Oshanin, G; Wio, H S; Lindenberg, K; Burlatsky, S F
2007-01-01
We study the search kinetics of an immobile target by a concentration of randomly moving searchers. The object of the study is to optimize the probability of detection within the constraints of our model. The target is hidden on a one-dimensional lattice in the sense that searchers have no a priori information about where it is, and may detect it only upon encounter. The searchers perform random walks in discrete time n = 0,1,2,...,N, where N is the maximal time the search process is allowed to run. With probability α the searchers step on a nearest-neighbour, and with probability (1-α) they leave the lattice and stay off until they land back on the lattice at a fixed distance L away from the departure point. The random walk is thus intermittent. We calculate the probability P N that the target remains undetected up to the maximal search time N, and seek to minimize this probability. We find that P N is a non-monotonic function of α, and show that there is an optimal choice α opt (N) of α well within the intermittent regime, 0 opt (N) N can be orders of magnitude smaller compared to the 'pure' random walk cases α = 0 and α = 1
A hydronitrogen solid: high pressure ab initio evolutionary structure searches
International Nuclear Information System (INIS)
Hu Anguang; Zhang Fan
2011-01-01
High pressure ab initio evolutionary structure searches resulted in a hydronitrogen solid with a composition of (NH) 4 . The structure searches also provided two molecular isomers, ammonium azide (AA) and trans-tetrazene (TTZ) which were previously discovered experimentally and can be taken as molecular precursors for high pressure synthesis of the hydronitrogen solid. The computed pressure versus enthalpy diagram showed that the transformation pressure to the hydronitrogen solid is 36 GPa from AA and 75 GPa from TTZ. Its metastability was analyzed by the phonon dispersion spectrum and room-temperature vibrational density of state together with the transformation energy barrier back to molecular phases at 298 K. The predicted energy barrier of 0.21 eV/atom means that the proposed hydronitrogen solid should be very stable at ambient conditions. (fast track communication)
Waffenschmidt, Siw; Guddat, Charlotte
2015-01-01
Background: It is unclear which terms should be included in bibliographic searches for randomized controlled trials (RCTs) of drugs, and identifying relevant drug terms can be extremely laborious. The aim of our analysis was to determine whether a bibliographic search using only the generic drug name produces sufficient results for the generation…
Searching for Survivors through Random Human-Body Movement Outdoors by Continuous-Wave Radar Array.
Li, Chuantao; Chen, Fuming; Qi, Fugui; Liu, Miao; Li, Zhao; Liang, Fulai; Jing, Xijing; Lu, Guohua; Wang, Jianqi
2016-01-01
It is a major challenge to search for survivors after chemical or nuclear leakage or explosions. At present, biological radar can be used to achieve this goal by detecting the survivor's respiration signal. However, owing to the random posture of an injured person at a rescue site, the radar wave may directly irradiate the person's head or feet, in which it is difficult to detect the respiration signal. This paper describes a multichannel-based antenna array technology, which forms an omnidirectional detection system via 24-GHz Doppler biological radar, to address the random positioning relative to the antenna of an object to be detected. Furthermore, since the survivors often have random body movement such as struggling and twitching, the slight movements of the body caused by breathing are obscured by these movements. Therefore, a method is proposed to identify random human-body movement by utilizing multichannel information to calculate the background variance of the environment in combination with a constant-false-alarm-rate detector. The conducted outdoor experiments indicate that the system can realize the omnidirectional detection of random human-body movement and distinguish body movement from environmental interference such as movement of leaves and grass. The methods proposed in this paper will be a promising way to search for survivors outdoors.
Searching for Survivors through Random Human-Body Movement Outdoors by Continuous-Wave Radar Array
Liu, Miao; Li, Zhao; Liang, Fulai; Jing, Xijing; Lu, Guohua; Wang, Jianqi
2016-01-01
It is a major challenge to search for survivors after chemical or nuclear leakage or explosions. At present, biological radar can be used to achieve this goal by detecting the survivor’s respiration signal. However, owing to the random posture of an injured person at a rescue site, the radar wave may directly irradiate the person’s head or feet, in which it is difficult to detect the respiration signal. This paper describes a multichannel-based antenna array technology, which forms an omnidirectional detection system via 24-GHz Doppler biological radar, to address the random positioning relative to the antenna of an object to be detected. Furthermore, since the survivors often have random body movement such as struggling and twitching, the slight movements of the body caused by breathing are obscured by these movements. Therefore, a method is proposed to identify random human-body movement by utilizing multichannel information to calculate the background variance of the environment in combination with a constant-false-alarm-rate detector. The conducted outdoor experiments indicate that the system can realize the omnidirectional detection of random human-body movement and distinguish body movement from environmental interference such as movement of leaves and grass. The methods proposed in this paper will be a promising way to search for survivors outdoors. PMID:27073860
Wang, Yi; Wan, Jianwu; Guo, Jun; Cheung, Yiu-Ming; C Yuen, Pong
2017-07-14
Similarity search is essential to many important applications and often involves searching at scale on high-dimensional data based on their similarity to a query. In biometric applications, recent vulnerability studies have shown that adversarial machine learning can compromise biometric recognition systems by exploiting the biometric similarity information. Existing methods for biometric privacy protection are in general based on pairwise matching of secured biometric templates and have inherent limitations in search efficiency and scalability. In this paper, we propose an inference-based framework for privacy-preserving similarity search in Hamming space. Our approach builds on an obfuscated distance measure that can conceal Hamming distance in a dynamic interval. Such a mechanism enables us to systematically design statistically reliable methods for retrieving most likely candidates without knowing the exact distance values. We further propose to apply Montgomery multiplication for generating search indexes that can withstand adversarial similarity analysis, and show that information leakage in randomized Montgomery domains can be made negligibly small. Our experiments on public biometric datasets demonstrate that the inference-based approach can achieve a search accuracy close to the best performance possible with secure computation methods, but the associated cost is reduced by orders of magnitude compared to cryptographic primitives.
Effects of systematic phase errors on optimized quantum random-walk search algorithm
International Nuclear Information System (INIS)
Zhang Yu-Chao; Bao Wan-Su; Wang Xiang; Fu Xiang-Qun
2015-01-01
This study investigates the effects of systematic errors in phase inversions on the success rate and number of iterations in the optimized quantum random-walk search algorithm. Using the geometric description of this algorithm, a model of the algorithm with phase errors is established, and the relationship between the success rate of the algorithm, the database size, the number of iterations, and the phase error is determined. For a given database size, we obtain both the maximum success rate of the algorithm and the required number of iterations when phase errors are present in the algorithm. Analyses and numerical simulations show that the optimized quantum random-walk search algorithm is more robust against phase errors than Grover’s algorithm. (paper)
Biclustering of gene expression data using reactive greedy randomized adaptive search procedure.
Dharan, Smitha; Nair, Achuthsankar S
2009-01-30
Biclustering algorithms belong to a distinct class of clustering algorithms that perform simultaneous clustering of both rows and columns of the gene expression matrix and can be a very useful analysis tool when some genes have multiple functions and experimental conditions are diverse. Cheng and Church have introduced a measure called mean squared residue score to evaluate the quality of a bicluster and has become one of the most popular measures to search for biclusters. In this paper, we review basic concepts of the metaheuristics Greedy Randomized Adaptive Search Procedure (GRASP)-construction and local search phases and propose a new method which is a variant of GRASP called Reactive Greedy Randomized Adaptive Search Procedure (Reactive GRASP) to detect significant biclusters from large microarray datasets. The method has two major steps. First, high quality bicluster seeds are generated by means of k-means clustering. In the second step, these seeds are grown using the Reactive GRASP, in which the basic parameter that defines the restrictiveness of the candidate list is self-adjusted, depending on the quality of the solutions found previously. We performed statistical and biological validations of the biclusters obtained and evaluated the method against the results of basic GRASP and as well as with the classic work of Cheng and Church. The experimental results indicate that the Reactive GRASP approach outperforms the basic GRASP algorithm and Cheng and Church approach. The Reactive GRASP approach for the detection of significant biclusters is robust and does not require calibration efforts.
Motile male gametes of the araphid diatom Tabularia fasciculata search randomly for mates.
Directory of Open Access Journals (Sweden)
Robyn Edgar
Full Text Available Sexuality in the marine araphid diatom Tabularia involves an unusual type of gamete, not only among diatoms but possibly in all of nature. The non-flagellated male gamete is free and vigorously motile, propelled by pseudopodia. However, the cues (if any in their search for compatible female gametes and the general search patterns to locate them are unknown. We tracked and compared male gamete movements in the presence and absence of receptive female gametes. Path linearity of male movement was not affected by presence of female gametes. Male gametes did not move towards female gametes regardless of their proximity to each other, suggesting that the detection range for a compatible mate is very small compared to known algal examples (mostly spermatozoids and that mate recognition requires (near contact with a female gamete. We therefore investigated how male gametes move to bring insight into their search strategy and found that it was consistent with the predictions of a random-walk model with changes in direction coming from an even distribution. We further investigated the type of random walk by determining the best-fit distribution on the tail of the move length distribution and found it to be consistent with a truncated power law distribution with an exponent of 2.34. Although consistent with a Lévy walk search pattern, the range of move lengths in the tail was too narrow for Lévy properties to emerge and so would be best described as Brownian motion. This is somewhat surprising because female gametes were often outnumbered by male gametes, thus contrary to the assumption that a Brownian search mode may be most optimal with an abundant target resource. This is also the first mathematically analysed search pattern of a non-flagellated protistan gamete, supporting the notion that principles of Brownian motion have wide application in biology.
Evaluating random search strategies in three mammals from distinct feeding guilds.
Auger-Méthé, Marie; Derocher, Andrew E; DeMars, Craig A; Plank, Michael J; Codling, Edward A; Lewis, Mark A
2016-09-01
Searching allows animals to find food, mates, shelter and other resources essential for survival and reproduction and is thus among the most important activities performed by animals. Theory predicts that animals will use random search strategies in highly variable and unpredictable environments. Two prominent models have been suggested for animals searching in sparse and heterogeneous environments: (i) the Lévy walk and (ii) the composite correlated random walk (CCRW) and its associated area-restricted search behaviour. Until recently, it was difficult to differentiate between the movement patterns of these two strategies. Using a new method that assesses whether movement patterns are consistent with these two strategies and two other common random search strategies, we investigated the movement behaviour of three species inhabiting sparse northern environments: woodland caribou (Rangifer tarandus caribou), barren-ground grizzly bear (Ursus arctos) and polar bear (Ursus maritimus). These three species vary widely in their diets and thus allow us to contrast the movement patterns of animals from different feeding guilds. Our results showed that although more traditional methods would have found evidence for the Lévy walk for some individuals, a comparison of the Lévy walk to CCRWs showed stronger support for the latter. While a CCRW was the best model for most individuals, there was a range of support for its absolute fit. A CCRW was sufficient to explain the movement of nearly half of herbivorous caribou and a quarter of omnivorous grizzly bears, but was insufficient to explain the movement of all carnivorous polar bears. Strong evidence for CCRW movement patterns suggests that many individuals may use a multiphasic movement strategy rather than one-behaviour strategies such as the Lévy walk. The fact that the best model was insufficient to describe the movement paths of many individuals suggests that some animals living in sparse environments may use
Solution Methods for Structures with Random Properties Subject to Random Excitation
DEFF Research Database (Denmark)
Köylüoglu, H. U.; Nielsen, Søren R. K.; Cakmak, A. S.
This paper deals with the lower order statistical moments of the response of structures with random stiffness and random damping properties subject to random excitation. The arising stochastic differential equations (SDE) with random coefficients are solved by two methods, a second order...... the SDE with random coefficients with deterministic initial conditions to an equivalent nonlinear SDE with deterministic coefficient and random initial conditions. In both methods, the statistical moment equations are used. Hierarchy of statistical moments in the markovian approach is closed...... by the cumulant neglect closure method applied at the fourth order level....
Global search in photoelectron diffraction structure determination using genetic algorithms
Energy Technology Data Exchange (ETDEWEB)
Viana, M L [Departamento de Fisica, Icex, UFMG, Belo Horizonte, Minas Gerais (Brazil); Muino, R Diez [Donostia International Physics Center DIPC, Paseo Manuel de Lardizabal 4, 20018 San Sebastian (Spain); Soares, E A [Departamento de Fisica, Icex, UFMG, Belo Horizonte, Minas Gerais (Brazil); Hove, M A Van [Department of Physics and Materials Science, City University of Hong Kong, Hong Kong (China); Carvalho, V E de [Departamento de Fisica, Icex, UFMG, Belo Horizonte, Minas Gerais (Brazil)
2007-11-07
Photoelectron diffraction (PED) is an experimental technique widely used to perform structural determinations of solid surfaces. Similarly to low-energy electron diffraction (LEED), structural determination by PED requires a fitting procedure between the experimental intensities and theoretical results obtained through simulations. Multiple scattering has been shown to be an effective approach for making such simulations. The quality of the fit can be quantified through the so-called R-factor. Therefore, the fitting procedure is, indeed, an R-factor minimization problem. However, the topography of the R-factor as a function of the structural and non-structural surface parameters to be determined is complex, and the task of finding the global minimum becomes tough, particularly for complex structures in which many parameters have to be adjusted. In this work we investigate the applicability of the genetic algorithm (GA) global optimization method to this problem. The GA is based on the evolution of species, and makes use of concepts such as crossover, elitism and mutation to perform the search. We show results of its application in the structural determination of three different systems: the Cu(111) surface through the use of energy-scanned experimental curves; the Ag(110)-c(2 x 2)-Sb system, in which a theory-theory fit was performed; and the Ag(111) surface for which angle-scanned experimental curves were used. We conclude that the GA is a highly efficient method to search for global minima in the optimization of the parameters that best fit the experimental photoelectron diffraction intensities to the theoretical ones.
Nonlinear deterministic structures and the randomness of protein sequences
Huang Yan Zhao
2003-01-01
To clarify the randomness of protein sequences, we make a detailed analysis of a set of typical protein sequences representing each structural classes by using nonlinear prediction method. No deterministic structures are found in these protein sequences and this implies that they behave as random sequences. We also give an explanation to the controversial results obtained in previous investigations.
CALL FOR PAPERS: Special issue on the random search problem: trends and perspectives
da Luz, Marcos G. E.; Grosberg, Alexander Y.; Raposo, Ernesto P.; Viswanathan, Gandhi M.
2008-11-01
This is a call for contributions to a special issue of Journal of Physics A: Mathematical and Theoretical dedicated to the subject of the random search problem. The motivation behind this special issue is to summarize in a single comprehensive publication, the main aspects (past and present), latest developments, different viewpoints and the directions being followed in this multidisciplinary field. We hope that such a special issue could become a particularly valuable reference for the broad scientific community working with the general random search problem. The Editorial Board has invited Marcos G E da Luz, Alexander Y Grosberg, Ernesto P Raposo and Gandhi M Viswanathan to serve as Guest Editors for the special issue. The general question of how to optimize the search for specific target objects in either continuous or discrete environments when the information available is limited is of significant importance in a broad range of fields. Representative examples include ecology (animal foraging, dispersion of populations), geology (oil recovery from mature reservoirs), information theory (automated researchers of registers in high-capacity database), molecular biology (proteins searching for their sites, e.g., on DNA ), etc. One reason underlying the richness of the random search problem relates to the `ignorance' of the locations of the randomly located `targets'. A statistical approach to the search problem can deal adequately with incomplete information and so stochastic strategies become advantageous. The general problem of how to search efficiently for randomly located target sites can thus be quantitatively described using the concepts and methods of statistical physics and stochastic processes. Scope Thus far, to the best of our knowledge, no recent textbook or review article in a physics journal has appeared on this topic. This makes a special issue with review and research articles attractive to those interested in acquiring a general introduction to the
Optimization of refueling-shuffling scheme in PWR core by random search strategy
International Nuclear Information System (INIS)
Wu Yuan
1991-11-01
A random method for simulating optimization of refueling management in a pressurized water reactor (PWR) core is described. The main purpose of the optimization was to select the 'best' refueling arrangement scheme which would produce maximum economic benefits under certain imposed conditions. To fulfill this goal, an effective optimization strategy, two-stage random search method was developed. First, the search was made in a manner similar to the stratified sampling technique. A local optimum can be reached by comparison of the successive results. Then the other random experiences would be carried on between different strata to try to find the global optimum. In general, it can be used as a practical tool for conventional fuel management scheme. However, it can also be used in studies on optimization of Low-Leakage fuel management. Some calculations were done for a typical PWR core on a CYBER-180/830 computer. The results show that the method proposed can obtain satisfactory approach at reasonable low computational cost
Adaptive symbiotic organisms search (SOS algorithm for structural design optimization
Directory of Open Access Journals (Sweden)
Ghanshyam G. Tejani
2016-07-01
Full Text Available The symbiotic organisms search (SOS algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.
Is Internet search better than structured instruction for web-based health education?
Finkelstein, Joseph; Bedra, McKenzie
2013-01-01
Internet provides access to vast amounts of comprehensive information regarding any health-related subject. Patients increasingly use this information for health education using a search engine to identify education materials. An alternative approach of health education via Internet is based on utilizing a verified web site which provides structured interactive education guided by adult learning theories. Comparison of these two approaches in older patients was not performed systematically. The aim of this study was to compare the efficacy of a web-based computer-assisted education (CO-ED) system versus searching the Internet for learning about hypertension. Sixty hypertensive older adults (age 45+) were randomized into control or intervention groups. The control patients spent 30 to 40 minutes searching the Internet using a search engine for information about hypertension. The intervention patients spent 30 to 40 minutes using the CO-ED system, which provided computer-assisted instruction about major hypertension topics. Analysis of pre- and post- knowledge scores indicated a significant improvement among CO-ED users (14.6%) as opposed to Internet users (2%). Additionally, patients using the CO-ED program rated their learning experience more positively than those using the Internet.
Automatic structure classification of small proteins using random forest
Directory of Open Access Journals (Sweden)
Hirst Jonathan D
2010-07-01
Full Text Available Abstract Background Random forest, an ensemble based supervised machine learning algorithm, is used to predict the SCOP structural classification for a target structure, based on the similarity of its structural descriptors to those of a template structure with an equal number of secondary structure elements (SSEs. An initial assessment of random forest is carried out for domains consisting of three SSEs. The usability of random forest in classifying larger domains is demonstrated by applying it to domains consisting of four, five and six SSEs. Results Random forest, trained on SCOP version 1.69, achieves a predictive accuracy of up to 94% on an independent and non-overlapping test set derived from SCOP version 1.73. For classification to the SCOP Class, Fold, Super-family or Family levels, the predictive quality of the model in terms of Matthew's correlation coefficient (MCC ranged from 0.61 to 0.83. As the number of constituent SSEs increases the MCC for classification to different structural levels decreases. Conclusions The utility of random forest in classifying domains from the place-holder classes of SCOP to the true Class, Fold, Super-family or Family levels is demonstrated. Issues such as introduction of a new structural level in SCOP and the merger of singleton levels can also be addressed using random forest. A real-world scenario is mimicked by predicting the classification for those protein structures from the PDB, which are yet to be assigned to the SCOP classification hierarchy.
A simplified method for random vibration analysis of structures with random parameters
International Nuclear Information System (INIS)
Ghienne, Martin; Blanzé, Claude
2016-01-01
Piezoelectric patches with adapted electrical circuits or viscoelastic dissipative materials are two solutions particularly adapted to reduce vibration of light structures. To accurately design these solutions, it is necessary to describe precisely the dynamical behaviour of the structure. It may quickly become computationally intensive to describe robustly this behaviour for a structure with nonlinear phenomena, such as contact or friction for bolted structures, and uncertain variations of its parameters. The aim of this work is to propose a non-intrusive reduced stochastic method to characterize robustly the vibrational response of a structure with random parameters. Our goal is to characterize the eigenspace of linear systems with dynamic properties considered as random variables. This method is based on a separation of random aspects from deterministic aspects and allows us to estimate the first central moments of each random eigenfrequency with a single deterministic finite elements computation. The method is applied to a frame with several Young's moduli modeled as random variables. This example could be expanded to a bolted structure including piezoelectric devices. The method needs to be enhanced when random eigenvalues are closely spaced. An indicator with no additional computational cost is proposed to characterize the ’’proximity” of two random eigenvalues. (paper)
Causal gene identification using combinatorial V-structure search.
Cai, Ruichu; Zhang, Zhenjie; Hao, Zhifeng
2013-07-01
With the advances of biomedical techniques in the last decade, the costs of human genomic sequencing and genomic activity monitoring are coming down rapidly. To support the huge genome-based business in the near future, researchers are eager to find killer applications based on human genome information. Causal gene identification is one of the most promising applications, which may help the potential patients to estimate the risk of certain genetic diseases and locate the target gene for further genetic therapy. Unfortunately, existing pattern recognition techniques, such as Bayesian networks, cannot be directly applied to find the accurate causal relationship between genes and diseases. This is mainly due to the insufficient number of samples and the extremely high dimensionality of the gene space. In this paper, we present the first practical solution to causal gene identification, utilizing a new combinatorial formulation over V-Structures commonly used in conventional Bayesian networks, by exploring the combinations of significant V-Structures. We prove the NP-hardness of the combinatorial search problem under a general settings on the significance measure on the V-Structures, and present a greedy algorithm to find sub-optimal results. Extensive experiments show that our proposal is both scalable and effective, particularly with interesting findings on the causal genes over real human genome data. Copyright © 2013 Elsevier Ltd. All rights reserved.
A Structural Modeling Approach to a Multilevel Random Coefficients Model.
Rovine, Michael J.; Molenaar, Peter C. M.
2000-01-01
Presents a method for estimating the random coefficients model using covariance structure modeling and allowing one to estimate both fixed and random effects. The method is applied to real and simulated data, including marriage data from J. Belsky and M. Rovine (1990). (SLD)
Geometry, structure and randomness in combinatorics
Nešetřil, Jaroslav; Pellegrini, Marco
2014-01-01
This book collects some surveys on current trends in discrete mathematics and discrete geometry. The areas covered include: graph representations, structural graphs theory, extremal graph theory, Ramsey theory and constrained satisfaction problems.
Han, Runze; Shen, Wensheng; Huang, Peng; Zhou, Zheng; Liu, Lifeng; Liu, Xiaoyan; Kang, Jinfeng
2018-04-01
A novel ternary content addressable memory (TCAM) design based on resistive random access memory (RRAM) is presented. Each TCAM cell consists of two parallel RRAM to both store and search for ternary data. The cell size of the proposed design is 8F2, enable a ∼60× cell area reduction compared with the conventional static random access memory (SRAM) based implementation. Simulation results also show that the search delay and energy consumption of the proposed design at the 64-bit word search are 2 ps and 0.18 fJ/bit/search respectively at 22 nm technology node, where significant improvements are achieved compared to previous works. The desired characteristics of RRAM for implementation of the high performance TCAM search chip are also discussed.
Solving the wind farm layout optimization problem using random search algorithm
DEFF Research Database (Denmark)
Feng, Ju; Shen, Wen Zhong
2015-01-01
, in which better results than the genetic algorithm (GA) and the old version of the RS algorithm are obtained. Second it is applied to the Horns Rev 1 WF, and the optimized layouts obtain a higher power production than its original layout, both for the real scenario and for two constructed scenarios......Wind farm (WF) layout optimization is to find the optimal positions of wind turbines (WTs) inside a WF, so as to maximize and/or minimize a single objective or multiple objectives, while satisfying certain constraints. In this work, a random search (RS) algorithm based on continuous formulation....... In this application, it is also found that in order to get consistent and reliable optimization results, up to 360 or more sectors for wind direction have to be used. Finally, considering the inevitable inter-annual variations in the wind conditions, the robustness of the optimized layouts against wind condition...
Pure random search for ambient sensor distribution optimisation in a smart home environment.
Poland, Michael P; Nugent, Chris D; Wang, Hui; Chen, Liming
2011-01-01
Smart homes are living spaces facilitated with technology to allow individuals to remain in their own homes for longer, rather than be institutionalised. Sensors are the fundamental physical layer with any smart home, as the data they generate is used to inform decision support systems, facilitating appropriate actuator actions. Positioning of sensors is therefore a fundamental characteristic of a smart home. Contemporary smart home sensor distribution is aligned to either a) a total coverage approach; b) a human assessment approach. These methods for sensor arrangement are not data driven strategies, are unempirical and frequently irrational. This Study hypothesised that sensor deployment directed by an optimisation method that utilises inhabitants' spatial frequency data as the search space, would produce more optimal sensor distributions vs. the current method of sensor deployment by engineers. Seven human engineers were tasked to create sensor distributions based on perceived utility for 9 deployment scenarios. A Pure Random Search (PRS) algorithm was then tasked to create matched sensor distributions. The PRS method produced superior distributions in 98.4% of test cases (n=64) against human engineer instructed deployments when the engineers had no access to the spatial frequency data, and in 92.0% of test cases (n=64) when engineers had full access to these data. These results thus confirmed the hypothesis.
Color effects from scattering on random surface structures in dielectrics
DEFF Research Database (Denmark)
Clausen, Jeppe; Christiansen, Alexander B; Garnæs, Jørgen
2012-01-01
We show that cheap large area color filters, based on surface scattering, can be fabricated in dielectric materials by replication of random structures in silicon. The specular transmittance of three different types of structures, corresponding to three different colors, have been characterized...
Random generation of RNA secondary structures according to native distributions
Directory of Open Access Journals (Sweden)
Nebel Markus E
2011-10-01
Full Text Available Abstract Background Random biological sequences are a topic of great interest in genome analysis since, according to a powerful paradigm, they represent the background noise from which the actual biological information must differentiate. Accordingly, the generation of random sequences has been investigated for a long time. Similarly, random object of a more complicated structure like RNA molecules or proteins are of interest. Results In this article, we present a new general framework for deriving algorithms for the non-uniform random generation of combinatorial objects according to the encoding and probability distribution implied by a stochastic context-free grammar. Briefly, the framework extends on the well-known recursive method for (uniform random generation and uses the popular framework of admissible specifications of combinatorial classes, introducing weighted combinatorial classes to allow for the non-uniform generation by means of unranking. This framework is used to derive an algorithm for the generation of RNA secondary structures of a given fixed size. We address the random generation of these structures according to a realistic distribution obtained from real-life data by using a very detailed context-free grammar (that models the class of RNA secondary structures by distinguishing between all known motifs in RNA structure. Compared to well-known sampling approaches used in several structure prediction tools (such as SFold ours has two major advantages: Firstly, after a preprocessing step in time O(n2 for the computation of all weighted class sizes needed, with our approach a set of m random secondary structures of a given structure size n can be computed in worst-case time complexity Om⋅n⋅ log(n while other algorithms typically have a runtime in O(m⋅n2. Secondly, our approach works with integer arithmetic only which is faster and saves us from all the discomforting details of using floating point arithmetic with
Random intermittent search and the tug-of-war model of motor-driven transport
International Nuclear Information System (INIS)
Newby, Jay; Bressloff, Paul C
2010-01-01
We formulate the 'tug-of-war' model of microtubule cargo transport by multiple molecular motors as an intermittent random search for a hidden target. A motor complex consisting of multiple molecular motors with opposing directional preference is modeled using a discrete Markov process. The motors randomly pull each other off of the microtubule so that the state of the motor complex is determined by the number of bound motors. The tug-of-war model prescribes the state transition rates and corresponding cargo velocities in terms of experimentally measured physical parameters. We add space to the resulting Chapman–Kolmogorov (CK) equation so that we can consider delivery of the cargo to a hidden target at an unknown location along the microtubule track. The target represents some subcellular compartment such as a synapse in a neuron's dendrites, and target delivery is modeled as a simple absorption process. Using a quasi-steady-state (QSS) reduction technique we calculate analytical approximations of the mean first passage time (MFPT) to find the target. We show that there exists an optimal adenosine triphosphate (ATP) concentration that minimizes the MFPT for two different cases: (i) the motor complex is composed of equal numbers of kinesin motors bound to two different microtubules (symmetric tug-of-war model) and (ii) the motor complex is composed of different numbers of kinesin and dynein motors bound to a single microtubule (asymmetric tug-of-war model)
Random intermittent search and the tug-of-war model of motor-driven transport
Newby, Jay; Bressloff, Paul C.
2010-04-01
We formulate the 'tug-of-war' model of microtubule cargo transport by multiple molecular motors as an intermittent random search for a hidden target. A motor complex consisting of multiple molecular motors with opposing directional preference is modeled using a discrete Markov process. The motors randomly pull each other off of the microtubule so that the state of the motor complex is determined by the number of bound motors. The tug-of-war model prescribes the state transition rates and corresponding cargo velocities in terms of experimentally measured physical parameters. We add space to the resulting Chapman-Kolmogorov (CK) equation so that we can consider delivery of the cargo to a hidden target at an unknown location along the microtubule track. The target represents some subcellular compartment such as a synapse in a neuron's dendrites, and target delivery is modeled as a simple absorption process. Using a quasi-steady-state (QSS) reduction technique we calculate analytical approximations of the mean first passage time (MFPT) to find the target. We show that there exists an optimal adenosine triphosphate (ATP) concentration that minimizes the MFPT for two different cases: (i) the motor complex is composed of equal numbers of kinesin motors bound to two different microtubules (symmetric tug-of-war model) and (ii) the motor complex is composed of different numbers of kinesin and dynein motors bound to a single microtubule (asymmetric tug-of-war model).
Random intermittent search and the tug-of-war model of motor-driven transport
Newby, Jay
2010-04-16
We formulate the \\'tug-of-war\\' model of microtubule cargo transport by multiple molecular motors as an intermittent random search for a hidden target. A motor complex consisting of multiple molecular motors with opposing directional preference is modeled using a discrete Markov process. The motors randomly pull each other off of the microtubule so that the state of the motor complex is determined by the number of bound motors. The tug-of-war model prescribes the state transition rates and corresponding cargo velocities in terms of experimentally measured physical parameters. We add space to the resulting Chapman-Kolmogorov (CK) equation so that we can consider delivery of the cargo to a hidden target at an unknown location along the microtubule track. The target represents some subcellular compartment such as a synapse in a neuron\\'s dendrites, and target delivery is modeled as a simple absorption process. Using a quasi-steady-state (QSS) reduction technique we calculate analytical approximations of the mean first passage time (MFPT) to find the target. We show that there exists an optimal adenosine triphosphate (ATP) concentration that minimizes the MFPT for two different cases: (i) the motor complex is composed of equal numbers of kinesin motors bound to two different microtubules (symmetric tug-of-war model) and (ii) the motor complex is composed of different numbers of kinesin and dynein motors bound to a single microtubule (asymmetric tug-of-war model). © 2010 IOP Publishing Ltd.
Random intermittent search and the tug-of-war model of motor-driven transport
Newby, Jay; Bressloff, Paul C
2010-01-01
We formulate the 'tug-of-war' model of microtubule cargo transport by multiple molecular motors as an intermittent random search for a hidden target. A motor complex consisting of multiple molecular motors with opposing directional preference is modeled using a discrete Markov process. The motors randomly pull each other off of the microtubule so that the state of the motor complex is determined by the number of bound motors. The tug-of-war model prescribes the state transition rates and corresponding cargo velocities in terms of experimentally measured physical parameters. We add space to the resulting Chapman-Kolmogorov (CK) equation so that we can consider delivery of the cargo to a hidden target at an unknown location along the microtubule track. The target represents some subcellular compartment such as a synapse in a neuron's dendrites, and target delivery is modeled as a simple absorption process. Using a quasi-steady-state (QSS) reduction technique we calculate analytical approximations of the mean first passage time (MFPT) to find the target. We show that there exists an optimal adenosine triphosphate (ATP) concentration that minimizes the MFPT for two different cases: (i) the motor complex is composed of equal numbers of kinesin motors bound to two different microtubules (symmetric tug-of-war model) and (ii) the motor complex is composed of different numbers of kinesin and dynein motors bound to a single microtubule (asymmetric tug-of-war model). © 2010 IOP Publishing Ltd.
EVOLUTION OF FAST MAGNETOACOUSTIC PULSES IN RANDOMLY STRUCTURED CORONAL PLASMAS
International Nuclear Information System (INIS)
Yuan, D.; Li, B.; Pascoe, D. J.; Nakariakov, V. M.; Keppens, R.
2015-01-01
We investigate the evolution of fast magnetoacoustic pulses in randomly structured plasmas, in the context of large-scale propagating waves in the solar atmosphere. We perform one-dimensional numerical simulations of fast wave pulses propagating perpendicular to a constant magnetic field in a low-β plasma with a random density profile across the field. Both linear and nonlinear regimes are considered. We study how the evolution of the pulse amplitude and width depends on their initial values and the parameters of the random structuring. Acting as a dispersive medium, a randomly structured plasma causes amplitude attenuation and width broadening of the fast wave pulses. After the passage of the main pulse, secondary propagating and standing fast waves appear. Width evolution of both linear and nonlinear pulses can be well approximated by linear functions; however, narrow pulses may have zero or negative broadening. This arises because narrow pulses are prone to splitting, while broad pulses usually deviate less from their initial Gaussian shape and form ripple structures on top of the main pulse. Linear pulses decay at an almost constant rate, while nonlinear pulses decay exponentially. A pulse interacts most efficiently with a random medium with a correlation length of about half of the initial pulse width. This detailed model of fast wave pulses propagating in highly structured media substantiates the interpretation of EIT waves as fast magnetoacoustic waves. Evolution of a fast pulse provides us with a novel method to diagnose the sub-resolution filamentation of the solar atmosphere
Sliding surface searching method for slopes containing a potential weak structural surface
Directory of Open Access Journals (Sweden)
Aijun Yao
2014-06-01
Full Text Available Weak structural surface is one of the key factors controlling the stability of slopes. The stability of rock slopes is in general concerned with set of discontinuities. However, in soft rocks, failure can occur along surfaces approaching to a circular failure surface. To better understand the position of potential sliding surface, a new method called simplex-finite stochastic tracking method is proposed. This method basically divides sliding surface into two parts: one is described by smooth curve obtained by random searching, the other one is polyline formed by the weak structural surface. Single or multiple sliding surfaces can be considered, and consequently several types of combined sliding surfaces can be simulated. The paper will adopt the arc-polyline to simulate potential sliding surface and analyze the searching process of sliding surface. Accordingly, software for slope stability analysis using this method was developed and applied in real cases. The results show that, using simplex-finite stochastic tracking method, it is possible to locate the position of a potential sliding surface in the slope.
Probabilistic SSME blades structural response under random pulse loading
Shiao, Michael; Rubinstein, Robert; Nagpal, Vinod K.
1987-01-01
The purpose is to develop models of random impacts on a Space Shuttle Main Engine (SSME) turbopump blade and to predict the probabilistic structural response of the blade to these impacts. The random loading is caused by the impact of debris. The probabilistic structural response is characterized by distribution functions for stress and displacements as functions of the loading parameters which determine the random pulse model. These parameters include pulse arrival, amplitude, and location. The analysis can be extended to predict level crossing rates. This requires knowledge of the joint distribution of the response and its derivative. The model of random impacts chosen allows the pulse arrivals, pulse amplitudes, and pulse locations to be random. Specifically, the pulse arrivals are assumed to be governed by a Poisson process, which is characterized by a mean arrival rate. The pulse intensity is modelled as a normally distributed random variable with a zero mean chosen independently at each arrival. The standard deviation of the distribution is a measure of pulse intensity. Several different models were used for the pulse locations. For example, three points near the blade tip were chosen at which pulses were allowed to arrive with equal probability. Again, the locations were chosen independently at each arrival. The structural response was analyzed both by direct Monte Carlo simulation and by a semi-analytical method.
Alephweb: a search engine based on the federated structure ...
African Journals Online (AJOL)
Revue d'Information Scientifique et Technique. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives · Journal Home > Vol 7, No 1 (1997) >. Log in or Register to get access to full text downloads.
Design, rationale, and baseline demographics of SEARCH I: a prospective cluster-randomized study
Directory of Open Access Journals (Sweden)
Albers F
2012-07-01
Full Text Available Frank Albers,1 Asif Shaikh,2 Ahmar Iqbal,31Medical Affairs Respiratory, 2Clinical Development and Medical Affairs, Field Based Medicine-Respiratory, Boehringer Ingelheim Pharmaceuticals, Inc, Ridgefield, CT, USA; 3Respiratory Medical Affairs, Pfizer Inc, New York, NY, USAAbstract: Questionnaires are available to identify patients at risk for several chronic diseases, including COPD, but are infrequently utilized in primary care. COPD is often underdiagnosed, while at the same time the US Preventive Services Task Force recommends against spirometric screening for COPD in asymptomatic adults. Use of a symptom-based questionnaire and subsequent handheld spirometric device depending on the answers to the questionnaire is a promising approach to identify patients at risk for COPD. Screening, Evaluating and Assessing Rate CHanges of diagnosing respiratory conditions in primary care 1 (SEARCH I was a prospective cluster-randomized study in 168 US primary care practices evaluating the effect of the COPD-Population Screener (COPD-PS™ questionnaire. The effect of this questionnaire alone or sequentially with the handheld copd-6TM device was evaluated on new diagnoses of COPD and on respiratory diagnostic practice patterns (including referrals for pulmonary function testing, referrals to pulmonologists, new diagnoses of COPD, and new respiratory medication prescriptions. Participating practices entered a total of 9704 consecutive consenting subjects aged ≥ 40 years attending primary care clinics. Study arm results were compared for new COPD diagnosis rates between usual care and (1 COPD-PS plus copd-6 and (2 COPD-PS alone. A cluster-randomization design allowed comparison of the intervention effects at the practice level instead of individuals being the subjects of the intervention. Regional principal investigators controlled the flow of study information to sub-investigators at participating practices to reduce observation bias (Hawthorne effect. The
A simple heuristic for Internet-based evidence search in primary care: a randomized controlled trial
Directory of Open Access Journals (Sweden)
Eberbach A
2016-08-01
Full Text Available Andreas Eberbach,1 Annette Becker,1 Justine Rochon,2 Holger Finkemeler,1Achim Wagner,3 Norbert Donner-Banzhoff1 1Department of Family and Community Medicine, Philipp University of Marburg, Marburg, Germany; 2Institute of Medical Biometry and Informatics, University of Heidelberg, Heidelberg, Germany; 3Department of Sport Medicine, Justus-Liebig-University of Giessen, Giessen, Germany Background: General practitioners (GPs are confronted with a wide variety of clinical questions, many of which remain unanswered. Methods: In order to assist GPs in finding quick, evidence-based answers, we developed a learning program (LP with a short interactive workshop based on a simple three-step-heuristic to improve their search and appraisal competence (SAC. We evaluated the LP effectiveness with a randomized controlled trial (RCT. Participants (intervention group [IG] n=20; control group [CG] n=31 rated acceptance and satisfaction and also answered 39 knowledge questions to assess their SAC. We controlled for previous knowledge in content areas covered by the test. Results: Main outcome – SAC: within both groups, the pre–post test shows significant (P=0.00 improvements in correctness (IG 15% vs CG 11% and confidence (32% vs 26% to find evidence-based answers. However, the SAC difference was not significant in the RCT. Other measures: Most workshop participants rated “learning atmosphere” (90%, “skills acquired” (90%, and “relevancy to my practice” (86% as good or very good. The LP-recommendations were implemented by 67% of the IG, whereas 15% of the CG already conformed to LP recommendations spontaneously (odds ratio 9.6, P=0.00. After literature search, the IG showed a (not significantly higher satisfaction regarding “time spent” (IG 80% vs CG 65%, “quality of information” (65% vs 54%, and “amount of information” (53% vs 47%.Conclusion: Long-standing established GPs have a good SAC. Despite high acceptance, strong
15 CFR 50.5 - Fee structure for age search and citizenship information.
2010-01-01
... THE CENSUS § 50.5 Fee structure for age search and citizenship information. Type of service Fee... 15 Commerce and Foreign Trade 1 2010-01-01 2010-01-01 false Fee structure for age search and citizenship information. 50.5 Section 50.5 Commerce and Foreign Trade Regulations Relating to Commerce and...
Graphene materials having randomly distributed two-dimensional structural defects
Kung, Harold H; Zhao, Xin; Hayner, Cary M; Kung, Mayfair C
2013-10-08
Graphene-based storage materials for high-power battery applications are provided. The storage materials are composed of vertical stacks of graphene sheets and have reduced resistance for Li ion transport. This reduced resistance is achieved by incorporating a random distribution of structural defects into the stacked graphene sheets, whereby the structural defects facilitate the diffusion of Li ions into the interior of the storage materials.
Random fractal structures in North American energy markets
Energy Technology Data Exchange (ETDEWEB)
Serletis, Apostolos [Calgary Univ., Dept. of Economics, Calgary, AB (Canada); Andreadis, Ioannis [European Univ. of the Hague, Center of Management Studies, The Hague (Netherlands)
2004-05-01
This paper uses daily observations on West Texas Intermediate (WTI) crude oil prices at Chicago and Henry Hub natural gas prices at LA (over the deregulated period of the 1990s) and various tests from statistics and dynamical systems theory to support a random fractal structure for North American energy markets. In particular, this evidence is supported by the Vassilicos et al. (1993) multifractal structure test and the Ghashghaie et al. [Nature 381 (1996) 767] turbulent behavior test. (Author)
de Oliveira, Saulo H P; Law, Eleanor C; Shi, Jiye; Deane, Charlotte M
2018-04-01
Most current de novo structure prediction methods randomly sample protein conformations and thus require large amounts of computational resource. Here, we consider a sequential sampling strategy, building on ideas from recent experimental work which shows that many proteins fold cotranslationally. We have investigated whether a pseudo-greedy search approach, which begins sequentially from one of the termini, can improve the performance and accuracy of de novo protein structure prediction. We observed that our sequential approach converges when fewer than 20 000 decoys have been produced, fewer than commonly expected. Using our software, SAINT2, we also compared the run time and quality of models produced in a sequential fashion against a standard, non-sequential approach. Sequential prediction produces an individual decoy 1.5-2.5 times faster than non-sequential prediction. When considering the quality of the best model, sequential prediction led to a better model being produced for 31 out of 41 soluble protein validation cases and for 18 out of 24 transmembrane protein cases. Correct models (TM-Score > 0.5) were produced for 29 of these cases by the sequential mode and for only 22 by the non-sequential mode. Our comparison reveals that a sequential search strategy can be used to drastically reduce computational time of de novo protein structure prediction and improve accuracy. Data are available for download from: http://opig.stats.ox.ac.uk/resources. SAINT2 is available for download from: https://github.com/sauloho/SAINT2. saulo.deoliveira@dtc.ox.ac.uk. Supplementary data are available at Bioinformatics online.
Baumes, Laurent A
2006-01-01
One of the main problems in high-throughput research for materials is still the design of experiments. At early stages of discovery programs, purely exploratory methodologies coupled with fast screening tools should be employed. This should lead to opportunities to find unexpected catalytic results and identify the "groups" of catalyst outputs, providing well-defined boundaries for future optimizations. However, very few new papers deal with strategies that guide exploratory studies. Mostly, traditional designs, homogeneous covering, or simple random samplings are exploited. Typical catalytic output distributions exhibit unbalanced datasets for which an efficient learning is hardly carried out, and interesting but rare classes are usually unrecognized. Here is suggested a new iterative algorithm for the characterization of the search space structure, working independently of learning processes. It enhances recognition rates by transferring catalysts to be screened from "performance-stable" space zones to "unsteady" ones which necessitate more experiments to be well-modeled. The evaluation of new algorithm attempts through benchmarks is compulsory due to the lack of past proofs about their efficiency. The method is detailed and thoroughly tested with mathematical functions exhibiting different levels of complexity. The strategy is not only empirically evaluated, the effect or efficiency of sampling on future Machine Learning performances is also quantified. The minimum sample size required by the algorithm for being statistically discriminated from simple random sampling is investigated.
Structure of a randomly grown 2-d network
DEFF Research Database (Denmark)
Ajazi, Fioralba; Napolitano, George M.; Turova, Tatyana
2015-01-01
We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes in...... in time different phases of the structure. We conclude with a possible explanation of some empirical data on the connections between neurons.......We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes...
Probabilistic analysis of structures involving random stress-strain behavior
Millwater, H. R.; Thacker, B. H.; Harren, S. V.
1991-01-01
The present methodology for analysis of structures with random stress strain behavior characterizes the uniaxial stress-strain curve in terms of (1) elastic modulus, (2) engineering stress at initial yield, (3) initial plastic-hardening slope, (4) engineering stress at point of ultimate load, and (5) engineering strain at point of ultimate load. The methodology is incorporated into the Numerical Evaluation of Stochastic Structures Under Stress code for probabilistic structural analysis. The illustrative problem of a thick cylinder under internal pressure, where both the internal pressure and the stress-strain curve are random, is addressed by means of the code. The response value is the cumulative distribution function of the equivalent plastic strain at the inner radius.
Response of Launch Pad Structures to Random Acoustic Excitation
Directory of Open Access Journals (Sweden)
Ravi N. Margasahayam
1994-01-01
Full Text Available The design of launch pad structures, particularly those having a large area-to-mass ratio, is governed by launch-induced acoustics, a relatively short transient with random pressure amplitudes having a non-Gaussian distribution. The factors influencing the acoustic excitation and resulting structural responses are numerous and cannot be predicted precisely. Two solutions (probabilistic and deterministic for the random vibration problem are presented in this article from the standpoint of their applicability to predict the response of ground structures exposed to rocket noise. Deficiencies of the probabilistic method, especially to predict response in the low-frequency range of launch transients (below 20 Hz, prompted the development of the deterministic analysis. The relationship between the two solutions is clarified for future implementation in a finite element method (FEM code.
International Nuclear Information System (INIS)
Reynolds, A M
2009-01-01
The movement patterns of a diverse range of animals have scale-free characteristics. These characteristics provide necessary but not sufficient conditions for the presence of movement patterns that can be approximated by Levy walks. Nevertheless, it has been widely assumed that the occurrence of scale-free animal movements can indeed be attributed to the presence of Levy walks. This is, in part, because it is known that the super-diffusive properties of Levy walks can be advantageous in random search scenarios when searchers have little or no prior knowledge of target locations. However, fractional Brownian motions (fBms) and fractional Levy motions (fLms) are both scale-free and super-diffusive, and so it is possible that these motions rather than Levy walks underlie some or all occurrences of scale-free animal movement patterns. Here this possibility is examined in numerical simulations through a determination of the searching efficiencies of fBm and fLm searches. It is shown that these searches are less efficient than Levy walk searches. This finding does not rule out the possibility that some animals with scale-free movement patterns are executing fBm and fLm searches, but it does make Levy walk searches the more likely possibility.
Wang, Lusheng; Yang, Yong; Lin, Guohui
Finding the closest object for a query in a database is a classical problem in computer science. For some modern biological applications, computing the similarity between two objects might be very time consuming. For example, it takes a long time to compute the edit distance between two whole chromosomes and the alignment cost of two 3D protein structures. In this paper, we study the nearest neighbor search problem in metric space, where the pair-wise distance between two objects in the database is known and we want to minimize the number of distances computed on-line between the query and objects in the database in order to find the closest object. We have designed two randomized approaches for indexing metric space databases, where objects are purely described by their distances with each other. Analysis and experiments show that our approaches only need to compute O(logn) objects in order to find the closest object, where n is the total number of objects in the database.
POROSIMETRY BY RANDOM NODE STRUCTURING IN VIRTUAL CONCRETE
Directory of Open Access Journals (Sweden)
Piet Stroeven
2012-05-01
Full Text Available Two different porosimetry methods are presented in two successive papers. Inspiration for the development came from the rapidly-exploring random tree (RRT approach used in robotics. The novel methods are applied to virtual cementitious materials produced by a modern concurrent algorithm-based discrete element modeling system, HADES. This would render possible realistically simulating all aspects of particulate matter that influence structure-sensitive features of the pore network structure in maturing concrete, namely size, shape and dispersion of the aggregate and cement particles. Pore space is a complex tortuous entity. Practical methods conventionally applied for assessment of pore size distribution may fail or present biased information. Among them, mercury intrusion porosimetry and 2D quantitative image analysis are popular. The mathematical morphology operator “opening” can be applied to sections and even provide 3D information on pore size distribution, provided isotropy is guaranteed. However, aggregate grain surfaces lead to anisotropy in porosity. The presented methods allow exploration of pore space in the virtual material, after which pore size distribution is derived from star volume measurements. In addition to size of pores their continuity is of crucial importance for durability estimation. Double-random multiple tree structuring (DRaMuTS, introduced earlier in IA&S (Stroeven et al., 2011b and random node structuring (RaNoS provide such information.
Tuned mass absorbers on damped structures under random load
DEFF Research Database (Denmark)
Krenk, Steen; Høgsberg, Jan Becker
2008-01-01
the mass ratio alone, and the damping can be determined subsequently. Only approximate results are available for the influence of damping in the original structure, typically in the form of series expansions. In the present paper it is demonstrated that for typical mass ratios in the order of a few percent......A substantial literature exists on the optimal choice of parameters of a tuned mass absorber on a structure excited by a force or by ground acceleration with random characteristics in the form of white noise. In the absence of structural damping the optimal frequency tuning is determined from...... for the response variance of a structure with initial damping in terms of the mass ratio and both damping ratios. Within this format the optimal tuning of the absorber turns out to be independent of the structural damping, and a simple explicit expression is obtained for the equivalent total damping....
Random matrix theory in nuclear structure: past, present and future
International Nuclear Information System (INIS)
Kota, V.K.B.
2012-01-01
Random matrix theory (RMT) introduced by Wigner in 50's to describe statistical properties of slow-neutron resonances in heavy nuclei such as 232 Th, was developed further in the 60's by Dyson, Mehta, Porter and others and in the 70's by French, Pandey, Bohigas and others. Going beyond this, the demonstration that level fluctuations of quantum analogues of classically chaotic few-degrees-of-freedom systems follow random matrix theory (integrable systems follow Poisson as shown by Berry) in 1984 by Bohigas and others on one hand and the recognition from 1995 onwards that two-body random matrix ensembles derived from shell model have wide ranging applications on the other, defined new directions in RMT applications in nuclear physics. Growth points in RMT in nuclear physics are: (i) analysis of nuclear data looking for order-chaos transitions and symmetry (Time-reversal, Parity, Isospin) breaking; (ii) analysis of shell model driven embedded (or two-body) random matrix ensembles giving statistical properties generated by random interactions in the presence of a mean-field; (iii) statistical nuclear spectroscopy generated by embedded ensembles for level densities, occupancies, GT strengths, transition strength sums and so on; (iv) the new paradigm of regular structures generated by random interactions as brought out by studies using various nuclear models; (v) random matrix theory for nuclear reactions with particular reference to open quantum systems; (vi) RMT results from nuclear physics to atomic physics, mesoscopic physics and quantum information science. Topics (i)-(vi) emphasizing recent results are discussed. (author)
Exploring biological network structure with clustered random networks
Directory of Open Access Journals (Sweden)
Bansal Shweta
2009-12-01
Full Text Available Abstract Background Complex biological systems are often modeled as networks of interacting units. Networks of biochemical interactions among proteins, epidemiological contacts among hosts, and trophic interactions in ecosystems, to name a few, have provided useful insights into the dynamical processes that shape and traverse these systems. The degrees of nodes (numbers of interactions and the extent of clustering (the tendency for a set of three nodes to be interconnected are two of many well-studied network properties that can fundamentally shape a system. Disentangling the interdependent effects of the various network properties, however, can be difficult. Simple network models can help us quantify the structure of empirical networked systems and understand the impact of various topological properties on dynamics. Results Here we develop and implement a new Markov chain simulation algorithm to generate simple, connected random graphs that have a specified degree sequence and level of clustering, but are random in all other respects. The implementation of the algorithm (ClustRNet: Clustered Random Networks provides the generation of random graphs optimized according to a local or global, and relative or absolute measure of clustering. We compare our algorithm to other similar methods and show that ours more successfully produces desired network characteristics. Finding appropriate null models is crucial in bioinformatics research, and is often difficult, particularly for biological networks. As we demonstrate, the networks generated by ClustRNet can serve as random controls when investigating the impacts of complex network features beyond the byproduct of degree and clustering in empirical networks. Conclusion ClustRNet generates ensembles of graphs of specified edge structure and clustering. These graphs allow for systematic study of the impacts of connectivity and redundancies on network function and dynamics. This process is a key step in
Kim, Sarang; Noveck, Helaine; Galt, James; Hogshire, Lauren; Willett, Laura; O'Rourke, Kerry
2014-06-01
To compare the speed and accuracy of answering clinical questions using Google versus summary resources. In 2011 and 2012, 48 internal medicine interns from two classes at Rutgers University Robert Wood Johnson Medical School, who had been trained to use three evidence-based summary resources, performed four-minute computer searches to answer 10 clinical questions. Half were randomized to initiate searches for answers to questions 1 to 5 using Google; the other half initiated searches using a summary resource. They then crossed over and used the other resource for questions 6 to 10. They documented the time spent searching and the resource where the answer was found. Time to correct response and percentage of correct responses were compared between groups using t test and general estimating equations. Of 480 questions administered, interns found answers for 393 (82%). Interns initiating searches in Google used a wider variety of resources than those starting with summary resources. No significant difference was found in mean time to correct response (138.5 seconds for Google versus 136.1 seconds for summary resource; P = .72). Mean correct response rate was 58.4% for Google versus 61.5% for summary resource (mean difference -3.1%; 95% CI -10.3% to 4.2%; P = .40). The authors found no significant differences in speed or accuracy between searches initiated using Google versus summary resources. Although summary resources are considered to provide the highest quality of evidence, improvements to allow for better speed and accuracy are needed.
Time-variant random interval natural frequency analysis of structures
Wu, Binhua; Wu, Di; Gao, Wei; Song, Chongmin
2018-02-01
This paper presents a new robust method namely, unified interval Chebyshev-based random perturbation method, to tackle hybrid random interval structural natural frequency problem. In the proposed approach, random perturbation method is implemented to furnish the statistical features (i.e., mean and standard deviation) and Chebyshev surrogate model strategy is incorporated to formulate the statistical information of natural frequency with regards to the interval inputs. The comprehensive analysis framework combines the superiority of both methods in a way that computational cost is dramatically reduced. This presented method is thus capable of investigating the day-to-day based time-variant natural frequency of structures accurately and efficiently under concrete intrinsic creep effect with probabilistic and interval uncertain variables. The extreme bounds of the mean and standard deviation of natural frequency are captured through the embedded optimization strategy within the analysis procedure. Three particularly motivated numerical examples with progressive relationship in perspective of both structure type and uncertainty variables are demonstrated to justify the computational applicability, accuracy and efficiency of the proposed method.
Moisture diffusivity in structure of random fractal fiber bed
Energy Technology Data Exchange (ETDEWEB)
Zhu, Fanglong, E-mail: zhufanglong_168@163.com [College of Textile, Zhongyuan University of Technology, Zhengzhou City (China); The Chinese People' s Armed Police Forces Academy, Langfan City (China); Zhou, Yu; Feng, Qianqian [College of Textile, Zhongyuan University of Technology, Zhengzhou City (China); Xia, Dehong [School of Mechanical Engineering, University of Science and Technology, Beijing (China)
2013-11-08
A theoretical expression related to effective moisture diffusivity to random fiber bed is derived by using fractal theory and considering both parallel and perpendicular channels to diffusion flow direction. In this Letter, macroporous structure of hydrophobic nonwoven material is investigated, and Knudsen diffusion and surface diffusion are neglected. The effective moisture diffusivity predicted by the present fractal model are compared with water vapor transfer rate (WVTR) experiment data and calculated values obtained from other theoretical models. This verifies the validity of the present fractal diffusivity of fibrous structural beds.
The Fatigue Behavior of Steel Structures under Random Loading
DEFF Research Database (Denmark)
Agerskov, Henning
2008-01-01
Fatigue damage accumulation in steel structures under random loading has been studied in a number of investigations at the Technical University of Denmark. The fatigue life of welded joints has been determined both experimentally and from a fracture mechanics analysis. In the experimental part...... and variable amplitude fatigue test results. Both the fracture mechanics analysis and the fatigue test results indicate that Miner’s rule, which is normally used in the design against fatigue in steel structures, may give results, which are unconservative, and that the validity of the results obtained from...
The Fatigue Behavior of Steel Structures under Random Loading
DEFF Research Database (Denmark)
Agerskov, Henning
2009-01-01
of the investigation, fatigue test series with a total of 540 fatigue tests have been carried through on various types of welded plate test specimens and full-scale offshore tubular joints. The materials that have been used are either conventional structural steel or high-strength steel. The fatigue tests......Fatigue damage accumulation in steel structures under random loading has been studied in a number of investigations at the Technical University of Denmark. The fatigue life of welded joints has been determined both experimentally and from a fracture mechanics analysis. In the experimental part...... and the fracture mechanics analyses have been carried out using load histories, which are realistic in relation to the types of structures studied, i.e. primarily bridges, offshore structures and chimneys. In general, the test series carried through show a significant difference between constant amplitude...
COBE's search for structure in the Big Bang
Soffen, Gerald (Editor); Guerny, Gene (Editor); Keating, Thomas (Editor); Moe, Karen (Editor); Sullivan, Walter (Editor); Truszkowski, Walt (Editor)
1989-01-01
The launch of Cosmic Background Explorer (COBE) and the definition of Earth Observing System (EOS) are two of the major events at NASA-Goddard. The three experiments contained in COBE (Differential Microwave Radiometer (DMR), Far Infrared Absolute Spectrophotometer (FIRAS), and Diffuse Infrared Background Experiment (DIRBE)) are very important in measuring the big bang. DMR measures the isotropy of the cosmic background (direction of the radiation). FIRAS looks at the spectrum over the whole sky, searching for deviations, and DIRBE operates in the infrared part of the spectrum gathering evidence of the earliest galaxy formation. By special techniques, the radiation coming from the solar system will be distinguished from that of extragalactic origin. Unique graphics will be used to represent the temperature of the emitting material. A cosmic event will be modeled of such importance that it will affect cosmological theory for generations to come. EOS will monitor changes in the Earth's geophysics during a whole solar color cycle.
Protein structure determination by exhaustive search of Protein Data Bank derived databases.
Stokes-Rees, Ian; Sliz, Piotr
2010-12-14
Parallel sequence and structure alignment tools have become ubiquitous and invaluable at all levels in the study of biological systems. We demonstrate the application and utility of this same parallel search paradigm to the process of protein structure determination, benefitting from the large and growing corpus of known structures. Such searches were previously computationally intractable. Through the method of Wide Search Molecular Replacement, developed here, they can be completed in a few hours with the aide of national-scale federated cyberinfrastructure. By dramatically expanding the range of models considered for structure determination, we show that small (less than 12% structural coverage) and low sequence identity (less than 20% identity) template structures can be identified through multidimensional template scoring metrics and used for structure determination. Many new macromolecular complexes can benefit significantly from such a technique due to the lack of known homologous protein folds or sequences. We demonstrate the effectiveness of the method by determining the structure of a full-length p97 homologue from Trichoplusia ni. Example cases with the MHC/T-cell receptor complex and the EmoB protein provide systematic estimates of minimum sequence identity, structure coverage, and structural similarity required for this method to succeed. We describe how this structure-search approach and other novel computationally intensive workflows are made tractable through integration with the US national computational cyberinfrastructure, allowing, for example, rapid processing of the entire Structural Classification of Proteins protein fragment database.
In Search of a Peace Operations Force Structure
National Research Council Canada - National Science Library
Kelley, David
2001-01-01
...) strategy, and is unlikely to increase overall force structure in the near-term. Of the seven alternatives presented in the paper, three represent options that could be pursued exclusively within the Department of Defense (DOD...
Structure-Based Search for New Inhibitors of Cholinesterases
Directory of Open Access Journals (Sweden)
Barbara Malawska
2013-03-01
Full Text Available Cholinesterases are important biological targets responsible for regulation of cholinergic transmission, and their inhibitors are used for the treatment of Alzheimer’s disease. To design new cholinesterase inhibitors, of different structure-based design strategies was followed, including the modification of compounds from a previously developed library and a fragment-based design approach. This led to the selection of heterodimeric structures as potential inhibitors. Synthesis and biological evaluation of selected candidates confirmed that the designed compounds were acetylcholinesterase inhibitors with IC50 values in the mid-nanomolar to low micromolar range, and some of them were also butyrylcholinesterase inhibitors.
Search for coherent structure within tokamak plasma turbulence
International Nuclear Information System (INIS)
Zweben, S.J.
1985-01-01
Two-dimensional tokamak edge density turbulence data are examined for possible coherent or organized structure. The spatial patterns of density fluctuations n appear to consist of localized ''blobs'' of relatively high or low density which can move irregularly both radially and poloidally through the edge region. However, a statistical analysis of the lifetime, area, direction, speed, and amplitude of these blobs does not as yet suggest any organized structure associated with the blobs beyond that which can be described by time-averaged correlation functions
In search of new structural states of exchangeable apolipoproteins
International Nuclear Information System (INIS)
Xicohtencatl-Cortes, J.; Castillo, R.; Mas-Oliva, J.
2004-01-01
Based upon state of the art biophysical experimentation, this article focuses on the different structural arrangements exchangeable apolipoproteins achieve when placed on Langmuir monolayers and subjected to changes in lateral pressure. We have studied the monolayers of apolipoproteins CI, CIII, AI, AII, and E that show as secondary structure a high percentage of amphipathic α-helix. This has been achieved employing techniques such as Brewster angle microscopy, synchrotron X-ray diffraction, and surface pressure measurements. In addition, the lateral order of protein arrays has been also studied by atomic force microscopy. These monolayers show that a phase transition from a two-dimensional disorder fluid to an ordered state is detected at relatively high lateral pressure, where unusual one-dimensional solid phases are discovered. While several helices that conform the apolipoprotein are confined to the interface, others are uniformly tilted toward the hydrophobic air or the phospholipid fatty acid chains. Our results suggest that a similar ordering might also occur when these apolipoproteins are attached to a lipoprotein particle such as a high density lipoprotein (HDL) particle. Therefore, changes from a nascent or discoidal HDL to a mature spherical HDL might in parallel involve structural changes as those described in our Langmuir interfaces. Current experimentation is being carried out in order to elucidate if the structural states already found are related to the efficiency of lipid transfer between lipoprotein particles or lipoproteins and the plasma membrane of cells, as well as receptor ligand recognition
Large Neighborhood Search and Adaptive Randomized Decompositions for Flexible Jobshop Scheduling
DEFF Research Database (Denmark)
Pacino, Dario; Van Hentenryck, Pascal
2011-01-01
This paper considers a constraint-based scheduling approach to the flexible jobshop, a generalization of the traditional jobshop scheduling where activities have a choice of machines. It studies both large neighborhood (LNS) and adaptive randomized de- composition (ARD) schemes, using random...
Structure and Sequence Search on Aptamer-Protein Docking
Xiao, Jiajie; Bonin, Keith; Guthold, Martin; Salsbury, Freddie
2015-03-01
Interactions between proteins and deoxyribonucleic acid (DNA) play a significant role in the living systems, especially through gene regulation. However, short nucleic acids sequences (aptamers) with specific binding affinity to specific proteins exhibit clinical potential as therapeutics. Our capillary and gel electrophoresis selection experiments show that specific sequences of aptamers can be selected that bind specific proteins. Computationally, given the experimentally-determined structure and sequence of a thrombin-binding aptamer, we can successfully dock the aptamer onto thrombin in agreement with experimental structures of the complex. In order to further study the conformational flexibility of this thrombin-binding aptamer and to potentially develop a predictive computational model of aptamer-binding, we use GPU-enabled molecular dynamics simulations to both examine the conformational flexibility of the aptamer in the absence of binding to thrombin, and to determine our ability to fold an aptamer. This study should help further de-novo predictions of aptamer sequences by enabling the study of structural and sequence-dependent effects on aptamer-protein docking specificity.
The experimental search for new predicted binary-alloy structures
Erb, K. C.; Richey, Lauren; Lang, Candace; Campbell, Branton; Hart, Gus
2010-10-01
Predicting new ordered phases in metallic alloys is a productive line of inquiry because configurational ordering in an alloy can dramatically alter their useful material properties. One is able to infer the existence of an ordered phase in an alloy using first-principles calculated formation enthalpies.ootnotetextG. L. W. Hart, ``Where are Nature's missing structures?,'' Nature Materials 6 941-945 2007 Using this approach, we have been able to identify stable (i.e. lowest energy) orderings in a variety of binary metallic alloys. Many of these phases have been observed experimentally in the past, though others have not. In pursuit of several of the missing structures, we have characterized potential orderings in PtCd, PtPd and PtMo alloys using synchrotron x-ray powder diffraction and symmetry-analysis tools.ootnotetextB. J. Campbell, H. T. Stokes, D. E. Tanner, and D. M. Hatch, ``ISODISPLACE: a web-based tool for exploring structural distortions,'' J. Appl. Cryst. 39, 607-614 (2006)
Searching for realism, structure and agency in Actor Network Theory.
Elder-Vass, Dave
2008-09-01
Superficially, Actor Network Theory (ANT) and critical realism (CR) are radically opposed research traditions. Written from a realist perspective, this paper asks whether there might be a basis for finding common ground between these two traditions. It looks in turn at the questions of realism, structure, and agency, analysing the differences between the two perspectives and seeking to identify what each might learn from the other. Overall, the paper argues that there is a great deal that realists can learn from actor network theory; yet ANT remains stunted by its lack of a depth ontology. It fails to recognize the significance of mechanisms, and of their dependence on emergence, and thus lacks both dimensions of the depth that is characteristic of critical realism's ontology. This prevents ANT from recognizing the role and powers of social structure; but on the other hand, realists would do well to heed ANT's call for us to trace the connections through which structures are constantly made and remade. A lack of ontological depth also underpins ANT's practice of treating human and non-human actors symmetrically, yet this remains a valuable provocation to sociologists who neglect non-human entities entirely.
Exponential random graph models for networks with community structure.
Fronczak, Piotr; Fronczak, Agata; Bujok, Maksymilian
2013-09-01
Although the community structure organization is an important characteristic of real-world networks, most of the traditional network models fail to reproduce the feature. Therefore, the models are useless as benchmark graphs for testing community detection algorithms. They are also inadequate to predict various properties of real networks. With this paper we intend to fill the gap. We develop an exponential random graph approach to networks with community structure. To this end we mainly built upon the idea of blockmodels. We consider both the classical blockmodel and its degree-corrected counterpart and study many of their properties analytically. We show that in the degree-corrected blockmodel, node degrees display an interesting scaling property, which is reminiscent of what is observed in real-world fractal networks. A short description of Monte Carlo simulations of the models is also given in the hope of being useful to others working in the field.
A real-time all-atom structural search engine for proteins.
Gonzalez, Gabriel; Hannigan, Brett; DeGrado, William F
2014-07-01
Protein designers use a wide variety of software tools for de novo design, yet their repertoire still lacks a fast and interactive all-atom search engine. To solve this, we have built the Suns program: a real-time, atomic search engine integrated into the PyMOL molecular visualization system. Users build atomic-level structural search queries within PyMOL and receive a stream of search results aligned to their query within a few seconds. This instant feedback cycle enables a new "designability"-inspired approach to protein design where the designer searches for and interactively incorporates native-like fragments from proven protein structures. We demonstrate the use of Suns to interactively build protein motifs, tertiary interactions, and to identify scaffolds compatible with hot-spot residues. The official web site and installer are located at http://www.degradolab.org/suns/ and the source code is hosted at https://github.com/godotgildor/Suns (PyMOL plugin, BSD license), https://github.com/Gabriel439/suns-cmd (command line client, BSD license), and https://github.com/Gabriel439/suns-search (search engine server, GPLv2 license).
Directory of Open Access Journals (Sweden)
Steven N Hart
Full Text Available BACKGROUND: Structural variation (SV represents a significant, yet poorly understood contribution to an individual's genetic makeup. Advanced next-generation sequencing technologies are widely used to discover such variations, but there is no single detection tool that is considered a community standard. In an attempt to fulfil this need, we developed an algorithm, SoftSearch, for discovering structural variant breakpoints in Illumina paired-end next-generation sequencing data. SoftSearch combines multiple strategies for detecting SV including split-read, discordant read-pair, and unmated pairs. Co-localized split-reads and discordant read pairs are used to refine the breakpoints. RESULTS: We developed and validated SoftSearch using real and synthetic datasets. SoftSearch's key features are 1 not requiring secondary (or exhaustive primary alignment, 2 portability into established sequencing workflows, and 3 is applicable to any DNA-sequencing experiment (e.g. whole genome, exome, custom capture, etc.. SoftSearch identifies breakpoints from a small number of soft-clipped bases from split reads and a few discordant read-pairs which on their own would not be sufficient to make an SV call. CONCLUSIONS: We show that SoftSearch can identify more true SVs by combining multiple sequence features. SoftSearch was able to call clinically relevant SVs in the BRCA2 gene not reported by other tools while offering significantly improved overall performance.
D Nearest Neighbour Search Using a Clustered Hierarchical Tree Structure
Suhaibah, A.; Uznir, U.; Anton, F.; Mioc, D.; Rahman, A. A.
2016-06-01
Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D) method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN) analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.
Hu, Qian-Nan; Deng, Zhe; Hu, Huanan; Cao, Dong-Sheng; Liang, Yi-Zeng
2011-09-01
Biochemical reactions play a key role to help sustain life and allow cells to grow. RxnFinder was developed to search biochemical reactions from KEGG reaction database using three search criteria: molecular structures, molecular fragments and reaction similarity. RxnFinder is helpful to get reference reactions for biosynthesis and xenobiotics metabolism. RxnFinder is freely available via: http://sdd.whu.edu.cn/rxnfinder. qnhu@whu.edu.cn.
Directory of Open Access Journals (Sweden)
ALTINOZ, O. T.
2014-08-01
Full Text Available Nature-inspired optimization algorithms can obtain the optima by updating the position of each member in the population. At the beginning of the algorithm, the particles of the population are spread into the search space. The initial distribution of particles corresponds to the beginning points of the search process. Hence, the aim is to alter the position for each particle beginning with this initial position until the optimum solution will be found with respect to the pre-determined conditions like maximum iteration, and specific error value for the fitness function. Therefore, initial positions of the population have a direct effect on both accuracy of the optima and the computational cost. If any member in the population is close enough to the optima, this eases the achievement of the exact solution. On the contrary, individuals grouped far away from the optima might yield pointless efforts. In this study, low-discrepancy quasi-random number sequence is preferred for the localization of the population at the initialization phase. By this way, the population is distributed into the search space in a more uniform manner at the initialization phase. The technique is applied to the Gravitational Search Algorithm and compared via the performance on benchmark function solutions.
HDAPD: a web tool for searching the disease-associated protein structures
2010-01-01
Background The protein structures of the disease-associated proteins are important for proceeding with the structure-based drug design to against a particular disease. Up until now, proteins structures are usually searched through a PDB id or some sequence information. However, in the HDAPD database presented here the protein structure of a disease-associated protein can be directly searched through the associated disease name keyed in. Description The search in HDAPD can be easily initiated by keying some key words of a disease, protein name, protein type, or PDB id. The protein sequence can be presented in FASTA format and directly copied for a BLAST search. HDAPD is also interfaced with Jmol so that users can observe and operate a protein structure with Jmol. The gene ontological data such as cellular components, molecular functions, and biological processes are provided once a hyperlink to Gene Ontology (GO) is clicked. Further, HDAPD provides a link to the KEGG map such that where the protein is placed and its relationship with other proteins in a metabolic pathway can be found from the map. The latest literatures namely titles, journals, authors, and abstracts searched from PubMed for the protein are also presented as a length controllable list. Conclusions Since the HDAPD data content can be routinely updated through a PHP-MySQL web page built, the new database presented is useful for searching the structures for some disease-associated proteins that may play important roles in the disease developing process for performing the structure-based drug design to against the diseases. PMID:20158919
Tree decomposition based fast search of RNA structures including pseudoknots in genomes.
Song, Yinglei; Liu, Chunmei; Malmberg, Russell; Pan, Fangfang; Cai, Liming
2005-01-01
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of efficient algorithms for accurate RNA structure-sequence alignment, computer programs capable of fast and effectively searching genomes for RNA secondary structures have not been available. In this paper, a novel RNA structure profiling model is introduced based on the notion of a conformational graph to specify the consensus structure of an RNA family. Tree decomposition yields a small tree width t for such conformation graphs (e.g., t = 2 for stem loops and only a slight increase for pseudo-knots). Within this modelling framework, the optimal alignment of a sequence to the structure model corresponds to finding a maximum valued isomorphic subgraph and consequently can be accomplished through dynamic programming on the tree decomposition of the conformational graph in time O(k(t)N(2)), where k is a small parameter; and N is the size of the projiled RNA structure. Experiments show that the application of the alignment algorithm to search in genomes yields the same search accuracy as methods based on a Covariance model with a significant reduction in computation time. In particular; very accurate searches of tmRNAs in bacteria genomes and of telomerase RNAs in yeast genomes can be accomplished in days, as opposed to months required by other methods. The tree decomposition based searching tool is free upon request and can be downloaded at our site h t t p ://w.uga.edu/RNA-informatics/software/index.php.
Kiener, Joos
2013-12-11
Research in organic chemistry generates samples of novel chemicals together with their properties and other related data. The involved scientists must be able to store this data and search it by chemical structure. There are commercial solutions for common needs like chemical registration systems or electronic lab notebooks. However for specific requirements of in-house databases and processes no such solutions exist. Another issue is that commercial solutions have the risk of vendor lock-in and may require an expensive license of a proprietary relational database management system. To speed up and simplify the development for applications that require chemical structure search capabilities, I have developed Molecule Database Framework. The framework abstracts the storing and searching of chemical structures into method calls. Therefore software developers do not require extensive knowledge about chemistry and the underlying database cartridge. This decreases application development time. Molecule Database Framework is written in Java and I created it by integrating existing free and open-source tools and frameworks. The core functionality includes:•Support for multi-component compounds (mixtures)•Import and export of SD-files•Optional security (authorization)For chemical structure searching Molecule Database Framework leverages the capabilities of the Bingo Cartridge for PostgreSQL and provides type-safe searching, caching, transactions and optional method level security. Molecule Database Framework supports multi-component chemical compounds (mixtures).Furthermore the design of entity classes and the reasoning behind it are explained. By means of a simple web application I describe how the framework could be used. I then benchmarked this example application to create some basic performance expectations for chemical structure searches and import and export of SD-files. By using a simple web application it was shown that Molecule Database Framework
Energy Technology Data Exchange (ETDEWEB)
Conte, Viviane Cristhyne Bini; Arruda, Lucia Valeria Ramos de; Yamamoto, Lia [Universidade Tecnologica Federal do Parana (UTFPR), Curitiba, PR (Brazil)
2008-07-01
Planning and scheduling of the pipeline network operations aim the most efficient use of the resources resulting in a better performance of the network. A petroleum distribution pipeline network is composed by refineries, sources and/or storage parks, connected by a set of pipelines, which operate the transportation of petroleum and derivatives among adjacent areas. In real scenes, this problem is considered a combinatorial problem, which has difficult solution, which makes necessary methodologies of the resolution that present low computational time. This work aims to get solutions that attempt the demands and minimize the number of batch fragmentations on the sent operations of products for the pipelines in a simplified model of a real network, through by application of the local search metaheuristic GRASP. GRASP does not depend of solutions of previous iterations and works in a random way so it allows the search for the solution in an ampler and diversified search space. GRASP utilization does not demand complex calculation, even the construction stage that requires more computational effort, which provides relative rapidity in the attainment of good solutions. GRASP application on the scheduling of the operations of this network presented feasible solutions in a low computational time. (author)
In Search of Meaning: Are School Rampage Shootings Random and Senseless Violence?
Madfis, Eric
2017-01-02
This article discusses Joel Best's ( 1999 ) notion of random violence and applies his concepts of pointlessness, patternlessness, and deterioration to the reality about multiple-victim school shootings gleaned from empirical research about the phenomenon. Best describes how violence is rarely random, as scholarship reveals myriad observable patterns, lots of discernable motives and causes, and often far too much fear-mongering over how bad society is getting and how violent we are becoming. In contrast, it is vital that the media, scholars, and the public better understand crime patterns, criminal motivations, and the causes of fluctuating crime rates. As an effort toward such progress, this article reviews the academic literature on school rampage shootings and explores the extent to which these attacks are and are not random acts of violence.
Conditional Random Fields for Pattern Recognition Applied to Structured Data
Directory of Open Access Journals (Sweden)
Tom Burr
2015-07-01
Full Text Available Pattern recognition uses measurements from an input domain, X, to predict their labels from an output domain, Y. Image analysis is one setting where one might want to infer whether a pixel patch contains an object that is “manmade” (such as a building or “natural” (such as a tree. Suppose the label for a pixel patch is “manmade”; if the label for a nearby pixel patch is then more likely to be “manmade” there is structure in the output domain that can be exploited to improve pattern recognition performance. Modeling P(X is difficult because features between parts of the model are often correlated. Therefore, conditional random fields (CRFs model structured data using the conditional distribution P(Y|X = x, without specifying a model for P(X, and are well suited for applications with dependent features. This paper has two parts. First, we overview CRFs and their application to pattern recognition in structured problems. Our primary examples are image analysis applications in which there is dependence among samples (pixel patches in the output domain. Second, we identify research topics and present numerical examples.
Search on a hypercubic lattice using a quantum random walk. II. d=2
International Nuclear Information System (INIS)
Patel, Apoorva; Raghunathan, K. S.; Rahaman, Md. Aminoor
2010-01-01
We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretized according to the staggered lattice fermion formalism. d=2 is the critical dimension for the spatial search problem, where infrared divergence of the evolution operator leads to logarithmic factors in the scaling behavior. As a result, the construction used in our accompanying article [A. Patel and M. A. Rahaman, Phys. Rev. A 82, 032330 (2010)] provides an O(√(N)lnN) algorithm, which is not optimal. The scaling behavior can be improved to O(√(NlnN)) by cleverly controlling the massless Dirac evolution operator by an ancilla qubit, as proposed by Tulsi [Phys. Rev. A 78, 012310 (2008)]. We reinterpret the ancilla control as introduction of an effective mass at the marked vertex, and optimize the proportionality constants of the scaling behavior of the algorithm by numerically tuning the parameters.
Searching for control: priming randomness increases the evaluation of ritual efficacy.
Legare, Cristine H; Souza, André L
2014-01-01
Reestablishing feelings of control after experiencing uncertainty has long been considered a fundamental motive for human behavior. We propose that rituals (i.e., socially stipulated, causally opaque practices) provide a means for coping with the aversive feelings associated with randomness due to the perception of a connection between ritual action and a desired outcome. Two experiments were conducted (one in Brazil [n = 40] and another in the United States [n = 94]) to evaluate how the perceived efficacy of rituals is affected by feelings of randomness. In a between-subjects design, the Scramble Sentence Task was used as a priming procedure in three conditions (i.e., randomness, negativity, and neutral) and participants were then asked to rate the efficacy of rituals used for problem-solving purposes. The results demonstrate that priming randomness increased participants' perception of ritual efficacy relative to negativity and neutral conditions. Implications for increasing our understanding of the relationship between perceived control and ritualistic behavior are discussed. Copyright © 2013 Cognitive Science Society, Inc.
Frenken, K.
2001-01-01
The biological evolution of complex organisms, in which the functioning of genes is interdependent, has been analyzed as "hill-climbing" on NK fitness landscapes through random mutation and natural selection. In evolutionary economics, NK fitness landscapes have been used to simulate the evolution
Booth, Andrew
2016-05-04
Qualitative systematic reviews or qualitative evidence syntheses (QES) are increasingly recognised as a way to enhance the value of systematic reviews (SRs) of clinical trials. They can explain the mechanisms by which interventions, evaluated within trials, might achieve their effect. They can investigate differences in effects between different population groups. They can identify which outcomes are most important to patients, carers, health professionals and other stakeholders. QES can explore the impact of acceptance, feasibility, meaningfulness and implementation-related factors within a real world setting and thus contribute to the design and further refinement of future interventions. To produce valid, reliable and meaningful QES requires systematic identification of relevant qualitative evidence. Although the methodologies of QES, including methods for information retrieval, are well-documented, little empirical evidence exists to inform their conduct and reporting. This structured methodological overview examines papers on searching for qualitative research identified from the Cochrane Qualitative and Implementation Methods Group Methodology Register and from citation searches of 15 key papers. A single reviewer reviewed 1299 references. Papers reporting methodological guidance, use of innovative methodologies or empirical studies of retrieval methods were categorised under eight topical headings: overviews and methodological guidance, sampling, sources, structured questions, search procedures, search strategies and filters, supplementary strategies and standards. This structured overview presents a contemporaneous view of information retrieval for qualitative research and identifies a future research agenda. This review concludes that poor empirical evidence underpins current information practice in information retrieval of qualitative research. A trend towards improved transparency of search methods and further evaluation of key search procedures offers
M.J. Huiskes (Mark)
2004-01-01
textabstractIn this paper we focus on a number of issues regarding special structure in the relevance feedback learning problem, most notably the effects of image selection based on partial relevance on the clustering behavior of examples. We propose a simple scheme, aspect-based image search, which
Méndez, Vicenç; Bartumeus, Frederic
2014-01-01
This book presents the fundamental theory for non-standard diffusion problems in movement ecology. Lévy processes and anomalous diffusion have shown to be both powerful and useful tools for qualitatively and quantitatively describing a wide variety of spatial population ecological phenomena and dynamics, such as invasion fronts and search strategies. Adopting a self-contained, textbook-style approach, the authors provide the elements of statistical physics and stochastic processes on which the modeling of movement ecology is based and systematically introduce the physical characterization of ecological processes at the microscopic, mesoscopic and macroscopic levels. The explicit definition of these levels and their interrelations is particularly suitable to coping with the broad spectrum of space and time scales involved in bio-ecological problems. Including numerous exercises (with solutions), this text is aimed at graduate students and newcomers in this field at the interface of theoretical ecology, mat...
Garcia-Santiago, C. A.; Del Ser, J.; Upton, C.; Quilligan, F.; Gil-Lopez, S.; Salcedo-Sanz, S.
2015-11-01
When seeking near-optimal solutions for complex scheduling problems, meta-heuristics demonstrate good performance with affordable computational effort. This has resulted in a gravitation towards these approaches when researching industrial use-cases such as energy-efficient production planning. However, much of the previous research makes assumptions about softer constraints that affect planning strategies and about how human planners interact with the algorithm in a live production environment. This article describes a job-shop problem that focuses on minimizing energy consumption across a production facility of shared resources. The application scenario is based on real facilities made available by the Irish Center for Manufacturing Research. The formulated problem is tackled via harmony search heuristics with random keys encoding. Simulation results are compared to a genetic algorithm, a simulated annealing approach and a first-come-first-served scheduling. The superior performance obtained by the proposed scheduler paves the way towards its practical implementation over industrial production chains.
Chira, Camelia; Horvath, Dragos; Dumitrescu, D
2011-07-30
Proteins are complex structures made of amino acids having a fundamental role in the correct functioning of living cells. The structure of a protein is the result of the protein folding process. However, the general principles that govern the folding of natural proteins into a native structure are unknown. The problem of predicting a protein structure with minimum-energy starting from the unfolded amino acid sequence is a highly complex and important task in molecular and computational biology. Protein structure prediction has important applications in fields such as drug design and disease prediction. The protein structure prediction problem is NP-hard even in simplified lattice protein models. An evolutionary model based on hill-climbing genetic operators is proposed for protein structure prediction in the hydrophobic - polar (HP) model. Problem-specific search operators are implemented and applied using a steepest-ascent hill-climbing approach. Furthermore, the proposed model enforces an explicit diversification stage during the evolution in order to avoid local optimum. The main features of the resulting evolutionary algorithm - hill-climbing mechanism and diversification strategy - are evaluated in a set of numerical experiments for the protein structure prediction problem to assess their impact to the efficiency of the search process. Furthermore, the emerging consolidated model is compared to relevant algorithms from the literature for a set of difficult bidimensional instances from lattice protein models. The results obtained by the proposed algorithm are promising and competitive with those of related methods.
Directory of Open Access Journals (Sweden)
Chira Camelia
2011-07-01
Full Text Available Abstract Proteins are complex structures made of amino acids having a fundamental role in the correct functioning of living cells. The structure of a protein is the result of the protein folding process. However, the general principles that govern the folding of natural proteins into a native structure are unknown. The problem of predicting a protein structure with minimum-energy starting from the unfolded amino acid sequence is a highly complex and important task in molecular and computational biology. Protein structure prediction has important applications in fields such as drug design and disease prediction. The protein structure prediction problem is NP-hard even in simplified lattice protein models. An evolutionary model based on hill-climbing genetic operators is proposed for protein structure prediction in the hydrophobic - polar (HP model. Problem-specific search operators are implemented and applied using a steepest-ascent hill-climbing approach. Furthermore, the proposed model enforces an explicit diversification stage during the evolution in order to avoid local optimum. The main features of the resulting evolutionary algorithm - hill-climbing mechanism and diversification strategy - are evaluated in a set of numerical experiments for the protein structure prediction problem to assess their impact to the efficiency of the search process. Furthermore, the emerging consolidated model is compared to relevant algorithms from the literature for a set of difficult bidimensional instances from lattice protein models. The results obtained by the proposed algorithm are promising and competitive with those of related methods.
Random matrices and chaos in nuclear physics: Nuclear structure
International Nuclear Information System (INIS)
Weidenmueller, H. A.; Mitchell, G. E.
2009-01-01
Evidence for the applicability of random-matrix theory to nuclear spectra is reviewed. In analogy to systems with few degrees of freedom, one speaks of chaos (more accurately, quantum chaos) in nuclei whenever random-matrix predictions are fulfilled. An introduction into the basic concepts of random-matrix theory is followed by a survey over the extant experimental information on spectral fluctuations, including a discussion of the violation of a symmetry or invariance property. Chaos in nuclear models is discussed for the spherical shell model, for the deformed shell model, and for the interacting boson model. Evidence for chaos also comes from random-matrix ensembles patterned after the shell model such as the embedded two-body ensemble, the two-body random ensemble, and the constrained ensembles. All this evidence points to the fact that chaos is a generic property of nuclear spectra, except for the ground-state regions of strongly deformed nuclei.
DEFF Research Database (Denmark)
Bergenholtz, Henning; Pedersen, Heidi Agerbo
2015-01-01
This contribution will not describe the structure in existing dictionaries. Instead, it will focus on the decisions that lexicographers make when they draw up the concept for and carry out the production of one or more new dictionaries, or when they consider making changes in the data presentation...... in an existing dictionary. This part of the lexicographical work is what we call structuring, which encompasses a number of various lexicographical decisions. One of these is choosing the fields that a database should contain. Typically, for some of these field types, it will be easy to distribute data......, but for other fields it will require long considerations as there are several distribution options with different outcomes of varying usefulness. A second type of lexicographical decision to be made by the lexicographer is the predefined searching, which involves in what order searches are to be made...
Directory of Open Access Journals (Sweden)
Vahid Behravesh
2012-08-01
Full Text Available Presented article is studying the issue of path navigating for numerous robots. Our presented approach is based on both priority and the robust method for path finding in repetitive dynamic. Presented model can be generally implementable and useable: We do not assume any restriction regarding the quantity of levels of freedom for robots, and robots of diverse kinds can be applied at the same time. We proposed a random method and hill-climbing technique in the area based on precedence plans, which is used to determine a solution to a given trajectory planning problem and to make less the extent of total track. Our method plans trajectories for particular robots in the setting-time scope. Therefore, in order to specifying the interval of constant objects similar to other robots and the extent of the tracks which is traversed. For measuring the hazard for robots to conflict with each other it applied a method based on probability of the movements of robots. This algorithm applied to real robots with successful results. The proposed method performed and judged on both real robots and in simulation. We performed sequence of100tests with 8 robots for comparing with coordination method and current performances are effective. However, maximizing the performance is still possible. These performances estimations performed on Windows operating system and 3GHz Intel Pentium IV with and compiles with GCC 3.4. We used our PCGA robot for all experiments. For a large environment of 19×15m2where we accomplished 40tests, our model is competent to plan high-quality paths in a severely short time (less than a second. Moreover, this article utilized lookup tables to keep expenses the formerly navigated robots made, increasing the number of robots don’t expand computation time.
Search for resonance structures in inclusive charged pion spectra from p-barp annihilation at rest
International Nuclear Information System (INIS)
Angelopoulos, A.; Apostolakis, A.; Papaelias, P.
1985-01-01
The charged pion momentum spectra from p-barp annihilation at rest have been measured with high statistics. A search for structures finds four narrow lines which are identified with the absorption and decay processes of kaons stopping in the target. Limits of 1-6 x 10 -4 /p-bar (90% C.L.) are placed on the yield of a narrow state in the mass range 1000--1660 MeV
Cloud4Psi: cloud computing for 3D protein structure similarity searching.
Mrozek, Dariusz; Małysiak-Mrozek, Bożena; Kłapciński, Artur
2014-10-01
Popular methods for 3D protein structure similarity searching, especially those that generate high-quality alignments such as Combinatorial Extension (CE) and Flexible structure Alignment by Chaining Aligned fragment pairs allowing Twists (FATCAT) are still time consuming. As a consequence, performing similarity searching against large repositories of structural data requires increased computational resources that are not always available. Cloud computing provides huge amounts of computational power that can be provisioned on a pay-as-you-go basis. We have developed the cloud-based system that allows scaling of the similarity searching process vertically and horizontally. Cloud4Psi (Cloud for Protein Similarity) was tested in the Microsoft Azure cloud environment and provided good, almost linearly proportional acceleration when scaled out onto many computational units. Cloud4Psi is available as Software as a Service for testing purposes at: http://cloud4psi.cloudapp.net/. For source code and software availability, please visit the Cloud4Psi project home page at http://zti.polsl.pl/dmrozek/science/cloud4psi.htm. © The Author 2014. Published by Oxford University Press.
Merlin , R.; Bajema , K.; Nagle , J.; Ploog , K.
1987-01-01
We report structural studies of incommensurate and random GaAs-AlAs superlattices using Raman scattering by acoustic phonons. Properties of the structure factor of Fibonacci and Thue-Morse superlattices are discussed in some detail.
DEFF Research Database (Denmark)
Köyluoglu, H.U.; Nielsen, Søren R.K.; Cakmak, A.S.
1994-01-01
perturbation method using stochastic differential equations. The joint statistical moments entering the perturbation solution are determined by considering an augmented dynamic system with state variables made up of the displacement and velocity vector and their first and second derivatives with respect......The paper deals with the first and second order statistical moments of the response of linear systems with random parameters subject to random excitation modelled as white-noise multiplied by an envelope function with random parameters. The method of analysis is basically a second order...... to the random parameters of the problem. Equations for partial derivatives are obtained from the partial differentiation of the equations of motion. The zero time-lag joint statistical moment equations for the augmented state vector are derived from the Itô differential formula. General formulation is given...
Zilka, Miri; Dudenko, Dmytro V.; Hughes, Colan E.; Williams, P. Andrew; Sturniolo, Simone; Franks, W. Trent; Pickard, Chris J.
2017-01-01
This paper explores the capability of using the DFT-D ab initio random structure searching (AIRSS) method to generate crystal structures of organic molecular materials, focusing on a system (m-aminobenzoic acid; m-ABA) that is known from experimental studies to exhibit abundant polymorphism. Within the structural constraints selected for the AIRSS calculations (specifically, centrosymmetric structures with Z = 4 for zwitterionic m-ABA molecules), the method is shown to successfully generate the two known polymorphs of m-ABA (form III and form IV) that have these structural features. We highlight various issues that are encountered in comparing crystal structures generated by AIRSS to experimental powder X-ray diffraction (XRD) data and solid-state magic-angle spinning (MAS) NMR data, demonstrating successful fitting for some of the lowest energy structures from the AIRSS calculations against experimental low-temperature powder XRD data for known polymorphs of m-ABA, and showing that comparison of computed and experimental solid-state NMR parameters allows different hydrogen-bonding motifs to be discriminated. PMID:28944393
International Nuclear Information System (INIS)
Randic, M.; Wilkins, C.L.
1979-01-01
Selected molecular data on alkanes have been reexamined in a search for general regularities in isomeric variations. In contrast to the prevailing approaches concerned with fitting data by searching for optimal parameterization, the present work is primarily aimed at established trends, i.e., searching for relative magnitudes and their regularities among the isomers. Such an approach is complementary to curve fitting or correlation seeking procedures. It is particularly useful when there are incomplete data which allow trends to be recognized but no quantitative correlation to be established. One proceeds by first ordering structures. One way is to consider molecular graphs and enumerate paths of different length as the basic graph invariant. It can be shown that, for several thermodynamic molecular properties, the number of paths of length two (p 2 ) and length three (p 3 ) are critical. Hence, an ordering based on p 2 and p 3 indicates possible trends and behavior for many molecular properties, some of which relate to others, some which do not. By considering a grid graph derived by attributing to each isomer coordinates (p 2 ,p 3 ) and connecting points along the coordinate axis, one obtains a simple presentation useful for isomer structural interrelations. This skeletal frame is one upon which possible trends for different molecular properties may be conveniently represented. The significance of the results and their conceptual value is discussed. 16 figures, 3 tables
The multi-copy simultaneous search methodology: a fundamental tool for structure-based drug design.
Schubert, Christian R; Stultz, Collin M
2009-08-01
Fragment-based ligand design approaches, such as the multi-copy simultaneous search (MCSS) methodology, have proven to be useful tools in the search for novel therapeutic compounds that bind pre-specified targets of known structure. MCSS offers a variety of advantages over more traditional high-throughput screening methods, and has been applied successfully to challenging targets. The methodology is quite general and can be used to construct functionality maps for proteins, DNA, and RNA. In this review, we describe the main aspects of the MCSS method and outline the general use of the methodology as a fundamental tool to guide the design of de novo lead compounds. We focus our discussion on the evaluation of MCSS results and the incorporation of protein flexibility into the methodology. In addition, we demonstrate on several specific examples how the information arising from the MCSS functionality maps has been successfully used to predict ligand binding to protein targets and RNA.
Search and rescue in collapsed structures: engineering and social science aspects.
El-Tawil, Sherif; Aguirre, Benigno
2010-10-01
This paper discusses the social science and engineering dimensions of search and rescue (SAR) in collapsed buildings. First, existing information is presented on factors that influence the behaviour of trapped victims, particularly human, physical, socioeconomic and circumstantial factors. Trapped victims are most often discussed in the context of structural collapse and injuries sustained. Most studies in this area focus on earthquakes as the type of disaster that produces the most extensive structural damage. Second, information is set out on the engineering aspects of urban search and rescue (USAR) in the United States, including the role of structural engineers in USAR operations, training and certification of structural specialists, and safety and general procedures. The use of computational simulation to link the engineering and social science aspects of USAR is discussed. This could supplement training of local SAR groups and USAR teams, allowing them to understand better the collapse process and how voids form in a rubble pile. A preliminary simulation tool developed for this purpose is described. © 2010 The Author(s). Journal compilation © Overseas Development Institute, 2010.
Search method optimization technique for thermal design of high power RFQ structure
International Nuclear Information System (INIS)
Sharma, N.K.; Joshi, S.C.
2009-01-01
RRCAT has taken up the development of 3 MeV RFQ structure for the low energy part of 100 MeV H - ion injector linac. RFQ is a precision machined resonating structure designed for high rf duty factor. RFQ structural stability during high rf power operation is an important design issue. The thermal analysis of RFQ has been performed using ANSYS finite element analysis software and optimization of various parameters is attempted using Search Method optimization technique. It is an effective optimization technique for the systems governed by a large number of independent variables. The method involves examining a number of combinations of values of independent variables and drawing conclusions from the magnitude of the objective function at these combinations. In these methods there is a continuous improvement in the objective function throughout the course of the search and hence these methods are very efficient. The method has been employed in optimization of various parameters (called independent variables) of RFQ like cooling water flow rate, cooling water inlet temperatures, cavity thickness etc. involved in RFQ thermal design. The temperature rise within RFQ structure is the objective function during the thermal design. Using ANSYS Programming Development Language (APDL), various multiple iterative programmes are written and the analysis are performed to minimize the objective function. The dependency of the objective function on various independent variables is established and the optimum values of the parameters are evaluated. The results of the analysis are presented in the paper. (author)
Atomic structure calculations using the relativistic random phase approximation
International Nuclear Information System (INIS)
Cheng, K.T.; Johnson, W.R.
1981-01-01
A brief review is given for the relativistic random phase approximation (RRPA) applied to atomic transition problems. Selected examples of RRPA calculations on discrete excitations and photoionization are given to illustrate the need of relativistic many-body theories in dealing with atomic processes where both relativity and correlation are important
The Cost of Cache-Oblivious Searching
DEFF Research Database (Denmark)
Bender, Michael A.; Brodal, Gert Stølting; Fagerberg, Rolf
2003-01-01
, multilevel memory hierarchies can be modelled. It is shown that as k grows, the search costs of the optimal k-level DAM search structure and of the optimal cache-oblivious search structure rapidly converge. This demonstrates that for a multilevel memory hierarchy, a simple cache-oblivious structure almost......Tight bounds on the cost of cache-oblivious searching are proved. It is shown that no cache-oblivious search structure can guarantee that a search performs fewer than lg e log B N block transfers between any two levels of the memory hierarchy. This lower bound holds even if all of the block sizes...... the random placement of the rst element of the structure in memory. As searching in the Disk Access Model (DAM) can be performed in log B N + 1 block transfers, this result shows a separation between the 2-level DAM and cacheoblivious memory-hierarchy models. By extending the DAM model to k levels...
Upper-Lower Bounds Candidate Sets Searching Algorithm for Bayesian Network Structure Learning
Directory of Open Access Journals (Sweden)
Guangyi Liu
2014-01-01
Full Text Available Bayesian network is an important theoretical model in artificial intelligence field and also a powerful tool for processing uncertainty issues. Considering the slow convergence speed of current Bayesian network structure learning algorithms, a fast hybrid learning method is proposed in this paper. We start with further analysis of information provided by low-order conditional independence testing, and then two methods are given for constructing graph model of network, which is theoretically proved to be upper and lower bounds of the structure space of target network, so that candidate sets are given as a result; after that a search and scoring algorithm is operated based on the candidate sets to find the final structure of the network. Simulation results show that the algorithm proposed in this paper is more efficient than similar algorithms with the same learning precision.
Structured triglyceride for parenteral nutrition: meta-analysis of randomized controlled trials.
Zhou, Yong; Wu, Xiao-Ting; Li, Ni; Zhuang, Wen; Liu, Guanjian; Wu, Taixiang; Wei, Mao-Ling
2006-01-01
This study assessed the safety and efficacy of structured triglyceride (ST) for parenteral nutrition. A meta-analysis of all the relevant randomized controlled trials (RCTs) was performed. Clinical trials were identified from the following electronic databases: MEDLINE, EMBASE, the Cochrane Controlled Trials Register, Chinese Bio-medicine Database. The search was undertaken in March 2005. Language was restricted to Chinese and English. Literature references were checked at the same time. Only RCTs were extracted and evaluated by two reviewers independently of each other. The statistical analysis was performed by RevMan4.2 software which was provided by the Cochrane Collaboration. A P value of triglyceride (LCT), and the combined results showed that the ST had significant effect on resting energy expenditure (weighted mean difference [WMD] =1.54, 95%CI [ 1.26, 1.82], ptriglycerides (WMD = -0.10, 95%CI [-0.30, 0.10], P=0.32). Only two RCTs compared ST with the physical mixture of medium- and long-chain triglyceride (MCT/LCT), data from trials were not combined due to clinical differences between trials, and conclusions can not be drew from the present data. ST appeared to be safe and well tolerated. Further trials are required, especially compared with the MCT/LCT, with sufficient size and rigorous design.
Slepian Simulations of Plastic Displacements of Randomly Excited Hysteretic Structures
DEFF Research Database (Denmark)
Lazarov, Boyan Stefanov
2003-01-01
The object of the study is a fast simulation method for generation and analysis of the plastic response of a randomly excited MDOF oscillatro with several potential elements with elasto-plastic constitutive behavior. The oscillator is statically determinate with linear damping. The external...... approximately as a stationary Gaussian process. This requires that the standard deviation of the stationary response is not too large as compared to the plastic yield limits. The Slepian model process for the behavior of the linear response is then simply the conditional mean (linear regression) of the process...... noise excited linear oscillator obtained from the elasto-plastic oscillator by totally removing the plastic domain. Thus the key to the applicability of the method is that the oscillator has a linear domain within which the response stays for a sufficiently long time to make the random response behave...
Generalized Pattern Search methods for a class of nonsmooth optimization problems with structure
Bogani, C.; Gasparo, M. G.; Papini, A.
2009-07-01
We propose a Generalized Pattern Search (GPS) method to solve a class of nonsmooth minimization problems, where the set of nondifferentiability is included in the union of known hyperplanes and, therefore, is highly structured. Both unconstrained and linearly constrained problems are considered. At each iteration the set of poll directions is enforced to conform to the geometry of both the nondifferentiability set and the boundary of the feasible region, near the current iterate. This is the key issue to guarantee the convergence of certain subsequences of iterates to points which satisfy first-order optimality conditions. Numerical experiments on some classical problems validate the method.
Study of Fuze Structure and Reliability Design Based on the Direct Search Method
Lin, Zhang; Ning, Wang
2017-03-01
Redundant design is one of the important methods to improve the reliability of the system, but mutual coupling of multiple factors is often involved in the design. In my study, Direct Search Method is introduced into the optimum redundancy configuration for design optimization, in which, the reliability, cost, structural weight and other factors can be taken into account simultaneously, and the redundant allocation and reliability design of aircraft critical system are computed. The results show that this method is convenient and workable, and applicable to the redundancy configurations and optimization of various designs upon appropriate modifications. And this method has a good practical value.
On a structure intermediate between quasiperiodic and random
International Nuclear Information System (INIS)
Hof, A.
1996-01-01
This paper proves rigorously that the structure factor of the open-quotes structure intermediate between quasiperiodic and randomclose quotes introduced by Aubry, Godreche, and Luck is purely singular continuous apart from a delta function at zero for open-quotes mostclose quotes parameters, and on the Wonderland Theorem
Localized surface plasmon enhanced cellular imaging using random metallic structures
Son, Taehwang; Lee, Wonju; Kim, Donghyun
2017-02-01
We have studied fluorescence cellular imaging with randomly distributed localized near-field induced by silver nano-islands. For the fabrication of nano-islands, a 10-nm silver thin film evaporated on a BK7 glass substrate with an adhesion layer of 2-nm thick chromium. Micrometer sized silver square pattern was defined using e-beam lithography and then the film was annealed at 200°C. Raw images were restored using electric field distribution produced on the surface of random nano-islands. Nano-islands were modeled from SEM images. 488-nm p-polarized light source was set to be incident at 60°. Simulation results show that localized electric fields were created among nano-islands and that their average size was found to be 135 nm. The feasibility was tested using conventional total internal reflection fluorescence microscopy while the angle of incidence was adjusted to maximize field enhancement. Mouse microphage cells were cultured on nano-islands, and actin filaments were selectively stained with FITC-conjugated phalloidin. Acquired images were deconvolved based on linear imaging theory, in which molecular distribution was sampled by randomly distributed localized near-field and blurred by point spread function of far-field optics. The optimum fluorophore distribution was probabilistically estimated by repetitively matching a raw image. The deconvolved images are estimated to have a resolution in the range of 100-150 nm largely determined by the size of localized near-fields. We also discuss and compare the results with images acquired with periodic nano-aperture arrays in various optical configurations to excite localized plasmonic fields and to produce super-resolved molecular images.
ATLAS, an integrated structural analysis and design system. Volume 4: Random access file catalog
Gray, F. P., Jr. (Editor)
1979-01-01
A complete catalog is presented for the random access files used by the ATLAS integrated structural analysis and design system. ATLAS consists of several technical computation modules which output data matrices to corresponding random access file. A description of the matrices written on these files is contained herein.
Perceived breast cancer risk: heuristic reasoning and search for a dominance structure.
Katapodi, Maria C; Facione, Noreen C; Humphreys, Janice C; Dodd, Marylin J
2005-01-01
Studies suggest that people construct their risk perceptions by using inferential rules called heuristics. The purpose of this study was to identify heuristics that influence perceived breast cancer risk. We examined 11 interviews from women of diverse ethnic/cultural backgrounds who were recruited from community settings. Narratives in which women elaborated about their own breast cancer risk were analyzed with Argument and Heuristic Reasoning Analysis methodology, which is based on applied logic. The availability, simulation, representativeness, affect, and perceived control heuristics, and search for a dominance structure were commonly used for making risk assessments. Risk assessments were based on experiences with an abnormal breast symptom, experiences with affected family members and friends, beliefs about living a healthy lifestyle, and trust in health providers. Assessment of the potential threat of a breast symptom was facilitated by the search for a dominance structure. Experiences with family members and friends were incorporated into risk assessments through the availability, simulation, representativeness, and affect heuristics. Mistrust in health providers led to an inappropriate dependence on the perceived control heuristic. Identified heuristics appear to create predictable biases and suggest that perceived breast cancer risk is based on common cognitive patterns.
Cheung, Mike W.-L.; Cheung, Shu Fai
2016-01-01
Meta-analytic structural equation modeling (MASEM) combines the techniques of meta-analysis and structural equation modeling for the purpose of synthesizing correlation or covariance matrices and fitting structural equation models on the pooled correlation or covariance matrix. Both fixed-effects and random-effects models can be defined in MASEM.…
Phonon structures of GaN-based random semiconductor alloys
Zhou, Mei; Chen, Xiaobin; Li, Gang; Zheng, Fawei; Zhang, Ping
2017-12-01
Accurate modeling of thermal properties is strikingly important for developing next-generation electronics with high performance. Many thermal properties are closely related to phonon dispersions, such as sound velocity. However, random substituted semiconductor alloys AxB1-x usually lack translational symmetry, and simulation with periodic boundary conditions often requires large supercells, which makes phonon dispersion highly folded and hardly comparable with experimental results. Here, we adopt a large supercell with randomly distributed A and B atoms to investigate substitution effect on the phonon dispersions of semiconductor alloys systematically by using phonon unfolding method [F. Zheng, P. Zhang, Comput. Mater. Sci. 125, 218 (2016)]. The results reveal the extent to which phonon band characteristics in (In,Ga)N and Ga(N,P) are preserved or lost at different compositions and q points. Generally, most characteristics of phonon dispersions can be preserved with indium substitution of gallium in GaN, while substitution of nitrogen with phosphorus strongly perturbs the phonon dispersion of GaN, showing a rapid disintegration of the Bloch characteristics of optical modes and introducing localized impurity modes. In addition, the sound velocities of both (In,Ga)N and Ga(N,P) display a nearly linear behavior as a function of substitution compositions. Supplementary material in the form of one pdf file available from the Journal web page at http://https://doi.org/10.1140/epjb/e2017-80481-0.
Analytical and Experimental Random Vibration of Nonlinear Aeroelastic Structures.
1987-01-28
vibrations. In civil engineenng the mechanical and strength eccentricity in the disks. Parameter variations exist in disk properties of the material vary...support. define the loading and resistance strength of the structure. Figure 10 shows the comparison between theoretical and experi- mental natural... dinamics . Sijthoff- Hilton, H H. and Feigen. M. Minimum weight analysis based on structural Noordhoff Co, Netherlands. reliability. J Aerospace Sc, 27
Special quasirandom structures for binary/ternary group IV random alloys
Chroneos, Alexander I.; Jiang, Chao; Grimes, Robin W.; Schwingenschlö gl, Udo
2010-01-01
Simulation of defect interactions in binary/ternary group IV semiconductor alloys at the density functional theory level is difficult due to the random distribution of the constituent atoms. The special quasirandom structures approach is a
RANDOM FUNCTIONS AND INTERVAL METHOD FOR PREDICTING THE RESIDUAL RESOURCE OF BUILDING STRUCTURES
Directory of Open Access Journals (Sweden)
Shmelev Gennadiy Dmitrievich
2017-11-01
Full Text Available Subject: possibility of using random functions and interval prediction method for estimating the residual life of building structures in the currently used buildings. Research objectives: coordination of ranges of values to develop predictions and random functions that characterize the processes being predicted. Materials and methods: when performing this research, the method of random functions and the method of interval prediction were used. Results: in the course of this work, the basic properties of random functions, including the properties of families of random functions, are studied. The coordination of time-varying impacts and loads on building structures is considered from the viewpoint of their influence on structures and representation of the structures’ behavior in the form of random functions. Several models of random functions are proposed for predicting individual parameters of structures. For each of the proposed models, its scope of application is defined. The article notes that the considered approach of forecasting has been used many times at various sites. In addition, the available results allowed the authors to develop a methodology for assessing the technical condition and residual life of building structures for the currently used facilities. Conclusions: we studied the possibility of using random functions and processes for the purposes of forecasting the residual service lives of structures in buildings and engineering constructions. We considered the possibility of using an interval forecasting approach to estimate changes in defining parameters of building structures and their technical condition. A comprehensive technique for forecasting the residual life of building structures using the interval approach is proposed.
Schweiger, Stefan; Oeberst, Aileen; Cress, Ulrike
2014-03-26
The public typically believes psychotherapy to be more effective than pharmacotherapy for depression treatments. This is not consistent with current scientific evidence, which shows that both types of treatment are about equally effective. The study investigates whether this bias towards psychotherapy guides online information search and whether the bias can be reduced by explicitly providing expert information (in a blog entry) and by providing tag clouds that implicitly reveal experts' evaluations. A total of 174 participants completed a fully automated Web-based study after we invited them via mailing lists. First, participants read two blog posts by experts that either challenged or supported the bias towards psychotherapy. Subsequently, participants searched for information about depression treatment in an online environment that provided more experts' blog posts about the effectiveness of treatments based on alleged research findings. These blogs were organized in a tag cloud; both psychotherapy tags and pharmacotherapy tags were popular. We measured tag and blog post selection, efficacy ratings of the presented treatments, and participants' treatment recommendation after information search. Participants demonstrated a clear bias towards psychotherapy (mean 4.53, SD 1.99) compared to pharmacotherapy (mean 2.73, SD 2.41; t173=7.67, Pinformation search and evaluation. This bias was significantly reduced, however, when participants were exposed to tag clouds with challenging popular tags. Participants facing popular tags challenging their bias (n=61) showed significantly less biased tag selection (F2,168=10.61, Pinformation as presented in blog posts, compared to supporting expert information (n=81), decreased the bias in information search with regard to blog post selection (F1,168=4.32, P=.04, partial eta squared=0.025). No significant effects were found for treatment recommendation (Ps>.33). We conclude that the psychotherapy bias is most effectively
EEG and Eye Tracking Signatures of Target Encoding during Structured Visual Search
Directory of Open Access Journals (Sweden)
Anne-Marie Brouwer
2017-05-01
Full Text Available EEG and eye tracking variables are potential sources of information about the underlying processes of target detection and storage during visual search. Fixation duration, pupil size and event related potentials (ERPs locked to the onset of fixation or saccade (saccade-related potentials, SRPs have been reported to differ dependent on whether a target or a non-target is currently fixated. Here we focus on the question of whether these variables also differ between targets that are subsequently reported (hits and targets that are not (misses. Observers were asked to scan 15 locations that were consecutively highlighted for 1 s in pseudo-random order. Highlighted locations displayed either a target or a non-target stimulus with two, three or four targets per trial. After scanning, participants indicated which locations had displayed a target. To induce memory encoding failures, participants concurrently performed an aurally presented math task (high load condition. In a low load condition, participants ignored the math task. As expected, more targets were missed in the high compared with the low load condition. For both conditions, eye tracking features distinguished better between hits and misses than between targets and non-targets (with larger pupil size and shorter fixations for missed compared with correctly encoded targets. In contrast, SRP features distinguished better between targets and non-targets than between hits and misses (with average SRPs showing larger P300 waveforms for targets than for non-targets. Single trial classification results were consistent with these averages. This work suggests complementary contributions of eye and EEG measures in potential applications to support search and detect tasks. SRPs may be useful to monitor what objects are relevant to an observer, and eye variables may indicate whether the observer should be reminded of them later.
Mata, Scott A; Bottjer, David J
2009-11-01
Wrinkle structures are microbially mediated sedimentary structures that are a common feature of Proterozoic and earliest Phanerozoic siliciclastic seafloors on Earth and occur only rarely in post-Cambrian strata. These macroscopic microbially induced sedimentary structures are readily identifiable at the outcrop scale, and their recognition on other planetary bodies by landed missions may suggest the presence of past microbial life. Wrinkle structures of the Lower Triassic (Spathian) Virgin Limestone Member of the Moenkopi Formation in the western United States record an occurrence of widespread microbialite formation in the wake of the end-Permian mass extinction, the largest biotic crisis of the Phanerozoic. Wrinkle structures occur on proximal sandy tempestites deposited within the offshore transition. Storm layers appear to have been rapidly colonized by microbial mats and were subsequently buried by mud during fair-weather conditions. Wrinkle structures exhibit flat-topped crests and sinuous troughs, with associated mica grains oriented parallel to bedding, suggestive of trapping and binding activity. Although Lower Triassic wrinkle structures postdate the widespread occurrence of these features during the Proterozoic and Cambrian, they exhibit many of the same characteristics and environmental trends, which suggests a conservation of microbial formational and preservational processes in subtidal siliciclastic settings on Earth from the Precambrian into the Phanerozoic. In the search for extraterrestrial life, it may be these conservative characteristics that prove to be the most useful and robust for recognizing microbial features on other planetary bodies, and may add to an ever-growing foundation of knowledge for directing future explorations aimed at seeking out macroscopic microbial signatures.
Completely random measures for modelling block-structured sparse networks
DEFF Research Database (Denmark)
Herlau, Tue; Schmidt, Mikkel Nørgaard; Mørup, Morten
2016-01-01
Many statistical methods for network data parameterize the edge-probability by attributing latent traits to the vertices such as block structure and assume exchangeability in the sense of the Aldous-Hoover representation theorem. Empirical studies of networks indicate that many real-world networks...... have a power-law distribution of the vertices which in turn implies the number of edges scale slower than quadratically in the number of vertices. These assumptions are fundamentally irreconcilable as the Aldous-Hoover theorem implies quadratic scaling of the number of edges. Recently Caron and Fox...
Searching for structural medium changes during the 2011 El Hierro (Spain) submarine eruption
Sánchez-Pastor, Pilar S.; Schimmel, Martin; López, Carmen
2017-04-01
Submarine volcanic eruptions are often difficult to study due to their restricted access that usually inhibits direct observations. That happened with the 2011 El Hierro eruption, which is the first eruption that has been tracked in real time in Canary Islands. For instance, despite the real-time tracking it was not possible to determine the exact end of the eruption. Besides, volcanic eruptions involve many dynamic (physical and chemical) processes, which cause structural changes in the surrounding medium that we expect to observe and monitor through passive seismic approaches. The purpose of this study is to detect and analyse these changes as well as to search for precursory signals to the eruption itself using ambient noise auto and cross-correlations. We employ different correlation strategies (classical and phase cross-correlation) and apply them to field data recorded by the IGN network during 2011 and 2012. The different preprocessing and processing steps are tested and compared to better understand the data, to find the robust signatures, and to define a routine work procedure. One of the problems we face is the presence of volcanic tremors, which cause a varying seismic response that we can not attribute to structural changes. So far, structural changes could not be detected unambiguously and we present our ongoing research in this field.
Yousefi-Nooraie, Reza; Irani, Shirin; Mortaz-Hedjri, Soroush; Shakiba, Behnam
2013-10-01
The aim of this study was to compare the performance of three search methods in the retrieval of relevant clinical trials from PubMed to answer specific clinical questions. Included studies of a sample of 100 Cochrane reviews which recorded in PubMed were considered as the reference standard. The search queries were formulated based on the systematic review titles. Precision, recall and number of retrieved records for limiting the results to clinical trial publication type, and using sensitive and specific clinical queries filters were compared. The number of keywords, presence of specific names of intervention and syndrome in the search keywords were used in a model to predict the recalls and precisions. The Clinical queries-sensitive search strategy retrieved the largest number of records (33) and had the highest recall (41.6%) and lowest precision (4.8%). The presence of specific intervention name was the only significant predictor of all recalls and precisions (P = 0.016). The recall and precision of combination of simple clinical search queries and methodological search filters to find clinical trials in various subjects were considerably low. The limit field strategy yielded in higher precision and fewer retrieved records and approximately similar recall, compared with the clinical queries-sensitive strategy. Presence of specific intervention name in the search keywords increased both recall and precision. © 2010 John Wiley & Sons Ltd.
Dual resonant structure for energy harvesting from random vibration sources at low frequency
Directory of Open Access Journals (Sweden)
Shanshan Li
2016-01-01
Full Text Available We introduce a design with dual resonant structure which can harvest energy from random vibration sources at low frequency range. The dual resonant structure consists of two spring-mass subsystems with different frequency responses, which exhibit strong coupling and broad bandwidth when the two masses collide with each other. Experiments with piezoelectric elements show that the energy harvesting device with dual resonant structure can generate higher power output than the sum of the two separate devices from random vibration sources.
Random Walk Model for Cell-To-Cell Misalignments in Accelerator Structures
International Nuclear Information System (INIS)
Stupakov, Gennady
2000-01-01
Due to manufacturing and construction errors, cells in accelerator structures can be misaligned relative to each other. As a consequence, the beam generates a transverse wakefield even when it passes through the structure on axis. The most important effect is the long-range transverse wakefield that deflects the bunches and causes growth of the bunch train projected emittance. In this paper, the effect of the cell-to-cell misalignments is evaluated using a random walk model that assumes that each cell is shifted by a random step relative to the previous one. The model is compared with measurements of a few accelerator structures
A search for H/ACA snoRNAs in yeast using MFE secondary structure prediction.
Edvardsson, Sverker; Gardner, Paul P; Poole, Anthony M; Hendy, Michael D; Penny, David; Moulton, Vincent
2003-05-01
Noncoding RNA genes produce functional RNA molecules rather than coding for proteins. One such family is the H/ACA snoRNAs. Unlike the related C/D snoRNAs these have resisted automated detection to date. We develop an algorithm to screen the yeast genome for novel H/ACA snoRNAs. To achieve this, we introduce some new methods for facilitating the search for noncoding RNAs in genomic sequences which are based on properties of predicted minimum free-energy (MFE) secondary structures. The algorithm has been implemented and can be generalized to enable screening of other eukaryote genomes. We find that use of primary sequence alone is insufficient for identifying novel H/ACA snoRNAs. Only the use of secondary structure filters reduces the number of candidates to a manageable size. From genomic context, we identify three strong H/ACA snoRNA candidates. These together with a further 47 candidates obtained by our analysis are being experimentally screened.
GenRGenS: Software for Generating Random Genomic Sequences and Structures
Ponty , Yann; Termier , Michel; Denise , Alain
2006-01-01
International audience; GenRGenS is a software tool dedicated to randomly generating genomic sequences and structures. It handles several classes of models useful for sequence analysis, such as Markov chains, hidden Markov models, weighted context-free grammars, regular expressions and PROSITE expressions. GenRGenS is the only program that can handle weighted context-free grammars, thus allowing the user to model and to generate structured objects (such as RNA secondary structures) of any giv...
Statistics of the Von Mises Stress Response For Structures Subjected To Random Excitations
Directory of Open Access Journals (Sweden)
Mu-Tsang Chen
1998-01-01
Full Text Available Finite element-based random vibration analysis is increasingly used in computer aided engineering software for computing statistics (e.g., root-mean-square value of structural responses such as displacements, stresses and strains. However, these statistics can often be computed only for Cartesian responses. For the design of metal structures, a failure criterion based on an equivalent stress response, commonly known as the von Mises stress, is more appropriate and often used. This paper presents an approach for computing the statistics of the von Mises stress response for structures subjected to random excitations. Random vibration analysis is first performed to compute covariance matrices of Cartesian stress responses. Monte Carlo simulation is then used to perform scatter and failure analyses using the von Mises stress response.
Application of the random vibration approach in the seismic analysis of LMFBR structures
International Nuclear Information System (INIS)
Preumont, A.
1988-01-01
The first part discusses the general topic of the spectral analysis of linear multi-degree-of-freedom structure subjected to a stationary random field. Particular attention is given to structures with non-classical damping and hereditary characteristics. The method is implemented in the computer programme RANDOM. Next, the same concepts are applied to multi-supported structures subjected to a stationary seismic excitation. The method is implemented in the computer programme SEISME. Two related problems are dealt with in the next two chapters: (i) the relation between the input of the random vibration analysis and the traditional ground motion specification for seismic analysis (the Design Response Spectra) and (ii) the application of random vibration techniques to the direct generation of floor response spectra. Finally the problem of extracting information from costly time history analyses is addressed. This study has mainly been concerned with the methodology and the development of appropriate softwares. Some qualitative conclusions have been drawn regarding the expected benefit of the approach. They have been judged promising enough to motivate a benchmark exercise. Specifically, the random vibration approach will be compared to the current approximate methods (response spectrum) and time-history analyses (considered as representative of the true response) for a set of typical structures. The hope is that some of the flaws of the current approximate methods can be removed
Special quasirandom structures for binary/ternary group IV random alloys
Chroneos, Alexander I.
2010-06-01
Simulation of defect interactions in binary/ternary group IV semiconductor alloys at the density functional theory level is difficult due to the random distribution of the constituent atoms. The special quasirandom structures approach is a computationally efficient way to describe the random nature. We systematically study the efficacy of the methodology and generate a number of special quasirandom cells for future use. In order to demonstrate the applicability of the technique, the electronic structures of E centers in Si1-xGex and Si1-x -yGexSny alloys are discussed for a range of nearest neighbor environments. © 2010 Elsevier B.V. All rights reserved.
Study of RNA structures with a connection to random matrix theory
International Nuclear Information System (INIS)
Bhadola, Pradeep; Deo, Nivedita
2015-01-01
This manuscript investigates the level of complexity and thermodynamic properties of the real RNA structures and compares the properties with the random RNA sequences. A discussion on the similarities of thermodynamical properties of the real structures with the non linear random matrix model of RNA folding is presented. The structural information contained in the PDB file is exploited to get the base pairing information. The complexity of an RNA structure is defined by a topological quantity called genus which is calculated from the base pairing information. Thermodynamic analysis of the real structures is done numerically. The real structures have a minimum free energy which is very small compared to the randomly generated sequences of the same length. This analysis suggests that there are specific patterns in the structures which are preserved during the evolution of the sequences and certain sequences are discarded by the evolutionary process. Further analyzing the sequences of a fixed length reveal that the RNA structures exist in ensembles i.e. although all the sequences in the ensemble have different series of nucleotides (sequence) they fold into structures that have the same pairs of hydrogen bonding as well as the same minimum free energy. The specific heat of the RNA molecule is numerically estimated at different lengths. The specific heat curve with temperature shows a bump and for some RNA, a double peak behavior is observed. The same behavior is seen in the study of the random matrix model with non linear interaction of RNA folding. The bump in the non linear matrix model can be controlled by the change in the interaction strength.
Abuhamdieh, Ayman H.; Harder, Joseph T.
2015-01-01
This paper proposes a meta-cognitive, systems-based, information structuring model (McSIS) to systematize online information search behavior based on literature review of information-seeking models. The General Systems Theory's (GST) prepositions serve as its framework. Factors influencing information-seekers, such as the individual learning…
Entropy of level-cut random Gaussian structures at different volume fractions.
Marčelja, Stjepan
2017-10-01
Cutting random Gaussian fields at a given level can create a variety of morphologically different two- or several-phase structures that have often been used to describe physical systems. The entropy of such structures depends on the covariance function of the generating Gaussian random field, which in turn depends on its spectral density. But the entropy of level-cut structures also depends on the volume fractions of different phases, which is determined by the selection of the cutting level. This dependence has been neglected in earlier work. We evaluate the entropy of several lattice models to show that, even in the cases of strongly coupled systems, the dependence of the entropy of level-cut structures on molar fractions of the constituents scales with the simple ideal noninteracting system formula. In the last section, we discuss the application of the results to binary or ternary fluids and microemulsions.
Entropy of level-cut random Gaussian structures at different volume fractions
Marčelja, Stjepan
2017-10-01
Cutting random Gaussian fields at a given level can create a variety of morphologically different two- or several-phase structures that have often been used to describe physical systems. The entropy of such structures depends on the covariance function of the generating Gaussian random field, which in turn depends on its spectral density. But the entropy of level-cut structures also depends on the volume fractions of different phases, which is determined by the selection of the cutting level. This dependence has been neglected in earlier work. We evaluate the entropy of several lattice models to show that, even in the cases of strongly coupled systems, the dependence of the entropy of level-cut structures on molar fractions of the constituents scales with the simple ideal noninteracting system formula. In the last section, we discuss the application of the results to binary or ternary fluids and microemulsions.
Directory of Open Access Journals (Sweden)
Driss Sarsri
2014-05-01
Full Text Available In this paper, we propose a method to calculate the first two moments (mean and variance of the structural dynamics response of a structure with uncertain variables and subjected to random excitation. For this, Newmark method is used to transform the equation of motion of the structure into a quasistatic equilibrium equation in the time domain. The Neumann development method was coupled with Monte Carlo simulations to calculate the statistical values of the random response. The use of modal synthesis methods can reduce the dimensions of the model before integration of the equation of motion. Numerical applications have been developed to highlight effectiveness of the method developed to analyze the stochastic response of large structures.
National Research Council Canada - National Science Library
Chase, Eric
2000-01-01
This thesis provides a preliminary cost and operational effectiveness analysis of alternative force structures for the United States Marine Corps operational support airlift and search and rescue missions...
International Nuclear Information System (INIS)
Senatore, G.; Tosi, M.P.; Trieste Univ.
1981-08-01
The purpose of this letter is to stress that the way towards an unconventional optimized-random-phase-approximation (ORPA) approach to the structure of liquid metals is indicated, and in fact already a good first-order solution for such an approach is provided
Bayesian structure learning for Markov Random Fields with a spike and slab prior
Chen, Y.; Welling, M.; de Freitas, N.; Murphy, K.
2012-01-01
In recent years a number of methods have been developed for automatically learning the (sparse) connectivity structure of Markov Random Fields. These methods are mostly based on L1-regularized optimization which has a number of disadvantages such as the inability to assess model uncertainty and
High Efficiency Computation of the Variances of Structural Evolutionary Random Responses
Directory of Open Access Journals (Sweden)
J.H. Lin
2000-01-01
Full Text Available For structures subjected to stationary or evolutionary white/colored random noise, their various response variances satisfy algebraic or differential Lyapunov equations. The solution of these Lyapunov equations used to be very difficult. A precise integration method is proposed in the present paper, which solves such Lyapunov equations accurately and very efficiently.
Searching the protein structure database for ligand-binding site similarities using CPASS v.2
Directory of Open Access Journals (Sweden)
Caprez Adam
2011-01-01
Full Text Available Abstract Background A recent analysis of protein sequences deposited in the NCBI RefSeq database indicates that ~8.5 million protein sequences are encoded in prokaryotic and eukaryotic genomes, where ~30% are explicitly annotated as "hypothetical" or "uncharacterized" protein. Our Comparison of Protein Active-Site Structures (CPASS v.2 database and software compares the sequence and structural characteristics of experimentally determined ligand binding sites to infer a functional relationship in the absence of global sequence or structure similarity. CPASS is an important component of our Functional Annotation Screening Technology by NMR (FAST-NMR protocol and has been successfully applied to aid the annotation of a number of proteins of unknown function. Findings We report a major upgrade to our CPASS software and database that significantly improves its broad utility. CPASS v.2 is designed with a layered architecture to increase flexibility and portability that also enables job distribution over the Open Science Grid (OSG to increase speed. Similarly, the CPASS interface was enhanced to provide more user flexibility in submitting a CPASS query. CPASS v.2 now allows for both automatic and manual definition of ligand-binding sites and permits pair-wise, one versus all, one versus list, or list versus list comparisons. Solvent accessible surface area, ligand root-mean square difference, and Cβ distances have been incorporated into the CPASS similarity function to improve the quality of the results. The CPASS database has also been updated. Conclusions CPASS v.2 is more than an order of magnitude faster than the original implementation, and allows for multiple simultaneous job submissions. Similarly, the CPASS database of ligand-defined binding sites has increased in size by ~ 38%, dramatically increasing the likelihood of a positive search result. The modification to the CPASS similarity function is effective in reducing CPASS similarity scores
A pilot cluster randomized controlled trial of structured goal-setting following stroke.
Taylor, William J; Brown, Melanie; William, Levack; McPherson, Kathryn M; Reed, Kirk; Dean, Sarah G; Weatherall, Mark
2012-04-01
To determine the feasibility, the cluster design effect and the variance and minimal clinical importance difference in the primary outcome in a pilot study of a structured approach to goal-setting. A cluster randomized controlled trial. Inpatient rehabilitation facilities. People who were admitted to inpatient rehabilitation following stroke who had sufficient cognition to engage in structured goal-setting and complete the primary outcome measure. Structured goal elicitation using the Canadian Occupational Performance Measure. Quality of life at 12 weeks using the Schedule for Individualised Quality of Life (SEIQOL-DW), Functional Independence Measure, Short Form 36 and Patient Perception of Rehabilitation (measuring satisfaction with rehabilitation). Assessors were blinded to the intervention. Four rehabilitation services and 41 patients were randomized. We found high values of the intraclass correlation for the outcome measures (ranging from 0.03 to 0.40) and high variance of the SEIQOL-DW (SD 19.6) in relation to the minimally importance difference of 2.1, leading to impractically large sample size requirements for a cluster randomized design. A cluster randomized design is not a practical means of avoiding contamination effects in studies of inpatient rehabilitation goal-setting. Other techniques for coping with contamination effects are necessary.
The Hidden Flow Structure and Metric Space of Network Embedding Algorithms Based on Random Walks.
Gu, Weiwei; Gong, Li; Lou, Xiaodan; Zhang, Jiang
2017-10-13
Network embedding which encodes all vertices in a network as a set of numerical vectors in accordance with it's local and global structures, has drawn widespread attention. Network embedding not only learns significant features of a network, such as the clustering and linking prediction but also learns the latent vector representation of the nodes which provides theoretical support for a variety of applications, such as visualization, link prediction, node classification, and recommendation. As the latest progress of the research, several algorithms based on random walks have been devised. Although those algorithms have drawn much attention for their high scores in learning efficiency and accuracy, there is still a lack of theoretical explanation, and the transparency of those algorithms has been doubted. Here, we propose an approach based on the open-flow network model to reveal the underlying flow structure and its hidden metric space of different random walk strategies on networks. We show that the essence of embedding based on random walks is the latent metric structure defined on the open-flow network. This not only deepens our understanding of random- walk-based embedding algorithms but also helps in finding new potential applications in network embedding.
Extracting Structure from Optical Flow Using the Fast Error Search Technique
National Research Council Canada - National Science Library
Srinivasan, Sridar
1998-01-01
...) of an optical flow field, using fast partial search. For each candidate location on a discrete sampling of the image area, we generate a linear system of equations for determining the remaining unknowns, viz...
Directory of Open Access Journals (Sweden)
You-Wei Zhang
Full Text Available A general symplectic method for the random response analysis of infinitely periodic structures subjected to stationary/non-stationary random excitations is developed using symplectic mathematics in conjunction with variable separation and the pseudo-excitation method (PEM. Starting from the equation of motion for a single loaded substructure, symplectic analysis is firstly used to eliminate the dependent degrees of the freedom through condensation. A Fourier expansion of the condensed equation of motion is then applied to separate the variables of time and wave number, thus enabling the necessary recurrence scheme to be developed. The random response is finally determined by implementing PEM. The proposed method is justified by comparison with results available in the literature and is then applied to a more complicated time-dependent coupled system.
Structure prediction of nanoclusters; a direct or a pre-screened search on the DFT energy landscape?
Farrow, M R; Chow, Y; Woodley, S M
2014-10-21
The atomic structure of inorganic nanoclusters obtained via a search for low lying minima on energy landscapes, or hypersurfaces, is reported for inorganic binary compounds: zinc oxide (ZnO)n, magnesium oxide (MgO)n, cadmium selenide (CdSe)n, and potassium fluoride (KF)n, where n = 1-12 formula units. The computational cost of each search is dominated by the effort to evaluate each sample point on the energy landscape and the number of required sample points. The effect of changing the balance between these two factors on the success of the search is investigated. The choice of sample points will also affect the number of required data points and therefore the efficiency of the search. Monte Carlo based global optimisation routines (evolutionary and stochastic quenching algorithms) within a new software package, viz. Knowledge Led Master Code (KLMC), are employed to search both directly and after pre-screening on the DFT energy landscape. Pre-screening includes structural relaxation to minimise a cheaper energy function - based on interatomic potentials - and is found to improve significantly the search efficiency, and typically reduces the number of DFT calculations required to locate the local minima by more than an order of magnitude. Although the choice of functional form is important, the approach is robust to small changes to the interatomic potential parameters. The computational cost of initial DFT calculations of each structure is reduced by employing Gaussian smearing to the electronic energy levels. Larger (KF)n nanoclusters are predicted to form cuboid cuts from the rock-salt phase, but also share many structural motifs with (MgO)n for smaller clusters. The transition from 2D rings to 3D (bubble, or fullerene-like) structures occur at a larger cluster size for (ZnO)n and (CdSe)n. Differences between the HOMO and LUMO energies, for all the compounds apart from KF, are in the visible region of the optical spectrum (2-3 eV); KF lies deep in the UV region
Andersen, Douglas C.
1990-01-01
The influence of habitat patchiness and unpalatable plants on the search path of the plains pocket gopher (Geomys bursarius) was examined in outdoor enclosures. Separate experiments were used to evaluate how individual animals explored (by tunnel excavation) enclosures free of plants except for one or more dense patches of a palatable plant (Daucus carota), a dense patch of an unpalatable species (Pastinaca sativa) containing a few palatable plants (D. carota), or a relatively sparse mixture of palatable (D. carota) and unpalatable (Raphanus sativus) species. Only two of eight individuals tested showed the predicted pattern of concentrating search effort in patches of palatable plants. The maintenance of relatively high levels of effort in less profitable sites may reflect the security afforded food resources by the solitary social system and fossorial lifestyle of G. bursarius. Unpalatable plants repelled animals under some conditions, but search paths in the sparsely planted mixed-species treatment suggest animals can use visual or other cues to orient excavations. Evidence supporting area-restricted search was weak. More information about the use of visual cues by G. bursarius and the influence of experience on individual search mode is needed for refining current models of foraging behavior in this species.
Gist in time: Scene semantics and structure enhance recall of searched objects.
Josephs, Emilie L; Draschkow, Dejan; Wolfe, Jeremy M; Võ, Melissa L-H
2016-09-01
Previous work has shown that recall of objects that are incidentally encountered as targets in visual search is better than recall of objects that have been intentionally memorized (Draschkow, Wolfe, & Võ, 2014). However, this counter-intuitive result is not seen when these tasks are performed with non-scene stimuli. The goal of the current paper is to determine what features of search in a scene contribute to higher recall rates when compared to a memorization task. In each of four experiments, we compare the free recall rate for target objects following a search to the rate following a memorization task. Across the experiments, the stimuli include progressively more scene-related information. Experiment 1 provides the spatial relations between objects. Experiment 2 adds relative size and depth of objects. Experiments 3 and 4 include scene layout and semantic information. We find that search leads to better recall than explicit memorization in cases where scene layout and semantic information are present, as long as the participant has ample time (2500ms) to integrate this information with knowledge about the target object (Exp. 4). These results suggest that the integration of scene and target information not only leads to more efficient search, but can also contribute to stronger memory representations than intentional memorization. Copyright © 2016 Elsevier B.V. All rights reserved.
International Nuclear Information System (INIS)
Preumont, A.; Shilab, S.; Cornaggia, L.; Reale, M.; Labbe, P.; Noe, H.
1992-01-01
This benchmark exercise is the continuation of the state-of-the-art review (EUR 11369 EN) which concluded that the random vibration approach could be an effective tool in seismic analysis of nuclear power plants, with potential advantages on time history and response spectrum techniques. As compared to the latter, the random vibration method provides an accurate treatment of multisupport excitations, non classical damping as well as the combination of high-frequency modal components. With respect to the former, the random vibration method offers direct information on statistical variability (probability distribution) and cheaper computations. The disadvantages of the random vibration method are that it is based on stationary results, and requires a power spectral density input instead of a response spectrum. A benchmark exercise to compare the three methods from the various aspects mentioned above, on one or several simple structures has been made. The following aspects have been covered with the simplest possible models: (i) statistical variability, (ii) multisupport excitation, (iii) non-classical damping. The random vibration method is therefore concluded to be a reliable method of analysis. Its use is recommended, particularly for preliminary design, owing to its computational advantage on multiple time history analysis
Directory of Open Access Journals (Sweden)
Keqin Yan
2017-01-01
Full Text Available This chapter presents a reliability study for an offshore jacket structure with emphasis on the features of nonconventional modeling. Firstly, a random set model is formulated for modeling the random waves in an ocean site. Then, a jacket structure is investigated in a pushover analysis to identify the critical wave direction and key structural elements. This is based on the ultimate base shear strength. The selected probabilistic models are adopted for the important structural members and the wave direction is specified in the weakest direction of the structure for a conservative safety analysis. The wave height model is processed in a P-box format when it is used in the numerical analysis. The models are applied to find the bounds of the failure probabilities for the jacket structure. The propagation of this wave model to the uncertainty in results is investigated in both an interval analysis and Monte Carlo simulation. The results are compared in context of information content and numerical accuracy. Further, the failure probability bounds are compared with the conventional probabilistic approach.
Armstrong, Mark
2016-01-01
The paper discusses situations in which consumers search through their options in a deliberate order, in contrast to more familiar models with random search. Topics include: network effects (consumers may be better off following the same search order as other consumers); the use of price and non-price advertising to direct search; the impact of consumers starting a new search with their previous supplier; the incentive sellers have to merge or co-locate with other sellers; and the incentive a...
Caprarelli, G.; Orosei, R.; Mastrogiuseppe, M.; Cartacci, M.
2017-12-01
Lunae Planum is a Martian plain measuring approximately 1000 km in width and 2000 km in length, centered at coordinates 294°E-11°N. MOLA elevations range from +2500 m to +500 m in the south, gently sloping northward to -500 m. The plain is part of a belt of terrains located between the southern highlands and the northern lowlands, that are transitional in character (e.g., by elevation, age and morphology). These transitional terrains are poorly understood, in part because of their relative lack of major geomorphological features. They record however a very significant part of Mars's geologic history. The most evident features on Lunae Planum's Hesperian surface are regularly spaced, longitudinally striking, wrinkle ridges. These indicate the presence of blind thrust faults cutting through thick stacks of layers of volcanic or sedimentary rocks. The presence of fluidized ejecta craters scattered all over the region suggests also the presence of ice or volatiles in the subsurface. In a preliminary study of Lunae Planum's subsurface we used the Mars Express ground penetrating radar MARSIS dataset [1], in order to detect reflectors that could indicate the presence of fault planes or layering. Standard radargrams however, provided no evidence of changes in value of dielectric constant that could indicate possible geologic discontinuities or stratification of physically diverse materials. We thus started a new investigation based on processing of raw MARSIS data. Here we report on the preliminary results of this study. We searched the MARSIS archive for raw data stored in flash memory. When operating with flash storage, the radar collects 2 frequency bands along-track covering a distance = 100-250 km, depending on the orbiter altitude [2]. We found flash memory data from 24 orbits over the area. We processed the data focusing radar returns in off-nadir directions, to maximize the likelihood of detecting sloping subsurface structures, including those striking parallel
Search for narrow structures in pp-barπ+ and Λp-bar+- systems
International Nuclear Information System (INIS)
Chung, S.U.; Etkin, A.; Fernow, R.C.; Foley, K.J.; Goldman, J.H.; Kirk, H.; Kopp, J.; Lesnik, A.; Love, W.A.; Morris, T.W.; Ozaki, S.; Platner, E.D.; Protopopescu, S.D.; Saulys, A.; Weygand, D.P.; Wheeler, C.D.; Willen, E.H.; Winik, M.; Bensinger, J.; Morris, W.; Lindenbaum, S.J.; Kramer, M.A.; Mallik, U.; Bar-Yam, Z.; Dowd, J.; Kern, W.; Button-Shafer, J.; Dhar, S.; Lichti, R.
1981-01-01
We have performed a high-statistics search for narrow meson states (GAMMA - p interactions at 16 GeV/c and decaying into pp-barπ + or Λp-barπ +- . This is the first systematic search in channels requiring exchange of exotic mesons. The cross section for production of such states is ruled out at the 95% confidence level with upper limits ranging from approx.10 nb at 2.3 GeV to approx.40 nb at 2.8 GeV
[Modeling of a three-dimensional structure of cytochrome P-450 1A2 and search for its new ligands].
Belkina, N V; Skvortsov, V S; Ivanov, A S; Archakov, A I
1998-01-01
The substances inhibiting cytochrome P450 1A2 (CYP1A2) represent a perspective class of new drugs, which application in clinical practice can become the important part in preventive maintenance in oncology. The present work is devoted to computer modelling of 3-D structure of CYP1A2 and searching of new inhibitors by database mining. The modelling of CYP1A2 was done based on homology with 4 bacterial cytochromes P450 with known 3-D structure. For optimization of CYP1A2 active site structure the models of its complexes with characteristic substrates (caffeine and 7-ethoxyresorufin) were designed. These complexes were optimized by molecular dynamics simulation in water. The models of 24 complexes of CYP1A2 with known ligands with known Kd were designed by means of DockSearch and LeapFrog programs. 3D-QSAR model with good predictive force was created based on these complexes. On a final stage the search of knew CYP1A2 ligands in testing database (more than 23.000 substances from database Maybridge and 112 known CYP1A2 ligands from database Metabolite, MDL) was executed. 680 potential ligands of CYP1A2 with Kd values, comparable with known ones were obtained. This number has included 73 compounds from 112 known ligands, introduced in tested database as the internal control.
Embedded random matrix ensembles from nuclear structure and their recent applications
Kota, V. K. B.; Chavda, N. D.
Embedded random matrix ensembles generated by random interactions (of low body rank and usually two-body) in the presence of a one-body mean field, introduced in nuclear structure physics, are now established to be indispensable in describing statistical properties of a large number of isolated finite quantum many-particle systems. Lie algebra symmetries of the interactions, as identified from nuclear shell model and the interacting boson model, led to the introduction of a variety of embedded ensembles (EEs). These ensembles with a mean field and chaos generating two-body interaction generate in three different stages, delocalization of wave functions in the Fock space of the mean-field basis states. The last stage corresponds to what one may call thermalization and complex nuclei, as seen from many shell model calculations, lie in this region. Besides briefly describing them, their recent applications to nuclear structure are presented and they are (i) nuclear level densities with interactions; (ii) orbit occupancies; (iii) neutrinoless double beta decay nuclear transition matrix elements as transition strengths. In addition, their applications are also presented briefly that go beyond nuclear structure and they are (i) fidelity, decoherence, entanglement and thermalization in isolated finite quantum systems with interactions; (ii) quantum transport in disordered networks connected by many-body interactions with centrosymmetry; (iii) semicircle to Gaussian transition in eigenvalue densities with k-body random interactions and its relation to the Sachdev-Ye-Kitaev (SYK) model for majorana fermions.
Directory of Open Access Journals (Sweden)
Andreas Martin Lisewski
2008-09-01
Full Text Available The transmission of genomic information from coding sequence to protein structure during protein synthesis is subject to stochastic errors. To analyze transmission limits in the presence of spurious errors, Shannon's noisy channel theorem is applied to a communication channel between amino acid sequences and their structures established from a large-scale statistical analysis of protein atomic coordinates. While Shannon's theorem confirms that in close to native conformations information is transmitted with limited error probability, additional random errors in sequence (amino acid substitutions and in structure (structural defects trigger a decrease in communication capacity toward a Shannon limit at 0.010 bits per amino acid symbol at which communication breaks down. In several controls, simulated error rates above a critical threshold and models of unfolded structures always produce capacities below this limiting value. Thus an essential biological system can be realistically modeled as a digital communication channel that is (a sensitive to random errors and (b restricted by a Shannon error limit. This forms a novel basis for predictions consistent with observed rates of defective ribosomal products during protein synthesis, and with the estimated excess of mutual information in protein contact potentials.
Search for Structure in the Bs0 π± Invariant Mass Spectrum
Aaij, R.; Adeva, B.; Adinolfi, M.; Ajaltouni, Z.; Akar, S.; Albrecht, J.; Alessio, F.; Alexander, M.; Ali, S.; Alkhazov, G.; Alvarez Cartelle, P.; Alves, A. A.; Amato, S.; Amerio, S.; Amhis, Y.; Everse, LA; Anderlini, L.; Andreassi, G.; Andreotti, M.; Andrews, J.E.; Appleby, R. B.; Aquines Gutierrez, O.; Archilli, F.; d'Argent, P.; Arnau Romeu, J.; Artamonov, A.; Artuso, M.; Aslanides, E.; Auriemma, G.; Baalouch, M.; Babuschkin, I.; Bachmann, S.; Back, J. J.; Badalov, A.; Baesso, C.; Baker, S.C.; Baldini, W.; Barlow, R. J.; Barschel, C.; Barsuk, S.; Barter, W.; Batozskaya, V.; Batsukh, B.; Battista, V.; Bay, A.; Beaucourt, L.; Beddow, J.; Bedeschi, F.; Bediaga, I.; Bel, L. J.; Bellee, V.; Belloli, N.; Belous, K.; Belyaev, I.; Ben-Haim, E.; Bencivenni, G.; Benson, S.; Benton, J.; Berezhnoy, A.; Bernet, R.; Bertolin, A.; Betti, F.; Bettler, M-O.; Van Beuzekom, Martin; Bezshyiko, I.; Bifani, S.; Billoir, P.; Bird, T.D.; Birnkraut, A.; Bitadze, A.; Bizzeti, A.; Blake, T.; Blanc, F.; Blouw, J.; Blusk, S.; Bocci, V.; Boettcher, T.; Bondar, A.; Bondar, N.; Bonivento, W.; Borgheresi, A.; Borghi, S.; Borisyak, M.; Borsato, M.; Bossu, F.; Boubdir, M.; Bowcock, T. J. V.; Bowen, E.; Bozzi, C.; Braun, S.; Britsch, M.; Britton, T.; Brodzicka, J.; Buchanan, E.; Burr, C.; Bursche, A.; Buytaert, J.; Cadeddu, S.; Calabrese, R.; Calvi, M.; Calvo Gomez, M.; Camboni, A.; Campana, P.; Campora Perez, D.; Campora Perez, D. H.; Capriotti, L.; Carbone, A.; Carboni, G.; Cardinale, R.; Cardini, A.; Carniti, P.; Carson, L.; Carvalho Akiba, K.; Casse, G.; Cassina, L.; Castillo Garcia, L.; Cattaneo, M.; Cauet, Ch; Cavallero, G.; Cenci, R.; Charles, M.; Charpentier, Ph; Chatzikonstantinidis, G.; Chefdeville, M.; Chen, S.; Cheung, S-F.; Chobanova, V.; Chrzaszcz, M.; Cid Vidal, X.; Ciezarek, G.; Clarke, P. E. L.; Clemencic, M.; Cliff, H. V.; Closier, J.; Coco, V.; Cogan, J.; Cogneras, E.; Cogoni, V.; Cojocariu, L.; Collazuol, G.; Collins, P.; Comerma-Montells, A.; Contu, A.; Cook, A.; Coquereau, S.; Corti, G.; Corvo, M.; Costa Sobral, C. M.; Couturier, B.; Cowan, G. A.; Craik, D. C.; Crocombe, A.; Cruz Torres, M.; Cunliffe, S.; Currie, C.R.; D'Ambrosio, C.; Da Cunha Marinho, F.; Dall'Occo, E.; Dalseno, J.; David, P. N.Y.; Davis, A.; De Aguiar Francisco, O.; De Bruyn, K.; De Capua, S.; De Cian, M.; de Miranda, J. M.; Paula, L.E.; De Serio, M.; De Simone, P.; Dean, C-T.; Decamp, D.; Deckenhoff, M.; Del Buono, L.; Demmer, M.; Derkach, D.; Deschamps, O.; Dettori, F.; Dey, B.; Di Canto, A.; Dijkstra, H.; Dordei, F.; Dorigo, M.; Dosil Suárez, A.; Dovbnya, A.; Dreimanis, K.; Dufour, L.; Dujany, G.; Dungs, K.; Durante, P.; Dzhelyadin, R.; Dziurda, A.; Dzyuba, A.; Déléage, N.; Easo, S.; Ebert, M.; Egede, U.; Egorychev, V.; Eidelman, S.; Eisenhardt, S.; Eitschberger, U.; Ekelhof, R.; Eklund, L.; Elsasser, Ch.; Ely, S.; Esen, S.; Evans, H. M.; Evans, T. M.; Falabella, A.; Farley, N.; Farry, S.; Fay, R.; Fazzini, D.; Ferguson, D.; Fernandez Albor, V.; Fernandez Prieto, A.; Ferrari, F.; Ferreira Rodrigues, F.; Ferro-Luzzi, M.; Filippov, S.; Fini, R. A.; Fiore, M.; Fiorini, M.; Firlej, M.; Fitzpatrick, C.; Fiutowski, T.; Fleuret, F.; Fohl, K.; Fontana, Mark; Fontanelli, F.; Forshaw, D. C.; Forty, R.; Franco Lima, V.; Frank, M.; Frei, C.; Fu, J.; Furfaro, E.; Färber, C.; Gallas Torreira, A.; Galli, D.; Gallorini, S.; Gambetta, S.; Gandelman, M.; Gandini, P.; Gao, Y.; Garcia Martin, L. M.; García Pardiñas, J.; Garra Tico, J.; Garrido, L.; Garsed, P. J.; Gascon, D.; Carvalho-Gaspar, M.; Gavardi, L.; Gazzoni, G.; Gerick, D.; Gersabeck, E.; Gersabeck, M.; Gershon, T. J.; Ghez, Ph; Gianì, S.; Gibson, V.; Girard, O. G.; Giubega, L.; Gizdov, K.; Gligorov, V. V.; Golubkov, D.; Golutvin, A.; Gomes, A.Q.; Gorelov, I. V.; Gotti, C.; Grabalosa Gándara, M.; Graciani Diaz, R.; Granado Cardoso, L. A.; Graugés, E.; Graverini, E.; Graziani, G.; Grecu, A.; Griffith, P.; Grillo, L.; Gruberg Cazon, B. R.; Grünberg, O.; Gushchin, E.; Guz, Yu; Gys, T.; Göbel, C.; Hadavizadeh, T.; Hadjivasiliou, C.; Haefeli, G.; Haen, C.; Haines, S. C.; Hall, S.; Hamilton, B.; Han, X.; Hansmann-Menzemer, S.; Harnew, N.; Harnew, S. T.; Harrison, J.; Hatch, M.J.; He, J.; Head, T.; Heister, A.J.G.A.M.; Hennessy, K.; Henrard, P.; Henry, L.; Hernando Morata, J. A.; van Herwijnen, E.; Heß, M.; Hicheur, A.; Hill, D.; Hombach, C.; Hulsbergen, W.; Humair, T.; Hushchyn, M.; Hussain, N.; Hutchcroft, D. E.; Idzik, M.; Ilten, P.; Jacobsson, R.; Jaeger, A.; Jalocha, J.; Jans, E.; Jawahery, A.; Jiang, F.; John, M.; Johnson, D.; Jones, C. R.; Joram, C.; Jost, B.; Jurik, N.; Kandybei, S.; Kanso, W.; Karacson, M.; Kariuki, J. M.; Karodia, S.; Kecke, M.; Kelsey, M. H.; Kenyon, I. R.; Kenzie, M.; Ketel, T.; Khairullin, E.; Khanji, B.; Khurewathanakul, C.; Kirn, T.; Klaver, S.M.; Klimaszewski, K.; Koliiev, S.; Kolpin, M.; Komarov, I.; Koopman, R. F.; Koppenburg, P.; Kozachuk, A.; Kozeiha, M.; Kravchuk, L.; Kreplin, K.; Kreps, M.; Krokovny, P.; Kruse, F.; Krzemien, W.; Kucewicz, W.; Kucharczyk, M.; Kudryavtsev, V.; Kuonen, A. K.; Kurek, K.; Kvaratskheliya, T.; Lacarrere, D.; Lafferty, G. D.; Lai, A.; Lambert, D.M.; Lanfranchi, G.; Langenbruch, C.; Latham, T. E.; Lazzeroni, C.; Le Gac, R.; Van Leerdam, J.; Lees, J. P.; Leflat, A.; Lefrançois, J.; Lefèvre, R.; Lemaitre, F.; Lemos Cid, E.; Leroy, O.; Lesiak, T.; Leverington, B.; Li, Y.; Likhomanenko, T.; Lindner, R.; Linn, S.C.; Lionetto, F.; Liu, B.; Liu, X.; Loh, D.; Longstaff, I.; Lopes, J. H.; Lucchesi, D.; Lucio Martinez, M.; Luo, H.; Lupato, A.; Luppi, E.; Lupton, O.; Lusiani, A.; Lyu, X.; Machefert, F.; Maciuc, F.; Maev, O.; Maguire, K.; Malde, S.; Malinin, A.; Maltsev, T.; Manca, G.; Mancinelli, G.; Manning, P.; Maratas, J.; Marchand, J. F.; Marconi, U.; Marin Benito, C.; Marino, P.; Marks, J.; Martellotti, G.; Martin, M.; Martinelli-Boneschi, F.; Martinez-Santos, D.; Martinez-Vidal, F.; Martins Tostes, D.; Massacrier, L. M.; Massafferri, A.; Matev, R.; Mathad, A.; Mathe, Z.; Matteuzzi, C.; Mauri, A.; Maurin, B.; Mazurov, A.; McCann, M.; McCarthy, J.; Mcnab, A.; McNulty, R.; Meadows, B. T.; Meier, F.; Meissner, M.; Melnychuk, D.; Merk, M.; Merli, A.; Michielin, E.; Milanes, D. A.; Minard, M. N.; Mitzel, D. S.; Mogini, A.; Molina Rodriguez, J.; Monroy, I. A.; Monteil, S.; Morandin, M.; Morawski, P.; Mordà, A.; Morello, M. J.; Moron, J.; Morris, A. B.; Mountain, R.; Muheim, F.; Mulder, M.; Mussini, M.; Müller, D.; Müller, J.; Müller, Karl; von Müller, L.; Naik, P.; Nakada, T.; Nandakumar, R.; Nandi, A.; Nasteva, I.; Needham, M.; Neri, N.; Neubert, S.; Neufeld, N.; Neuner, M.; Nguyen, A. D.; Nguyen-Mau, C.; Nieswand, S.; Niet, R.; Nikitin, N.; Nikodem, T.; Novoselov, A.; O'Hanlon, D. P.; Oblakowska-Mucha, A.; Obraztsov, V.; Ogilvy, S.; Oldeman, R.; Onderwater, C. J.G.; Otalora Goicochea, J. M.; Otto, E.A.; Owen, R.P.; Oyanguren, A.; Pais, P. R.; Palano, A.; Palombo, F.; Palutan, M.; Panman, J.; Papanestis, A.; Pappagallo, M.; Pappalardo, L.L.; Parker, W.S; Parkes, C.; Passaleva, G.; Pastore, A.; Patel, G. D.; Patel, M.; Patrignani, C.; Pearce, D.A.; Pellegrino, A.; Penso, G.; Pepe Altarelli, M.; Perazzini, S.; Perret, P.; Pescatore, L.; Petridis, K.; Petrolini, A.; Petrov, A.; Petruzzo, M.; Picatoste Olloqui, E.; Pietrzyk, B.; Pikies, M.; Pinci, D.; Pistone, A.; Piucci, A.; Playfer, S.; Plo Casasus, M.; Poikela, T.; Polci, F.; Poluektov, A.; Polyakov, I.; Polycarpo, E.; Pomery, G. J.; Popov, A.; Popov, D.; Popovici, B.; Poslavskii, S.; Potterat, C.; Price, M. E.; Price, J.D.; Prisciandaro, J.; Pritchard, C.A.; Prouve, C.; Pugatch, V.; Puig Navarro, A.; Punzi, G.; Qian, Y.W.; Quagliani, R.; Rachwal, B.; Rademacker, J. H.; Rama, M.; Ramos Pernas, M.; Rangel, M. S.; Raniuk, I.; Raven, G.; Redi, F.; Reichert, S.; dos Reis, A. C.; Remon Alepuz, C.; Renaudin, V.; Ricciardi, S.; Richards, Jennifer S; Rihl, M.; Rinnert, K.; Rives Molina, V.; Robbe, P.; Rodrigues, A. B.; Rodrigues, L.E.T.; Rodriguez Lopez, J. A.; Rodriguez Perez, P.; Rogozhnikov, A.; Roiser, S.; Romanovskiy, V.; Romero Vidal, A.; Ronayne, J. W.; Rotondo, M.; Rudolph, M. S.; Ruf, T.; Ruiz Valls, P.; Saborido Silva, J. J.; Sadykhov, E.; Sagidova, N.; Saitta, B.; Salustino Guimaraes, V.; Sanchez Mayordomo, C.; Sanmartin Sedes, B.; Santacesaria, R.; Santamarina Rios, C.; Santimaria, M.; Santovetti, E.; Sarti, A.; Satriano, C.; Satta, A.; Saunders, D. M.; Savrina, D.; Schael, S.; Schellenberg, M.; Schiller, M.; Schindler, R. H.; Schlupp, M.; Schmelling, M.; Schmelzer, T.; Schmidt, B.; Schneider, O.; Schopper, A.; Schubert, K.; Schubiger, M.; Schune, M. H.; Schwemmer, R.; Sciascia, B.; Sciubba, A.; Semennikov, A.; Sergi, A; Serra, N.; Serrano, J.; Sestini, L.; Seyfert, P.; Shapkin, M.; Shapoval, I.; Shcheglov, Y.; Shears, T.; Shekhtman, L.; Shevchenko, V.; Shires, A.; Siddi, B. G.; Silva Coutinho, R.; Silva de Oliveira, L.; Simi, G.; Simone, S.; Sirendi, M.; Skidmore, N.; Skwarnicki, T.; Smith, E.; Smith, I. T.; Smith, J; Smith, M.; Snoek, H.; Sokoloff, M. D.; Soler, F. J. P.; Souza De Paula, B.; Spaan, B.; Spradlin, P.; Sridharan, S.; Stagni, F.; Stahl, M.; Stahl, S.; Stefko, P.; Stefkova, S.; Steinkamp, O.; Stemmle, S.; Stenyakin, O.; Stevenson-Moore, P.; Stoica, S.; Stone, S.; Storaci, B.; Stracka, S.; Straticiuc, M.; Straumann, U.; Sun, L.; Sutcliffe, W.; Swientek, K.; Syropoulos, V.; Szczekowski, M.; Szumlak, T.; T'Jampens, S.; Tayduganov, A.; Tekampe, T.; Tellarini, G.; Teubert, F.; Thomas, E.; Van Tilburg, J.; Tilley, M. J.; Tisserand, V.; Tobin, M. N.; Tolk, S.; Tomassetti, L.; Tonelli, D.; Topp-Joergensen, S.; Toriello, F.; Tournefier, E.; Tourneur, S.; Trabelsi, K.; Traill, M.; Tran, N.T.M.T.; Tresch, M.; Trisovic, A.; Tsaregorodtsev, A.; Tsopelas, P.; Tully, M.A.; Tuning, N.; Ukleja, A.; Ustyuzhanin, A.; Uwer, U.; Vacca, C.; Vagnoni, V.; Valat, S.; Valenti, G.; Vallier, A.; Vazquez Gomez, R.; Vazquez Regueiro, P.; Vecchi, S.; van Veghel-Plandsoen, M.M.; Velthuis, M.J.; Veltri, M.; Veneziano, G.; Venkateswaran, A.; Vernet, M.; Vesterinen, M.; Viaud, B.; Vieira, D.; Vieites Diaz, M.; Vilasis-Cardona, X.; Volkov, V.; Vollhardt, A.; Voneki, B.; Voong, D.; Vorobyev, A.; Vorobyev, V.; Voß, C.; De Vries, J. A.; Vázquez Sierra, C.; Waldi, R.; Wallace, C.; Wallace, R.; Walsh, John; Wang, J.; Ward, D. R.; Wark, H. M.; Watson, N. K.; Websdale, D.; Weiden, A.; Whitehead, M.; Wicht, J.; Wilkinson, G.; Wilkinson, M.; Williams, M.; Williams, M.P.; Williams, M.; Williams, T.; Wilson, James F; Wimberley, J.; Wishahi, J.; Wislicki, W.; Witek, M.; Wormser, G.; Wotton, S. A.; Wraight, K.; Wright, S.J.; Wyllie, K.; Xie, Y.; Xing, Z.; Xu, Z.; Yang, Z.; Yin, H; Yu, J.; Yuan, X.; Yushchenko, O.; Zarebski, K. A.; Zavertyaev, M.; Zhang, L.; Zhang, Y.; Zhang, Y.; Zhelezov, A.; Zheng, Y.; Zhokhov, A.; Zhu, X.; Zhukov, V.; Zucchelli, S.
2016-01-01
The Bs0π± invariant mass distribution is investigated in order to search for possible exotic meson states. The analysis is based on a data sample recorded with the LHCb detector corresponding to 3 fb-1 of pp collision data at s=7 and 8 TeV. No significant excess is found, and upper limits are set on
Brain structures involved in visual search in the presence and absence of color singletons
Talsma, D.; Coe, N.B.; Munoz, D.P.; Theeuwes, J.
2010-01-01
It is still debated to what degree top-down and bottom-up driven attentional control processes are subserved by shared or by separate mechanisms. Interactions between these attentional control forms were investigated using a rapid event-related fMRI design, using an attentional search task.
Random vibration sensitivity studies of modeling uncertainties in the NIF structures
International Nuclear Information System (INIS)
Swensen, E.A.; Farrar, C.R.; Barron, A.A.; Cornwell, P.
1996-01-01
The National Ignition Facility is a laser fusion project that will provide an above-ground experimental capability for nuclear weapons effects simulation. This facility will achieve fusion ignition utilizing solid-state lasers as the energy driver. The facility will cover an estimated 33,400 m 2 at an average height of 5--6 stories. Within this complex, a number of beam transport structures will be houses that will deliver the laser beams to the target area within a 50 microm ms radius of the target center. The beam transport structures are approximately 23 m long and reach approximately heights of 2--3 stories. Low-level ambient random vibrations are one of the primary concerns currently controlling the design of these structures. Low level ambient vibrations, 10 -10 g 2 /Hz over a frequency range of 1 to 200 Hz, are assumed to be present during all facility operations. Each structure described in this paper will be required to achieve and maintain 0.6 microrad ms laser beam pointing stability for a minimum of 2 hours under these vibration levels. To date, finite element (FE) analysis has been performed on a number of the beam transport structures. Certain assumptions have to be made regarding structural uncertainties in the FE models. These uncertainties consist of damping values for concrete and steel, compliance within bolted and welded joints, and assumptions regarding the phase coherence of ground motion components. In this paper, the influence of these structural uncertainties on the predicted pointing stability of the beam line transport structures as determined by random vibration analysis will be discussed
Damage Detection in Bridge Structure Using Vibration Data under Random Travelling Vehicle Loads
International Nuclear Information System (INIS)
Loh, C H; Hung, T Y; Chen, S F; Hsu, W T
2015-01-01
Due to the random nature of the road excitation and the inherent uncertainties in bridge-vehicle system, damage identification of bridge structure through continuous monitoring under operating situation become a challenge problem. Methods for system identification and damage detection of a continuous two-span concrete bridge structure in time domain is presented using interaction forces from random moving vehicles as excitation. The signals recorded in different locations of the instrumented bridge are mixed with signals from different internal and external (road roughness) vibration sources. The damage structure is also modelled as the stiffness reduction in one of the beam element. For the purpose of system identification and damage detection three different output-only modal analysis techniques are proposed: The covariance-driven stochastic subspace identification (SSI-COV), the blind source separation algorithms (called Second Order Blind Identification) and the multivariate AR model. The advantages and disadvantages of the three algorithms are discussed. Finally, the null-space damage index, subspace damage indices and mode shape slope change are used to detect and locate the damage. The proposed approaches has been tested in simulation and proved to be effective for structural health monitoring. (paper)
Mean first passage time for random walk on dual structure of dendrimer
Li, Ling; Guan, Jihong; Zhou, Shuigeng
2014-12-01
The random walk approach has recently been widely employed to study the relations between the underlying structure and dynamic of complex systems. The mean first-passage time (MFPT) for random walks is a key index to evaluate the transport efficiency in a given system. In this paper we study analytically the MFPT in a dual structure of dendrimer network, Husimi cactus, which has different application background and different structure (contains loops) from dendrimer. By making use of the iterative construction, we explicitly determine both the partial mean first-passage time (PMFT, the average of MFPTs to a given target) and the global mean first-passage time (GMFT, the average of MFPTs over all couples of nodes) on Husimi cactus. The obtained closed-form results show that PMFPT and EMFPT follow different scaling with the network order, suggesting that the target location has essential influence on the transport efficiency. Finally, the impact that loop structure could bring is analyzed and discussed.
A special covariance structure for random coefficient models with both between and within covariates
International Nuclear Information System (INIS)
Riedel, K.S.
1990-07-01
We review random coefficient (RC) models in linear regression and propose a bias correction to the maximum likelihood (ML) estimator. Asymmptotic expansion of the ML equations are given when the between individual variance is much larger or smaller than the variance from within individual fluctuations. The standard model assumes all but one covariate varies within each individual, (we denote the within covariates by vector χ 1 ). We consider random coefficient models where some of the covariates do not vary in any single individual (we denote the between covariates by vector χ 0 ). The regression coefficients, vector β k , can only be estimated in the subspace X k of X. Thus the number of individuals necessary to estimate vector β and the covariance matrix Δ of vector β increases significantly in the presence of more than one between covariate. When the number of individuals is sufficient to estimate vector β but not the entire matrix Δ , additional assumptions must be imposed on the structure of Δ. A simple reduced model is that the between component of vector β is fixed and only the within component varies randomly. This model fails because it is not invariant under linear coordinate transformations and it can significantly overestimate the variance of new observations. We propose a covariance structure for Δ without these difficulties by first projecting the within covariates onto the space perpendicular to be between covariates. (orig.)
Multilevel covariance regression with correlated random effects in the mean and variance structure.
Quintero, Adrian; Lesaffre, Emmanuel
2017-09-01
Multivariate regression methods generally assume a constant covariance matrix for the observations. In case a heteroscedastic model is needed, the parametric and nonparametric covariance regression approaches can be restrictive in the literature. We propose a multilevel regression model for the mean and covariance structure, including random intercepts in both components and allowing for correlation between them. The implied conditional covariance function can be different across clusters as a result of the random effect in the variance structure. In addition, allowing for correlation between the random intercepts in the mean and covariance makes the model convenient for skewedly distributed responses. Furthermore, it permits us to analyse directly the relation between the mean response level and the variability in each cluster. Parameter estimation is carried out via Gibbs sampling. We compare the performance of our model to other covariance modelling approaches in a simulation study. Finally, the proposed model is applied to the RN4CAST dataset to identify the variables that impact burnout of nurses in Belgium. © 2017 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Jeong, Chan-Seok; Kim, Dongsup
2016-02-24
Elucidating the cooperative mechanism of interconnected residues is an important component toward understanding the biological function of a protein. Coevolution analysis has been developed to model the coevolutionary information reflecting structural and functional constraints. Recently, several methods have been developed based on a probabilistic graphical model called the Markov random field (MRF), which have led to significant improvements for coevolution analysis; however, thus far, the performance of these models has mainly been assessed by focusing on the aspect of protein structure. In this study, we built an MRF model whose graphical topology is determined by the residue proximity in the protein structure, and derived a novel positional coevolution estimate utilizing the node weight of the MRF model. This structure-based MRF method was evaluated for three data sets, each of which annotates catalytic site, allosteric site, and comprehensively determined functional site information. We demonstrate that the structure-based MRF architecture can encode the evolutionary information associated with biological function. Furthermore, we show that the node weight can more accurately represent positional coevolution information compared to the edge weight. Lastly, we demonstrate that the structure-based MRF model can be reliably built with only a few aligned sequences in linear time. The results show that adoption of a structure-based architecture could be an acceptable approximation for coevolution modeling with efficient computation complexity.
Li, Xiayue; Curtis, Farren S.; Rose, Timothy; Schober, Christoph; Vazquez-Mayagoitia, Alvaro; Reuter, Karsten; Oberhofer, Harald; Marom, Noa
2018-06-01
We present Genarris, a Python package that performs configuration space screening for molecular crystals of rigid molecules by random sampling with physical constraints. For fast energy evaluations, Genarris employs a Harris approximation, whereby the total density of a molecular crystal is constructed via superposition of single molecule densities. Dispersion-inclusive density functional theory is then used for the Harris density without performing a self-consistency cycle. Genarris uses machine learning for clustering, based on a relative coordinate descriptor developed specifically for molecular crystals, which is shown to be robust in identifying packing motif similarity. In addition to random structure generation, Genarris offers three workflows based on different sequences of successive clustering and selection steps: the "Rigorous" workflow is an exhaustive exploration of the potential energy landscape, the "Energy" workflow produces a set of low energy structures, and the "Diverse" workflow produces a maximally diverse set of structures. The latter is recommended for generating initial populations for genetic algorithms. Here, the implementation of Genarris is reported and its application is demonstrated for three test cases.
Zhang, Yulong; Wang, Tianyang; Zhang, Ai; Peng, Zhuoteng; Luo, Dan; Chen, Rui; Wang, Fei
2016-12-01
In this paper, we present design and test of a broadband electrostatic energy harvester with a dual resonant structure, which consists of two cantilever-mass subsystems each with a mass attached at the free edge of a cantilever. Comparing to traditional devices with single resonant frequency, the proposed device with dual resonant structure can resonate at two frequencies. Furthermore, when one of the cantilever-masses is oscillating at resonance, the vibration amplitude is large enough to make it collide with the other mass, which provides strong mechanical coupling between the two subsystems. Therefore, this device can harvest a decent power output from vibration sources at a broad frequency range. During the measurement, continuous power output up to 6.2-9.8 μW can be achieved under external vibration amplitude of 9.3 m/s 2 at a frequency range from 36.3 Hz to 48.3 Hz, which means the bandwidth of the device is about 30% of the central frequency. The broad bandwidth of the device provides a promising application for energy harvesting from the scenarios with random vibration sources. The experimental results indicate that with the dual resonant structure, the vibration-to-electricity energy conversion efficiency can be improved by 97% when an external random vibration with a low frequency filter is applied.
International Nuclear Information System (INIS)
Deo, Omkar; Neithalath, Narayanan
2010-01-01
Research highlights: → Identified the relevant pore structure features of pervious concretes, provided methodologies to extract those, and quantified the influence of these features on compressive response. → A model for stress-strain relationship of pervious concretes, and relationship between model parameters and parameters of the stress-strain relationship developed. → Statistical model for compressive strength as a function of pore structure features; and a stochastic model for the sensitivity of pore structure features in strength prediction. - Abstract: Properties of a random porous material such as pervious concrete are strongly dependent on its pore structure features, porosity being an important one among them. This study deals with developing an understanding of the material structure-compressive response relationships in pervious concretes. Several pervious concrete mixtures with different pore structure features are proportioned and subjected to static compression tests. The pore structure features such as pore area fractions, pore sizes, mean free spacing of the pores, specific surface area, and the three-dimensional pore distribution density are extracted using image analysis methods. The compressive stress-strain response of pervious concretes, a model to predict the stress-strain response, and its relationship to several of the pore structure features are outlined. Larger aggregate sizes and increase in paste volume fractions are observed to result in increased compressive strengths. The compressive response is found to be influenced by the pore sizes, their distributions and spacing. A statistical model is used to relate the compressive strength to the relevant pore structure features, which is then used as a base model in a Monte-Carlo simulation to evaluate the sensitivity of the predicted compressive strength to the model terms.
International Nuclear Information System (INIS)
Derrida, B.; Flyvbjerg, H.
1987-02-01
The statistical properties of the multivalley structure of disordered systems and of randomly broken objects have lots of features in common. For all these problems, if W s denotes the weight of the s th piece, we show that the probability distributions P 1 (W 1 ) of the largest piece W 1 , P 2 (W 2 ) of the second largest piece, and Π(Y) of Y = Σ s W s 2 have always singularities at W 1 = 1/n, W 2 = 1/n and Y = 1/n, n = 1, 2, 3,... (orig.)
DEFF Research Database (Denmark)
Nielsen, Søren R.K.; Sørensen, John Dalsgaard; Thoft-Christensen, Palle
1983-01-01
plastic deformation during several loadings can be modelled as a filtered Poisson process. Using the Markov property of this quantity the considered first-passage problem as well as the related extreme distribution problems are then solved numerically, and the results are compared to simulation studies.......A method is presented for life-time reliability' estimates of randomly excited yielding systems, assuming the structure to be safe, when the plastic deformations are confined below certain limits. The accumulated plastic deformations during any single significant loading history are considered...
Directory of Open Access Journals (Sweden)
K. Rahmani
2018-05-01
Full Text Available In this paper we present a pipeline for high quality semantic segmentation of building facades using Structured Random Forest (SRF, Region Proposal Network (RPN based on a Convolutional Neural Network (CNN as well as rectangular fitting optimization. Our main contribution is that we employ features created by the RPN as channels in the SRF.We empirically show that this is very effective especially for doors and windows. Our pipeline is evaluated on two datasets where we outperform current state-of-the-art methods. Additionally, we quantify the contribution of the RPN and the rectangular fitting optimization on the accuracy of the result.
Searching for new thermoelectrics in chemically and structurally complex bismuth chalcogenides
Energy Technology Data Exchange (ETDEWEB)
Chung, D Y; Hogan, T; Schindler, J; Iordanidis, L; Brazis, P; Kannewurf, C R; Chen, B; Uher, C; Kanatzidis, M G
1997-07-01
A solid state chemistry synthetic approach towards identifying new materials with potentially superior thermoelectric properties is presented. Materials with complex compositions and structures also have complex electronic structures which may give rise to high thermoelectric powers and at the same time possess low thermal conductivities. The structures and thermoelectric properties of several new promising compounds with K-Bi-Se, K-Bi-S, Ba-Bi-Te, Cs-Bi-Te, and Rb-bi-Te are reported.
Lauterbach, S.; Fina, M.; Wagner, W.
2018-04-01
Since structural engineering requires highly developed and optimized structures, the thickness dependency is one of the most controversially debated topics. This paper deals with stability analysis of lightweight thin structures combined with arbitrary geometrical imperfections. Generally known design guidelines only consider imperfections for simple shapes and loading, whereas for complex structures the lower-bound design philosophy still holds. Herein, uncertainties are considered with an empirical knockdown factor representing a lower bound of existing measurements. To fully understand and predict expected bearable loads, numerical investigations are essential, including geometrical imperfections. These are implemented into a stand-alone program code with a stochastic approach to compute random fields as geometric imperfections that are applied to nodes of the finite element mesh of selected structural examples. The stochastic approach uses the Karhunen-Loève expansion for the random field discretization. For this approach, the so-called correlation length l_c controls the random field in a powerful way. This parameter has a major influence on the buckling shape, and also on the stability load. First, the impact of the correlation length is studied for simple structures. Second, since most structures for engineering devices are more complex and combined structures, these are intensively discussed with the focus on constrained random fields for e.g. flange-web-intersections. Specific constraints for those random fields are pointed out with regard to the finite element model. Further, geometrical imperfections vanish where the structure is supported.
DEFF Research Database (Denmark)
Lykke, Marianne; Price, Susan; Delcambre, Lois
2012-01-01
Professional, workplace searching is different from general searching, because it is typically limited to specific facets and targeted to a single answer. We have developed the semantic component (SC) model, which is a search feature that allows searchers to structure and specify the search to co...
Uniform Recovery Bounds for Structured Random Matrices in Corrupted Compressed Sensing
Zhang, Peng; Gan, Lu; Ling, Cong; Sun, Sumei
2018-04-01
We study the problem of recovering an $s$-sparse signal $\\mathbf{x}^{\\star}\\in\\mathbb{C}^n$ from corrupted measurements $\\mathbf{y} = \\mathbf{A}\\mathbf{x}^{\\star}+\\mathbf{z}^{\\star}+\\mathbf{w}$, where $\\mathbf{z}^{\\star}\\in\\mathbb{C}^m$ is a $k$-sparse corruption vector whose nonzero entries may be arbitrarily large and $\\mathbf{w}\\in\\mathbb{C}^m$ is a dense noise with bounded energy. The aim is to exactly and stably recover the sparse signal with tractable optimization programs. In this paper, we prove the uniform recovery guarantee of this problem for two classes of structured sensing matrices. The first class can be expressed as the product of a unit-norm tight frame (UTF), a random diagonal matrix and a bounded columnwise orthonormal matrix (e.g., partial random circulant matrix). When the UTF is bounded (i.e. $\\mu(\\mathbf{U})\\sim1/\\sqrt{m}$), we prove that with high probability, one can recover an $s$-sparse signal exactly and stably by $l_1$ minimization programs even if the measurements are corrupted by a sparse vector, provided $m = \\mathcal{O}(s \\log^2 s \\log^2 n)$ and the sparsity level $k$ of the corruption is a constant fraction of the total number of measurements. The second class considers randomly sub-sampled orthogonal matrix (e.g., random Fourier matrix). We prove the uniform recovery guarantee provided that the corruption is sparse on certain sparsifying domain. Numerous simulation results are also presented to verify and complement the theoretical results.
Document page structure learning for fixed-layout e-books using conditional random fields
Tao, Xin; Tang, Zhi; Xu, Canhui
2013-12-01
In this paper, a model is proposed to learn logical structure of fixed-layout document pages by combining support vector machine (SVM) and conditional random fields (CRF). Features related to each logical label and their dependencies are extracted from various original Portable Document Format (PDF) attributes. Both local evidence and contextual dependencies are integrated in the proposed model so as to achieve better logical labeling performance. With the merits of SVM as local discriminative classifier and CRF modeling contextual correlations of adjacent fragments, it is capable of resolving the ambiguities of semantic labels. The experimental results show that CRF based models with both tree and chain graph structures outperform the SVM model with an increase of macro-averaged F1 by about 10%.
Thermodynamics and structure of liquid metals from a consistent optimized random phase approximation
International Nuclear Information System (INIS)
Akinlade, O.; Badirkhan, Z.; Pastore, G.
2000-05-01
We study thermodynamics and structural properties of several liquid metals to assess the validity of the generalized non-local model potential (GNMP) of Li et. al. [J.Phys. F16,309 (1986)]. By using a new thermodynamically consistent version of the optimized random phase approximation (ORPA), especially adapted to continuous reference potentials, we improve our previous results obtained within the variational approach based on the Gibbs - Bogoliubov inequality. Hinging on the unified and very accurate evaluation of structure factors and thermodynamic quantities provided by the ORPA, we find that the GNMP yields satisfactory results for the alkali metals, however, those for the polyvalent metals point to a substantial inadequacy of the GNMP for high valence systems. (author)
Livan, Giacomo; Alfarano, Simone; Scalas, Enrico
2011-07-01
We study some properties of eigenvalue spectra of financial correlation matrices. In particular, we investigate the nature of the large eigenvalue bulks which are observed empirically, and which have often been regarded as a consequence of the supposedly large amount of noise contained in financial data. We challenge this common knowledge by acting on the empirical correlation matrices of two data sets with a filtering procedure which highlights some of the cluster structure they contain, and we analyze the consequences of such filtering on eigenvalue spectra. We show that empirically observed eigenvalue bulks emerge as superpositions of smaller structures, which in turn emerge as a consequence of cross correlations between stocks. We interpret and corroborate these findings in terms of factor models, and we compare empirical spectra to those predicted by random matrix theory for such models.
DEFF Research Database (Denmark)
Holst, René; Jørgensen, Bent
2015-01-01
The paper proposes a versatile class of multiplicative generalized linear longitudinal mixed models (GLLMM) with additive dispersion components, based on explicit modelling of the covariance structure. The class incorporates a longitudinal structure into the random effects models and retains...... a marginal as well as a conditional interpretation. The estimation procedure is based on a computationally efficient quasi-score method for the regression parameters combined with a REML-like bias-corrected Pearson estimating function for the dispersion and correlation parameters. This avoids...... the multidimensional integral of the conventional GLMM likelihood and allows an extension of the robust empirical sandwich estimator for use with both association and regression parameters. The method is applied to a set of otholit data, used for age determination of fish....
Livan, Giacomo; Alfarano, Simone; Scalas, Enrico
2011-07-01
We study some properties of eigenvalue spectra of financial correlation matrices. In particular, we investigate the nature of the large eigenvalue bulks which are observed empirically, and which have often been regarded as a consequence of the supposedly large amount of noise contained in financial data. We challenge this common knowledge by acting on the empirical correlation matrices of two data sets with a filtering procedure which highlights some of the cluster structure they contain, and we analyze the consequences of such filtering on eigenvalue spectra. We show that empirically observed eigenvalue bulks emerge as superpositions of smaller structures, which in turn emerge as a consequence of cross correlations between stocks. We interpret and corroborate these findings in terms of factor models, and we compare empirical spectra to those predicted by random matrix theory for such models.
Improving the chances of successful protein structure determination with a random forest classifier
Energy Technology Data Exchange (ETDEWEB)
Jahandideh, Samad [Sanford-Burnham Medical Research Institute, 10901 North Torrey Pines Road, La Jolla, CA 92307 (United States); Joint Center for Structural Genomics, (United States); Jaroszewski, Lukasz; Godzik, Adam, E-mail: adam@burnham.org [Sanford-Burnham Medical Research Institute, 10901 North Torrey Pines Road, La Jolla, CA 92307 (United States); Joint Center for Structural Genomics, (United States); University of California, San Diego, La Jolla, California (United States)
2014-03-01
Using an extended set of protein features calculated separately for protein surface and interior, a new version of XtalPred based on a random forest classifier achieves a significant improvement in predicting the success of structure determination from the primary amino-acid sequence. Obtaining diffraction quality crystals remains one of the major bottlenecks in structural biology. The ability to predict the chances of crystallization from the amino-acid sequence of the protein can, at least partly, address this problem by allowing a crystallographer to select homologs that are more likely to succeed and/or to modify the sequence of the target to avoid features that are detrimental to successful crystallization. In 2007, the now widely used XtalPred algorithm [Slabinski et al. (2007 ▶), Protein Sci.16, 2472–2482] was developed. XtalPred classifies proteins into five ‘crystallization classes’ based on a simple statistical analysis of the physicochemical features of a protein. Here, towards the same goal, advanced machine-learning methods are applied and, in addition, the predictive potential of additional protein features such as predicted surface ruggedness, hydrophobicity, side-chain entropy of surface residues and amino-acid composition of the predicted protein surface are tested. The new XtalPred-RF (random forest) achieves significant improvement of the prediction of crystallization success over the original XtalPred. To illustrate this, XtalPred-RF was tested by revisiting target selection from 271 Pfam families targeted by the Joint Center for Structural Genomics (JCSG) in PSI-2, and it was estimated that the number of targets entered into the protein-production and crystallization pipeline could have been reduced by 30% without lowering the number of families for which the first structures were solved. The prediction improvement depends on the subset of targets used as a testing set and reaches 100% (i.e. twofold) for the top class of predicted
Lee, Sun-Ho; Lee, Im-Yeong
2014-01-01
Data outsourcing services have emerged with the increasing use of digital information. They can be used to store data from various devices via networks that are easy to access. Unlike existing removable storage systems, storage outsourcing is available to many users because it has no storage limit and does not require a local storage medium. However, the reliability of storage outsourcing has become an important topic because many users employ it to store large volumes of data. To protect against unethical administrators and attackers, a variety of cryptography systems are used, such as searchable encryption and proxy reencryption. However, existing searchable encryption technology is inconvenient for use in storage outsourcing environments where users upload their data to be shared with others as necessary. In addition, some existing schemes are vulnerable to collusion attacks and have computing cost inefficiencies. In this paper, we analyze existing proxy re-encryption with keyword search.
Search for Structure in the B_{s}^{0}π^{±} Invariant Mass Spectrum.
Aaij, R; Adeva, B; Adinolfi, M; Ajaltouni, Z; Akar, S; Albrecht, J; Alessio, F; Alexander, M; Ali, S; Alkhazov, G; Alvarez Cartelle, P; Alves, A A; Amato, S; Amerio, S; Amhis, Y; An, L; Anderlini, L; Andreassi, G; Andreotti, M; Andrews, J E; Appleby, R B; Aquines Gutierrez, O; Archilli, F; d'Argent, P; Arnau Romeu, J; Artamonov, A; Artuso, M; Aslanides, E; Auriemma, G; Baalouch, M; Babuschkin, I; Bachmann, S; Back, J J; Badalov, A; Baesso, C; Baker, S; Baldini, W; Barlow, R J; Barschel, C; Barsuk, S; Barter, W; Batozskaya, V; Batsukh, B; Battista, V; Bay, A; Beaucourt, L; Beddow, J; Bedeschi, F; Bediaga, I; Bel, L J; Bellee, V; Belloli, N; Belous, K; Belyaev, I; Ben-Haim, E; Bencivenni, G; Benson, S; Benton, J; Berezhnoy, A; Bernet, R; Bertolin, A; Betti, F; Bettler, M-O; van Beuzekom, M; Bezshyiko, I; Bifani, S; Billoir, P; Bird, T; Birnkraut, A; Bitadze, A; Bizzeti, A; Blake, T; Blanc, F; Blouw, J; Blusk, S; Bocci, V; Boettcher, T; Bondar, A; Bondar, N; Bonivento, W; Borgheresi, A; Borghi, S; Borisyak, M; Borsato, M; Bossu, F; Boubdir, M; Bowcock, T J V; Bowen, E; Bozzi, C; Braun, S; Britsch, M; Britton, T; Brodzicka, J; Buchanan, E; Burr, C; Bursche, A; Buytaert, J; Cadeddu, S; Calabrese, R; Calvi, M; Calvo Gomez, M; Camboni, A; Campana, P; Campora Perez, D; Campora Perez, D H; Capriotti, L; Carbone, A; Carboni, G; Cardinale, R; Cardini, A; Carniti, P; Carson, L; Carvalho Akiba, K; Casse, G; Cassina, L; Castillo Garcia, L; Cattaneo, M; Cauet, Ch; Cavallero, G; Cenci, R; Charles, M; Charpentier, Ph; Chatzikonstantinidis, G; Chefdeville, M; Chen, S; Cheung, S-F; Chobanova, V; Chrzaszcz, M; Cid Vidal, X; Ciezarek, G; Clarke, P E L; Clemencic, M; Cliff, H V; Closier, J; Coco, V; Cogan, J; Cogneras, E; Cogoni, V; Cojocariu, L; Collazuol, G; Collins, P; Comerma-Montells, A; Contu, A; Cook, A; Coquereau, S; Corti, G; Corvo, M; Costa Sobral, C M; Couturier, B; Cowan, G A; Craik, D C; Crocombe, A; Cruz Torres, M; Cunliffe, S; Currie, R; D'Ambrosio, C; Da Cunha Marinho, F; Dall'Occo, E; Dalseno, J; David, P N Y; Davis, A; De Aguiar Francisco, O; De Bruyn, K; De Capua, S; De Cian, M; De Miranda, J M; De Paula, L; De Serio, M; De Simone, P; Dean, C-T; Decamp, D; Deckenhoff, M; Del Buono, L; Demmer, M; Derkach, D; Deschamps, O; Dettori, F; Dey, B; Di Canto, A; Dijkstra, H; Dordei, F; Dorigo, M; Dosil Suárez, A; Dovbnya, A; Dreimanis, K; Dufour, L; Dujany, G; Dungs, K; Durante, P; Dzhelyadin, R; Dziurda, A; Dzyuba, A; Déléage, N; Easo, S; Ebert, M; Egede, U; Egorychev, V; Eidelman, S; Eisenhardt, S; Eitschberger, U; Ekelhof, R; Eklund, L; Elsasser, Ch; Ely, S; Esen, S; Evans, H M; Evans, T; Falabella, A; Farley, N; Farry, S; Fay, R; Fazzini, D; Ferguson, D; Fernandez Albor, V; Fernandez Prieto, A; Ferrari, F; Ferreira Rodrigues, F; Ferro-Luzzi, M; Filippov, S; Fini, R A; Fiore, M; Fiorini, M; Firlej, M; Fitzpatrick, C; Fiutowski, T; Fleuret, F; Fohl, K; Fontana, M; Fontanelli, F; Forshaw, D C; Forty, R; Franco Lima, V; Frank, M; Frei, C; Fu, J; Furfaro, E; Färber, C; Gallas Torreira, A; Galli, D; Gallorini, S; Gambetta, S; Gandelman, M; Gandini, P; Gao, Y; Garcia Martin, L M; García Pardiñas, J; Garra Tico, J; Garrido, L; Garsed, P J; Gascon, D; Gaspar, C; Gavardi, L; Gazzoni, G; Gerick, D; Gersabeck, E; Gersabeck, M; Gershon, T; Ghez, Ph; Gianì, S; Gibson, V; Girard, O G; Giubega, L; Gizdov, K; Gligorov, V V; Golubkov, D; Golutvin, A; Gomes, A; Gorelov, I V; Gotti, C; Grabalosa Gándara, M; Graciani Diaz, R; Granado Cardoso, L A; Graugés, E; Graverini, E; Graziani, G; Grecu, A; Griffith, P; Grillo, L; Gruberg Cazon, B R; Grünberg, O; Gushchin, E; Guz, Yu; Gys, T; Göbel, C; Hadavizadeh, T; Hadjivasiliou, C; Haefeli, G; Haen, C; Haines, S C; Hall, S; Hamilton, B; Han, X; Hansmann-Menzemer, S; Harnew, N; Harnew, S T; Harrison, J; Hatch, M; He, J; Head, T; Heister, A; Hennessy, K; Henrard, P; Henry, L; Hernando Morata, J A; van Herwijnen, E; Heß, M; Hicheur, A; Hill, D; Hombach, C; Hulsbergen, W; Humair, T; Hushchyn, M; Hussain, N; Hutchcroft, D; Idzik, M; Ilten, P; Jacobsson, R; Jaeger, A; Jalocha, J; Jans, E; Jawahery, A; Jiang, F; John, M; Johnson, D; Jones, C R; Joram, C; Jost, B; Jurik, N; Kandybei, S; Kanso, W; Karacson, M; Kariuki, J M; Karodia, S; Kecke, M; Kelsey, M; Kenyon, I R; Kenzie, M; Ketel, T; Khairullin, E; Khanji, B; Khurewathanakul, C; Kirn, T; Klaver, S; Klimaszewski, K; Koliiev, S; Kolpin, M; Komarov, I; Koopman, R F; Koppenburg, P; Kozachuk, A; Kozeiha, M; Kravchuk, L; Kreplin, K; Kreps, M; Krokovny, P; Kruse, F; Krzemien, W; Kucewicz, W; Kucharczyk, M; Kudryavtsev, V; Kuonen, A K; Kurek, K; Kvaratskheliya, T; Lacarrere, D; Lafferty, G; Lai, A; Lambert, D; Lanfranchi, G; Langenbruch, C; Latham, T; Lazzeroni, C; Le Gac, R; van Leerdam, J; Lees, J-P; Leflat, A; Lefrançois, J; Lefèvre, R; Lemaitre, F; Lemos Cid, E; Leroy, O; Lesiak, T; Leverington, B; Li, Y; Likhomanenko, T; Lindner, R; Linn, C; Lionetto, F; Liu, B; Liu, X; Loh, D; Longstaff, I; Lopes, J H; Lucchesi, D; Lucio Martinez, M; Luo, H; Lupato, A; Luppi, E; Lupton, O; Lusiani, A; Lyu, X; Machefert, F; Maciuc, F; Maev, O; Maguire, K; Malde, S; Malinin, A; Maltsev, T; Manca, G; Mancinelli, G; Manning, P; Maratas, J; Marchand, J F; Marconi, U; Marin Benito, C; Marino, P; Marks, J; Martellotti, G; Martin, M; Martinelli, M; Martinez Santos, D; Martinez Vidal, F; Martins Tostes, D; Massacrier, L M; Massafferri, A; Matev, R; Mathad, A; Mathe, Z; Matteuzzi, C; Mauri, A; Maurin, B; Mazurov, A; McCann, M; McCarthy, J; McNab, A; McNulty, R; Meadows, B; Meier, F; Meissner, M; Melnychuk, D; Merk, M; Merli, A; Michielin, E; Milanes, D A; Minard, M-N; Mitzel, D S; Mogini, A; Molina Rodriguez, J; Monroy, I A; Monteil, S; Morandin, M; Morawski, P; Mordà, A; Morello, M J; Moron, J; Morris, A B; Mountain, R; Muheim, F; Mulder, M; Mussini, M; Müller, D; Müller, J; Müller, K; Müller, V; Naik, P; Nakada, T; Nandakumar, R; Nandi, A; Nasteva, I; Needham, M; Neri, N; Neubert, S; Neufeld, N; Neuner, M; Nguyen, A D; Nguyen-Mau, C; Nieswand, S; Niet, R; Nikitin, N; Nikodem, T; Novoselov, A; O'Hanlon, D P; Oblakowska-Mucha, A; Obraztsov, V; Ogilvy, S; Oldeman, R; Onderwater, C J G; Otalora Goicochea, J M; Otto, A; Owen, P; Oyanguren, A; Pais, P R; Palano, A; Palombo, F; Palutan, M; Panman, J; Papanestis, A; Pappagallo, M; Pappalardo, L L; Parker, W; Parkes, C; Passaleva, G; Pastore, A; Patel, G D; Patel, M; Patrignani, C; Pearce, A; Pellegrino, A; Penso, G; Pepe Altarelli, M; Perazzini, S; Perret, P; Pescatore, L; Petridis, K; Petrolini, A; Petrov, A; Petruzzo, M; Picatoste Olloqui, E; Pietrzyk, B; Pikies, M; Pinci, D; Pistone, A; Piucci, A; Playfer, S; Plo Casasus, M; Poikela, T; Polci, F; Poluektov, A; Polyakov, I; Polycarpo, E; Pomery, G J; Popov, A; Popov, D; Popovici, B; Poslavskii, S; Potterat, C; Price, E; Price, J D; Prisciandaro, J; Pritchard, A; Prouve, C; Pugatch, V; Puig Navarro, A; Punzi, G; Qian, W; Quagliani, R; Rachwal, B; Rademacker, J H; Rama, M; Ramos Pernas, M; Rangel, M S; Raniuk, I; Raven, G; Redi, F; Reichert, S; Dos Reis, A C; Remon Alepuz, C; Renaudin, V; Ricciardi, S; Richards, S; Rihl, M; Rinnert, K; Rives Molina, V; Robbe, P; Rodrigues, A B; Rodrigues, E; Rodriguez Lopez, J A; Rodriguez Perez, P; Rogozhnikov, A; Roiser, S; Romanovskiy, V; Romero Vidal, A; Ronayne, J W; Rotondo, M; Rudolph, M S; Ruf, T; Ruiz Valls, P; Saborido Silva, J J; Sadykhov, E; Sagidova, N; Saitta, B; Salustino Guimaraes, V; Sanchez Mayordomo, C; Sanmartin Sedes, B; Santacesaria, R; Santamarina Rios, C; Santimaria, M; Santovetti, E; Sarti, A; Satriano, C; Satta, A; Saunders, D M; Savrina, D; Schael, S; Schellenberg, M; Schiller, M; Schindler, H; Schlupp, M; Schmelling, M; Schmelzer, T; Schmidt, B; Schneider, O; Schopper, A; Schubert, K; Schubiger, M; Schune, M-H; Schwemmer, R; Sciascia, B; Sciubba, A; Semennikov, A; Sergi, A; Serra, N; Serrano, J; Sestini, L; Seyfert, P; Shapkin, M; Shapoval, I; Shcheglov, Y; Shears, T; Shekhtman, L; Shevchenko, V; Shires, A; Siddi, B G; Silva Coutinho, R; Silva de Oliveira, L; Simi, G; Simone, S; Sirendi, M; Skidmore, N; Skwarnicki, T; Smith, E; Smith, I T; Smith, J; Smith, M; Snoek, H; Sokoloff, M D; Soler, F J P; Souza De Paula, B; Spaan, B; Spradlin, P; Sridharan, S; Stagni, F; Stahl, M; Stahl, S; Stefko, P; Stefkova, S; Steinkamp, O; Stemmle, S; Stenyakin, O; Stevenson, S; Stoica, S; Stone, S; Storaci, B; Stracka, S; Straticiuc, M; Straumann, U; Sun, L; Sutcliffe, W; Swientek, K; Syropoulos, V; Szczekowski, M; Szumlak, T; T'Jampens, S; Tayduganov, A; Tekampe, T; Tellarini, G; Teubert, F; Thomas, E; van Tilburg, J; Tilley, M J; Tisserand, V; Tobin, M; Tolk, S; Tomassetti, L; Tonelli, D; Topp-Joergensen, S; Toriello, F; Tournefier, E; Tourneur, S; Trabelsi, K; Traill, M; Tran, M T; Tresch, M; Trisovic, A; Tsaregorodtsev, A; Tsopelas, P; Tully, A; Tuning, N; Ukleja, A; Ustyuzhanin, A; Uwer, U; Vacca, C; Vagnoni, V; Valat, S; Valenti, G; Vallier, A; Vazquez Gomez, R; Vazquez Regueiro, P; Vecchi, S; van Veghel, M; Velthuis, J J; Veltri, M; Veneziano, G; Venkateswaran, A; Vernet, M; Vesterinen, M; Viaud, B; Vieira, D; Vieites Diaz, M; Vilasis-Cardona, X; Volkov, V; Vollhardt, A; Voneki, B; Voong, D; Vorobyev, A; Vorobyev, V; Voß, C; de Vries, J A; Vázquez Sierra, C; Waldi, R; Wallace, C; Wallace, R; Walsh, J; Wang, J; Ward, D R; Wark, H M; Watson, N K; Websdale, D; Weiden, A; Whitehead, M; Wicht, J; Wilkinson, G; Wilkinson, M; Williams, M; Williams, M P; Williams, M; Williams, T; Wilson, F F; Wimberley, J; Wishahi, J; Wislicki, W; Witek, M; Wormser, G; Wotton, S A; Wraight, K; Wright, S; Wyllie, K; Xie, Y; Xing, Z; Xu, Z; Yang, Z; Yin, H; Yu, J; Yuan, X; Yushchenko, O; Zarebski, K A; Zavertyaev, M; Zhang, L; Zhang, Y; Zhang, Y; Zhelezov, A; Zheng, Y; Zhokhov, A; Zhu, X; Zhukov, V; Zucchelli, S
2016-10-07
The B_{s}^{0}π^{±} invariant mass distribution is investigated in order to search for possible exotic meson states. The analysis is based on a data sample recorded with the LHCb detector corresponding to 3 fb^{-1} of pp collision data at sqrt[s]=7 and 8 TeV. No significant excess is found, and upper limits are set on the production rate of the claimed X(5568) state within the LHCb acceptance. Upper limits are also set as a function of the mass and width of a possible exotic meson decaying to the B_{s}^{0}π^{±} final state. The same limits also apply to a possible exotic meson decaying through the chain B_{s}^{*0}π^{±}, B_{s}^{*0}→B_{s}^{0}γ where the photon is excluded from the reconstructed decays.
Directory of Open Access Journals (Sweden)
Sun-Ho Lee
2014-01-01
Full Text Available Data outsourcing services have emerged with the increasing use of digital information. They can be used to store data from various devices via networks that are easy to access. Unlike existing removable storage systems, storage outsourcing is available to many users because it has no storage limit and does not require a local storage medium. However, the reliability of storage outsourcing has become an important topic because many users employ it to store large volumes of data. To protect against unethical administrators and attackers, a variety of cryptography systems are used, such as searchable encryption and proxy reencryption. However, existing searchable encryption technology is inconvenient for use in storage outsourcing environments where users upload their data to be shared with others as necessary. In addition, some existing schemes are vulnerable to collusion attacks and have computing cost inefficiencies. In this paper, we analyze existing proxy re-encryption with keyword search.
Search for structure in the $B_s^0\\pi^\\pm$ invariant mass spectrum
Aaij, Roel; Adinolfi, Marco; Ajaltouni, Ziad; Akar, Simon; Albrecht, Johannes; Alessio, Federico; Alexander, Michael; Ali, Suvayu; Alkhazov, Georgy; Alvarez Cartelle, Paula; Alves Jr, Antonio Augusto; Amato, Sandra; Amerio, Silvia; Amhis, Yasmine; An, Liupan; Anderlini, Lucio; Andreassi, Guido; Andreotti, Mirco; Andrews, Jason; Appleby, Robert; Archilli, Flavio; d'Argent, Philippe; Arnau Romeu, Joan; Artamonov, Alexander; Artuso, Marina; Aslanides, Elie; Auriemma, Giulio; Baalouch, Marouen; Babuschkin, Igor; Bachmann, Sebastian; Back, John; Badalov, Alexey; Baesso, Clarissa; Baker, Sophie; Baldini, Wander; Barlow, Roger; Barschel, Colin; Barsuk, Sergey; Barter, William; Baszczyk, Mateusz; Batozskaya, Varvara; Batsukh, Baasansuren; Battista, Vincenzo; Bay, Aurelio; Beaucourt, Leo; Beddow, John; Bedeschi, Franco; Bediaga, Ignacio; Bel, Lennaert; Bellee, Violaine; Belloli, Nicoletta; Belous, Konstantin; Belyaev, Ivan; Ben-Haim, Eli; Bencivenni, Giovanni; Benson, Sean; Benton, Jack; Berezhnoy, Alexander; Bernet, Roland; Bertolin, Alessandro; Betti, Federico; Bettler, Marc-Olivier; van Beuzekom, Martinus; Bezshyiko, Iaroslava; Bifani, Simone; Billoir, Pierre; Bird, Thomas; Birnkraut, Alex; Bitadze, Alexander; Bizzeti, Andrea; Blake, Thomas; Blanc, Frederic; Blouw, Johan; Blusk, Steven; Bocci, Valerio; Boettcher, Thomas; Bondar, Alexander; Bondar, Nikolay; Bonivento, Walter; Borgheresi, Alessio; Borghi, Silvia; Borisyak, Maxim; Borsato, Martino; Bossu, Francesco; Boubdir, Meriem; Bowcock, Themistocles; Bowen, Espen Eie; Bozzi, Concezio; Braun, Svende; Britsch, Markward; Britton, Thomas; Brodzicka, Jolanta; Buchanan, Emma; Burr, Christopher; Bursche, Albert; Buytaert, Jan; Cadeddu, Sandro; Calabrese, Roberto; Calvi, Marta; Calvo Gomez, Miriam; Camboni, Alessandro; Campana, Pierluigi; Campora Perez, Daniel; Campora Perez, Daniel Hugo; Capriotti, Lorenzo; Carbone, Angelo; Carboni, Giovanni; Cardinale, Roberta; Cardini, Alessandro; Carniti, Paolo; Carson, Laurence; Carvalho Akiba, Kazuyoshi; Casse, Gianluigi; Cassina, Lorenzo; Castillo Garcia, Lucia; Cattaneo, Marco; Cauet, Christophe; Cavallero, Giovanni; Cenci, Riccardo; Charles, Matthew; Charpentier, Philippe; Chatzikonstantinidis, Georgios; Chefdeville, Maximilien; Chen, Shanzhen; Cheung, Shu-Faye; Chobanova, Veronika; Chrzaszcz, Marcin; Cid Vidal, Xabier; Ciezarek, Gregory; Clarke, Peter; Clemencic, Marco; Cliff, Harry; Closier, Joel; Coco, Victor; Cogan, Julien; Cogneras, Eric; Cogoni, Violetta; Cojocariu, Lucian; Collins, Paula; Comerma-Montells, Albert; Contu, Andrea; Cook, Andrew; Coquereau, Samuel; Corti, Gloria; Corvo, Marco; Costa Sobral, Cayo Mar; Couturier, Benjamin; Cowan, Greig; Craik, Daniel Charles; Crocombe, Andrew; Cruz Torres, Melissa Maria; Cunliffe, Samuel; Currie, Robert; D'Ambrosio, Carmelo; Da Cunha Marinho, Franciole; Dall'Occo, Elena; Dalseno, Jeremy; David, Pieter; Davis, Adam; De Aguiar Francisco, Oscar; De Bruyn, Kristof; De Capua, Stefano; De Cian, Michel; De Miranda, Jussara; De Paula, Leandro; De Serio, Marilisa; De Simone, Patrizia; Dean, Cameron Thomas; Decamp, Daniel; Deckenhoff, Mirko; Del Buono, Luigi; Demmer, Moritz; Derkach, Denis; Deschamps, Olivier; Dettori, Francesco; Dey, Biplab; Di Canto, Angelo; Dijkstra, Hans; Dordei, Francesca; Dorigo, Mirco; Dosil Su{\\'a}rez, Alvaro; Dovbnya, Anatoliy; Dreimanis, Karlis; Dufour, Laurent; Dujany, Giulio; Dungs, Kevin; Durante, Paolo; Dzhelyadin, Rustem; Dziurda, Agnieszka; Dzyuba, Alexey; D{\\'e}l{\\'e}age, Nicolas; Easo, Sajan; Ebert, Marcus; Egede, Ulrik; Egorychev, Victor; Eidelman, Semen; Eisenhardt, Stephan; Eitschberger, Ulrich; Ekelhof, Robert; Eklund, Lars; Elsasser, Christian; Ely, Scott; Esen, Sevda; Evans, Hannah Mary; Evans, Timothy; Falabella, Antonio; Farley, Nathanael; Farry, Stephen; Fay, Robert; Fazzini, Davide; Ferguson, Dianne; Fernandez Albor, Victor; Fernandez Prieto, Antonio; Ferrari, Fabio; Ferreira Rodrigues, Fernando; Ferro-Luzzi, Massimiliano; Filippov, Sergey; Fini, Rosa Anna; Fiore, Marco; Fiorini, Massimiliano; Firlej, Miroslaw; Fitzpatrick, Conor; Fiutowski, Tomasz; Fleuret, Frederic; Fohl, Klaus; Fontana, Marianna; Fontanelli, Flavio; Forshaw, Dean Charles; Forty, Roger; Franco Lima, Vinicius; Frank, Markus; Frei, Christoph; Fu, Jinlin; Furfaro, Emiliano; F{\\"a}rber, Christian; Gallas Torreira, Abraham; Galli, Domenico; Gallorini, Stefano; Gambetta, Silvia; Gandelman, Miriam; Gandini, Paolo; Gao, Yuanning; Garcia Martin, Luis Miguel; Garc{\\'\\i}a Pardi{\\~n}as, Juli{\\'a}n; Garra Tico, Jordi; Garrido, Lluis; Garsed, Philip John; Gascon, David; Gaspar, Clara; Gavardi, Laura; Gazzoni, Giulio; Gerick, David; Gersabeck, Evelina; Gersabeck, Marco; Gershon, Timothy; Ghez, Philippe; Gian{\\`\\i}, Sebastiana; Gibson, Valerie; Girard, Olivier G{\\"o}ran; Giubega, Lavinia-Helena; Gizdov, Konstantin; Gligorov, Vladimir; Golubkov, Dmitry; Golutvin, Andrey; Gomes, Alvaro; Gorelov, Igor Vladimirovich; Gotti, Claudio; Grabalosa G{\\'a}ndara, Marc; Graciani Diaz, Ricardo; Granado Cardoso, Luis Alberto; Graug{\\'e}s, Eugeni; Graverini, Elena; Graziani, Giacomo; Grecu, Alexandru; Griffith, Peter; Grillo, Lucia; Gruberg Cazon, Barak Raimond; Gr{\\"u}nberg, Oliver; Gushchin, Evgeny; Guz, Yury; Gys, Thierry; G{\\"o}bel, Carla; Hadavizadeh, Thomas; Hadjivasiliou, Christos; Haefeli, Guido; Haen, Christophe; Haines, Susan; Hall, Samuel; Hamilton, Brian; Han, Xiaoxue; Hansmann-Menzemer, Stephanie; Harnew, Neville; Harnew, Samuel; Harrison, Jonathan; Hatch, Mark; He, Jibo; Head, Timothy; Heister, Arno; Hennessy, Karol; Henrard, Pierre; Henry, Louis; Hernando Morata, Jose Angel; van Herwijnen, Eric; He{\\ss}, Miriam; Hicheur, Adl{\\`e}ne; Hill, Donal; Hombach, Christoph; Hopchev, P H; Hulsbergen, Wouter; Humair, Thibaud; Hushchyn, Mikhail; Hussain, Nazim; Hutchcroft, David; Idzik, Marek; Ilten, Philip; Jacobsson, Richard; Jaeger, Andreas; Jalocha, Pawel; Jans, Eddy; Jawahery, Abolhassan; Jiang, Feng; John, Malcolm; Johnson, Daniel; Jones, Christopher; Joram, Christian; Jost, Beat; Jurik, Nathan; Kandybei, Sergii; Kanso, Walaa; Karacson, Matthias; Kariuki, James Mwangi; Karodia, Sarah; Kecke, Matthieu; Kelsey, Matthew; Kenyon, Ian; Kenzie, Matthew; Ketel, Tjeerd; Khairullin, Egor; Khanji, Basem; Khurewathanakul, Chitsanu; Kirn, Thomas; Klaver, Suzanne; Klimaszewski, Konrad; Koliiev, Serhii; Kolpin, Michael; Komarov, Ilya; Koopman, Rose; Koppenburg, Patrick; Kozachuk, Anastasiia; Kozeiha, Mohamad; Kravchuk, Leonid; Kreplin, Katharina; Kreps, Michal; Krokovny, Pavel; Kruse, Florian; Krzemien, Wojciech; Kucewicz, Wojciech; Kucharczyk, Marcin; Kudryavtsev, Vasily; Kuonen, Axel Kevin; Kurek, Krzysztof; Kvaratskheliya, Tengiz; Lacarrere, Daniel; Lafferty, George; Lai, Adriano; Lambert, Dean; Lanfranchi, Gaia; Langenbruch, Christoph; Latham, Thomas; Lazzeroni, Cristina; Le Gac, Renaud; van Leerdam, Jeroen; Lees, Jean-Pierre; Leflat, Alexander; Lefran{\\c{c}}ois, Jacques; Lef{\\`e}vre, Regis; Lemaitre, Florian; Lemos Cid, Edgar; Leroy, Olivier; Lesiak, Tadeusz; Leverington, Blake; Li, Yiming; Likhomanenko, Tatiana; Lindner, Rolf; Linn, Christian; Lionetto, Federica; Liu, Bo; Liu, Xuesong; Loh, David; Longstaff, Iain; Lopes, Jose; Lucchesi, Donatella; Lucio Martinez, Miriam; Luo, Haofei; Lupato, Anna; Luppi, Eleonora; Lupton, Oliver; Lusiani, Alberto; Lyu, Xiao-Rui; Machefert, Frederic; Maciuc, Florin; Maev, Oleg; Maguire, Kevin; Malde, Sneha; Malinin, Alexander; Maltsev, Timofei; Manca, Giulia; Mancinelli, Giampiero; Manning, Peter Michael; Maratas, Jan; Marchand, Jean Fran{\\c{c}}ois; Marconi, Umberto; Marin Benito, Carla; Marino, Pietro; Marks, J{\\"o}rg; Martellotti, Giuseppe; Martin, Morgan; Martinelli, Maurizio; Martinez Santos, Diego; Martinez Vidal, Fernando; Martins Tostes, Danielle; Massacrier, Laure Marie; Massafferri, Andr{\\'e}; Matev, Rosen; Mathad, Abhijit; Mathe, Zoltan; Matteuzzi, Clara; Mauri, Andrea; Maurin, Brice; Mazurov, Alexander; McCann, Michael; McCarthy, James; McNab, Andrew; McNulty, Ronan; Meadows, Brian; Meier, Frank; Meissner, Marco; Melnychuk, Dmytro; Merk, Marcel; Merli, Andrea; Michielin, Emanuele; Milanes, Diego Alejandro; Minard, Marie-Noelle; Mitzel, Dominik Stefan; Mogini, Andrea; Molina Rodriguez, Josue; Monroy, Igancio Alberto; Monteil, Stephane; Morandin, Mauro; Morawski, Piotr; Mord{\\`a}, Alessandro; Morello, Michael Joseph; Moron, Jakub; Morris, Adam Benjamin; Mountain, Raymond; Muheim, Franz; Mulder, Mick; Mussini, Manuel; M{\\"u}ller, Dominik; M{\\"u}ller, Janine; M{\\"u}ller, Katharina; M{\\"u}ller, Vanessa; Naik, Paras; Nakada, Tatsuya; Nandakumar, Raja; Nandi, Anita; Nasteva, Irina; Needham, Matthew; Neri, Nicola; Neubert, Sebastian; Neufeld, Niko; Neuner, Max; Nguyen, Anh Duc; Nguyen-Mau, Chung; Nieswand, Simon; Niet, Ramon; Nikitin, Nikolay; Nikodem, Thomas; Novoselov, Alexey; O'Hanlon, Daniel Patrick; Oblakowska-Mucha, Agnieszka; Obraztsov, Vladimir; Ogilvy, Stephen; Oldeman, Rudolf; Onderwater, Gerco; Otalora Goicochea, Juan Martin; Otto, Adam; Owen, Patrick; Oyanguren, Maria Aranzazu; Pais, Preema Rennee; Palano, Antimo; Palombo, Fernando; Palutan, Matteo; Panman, Jacob; Papanestis, Antonios; Pappagallo, Marco; Pappalardo, Luciano; Parker, William; Parkes, Christopher; Passaleva, Giovanni; Pastore, Alessandra; Patel, Girish; Patel, Mitesh; Patrignani, Claudia; Pearce, Alex; Pellegrino, Antonio; Penso, Gianni; Pepe Altarelli, Monica; Perazzini, Stefano; Perret, Pascal; Pescatore, Luca; Petridis, Konstantinos; Petrolini, Alessandro; Petrov, Aleksandr; Petruzzo, Marco; Picatoste Olloqui, Eduardo; Pietrzyk, Boleslaw; Pikies, Malgorzata; Pinci, Davide; Pistone, Alessandro; Piucci, Alessio; Playfer, Stephen; Plo Casasus, Maximo; Poikela, Tuomas; Polci, Francesco; Poluektov, Anton; Polyakov, Ivan; Polycarpo, Erica; Pomery, Gabriela Johanna; Popov, Alexander; Popov, Dmitry; Popovici, Bogdan; Poslavskii, Stanislav; Potterat, C{\\'e}dric; Price, Eugenia; Price, Joseph David; Prisciandaro, Jessica; Pritchard, Adrian; Prouve, Claire; Pugatch, Valery; Puig Navarro, Albert; Punzi, Giovanni; Qian, Wenbin; Quagliani, Renato; Rachwal, Bartolomiej; Rademacker, Jonas; Rama, Matteo; Ramos Pernas, Miguel; Rangel, Murilo; Raniuk, Iurii; Raven, Gerhard; Redi, Federico; Reichert, Stefanie; dos Reis, Alberto; Remon Alepuz, Clara; Renaudin, Victor; Ricciardi, Stefania; Richards, Sophie; Rihl, Mariana; Rinnert, Kurt; Rives Molina, Vicente; Robbe, Patrick; Rodrigues, Ana Barbara; Rodrigues, Eduardo; Rodriguez Lopez, Jairo Alexis; Rodriguez Perez, Pablo; Rogozhnikov, Alexey; Roiser, Stefan; Romanovskiy, Vladimir; Romero Vidal, Antonio; Ronayne, John William; Rotondo, Marcello; Rudolph, Matthew Scott; Ruf, Thomas; Ruiz Valls, Pablo; Saborido Silva, Juan Jose; Sadykhov, Elnur; Sagidova, Naylya; Saitta, Biagio; Salustino Guimaraes, Valdir; Sanchez Mayordomo, Carlos; Sanmartin Sedes, Brais; Santacesaria, Roberta; Santamarina Rios, Cibran; Santimaria, Marco; Santovetti, Emanuele; Sarti, Alessio; Satriano, Celestina; Satta, Alessia; Saunders, Daniel Martin; Savrina, Darya; Schael, Stefan; Schellenberg, Margarete; Schiller, Manuel; Schindler, Heinrich; Schlupp, Maximilian; Schmelling, Michael; Schmelzer, Timon; Schmidt, Burkhard; Schneider, Olivier; Schopper, Andreas; Schubert, Konstantin; Schubiger, Maxime; Schune, Marie Helene; Schwemmer, Rainer; Sciascia, Barbara; Sciubba, Adalberto; Semennikov, Alexander; Sergi, Antonino; Serra, Nicola; Serrano, Justine; Sestini, Lorenzo; Seyfert, Paul; Shapkin, Mikhail; Shapoval, Illya; Shcheglov, Yury; Shears, Tara; Shekhtman, Lev; Shevchenko, Vladimir; Shires, Alexander; Siddi, Benedetto Gianluca; Silva Coutinho, Rafael; Silva de Oliveira, Luiz Gustavo; Simi, Gabriele; Simone, Saverio; Sirendi, Marek; Skidmore, Nicola; Skwarnicki, Tomasz; Smith, Eluned; Smith, Iwan Thomas; Smith, Jackson; Smith, Mark; Snoek, Hella; Sokoloff, Michael; Soler, Paul; Souza De Paula, Bruno; Spaan, Bernhard; Spradlin, Patrick; Sridharan, Srikanth; Stagni, Federico; Stahl, Marian; Stahl, Sascha; Stefko, Pavol; Stefkova, Slavorima; Steinkamp, Olaf; Stemmle, Simon; Stenyakin, Oleg; Stevenson, Scott; Stoica, Sabin; Stone, Sheldon; Storaci, Barbara; Stracka, Simone; Straticiuc, Mihai; Straumann, Ulrich; Sun, Liang; Sutcliffe, William; Swientek, Krzysztof; Syropoulos, Vasileios; Szczekowski, Marek; Szumlak, Tomasz; T'Jampens, Stephane; Tayduganov, Andrey; Tekampe, Tobias; Teklishyn, Maksym; Tellarini, Giulia; Teubert, Frederic; Thomas, Eric; van Tilburg, Jeroen; Tilley, Matthew James; Tisserand, Vincent; Tobin, Mark; Tolk, Siim; Tomassetti, Luca; Tonelli, Diego; Topp-Joergensen, Stig; Toriello, Francis; Tournefier, Edwige; Tourneur, Stephane; Trabelsi, Karim; Traill, Murdo; Tran, Minh T{\\^a}m; Tresch, Marco; Trisovic, Ana; Tsaregorodtsev, Andrei; Tsopelas, Panagiotis; Tully, Alison; Tuning, Niels; Ukleja, Artur; Ustyuzhanin, Andrey; Uwer, Ulrich; Vacca, Claudia; Vagnoni, Vincenzo; Valassi, Andrea; Valat, Sebastien; Valenti, Giovanni; Vallier, Alexis; Vazquez Gomez, Ricardo; Vazquez Regueiro, Pablo; Vecchi, Stefania; van Veghel, Maarten; Velthuis, Jaap; Veltri, Michele; Veneziano, Giovanni; Venkateswaran, Aravindhan; Vernet, Maxime; Vesterinen, Mika; Viaud, Benoit; Vieira, Daniel; Vieites Diaz, Maria; Vilasis-Cardona, Xavier; Volkov, Vladimir; Vollhardt, Achim; Voneki, Balazs; Vorobyev, Alexey; Vorobyev, Vitaly; Vo{\\ss}, Christian; de Vries, Jacco; V{\\'a}zquez Sierra, Carlos; Waldi, Roland; Wallace, Charlotte; Wallace, Ronan; Walsh, John; Wang, Jianchun; Ward, David; Wark, Heather Mckenzie; Watson, Nigel; Websdale, David; Weiden, Andreas; Whitehead, Mark; Wicht, Jean; Wilkinson, Guy; Wilkinson, Michael; Williams, Mark Richard James; Williams, Matthew; Williams, Mike; Williams, Timothy; Wilson, Fergus; Wimberley, Jack; Wishahi, Julian; Wislicki, Wojciech; Witek, Mariusz; Wormser, Guy; Wotton, Stephen; Wraight, Kenneth; Wright, Simon; Wyllie, Kenneth; Xie, Yuehong; Xing, Zhou; Xu, Zhirui; Yang, Zhenwei; Yin, Hang; Yu, Jiesheng; Yuan, Xuhao; Yushchenko, Oleg; Zarebski, Kristian Alexander; Zavertyaev, Mikhail; Zhang, Liming; Zhang, Yanxi; Zhelezov, Alexey; Zheng, Yangheng; Zhokhov, Anatoly; Zhu, Xianglei; Zhukov, Valery; Zucchelli, Stefano
2016-10-05
The $B_s^0\\pi^\\pm$ invariant mass distribution is investigated in order to search for possible exotic meson states. The analysis is based on a data sample recorded with the LHCb detector corresponding to $3$ fb$^{-1}$ of $pp$ collision data at $\\sqrt{s} = 7$ and $8$ TeV. No significant excess is found, and upper limits are set on the production rate of the claimed $X(5568)$ state within the LHCb acceptance. Upper limits are also set as a function of the mass and width of a possible exotic meson decaying to the $B_s^0\\pi^\\pm$ final state. The same limits also apply to a possible exotic meson decaying through the chain $B_s^{*0}\\pi^\\pm$, $B_s^{*0} \\to B_s^0 \\gamma$ where the photon is excluded from the reconstructed decays.
First-principles study of ternary bcc alloys using special quasi-random structures
International Nuclear Information System (INIS)
Jiang Chao
2009-01-01
Using a combination of exhaustive enumeration and Monte Carlo simulated annealing, we have developed special quasi-random structures (SQSs) for ternary body-centered cubic (bcc) alloys with compositions of A 1 B 1 C 1 , A 2 B 1 C 1 , A 6 B 1 C 1 and A 2 B 3 C 3 , respectively. The structures possess local pair and multisite correlation functions that closely mimic those of the random bcc alloy. We employed the SQSs to predict the mixing enthalpies, nearest neighbor bond length distributions and electronic density of states of bcc Mo-Nb-Ta and Mo-Nb-V solid solutions. Our convergence tests indicate that even small-sized SQSs can give reliable results. Based on the SQS energetics, the predicting powers of the existing empirical ternary extrapolation models were assessed. The present results suggest that it is important to take into account the ternary interaction parameter in order to accurately describe the thermodynamic behaviors of ternary alloys. The proposed SQSs are quite general and can be applied to other ternary bcc alloys.
Results of searches for the nucleon structure displays in high energy hadron-nucleus collisions
International Nuclear Information System (INIS)
Strugalski, Z.
1984-01-01
Hadron-nucleus collision data at projectile energy from a few GeV up to about eight thousand GeV were analysed in order to find effects in which a nucleon structure manifests itself. It was found that some nucleon structure displays in incident hadron deflection in its passage through atomic nuclei and in multiple production process, at energies above about 2 GeV. The distribution of the deflection angles consists of two components, the mean free path for multiparticle production is about three times larger than the expected one. These effects may be interpreted as caused by a nucleon structure
Search for ArGa structures for development of coordinate-sensitive detectors
International Nuclear Information System (INIS)
Vorob'ev, A.P.; Sergeev, V.A.; Smol', A.V.
1991-01-01
GaAs samples have been investigated with the view to estimate the possibilities to use them in the coordinate detectors. As a result of the analysis of β-radiation spectra the samples of the π-ν-n-structure, whose signal spectrum from minimal ionizing particle is reliably singled out from the noise spectrum, have been chosen. The mechanism of signal forming in such structure has been considered. It has been concluded that π-ν-n-structure on the basis of the compensated GaAs is very promising as far as the construction of the coordinate sensitive detectors is concerned. 9 refs.; 15 figs
Improving search for low energy protein structures with an iterative niche genetic algorithm
DEFF Research Database (Denmark)
Helles, Glennie
2010-01-01
In attempts to predict the tertiary structure of proteins we use almost exclusively metaheuristics. However, despite known differences in performance of metaheuristics for different problems, the effect of the choice of metaheuristic has received precious little attention in this field. Particula......In attempts to predict the tertiary structure of proteins we use almost exclusively metaheuristics. However, despite known differences in performance of metaheuristics for different problems, the effect of the choice of metaheuristic has received precious little attention in this field...
Firdaus-Raih, Mohd; Hamdani, Hazrina Yusof; Nadzirin, Nurul; Ramlan, Effirul Ikhwan; Willett, Peter; Artymiuk, Peter J
2014-07-01
Hydrogen bonds are crucial factors that stabilize a complex ribonucleic acid (RNA) molecule's three-dimensional (3D) structure. Minute conformational changes can result in variations in the hydrogen bond interactions in a particular structure. Furthermore, networks of hydrogen bonds, especially those found in tight clusters, may be important elements in structure stabilization or function and can therefore be regarded as potential tertiary motifs. In this paper, we describe a graph theoretical algorithm implemented as a web server that is able to search for unbroken networks of hydrogen-bonded base interactions and thus provide an accounting of such interactions in RNA 3D structures. This server, COGNAC (COnnection tables Graphs for Nucleic ACids), is also able to compare the hydrogen bond networks between two structures and from such annotations enable the mapping of atomic level differences that may have resulted from conformational changes due to mutations or binding events. The COGNAC server can be accessed at http://mfrlab.org/grafss/cognac. © The Author(s) 2014. Published by Oxford University Press on behalf of Nucleic Acids Research.
Czech Academy of Sciences Publication Activity Database
Pánek, Josef; Krásný, Libor; Bobek, Jan; Ježková, E.; Korelusová, Jana; Vohradský, Jiří
-, - (2010), s. 1-9 ISSN 1362-4962 R&D Projects: GA MŠk 2B06065; GA ČR GA303/09/0475; GA ČR GA310/07/1009 Institutional research plan: CEZ:AV0Z50200510 Keywords : ncRNAs * RNA structures Subject RIV: EE - Microbiology, Virology
NIMS structural materials databases and cross search engine - MatNavi
Energy Technology Data Exchange (ETDEWEB)
Yamazaki, M.; Xu, Y.; Murata, M.; Tanaka, H.; Kamihira, K.; Kimura, K. [National Institute for Materials Science, Tokyo (Japan)
2007-06-15
Materials Database Station (MDBS) of National Institute for Materials Science (NIMS) owns the world's largest Internet materials database for academic and industry purpose, which is composed of twelve databases: five concerning structural materials, five concerning basic physical properties, one for superconducting materials and one for polymers. All of theses databases are opened to Internet access at the website of http://mits.nims.go.jp/en. Online tools for predicting properties of polymers and composite materials are also available. The NIMS structural materials databases are composed of structural materials data sheet online version (creep, fatigue, corrosion and space use materials strength), microstructure for crept material database, Pressure vessel materials database and CCT diagram for welding. (orig.)
Structural Search for High Pressure CS2 and Xe-Cl Compounds
Zarifi, Niloofar; Tse, John S.
2018-04-01
The recent successful implementation of several methodologies for the prediction of crystal structures based on the first-principles electronic structure have ushered in a new area of computational chemistry. In this study, the two most popular methods, namely genetic evolution and particle swarm optimization, were applied to the investigation of stable crystalline polymorphs of solid carbon disulfide and xenon halides at high pressure. It was found that both methods have their own merits. However, there are subtleties that need to be considered for the proper execution of the methods. We found a two-dimensional (2D) layered structure that may be responsible for the superconductivity in CS2. Except for XeCl2, no thermodynamically stable crystalline Xe halides were found under 60 GPa in the halide-rich region of the phase diagram.
The FOLDALIGN web server for pairwise structural RNA alignment and mutual motif search
DEFF Research Database (Denmark)
Havgaard, Jakob Hull; Lyngsø, Rune B.; Gorodkin, Jan
2005-01-01
FOLDALIGN is a Sankoff-based algorithm for making structural alignments of RNA sequences. Here, we present a web server for making pairwise alignments between two RNA sequences, using the recently updated version of FOLDALIGN. The server can be used to scan two sequences for a common structural RNA...... motif of limited size, or the entire sequences can be aligned locally or globally. The web server offers a graphical interface, which makes it simple to make alignments and manually browse the results. the web server can be accessed at http://foldalign.kvl.dk...
Radio synthesis observations of planetary nebulae. II. A search for sub-arcsecond structure
International Nuclear Information System (INIS)
Balick, B.; Terzian, Y.
1976-01-01
Observations of 11 planetary nebulae with spatial resolutions from 0''.2 to 2'' at 2695 and 8085 MHz failed to show any very bright structure smaller than about 2''. The observations are shown to be consistent with the present understanding of the temperatures and density distributions thought to typify most planetary nebulae
Directory of Open Access Journals (Sweden)
Julie-Éléonore Maisonhaute
2011-12-01
Full Text Available A lot of studies focusing on the effect of agricultural landscapes demonstrate that many arthropod species are influenced by landscape structure. In particular, non–crop areas and landscape diversity are often associated with a higher abundance and diversity of natural enemies in fields. Numerous studies focused on the influence of landscape structure on ground beetles, spiders and ladybeetles but few on other natural enemies or different functional groups. Thus, the objective of the present study was to determine the influence of landscape structure on the functional groups, i.e., active-searching predators, furtive predators and parasitoids of aphidophagous guilds. Natural enemies were sampled on milkweed infested with aphids, growing along the borders of ditches adjacent to cornfields. The sampling occurred weekly from June to September in 2006 and 2007, in the region of Lanaudičre (Quebec, Canada. The landscapes within a radius 200 and 500 m around each site were analyzed. The abundance, richness and species composition (based on functional groups of natural enemies were related to landscape structure. The results indicated that landscape structure explained up to 21.6% of the variation in natural enemy assemblage and confirm the positive effects of non-crop areas and landscape diversity. A lower influence of landscape structure on species composition was observed (6.4 to 8.8% and varied greatly among the functional groups. Coccinellidae and furtive predators were the group most influenced by landscape structure. In conclusion, the influence of landscape varied greatly among the different species of the same functional group.
Liu, Zhangjun; Liu, Zenghui
2018-06-01
This paper develops a hybrid approach of spectral representation and random function for simulating stationary stochastic vector processes. In the proposed approach, the high-dimensional random variables, included in the original spectral representation (OSR) formula, could be effectively reduced to only two elementary random variables by introducing the random functions that serve as random constraints. Based on this, a satisfactory simulation accuracy can be guaranteed by selecting a small representative point set of the elementary random variables. The probability information of the stochastic excitations can be fully emerged through just several hundred of sample functions generated by the proposed approach. Therefore, combined with the probability density evolution method (PDEM), it could be able to implement dynamic response analysis and reliability assessment of engineering structures. For illustrative purposes, a stochastic turbulence wind velocity field acting on a frame-shear-wall structure is simulated by constructing three types of random functions to demonstrate the accuracy and efficiency of the proposed approach. Careful and in-depth studies concerning the probability density evolution analysis of the wind-induced structure have been conducted so as to better illustrate the application prospects of the proposed approach. Numerical examples also show that the proposed approach possesses a good robustness.
Effects of hormone therapy on brain structure: A randomized controlled trial.
Kantarci, Kejal; Tosakulwong, Nirubol; Lesnick, Timothy G; Zuk, Samantha M; Gunter, Jeffrey L; Gleason, Carey E; Wharton, Whitney; Dowling, N Maritza; Vemuri, Prashanthi; Senjem, Matthew L; Shuster, Lynne T; Bailey, Kent R; Rocca, Walter A; Jack, Clifford R; Asthana, Sanjay; Miller, Virginia M
2016-08-30
To investigate the effects of hormone therapy on brain structure in a randomized, double-blinded, placebo-controlled trial in recently postmenopausal women. Participants (aged 42-56 years, within 5-36 months past menopause) in the Kronos Early Estrogen Prevention Study were randomized to (1) 0.45 mg/d oral conjugated equine estrogens (CEE), (2) 50 μg/d transdermal 17β-estradiol, or (3) placebo pills and patch for 48 months. Oral progesterone (200 mg/d) was given to active treatment groups for 12 days each month. MRI and cognitive testing were performed in a subset of participants at baseline, and at 18, 36, and 48 months of randomization (n = 95). Changes in whole brain, ventricular, and white matter hyperintensity volumes, and in global cognitive function, were measured. Higher rates of ventricular expansion were observed in both the CEE and the 17β-estradiol groups compared to placebo; however, the difference was significant only in the CEE group (p = 0.01). Rates of ventricular expansion correlated with rates of decrease in brain volume (r = -0.58; p ≤ 0.001) and with rates of increase in white matter hyperintensity volume (r = 0.27; p = 0.01) after adjusting for age. The changes were not different between the CEE and 17β-estradiol groups for any of the MRI measures. The change in global cognitive function was not different across the groups. Ventricular volumes increased to a greater extent in recently menopausal women who received CEE compared to placebo but without changes in cognitive performance. Because the sample size was small and the follow-up limited to 4 years, the findings should be interpreted with caution and need confirmation. This study provides Class I evidence that brain ventricular volume increased to a greater extent in recently menopausal women who received oral CEE compared to placebo. © 2016 American Academy of Neurology.
Energy Technology Data Exchange (ETDEWEB)
Chandonia, John-Marc; Brenner, Steven E.
2004-07-14
The structural genomics project is an international effort to determine the three-dimensional shapes of all important biological macromolecules, with a primary focus on proteins. Target proteins should be selected according to a strategy which is medically and biologically relevant, of good value, and tractable. As an option to consider, we present the Pfam5000 strategy, which involves selecting the 5000 most important families from the Pfam database as sources for targets. We compare the Pfam5000 strategy to several other proposed strategies that would require similar numbers of targets. These include including complete solution of several small to moderately sized bacterial proteomes, partial coverage of the human proteome, and random selection of approximately 5000 targets from sequenced genomes. We measure the impact that successful implementation of these strategies would have upon structural interpretation of the proteins in Swiss-Prot, TrEMBL, and 131 complete proteomes (including 10 of eukaryotes) from the Proteome Analysis database at EBI. Solving the structures of proteins from the 5000 largest Pfam families would allow accurate fold assignment for approximately 68 percent of all prokaryotic proteins (covering 59 percent of residues) and 61 percent of eukaryotic proteins (40 percent of residues). More fine-grained coverage which would allow accurate modeling of these proteins would require an order of magnitude more targets. The Pfam5000 strategy may be modified in several ways, for example to focus on larger families, bacterial sequences, or eukaryotic sequences; as long as secondary consideration is given to large families within Pfam, coverage results vary only slightly. In contrast, focusing structural genomics on a single tractable genome would have only a limited impact in structural knowledge of other proteomes: a significant fraction (about 30-40 percent of the proteins, and 40-60 percent of the residues) of each proteome is classified in small
Sienkiewicz-Gromiuk, Justyna
2018-01-01
The DFT studies were carried out with the B3LYP method utilizing the 6-31G and 6-311++G(d,p) basis sets depending on whether the aim of calculations was to gain the geometry at equilibrium, or to calculate the optimized molecular structure of (benzylthio)acetic acid (Hbta) in the forms of monomer and dimer. The minimum conformational energy search was followed by the potential energy surface (PES) scan of all rotary bonds existing in the acid molecule. The optimized geometrical monomeric and dimeric structures of the title compound were compared with the experimental structural data in the solid state. The detailed vibrational interpretation of experimental infrared and Raman bands was performed on the basis of theoretically simulated ESFF-scaled wavenumbers calculated for the monomer and dimer structures of Hbta. The electronic characteristics of Hbta is also presented in terms of Mulliken atomic charges, frontier molecular orbitals and global reactivity descriptors. Additionally, the MEP and ESP surfaces were computed to predict coordination sites for potential metal complex formation.
The thermodynamic and structural properties of metallocenes-type random ethylene copolymers
International Nuclear Information System (INIS)
Simanke, Adriane G.; Mauler, Raquel S.; Galland, Griselda B.; Alamo, Rufina G.
2001-01-01
The properties of a series of random ethylene copolymers prepared with the metallocenes catalytic system rac-Et[Ind] 2 ZrCl 2 /MAO were studied for a large variety of comonomer types. These include the classical 1-alkene type with length up to 10 carbons and those of the cyclic type such as cyclopentadiene and dicyclopentadiene. Under rapid crystallization, the melting temperatures of the newly synthesized copolymers followed the relation of model random copolymers indicating a behavior that conforms to that predicted by Flory's phase equilibrium theory. The molar entropy of fusion is not significantly altered by the comonomer type including the dicyclopentadiene type. All types of comonomers studied showed, for a fixed comonomer content, the same change in properties during annealing, except the ethylene 1-butenes. These latter copolymers and the hydrogenated poly butadiene showed a faster rate of change in thermal properties. This is consistent with a higher molecular diffusion for the butene comonomer than for the rest of comonomers analyzed. The properties of the inter lamellar region were also studied as a function of comonomer type and content following the variation of the amorphous halo extracted from the WAXS diffractograms. The observed systematic decrease in the peak scattering angle with increasing comonomer content indicates a variation of the intermolecular liquid structure. (author)
Mean-field Theory for Some Bus Transport Networks with Random Overlapping Clique Structure
International Nuclear Information System (INIS)
Yang Xuhua; Sun Bao; Wang Bo; Sun Youxian
2010-01-01
Transport networks, such as railway networks and airport networks, are a kind of random network with complex topology. Recently, more and more scholars paid attention to various kinds of transport networks and try to explore their inherent characteristics. Here we study the exponential properties of a recently introduced Bus Transport Networks (BTNs) evolution model with random overlapping clique structure, which gives a possible explanation for the observed exponential distribution of the connectivities of some BTNs of three major cities in China. Applying mean-field theory, we analyze the BTNs model and prove that this model has the character of exponential distribution of the connectivities, and develop a method to predict the growth dynamics of the individual vertices, and use this to calculate analytically the connectivity distribution and the exponents. By comparing mean-field based theoretic results with the statistical data of real BTNs, we observe that, as a whole, both of their data show similar character of exponential distribution of the connectivities, and their exponents have same order of magnitude, which show the availability of the analytical result of this paper. (general)
Prediction of protein-protein interaction sites in sequences and 3D structures by random forests.
Directory of Open Access Journals (Sweden)
Mile Sikić
2009-01-01
Full Text Available Identifying interaction sites in proteins provides important clues to the function of a protein and is becoming increasingly relevant in topics such as systems biology and drug discovery. Although there are numerous papers on the prediction of interaction sites using information derived from structure, there are only a few case reports on the prediction of interaction residues based solely on protein sequence. Here, a sliding window approach is combined with the Random Forests method to predict protein interaction sites using (i a combination of sequence- and structure-derived parameters and (ii sequence information alone. For sequence-based prediction we achieved a precision of 84% with a 26% recall and an F-measure of 40%. When combined with structural information, the prediction performance increases to a precision of 76% and a recall of 38% with an F-measure of 51%. We also present an attempt to rationalize the sliding window size and demonstrate that a nine-residue window is the most suitable for predictor construction. Finally, we demonstrate the applicability of our prediction methods by modeling the Ras-Raf complex using predicted interaction sites as target binding interfaces. Our results suggest that it is possible to predict protein interaction sites with quite a high accuracy using only sequence information.
Analysis of tree stand horizontal structure using random point field methods
Directory of Open Access Journals (Sweden)
O. P. Sekretenko
2015-06-01
Full Text Available This paper uses the model approach to analyze the horizontal structure of forest stands. The main types of models of random point fields and statistical procedures that can be used to analyze spatial patterns of trees of uneven and even-aged stands are described. We show how modern methods of spatial statistics can be used to address one of the objectives of forestry – to clarify the laws of natural thinning of forest stand and the corresponding changes in its spatial structure over time. Studying natural forest thinning, we describe the consecutive stages of modeling: selection of the appropriate parametric model, parameter estimation and generation of point patterns in accordance with the selected model, the selection of statistical functions to describe the horizontal structure of forest stands and testing of statistical hypotheses. We show the possibilities of a specialized software package, spatstat, which is designed to meet the challenges of spatial statistics and provides software support for modern methods of analysis of spatial data. We show that a model of stand thinning that does not consider inter-tree interaction can project the size distribution of the trees properly, but the spatial pattern of the modeled stand is not quite consistent with observed data. Using data of three even-aged pine forest stands of 25, 55, and 90-years old, we demonstrate that the spatial point process models are useful for combining measurements in the forest stands of different ages to study the forest stand natural thinning.
Stochastic generation of explicit pore structures by thresholding Gaussian random fields
Energy Technology Data Exchange (ETDEWEB)
Hyman, Jeffrey D., E-mail: jhyman@lanl.gov [Program in Applied Mathematics, University of Arizona, Tucson, AZ 85721-0089 (United States); Computational Earth Science, Earth and Environmental Sciences (EES-16), and Center for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, NM 87544 (United States); Winter, C. Larrabee, E-mail: winter@email.arizona.edu [Program in Applied Mathematics, University of Arizona, Tucson, AZ 85721-0089 (United States); Department of Hydrology and Water Resources, University of Arizona, Tucson, AZ 85721-0011 (United States)
2014-11-15
We provide a description and computational investigation of an efficient method to stochastically generate realistic pore structures. Smolarkiewicz and Winter introduced this specific method in pores resolving simulation of Darcy flows (Smolarkiewicz and Winter, 2010 [1]) without giving a complete formal description or analysis of the method, or indicating how to control the parameterization of the ensemble. We address both issues in this paper. The method consists of two steps. First, a realization of a correlated Gaussian field, or topography, is produced by convolving a prescribed kernel with an initial field of independent, identically distributed random variables. The intrinsic length scales of the kernel determine the correlation structure of the topography. Next, a sample pore space is generated by applying a level threshold to the Gaussian field realization: points are assigned to the void phase or the solid phase depending on whether the topography over them is above or below the threshold. Hence, the topology and geometry of the pore space depend on the form of the kernel and the level threshold. Manipulating these two user prescribed quantities allows good control of pore space observables, in particular the Minkowski functionals. Extensions of the method to generate media with multiple pore structures and preferential flow directions are also discussed. To demonstrate its usefulness, the method is used to generate a pore space with physical and hydrological properties similar to a sample of Berea sandstone. -- Graphical abstract: -- Highlights: •An efficient method to stochastically generate realistic pore structures is provided. •Samples are generated by applying a level threshold to a Gaussian field realization. •Two user prescribed quantities determine the topology and geometry of the pore space. •Multiple pore structures and preferential flow directions can be produced. •A pore space based on Berea sandstone is generated.
Directory of Open Access Journals (Sweden)
Christoph Nick
2014-09-01
Full Text Available The growth of cortical neurons on three dimensional structures of spatially defined (structured randomly oriented, as well as on vertically aligned, carbon nanotubes (CNT is studied. Cortical neurons are attracted towards both types of CNT nano-architectures. For both, neurons form clusters in close vicinity to the CNT structures whereupon the randomly oriented CNTs are more closely colonised than the CNT pillars. Neurons develop communication paths via neurites on both nanoarchitectures. These neuron cells attach preferentially on the CNT sidewalls of the vertically aligned CNT architecture instead than onto the tips of the individual CNT pillars.
Meta-Structures: The Search of Coherence in Collective Behaviours (without Physics
Directory of Open Access Journals (Sweden)
Eliano Pessa
2013-09-01
Full Text Available This contribution shortly outlines and reviews a theoretical and computational approach for a theory of change concerning systems where it is not possible to apply the laws of motion ab initio. The concept of meta-structure relates to the emergence of forms of spatiotemporal coherences in collective behaviours intended as coherent sequences of multiple structures. The essential difference compared with traditional methods is the role of the cognitive design by the observer when identifying multiple mesoscopic variables. The goal is both to study the "change without physics" of the dynamics of change and to design non-catastrophic interventions having the purpose to induce, change, keep or restore collective behaviours by influencing -at the mesoscopic level -and not prescribing explicit rules and changes.
Structured and collaborative search: an integrated approach to share documents among users
Francq, Pascal
2003-01-01
Aujourd'hui, la gestion des documents est l'un des problèmes les plus importants en informatique. L'objectif de cette thèse est de proposer un système de gestion documentaire basé sur une approche appelée recherche structurée et collaborative. Les caractéristiques essentielles sont :Dès lors que les utilisateurs ont plusieurs centres d'intérêts, ils sont décrits par des profils, un profil correspondant à un centre d'intérêt particulier. C'est la partie structurée du système.Pour construire un...
Novel phases of lithium-aluminum binaries from first-principles structural search
Energy Technology Data Exchange (ETDEWEB)
Sarmiento-Pérez, Rafael; Cerqueira, Tiago F. T.; Botti, Silvana; Marques, Miguel A. L., E-mail: marques@tddft.org [Institut Lumière Matière (UMR5306) and ETSF, Université Lyon 1-CNRS, Université de Lyon, F-69622 Villeurbanne Cedex (France); Valencia-Jaime, Irais [Institut Lumière Matière (UMR5306) and ETSF, Université Lyon 1-CNRS, Université de Lyon, F-69622 Villeurbanne Cedex (France); Centro de Investigación y Estudios Avanzados del IPN, MX-76230 Querétaro (Mexico); Amsler, Maximilian; Goedecker, Stefan [Department of Physics, Universität Basel, Klingelbergstr. 82, 4056 Basel (Switzerland); Romero, Aldo H. [Physics Department, West Virginia University, Morgantown, West Virginia 26506-6315 (United States)
2015-01-14
Intermetallic Li–Al compounds are on the one hand key materials for light-weight engineering, and on the other hand, they have been proposed for high-capacity electrodes for Li batteries. We determine from first-principles the phase diagram of Li–Al binary crystals using the minima hopping structural prediction method. Beside reproducing the experimentally reported phases (LiAl, Li{sub 3}Al{sub 2}, Li{sub 9}Al{sub 4}, LiAl{sub 3}, and Li{sub 2}Al), we unveil a structural variety larger than expected by discovering six unreported binary phases likely to be thermodynamically stable. Finally, we discuss the behavior of the elastic constants and of the electric potential profile of all Li–Al stable compounds as a function of their stoichiometry.
Searching for New Regulatory Frameworks for the Intermediate Financial Structure in Post-Crisis Asia
Sayuri Shirai
2001-01-01
Intermediate Financial Structure 1. In a number of Asian countries, commercial banks are already playing an important role in the corporate bond market as issuers, underwriters, investors, and guarantors. This reflects banks’ already dominant financial positions in their financial markets, good reputation, and informational advantages. Thus, the role of banks for fostering the development of the corporate bond market and their complementary roles should be encouraged. 2. This financial landsc...
Directory of Open Access Journals (Sweden)
Yefimenko A. A.
2014-12-01
Full Text Available The authors present a method, an algorithm and a program, designed to determine the optimal size of printed circuit boards (PCB of mechanical structures and different kinds of electronic equipment. The PCB filling factor is taken as an optimization criterion. The method allows one to quickly determine the dependence of the filling factor on the size of the PCB for various components.
International Nuclear Information System (INIS)
Lindgren, Georg
2012-01-01
The statistical properties near phase singularities in a complex wavefield are here studied by means of the conditional distributions of the real and imaginary Gaussian components, given a common zero crossing point. The exact distribution is expressed as a Slepian model, where a regression term provides the main structure, with parameters given by the gradients of the Gaussian components at the singularity, and Gaussian non-stationary residuals that provide local variability. This technique differs from the linearization (Taylor expansion) technique commonly used. The empirically and theoretically verified elliptic eccentricity of the intensity contours in the vortex core is a property of the regression term, but with different normalization compared to the classical theory. The residual term models the statistical variability around these ellipses. The radii of the circular contours of the current magnitude are similarly modified by the new regression expansion and also here the random deviations are modeled by the residual field. (paper)
Woolley, Thomas E.; Gaffney, Eamonn A.; Goriely, Alain
2017-07-01
If the plasma membrane of a cell is able to delaminate locally from its actin cortex, a cellular bleb can be produced. Blebs are pressure-driven protrusions, which are noteworthy for their ability to produce cellular motion. Starting from a general continuum mechanics description, we restrict ourselves to considering cell and bleb shapes that maintain approximately spherical forms. From this assumption, we obtain a tractable algebraic system for bleb formation. By including cell-substrate adhesions, we can model blebbing cell motility. Further, by considering mechanically isolated blebbing events, which are randomly distributed over the cell, we can derive equations linking the macroscopic migration characteristics to the microscopic structural parameters of the cell. This multiscale modeling framework is then used to provide parameter estimates, which are in agreement with current experimental data. In summary, the construction of the mathematical model provides testable relationships between the bleb size and cell motility.
Woolley, Thomas E; Gaffney, Eamonn A; Goriely, Alain
2017-07-01
If the plasma membrane of a cell is able to delaminate locally from its actin cortex, a cellular bleb can be produced. Blebs are pressure-driven protrusions, which are noteworthy for their ability to produce cellular motion. Starting from a general continuum mechanics description, we restrict ourselves to considering cell and bleb shapes that maintain approximately spherical forms. From this assumption, we obtain a tractable algebraic system for bleb formation. By including cell-substrate adhesions, we can model blebbing cell motility. Further, by considering mechanically isolated blebbing events, which are randomly distributed over the cell, we can derive equations linking the macroscopic migration characteristics to the microscopic structural parameters of the cell. This multiscale modeling framework is then used to provide parameter estimates, which are in agreement with current experimental data. In summary, the construction of the mathematical model provides testable relationships between the bleb size and cell motility.
A search for the ground state structure and the phase stability of tantalum pentoxide
International Nuclear Information System (INIS)
Pérez-Walton, S; Valencia-Balvín, C; Padilha, A C M; Dalpian, G M; Osorio-Guillén, J M
2016-01-01
Tantalum pentoxide (Ta 2 O 5 ) is a wide-gap semiconductor that presents good catalytic and dielectric properties, conferring to this compound promising prospective use in a variety of technological applications. However, there is a lack of understanding regarding the relations among its crystalline phases, as some of them are not even completely characterized and there is currently no agreement about which models better explain the crystallographic data. Additionally, its phase diagram is unknown. In this work we performed first-principles density functional theory calculations to study the structural properties of the different phases and models of Ta 2 O 5 , the equation of state and the zone-centered vibrational frequencies. From our results, we conclude that the phases that are built up from only distorted octahedra instead of combinations with pentagonal and/or hexagonal bipyramids are energetically more favorable and dynamically stable. More importantly, this study establishes that, given the pressure range considered, the B-phase is the most favorable structure and there is no a crystallographic phase transition to another phase at high-pressure. Additionally, for the equilibrium volume of the B-phase and the λ-model, the description of the electronic structure and optical properties were performed using semi-local and hybrid functionals. (paper)
Directory of Open Access Journals (Sweden)
Kenaszchuk Chris
2007-09-01
Full Text Available Abstract Background Despite a burgeoning interest in using interprofessional approaches to promote effective collaboration in health care, systematic reviews find scant evidence of benefit. This protocol describes the first cluster randomized controlled trial (RCT to design and evaluate an intervention intended to improve interprofessional collaborative communication and patient-centred care. Objectives The objective is to evaluate the effects of a four-component, hospital-based staff communication protocol designed to promote collaborative communication between healthcare professionals and enhance patient-centred care. Methods The study is a multi-centre mixed-methods cluster randomized controlled trial involving twenty clinical teaching teams (CTTs in general internal medicine (GIM divisions of five Toronto tertiary-care hospitals. CTTs will be randomly assigned either to receive an intervention designed to improve interprofessional collaborative communication, or to continue usual communication practices. Non-participant naturalistic observation, shadowing, and semi-structured, qualitative interviews were conducted to explore existing patterns of interprofessional collaboration in the CTTs, and to support intervention development. Interviews and shadowing will continue during intervention delivery in order to document interactions between the intervention settings and adopters, and changes in interprofessional communication. The primary outcome is the rate of unplanned hospital readmission. Secondary outcomes are length of stay (LOS; adherence to evidence-based prescription drug therapy; patients' satisfaction with care; self-report surveys of CTT staff perceptions of interprofessional collaboration; and frequency of calls to paging devices. Outcomes will be compared on an intention-to-treat basis using adjustment methods appropriate for data from a cluster randomized design. Discussion Pre-intervention qualitative analysis revealed that a
International Nuclear Information System (INIS)
Brette, Ph.
1996-01-01
This thesis presents the searching possibilities of a composite structure of quark from the jet studies in the ATLAS experiment. ATLAS is one of the major detectors on the LHC, the next proton-proton collider at CERN. The general physic framework of the quark compositeness is first introduced, the its expected search from the contact terms in the channel 2 → 2 is explained. After a description of the ATLAS apparatus and of the prototype of the hadronic scintillating tiles calorimeter, various experimental properties of the hadron calorimeter with respect to the jet measurement are studied. The effect of the non-linearity of the calorimeter response is particularly discussed, including the light red out with the photomultipliers. The laser monitoring system enables a full control of the gain stability of the photomultipliers and of their non-linearity for large signals. Its design and the measured performance are shown. Finally, by considering both the expected performances of the ATLAS detector and the theoretical uncertainties, it appears that the compositeness scale controlled at the LHC, for quarks, should reach 15 to 20 TeV depending upon the luminosity, from jet measurement up to 3 TeV. (author)
Searching for filaments and large-scale structure around DAFT/FADA clusters
Durret, F.; Márquez, I.; Acebrón, A.; Adami, C.; Cabrera-Lavers, A.; Capelato, H.; Martinet, N.; Sarron, F.; Ulmer, M. P.
2016-04-01
Context. Clusters of galaxies are located at the intersection of cosmic filaments and are still accreting galaxies and groups along these preferential directions. However, because of their relatively low contrast on the sky, filaments are difficult to detect (unless a large amount of spectroscopic data are available), and unambiguous detections have been limited until now to relatively low redshifts (zDAFT/FADA survey for which we had deep wide field photometric data. For each cluster, based on a colour-magnitude diagram, we selected galaxies that were likely to belong to the red sequence, and hence to be at the cluster redshift, and built density maps. By computing the background for each of these maps and drawing 3σ contours, we estimated the elongations of the structures detected in this way. Whenever possible, we identified the other structures detected on the density maps with clusters listed in NED. Results: We find clear elongations in twelve clusters out of thirty, with sizes that can reach up to 7.6 Mpc. Eleven other clusters have neighbouring structures, but the zones linking them are not detected in the density maps at a 3σ level. Three clusters show no extended structure and no neighbours, and four clusters are of too low contrast to be clearly visible on our density maps. Conclusions: The simple method we have applied appears to work well to show the existence of filaments and/or extensions around a number of clusters in the redshift range 0.4
Search for structure in the low-energy anti p-p annihilation cross section
International Nuclear Information System (INIS)
Jastrzembski, E.; Haik, N.; McFarlane, W.K.; Mandelkern, M.A.; Schultz, D.C.; Amsler, C.; Hermann, C.C.; Wolfe, D.M.
1980-01-01
The relative cross section for annihilation of antiprotons on hydrogen into one or more charged pions was measured. Incident beam momentum was 600 MeV/c. Numbers of observed events (relative) were compared with those expected from the sensitivity of the apparatus. A phase-space model was used for p-barp annihilation. Relative cross sections are plotted vs invariant mass. Upper limits on cross sections for the formation of narrow resonances in the S region are given; previously reported structures are not confirmed. 2 figures, 1 table
Dohrmann, Anja B; Baumert, Susann; Klingebiel, Lars; Weiland, Peter; Tebbe, Christoph C
2011-03-01
Microbial conversion of organic waste or harvested plant material into biogas has become an attractive technology for energy production. Biogas is produced in reactors under anaerobic conditions by a consortium of microorganisms which commonly include bacteria of the genus Clostridium. Since the genus Clostridium also harbors some highly pathogenic members in its phylogenetic cluster I, there has been some concern that an unintended growth of such pathogens might occur during the fermentation process. Therefore this study aimed to follow how process parameters affect the diversity of Bacteria in general, and the diversity of Clostridium cluster I members in particular. The development of both communities was followed in model biogas reactors from start-up during stable methanogenic conditions. The biogas reactors were run with either cattle or pig manures as substrates, and both were operated at mesophilic and thermophilic conditions. The structural diversity was analyzed independent of cultivation using a PCR-based detection of 16S rRNA genes and genetic profiling by single-strand conformation polymorphism (SSCP). Genetic profiles indicated that both bacterial and clostridial communities evolved in parallel, and the community structures were highly influenced by both substrate and temperature. Sequence analysis of 16S rRNA genes recovered from prominent bands from SSCP profiles representing Clostridia detected no pathogenic species. Thus, this study gave no indication that pathogenic clostridia would be enriched as dominant community members in biogas reactors fed with manure.
The Structure of a Thermophilic Kinase Shapes Fitness upon Random Circular Permutation.
Jones, Alicia M; Mehta, Manan M; Thomas, Emily E; Atkinson, Joshua T; Segall-Shapiro, Thomas H; Liu, Shirley; Silberg, Jonathan J
2016-05-20
Proteins can be engineered for synthetic biology through circular permutation, a sequence rearrangement in which native protein termini become linked and new termini are created elsewhere through backbone fission. However, it remains challenging to anticipate a protein's functional tolerance to circular permutation. Here, we describe new transposons for creating libraries of randomly circularly permuted proteins that minimize peptide additions at their termini, and we use transposase mutagenesis to study the tolerance of a thermophilic adenylate kinase (AK) to circular permutation. We find that libraries expressing permuted AKs with either short or long peptides amended to their N-terminus yield distinct sets of active variants and present evidence that this trend arises because permuted protein expression varies across libraries. Mapping all sites that tolerate backbone cleavage onto AK structure reveals that the largest contiguous regions of sequence that lack cleavage sites are proximal to the phosphotransfer site. A comparison of our results with a range of structure-derived parameters further showed that retention of function correlates to the strongest extent with the distance to the phosphotransfer site, amino acid variability in an AK family sequence alignment, and residue-level deviations in superimposed AK structures. Our work illustrates how permuted protein libraries can be created with minimal peptide additions using transposase mutagenesis, and it reveals a challenge of maintaining consistent expression across permuted variants in a library that minimizes peptide additions. Furthermore, these findings provide a basis for interpreting responses of thermophilic phosphotransferases to circular permutation by calibrating how different structure-derived parameters relate to retention of function in a cellular selection.
International Nuclear Information System (INIS)
Yanchev, I.
2003-01-01
A new expression for the Fourier transform of the binary correlation function of the random potential near the semiconductor-insulator interface is derived. The screening from the metal electrode in MIS-structure is taken into account introducing an effective insulator thickness. An essential advantage of this correlation function is the finite dispersion of the random potential to which it leads in distinction with the so far known correlation functions leading to a divergent dispersion. The dispersion, an important characteristic of the random potential distribution, determining the amplitude of the potential fluctuations is calculated
International Nuclear Information System (INIS)
Yanchev, I; Slavcheva, G.
1993-01-01
A new expression for the Fourier transform of the binary correlation function of the random potential near the semiconductor-insulator interface is derived. The screening from the metal electrode in MIS-structure is taken into account introducing an effective insulator thickness. An essential advantage of this correlation function is the finite dispersion of the random potential Γ 2 to which it leads in distinction with the so far known correlation functions leading to divergent dispersion. The important characteristic of the random potential distribution Γ 2 determining the amplitude of the potential fluctuations is calculated. 7 refs. (orig.)
International Nuclear Information System (INIS)
Slavcheva, G.; Yanchev, I.
1991-01-01
A new expression for the Fourier transform of the binary correlation function of the random potential near the semiconductor-insulator interface is derived. The screening due to the image charge with respect to the metal electrode in MIS-structure is taken into account, introducing an effective insulator thickness. An essential advantage of this correlation function is the finite dispersion of the random potential Γ 2 to which it leads in distinction with the so far known correlation functions leading to divergent dispersion. The important characteristic of the random potential distribution Γ 2 determining the amplitude of the potential fluctuations is calculated. (author). 7 refs, 1 fig
Yanchev, I
2003-01-01
A new expression for the Fourier transform of the binary correlation function of the random potential near the semiconductor-insulator interface is derived. The screening from the metal electrode in MIS-structure is taken into account introducing an effective insulator thickness. An essential advantage of this correlation function is the finite dispersion of the random potential to which it leads in distinction with the so far known correlation functions leading to a divergent dispersion. The dispersion, an important characteristic of the random potential distribution, determining the amplitude of the potential fluctuations is calculated.
Energy Technology Data Exchange (ETDEWEB)
Yanchev, I
2003-07-01
A new expression for the Fourier transform of the binary correlation function of the random potential near the semiconductor-insulator interface is derived. The screening from the metal electrode in MIS-structure is taken into account introducing an effective insulator thickness. An essential advantage of this correlation function is the finite dispersion of the random potential to which it leads in distinction with the so far known correlation functions leading to a divergent dispersion. The dispersion, an important characteristic of the random potential distribution, determining the amplitude of the potential fluctuations is calculated.
3D NEAREST NEIGHBOUR SEARCH USING A CLUSTERED HIERARCHICAL TREE STRUCTURE
Directory of Open Access Journals (Sweden)
A. Suhaibah
2016-06-01
Full Text Available Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.
Yu, Jeffrey Xu; Chang, Lijun
2009-01-01
It has become highly desirable to provide users with flexible ways to query/search information over databases as simple as keyword search like Google search. This book surveys the recent developments on keyword search over databases, and focuses on finding structural information among objects in a database using a set of keywords. Such structural information to be returned can be either trees or subgraphs representing how the objects, that contain the required keywords, are interconnected in a relational database or in an XML database. The structural keyword search is completely different from
Finite element random vibration method for soil-structure interaction analysis
International Nuclear Information System (INIS)
Romo-Organista, M.P.; Lysmer, J.; Seed, H.B.
1977-01-01
The authors present a method in which the seismic environment is defined directly in terms of the given design response spectrum. Response spectra cannot be used directly for random analysis, thus using extreme value theory a new procedure has been developed for converting the design response spectrum into a design power spectrum. This procedure is reversible and can also be used to compute response spectra the distribution of which can be expressed in terms of Confidence limits. Knowing the design power spctrum the resulting output power spectra and their statistical distribution can be computed by a response analysis of the soil-structure system in the frequency domain. Due to the complexity of soil structure systems, this is most conveniently done by the finite element method. Having obtained the power spectra for all motions in the system, these spectra can be used to determine other statistical information about the response such as maximum accelerations, stresses, bending moments, etc, all with appropriate confidence limits. This type of information is actually more useful for design than corresponding deterministic values. The authors have developed a computer program, PLUSH, which can perform the above procedures. Results obtained by the new method are in excellent agreement with the results of corresponding deterministic analysis. Furthermore, the probabilistic results can be obtained at a fraction of the cost of deterministic results
Lievens, Klaus; Van Nimmen, Katrien; Lombaert, Geert; De Roeck, Guido; Van den Broeck, Peter
2016-09-01
In civil engineering and architecture, the availability of high strength materials and advanced calculation techniques enables the construction of slender footbridges, generally highly sensitive to human-induced excitation. Due to the inherent random character of the human-induced walking load, variability on the pedestrian characteristics must be considered in the response simulation. To assess the vibration serviceability of the footbridge, the statistics of the stochastic dynamic response are evaluated by considering the instantaneous peak responses in a time range. Therefore, a large number of time windows are needed to calculate the mean value and standard deviation of the instantaneous peak values. An alternative method to evaluate the statistics is based on the standard deviation of the response and a characteristic frequency as proposed in wind engineering applications. In this paper, the accuracy of this method is evaluated for human-induced vibrations. The methods are first compared for a group of pedestrians crossing a lightly damped footbridge. Small differences of the instantaneous peak value were found by the method using second order statistics. Afterwards, a TMD tuned to reduce the peak acceleration to a comfort value, was added to the structure. The comparison between both methods in made and the accuracy is verified. It is found that the TMD parameters are tuned sufficiently and good agreements between the two methods are found for the estimation of the instantaneous peak response for a strongly damped structure.
Random demodulation for structural health monitoring excited by the five-cycle sine burst
Directory of Open Access Journals (Sweden)
Li Xing
2017-01-01
Full Text Available Nowadays, the Structural Health Monitoring (SHM has been paid more and more attention. The five-cycle sine burst is widely used as the exciting signal in SHM and the sensors’ responded signals are analyzed to research the damage. In the sensor network, there will be many sensors which mean many responded signals will be sampled, restored and sometimes transferred. In the traditional way which is known as Nyquist sampling theorem, the sampling rate must be more than twice the highest rate of the original signal. In this way, the amount of data will be huge. As the result, the costs will be very expensive and the equipment may be huge and heavy, which is especially unaccepted in the aircraft. It is necessary to do some research to compress the signal. The Compressing Sensing (CS theory provides new methods to compress the signals. The Random Demodulation (RD is a specific method which can accomplish the physical implementation of CS theory. In this paper, according to the structure of RD, we chose some chips to build a RD system. And we did some experiments to verify the method through the system. We chose the Orthogonal Matching Pursuit (OMP as the construct algorithm to recover the signal.
A Deep-Structured Conditional Random Field Model for Object Silhouette Tracking.
Directory of Open Access Journals (Sweden)
Mohammad Javad Shafiee
Full Text Available In this work, we introduce a deep-structured conditional random field (DS-CRF model for the purpose of state-based object silhouette tracking. The proposed DS-CRF model consists of a series of state layers, where each state layer spatially characterizes the object silhouette at a particular point in time. The interactions between adjacent state layers are established by inter-layer connectivity dynamically determined based on inter-frame optical flow. By incorporate both spatial and temporal context in a dynamic fashion within such a deep-structured probabilistic graphical model, the proposed DS-CRF model allows us to develop a framework that can accurately and efficiently track object silhouettes that can change greatly over time, as well as under different situations such as occlusion and multiple targets within the scene. Experiment results using video surveillance datasets containing different scenarios such as occlusion and multiple targets showed that the proposed DS-CRF approach provides strong object silhouette tracking performance when compared to baseline methods such as mean-shift tracking, as well as state-of-the-art methods such as context tracking and boosted particle filtering.
International Nuclear Information System (INIS)
Olson, Gordon L.
2008-01-01
In binary stochastic media in two- and three-dimensions consisting of randomly placed impenetrable disks or spheres, the chord lengths in the background material between disks and spheres closely follow exponential distributions if the disks and spheres occupy less than 10% of the medium. This work demonstrates that for regular spatial structures of disks and spheres, the tails of the chord length distributions (CLDs) follow power laws rather than exponentials. In dilute media, when the disks and spheres are widely spaced, the slope of the power law seems to be independent of the details of the structure. When approaching a close-packed arrangement, the exact placement of the spheres can make a significant difference. When regular structures are perturbed by small random displacements, the CLDs become power laws with steeper slopes. An example CLD from a quasi-random distribution of spheres in clusters shows a modified exponential distribution
Energy Technology Data Exchange (ETDEWEB)
Olson, Gordon L. [Computer and Computational Sciences Division (CCS-2), Los Alamos National Laboratory, 5 Foxglove Circle, Madison, WI 53717 (United States)], E-mail: olson99@tds.net
2008-11-15
In binary stochastic media in two- and three-dimensions consisting of randomly placed impenetrable disks or spheres, the chord lengths in the background material between disks and spheres closely follow exponential distributions if the disks and spheres occupy less than 10% of the medium. This work demonstrates that for regular spatial structures of disks and spheres, the tails of the chord length distributions (CLDs) follow power laws rather than exponentials. In dilute media, when the disks and spheres are widely spaced, the slope of the power law seems to be independent of the details of the structure. When approaching a close-packed arrangement, the exact placement of the spheres can make a significant difference. When regular structures are perturbed by small random displacements, the CLDs become power laws with steeper slopes. An example CLD from a quasi-random distribution of spheres in clusters shows a modified exponential distribution.
Directory of Open Access Journals (Sweden)
Wasik Szymon
2010-05-01
Full Text Available Abstract Background Recent discoveries concerning novel functions of RNA, such as RNA interference, have contributed towards the growing importance of the field. In this respect, a deeper knowledge of complex three-dimensional RNA structures is essential to understand their new biological functions. A number of bioinformatic tools have been proposed to explore two major structural databases (PDB, NDB in order to analyze various aspects of RNA tertiary structures. One of these tools is RNA FRABASE 1.0, the first web-accessible database with an engine for automatic search of 3D fragments within PDB-derived RNA structures. This search is based upon the user-defined RNA secondary structure pattern. In this paper, we present and discuss RNA FRABASE 2.0. This second version of the system represents a major extension of this tool in terms of providing new data and a wide spectrum of novel functionalities. An intuitionally operated web server platform enables very fast user-tailored search of three-dimensional RNA fragments, their multi-parameter conformational analysis and visualization. Description RNA FRABASE 2.0 has stored information on 1565 PDB-deposited RNA structures, including all NMR models. The RNA FRABASE 2.0 search engine algorithms operate on the database of the RNA sequences and the new library of RNA secondary structures, coded in the dot-bracket format extended to hold multi-stranded structures and to cover residues whose coordinates are missing in the PDB files. The library of RNA secondary structures (and their graphics is made available. A high level of efficiency of the 3D search has been achieved by introducing novel tools to formulate advanced searching patterns and to screen highly populated tertiary structure elements. RNA FRABASE 2.0 also stores data and conformational parameters in order to provide "on the spot" structural filters to explore the three-dimensional RNA structures. An instant visualization of the 3D RNA
From Brain Maps to Cognitive Ontologies: Informatics and the Search for Mental Structure.
Poldrack, Russell A; Yarkoni, Tal
2016-01-01
A major goal of cognitive neuroscience is to delineate how brain systems give rise to mental function. Here we review the increasingly large role informatics-driven approaches are playing in such efforts. We begin by reviewing a number of challenges conventional neuroimaging approaches face in trying to delineate brain-cognition mappings--for example, the difficulty in establishing the specificity of postulated associations. Next, we demonstrate how these limitations can potentially be overcome using complementary approaches that emphasize large-scale analysis--including meta-analytic methods that synthesize hundreds or thousands of studies at a time; latent-variable approaches that seek to extract structure from data in a bottom-up manner; and predictive modeling approaches capable of quantitatively inferring mental states from patterns of brain activity. We highlight the underappreciated but critical role for formal cognitive ontologies in helping to clarify, refine, and test theories of brain and cognitive function. Finally, we conclude with a speculative discussion of what future informatics developments may hold for cognitive neuroscience.
Search for gene mutations affecting protein structure in children of A-bomb survivors, 2
International Nuclear Information System (INIS)
Satoh, Chiyoko; Fujita, Mikio; Goriki, Kazuaki; Asakawa, Jun-ichi; Takahashi, Norio; Hamilton, H.B.; Hazama, Ryuji; Neel, J.V.
1984-01-01
Children who were born between May 1, 1946 and April 1, 1971 to survivor(s) exposed to A-bombing within 2,000 m from the hypocenter in Hiroshima and Nagasaki were selected as exposed group; their sex- and age-matched children born to survivor(s) who were exposed at 2,500 m or farther were selected as control group. When these children were in junior high school, mutation of protein structure was examined by using electrophoresis and by determining red cell enzymes with decreased activity and heat-unstable red cell enzymes. Electrophoretic study revealed a ''rare type of protein mutation'' in 635 of 12,242 individuals in the exposed group and in 448 of 10,154 individuals in the control group. The number of locuses in all proteins examined was calculated. The number of locuses per protein was corrected using the rate of parents' mutation type, and relative number of locuses were obtained. As a result, there was no difference in the mutation frequency per locus and generation between the exposed and control groups. Among children having red cell enzymes with decreased activity, mutant in triose phosphate isomerase was detected in one child in the exposed group, in whom electrophoretic pattern was normal and red cell enzymes were stable to heat. Heat-unstable red cell enzymes were seen in 9 children and their parents. However, family survey revealed genetic mutation in all instances irrespective of A-bombing. (Namekawa, K.)
Green, Christopher D; Feinerer, Ingo; Burman, Jeremy T
2015-05-01
This study continues a previous investigation of the intellectual structure of early American psychology by presenting and analyzing 3 networks that collectively include every substantive article published in Psychological Review during the 15-year period from 1909 to 1923. The networks were laid out such that articles (represented by the network's nodes) that possessed strongly correlated vocabularies were positioned closer to each other spatially than articles with weakly correlated vocabularies. We identified distinct research communities within the networks by locating and interpreting the clusters of lexically similar articles. We found that the Psychological Review was in some turmoil during this period compared with its first 15 years attributable, first, to Baldwin's unexpected departure in 1910; second, to the pressures placed on the discipline by United States entry into World War I; and, third, to the emergence of specialty psychology journals catering to research communities that had once published in the Review. The journal emerged from these challenges, however, with a better-defined mission: to serve as the chief repository of theoretical psychology in the United States. (c) 2015 APA, all rights reserved).
Raaijmakers, J.G.W.; Shiffrin, R.M.
1981-01-01
Describes search of associative memory (SAM), a general theory of retrieval from long-term memory that combines features of associative network models and random search models. It posits cue-dependent probabilistic sampling and recovery from an associative network, but the network is specified as a
Directory of Open Access Journals (Sweden)
O. W. Roberts
2014-12-01
Full Text Available Recent observations of astrophysical magnetic fields have shown the presence of fluctuations being wave-like (propagating in the plasma frame and those described as being structure-like (advected by the plasma bulk velocity. Typically with single-spacecraft missions it is impossible to differentiate between these two fluctuations, due to the inherent spatio-temporal ambiguity associated with a single point measurement. However missions such as Cluster which contain multiple spacecraft have allowed for temporal and spatial changes to be resolved, using techniques such as k filtering. While this technique does not assume Taylor's hypothesis it requires both weak stationarity of the time series and that the fluctuations can be described by a superposition of plane waves with random phases. In this paper we test whether the method can cope with a synthetic signal which is composed of a combination of non-random-phase coherent structures with a mean radius d and a mean separation λ, as well as plane waves with random phase.
Ayse T. Daloglu; Musa Artar; Korhan Ozgan; Ali İ. Karakas
2018-01-01
Optimum design of braced steel space frames including soil-structure interaction is studied by using harmony search (HS) and teaching-learning-based optimization (TLBO) algorithms. A three-parameter elastic foundation model is used to incorporate the soil-structure interaction effect. A 10-storey braced steel space frame example taken from literature is investigated according to four different bracing types for the cases with/without soil-structure interaction. X, V, Z, and eccentric V-shaped...
Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.
Directory of Open Access Journals (Sweden)
Paul J Holland
Full Text Available BACKGROUND: In Escherichia coli, cytotoxic DNA methyl lesions on the N1 position of purines and N3 position of pyrimidines are primarily repaired by the 2-oxoglutarate (2-OG iron(II dependent dioxygenase, AlkB. AlkB repairs 1-methyladenine (1-meA and 3-methylcytosine (3-meC lesions, but it also repairs 1-methylguanine (1-meG and 3-methylthymine (3-meT at a much less efficient rate. How the AlkB enzyme is able to locate and identify methylated bases in ssDNA has remained an open question. METHODOLOGY/PRINCIPAL FINDINGS: We determined the crystal structures of the E. coli AlkB protein holoenzyme and the AlkB-ssDNA complex containing a 1-meG lesion. We coupled this to site-directed mutagenesis of amino acids in and around the active site, and tested the effects of these mutations on the ability of the protein to bind both damaged and undamaged DNA, as well as catalyze repair of a methylated substrate. CONCLUSIONS/SIGNIFICANCE: A comparison of our substrate-bound AlkB-ssDNA complex with our unliganded holoenzyme reveals conformational changes of residues within the active site that are important for binding damaged bases. Site-directed mutagenesis of these residues reveals novel insight into their roles in DNA damage recognition and repair. Our data support a model that the AlkB protein utilizes at least two distinct conformations in searching and binding methylated bases within DNA: a "searching" mode and "repair" mode. Moreover, we are able to functionally separate these modes through mutagenesis of residues that affect one or the other binding state. Finally, our mutagenesis experiments show that amino acid D135 of AlkB participates in both substrate specificity and catalysis.
Stone, Ian S; Barnes, Neil C; James, Wai-Yee; Midwinter, Dawn; Boubertakh, Redha; Follows, Richard; John, Leonette; Petersen, Steffen E
2016-04-01
Patients with chronic obstructive pulmonary disease develop increased cardiovascular morbidity with structural alterations. To investigate through a double-blind, placebo-controlled, crossover study the effect of lung deflation on cardiovascular structure and function using cardiac magnetic resonance. Forty-five hyperinflated patients with chronic obstructive pulmonary disease were randomized (1:1) to 7 (maximum 14) days inhaled corticosteroid/long-acting β2-agonist fluticasone furoate/vilanterol 100/25 μg or placebo (7-day minimum washout). Primary outcome was change from baseline in right ventricular end-diastolic volume index versus placebo. There was a 5.8 ml/m(2) (95% confidence interval, 2.74-8.91; P volume index and a 429 ml (P volume with fluticasone furoate/vilanterol versus placebo. Left ventricular end-diastolic and left atrial end-systolic volumes increased by 3.63 ml/m(2) (P = 0.002) and 2.33 ml/m(2) (P = 0.002). In post hoc analysis, right ventricular stroke volume increased by 4.87 ml/m(2) (P = 0.003); right ventricular ejection fraction was unchanged. Left ventricular adaptation was similar; left atrial ejection fraction improved by +3.17% (P Pulmonary artery pulsatility increased in two of three locations (main +2.9%, P = 0.001; left +2.67%, P = 0.030). Fluticasone furoate/vilanterol safety profile was similar to placebo. Pharmacologic treatment of chronic obstructive pulmonary disease has consistent beneficial and plausible effects on cardiac function and pulmonary vasculature that may contribute to favorable effects of inhaled therapies. Future studies should investigate the effect of prolonged lung deflation on intrinsic myocardial function. Clinical trial registered with www.clinicaltrials.gov (NCT 01691885).
Kapellas, Kostas; Maple-Brown, Louise J; Jamieson, Lisa M; Do, Loc G; O'Dea, Kerin; Brown, Alex; Cai, Tommy Y; Anstey, Nicholas M; Sullivan, David R; Wang, Hao; Celermajer, David S; Slade, Gary D; Skilton, Michael R
2014-10-01
Observational studies and nonrandomized trials support an association between periodontal disease and atherosclerotic vascular disease. Both diseases occur frequently in Aboriginal Australians. We hypothesized that nonsurgical periodontal therapy would improve measures of arterial function and structure that are subclinical indicators of atherosclerotic vascular disease. This parallel-group, randomized, open label clinical trial enrolled 273 Aboriginal Australians aged ≥18 years with periodontitis. Intervention participants received full-mouth periodontal scaling during a single visit, whereas controls received no treatment. Prespecified primary end points measured 12-month change in carotid intima-media thickness, an indicator of arterial structure, and 3- and 12-month change in pulse wave velocity, an indicator of arterial function. ANCOVA used complete case data to evaluate treatment group differences. End points could be calculated for 169 participants with follow-up data at 3 months and 168 participants at 12 months. Intima-media thickness decreased significantly after 12 months in the intervention group (mean reduction=-0.023 [95% confidence interval {CI}, -0.038 to -0.008] mm) but not in the control group (mean increase=0.002 [95% CI, -0.017 to 0.022] mm). The difference in intima-media thickness change between treatment groups was statistically significant (-0.026 [95% CI, -0.048 to -0.003] mm; P=0.03). In contrast, there were no significant differences between treatment groups in pulse wave velocity at 3 months (mean difference, 0.06 [95% CI, -0.17 to 0.29] m/s; P=0.594) or 12 months (mean difference, 0.21 [95% CI, -0.01 to 0.43] m/s; P=0.062). Periodontal therapy reduced subclinical arterial thickness but not function in Aboriginal Australians with periodontal disease, suggesting periodontal disease and atherosclerosis are significantly associated. © 2014 American Heart Association, Inc.
Chiral Molecule-Enhanced Extinction Ratios of Quantum Dots Coupled to Random Plasmonic Structures.
Bezen, Lior; Yochelis, Shira; Jayarathna, Dilhara; Bhunia, Dinesh; Achim, Catalina; Paltiel, Yossi
2018-03-06
Devices based on self-assembled hybrid colloidal quantum dots (CQDs) coupled with specific organic linker molecules are a promising way to simply realize room-temperature, spectrally tunable light detectors. Nevertheless, this type of devices usually has low quantum efficiency. Plasmonics has been shown as an efficient tool in guiding and confining light at nanoscale dimensions. As plasmonic modes exhibit highly confined fields, they locally increase light-matter interactions and consequently enhance the performance of CQD-based photodetectors. Recent publications presented experimental results of large extinction enhancement from a monolayer of CQDs coupled to random gold nanoislands using a monolayer of organic alkyl linkers. We report here that a twofold larger extinction enhancement in the visible spectrum is observed when a monolayer of helical chiral molecules connects the CQDs to the gold structure instead of a monolayer of achiral linkers. We also show that this effect provides insight into the chirality of the molecules within the monolayer. In future work, we plan to evaluate the potential of these results to be used in the construction of a more efficient and sensitive photon detector based on surface QDs, as well as to supply a simple way to map the chirality of a single chiral monolayer.
International Nuclear Information System (INIS)
Zhang, Chu; Zhou, Jianzhong; Li, Chaoshun; Fu, Wenlong; Peng, Tian
2017-01-01
Highlights: • A novel hybrid approach is proposed for wind speed forecasting. • The variational mode decomposition (VMD) is optimized to decompose the original wind speed series. • The input matrix and parameters of ELM are optimized simultaneously by using a hybrid BSA. • Results show that OVMD-HBSA-ELM achieves better performance in terms of prediction accuracy. - Abstract: Reliable wind speed forecasting is essential for wind power integration in wind power generation system. The purpose of paper is to develop a novel hybrid model for short-term wind speed forecasting and demonstrates its efficiency. In the proposed model, a compound structure of extreme learning machine (ELM) based on feature selection and parameter optimization using hybrid backtracking search algorithm (HBSA) is employed as the predictor. The real-valued BSA (RBSA) is exploited to search for the optimal combination of weights and bias of ELM while the binary-valued BSA (BBSA) is exploited as a feature selection method applying on the candidate inputs predefined by partial autocorrelation function (PACF) values to reconstruct the input-matrix. Due to the volatility and randomness of wind speed signal, an optimized variational mode decomposition (OVMD) is employed to eliminate the redundant noises. The parameters of the proposed OVMD are determined according to the center frequencies of the decomposed modes and the residual evaluation index (REI). The wind speed signal is decomposed into a few modes via OVMD. The aggregation of the forecasting results of these modes constructs the final forecasting result of the proposed model. The proposed hybrid model has been applied on the mean half-hour wind speed observation data from two wind farms in Inner Mongolia, China and 10-min wind speed data from the Sotavento Galicia wind farm are studied as an additional case. Parallel experiments have been designed to compare with the proposed model. Results obtained from this study indicate that the
Structure of Sn1−xGex random alloys as obtained from the coherent potential approximation
Pulikkotil, J. J.; Chroneos, A.; Schwingenschlö gl, Udo
2011-01-01
The structure of the Sn1−xGex random alloys is studied using density functional theory and the coherent potential approximation. We report on the deviation of the Sn1−xGex alloys from Vegard’s law, addressing their full compositional range
International Nuclear Information System (INIS)
Laperashvili, L.V.
1994-01-01
The first part of the present paper contains a review of papers by Nielsen, Bennett, Brene and Picek which underly the model called random dynamics. The second part of the paper is devoted to calculating the fine structure constant by means of the path integration in the U(1)-lattice gauge theory
Optical performance of random anti-reflection structured surfaces (rARSS) on spherical lenses
Taylor, Courtney D.
Random anti-reflection structured surfaces (rARSS) have been reported to improve transmittance of optical-grade fused silica planar substrates to values greater than 99%. These textures are fabricated directly on the substrates using reactive-ion/inductively-coupled plasma etching (RIE/ICP) techniques, and often result in transmitted spectra with no measurable interference effects (fringes) for a wide range of wavelengths. The RIE/ICP processes used in the fabrication process to etch the rARSS is anisotropic and thus well suited for planar components. The improvement in spectral transmission has been found to be independent of optical incidence angles for values from 0° to +/-30°. Qualifying and quantifying the rARSS performance on curved substrates, such as convex lenses, is required to optimize the fabrication of the desired AR effect on optical-power elements. In this work, rARSS was fabricated on fused silica plano-convex (PCX) and plano-concave (PCV) lenses using a planar-substrate optimized RIE process to maximize optical transmission in the range from 500 to 1100 nm. An additional set of lenses were etched in a non-optimized ICP process to provide additional comparisons. Results are presented from optical transmission and beam propagation tests (optimized lenses only) of rARSS lenses for both TE and TM incident polarizations at a wavelength of 633 nm and over a 70° full field of view in both singlet and doublet configurations. These results suggest optimization of the fabrication process is not required, mainly due to the wide angle-of-incidence AR tolerance performance of the rARSS lenses. Non-optimized recipe lenses showed low transmission enhancement, and confirmed the need to optimized etch recipes prior to process transfer of PCX/PCV lenses. Beam propagation tests indicated no major beam degradation through the optimized lens elements. Scanning electron microscopy (SEM) images confirmed different structure between optimized and non-optimized samples
Energy Technology Data Exchange (ETDEWEB)
Wen, Hui [Chinese Academy of Sciences (CAS), Hefei (China). Lab. of Atmospheric Physico-Chemistry, Anhui Inst. of Optics & Fine Mechanics; Pacific Northwest National Lab. (PNNL), Richland, WA (United States). Physical Sciences Division; Hou, Gao-Lei [Pacific Northwest National Lab. (PNNL), Richland, WA (United States). Physical Sciences Division; Liu, Yi-Rong [Chinese Academy of Sciences (CAS), Hefei (China). Lab. of Atmospheric Physico-Chemistry, Anhui Inst. of Optics & Fine Mechanics; Wang, Xue-Bin [Pacific Northwest National Lab. (PNNL), Richland, WA (United States). Physical Sciences Division; Huang, Wei [Chinese Academy of Sciences (CAS), Hefei (China). Lab. of Atmospheric Physico-Chemistry, Anhui Inst. of Optics & Fine Mechanics; Univ. of Science and Technology of China, Hefei (China). School of Environmental Science & Optoelectronic Technology
2016-05-31
Bicarbonate serves a crucial biochemical role in the physiological pH buffering system and also has important atmospheric implications. In the current study, HCO_{3}^{$-$}(H_{2}O)_{n} (n = 0-13) clusters were successfully produced via electrospray ionization of corresponding bulk salt solution, and were characterized by combining negative ion photoelectron spectroscopy and theoretical calculations. The photoelectron spectra reveal that the electron binding energy monotonically increases with the cluster size up to n = 10 and remains largely the same after n > 10. The photo-detaching feature of the solute HCO3$-$itself, which dominates in the small clusters, diminishes with increase of water coverage. Based on the charge distribution and molecular orbital analyses, the universal high electron binding energy tail that dominates in the larger clusters can be attributed to ionization of water. Thus, the transition of ionization from solute to solvent at the size larger than n=10 has been observed. Extensive theoretical structural search based on the Basin-Hopping unbiased method was carried out, and a plethora of low energy isomers have been obtained for each medium and large size. By comparing the simulated photoelectron spectra and calculated electron binding energies with the experiments, as well as by comparing the simulated infrared spectra with previously reported IR spectra, the probable global minima and the structural evolutionary routes are presented. The nature of bicarbonate-water interactions are mainly electrostatic as implied by the electron localization function (ELF) analysis.
Search for a Structure in the B_{s}^{0}π^{±} Invariant Mass Spectrum with the ATLAS Experiment.
Aaboud, M; Aad, G; Abbott, B; Abdinov, O; Abeloos, B; Abidi, S H; AbouZeid, O S; Abraham, N L; Abramowicz, H; Abreu, H; Abulaiti, Y; Acharya, B S; Adachi, S; Adamczyk, L; Adelman, J; Adersberger, M; Adye, T; Affolder, A A; Afik, Y; Agheorghiesei, C; Aguilar-Saavedra, J A; Ahlen, S P; Ahmadov, F; Aielli, G; Akatsuka, S; Akerstedt, H; Åkesson, T P A; Akilli, E; Akimov, A V; Alberghi, G L; Albert, J; Albicocco, P; Alconada Verzini, M J; Alderweireldt, S; Aleksa, M; Aleksandrov, I N; Alexa, C; Alexander, G; Alexopoulos, T; Alhroob, M; Ali, B; Aliev, M; Alimonti, G; Alison, J; Alkire, S P; Allbrooke, B M M; Allen, B W; Allport, P P; Aloisio, A; Alonso, A; Alonso, F; Alpigiani, C; Alshehri, A A; Alstaty, M I; Alvarez Gonzalez, B; Álvarez Piqueras, D; Alviggi, M G; Amadio, B T; Amaral Coutinho, Y; Amelung, C; Amidei, D; Amor Dos Santos, S P; Amoroso, S; Anastopoulos, C; Ancu, L S; Andari, N; Andeen, T; Anders, C F; Anders, J K; Anderson, K J; Andreazza, A; Andrei, V; Angelidakis, S; Angelozzi, I; Angerami, A; Anisenkov, A V; Anjos, N; Annovi, A; Antel, C; Antonelli, M; Antonov, A; Antrim, D J; Anulli, F; Aoki, M; Aperio Bella, L; Arabidze, G; Arai, Y; Araque, J P; Araujo Ferraz, V; Arce, A T H; Ardell, R E; Arduh, F A; Arguin, J-F; Argyropoulos, S; Arik, M; Armbruster, A J; Armitage, L J; Arnaez, O; Arnold, H; Arratia, M; Arslan, O; Artamonov, A; Artoni, G; Artz, S; Asai, S; Asbah, N; Ashkenazi, A; Asquith, L; Assamagan, K; Astalos, R; Atkinson, M; Atlay, N B; Augsten, K; Avolio, G; Axen, B; Ayoub, M K; Azuelos, G; Baas, A E; Baca, M J; Bachacou, H; Bachas, K; Backes, M; Bagnaia, P; Bahmani, M; Bahrasemani, H; Baines, J T; Bajic, M; Baker, O K; Bakker, P J; Bakshi Gupta, D; Baldin, E M; Balek, P; Balli, F; Balunas, W K; Banas, E; Bandyopadhyay, A; Banerjee, Sw; Bannoura, A A E; Barak, L; Barberio, E L; Barberis, D; Barbero, M; Barillari, T; Barisits, M-S; Barkeloo, J T; Barklow, T; Barlow, N; Barnes, S L; Barnett, B M; Barnett, R M; Barnovska-Blenessy, Z; Baroncelli, A; Barone, G; Barr, A J; Barranco Navarro, L; Barreiro, F; Barreiro Guimarães da Costa, J; Bartoldus, R; Barton, A E; Bartos, P; Basalaev, A; Bassalat, A; Bates, R L; Batista, S J; Batley, J R; Battaglia, M; Bauce, M; Bauer, F; Bauer, K T; Bawa, H S; Beacham, J B; Beattie, M D; Beau, T; Beauchemin, P H; Bechtle, P; Beck, H P; Beck, H C; Becker, K; Becker, M; Becot, C; Beddall, A J; Beddall, A; Bednyakov, V A; Bedognetti, M; Bee, C P; Beermann, T A; Begalli, M; Begel, M; Behr, J K; Bell, A S; Bella, G; Bellagamba, L; Bellerive, A; Bellomo, M; Belotskiy, K; Beltramello, O; Belyaev, N L; Benary, O; Benchekroun, D; Bender, M; Benekos, N; Benhammou, Y; Benhar Noccioli, E; Benitez, J; Benjamin, D P; Benoit, M; Bensinger, J R; Bentvelsen, S; Beresford, L; Beretta, M; Berge, D; Bergeaas Kuutmann, E; Berger, N; Bergsten, L J; Beringer, J; Berlendis, S; Bernard, N R; Bernardi, G; Bernius, C; Bernlochner, F U; Berry, T; Berta, P; Bertella, C; Bertoli, G; Bertram, I A; Bertsche, C; Besjes, G J; Bessidskaia Bylund, O; Bessner, M; Besson, N; Bethani, A; Bethke, S; Betti, A; Bevan, A J; Beyer, J; Bianchi, R M; Biebel, O; Biedermann, D; Bielski, R; Bierwagen, K; Biesuz, N V; Biglietti, M; Billoud, T R V; Bilokon, H; Bindi, M; Bingul, A; Bini, C; Biondi, S; Bisanz, T; Bittrich, C; Bjergaard, D M; Black, J E; Black, K M; Blair, R E; Blazek, T; Bloch, I; Blocker, C; Blue, A; Blumenschein, U; Blunier, Dr; Bobbink, G J; Bobrovnikov, V S; Bocchetta, S S; Bocci, A; Bock, C; Boehler, M; Boerner, D; Bogavac, D; Bogdanchikov, A G; Bohm, C; Boisvert, V; Bokan, P; Bold, T; Boldyrev, A S; Bolz, A E; Bomben, M; Bona, M; Bonilla, J S; Boonekamp, M; Borisov, A; Borissov, G; Bortfeldt, J; Bortoletto, D; Bortolotto, V; Boscherini, D; Bosman, M; Bossio Sola, J D; Boudreau, J; Bouhova-Thacker, E V; Boumediene, D; Bourdarios, C; Boutle, S K; Boveia, A; Boyd, J; Boyko, I R; Bozson, A J; Bracinik, J; Brandt, A; Brandt, G; Brandt, O; Braren, F; Bratzler, U; Brau, B; Brau, J E; Breaden Madden, W D; Brendlinger, K; Brennan, A J; Brenner, L; Brenner, R; Bressler, S; Briglin, D L; Bristow, T M; Britton, D; Britzger, D; Brock, I; Brock, R; Brooijmans, G; Brooks, T; Brooks, W K; Brost, E; Broughton, J H; Bruckman de Renstrom, P A; Bruncko, D; Bruni, A; Bruni, G; Bruni, L S; Bruno, S; Brunt, B H; Bruschi, M; Bruscino, N; Bryant, P; Bryngemark, L; Buanes, T; Buat, Q; Buchholz, P; Buckley, A G; Budagov, I A; Buehrer, F; Bugge, M K; Bulekov, O; Bullock, D; Burch, T J; Burdin, S; Burgard, C D; Burger, A M; Burghgrave, B; Burka, K; Burke, S; Burmeister, I; Burr, J T P; Büscher, D; Büscher, V; Buschmann, E; Bussey, P; Butler, J M; Buttar, C M; Butterworth, J M; Butti, P; Buttinger, W; Buzatu, A; Buzykaev, A R; Cabrera Urbán, S; Caforio, D; Cai, H; Cairo, V M M; Cakir, O; Calace, N; Calafiura, P; Calandri, A; Calderini, G; Calfayan, P; Callea, G; Caloba, L P; Calvente Lopez, S; Calvet, D; Calvet, S; Calvet, T P; Camacho Toro, R; Camarda, S; Camarri, P; Cameron, D; Caminal Armadans, R; Camincher, C; Campana, S; Campanelli, M; Camplani, A; Campoverde, A; Canale, V; Cano Bret, M; Cantero, J; Cao, T; Capeans Garrido, M D M; Caprini, I; Caprini, M; Capua, M; Carbone, R M; Cardarelli, R; Cardillo, F; Carli, I; Carli, T; Carlino, G; Carlson, B T; Carminati, L; Carney, R M D; Caron, S; Carquin, E; Carrá, S; Carrillo-Montoya, G D; Casadei, D; Casado, M P; Casha, A F; Casolino, M; Casper, D W; Castelijn, R; Castillo Gimenez, V; Castro, N F; Catinaccio, A; Catmore, J R; Cattai, A; Caudron, J; Cavaliere, V; Cavallaro, E; Cavalli, D; Cavalli-Sforza, M; Cavasinni, V; Celebi, E; Ceradini, F; Cerda Alberich, L; Cerqueira, A S; Cerri, A; Cerrito, L; Cerutti, F; Cervelli, A; Cetin, S A; Chafaq, A; Chakraborty, D; Chan, S K; Chan, W S; Chan, Y L; Chang, P; Chapman, J D; Charlton, D G; Chau, C C; Chavez Barajas, C A; Che, S; Cheatham, S; Chegwidden, A; Chekanov, S; Chekulaev, S V; Chelkov, G A; Chelstowska, M A; Chen, C; Chen, C; Chen, H; Chen, J; Chen, J; Chen, S; Chen, S; Chen, X; Chen, Y; Cheng, H C; Cheng, H J; Cheplakov, A; Cheremushkina, E; Cherkaoui El Moursli, R; Cheu, E; Cheung, K; Chevalier, L; Chiarella, V; Chiarelli, G; Chiodini, G; Chisholm, A S; Chitan, A; Chiu, Y H; Chizhov, M V; Choi, K; Chomont, A R; Chouridou, S; Chow, Y S; Christodoulou, V; Chu, M C; Chudoba, J; Chuinard, A J; Chwastowski, J J; Chytka, L; Ciftci, A K; Cinca, D; Cindro, V; Cioară, I A; Ciocio, A; Cirotto, F; Citron, Z H; Citterio, M; Ciubancan, M; Clark, A; Clark, M R; Clark, P J; Clarke, R N; Clement, C; Coadou, Y; Cobal, M; Coccaro, A; Cochran, J; Colasurdo, L; Cole, B; Colijn, A P; Collot, J; Conde Muiño, P; Coniavitis, E; Connell, S H; Connelly, I A; Constantinescu, S; Conti, G; Conventi, F; Cooper-Sarkar, A M; Cormier, F; Cormier, K J R; Corradi, M; Corrigan, E E; Corriveau, F; Cortes-Gonzalez, A; Costa, M J; Costanzo, D; Cottin, G; Cowan, G; Cox, B E; Cranmer, K; Crawley, S J; Creager, R A; Cree, G; Crépé-Renaudin, S; Crescioli, F; Cribbs, W A; Cristinziani, M; Croft, V; Crosetti, G; Cueto, A; Cuhadar Donszelmann, T; Cukierman, A R; Cummings, J; Curatolo, M; Cúth, J; Czekierda, S; Czodrowski, P; D'amen, G; D'Auria, S; D'eramo, L; D'Onofrio, M; Da Cunha Sargedas De Sousa, M J; Da Via, C; Dabrowski, W; Dado, T; Dahbi, S; Dai, T; Dale, O; Dallaire, F; Dallapiccola, C; Dam, M; Dandoy, J R; Daneri, M F; Dang, N P; Dann, N S; Danninger, M; Dano Hoffmann, M; Dao, V; Darbo, G; Darmora, S; Dassoulas, J; Dattagupta, A; Daubney, T; Davey, W; David, C; Davidek, T; Davis, D R; Davison, P; Dawe, E; Dawson, I; De, K; de Asmundis, R; De Benedetti, A; De Castro, S; De Cecco, S; De Groot, N; de Jong, P; De la Torre, H; De Lorenzi, F; De Maria, A; De Pedis, D; De Salvo, A; De Sanctis, U; De Santo, A; De Vasconcelos Corga, K; De Vivie De Regie, J B; Debbe, R; Debenedetti, C; Dedovich, D V; Dehghanian, N; Deigaard, I; Del Gaudio, M; Del Peso, J; Delgove, D; Deliot, F; Delitzsch, C M; Dell'Acqua, A; Dell'Asta, L; Della Pietra, M; Della Volpe, D; Delmastro, M; Delporte, C; Delsart, P A; DeMarco, D A; Demers, S; Demichev, M; Demilly, A; Denisov, S P; Denysiuk, D; Derendarz, D; Derkaoui, J E; Derue, F; Dervan, P; Desch, K; Deterre, C; Dette, K; Devesa, M R; Deviveiros, P O; Dewhurst, A; Dhaliwal, S; Di Bello, F A; Di Ciaccio, A; Di Ciaccio, L; Di Clemente, W K; Di Donato, C; Di Girolamo, A; Di Girolamo, B; Di Micco, B; Di Nardo, R; Di Petrillo, K F; Di Simone, A; Di Sipio, R; Di Valentino, D; Diaconu, C; Diamond, M; Dias, F A; Diaz, M A; Dickinson, J; Diehl, E B; Dietrich, J; Díez Cornell, S; Dimitrievska, A; Dingfelder, J; Dita, P; Dita, S; Dittus, F; Djama, F; Djobava, T; Djuvsland, J I; do Vale, M A B; Dobre, M; Dodsworth, D; Doglioni, C; Dolejsi, J; Dolezal, Z; Donadelli, M; Donati, S; Donini, J; Dopke, J; Doria, A; Dova, M T; Doyle, A T; Drechsler, E; Dris, M; Du, Y; Duarte-Campderros, J; Dubinin, F; Dubreuil, A; Duchovni, E; Duckeck, G; Ducourthial, A; Ducu, O A; Duda, D; Dudarev, A; Dudder, A Chr; Duffield, E M; Duflot, L; Dührssen, M; Dulsen, C; Dumancic, M; Dumitriu, A E; Duncan, A K; Dunford, M; Duperrin, A; Duran Yildiz, H; Düren, M; Durglishvili, A; Duschinger, D; Dutta, B; Duvnjak, D; Dyndal, M; Dziedzic, B S; Eckardt, C; Ecker, K M; Edgar, R C; Eifert, T; Eigen, G; Einsweiler, K; Ekelof, T; El Kacimi, M; El Kosseifi, R; Ellajosyula, V; Ellert, M; Elles, S; Ellinghaus, F; Elliot, A A; Ellis, N; Elmsheuser, J; Elsing, M; Emeliyanov, D; Enari, Y; Ennis, J S; Epland, M B; Erdmann, J; Ereditato, A; Ernst, M; Errede, S; Escalier, M; Escobar, C; Esposito, B; Estrada Pastor, O; Etienvre, A I; Etzion, E; Evans, H; Ezhilov, A; Ezzi, M; Fabbri, F; Fabbri, L; Fabiani, V; Facini, G; Fakhrutdinov, R M; Falciano, S; Falla, R J; Faltova, J; Fang, Y; Fanti, M; Farbin, A; Farilla, A; Farina, E M; Farooque, T; Farrell, S; Farrington, S M; Farthouat, P; Fassi, F; Fassnacht, P; Fassouliotis, D; Faucci Giannelli, M; Favareto, A; Fawcett, W J; Fayard, L; Fedin, O L; Fedorko, W; Feigl, S; Feligioni, L; Feng, C; Feng, E J; Feng, M; Fenton, M J; Fenyuk, A B; Feremenga, L; Fernandez Martinez, P; Ferrando, J; Ferrari, A; Ferrari, P; Ferrari, R; Ferreira de Lima, D E; Ferrer, A; Ferrere, D; Ferretti, C; Fiedler, F; Filipčič, A; Filipuzzi, M; Filthaut, F; Fincke-Keeler, M; Finelli, K D; Fiolhais, M C N; Fiorini, L; Fischer, C; Fischer, J; Fisher, W C; Flaschel, N; Fleck, I; Fleischmann, P; Fletcher, R R M; Flick, T; Flierl, B M; Flores Castillo, L R; Fomin, N; Forcolin, G T; Formica, A; Förster, F A; Forti, A; Foster, A G; Fournier, D; Fox, H; Fracchia, S; Francavilla, P; Franchini, M; Franchino, S; Francis, D; Franconi, L; Franklin, M; Frate, M; Fraternali, M; Freeborn, D; Fressard-Batraneanu, S M; Freund, B; Freund, W S; Froidevaux, D; Frost, J A; Fukunaga, C; Fusayasu, T; Fuster, J; Gabizon, O; Gabrielli, A; Gabrielli, A; Gach, G P; Gadatsch, S; Gadomski, S; Gagliardi, G; Gagnon, L G; Galea, C; Galhardo, B; Gallas, E J; Gallop, B J; Gallus, P; Galster, G; Gan, K K; Ganguly, S; Gao, Y; Gao, Y S; Garay Walls, F M; García, C; García Navarro, J E; García Pascual, J A; Garcia-Sciveres, M; Gardner, R W; Garelli, N; Garonne, V; Gasnikova, K; Gatti, C; Gaudiello, A; Gaudio, G; Gavrilenko, I L; Gay, C; Gaycken, G; Gazis, E N; Gee, C N P; Geisen, J; Geisen, M; Geisler, M P; Gellerstedt, K; Gemme, C; Genest, M H; Geng, C; Gentile, S; Gentsos, C; George, S; Gerbaudo, D; Geßner, G; Ghasemi, S; Ghneimat, M; Giacobbe, B; Giagu, S; Giangiacomi, N; Giannetti, P; Gibson, S M; Gignac, M; Gilchriese, M; Gillberg, D; Gilles, G; Gingrich, D M; Giordani, M P; Giorgi, F M; Giraud, P F; Giromini, P; Giugliarelli, G; Giugni, D; Giuli, F; Giulini, M; Gjelsten, B K; Gkaitatzis, S; Gkialas, I; Gkougkousis, E L; Gkountoumis, P; Gladilin, L K; Glasman, C; Glatzer, J; Glaysher, P C F; Glazov, A; Goblirsch-Kolb, M; Godlewski, J; Goldfarb, S; Golling, T; Golubkov, D; Gomes, A; Gonçalo, R; Goncalves Gama, R; Goncalves Pinto Firmino Da Costa, J; Gonella, G; Gonella, L; Gongadze, A; Gonnella, F; Gonski, J L; González de la Hoz, S; Gonzalez-Sevilla, S; Goossens, L; Gorbounov, P A; Gordon, H A; Gorini, B; Gorini, E; Gorišek, A; Goshaw, A T; Gössling, C; Gostkin, M I; Gottardo, C A; Goudet, C R; Goujdami, D; Goussiou, A G; Govender, N; Goy, C; Gozani, E; Grabowska-Bold, I; Gradin, P O J; Graham, E C; Gramling, J; Gramstad, E; Grancagnolo, S; Gratchev, V; Gravila, P M; Gray, C; Gray, H M; Greenwood, Z D; Grefe, C; Gregersen, K; Gregor, I M; Grenier, P; Grevtsov, K; Griffiths, J; Grillo, A A; Grimm, K; Grinstein, S; Gris, Ph; Grivaz, J-F; Groh, S; Gross, E; Grosse-Knetter, J; Grossi, G C; Grout, Z J; Grummer, A; Guan, L; Guan, W; Guenther, J; Guescini, F; Guest, D; Gueta, O; Gugel, R; Gui, B; Guido, E; Guillemin, T; Guindon, S; Gul, U; Gumpert, C; Guo, J; Guo, W; Guo, Y; Gupta, R; Gurbuz, S; Gustavino, G; Gutelman, B J; Gutierrez, P; Gutierrez Ortiz, N G; Gutschow, C; Guyot, C; Guzik, M P; Gwenlan, C; Gwilliam, C B; Haas, A; Haber, C; Hadavand, H K; Haddad, N; Hadef, A; Hageböck, S; Hagihara, M; Hakobyan, H; Haleem, M; Haley, J; Halladjian, G; Hallewell, G D; Hamacher, K; Hamal, P; Hamano, K; Hamilton, A; Hamity, G N; Hamnett, P G; Han, K; Han, L; Han, S; Hanagaki, K; Hance, M; Handl, D M; Haney, B; Hankache, R; Hanke, P; Hansen, J B; Hansen, J D; Hansen, M C; Hansen, P H; Hara, K; Hard, A S; Harenberg, T; Hariri, F; Harkusha, S; Harrison, P F; Hartmann, N M; Hasegawa, Y; Hasib, A; Hassani, S; Haug, S; Hauser, R; Hauswald, L; Havener, L B; Havranek, M; Hawkes, C M; Hawkings, R J; Hayden, D; Hays, C P; Hays, J M; Hayward, H S; Haywood, S J; Heck, T; Hedberg, V; Heelan, L; Heer, S; Heidegger, K K; Heim, S; Heim, T; Heinemann, B; Heinrich, J J; Heinrich, L; Heinz, C; Hejbal, J; Helary, L; Held, A; Hellman, S; Helsens, C; Henderson, R C W; Heng, Y; Henkelmann, S; Henriques Correia, A M; Henrot-Versille, S; Herbert, G H; Herde, H; Herget, V; Hernández Jiménez, Y; Herr, H; Herten, G; Hertenberger, R; Hervas, L; Herwig, T C; Hesketh, G G; Hessey, N P; Hetherly, J W; Higashino, S; Higón-Rodriguez, E; Hildebrand, K; Hill, E; Hill, J C; Hiller, K H; Hillier, S J; Hils, M; Hinchliffe, I; Hirose, M; Hirschbuehl, D; Hiti, B; Hladik, O; Hlaluku, D R; Hoad, X; Hobbs, J; Hod, N; Hodgkinson, M C; Hodgson, P; Hoecker, A; Hoeferkamp, M R; Hoenig, F; Hohn, D; Holmes, T R; Holzbock, M; Homann, M; Honda, S; Honda, T; Hong, T M; Hooberman, B H; Hopkins, W H; Horii, Y; Horton, A J; Hostachy, J-Y; Hostiuc, A; Hou, S; Hoummada, A; Howarth, J; Hoya, J; Hrabovsky, M; Hrdinka, J; Hristova, I; Hrivnac, J; Hryn'ova, T; Hrynevich, A; Hsu, P J; Hsu, S-C; Hu, Q; Hu, S; Huang, Y; Hubacek, Z; Hubaut, F; Huegging, F; Huffman, T B; Hughes, E W; Huhtinen, M; Hunter, R F H; Huo, P; Hupe, A M; Huseynov, N; Huston, J; Huth, J; Hyneman, R; Iacobucci, G; Iakovidis, G; Ibragimov, I; Iconomidou-Fayard, L; Idrissi, Z; Iengo, P; Igonkina, O; Iizawa, T; Ikegami, Y; Ikeno, M; Ilchenko, Y; Iliadis, D; Ilic, N; Iltzsche, F; Introzzi, G; Ioannou, P; Iodice, M; Iordanidou, K; Ippolito, V; Isacson, M F; Ishijima, N; Ishino, M; Ishitsuka, M; Issever, C; Istin, S; Ito, F; Iturbe Ponce, J M; Iuppa, R; Iwasaki, H; Izen, J M; Izzo, V; Jabbar, S; Jackson, P; Jacobs, R M; Jain, V; Jakel, G; Jakobi, K B; Jakobs, K; Jakobsen, S; Jakoubek, T; Jamin, D O; Jana, D K; Jansky, R; Janssen, J; Janus, M; Janus, P A; Jarlskog, G; Javadov, N; Javůrek, T; Javurkova, M; Jeanneau, F; Jeanty, L; Jejelava, J; Jelinskas, A; Jenni, P; Jeske, C; Jézéquel, S; Ji, H; Jia, J; Jiang, H; Jiang, Y; Jiang, Z; Jiggins, S; Jimenez Pena, J; Jin, S; Jinaru, A; Jinnouchi, O; Jivan, H; Johansson, P; Johns, K A; Johnson, C A; Johnson, W J; Jon-And, K; Jones, R W L; Jones, S D; Jones, S; Jones, T J; Jongmanns, J; Jorge, P M; Jovicevic, J; Ju, X; Juste Rozas, A; Kaczmarska, A; Kado, M; Kagan, H; Kagan, M; Kahn, S J; Kaji, T; Kajomovitz, E; Kalderon, C W; Kaluza, A; Kama, S; Kamenshchikov, A; Kanjir, L; Kano, Y; Kantserov, V A; Kanzaki, J; Kaplan, B; Kaplan, L S; Kar, D; Karakostas, K; Karastathis, N; Kareem, M J; Karentzos, E; Karpov, S N; Karpova, Z M; Kartvelishvili, V; Karyukhin, A N; Kasahara, K; Kashif, L; Kass, R D; Kastanas, A; Kataoka, Y; Kato, C; Katre, A; Katzy, J; Kawade, K; Kawagoe, K; Kawamoto, T; Kawamura, G; Kay, E F; Kazanin, V F; Keeler, R; Kehoe, R; Keller, J S; Kellermann, E; Kempster, J J; Kendrick, J; Keoshkerian, H; Kepka, O; Kerševan, B P; Kersten, S; Keyes, R A; Khader, M; Khalil-Zada, F; Khanov, A; Kharlamov, A G; Kharlamova, T; Khodinov, A; Khoo, T J; Khovanskiy, V; Khramov, E; Khubua, J; Kido, S; Kiehn, M; Kilby, C R; Kim, H Y; Kim, S H; Kim, Y K; Kimura, N; Kind, O M; King, B T; Kirchmeier, D; Kirk, J; Kiryunin, A E; Kishimoto, T; Kisielewska, D; Kitali, V; Kivernyk, O; Kladiva, E; Klapdor-Kleingrothaus, T; Klein, M H; Klein, M; Klein, U; Kleinknecht, K; Klimek, P; Klimentov, A; Klingenberg, R; Klingl, T; Klioutchnikova, T; Klitzner, F F; Kluge, E-E; Kluit, P; Kluth, S; Kneringer, E; Knoops, E B F G; Knue, A; Kobayashi, A; Kobayashi, D; Kobayashi, T; Kobel, M; Kocian, M; Kodys, P; Koffas, T; Koffeman, E; Köhler, N M; Koi, T; Kolb, M; Koletsou, I; Kondo, T; Kondrashova, N; Köneke, K; König, A C; Kono, T; Konoplich, R; Konstantinidis, N; Konya, B; Kopeliansky, R; Koperny, S; Korcyl, K; Kordas, K; Korn, A; Korolkov, I; Korolkova, E V; Kortner, O; Kortner, S; Kosek, T; Kostyukhin, V V; Kotwal, A; Koulouris, A; Kourkoumeli-Charalampidi, A; Kourkoumelis, C; Kourlitis, E; Kouskoura, V; Kowalewska, A B; Kowalewski, R; Kowalski, T Z; Kozakai, C; Kozanecki, W; Kozhin, A S; Kramarenko, V A; Kramberger, G; Krasnopevtsev, D; Krasny, M W; Krasznahorkay, A; Krauss, D; Kremer, J A; Kretzschmar, J; Kreutzfeldt, K; Krieger, P; Krizka, K; Kroeninger, K; Kroha, H; Kroll, J; Kroll, J; Kroseberg, J; Krstic, J; Kruchonak, U; Krüger, H; Krumnack, N; Kruse, M C; Kubota, T; Kucuk, H; Kuday, S; Kuechler, J T; Kuehn, S; Kugel, A; Kuger, F; Kuhl, T; Kukhtin, V; Kukla, R; Kulchitsky, Y; Kuleshov, S; Kulinich, Y P; Kuna, M; Kunigo, T; Kupco, A; Kupfer, T; Kuprash, O; Kurashige, H; Kurchaninov, L L; Kurochkin, Y A; Kurth, M G; Kuwertz, E S; Kuze, M; Kvita, J; Kwan, T; La Rosa, A; La Rosa Navarro, J L; La Rotonda, L; La Ruffa, F; Lacasta, C; Lacava, F; Lacey, J; Lack, D P J; Lacker, H; Lacour, D; Ladygin, E; Lafaye, R; Laforge, B; Lai, S; Lammers, S; Lampl, W; Lançon, E; Landgraf, U; Landon, M P J; Lanfermann, M C; Lang, V S; Lange, J C; Langenberg, R J; Lankford, A J; Lanni, F; Lantzsch, K; Lanza, A; Lapertosa, A; Laplace, S; Laporte, J F; Lari, T; Lasagni Manghi, F; Lassnig, M; Lau, T S; Laurelli, P; Law, A T; Laycock, P; Lazovich, T; Lazzaroni, M; Le, B; Le Dortz, O; Le Guirriec, E; Le Quilleuc, E P; LeBlanc, M; LeCompte, T; Ledroit-Guillon, F; Lee, C A; Lee, G R; Lee, S C; Lee, L; Lefebvre, B; Lefebvre, G; Lefebvre, M; Legger, F; Leggett, C; Lehmann Miotto, G; Lei, X; Leight, W A; Leite, M A L; Leitner, R; Lellouch, D; Lemmer, B; Leney, K J C; Lenz, T; Lenzi, B; Leone, R; Leone, S; Leonidopoulos, C; Lerner, G; Leroy, C; Les, R; Lesage, A A J; Lester, C G; Levchenko, M; Levêque, J; Levin, D; Levinson, L J; Levy, M; Lewis, D; Li, B; Li, C-Q; Li, H; Li, L; Li, Q; Li, Q; Li, S; Li, X; Li, Y; Liang, Z; Liberti, B; Liblong, A; Lie, K; Limosani, A; Lin, C Y; Lin, K; Lin, S C; Lin, T H; Linck, R A; Lindquist, B E; Lionti, A E; Lipeles, E; Lipniacka, A; Lisovyi, M; Liss, T M; Lister, A; Litke, A M; Liu, B; Liu, H; Liu, H; Liu, J K K; Liu, J B; Liu, K; Liu, L; Liu, M; Liu, Y L; Liu, Y; Livan, M; Lleres, A; Llorente Merino, J; Lloyd, S L; Lo, C Y; Lo Sterzo, F; Lobodzinska, E M; Loch, P; Loebinger, F K; Loesle, A; Loew, K M; Lohse, T; Lohwasser, K; Lokajicek, M; Long, B A; Long, J D; Long, R E; Longo, L; Looper, K A; Lopez, J A; Lopez Paz, I; Lopez Solis, A; Lorenz, J; Lorenzo Martinez, N; Losada, M; Lösel, P J; Lou, X; Lounis, A; Love, J; Love, P A; Lu, H; Lu, N; Lu, Y J; Lubatti, H J; Luci, C; Lucotte, A; Luedtke, C; Luehring, F; Lukas, W; Luminari, L; Lund-Jensen, B; Lutz, M S; Luzi, P M; Lynn, D; Lysak, R; Lytken, E; Lyu, F; Lyubushkin, V; Ma, H; Ma, L L; Ma, Y; Maccarrone, G; Macchiolo, A; Macdonald, C M; Maček, B; Machado Miguens, J; Madaffari, D; Madar, R; Mader, W F; Madsen, A; Madysa, N; Maeda, J; Maeland, S; Maeno, T; Maevskiy, A S; Magerl, V; Maiani, C; Maidantchik, C; Maier, T; Maio, A; Majersky, O; Majewski, S; Makida, Y; Makovec, N; Malaescu, B; Malecki, Pa; Maleev, V P; Malek, F; Mallik, U; Malon, D; Malone, C; Maltezos, S; Malyukov, S; Mamuzic, J; Mancini, G; Mandić, I; Maneira, J; Manhaes de Andrade Filho, L; Manjarres Ramos, J; Mankinen, K H; Mann, A; Manousos, A; Mansoulie, B; Mansour, J D; Mantifel, R; Mantoani, M; Manzoni, S; Mapelli, L; Marceca, G; March, L; Marchese, L; Marchiori, G; Marcisovsky, M; Marin Tobon, C A; Marjanovic, M; Marley, D E; Marroquim, F; Marsden, S P; Marshall, Z; Martensson, M U F; Marti-Garcia, S; Martin, C B; Martin, T A; Martin, V J; Martin Dit Latour, B; Martinez, M; Martinez Outschoorn, V I; Martin-Haugh, S; Martoiu, V S; Martyniuk, A C; Marzin, A; Masetti, L; Mashimo, T; Mashinistov, R; Masik, J; Maslennikov, A L; Mason, L H; Massa, L; Mastrandrea, P; Mastroberardino, A; Masubuchi, T; Mättig, P; Maurer, J; Maxfield, S J; Maximov, D A; Mazini, R; Maznas, I; Mazza, S M; Mc Fadden, N C; Mc Goldrick, G; Mc Kee, S P; McCarn, A; McCarthy, R L; McCarthy, T G; McClymont, L I; McDonald, E F; Mcfayden, J A; Mchedlidze, G; McMahon, S J; McNamara, P C; McNicol, C J; McPherson, R A; Meadows, Z A; Meehan, S; Megy, T J; Mehlhase, S; Mehta, A; Meideck, T; Meier, K; Meirose, B; Melini, D; Mellado Garcia, B R; Mellenthin, J D; Melo, M; Meloni, F; Melzer, A; Menary, S B; Meng, L; Meng, X T; Mengarelli, A; Menke, S; Meoni, E; Mergelmeyer, S; Merlassino, C; Mermod, P; Merola, L; Meroni, C; Merritt, F S; Messina, A; Metcalfe, J; Mete, A S; Meyer, C; Meyer, J-P; Meyer, J; Meyer Zu Theenhausen, H; Miano, F; Middleton, R P; Miglioranzi, S; Mijović, L; Mikenberg, G; Mikestikova, M; Mikuž, M; Milesi, M; Milic, A; Millar, D A; Miller, D W; Milov, A; Milstead, D A; Minaenko, A A; Minashvili, I A; Mincer, A I; Mindur, B; Mineev, M; Minegishi, Y; Ming, Y; Mir, L M; Mirto, A; Mistry, K P; Mitani, T; Mitrevski, J; Mitsou, V A; Miucci, A; Miyagawa, P S; Mizukami, A; Mjörnmark, J U; Mkrtchyan, T; Mlynarikova, M; Moa, T; Mochizuki, K; Mogg, P; Mohapatra, S; Molander, S; Moles-Valls, R; Mondragon, M C; Mönig, K; Monk, J; Monnier, E; Montalbano, A; Montejo Berlingen, J; Monticelli, F; Monzani, S; Moore, R W; Morange, N; Moreno, D; Moreno Llácer, M; Morettini, P; Morgenstern, M; Morgenstern, S; Mori, D; Mori, T; Morii, M; Morinaga, M; Morisbak, V; Morley, A K; Mornacchi, G; Morris, J D; Morvaj, L; Moschovakos, P; Mosidze, M; Moss, H J; Moss, J; Motohashi, K; Mount, R; Mountricha, E; Moyse, E J W; Muanza, S; Mueller, F; Mueller, J; Mueller, R S P; Muenstermann, D; Mullen, P; Mullier, G A; Munoz Sanchez, F J; Murray, W J; Musheghyan, H; Muškinja, M; Mwewa, C; Myagkov, A G; Myers, J; Myska, M; Nachman, B P; Nackenhorst, O; Nagai, K; Nagai, R; Nagano, K; Nagasaka, Y; Nagata, K; Nagel, M; Nagy, E; Nairz, A M; Nakahama, Y; Nakamura, K; Nakamura, T; Nakano, I; Naranjo Garcia, R F; Narayan, R; Narrias Villar, D I; Naryshkin, I; Naumann, T; Navarro, G; Nayyar, R; Neal, H A; Nechaeva, P Yu; Neep, T J; Negri, A; Negrini, M; Nektarijevic, S; Nellist, C; Nelson, A; Nelson, M E; Nemecek, S; Nemethy, P; Nessi, M; Neubauer, M S; Neumann, M; Newman, P R; Ng, T Y; Ng, Y S; Nguyen Manh, T; Nickerson, R B; Nicolaidou, R; Nielsen, J; Nikiforou, N; Nikolaenko, V; Nikolic-Audit, I; Nikolopoulos, K; Nilsson, P; Ninomiya, Y; Nisati, A; Nishu, N; Nisius, R; Nitsche, I; Nitta, T; Nobe, T; Noguchi, Y; Nomachi, M; Nomidis, I; Nomura, M A; Nooney, T; Nordberg, M; Norjoharuddeen, N; Novgorodova, O; Novotny, R; Nozaki, M; Nozka, L; Ntekas, K; Nurse, E; Nuti, F; O'Connor, K; O'Neil, D C; O'Rourke, A A; O'Shea, V; Oakham, F G; Oberlack, H; Obermann, T; Ocariz, J; Ochi, A; Ochoa, I; Ochoa-Ricoux, J P; Oda, S; Odaka, S; Oh, A; Oh, S H; Ohm, C C; Ohman, H; Oide, H; Okawa, H; Okumura, Y; Okuyama, T; Olariu, A; Oleiro Seabra, L F; Olivares Pino, S A; Oliveira Damazio, D; Oliver, J L; Olsson, M J R; Olszewski, A; Olszowska, J; Onofre, A; Onogi, K; Onyisi, P U E; Oppen, H; Oreglia, M J; Oren, Y; Orestano, D; Orgill, E C; Orlando, N; Orr, R S; Osculati, B; Ospanov, R; Otero Y Garzon, G; Otono, H; Ouchrif, M; Ould-Saada, F; Ouraou, A; Oussoren, K P; Ouyang, Q; Owen, M; Owen, R E; Ozcan, V E; Ozturk, N; Pachal, K; Pacheco Pages, A; Pacheco Rodriguez, L; Padilla Aranda, C; Pagan Griso, S; Paganini, M; Paige, F; Palacino, G; Palazzo, S; Palestini, S; Palka, M; Pallin, D; Panagiotopoulou, E St; Panagoulias, I; Pandini, C E; Panduro Vazquez, J G; Pani, P; Panitkin, S; Pantea, D; Paolozzi, L; Papadopoulou, Th D; Papageorgiou, K; Paramonov, A; Paredes Hernandez, D; Parker, A J; Parker, M A; Parker, K A; Parodi, F; Parsons, J A; Parzefall, U; Pascuzzi, V R; Pasner, J M; Pasqualucci, E; Passaggio, S; Pastore, Fr; Pataraia, S; Pater, J R; Pauly, T; Pearson, B; Pedraza Lopez, S; Pedro, R; Peleganchuk, S V; Penc, O; Peng, C; Peng, H; Penwell, J; Peralva, B S; Perego, M M; Perepelitsa, D V; Peri, F; Perini, L; Pernegger, H; Perrella, S; Peschke, R; Peshekhonov, V D; Peters, K; Peters, R F Y; Petersen, B A; Petersen, T C; Petit, E; Petridis, A; Petridou, C; Petroff, P; Petrolo, E; Petrov, M; Petrucci, F; Pettersson, N E; Peyaud, A; Pezoa, R; Pham, T; Phillips, F H; Phillips, P W; Piacquadio, G; Pianori, E; Picazio, A; Pickering, M A; Piegaia, R; Pilcher, J E; Pilkington, A D; Pinamonti, M; Pinfold, J L; Pirumov, H; Pitt, M; Pleier, M-A; Pleskot, V; Plotnikova, E; Pluth, D; Podberezko, P; Poettgen, R; Poggi, R; Poggioli, L; Pogrebnyak, I; Pohl, D; Pokharel, I; Polesello, G; Poley, A; Policicchio, A; Polifka, R; Polini, A; Pollard, C S; Polychronakos, V; Pommès, K; Ponomarenko, D; Pontecorvo, L; Popeneciu, G A; Portillo Quintero, D M; Pospisil, S; Potamianos, K; Potrap, I N; Potter, C J; Potti, H; Poulsen, T; Poveda, J; Pozo Astigarraga, M E; Pralavorio, P; Prell, S; Price, D; Primavera, M; Prince, S; Proklova, N; Prokofiev, K; Prokoshin, F; Protopopescu, S; Proudfoot, J; Przybycien, M; Puri, A; Puzo, P; Qian, J; Qin, Y; Quadt, A; Queitsch-Maitland, M; Quilty, D; Raddum, S; Radeka, V; Radescu, V; Radhakrishnan, S K; Radloff, P; Rados, P; Ragusa, F; Rahal, G; Raine, J A; Rajagopalan, S; Rashid, T; Raspopov, S; Ratti, M G; Rauch, D M; Rauscher, F; Rave, S; Ravinovich, I; Rawling, J H; Raymond, M; Read, A L; Readioff, N P; Reale, M; Rebuzzi, D M; Redelbach, A; Redlinger, G; Reece, R; Reed, R G; Reeves, K; Rehnisch, L; Reichert, J; Reiss, A; Rembser, C; Ren, H; Rescigno, M; Resconi, S; Resseguie, E D; Rettie, S; Reynolds, E; Rezanova, O L; Reznicek, P; Rezvani, R; Richter, R; Richter, S; Richter-Was, E; Ricken, O; Ridel, M; Rieck, P; Riegel, C J; Rieger, J; Rifki, O; Rijssenbeek, M; Rimoldi, A; Rimoldi, M; Rinaldi, L; Ripellino, G; Ristić, B; Ritsch, E; Riu, I; Rivera Vergara, J C; Rizatdinova, F; Rizvi, E; Rizzi, C; Roberts, R T; Robertson, S H; Robichaud-Veronneau, A; Robinson, D; Robinson, J E M; Robson, A; Rocco, E; Roda, C; Rodina, Y; Rodriguez Bosca, S; Rodriguez Perez, A; Rodriguez Rodriguez, D; Rodríguez Vera, A M; Roe, S; Rogan, C S; Røhne, O; Roloff, J; Romaniouk, A; Romano, M; Romano Saez, S M; Romero Adam, E; Rompotis, N; Ronzani, M; Roos, L; Rosati, S; Rosbach, K; Rose, P; Rosien, N-A; Rossi, E; Rossi, L P; Rosten, J H N; Rosten, R; Rotaru, M; Rothberg, J; Rousseau, D; Roy, D; Rozanov, A; Rozen, Y; Ruan, X; Rubbo, F; Rühr, F; Ruiz-Martinez, A; Rurikova, Z; Rusakovich, N A; Russell, H L; Rutherfoord, J P; Ruthmann, N; Rüttinger, E M; Ryabov, Y F; Rybar, M; Rybkin, G; Ryu, S; Ryzhov, A; Rzehorz, G F; Saavedra, A F; Sabato, G; Sacerdoti, S; Sadrozinski, H F-W; Sadykov, R; Safai Tehrani, F; Saha, P; Sahinsoy, M; Saimpert, M; Saito, M; Saito, T; Sakamoto, H; Sakurai, Y; Salamanna, G; Salazar Loyola, J E; Salek, D; Sales De Bruin, P H; Salihagic, D; Salnikov, A; Salt, J; Salvatore, D; Salvatore, F; Salvucci, A; Salzburger, A; Sammel, D; Sampsonidis, D; Sampsonidou, D; Sánchez, J; Sanchez Pineda, A; Sandaker, H; Sandbach, R L; Sander, C O; Sandhoff, M; Sandoval, C; Sankey, D P C; Sannino, M; Sano, Y; Sansoni, A; Santoni, C; Santos, H; Santoyo Castillo, I; Sapronov, A; Saraiva, J G; Sasaki, O; Sato, K; Sauvan, E; Savage, G; Savard, P; Savic, N; Sawada, R; Sawyer, C; Sawyer, L; Sbarra, C; Sbrizzi, A; Scanlon, T; Scannicchio, D A; Schaarschmidt, J; Schacht, P; Schachtner, B M; Schaefer, D; Schaefer, L; Schaeffer, J; Schaepe, S; Schäfer, U; Schaffer, A C; Schaile, D; Schamberger, R D; Schegelsky, V A; Scheirich, D; Schenck, F; Schernau, M; Schiavi, C; Schier, S; Schildgen, L K; Schillo, C; Schioppa, E J; Schioppa, M; Schlenker, S; Schmidt-Sommerfeld, K R; Schmieden, K; Schmitt, C; Schmitt, S; Schmitz, S; Schnoor, U; Schoeffel, L; Schoening, A; Schoenrock, B D; Schopf, E; Schott, M; Schouwenberg, J F P; Schovancova, J; Schramm, S; Schuh, N; Schulte, A; Schultens, M J; Schultz-Coulon, H-C; Schumacher, M; Schumm, B A; Schune, Ph; Schwartzman, A; Schwarz, T A; Schweiger, H; Schwemling, Ph; Schwienhorst, R; Schwindling, J; Sciandra, A; Sciolla, G; Scornajenghi, M; Scuri, F; Scutti, F; Searcy, J; Seema, P; Seidel, S C; Seiden, A; Seixas, J M; Sekhniaidze, G; Sekhon, K; Sekula, S J; Semprini-Cesari, N; Senkin, S; Serfon, C; Serin, L; Serkin, L; Sessa, M; Seuster, R; Severini, H; Šfiligoj, T; Sforza, F; Sfyrla, A; Shabalina, E; Shaikh, N W; Shan, L Y; Shang, R; Shank, J T; Shapiro, M; Shatalov, P B; Shaw, K; Shaw, S M; Shcherbakova, A; Shehu, C Y; Shen, Y; Sherafati, N; Sherman, A D; Sherwood, P; Shi, L; Shimizu, S; Shimmin, C O; Shimojima, M; Shipsey, I P J; Shirabe, S; Shiyakova, M; Shlomi, J; Shmeleva, A; Shoaleh Saadi, D; Shochet, M J; Shojaii, S; Shope, D R; Shrestha, S; Shulga, E; Shupe, M A; Sicho, P; Sickles, A M; Sidebo, P E; Sideras Haddad, E; Sidiropoulou, O; Sidoti, A; Siegert, F; Sijacki, Dj; Silva, J; Silva, M; Silverstein, S B; Simak, V; Simic, L; Simion, S; Simioni, E; Simmons, B; Simon, M; Sinervo, P; Sinev, N B; Sioli, M; Siragusa, G; Siral, I; Sivoklokov, S Yu; Sjölin, J; Skinner, M B; Skubic, P; Slater, M; Slavicek, T; Slawinska, M; Sliwa, K; Slovak, R; Smakhtin, V; Smart, B H; Smiesko, J; Smirnov, N; Smirnov, S Yu; Smirnov, Y; Smirnova, L N; Smirnova, O; Smith, J W; Smith, M N K; Smith, R W; Smizanska, M; Smolek, K; Snesarev, A A; Snyder, I M; Snyder, S; Sobie, R; Socher, F; Soffa, A M; Soffer, A; Søgaard, A; Soh, D A; Sokhrannyi, G; Solans Sanchez, C A; Solar, M; Soldatov, E Yu; Soldevila, U; Solodkov, A A; Soloshenko, A; Solovyanov, O V; Solovyev, V; Sommer, P; Son, H; Song, W; Sopczak, A; Sosa, D; Sotiropoulou, C L; Sottocornola, S; Soualah, R; Soukharev, A M; South, D; Sowden, B C; Spagnolo, S; Spalla, M; Spangenberg, M; Spanò, F; Sperlich, D; Spettel, F; Spieker, T M; Spighi, R; Spigo, G; Spiller, L A; Spousta, M; St Denis, R D; Stabile, A; Stamen, R; Stamm, S; Stanecka, E; Stanek, R W; Stanescu, C; Stanitzki, M M; Stapf, B S; Stapnes, S; Starchenko, E A; Stark, G H; Stark, J; Stark, S H; Staroba, P; Starovoitov, P; Stärz, S; Staszewski, R; Stegler, M; Steinberg, P; Stelzer, B; Stelzer, H J; Stelzer-Chilton, O; Stenzel, H; Stevenson, T J; Stewart, G A; Stockton, M C; Stoebe, M; Stoicea, G; Stolte, P; Stonjek, S; Stradling, A R; Straessner, A; Stramaglia, M E; Strandberg, J; Strandberg, S; Strauss, M; Strizenec, P; Ströhmer, R; Strom, D M; Stroynowski, R; Strubig, A; Stucci, S A; Stugu, B; Styles, N A; Su, D; Su, J; Suchek, S; Sugaya, Y; Suk, M; Sulin, V V; Sultan, Dms; Sultansoy, S; Sumida, T; Sun, S; Sun, X; Suruliz, K; Suster, C J E; Sutton, M R; Suzuki, S; Svatos, M; Swiatlowski, M; Swift, S P; Sydorenko, A; Sykora, I; Sykora, T; Ta, D; Tackmann, K; Taenzer, J; Taffard, A; Tafirout, R; Tahirovic, E; Taiblum, N; Takai, H; Takashima, R; Takasugi, E H; Takeda, K; Takeshita, T; Takubo, Y; Talby, M; Talyshev, A A; Tanaka, J; Tanaka, M; Tanaka, R; Tanioka, R; Tannenwald, B B; Tapia Araya, S; Tapprogge, S; Tarem, S; Tartarelli, G F; Tas, P; Tasevsky, M; Tashiro, T; Tassi, E; Tavares Delgado, A; Tayalati, Y; Taylor, A C; Taylor, A J; Taylor, G N; Taylor, P T E; Taylor, W; Teixeira-Dias, P; Temple, D; Ten Kate, H; Teng, P K; Teoh, J J; Tepel, F; Terada, S; Terashi, K; Terron, J; Terzo, S; Testa, M; Teuscher, R J; Thais, S J; Theveneaux-Pelzer, T; Thiele, F; Thomas, J P; Thomas-Wilsker, J; Thompson, P D; Thompson, A S; Thomsen, L A; Thomson, E; Tian, Y; Ticse Torres, R E; Tikhomirov, V O; Tikhonov, Yu A; Timoshenko, S; Tipton, P; Tisserant, S; Todome, K; Todorova-Nova, S; Todt, S; Tojo, J; Tokár, S; Tokushuku, K; Tolley, E; Tomlinson, L; Tomoto, M; Tompkins, L; Toms, K; Tong, B; Tornambe, P; Torrence, E; Torres, H; Torró Pastor, E; Toth, J; Touchard, F; Tovey, D R; Treado, C J; Trefzger, T; Tresoldi, F; Tricoli, A; Trigger, I M; Trincaz-Duvoid, S; Tripiana, M F; Trischuk, W; Trocmé, B; Trofymov, A; Troncon, C; Trovatelli, M; Truong, L; Trzebinski, M; Trzupek, A; Tsang, K W; Tseng, J C-L; Tsiareshka, P V; Tsirintanis, N; Tsiskaridze, S; Tsiskaridze, V; Tskhadadze, E G; Tsukerman, I I; Tsulaia, V; Tsuno, S; Tsybychev, D; Tu, Y; Tudorache, A; Tudorache, V; Tulbure, T T; Tuna, A N; Turchikhin, S; Turgeman, D; Turk Cakir, I; Turra, R; Tuts, P M; Ucchielli, G; Ueda, I; Ughetto, M; Ukegawa, F; Unal, G; Undrus, A; Unel, G; Ungaro, F C; Unno, Y; Uno, K; Urban, J; Urquijo, P; Urrejola, P; Usai, G; Usui, J; Vacavant, L; Vacek, V; Vachon, B; Vadla, K O H; Vaidya, A; Valderanis, C; Valdes Santurio, E; Valente, M; Valentinetti, S; Valero, A; Valéry, L; Vallier, A; Valls Ferrer, J A; Van Den Wollenberg, W; van der Graaf, H; van Gemmeren, P; Van Nieuwkoop, J; van Vulpen, I; van Woerden, M C; Vanadia, M; Vandelli, W; Vaniachine, A; Vankov, P; Vardanyan, G; Vari, R; Varnes, E W; Varni, C; Varol, T; Varouchas, D; Vartapetian, A; Varvell, K E; Vasquez, J G; Vasquez, G A; Vazeille, F; Vazquez Furelos, D; Vazquez Schroeder, T; Veatch, J; Veeraraghavan, V; Veloce, L M; Veloso, F; Veneziano, S; Ventura, A; Venturi, M; Venturi, N; Vercesi, V; Verducci, M; Verkerke, W; Vermeulen, A T; Vermeulen, J C; Vetterli, M C; Viaux Maira, N; Viazlo, O; Vichou, I; Vickey, T; Vickey Boeriu, O E; Viehhauser, G H A; Viel, S; Vigani, L; Villa, M; Villaplana Perez, M; Vilucchi, E; Vincter, M G; Vinogradov, V B; Vishwakarma, A; Vittori, C; Vivarelli, I; Vlachos, S; Vogel, M; Vokac, P; Volpi, G; von Buddenbrock, S E; von der Schmitt, H; von Toerne, E; Vorobel, V; Vorobev, K; Vos, M; Voss, R; Vossebeld, J H; Vranjes, N; Vranjes Milosavljevic, M; Vrba, V; Vreeswijk, M; Vuillermet, R; Vukotic, I; Wagner, P; Wagner, W; Wagner-Kuhr, J; Wahlberg, H; Wahrmund, S; Wakamiya, K; Walder, J; Walker, R; Walkowiak, W; Wallangen, V; Wang, A M; Wang, C; Wang, F; Wang, H; Wang, H; Wang, J; Wang, J; Wang, Q; Wang, R-J; Wang, R; Wang, S M; Wang, T; Wang, W; Wang, W; Wang, Z; Wanotayaroj, C; Warburton, A; Ward, C P; Wardrope, D R; Washbrook, A; Watkins, P M; Watson, A T; Watson, M F; Watts, G; Watts, S; Waugh, B M; Webb, A F; Webb, S; Weber, M S; Weber, S M; Weber, S A; Webster, J S; Weidberg, A R; Weinert, B; Weingarten, J; Weirich, M; Weiser, C; Wells, P S; Wenaus, T; Wengler, T; Wenig, S; Wermes, N; Werner, M D; Werner, P; Wessels, M; Weston, T D; Whalen, K; Whallon, N L; Wharton, A M; White, A S; White, A; White, M J; White, R; Whiteson, D; Whitmore, B W; Wickens, F J; Wiedenmann, W; Wielers, M; Wiglesworth, C; Wiik-Fuchs, L A M; Wildauer, A; Wilk, F; Wilkens, H G; Williams, H H; Williams, S; Willis, C; Willocq, S; Wilson, J A; Wingerter-Seez, I; Winkels, E; Winklmeier, F; Winston, O J; Winter, B T; Wittgen, M; Wobisch, M; Wolf, A; Wolf, T M H; Wolff, R; Wolter, M W; Wolters, H; Wong, V W S; Woods, N L; Worm, S D; Wosiek, B K; Wotschack, J; Wozniak, K W; Wu, M; Wu, S L; Wu, X; Wu, Y; Wyatt, T R; Wynne, B M; Xella, S; Xi, Z; Xia, L; Xu, D; Xu, L; Xu, T; Xu, W; Yabsley, B; Yacoob, S; Yajima, K; Yallup, D P; Yamaguchi, D; Yamaguchi, Y; Yamamoto, A; Yamanaka, T; Yamane, F; Yamatani, M; Yamazaki, T; Yamazaki, Y; Yan, Z; Yang, H; Yang, H; Yang, S; Yang, Y; Yang, Z; Yao, W-M; Yap, Y C; Yasu, Y; Yatsenko, E; Yau Wong, K H; Ye, J; Ye, S; Yeletskikh, I; Yigitbasi, E; Yildirim, E; Yorita, K; Yoshihara, K; Young, C; Young, C J S; Yu, J; Yu, J; Yuen, S P Y; Yusuff, I; Zabinski, B; Zacharis, G; Zaidan, R; Zaitsev, A M; Zakharchuk, N; Zalieckas, J; Zaman, A; Zambito, S; Zanzi, D; Zeitnitz, C; Zemaityte, G; Zeng, J C; Zeng, Q; Zenin, O; Ženiš, T; Zerwas, D; Zhang, D; Zhang, D; Zhang, F; Zhang, G; Zhang, H; Zhang, J; Zhang, L; Zhang, L; Zhang, M; Zhang, P; Zhang, R; Zhang, R; Zhang, X; Zhang, Y; Zhang, Z; Zhao, X; Zhao, Y; Zhao, Z; Zhemchugov, A; Zhou, B; Zhou, C; Zhou, L; Zhou, M; Zhou, M; Zhou, N; Zhou, Y; Zhu, C G; Zhu, H; Zhu, J; Zhu, Y; Zhuang, X; Zhukov, K; Zibell, A; Zieminska, D; Zimine, N I; Zimmermann, S; Zinonos, Z; Zinser, M; Ziolkowski, M; Živković, L; Zobernig, G; Zoccoli, A; Zou, R; Zur Nedden, M; Zwalinski, L
2018-05-18
A search for the narrow structure, X(5568), reported by the D0 Collaboration in the decay sequence X→B_{s}^{0}π^{±}, B_{s}^{0}→J/ψϕ, is presented. The analysis is based on a data sample recorded with the ATLAS detector at the LHC corresponding to 4.9 fb^{-1} of pp collisions at 7 TeV and 19.5 fb^{-1} at 8 TeV. No significant signal was found. Upper limits on the number of signal events, with properties corresponding to those reported by D0, and on the X production rate relative to B_{s}^{0} mesons, ρ_{X}, were determined at 95% confidence level. The results are N(X)<382 and ρ_{X}<0.015 for B_{s}^{0} mesons with transverse momenta above 10 GeV, and N(X)<356 and ρ_{X}<0.016 for transverse momenta above 15 GeV. Limits are also set for potential B_{s}^{0}π^{±} resonances in the mass range 5550 to 5700 MeV.
Pan, Zhen; Kaplinghat, Manoj; Knox, Lloyd
2018-05-01
In this paper, we conduct a search in the latest large-scale structure measurements for signatures of the dark matter-dark radiation interaction proposed by Buen-Abad et al. (2015). We show that prior claims of an inference of this interaction at ˜3 σ significance rely on a use of the Sunyaev-Zeldovich cluster mass function that ignores uncertainty in the mass-observable relationship. Including this uncertainty we find that the inferred level of interaction remains consistent with the data, but so does zero interaction; i.e., there is no longer a preference for nonzero interaction. We also point out that inference of the shape and amplitude of the matter power spectrum from Ly α forest measurements is highly inconsistent with the predictions of the Λ CDM model conditioned on Planck cosmic microwave background temperature, polarization, and lensing power spectra, and that the dark matter-dark radiation model can restore that consistency. We also phenomenologically generalize the model of Buen-Abad et al. (2015) to allow for interaction rates with different scalings with temperature, and find that the original scaling is preferred by the data.
Argall, M. R.; Caide, A.; Chen, L.; Torbert, R. B.
2012-12-01
Magnetometers have been used to measure terrestrial and extraterrestrial magnetic fields in space exploration ever since Sputnik 3. Modern space missions, such as Cluster, RBSP, and MMS incorporate both search coil magnetometers (SCMs) and fluxgate magnetometers (FGMs) in their instrument suites: FGMs work well at low frequencies while SCMs perform better at high frequencies. In analyzing the noise floor of these instruments, a cross-over region is apparent around 0.3-1.5Hz. The satellite separation of MMS and average speeds of field convection and plasma flows at the subsolar magnetopause make this a crucial range for the upcoming MMS mission. The method presented here combines the signals from SCM and FGM by taking a weighted average of both in this frequency range in order to draw out key features, such as narrow current sheet structures, that would otherwise not be visible. The technique is applied to burst mode Cluster data for reported magnetopause and magnetotail reconnection events to demonstrate the power of the combined data. This technique is also applied to data from the the EMFISIS instrument on the RBSP mission. The authors acknowledge and thank the FGM and STAFF team for the use of their data from the CLUSTER Active Archive.
Search for a Structure in the Bs0π± Invariant Mass Spectrum with the ATLAS Experiment
Aaboud, M.; Aad, G.; Abbott, B.; Abdinov, O.; Abeloos, B.; Abidi, S. H.; Abouzeid, O. S.; Abraham, N. L.; Abramowicz, H.; Abreu, H.; Abulaiti, Y.; Acharya, B. S.; Adachi, S.; Adamczyk, L.; Adelman, J.; Adersberger, M.; Adye, T.; Affolder, A. A.; Afik, Y.; Agheorghiesei, C.; Aguilar-Saavedra, J. A.; Ahlen, S. P.; Ahmadov, F.; Aielli, G.; Akatsuka, S.; Akerstedt, H.; Åkesson, T. P. A.; Akilli, E.; Akimov, A. V.; Alberghi, G. L.; Albert, J.; Albicocco, P.; Alconada Verzini, M. J.; Alderweireldt, S.; Aleksa, M.; Aleksandrov, I. N.; Alexa, C.; Alexander, G.; Alexopoulos, T.; Alhroob, M.; Ali, B.; Aliev, M.; Alimonti, G.; Alison, J.; Alkire, S. P.; Allbrooke, B. M. M.; Allen, B. W.; Allport, P. P.; Aloisio, A.; Alonso, A.; Alonso, F.; Alpigiani, C.; Alshehri, A. A.; Alstaty, M. I.; Alvarez Gonzalez, B.; Álvarez Piqueras, D.; Alviggi, M. G.; Amadio, B. T.; Amaral Coutinho, Y.; Amelung, C.; Amidei, D.; Amor Dos Santos, S. P.; Amoroso, S.; Anastopoulos, C.; Ancu, L. S.; Andari, N.; Andeen, T.; Anders, C. F.; Anders, J. K.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Angelidakis, S.; Angelozzi, I.; Angerami, A.; Anisenkov, A. V.; Anjos, N.; Annovi, A.; Antel, C.; Antonelli, M.; Antonov, A.; Antrim, D. J.; Anulli, F.; Aoki, M.; Aperio Bella, L.; Arabidze, G.; Arai, Y.; Araque, J. P.; Araujo Ferraz, V.; Arce, A. T. H.; Ardell, R. E.; Arduh, F. A.; Arguin, J.-F.; Argyropoulos, S.; Arik, M.; Armbruster, A. J.; Armitage, L. J.; Arnaez, O.; Arnold, H.; Arratia, M.; Arslan, O.; Artamonov, A.; Artoni, G.; Artz, S.; Asai, S.; Asbah, N.; Ashkenazi, A.; Asquith, L.; Assamagan, K.; Astalos, R.; Atkinson, M.; Atlay, N. B.; Augsten, K.; Avolio, G.; Axen, B.; Ayoub, M. K.; Azuelos, G.; Baas, A. E.; Baca, M. J.; Bachacou, H.; Bachas, K.; Backes, M.; Bagnaia, P.; Bahmani, M.; Bahrasemani, H.; Baines, J. T.; Bajic, M.; Baker, O. K.; Bakker, P. J.; Bakshi Gupta, D.; Baldin, E. M.; Balek, P.; Balli, F.; Balunas, W. K.; Banas, E.; Bandyopadhyay, A.; Banerjee, Sw.; Bannoura, A. A. E.; Barak, L.; Barberio, E. L.; Barberis, D.; Barbero, M.; Barillari, T.; Barisits, M.-S.; Barkeloo, J. T.; Barklow, T.; Barlow, N.; Barnes, S. L.; Barnett, B. M.; Barnett, R. M.; Barnovska-Blenessy, Z.; Baroncelli, A.; Barone, G.; Barr, A. J.; Barranco Navarro, L.; Barreiro, F.; Barreiro Guimarães da Costa, J.; Bartoldus, R.; Barton, A. E.; Bartos, P.; Basalaev, A.; Bassalat, A.; Bates, R. L.; Batista, S. J.; Batley, J. R.; Battaglia, M.; Bauce, M.; Bauer, F.; Bauer, K. T.; Bawa, H. S.; Beacham, J. B.; Beattie, M. D.; Beau, T.; Beauchemin, P. H.; Bechtle, P.; Beck, H. P.; Beck, H. C.; Becker, K.; Becker, M.; Becot, C.; Beddall, A. J.; Beddall, A.; Bednyakov, V. A.; Bedognetti, M.; Bee, C. P.; Beermann, T. A.; Begalli, M.; Begel, M.; Behr, J. K.; Bell, A. S.; Bella, G.; Bellagamba, L.; Bellerive, A.; Bellomo, M.; Belotskiy, K.; Beltramello, O.; Belyaev, N. L.; Benary, O.; Benchekroun, D.; Bender, M.; Benekos, N.; Benhammou, Y.; Benhar Noccioli, E.; Benitez, J.; Benjamin, D. P.; Benoit, M.; Bensinger, J. R.; Bentvelsen, S.; Beresford, L.; Beretta, M.; Berge, D.; Bergeaas Kuutmann, E.; Berger, N.; Bergsten, L. J.; Beringer, J.; Berlendis, S.; Bernard, N. R.; Bernardi, G.; Bernius, C.; Bernlochner, F. U.; Berry, T.; Berta, P.; Bertella, C.; Bertoli, G.; Bertram, I. A.; Bertsche, C.; Besjes, G. J.; Bessidskaia Bylund, O.; Bessner, M.; Besson, N.; Bethani, A.; Bethke, S.; Betti, A.; Bevan, A. J.; Beyer, J.; Bianchi, R. M.; Biebel, O.; Biedermann, D.; Bielski, R.; Bierwagen, K.; Biesuz, N. V.; Biglietti, M.; Billoud, T. R. V.; Bilokon, H.; Bindi, M.; Bingul, A.; Bini, C.; Biondi, S.; Bisanz, T.; Bittrich, C.; Bjergaard, D. M.; Black, J. E.; Black, K. M.; Blair, R. E.; Blazek, T.; Bloch, I.; Blocker, C.; Blue, A.; Blumenschein, U.; Blunier, Dr.; Bobbink, G. J.; Bobrovnikov, V. S.; Bocchetta, S. S.; Bocci, A.; Bock, C.; Boehler, M.; Boerner, D.; Bogavac, D.; Bogdanchikov, A. G.; Bohm, C.; Boisvert, V.; Bokan, P.; Bold, T.; Boldyrev, A. S.; Bolz, A. E.; Bomben, M.; Bona, M.; Bonilla, J. S.; Boonekamp, M.; Borisov, A.; Borissov, G.; Bortfeldt, J.; Bortoletto, D.; Bortolotto, V.; Boscherini, D.; Bosman, M.; Bossio Sola, J. D.; Boudreau, J.; Bouhova-Thacker, E. V.; Boumediene, D.; Bourdarios, C.; Boutle, S. K.; Boveia, A.; Boyd, J.; Boyko, I. R.; Bozson, A. J.; Bracinik, J.; Brandt, A.; Brandt, G.; Brandt, O.; Braren, F.; Bratzler, U.; Brau, B.; Brau, J. E.; Breaden Madden, W. D.; Brendlinger, K.; Brennan, A. J.; Brenner, L.; Brenner, R.; Bressler, S.; Briglin, D. L.; Bristow, T. M.; Britton, D.; Britzger, D.; Brock, I.; Brock, R.; Brooijmans, G.; Brooks, T.; Brooks, W. K.; Brost, E.; Broughton, J. H.; Bruckman de Renstrom, P. A.; Bruncko, D.; Bruni, A.; Bruni, G.; Bruni, L. S.; Bruno, S.; Brunt, Bh; Bruschi, M.; Bruscino, N.; Bryant, P.; Bryngemark, L.; Buanes, T.; Buat, Q.; Buchholz, P.; Buckley, A. G.; Budagov, I. A.; Buehrer, F.; Bugge, M. K.; Bulekov, O.; Bullock, D.; Burch, T. J.; Burdin, S.; Burgard, C. D.; Burger, A. M.; Burghgrave, B.; Burka, K.; Burke, S.; Burmeister, I.; Burr, J. T. P.; Büscher, D.; Büscher, V.; Buschmann, E.; Bussey, P.; Butler, J. M.; Buttar, C. M.; Butterworth, J. M.; Butti, P.; Buttinger, W.; Buzatu, A.; Buzykaev, A. R.; Cabrera Urbán, S.; Caforio, D.; Cai, H.; Cairo, V. M. M.; Cakir, O.; Calace, N.; Calafiura, P.; Calandri, A.; Calderini, G.; Calfayan, P.; Callea, G.; Caloba, L. P.; Calvente Lopez, S.; Calvet, D.; Calvet, S.; Calvet, T. P.; Camacho Toro, R.; Camarda, S.; Camarri, P.; Cameron, D.; Caminal Armadans, R.; Camincher, C.; Campana, S.; Campanelli, M.; Camplani, A.; Campoverde, A.; Canale, V.; Cano Bret, M.; Cantero, J.; Cao, T.; Capeans Garrido, M. D. M.; Caprini, I.; Caprini, M.; Capua, M.; Carbone, R. M.; Cardarelli, R.; Cardillo, F.; Carli, I.; Carli, T.; Carlino, G.; Carlson, B. T.; Carminati, L.; Carney, R. M. D.; Caron, S.; Carquin, E.; Carrá, S.; Carrillo-Montoya, G. D.; Casadei, D.; Casado, M. P.; Casha, A. F.; Casolino, M.; Casper, D. W.; Castelijn, R.; Castillo Gimenez, V.; Castro, N. F.; Catinaccio, A.; Catmore, J. R.; Cattai, A.; Caudron, J.; Cavaliere, V.; Cavallaro, E.; Cavalli, D.; Cavalli-Sforza, M.; Cavasinni, V.; Celebi, E.; Ceradini, F.; Cerda Alberich, L.; Cerqueira, A. S.; Cerri, A.; Cerrito, L.; Cerutti, F.; Cervelli, A.; Cetin, S. A.; Chafaq, A.; Chakraborty, D.; Chan, S. K.; Chan, W. S.; Chan, Y. L.; Chang, P.; Chapman, J. D.; Charlton, D. G.; Chau, C. C.; Chavez Barajas, C. A.; Che, S.; Cheatham, S.; Chegwidden, A.; Chekanov, S.; Chekulaev, S. V.; Chelkov, G. A.; Chelstowska, M. A.; Chen, C.; Chen, C.; Chen, H.; Chen, J.; Chen, J.; Chen, S.; Chen, S.; Chen, X.; Chen, Y.; Cheng, H. C.; Cheng, H. J.; Cheplakov, A.; Cheremushkina, E.; Cherkaoui El Moursli, R.; Cheu, E.; Cheung, K.; Chevalier, L.; Chiarella, V.; Chiarelli, G.; Chiodini, G.; Chisholm, A. S.; Chitan, A.; Chiu, Y. H.; Chizhov, M. V.; Choi, K.; Chomont, A. R.; Chouridou, S.; Chow, Y. S.; Christodoulou, V.; Chu, M. C.; Chudoba, J.; Chuinard, A. J.; Chwastowski, J. J.; Chytka, L.; Ciftci, A. K.; Cinca, D.; Cindro, V.; Cioarǎ, I. A.; Ciocio, A.; Cirotto, F.; Citron, Z. H.; Citterio, M.; Ciubancan, M.; Clark, A.; Clark, M. R.; Clark, P. J.; Clarke, R. N.; Clement, C.; Coadou, Y.; Cobal, M.; Coccaro, A.; Cochran, J.; Colasurdo, L.; Cole, B.; Colijn, A. P.; Collot, J.; Conde Muiño, P.; Coniavitis, E.; Connell, S. H.; Connelly, I. A.; Constantinescu, S.; Conti, G.; Conventi, F.; Cooper-Sarkar, A. M.; Cormier, F.; Cormier, K. J. R.; Corradi, M.; Corrigan, E. E.; Corriveau, F.; Cortes-Gonzalez, A.; Costa, M. J.; Costanzo, D.; Cottin, G.; Cowan, G.; Cox, B. E.; Cranmer, K.; Crawley, S. J.; Creager, R. A.; Cree, G.; Crépé-Renaudin, S.; Crescioli, F.; Cribbs, W. A.; Cristinziani, M.; Croft, V.; Crosetti, G.; Cueto, A.; Cuhadar Donszelmann, T.; Cukierman, A. R.; Cummings, J.; Curatolo, M.; Cúth, J.; Czekierda, S.; Czodrowski, P.; D'Amen, G.; D'Auria, S.; D'Eramo, L.; D'Onofrio, M.; da Cunha Sargedas de Sousa, M. J.; da Via, C.; Dabrowski, W.; Dado, T.; Dahbi, S.; Dai, T.; Dale, O.; Dallaire, F.; Dallapiccola, C.; Dam, M.; Dandoy, J. R.; Daneri, M. F.; Dang, N. P.; Dann, N. S.; Danninger, M.; Dano Hoffmann, M.; Dao, V.; Darbo, G.; Darmora, S.; Dassoulas, J.; Dattagupta, A.; Daubney, T.; Davey, W.; David, C.; Davidek, T.; Davis, D. R.; Davison, P.; Dawe, E.; Dawson, I.; de, K.; de Asmundis, R.; de Benedetti, A.; de Castro, S.; de Cecco, S.; de Groot, N.; de Jong, P.; de la Torre, H.; de Lorenzi, F.; de Maria, A.; de Pedis, D.; de Salvo, A.; de Sanctis, U.; de Santo, A.; de Vasconcelos Corga, K.; de Vivie de Regie, J. B.; Debbe, R.; Debenedetti, C.; Dedovich, D. V.; Dehghanian, N.; Deigaard, I.; Del Gaudio, M.; Del Peso, J.; Delgove, D.; Deliot, F.; Delitzsch, C. M.; Dell'Acqua, A.; Dell'Asta, L.; Della Pietra, M.; Della Volpe, D.; Delmastro, M.; Delporte, C.; Delsart, P. A.; Demarco, D. A.; Demers, S.; Demichev, M.; Demilly, A.; Denisov, S. P.; Denysiuk, D.; Derendarz, D.; Derkaoui, J. E.; Derue, F.; Dervan, P.; Desch, K.; Deterre, C.; Dette, K.; Devesa, M. R.; Deviveiros, P. O.; Dewhurst, A.; Dhaliwal, S.; di Bello, F. A.; di Ciaccio, A.; di Ciaccio, L.; di Clemente, W. K.; di Donato, C.; di Girolamo, A.; di Girolamo, B.; di Micco, B.; di Nardo, R.; di Petrillo, K. F.; di Simone, A.; di Sipio, R.; di Valentino, D.; Diaconu, C.; Diamond, M.; Dias, F. A.; Diaz, M. A.; Dickinson, J.; Diehl, E. B.; Dietrich, J.; Díez Cornell, S.; Dimitrievska, A.; Dingfelder, J.; Dita, P.; Dita, S.; Dittus, F.; Djama, F.; Djobava, T.; Djuvsland, J. I.; Do Vale, M. A. B.; Dobre, M.; Dodsworth, D.; Doglioni, C.; Dolejsi, J.; Dolezal, Z.; Donadelli, M.; Donati, S.; Donini, J.; Dopke, J.; Doria, A.; Dova, M. T.; Doyle, A. T.; Drechsler, E.; Dris, M.; Du, Y.; Duarte-Campderros, J.; Dubinin, F.; Dubreuil, A.; Duchovni, E.; Duckeck, G.; Ducourthial, A.; Ducu, O. A.; Duda, D.; Dudarev, A.; Dudder, A. Chr.; Duffield, E. M.; Duflot, L.; Dührssen, M.; Dulsen, C.; Dumancic, M.; Dumitriu, A. E.; Duncan, A. K.; Dunford, M.; Duperrin, A.; Duran Yildiz, H.; Düren, M.; Durglishvili, A.; Duschinger, D.; Dutta, B.; Duvnjak, D.; Dyndal, M.; Dziedzic, B. S.; Eckardt, C.; Ecker, K. M.; Edgar, R. C.; Eifert, T.; Eigen, G.; Einsweiler, K.; Ekelof, T.; El Kacimi, M.; El Kosseifi, R.; Ellajosyula, V.; Ellert, M.; Elles, S.; Ellinghaus, F.; Elliot, A. A.; Ellis, N.; Elmsheuser, J.; Elsing, M.; Emeliyanov, D.; Enari, Y.; Ennis, J. S.; Epland, M. B.; Erdmann, J.; Ereditato, A.; Ernst, M.; Errede, S.; Escalier, M.; Escobar, C.; Esposito, B.; Estrada Pastor, O.; Etienvre, A. I.; Etzion, E.; Evans, H.; Ezhilov, A.; Ezzi, M.; Fabbri, F.; Fabbri, L.; Fabiani, V.; Facini, G.; Fakhrutdinov, R. M.; Falciano, S.; Falla, R. J.; Faltova, J.; Fang, Y.; Fanti, M.; Farbin, A.; Farilla, A.; Farina, E. M.; Farooque, T.; Farrell, S.; Farrington, S. M.; Farthouat, P.; Fassi, F.; Fassnacht, P.; Fassouliotis, D.; Faucci Giannelli, M.; Favareto, A.; Fawcett, W. J.; Fayard, L.; Fedin, O. L.; Fedorko, W.; Feigl, S.; Feligioni, L.; Feng, C.; Feng, E. J.; Feng, M.; Fenton, M. J.; Fenyuk, A. B.; Feremenga, L.; Fernandez Martinez, P.; Ferrando, J.; Ferrari, A.; Ferrari, P.; Ferrari, R.; Ferreira de Lima, D. E.; Ferrer, A.; Ferrere, D.; Ferretti, C.; Fiedler, F.; Filipčič, A.; Filipuzzi, M.; Filthaut, F.; Fincke-Keeler, M.; Finelli, K. D.; Fiolhais, M. C. N.; Fiorini, L.; Fischer, C.; Fischer, J.; Fisher, W. C.; Flaschel, N.; Fleck, I.; Fleischmann, P.; Fletcher, R. R. M.; Flick, T.; Flierl, B. M.; Flores Castillo, L. R.; Fomin, N.; Forcolin, G. T.; Formica, A.; Förster, F. A.; Forti, A.; Foster, A. G.; Fournier, D.; Fox, H.; Fracchia, S.; Francavilla, P.; Franchini, M.; Franchino, S.; Francis, D.; Franconi, L.; Franklin, M.; Frate, M.; Fraternali, M.; Freeborn, D.; Fressard-Batraneanu, S. M.; Freund, B.; Freund, W. S.; Froidevaux, D.; Frost, J. A.; Fukunaga, C.; Fusayasu, T.; Fuster, J.; Gabizon, O.; Gabrielli, A.; Gabrielli, A.; Gach, G. P.; Gadatsch, S.; Gadomski, S.; Gagliardi, G.; Gagnon, L. G.; Galea, C.; Galhardo, B.; Gallas, E. J.; Gallop, B. J.; Gallus, P.; Galster, G.; Gan, K. K.; Ganguly, S.; Gao, Y.; Gao, Y. S.; Garay Walls, F. M.; García, C.; García Navarro, J. E.; García Pascual, J. A.; Garcia-Sciveres, M.; Gardner, R. W.; Garelli, N.; Garonne, V.; Gasnikova, K.; Gatti, C.; Gaudiello, A.; Gaudio, G.; Gavrilenko, I. L.; Gay, C.; Gaycken, G.; Gazis, E. N.; Gee, C. N. P.; Geisen, J.; Geisen, M.; Geisler, M. P.; Gellerstedt, K.; Gemme, C.; Genest, M. H.; Geng, C.; Gentile, S.; Gentsos, C.; George, S.; Gerbaudo, D.; Geßner, G.; Ghasemi, S.; Ghneimat, M.; Giacobbe, B.; Giagu, S.; Giangiacomi, N.; Giannetti, P.; Gibson, S. M.; Gignac, M.; Gilchriese, M.; Gillberg, D.; Gilles, G.; Gingrich, D. M.; Giordani, M. P.; Giorgi, F. M.; Giraud, P. F.; Giromini, P.; Giugliarelli, G.; Giugni, D.; Giuli, F.; Giulini, M.; Gjelsten, B. K.; Gkaitatzis, S.; Gkialas, I.; Gkougkousis, E. L.; Gkountoumis, P.; Gladilin, L. K.; Glasman, C.; Glatzer, J.; Glaysher, P. C. F.; Glazov, A.; Goblirsch-Kolb, M.; Godlewski, J.; Goldfarb, S.; Golling, T.; Golubkov, D.; Gomes, A.; Gonçalo, R.; Goncalves Gama, R.; Goncalves Pinto Firmino da Costa, J.; Gonella, G.; Gonella, L.; Gongadze, A.; Gonnella, F.; Gonski, J. L.; González de La Hoz, S.; Gonzalez-Sevilla, S.; Goossens, L.; Gorbounov, P. A.; Gordon, H. A.; Gorini, B.; Gorini, E.; Gorišek, A.; Goshaw, A. T.; Gössling, C.; Gostkin, M. I.; Gottardo, C. A.; Goudet, C. R.; Goujdami, D.; Goussiou, A. G.; Govender, N.; Goy, C.; Gozani, E.; Grabowska-Bold, I.; Gradin, P. O. J.; Graham, E. C.; Gramling, J.; Gramstad, E.; Grancagnolo, S.; Gratchev, V.; Gravila, P. M.; Gray, C.; Gray, H. M.; Greenwood, Z. D.; Grefe, C.; Gregersen, K.; Gregor, I. M.; Grenier, P.; Grevtsov, K.; Griffiths, J.; Grillo, A. A.; Grimm, K.; Grinstein, S.; Gris, Ph.; Grivaz, J.-F.; Groh, S.; Gross, E.; Grosse-Knetter, J.; Grossi, G. C.; Grout, Z. J.; Grummer, A.; Guan, L.; Guan, W.; Guenther, J.; Guescini, F.; Guest, D.; Gueta, O.; Gugel, R.; Gui, B.; Guido, E.; Guillemin, T.; Guindon, S.; Gul, U.; Gumpert, C.; Guo, J.; Guo, W.; Guo, Y.; Gupta, R.; Gurbuz, S.; Gustavino, G.; Gutelman, B. J.; Gutierrez, P.; Gutierrez Ortiz, N. G.; Gutschow, C.; Guyot, C.; Guzik, M. P.; Gwenlan, C.; Gwilliam, C. B.; Haas, A.; Haber, C.; Hadavand, H. K.; Haddad, N.; Hadef, A.; Hageböck, S.; Hagihara, M.; Hakobyan, H.; Haleem, M.; Haley, J.; Halladjian, G.; Hallewell, G. D.; Hamacher, K.; Hamal, P.; Hamano, K.; Hamilton, A.; Hamity, G. N.; Hamnett, P. G.; Han, K.; Han, L.; Han, S.; Hanagaki, K.; Hance, M.; Handl, D. M.; Haney, B.; Hankache, R.; Hanke, P.; Hansen, J. B.; Hansen, J. D.; Hansen, M. C.; Hansen, P. H.; Hara, K.; Hard, A. S.; Harenberg, T.; Hariri, F.; Harkusha, S.; Harrison, P. F.; Hartmann, N. M.; Hasegawa, Y.; Hasib, A.; Hassani, S.; Haug, S.; Hauser, R.; Hauswald, L.; Havener, L. B.; Havranek, M.; Hawkes, C. M.; Hawkings, R. J.; Hayden, D.; Hays, C. P.; Hays, J. M.; Hayward, H. S.; Haywood, S. J.; Heck, T.; Hedberg, V.; Heelan, L.; Heer, S.; Heidegger, K. K.; Heim, S.; Heim, T.; Heinemann, B.; Heinrich, J. J.; Heinrich, L.; Heinz, C.; Hejbal, J.; Helary, L.; Held, A.; Hellman, S.; Helsens, C.; Henderson, R. C. W.; Heng, Y.; Henkelmann, S.; Henriques Correia, A. M.; Henrot-Versille, S.; Herbert, G. H.; Herde, H.; Herget, V.; Hernández Jiménez, Y.; Herr, H.; Herten, G.; Hertenberger, R.; Hervas, L.; Herwig, T. C.; Hesketh, G. G.; Hessey, N. P.; Hetherly, J. W.; Higashino, S.; Higón-Rodriguez, E.; Hildebrand, K.; Hill, E.; Hill, J. C.; Hiller, K. H.; Hillier, S. J.; Hils, M.; Hinchliffe, I.; Hirose, M.; Hirschbuehl, D.; Hiti, B.; Hladik, O.; Hlaluku, D. R.; Hoad, X.; Hobbs, J.; Hod, N.; Hodgkinson, M. C.; Hodgson, P.; Hoecker, A.; Hoeferkamp, M. R.; Hoenig, F.; Hohn, D.; Holmes, T. R.; Holzbock, M.; Homann, M.; Honda, S.; Honda, T.; Hong, T. M.; Hooberman, B. H.; Hopkins, W. H.; Horii, Y.; Horton, A. J.; Hostachy, J.-Y.; Hostiuc, A.; Hou, S.; Hoummada, A.; Howarth, J.; Hoya, J.; Hrabovsky, M.; Hrdinka, J.; Hristova, I.; Hrivnac, J.; Hryn'ova, T.; Hrynevich, A.; Hsu, P. J.; Hsu, S.-C.; Hu, Q.; Hu, S.; Huang, Y.; Hubacek, Z.; Hubaut, F.; Huegging, F.; Huffman, T. B.; Hughes, E. W.; Huhtinen, M.; Hunter, R. F. H.; Huo, P.; Hupe, A. M.; Huseynov, N.; Huston, J.; Huth, J.; Hyneman, R.; Iacobucci, G.; Iakovidis, G.; Ibragimov, I.; Iconomidou-Fayard, L.; Idrissi, Z.; Iengo, P.; Igonkina, O.; Iizawa, T.; Ikegami, Y.; Ikeno, M.; Ilchenko, Y.; Iliadis, D.; Ilic, N.; Iltzsche, F.; Introzzi, G.; Ioannou, P.; Iodice, M.; Iordanidou, K.; Ippolito, V.; Isacson, M. F.; Ishijima, N.; Ishino, M.; Ishitsuka, M.; Issever, C.; Istin, S.; Ito, F.; Iturbe Ponce, J. M.; Iuppa, R.; Iwasaki, H.; Izen, J. M.; Izzo, V.; Jabbar, S.; Jackson, P.; Jacobs, R. M.; Jain, V.; Jakel, G.; Jakobi, K. B.; Jakobs, K.; Jakobsen, S.; Jakoubek, T.; Jamin, D. O.; Jana, D. K.; Jansky, R.; Janssen, J.; Janus, M.; Janus, P. A.; Jarlskog, G.; Javadov, N.; Javå¯Rek, T.; Javurkova, M.; Jeanneau, F.; Jeanty, L.; Jejelava, J.; Jelinskas, A.; Jenni, P.; Jeske, C.; Jézéquel, S.; Ji, H.; Jia, J.; Jiang, H.; Jiang, Y.; Jiang, Z.; Jiggins, S.; Jimenez Pena, J.; Jin, S.; Jinaru, A.; Jinnouchi, O.; Jivan, H.; Johansson, P.; Johns, K. A.; Johnson, C. A.; Johnson, W. J.; Jon-And, K.; Jones, R. W. L.; Jones, S. D.; Jones, S.; Jones, T. J.; Jongmanns, J.; Jorge, P. M.; Jovicevic, J.; Ju, X.; Juste Rozas, A.; Kaczmarska, A.; Kado, M.; Kagan, H.; Kagan, M.; Kahn, S. J.; Kaji, T.; Kajomovitz, E.; Kalderon, C. W.; Kaluza, A.; Kama, S.; Kamenshchikov, A.; Kanjir, L.; Kano, Y.; Kantserov, V. A.; Kanzaki, J.; Kaplan, B.; Kaplan, L. S.; Kar, D.; Karakostas, K.; Karastathis, N.; Kareem, M. J.; Karentzos, E.; Karpov, S. N.; Karpova, Z. M.; Kartvelishvili, V.; Karyukhin, A. N.; Kasahara, K.; Kashif, L.; Kass, R. D.; Kastanas, A.; Kataoka, Y.; Kato, C.; Katre, A.; Katzy, J.; Kawade, K.; Kawagoe, K.; Kawamoto, T.; Kawamura, G.; Kay, E. F.; Kazanin, V. F.; Keeler, R.; Kehoe, R.; Keller, J. S.; Kellermann, E.; Kempster, J. J.; Kendrick, J.; Keoshkerian, H.; Kepka, O.; Kerševan, B. P.; Kersten, S.; Keyes, R. A.; Khader, M.; Khalil-Zada, F.; Khanov, A.; Kharlamov, A. G.; Kharlamova, T.; Khodinov, A.; Khoo, T. J.; Khovanskiy, V.; Khramov, E.; Khubua, J.; Kido, S.; Kiehn, M.; Kilby, C. R.; Kim, H. Y.; Kim, S. H.; Kim, Y. K.; Kimura, N.; Kind, O. M.; King, B. T.; Kirchmeier, D.; Kirk, J.; Kiryunin, A. E.; Kishimoto, T.; Kisielewska, D.; Kitali, V.; Kivernyk, O.; Kladiva, E.; Klapdor-Kleingrothaus, T.; Klein, M. H.; Klein, M.; Klein, U.; Kleinknecht, K.; Klimek, P.; Klimentov, A.; Klingenberg, R.; Klingl, T.; Klioutchnikova, T.; Klitzner, F. F.; Kluge, E.-E.; Kluit, P.; Kluth, S.; Kneringer, E.; Knoops, E. B. F. G.; Knue, A.; Kobayashi, A.; Kobayashi, D.; Kobayashi, T.; Kobel, M.; Kocian, M.; Kodys, P.; Koffas, T.; Koffeman, E.; Köhler, N. M.; Koi, T.; Kolb, M.; Koletsou, I.; Kondo, T.; Kondrashova, N.; Köneke, K.; König, A. C.; Kono, T.; Konoplich, R.; Konstantinidis, N.; Konya, B.; Kopeliansky, R.; Koperny, S.; Korcyl, K.; Kordas, K.; Korn, A.; Korolkov, I.; Korolkova, E. V.; Kortner, O.; Kortner, S.; Kosek, T.; Kostyukhin, V. V.; Kotwal, A.; Koulouris, A.; Kourkoumeli-Charalampidi, A.; Kourkoumelis, C.; Kourlitis, E.; Kouskoura, V.; Kowalewska, A. B.; Kowalewski, R.; Kowalski, T. Z.; Kozakai, C.; Kozanecki, W.; Kozhin, A. S.; Kramarenko, V. A.; Kramberger, G.; Krasnopevtsev, D.; Krasny, M. W.; Krasznahorkay, A.; Krauss, D.; Kremer, J. A.; Kretzschmar, J.; Kreutzfeldt, K.; Krieger, P.; Krizka, K.; Kroeninger, K.; Kroha, H.; Kroll, J.; Kroll, J.; Kroseberg, J.; Krstic, J.; Kruchonak, U.; Krüger, H.; Krumnack, N.; Kruse, M. C.; Kubota, T.; Kucuk, H.; Kuday, S.; Kuechler, J. T.; Kuehn, S.; Kugel, A.; Kuger, F.; Kuhl, T.; Kukhtin, V.; Kukla, R.; Kulchitsky, Y.; Kuleshov, S.; Kulinich, Y. P.; Kuna, M.; Kunigo, T.; Kupco, A.; Kupfer, T.; Kuprash, O.; Kurashige, H.; Kurchaninov, L. L.; Kurochkin, Y. A.; Kurth, M. G.; Kuwertz, E. S.; Kuze, M.; Kvita, J.; Kwan, T.; La Rosa, A.; La Rosa Navarro, J. L.; La Rotonda, L.; La Ruffa, F.; Lacasta, C.; Lacava, F.; Lacey, J.; Lack, D. P. J.; Lacker, H.; Lacour, D.; Ladygin, E.; Lafaye, R.; Laforge, B.; Lai, S.; Lammers, S.; Lampl, W.; Lançon, E.; Landgraf, U.; Landon, M. P. J.; Lanfermann, M. C.; Lang, V. S.; Lange, J. C.; Langenberg, R. J.; Lankford, A. J.; Lanni, F.; Lantzsch, K.; Lanza, A.; Lapertosa, A.; Laplace, S.; Laporte, J. F.; Lari, T.; Lasagni Manghi, F.; Lassnig, M.; Lau, T. S.; Laurelli, P.; Law, A. T.; Laycock, P.; Lazovich, T.; Lazzaroni, M.; Le, B.; Le Dortz, O.; Le Guirriec, E.; Le Quilleuc, E. P.; Leblanc, M.; Lecompte, T.; Ledroit-Guillon, F.; Lee, C. A.; Lee, G. R.; Lee, S. C.; Lee, L.; Lefebvre, B.; Lefebvre, G.; Lefebvre, M.; Legger, F.; Leggett, C.; Lehmann Miotto, G.; Lei, X.; Leight, W. A.; Leite, M. A. L.; Leitner, R.; Lellouch, D.; Lemmer, B.; Leney, K. J. C.; Lenz, T.; Lenzi, B.; Leone, R.; Leone, S.; Leonidopoulos, C.; Lerner, G.; Leroy, C.; Les, R.; Lesage, A. A. J.; Lester, C. G.; Levchenko, M.; Levêque, J.; Levin, D.; Levinson, L. J.; Levy, M.; Lewis, D.; Li, B.; Li, C.-Q.; Li, H.; Li, L.; Li, Q.; Li, Q.; Li, S.; Li, X.; Li, Y.; Liang, Z.; Liberti, B.; Liblong, A.; Lie, K.; Limosani, A.; Lin, C. Y.; Lin, K.; Lin, S. C.; Lin, T. H.; Linck, R. A.; Lindquist, B. E.; Lionti, A. E.; Lipeles, E.; Lipniacka, A.; Lisovyi, M.; Liss, T. M.; Lister, A.; Litke, A. M.; Liu, B.; Liu, H.; Liu, H.; Liu, J. K. K.; Liu, J. B.; Liu, K.; Liu, L.; Liu, M.; Liu, Y. L.; Liu, Y.; Livan, M.; Lleres, A.; Llorente Merino, J.; Lloyd, S. L.; Lo, C. Y.; Lo Sterzo, F.; Lobodzinska, E. M.; Loch, P.; Loebinger, F. K.; Loesle, A.; Loew, K. M.; Lohse, T.; Lohwasser, K.; Lokajicek, M.; Long, B. A.; Long, J. D.; Long, R. E.; Longo, L.; Looper, K. A.; Lopez, J. A.; Lopez Paz, I.; Lopez Solis, A.; Lorenz, J.; Lorenzo Martinez, N.; Losada, M.; Lösel, P. J.; Lou, X.; Lounis, A.; Love, J.; Love, P. A.; Lu, H.; Lu, N.; Lu, Y. J.; Lubatti, H. J.; Luci, C.; Lucotte, A.; Luedtke, C.; Luehring, F.; Lukas, W.; Luminari, L.; Lund-Jensen, B.; Lutz, M. S.; Luzi, P. M.; Lynn, D.; Lysak, R.; Lytken, E.; Lyu, F.; Lyubushkin, V.; Ma, H.; Ma, L. L.; Ma, Y.; Maccarrone, G.; Macchiolo, A.; MacDonald, C. M.; Maček, B.; Machado Miguens, J.; Madaffari, D.; Madar, R.; Mader, W. F.; Madsen, A.; Madysa, N.; Maeda, J.; Maeland, S.; Maeno, T.; Maevskiy, A. S.; Magerl, V.; Maiani, C.; Maidantchik, C.; Maier, T.; Maio, A.; Majersky, O.; Majewski, S.; Makida, Y.; Makovec, N.; Malaescu, B.; Malecki, Pa.; Maleev, V. P.; Malek, F.; Mallik, U.; Malon, D.; Malone, C.; Maltezos, S.; Malyukov, S.; Mamuzic, J.; Mancini, G.; Mandić, I.; Maneira, J.; Manhaes de Andrade Filho, L.; Manjarres Ramos, J.; Mankinen, K. H.; Mann, A.; Manousos, A.; Mansoulie, B.; Mansour, J. D.; Mantifel, R.; Mantoani, M.; Manzoni, S.; Mapelli, L.; Marceca, G.; March, L.; Marchese, L.; Marchiori, G.; Marcisovsky, M.; Marin Tobon, C. A.; Marjanovic, M.; Marley, D. E.; Marroquim, F.; Marsden, S. P.; Marshall, Z.; Martensson, M. U. F.; Marti-Garcia, S.; Martin, C. B.; Martin, T. A.; Martin, V. J.; Martin Dit Latour, B.; Martinez, M.; Martinez Outschoorn, V. I.; Martin-Haugh, S.; Martoiu, V. S.; Martyniuk, A. C.; Marzin, A.; Masetti, L.; Mashimo, T.; Mashinistov, R.; Masik, J.; Maslennikov, A. L.; Mason, L. H.; Massa, L.; Mastrandrea, P.; Mastroberardino, A.; Masubuchi, T.; Mättig, P.; Maurer, J.; Maxfield, S. J.; Maximov, D. A.; Mazini, R.; Maznas, I.; Mazza, S. M.; Mc Fadden, N. C.; Mc Goldrick, G.; Mc Kee, S. P.; McCarn, A.; McCarthy, R. L.; McCarthy, T. G.; McClymont, L. I.; McDonald, E. F.; McFayden, J. A.; McHedlidze, G.; McMahon, S. J.; McNamara, P. C.; McNicol, C. J.; McPherson, R. A.; Meadows, Z. A.; Meehan, S.; Megy, T. J.; Mehlhase, S.; Mehta, A.; Meideck, T.; Meier, K.; Meirose, B.; Melini, D.; Mellado Garcia, B. R.; Mellenthin, J. D.; Melo, M.; Meloni, F.; Melzer, A.; Menary, S. B.; Meng, L.; Meng, X. T.; Mengarelli, A.; Menke, S.; Meoni, E.; Mergelmeyer, S.; Merlassino, C.; Mermod, P.; Merola, L.; Meroni, C.; Merritt, F. S.; Messina, A.; Metcalfe, J.; Mete, A. S.; Meyer, C.; Meyer, J.-P.; Meyer, J.; Meyer Zu Theenhausen, H.; Miano, F.; Middleton, R. P.; Miglioranzi, S.; Mijović, L.; Mikenberg, G.; Mikestikova, M.; Mikuž, M.; Milesi, M.; Milic, A.; Millar, D. A.; Miller, D. W.; Milov, A.; Milstead, D. A.; Minaenko, A. A.; Minashvili, I. A.; Mincer, A. I.; Mindur, B.; Mineev, M.; Minegishi, Y.; Ming, Y.; Mir, L. M.; Mirto, A.; Mistry, K. P.; Mitani, T.; Mitrevski, J.; Mitsou, V. A.; Miucci, A.; Miyagawa, P. S.; Mizukami, A.; Mjörnmark, J. U.; Mkrtchyan, T.; Mlynarikova, M.; Moa, T.; Mochizuki, K.; Mogg, P.; Mohapatra, S.; Molander, S.; Moles-Valls, R.; Mondragon, M. C.; Mönig, K.; Monk, J.; Monnier, E.; Montalbano, A.; Montejo Berlingen, J.; Monticelli, F.; Monzani, S.; Moore, R. W.; Morange, N.; Moreno, D.; Moreno Llácer, M.; Morettini, P.; Morgenstern, M.; Morgenstern, S.; Mori, D.; Mori, T.; Morii, M.; Morinaga, M.; Morisbak, V.; Morley, A. K.; Mornacchi, G.; Morris, J. D.; Morvaj, L.; Moschovakos, P.; Mosidze, M.; Moss, H. J.; Moss, J.; Motohashi, K.; Mount, R.; Mountricha, E.; Moyse, E. J. W.; Muanza, S.; Mueller, F.; Mueller, J.; Mueller, R. S. P.; Muenstermann, D.; Mullen, P.; Mullier, G. A.; Munoz Sanchez, F. J.; Murray, W. J.; Musheghyan, H.; Muškinja, M.; Mwewa, C.; Myagkov, A. G.; Myers, J.; Myska, M.; Nachman, B. P.; Nackenhorst, O.; Nagai, K.; Nagai, R.; Nagano, K.; Nagasaka, Y.; Nagata, K.; Nagel, M.; Nagy, E.; Nairz, A. M.; Nakahama, Y.; Nakamura, K.; Nakamura, T.; Nakano, I.; Naranjo Garcia, R. F.; Narayan, R.; Narrias Villar, D. I.; Naryshkin, I.; Naumann, T.; Navarro, G.; Nayyar, R.; Neal, H. A.; Nechaeva, P. Yu.; Neep, T. J.; Negri, A.; Negrini, M.; Nektarijevic, S.; Nellist, C.; Nelson, A.; Nelson, M. E.; Nemecek, S.; Nemethy, P.; Nessi, M.; Neubauer, M. S.; Neumann, M.; Newman, P. R.; Ng, T. Y.; Ng, Y. S.; Nguyen Manh, T.; Nickerson, R. B.; Nicolaidou, R.; Nielsen, J.; Nikiforou, N.; Nikolaenko, V.; Nikolic-Audit, I.; Nikolopoulos, K.; Nilsson, P.; Ninomiya, Y.; Nisati, A.; Nishu, N.; Nisius, R.; Nitsche, I.; Nitta, T.; Nobe, T.; Noguchi, Y.; Nomachi, M.; Nomidis, I.; Nomura, M. A.; Nooney, T.; Nordberg, M.; Norjoharuddeen, N.; Novgorodova, O.; Novotny, R.; Nozaki, M.; Nozka, L.; Ntekas, K.; Nurse, E.; Nuti, F.; O'Connor, K.; O'Neil, D. C.; O'Rourke, A. A.; O'Shea, V.; Oakham, F. G.; Oberlack, H.; Obermann, T.; Ocariz, J.; Ochi, A.; Ochoa, I.; Ochoa-Ricoux, J. P.; Oda, S.; Odaka, S.; Oh, A.; Oh, S. H.; Ohm, C. C.; Ohman, H.; Oide, H.; Okawa, H.; Okumura, Y.; Okuyama, T.; Olariu, A.; Oleiro Seabra, L. F.; Olivares Pino, S. A.; Oliveira Damazio, D.; Oliver, J. L.; Olsson, M. J. R.; Olszewski, A.; Olszowska, J.; Onofre, A.; Onogi, K.; Onyisi, P. U. E.; Oppen, H.; Oreglia, M. J.; Oren, Y.; Orestano, D.; Orgill, E. C.; Orlando, N.; Orr, R. S.; Osculati, B.; Ospanov, R.; Otero Y Garzon, G.; Otono, H.; Ouchrif, M.; Ould-Saada, F.; Ouraou, A.; Oussoren, K. P.; Ouyang, Q.; Owen, M.; Owen, R. E.; Ozcan, V. E.; Ozturk, N.; Pachal, K.; Pacheco Pages, A.; Pacheco Rodriguez, L.; Padilla Aranda, C.; Pagan Griso, S.; Paganini, M.; Paige, F.; Palacino, G.; Palazzo, S.; Palestini, S.; Palka, M.; Pallin, D.; Panagiotopoulou, E. St.; Panagoulias, I.; Pandini, C. E.; Panduro Vazquez, J. G.; Pani, P.; Panitkin, S.; Pantea, D.; Paolozzi, L.; Papadopoulou, Th. D.; Papageorgiou, K.; Paramonov, A.; Paredes Hernandez, D.; Parker, A. J.; Parker, M. A.; Parker, K. A.; Parodi, F.; Parsons, J. A.; Parzefall, U.; Pascuzzi, V. R.; Pasner, J. M.; Pasqualucci, E.; Passaggio, S.; Pastore, Fr.; Pataraia, S.; Pater, J. R.; Pauly, T.; Pearson, B.; Pedraza Lopez, S.; Pedro, R.; Peleganchuk, S. V.; Penc, O.; Peng, C.; Peng, H.; Penwell, J.; Peralva, B. S.; Perego, M. M.; Perepelitsa, D. V.; Peri, F.; Perini, L.; Pernegger, H.; Perrella, S.; Peschke, R.; Peshekhonov, V. D.; Peters, K.; Peters, R. F. Y.; Petersen, B. A.; Petersen, T. C.; Petit, E.; Petridis, A.; Petridou, C.; Petroff, P.; Petrolo, E.; Petrov, M.; Petrucci, F.; Pettersson, N. E.; Peyaud, A.; Pezoa, R.; Pham, T.; Phillips, F. H.; Phillips, P. W.; Piacquadio, G.; Pianori, E.; Picazio, A.; Pickering, M. A.; Piegaia, R.; Pilcher, J. E.; Pilkington, A. D.; Pinamonti, M.; Pinfold, J. L.; Pirumov, H.; Pitt, M.; Pleier, M.-A.; Pleskot, V.; Plotnikova, E.; Pluth, D.; Podberezko, P.; Poettgen, R.; Poggi, R.; Poggioli, L.; Pogrebnyak, I.; Pohl, D.; Pokharel, I.; Polesello, G.; Poley, A.; Policicchio, A.; Polifka, R.; Polini, A.; Pollard, C. S.; Polychronakos, V.; Pommès, K.; Ponomarenko, D.; Pontecorvo, L.; Popeneciu, G. A.; Portillo Quintero, D. M.; Pospisil, S.; Potamianos, K.; Potrap, I. N.; Potter, C. J.; Potti, H.; Poulsen, T.; Poveda, J.; Pozo Astigarraga, M. E.; Pralavorio, P.; Prell, S.; Price, D.; Primavera, M.; Prince, S.; Proklova, N.; Prokofiev, K.; Prokoshin, F.; Protopopescu, S.; Proudfoot, J.; Przybycien, M.; Puri, A.; Puzo, P.; Qian, J.; Qin, Y.; Quadt, A.; Queitsch-Maitland, M.; Quilty, D.; Raddum, S.; Radeka, V.; Radescu, V.; Radhakrishnan, S. K.; Radloff, P.; Rados, P.; Ragusa, F.; Rahal, G.; Raine, J. A.; Rajagopalan, S.; Rashid, T.; Raspopov, S.; Ratti, M. G.; Rauch, D. M.; Rauscher, F.; Rave, S.; Ravinovich, I.; Rawling, J. H.; Raymond, M.; Read, A. L.; Readioff, N. P.; Reale, M.; Rebuzzi, D. M.; Redelbach, A.; Redlinger, G.; Reece, R.; Reed, R. G.; Reeves, K.; Rehnisch, L.; Reichert, J.; Reiss, A.; Rembser, C.; Ren, H.; Rescigno, M.; Resconi, S.; Resseguie, E. D.; Rettie, S.; Reynolds, E.; Rezanova, O. L.; Reznicek, P.; Rezvani, R.; Richter, R.; Richter, S.; Richter-Was, E.; Ricken, O.; Ridel, M.; Rieck, P.; Riegel, C. J.; Rieger, J.; Rifki, O.; Rijssenbeek, M.; Rimoldi, A.; Rimoldi, M.; Rinaldi, L.; Ripellino, G.; Ristić, B.; Ritsch, E.; Riu, I.; Rivera Vergara, J. C.; Rizatdinova, F.; Rizvi, E.; Rizzi, C.; Roberts, R. T.; Robertson, S. H.; Robichaud-Veronneau, A.; Robinson, D.; Robinson, J. E. M.; Robson, A.; Rocco, E.; Roda, C.; Rodina, Y.; Rodriguez Bosca, S.; Rodriguez Perez, A.; Rodriguez Rodriguez, D.; Rodríguez Vera, A. M.; Roe, S.; Rogan, C. S.; Røhne, O.; Roloff, J.; Romaniouk, A.; Romano, M.; Romano Saez, S. M.; Romero Adam, E.; Rompotis, N.; Ronzani, M.; Roos, L.; Rosati, S.; Rosbach, K.; Rose, P.; Rosien, N.-A.; Rossi, E.; Rossi, L. P.; Rosten, J. H. N.; Rosten, R.; Rotaru, M.; Rothberg, J.; Rousseau, D.; Roy, D.; Rozanov, A.; Rozen, Y.; Ruan, X.; Rubbo, F.; Rühr, F.; Ruiz-Martinez, A.; Rurikova, Z.; Rusakovich, N. A.; Russell, H. L.; Rutherfoord, J. P.; Ruthmann, N.; Rüttinger, E. M.; Ryabov, Y. F.; Rybar, M.; Rybkin, G.; Ryu, S.; Ryzhov, A.; Rzehorz, G. F.; Saavedra, A. F.; Sabato, G.; Sacerdoti, S.; Sadrozinski, H. F.-W.; Sadykov, R.; Safai Tehrani, F.; Saha, P.; Sahinsoy, M.; Saimpert, M.; Saito, M.; Saito, T.; Sakamoto, H.; Sakurai, Y.; Salamanna, G.; Salazar Loyola, J. E.; Salek, D.; Sales de Bruin, P. H.; Salihagic, D.; Salnikov, A.; Salt, J.; Salvatore, D.; Salvatore, F.; Salvucci, A.; Salzburger, A.; Sammel, D.; Sampsonidis, D.; Sampsonidou, D.; Sánchez, J.; Sanchez Pineda, A.; Sandaker, H.; Sandbach, R. L.; Sander, C. O.; Sandhoff, M.; Sandoval, C.; Sankey, D. P. C.; Sannino, M.; Sano, Y.; Sansoni, A.; Santoni, C.; Santos, H.; Santoyo Castillo, I.; Sapronov, A.; Saraiva, J. G.; Sasaki, O.; Sato, K.; Sauvan, E.; Savage, G.; Savard, P.; Savic, N.; Sawada, R.; Sawyer, C.; Sawyer, L.; Sbarra, C.; Sbrizzi, A.; Scanlon, T.; Scannicchio, D. A.; Schaarschmidt, J.; Schacht, P.; Schachtner, B. M.; Schaefer, D.; Schaefer, L.; Schaeffer, J.; Schaepe, S.; Schäfer, U.; Schaffer, A. C.; Schaile, D.; Schamberger, R. D.; Schegelsky, V. A.; Scheirich, D.; Schenck, F.; Schernau, M.; Schiavi, C.; Schier, S.; Schildgen, L. K.; Schillo, C.; Schioppa, E. J.; Schioppa, M.; Schlenker, S.; Schmidt-Sommerfeld, K. R.; Schmieden, K.; Schmitt, C.; Schmitt, S.; Schmitz, S.; Schnoor, U.; Schoeffel, L.; Schoening, A.; Schoenrock, B. D.; Schopf, E.; Schott, M.; Schouwenberg, J. F. P.; Schovancova, J.; Schramm, S.; Schuh, N.; Schulte, A.; Schultens, M. J.; Schultz-Coulon, H.-C.; Schumacher, M.; Schumm, B. A.; Schune, Ph.; Schwartzman, A.; Schwarz, T. A.; Schweiger, H.; Schwemling, Ph.; Schwienhorst, R.; Schwindling, J.; Sciandra, A.; Sciolla, G.; Scornajenghi, M.; Scuri, F.; Scutti, F.; Searcy, J.; Seema, P.; Seidel, S. C.; Seiden, A.; Seixas, J. M.; Sekhniaidze, G.; Sekhon, K.; Sekula, S. J.; Semprini-Cesari, N.; Senkin, S.; Serfon, C.; Serin, L.; Serkin, L.; Sessa, M.; Seuster, R.; Severini, H.; Šfiligoj, T.; Sforza, F.; Sfyrla, A.; Shabalina, E.; Shaikh, N. W.; Shan, L. Y.; Shang, R.; Shank, J. T.; Shapiro, M.; Shatalov, P. B.; Shaw, K.; Shaw, S. M.; Shcherbakova, A.; Shehu, C. Y.; Shen, Y.; Sherafati, N.; Sherman, A. D.; Sherwood, P.; Shi, L.; Shimizu, S.; Shimmin, C. O.; Shimojima, M.; Shipsey, I. P. J.; Shirabe, S.; Shiyakova, M.; Shlomi, J.; Shmeleva, A.; Shoaleh Saadi, D.; Shochet, M. J.; Shojaii, S.; Shope, D. R.; Shrestha, S.; Shulga, E.; Shupe, M. A.; Sicho, P.; Sickles, A. M.; Sidebo, P. E.; Sideras Haddad, E.; Sidiropoulou, O.; Sidoti, A.; Siegert, F.; Sijacki, Dj.; Silva, J.; Silva, M.; Silverstein, S. B.; Simak, V.; Simic, L.; Simion, S.; Simioni, E.; Simmons, B.; Simon, M.; Sinervo, P.; Sinev, N. B.; Sioli, M.; Siragusa, G.; Siral, I.; Sivoklokov, S. Yu.; Sjölin, J.; Skinner, M. B.; Skubic, P.; Slater, M.; Slavicek, T.; Slawinska, M.; Sliwa, K.; Slovak, R.; Smakhtin, V.; Smart, B. H.; Smiesko, J.; Smirnov, N.; Smirnov, S. Yu.; Smirnov, Y.; Smirnova, L. N.; Smirnova, O.; Smith, J. W.; Smith, M. N. K.; Smith, R. W.; Smizanska, M.; Smolek, K.; Snesarev, A. A.; Snyder, I. M.; Snyder, S.; Sobie, R.; Socher, F.; Soffa, A. M.; Soffer, A.; Søgaard, A.; Soh, D. A.; Sokhrannyi, G.; Solans Sanchez, C. A.; Solar, M.; Soldatov, E. Yu.; Soldevila, U.; Solodkov, A. A.; Soloshenko, A.; Solovyanov, O. V.; Solovyev, V.; Sommer, P.; Son, H.; Song, W.; Sopczak, A.; Sosa, D.; Sotiropoulou, C. L.; Sottocornola, S.; Soualah, R.; Soukharev, A. M.; South, D.; Sowden, B. C.; Spagnolo, S.; Spalla, M.; Spangenberg, M.; Spanò, F.; Sperlich, D.; Spettel, F.; Spieker, T. M.; Spighi, R.; Spigo, G.; Spiller, L. A.; Spousta, M.; St. Denis, R. D.; Stabile, A.; Stamen, R.; Stamm, S.; Stanecka, E.; Stanek, R. W.; Stanescu, C.; Stanitzki, M. M.; Stapf, B. S.; Stapnes, S.; Starchenko, E. A.; Stark, G. H.; Stark, J.; Stark, S. H.; Staroba, P.; Starovoitov, P.; Stärz, S.; Staszewski, R.; Stegler, M.; Steinberg, P.; Stelzer, B.; Stelzer, H. J.; Stelzer-Chilton, O.; Stenzel, H.; Stevenson, T. J.; Stewart, G. A.; Stockton, M. C.; Stoebe, M.; Stoicea, G.; Stolte, P.; Stonjek, S.; Stradling, A. R.; Straessner, A.; Stramaglia, M. E.; Strandberg, J.; Strandberg, S.; Strauss, M.; Strizenec, P.; Ströhmer, R.; Strom, D. M.; Stroynowski, R.; Strubig, A.; Stucci, S. A.; Stugu, B.; Styles, N. A.; Su, D.; Su, J.; Suchek, S.; Sugaya, Y.; Suk, M.; Sulin, V. V.; Sultan, Dms; Sultansoy, S.; Sumida, T.; Sun, S.; Sun, X.; Suruliz, K.; Suster, C. J. E.; Sutton, M. R.; Suzuki, S.; Svatos, M.; Swiatlowski, M.; Swift, S. P.; Sydorenko, A.; Sykora, I.; Sykora, T.; Ta, D.; Tackmann, K.; Taenzer, J.; Taffard, A.; Tafirout, R.; Tahirovic, E.; Taiblum, N.; Takai, H.; Takashima, R.; Takasugi, E. H.; Takeda, K.; Takeshita, T.; Takubo, Y.; Talby, M.; Talyshev, A. A.; Tanaka, J.; Tanaka, M.; Tanaka, R.; Tanioka, R.; Tannenwald, B. B.; Tapia Araya, S.; Tapprogge, S.; Tarem, S.; Tartarelli, G. F.; Tas, P.; Tasevsky, M.; Tashiro, T.; Tassi, E.; Tavares Delgado, A.; Tayalati, Y.; Taylor, A. C.; Taylor, A. J.; Taylor, G. N.; Taylor, P. T. E.; Taylor, W.; Teixeira-Dias, P.; Temple, D.; Ten Kate, H.; Teng, P. K.; Teoh, J. J.; Tepel, F.; Terada, S.; Terashi, K.; Terron, J.; Terzo, S.; Testa, M.; Teuscher, R. J.; Thais, S. J.; Theveneaux-Pelzer, T.; Thiele, F.; Thomas, J. P.; Thomas-Wilsker, J.; Thompson, P. D.; Thompson, A. S.; Thomsen, L. A.; Thomson, E.; Tian, Y.; Ticse Torres, R. E.; Tikhomirov, V. O.; Tikhonov, Yu. A.; Timoshenko, S.; Tipton, P.; Tisserant, S.; Todome, K.; Todorova-Nova, S.; Todt, S.; Tojo, J.; Tokár, S.; Tokushuku, K.; Tolley, E.; Tomlinson, L.; Tomoto, M.; Tompkins, L.; Toms, K.; Tong, B.; Tornambe, P.; Torrence, E.; Torres, H.; Torró Pastor, E.; Toth, J.; Touchard, F.; Tovey, D. R.; Treado, C. J.; Trefzger, T.; Tresoldi, F.; Tricoli, A.; Trigger, I. M.; Trincaz-Duvoid, S.; Tripiana, M. F.; Trischuk, W.; Trocmé, B.; Trofymov, A.; Troncon, C.; Trovatelli, M.; Truong, L.; Trzebinski, M.; Trzupek, A.; Tsang, K. W.; Tseng, J. C.-L.; Tsiareshka, P. V.; Tsirintanis, N.; Tsiskaridze, S.; Tsiskaridze, V.; Tskhadadze, E. G.; Tsukerman, I. I.; Tsulaia, V.; Tsuno, S.; Tsybychev, D.; Tu, Y.; Tudorache, A.; Tudorache, V.; Tulbure, T. T.; Tuna, A. N.; Turchikhin, S.; Turgeman, D.; Turk Cakir, I.; Turra, R.; Tuts, P. M.; Ucchielli, G.; Ueda, I.; Ughetto, M.; Ukegawa, F.; Unal, G.; Undrus, A.; Unel, G.; Ungaro, F. C.; Unno, Y.; Uno, K.; Urban, J.; Urquijo, P.; Urrejola, P.; Usai, G.; Usui, J.; Vacavant, L.; Vacek, V.; Vachon, B.; Vadla, K. O. H.; Vaidya, A.; Valderanis, C.; Valdes Santurio, E.; Valente, M.; Valentinetti, S.; Valero, A.; Valéry, L.; Vallier, A.; Valls Ferrer, J. A.; van den Wollenberg, W.; van der Graaf, H.; van Gemmeren, P.; van Nieuwkoop, J.; van Vulpen, I.; van Woerden, M. C.; Vanadia, M.; Vandelli, W.; Vaniachine, A.; Vankov, P.; Vardanyan, G.; Vari, R.; Varnes, E. W.; Varni, C.; Varol, T.; Varouchas, D.; Vartapetian, A.; Varvell, K. E.; Vasquez, J. G.; Vasquez, G. A.; Vazeille, F.; Vazquez Furelos, D.; Vazquez Schroeder, T.; Veatch, J.; Veeraraghavan, V.; Veloce, L. M.; Veloso, F.; Veneziano, S.; Ventura, A.; Venturi, M.; Venturi, N.; Vercesi, V.; Verducci, M.; Verkerke, W.; Vermeulen, A. T.; Vermeulen, J. C.; Vetterli, M. C.; Viaux Maira, N.; Viazlo, O.; Vichou, I.; Vickey, T.; Vickey Boeriu, O. E.; Viehhauser, G. H. A.; Viel, S.; Vigani, L.; Villa, M.; Villaplana Perez, M.; Vilucchi, E.; Vincter, M. G.; Vinogradov, V. B.; Vishwakarma, A.; Vittori, C.; Vivarelli, I.; Vlachos, S.; Vogel, M.; Vokac, P.; Volpi, G.; von Buddenbrock, S. E.; von der Schmitt, H.; von Toerne, E.; Vorobel, V.; Vorobev, K.; Vos, M.; Voss, R.; Vossebeld, J. H.; Vranjes, N.; Vranjes Milosavljevic, M.; Vrba, V.; Vreeswijk, M.; Vuillermet, R.; Vukotic, I.; Wagner, P.; Wagner, W.; Wagner-Kuhr, J.; Wahlberg, H.; Wahrmund, S.; Wakamiya, K.; Walder, J.; Walker, R.; Walkowiak, W.; Wallangen, V.; Wang, A. M.; Wang, C.; Wang, F.; Wang, H.; Wang, H.; Wang, J.; Wang, J.; Wang, Q.; Wang, R.-J.; Wang, R.; Wang, S. M.; Wang, T.; Wang, W.; Wang, W.; Wang, Z.; Wanotayaroj, C.; Warburton, A.; Ward, C. P.; Wardrope, D. R.; Washbrook, A.; Watkins, P. M.; Watson, A. T.; Watson, M. F.; Watts, G.; Watts, S.; Waugh, B. M.; Webb, A. F.; Webb, S.; Weber, M. S.; Weber, S. M.; Weber, S. A.; Webster, J. S.; Weidberg, A. R.; Weinert, B.; Weingarten, J.; Weirich, M.; Weiser, C.; Wells, P. S.; Wenaus, T.; Wengler, T.; Wenig, S.; Wermes, N.; Werner, M. D.; Werner, P.; Wessels, M.; Weston, T. D.; Whalen, K.; Whallon, N. L.; Wharton, A. M.; White, A. S.; White, A.; White, M. J.; White, R.; Whiteson, D.; Whitmore, B. W.; Wickens, F. J.; Wiedenmann, W.; Wielers, M.; Wiglesworth, C.; Wiik-Fuchs, L. A. M.; Wildauer, A.; Wilk, F.; Wilkens, H. G.; Williams, H. H.; Williams, S.; Willis, C.; Willocq, S.; Wilson, J. A.; Wingerter-Seez, I.; Winkels, E.; Winklmeier, F.; Winston, O. J.; Winter, B. T.; Wittgen, M.; Wobisch, M.; Wolf, A.; Wolf, T. M. H.; Wolff, R.; Wolter, M. W.; Wolters, H.; Wong, V. W. S.; Woods, N. L.; Worm, S. D.; Wosiek, B. K.; Wotschack, J.; Wozniak, K. W.; Wu, M.; Wu, S. L.; Wu, X.; Wu, Y.; Wyatt, T. R.; Wynne, B. M.; Xella, S.; Xi, Z.; Xia, L.; Xu, D.; Xu, L.; Xu, T.; Xu, W.; Yabsley, B.; Yacoob, S.; Yajima, K.; Yallup, D. P.; Yamaguchi, D.; Yamaguchi, Y.; Yamamoto, A.; Yamanaka, T.; Yamane, F.; Yamatani, M.; Yamazaki, T.; Yamazaki, Y.; Yan, Z.; Yang, H.; Yang, H.; Yang, S.; Yang, Y.; Yang, Z.; Yao, W.-M.; Yap, Y. C.; Yasu, Y.; Yatsenko, E.; Yau Wong, K. H.; Ye, J.; Ye, S.; Yeletskikh, I.; Yigitbasi, E.; Yildirim, E.; Yorita, K.; Yoshihara, K.; Young, C.; Young, C. J. S.; Yu, J.; Yu, J.; Yuen, S. P. Y.; Yusuff, I.; Zabinski, B.; Zacharis, G.; Zaidan, R.; Zaitsev, A. M.; Zakharchuk, N.; Zalieckas, J.; Zaman, A.; Zambito, S.; Zanzi, D.; Zeitnitz, C.; Zemaityte, G.; Zeng, J. C.; Zeng, Q.; Zenin, O.; Ženiš, T.; Zerwas, D.; Zhang, D.; Zhang, D.; Zhang, F.; Zhang, G.; Zhang, H.; Zhang, J.; Zhang, L.; Zhang, L.; Zhang, M.; Zhang, P.; Zhang, R.; Zhang, R.; Zhang, X.; Zhang, Y.; Zhang, Z.; Zhao, X.; Zhao, Y.; Zhao, Z.; Zhemchugov, A.; Zhou, B.; Zhou, C.; Zhou, L.; Zhou, M.; Zhou, M.; Zhou, N.; Zhou, Y.; Zhu, C. G.; Zhu, H.; Zhu, J.; Zhu, Y.; Zhuang, X.; Zhukov, K.; Zibell, A.; Zieminska, D.; Zimine, N. I.; Zimmermann, S.; Zinonos, Z.; Zinser, M.; Ziolkowski, M.; Živković, L.; Zobernig, G.; Zoccoli, A.; Zou, R.; Zur Nedden, M.; Zwalinski, L.; Atlas Collaboration
2018-05-01
A search for the narrow structure, X (5568 ), reported by the D0 Collaboration in the decay sequence X →Bs0π±, Bs0→J /ψ ϕ , is presented. The analysis is based on a data sample recorded with the ATLAS detector at the LHC corresponding to 4.9 fb-1 of p p collisions at 7 TeV and 19.5 fb-1 at 8 TeV. No significant signal was found. Upper limits on the number of signal events, with properties corresponding to those reported by D0, and on the X production rate relative to Bs0 mesons, ρX, were determined at 95% confidence level. The results are N (X )<382 and ρX<0.015 for Bs0 mesons with transverse momenta above 10 GeV, and N (X )<356 and ρX<0.016 for transverse momenta above 15 GeV. Limits are also set for potential Bs0π± resonances in the mass range 5550 to 5700 MeV.
Hao, Xiao-Hu; Zhang, Gui-Jun; Zhou, Xiao-Gen; Yu, Xu-Feng
2016-01-01
To address the searching problem of protein conformational space in ab-initio protein structure prediction, a novel method using abstract convex underestimation (ACUE) based on the framework of evolutionary algorithm was proposed. Computing such conformations, essential to associate structural and functional information with gene sequences, is challenging due to the high-dimensionality and rugged energy surface of the protein conformational space. As a consequence, the dimension of protein conformational space should be reduced to a proper level. In this paper, the high-dimensionality original conformational space was converted into feature space whose dimension is considerably reduced by feature extraction technique. And, the underestimate space could be constructed according to abstract convex theory. Thus, the entropy effect caused by searching in the high-dimensionality conformational space could be avoided through such conversion. The tight lower bound estimate information was obtained to guide the searching direction, and the invalid searching area in which the global optimal solution is not located could be eliminated in advance. Moreover, instead of expensively calculating the energy of conformations in the original conformational space, the estimate value is employed to judge if the conformation is worth exploring to reduce the evaluation time, thereby making computational cost lower and the searching process more efficient. Additionally, fragment assembly and the Monte Carlo method are combined to generate a series of metastable conformations by sampling in the conformational space. The proposed method provides a novel technique to solve the searching problem of protein conformational space. Twenty small-to-medium structurally diverse proteins were tested, and the proposed ACUE method was compared with It Fix, HEA, Rosetta and the developed method LEDE without underestimate information. Test results show that the ACUE method can more rapidly and more
Long, Kim Chenming
Real-world engineering optimization problems often require the consideration of multiple conflicting and noncommensurate objectives, subject to nonconvex constraint regions in a high-dimensional decision space. Further challenges occur for combinatorial multiobjective problems in which the decision variables are not continuous. Traditional multiobjective optimization methods of operations research, such as weighting and epsilon constraint methods, are ill-suited to solving these complex, multiobjective problems. This has given rise to the application of a wide range of metaheuristic optimization algorithms, such as evolutionary, particle swarm, simulated annealing, and ant colony methods, to multiobjective optimization. Several multiobjective evolutionary algorithms have been developed, including the strength Pareto evolutionary algorithm (SPEA) and the non-dominated sorting genetic algorithm (NSGA), for determining the Pareto-optimal set of non-dominated solutions. Although numerous researchers have developed a wide range of multiobjective optimization algorithms, there is a continuing need to construct computationally efficient algorithms with an improved ability to converge to globally non-dominated solutions along the Pareto-optimal front for complex, large-scale, multiobjective engineering optimization problems. This is particularly important when the multiple objective functions and constraints of the real-world system cannot be expressed in explicit mathematical representations. This research presents a novel metaheuristic evolutionary algorithm for complex multiobjective optimization problems, which combines the metaheuristic tabu search algorithm with the evolutionary algorithm (TSEA), as embodied in genetic algorithms. TSEA is successfully applied to bicriteria (i.e., structural reliability and retrofit cost) optimization of the aircraft tail structure fatigue life, which increases its reliability by prolonging fatigue life. A comparison for this
DEFF Research Database (Denmark)
Ruban, Andrei; Abrikosov, I. A.; Kats, D. Ya.
1994-01-01
We have calculated the electronic structure and segregation profiles of the (001) surface of random Cu-Ni alloys with varying bulk concentrations by means of the coherent potential approximation and the linear muffin-tin-orbitals method. Exchange and correlation were included within the local......-density approximation. Temperature effects were accounted for by means of the cluster-variation method and, for comparison, by mean-field theory. The necessary interaction parameters were calculated by the Connolly-Williams method generalized to the case of a surface of a random alloy. We find the segregation profiles...
International Nuclear Information System (INIS)
Laperashvili, L.V.
1994-01-01
An overview of papers by Nielson, Bennet, Brene, and Picek, forming the basis of the model called random dynamics, is given in the first part of this work. The fine structure constant is calculated in the second part of this work by using the technique of path integration in the U(1) lattice gauge theory. It is shown that α U(1),crit -1 ∼ 19.8. This value is in agreement with the prediction of random dynamics. The obtained results are compared with the results of Monte Carlo simulations. 20 refs., 3 figs., 1 tab
DEFF Research Database (Denmark)
Liang, Shanshan; Crovetto, Andrea; Peng, Zhuoteng
2016-01-01
and experiments with piezoelectric elements show that the energy harvesting device with the bi-resonant structure can generate higher power output than that of the sum of the two separate devices from random vibration sources at low frequency, and hence significantly improves the vibration-to- electricity......This paper reports on a bi-resonant structure of piezoelectric PVDF films energy harvester (PPEH), which consists of two cantilevers with resonant frequencies of 15 Hz and 22 Hz. With increased acceleration, the vibration amplitudes of the two cantilever-mass structures are increased and collision...
International Nuclear Information System (INIS)
Iwatsubo, Takuzo; Kawamura, Shozo; Mori, Hiroyuki.
1995-01-01
In this paper, the method to obtain the random response of a structure with uncertain parameters is proposed. The proposed method is a combination of the substructure synthesis method and the hierarchy method. The concept of the proposed method is that the hierarchy equation of each substructure is obtained using the hierarchy method, and the hierarchy equation of the overall structure is obtained using the substructure synthesis method. Using the proposed method, the reduced order hierarchy equation can be obtained without analyzing the original whole structure. After the calculation of the mean square value of response, the reliability analysis can be carried out based on the first passage problem and Poisson's excursion rate. As a numerical example of structure, a simple piping system is considered. The damping constant of the support is considered as the uncertainty parameter. Then the random response is calculated using the proposed method. As a result, the proposed method is useful to analyze the random response in terms of the accuracy, computer storage and calculation time. (author)
Energy Technology Data Exchange (ETDEWEB)
Capiez-Lernout, E.; Soize, Ch. [Universite de Marne la Vallee, Lab. de Mecanique, 77 (France)
2003-10-01
The mis-tuning of blades is frequently the cause of spatial localizations for the dynamic forced response in turbomachinery industry. The random character of mis-tuning requires the construction of probabilistic models of random uncertainties. A usual parametric probabilistic description considers the mis-tuning through the Young modulus of each blade. This model consists in mis-tuning blade eigenfrequencies, assuming the blade modal shapes unchanged. Recently a new approach known as a non-parametric model of random uncertainties has been introduced for modelling random uncertainties in elasto-dynamics. This paper proposes the construction of a non-parametric model which is coherent with all the uncertainties which characterize mis-tuning. As mis-tuning is a phenomenon which is independent from one blade to another one, the structure is considered as an assemblage of substructures. The mean reduced matrix model required by the non-parametric approach is thus constructed by dynamic sub-structuring. A comparative approach is also needed to study the influence of the non-parametric approach for a usual parametric model adapted to mis-tuning. A numerical example is presented. (authors)
Liao, Wenta; Draper, William M
2013-02-21
The mass-to-structure or MTS Search Engine is an Access 2010 database containing theoretical molecular mass information for 19,438 compounds assembled from common sources such as the Merck Index, pesticide and pharmaceutical compilations, and chemical catalogues. This database, which contains no experimental mass spectral data, was developed as an aid to identification of compounds in atmospheric pressure ionization (API)-LC-MS. This paper describes a powerful upgrade to this database, a fully integrated utility for filtering or ranking candidates based on isotope ratios and patterns. The new MTS Search Engine is applied here to the identification of volatile and semivolatile compounds including pesticides, nitrosoamines and other pollutants. Methane and isobutane chemical ionization (CI) GC-MS spectra were obtained from unit mass resolution mass spectrometers to determine MH(+) masses and isotope ratios. Isotopes were measured accurately with errors of Search Engine and details performance testing with over 50 model compounds.
Job search, hours restrictions, and desired hours of work
Bloemen, H.G.
2008-01-01
A structural empirical job search model is presented that incorporates the labor supply decision of individuals. The arrival of a job offer is modeled as a random draw from a wage-hours offer distribution. Subjective information is used on desired working hours to identify optimal hours from offered
International Nuclear Information System (INIS)
Vani, V C; Chatterjee, S
2010-01-01
The matched filter method for detecting a periodic structure on a surface hidden behind randomness is known to detect up to (r 0 /Λ)≥0.11, where r 0 is the coherence length of light on scattering from the rough part and Λ is the wavelength of the periodic part of the surface-the above limit being much lower than what is allowed by conventional detection methods. The primary goal of this technique is the detection and characterization of the periodic structure hidden behind randomness without the use of any complicated experimental or computational procedures. This paper examines this detection procedure for various values of the amplitude a of the periodic part beginning from a=0 to small finite values of a. We thus address the importance of the following quantities: '(a/λ)', which scales the amplitude of the periodic part with the wavelength of light, and (r 0 /Λ), in determining the detectability of the intensity peaks.
Kim, Hyojin; Park, Sun-Young; Bozeman, Ingrid
2011-09-01
While the Internet is a popular source of health information, health seekers' inadequate skills to locate and discern quality information pose a potential threat to their healthcare decision-making. We aimed to examine health information search and appraisal behaviours among young, heavy users of the Internet. In study 1, we observed and interviewed 11 college students about their search strategies and evaluation of websites. In study 2, three health experts evaluated two websites selected as the best information sources in study 1. Familiarity with health websites and confidence in search strategies were major factors affecting search and evaluation behaviours. Website quality was mostly judged by aesthetics and peripheral cues of source credibility and message credibility. In contrast to users' favourable website evaluation, the experts judged the websites to be inappropriate and untrustworthy. Our results highlight a critical need to provide young health seekers with resources and training that are specifically geared toward health information search and appraisal. The role of health seekers' knowledge and involvement with the health issue in search effort and success warrants future research. © 2011 The authors. Health Information and Libraries Journal © 2011 Health Libraries Group.
Online Patent Searching: The Realities.
Kaback, Stuart M.
1983-01-01
Considers patent subject searching capabilities of major online databases, noting patent claims, "deep-indexed" files, test searches, retrieval of related references, multi-database searching, improvements needed in indexing of chemical structures, full text searching, improvements needed in handling numerical data, and augmenting a…
Phase structure of the O(n) model on a random lattice for n > 2
DEFF Research Database (Denmark)
Durhuus, B.; Kristjansen, C.
1997-01-01
We show that coarse graining arguments invented for the analysis of multi-spin systems on a randomly triangulated surface apply also to the O(n) model on a random lattice. These arguments imply that if the model has a critical point with diverging string susceptibility, then either γ = +1....../2 or there exists a dual critical point with negative string susceptibility exponent, γ̃, related to γ by γ = γ̃/γ̃-1. Exploiting the exact solution of the O(n) model on a random lattice we show that both situations are realized for n > 2 and that the possible dual pairs of string susceptibility exponents are given...... by (γ̃, γ) = (-1/m, 1/m+1), m = 2, 3, . . . We also show that at the critical points with positive string susceptibility exponent the average number of loops on the surface diverges while the average length of a single loop stays finite....
Directory of Open Access Journals (Sweden)
Hong Jun-Jie
2009-05-01
Full Text Available Abstract Background Internal ribosomal entry sites (IRESs provide alternative, cap-independent translation initiation sites in eukaryotic cells. IRES elements are important factors in viral genomes and are also useful tools for bi-cistronic expression vectors. Most existing RNA structure prediction programs are unable to deal with IRES elements. Results We designed an IRES search system, named IRSS, to obtain better results for IRES prediction. RNA secondary structure prediction and comparison software programs were implemented to construct our two-stage strategy for the IRSS. Two software programs formed the backbone of IRSS: the RNAL fold program, used to predict local RNA secondary structures by minimum free energy method; and the RNA Align program, used to compare predicted structures. After complete viral genome database search, the IRSS have low error rate and up to 72.3% sensitivity in appropriated parameters. Conclusion IRSS is freely available at this website http://140.135.61.9/ires/. In addition, all source codes, precompiled binaries, examples and documentations are downloadable for local execution. This new search approach for IRES elements will provide a useful research tool on IRES related studies.
Morville, Peter
2010-01-01
What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont
Directory of Open Access Journals (Sweden)
Asenjo Juan A
2011-04-01
Full Text Available Abstract Background Functionally relevant artificial or natural mutations are difficult to assess or predict if no structure-function information is available for a protein. This is especially important to correctly identify functionally significant non-synonymous single nucleotide polymorphisms (nsSNPs or to design a site-directed mutagenesis strategy for a target protein. A new and powerful methodology is proposed to guide these two decision strategies, based only on conservation rules of physicochemical properties of amino acids extracted from a multiple alignment of a protein family where the target protein belongs, with no need of explicit structure-function relationships. Results A statistical analysis is performed over each amino acid position in the multiple protein alignment, based on different amino acid physical or chemical characteristics, including hydrophobicity, side-chain volume, charge and protein conformational parameters. The variances of each of these properties at each position are combined to obtain a global statistical indicator of the conservation degree of each property. Different types of physicochemical conservation are defined to characterize relevant and irrelevant positions. The differences between statistical variances are taken together as the basis of hypothesis tests at each position to search for functionally significant mutable sites and to identify specific mutagenesis targets. The outcome is used to statistically predict physicochemical consensus sequences based on different properties and to calculate the amino acid propensities at each position in a given protein. Hence, amino acid positions are identified that are putatively responsible for function, specificity, stability or binding interactions in a family of proteins. Once these key functional positions are identified, position-specific statistical distributions are applied to divide the 20 common protein amino acids in each position of the protein
Ayvaz, M. Tamer
2007-11-01
This study proposes an inverse solution algorithm through which both the aquifer parameters and the zone structure of these parameters can be determined based on a given set of observations on piezometric heads. In the zone structure identification problem fuzzy c-means ( FCM) clustering method is used. The association of the zone structure with the transmissivity distribution is accomplished through an optimization model. The meta-heuristic harmony search ( HS) algorithm, which is conceptualized using the musical process of searching for a perfect state of harmony, is used as an optimization technique. The optimum parameter zone structure is identified based on three criteria which are the residual error, parameter uncertainty, and structure discrimination. A numerical example given in the literature is solved to demonstrate the performance of the proposed algorithm. Also, a sensitivity analysis is performed to test the performance of the HS algorithm for different sets of solution parameters. Results indicate that the proposed solution algorithm is an effective way in the simultaneous identification of aquifer parameters and their corresponding zone structures.
Composite Differential Search Algorithm
Directory of Open Access Journals (Sweden)
Bo Liu
2014-01-01
Full Text Available Differential search algorithm (DS is a relatively new evolutionary algorithm inspired by the Brownian-like random-walk movement which is used by an organism to migrate. It has been verified to be more effective than ABC, JDE, JADE, SADE, EPSDE, GSA, PSO2011, and CMA-ES. In this paper, we propose four improved solution search algorithms, namely “DS/rand/1,” “DS/rand/2,” “DS/current to rand/1,” and “DS/current to rand/2” to search the new space and enhance the convergence rate for the global optimization problem. In order to verify the performance of different solution search methods, 23 benchmark functions are employed. Experimental results indicate that the proposed algorithm performs better than, or at least comparable to, the original algorithm when considering the quality of the solution obtained. However, these schemes cannot still achieve the best solution for all functions. In order to further enhance the convergence rate and the diversity of the algorithm, a composite differential search algorithm (CDS is proposed in this paper. This new algorithm combines three new proposed search schemes including “DS/rand/1,” “DS/rand/2,” and “DS/current to rand/1” with three control parameters using a random method to generate the offspring. Experiment results show that CDS has a faster convergence rate and better search ability based on the 23 benchmark functions.
Optimal intermittent search strategies
International Nuclear Information System (INIS)
Rojo, F; Budde, C E; Wio, H S
2009-01-01
We study the search kinetics of a single fixed target by a set of searchers performing an intermittent random walk, jumping between different internal states. Exploiting concepts of multi-state and continuous-time random walks we have calculated the survival probability of a target up to time t, and have 'optimized' (minimized) it with regard to the transition probability among internal states. Our model shows that intermittent strategies always improve target detection, even for simple diffusion states of motion
Zwarenstein, Merrick; Reeves, Scott; Russell, Ann; Kenaszchuk, Chris; Conn, Lesley Gotlib; Miller, Karen-Lee; Lingard, Lorelei; Thorpe, Kevin E
2007-01-01
Abstract Background Despite a burgeoning interest in using interprofessional approaches to promote effective collaboration in health care, systematic reviews find scant evidence of benefit. This protocol describes the first cluster randomized controlled trial (RCT) to design and evaluate an intervention intended to improve interprofessional collaborative communication and patient-centred care. Objectives The objective is to evaluate the effects of a four-component, hospital-based staff commun...
Structure and Randomness of Continuous-Time, Discrete-Event Processes
Marzen, Sarah E.; Crutchfield, James P.
2017-10-01
Loosely speaking, the Shannon entropy rate is used to gauge a stochastic process' intrinsic randomness; the statistical complexity gives the cost of predicting the process. We calculate, for the first time, the entropy rate and statistical complexity of stochastic processes generated by finite unifilar hidden semi-Markov models—memoryful, state-dependent versions of renewal processes. Calculating these quantities requires introducing novel mathematical objects (ɛ -machines of hidden semi-Markov processes) and new information-theoretic methods to stochastic processes.
Statistics of equally weighted random paths on a class of self-similar structures
International Nuclear Information System (INIS)
Knezevic, Milan; Knezevic, Dragica; Spasojevic, Djordje
2004-01-01
We study the statistics of equally weighted random walk paths on a family of Sierpinski gasket lattices whose members are labelled by an integer b (2 ≤ b 2, mean path end-to-end distance grows more slowly than any power of its length N. We provide arguments for the emergence of usual power law critical behaviour in the limit b → ∞ when fractal lattices become almost compact
International Nuclear Information System (INIS)
Granger, S.; Perotin, L.
1997-01-01
Maintaining the PWR components under reliable operating conditions requires a complex design to prevent various damaging processes, including fatigue and wear problems due to flow-induced vibration. In many practical situations, it is difficult, if not impossible, to perform direct measurements or calculations of the external forces acting on vibrating structures. Instead, vibrational responses can often be conveniently measured. This paper presents an inverse method for estimating a distributed random excitation from the measurement of the structural response at a number of discrete points. This paper is devoted to the presentation of the theoretical development. The force identification method is based on a modal model for the structure and a spatial orthonormal decomposition of the excitation field. The estimation of the Fourier coefficients of this orthonormal expansion is presented. As this problem turns out to be ill-posed, a regularization process is introduced. The minimization problem associated to this process is then formulated and its solutions is developed. (author)
Energy Technology Data Exchange (ETDEWEB)
Bishop, Joseph E.
2008-09-01
Under extreme loading conditions most often the extent of material and structural fracture is pervasive in the sense that a multitude of cracks are nucleating, propagating in arbitrary directions, coalescing, and branching. Pervasive fracture is a highly nonlinear process involving complex material constitutive behavior, material softening, localization, surface generation, and ubiquitous contact. Two primary applications in which pervasive fracture is encountered are (1) weapons effects on structures and (2) geomechanics of highly jointed and faulted reservoirs. A pure Lagrangian computational method based on randomly close-packed Voronoi tessellations is proposed as a rational approach for simulating the pervasive fracture of materials and structures. Each Voronoi cell is formulated as a finite element using the reproducing kernel method. Fracture surfaces are allowed to nucleate only at the intercell faces. The randomly seeded Voronoi cells provide an unbiased network for representing cracks. In this initial study two approaches for allowing the new surfaces to initiate are studied: (1) dynamic mesh connectivity and the instantaneous insertion of a cohesive traction when localization is detected, and (2) a discontinuous Galerkin approach in which the interelement tractions are an integral part of the variational formulation, but only become active once localization is detected. Pervasive fracture problems are extremely sensitive to initial conditions and system parameters. Dynamic problems exhibit a form of transient chaos. The primary numerical challenge for this class of problems is the demonstration of model objectivity and, in particular, the identification and demonstration of a measure of convergence for engineering quantities of interest.
AUTHOR|(SzGeCERN)749939
2015-01-01
As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.
Energy Technology Data Exchange (ETDEWEB)
Ahmad, I.; Davids, C.; Janssens, R.V.F. [and others
1995-08-01
The interaction between coexisting shapes in nuclei near closed shells was of great interest in the past decade. Excited 0{sup +} states at low energy can often be identified as the bandheads of structures with differing shapes built on those states, These structures were identified in {sup 190-198}Pb via beta decay and alpha decay {open_quotes}fine structure{close_quotes} studies. Coexistence of different shapes in Pb nuclei was predicted by Nilsson-Strutinsky calculations, in which both the oblate and prolate minima were predicted to have excitation energies near 1 MeV. It was our intention to continue the systematic study of the Pb nuclides by searching for excited O{sup +} states in {sup 188}Pb by observing the fine structure in the alpha decay of {sup 192}Po.
Structural analysis of anodic porous alumina used for resistive random access memory
International Nuclear Information System (INIS)
Lee, Jeungwoo; Nigo, Seisuke; Kato, Seiichi; Kitazawa, Hideaki; Kido, Giyuu; Nakano, Yoshihiro
2010-01-01
Anodic porous alumina with duplex layers exhibits a voltage-induced switching effect and is a promising candidate for resistive random access memory. The nanostructural analysis of porous alumina is important for understanding the switching effect. We investigated the difference between the two layers of an anodic porous alumina film using transmission electron microscopy and electron energy-loss spectroscopy. Diffraction patterns showed that both layers are amorphous, and the electron energy-loss spectroscopy indicated that the inner layer contains less oxygen than the outer layer. We speculate that the conduction paths are mostly located in the oxygen-depleted area.
A hybrid search algorithm for swarm robots searching in an unknown environment.
Li, Shoutao; Li, Lina; Lee, Gordon; Zhang, Hao
2014-01-01
This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency.
Gilthorpe, M S; Dahly, D L; Tu, Y K; Kubzansky, L D; Goodman, E
2014-06-01
Lifecourse trajectories of clinical or anthropological attributes are useful for identifying how our early-life experiences influence later-life morbidity and mortality. Researchers often use growth mixture models (GMMs) to estimate such phenomena. It is common to place constrains on the random part of the GMM to improve parsimony or to aid convergence, but this can lead to an autoregressive structure that distorts the nature of the mixtures and subsequent model interpretation. This is especially true if changes in the outcome within individuals are gradual compared with the magnitude of differences between individuals. This is not widely appreciated, nor is its impact well understood. Using repeat measures of body mass index (BMI) for 1528 US adolescents, we estimated GMMs that required variance-covariance constraints to attain convergence. We contrasted constrained models with and without an autocorrelation structure to assess the impact this had on the ideal number of latent classes, their size and composition. We also contrasted model options using simulations. When the GMM variance-covariance structure was constrained, a within-class autocorrelation structure emerged. When not modelled explicitly, this led to poorer model fit and models that differed substantially in the ideal number of latent classes, as well as class size and composition. Failure to carefully consider the random structure of data within a GMM framework may lead to erroneous model inferences, especially for outcomes with greater within-person than between-person homogeneity, such as BMI. It is crucial to reflect on the underlying data generation processes when building such models.
Research on Some Bus Transport Networks with Random Overlapping Clique Structure
International Nuclear Information System (INIS)
Yang Xuhua; Sun Youxian; Wang Bo; Wang Wanliang
2008-01-01
On the basis of investigating the statistical data of bus transport networks of three big cities in China, we propose that each bus route is a clique (maximal complete subgraph) and a bus transport network (BTN) consists of a lot of cliques, which intensively connect and overlap with each other. We study the network properties, which include the degree distribution, multiple edges' overlapping time distribution, distribution of the overlap size between any two overlapping cliques, distribution of the number of cliques that a node belongs to. Naturally, the cliques also constitute a network, with the overlapping nodes being their multiple links. We also research its network properties such as degree distribution, clustering, average path length, and so on. We propose that a BTN has the properties of random clique increment and random overlapping clique, at the same time, a BTN is a small-world network with highly clique-clustered and highly clique-overlapped. Finally, we introduce a BTN evolution model, whose simulation results agree well with the statistical laws that emerge in real BTNs
Directory of Open Access Journals (Sweden)
Marcy L. Brown
2008-03-01
Full Text Available Objective – To determine the success rate of electronic resources for answering clinical questions by comparing speed, validity, and applicability of two different protocols for searching the medical literature.Design – Randomized trial with results judged by blinded panel.Setting – Duke University Medical Center in Durham, North Carolina, United States ofAmerica.Subjects – Thirty‐two 2nd and 3rd year internal medicine residents on an eight week general medicine rotation at the Duke University Medical Center.Methods – Two search protocols were developed:Protocol A: Participants searched MEDLINE first, and then searched pre‐appraised resources if needed.Protocol B: Participants searched pre‐appraised resources first, which included UpToDate, ACP JournalClub, Cochrane Database of Systematic Reviews, and DARE. The residents then searched MEDLINE if an answer could not be found in the 66 initial group of pre‐appraised resources. Residents were randomised by computer-assisted block order into four blocks of eight residents each. Two blocks were assigned to Protocol A, and two to Protocol B. Each day, residents developed at least one clinical question related to caring for patients. The questions were transcribed onto pocket-sized cards, with the answer sought later using the assigned protocol. If answers weren’t found using either protocol, searches were permitted in other available resources. When an article that answered a question was found, the resident recorded basic information about the question and the answer as well as the time required to find the answer (less than five minutes; between five and ten minutes; or more than ten minutes. Residents were to select answers that were “methodologically sound and clinically important” (384. Ten faculty members formally trained in evidence‐based medicine (EBM reviewed a subset of therapy‐related questions and answers. The reviewers, who were blinded to the search protocols
Kirousis, Lefteris; Ortiz-Gracia, Luis; Serna, Maria
2017-01-01
This book is divided into two parts, the first of which seeks to connect the phase transitions of various disciplines, including game theory, and to explore the synergies between statistical physics and combinatorics. Phase Transitions has been an active multidisciplinary field of research, bringing together physicists, computer scientists and mathematicians. The main research theme explores how atomic agents that act locally and microscopically lead to discontinuous macroscopic changes. Adopting this perspective has proven to be especially useful in studying the evolution of random and usually complex or large combinatorial objects (like networks or logic formulas) with respect to discontinuous changes in global parameters like connectivity, satisfiability etc. There is, of course, an obvious strategic element in the formation of a transition: the atomic agents “selfishly” seek to optimize a local parameter. However, up to now this game-theoretic aspect of abrupt, locally triggered changes had not been e...
Structural and magnetic properties of Co films on highly textured and randomly oriented C_6_0 layers
International Nuclear Information System (INIS)
Kim, Dong-Ok; Choi, Jun Woo; Lee, Dong Ryeol
2016-01-01
The structural and magnetic properties of Co/C_6_0/pentacene and Co/C_6_0 thin film structures were investigated. Atomic force microscopy and x-ray reflectivity analysis show that the presence or absence of a pentacene buffer layer leads to a highly textured or randomly oriented C_6_0 layer, respectively. A Co film deposited on a randomly oriented C_6_0 layer penetrates into the C_6_0 layer when it is deposited at a slow deposition rate. The Co penetration can be minimized, regardless of the Co deposition rate, by growth on a highly textured and nanostructured C_6_0/pentacene layer. Vibrating sample magnetometry measurements show that the saturation magnetization of Co/C_6_0/pentacene is significantly reduced compared to that of Co/C_6_0. On the other hand, the Co penetration does not seem to have an effect on the magnetic properties, suggesting that the structural properties of the Co and C_6_0 layer, rather than the Co penetration into the organic C_6_0 layer, are critical to the magnetic properties of the Co/C_6_0. - Highlights: • Structural and magnetic properties of metal(Co)-organic(C_6_0) interface is studied. • Highly textured C_6_0 layer was grown on a pentacene buffer layer (C_6_0/pentacene). • Co penetration into the C_6_0 is significantly suppressed in Co/C_6_0/pentacene. • The Co magnetization in Co/C_6_0/pentacene is reduced than that in Co/C_6_0.
Energy Technology Data Exchange (ETDEWEB)
Kim, Dong-Ok [Department of Physics, Soongsil University, Seoul 156-743 (Korea, Republic of); Choi, Jun Woo, E-mail: junwoo@kist.re.kr [Center for Spintronics Research, Korea Institute of Science and Technology, Seoul 136-791 (Korea, Republic of); Lee, Dong Ryeol, E-mail: drlee@ssu.ac.kr [Department of Physics, Soongsil University, Seoul 156-743 (Korea, Republic of)
2016-03-01
The structural and magnetic properties of Co/C{sub 60}/pentacene and Co/C{sub 60} thin film structures were investigated. Atomic force microscopy and x-ray reflectivity analysis show that the presence or absence of a pentacene buffer layer leads to a highly textured or randomly oriented C{sub 60} layer, respectively. A Co film deposited on a randomly oriented C{sub 60} layer penetrates into the C{sub 60} layer when it is deposited at a slow deposition rate. The Co penetration can be minimized, regardless of the Co deposition rate, by growth on a highly textured and nanostructured C{sub 60}/pentacene layer. Vibrating sample magnetometry measurements show that the saturation magnetization of Co/C{sub 60}/pentacene is significantly reduced compared to that of Co/C{sub 60}. On the other hand, the Co penetration does not seem to have an effect on the magnetic properties, suggesting that the structural properties of the Co and C{sub 60} layer, rather than the Co penetration into the organic C{sub 60} layer, are critical to the magnetic properties of the Co/C{sub 60}. - Highlights: • Structural and magnetic properties of metal(Co)-organic(C{sub 60}) interface is studied. • Highly textured C{sub 60} layer was grown on a pentacene buffer layer (C{sub 60}/pentacene). • Co penetration into the C{sub 60} is significantly suppressed in Co/C{sub 60}/pentacene. • The Co magnetization in Co/C{sub 60}/pentacene is reduced than that in Co/C{sub 60}.
Avendaño-Valencia, Luis David; Fassois, Spilios D.
2017-12-01
The problem of vibration-based damage diagnosis in structures characterized by time-dependent dynamics under significant environmental and/or operational uncertainty is considered. A stochastic framework consisting of a Gaussian Mixture Random Coefficient model of the uncertain time-dependent dynamics under each structural health state, proper estimation methods, and Bayesian or minimum distance type decision making, is postulated. The Random Coefficient (RC) time-dependent stochastic model with coefficients following a multivariate Gaussian Mixture Model (GMM) allows for significant flexibility in uncertainty representation. Certain of the model parameters are estimated via a simple procedure which is founded on the related Multiple Model (MM) concept, while the GMM weights are explicitly estimated for optimizing damage diagnostic performance. The postulated framework is demonstrated via damage detection in a simple simulated model of a quarter-car active suspension with time-dependent dynamics and considerable uncertainty on the payload. Comparisons with a simpler Gaussian RC model based method are also presented, with the postulated framework shown to be capable of offering considerable improvement in diagnostic performance.
Directory of Open Access Journals (Sweden)
Naser Kazemi Elaki
2016-06-01
Full Text Available In this research, a two-phase algorithm based on the artificial neural network (ANN and a harmony search (HS algorithm has been developed with the aim of assessing the reliability of structures with implicit limit state functions. The proposed method involves the generation of datasets to be used specifically for training by Finite Element analysis, to establish an ANN model using a proven ANN model in the reliability assessment process as an analyzer for structures, and finally estimate the reliability index and failure probability by using the HS algorithm, without any requirements for the explicit form of limit state function. The proposed algorithm is investigated here, and its accuracy and efficiency are demonstrated by using several numerical examples. The results obtained show that the proposed algorithm gives an appropriate estimate for the assessment of reliability of structures.
Bayesian exponential random graph modeling of whole-brain structural networks across lifespan
Sinke, Michel R T; Dijkhuizen, Rick M; Caimo, Alberto; Stam, Cornelis J; Otte, Wim
2016-01-01
Descriptive neural network analyses have provided important insights into the organization of structural and functional networks in the human brain. However, these analyses have limitations for inter-subject or between-group comparisons in which network sizes and edge densities may differ, such as
Sherr, Michael E.; Crow, Janet; Stamey, James; Jones, Johnny; Dyer, Preston
2012-01-01
This study examined the influence of family structure on the outcomes of a sex education program in Miami, Florida. Using an experimental design, data collection occurred at pretest, 3-month, and 6-month follow-up with a sample of teenagers from high schools with a large majority of minority youth, assigned into treatment (n = 549) and control (n…
Random lattice structures. Modelling, manufacture and FEA of their mechanical response
Maliaris, G.; Sarafis, I. T.; Lazaridis, T.; Varoutoglou, A.; Tsakataras, G.
2016-11-01
The implementation of lightweight structures in various applications, especially in Aerospace/ Automotive industries and Orthopaedics, has become a necessity due to their exceptional mechanical properties with respect to reduced weight. In this work we present a Voronoi tessellation based algorithm, which has been developed for modelling stochastic lattice structures. With the proposed algorithm, is possible to generate CAD geometry with controllable structural parameters, such as porosity, cell number and strut thickness. The digital structures were transformed into physical objects through the combination of 3D printing technics and investment casting. This process was applied to check the mechanical behaviour of generated digital models. Until now, the only way to materialize such structures into physical objects, was feasible through 3D printing methods such as Selective Laser Sintering/ Melting (SLS/ SLM). Investment casting possesses numerous advantages against SLS or SLA, with the major one being the material variety. On the other hand, several trials are required in order to calibrate the process parameters to have successful castings, which is the major drawback of investment casting. The manufactured specimens were subjected to compression tests, where their mechanical response was registered in the form of compressive load - displacement curves. Also, a finite element model was developed, using the specimens’ CAD data and compression test parameters. The FE assisted calculation of specimen plastic deformation is identical with the one of the physical object, which validates the conclusions drawn from the simulation results. As it was observed, strut contact is initiated when specimen deformation is approximately 5mm. Although FE calculated compressive force follows the same trend for the first 3mm of compression, then diverges because of the elasto-plastic FE model type definition and the occurred remeshing steps.
Structured patient handoff on an internal medicine ward: A cluster randomized control trial.
Tam, Penny; Nijjar, Aman P; Fok, Mark; Little, Chris; Shingina, Alexandra; Bittman, Jesse; Raghavan, Rashmi; Khan, Nadia A
2018-01-01
The effect of a multi-faceted handoff strategy in a high volume internal medicine inpatient setting on process and patient outcomes has not been clearly established. We set out to determine if a multi-faceted handoff intervention consisting of education, standardized handoff procedures, including fixed time and location for face-to-face handoff would result in improved rates of handoff compared with usual practice. We also evaluated resident satisfaction, health resource utilization and clinical outcomes. This was a cluster randomized controlled trial in a large academic tertiary care center with 18 inpatient internal medicine ward teams from January-April 2013. We randomized nine inpatient teams to an intervention where they received an education session standardizing who and how to handoff patients, with practice and feedback from facilitators. The control group of 9 teams continued usual non-standardized handoffs. The primary process outcome was the rate of patients handed over per 1000 patient nights. Other process outcomes included perceptions of inadequate handoff by overnight physicians, resource utilization overnight and hospital length of stay. Clinical outcomes included medical errors, frequency of patients requiring higher level of care overnight, and in-hospital mortality. The intervention group demonstrated a significant increase in the rate of patients handed over to the overnight physician (62.90/1000 person-nights vs. 46.86/1000 person-nights, p = 0.002). There was no significant difference in other process outcomes except resource utilization was increased in the intervention group (26.35/1000 person-days vs. 17.57/1000 person-days, p-value = 0.01). There was no significant difference between groups in medical errors (4.8% vs. 4.1%), need for higher level of care or in hospital mortality. Limitations include a dependence of accurate record keeping by the overnight physician, the possibility of cross-contamination in the handoff process, analysis at
Bates, Kevin R.; Daniels, Andrew D.; Scuseria, Gustavo E.
1998-01-01
We report a comparison of two linear-scaling methods which avoid the diagonalization bottleneck of traditional electronic structure algorithms. The Chebyshev expansion method (CEM) is implemented for carbon tight-binding calculations of large systems and its memory and timing requirements compared to those of our previously implemented conjugate gradient density matrix search (CG-DMS). Benchmark calculations are carried out on icosahedral fullerenes from C60 to C8640 and the linear scaling memory and CPU requirements of the CEM demonstrated. We show that the CPU requisites of the CEM and CG-DMS are similar for calculations with comparable accuracy.
DEFF Research Database (Denmark)
Syversen, Silje W; Landewe, Robert; van der Heijde, Désirée
2009-01-01
OBJECTIVE: To test the OMERACT 8 draft validation criteria for soluble biomarkers by assessing the strength of literature evidence in support of 5 candidate biomarkers. METHODS: A systematic literature search was conducted on the 5 soluble biomarkers RANKL, osteoprotegerin (OPG), matrix...... metalloprotease (MMP-3), urine C-telopeptide of types I and II collagen (U-CTX-I and U CTX-II), focusing on the 14 OMERACT 8 criteria. Two electronic voting exercises were conducted to address: (1) strength of evidence for each biomarker as reflecting structural damage according to each individual criterion...
International Nuclear Information System (INIS)
Barreiro, F.; Bhadra, S.; Lancaster, M.; Lim, J.N.; Soeldner-Rembold, S.; Straub, B.
1994-11-01
This report contains some of the papers presented by the ZEUS Collaboration at the 27th international conference on high energy physics in Glasgow (20-27 July 1994). These concern deep inelastic ep scattering at low x, photoproduction and diffraction in ep scattering, a measurement of the proton structure function and determination of the low-x gluon distribution, D * and J/Ψ production in ep scattering, multi-jet production and determination of α s in ep scattering, and the search for leptoquarks in ep collisions. (HSI)
Hudson, Brian D.; George, Ashley R.; Ford, Martyn G.; Livingstone, David J.
1992-04-01
Molecular dynamics simulations have been performed on a number of conformationally flexible pyrethroid insecticides. The results indicate that molecular dynamics is a suitable tool for conformational searching of small molecules given suitable simulation parameters. The structures derived from the simulations are compared with the static conformation used in a previous study. Various physicochemical parameters have been calculated for a set of conformations selected from the simulations using multivariate analysis. The averaged values of the parameters over the selected set (and the factors derived from them) are compared with the single conformation values used in the previous study.
Directory of Open Access Journals (Sweden)
L. Genovese
2015-11-01
Full Text Available A series of novel random copolymers of poly(propylene 1,4-cyclohexanedicarboxylate (PPCE containing neo -pentyl glycol sub-unit (P(PCExNCEy were synthesized and characterized in terms of molecular and solid-state properties. In addition, biodegradability studies in compost have been conducted. The copolymers displayed a high and similar thermal stability with respect to PPCE. At room temperature, all the copolymers appeared as semicrystalline materials: the main effect of copolymerization was a lowering of crystallinity degree (χc and a decrease of the melting temperature compared to the parent homopolymer. In particular, Wide Angle X-Ray diffraction (WAXD measurements indicated that P(PCExNCEy copolymers are characterized by cocrystallization, PNCE counits cocrystallizing in PPCE crystalline phase. Final properties and biodegradation rate of the materials under study were strictly dependent on copolymer composition and χc. As a matter of fact, the elastic modulus and the elongation at break decreased and increased, respectively, as neopentyl glycol cyclohexanedicarboxylate (NCE unit content was increased. The presence of a rigid-amorphous phase was evidenced by means of Dynamic Mechanical Thermal Analysis (DMTA analysis in all the samples under investigation. Lastly, the biodegradation rate of P(PCExNCEy copolymers was found to slightly increase with the increasing of NCE molar content.
Structure-Function Analysis of Chloroplast Proteins via Random Mutagenesis Using Error-Prone PCR.
Dumas, Louis; Zito, Francesca; Auroy, Pascaline; Johnson, Xenie; Peltier, Gilles; Alric, Jean
2018-06-01
Site-directed mutagenesis of chloroplast genes was developed three decades ago and has greatly advanced the field of photosynthesis research. Here, we describe a new approach for generating random chloroplast gene mutants that combines error-prone polymerase chain reaction of a gene of interest with chloroplast complementation of the knockout Chlamydomonas reinhardtii mutant. As a proof of concept, we targeted a 300-bp sequence of the petD gene that encodes subunit IV of the thylakoid membrane-bound cytochrome b 6 f complex. By sequencing chloroplast transformants, we revealed 149 mutations in the 300-bp target petD sequence that resulted in 92 amino acid substitutions in the 100-residue target subunit IV sequence. Our results show that this method is suited to the study of highly hydrophobic, multisubunit, and chloroplast-encoded proteins containing cofactors such as hemes, iron-sulfur clusters, and chlorophyll pigments. Moreover, we show that mutant screening and sequencing can be used to study photosynthetic mechanisms or to probe the mutational robustness of chloroplast-encoded proteins, and we propose that this method is a valuable tool for the directed evolution of enzymes in the chloroplast. © 2018 American Society of Plant Biologists. All rights reserved.
Vyas, Manan; Kota, V K B; Chavda, N D
2010-03-01
Finite interacting Fermi systems with a mean-field and a chaos generating two-body interaction are modeled by one plus two-body embedded Gaussian orthogonal ensemble of random matrices with spin degree of freedom [called EGOE(1+2)-s]. Numerical calculations are used to demonstrate that, as lambda , the strength of the interaction (measured in the units of the average spacing of the single-particle levels defining the mean-field), increases, generically there is Poisson to GOE transition in level fluctuations, Breit-Wigner to Gaussian transition in strength functions (also called local density of states) and also a duality region where information entropy will be the same in both the mean-field and interaction defined basis. Spin dependence of the transition points lambda_{c} , lambdaF, and lambdad , respectively, is described using the propagator for the spectral variances and the formula for the propagator is derived. We further establish that the duality region corresponds to a region of thermalization. For this purpose we compared the single-particle entropy defined by the occupancies of the single-particle orbitals with thermodynamic entropy and information entropy for various lambda values and they are very close to each other at lambda=lambdad.
Folksonomical P2P File Sharing Networks Using Vectorized KANSEI Information as Search Tags
Ohnishi, Kei; Yoshida, Kaori; Oie, Yuji
We present the concept of folksonomical peer-to-peer (P2P) file sharing networks that allow participants (peers) to freely assign structured search tags to files. These networks are similar to folksonomies in the present Web from the point of view that users assign search tags to information distributed over a network. As a concrete example, we consider an unstructured P2P network using vectorized Kansei (human sensitivity) information as structured search tags for file search. Vectorized Kansei information as search tags indicates what participants feel about their files and is assigned by the participant to each of their files. A search query also has the same form of search tags and indicates what participants want to feel about files that they will eventually obtain. A method that enables file search using vectorized Kansei information is the Kansei query-forwarding method, which probabilistically propagates a search query to peers that are likely to hold more files having search tags that are similar to the query. The similarity between the search query and the search tags is measured in terms of their dot product. The simulation experiments examine if the Kansei query-forwarding method can provide equal search performance for all peers in a network in which only the Kansei information and the tendency with respect to file collection are different among all of the peers. The simulation results show that the Kansei query forwarding method and a random-walk-based query forwarding method, for comparison, work effectively in different situations and are complementary. Furthermore, the Kansei query forwarding method is shown, through simulations, to be superior to or equal to the random-walk based one in terms of search speed.
A saturation property of structures obtained by forcing with a compact family of random variables
Czech Academy of Sciences Publication Activity Database
Krajíček, Jan
2013-01-01
Roč. 52, 1-2 (2013), s. 19-28 ISSN 1432-0665 R&D Projects: GA AV ČR IAA100190902 Keywords : Boolean-valued structures * saturation property * non-standard model of arithmetic Subject RIV: BA - General Mathematics Impact factor: 0.324, year: 2013 http://link.springer.com/article/10.1007%2Fs00153-012-0304-9
Bayesian exponential random graph modeling of whole-brain structural networks across lifespan
Sinke, Michel R T; Dijkhuizen, Rick M; Caimo, Alberto; Stam, Cornelis J; Otte, Wim
2016-01-01
Descriptive neural network analyses have provided important insights into the organization of structural and functional networks in the human brain. However, these analyses have limitations for inter-subject or between-group comparisons in which network sizes and edge densities may differ, such as in studies on neurodevelopment or brain diseases. Furthermore, descriptive neural network analyses lack an appropriate generic null model and a unifying framework. These issues may be solved with an...
Cornière (de), Alexandre
2016-01-01
Search engines enable advertisers to target consumers based on the query they have entered. In a framework with horizontal product differentiation, imperfect product information and in which consumers incur search costs, I study a game in which advertisers have to choose a price and a set of relevant keywords. The targeting mechanism brings about three kinds of efficiency gains, namely lower search costs, better matching, and more intense product market price-competition. A monopolistic searc...
Tunkelang, Daniel
2009-01-01
We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more
Recchia, Stephen
Kevlar is the most common high-end plastic filament yarn used in body armor, tire reinforcement, and wear resistant applications. Kevlar is a trade name for an aramid fiber. These are fibers in which the chain molecules are highly oriented along the fiber axis, so the strength of the chemical bond can be exploited. The bulk material is extruded into filaments that are bound together into yarn, which may be chorded with other materials as in car tires, woven into a fabric, or layered in an epoxy to make composite panels. The high tensile strength to low weight ratio makes this material ideal for designs that decrease weight and inertia, such as automobile tires, body panels, and body armor. For designs that use Kevlar, increasing the strength, or tenacity, to weight ratio would improve performance or reduce cost of all products that are based on this material. This thesis computationally and experimentally investigates the tenacity and stiffness of Kevlar yarns with varying twist ratios. The test boundary conditions were replicated with a geometrically accurate finite element model, resulting in a customized code that can reproduce tortuous filaments in a yarn was developed. The solid model geometry capturing filament tortuosity was implemented through a random walk method of axial geometry creation. A finite element analysis successfully recreated the yarn strength and stiffness dependency observed during the tests. The physics applied in the finite element model was reproduced in an analytical equation that was able to predict the failure strength and strain dependency of twist ratio. The analytical solution can be employed to optimize yarn design for high strength applications.
Random lock-in intervals for tubular structural elements subject to simulated natural wind
DEFF Research Database (Denmark)
Christensen, Claus F.; Ditlevsen, Ove Dalager
1999-01-01
The paper reports on wind tunnel experiments with an elastically suspended circular cylinder vibrating under the excitation of natural wind of high turbulence degree. The natural wind turbulence was simulated bysuperposing the low frequency part of the natural wind turbulence on the background high...... structural elements subject to thenatural wind. The engineering relevance of the investigation is supported by comparing with the unrealistic highlyconservative rules of wind induced fatique commonly given in codes of practice. The stochastic lock-in model aswell as the related fatigue calculation procedure...
Randomized random walk on a random walk
International Nuclear Information System (INIS)
Lee, P.A.
1983-06-01
This paper discusses generalizations of the model introduced by Kehr and Kunter of the random walk of a particle on a one-dimensional chain which in turn has been constructed by a random walk procedure. The superimposed random walk is randomised in time according to the occurrences of a stochastic point process. The probability of finding the particle in a particular position at a certain instant is obtained explicitly in the transform domain. It is found that the asymptotic behaviour for large time of the mean-square displacement of the particle depends critically on the assumed structure of the basic random walk, giving a diffusion-like term for an asymmetric walk or a square root law if the walk is symmetric. Many results are obtained in closed form for the Poisson process case, and these agree with those given previously by Kehr and Kunter. (author)
Glikson, Andrew
2018-01-01
Ring, dome and crater features on the Australian continent and shelf include (A) 38 structures of confirmed or probable asteroid and meteorite impact origin and (B) numerous buried and exposed ring, dome and crater features of undefined origin. A large number of the latter include structural and geophysical elements consistent with impact structures, pending test by field investigations and/or drilling. This paper documents and briefly describes 43 ring and dome features with the aim of appraising their similarities and differences from those of impact structures. Discrimination between impact structures and igneous plugs, volcanic caldera and salt domes require field work and/or drilling. Where crater-like morphological patterns intersect pre-existing linear structural features and contain central morphological highs and unique thrust and fault patterns an impact connection needs to tested in the field. Hints of potential buried impact structures may be furnished by single or multi-ring TMI patterns, circular TMI quiet zones, corresponding gravity patterns, low velocity and non-reflective seismic zones.
A search for fine structure of the time-of-flight spectrum of the fission neutrons of 252Cf
International Nuclear Information System (INIS)
Scobie, J.; Scott, R.D.; Feather, N.; Vass, D.G.
1977-01-01
A standard time-of-flight arrangement, in which start pulses were supplied by fission fragments and stop pulses by neutrons, has been employed in an attempt to check recent claims of the existence of fine structures in the time-of-flight spectrum of the fission neutrons of 252 Cf. This structure, in the form of spikes with tails towards longer times, has been attributed to the emission of neutrons of short delay (with half-lives of a few to a hundred or so nanoseconds) in the fission process. It has not been possible to find any convincing evidence for the existence of such structure. (author)
Bellantone, R; Bossola, M; Carriero, C; Malerba, M; Nucera, P; Ratto, C; Crucitti, P; Pacelli, F; Doglietto, G B; Crucitti, F
1999-01-01
After trauma or surgery, researchers have suggested that medium-chain triglycerides have metabolic advantages, although they are toxic in large doses. To try to reduce this potential toxicity, structured lipids, which provide a higher oxidation rate, faster clearance from blood, improved nitrogen balance, and less accumulation in the reticuloendothelial system, could be used. Therefore, we evaluated, through a blind randomized study, the safety, tolerance, and efficacy of structured triglycerides, compared with long-chain triglycerides (LCT), in patients undergoing colorectal surgery. Nineteen patients were randomized to receive long-chain or structured triglycerides as a lipid source. They received the same amount of calories (27.2/kg/d), glucose (4 g/kg/d), protein (0.2 g/kg/d), and lipids (11.2 kcal/kg/d). Patients were evaluated during and after the treatment for clinical and laboratory variables, daily and cumulative nitrogen balance, urinary excretion of 3-methyl-histidine, and urinary 3-methylhistidine/creatinine ratio. No adverse effect that required the interruption of the treatment was observed. Triglyceride levels and clinical and laboratory variables were similar in the two groups. A predominantly positive nitrogen balance was observed from day 2 until day 5 in the LCT group and from day 1 until day 4 in the structured triglycerides group. The cumulative nitrogen balance (in grams) for days 1 to 3 was 9.7+/-5.2 in the experimental group and 4.4+/-11.8 in the control group (p = .2). For days 1 to 5 it was 10.7+/-10.5 and 6.5+/-17.9 (p = .05), respectively. The excretion of 3-methylhistidine was higher in the control group but decreased in the following days and was similar to the experimental group on day 5. This study represents the first report in which structured triglycerides are administered in postoperative patients to evaluate safety, tolerance, and efficacy. It suggests that Fe73403 is safe, well tolerated, and efficacious in terms of nitrogen
International Nuclear Information System (INIS)
Suharsono; Nurdian, S. W; Palupi, I. R.
2016-01-01
Relocating hypocenter is a way to improve the velocity model of the subsurface. One of the method is Grid Search. To perform the distribution of the velocity in subsurface by tomography method, it is used the result of relocating hypocenter to be a reference for subsurface analysis in volcanic and major structural patterns, such as in Central Java. The main data of this study is the earthquake data recorded from 1952 to 2012 with the P wave number is 9162, the number of events is 2426 were recorded by 30 stations located in the vicinity of Central Java. Grid search method has some advantages they are: it can relocate the hypocenter more accurate because this method is dividing space lattice model into blocks, and each grid block can only be occupied by one point hypocenter. Tomography technique is done by travel time data that has had relocated with inversion pseudo bending method. Grid search relocated method show that the hypocenter's depth is shallower than before and the direction is to the south, the hypocenter distribution is modeled into the subduction zone between the continent of Eurasia with the Indo-Australian with an average angle of 14 °. The tomography results show the low velocity value is contained under volcanoes with value of -8% to -10%, then the pattern of the main fault structure in Central Java can be description by the results of tomography at high velocity that is from 8% to 10% with the direction is northwest and northeast-southwest. (paper)
Zhang, Li-Zhi; Yuan, Wu-Zhi
2018-04-01
The motion of coalescence-induced condensate droplets on superhydrophobic surface (SHS) has attracted increasing attention in energy-related applications. Previous researches were focused on regularly rough surfaces. Here a new approach, a mesoscale lattice Boltzmann method (LBM), is proposed and used to model the dynamic behavior of coalescence-induced droplet jumping on SHS with randomly distributed rough structures. A Fast Fourier Transformation (FFT) method is used to generate non-Gaussian randomly distributed rough surfaces with the skewness (Sk), kurtosis (K) and root mean square (Rq) obtained from real surfaces. Three typical spreading states of coalesced droplets are observed through LBM modeling on various rough surfaces, which are found to significantly influence the jumping ability of coalesced droplet. The coalesced droplets spreading in Cassie state or in composite state will jump off the rough surfaces, while the ones spreading in Wenzel state would eventually remain on the rough surfaces. It is demonstrated that the rough surfaces with smaller Sks, larger Rqs and a K at 3.0 are beneficial to coalescence-induced droplet jumping. The new approach gives more detailed insights into the design of SHS.
Agoritsas, Thomas; Iserman, Emma; Hobson, Nicholas; Cohen, Natasha; Cohen, Adam; Roshanov, Pavel S; Perez, Miguel; Cotoi, Chris; Parrish, Rick; Pullenayegum, Eleanor; Wilczynski, Nancy L; Iorio, Alfonso; Haynes, R Brian
2014-09-20
Finding current best evidence for clinical decisions remains challenging. With 3,000 new studies published every day, no single evidence-based resource provides all answers or is sufficiently updated. McMaster Premium LiteratUre Service--Federated Search (MacPLUS FS) addresses this issue by looking in multiple high quality resources simultaneously and displaying results in a one-page pyramid with the most clinically useful at the top. Yet, additional logistical and educational barriers need to be addressed to enhance point-of-care evidence retrieval. This trial seeks to test three innovative interventions, among clinicians registered to MacPLUS FS, to increase the quantity and quality of searching for current best evidence to answer clinical questions. In a user-centered approach, we designed three interventions embedded in MacPLUS FS: (A) a web-based Clinical Question Recorder; (B) an Evidence Retrieval Coach composed of eight short educational videos; (C) an Audit, Feedback and Gamification approach to evidence retrieval, based on the allocation of 'badges' and 'reputation scores.' We will conduct a randomized factorial controlled trial among all the 904 eligible medical doctors currently registered to MacPLUS FS at the hospitals affiliated with McMaster University, Canada. Postgraduate trainees (n=429) and clinical faculty/staff (n=475) will be randomized to each of the three following interventions in a factorial design (AxBxC). Utilization will be continuously recorded through clinicians’ accounts that track logins and usage, down to the level of individual keystrokes. The primary outcome is the rate of searches per month per user during the six months of follow-up. Secondary outcomes, measured through the validated Impact Assessment Method questionnaire, include: utility of answers found (meeting clinicians’ information needs), use (application in practice), and perceived usefulness on patient outcomes. Built on effective models for the point
Energy Technology Data Exchange (ETDEWEB)
Ren, Cheng; Yang, Xingtuan; Liu, Zhiyong; Sun, Yanfei; Jiang, Shengyao [Tsinghua Univ., Beijing (China). Key Laboratory of Advanced Reactor Engineering and Safety; Li, Congxin [Ministry of Environmental Protection of the People' s Republic of China, Beijing (China). Nuclear and Radiation Safety Center
2015-02-15
A three-dimensional pebble bed corresponding to the randomly packed bed in the heat transfer test facility built for the High Temperature Reactor Pebble bed Modules (HTR-PM) in Shandong Shidaowan is simulated via discrete element method. Based on the simulation, we make a detailed analysis on the packing structure of the pebble bed from several aspects, such as transverse section image, longitudinal section image, radial and axial porosity distributions, two-dimensional porosity distribution and coordination number distribution. The calculation results show that radial distribution of porosity is uniform in the center and oscillates near the wall; axial distribution of porosity oscillates near the bottom and linearly varies along height due to effect of gravity; the average coordination number is about seven and equals to the maximum coordination number frequency. The fully established three-dimensional packing structure analysis of the pebble bed in this work is of fundamental significance to understand the flow and heat transfer characteristics throughout the pebble-bed type structure.
African Journals Online (AJOL)
Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...
Random dynamics and relations between the number of fermion generations and the fine structure
International Nuclear Information System (INIS)
Nielsen, H.B.
1989-01-01
By looking at the structure and crude features of the parameters of the Standard Model we argue for some properties of physics at a more fundamental level, presumably the Planck energy scale. These properties suggest a picture of 'anti-grand-unification' in the sense that, contrary to usual grand unification, we do not expect a simple gauge group at the high energy level. Rather we expect to see a gauge algebra which is a cross product of several simple or abelian factors. A symmetry breaking mechanism called confusion may then break each set of isomorphic factors down to the diagonal subgroup, thereby explaining the fact that non of the direct product factors in the Standard Model are repeated. (orig.)
Kim, Hyungjin; Kim, Sihyun; Kim, Hyun-Min; Lee, Kitae; Kim, Sangwan; Pak, Byung-Gook
2018-09-01
In this study, we investigate a one-transistor (1T) dynamic random access memory (DRAM) cell based on a gated-thyristor device utilizing voltage-driven bistability to enable high-speed operations. The structural feature of the surrounding gate using a sidewall provides high scalability with regard to constructing an array architecture of the proposed devices. In addition, the operation mechanism, I-V characteristics, DRAM operations, and bias dependence are analyzed using a commercial device simulator. Unlike conventional 1T DRAM cells utilizing the floating body effect, excess carriers which are required to be stored to make two different states are not generated but injected from the n+ cathode region, giving the device high-speed operation capabilities. The findings here indicate that the proposed DRAM cell offers distinct advantages in terms of scalability and high-speed operations.
Structure of Sn1−xGex random alloys as obtained from the coherent potential approximation
Pulikkotil, J. J.
2011-08-09
The structure of the Sn1−xGex random alloys is studied using density functional theory and the coherent potential approximation. We report on the deviation of the Sn1−xGex alloys from Vegard’s law, addressing their full compositional range. The findings are compared to the related Si1−xGex alloys and to experimental results. Interestingly, the deviation from Vegard’s law is quantitatively and qualitatively different between the Sn1−xGex and Si1−xGex alloys. An almost linear dependence of the bulk modulus as a function of composition is found for Si1−xGex, whereas for Sn1−xGex the dependence is strongly nonlinear.
A novel multiplexer-based structure for random access memory cell in quantum-dot cellular automata
Naji Asfestani, Mazaher; Rasouli Heikalabad, Saeed
2017-09-01
Quantum-dot cellular automata (QCA) is a new technology in scale of nano and perfect replacement for CMOS circuits in the future. Memory is one of the basic components in any digital system, so designing the random access memory (RAM) with high speed and optimal in QCA is important. In this paper, by employing the structure of multiplexer, a novel RAM cell architecture is proposed. The proposed architecture is implemented without the coplanar crossover approach. The proposed architecture is simulated using the QCADesigner version 2.0.3 and QCAPro. The simulation results demonstrate that the proposed QCA RAM architecture has the best performance in terms of delay, circuit complexity, area, cell count and energy consumption in comparison with other QCA RAM architectures.
Carneiro, Lara S F; Fonseca, António Manuel; Vieira-Coelho, Maria Augusta; Mota, Maria Paula; Vasconcelos-Raposo, José
2015-12-01
Physical exercise has been consistently documented as a complementary therapy in the treatment of depressive disorders. However, despite a higher prevalence among women compared to men, the trials developed in women are scarce. In addition, the optimal dosage of exercise capable of producing benefits that reduce depressive symptoms remains unclear. This clinical trial is designed to measure the effect of a structured physical exercise program as a complement to antidepressant medication in the treatment of women with depression. From July 2013 to May 2014, we implemented a randomized controlled trial (HAPPY BRAIN study). A total of 26 women (aged 50.16 ± 12.08) diagnosed with clinical depression were randomized either to a supervised aerobic exercise group (45-50 min/week three times a week for four months) plus pharmacotherapy (intervention group), or only antidepressant medication (control group). The exercise group presented a decrease in BDI-II and DASS-21 total score scales. Relatively to DASS-21, it showed a significant decrease in anxiety and stress. The exercise group when compared to a control group showed improvement in relation to physical functioning parameters between baseline and post-intervention. Moreover, anthropometric parameters presented only significant differences between groups in fat mass percentage. Nonetheless, no differences were found between groups in weight, body mass index, waist circumference, and self-esteem. Our results showed that supervised structured aerobic exercise training could be an effective adjuvant therapy for treating women with depression, reducing depressive symptomatology and improving physical fitness. A key factor of this improvement included strict control of exercise workload parameters and adjustment to each subject's capacity. In our study, due to the sample size there is an increase in the probability of type II errors. Copyright © 2015 Elsevier Ltd. All rights reserved.
DEFF Research Database (Denmark)
Bose, Prosenjit; Fagerberg, Rolf; Howat, John
2016-01-01
We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data structures that achieve expected query times logarithmic...
DEFF Research Database (Denmark)
Bose, Prosenjit; Fagerberg, Rolf; Howat, John
2014-01-01
We consider the problem of performing predecessor searches in a bounded universe while achieving query times that depend on the distribution of queries. We obtain several data structures with various properties: in particular, we give data structures that achieve expected query times logarithmic...
Local beam angle optimization with linear programming and gradient search
International Nuclear Information System (INIS)
Craft, David
2007-01-01
The optimization of beam angles in IMRT planning is still an open problem, with literature focusing on heuristic strategies and exhaustive searches on discrete angle grids. We show how a beam angle set can be locally refined in a continuous manner using gradient-based optimization in the beam angle space. The gradient is derived using linear programming duality theory. Applying this local search to 100 random initial angle sets of a phantom pancreatic case demonstrates the method, and highlights the many-local-minima aspect of the BAO problem. Due to this function structure, we recommend a search strategy of a thorough global search followed by local refinement at promising beam angle sets. Extensions to nonlinear IMRT formulations are discussed. (note)
Low-Quality Structural and Interaction Data Improves Binding Affinity Prediction via Random Forest.
Li, Hongjian; Leung, Kwong-Sak; Wong, Man-Hon; Ballester, Pedro J
2015-06-12
Docking scoring functions can be used to predict the strength of protein-ligand binding. It is widely believed that training a scoring function with low-quality data is detrimental for its predictive performance. Nevertheless, there is a surprising lack of systematic validation experiments in support of this hypothesis. In this study, we investigated to which extent training a scoring function with data containing low-quality structural and binding data is detrimental for predictive performance. We actually found that low-quality data is not only non-detrimental, but beneficial for the predictive performance of machine-learning scoring functions, though the improvement is less important than that coming from high-quality data. Furthermore, we observed that classical scoring functions are not able to effectively exploit data beyond an early threshold, regardless of its quality. This demonstrates that exploiting a larger data volume is more important for the performance of machine-learning scoring functions than restricting to a smaller set of higher data quality.
Optimal intermittent search strategies
Energy Technology Data Exchange (ETDEWEB)
Rojo, F; Budde, C E [FaMAF, Universidad Nacional de Cordoba, Ciudad Universitaria, X5000HUA Cordoba (Argentina); Wio, H S [Instituto de Fisica de Cantabria, Universidad de Cantabria and CSIC E-39005 Santander (Spain)
2009-03-27
We study the search kinetics of a single fixed target by a set of searchers performing an intermittent random walk, jumping between different internal states. Exploiting concepts of multi-state and continuous-time random walks we have calculated the survival probability of a target up to time t, and have 'optimized' (minimized) it with regard to the transition probability among internal states. Our model shows that intermittent strategies always improve target detection, even for simple diffusion states of motion.
Orndorff, Paul E
2016-11-01
Bacteriophages (phage) that infect pathogenic bacteria often attach to surface receptors that are coincidentally required for virulence. Receptor loss or modification through mutation renders mutants both attenuated and phage resistant. Such attenuated mutants frequently have no apparent laboratory growth defects, but in the host, they fail to exhibit properties needed to produce disease such as mucosal colonization or survival within professional phagocytic cells. The connection between attenuation and phage resistance has been exploited in experimental demonstrations of phage therapy. In such experiments, phage resistant mutants that arise naturally during therapy are inconsequential because of their attenuated status. A more contemporary approach to exploiting this connection involves identifying small effector molecules, identified in high-throughput screens, that inhibit one or more of the steps needed to produce a functioning phage receptor. Since such biosynthetic steps are unique to bacteria, inhibitors can be utilized therapeutically, in lieu of antibiotics. Also, since the inhibitor is specific to a particular bacterium or group of bacteria, no off-target resistance is generated in the host's commensal bacterial population. This brief review covers examples of how mutations that confer phage resistance produce attenuation, and how this coincidental relationship can be exploited in the search for the next generation of therapeutic agents for bacterial diseases.
International Nuclear Information System (INIS)
Tatischeff, B.; Combes, M.P.; Didelez, J.P.
1984-01-01
The missing mass spectra for the transfer reaction p( 3 He,d)X (B=2, T=1) have been measured at Tsub( 3 He) = 2.7 GeV. The data show: 1) a narrow structure lying on top of an important continuum, with a mass M = 2.240+-0.005 GeV and a width GAMMAsub(1/2) = .016 +- .003 GeV; 2) a large structure with centroid location close to Msub(x) approximately equal to 2.170 +- .005 GeV and width GAMMAsub(1/2) approximately .100 +- .005 Gev
Wang, Hui-Fang; Liu, Zhi-Pan
2008-08-20
Ethanol oxidation on Pt is a typical multistep and multiselectivity heterogeneous catalytic process. A comprehensive understanding of this fundamental reaction would greatly benefit design of catalysts for use in direct ethanol fuel cells and the degradation of biomass-derived oxygenates. In this work, the reaction network of ethanol oxidation on different Pt surfaces, including close-packed Pt{111}, stepped Pt{211}, and open Pt{100}, is explored thoroughly with an efficient reaction path searching method, which integrates our new transition-state searching technique with periodic density functional theory calculations. Our new technique enables the location of the transition state and saddle points for most surface reactions simply and efficiently by optimization of local minima. We show that the selectivity of ethanol oxidation on Pt depends markedly on the surface structure, which can be attributed to the structure-sensitivity of two key reaction steps: (i) the initial dehydrogenation of ethanol and (ii) the oxidation of acetyl (CH3CO). On open surface sites, ethanol prefers C-C bond cleavage via strongly adsorbed intermediates (CH2CO or CHCO), which leads to complete oxidation to CO2. However, only partial oxidizations to CH3CHO and CH3COOH occur on Pt{111}. Our mechanism points out that the open surface Pt{100} is the best facet to fully oxidize ethanol at low coverages, which sheds light on the origin of the remarkable catalytic performance of Pt tetrahexahedra nanocrystals found recently. The physical origin of the structure-selectivity is rationalized in terms of both thermodynamics and kinetics. Two fundamental quantities that dictate the selectivity of ethanol oxidation are identified: (i) the ability of surface metal atoms to bond with unsaturated C-containing fragments and (ii) the relative stability of hydroxyl at surface atop sites with respect to other sites.
International Nuclear Information System (INIS)
Kim, Jiwoong
2015-01-01
In theoretical calculations, expressing the random distribution of atoms in a certain crystal structure is still challenging. The special quasi-random structure (SQS) model is effective for depicting such random distributions. The SQS model has not been applied to semi-empirical thermodynamic calculations; however, Debye–Grüneisen theory (DGT), a semi-empirical method, was used here for that purpose. The model reliability was obtained by comparing supercell models of various sizes. The results for chemical bonds, pair correlation, and elastic properties demonstrated the reliability of the SQS models. Thermodynamic calculations using density functional perturbation theory (DFPT) and DGT assessed the applicability of the SQS models. DGT and DFPT led to similar variations of the mixing and formation energies. This study provides guidelines for theoretical assessments to obtain the reliable SQS models and to calculate the thermodynamic properties of numerous materials with a random atomic distribution. - Highlights: • Various material properties are used to examine reliability of special quasi-random structures. • SQS models are applied to thermodynamic calculations by semi-empirical methods. • Basic calculation guidelines for materials with random atomic distribution are given.
Directory of Open Access Journals (Sweden)
Ayse T. Daloglu
2018-01-01
Full Text Available Optimum design of braced steel space frames including soil-structure interaction is studied by using harmony search (HS and teaching-learning-based optimization (TLBO algorithms. A three-parameter elastic foundation model is used to incorporate the soil-structure interaction effect. A 10-storey braced steel space frame example taken from literature is investigated according to four different bracing types for the cases with/without soil-structure interaction. X, V, Z, and eccentric V-shaped bracing types are considered in the study. Optimum solutions of examples are carried out by a computer program coded in MATLAB interacting with SAP2000-OAPI for two-way data exchange. The stress constraints according to AISC-ASD (American Institute of Steel Construction-Allowable Stress Design, maximum lateral displacement constraints, interstorey drift constraints, and beam-to-column connection constraints are taken into consideration in the optimum design process. The parameters of the foundation model are calculated depending on soil surface displacements by using an iterative approach. The results obtained in the study show that bracing types and soil-structure interaction play very important roles in the optimum design of steel space frames. Finally, the techniques used in the optimum design seem to be quite suitable for practical applications.
Statistic methods for searching inundated radioactive entities
International Nuclear Information System (INIS)
Dubasov, Yu.V.; Krivokhatskij, A.S.; Khramov, N.N.
1993-01-01
The problem of searching flooded radioactive object in a present area was considered. Various models of the searching route plotting are discussed. It is shown that spiral route by random points from the centre of the area examined is the most efficient one. The conclusion is made that, when searching flooded radioactive objects, it is advisable to use multidimensional statistical methods of classification
International Nuclear Information System (INIS)
Kurosu, Shunji; Fukuda, Takahiro; Maekawa, Toru
2013-01-01
Assemblies, which are composed of nanoparticles such as nanofibres, have been intensively studied in recent years. This has particularly been the case in the field of biomedicine, where the aim is to develop efficient methodologies for capturing and separating target biomolecules and cells and/or encouraging bio-chemical reactions, utilizing the extremely high surface area to volume ratio of assemblies. There is an urgent need for the development of a quick synthesis method of forming nanofibrous structures on the surface of biomedical microchips and devices for the investigation of the interactions between biomolecules/cells and the nanostructures. Here, we produce nanofibrous structures composed of C 60 molecules, which are aligned in one direction or randomly oriented, by dissolving C 60 molecules and sulphur in benzene and evaporating a droplet of the solution on a glass substrate under appropriate conditions. The synthesis time is as short as 30 s. Sulphur is extracted and nanofibres are crystallized by leaving them in supercritical carbon dioxide. (paper)
Verlinde, Christophe L. M. J.; Rudenko, Gabrielle; Hol, Wim G. J.
1992-04-01
A modular method for pursuing structure-based inhibitor design in the framework of a design cycle is presented. The approach entails four stages: (1) a design pathway is defined in the three-dimensional structure of a target protein; (2) this pathway is divided into subregions; (3) complementary building blocks, also called fragments, are designed in each subregion; complementarity is defined in terms of shape, hydrophobicity, hydrogen bond properties and electrostatics; and (4) fragments from different subregions are linked into potential lead compounds. Stages (3) and (4) are qualitatively guided by force-field calculations. In addition, the designed fragments serve as entries for retrieving existing compounds from chemical databases. This linked-fragment approach has been applied in the design of potentially selective inhibitors of triosephosphate isomerase from Trypanosoma brucei, the causative agent of sleeping sickness.
Hamadi, Youssef; Saubion, Frédéric
2012-01-01
Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.
Jackson, Joe; Gilstrap, Donald L.
1999-01-01
Addresses the implications of the new Web metalanguage XML for searching on the World Wide Web and considers the future of XML on the Web. Compared to HTML, XML is more concerned with structure of data than documents, and these data structures should prove conducive to precise, context rich searching. (Author/LRW)
Wang, Lai-Guo; Cao, Zheng-Yi; Qian, Xu; Zhu, Lin; Cui, Da-Peng; Li, Ai-Dong; Wu, Di
2017-02-22
Al 2 O 3 - or HfO 2 -based nanocomposite structures with embedded CoPt x nanocrystals (NCs) on TiN-coated Si substrates have been prepared by combination of thermal atomic layer deposition (ALD) and plasma-enhanced ALD for resistive random access memory (RRAM) applications. The impact of CoPt x NCs and their average size/density on the resistive switching properties has been explored. Compared to the control sample without CoPt x NCs, ALD-derived Pt/oxide/100 cycle-CoPt x NCs/TiN/SiO 2 /Si exhibits a typical bipolar, reliable, and reproducible resistive switching behavior, such as sharp distribution of RRAM parameters, smaller set/reset voltages, stable resistance ratio (≥10 2 ) of OFF/ON states, better switching endurance up to 10 4 cycles, and longer data retention over 10 5 s. The possible resistive switching mechanism based on nanocomposite structures of oxide/CoPt x NCs has been proposed. The dominant conduction mechanisms in low- and high-resistance states of oxide-based device units with embedded CoPt x NCs are Ohmic behavior and space-charge-limited current, respectively. The insertion of CoPt x NCs can effectively improve the formation of conducting filaments due to the CoPt x NC-enhanced electric field intensity. Besides excellent resistive switching performances, the nanocomposite structures also simultaneously present ferromagnetic property. This work provides a flexible pathway by combining PEALD and TALD compatible with state-of-the-art Si-based technology for multifunctional electronic devices applications containing RRAM.
Parnell, J.; Osinski, G. R.; Lee, P.; Cockell, C. S.
2005-01-01
Microbes in Haughton Crater Sulfates: Impact craters are of high interest in planetary exploration because they are viewed as possible sites for evidence of life [1]. Hydrothermal systems in craters are particularly regarded as sites where primitive life could evolve. Evidence from the Miocene Haughton impact structure shows that crater hydrothermal deposits may also be a preferred site for subsequent colonization and hence possible extant life: Hydrothermal sulfates at Haughton are colonized by viable cyanobacteria [2]. The Haughton impact structure, Devon Island, Canadian High Arctic, is a 24 km-diameter crater of mid-Tertiary age. The structure preserves an exceptional record of impact-induced hydrothermal activity, including sulfide, and sulfate mineralization [3]. The target rocks excavated at the site included massive gypsum-bearing carbonate rocks of Ordovician age. Impact-remobilized sulfates occur as metre-scale masses of intergrown crystals of the clear form of gypsum selenite in veins and cavity fillings within the crater s impact melt breccia deposits [4]. The selenite is part of the hydrothermal assemblage as it was precipitated by cooling hot waters that were circulating as a result of the impact. Remobilization of the sulfate continues to the present day, such that it occurs in soil crusts (Fig. 1) including sandy beds with a gypsum cement. The sulfate-cemented beds make an interesting comparison with the sulfate-bearing sandy beds encountered by the Opportunity MER [5]. The selenite crystals are up to 0.3 m in width, of high purity, and transparent. They locally exhibit frayed margins where cleavage surfaces have separated. This exfoliation may be a response to freeze-thaw weathering. The selenite contains traces of rock detritus, newly precipitated gypsum, and microbial colonies. The rock detritus consists of sediment particles which penetrated the opened cleavages by up to 2cm from the crystal margins. Some of the detritus is cemented into place
Naghdi, Mohammad Reza; Smail, Katia; Wang, Joy X; Wade, Fallou; Breaker, Ronald R; Perreault, Jonathan
2017-03-15
The discovery of noncoding RNAs (ncRNAs) and their importance for gene regulation led us to develop bioinformatics tools to pursue the discovery of novel ncRNAs. Finding ncRNAs de novo is challenging, first due to the difficulty of retrieving large numbers of sequences for given gene activities, and second due to exponential demands on calculation needed for comparative genomics on a large scale. Recently, several tools for the prediction of conserved RNA secondary structure were developed, but many of them are not designed to uncover new ncRNAs, or are too slow for conducting analyses on a large scale. Here we present various approaches using the database RiboGap as a primary tool for finding known ncRNAs and for uncovering simple sequence motifs with regulatory roles. This database also can be used to easily extract intergenic sequences of eubacteria and archaea to find conserved RNA structures upstream of given genes. We also show how to extend analysis further to choose the best candidate ncRNAs for experimental validation. Copyright © 2017 Elsevier Inc. All rights reserved.
Usuki, Hirokazu; Yamamoto, Yukihiro; Kumagai, Yuya; Nitoda, Teruhiko; Kanzaki, Hiroshi; Hatanaka, Tadashi
2011-04-21
The reducing tetrasaccharide TMG-chitotriomycin (1) is an inhibitor of β-N-acetylglucosaminidase (GlcNAcase), produced by the actinomycete Streptomyces anulatus NBRC13369. The inhibitor shows a unique inhibitory spectrum, that is, selectivity toward enzymes from chitin-containing organisms such as insects and fungi. Nevertheless, its structure-selectivity relationship remains to be clarified. In this study, we conducted a structure-guided search of analogues of 1 in order to obtain diverse N,N,N-trimethylglucosaminium (TMG)-containing chitooligosaccharides. In this approach, the specific fragmentation profile of 1 on ESI-MS/MS analysis was used for the selective detection of desired compounds. As a result, two new analogues, named TMG-chitomonomycin (3) and TMG-chitobiomycin (2), were obtained from a culture filtrate of 1-producing Streptomyces. Their enzyme-inhibiting activity revealed that the potency and selectivity depended on the degree of polymerization of the reducing end GlcNAc units. Furthermore, a computational modeling study inspired the inhibitory mechanism of TMG-related compounds as a mimic of the substrate in the Michaelis complex of the GH20 enzyme. This study is an example of the successful application of a MS/MS experiment for structure-guided isolation of natural products.
Random template placement and prior information
International Nuclear Information System (INIS)
Roever, Christian
2010-01-01
In signal detection problems, one is usually faced with the task of searching a parameter space for peaks in the likelihood function which indicate the presence of a signal. Random searches have proven to be very efficient as well as easy to implement, compared e.g. to searches along regular grids in parameter space. Knowledge of the parameterised shape of the signal searched for adds structure to the parameter space, i.e., there are usually regions requiring to be densely searched while in other regions a coarser search is sufficient. On the other hand, prior information identifies the regions in which a search will actually be promising or may likely be in vain. Defining specific figures of merit allows one to combine both template metric and prior distribution and devise optimal sampling schemes over the parameter space. We show an example related to the gravitational wave signal from a binary inspiral event. Here the template metric and prior information are particularly contradictory, since signals from low-mass systems tolerate the least mismatch in parameter space while high-mass systems are far more likely, as they imply a greater signal-to-noise ratio (SNR) and hence are detectable to greater distances. The derived sampling strategy is implemented in a Markov chain Monte Carlo (MCMC) algorithm where it improves convergence.
Search for the signature of a halo structure in the p(6He,6Li)n reaction
International Nuclear Information System (INIS)
Cortina-Gil, M.D.; Roussel-Chomaz, P.; Mittig, W.; Casandjian, J.M.; Chartier, M.; Alamanos, N.; Auger, F.; Fekou-Youmbi, V.; Blumenfeld, Y.; and others.
1995-01-01
The elastic scattering p( 6 He, 6 He)p and charge exchange reaction p( 6 He, 6 Li)n have been measured in reverse kinematics with a secondary 6 He beam. The angular distributions for these reactions were obtained. In the case of the charge exchange reaction, the ratio of the cross section for the Gamow-Teller transition to the ground state, and for the Fermi transition to the isobaric analog state is a measure of the relative strength of the two components of the exchange interaction. This ratio is found compatible with existing systematics for stable T=1 nuclei, and no clear signature of a halo structure was found in the present data. (author)
Random matrices and random difference equations
International Nuclear Information System (INIS)
Uppuluri, V.R.R.
1975-01-01
Mathematical models leading to products of random matrices and random difference equations are discussed. A one-compartment model with random behavior is introduced, and it is shown how the average concentration in the discrete time model converges to the exponential function. This is of relevance to understanding how radioactivity gets trapped in bone structure in blood--bone systems. The ideas are then generalized to two-compartment models and mammillary systems, where products of random matrices appear in a natural way. The appearance of products of random matrices in applications in demography and control theory is considered. Then random sequences motivated from the following problems are studied: constant pulsing and random decay models, random pulsing and constant decay models, and random pulsing and random decay models
Peng, Cheng-Jien
The purpose of this study is to see the application feasibility of barium strontium titanate (BST) thin films on ultra large scale integration (ULSI) dynamic random access memory (DRAM) capacitors through the understanding of the relationships among processing, structure and electrical properties. Thin films of BST were deposited by multi-ion -beam reactive sputtering (MIBERS) technique and metallo -organic decomposition (MOD) method. The processing parameters such as Ba/Sr ratio, substrate temperature, annealing temperature and time, film thickness and doping concentration were correlated with the structure and electric properties of the films. Some effects of secondary low-energy oxygen ion bombardment were also examined. Microstructures of BST thin films could be classified into two types: (a) Type I structures, with multi-grains through the film thickness, for amorphous as-grown films after high temperature annealing, and (b) columnar structure (Type II) which remained even after high temperature annealing, for well-crystallized films deposited at high substrate temperatures. Type I films showed Curie-von Schweidler response, while Type II films showed Debted type behavior. Type I behavior may be attributed to the presence of a high density of disordered grain boundaries. Two types of current -voltage characteristics could be seen in non-bombarded films depending on the chemistry of the films (doped or undoped) and substrate temperature during deposition. Only the MIBERS films doped with high donor concentration and deposited at high substrate temperature showed space-charge -limited conduction (SCLC) with discrete shallow traps embedded in trap-distributed background at high electric field. All other non-bombarded films, including MOD films, showed trap-distributed SCLC behavior with a slope of {~}7.5-10 due to the presence of grain boundaries through film thickness or traps induced by unavoidable acceptor impurities in the films. Donor-doping could
Litfin, Thomas; Zhou, Yaoqi; Yang, Yuedong
2017-04-15
The high cost of drug discovery motivates the development of accurate virtual screening tools. Binding-homology, which takes advantage of known protein-ligand binding pairs, has emerged as a powerful discrimination technique. In order to exploit all available binding data, modelled structures of ligand-binding sequences may be used to create an expanded structural binding template library. SPOT-Ligand 2 has demonstrated significantly improved screening performance over its previous version by expanding the template library 15 times over the previous one. It also performed better than or similar to other binding-homology approaches on the DUD and DUD-E benchmarks. The server is available online at http://sparks-lab.org . yaoqi.zhou@griffith.edu.au or yuedong.yang@griffith.edu.au. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com
Directory of Open Access Journals (Sweden)
Deyo Richard A
2009-10-01
Full Text Available Abstract Background Chronic back pain is a major public health problem and the primary reason patients seek massage treatment. Despite the growing use of massage for chronic low back pain, there have been few studies of its effectiveness. This trial will be the first evaluation of the effectiveness of relaxation massage for chronic back pain and the first large trial of a focused structural form of massage for this condition. Methods and Design A total of 399 participants (133 in each of three arms between the ages of 20 and 65 years of age who have low back pain lasting at least 3 months will be recruited from an integrated health care delivery system. They will be randomized to one of two types of massage ("focused structural massage" or "relaxation massage", or continued usual medical care. Ten massage treatments will be provided over 10 weeks. The primary outcomes, standard measures of dysfunction and bothersomeness of low back pain, will be assessed at baseline and after 10, 26, and 52 weeks by telephone interviewers masked to treatment assignment. General health status, satisfaction with back care, days of back-related disability, perceived stress, and use and costs of healthcare services for back pain will also be measured. Outcomes across assigned treatment groups will be compared using generalized estimating equations, accounting for participant correlation and adjusted for baseline value, age, and sex. For both primary outcome measures, this trial will have at least 85% power to detect the presence of a minimal clinically significant difference among the three treatment groups and 91% power for pairwise comparisons. Secondary analyses will compare the proportions of participants in each group that improve by a clinically meaningful amount. Conclusion Results of this trial will help clarify the value of two types of massage therapy for chronic low back pain. Trial registration Clinical Trials.gov NCT 00371384.
Bhavnani, Sanjeev P; Sola, Srikanth; Adams, David; Venkateshvaran, Ashwin; Dash, P K; Sengupta, Partho P
2018-04-01
This study sought to determine whether mobile health (mHealth) device assessments used as clinical decision support tools at the point-of-care can reduce the time to treatment and improve long-term outcomes among patients with rheumatic and structural heart diseases (SHD). Newly developed smartphone-connected mHealth devices represent promising methods to diagnose common diseases in resource-limited areas; however, the impact of technology-based care on long-term outcomes has not been rigorously evaluated. A total of 253 patients with SHD were randomized to an initial diagnostic assessment with wireless devices in mHealth clinics (n = 139) or to standard-care (n = 114) in India. mHealth clinics were equipped with point-of-care devices including pocket-echocardiography, smartphone-connected-electrocardiogram blood pressure and oxygen measurements, activity monitoring, and portable brain natriuretic peptide laboratory testing. All individuals underwent comprehensive transthoracic echocardiography to assess the severity of SHD. The primary endpoint was the time to referral for therapy with percutaneous valvuloplasty or surgical valve replacement. Secondary endpoints included the probability of a cardiovascular hospitalization and/or death over 1 year. An initial mHealth assessment was associated with a shorter time to referral for valvuloplasty and/or valve replacement (83 ± 79 days vs. 180 ± 101 days; p Mobile Health Device Assessments in Modern Structural Heart Disease Clinics; NCT02881398). Copyright © 2018 American College of Cardiology Foundation. Published by Elsevier Inc. All rights reserved.
Tan, Shurun
The objective of my research is two-fold: to study wave scattering phenomena in dense volumetric random media and in periodic wave functional materials. For the first part, the goal is to use the microwave remote sensing technique to monitor water resources and global climate change. Towards this goal, I study the microwave scattering behavior of snow and ice sheet. For snowpack scattering, I have extended the traditional dense media radiative transfer (DMRT) approach to include cyclical corrections that give rise to backscattering enhancements, enabling the theory to model combined active and passive observations of snowpack using the same set of physical parameters. Besides DMRT, a fully coherent approach is also developed by solving Maxwell's equations directly over the entire snowpack including a bottom half space. This revolutionary new approach produces consistent scattering and emission results, and demonstrates backscattering enhancements and coherent layer effects. The birefringence in anisotropic snow layers is also analyzed by numerically solving Maxwell's equation directly. The effects of rapid density fluctuations in polar ice sheet emission in the 0.5˜2.0 GHz spectrum are examined using both fully coherent and partially coherent layered media emission theories that agree with each other and distinct from incoherent approaches. For the second part, the goal is to develop integral equation based methods to solve wave scattering in periodic structures such as photonic crystals and metamaterials that can be used for broadband simulations. Set upon the concept of modal expansion of the periodic Green's function, we have developed the method of broadband Green's function with low wavenumber extraction (BBGFL), where a low wavenumber component is extracted and results a non-singular and fast-converging remaining part with simple wavenumber dependence. We've applied the technique to simulate band diagrams and modal solutions of periodic structures, and to
Cherkin, Daniel C; Sherman, Karen J; Kahn, Janet; Erro, Janet H; Deyo, Richard A; Haneuse, Sebastien J; Cook, Andrea J
2009-10-20
Chronic back pain is a major public health problem and the primary reason patients seek massage treatment. Despite the growing use of massage for chronic low back pain, there have been few studies of its effectiveness. This trial will be the first evaluation of the effectiveness of relaxation massage for chronic back pain and the first large trial of a focused structural form of massage for this condition. A total of 399 participants (133 in each of three arms) between the ages of 20 and 65 years of age who have low back pain lasting at least 3 months will be recruited from an integrated health care delivery system. They will be randomized to one of two types of massage ("focused structural massage" or "relaxation massage"), or continued usual medical care. Ten massage treatments will be provided over 10 weeks. The primary outcomes, standard measures of dysfunction and bothersomeness of low back pain, will be assessed at baseline and after 10, 26, and 52 weeks by telephone interviewers masked to treatment assignment. General health status, satisfaction with back care, days of back-related disability, perceived stress, and use and costs of healthcare services for back pain will also be measured. Outcomes across assigned treatment groups will be compared using generalized estimating equations, accounting for participant correlation and adjusted for baseline value, age, and sex. For both primary outcome measures, this trial will have at least 85% power to detect the presence of a minimal clinically significant difference among the three treatment groups and 91% power for pairwise comparisons. Secondary analyses will compare the proportions of participants in each group that improve by a clinically meaningful amount. Results of this trial will help clarify the value of two types of massage therapy for chronic low back pain.
Oliver, B. M.
Attention is given to the approaches which would provide the greatest chance of success in attempts related to the discovery of extraterrestrial advanced cultures in the Galaxy, taking into account the principle of least energy expenditure. The energetics of interstellar contact are explored, giving attention to the use of manned spacecraft, automatic probes, and beacons. The least expensive approach to a search for other civilizations involves a listening program which attempts to detect signals emitted by such civilizations. The optimum part of the spectrum for the considered search is found to be in the range from 1 to 2 GHz. Antenna and transmission formulas are discussed along with the employment of matched gates and filters, the probable characteristics of the signals to be detected, the filter-signal mismatch loss, surveys of the radio sky, the conduction of targeted searches.
Quantum space loop quantum gravity and the search for the structure of space, time, and the universe
Baggott, Jim
2018-01-01
Today we are blessed with two extraordinarily successful theories of physics. The first is Albert Einstein's general theory of relativity, which describes the large-scale behaviour of matter in a curved spacetime. This theory is the basis for the standard model of big bang cosmology. The discovery of gravitational waves at the LIGO observatory in the US (and then Virgo, in Italy) is only the most recent of this theory's many triumphs. The second is quantum mechanics. This theory describes the properties and behaviour of matter and radiation at their smallest scales. It is the basis for the standard model of particle physics, which builds up all the visible constituents of the universe out of collections of quarks, electrons and force-carrying particles such as photons. The discovery of the Higgs boson at CERN in Geneva is only the most recent of this theory's many triumphs. But, while they are both highly successful, these two structures leave a lot of important questions unanswered. They are also based on ...
DEFF Research Database (Denmark)
Asmussen, J.C.; Ibrahim, S.R.; Brincker, Rune
Abstraet Thispaper demansirates how to use the Random Decrement (RD) technique for identification o flinear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing...
DEFF Research Database (Denmark)
Asmussen, J. C.; Ibrahim, S. R.; Brincker, Rune
This paper demonstrates how to use the Random Decrement (RD) technique for identification of linear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing a new...
DEFF Research Database (Denmark)
Asmussen, J. C.; Ibrahim, R.; Brincker, Rune
1998-01-01
This paper demonstrates how to use the Random Decrement (RD) technique for identification of linear structures subjected to ambient excitation. The theory behind the technique will be presented and guidelines how to choose the different variables will be given. This is done by introducing a new...
Nepal, Niraj K.; Ruzsinszky, Adrienn; Bates, Jefferson E.
2018-03-01
The ground state structural and energetic properties for rocksalt and cesium chloride phases of the cesium halides were explored using the random phase approximation (RPA) and beyond-RPA methods to benchmark the nonempirical SCAN meta-GGA and its empirical dispersion corrections. The importance of nonadditivity and higher-order multipole moments of dispersion in these systems is discussed. RPA generally predicts the equilibrium volume for these halides within 2.4% of the experimental value, while beyond-RPA methods utilizing the renormalized adiabatic LDA (rALDA) exchange-correlation kernel are typically within 1.8%. The zero-point vibrational energy is small and shows that the stability of these halides is purely due to electronic correlation effects. The rAPBE kernel as a correction to RPA overestimates the equilibrium volume and could not predict the correct phase ordering in the case of cesium chloride, while the rALDA kernel consistently predicted results in agreement with the experiment for all of the halides. However, due to its reasonable accuracy with lower computational cost, SCAN+rVV10 proved to be a good alternative to the RPA-like methods for describing the properties of these ionic solids.
High speed true random number generator with a new structure of coarse-tuning PDL in FPGA
Fang, Hongzhen; Wang, Pengjun; Cheng, Xu; Zhou, Keji
2018-03-01
A metastability-based TRNG (true random number generator) is presented in this paper, and implemented in FPGA. The metastable state of a D flip-flop is tunable through a two-stage PDL (programmable delay line). With the proposed coarse-tuning PDL structure, the TRNG core does not require extra placement and routing to ensure its entropy. Furthermore, the core needs fewer stages of coarse-tuning PDL at higher operating frequency, and thus saves more resources in FPGA. The designed TRNG achieves 25 Mbps @ 100 MHz throughput after proper post-processing, which is several times higher than other previous TRNGs based on FPGA. Moreover, the robustness of the system is enhanced with the adoption of a feedback system. The quality of the designed TRNG is verified by NIST (National Institute of Standards and Technology) and also accepted by class P1 of the AIS-20/31 test suite. Project supported by the S&T Plan of Zhejiang Provincial Science and Technology Department (No. 2016C31078), the National Natural Science Foundation of China (Nos. 61574041, 61474068, 61234002), and the K.C. Wong Magna Fund in Ningbo University, China.
International Nuclear Information System (INIS)
Ootori, Yasuki; Ishikawa, Hiroyuki; Takeda, Tomoyoshi
2004-01-01
In the JEAG4601-1987 (Japan Electric Association Guide for earthquake resistance design), either the conventional deterministic method or probabilistic method is used for evaluating the stability of ground foundations and surrounding slopes in nuclear power plants. The deterministic method, in which the soil properties of 'mean ± coefficient x standard deviation' is adopted for the calculations, is generally used in the design stage to data. On the other hand, the probabilistic method, in which the soil properties assume to have probabilistic distributions, is stated as a future method. The deterministic method facilitates the evaluation, however, it is necessary to clarify the relationship between the deterministic and probabilistic methods. In order to investigate the relationship, a simple model that can take into account the dynamic effect of structures, and a simplified method for taking the spatial randomness into account are proposed in this study. As a result, it is found that the shear strength of soil is the most important factor for the stability of grounds and slopes, and the probability below the safety factor evaluated with the soil properties of mean - 1.0 x standard deviation' by the deterministic methods of much lower. (author)
Finger Search in Grammar-Compressed Strings
DEFF Research Database (Denmark)
Bille, Philip; Christiansen, Anders Roy; Cording, Patrick Hagge
2016-01-01
random access, that is, given a position in the original uncompressed string report the character at that position. In this paper we study the random access problem with the finger search property, that is, the time for a random access query should depend on the distance between a specified index f...
Reconsidering the Rhizome: A Textual Analysis of Web Search Engines as Gatekeepers of the Internet
Hess, A.
Critical theorists have often drawn from Deleuze and Guattari's notion of the rhizome when discussing the potential of the Internet. While the Internet may structurally appear as a rhizome, its day-to-day usage by millions via search engines precludes experiencing the random interconnectedness and potential democratizing function. Through a textual analysis of four search engines, I argue that Web searching has grown hierarchies, or "trees," that organize data in tracts of knowledge and place users in marketing niches rather than assist in the development of new knowledge.
Zamani, Abbas-Ali; Tavakoli, Saeed; Etedali, Sadegh
2017-03-01
Fractional order PID (FOPID) controllers are introduced as a general form of classical PID controllers using fractional calculus. As this controller provides good disturbance rejection and is robust against plant uncertainties it is appropriate for the vibration mitigation in structures. In this paper, an FOPID controller is designed to adjust the contact force of piezoelectric friction dampers for semi-active control of base-isolated structures during far-field and near-field earthquake excitations. A multi-objective cuckoo search algorithm is employed to tune the controller parameters. Considering the resulting Pareto optimal front, the best input for the FOPID controller is selected. For seven pairs of earthquakes and nine performance indices, the performance of the proposed controller is compared with those provided by several well-known control techniques. According to the simulation results, the proposed controller performs better than other controllers in terms of simultaneous reduction of the maximum base displacement and story acceleration for various types of earthquakes. Also, it provides acceptable responses in terms of inter-story drifts, root mean square of base displacements and floor acceleration. In addition, the evaluation of robustness for a stiffness uncertainty of ±10% indicates that the proposed controller gives a robust performance against such modeling errors. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.
Oshmarin, D.; Sevodina, N.; Iurlov, M.; Iurlova, N.
2017-06-01
In this paper, with the aim of providing passive control of structure vibrations a new approach has been proposed for selecting optimal parameters of external electric shunt circuits connected to piezoelectric elements located on the surface of the structure. The approach is based on the mathematical formulation of the natural vibration problem. The results of solution of this problem are the complex eigenfrequencies, the real part of which represents the vibration frequency and the imaginary part corresponds to the damping ratio, characterizing the rate of damping. A criterion of search for optimal parameters of the external passive shunt circuits, which can provide the system with desired dissipative properties, has been derived based on the analysis of responses of the real and imaginary parts of different complex eigenfrequencies to changes in the values of the parameters of the electric circuit. The efficiency of this approach has been verified in the context of natural vibration problem of rigidly clamped plate and semi-cylindrical shell, which is solved for series-connected and parallel -connected external resonance (consisting of resistive and inductive elements) R-L circuits. It has been shown that at lower (more energy-intensive) frequencies, a series-connected external circuit has the advantage of providing lower values of the circuit parameters, which renders it more attractive in terms of practical applications.
I-SG : Interactive Search Grouping - Search result grouping using Independent Component Analysis
DEFF Research Database (Denmark)
Lauritsen, Thomas; Kolenda, Thomas
2002-01-01
We present a computational simple and efficient approach to unsupervised grouping the search result from any search engine. Along with each group a set of keywords are found to annotate the contents. This approach leads to an interactive search trough a hierarchial structure that is build online....... It is the users task to improve the search, trough expanding the search query using the topic keywords representing the desired groups. In doing so the search engine limits the space of possible search results, virtually moving down in the search hierarchy, and so refines the search....
Pai, Pei-Jing; Hu, Yingwei; Lam, Henry
2016-08-31
Intact glycopeptide MS analysis to reveal site-specific protein glycosylation is an important frontier of proteomics. However, computational tools for analyzing MS/MS spectra of intact glycopeptides are still limited and not well-integrated into existing workflows. In this work, a new computational tool which combines the spectral library building/searching tool, SpectraST (Lam et al. Nat. Methods2008, 5, 873-875), and the glycopeptide fragmentation prediction tool, MassAnalyzer (Zhang et al. Anal. Chem.2010, 82, 10194-10202) for intact glycopeptide analysis has been developed. Specifically, this tool enables the determination of the glycan structure directly from low-energy collision-induced dissociation (CID) spectra of intact glycopeptides. Given a list of possible glycopeptide sequences as input, a sample-specific spectral library of MassAnalyzer-predicted spectra is built using SpectraST. Glycan identification from CID spectra is achieved by spectral library searching against this library, in which both m/z and intensity information of the possible fragmentation ions are taken into consideration for improved accuracy. We validated our method using a standard glycoprotein, human transferrin, and evaluated its potential to be used in site-specific glycosylation profiling of glycoprotein datasets from LC-MS/MS. In addition, we further applied our method to reveal, for the first time, the site-specific N-glycosylation profile of recombinant human acetylcholinesterase expressed in HEK293 cells. For maximum usability, SpectraST is developed as part of the Trans-Proteomic Pipeline (TPP), a freely available and open-source software suite for MS data analysis. Copyright © 2016 Elsevier B.V. All rights reserved.
Palter, Vanessa N; Orzech, Neil; Reznick, Richard K; Grantcharov, Teodor P
2013-02-01
: To develop and validate an ex vivo comprehensive curriculum for a basic laparoscopic procedure. : Although simulators have been well validated as tools to teach technical skills, their integration into comprehensive curricula is lacking. Moreover, neither the effect of ex vivo training on learning curves in the operating room (OR), nor the effect on nontechnical proficiency has been investigated. : This randomized single-blinded prospective trial allocated 20 surgical trainees to a structured training and assessment curriculum (STAC) group or conventional residency training. The STAC consisted of case-based learning, proficiency-based virtual reality training, laparoscopic box training, and OR participation. After completion of the intervention, all participants performed 5 sequential laparoscopic cholecystectomies in the OR. The primary outcome measure was the difference in technical performance between the 2 groups during the first laparoscopic cholecystectomy. Secondary outcome measures included differences with respect to learning curves in the OR, technical proficiency of each sequential laparoscopic cholecystectomy, and nontechnical skills. : Residents in the STAC group outperformed residents in the conventional group in the first (P = 0.004), second (P = 0.036), third (P = 0.021), and fourth (P = 0.023) laparoscopic cholecystectomies. The conventional group demonstrated a significant learning curve in the OR (P = 0.015) in contrast to the STAC group (P = 0.032). Residents in the STAC group also had significantly higher nontechnical skills (P = 0.027). : Participating in the STAC shifted the learning curve for a basic laparoscopic procedure from the operating room into the simulation laboratory. STAC-trained residents had superior technical proficiency in the OR and nontechnical skills compared with conventionally trained residents. (The study registration ID is NCT01560494.).
Fatmaa El Zahraa Mohamed Abdou
2004-01-01
A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.
DEFF Research Database (Denmark)
Liu, Jianping; Kjaergard, Lise Lotte; Gluud, Christian
2002-01-01
The quality of randomization of Chinese randomized trials on herbal medicines for hepatitis B was assessed. Search strategy and inclusion criteria were based on the published protocol. One hundred and seventy-six randomized clinical trials (RCTs) involving 20,452 patients with chronic hepatitis B...... virus (HBV) infection were identified that tested Chinese medicinal herbs. They were published in 49 Chinese journals. Only 10% (18/176) of the studies reported the method by which they randomized patients. Only two reported allocation concealment and were considered as adequate. Twenty percent (30...
Aaboud, Morad; ATLAS Collaboration; Abbott, Brad; Abdinov, Ovsat; Abeloos, Baptiste; Abidi, Syed Haider; AbouZeid, Ossama; Abraham, Nicola; Abramowicz, Halina; Abreu, Henso; Abulaiti, Yiming; Acharya, Bobby Samir; Adachi, Shunsuke; Adamczyk, Leszek; Adelman, Jahred; Adersberger, Michael; Adye, Tim; Affolder, Tony; Afik, Yoav; Agheorghiesei, Catalin; Aguilar-Saavedra, Juan Antonio; Ahlen, Steven; Ahmadov, Faig; Aielli, Giulio; Akatsuka, Shunichi; Akerstedt, Henrik; {\\AA}kesson, Torsten Paul Ake; Akilli, Ece; Akimov, Andrei; Alberghi, Gian Luigi; Albert, Justin; Albicocco, Pietro; Alconada Verzini, Maria Josefina; Alderweireldt, Sara; Aleksa, Martin; Aleksandrov, Igor; Alexa, Calin; Alexander, Gideon; Alexopoulos, Theodoros; Alhroob, Muhammad; Ali, Babar; Aliev, Malik; Alimonti, Gianluca; Alison, John; Alkire, Steven Patrick; Allbrooke, Benedict; Allen, Benjamin William; Allport, Phillip; Aloisio, Alberto; Alonso, Alejandro; Alonso, Francisco; Alpigiani, Cristiano; Alshehri, Azzah Aziz; Alstaty, Mahmoud; Alvarez Gonzalez, Barbara; \\'{A}lvarez Piqueras, Dami\\'{a}n; Alviggi, Mariagrazia; Amadio, Brian Thomas; Amaral Coutinho, Yara; Amelung, Christoph; Amidei, Dante; Amor Dos Santos, Susana Patricia; Amoroso, Simone; Anastopoulos, Christos; Ancu, Lucian Stefan; Andari, Nansi; Andeen, Timothy; Anders, Christoph Falk; Anders, John Kenneth; Anderson, Kelby; Andreazza, Attilio; Andrei, George Victor; Angelidakis, Stylianos; Angelozzi, Ivan; Angerami, Aaron; Anisenkov, Alexey; Anjos, Nuno; Annovi, Alberto; Antel, Claire; Antonelli, Mario; Antonov, Alexey; Antrim, Daniel Joseph; Anulli, Fabio; Aoki, Masato; Aperio Bella, Ludovica; Arabidze, Giorgi; Arai, Yasuo; Araque, Juan Pedro; Araujo Ferraz, Victor; Arce, Ayana; Ardell, Rose Elisabeth; Arduh, Francisco Anuar; Arguin, Jean-Francois; Argyropoulos, Spyridon; Arik, Metin; Armbruster, Aaron James; Armitage, Lewis James; Arnaez, Olivier; Arnold, Hannah; Arratia, Miguel; Arslan, Ozan; Artamonov, Andrei; Artoni, Giacomo; Artz, Sebastian; Asai, Shoji; Asbah, Nedaa; Ashkenazi, Adi; Asquith, Lily; Assamagan, Ketevi; Astalos, Robert; Atkinson, Markus; Atlay, Naim Bora; Augsten, Kamil; Avolio, Giuseppe; Axen, Bradley; Ayoub, Mohamad Kassem; Azuelos, Georges; Baas, Alessandra; Baca, Matthew John; Bachacou, Henri; Bachas, Konstantinos; Backes, Moritz; Bagnaia, Paolo; Bahmani, Marzieh; Bahrasemani, Sina; Baines, John; Bajic, Milena; Baker, Oliver Keith; Bakker, Pepijn Johannes; Bakshi Gupta, Debottam; Baldin, Evgenii; Balek, Petr; Balli, Fabrice; Balunas, William Keaton; Banas, Elzbieta; Bandyopadhyay, Anjishnu; Banerjee, Swagato; Bannoura, Arwa A E; Barak, Liron; Barberio, Elisabetta Luigia; Barberis, Dario; Barbero, Marlon; Barillari, Teresa; Barisits, Martin-Stefan; Barkeloo, Jason Tyler Colt; Barklow, Timothy; Barlow, Nick; Barnes, Sarah Louise; Barnett, Bruce; Barnett, Michael; Barnovska-Blenessy, Zuzana; Baroncelli, Antonio; Barone, Gaetano; Barr, Alan; Barranco Navarro, Laura; Barreiro, Fernando; Barreiro Guimar\\~{a}es da Costa, Jo\\~{a}o; Bartoldus, Rainer; Barton, Adam Edward; Bartos, Pavol; Basalaev, Artem; Bassalat, Ahmed; Bates, Richard; Batista, Santiago Juan; Batley, Richard; Battaglia, Marco; Bauce, Matteo; Bauer, Florian; Bauer, Kevin Thomas; Bawa, Harinder Singh; Beacham, James; Beattie, Michael David; Beau, Tristan; Beauchemin, Pierre-Hugues; Bechtle, Philip; Beck, Hans~Peter; Beck, Helge Christoph; Becker, Kathrin; Becker, Maurice; Becot, Cyril; Beddall, Andrew; Beddall, Ayda; Bednyakov, Vadim; Bedognetti, Matteo; Bee, Christopher; Beermann, Thomas; Begalli, Marcia; Begel, Michael; Behr, Janna Katharina; Bell, Andrew Stuart; Bella, Gideon; Bellagamba, Lorenzo; Bellerive, Alain; Bellomo, Massimiliano; Belotskiy, Konstantin; Beltramello, Olga; Belyaev, Nikita; Benary, Odette; Benchekroun, Driss; Bender, Michael; Benekos, Nektarios; Benhammou, Yan; Benhar Noccioli, Eleonora; Benitez, Jose; Benjamin, Douglas; Benoit, Mathieu; Bensinger, James; Bentvelsen, Stan; Beresford, Lydia; Beretta, Matteo; Berge, David; Bergeaas Kuutmann, Elin; Berger, Nicolas; Bergsten, Laura Jean; Beringer, J\\"urg; Berlendis, Simon; Bernard, Nathan Rogers; Bernardi, Gregorio; Bernius, Catrin; Bernlochner, Florian Urs; Berry, Tracey; Berta, Peter; Bertella, Claudia; Bertoli, Gabriele; Bertram, Iain Alexander; Bertsche, Carolyn; Besjes, Geert-Jan; Bessidskaia Bylund, Olga; Bessner, Martin Florian; Besson, Nathalie; Bethani, Agni; Bethke, Siegfried; Betti, Alessandra; Bevan, Adrian John; Beyer, Julien-christopher; Bianchi, Riccardo-Maria; Biebel, Otmar; Biedermann, Dustin; Bielski, Rafal; Bierwagen, Katharina; Biesuz, Nicolo Vladi; Biglietti, Michela; Billoud, Thomas Remy Victor; Bilokon, Halina; Bindi, Marcello; Bingul, Ahmet; Bini, Cesare; Biondi, Silvia; Bisanz, Tobias; Bittrich, Carsten; Bjergaard, David Martin; Black, James; Black, Kevin; Blair, Robert; Blazek, Tomas; Bloch, Ingo; Blocker, Craig; Blue, Andrew; Blumenschein, Ulrike; Blunier, Sylvain; Bobbink, Gerjan; Bobrovnikov, Victor; Bocchetta, Simona Serena; Bocci, Andrea; Bock, Christopher; Boehler, Michael; Boerner, Daniela; Bogavac, Danijela; Bogdanchikov, Alexander; Bohm, Christian; Boisvert, Veronique; Bokan, Petar; Bold, Tomasz; Boldyrev, Alexey; Bolz, Arthur Eugen; Bomben, Marco; Bona, Marcella; Bonilla, Johan Sebastian; Boonekamp, Maarten; Borisov, Anatoly; Borissov, Guennadi; Bortfeldt, Jonathan; Bortoletto, Daniela; Bortolotto, Valerio; Boscherini, Davide; Bosman, Martine; Bossio Sola, Jonathan David; Boudreau, Joseph; Bouhova-Thacker, Evelina Vassileva; Boumediene, Djamel Eddine; Bourdarios, Claire; Boutle, Sarah Kate; Boveia, Antonio; Boyd, James; Boyko, Igor; Bozson, Adam James; Bracinik, Juraj; Brandt, Andrew; Brandt, Gerhard; Brandt, Oleg; Braren, Frued; Bratzler, Uwe; Brau, Benjamin; Brau, James; Breaden Madden, William Dmitri; Brendlinger, Kurt; Brennan, Amelia Jean; Brenner, Lydia; Brenner, Richard; Bressler, Shikma; Briglin, Daniel Lawrence; Bristow, Timothy Michael; Britton, Dave; Britzger, Daniel; Brock, Ian; Brock, Raymond; Brooijmans, Gustaaf; Brooks, Timothy; Brooks, William; Brost, Elizabeth; Broughton, James; Bruckman de Renstrom, Pawel; Bruncko, Dusan; Bruni, Alessia; Bruni, Graziano; Bruni, Lucrezia Stella; Bruno, Salvatore; Brunt, Benjamin; Bruschi, Marco; Bruscino, Nello; Bryant, Patrick; Bryngemark, Lene; Buanes, Trygve; Buat, Quentin; Buchholz, Peter; Buckley, Andrew; Budagov, Ioulian; Buehrer, Felix; Bugge, Magnar Kopangen; Bulekov, Oleg; Bullock, Daniel; Burch, Tyler James; Burdin, Sergey; Burgard, Carsten Daniel; Burger, Angela Maria; Burghgrave, Blake; Burka, Klaudia; Burke, Stephen; Burmeister, Ingo; Burr, Jonathan Thomas Peter; B\\"uscher, Daniel; B\\"uscher, Volker; Buschmann, Eric; Bussey, Peter; Butler, John; Buttar, Craig; Butterworth, Jonathan; Butti, Pierfrancesco; Buttinger, William; Buzatu, Adrian; Buzykaev, Aleksey; Cabrera Urb\\'an, Susana; Caforio, Davide; Cai, Huacheng; Cairo, Valentina; Cakir, Orhan; Calace, Noemi; Calafiura, Paolo; Calandri, Alessandro; Calderini, Giovanni; Calfayan, Philippe; Callea, Giuseppe; Caloba, Luiz; Calvente Lopez, Sergio; Calvet, David; Calvet, Samuel; Calvet, Thomas Philippe; Camacho Toro, Reina; Camarda, Stefano; Camarri, Paolo; Cameron, David; Caminal Armadans, Roger; Camincher, Clement; Campana, Simone; Campanelli, Mario; Camplani, Alessandra; Campoverde, Angel; Canale, Vincenzo; Cano Bret, Marc; Cantero, Josu; Cao, Tingting; Capeans Garrido, Maria Del Mar; Caprini, Irinel; Caprini, Mihai; Capua, Marcella; Carbone, Ryne Michael; Cardarelli, Roberto; Cardillo, Fabio; Carli, Ina; Carli, Tancredi; Carlino, Gianpaolo; Carlson, Benjamin Taylor; Carminati, Leonardo; Carney, Rebecca; Caron, Sascha; Carquin, Edson; Carr\\'a, Sonia; Carrillo-Montoya, German D; Casadei, Diego; Casado, Maria Pilar; Casha, Albert Francis; Casolino, Mirkoantonio; Casper, David William; Castelijn, Remco; Castillo Gimenez, Victoria; Castro, Nuno Filipe; Catinaccio, Andrea; Catmore, James; Cattai, Ariella; Caudron, Julien; Cavaliere, Viviana; Cavallaro, Emanuele; Cavalli, Donatella; Cavalli-Sforza, Matteo; Cavasinni, Vincenzo; Celebi, Emre; Ceradini, Filippo; Cerda Alberich, Leonor; Santiago Cerqueira, Augusto; Cerri, Alessandro; Cerrito, Lucio; Cerutti, Fabio; Cervelli, Alberto; Cetin, Serkant Ali; Chafaq, Aziz; Chakraborty, Dhiman; Chan, Stephen Kam-wah; Chan, Wing Sheung; Chan, Yat Long; Chang, Philip; Chapman, John Derek; Charlton, David; Chau, Chav Chhiv; Chavez Barajas, Carlos Alberto; Che, Siinn; Cheatham, Susan; Chegwidden, Andrew; Chekanov, Sergei; Chekulaev, Sergey; Chelkov, Gueorgui; Chelstowska, Magda Anna; Chen, Cheng; Chen, Chunhui; Chen, Hucheng; Chen, Jing; Chen, Jue; Chen, Shenjian; Chen, Shion; Chen, Xin; Chen, Ye; Cheng, Hok Chuen; Cheng, Huajie; Cheplakov, Alexander; Cheremushkina, Evgeniya; Cherkaoui El Moursli, Rajaa; Cheu, Elliott; Cheung, Kingman; Chevalier, Laurent; Chiarella, Vitaliano; Chiarelli, Giorgio; Chiodini, Gabriele; Chisholm, Andrew; Chitan, Adrian; Chiu, Yu Him Justin; Chizhov, Mihail; Choi, Kyungeon; Chomont, Arthur Rene; Chouridou, Sofia; Chow, Yun Sang; Christodoulou, Valentinos; Chu, Ming Chung; Chudoba, Jiri; Chuinard, Annabelle Julia; Chwastowski, Janusz; Chytka, Ladislav; Ciftci, Abbas Kenan; Cinca, Diane; Cindro, Vladimir; Cioar\\u{a}, Irina Antonela; Ciocio, Alessandra; Cirotto, Francesco; Citron, Zvi Hirsh; Citterio, Mauro; Ciubancan, Mihai; Clark, Allan G; Clark, Michael; Clark, Philip James; Clarke, Robert; Clement, Christophe; Coadou, Yann; Cobal, Marina; Coccaro, Andrea; Cochran, James H; Colasurdo, Luca; Cole, Brian; Colijn, Auke-Pieter; Collot, Johann; Conde Mui\\~no, Patricia; Coniavitis, Elias; Connell, Simon Henry; Connelly, Ian; Constantinescu, Serban; Conti, Geraldine; Conventi, Francesco; Cooper-Sarkar, Amanda; Cormier, Felix; Cormier, Kyle James Read; Corradi, Massimo; Corrigan, Eric Edward; Corriveau, Francois; Cortes-Gonzalez, Arely; Costa, Mar\\'ia Jos\\'e; Costanzo, Davide; Cottin, Giovanna; Cowan, Glen; Cox, Brian; Cranmer, Kyle; Crawley, Samuel Joseph; Creager, Rachael; Cree, Graham; Cr\\'ep\\'e-Renaudin, Sabine; Crescioli, Francesco; Cribbs, Wayne Allen; Cristinziani, Markus; Croft, Vince; Crosetti, Giovanni; Cueto, Ana; Cuhadar Donszelmann, Tulay; Cukierman, Aviv Ruben; Cummings, Jane; Curatolo, Maria; C\\'uth, Jakub; Czekierda, Sabina; Czodrowski, Patrick; D'amen, Gabriele; D'Auria, Saverio; D'eramo, Louis; D'Onofrio, Monica; Da Cunha Sargedas De Sousa, Mario Jose; Da Via, Cinzia; Dabrowski, Wladyslaw; Dado, Tomas; Dahbi, Salah-eddine; Dai, Tiesheng; Dale, Orjan; Dallaire, Frederick; Dallapiccola, Carlo; Dam, Mogens; Dandoy, Jeffrey; Daneri, Maria Florencia; Dang, Nguyen Phuong; Dann, Nicholas Stuart; Danninger, Matthias; Dano Hoffmann, Maria; Dao, Valerio; Darbo, Giovanni; Darmora, Smita; Dassoulas, James; Dattagupta, Aparajita; Daubney, Thomas; Davey, Will; David, Claire; Davidek, Tomas; Davis, Douglas; Davison, Peter; Dawe, Edmund; Dawson, Ian; De, Kaushik; de Asmundis, Riccardo; De Benedetti, Abraham; De Castro, Stefano; De Cecco, Sandro; De Groot, Nicolo; de Jong, Paul; De la Torre, Hector; De Lorenzi, Francesco; De Maria, Antonio; De Pedis, Daniele; De Salvo, Alessandro; De Sanctis, Umberto; De Santo, Antonella; De Vasconcelos Corga, Kevin; De Vivie De Regie, Jean-Baptiste; Debbe, Ramiro; Debenedetti, Chiara; Dedovich, Dmitri; Dehghanian, Nooshin; Deigaard, Ingrid; Del Gaudio, Michela; Del Peso, Jose; Delgove, David; Deliot, Frederic; Delitzsch, Chris Malena; Dell'Acqua, Andrea; Dell'Asta, Lidia; Della Pietra, Massimo; della Volpe, Domenico; Delmastro, Marco; Delporte, Charles; Delsart, Pierre-Antoine; DeMarco, David; Demers, Sarah; Demichev, Mikhail; Demilly, Aurelien; Denisov, Sergey; Denysiuk, Denys; Derendarz, Dominik; Derkaoui, Jamal Eddine; Derue, Frederic; Dervan, Paul; Desch, Klaus Kurt; Deterre, Cecile; Dette, Karola; Devesa, Maria Roberta; Deviveiros, Pier-Olivier; Dewhurst, Alastair; Dhaliwal, Saminder; Di Bello, Francesco Armando; Di Ciaccio, Anna; Di Ciaccio, Lucia; Di Clemente, William Kennedy; Di Donato, Camilla; Di Girolamo, Alessandro; Di Girolamo, Beniamino; Di Micco, Biagio; Di Nardo, Roberto; Di Petrillo, Karri Folan; Di Simone, Andrea; Di Sipio, Riccardo; Di Valentino, David; Diaconu, Cristinel; Diamond, Miriam; Dias, Flavia; Diaz, Marco Aurelio; Dickinson, Jennet; Diehl, Edward; Dietrich, Janet; D\\'iez Cornell, Sergio; Dimitrievska, Aleksandra; Dingfelder, Jochen; Dita, Petre; Dita, Sanda; Dittus, Fridolin; Djama, Fares; Djobava, Tamar; Djuvsland, Julia Isabell; Barros do Vale, Maria Aline; Dobre, Monica; Dodsworth, David; Doglioni, Caterina; Dolejsi, Jiri; Dolezal, Zdenek; Donadelli, Marisilvia; Donati, Simone; Donini, Julien; Dopke, Jens; Doria, Alessandra; Dova, Maria-Teresa; Doyle, Tony; Drechsler, Eric; Dris, Manolis; Du, Yanyan; Duarte-Campderros, Jorge; Dubinin, Filipp; Dubreuil, Arnaud; Duchovni, Ehud; Duckeck, Guenter; Ducourthial, Audrey; Ducu, Otilia Anamaria; Duda, Dominik; Dudarev, Alexey; Dudder, Andreas Christian; Duffield, Emily Marie; Duflot, Laurent; D\\"uhrssen, Michael; Dulsen, Carsten; Dumancic, Mirta; Dumitriu, Ana Elena; Duncan, Anna Kathryn; Dunford, Monica; Duperrin, Arnaud; Duran Yildiz, Hatice; D\\"uren, Michael; Durglishvili, Archil; Duschinger, Dirk; Dutta, Baishali; Duvnjak, Damir; Dyndal, Mateusz; Dziedzic, Bartosz Sebastian; Eckardt, Christoph; Ecker, Katharina Maria; Edgar, Ryan Christopher; Eifert, Till; Eigen, Gerald; Einsweiler, Kevin; Ekelof, Tord; El Kacimi, Mohamed; El Kosseifi, Rima; Ellajosyula, Venugopal; Ellert, Mattias; Elles, Sabine; Ellinghaus, Frank; Elliot, Alison; Ellis, Nicolas; Elmsheuser, Johannes; Elsing, Markus; Emeliyanov, Dmitry; Enari, Yuji; Ennis, Joseph Stanford; Epland, Matthew Berg; Erdmann, Johannes; Ereditato, Antonio; Ernst, Michael; Errede, Steven; Escalier, Marc; Escobar, Carlos; Esposito, Bellisario; Estrada Pastor, Oscar; Etienvre, Anne-Isabelle; Etzion, Erez; Evans, Hal; Ezhilov, Alexey; Ezzi, Mohammed; Fabbri, Federica; Fabbri, Laura; Fabiani, Veronica; Facini, Gabriel; Fakhrutdinov, Rinat; Falciano, Speranza; Falla, Rebecca Jane; Faltova, Jana; Fang, Yaquan; Fanti, Marcello; Farbin, Amir; Farilla, Addolorata; Farina, Edoardo Maria; Farooque, Trisha; Farrell, Steven; Farrington, Sinead; Farthouat, Philippe; Fassi, Farida; Fassnacht, Patrick; Fassouliotis, Dimitrios; Faucci Giannelli, Michele; Favareto, Andrea; Fawcett, William James; Fayard, Louis; Fedin, Oleg; Fedorko, Wojciech; Feigl, Simon; Feligioni, Lorenzo; Feng, Cunfeng; Feng, Eric; Feng, Minyu; Fenton, Michael James; Fenyuk, Alexander; Feremenga, Last; Fernandez Martinez, Patricia; Ferrando, James; Ferrari, Arnaud; Ferrari, Pamela; Ferrari, Roberto; Ferreira de Lima, Danilo Enoque; Ferrer, Antonio; Ferrere, Didier; Ferretti, Claudio; Fiedler, Frank; Filip\\v{c}i\\v{c}, Andrej; Filipuzzi, Marco; Filthaut, Frank; Fincke-Keeler, Margret; Finelli, Kevin Daniel; Fiolhais, Miguel; Fiorini, Luca; Fischer, Cora; Fischer, Julia; Fisher, Wade Cameron; Flaschel, Nils; Fleck, Ivor; Fleischmann, Philipp; Fletcher, Rob Roy MacGregor; Flick, Tobias; Flierl, Bernhard Matthias; Flores Castillo, Luis; Fomin, Nikolai; Forcolin, Giulio Tiziano; Formica, Andrea; F\\"orster, Fabian Alexander; Forti, Alessandra; Foster, Andrew Geoffrey; Fournier, Daniel; Fox, Harald; Fracchia, Silvia; Francavilla, Paolo; Franchini, Matteo; Franchino, Silvia; Francis, David; Franconi, Laura; Franklin, Melissa; Frate, Meghan; Fraternali, Marco; Freeborn, David; Fressard-Batraneanu, Silvia; Freund, Benjamin; Spolidoro Freund, Werner; Froidevaux, Daniel; Frost, James; Fukunaga, Chikara; Fusayasu, Takahiro; Fuster, Juan; Gabizon, Ofir; Gabrielli, Alessandro; Gabrielli, Andrea; Gach, Grzegorz; Gadatsch, Stefan; Gadomski, Szymon; Gagliardi, Guido; Gagnon, Louis Guillaume; Galea, Cristina; Galhardo, Bruno; Gallas, Elizabeth; Gallop, Bruce; Gallus, Petr; Galster, Gorm Aske Gram Krohn; Gan, KK; Ganguly, Sanmay; Gao, Yanyan; Gao, Yongsheng; Garay Walls, Francisca; Garc\\'ia, Carmen; Garc\\'ia Navarro, Jos\\'e Enrique; Garc\\'ia Pascual, Juan Antonio; Garcia-Sciveres, Maurice; Gardner, Robert; Garelli, Nicoletta; Garonne, Vincent; Gasnikova, Ksenia; Gatti, Claudio; Gaudiello, Andrea; Gaudio, Gabriella; Gavrilenko, Igor; Gay, Colin; Gaycken, Goetz; Gazis, Evangelos; Gee, Norman; Geisen, Jannik; Geisen, Marc; Geisler, Manuel Patrice; Gellerstedt, Karl; Gemme, Claudia; Genest, Marie-H\\'el\\`ene; Geng, Cong; Gentile, Simonetta; Gentsos, Christos; George, Simon; Gerbaudo, Davide; Ge\\ss{}ner, Gregor; Ghasemi, Sara; Ghneimat, Mazuza; Giacobbe, Benedetto; Giagu, Stefano; Giangiacomi, Nico; Giannetti, Paola; Gibson, Stephen; Gignac, Matthew; Gilchriese, Murdock; Gillberg, Dag; Gilles, Geoffrey; Gingrich, Douglas; Giordani, MarioPaolo; Giorgi, Filippo Maria; Giraud, Pierre-Francois; Giromini, Paolo; Giugliarelli, Gilberto; Giugni, Danilo; Giuli, Francesco; Giulini, Maddalena; Gjelsten, B{\\o}rge Kile; Gkaitatzis, Stamatios; Gkialas, Ioannis; Gkougkousis, Evangelos Leonidas; Gkountoumis, Panagiotis; Gladilin, Leonid; Glasman, Claudia; Glatzer, Julian; Glaysher, Paul; Glazov, Alexandre; Goblirsch-Kolb, Maximilian; Godlewski, Jan; Goldfarb, Steven; Golling, Tobias; Golubkov, Dmitry; Gomes, Agostinho; Gon\\c calo, Ricardo; Goncalves Gama, Rafael; Goncalves Pinto Firmino Da Costa, Joao; Gonella, Giulia; Gonella, Laura; Gongadze, Alexi; Gonnella, Francesco; Gonski, Julia; Gonz\\'alez de la Hoz, Santiago; Gonzalez-Sevilla, Sergio; Goossens, Luc; Gorbounov, Petr Andreevich; Gordon, Howard; Gorini, Benedetto; Gorini, Edoardo; Gori\\v{s}ek, Andrej; Goshaw, Alfred; G\\"ossling, Claus; Gostkin, Mikhail Ivanovitch; Gottardo, Carlo Alberto; Goudet, Christophe Raymond; Goujdami, Driss; Goussiou, Anna; Govender, Nicolin; Goy, Corinne; Gozani, Eitan; Grabowska-Bold, Iwona; Gradin, Per Olov Joakim; Graham, Emily Charlotte; Gramling, Johanna; Gramstad, Eirik; Grancagnolo, Sergio; Gratchev, Vadim; Gravila, Paul Mircea; Gray, Chloe; Gray, Heather; Greenwood, Zeno Dixon; Grefe, Christian; Gregersen, Kristian; Gregor, Ingrid-Maria; Grenier, Philippe; Grevtsov, Kirill; Griffiths, Justin; Grillo, Alexander; Grimm, Kathryn; Grinstein, Sebastian; Gris, Philippe Luc Yves; Grivaz, Jean-Francois; Groh, Sabrina; Gross, Eilam; Grosse-Knetter, Joern; Grossi, Giulio Cornelio; Grout, Zara Jane; Grummer, Aidan; Guan, Liang; Guan, Wen; Guenther, Jaroslav; Guescini, Francesco; Guest, Daniel; Gueta, Orel; Gugel, Ralf; Gui, Bin; Guido, Elisa; Guillemin, Thibault; Guindon, Stefan; Gul, Umar; Gumpert, Christian; Guo, Jun; Guo, Wen; Guo, Yicheng; Gupta, Ruchi; Gurbuz, Saime; Gustavino, Giuliano; Gutelman, Benjamin Jacque; Gutierrez, Phillip; Gutierrez Ortiz, Nicolas Gilberto; Gutschow, Christian; Guyot, Claude; Guzik, Marcin Pawel; Gwenlan, Claire; Gwilliam, Carl; Haas, Andy; Haber, Carl; Hadavand, Haleh Khani; Haddad, Nacim; Hadef, Asma; Hageb\\"ock, Stephan; Hagihara, Mutsuto; Hakobyan, Hrachya; Haleem, Mahsana; Haley, Joseph; Halladjian, Garabed; Hallewell, Gregory David; Hamacher, Klaus; Hamal, Petr; Hamano, Kenji; Hamilton, Andrew; Hamity, Guillermo Nicolas; Hamnett, Phillip George; Han, Kunlin; Han, Liang; Han, Shuo; Hanagaki, Kazunori; Hance, Michael; Handl, David Michael; Haney, Bijan; Hankache, Robert; Hanke, Paul; Hansen, J{\\o}rgen Beck; Hansen, Jorn Dines; Hansen, Maike Christina; Hansen, Peter Henrik; Hara, Kazuhiko; Hard, Andrew; Harenberg, Torsten; Hariri, Faten; Harkusha, Siarhei; Harrison, Paul Fraser; Hartmann, Nikolai Marcel; Hasegawa, Yoji; Hasib, Ahmed; Hassani, Samira; Haug, Sigve; Hauser, Reiner; Hauswald, Lorenz; Havener, Laura Brittany; Havranek, Miroslav; Hawkes, Christopher; Hawkings, Richard John; Hayden, Daniel; Hays, Chris; Hays, Jonathan Michael; Hayward, Helen; Haywood, Stephen; Heck, Tobias; Hedberg, Vincent; Heelan, Louise; Heer, Sebastian; Heidegger, Kim Katrin; Heim, Sarah; Heim, Timon; Heinemann, Beate; Heinrich, Jochen Jens; Heinrich, Lukas; Heinz, Christian; Hejbal, Jiri; Helary, Louis; Held, Alexander; Hellman, Sten; Helsens, Clement; Henderson, Robert; Heng, Yang; Henkelmann, Steffen; Henriques Correia, Ana Maria; Henrot-Versille, Sophie; Herbert, Geoffrey Henry; Herde, Hannah; Herget, Verena; Hern\\'andez Jim\\'enez, Yesenia; Herr, Holger; Herten, Gregor; Hertenberger, Ralf; Hervas, Luis; Herwig, Theodor Christian; Hesketh, Gavin Grant; Hessey, Nigel; Hetherly, Jeffrey Wayne; Higashino, Satoshi; Hig\\'on-Rodriguez, Emilio; Hildebrand, Kevin; Hill, Ewan; Hill, John; Hiller, Karl Heinz; Hillier, Stephen; Hils, Maximilian; Hinchliffe, Ian; Hirose, Minoru; Hirschbuehl, Dominic; Hiti, Bojan; Hladik, Ondrej; Hlaluku, Dingane Reward; Hoad, Xanthe; Hobbs, John; Hod, Noam; Hodgkinson, Mark; Hodgson, Paul; Hoecker, Andreas; Hoeferkamp, Martin; Hoenig, Friedrich; Hohn, David; Holmes, Tova Ray; Holzbock, Michael; Homann, Michael; Honda, Shunsuke; Honda, Takuya; Hong, Tae Min; Hooberman, Benjamin Henry; Hopkins, Walter; Horii, Yasuyuki; Horton, Arthur James; Hostachy, Jean-Yves; Hostiuc, Alexandru; Hou, Suen; Hoummada, Abdeslam; Howarth, James; Hoya, Joaquin; Hrabovsky, Miroslav; Hrdinka, Julia; Hristova, Ivana; Hrivnac, Julius; Hryn'ova, Tetiana; Hrynevich, Aliaksei; Hsu, Pai-hsien Jennifer; Hsu, Shih-Chieh; Hu, Qipeng; Hu, Shuyang; Huang, Yanping; Hubacek, Zdenek; Hubaut, Fabrice; Huegging, Fabian; Huffman, Todd Brian; Hughes, Emlyn; Huhtinen, Mika; Hunter, Robert Francis Holub; Huo, Peng; Hupe, Andre Marc; Huseynov, Nazim; Huston, Joey; Huth, John; Hyneman, Rachel; Iacobucci, Giuseppe; Iakovidis, Georgios; Ibragimov, Iskander; Iconomidou-Fayard, Lydia; Idrissi, Zineb; Iengo, Paolo; Igonkina, Olga; Iizawa, Tomoya; Ikegami, Yoichi; Ikeno, Masahiro; Ilchenko, Yuriy; Iliadis, Dimitrios; Ilic, Nikolina; Iltzsche, Franziska; Introzzi, Gianluca; Ioannou, Pavlos; Iodice, Mauro; Iordanidou, Kalliopi; Ippolito, Valerio; Isacson, Max Fredrik; Ishijima, Naoki; Ishino, Masaya; Ishitsuka, Masaki; Issever, Cigdem; Istin, Serhat; Ito, Fumiaki; Iturbe Ponce, Julia Mariana; Iuppa, Roberto; Iwasaki, Hiroyuki; Izen, Joseph; Izzo, Vincenzo; Jabbar, Samina; Jackson, Paul; Jacobs, Ruth Magdalena; Jain, Vivek; Jakel, Gunnar; Jakobi, Katharina Bianca; Jakobs, Karl; Jakobsen, Sune; Jakoubek, Tomas; Jamin, David Olivier; Jana, Dilip; Jansky, Roland; Janssen, Jens; Janus, Michel; Janus, Piotr Andrzej; Jarlskog, G\\"oran; Javadov, Namig; Jav\\r{u}rek, Tom\\'{a}\\v{s}; Javurkova, Martina; Jeanneau, Fabien; Jeanty, Laura; Jejelava, Juansher; Jelinskas, Adomas; Jenni, Peter; Jeske, Carl; J\\'ez\\'equel, St\\'ephane; Ji, Haoshuang; Jia, Jiangyong; Jiang, Hai; Jiang, Yi; Jiang, Zihao; Jiggins, Stephen; Jimenez Pena, Javier; Jin, Shan; Jinaru, Adam; Jinnouchi, Osamu; Jivan, Harshna; Johansson, Per; Johns, Kenneth; Johnson, Christian; Johnson, William Joseph; Jon-And, Kerstin; Jones, Roger; Jones, Samuel David; Jones, Sarah; Jones, Tim; Jongmanns, Jan; Jorge, Pedro; Jovicevic, Jelena; Ju, Xiangyang; Juste Rozas, Aurelio; Kaczmarska, Anna; Kado, Marumi; Kagan, Harris; Kagan, Michael; Kahn, Sebastien Jonathan; Kaji, Toshiaki; Kajomovitz, Enrique; Kalderon, Charles William; Kaluza, Adam; Kama, Sami; Kamenshchikov, Andrey; Kanjir, Luka; Kano, Yuya; Kantserov, Vadim; Kanzaki, Junichi; Kaplan, Benjamin; Kaplan, Laser Seymour; Kar, Deepak; Karakostas, Konstantinos; Karastathis, Nikolaos; Kareem, Mohammad Jawad; Karentzos, Efstathios; Karpov, Sergey; Karpova, Zoya; Kartvelishvili, Vakhtang; Karyukhin, Andrey; Kasahara, Kota; Kashif, Lashkar; Kass, Richard; Kastanas, Alex; Kataoka, Yousuke; Kato, Chikuma; Katre, Akshay; Katzy, Judith; Kawade, Kentaro; Kawagoe, Kiyotomo; Kawamoto, Tatsuo; Kawamura, Gen; Kay, Ellis; Kazanin, Vassili; Keeler, Richard; Kehoe, Robert; Keller, John; Kellermann, Edgar; Kempster, Jacob Julian; Kendrick, James; Keoshkerian, Houry; Kepka, Oldrich; Ker\\v{s}evan, Borut Paul; Kersten, Susanne; Keyes, Robert; Khader, Mazin; Khalil-zada, Farkhad; Khanov, Alexander; Kharlamov, Alexey; Kharlamova, Tatyana; Khodinov, Alexander; Khoo, Teng Jian; Khovanskiy, Valery; Khramov, Evgeniy; Khubua, Jemal; Kido, Shogo; Kiehn, Moritz; Kilby, Callum; Kim, Hee Yeun; Kim, Shinhong; Kim, Young-Kee; Kimura, Naoki; Kind, Oliver Maria; King, Barry; Kirchmeier, David; Kirk, Julie; Kiryunin, Andrey; Kishimoto, Tomoe; Kisielewska, Danuta; Kitali, Vincent; Kivernyk, Oleh; Kladiva, Eduard; Klapdor-Kleingrothaus, Thorwald; Klein, Matthew Henry; Klein, Max; Klein, Uta; Kleinknecht, Konrad; Klimek, Pawel; Klimentov, Alexei; Klingenberg, Reiner; Klingl, Tobias; Klioutchnikova, Tatiana; Klitzner, Felix Fidelio; Kluge, Eike-Erik; Kluit, Peter; Kluth, Stefan; Kneringer, Emmerich; Knoops, Edith; Knue, Andrea; Kobayashi, Aine; Kobayashi, Dai; Kobayashi, Tomio; Kobel, Michael; Kocian, Martin; Kodys, Peter; Koffas, Thomas; Koffeman, Els; K\\"ohler, Nicolas Maximilian; Koi, Tatsumi; Kolb, Mathis; Koletsou, Iro; Kondo, Takahiko; Kondrashova, Nataliia; K\\"oneke, Karsten; K\\"onig, Adriaan; Kono, Takanori; Konoplich, Rostislav; Konstantinidis, Nikolaos; Konya, Balazs; Kopeliansky, Revital; Koperny, Stefan; Korcyl, Krzysztof; Kordas, Kostantinos; Korn, Andreas; Korolkov, Ilya; Korolkova, Elena; Kortner, Oliver; Kortner, Sandra; Kosek, Tomas; Kostyukhin, Vadim; Kotwal, Ashutosh; Koulouris, Aimilianos; Kourkoumeli-Charalampidi, Athina; Kourkoumelis, Christine; Kourlitis, Evangelos; Kouskoura, Vasiliki; Kowalewska, Anna Bozena; Kowalewski, Robert Victor; Kowalski, Tadeusz; Kozakai, Chihiro; Kozanecki, Witold; Kozhin, Anatoly; Kramarenko, Viktor; Kramberger, Gregor; Krasnopevtsev, Dimitrii; Krasny, Mieczyslaw Witold; Krasznahorkay, Attila; Krauss, Dominik; Kremer, Jakub Andrzej; Kretzschmar, Jan; Kreutzfeldt, Kristof; Krieger, Peter; Krizka, Karol; Kroeninger, Kevin; Kroha, Hubert; Kroll, Jiri; Kroll, Joe; Kroseberg, Juergen; Krstic, Jelena; Kruchonak, Uladzimir; Kr\\"uger, Hans; Krumnack, Nils; Kruse, Mark; Kubota, Takashi; Kucuk, Hilal; Kuday, Sinan; Kuechler, Jan Thomas; Kuehn, Susanne; Kugel, Andreas; Kuger, Fabian; Kuhl, Thorsten; Kukhtin, Victor; Kukla, Romain; Kulchitsky, Yuri; Kuleshov, Sergey; Kulinich, Yakov Petrovich; Kuna, Marine; Kunigo, Takuto; Kupco, Alexander; Kupfer, Tobias; Kuprash, Oleg; Kurashige, Hisaya; Kurchaninov, Leonid; Kurochkin, Yurii; Kurth, Matthew Glenn; Kuwertz, Emma Sian; Kuze, Masahiro; Kvita, Jiri; Kwan, Tony; La Rosa, Alessandro; La Rosa Navarro, Jose Luis; La Rotonda, Laura; La Ruffa, Francesco; Lacasta, Carlos; Lacava, Francesco; Lacey, James; Lack, David Philip John; Lacker, Heiko; Lacour, Didier; Ladygin, Evgueni; Lafaye, Remi; Laforge, Bertrand; Lai, Stanley; Lammers, Sabine; Lampl, Walter; Lan\\c con, Eric; Landgraf, Ulrich; Landon, Murrough; Lanfermann, Marie Christine; Lang, Valerie Susanne; Lange, J \\"{o}rn Christian; Langenberg, Robert Johannes; Lankford, Andrew; Lanni, Francesco; Lantzsch, Kerstin; Lanza, Agostino; Lapertosa, Alessandro; Laplace, Sandrine; Laporte, Jean-Francois; Lari, Tommaso; Lasagni Manghi, Federico; Lassnig, Mario; Lau, Tak Shun; Laurelli, Paolo; Law, Alexander; Laycock, Paul; Lazovich, Tomo; Lazzaroni, Massimo; Le, Brian; Le Dortz, Olivier; Le Guirriec, Emmanuel; Le Quilleuc, Eloi; LeBlanc, Matthew Edgar; LeCompte, Thomas; Ledroit-Guillon, Fabienne; Lee, Claire Alexandra; Lee, Graham Richard; Lee, Shih-Chang; Lee, Lawrence; Lefebvre, Benoit; Lefebvre, Guillaume; Lefebvre, Michel; Legger, Federica; Leggett, Charles; Lehmann Miotto, Giovanna; Lei, Xiaowen; Leight, William Axel; Leite, Marco Aurelio Lisboa; Leitner, Rupert; Lellouch, Daniel; Lemmer, Boris; Leney, Katharine; Lenz, Tatjana; Lenzi, Bruno; Leone, Robert; Leone, Sandra; Leonidopoulos, Christos; Lerner, Giuseppe; Leroy, Claude; Les, Robert; Lesage, Arthur; Lester, Christopher; Levchenko, Mikhail; Lev\\^eque, Jessica; Levin, Daniel; Levinson, Lorne; Levy, Mark; Lewis, Dave; Li, Bing; Li, Changqiao; Li, Haifeng; Li, Liang; Li, Qi; Li, Quanyin; Li, Shu; Li, Xingguo; Li, Yichen; Liang, Zhijun; Liberti, Barbara; Liblong, Aaron; Lie, Ki; Limosani, Antonio; Lin, Chiao-ying; Lin, Kuan-yu; Lin, Simon; Lin, Tai-Hua; Linck, Rebecca Anne; Lindquist, Brian Edward; Lionti, Anthony Eric; Lipeles, Elliot; Lipniacka, Anna; Lisovyi, Mykhailo; Liss, Tony; Lister, Alison; Litke, Alan; Liu, Bo; Liu, Hao; Liu, Hongbin; Liu, Jesse; Liu, Jianbei; Liu, Kun; Liu, Lulu; Liu, Minghui; Liu, Yanlin; Liu, Yanwen; Livan, Michele; Lleres, Annick; Llorente Merino, Javier; Lloyd, Stephen; Lo, Cheuk Yee; Lo Sterzo, Francesco; Lobodzinska, Ewelina Maria; Loch, Peter; Loebinger, Fred; Loesle, Alena; Loew, Kevin Michael; Lohse, Thomas; Lohwasser, Kristin; Lokajicek, Milos; Long, Brian Alexander; Long, Jonathan David; Long, Robin Eamonn; Longo, Luigi; Looper, Kristina Anne; Lopez, Jorge; Lopez Paz, Ivan; Lopez Solis, Alvaro; Lorenz, Jeanette; Lorenzo Martinez, Narei; Losada, Marta; L{\\"o}sel, Philipp Jonathan; Lou, XinChou; Lounis, Abdenour; Love, Jeremy; Love, Peter; Lu, Haonan; Lu, Nan; Lu, Yun-Ju; Lubatti, Henry; Luci, Claudio; Lucotte, Arnaud; Luedtke, Christian; Luehring, Frederick; Lukas, Wolfgang; Luminari, Lamberto; Lund-Jensen, Bengt; Lutz, Margaret Susan; Luzi, Pierre Marc; Lynn, David; Lysak, Roman; Lytken, Else; Lyu, Feng; Lyubushkin, Vladimir; Ma, Hong; Ma, Lian Liang; Ma, Yanhui; Maccarrone, Giovanni; Macchiolo, Anna; Macdonald, Calum Michael; Ma\\v{c}ek, Bo\\v{s}tjan; Machado Miguens, Joana; Madaffari, Daniele; Madar, Romain; Mader, Wolfgang; Madsen, Alexander; Madysa, Nico; Maeda, Junpei; Maeland, Steffen; Maeno, Tadashi; Maevskiy, Artem; Magerl, Veronika; Maiani, Camilla; Maidantchik, Carmen; Maier, Thomas; Maio, Am\\'elia; Majersky, Oliver; Majewski, Stephanie; Makida, Yasuhiro; Makovec, Nikola; Malaescu, Bogdan; Malecki, Pawel; Maleev, Victor; Malek, Fairouz; Mallik, Usha; Malon, David; Malone, Claire; Maltezos, Stavros; Malyukov, Sergei; Mamuzic, Judita; Mancini, Giada; Mandi\\'{c}, Igor; Maneira, Jos\\'e; Manhaes de Andrade Filho, Luciano; Manjarres Ramos, Joany; Mankinen, Katja Hannele; Mann, Alexander; Manousos, Athanasios; Mansoulie, Bruno; Mansour, Jason Dhia; Mantifel, Rodger; Mantoani, Matteo; Manzoni, Stefano; Mapelli, Livio; Marceca, Gino; March, Luis; Marchese, Luigi; Marchiori, Giovanni; Marcisovsky, Michal; Marin Tobon, Cesar Augusto; Marjanovic, Marija; Marley, Daniel; Marroquim, Fernando; Marsden, Stephen Philip; Marshall, Zach; Martensson, Mikael; Marti-Garcia, Salvador; Martin, Christopher Blake; Martin, Tim; Martin, Victoria Jane; Martin dit Latour, Bertrand; Martinez, Mario; Martinez Outschoorn, Verena; Martin-Haugh, Stewart; Martoiu, Victor Sorin; Martyniuk, Alex; Marzin, Antoine; Masetti, Lucia; Mashimo, Tetsuro; Mashinistov, Ruslan; Masik, Jiri; Maslennikov, Alexey; Mason, Lara Hannan; Massa, Lorenzo; Mastrandrea, Paolo; Mastroberardino, Anna; Masubuchi, Tatsuya; M\\"attig, Peter; Maurer, Julien; Maxfield, Stephen; Maximov, Dmitriy; Mazini, Rachid; Maznas, Ioannis; Mazza, Simone Michele; Mc Fadden, Neil Christopher; Mc Goldrick, Garrin; Mc Kee, Shawn Patrick; McCarn, Allison; McCarthy, Robert; McCarthy, Thomas; McClymont, Laurie; McDonald, Emily; Mcfayden, Josh; Mchedlidze, Gvantsa; McMahon, Steve; McNamara, Peter Charles; McNicol, Christopher John; McPherson, Robert; Meadows, Zachary Alden; Meehan, Samuel; Megy, Theo Jean; Mehlhase, Sascha; Mehta, Andrew; Meideck, Thomas; Meier, Karlheinz; Meirose, Bernhard; Melini, Davide; Mellado Garcia, Bruce Rafael; Mellenthin, Johannes Donatus; Melo, Matej; Meloni, Federico; Melzer, Alexander; Menary, Stephen Burns; Meng, Lingxin; Meng, Xiangting; Mengarelli, Alberto; Menke, Sven; Meoni, Evelin; Mergelmeyer, Sebastian; Merlassino, Claudia; Mermod, Philippe; Merola, Leonardo; Meroni, Chiara; Merritt, Frank; Messina, Andrea; Metcalfe, Jessica; Mete, Alaettin Serhan; Meyer, Christopher; Meyer, Jean-Pierre; Meyer, Jochen; Meyer Zu Theenhausen, Hanno; Miano, Fabrizio; Middleton, Robin; Miglioranzi, Silvia; Mijovi\\'{c}, Liza; Mikenberg, Giora; Mikestikova, Marcela; Miku\\v{z}, Marko; Milesi, Marco; Milic, Adriana; Millar, Declan Andrew; Miller, David; Milov, Alexander; Milstead, David; Minaenko, Andrey; Minashvili, Irakli; Mincer, Allen; Mindur, Bartosz; Mineev, Mikhail; Minegishi, Yuji; Ming, Yao; Mir, Lluisa-Maria; Mirto, Alessandro; Mistry, Khilesh; Mitani, Takashi; Mitrevski, Jovan; Mitsou, Vasiliki A; Miucci, Antonio; Miyagawa, Paul; Mizukami, Atsushi; Mj\\"ornmark, Jan-Ulf; Mkrtchyan, Tigran; Mlynarikova, Michaela; Moa, Torbjoern; Mochizuki, Kazuya; Mogg, Philipp; Mohapatra, Soumya; Molander, Simon; Moles-Valls, Regina; Mondragon, Matthew Craig; M\\"onig, Klaus; Monk, James; Monnier, Emmanuel; Montalbano, Alyssa; Montejo Berlingen, Javier; Monticelli, Fernando; Monzani, Simone; Moore, Roger; Morange, Nicolas; Moreno, Deywis; Moreno Ll\\'acer, Mar\\'ia; Morettini, Paolo; Morgenstern, Marcus; Morgenstern, Stefanie; Mori, Daniel; Mori, Tatsuya; Morii, Masahiro; Morinaga, Masahiro; Morisbak, Vanja; Morley, Anthony Keith; Mornacchi, Giuseppe; Morris, John; Morvaj, Ljiljana; Moschovakos, Paris; Mosidze, Maia; Moss, Harry James; Moss, Josh; Motohashi, Kazuki; Mount, Richard; Mountricha, Eleni; Moyse, Edward; Muanza, Steve; Mueller, Felix; Mueller, James; Mueller, Ralph Soeren Peter; Muenstermann, Daniel; Mullen, Paul; Mullier, Geoffrey; Munoz Sanchez, Francisca Javiela; Murray, Bill; Musheghyan, Haykuhi; Mu\\v{s}kinja, Miha; Mwewa, Chilufya; Myagkov, Alexey; Myers, John; Myska, Miroslav; Nachman, Benjamin Philip; Nackenhorst, Olaf; Nagai, Koichi; Nagai, Ryo; Nagano, Kunihiro; Nagasaka, Yasushi; Nagata, Kazuki; Nagel, Martin; Nagy, Elemer; Nairz, Armin Michael; Nakahama, Yu; Nakamura, Koji; Nakamura, Tomoaki; Nakano, Itsuo; Naranjo Garcia, Roger Felipe; Narayan, Rohin; Narrias Villar, Daniel Isaac; Naryshkin, Iouri; Naumann, Thomas; Navarro, Gabriela; Nayyar, Ruchika; Neal, Homer; Nechaeva, Polina; Neep, Thomas James; Negri, Andrea; Negrini, Matteo; Nektarijevic, Snezana; Nellist, Clara; Nelson, Andrew; Nelson, Michael Edward; Nemecek, Stanislav; Nemethy, Peter; Nessi, Marzio; Neubauer, Mark; Neumann, Manuel; Newman, Paul; Ng, Tsz Yu; Ng, Sam Yanwing; Nguyen Manh, Tuan; Nickerson, Richard; Nicolaidou, Rosy; Nielsen, Jason; Nikiforou, Nikiforos; Nikolaenko, Vladimir; Nikolic-Audit, Irena; Nikolopoulos, Konstantinos; Nilsson, Paul; Ninomiya, Yoichi; Nisati, Aleandro; Nishu, Nishu; Nisius, Richard; Nitsche, Isabel; Nitta, Tatsumi; Nobe, Takuya; Noguchi, Yohei; Nomachi, Masaharu; Nomidis, Ioannis; Nomura, Marcelo Ayumu; Nooney, Tamsin; Nordberg, Markus; Norjoharuddeen, Nurfikri; Novgorodova, Olga; Novotny, Radek; Nozaki, Mitsuaki; Nozka, Libor; Ntekas, Konstantinos; Nurse, Emily; Nuti, Francesco; O'Connor, Kelsey; O'Neil, Dugan; O'Rourke, Abigail Alexandra; O'Shea, Val; Oakham, Gerald; Oberlack, Horst; Obermann, Theresa; Ocariz, Jose; Ochi, Atsuhiko; Ochoa, Ines; Ochoa-Ricoux, Juan Pedro; Oda, Susumu; Odaka, Shigeru; Oh, Alexander; Oh, Seog; Ohm, Christian; Ohman, Henrik; Oide, Hideyuki; Okawa, Hideki; Okumura, Yasuyuki; Okuyama, Toyonobu; Olariu, Albert; Oleiro Seabra, Luis Filipe; Olivares Pino, Sebastian Andres; Oliveira Damazio, Denis; Oliver, Jason; Olsson, Joakim; Olszewski, Andrzej; Olszowska, Jolanta; Onofre, Ant\\'onio; Onogi, Kouta; Onyisi, Peter; Oppen, Henrik; Oreglia, Mark; Oren, Yona; Orestano, Domizia; Orgill, Emily Claire; Orlando, Nicola; Orr, Robert; Osculati, Bianca; Ospanov, Rustem; Otero y Garzon, Gustavo; Otono, Hidetoshi; Ouchrif, Mohamed; Ould-Saada, Farid; Ouraou, Ahmimed; Oussoren, Koen Pieter; Ouyang, Qun; Owen, Mark; Owen, Rhys Edward; Ozcan, Veysi Erkcan; Ozturk, Nurcan; Pachal, Katherine; Pacheco Pages, Andres; Pacheco Rodriguez, Laura; Padilla Aranda, Cristobal; Pagan Griso, Simone; Paganini, Michela; Paige, Frank; Palacino, Gabriel; Palazzo, Serena; Palestini, Sandro; Palka, Marek; Pallin, Dominique; Panagiotopoulou, Evgenia; Panagoulias, Ilias; Pandini, Carlo Enrico; Panduro Vazquez, William; Pani, Priscilla; Panitkin, Sergey; Pantea, Dan; Paolozzi, Lorenzo; Papadopoulou, Theodora; Papageorgiou, Konstantinos; Paramonov, Alexander; Paredes Hernandez, Daniela; Parker, Adam Jackson; Parker, Michael Andrew; Parker, Kerry Ann; Parodi, Fabrizio; Parsons, John; Parzefall, Ulrich; Pascuzzi, Vincent; Pasner, Jacob Martin; Pasqualucci, Enrico; Passaggio, Stefano; Pastore, Francesca; Pataraia, Sophio; Pater, Joleen; Pauly, Thilo; Pearson, Benjamin; Pedraza Lopez, Sebastian; Pedro, Rute; Peleganchuk, Sergey; Penc, Ondrej; Peng, Cong; Peng, Haiping; Penwell, John; Peralva, Bernardo; Perego, Marta Maria; Perepelitsa, Dennis; Peri, Francesco; Perini, Laura; Pernegger, Heinz; Perrella, Sabrina; Peschke, Richard; Peshekhonov, Vladimir; Peters, Krisztian; Peters, Yvonne; Petersen, Brian; Petersen, Troels; Petit, Elisabeth; Petridis, Andreas; Petridou, Chariclia; Petroff, Pierre; Petrolo, Emilio; Petrov, Mariyan; Petrucci, Fabrizio; Pettersson, Nora Emilia; Peyaud, Alan; Pezoa, Raquel; Pham, Thu; Phillips, Forrest Hays; Phillips, Peter William; Piacquadio, Giacinto; Pianori, Elisabetta; Picazio, Attilio; Pickering, Mark Andrew; Piegaia, Ricardo; Pilcher, James; Pilkington, Andrew; Pinamonti, Michele; Pinfold, James; Pirumov, Hayk; Pitt, Michael; Pleier, Marc-Andre; Pleskot, Vojtech; Plotnikova, Elena; Pluth, Daniel; Podberezko, Pavel; Poettgen, Ruth; Poggi, Riccardo; Poggioli, Luc; Pogrebnyak, Ivan; Pohl, David-leon; Pokharel, Ishan; Polesello, Giacomo; Poley, Anne-luise; Policicchio, Antonio; Polifka, Richard; Polini, Alessandro; Pollard, Christopher Samuel; Polychronakos, Venetios; Pomm\\`es, Kathy; Ponomarenko, Daniil; Pontecorvo, Ludovico; Popeneciu, Gabriel Alexandru; Portillo Quintero, Dilia Mar\\'ia; Pospisil, Stanislav; Potamianos, Karolos; Potrap, Igor; Potter, Christina; Potti, Harish; Poulsen, Trine; Poveda, Joaquin; Pozo Astigarraga, Mikel Eukeni; Pralavorio, Pascal; Prell, Soeren; Price, Darren; Primavera, Margherita; Prince, Sebastien; Proklova, Nadezda; Prokofiev, Kirill; Prokoshin, Fedor; Protopopescu, Serban; Proudfoot, James; Przybycien, Mariusz; Puri, Akshat; Puzo, Patrick; Qian, Jianming; Qin, Yang; Quadt, Arnulf; Queitsch-Maitland, Michaela; Quilty, Donnchadha; Raddum, Silje; Radeka, Veljko; Radescu, Voica; Radhakrishnan, Sooraj Krishnan; Radloff, Peter; Rados, Pere; Ragusa, Francesco; Rahal, Ghita; Raine, John Andrew; Rajagopalan, Srinivasan; Rashid, Tasneem; Raspopov, Sergii; Ratti, Maria Giulia; Rauch, Daniel; Rauscher, Felix; Rave, Stefan; Ravinovich, Ilia; Rawling, Jacob Henry; Raymond, Michel; Read, Alexander Lincoln; Readioff, Nathan Peter; Reale, Marilea; Rebuzzi, Daniela; Redelbach, Andreas; Redlinger, George; Reece, Ryan; Reed, Robert; Reeves, Kendall; Rehnisch, Laura; Reichert, Joseph; Reiss, Andreas; Rembser, Christoph; Ren, Huan; Rescigno, Marco; Resconi, Silvia; Resseguie, Elodie Deborah; Rettie, Sebastien; Reynolds, Elliot; Rezanova, Olga; Reznicek, Pavel; Rezvani, Reyhaneh; Richter, Robert; Richter, Stefan; Richter-Was, Elzbieta; Ricken, Oliver; Ridel, Melissa; Rieck, Patrick; Riegel, Christian Johann; Rieger, Julia; Rifki, Othmane; Rijssenbeek, Michael; Rimoldi, Adele; Rimoldi, Marco; Rinaldi, Lorenzo; Ripellino, Giulia; Risti\\'{c}, Branislav; Ritsch, Elmar; Riu, Imma; Rivera Vergara, Juan Cristobal; Rizatdinova, Flera; Rizvi, Eram; Rizzi, Chiara; Roberts, Rhys Thomas; Robertson, Steven; Robichaud-Veronneau, Andree; Robinson, Dave; Robinson, James; Robson, Aidan; Rocco, Elena; Roda, Chiara; Rodina, Yulia; Rodriguez Bosca, Sergi; Rodriguez Perez, Andrea; Rodriguez Rodriguez, Daniel; Rodr\\'iguez Vera, Ana Mar\\'ia; Roe, Shaun; Rogan, Christopher Sean; R{\\o}hne, Ole; Roloff, Jennifer; Romaniouk, Anatoli; Romano, Marino; Romano Saez, Silvestre Marino; Romero Adam, Elena; Rompotis, Nikolaos; Ronzani, Manfredi; Roos, Lydia; Rosati, Stefano; Rosbach, Kilian; Rose, Peyton; Rosien, Nils-Arne; Rossi, Elvira; Rossi, Leonardo Paolo; Rosten, Jonatan; Rosten, Rachel; Rotaru, Marina; Rothberg, Joseph; Rousseau, David; Roy, Debarati; Rozanov, Alexandre; Rozen, Yoram; Ruan, Xifeng; Rubbo, Francesco; R\\"uhr, Frederik; Ruiz-Martinez, Aranzazu; Rurikova, Zuzana; Rusakovich, Nikolai; Russell, Heather; Rutherfoord, John; Ruthmann, Nils; R{\\"u}ttinger, Elias Michael; Ryabov, Yury; Rybar, Martin; Rybkin, Grigori; Ryu, Soo; Ryzhov, Andrey; Rzehorz, Gerhard Ferdinand; Saavedra, Aldo; Sabato, Gabriele; Sacerdoti, Sabrina; Sadrozinski, Hartmut; Sadykov, Renat; Safai Tehrani, Francesco; Saha, Puja; Sahinsoy, Merve; Saimpert, Matthias; Saito, Masahiko; Saito, Tomoyuki; Sakamoto, Hiroshi; Sakurai, Yuki; Salamanna, Giuseppe; Salazar Loyola, Javier Esteban; Salek, David; Sales De Bruin, Pedro Henrique; Salihagic, Denis; Salnikov, Andrei; Salt, Jos\\'e; Salvatore, Daniela; Salvatore, Pasquale Fabrizio; Salvucci, Antonio; Salzburger, Andreas; Sammel, Dirk; Sampsonidis, Dimitrios; Sampsonidou, Despoina; S\\'anchez, Javier; Sanchez Pineda, Arturo Rodolfo; Sandaker, Heidi; Sandbach, Ruth Laura; Sander, Christian Oliver; Sandhoff, Marisa; Sandoval, Carlos; Sankey, Dave; Sannino, Mario; Sano, Yuta; Sansoni, Andrea; Santoni, Claudio; Santos, Helena; Santoyo Castillo, Itzebelt; Sapronov, Andrey; Saraiva, Jo\\~ao; Sasaki, Osamu; Sato, Koji; Sauvan, Emmanuel; Savage, Graham; Savard, Pierre; Savic, Natascha; Sawada, Ryu; Sawyer, Craig; Sawyer, Lee; Sbarra, Carla; Sbrizzi, Antonio; Scanlon, Tim; Scannicchio, Diana; Schaarschmidt, Jana; Schacht, Peter; Schachtner, Balthasar Maria; Schaefer, Douglas; Schaefer, Leigh; Schaeffer, Jan; Schaepe, Steffen; Sch\\"afer, Uli; Schaffer, Arthur; Schaile, Dorothee; Schamberger, R Dean; Schegelsky, Valery; Scheirich, Daniel; Schenck, Ferdinand; Schernau, Michael; Schiavi, Carlo; Schier, Sheena; Schildgen, Lara Katharina; Schillo, Christian; Schioppa, Enrico Junior; Schioppa, Marco; Schlenker, Stefan; Schmidt-Sommerfeld, Korbinian Ralf; Schmieden, Kristof; Schmitt, Christian; Schmitt, Stefan; Schmitz, Simon; Schnoor, Ulrike; Schoeffel, Laurent; Schoening, Andre; Schoenrock, Bradley Daniel; Schopf, Elisabeth; Schott, Matthias; Schouwenberg, Jeroen; Schovancova, Jaroslava; Schramm, Steven; Schuh, Natascha; Schulte, Alexandra; Schultens, Martin Johannes; Schultz-Coulon, Hans-Christian; Schumacher, Markus; Schumm, Bruce; Schune, Philippe; Schwartzman, Ariel; Schwarz, Thomas Andrew; Schweiger, Hansdieter; Schwemling, Philippe; Schwienhorst, Reinhard; Schwindling, Jerome; Sciandra, Andrea; Sciolla, Gabriella; Scornajenghi, Matteo; Scuri, Fabrizio; Scutti, Federico; Searcy, Jacob; Seema, Pienpen; Seidel, Sally; Seiden, Abraham; Seixas, Jos\\'e; Sekhniaidze, Givi; Sekhon, Karishma; Sekula, Stephen; Semprini-Cesari, Nicola; Senkin, Sergey; Serfon, Cedric; Serin, Laurent; Serkin, Leonid; Sessa, Marco; Seuster, Rolf; Severini, Horst; \\v{S}filigoj, Tina; Sforza, Federico; Sfyrla, Anna; Shabalina, Elizaveta; Shaikh, Nabila Wahab; Shan, Lianyou; Shang, Ruo-yu; Shank, James; Shapiro, Marjorie; Shatalov, Pavel; Shaw, Kate; Shaw, Savanna Marie; Shcherbakova, Anna; Shehu, Ciwake Yusufu; Shen, Yu-Ting; Sherafati, Nima; Sherman, Alexander David; Sherwood, Peter; Shi, Liaoshan; Shimizu, Shima; Shimmin, Chase Owen; Shimojima, Makoto; Shipsey, Ian Peter Joseph; Shirabe, Shohei; Shiyakova, Mariya; Shlomi, Jonathan; Shmeleva, Alevtina; Shoaleh Saadi, Diane; Shochet, Mel; Shojaii, Seyed Ruhollah; Shope, David Richard; Shrestha, Suyog; Shulga, Evgeny; Shupe, Michael; Sicho, Petr; Sickles, Anne Marie; Sidebo, Per Edvin; Sideras Haddad, Elias; Sidiropoulou, Ourania; Sidoti, Antonio; Siegert, Frank; Sijacki, Djordje; Silva, Jos\\'e; Silva Jr, Manuel; Silverstein, Samuel; Simak, Vladislav; Simic, Ljiljana; Simion, Stefan; Simioni, Eduard; Simmons, Brinick; Simon, Manuel; Sinervo, Pekka; Sinev, Nikolai; Sioli, Maximiliano; Siragusa, Giovanni; Siral, Ismet; Sivoklokov, Serguei; Sj\\"{o}lin, J\\"{o}rgen; Skinner, Malcolm Bruce; Skubic, Patrick; Slater, Mark; Slavicek, Tomas; Slawinska, Magdalena; Sliwa, Krzysztof; Slovak, Radim; Smakhtin, Vladimir; Smart, Ben; Smiesko, Juraj; Smirnov, Nikita; Smirnov, Sergei; Smirnov, Yury; Smirnova, Lidia; Smirnova, Oxana; Smith, Joshua Wyatt; Smith, Matthew; Smith, Russell; Smizanska, Maria; Smolek, Karel; Snesarev, Andrei; Snyder, Ian Michael; Snyder, Scott; Sobie, Randall; Socher, Felix; Soffa, Aaron Michael; Soffer, Abner; S{\\o}gaard, Andreas; Soh, Dart-yin; Sokhrannyi, Grygorii; Solans Sanchez, Carlos; Solar, Michael; Soldatov, Evgeny; Soldevila, Urmila; Solodkov, Alexander; Soloshenko, Alexei; Solovyanov, Oleg; Solovyev, Victor; Sommer, Philip; Son, Hyungsuk; Song, Weimin; Sopczak, Andre; Sosa, David; Sotiropoulou, Calliope Louisa; Sottocornola, Simone; Soualah, Rachik; Soukharev, Andrey; South, David; Sowden, Benjamin; Spagnolo, Stefania; Spalla, Margherita; Spangenberg, Martin; Span\\`o, Francesco; Sperlich, Dennis; Spettel, Fabian; Spieker, Thomas Malte; Spighi, Roberto; Spigo, Giancarlo; Spiller, Laurence Anthony; Spousta, Martin; St Denis, Richard Dante; Stabile, Alberto; Stamen, Rainer; Stamm, Soren; Stanecka, Ewa; Stanek, Robert; Stanescu, Cristian; Stanitzki, Marcel Michael; Stapf, Birgit Sylvia; Stapnes, Steinar; Starchenko, Evgeny; Stark, Giordon; Stark, Jan; Stark, Simon Holm; Staroba, Pavel; Starovoitov, Pavel; St\\"arz, Steffen; Staszewski, Rafal; Stegler, Martin; Steinberg, Peter; Stelzer, Bernd; Stelzer, Harald Joerg; Stelzer-Chilton, Oliver; Stenzel, Hasko; Stevenson, Thomas James; Stewart, Graeme; Stockton, Mark; Stoebe, Michael; Stoicea, Gabriel; Stolte, Philipp; Stonjek, Stefan; Stradling, Alden; Straessner, Arno; Stramaglia, Maria Elena; Strandberg, Jonas; Strandberg, Sara; Strauss, Michael; Strizenec, Pavol; Str\\"ohmer, Raimund; Strom, David; Stroynowski, Ryszard; Strubig, Antonia; Stucci, Stefania Antonia; Stugu, Bjarne; Styles, Nicholas Adam; Su, Dong; Su, Jun; Suchek, Stanislav; Sugaya, Yorihito; Suk, Michal; Sulin, Vladimir; Sultan, D M S; Sultansoy, Saleh; Sumida, Toshi; Sun, Siyuan; Sun, Xiaohu; Suruliz, Kerim; Suster, Carl; Sutton, Mark; Suzuki, Shota; Svatos, Michal; Swiatlowski, Maximilian; Swift, Stewart Patrick; Sydorenko, Alexander; Sykora, Ivan; Sykora, Tomas; Ta, Duc; Tackmann, Kerstin; Taenzer, Joe; Taffard, Anyes; Tafirout, Reda; Tahirovic, Elvedin; Taiblum, Nimrod; Takai, Helio; Takashima, Ryuichi; Takasugi, Eric Hayato; Takeda, Kosuke; Takeshita, Tohru; Takubo, Yosuke; Talby, Mossadek; Talyshev, Alexey; Tanaka, Junichi; Tanaka, Masahiro; Tanaka, Reisaburo; Tanioka, Ryo; Tannenwald, Benjamin Bordy; Tapia Araya, Sebastian; Tapprogge, Stefan; Tarem, Shlomit; Tartarelli, Giuseppe Francesco; Tas, Petr; Tasevsky, Marek; Tashiro, Takuya; Tassi, Enrico; Tavares Delgado, Ademar; Tayalati, Yahya; Taylor, Aaron; Taylor, Alan James; Taylor, Geoffrey; Taylor, Pierre Thor Elliot; Taylor, Wendy; Teixeira-Dias, Pedro; Temple, Darren; Ten Kate, Herman; Teng, Ping-Kun; Teoh, Jia Jian; Tepel, Fabian-Phillipp; Terada, Susumu; Terashi, Koji; Terron, Juan; Terzo, Stefano; Testa, Marianna; Teuscher, Richard; Thais, Savannah Jennifer; Theveneaux-Pelzer, Timoth\\'ee; Thiele, Fabian; Thomas, Juergen; Thomas-Wilsker, Joshuha; Thompson, Paul; Thompson, Stan; Thomsen, Lotte Ansgaard; Thomson, Evelyn; Tian, Yun; Ticse Torres, Royer Edson; Tikhomirov, Vladimir; Tikhonov, Yury; Timoshenko, Sergey; Tipton, Paul; Tisserant, Sylvain; Todome, Kazuki; Todorova-Nova, Sharka; Todt, Stefanie; Tojo, Junji; Tok\\'ar, Stanislav; Tokushuku, Katsuo; Tolley, Emma; Tomlinson, Lee; Tomoto, Makoto; Tompkins, Lauren; Toms, Konstantin; Tong, Baojia(Tony); Tornambe, Peter; Torrence, Eric; Torres, Heberth; Torr\\'o Pastor, Emma; Toth, Jozsef; Touchard, Francois; Tovey, Daniel; Treado, Colleen Jennifer; Trefzger, Thomas; Tresoldi, Fabio; Tricoli, Alessandro; Trigger, Isabel Marian; Trincaz-Duvoid, Sophie; Tripiana, Martin; Trischuk, William; Trocm\\'e, Benjamin; Trofymov, Artur; Troncon, Clara; Trovatelli, Monica; Truong, Loan; Trzebinski, Maciej; Trzupek, Adam; Tsang, Ka Wa; Tseng, Jeffrey; Tsiareshka, Pavel; Tsirintanis, Nikolaos; Tsiskaridze, Shota; Tsiskaridze, Vakhtang; Tskhadadze, Edisher; Tsukerman, Ilya; Tsulaia, Vakhtang; Tsuno, Soshi; Tsybychev, Dmitri; Tu, Yanjun; Tudorache, Alexandra; Tudorache, Valentina; Tulbure, Traian Tiberiu; Tuna, Alexander Naip; Turchikhin, Semen; Turgeman, Daniel; Turk Cakir, Ilkay; Turra, Ruggero; Tuts, Michael; Ucchielli, Giulia; Ueda, Ikuo; Ughetto, Michael; Ukegawa, Fumihiko; Unal, Guillaume; Undrus, Alexander; Unel, Gokhan; Ungaro, Francesca; Unno, Yoshinobu; Uno, Kenta; Urban, Jozef; Urquijo, Phillip; Urrejola, Pedro; Usai, Giulio; Usui, Junya; Vacavant, Laurent; Vacek, Vaclav; Vachon, Brigitte; Vadla, Knut Oddvar Hoie; Vaidya, Amal; Valderanis, Chrysostomos; Valdes Santurio, Eduardo; Valente, Marco; Valentinetti, Sara; Valero, Alberto; Val\\'ery, Lo\\"ic; Vallier, Alexis; Valls Ferrer, Juan Antonio; Van Den Wollenberg, Wouter; van der Graaf, Harry; van Gemmeren, Peter; Van Nieuwkoop, Jacobus; van Vulpen, Ivo; van Woerden, Marius Cornelis; Vanadia, Marco; Vandelli, Wainer; Vaniachine, Alexandre; Vankov, Peter; Vardanyan, Gagik; Vari, Riccardo; Varnes, Erich; Varni, Carlo; Varol, Tulin; Varouchas, Dimitris; Vartapetian, Armen; Varvell, Kevin; Vasquez, Jared Gregory; Vasquez, Gerardo; Vazeille, Francois; Vazquez Furelos, David; Vazquez Schroeder, Tamara; Veatch, Jason; Veeraraghavan, Venkatesh; Veloce, Laurelle Maria; Veloso, Filipe; Veneziano, Stefano; Ventura, Andrea; Venturi, Manuela; Venturi, Nicola; Vercesi, Valerio; Verducci, Monica; Verkerke, Wouter; Vermeulen, Ambrosius Thomas; Vermeulen, Jos; Vetterli, Michel; Viaux Maira, Nicolas; Viazlo, Oleksandr; Vichou, Irene; Vickey, Trevor; Vickey Boeriu, Oana Elena; Viehhauser, Georg; Viel, Simon; Vigani, Luigi; Villa, Mauro; Villaplana Perez, Miguel; Vilucchi, Elisabetta; Vincter, Manuella; Vinogradov, Vladimir; Vishwakarma, Akanksha; Vittori, Camilla; Vivarelli, Iacopo; Vlachos, Sotirios; Vogel, Marcelo; Vokac, Petr; Volpi, Guido; von Buddenbrock, Stefan; von der Schmitt, Hans; von Toerne, Eckhard; Vorobel, Vit; Vorobev, Konstantin; Vos, Marcel; Voss, Rudiger; Vossebeld, Joost; Vranjes, Nenad; Vranjes Milosavljevic, Marija; Vrba, Vaclav; Vreeswijk, Marcel; Vuillermet, Raphael; Vukotic, Ilija; Wagner, Peter; Wagner, Wolfgang; Wagner-Kuhr, Jeannine; Wahlberg, Hernan; Wahrmund, Sebastian; Wakamiya, Kotaro; Walder, James; Walker, Rodney; Walkowiak, Wolfgang; Wallangen, Veronica; Wang, Ann Miao; Wang, Chao; Wang, Fuquan; Wang, Haichen; Wang, Hulin; Wang, Jike; Wang, Jin; Wang, Qing; Wang, Renjie; Wang, Rui; Wang, Song-Ming; Wang, Tingting; Wang, Wei; Wang, Wenxiao; Wang, Zirui; Wanotayaroj, Chaowaroj; Warburton, Andreas; Ward, Patricia; Wardrope, David Robert; Washbrook, Andrew; Watkins, Peter; Watson, Alan; Watson, Miriam; Watts, Gordon; Watts, Stephen; Waugh, Ben; Webb, Aaron Foley; Webb, Samuel; Weber, Michele; Weber, Sebastian Mario; Weber, Stephen; Webster, Jordan S; Weidberg, Anthony; Weinert, Benjamin; Weingarten, Jens; Weirich, Marcel; Weiser, Christian; Wells, Phillippa; Wenaus, Torre; Wengler, Thorsten; Wenig, Siegfried; Wermes, Norbert; Werner, Michael David; Werner, Per; Wessels, Martin; Weston, Thomas; Whalen, Kathleen; Whallon, Nikola Lazar; Wharton, Andrew Mark; White, Aaron; White, Andrew; White, Martin; White, Ryan; Whiteson, Daniel; Whitmore, Ben William; Wickens, Fred; Wiedenmann, Werner; Wielers, Monika; Wiglesworth, Craig; Wiik-Fuchs, Liv Antje Mari; Wildauer, Andreas; Wilk, Fabian; Wilkens, Henric George; Williams, Hugh; Williams, Sarah; Willis, Christopher; Willocq, Stephane; Wilson, John; Wingerter-Seez, Isabelle; Winkels, Emma; Winklmeier, Frank; Winston, Oliver James; Winter, Benedict Tobias; Wittgen, Matthias; Wobisch, Markus; Wolf, Anton; Wolf, Tim Michael Heinz; Wolff, Robert; Wolter, Marcin Wladyslaw; Wolters, Helmut; Wong, Vincent Wai Sum; Woods, Natasha Lee; Worm, Steven; Wosiek, Barbara; Wotschack, Jorg; Wozniak, Krzysztof; Wu, Miles; Wu, Sau Lan; Wu, Xin; Wu, Yusheng; Wyatt, Terry Richard; Wynne, Benjamin; Xella, Stefania; Xi, Zhaoxu; Xia, Ligang; Xu, Da; Xu, Lailin; Xu, Tairan; Xu, Wenhao; Yabsley, Bruce; Yacoob, Sahal; Yajima, Kazuki; Yallup, David; Yamaguchi, Daiki; Yamaguchi, Yohei; Yamamoto, Akira; Yamanaka, Takashi; Yamane, Fumiya; Yamatani, Masahiro; Yamazaki, Tomohiro; Yamazaki, Yuji; Yan, Zhen; Yang, Haijun; Yang, Hongtao; Yang, Siqi; Yang, Yi; Yang, Zongchang; Yao, Weiming; Yap, Yee Chinn; Yasu, Yoshiji; Yatsenko, Elena; Yau Wong, Kaven Henry; Ye, Jingbo; Ye, Shuwei; Yeletskikh, Ivan; Yigitbasi, Efe; Yildirim, Eda; Yorita, Kohei; Yoshihara, Keisuke; Young, Charles; Young, Christopher John; Yu, Jaehoon; Yu, Jie; Yuen, Stephanie P; Yusuff, Imran; Zabinski, Bartlomiej; Zacharis, Georgios; Zaidan, Remi; Zaitsev, Alexander; Zakharchuk, Nataliia; Zalieckas, Justas; Zaman, Aungshuman; Zambito, Stefano; Zanzi, Daniele; Zeitnitz, Christian; Zemaityte, Gabija; Zeng, Jian Cong; Zeng, Qi; Zenin, Oleg; \\v{Z}eni\\v{s}, Tibor; Zerwas, Dirk; Zhang, Dengfeng; Zhang, Dongliang; Zhang, Fangzhou; Zhang, Guangyi; Zhang, Huijun; Zhang, Jinlong; Zhang, Lei; Zhang, Liqing; Zhang, Matt; Zhang, Peng; Zhang, Rui; Zhang, Ruiqi; Zhang, Xueyao; Zhang, Yu; Zhang, Zhiqing; Zhao, Xiandong; Zhao, Yongke; Zhao, Zhengguo; Zhemchugov, Alexey; Zhou, Bing; Zhou, Chen; Zhou, Li; Zhou, Maosen; Zhou, Mingliang; Zhou, Ning; Zhou, You; Zhu, Cheng Guang; Zhu, Hongbo; Zhu, Junjie; Zhu, Yingchun; Zhuang, Xuai; Zhukov, Konstantin; Zibell, Andre; Zieminska, Daria; Zimine, Nikolai; Zimmermann, Stephanie; Zinonos, Zinonas; Zinser, Markus; Ziolkowski, Michael; \\v{Z}ivkovi\\'{c}, Lidija; Zobernig, Georg; Zoccoli, Antonio; Zou, Rui; zur Nedden, Martin; Zwalinski, Lukasz
2018-05-19
A search for the narrow structure, X(5568), reported by the D0 Collaboration in the decay sequence X→Bs0π±, Bs0→J/ψϕ, is presented. The analysis is based on a data sample recorded with the ATLAS detector at the LHC corresponding to 4.9 fb-1 of pp collisions at 7 TeV and 19.5 fb-1 at 8 TeV. No significant signal was found. Upper limits on the number of signal events, with properties corresponding to those reported by D0, and on the X production rate relative to Bs0 mesons, ρX, were determined at 95% confidence level. The results are N(X)<382 and ρX<0.015 for Bs0 mesons with transverse momenta above 10 GeV, and N(X)<356 and ρX<0.016 for transverse momenta above 15 GeV. Limits are also set for potential Bs0π± resonances in the mass range 5550 to 5700 MeV.
Clinician search behaviors may be influenced by search engine design.
Lau, Annie Y S; Coiera, Enrico; Zrimec, Tatjana; Compton, Paul
2010-06-30
Searching the Web for documents using information retrieval systems plays an important part in clinicians' practice of evidence-based medicine. While much research focuses on the design of methods to retrieve documents, there has been little examination of the way different search engine capabilities influence clinician search behaviors. Previous studies have shown that use of task-based search engines allows for faster searches with no loss of decision accuracy compared with resource-based engines. We hypothesized that changes in search behaviors may explain these differences. In all, 75 clinicians (44 doctors and 31 clinical nurse consultants) were randomized to use either a resource-based or a task-based version of a clinical information retrieval system to answer questions about 8 clinical scenarios in a controlled setting in a university computer laboratory. Clinicians using the resource-based system could select 1 of 6 resources, such as PubMed; clinicians using the task-based system could select 1 of 6 clinical tasks, such as diagnosis. Clinicians in both systems could reformulate search queries. System logs unobtrusively capturing clinicians' interactions with the systems were coded and analyzed for clinicians' search actions and query reformulation strategies. The most frequent search action of clinicians using the resource-based system was to explore a new resource with the same query, that is, these clinicians exhibited a "breadth-first" search behaviour. Of 1398 search actions, clinicians using the resource-based system conducted 401 (28.7%, 95% confidence interval [CI] 26.37-31.11) in this way. In contrast, the majority of clinicians using the task-based system exhibited a "depth-first" search behavior in which they reformulated query keywords while keeping to the same task profiles. Of 585 search actions conducted by clinicians using the task-based system, 379 (64.8%, 95% CI 60.83-68.55) were conducted in this way. This study provides evidence that
Mahajan, Gaurang; Mande, Shekhar C
2017-04-04
A comprehensive map of the human-M. tuberculosis (MTB) protein interactome would help fill the gaps in our understanding of the disease, and computational prediction can aid and complement experimental studies towards this end. Several sequence-based in silico approaches tap the existing data on experimentally validated protein-protein interactions (PPIs); these PPIs serve as templates from which novel interactions between pathogen and host are inferred. Such comparative approaches typically make use of local sequence alignment, which, in the absence of structural details about the interfaces mediating the template interactions, could lead to incorrect inferences, particularly when multi-domain proteins are involved. We propose leveraging the domain-domain interaction (DDI) information in PDB complexes to score and prioritize candidate PPIs between host and pathogen proteomes based on targeted sequence-level comparisons. Our method picks out a small set of human-MTB protein pairs as candidates for physical interactions, and the use of functional meta-data suggests that some of them could contribute to the in vivo molecular cross-talk between pathogen and host that regulates the course of the infection. Further, we present numerical data for Pfam domain families that highlights interaction specificity on the domain level. Not every instance of a pair of domains, for which interaction evidence has been found in a few instances (i.e. structures), is likely to functionally interact. Our sorting approach scores candidates according to how "distant" they are in sequence space from known examples of DDIs (templates). Thus, it provides a natural way to deal with the heterogeneity in domain-level interactions. Our method represents a more informed application of local alignment to the sequence-based search for potential human-microbial interactions that uses available PPI data as a prior. Our approach is somewhat limited in its sensitivity by the restricted size and
DEFF Research Database (Denmark)
Östlin, Anna; Pagh, Rasmus
2002-01-01
We consider dictionaries that perform lookups by probing a single word of memory, knowing only the size of the data structure. We describe a randomized dictionary where a lookup returns the correct answer with probability 1 - e, and otherwise returns don't know. The lookup procedure uses an expan...
Whitmire, Jeannette M; Merrell, D Scott
2017-01-01
Mutagenesis is a valuable tool to examine the structure-function relationships of bacterial proteins. As such, a wide variety of mutagenesis techniques and strategies have been developed. This chapter details a selection of random mutagenesis methods and site-directed mutagenesis procedures that can be applied to an array of bacterial species. Additionally, the direct application of the techniques to study the Helicobacter pylori Ferric Uptake Regulator (Fur) protein is described. The varied approaches illustrated herein allow the robust investigation of the structural-functional relationships within a protein of interest.
Job shop scheduling by local search
Vaessens, R.J.M.; Aarts, E.H.L.; Lenstra, J.K.
1994-01-01
We survey solution methods for the job shop scheduling problem with an emphasis on local search. We discuss both cleterministic and randomized local search methods as well as the applied neighborhoods. We compare the computational performance of the various methods in terms of their effectiveness
Navigation by anomalous random walks on complex networks.
Weng, Tongfeng; Zhang, Jie; Khajehnejad, Moein; Small, Michael; Zheng, Rui; Hui, Pan
2016-11-23
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not useful as they fail to characterize the cost associated with each jump. Here we introduce a new concept of mean first traverse distance (MFTD) to characterize anomalous random walks that represents the expected traverse distance taken by walkers searching from source node to target node, and we provide a procedure for calculating the MFTD between two nodes. We use Lévy walks on networks as an example, and demonstrate that the proposed approach can unravel the interplay between diffusion dynamics of Lévy walks and the underlying network structure. Moreover, applying our framework to the famous PageRank search, we show how to inform the optimality of the PageRank search. The framework for analyzing anomalous random walks on complex networks offers a useful new paradigm to understand the dynamics of anomalous diffusion processes, and provides a unified scheme to characterize search and transport processes on networks.
Navigation by anomalous random walks on complex networks
Weng, Tongfeng; Zhang, Jie; Khajehnejad, Moein; Small, Michael; Zheng, Rui; Hui, Pan
2016-11-01
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not useful as they fail to characterize the cost associated with each jump. Here we introduce a new concept of mean first traverse distance (MFTD) to characterize anomalous random walks that represents the expected traverse distance taken by walkers searching from source node to target node, and we provide a procedure for calculating the MFTD between two nodes. We use Lévy walks on networks as an example, and demonstrate that the proposed approach can unravel the interplay between diffusion dynamics of Lévy walks and the underlying network structure. Moreover, applying our framework to the famous PageRank search, we show how to inform the optimality of the PageRank search. The framework for analyzing anomalous random walks on complex networks offers a useful new paradigm to understand the dynamics of anomalous diffusion processes, and provides a unified scheme to characterize search and transport processes on networks.
International Nuclear Information System (INIS)
Celikovic, Igor
2013-01-01
In this thesis we investigated the structure of nuclei around 68 Ni as well as the production, separation and identification of proton-rich isotopes lying in the vicinity of the doubly-magic 100 Sn nucleus.In the first part, we discuss the evolution of collectivity and the interplay between collective and single-particle degrees of freedom in nuclei around 68 Ni. We measured lifetimes in Zn isotopes around N = 40 produced in 238 U + 70 Zn deep-inelastic collisions at GANIL. We used a plunger device and the recoil-distance Doppler-shift method. The nuclei of interest were identified by the VAMOS spectrometer and the γ-rays with the EXOGAM array. The reduced electromagnetic transitions probabilities were extracted from the lifetimes. Several transitions and lifetimes are reported for the first time. The experimental results are discussed in the framework of shell model calculations. In the second part, the partial conservation of seniority in the g 9/2 shell and its influence on one-particle transfer is discussed. The third part presents the analysis of an in-beam test performed at RIKEN (Japan) to evaluate two settings of the BigRIPS separator for optimizing the production and selection of 100 Sn. This study has been used to setup our subsequent experiment, dedicated to the measurement of the Gamow-Teller strength in the decay of 100 Sn, to the mapping of the proton drip-line and the study of short-lived isomers in this mass region. Nuclei around 100 Sn were produced by fragmentation of a 345 MeV/u 124 Xe beam on a Be target. The production cross-sections of nuclei around 100 Sn were measured. The search for new isotopes and new isomers in all identified nuclei is presented. (author) [fr
International Nuclear Information System (INIS)
Perotin, L.; Granger, S.
1997-01-01
In order to improve the prediction of wear problems due to flow-induced vibration in PWR components, an inverse method for identifying a distributed random excitation acting on a dynamical system has been developed at EDF. This method, whose applications go far beyond the flow-induced vibration field, has been implemented into the MEIDEE software. This method is presented. (author)
Nicolaije, Kim Ah; Ezendam, Nicole Pm; Pijnenborg, Johanna Ma; Boll, Dorry; Vos, Maria Caroline; Kruitwagen, Roy Fpm; van de Poll-Franse, Lonneke V
2016-07-08
The Institute of Medicine recommends Survivorship Care Plans (SCPs) for all cancer survivors. However, it is unclear whether certain patient groups may or may not benefit from SCPs. The aim was to assess whether the effects of an automatically generated paper SCP on patients' satisfaction with information provision and care, illness perceptions, and health care utilization were moderated by disease-related Internet use. Twelve hospitals were randomized to either SCP care or usual care in the pragmatic cluster randomized Registrationsystem Oncological GYnecology (ROGY) Care trial. Newly diagnosed endometrial cancer patients completed questionnaires after diagnosis (N=221; response: 74.7%, 221/296), 6 months (n=158), and 12 months (n=147), including patients' satisfaction with information provision and care, illness perceptions, health care utilization (how many times patients visited a medical specialist or primary care physicia