Study of the peak effect phenomenon in single crystals of 2H-NbSe2

The weakly pinned single crystals of the hexagonal 2H-NbSe₂ compound have emerged as prototypes for determining and characterizing the phase boundaries of the possible order-disorder transformations in the vortex matter. We present here a status report based on the ac and dc magnetization measurements of the peak effect phenomenon in three crystals of 2H-NbSe₂, in which the critical current densities vary over two orders of magnitude. We sketch the generic vortex phase diagram of a weakly pinned superconductor, which also utilizes theoretical proposals. We also establish the connection between the metastability effects and pinning.     

Reductions of interval noncooperative games

Noncooperative games of a finite number of persons with interval-valued payoff functions are considered. The concept of an equilibrium situation is introduced. A reduction of such games to deterministic noncooperative games is proposed. Properties of the reduced games are discussed. Interval antagonistic and bimatrix games are examined, and illustrative examples are considered.     

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.     

Group classification of unsteady boundary layer equations of a class of non-Newtonian fluids

Two dimensional unsteady boundary layer equations of a general model of non-Newtonian fluids were investigated in this study. In this model, the shear stress is taken as an arbitrary function of the velocity gradient. Group classification of the equations with respect to shear stress is done using two different approaches: (1) classical theory (2) equivalence transformations. Both approaches yield identical results. It is found that the principle Lie Algebra extends only for cases of Newtonian and Power-Law flows.     

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.     

Indexing text using the Ziv–Lempel trie

Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog₂n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m³logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found.     

Temperature measurements using fiber optic polarization interferometer

A novel measurement method of temperature based on the phenomena that the phase difference between principle polarization states in the optical retarder is function of temperature is described. The polarization state of optical beam is changed as it passes through the optical retarder, which depends on the temperature. The temperature of optical retarder is determined by comparison of the power difference between principal polarization states. We demonstrate successfully the temperature measurement by using a polarization maintaining fiber as the optical retarder. With a 100 mm length of the fiber optic retarder, the change rate of phase difference on temperature was 0.236 rad/°C and the measurement error was ±0.038°C over the temperature range of −2.6 – +3.4°C. With a 11.5 mm length of the fiber optic retarder, the change rate of phase difference on temperature was 0.021 rad/°C and the measurement error was ±0.79°C over the temperature range of −8.5 – +86.5°C.