EPON媒体接入控制的关键技术研究

文章简要介绍了基于以及太网的无源光网络（EPON）这种新型的接入网技术，将其与基于ATM技术的无源光网络（APON）的优缺点进行了比较，并对其媒体接入控制（MAC）的关键技术测距及上行接入进行了讨论，初步提出了光网络单元（ONU）的软、硬件实现方案。     

参数设计法在铝电解电容器设计中的应用探讨

论述了参数设计法在铝电解电容器设计开发阶段的应用。文中阐明了铝电解电容器的主要质量特性(损耗因子、电容量)及芯包外径的参数设计原理,并建立了归一化函数作为优选设计方案的判据。实例证明在铝电解电容器的设计过程中应用参数设计法以减小产品质量特性变异是有效的。     

The Role of Network Topologies in the Optical Core of IP-over-WDM Networks with Static Wavelength Routing

In this paper, we present a performance analysis of network topologies for the optical core of IP-over-WDM networks with static wavelength routing. The performance analysis is focused on regular degree four topologies, and, for comparison purposes, degree three topologies are also considered. It is shown that the increase of the nodal degree from three (degree three topology with smallest diameter) to four (degree four topology with smallest diameter) improves the network performance if a larger number of wavelengths per link is available. However, the influence of wavelength interchange on the nodal degree gain is small. The performance of regular degree four topologies with smallest diameter is also compared with the performance of mesh–torus topologies (which are also degree four topologies), and it is shown that the blocking probability of degree four topologies with smallest diameter is about two orders of magnitude lower than the blocking probability of mesh–torus topologies. It is also presented a performance comparison of WDM-based networks with nodal degrees ranging from two to five and it is shown that the increase of the nodal degree from two to three leads to high nodal degree gains, while de increase of the nodal degree from four to five leads to low nodal degree gains. These results show that degree three and degree four topologies are very attractive for use in the optical core of IP-over-WDM networks.     

Novel algorithms for shared segment protection

The major challenges in designing survivable schemes are how to allocate a minimal amount of spare resources (e.g., bandwidth) using fast (e.g., polynomial-time) algorithms, and, in case a failure occurs, to be able to recover quickly from it. All existing approaches invariably make tradeoffs. We propose novel shared segment protection algorithms which make little or no compromise . We develop an elegant integer linear programming (ILP) model to determine an optimal set of segments to protect a given active path. Although the ILP approach is useful for a medium-size network, it is too time consuming for large networks. Accordingly, we also design a fast heuristic algorithm based on dynamic programming to obtain a near-optimal set of segments. Although the heuristic algorithm has a polynomial time complexity, it can achieve a bandwidth efficiency as high as some best-performing shared path protection schemes and, at the same time, much faster recovery than these shared path protection schemes. The proposed scheme is also applicable to a wide range of networking technologies, including Internet Protocol and wavelength-division multiplexing networks under the generalized multiprotocol label switched framework.     

Achieving fast and bandwidth-efficient shared-path protection

Dynamic provisioning of restorable bandwidth guaranteed paths is a challenge in the design of broad-band transport networks, especially next-generation optical networks. A common approach is called (failure-independent) path protection, whereby for every mission-critical active path to be established, a link (or node) disjoint backup path (BP) is also established. To optimize network resource utilization, shared path protection should be adopted, which often allows a new BP to share the bandwidth allocated to some existing BPs. However, it usually leads the backup paths to use too many links, with zero cost in term of additional backup bandwidth, along its route. It will violate the restoration time guarantee. In this paper, we propose novel integer linear programming (ILP) formulations by introducing two parameters (/spl epsi/ and /spl mu/) in both the sharing with complete information (SCI) scheme and the distributed partial information management (DPIM) scheme. Our results show that the proposed ILP formulations can not only improve the network resource utilization effectively, but also keep the BPs as short as possible.     

三羟甲基甲胺、季戊四醇及其二元体系固-固相变的变温红外光谱研究

利用傅里叶变温红外光谱仪分别测定了三羟甲基甲胺（TAM）、季戊四醇（PE）及其二元体系变温红外谱。实验表明，多元醇分子中羟基吸收峰随温度升高耐发生位移向高波数移动，此结果既能反映多元醇及其二体系固－固相变的温度区间，又与转变热相对应，从而揭示了多元醇及其二元体系固－固相变贮热的机理。     

Entanglement of Momentum for a Single Photon with a Single Atom

In this talk, the interaction of a single photon injected to a single atom is studied, for which initially the photon is uncorrelated with the atom. The spontaneous emitted photon will then evolve to be entangled with the atom on their continuous kinetic variables （momentum） in the process of resonant scattering. We find the relations between the entanglement and their physical control parameters （such as the linewidth of the injected photon wave packet, and that of the atomic wave packet, etc. ）, which indicates that high entanglement can be reached by broadening the scale of the atomic wave or squeezing the linewidth of the incident single-photon pulse.     

超稳定TO-8型压力传感器在气体导热系数测定实验中的应用

介绍了TO-8型压力传感器的性能及电源电路.以气体导热系数测定实验为例,用TO-8型压力传感器制成的测压装置代替旋转式麦氏真空计,利用可调针孔式放气阀对真空气压进行连续调节,实现了对测试系统真空度的实时监测.     

影响海洋微藻生产麻痹性贝类毒素的重要生态因素

麻痹性贝类毒素是有害赤潮海洋微藻生产的重要毒素种类，本文综述了影响该类毒素的主要生态因素有光，温度，盐度和营养盐4类；弱光对毒素合成有抑制作用。低温下PSP毒素产量高，通过对营养盐吸收机制的离子效应，盐度可影响毒素的生命合成，不同种类和株系对N、P限制的反应有极大差异。     

A time domain approach for avoiding crosstalk in optical blockingmultistage interconnection networks

Crosstalk in multistage interconnection networks can be avoided by ensuring that a switch is not used by two connections simultaneously, in order to support crosstalk-free communications among N inputs and N outputs, a space domain approach dilates an N×N network into one that is essentially equivalent to a 2N×2N network. Path conflicts, however may still exist in dilated networks. This paper proposes a time domain approach for avoiding crosstalk. Such an approach can be regarded as “dilating” a network in time, instead of space. More specifically, the connections that need to use the same switch are established during different time slots. This way, path conflicts are automatically avoided. The time domain dilation is useful for overcoming the limits on the network size while utilizing the high bandwidth of optical interconnects. We study the set of permutations whose crosstalk-free connections can be established in just two time slots using the time domain approach. While the space domain approach trades hardware complexity for crosstalk-free communications, the time domain approach trades time complexity. We compare the proposed time domain to the space domain approach by analyzing the tradeoffs involved in these two approaches