Search results for "Graph theory"
showing 10 items of 784 documents
Geometric characterization and simulation of planar layered elastomeric fibrous biomaterials
2015
An important class of biomaterials is composed of layered networks of elastomeric fibers. While there is a growing interest in modeling and simulation of the mechanical response of these biomaterials, a theoretical foundation for such simulations has yet to be firmly established. The present work addresses this issue in two ways. First, using methods of geometric probability we develop theoretical estimates for the linear and areal fiber intersection densities for two-dimensional fibrous networks. These are expressed in terms of the fiber density and orientation distribution function, both of which are relatively easy to measure properties. Secondly, we develop a random walk algorithm for g…
Influence of orientation errors on quasi-homogeneity of composite laminates
2003
This paper presents a study on the effects of layer orientation defects on the property of quasi-homogeneity for composite laminates: a measure of the deviation from quasi-homogeneity, introducing the concept of degree of quasi-homogeneity, is proposed. Complete theoretical developments which lead to exact formulae in the case of a single orientation error on a layer of the laminate are showed and the results of a wide numerical analysis in the case of orientation errors randomly distributed on the stacking sequence are also presented. All the theoretical and numerical calculations are developed thanks to the polar method of representation of fourth order tensors introduced by Verchery.
Phase behavior of low-functionality, telechelic star block copolymers.
2010
We apply state-of-the-art, Grand Canonical Monte Carlo simulations to determine the self-organization and phase behavior of solutions of block copolymer stars. The latter consist of f AB-block copolymers with N monomers each, which contain a solvophilic block A and solvophobic block B, and which are tethered on a common center on their A-side. We vary the degree of polymerization N and the relative composition of the block copolymer arms and investigate the interplay between macrophase and microphase separation in the system. Preliminary results of the effect of increasing the number of arms, f of the stars are also presented.
A simple technique for estimating surface temperature by means of a thermal infrared radiometer
1992
Abstract In this Letter we present a simple technique for estimating surface temperatures from data obtained by means of a thermal infrared radiometer. The technique is based simply on the use of a table and a graph, from which cmissivity and atmospheric effects are easily evaluated. The accuracy is better than a tenth of a degree when emissivity and atmospheric radiance arc known.
Star-Shaped Conjugated Systems
2010
The present review deals with the preparation and the properties of star-shaped conjugated compounds. Three, four or six conjugated arms are attached to cross-conjugated cores, which consist of single atoms (B, C+, N), benzene or azine rings or polycyclic ring systems, as for example triphenylene or tristriazolotriazine. Many of these shape-persistent [n]star compounds tend to π-stacking and self-organization, and exhibit interesting properties in materials science: Linear and non-linear optics, electrical conductivity, electroluminescence, formation of liquid crystalline phases, etc.
On the population model with a sine function
2006
In the interval [0,1] function sr(x) = r sin πx behaves similar to logistic function h μ (x) = μx(1‐ x). We prove that for every r > there exists subset ? ⊂ [0,1] such that sr : ? → ? is a chaotic function. Since the logistic function is chaotic in another subset of [0,1] but both functions have similar graphs in [0,1] we conclude that it can lead to errors in practice. First Published Online: 14 Oct 2010
On the sure criticality of tasks in activity networks with imprecise durations
2002
BB; International audience; The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activity duration times is introduced and analyzed. It is shown, in the interval case, that both the problem of asserting whether a given path is necessarily critical and the problem of determining an arbitrary necessarily critical path (more exactly, a subnetwork covering all the necessarily critical. paths) are easy. The corresponding solution algorithms are proposed. However, the problem. of evaluating whether a given activity is necessarily critical does not seem to be such. Certain conditions are…
Intelligent Multi-Start Methods
2018
Heuristic search procedures aimed at finding globally optimal solutions to hard combinatorial optimization problems usually require some type of diversification to overcome local optimality. One way to achieve diversification is to re-start the procedure from a new solution once a region has been explored, which constitutes a multi-start procedure. In this chapter we describe the best known multi-start methods for solving optimization problems. We also describe their connections with other metaheuristic methodologies. We propose classifying these methods in terms of their use of randomization, memory and degree of rebuild. We also present a computational comparison of these methods on solvi…
District metered area design through multicriteria and multiobjective optimization
2022
[EN] The design of district metered areas (DMA) in potable water supply systems is of paramount importance for water utilities to properly manage their systems. Concomitant to their main objective, namely, to deliver quality water to consumers, the benefits include leakage reduction and prompt reaction in cases of natural or malicious contamination events. Given the structure of a water distribution network (WDN), graph theory is the basis for DMA design, and clustering algorithms can be applied to perform the partitioning. However, such sectorization entails a number of network modifications (installing cut-off valves and metering and control devices) involving costs and operation changes,…
Scatter search for the profile minimization problem
2014
We study the problem of minimizing the profile of a graph and develop a solution method by following the tenets of scatter search. Our procedure exploits the network structure of the problem and includes strategies that produce a computationally efficient and agile search. Among several mechanisms, our search includes path relinking as the basis for combining solutions to generate new ones. The profile minimization problem PMP is NP-Hard and has relevant applications in numerical analysis techniques that rely on manipulating large sparse matrices. The problem was proposed in the early 1970s but the state-of-the-art does not include a method that could be considered powerful by today's compu…