Search results for "SOFC"
showing 10 items of 660 documents
Periodic Orthogonal Wavelets and Wavelet Packets
2018
In this chapter, we discuss how to derive versatile families of periodic discrete-time orthogonal wavelets and wavelet packets from discrete and discrete-time splines outlined in Chap. 3. These wavelets and wavelet packets, although not having compact supports, are well localized in the time domain. They can have any number of discrete vanishing moments. Their DFT spectra tend to have a rectangular shape when the spline order grows and provide a collection of refined splits of the Nyquist frequency band. The wavelet and wavelet packet transforms are implemented in a fast way using the FFT.
Two-Dimensional Orthogonal Wavelets and Wavelet Packets
2018
This chapter extends the design of spline-based orthogonal discrete-time wavelets and wavelet packets to two-dimensional case. The corresponding transforms are implemented by using the 2D FFT.
Discrete-Time Periodic Wavelet Packets
2014
Direct and inverse wavelet and wavelet packet transforms of a spline are implemented by filtering the spline’s coordinates by two-channel critically sampled p-filter banks. In this chapter, those p-filter banks are utilized for processing discrete-time signals. The p-filter banks generate discrete-time wavelets and wavelet packets in the spaces of 1D and 2D periodic signals.
Inversion of matrix pencils for generalized systems
1993
Abstract This paper clarifies the nature of the Leverrier-Faddeev algorithm for generalized and state-space systems. It presents useful diagrams for recursive computation of the coefficients of the characteristic polynomial and the coefficient matrices of the adjoint matrix for various matrix pencils. A simplified case covers recursive equations and diagrams for inversion of the second-order matrix pencil (Es2 + A1s + A0) where E may be singular. The appendix provides two examples of mechanical and heat exchange systems which can be described by the generalized models.
Temporal aggregation in chain graph models
2005
The dependence structure of an observed process induced by temporal aggregation of a time evolving hidden spatial phenomenon is addressed. Data are described by means of chain graph models and an algorithm to compute the chain graph resulting from the temporal aggregation of a directed acyclic graph is provided. This chain graph is the best graph which covers the independencies of the resulting process within the chain graph class. A sufficient condition that produces a memory loss of the observed process with respect to its hidden origin is analyzed. Some examples are used for illustrating algorithms and results.
Sign and rank covariance matrices
2000
The robust estimation of multivariate location and shape is one of the most challenging problems in statistics and crucial in many application areas. The objective is to find highly efficient, robust, computable and affine equivariant location and covariance matrix estimates. In this paper, three different concepts of multivariate sign and rank are considered and their ability to carry information about the geometry of the underlying distribution (or data cloud) are discussed. New techniques for robust covariance matrix estimation based on different sign and rank concepts are proposed and algorithms for computing them outlined. In addition, new tools for evaluating the qualitative and quant…
Searching for a strong double tracing in a graph
1998
Given a connected graph G, we present a polynomial algorithm which either finds a tour traversing each edge of G exactly two non-consecutive times, one in each direction, or decides that no such tour exists. The main idea of this algorithm is based on the modification of a proof given by Thomassen related to a problem proposed by Ore in 1951.
Multiple smoothing parameters selection in additive regression quantiles
2021
We propose an iterative algorithm to select the smoothing parameters in additive quantile regression, wherein the functional forms of the covariate effects are unspecified and expressed via B-spline bases with difference penalties on the spline coefficients. The proposed algorithm relies on viewing the penalized coefficients as random effects from the symmetric Laplace distribution, and it turns out to be very efficient and particularly attractive with multiple smooth terms. Through simulations we compare our proposal with some alternative approaches, including the traditional ones based on minimization of the Schwarz Information Criterion. A real-data analysis is presented to illustrate t…
Optimal designs for a one-way layout with covariates
2000
Abstract For the general class of Φ q -criteria optimal designs are characterized which reflect the inherent symmetry in a one-way layout with covariates. In particular, the eigenvalues of the covariance matrices are related to those in suitably chosen marginal models depending on the underlying interaction structure.
Quantum Walk Search on Johnson Graphs
2016
The Johnson graph $J(n,k)$ is defined by $n$ symbols, where vertices are $k$-element subsets of the symbols, and vertices are adjacent if they differ in exactly one symbol. In particular, $J(n,1)$ is the complete graph $K_n$, and $J(n,2)$ is the strongly regular triangular graph $T_n$, both of which are known to support fast spatial search by continuous-time quantum walk. In this paper, we prove that $J(n,3)$, which is the $n$-tetrahedral graph, also supports fast search. In the process, we show that a change of basis is needed for degenerate perturbation theory to accurately describe the dynamics. This method can also be applied to general Johnson graphs $J(n,k)$ with fixed $k$.