A note on balance vertices in trees

The notion of balanced bipartitions of the vertices in a tree T was introduced and studied by Reid (Networks 34 (1999) 264). Reid proved that the set of balance vertices of a tree T consists of a single vertex or two adjacent vertices. In this note, we give a simple proof of that result.     

Measurements of edge-uncolorability

Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let c_k be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r₃=|E|−c₃ and . We show that on one side r₃ and r₂ bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r₃ and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr₃. For k=2,3, let ζ_k denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other.     

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.     

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.     

Learning to See: Making Sense of the Mathematics of Change in Middle School

In this article, we will describe the results of a study of 6th grade students learning about the mathematics of change. The students in this study worked with software environments for the computer and the graphing calculator that included a simulation of a moving elevator, linked to a graph of its velocity vs. time. We will describe how the students and their teacher negotiated the mathematical meanings of these representations, in interaction with the software and other representational tools available in the classroom. The class developed ways of selectively attending to specific features of stacks of centimeter cubes, hand-drawn graphs, and graphs (labeled velocity vs. time) on the computer screen. In addition, the class became adept at imagining the motions that corresponded to various velocity vs. time graphs. In this article, we describe this development as a process of learning to see mathematical representations of motion. The main question this article addresses is: How do students learn to see mathematical representations in ways that are consistent with the discipline of mathematics? This revised version was published online in July 2006 with corrections to the Cover Date.     

利用弧形光栅尺测量大型转轴扭矩的原理研究

利用弧形光栅尺的旋转微位移测量功能,组建一组测量体系,用于测量巨型转轴的扭矩。采用四组相同的弧形光栅尺同时测量两截面的相对转角,通过多点测量实现误差均化,得出了消除转轴直径对测量影响的公式,使仪器的环境适应能力得到了极大地提高。根据不同的工作情况,提出了相应的动态测量扭矩的计算方程。实现了大型机械设备主传动的动力监测,为设备自动化、智能化奠定了基础。     

Rotation of a Fine Particle with Circularly Polarized Anti-Parallel Collinear Laser Beams

We have succeeded in the operation of rotating a fine particle which was held without mechanical contact by circularly polarized laser beams with opposite propagation directions. A polystyrene latex particle 11.9 μm in diameter deformed in a disk-like shape was dispersed in water, and was trapped using the anti-parallel collinear laser beams which were set up so that they had the circular polarization rotating in the same direction. It was observed that the trapped particle rotated in the same direction as the rotation of the circular polarization of light. Inversion of the rotational direction of the circular polarization of light reversed the direction of the rotation of the particle. Although the rotational speed of a particle varied significantly from particle to particle, it was found to be proportional to the laser beam intensity. A typical value for the rotational speed per beam intensity was 2.1 Hz/W.     

Families of Line-Graphs and Their Quantization

Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family L ⁿ (G). We give necessary and sufficient conditions for a line-graph to be quantisable and demonstrate that the spectra of associated quantum propagators follow the predictions of random matrices under very general conditions. Line-graphs may therefore serve as models to study the semiclassical limit (of large matrix size) of a quantum dynamics on graphs with fixed classical behaviour.     

A New Method for Rotation and Brightness Invariant Pattern Recognition Based on Modified Multiple Circular Harmonic Expansions

A new method for rotation and brightness invariant pattern recognition was proposed by applying multiple circular harmonic expansions to the joint transform correlator. The amplitudes of the multiple orders of circular harmonic expansions made from a detecting image were synthetically modified to respond to the same auto-correlation peaks. These modified circular harmonic expansions were arranged in the input plane as reference patterns together with an arbitrary target pattern, and the correlation signals between them were calculated in the subtracted joint transform correlator. The fraction of the correlation-peak intensities between the target and the references were extracted as a new discrimination parameter. This new parameter performs pattern recognition under rotation and brightness invariance with good discriminability. Its high discriminability has been proved in computer simulations using the face image patterns of many individuals.