Continuous functions with impermeable graphs

We construct a Hölder continuous function on the unit interval which coincides in uncountably (in fact continuum) many points with every function of total variation smaller than 1 passing through the origin. We conclude that this function has impermeable graph—one of the key concepts introduced in this paper—and we present further examples of functions both with permeable and impermeable graphs. Moreover, we show that typical (in the sense of Baire category) continuous functions have permeable graphs. The first example function is subsequently used to construct an example of a continuous function on the plane which is intrinsically Lipschitz continuous on the complement of the graph of a Hölder continuous function with impermeable graph, but which is not Lipschitz continuous on the plane. As another main result, we construct a continuous function on the unit interval which coincides in a set of Hausdorff dimension 1 with every function of total variation smaller than 1 which passes through the origin.     

两相流有限穿越可视图演化动力学研究

针对小管径两相流流动特性, 全新优化设计弧形对壁式电导传感器. 通过动态实验在获取传感器测量信号的基础上, 采用有限穿越可视图理论构建对应于不同流型的两相流复杂网络. 通过分析发现, 有限穿越可视图网络异速生长指数和网络平均度值的联合分布可实现对小管径两相流的流型辨识; 有限穿越可视图度分布曲线峰值可有效刻画与泡径大小分布相关的流动物理结构细节特征; 网络平均度值可表征流动结构的宏观特性; 网络异速生长指数对流体动力学复杂性十分敏感, 可揭示不同流型演化过程中的细节演化动力学特性. 两相流测量信号的有限穿越可视图分析为揭示两相流流型的形成及演化动力学机理提供了新途径. 关键词： 两相流 复杂网络 有限穿越可视图 网络异速生长指数     

Reanalysis of the photoassociation spectrum of 133Cs2 （6P3/2） lg state

Reanalysis of the photoassociation spectrum of the weakly binding （6S1/2 ＋ 6P3/2） lg 133Cs2 levels, reported in the previous study [J. Mol. Spectro. 255 （2009） 106], is performed by using a Lu-Fano graph coupled to the improved LeRoy- Bernstein formula including two additional modified terms. A more accurate coefficient （c3） is obtained for the leading long-range potential （-c3/R3） of a diatomic molecule.     

Incompatibility networks as models of scale-free small-world graphs

We make a mapping from Sierpinski fractals to a new class of networks, the incompatibility networks, which are scale-free, small-world, disassortative, and maximal planar graphs. Some relevant characteristics of the networks such as degree distribution, clustering coefficient, average path length, and degree correlations are computed analytically and found to be peculiarly rich. The method of network representation can be applied to some real-life systems making it possible to study the complexity of real networked systems within the framework of complex network theory.     

Improved frequency standard via weighted graph states

We study the spin squeezing property of weighted graph states,which can be used to improve sensitivity in interferometry.We study the time evolution of spin squeezing under local decoherence acting independently on each qubit.Based on the analysis,the spin squeezing of the weighted graph states is somehow robust in the presence of decoherence and the decoherence limit in the improvement of the interferometric sensitivity is still achievable.Furthermore,one can obtain the optimal improvement of sensitivity by tuning the weighted of each edges of the weighted graph state.     

用Java实现网上结构图实验仿真

基于线性系统仿真的连接矩阵方法，用Java语言开发面向结构图的实验仿真程序，以Applet小应用程序的形式插入网页中运行，实现了信号与系统网上实验教学中的结构图实验仿真。经试用，程序在浏览器中运行正常，可以完成一般线性系统仿真，与以MATLAB，LABView等程序开发的实验仿真程序相比，该程序运行环境简单，几乎所有常用的Web浏览器都支持Java运行，不需另行安装相应组件。对于线性系统结构图，实现了所见即所得的图形化编程环境，具有较好的人机交互性。     

Simple expressions of the reflection and transmission coefficients of fundamental Lamb waves by a rectangular notch

The scattering of Lamb waves by a two-dimensional rectangular notch is investigated for rapid inspection of defects in a structure. To derive the reflection and transmission coefficients of the scattered waves in a simple way, the scattering caused by the notch is analyzed through the composition of individual scattering processes. Linear equations corresponding to the reflection and transmission coefficients are constructed along with scattering graphs. For an illustration of the efficacy of the presented method, the scattering of fundamental symmetric and anti-symmetric modes are inspected according to the depth and width of a notch in a plate. Validity of these expressions is demonstrated by the comparison of the theoretical analysis results with those from the finite element analysis.     

Exponential networked synchronization of master-slave chaotic systems with time-varying communication topologies

The networked synchronization problem of a class of master-slave chaotic systems with time-varying communication topologies is investigated in this paper. Based on algebraic graph theory and matrix theory, a simple linear state feedback controller is designed to synchronize the master chaotic system and the slave chaotic systems with a time- varying communication topology connection. The exponential stability of the closed-loop networked synchronization error system is guaranteed by applying Lyapunov stability theory. The derived novel criteria are in the form of linear matrix inequalities (LMIs), which are easy to examine and tremendously reduce the computation burden from the feedback matrices. This paper provides an alternative networked secure communication scheme which can be extended conveniently. An illustrative example is given to demonstrate the effectiveness of the proposed networked synchronization method.     

Multi-Type Directed Scale-Free Percolation

In this paper,we study a long-range percolation model on the lattice Z d with multi-type vertices and directed edges.Each vertex x ∈ Z d is independently assigned a non-negative weight Wx and a type ψx,where(Wx) x∈Z d are i.i.d.random variables,and(ψx) x∈Z d are also i.i.d.Conditionally on weights and types,and given λ,α 0,the edges are independent and the probability that there is a directed edge from x to y is given by pxy = 1 exp(λφψ x ψ y WxWy /| x-y | α),where φij 's are entries from a type matrix Φ.We show that,when the tail of the distribution of Wx is regularly varying with exponent τ-1,the tails of the out/in-degree distributions are both regularly varying with exponent γ = α(τ-1) /d.We formulate conditions under which there exist critical values λ WCC c ∈(0,∞) and λ SCC c ∈(0,∞) such that an infinite weak component and an infinite strong component emerge,respectively,when λ exceeds them.A phase transition is established for the shortest path lengths of directed and undirected edges in the infinite component at the point γ = 2,where the out/in-degrees switch from having finite to infinite variances.The random graph model studied here features some structures of multi-type vertices and directed edges which appear naturally in many real-world networks,such as the SNS networks and computer communication networks.