865 resultados para EMBEDDED MINIMAL-SURFACES


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Feature modeling, embebbed software, software product lines, tool support

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mobile embedded systems, wireless communication, real-time systems, real-time scheduling, communication protocols, cooperation, reliability and fault-tolerance, middleware

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Magdeburg, Univ., Fak. für Mathematik, kumulative Habil.-Schr., 2011

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Magdeburg, Univ., Fak. für Informatik, Diss., 2012

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Magdeburg, Univ., Fak. für Informatik, Diss., 2014

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Michael Friebe, editor ; Otto-von-Guericke-Universität Magdeburg, Institut für Medizintechnik, Lehrstuhl Kathetertechnologie und bildgesteuerte Therapie (INKA - Intelligente Katheter), Forschungscampus STIMULATE (Solution Centre for Image Guided Local Therapies)

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Vegeu el resum a l'inici del document del fitxer adjunt

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We quantify the long-time behavior of a system of (partially) inelastic particles in a stochastic thermostat by means of the contractivity of a suitable metric in the set of probability measures. Existence, uniqueness, boundedness of moments and regularity of a steady state are derived from this basic property. The solutions of the kinetic model are proved to converge exponentially as t→ ∞ to this diffusive equilibrium in this distance metrizing the weak convergence of measures. Then, we prove a uniform bound in time on Sobolev norms of the solution, provided the initial data has a finite norm in the corresponding Sobolev space. These results are then combined, using interpolation inequalities, to obtain exponential convergence to the diffusive equilibrium in the strong L¹-norm, as well as various Sobolev norms.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

"Vegeu el resum a l'inici del document del fitxer adjunt."

Relevância:

20.00% 20.00%

Publicador:

Resumo:

"Vegeu el resum a l'inici del document del fitxer adjunt."

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We construct the Chow motive modelling intersection co-homology of a proper surface. We then study its functoriality properties. Using Murre's decompositions of the motive of a desingularization into KÄunneth components [Mr1], we show that such decompositions exist also for the intersection motive.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We describe a method for determining the minimal length of elements in the generalized Thompson's groups F(p). We compute the length of an element by constructing a tree pair diagram for the element, classifying the nodes of the tree and summing associated weights from the pairs of node classifications. We use this method to effectively find minimal length representatives of an element.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We first recall the construction of the Chow motive modelling intersection cohomology of a proper surface X and study its fundamental properties. Using Voevodsky's category of effective geometrical motives, we then study the motive of the exceptional divisor D in a non-singular blow-up of X. If all geometric irreducible components of D are of genus zero, then Voevodsky's formalism allows us to construct certain one-extensions of Chow motives, as canonical subquotients of the motive with compact support of the smooth part of X. Specializing to Hilbert-Blumenthal surfaces, we recover a motivic interpretation of a recent construction of A. Caspar.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We report a simple method for evaluating the binding of concanavalin A (ConA) to human peripheral blood mononuclear cells (PBMC). The binding is evidenced by an immunoenzymic assay using peroxidase-conjugated immunoglobulins of a rabbit anti-ConA serum. Using the method we show that sera from patients with American leishmaniasis do not interfere with binding of ConA to PBMC.