Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K_n, is a 3‐factorization of K_n in which the components of each factor are cubes. We show that there exists a cube factorization of K_n if and only if n ≡ 16 (mod 24), thus providing a new family of uniform 3‐factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. © 2004 Wiley Periodicals, Inc.     

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.     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

Maximum norms of random sums and transient pattern formation

Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.

In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.

     

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.     

Does the beam width affect the generalized M factor of hard-edged diffracted beams?

A detailed study of the generalized M² factor of hard-edged diffracted beams based on the truncated second-order moments method, asymptotic analysis and self-convergent beam width approach is performed. The dependence of the generalized M² factor on the parameters characterizing the spatial profile, and beam truncation, etc. is analyzed.     

Nonvolatile photorefractive holographic recording in Sc:Ce:Cu:LiNbO3

In this paper experimental studies of nonvolatile photorefractive holographic recording in Ce:Cu:LiNbO₃ crystals doped with Sc(0,1,2,3 mol%) were carried out. The Sc:Ce:Cu:LiNbO₃ crystals were grown by the Czochralski method and oxidized in Nb₂O₅ powders. The nonvolatile holographic recording in Sc:Ce:Cu:LiNbO₃ crystals was realized by the two-photon fixed method. We found that the recording time of Sc:Ce:Cu:LiNbO₃ crystal became shorter with the increase of Sc doping concentration, especially doping with Sc(3 mol%), which exceeds the so-called threshold, and there was little loss of nonvolatile diffraction efficiencies between Sc(3 mol%):Ce:Cu:LiNbO₃ and Ce:Cu:LiNbO₃ crystals.     

Mathematical modeling of two-photon thermal fields in laser–solid interaction

In this paper, we have developed an analytical model to study the temperature distributions in IR optical materials heated by laser pulses. Our model takes into account the two-photon absorption (TPA). The calculations are based on a three-dimensional model of heat diffusion in solids using the integral transform method. We find out the rigorous analytical expression of the thermal field when one considers both one- and two-photon absorption. The model is valid for any laser–solid system whose interaction can be described by the generalized Beer–Lambert law. Specific results are presented for an application of the model to ZnSe sample. We find out that TPA can produce detectable temperature variation.