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

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

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.     

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.     

Adaptive RAKE receiver in chaos based pilot-added DS-CDMA system

This paper presents the theoretical analysis of adaptive multiuser RAKE receiver scheme in frequency selective fading channel for direct-sequence code division multiple access (DS-CDMA) system. Least mean square (LMS) algorithm is used to estimate the channel coefficients. Chaotic sequences are used as spreading sequence and corresponding bit error rate (BER) in closed form is derived for imperfect channel estimation conditions. Performances of chaotic sequences are compared with pseudorandom noise (PN) sequences. Under perfect synchronization assumption, various simulation results are shown to investigate the performance of the proposed system.     

光学频率梳非线性传输及其在相位噪声探测中的应用

光纤传递链路中相位噪声探测是基于光纤的精确射频标准传递系统中重要组成部分。为解决光纤链路相位噪声探测中节点反射干扰的问题, 本文基于广义非线性薛定谔方程, 理论上研究了窄带光学频率梳在色散位移光纤中的非线性光学传播特性。在理论分析的基础上, 结合密集波分复用架构, 提出了一种基于锁模光学频率梳进行光纤传递射频信号的相位噪声探测新技术, 克服了节点反射干扰, 给出了初步实验验证。     

Geometry of 2 × 2 hermitian matrices

LetD be a division ring which possesses an involution a → α . Assume that is a proper subfield ofD and is contained in the center ofD. It is pointed out that ifD is of characteristic not two, D is either a separable quadratic extension of F or a division ring of generalized quaternions over F and that if D is of characteristic two,D is a separable quadratic extension ofF. Thus the trace map Tr:D → F, a → a + a is always surjective, which is formerly posed as an assumption in the fundamental theorem of n×n hermitian matrices overD when n ≥ 3 and now can be deleted. WhenD is a field, the fundamental theorem of 2 × 2 hermitian matrices overD has already been proved. This paper proves the fundamental theorem of 2×2 hermitian matrices over any division ring of generalized quaternions of characteristic not two This research was completed during a visit to the Academy of Mathematics and System Sciences, Chinese Academy of Sciences.     

On the division of polynomial matrices

The main purpose of this paper is to determine two new algorithmsfor the division of the polynomial matrix B(s) R[s]^pxq by A(s) R[s]^pxp (a) based on the Laurent matrix expansion at s = =of the inverse of A(s), i.e. A(s)^–1, and (b) in a waysimilar to the one presented by Gantmacher (1959).     

光交叉连接节点的功能结构

光交叉连接(OXC)是未来波分复用光传送网实现交换与选路功能的核心部件.目前,OXC节点的物理结构得到深入研究,已经提出了一些采用不同光子器件的OXC实现方案.本文从描述光交叉连接功能的角度出发,给出一种分析OXC节点功能结构的模型,并比较各种OXC方案在功能结构上的差异。     

Commutativity of rings through a Streb's result

In this paper we investigate commutativity of rings with unity satisfying any one of the properties:

Trees and valuation rings

A subring of a division algebra is called a valuation ring of if or holds for all nonzero in . The set of all valuation rings of is a partially ordered set with respect to inclusion, having as its maximal element. As a graph is a rooted tree (called the valuation tree of ), and in contrast to the commutative case, may have finitely many but more than one vertices. This paper is mainly concerned with the question of whether each finite, rooted tree can be realized as a valuation tree of a division algebra , and one main result here is a positive answer to this question where can be chosen as a quaternion division algebra over a commutative field.