Search results for "Computation"
showing 10 items of 7362 documents
Macro-elements in the mixed boundary value problems
2000
The symmetric Galerkin boundary element method (SGBEM), applied to elastostatic problems, is employed in defining a model with BE macro-elements. The model is governed by symmetric operators and it is characterized by a small number of independent variables upon the interface between the macro-elements.
Dual Inequalities for Stabilized Column Generation Revisited
2014
Column generation (CG) models have several advantages over compact formulations: they provide better linear program bounds, may eliminate symmetry, and can hide nonlinearities in their subproblems. However, users also encounter drawbacks in the form of slow convergence, also known as the tailing-off effect, and the oscillation of the dual variables. Among different alternatives for stabilizing the CG process, Ben Amor et al. [Ben Amor H, Desrosiers J, Valério de Carvalho JM (2006) Dual-optimal inequalities for stabilized column generation. Oper. Res. 54(3):454–463] suggest the use of dual-optimal inequalities (DOIs) in the context of cutting stock and bin packing problems. We generalize th…
Video Streaming Distribution in VANETs
2011
Streaming applications will rapidly develop and contribute a significant amount of traffic in the near future. A problem, scarcely addressed so far, is how to distribute video streaming traffic from one source to all nodes in an urban vehicular network. This problem significantly differs from previous work on broadcast and multicast in ad hoc networks because of the highly dynamic topology of vehicular networks and the strict delay requirements of streaming applications. We present a solution for intervehicular communications, called Streaming Urban Video (SUV), that 1) is fully distributed and dynamically adapts to topology changes, and 2) leverages the characteristics of streaming applica…
Distributed Leader Election and Computation of Local Identifiers for Programmable Matter
2019
International audience; The context of this paper is programmable matter, which consists of a set of computational elements, called particles, in an infinite graph. The considered infinite graphs are the square, triangular and king grids. Each particle occupies one vertex, can communicate with the adjacent particles, has the same clockwise direction and knows the local positions of neighborhood particles. Under these assumptions, we describe a new leader election algorithm affecting a variable to the particles, called the k-local identifier, in such a way that particles at close distance have each a different k-local identifier. For all the presented algorithms, the particles only need a O(…
Highly transitive actions of groups acting on trees
2015
We show that a group acting on a non-trivial tree with finite edge stabilizers and icc vertex stabilizers admits a faithful and highly transitive action on an infinite countable set. This result is actually true for infinite vertex stabilizers and some more general, finite of infinite, edge stabilizers that we call highly core-free. We study the notion of highly core-free subgroups and give some examples. In the case of amalgamated free products over highly core-free subgroups and HNN extensions with highly core-free base groups we obtain a genericity result for faithful and highly transitive actions. In particular, we recover the result of D. Kitroser stating that the fundamental group of …
Chromatic sums for colorings avoiding monochromatic subgraphs
2015
Abstract Given graphs G and H, a vertex coloring c : V ( G ) → N is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ ( H , G ) , is the minimum number of colors in an H-free coloring of G. The H-free chromatic sum of G , Σ ( H , G ) , is the minimum value achieved by summing the vertex colors of each H-free coloring of G. We provide a general bound for Σ ( H , G ) , discuss the computational complexity of finding this parameter for different choices of H, and prove an exact formulas for some graphs G. For every integer k and for every graph H, we construct families of graphs, G k with the property that k more colors than χ ( …
Prediction of Molecular Volume and Surface of Alkanes by Molecular Topology.
2003
Molecular volume and molecular surface are expressed as a function of topological degree in alkane graphs. This allows not only a straightforward approach to calculate such physicochemical magnitudes but also an interpretation of the role of the local vertex invariant (LOVI) or valence degree, delta, as well as the connectivity indices in the prediction of physicochemical properties. The interpretation is based on the concept of molecular accessibility (as introduced by Estrada, J. Phys. Chem. A 2002, 106, 9085) for which precise mathematical definitions are provided.
QSPR Modeling of Hydrocarbon Dipole Moments by Means of Correlation Weighting of Local Graph Invariants
2003
Hydrocarbon dipole moments are calculated by means of correlation weighting of local graph invariants within the context of QSPR theory. This sort of flexible topological descriptor is used for several parameters: local invariants of k th vertex in the labeled hydrogen filled graph extended connectivity of zero-, first- and second-orders, number of paths of length 2 at k th vertex and valence shell of the k th vertex. The models predict hydrocarbon dipole moments in a quite sensible way. The best model is that one based upon numbers of path length 2 correlation weighting.
Implementation and application of the actuator line model by OpenFOAM for a vertical axis wind turbine
2017
University of Stavanger has started The Smart Sustainable Campus & Energy Lab project, to gain knowledge and facilitate project based education in the field of renewable and sustainable energy and increase the research effort in the same area. This project includes the future installation of a vertical axis wind turbine on the campus roof. A newly developed Computational Fluid Dynamics (CFD) model by OpenFOAM have been implemented to study the wind behavior over the building and the turbine performance. The online available wind turbine model case from Bachant, Goude and Wosnik from 2016 is used as the starting point. This is a Reynolds-Averaged Navier-Stokes equations (RANS) case set up th…
Hierarchical imaging and computational analysis of three-dimensional vascular network architecture in the entire postnatal and adult mouse brain
2021
The formation of new blood vessels and the establishment of vascular networks are crucial during brain development, in the adult healthy brain, as well as in various diseases of the central nervous system. Here, we describe a step-by-step protocol for our recently developed method that enables hierarchical imaging and computational analysis of vascular networks in postnatal and adult mouse brains. The different stages of the procedure include resin-based vascular corrosion casting, scanning electron microscopy, synchrotron radiation and desktop microcomputed tomography imaging, and computational network analysis. Combining these methods enables detailed visualization and quantification of t…