Three-dimensional Schwarzschild spacetimes

In the following we find all of the three-dimensional flat spacetimes which are static and rotationally symmetric.     

赝能隙导致的YBa2(Cu1-xMx)3O7-δ(M=Co,Zn)薄膜的输运性质异常

报道了两类典型元素替代的超导Y123相体系-YBa2(Cu1-xCox)3O7-δ(x=0.01,0.02)和YBa2(Cu1-yZny)3O7-δ(y=0.005,0.010)薄膜的电阻率-温度特性(ρ(T))和Hall效应(RH (T)).研究表明,Co掺杂的Y123相体系十分类似于氧欠掺杂的情况,对Co掺杂的薄膜样品,由电阻率-温度特性定义的赝能隙打开的温度T*分别为193和225K.而Zn掺杂的样品没有观察到赝能隙打开对电阻率-温度特性的影响.由Hall效应的测量和Hall角(cotθH)定义了另一个特征温度T 0,介于Tc与T*之间,这一特征温度与核磁共振(NMR)给出的赝能隙打开温度相近,说明可能源于电子自旋自由度上的能隙打开.在室温到Tc范围内,电阻率-温度特性和Hall效应分别定义了两类不同的转变温度(T*和T 0),可能分别源于电子电荷和自旋通道上的赝能隙的打开,预示着电荷和自旋自由度分别进入某种基态.     

An approach to deciding the observational equivalence of Algol-like languages

We prove that the observational equivalence of third-order finitary (i.e. recursion-free) Idealized Algol (IA) is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function f_M. Given any such f_M, we construct a real-time deterministic pushdown automaton (DPDA) that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable.     

Electrical detection of nuclear spin echoes

We show, via a straightforward calculation, that it is feasible to detect nuclear spin echoes in a ferromagnetic thin film by electrical means. The detection scheme is based on the deflection of the electronic magnetization when the nuclear magnetization reforms during an echo. This deflection is observed as a time-dependent magnetoresistive signal.     

Time-resolved imaging of latent fingerprints with nanosecond resolution

Imaging of latent fingerprints using time-resolved (TR) method offers a broader platform to eliminate the unwanted background emission. In this paper, a novel TR imaging technique is demonstrated and implemented, which facilitates the detection of latent fingerprints with nanosecond resolution. Simulated experiments were carried out with two overlapping fingerprints treated with two fluorescent powders having different lifetimes in nanosecond range. The dependence of the fluorescence emission intensity in nanosecond resolution of TR imaging is also revealed.     

Elliott-Morse measures and Kakutani's dichotomy theorem

Dedicated to the memory of John Oxtoby     

Effects of metal and “magnetic wall” on the dispersion characteristic of magnetostatic waves

The dispersion relation of magnetostatic waves tangentially magnetized to saturation ferrite film, with a “magnetic wall” condition (tangential component of microwave magnetic field is equal to zero) on one of the film surface and with a metal condition on the opposite surface is analyzed. The dispersion characteristics show that unidirectional magnetostatic waves appear in this structure: they can transfer energy in one direction only and fundamentally cannot transfer energy in the opposite direction. The dispersion-free propagation of magnetostatic waves also is possible in the structure in a wide frequency interval.     

A note on acyclic domination number in graphs of diameter two

A subset S of the vertex set of a graph G is called acyclic if the subgraph it induces in G contains no cycles. S is called an acyclic dominating set of G if it is both acyclic and dominating. The minimum cardinality of an acyclic dominating set, denoted by γ_a(G), is called the acyclic domination number of G. Hedetniemi et al. [Acyclic domination, Discrete Math. 222 (2000) 151-165] introduced the concept of acyclic domination and posed the following open problem: if δ(G) is the minimum degree of G, is γ_a(G)?δ(G) for any graph whose diameter is two? In this paper, we provide a negative answer to this question by showing that for any positive k, there is a graph G with diameter two such that γ_a(G)-δ(G)?k.