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.     

Synthesis and Photochemistry of Novel 3,5-Diacetyl-1,4-dihydropyridines. II [1]

In continuation of previous work some novel 3,5-diacetyl-1,4-dihydropyridine derivatives were synthesized and their photochemical behavior was studied under oxygen and argon atmosphere. Oxidation of the dihydropyridine ring and formation of pyridine derivatives was the result of the reaction. The presence of oxygen affects not only on the rate of oxidation, but also the formation of some unidentified by-products was observed on irradiation under this atmosphere.     

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.     

Methodological reflections on a three-step-design combining observation,stimulated recall and interview

In this paper a tripartite qualitative design combining abservation, stimulated recall and interview is presented and discussed. This three-step-design makes it possible to get insight into the interaction of internal and external processes when solving mathematical tasks. The data analysis depends on the research question and the methodological approach. In the light of two research projects in mathematics education two different methods of data analysis are presented and methodologically reflected.     

Combined intra-intermolecular criss-cross cycloaddition of a new fluorinated unsymmetrical allenylazine with alkynes

The reaction of a new fluorinated unsymmetrical allenylazine with dimethyl acetylenedicarboxylate and phenylacetylene affords the combined intra-intermolecular criss-cross cycloaddition products, 2,3-disubstituted-1,10-diazatricyclo[5.2.1.0^4,10]deca-2,6-diene derivatives. The products contain three fused five-membered rings with two nitrogen atoms within an unsaturated heterocyclic system. The structures were assigned using 2D NMR correlations and in the case of the phenylacetylene adduct by X-ray structure analysis.