RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

Semigroups of matrices of intermediate growth

Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This ‘growth alternative’ conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied.     

A parametric representation of linguistic hedges in Zadeh’s fuzzy logic

This paper proposes a model for the parametric representation of linguistic hedges in Zadeh’s fuzzy logic. In this model each linguistic truth-value, which is generated from a primary term of the linguistic truth variable, is identified by a real number r depending on the primary term. It is shown that the model yields a method of efficiently computing linguistic truth expressions accompanied with a rich algebraic structure of the linguistic truth domain, namely De Morgan algebra. Also, a fuzzy logic based on the parametric representation of linguistic truth-values is introduced.     

The Matsumoto-Yor property and the structure of the Wishart distribution

This paper establishes a link between a generalized matrix Matsumoto-Yor (MY) property and the Wishart distribution. This link highlights certain conditional independence properties within blocks of the Wishart and leads to a new characterization of the Wishart distribution similar to the one recently obtained by Geiger and Heckerman but involving independences for only three pairs of block partitionings of the random matrix.In the process, we obtain two other main results. The first one is an extension of the MY independence property to random matrices of different dimensions. The second result is its converse. It extends previous characterizations of the matrix generalized inverse Gaussian and Wishart seen as a couple of distributions.We present two proofs for the generalized MY property. The first proof relies on a new version of Herz's identity for Bessel functions of matrix arguments. The second proof uses a representation of the MY property through the structure of the Wishart.     

Periodic solutions of second-order differential inclusions systems with p-Laplacian

Some existence results are obtained for periodic solutions of nonautonomous second-order differential inclusions systems with p-Laplacian.     

Experimental identification of physical parameters of fluid-filled pipes using acoustical signal processing

A method is formulated for the identification of an unknown physical parameter of a fluid-filled pipe using the measurement of sound speed in the pipe. The method uses a simple formula which provides the relationship between the sound speed and a few physical parameters of the pipe: thickness, diameter, wall material constants and fluid constants. Once the sound speed in the pipe is measured, the simple formula can be used to extract one of the unknown parameters providing the remaining ones are known.The sound speed in the pipe is measured using a 3-transducer array. In order to demonstrate the potential of the technique the results of several measurements obtained in a water-filled steel pipe are presented.The required accuracy of the measurement of sound speed and of the specification of known parameters is analysed. The accuracy depends on the unknown parameter which is to be identified. For example, if the pipe thickness is the unknown parameter, the other parameters have to be known within a very narrow margin of error. On the contrary, if the fluid properties have to be identified the needed accuracy of known parameters gets much lower.     

About Rotational Transitions and Muon Transfer in Muonic Hydrogen–Helium Systems

Hyperfine Interactions - Rotational J=1→J=0 transitions in muonic molecule, (3Heμd) J ++, in [(3Heμd)++,2e]–D and [(3Heμd)++,e]+–D collisions are considered. The...     

Phase transformation of Ni-B, Ni-P diffusion barrier deposited electrolessly on Cu interconnect

In this paper, we report that the phase transformation of Ni-B, Ni-P diffusion barriers deposited electrolessly on Cu, for the reason that the Ni-P layer is a more effective diffusion barrier than the Ni-B layer. The Ni₃B crystallized was decomposed to Ni and B₂O₃ above 400 °C and the Ni₃P crystallized was decomposed to Ni and P₂O₅ above 600 °C respectively in Ar atmosphere. Also, the Ni₃B was decomposed to Ni and free B above 400 °C and the Ni₃P was decomposed to Ni and free P above 600 °C respectively in H₂ atmosphere. The decomposed Ni formed a solid solution with Cu. The Cu diffusion occurred above 400 °C for Ni-B layer and above 600 °C for Ni-P layer, respectively. Because the decomposition temperature of Ni-P layer is about 200 °C higher than that of Ni-B layer, the Ni-P layer is a more effective barrier for Cu than the Ni-B layer.     

On-line arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.     

Tunable properties of light propagation in photonic liquid crystal fibers

Tunable properties of light propagation in photonic crystal fibers filled with liquid crystals, called photonic liquid crystal fibers (PLCFs) are presented. The propagation properties of PLCFs strongly depend on contrast between refractive indices of the solid core (pure silica glass) and liquid crystals (LCs) filing the holes of the fiber. Due to relatively strong thermo-optical effect, we can change the refractive index of the LC by changing its temperature. Numerical analysis of light propagation in PLCF, based on two simulation methods, such as finite difference (FD) and multipole method (MM) is presented. The numerical results obtained are in good agreement with our earlier experimental results presented elsewhere [1].