The tau constant of a metrized graph and its behavior under graph operations.
The theory of networks of single server queues and the tandem queue model.
The transistor model of neuron and neuron net
The tree of shapes of an image
In [30], Kronrod proves that the connected components of isolevel sets of a continuous function can be endowed with a tree structure. Obviously, the connected components of upper level sets are an inclusion tree, and the same is true for connected components of lower level sets. We prove that in the case of semicontinuous functions, those trees can be merged into a single one, which, following its use in image processing, we call “tree of shapes”. This permits us to solve a classical representation...
The tree of shapes of an image
In [CITE], Kronrod proves that the connected components of isolevel sets of a continuous function can be endowed with a tree structure. Obviously, the connected components of upper level sets are an inclusion tree, and the same is true for connected components of lower level sets. We prove that in the case of semicontinuous functions, those trees can be merged into a single one, which, following its use in image processing, we call “tree of shapes”. This permits us to solve a classical representation problem...
The UD RLS algorithm for training feedforward neural networks
A new algorithm for training feedforward multilayer neural networks is proposed. It is based on recursive least squares procedures and U-D factorization, which is a well-known technique in filter theory. It will be shown that due to the U-D factorization method, our algorithm requires fewer computations than the classical RLS applied to feedforward multilayer neural network training.
The uncertainty measure of hierarchical quotient space structure.
The Uncertainty Principle: A Mathematical Survey.
The weight distribution of the functional codes defined by forms of degree 2 on Hermitian surfaces
We study the functional codes defined on a projective algebraic variety , in the case where is a non-degenerate Hermitian surface. We first give some bounds for , which are better than the ones known. We compute the number of codewords reaching the second weight. We also estimate the third weight, show the geometrical structure of the codewords reaching this third weight and compute their number. The paper ends with a conjecture on the fourth weight and the fifth weight of the code .
Théorème ergodique presque sous-additif et convergence en moyenne de l'information
Theoretical foundation of the weighted Laplace inpainting problem
Laplace interpolation is a popular approach in image inpainting using partial differential equations. The classic approach considers the Laplace equation with mixed boundary conditions. Recently a more general formulation has been proposed, where the differential operator consists of a point-wise convex combination of the Laplacian and the known image data. We provide the first detailed analysis on existence and uniqueness of solutions for the arising mixed boundary value problem. Our approach considers...
Thetanullwerte and stable modular forms for Hecke groups.
Time-frequency analysis of Sjöstrand's class.
We investigate the properties an exotic symbol class of pseudodifferential operators, Sjöstrand's class, with methods of time-frequency analysis (phase space analysis). Compared to the classical treatment, the time-frequency approach leads to striklingly simple proofs of Sjöstrand's fundamental results and to far-reaching generalizations.
Time-frequency representations : wavelet packets and optimal decomposition
Time-varying time-delay estimation for nonlinear systems using neural networks
Nonlinear dynamic processes with time-varying time delays can often be encountered in industry. Time-delay estimation for nonlinear dynamic systems with time-varying time delays is an important issue for system identification. In order to estimate the dynamics of a process, a dynamic neural network with an external recurrent structure is applied in the modeling procedure. In the case where a delay is time varying, a useful way is to develop on-line time-delay estimation mechanisms to track the time-delay...
Topological optimization with the -Laplacian operator and an application in image processing.
Towards a characterization of bipartite switching classes by means of forbidden subgraphs
We investigate which switching classes do not contain a bipartite graph. Our final aim is a characterization by means of a set of critically non-bipartite graphs: they do not have a bipartite switch, but every induced proper subgraph does. In addition to the odd cycles, we list a number of exceptional cases and prove that these are indeed critically non-bipartite. Finally, we give a number of structural results towards proving the fact that we have indeed found them all. The search for critically...
TPM: Transition probability matrix - Graph structural feature based embedding
In this work, Transition Probability Matrix (TPM) is proposed as a new method for extracting the features of nodes in the graph. The proposed method uses random walks to capture the connectivity structure of a node's close neighborhood. The information obtained from random walks is converted to anonymous walks to extract the topological features of nodes. In the embedding process of nodes, anonymous walks are used since they capture the topological similarities of connectivities better than random...
Trace and families of algebraic curves.
Transformée en paquets d'ondelettes des signaux stationnaires: comportement asymptotique des densités spectrales.
We consider quadrature mirror filters, and the associated wavelet packet transform. Let X = {Xn}n∈Z be a stationary signal which has a continuous spectral density f. We prove that the 2n signals obtained from X by n iterations of the transform converge to white noises when n → +∞. If f is holderian, the convergence rate is exponential.