Search results for " Soft"
showing 10 items of 1710 documents
Canopy Architecture Appraisal by Fractal Dimension of 'Flordastar' Peach Trees Grafted onto Different Rootstocks
2007
The objective of this research was to evaluate the modification of canopy architecture of ''Flordastar'' peach (Prunus persica L. Batsch) grafted onto rootstocks with different vigour, by the use of fractal dimension (D). The hypothesis was that different vigour rootstocks are able to modify the complexity of the branching pattern and that this effect can be assessed by a geometric parameter such as the fractal dimension (D) of the 2D projection of tree branching structure. The observations were carried out in a four-year-old experimental orchard of cv. ''Flordastar'' peach trees grafted onto Ishtara, Barrier, GF677 and MrS 2/5 rootstocks. On digital pictures of leafless, dormant peach tree…
Underlying Simple Graphs
2019
Summary In this article the notion of the underlying simple graph of a graph (as defined in [8]) is formalized in the Mizar system [5], along with some convenient variants. The property of a graph to be without decorators (as introduced in [7]) is formalized as well to serve as the base of graph enumerations in the future.
Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement
2017
Abstract We present a counterexample-guided abstraction refinement ( CEGAR) approach for the verification of safety properties of linear hybrid automata with large discrete state spaces, such as naturally arising when incorporating health state monitoring and degradation levels into the controller design. Such models can – in contrast to purely functional controller models – not be analyzed with hybrid verification engines relying on explicit representations of modes, but require fully symbolic representations for both the continuous and discrete part of the state space. The presented abstraction methods directly work on a symbolic representation of arbitrary non-convex combinations of line…
Tabu search for the dynamic Bipartite Drawing Problem
2018
Abstract Drawings of graphs have many applications and they are nowadays well-established tools in computer science in general, and optimization in particular. Project scheduling is one of the many areas in which representation of graphs constitutes an important instrument. The experience shows that the main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion to achieve it. Incremental or dynamic graph drawing is an emerging topic in this context, where we seek to preserve the layout of a graph over successive drawings. In this paper, we target the edge crossing reduction in the context of incremental graph drawing. Specifically…
Building Construction Sets by Tiling Grammar Simplification
2016
This paper poses the problem of fabricating physical construction sets from example geometry: A construction set provides a small number of different types of building blocks from which the example model as well as many similar variants can be reassembled. This process is formalized by tiling grammars. Our core contribution is an approach for simplifying tiling grammars such that we obtain physically manufacturable building blocks of controllable granularity while retaining variability, i.e., the ability to construct many different, related shapes. Simplification is performed by sequences of two types of elementary operations: non-local joint edge collapses in the tile graphs reduce the gra…
nalysis, Modeling and Simulation of Mechatronic Systems using the Bond Graph Method
2011
The Bond Graph is the proper choice of physical system used for: (i) Modeling which can be applied to systems combining multidisciplinary energy domains, (ii) Analysis to provide a great value proposition for finding the algebraic loops within the system enabling the process of troubleshooting and eliminating the defects by using the proper component(s) to fix the causality conflict even without being acquainted in the proper system, and (iii) Simulation facilitated through derived state space equations from the Bond Graph model is solved using industrial simulation software, such as 20-Sim. The Bond Graph technique is a graphical language of modeling, in which component energy ports are co…
Mesh connectivity compression using convection reconstruction
2007
International audience; During a highly productive period running from 1995 to about 2002, the research in lossless compression of 3D meshes mainly consisted in a hard battle for the best bitrates. But for a few years, compression rates seem stabilized around 1.5 bit per vertex for the connectivity coding of usual meshes, and more and more work is dedicated to remeshing, lossy compression, or gigantic mesh compression, where memory and CPU optimizations are the new priority. However, the size of 3D models keeps growing, and many application fields keep requiring lossless compression. In this paper, we present a new contribution for single-rate lossless connectivity compression, which first …
Robustness and Randomness
2008
The study of robustness problems for computational geometry algorithms is a topic that has been subject to intensive research efforts from both computer science and mathematics communities. Robustness problems are caused by the lack of precision in computations involving floating-point instead of real numbers. This paper reviews methods dealing with robustness and inaccuracy problems. It discusses approaches based on exact arithmetic, interval arithmetic and probabilistic methods. The paper investigates the possibility to use randomness at certain levels of reasoning to make geometric constructions more robust.
Active colloidal suspensions: Clustering and phase behavior
2014
We review recent experimental, numerical, and analytical results on active suspensions of self-propelled colloidal beads moving in (quasi) two dimensions. Active colloids form part of the larger theme of active matter, which is noted for the emergence of collective dynamic phenomena away from thermal equilibrium. Both in experiments and computer simulations, a separation into dense aggregates, i.e., clusters, and a dilute gas phase has been reported even when attractive interactions and an alignment mechanism are absent. Here, we describe three experimental setups, discuss the different propelling mechanisms, and summarize the evidence for phase separation. We then compare experimental obse…
Aging effects in simple models for glassy relaxation
2006
Aging effects in the two-time correlation function and the response function after a quench from a high temperature to some low temperature are considered for a simple kinetic random energy model exhibiting stretched exponential relaxation. Because the system reaches thermal equilibrium for long times after the quench, all aging effect are of a transient nature. In particular, the violations of the fluctuation-dissipation theorem are considered and it is found that the relation between the response and the two-time correlation function depends on another function, the so-called asymmetry. This asymmetry vanishes in equilibrium but cannot be neglected in the aging regime. It is found that pl…