Loop Erbium-Doped Fiber Amplifiers

A comprehensive study of implementing erbium-doped fiber amplifiers (EDFAs) using a loop configuration is presented. Two different schemes based on the mechanism of directing the loop output are investigated. The amplified spontaneous emission at the output port is 3 dB lower than conventional designs. This configuration is recommended for high-power EDFAs.     

Observing mathematical fluency through students’ oral responses

‘Procedural’ fluency in mathematics is often judged solely on numerical representations. ‘Mathematical’ fluency incorporates explaining and justifying as well as producing correct numerical solutions. To observe mathematical fluency, representations additional to a student’s numerical work should be considered. This paper presents analysis of students’ oral responses. Findings suggested oral responses are important vantage points from which to view fluency – particularly characteristics harder to notice through numerical work such as reasoning. Students’ oral responses were particularly important when students’ written (language) responses were absent/inconsistent. Findings also revealed the importance of everyday language alongside technical terms for observing reasoning as a fluency characteristic. Students used high modality verbs and language features, such as connectives, to explain concepts and justify their thinking. The results of this study purport that to gain a fuller picture of students’ fluency, specifically their explanations or reasoning, students’ oral responses should be analyzed, not simply numerical work.     

一种基于GMR-1 3G协议栈的自动测试方法

国际标准ISO/IEC9646定义了四种端系统抽象测试方法,其导出的测试框架无法满足第三代对地球同步轨道移动无线接口( Geostationary Earth Orbit Mobile Radio Interface,GMR-1 3G)协议栈测试关于实时性和跨平台性的要求。为了解决这一问题,对中科院提出的“钳形渡口测试法”进行研究,提出了基于GMR-1 3G协议栈的扩展“钳形渡口测试法”,并在实际的协议栈开发中得到应用。在总计与实时性相关的255个测试例执行中,测试通过率为100%。同时,由于利用统一测试框架和统一测试例脚本,既服务于仅有主机的协议逻辑流程测试又服务于仿真真实环境的板级测试,体现了较好的经济性。     

串口数据丢帧引起的雷达测试故障原因分析

为解决某雷达高度表试验过程中发生的动作高度测试异常故障,采用故障树分析法对雷达高度表和测试设备进行故障排查。经检测发现,测试设备上位机的串口通信卡接收下位机的数据中有几十帧数据帧出现CRC校验位错误,被应用程序丢弃。原因是下位机发出的数据信号存在一定程度的畸变,上位机串口通信卡的串口控制器芯片OX16PCI694适应性不足导致数据读取出错。而应用程序在健壮性设计上也存在缺陷,以数据帧数来计算时间及雷达动作高度,但丢弃数据帧时未作相应处理。采用兼容性好的串口控制器芯片16C554重新设计通信卡,在上位机与下位机通信协议中增加数据的帧序号。经试验验证故障定位正确,解决措施有效。     

新一代地铁远程通信ATS系统设计与实现

从地铁车辆安全的角度出发,提出对地铁车辆远程信号的采集方式、处理方式、控制方式、存储方式等方面进行优化设计,设计并实现了更为先进的地铁远程信号采集处理及自动监控系统(ATS系统),根据地铁车辆专属信号特性对信号采集电路与前置放大电路进行了从新设计,增强了信号的稳定性,设计并改进了轨道50Hz相敏信号的滤波电路,增强了信号的抗干扰能力,设计了光电隔离电路对采集信号进行隔离,一方面保证了单片机免受外部电源的干扰,另一方面也增强了信号的远距离传输能力,并设计了系统相关模块的接口电路,这些改进电路对于提高地铁车辆的安全可靠运行起到了积极的作用。     

Values on regular games under Kirchhoff’s laws

The Shapley value is a central notion defining a rational way to share the total worth of a cooperative game among players. We address a general framework leading to applications to games with communication graphs, where the feasible coalitions form a poset whose all maximal chains have the same length. Considering a new way to define the symmetry among players, we propose an axiomatization of the Shapley value of these games. Borrowing ideas from electric networks theory, we show that our symmetry axiom and the efficiency axiom correspond to the two Kirchhoff’s laws in the circuit associated to the Hasse diagram of feasible coalitions.     

On the properties of solutions for NTU communication situations<Superscript>1</Superscript>

We consider the model of cooperative games in which the agents can restrict the communication, because agents are sometimes divided into subgroups in a natural way, for example by their political affinities or by the companies that employ them. More particularly we focus on cooperative games with non-transferable utility, where the communication restrictions are represented by a graph defined on the set of agents. For this class of games we consider two solutions that are modifications of the Shapley value. We axiomatically characterize these two solutions and study their relation to the strong core.The authors acknowledge the financial support of El Ministerio español de Ciencia y Tecnología, FEDER and Xunta de Galicia through projects BEC2002-04102-C02-02 and PGIDIT03PXIC20701PN. We would also like to thank Dr. Jo Dee Anderson for her linguistic support.     

Active control schemes for aseismic base-isolated structures

Summary  Active control schemes are used for the protection of base-isolated and seismically excited buildings. The desired control objective is to keep the whole structure arbitrarily close to its initial configuration prior to the earthquake. The proposed methods require control force application only at the base of the structure. The controllers developed may depend on information obtained from all the floors or just the first (base) floor alone. Received 13 September 2000; accepted for publication 26 June 2001 RID=" ID=" Dedicated to the memory of Professor P.D. Panagiotopoulos with our warmest prayers. RID=" ID=" The first author wishes to thank Prof. G. Leitmann and Prof. E. Papadopoulos for the numerous helpful discussions. The same author is supported in part by the Institute of Communication and Computer Systems, NTUA, under the program Archimedes 65/1017.     

Theoretical aspects of communication in chemistry

Successful searching for publications on the basis of subject obeys rules whose relations to thermodynamics are unmistakable. As a collection of literature grows, the degree of order required increases, since the patience, time, and memory used by man to compensate for lack of order cannot keep pace. The high degrees of order that are necessary nowadays in scientific literature cannot be attained by traditional documentation methods. If modern techniques are used to improve communication, the conceptual basis of such a documentation method must be revised and adapted to suit the new possibilities. The conditions in chemistry are relatively favorable for the effective use of modern technical and conceptual methods, since the terminology has been developed further than in most other sciences.     

Routing of single-source and multiple-source queries in static sensor networks

In this paper, we introduce new geometric ad-hoc routing algorithms to route queries in static sensor networks. For single-source-queries routing, we utilise a centralised mechanism to accomplish a query using an asymptotically optimal number of transmissions O(c), where c is the length of the shortest path between the source and the destination. For multiple-source-queries routing, the number of transmissions for each query is bounded by O(clogn), where n is the number of nodes in the network. For both single-source and multiple-source queries, the routing stage is preceded by preprocessing stages requiring O(nD) and O(n²D) transmissions, respectively, where D is the diameter of the network. Our algorithm improves the complexity of the currently best known algorithms in terms of the number of transmissions for each query. The preprocessing is worthwhile if it is followed by frequent queries. We could also imagine that there is an extra initial power (say, batteries) available during the preprocessing stage or alternatively the positions of the sensors are known in advance and the preprocessing can be done before the sensors are deployed in the field. It is also worth mentioning that a lower bound of Ω(c²) transmissions has been proved if preprocessing is not allowed [F. Kuhn, R. Wattenhofer, A. Zollinger, Asymptotically optimal geometric mobile ad-hoc routing, in: Proceedings of the Sixth International Workshop on Discrete Algorithm and Methods for Mobility, Atlanta, GA, September 2002, pp. 24–33].