无源光网络标准发展及关键技术研究

无源光网络(Passive Optical Network,PON)作为当今接入网的主要技术解决方案,具有带宽使用效率高、传输距离远、抗干扰能力强等特点.通过研究PON技术的发展动态,本文首先归纳了各种PON技术的产生背景和应用特点,整理出各技术间的连接关系及主要标准;其次介绍了PON技术的帧结构,并对带宽、波长、传输模式等PON技术的主要参数进行了汇总;然后将国内外研究热点进行划分,围绕媒体访问控制协议、帧结构、动态带宽分配算法、节能机制等关键技术,阐述了其研究现状及在PON中的重要作用;最后对PON技术的发展趋势进行了展望.     

Protecting local access telecommunications networks: Toward a minimum-cost solution

The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems. In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective) covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined (less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions grow, DP gives significantly better solution times than IP.     

Carathéodory's method for a class of dynamic games

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results.     

An optical measurement of vortex shape at a free surface

We have proposed an optical method of vortex shape measurement based on Fourier transform profilometry (FTP) and verified it by experiment. The results of our experiment proposed in this paper show that FTP can efficiently reconstruct the vortex shape at a free surface and this method is suitable for wide use in studying such problems as liquid shear flow, wake of an object, flow behind a bluff body, and wetting angle.     

On effectiveness of wiretap programs in mapping social networks

Snowball sampling methods are known to be a biased toward highly connected actors and consequently produce core-periphery networks when these may not necessarily be present. This leads to a biased perception of the underlying network which can have negative policy consequences, as in the identification of terrorist networks. When snowball sampling is used, the potential overload of the information collection system is a distinct problem due to the exponential growth of the number of suspects to be monitored. In this paper, we focus on evaluating the effectiveness of a wiretapping program in terms of its ability to map the rapidly evolving networks within a covert organization. By running a series of simulation-based experiments, we are able to evaluate a broad spectrum of information gathering regimes based on a consistent set of criteria. We conclude by proposing a set of information gathering programs that achieve higher effectiveness then snowball sampling, and at a lower cost. Maksim Tsvetovat is an Assistant Professor at the Center for Social Complexity and department of Public and International Affairs at George Mason University, Fairfax, VA. He received his Ph.D. from the Computation, Organizations and Society program in the School of Computer Science, Carnegie Mellon University. His dissertation was centered on use of artificial intelligence techniques such as planning and semantic reasoning as a means of studying behavior and evolution of complex social networks, such as these of terrorist organizations. He received a Master of Science degree from University of Minnesota with a specialization in Artificial Intelligence and design of Multi-Agent Systems, and has also extensively studied organization theory and social science research methods. His research is centered on building high-fidelity simulations of social and organizational systems using concepts from distributed artificial intelligence and multi-agent systems. Other projects focus on social network analysis for mapping of internal corporate networks or study of covert and terrorist orgnaizations. Maksim’s vita and publications can be found on Kathleen M. Carley is a professor in the School of Computer Science at Carnegie Mellon University and the director of the center for Compuational Analysis of Social and Organizational Systems (CASOS) which has over 25 members, both students and research staff. Her research combines cognitive science, social networks and computer science to address complex social and organizational problems. Her specific research areas are dynamic network analysis, computational social and organization theory, adaptation and evolution, text mining, and the impact of telecommunication technologies and policy on communication, information diffusion, disease contagion and response within and among groups particularly in disaster or crisis situations. She and her lab have developed infrastructure tools for analyzing large scale dynamic networks and various multi-agent simulation systems. The infrastructure tools include ORA, a statistical toolkit for analyzing and visualizing multi-dimensional networks. ORA results are organized into reports that meet various needs such as the management report, the mental model report, and the intelligence report. Another tool is AutoMap, a text-mining systems for extracting semantic networks from texts and then cross-classifying them using an organizational ontology into the underlying social, knowledge, resource and task networks. Her simulation models meld multi-agent technology with network dynamics and empirical data. Three of the large-scale multi-agent network models she and the CASOS group have developed in the counter-terrorism area are: BioWar a city-scale dynamic-network agent-based model for understanding the spread of disease and illness due to natural epidemics, chemical spills, and weaponized biological attacks; DyNet a model of the change in covert networks, naturally and in response to attacks, under varying levels of information uncertainty; and RTE a model for examining state failure and the escalation of conflict at the city, state, nation, and international as changes occur within and among red, blue, and green forces. She is the founding co-editor with Al. Wallace of the journal Computational Organization Theory and has co-edited several books and written over 100 articles in the computational organizations and dynamic network area. Her publications can be found at: http://www.casos.cs.cmu.edu/bios/carley/publications.php     

基于MATLAB的异步电动机线性化控制系统的仿真

从异步电动机在同步旋转坐标系下的状态方程出发，在一定的条件下，对其系数矩阵简化．推出异步电动机的线性化控制模型．并基于该模型得出异步电动机的线性化控制系统．以给定电机为例，对该模型的有效性、响应用MATLAB进行仿真分析．验证的结果说明上述模型具有实用价值．     

Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.     

Influence of surfactant and lipid chain length on the solubilisation of phosphatidylcholine vesicles by micelles comprised of polyoxyethylene sorbitan monoesters

Photon correlation spectroscopy and freeze-fracture electron microscopy have been used to determine the ability of a range of micelle-forming, polyoxyethylene (20) sorbitan monoesters (Tweens) to solubilise vesicles prepared from phosphatidylcholines of different acyl chain lengths and degrees of saturation with a view to rationalising (in terms of their membrane toxicity) which of the micelle-forming surfactants to use as drug delivery vehicles. The phosphatidylcholines used were dimyristoyl-, dipalmitoyl-, distearoyl- and dioleoylphosphatidylcholine (DMPC, DPPC, DSPC and DOPC, respectively) while the nonionic polyoxyethylene sorbitan monoesters studied were polyoxyethylene (20) sorbitan monolaurate (Tween 20), a 9:1 weight ratio mixture of polyoxyethylene (20) sorbitan monopalmitate and monostearate (Tween 40), a 1:1 weight ratio mixture of polyoxyethylene (20) sorbitan monopalmitate and monostearate (Tween 60), and polyoxyethylene (20) sorbitan monooleate (Tween 80). The ability of the Tween micelles to solubilise phospholipid vesicles was found to depend both upon the length of the surfactant acyl chain and the length of the acyl chains of the phospholipid comprising the vesicle. Vesicles composed of long saturated diacyl chain phospholipids, namely DSPC and DPPC, were the most resistant to solubilisation, while those prepared from the shorter acyl chained DMPC were more readily solubilised. In terms of their solubilisation behaviour, vesicles made from phospholipids containing long, unsaturated acyl chains, namely DOPC behaved more akin to those vesicles prepared from DMPC. None of the Tween surfactants were effective at solubilising vesicles prepared from DPPC or DSPC. In contrast, there were clear differences in the ability of the various surfactants to solubilise vesicles prepared from DMPC and DOPC, in that micelles formed from Tween 20 were the most effective solubilising agent while those formed by Tween 60 were the least effective. As a consequence of these observations it was considered that Tween 60 was the surfactant least likely to cause membrane damage in vivo and, therefore, is the most suitable surfactant for use as a micellar drug delivery vehicle.