Search results for "Hypercube"
showing 10 items of 21 documents
An efficient algorithm for stopping on a sink in a directed graph
2013
Abstract Vertices of an unknown directed graph of order n are revealed one by one in some random permutation. At each point, we know the subgraph induced by the revealed vertices. Our goal is to stop on a sink, a vertex with no out-neighbors. We show that if a sink exists this can be achieved with probability Θ ( 1 / n ) , which is best possible.
Seismic evaluation of ordinary RC buildings retrofitted with externally bonded FRPs using a reliability-based approach
2020
International audience; Despite the extensive literature on reinforced concrete (RC) members retrofitted with fiberreinforced polymer (FRP) composites, few studies have employed a reliability-based approach to evaluate the seismic performance of RC buildings in terms of their collapse capacity and ductility. In this study, the performance of a poorly-confined RC building structure is investigated for different FRP retrofitting schemes using different configurations and combinations of wrapping and flange-bonded FRPs, as two well-established techniques. A nonlinear pushover analysis is then implemented with a computational reliability analysis based on Latin Hypercube Sampling (LHS) to deter…
Latin hypercube sampling with inequality constraints
2010
International audience; In some studies requiring predictive and CPU-time consuming numerical models, the sampling design of the model input variables has to be chosen with caution. For this purpose, Latin hypercube sampling has a long history and has shown its robustness capabilities. In this paper we propose and discuss a new algorithm to build a Latin hypercube sample (LHS) taking into account inequality constraints between the sampled variables. This technique, called constrained Latin hypercube sampling (cLHS), consists in doing permutations on an initial LHS to honor the desired monotonic constraints. The relevance of this approach is shown on a real example concerning the numerical w…
Strong chromatic index of products of graphs
2007
Graphs and Algorithms
Quantum search of spatial regions
2003
Can Grover's algorithm speed up search of a physical region - for example a 2-D grid of size sqrt(n) by sqrt(n)? The problem is that sqrt(n) time seems to be needed for each query, just to move amplitude across the grid. Here we show that this problem can be surmounted, refuting a claim to the contrary by Benioff. In particular, we show how to search a d-dimensional hypercube in time O(sqrt n) for d at least 3, or O((sqrt n)(log n)^(3/2)) for d=2. More generally, we introduce a model of quantum query complexity on graphs, motivated by fundamental physical limits on information storage, particularly the holographic principle from black hole thermodynamics. Our results in this model include a…
SCOPE-Based Emulators for Fast Generation of Synthetic Canopy Reflectance and Sun-Induced Fluorescence Spectra
2017
Progress in advanced radiative transfer models (RTMs) led to an improved understanding of reflectance (R) and sun-induced chlorophyll fluorescence (SIF) emission throughout the leaf and canopy. Among advanced canopy RTMs that have been recently modified to deliver SIF spectral outputs are the energy balance model SCOPE and the 3D models DART and FLIGHT. The downside of these RTMs is that they are computationally expensive, which makes them impractical in routine processing, such as scene generation and retrieval applications. To bypass their computational burden, a computationally effective technique has been proposed by only using a limited number of model runs, called emulation. The idea …
Adjacent Vertices Can Be Hard to Find by Quantum Walks
2017
Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element only. We show that if the search space contains more than one marked element, their placement may drastically affect the performance of the search. More specifically, we study search by quantum walks on general graphs and show a wide class of configurations of marked vertices, for which search by quantum walk needs \(\varOmega (N)\) steps, that is, it has no speed-up over the classical exhaustive search. The demonstrated configurations occur for certain placements of …
Parallel Simulated Annealing: Getting Super Linear Speedups
2005
The study described in this paper tries to improve and combine different approaches that are able to speed up applications of the Simulated Annealing model. It investigates separately two main aspects concerning the degree of parallelism an implementation can egectively exploit at the initial andfinal periods of an execution. As for case studies, it deals with two implementations: the Job shop Scheduling problem and the poryblio selection problem. The paper reports the results of a large number of experiments, carried out by means of a transputer network and a hypercube system. They give useful suggestions about selecting the most suitable values of the intervention parameters to achieve su…
Assessing the performance of GIS- based machine learning models with different accuracy measures for determining susceptibility to gully erosion
2019
Assessing the performance of GIS- based machine learning models withdifferent accuracy measures for determining susceptibility togully erosionYounes Garosia, Mohsen Sheklabadia,⁎, Christian Conoscentib, Hamid Reza Pourghasemic,d, Kristof Van Ooste,faFaculty of Agriculture, Department of Soil Science, Bu Ali Sina University, Ahmadi Roshan Avenue, 6517838695 Hamedan, IranbDepartment of Earth and Sea Sciences (DISTEM), University of Palermo, Via Archirafi22, 90123 Palermo, ItalycCollege of Marine Sciences and Engineering, Nanjing Normal University, Nanjing, 210023, ChinadDepartment of Natural Resources and Environmental Engineering, College of Agriculture, Shiraz University, Shiraz, IraneA- Fo…
Highly irregular graphs with extreme numbers of edges
1997
Abstract A simple connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we find: (1) the greatest number of edges of a highly irregular graph with n vertices, where n is an odd integer (for n even this number is given in [1]), (2) the smallest number of edges of a highly irregular graph of given order.