Highly polarized dithiafulvenes: synthesis and nonlinear optical properties

Push-pull dithiafulvenes with reduced bond length alternation (BLA) and high optical nonlinearities have been prepared. The interplay between the proaromaticity of the donor and the structural and optical properties of these merocyanines is discussed. The donor ability of dithiafulvenes can reach that of ferrocene or dialkylaminophenyl groups.     

准二维无序系统的电子结构

对形如N_t×N_l型准二维无序系统，只考虑格点之间的最近邻跳跃积分，采用特殊的格点编号方案，在单电子近似下，系统的哈密顿量可表示为简明对称矩阵，借助豪斯荷尔德变换将其约化为对称三对角矩阵，再利用负本征值理论及传输矩阵等方法,对系统态密度、局域长度及电导等电子结构特性进行数值计算. 重点研究了准一维四平行链和五平行链无序系统， 将结果与一维单链、准一维双链及三链系统进行对比，发现随维度的增加，系统的能带有所展宽，能态密度分布发生很大的变化，其峰值数量呈偶数规律增加. 并且在能带中心处存在有局域长度大于系统大小的扩展态，处于这些态下的系统具有较大电导. 从单链到多链，相当于扩大了系统的关联范围，使系统出现了类似非对角长程关联的行为. 关键词： 准二维无序系统 态密度 局域长度 电导     

Hyperbolic spaces are of strictly negative type

We study finite metric spaces with elements picked from, and distances consistent with, ambient Riemannian manifolds. The concepts of negative type and strictly negative type are reviewed, and the conjecture that hyperbolic spaces are of strictly negative type is settled, in the affirmative. The technique of the proof is subsequently applied to show that every compact manifold of negative type must have trivial fundamental group, and to obtain a necessary criterion for product manifolds to be of negative type.

     

ADSS光缆的力学计算

介绍了ADSS光缆的力学计算，给出了光缆弧垂、张力、应变和悬长等计算公式，并对普遍采用的“悬链线”和“抛物线”两种计算方法加以比较。     

具有位相型修理的离散时间可修排队系统

本文研究了具有一般独立输入，位相型修理的离散时间可修排队系统，假定服务台对顾客的服务时间和服务台寿命服从几何分布，运用矩阵解析方法我们给出系统嵌入在到达时刻的稳态队长分布和等待时间分布，并证明这些分布均为离散位相型分布．我们也得到在广义服务时间内服务台发生故障次数的分布，证明它服从一个修正的几何分布．我们对离散时间可修排队与连续时间可修排队进行了比较，说明这两种排队系统在一些性能指标方面的区别之处．最后我们通过一些数值例子说明在这类系统中顾客的到达过程、服务时间和服务台的故障率之间的关系．     

同输入M/M/∞排队群的联合队长过程

本提出一个偏微分方程方法，用这一方法研究同输入M/M／∞排队群中的联合队长分布。在任意初始条件下，给出了瞬时联合队长分布的多元母函数，也讨论了稳态队长的联合分布及各排队系统之间的相关性。     

Design and fabrication of fluid controlled dynamic optical lens system

A novel small fluid controlled optical lens system that is capable of displaying dynamic variation of its focal length and field-of-view (FOV) is designed and fabricated. In this active lens system, appropriate volume of the optical fluid can be pumped into or out of the lens chamber to provide double-convex (DCX) or double-concave (DCV) lens effect. Simple optical imaging experiments were performed using different sets of glass lenses with fixed focal lengths to determine the optimum lens configuration required for designing a dynamic optical lens system. The experimental results obtained from the glass lenses demonstrate that a combination of a single DCX lens with three DCV lenses provides a wider FOV. The flexible membranes for fluid controlled lenses were fabricated using polydimethylsiloxane polymer material, which has good optical transparency and elasticity. A simple fluid injection system is used to vary the radius of curvature of the lenses, and thereby to change the focal length. A dynamic optical lens system with a combination of one DCX and multiple variable focal length DCV lenses as designed here can image an object with a wide range of focal length and FOV. With this fluid controlled optical system, the FOV and focal length could be continuously varied and a maximum FOV of 118.3° could be achieved. The smallest f-number (f_/#) for this fluid controlled single lens system was found to be 1.3, which corresponds to the numerical aperture value of 0.35.     

Stability of Markovian structure observed in high frequency foreign exchange data

Contrary to the common sense in economics and financial engineering, price fluctuations at very fine level of motion exhibit various evidences against the efficient market hypothesis. We attempt to investigate this issue by studying extensive amount of foreign currency exchange data for over five years at the finest level of resolution. We specifically focus on the proposed stability in binomial conditional probabilities originally found in much smaller examples of financial time series. In order to handle very large data, we have written an efficient program in C that automatically generates those conditional probabilities. It is found that the stability is maintained for extremely large time duration that covers almost the entire period. Based on the length of conditions for which the conditional probabilities are distinguishable each other, we identify the length of memory being less than 3 movements.     

Single-server queues with spatially distributed arrivals

Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The service times are independent, but arbitrarily distributed. The model generalizes the continuous cyclic polling system (the diffusion coefficient of the Brownian motion is zero in this case) and can be interpreted as a continuous version of a Markov polling system. Using Tweedie's lemma for positive recurrence of Markov chains with general state space, we show that the system is stable if and only if the traffic intensity is less than one. Moreover, we derive a stochastic decomposition result which leads to equilibrium equations for the stationary configuration of customers on the circle. Steady-state performance characteristics are determined, in particular the expected number of customers in the system as seen by a travelling server and at an arbitrary point in time.     

A decomposition result for a class of polling models

Boxma and Groenendijk have shown that the workload in polling models decomposes into two independent variables. This paper demonstrates a different type of decomposition that has an explicit multi-dimensional form. This decomposition does not apply to all polling models, but does, for example, apply to models with constant switch-over times and either exhaustive or gated service disciplines. For such models, we show that the population of customers present in the system (represented by a vector indicating the number of customers at each queue) at key time points breaks into two independent subpopulations: (1) the population of customers present in the related model with zero switch-over times; (2) another population, which is particularly easy to analyze. This result has a number of theoretical and applied implications.