级联光栅结合Sagnac环的可调谐光纤激光器

提出并验证了一种单-双波长可调谐掺铒光纤激光器。利用级联光纤布拉格光栅(Cascaded Fiber Bragg gratings,Cascaded FBGs)结合Sagnac环结构所产生的复合滤波效应,实现较高精细度滤波,并通过调节环内偏振控制器(Polarization Controller,PC),引入双折射效应,得到波长可调谐的光纤激光器。基于耦合模理论并使用传输矩阵法对该结构的传输特性进行了分析,在此基础上搭建实验系统,验证了理论分析的正确性。实验结果表明:通过调节PC,激光器输出激光的波长范围约为1 555.644～1 556.112 nm,双波长间隔的可调范围约为0.108～0.452 nm,单-双波长的边模抑制比(SMSR)均高于40 dB;在稳定性测试中,输出单-双波长激光的波长最大漂移量小于0.008 nm。该方法具有结构简单、调谐方便、易于实现且精细度较高的优点,可应用于密集波分复用及全光通信系统等领域。     

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.     

Forwarding and optical indices of 4-regular circulant networks

An all-to-all routing in a graph G is a set of oriented paths of G, with exactly one path for each ordered pair of vertices. The load of an edge under an all-to-all routing R is the number of times it is used (in either direction) by paths of R, and the maximum load of an edge is denoted by $\pi (G,R)$. The edge-forwarding index $\pi (G)$ is the minimum of $\pi (G,R)$ over all possible all-to-all routings R, and the arc-forwarding index $\overrightarrow{\pi }(G)$ is defined similarly by taking direction into consideration, where an arc is an ordered pair of adjacent vertices. Denote by $w(G,R)$ the minimum number of colours required to colour the paths of R such that any two paths having an edge in common receive distinct colours. The optical index $w(G)$ is defined to be the minimum of $w(G,R)$ over all possible R, and the directed optical index $\overrightarrow{w}(G)$ is defined similarly by requiring that any two paths having an arc in common receive distinct colours. In this paper we obtain lower and upper bounds on these four invariants for 4-regular circulant graphs with connection set $\{\pm 1,\pm s\}$, $1<s<n/2$. We give approximation algorithms with performance ratio a small constant for the corresponding forwarding index and routing and wavelength assignment problems for some families of 4-regular circulant graphs.     

Monolithically integrated 64‐channel silicon hybrid demultiplexer enabling simultaneous wavelength‐ and mode‐division‐multiplexing

A compact 64‐channel hybrid demultiplexer based on silicon‐on‐insulator nanowires is proposed and demonstrated experimentally to enable wavelength‐division‐multiplexing and mode‐division‐multiplexing simultaneously in order to realize an ultra‐large capacity on‐chip optical‐interconnect link. The present hybrid demultiplexer consists of a 4‐channel mode multiplexer constructed with cascaded asymmetrical directional‐couplers and two bi‐directional 17 × 17 arrayed‐waveguide gratings (AWGs) with 16 channels. Here each bi‐directional AWG is equivalent as two identical 1 × 16 AWGs. The measured excess loss and the crosstalk for the monolithically integrated 64‐channel hybrid demultiplexer are about ‐5 dB and ‐14 dB, respectively. Better performance can be achieved by minimizing the imperfections (particularly in AWGs) during the fabrication processes.

     

基于改进免疫遗传算法的近红外光谱变量选择方法

该文在免疫遗传算法（IGA）的基础上,提出一种改进免疫遗传算法（iIGA）用于近红外光谱波长变量的选择。该算法舍去了原算法中固定抗体相似度阈值的思想,取而代之的是抗体相似度阈值自适应,同时引入精英保留策略和贪心算法思想,使得算法朝着正确的方向进行局部性探优。将该算法在玉米的淀粉和蛋白质含量数据集上进行实验测试,建立偏最小二乘（PLS）分析模型,并与IGA、遗传算法（GA）以及全谱方法进行了对比。结果表明,在玉米淀粉含量的预测上,iIGA相较于原IGA算法,预测集均方根误差（RMSEP）从0.312 0降至0.298 0,预测集预测精度提升4.5%;在玉米蛋白质含量的预测上,RMSEP从0.124 4降至0.110 3,预测集预测精度提升11.3%。分别对预测淀粉和蛋白质模型的RMSEP值进行显著性检验,F值分别为165.22和182.05,P值分别为9.5 × 10－23和4.5 × 10－24,P值均小于0.05,因此,iIGA能显著提升模型预测精度。     

An evaluation method for nanoscale wrinkle

In this paper, a spectrum-based wrinkling analysis method via two-dimensional Fourier transformation is proposed aiming to solve the difficulty of nanoscale wrinkle evaluation. It evaluates the wrinkle characteristics including wrinkling wavelength and direction simply using a single wrinkling image. Based on this method, the evaluation results of nanoscale wrinkle characteristics show agreement with the open experimental results within an error of 6%. It is also verified to be appropriate for the macro wrinkle evaluation without scale limitations. The spectrum-based wrinkling analysis is an effective method for nanoscale evaluation, which contributes to reveal the mechanism of nanoscale wrinkling.     

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.     

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

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

DNA Nanoflowers for Multiplexed Cellular Imaging and Traceable Targeted Drug Delivery

We present a facile approach to make aptamer‐conjugated FRET (fluorescent resonance energy transfer) nanoflowers (NFs) through rolling circle replication for multiplexed cellular imaging and traceable targeted drug delivery. The NFs can exhibit multi‐fluorescence emissions by a single‐wavelength excitation as a result of the DNA matrix covalently incorporated with three dye molecules able to perform FRET. Compared with the conventional DNA nanostructure assembly, NF assembly is independent of template sequences, avoiding the otherwise complicated design of DNA building blocks assembled into nanostructures by base‐pairing. The NFs were uniform and exhibited high fluorescence intensity and excellent photostability. Combined with the ability of traceable targeted drug delivery, these colorful DNA NFs provide a novel system for applications in multiplex fluorescent cellular imaging, effective screening of drugs, and therapeutic protocol development.     

浅析影响康普顿谱线位置的因素

康普顿散射中影响康普顿谱线位置的因素是十分复杂的,文章主要针对影响康普顿谱线位置的几个因素作了理论探讨,得出影响因素主要在于:电子具有初速度会增大散射波长的改变量;束缚能的存在要减小峰值波长的改变量;双光子散射和二次散射与谱线峰值位置的关系不大,二者对峰值波长的改变是不确定的、复杂的、在连续的范围内变化的.最后对康普顿谱线位置和康普顿轮廓的理论研究和应用前景作了展望.