Displaying 1361 – 1380 of 1497

Showing per page

Time-frequency analysis of Sjöstrand's class.

Karlheinz Gröchenig (2006)

Revista Matemática Iberoamericana

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-varying time-delay estimation for nonlinear systems using neural networks

Yonghong Tan (2004)

International Journal of Applied Mathematics and Computer Science

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...

Towards a characterization of bipartite switching classes by means of forbidden subgraphs

Jurriaan Hage, Tero Harju (2007)

Discussiones Mathematicae Graph Theory

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

Sarmad N. Mohammed, Semra Gündüç (2023)

Kybernetika

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...

Transformée en paquets d'ondelettes des signaux stationnaires: comportement asymptotique des densités spectrales.

Loïc Hervé (1996)

Revista Matemática Iberoamericana

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.

Tropical probability theory and an application to the entropic cone

Rostislav Matveev, Jacobus W. Portegies (2020)

Kybernetika

In a series of articles, we have been developing a theory of tropical diagrams of probability spaces, expecting it to be useful for information optimization problems in information theory and artificial intelligence. In this article, we give a summary of our work so far and apply the theory to derive a dimension-reduction statement about the shape of the entropic cone.

Currently displaying 1361 – 1380 of 1497