Intelligent control of avalanched photodiode to get optimal state

To improve the sensitivity of our laser radar system, we provided a set of control method for APDs (Avalanched Photodiodes) based on single-chip computer together with the circuits dealing with noise and temperature. It adjusts the voltages intelligently and maintains the APD's optimal working status.

重离子加速器注入器电源控制器的设计；Design of digital power control system applied in sector focusing cyclotron

设计了一种应用于兰州重离子加速器注入器的电源控制器,该控制器基于微处理器AT-mega128,结合MAX7000系列的复杂可编程器件和RTL8019AS网关芯片来实现对电源系统的控制,并通过RS-232总线实现与上位机的串口通信。应用结果表明,该控制器具有良好的通用性、灵活性、可远程控制及性能稳定等特点,实现了注入器磁铁电源10-4量级的幅度稳定性,使注入器引出的束流强度、束流品质、束流稳定性和供束效率等得到很大的提高。

兰州重离子加速器团簇内靶装置控制系统设计；Design of a Control System for HIRFL-CSRe Internal Target Facility in Lanzhou

介绍了兰州重离子加速器冷却储存环(HIRFL-CSR)的实验环(CSRe)团簇内靶装置控制系统的设计。该内靶系统由多种设备构成,包括喷嘴测温与加热控制子系统、真空与阀门监测/控制子系统、分子泵监测与控制子系统、数据处理与流程软件子系统等部分。该系统在内靶实验中工作状态良好,满足了内靶实验的需求。在该控制系统的支持下,2010年1月第一轮辐射电子俘获物理实验顺利完成。

基于克隆选择算法的非线性优化迭代学习控制；Clonal selection algorithm based nonlinear optimal iterative learning control

为实现对模型不确定的有约束非线性系统在特定时间域上输出轨迹的有效跟踪,将改进的克隆选择算法用于求解迭代学习控制中的优化问题。提出基于克隆选择算法的非线性优化迭代学习控制。在每次迭代运算后,一个克隆选择算法用于求解下次迭代运算中的最优输入,另一个克隆选择算法用于修正系统参考模型。仿真结果表明,该方法比GA-ILC具有更快的收敛速度,能够有效处理输入上的约束以及模型不确定问题,通过少数几次迭代学习就能取得满意的跟踪效果。

基于P2P技术的CSRe冷却装置控制系统设计；Design of Control System for CSRe Cooling Equipment Based on P2P Technology

HIRFL-CSR工程对CSRe冷却装置电子冷却部分的控制系统在实时性和可靠性方面提出了非常高的要求。电子冷却工作环境复杂,各种干扰难以预测。从电子冷却的控制系统改进出发,以实现电子冷却的自动调束为目标,以高端FPGA和ARM嵌入式系统为基础,采用P2P通讯技术和神经元网络算法来实现对电子冷却的自动控制。该控制系统对电子冷却控制的完善提供了先进的硬件平台和软件实现方案。

基于CPLD和ATMEGAL128的数字电源系统的设计；Design of Digital Power Control System Based on CPLD and ATMEGAL128

介绍了一种基于CPLD设计的电源控制模块,并且利用Atmegal128单片机和RTL8019S实现逻辑功能和远程控制功能。该电源系统主要用于重离子加速器注入器(SFC)中,具有很好的灵活性、可远程控制、性能稳定等特点。

Robust Guaranteed Cost Control for Yaw Control of Helicopter

针对具有时变不确定性且不确定性界为椭球的线性系统提出了一种新的具有自适应机制的鲁棒保性能控制器设计方法。首先,引入一个具有可由自适应律在线调整的可调参数的目标模型,通过该参数来保证由目标模型与被控模型所获得的误差系统渐近稳定。结合保证目标模型稳定性的设计,最终形成保证闭环系统稳定且控制器增益仿射依赖于可调参数的鲁棒保性能跟踪控制器。应用于安装在试验平台上的小型直升机航向控制中,仿真试验表明了该方法的有效性。

Theoretical and experimental research on time-optimal trajectory planning and control of industrial robots

提出了一种用于工业机器人时间最优轨迹规划及轨迹控制的新方法，它可以确保在关节位移、速度、加速度以及二阶加速度边界值的约束下，机器人手部沿笛卡尔空间中规定路径运动的时间阳短。在这种方法中，所规划的关节轨迹都采用二次多项式加余弦函数的形式，不仅可以保证各关节运动的位移、速度 、加速度连续而且还可以保证各关节运动的二阶加速度连续。采用这种方法，既可以提高机器人的工作效率又可以延长机器人的工作寿命以PUMA560机器人为对象进行了计算机仿真和机器人实验，结果表明这种方法是正确的有效的。它为工业机器人在非线性运动学约束条件下的时间最优轨迹规划及控制问题提供了一种较好的解决方案。

非完整约束轮式移动机器人人工场导向控制研究

导向控制在非完整约束轮式移动机器人的运动控制中具有重要作用，该文通过建立人工场的方法来引导和控制方向角，通过辅助的线速度控制前进或后退，以获得最佳收敛路径；同时考虑到实际系统速度饱和限制，从而设计出一种新的非连续位姿镇定律，并将该结果扩展，使得平面内任意点-点镇定、轨迹跟踪和路径跟踪问题均可得以实现，且对于跟踪问题仅需知道期望位姿，所得控制器不权设计简单，鲁棒性强，收敛速度快，还具有一定的普遍性。

Neural Network Exploration Using Optimal Experiment Design

We consider the question "How should one act when the only goal is to learn as much as possible?" Building on the theoretical results of Fedorov [1972] and MacKay [1992], we apply techniques from Optimal Experiment Design (OED) to guide the query/action selection of a neural network learner. We demonstrate that these techniques allow the learner to minimize its generalization error by exploring its domain efficiently and completely. We conclude that, while not a panacea, OED-based query/action has much to offer, especially in domains where its high computational costs can be tolerated.

Using Warp to Control Network Contention in Mermera

Parallel computing on a network of workstations can saturate the communication network, leading to excessive message delays and consequently poor application performance. We examine empirically the consequences of integrating a flow control protocol, called Warp control [Par93], into Mermera, a software shared memory system that supports parallel computing on distributed systems [HS93]. For an asynchronous iterative program that solves a system of linear equations, our measurements show that Warp succeeds in stabilizing the network's behavior even under high levels of contention. As a result, the application achieves a higher effective communication throughput, and a reduced completion time. In some cases, however, Warp control does not achieve the performance attainable by fixed size buffering when using a statically optimal buffer size. Our use of Warp to regulate the allocation of network bandwidth emphasizes the possibility for integrating it with the allocation of other resources, such as CPU cycles and disk bandwidth, so as to optimize overall system throughput, and enable fully-shared execution of parallel programs.

Design of miniaturized wireless sensor mote and actuator for building monitoring and control

In this paper, a wireless sensor network mote hardware design and implementation are introduced for building deployment application. The core of the mote design is based on the 8 bit AVR microcontroller, Atmega1281 and 2.4 GHz wireless communication chip, CC2420. The module PCB fabrication is using the stackable technology providing powerful configuration capability. Three main layers of size 25 mm2 are structured to form the mote; these are RF, sensor and power layers. The sensors were selected carefully to meet both the building monitoring and design requirements. Beside the sensing capability, actuation and interfacing to external meters/sensors are provided to perform different management control and data recording tasks. Experiments show that the developed mote works effectively in giving stable data acquisition and owns good communication and power performance.

Control circuits for avalanche photodiodes

Avalanche Photodiodes (APDs) have been used in a wide range of low light sensing applications such as DNA sequencing, quantum key distribution, LIDAR and medical imaging. To operate the APDs, control circuits are required to achieve the desired performance characteristics. This thesis presents the work on development of three control circuits including a bias circuit, an active quench and reset circuit and a gain control circuit all of which are used for control and performance enhancement of the APDs. The bias circuit designed is used to bias planar APDs for operation in both linear and Geiger modes. The circuit is based on a dual charge pumps configuration and operates from a 5 V supply. It is capable of providing milliamp load currents for shallow-junction planar APDs that operate up to 40 V. With novel voltage regulators, the bias voltage provided by the circuit can be accurately controlled and easily adjusted by the end user. The circuit is highly integrable and provides an attractive solution for applications requiring a compact integrated APD device. The active quench and reset circuit is designed for APDs that operate in Geiger-mode and are required for photon counting. The circuit enables linear changes in the hold-off time of the Geiger-mode APD (GM-APD) from several nanoseconds to microseconds with a stable setting step of 6.5 ns. This facilitates setting the optimal `afterpulse-free' hold-off time for any GM-APD via user-controlled digital inputs. In addition this circuit doesn’t require an additional monostable or pulse generator to reset the detector, thus simplifying the circuit. Compared to existing solutions, this circuit provides more accurate and simpler control of the hold-off time while maintaining a comparable maximum count-rate of 35.2 Mcounts/s. The third circuit designed is a gain control circuit. This circuit is based on the idea of using two matched APDs to set and stabilize the gain. The circuit can provide high bias voltage for operating the planar APD, precisely set the APD’s gain (with the errors of less than 3%) and compensate for the changes in the temperature to maintain a more stable gain. The circuit operates without the need for external temperature sensing and control electronics thus lowering the system cost and complexity. It also provides a simpler and more compact solution compared to previous designs. The three circuits designed in this project were developed independently of each other and are used for improving different performance characteristics of the APD. Further research on the combination of the three circuits will produce a more compact APD-based solution for a wide range of applications.

Research and design of high-speed advanced analogue front-ends for fibre-optic transmission systems

In the last decade, we have witnessed the emergence of large, warehouse-scale data centres which have enabled new internet-based software applications such as cloud computing, search engines, social media, e-government etc. Such data centres consist of large collections of servers interconnected using short-reach (reach up to a few hundred meters) optical interconnect. Today, transceivers for these applications achieve up to 100Gb/s by multiplexing 10x 10Gb/s or 4x 25Gb/s channels. In the near future however, data centre operators have expressed a need for optical links which can support 400Gb/s up to 1Tb/s. The crucial challenge is to achieve this in the same footprint (same transceiver module) and with similar power consumption as today’s technology. Straightforward scaling of the currently used space or wavelength division multiplexing may be difficult to achieve: indeed a 1Tb/s transceiver would require integration of 40 VCSELs (vertical cavity surface emitting laser diode, widely used for short‐reach optical interconnect), 40 photodiodes and the electronics operating at 25Gb/s in the same module as today’s 100Gb/s transceiver. Pushing the bit rate on such links beyond today’s commercially available 100Gb/s/fibre will require new generations of VCSELs and their driver and receiver electronics. This work looks into a number of state‐of-the-art technologies and investigates their performance restraints and recommends different set of designs, specifically targeting multilevel modulation formats. Several methods to extend the bandwidth using deep submicron (65nm and 28nm) CMOS technology are explored in this work, while also maintaining a focus upon reducing power consumption and chip area. The techniques used were pre-emphasis in rising and falling edges of the signal and bandwidth extensions by inductive peaking and different local feedback techniques. These techniques have been applied to a transmitter and receiver developed for advanced modulation formats such as PAM-4 (4 level pulse amplitude modulation). Such modulation format can increase the throughput per individual channel, which helps to overcome the challenges mentioned above to realize 400Gb/s to 1Tb/s transceivers.

Design Optimization and Security For Communication Networks

In this work we introduce a new mathematical tool for optimization of routes, topology design, and energy efficiency in wireless sensor networks. We introduce a vector field formulation that models communication in the network, and routing is performed in the direction of this vector field at every location of the network. The magnitude of the vector field at every location represents the density of amount of data that is being transited through that location. We define the total communication cost in the network as the integral of a quadratic form of the vector field over the network area. With the above formulation, we introduce a mathematical machinery based on partial differential equations very similar to the Maxwell's equations in electrostatic theory. We show that in order to minimize the cost, the routes should be found based on the solution of these partial differential equations. In our formulation, the sensors are sources of information, and they are similar to the positive charges in electrostatics, the destinations are sinks of information and they are similar to negative charges, and the network is similar to a non-homogeneous dielectric media with variable dielectric constant (or permittivity coefficient). In one of the applications of our mathematical model based on the vector fields, we offer a scheme for energy efficient routing. Our routing scheme is based on changing the permittivity coefficient to a higher value in the places of the network where nodes have high residual energy, and setting it to a low value in the places of the network where the nodes do not have much energy left. Our simulations show that our method gives a significant increase in the network life compared to the shortest path and weighted shortest path schemes. Our initial focus is on the case where there is only one destination in the network, and later we extend our approach to the case where there are multiple destinations in the network. In the case of having multiple destinations, we need to partition the network into several areas known as regions of attraction of the destinations. Each destination is responsible for collecting all messages being generated in its region of attraction. The complexity of the optimization problem in this case is how to define regions of attraction for the destinations and how much communication load to assign to each destination to optimize the performance of the network. We use our vector field model to solve the optimization problem for this case. We define a vector field, which is conservative, and hence it can be written as the gradient of a scalar field (also known as a potential field). Then we show that in the optimal assignment of the communication load of the network to the destinations, the value of that potential field should be equal at the locations of all the destinations. Another application of our vector field model is to find the optimal locations of the destinations in the network. We show that the vector field gives the gradient of the cost function with respect to the locations of the destinations. Based on this fact, we suggest an algorithm to be applied during the design phase of a network to relocate the destinations for reducing the communication cost function. The performance of our proposed schemes is confirmed by several examples and simulation experiments. In another part of this work we focus on the notions of responsiveness and conformance of TCP traffic in communication networks. We introduce the notion of responsiveness for TCP aggregates and define it as the degree to which a TCP aggregate reduces its sending rate to the network as a response to packet drops. We define metrics that describe the responsiveness of TCP aggregates, and suggest two methods for determining the values of these quantities. The first method is based on a test in which we drop a few packets from the aggregate intentionally and measure the resulting rate decrease of that aggregate. This kind of test is not robust to multiple simultaneous tests performed at different routers. We make the test robust to multiple simultaneous tests by using ideas from the CDMA approach to multiple access channels in communication theory. Based on this approach, we introduce tests of responsiveness for aggregates, and call it CDMA based Aggregate Perturbation Method (CAPM). We use CAPM to perform congestion control. A distinguishing feature of our congestion control scheme is that it maintains a degree of fairness among different aggregates. In the next step we modify CAPM to offer methods for estimating the proportion of an aggregate of TCP traffic that does not conform to protocol specifications, and hence may belong to a DDoS attack. Our methods work by intentionally perturbing the aggregate by dropping a very small number of packets from it and observing the response of the aggregate. We offer two methods for conformance testing. In the first method, we apply the perturbation tests to SYN packets being sent at the start of the TCP 3-way handshake, and we use the fact that the rate of ACK packets being exchanged in the handshake should follow the rate of perturbations. In the second method, we apply the perturbation tests to the TCP data packets and use the fact that the rate of retransmitted data packets should follow the rate of perturbations. In both methods, we use signature based perturbations, which means packet drops are performed with a rate given by a function of time. We use analogy of our problem with multiple access communication to find signatures. Specifically, we assign orthogonal CDMA based signatures to different routers in a distributed implementation of our methods. As a result of orthogonality, the performance does not degrade because of cross interference made by simultaneously testing routers. We have shown efficacy of our methods through mathematical analysis and extensive simulation experiments.