Random Walks And The Colored Jones Function

It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system. We give two curious formulas for the weight system of a colored Jones function: one in terms of the permanent of a matrix associated to a chord diagram, and another in terms of counting paths of intersecting chords. Electronic supplementary material to this article is available at and is accessible to authorized users. * S. G. was partially supported by an NSF and by an Israel-US BSF grant. † M. L. was partly supported by GAUK 158 grant and by the Project LN00A056 of the Czech Ministry of Education.     

Shape Optimization for Semi-Linear Elliptic Equations Based on an Embedding Domain Method

We study a class of shape optimization problems for semi-linear elliptic equations with Dirichlet boundary conditions in smooth domains in ℝ². A part of the boundary of the domain is variable as the graph of a smooth function. The problem is equivalently reformulated on a fixed domain. Continuity of the solution to the state equation with respect to domain variations is shown. This is used to obtain differentiability in the general case, and moreover a useful formula for the gradient of the cost functional in the case where the principal part of the differential operator is the Laplacian. Online publication 23 January 2004.     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

Spectral enhancement of Polish vowels to improve their identification by hearing impaired listeners

Abnormalities in the cochlear function usually cause broadening of the auditory filters which reduces the speech intelligibility. An attempt to apply a spectral enhancement algorithm has been undertaken to improve the identification of Polish vowels by subjects with cochlear-based hearing-impairment. The identification scores of natural (unprocessed) vowels and spectrally enhanced (processed) vowels has been measured for hearing-impaired subjects. It has been found that spectral enhancement improves vowel scores by about 10% for those subjects, however, a wide variation in individual performance among subjects has been observed. The overall vowels identification scores obtained were 85% for natural vowels and 96% for spectrally enhanced vowels.     

Generalized Relative Entropies as Contrast Functionals on Density Matrices

We use a class of generalized relative entropies on density matrices to obtain one-parameter families of torsion-free affine connections.     

Measurement of the K α to L α and K β to L β intensity ratios of seven elements in the atomic number range 52≤ Z ≤62 using photoionization at 59.5 keV1

The Kα to Lα and Kβ to Lβ intensity ratios of seven elements have been measured following photoionization at 59.5 keV by using a Si (Li) detector (FWHM=155 eV at 5.96 keV). The intensity ratios were determined by measuring K and L x-rays emitted from a standard target of a given element. The theoretical values of the Kα to Lα and Kβ to Lβ intensity ratios were calculated using theoretically tabulated values of shell/subshell photoionization cross sections, fluorescence yields, Coster-Kronig transition probabilities, and radiative decay rates for ηKLi≠ and ηKLi=0. The measured values are in good agreement with theoretical results. From Optika i Spektroskopiya, Vol. 97, No. 2, 2004, pp. 186–189. Original English Text Copyright ? 2004 by A. Kü?ük?nder, S?ğüt, E. Kü?ük?nder, Büyükkasap. This article was submitted by the authors in English.     

Effect of maltodextrins on the surface activity of small-molecule surfactants

We report on the effect of commercially important polysaccharides (maltodextrins with variable dextrose equivalent (Paselli SA-2, MD-6 and MD-10) on the surface activity at the air–water interface of small-molecule surfactants (sms), possessing different hydrophobic–lipophilic balance ((SSL (Na⁺), the main component is a sodium salt of stearol–lactoyl lactic acid, and PGE (080), polyglycerol ester of C18 fatty acid), and widely used in food products. A marked change of the surface activity of sms was found in the presence of maltodextrins by tensiometry. The combined data of laser multiangle light scattering and mixing calorimetry have suggested that this result is governed by specific complex formation between maltodextrins and sms in aqueous medium. Measurements have been made of the molar mass, the second virial coefficient and the enthalpy of intermolecular interactions in aqueous solutions. The implication of a degree of polymerization of maltodextrins in this phenomenon was shown. The interrelation between the molecular parameters of the formed complexes and their surface activity at the air–water interface has been revealed and discussed.     

Asymptotic properties of computationally efficient alternative estimators for a class of multivariate normal models

Parameters of Gaussian multivariate models are often estimated using the maximum likelihood approach. In spite of its merits, this methodology is not practical when the sample size is very large, as, for example, in the case of massive georeferenced data sets. In this paper, we study the asymptotic properties of the estimators that minimize three alternatives to the likelihood function, designed to increase the computational efficiency. This is achieved by applying the information sandwich technique to expansions of the pseudo-likelihood functions as quadratic forms of independent normal random variables. Theoretical calculations are given for a first-order autoregressive time series and then extended to a two-dimensional autoregressive process on a lattice. We compare the efficiency of the three estimators to that of the maximum likelihood estimator as well as among themselves, using numerical calculations of the theoretical results and simulations.     

Lyapunov-type inequalities for nonlinear systems

In this paper, by using elementary analysis, we establish some new Lyapunov-type inequalities for nonlinear systems of differential equations, special cases of which contain the well-known equations such as Emden-Fowler-type and half-linear equations. The inequalities obtained here can be used as handy tools in the study of qualitative behaviour of solutions of the associated equations.