The generalized unified computation of multidimensional discrete orthogonal transforms

By introducing a form of reorder for multidimensional data, we propose a unified fast algo-rithm that jointly employs one-dimensional W transform and multidimensional discrete polynomial trans-form to compute eleven types of multidimensional discrete orthogonal transforms, which contain three types of m-dimensional discrete cosine transforms ( m-D DCTs) ,four types of m-dimensional discrete W transforms ( m-D DWTs) ( m-dimensional Hartley transform as a special case), and four types of generalized discrete Fourier transforms ( m-D GDFTs). For real input, the number of multiplications for all eleven types of the m-D discrete orthogonal transforms needed by the proposed algorithm are only 1/m times that of the commonly used corresponding row-column methods, and for complex input, it is further reduced to 1/(2m) times. The number of additions required is also reduced considerably. Furthermore, the proposed algorithm has a simple computational structure and is also easy to be im-plemented on computer, and th     

On basic properties of fault-tolerant multi-topology routing

Multi-topology routing has recently gained popularity as a simple yet efficient traffic engineering concept. Its basic purpose is to separate different classes of network traffic, which are then transported over disjoint logical topologies. Multi-topology routing is used as a basis for implementation of an IP fast reroute scheme called Multiple Routing Configurations (MRC).MRC has a range of attractive properties, but they do come at a cost. In order to guarantee recovery from any single link or node failure in the network, MRC has to maintain several logical topologies and thus an increased amount of routing information. The number of the logical topologies in MRC need not be large; even simple heuristic algorithms often yield good results in practice. However, why this is the case is not fully understood yet.In this paper, we introduce a theoretical framework for fault-tolerant multi-topology routing (FT-MTR). MRC is a practical implementation of FT-MTR in connectionless IP networks. We use FT-MTR to study how the internal topological structure of the communication network relates to two important problems. The first problem is minimizing the number of logical topologies and thus the routing state in FT-MTR. We show how to use the sets of nodes that separate the topology graph to devise an advanced heuristic for “intelligent” construction of the logical topologies. Finding the separating sets in a topology graph is computationally demanding; we present an algorithm that performs well in tested real network topologies. We evaluate the separation-set based heuristic for the logical topology construction and show that it outperforms the known MRC heuristics.The second problem is the FT-MTR load distribution after a failure. We use the separating sets to devise a novel algorithm for failure load distribution. This algorithm does not require knowledge of the traffic demand matrix, still, our tests indicate that it performs as good as, or better than, known MRC load-distribution algorithms that do require the demand matrix as input.     

Single-Iteration Training Algorithm for Multi-Layer Feed-Forward Neural Networks

A new methodology for neural learning is presented. Only a single iteration is needed to train a feed-forward network with near-optimal results. This is achieved by introducing a key modification to the conventional multi-layer architecture. A virtual input layer is implemented, which is connected to the nominal input layer by a special nonlinear transfer function, and to the first hidden layer by regular (linear) synapses. A sequence of alternating direction singular value decompositions is then used to determine precisely the inter-layer synaptic weights. This computational paradigm exploits the known separability of the linear (inter-layer propagation) and nonlinear (neuron activation) aspects of information transfer within a neural network. Examples show that the trained neural networks generalize well.     

基于模糊控制的锂动力电池快速充电技术研究与实现

锂动力电池充电过程和具有多变量、离散性和非线性等特点,传统的PID控制很难从它的数学模型出发进行控制,而模糊控制技术可以不要数学模型进行控制。将模糊控制技术应用于充电控制,提出了模糊PID的充电模型,并与PID控制模型进行对比。仿真实验证明该充电模型具有充电时间短、鲁棒性强等特点,具有重要的实际意义和推广价值。     

永磁直线同步电机快速位置伺服控制

该文针对直接驱动式的永磁直线同步电机陕速伺服控制问题,探讨了一种基于矢量控制逆变器和光栅尺的快速位置伺服控制方案.其中,以推力、速度为内环,且动态时保持最大推力,确保位置系统中执行单元的快速响应性能,位置调节器采用Bang-Bang+ PD的双模控制算法,使系统具有平稳、快速、无静差的跟随性能,仿真验证了其可行性.最后,介绍了以嵌入式CPU为控制核心的技术实现方案.     

Performance analysis of fast GPS signal acquisition based on PMF and Window FFT

Combining the advantages of partial matched filter(PMF) and fast Fourier transform(FFT),an improved fast acquisition method for GPS C/A code is proposed.According to PMF-FFT acquisition architecture,the greater the number of PMF will bring out the more slowly amplitude decreasing of the amplitude-frequency response,the smaller scale of the corresponding PMF,and the larger computation of the FFT.In order to compensate the frequency spectrum attenuation caused by spectrum leakage and fence effect,adding window function to PMF-FFT is presented.Through comparing the influences to the acquisition performance based on rectangular,Hamming,Blackman and Rife-Vincent(Ⅲ) window functions,an improved Rife-Vincent Ⅲ windowing algorithm is recommended for the fast acquisition based on PMF-FFT.     

Advanced run-out table cooling technology based on ultra fast cooling and laminar cooling in hot strip mill

In order to meet the severe requirements of market and reduce production costs of high quality steels, advanced run-out table cooling based on ultra fast cooling (UFC) and laminar cooling (LC) was proposed and applied to industrial production. Cooling mechanism of UFC and LC was introduced first, and then the control system and control models were described. By using UFC and LC, low-cost Q345B strips had been produced in a large scale, and industrial trials of producing low-cost dual phase strips were completed successfully. Application results show that the ultra fast cooling is uniform along the strip width and length, and does not affect the flatness of strips. The run-out table cooling system runs stably with a high precision, and makes it possible for the user to develop more high quality steels with low costs.     

网络新媒体时代下大学生文化“快消”现象的研究

新媒体时代下,在大学生群体中,在校园创造良好的文化消费的环境有着重要的实际意义。如今,大专以上学生群体的互联网普及率2012年底全国占比在25.1%。高校学生已经成为庞大的网络传播者。随着新兴媒体的出现,文化传播的途径的变迁,青年群体出现了文化“快消”现象。     

Cyclic reduction algorithm for solving collocation systems

In this paper, we present cyclic reducation and FARC algorithms for solving spline collocation system. The costs of these algorithms are 0(N ²logN) and O(N ²log logN) respectively, for an N x N grid.