CONSTRUCTION OF SOME KIESSWETTER-LIKE FUNCTIONS-THE CONTINUOUS BUT NON-DIFFERENTIABLE FUNCTION DEFINED BY QUINARY DECIMAL

In this paper, we construct some continuous but non-differentiable functions defined by quinary decimal, that are Kiesswetter-like functions. We discuss their properties, then investigate the Hausdorff dimensions of graphs of these functions and give a detailed proof.     

Discrete mathematics in primary and secondary schools in the United States

This article provides a status report on discrete mathematics in America's schools, including an overview of publications and programs that have had major impact. It discusses why discrete mathematics should be introduced in the schools and the authors' efforts to advocate, facilitate, and support the adoption of discrete mathematics topics in the schools. Their perspective is that discrete mathematics should be viewed not only as a collection of new and interesting mathematical topics, but, more importantly, as a vehicle for providing teachers with a new way to think about traditional mathematical topics and new strategies for engaging their students in the study of mathematics.     

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.     

A New Cohomology Theory of Orbifold

Based on the orbifold string theory model in physics, we construct a new cohomology ring for any almost complex orbifold. The key theorem is the associativity of this new ring. Some examples are computed.Both authors partially supported by the National Science Foundation     

Steady-state analytical solutions for the lattice boltzmann equation

A general class of analytical solutions of the lattice Boltzmann equation is derived for two-dimensional, steady-state unidirectional flows. A subset of the solutions that verifies the corresponding Navier-Stokes equations is given. It is pointed out that this class includes, e.g., the Couette and the Poiseuille flow but not, e.g., the basic Kolmogorov flow. For steady-state non-unidirectional flows, first and second order solutions of the lattice Boltzmann equation are derived. Practical consequences of the analysis are mentioned. Differences between the technique applied here and those used in some earlier works are emphasized.     

Groups in which every non-abelian subgroup is permutable

A subgroupH of a groupG is said to bepermutable ifHX=XH for every subgroupX ofG. In this paper the structure of groups in which every subgroup either is abelian or permutable is investigated. This work was done while the last author was visiting the University of Napoli Federico II. He thanks the “Dipartimento di Matematica e Applicazioni” for its financial support.     

The elastic theory of a single DNA molecule

We study the elastic responses of double-(ds) and single-stranded (ss) DNA at external force fields. A double-strand-polymer elastic model is constructed and solved by path integral methods and Monte Carlo simulations to understand the entropic elasticity, cooperative extensibility, and supercoiling property of dsDNA. The good agreement with experiments indicates that short-ranged base-pair stacking interaction is crucial for the stability and the high deformability of dsDNA. Hairpin-coil transition in ssDNA is studied with generating function method. A threshold force is needed to pull the ssDNA hairpin patterns, stabilized by base pairing and base-pair stacking, into random coils. This phase transition is predicted to be of first order for stacking potential higher than some critical level, in accordance with experimental observations.     

Improved search for $B_{s}^{0} - \overline{B}_{s}^{0}$ oscillations

An improved search for B _s ⁰ oscillations is performed in the ALEPH data sample collected during the first phase of LEP, and reprocessed in 1998. Three analyses based on complementary event selections are presented. First, decays of B _s ⁰ mesons into hadronic flavour eigenstates are fully reconstructed. This selection yields a small sample of candidates with excellent decay length and momentum resolution and hi gh average B _s ⁰ purity. Semileptonic decays with a reconstructed D _s ^- meson provide a second sample with larger statistics, high average B _s ⁰ purity, but a poorer momentum and decay length resolution due to the partial decay reconstruction. Finally, semileptonic b-hadron decays are inclusively selected and yield the data sample with the highest sensitivity to B _s ⁰ oscillations, as the much higher statistics compensate for the low average B _s ⁰ purity and poorer time resolution. A lower limit is set atps^-1 at 95% C.L., significantly lower than the expected limit of 15.2 ps^-1. Received: 21 February 2003 / Published online: 11 June 2003