Coalgebraic representations of distributive lattices with operators

We present a framework for extending Stone's representation theorem for distributive lattices to representation theorems for distributive lattices with operators. We proceed by introducing the definition of algebraic theory of operators over distributive lattices. Each such theory induces a functor on the category of distributive lattices such that its algebras are exactly the distributive lattices with operators in the original theory. We characterize the topological counterpart of these algebras in terms of suitable coalgebras on spectral spaces. We work out some of these coalgebraic representations, including a new representation theorem for distributive lattices with monotone operators.     

Nonminimal sets,their projections and integral representations of stable processes

New criteria are provided for determining whether an integral representation of a stable process is minimal. These criteria are based on various nonminimal sets and their projections, and have several advantages over and shed light on already available criteria. In particular, they naturally lead from a nonminimal representation to the one which is minimal. Several known examples are considered to illustrate the main results. The general approach is also adapted to show that the so-called mixed moving averages have a minimal integral representation of the mixed moving average type.     

A note on balance vertices in trees

The notion of balanced bipartitions of the vertices in a tree T was introduced and studied by Reid (Networks 34 (1999) 264). Reid proved that the set of balance vertices of a tree T consists of a single vertex or two adjacent vertices. In this note, we give a simple proof of that result.     

Likelihood and conditional likelihood inference for generalized additive mixed models for clustered data

Lin and Zhang (J. Roy. Statist. Soc. Ser. B 61 (1999) 381) proposed the generalized additive mixed model (GAMM) as a framework for analysis of correlated data, where normally distributed random effects are used to account for correlation in the data, and proposed to use double penalized quasi-likelihood (DPQL) to estimate the nonparametric functions in the model and marginal likelihood to estimate the smoothing parameters and variance components simultaneously. However, the normal distributional assumption for the random effects may not be realistic in many applications, and it is unclear how violation of this assumption affects ensuing inferences for GAMMs. For a particular class of GAMMs, we propose a conditional estimation procedure built on a conditional likelihood for the response given a sufficient statistic for the random effect, treating the random effect as a nuisance parameter, which thus should be robust to its distribution. In extensive simulation studies, we assess performance of this estimator under a range of conditions and use it as a basis for comparison to DPQL to evaluate the impact of violation of the normality assumption. The procedure is illustrated with application to data from the Multicenter AIDS Cohort Study (MACS).     

Group classification of unsteady boundary layer equations of a class of non-Newtonian fluids

Two dimensional unsteady boundary layer equations of a general model of non-Newtonian fluids were investigated in this study. In this model, the shear stress is taken as an arbitrary function of the velocity gradient. Group classification of the equations with respect to shear stress is done using two different approaches: (1) classical theory (2) equivalence transformations. Both approaches yield identical results. It is found that the principle Lie Algebra extends only for cases of Newtonian and Power-Law flows.     

Compact directed acyclic word graphs for a sliding window

Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window.     

Indexing text using the Ziv–Lempel trie

Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog₂n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m³logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found.     

Temperature measurements using fiber optic polarization interferometer

A novel measurement method of temperature based on the phenomena that the phase difference between principle polarization states in the optical retarder is function of temperature is described. The polarization state of optical beam is changed as it passes through the optical retarder, which depends on the temperature. The temperature of optical retarder is determined by comparison of the power difference between principal polarization states. We demonstrate successfully the temperature measurement by using a polarization maintaining fiber as the optical retarder. With a 100 mm length of the fiber optic retarder, the change rate of phase difference on temperature was 0.236 rad/°C and the measurement error was ±0.038°C over the temperature range of −2.6 – +3.4°C. With a 11.5 mm length of the fiber optic retarder, the change rate of phase difference on temperature was 0.021 rad/°C and the measurement error was ±0.79°C over the temperature range of −8.5 – +86.5°C.     

Time-resolved imaging of latent fingerprints with nanosecond resolution

Imaging of latent fingerprints using time-resolved (TR) method offers a broader platform to eliminate the unwanted background emission. In this paper, a novel TR imaging technique is demonstrated and implemented, which facilitates the detection of latent fingerprints with nanosecond resolution. Simulated experiments were carried out with two overlapping fingerprints treated with two fluorescent powders having different lifetimes in nanosecond range. The dependence of the fluorescence emission intensity in nanosecond resolution of TR imaging is also revealed.