In order to increase the accuracy of continuous speech acousticphonetic decoding, we started the APHODEX project some years ago. Our aim is to develop an expert system that implements the knowledge of an expert spectrogram reader, the phonetician F. Lonchamp. In the present version of the system, procedural and declarative approaches have been used jointly for the representation of phonetic exp...

A new approach to image registration is proposed. The approach enables the proper segregation of the transformation space into a low dimensional so-called coarse space and a remaining non-linear socalled fine part. The segregation concept is combined with a multilevel approach, where the two parts are treated simultaneously. Modeling and computation issues are discussed. Finally, we present a h...

We present a parallel algorithm for solving the next element search problem on a set of line segments, using a BSP like model referred to as the Coarse Grained Multicomputer (CGM). The algorithm requires O(1) communication rounds (h-relations with h = O(n/p)), O((n/p) log n) local computation, and O((n/p) log p) memory per processor, assuming n/p ≥ p. Our result implies solutions to the point l...

At room temperature, the indentation morphologies of crystalline copper with different 13 grain size including nanocrystalline (NC), ultrafine-grained (UFG) and coarse-grained (CG) copper 14 were studied by nanoindentation at the strain rate of 0.04/s without holding time at indentation 15 depth of 2000 nm. As the grain size increasing, the height of the pile-up around the residual 16 indentati...

In this work we combine the framework of the Reduced Basis method (RB) with the framework of the Localized Orthogonal Decomposition (LOD) in order to solve parametrized elliptic multiscale problems. The idea of the LOD is to split a high dimensional Finite Element space into a low dimensional space with comparably good approximation properties and a remainder space with negligible information. ...

Skeletal trees are commonly used in order to express geometric properties of the shape. Accordingly, tree edit distance is used to compute a dissimilarity between two given shapes. We present a new tree edit based shape matching method which uses a recent coarse skeleton representation. The coarse skeleton representation allows us to represent both shapes and shape categories in the form of dep...

We construct curve counting invariants for a Calabi-Yau threefold Y equipped with a dominant birational morphism π : Y → X. Our invariants generalize the stable pair invariants of Pandharipande and Thomas which occur for the case when π : Y → Y is the identity. Our main result is a PT/DT-type formula relating the partition function of our invariants to the Donaldson-Thomas partition function in...

reservoir models with many grid blocks suffer from long run time; it is hence important to deliberatea method to remedy this drawback. usual upscaling methods are proved to fail to reproduce fine gridmodel behaviors in coarse grid models in well proximity. this is attributed to rapid pressure changesin the near-well region. standard permeability upscaling methods are limited to systems with lin...

Recent developments in multiscale computation allow the solution of coarse equations for the expected macroscopic behavior of microscopically evolving particles without ever obtaining these coarse equations in closed form. The closure is obtained on demand through appropriately initialized bursts of microscopic simulation. The effective coupling of microscopic simulators with macroscopic behavi...

Optimized Schwarz methods form a class of domain decomposition algorithms in which the transmission conditions are optimized in order to achieve fast convergence. They are usually derived for a model problem with two subdomains, and give efficient transmission conditions for the local coupling between neighboring subdomains. However, when using a large number of subdomains, a coarse space corre...