20GHz注入锁模光纤激光器实验

稳定、波长可调谐的窄脉冲光源是未来光时分复用/波分复用光纤通信系统的重要组成部分。报道了一个20GHz的注入锁模光纤激光器的实验。利用一个10GHz的导体体激光器作为光源，最终得到了波长可调谐的重复频率为20GHz、脉冲宽度为12.4ps的光脉冲，波长的调谐范围为16nm。     

单个波长到多个波长的变换实验

报道一种波长变换的新方法.采用此方法不需要任何泵浦光便能够直接将信号光变换成在特定谱宽内的任意多个任意波长的变换光,这对于将来的波分复用光网络提供了较大的方便.此波长变换的原理是利用色散位移光纤的非线性效应产生超连续光谱(SC)信号,由于这种SC信号携带有变换光信号,对这种连续谱进行滤波便能够得到所需要的任意频率的变换信号.此变换方式具有变换频带宽,偏振不敏感的优点。     

透射电镜薄样品倾转过程中的附加旋转及其计算

模拟透射电镜双倾台进行样品位向调整过程,推导出反映样品倾转前后其合成倾转轴(即共有菊池线对的法线)方向变化规律的计算公式,称为附加旋转角计算公式。指出,实现样品位向调整的双倾操作,等效于样品绕其合成倾转轴的倾转及该倾转轴绕Z轴(平行入射束方向)的旋转之和。利用双倾台对薄膜样品进行的系列倾转实验表明,由附加旋转角公式计算的附加旋转角和实测值相一致。还根据双倾操作过程导出了合成倾转角的计算公式,它可用于判断样品位向调整的准确度。     

A public-key cryptosystem utilizing cyclotomic fields

While it is well-known that the RSA public-key cryptosystem can be broken if its modulusN can be factored, it is not known whether there are other ways of breaking RSA. This paper presents a public-key scheme which necessarily requires knowledge of the factorization of its modulus in order to be broken. Rabin introduced the first system whose security is equivalent to the difficulty of factoring the modulus. His scheme is based on squaring (cubing) for encryption and extracting square (cube) roots for decryption. This introduces a 14 (19) ambiguity in the decryption. Various schemes which overcome this problem have been introduced for both the quadratic and cubic case. We generalize the ideas of Williams' cubic system to larger prime exponents. The cases of higher prime order introduce a number of problems not encountered in the quadratic and cubic cases, namely the existence of fundamental units in the underlying cyclotomic field, the evaluation of higher power residue symbols, and the increased difficulty of Euclidean division in the field.     

Combinatorial and approximative analyses in a spatially random division process

For a spatial characteristic, there exist commonly fat-tail frequency distributions of fragment-size and -mass of glass, areas enclosed by city roads, and pore size/volume in random packings. In order to give a new analytical approach for the distributions, we consider a simple model which constructs a fractal-like hierarchical network based on random divisions of rectangles. The stochastic process makes a Markov chain and corresponds to directional random walks with splitting into four particles. We derive a combinatorial analytical form and its continuous approximation for the distribution of rectangle areas, and numerically show a good fitting with the actual distribution in the averaging behavior of the divisions.     

“蜡烛火焰划分”实验的局限成因分析及改进研究

人教版初中化学首个探究性实验"蜡烛及其燃烧"明确指出火焰的划分方法，但在实际教学中肉眼观察法和火柴梗燃烧法对蜡烛火焰的划分存在一定的局限性。采用文献研究法和实验验证法分析其局限性的成因——燃料的析炭能力强弱、材料结构的不同等，并提出相应的改进建议。     

带连续变利率风险模型最终破产概率上界

考虑了带二元连续变利息力的Sparre Andersen风险模型.研究了积累值盈余过程的表达式与性质;在利率递增环境下,利用推广后的调节系数方程组与递归技术推导了最终破产概率的上界,结论表明得到的破产概率上界是更为一般的Lundberg指数上界.     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.     

On feedback and stable price adjustment mechanisms

Given an excess demand function of an economy, say Z(p)$Z(p)$, a stable price adjustment mechanism (SPAM) guarantees convergence of solution path p(t,_p0)$p(t,p_0)$ to an equilibrium _peq$p_{\mathit{eq}}$ solution of Z(p)=0$Z(p)=0$. Besides, all equilibrium points of Z(p)$Z(p)$ are asymptotically stable. Some SPAMs have been proposed, including Newton and transpose Jacobian methods. Despite this powerful stability property of SPAMs, their acceptation in the economics community has been limited by a lack of interpretation. This paper focuses on this issue. Specifically, feedback control theory is used to link SPAMs and price dynamics models with control inputs, which match the economically intuitive Walrasian Hypothesis (i.e., prices change with excess demand sign). Under mild conditions, it is shown the existence of a feedback function that transforms the price dynamics into a desired SPAM. Hence, a SPAM is interpreted as a fundamental (e.g., Walrasian) price dynamics under the action of a feedback function aimed to stabilize the equilibrium set of the excess demand function.     

A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions.