Ultrasonic tomographic velocimeter for visualization of axial flow fields in pipes

An ultrasonic tomographic velocimeter to provide quantitative images of axial flow fields in pipes is developed and presented in this work. To detect the flow in various directions and positions, a novel transducer configuration strategy is proposed. All-in-one transducers are mounted in two sectional planes of the pipe. In each plane, N transducers are equally spaced along the circumference. Overlapped propagation paths are introduced by the configuration strategy, and the influence of the vortex flow can be eliminated theoretically by averaging the line velocities of the overlapped paths. To achieve a fast detection speed, the projection data is collected via an electrical scan in a fan-beam mode. After rearrangement and interpolation of the projection data, the parallel beam filtered back projection (FBP) algorithm is implemented to reconstruct the axial flow field. Numerical simulations with the theoretical velocity profiles were performed. The compensation method for the vortex flow is proved to be effective and necessary, and the number of transducers required for reconstruction of common flow profiles was estimated. Accordingly, an ultrasonic tomographic velocimeter consisting of 2×12 transducers was fabricated. Experiments were conducted in the straight pipe and downstream of a single bend pipe and compared with the computational fluid dynamics (CFD) simulation results. As demonstrated, the ultrasonic tomographic velocimeter was capable of visualizing both symmetric and asymmetric axial flow fields with high reliability.     

Multi-resource scheduling for FPGA systems

In modern cloud data centers, reconfigurable devices (FPGAs) are used as an alternative to Graphics Processing Units to accelerate data-intensive computations (e.g., machine learning, image and signal processing). Currently, FPGAs are configured to execute fixed workloads, repeatedly over long periods of time. This conflicts with the needs, proper to cloud computing, to flexibly allocate different workloads and to offer the use of physical devices to multiple users. This raises the need for novel, efficient FPGA scheduling algorithms that can decide execution orders close to the optimum in a short time. In this context, we propose a novel scheduling heuristic where groups of tasks that execute together are interposed by hardware reconfigurations. Our contribution is based on gathering tasks around a high-latency task that hides the latency of tasks, within the same group, that run in parallel and have shorter latencies. We evaluated our solution on a benchmark of 37500 random workloads, synthesized from realistic designs (i.e., topology, resource occupancy). For this testbench, on average, our heuristic produces optimum makespan solutions in 47.4% of the cases. It produces acceptable solutions for moderately constrained systems (i.e., the deadline falls within 10% of the optimum makespan) in 90.1% of the cases.     

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.     

动力环境集中监控系统可靠性的提高

为实现电源设备乃至通信机房的少人或无人值守和集中维护,必须建立一套完善的电信局动力环境集中监控系统。文中结合番禺区电信局的实际,讨论了提高系统运行可靠性的几点措施,包括硬件方面与软件方面的手段,关键在于加强系统的运行管理。     

对基于交换网络分层结构的软件无线电方案的改进

通过比较各种软件无线电结构的优缺点,针对既具有交换网络结构又具有分层结构优点的基于交换网络的分层无线电结构方案,提出了部分改进思想。     

Reconfigurable hardware implementation of a phase-correlation stereoalgorithm

This paper describes the implementation of a stereo-vision system using Field Programmable Gate Arrays (FPGAs). Reconfigurable hardware, including FPGAs, is an attractive platform for implementing vision algorithms due to its ability to exploit parallelism often found in these algorithms, and due to the speed with which applications can be developed as compared to hardware. The system outputs 8-bit, subpixel disparity estimates for 256× 360 pixel images at 30,fps. A local-weighted phase correlation algorithm for stereo disparity [Fleet, D. J.: {Int. Conf. Syst. Man Cybernetics 1:48–54 (1994)] is implemented. Despite the complexity of performing correlations on multiscale, multiorientation phase data, the system runs as much as 300 times faster in hardware than its software implementation. This paper describes the hardware platform used, the algorithm, and the issues encountered during its hardware implementation. Of particular interest is the implementation of multiscale, steerable filters, which are widely used in computer vision algorithms. Several trade-offs (reducing the number of filter orientations from three to two, using fixed-point computation, changing the location of one localized low-pass filter, and using L1 instead of L2 norms) were required to both fit the design into the available hardware and to achieve video-rate processing. Finally, results from the system are given both for synthetic data sets as well as several standard stereo-pair test images.     

数字下变频器GC1012B原理及配置方法

数字下变频技术是软件无线电的一项核心技术,其性能的好坏直接影响数字接收机的精度。GC1012B是美国TI公司推出的新型数字下变频器。文中从GC1012B的结构特点和内部功能框图出发,分析其工作原理,并介绍GC1012B几个主要寄存器的配置方法,从而实现对频率、滤波模式、增益大小等参数的设置。最后给出了一个具体配置实例作为参考。     

单片机仿真系统

本文讨论单片机离线仿真系统的设计方法，其关键技术是：单片机硬件系统（ＲＡＭＲＥＧＩＳＴＥＲＳ）仿真，指令系统仿真，中断系统仿真，应用系统硬件仿真。     

A Topological Implementation for Motion Planning of a Robotic Arm

An efficient path planning algorithm based on topologic method is presented in this paper.The collision free path planning for three-joint robotic arm consists of three parts:partition of C-space,construction of CN and search for a path in CN.We mainly solved the problems of partitioning the C-space and undging the connectivity between connected blocks,etc.For the motion planning of a robotic arm with a gripper,we developed the concepts of global planning and local planning,and discussed the basic factors for constructing the planning system.In the paper,some evaluation and analysis of the complexity and reliability of the algorithm are given,together with some ideas to improve the efficiency and increase the reliability.At last,some experimental results are pesented to show the efficency and accuracy of the algorithm.