Software for dynamic reconfigurable order picking systems

This paper describes an approach, conceptual framework, and software architecture for dynamic reconfiguration of the order picking system. The research and development project was sponsored by the Material Handling Research Center (MHRC), a National Science Foundation sponsored Cooperative Industry/University Research Center. The storage configuration is assumed to be an in-the-aisle order picking system in which stockkeeping units (SKUs) can occupy variable capacity storage locations and stock-splitting is allowed among zones (clusters). The product mix may include multiple product families with different life cycles, correlated demand within families and commonality of demand across families.     

Adaptive solutions to the mutual exclusion problem

Summary Algorithms for mutual exclusion that adapt to the current degree of contention are developed. Afilter and a leader election algorithm form the basic building blocks. The algorithms achieve system response times that are independent of the total number of processes and governed instead by the current degree of contention. The final algorithm achieves a constant amortized system response time. Manhoi Choy was born in 1967 in Hong Kong. He received his B.Sc. in Electrical and Electronic Engineerings from the University of Hong Kong in 1989, and his M.Sc. in Computer Science from the University of California at Santa Barbara in 1991. Currently, he is working on his Ph.D. in Computer Science at the University of California at Santa Barbara. His research interests are in the areas of parallel and distributed systems, and distributed algorithms. Ambuj K. Singh is an Assistant Professor in the Department of Computer Science at the University of California, Santa Barbara. He received a Ph.D. in Computer Science from the University of Texas at Austin in 1989, an M.S. in Computer Science from Iowa State University in 1984, and a B.Tech. from the Indian Institute of Technology at Kharagpur in 1982. His research interests are in the areas of adaptive resource allocation, concurrent program development, and distributed shared memory.A preliminary version of the paper appeared in the 12th Annual ACM Symposium on Principles of Distributed ComputingWork supported in part by NSF grants CCR-9008628 and CCR-9223094     

阵列天线在OFDM系统下行链路中的应用

正交频分多址(OFDM:orthogonal frequency division multiplexing)技术由于其在多径环境下克服码间干扰的固有特点,在移动通信中已得到广泛地应用。利用阵列天线上行链路信号到达角估计实时信息,计算OFDM系统下行链路阵列天线权重,将阵列天线应用于下行链路中,最后给出系统误码率性能的计算机仿真结果。     

一种新的信号去噪方法及在激光信号中的应用

小波去噪是信号去噪的主要方法之一,目前的研究主要集中于如何选取阈值使去噪达到较好的效果,其中Donoho的阈值方法应用广泛.与传统双通道小波变换相比,三通道小波变换具有很多优势.基于这一理论,结合非参数自适应估计,推导出了一种适用于三通道小波域的自适应的信号去噪方法.实验证明,与三通道小波域中基于Donoho方法的去噪相比,该方法可以更好地保护细节以及提高重建信号的信噪比,在激光超声信号处理中也表现出良好的性能.     

Adaptive boundary control for unstable parabolic PDEs—Part II: Estimation-based designs

The certainty equivalence approach to adaptive control is commonly used with two types of identifiers: passivity-based identifiers and swapping identifiers. The “passive” (also known as “observer-based”) approach is the prevalent identification technique in existing results on adaptive control for PDEs but has so far not been used in boundary control problems. The swapping approach, prevalent in finite-dimensional adaptive control is employed here for the first time in adaptive control of PDEs. For a class of unstable parabolic PDEs we prove a separation principle result for both the passive and swapping identifiers combined with the backstepping boundary controllers. The result is applicable in any dimension. For physical reasons we restrict our attention to dimensions no higher than three. The results of the paper are illustrated by simulations.     

光波分复用技术及其应用

分析了波分复用系统的组成原理和几种分类方式,最后给出了一些基本应用形式。     

低剂量X射线照射诱导HeLa细胞存活的

采用集落形成法观察了低剂量X射线照射HeLa细胞的存活率，结果表明，小于0．5Gy的X射线照射细胞的存活率高于对照，得到了HeLa细胞存活的“兴奋效应”，而且在0．25Gy附近这种效应更为明显；低剂量D1（0．05，0．75Gy)的预照射降低了随后攻击量D2对细胞的损伤程度，反映出低剂量照射可诱发细胞存活的“适应性反应”。     

Automatic playlist generation based on tracking user’s listening habits

Algorithms for automatic playlist generation solve the problem of tedious and time consuming manual selection of musical playlists. These algorithms generate playlists according to the user’s music preferences of the moment. The user describes his preferences either by manually inputting a couple of example songs, or by defining constraints for the choice of music. The approaches to automatic playlist generation up to now were based on examining the metadata attached to the music pieces. Some of them took also the listening history into account. But anyway, a heavy accent has been put on the metadata, while the listening history, if it was used at all, had a minor role. Missings and errors in metadata frequently appear, especially when the music is acquired from the Internet. When the metadata is missing or wrong, the approaches proposed so far cannot work. Besides, entering constraints for the playlist generation can be a difficult activity. In our approach we ignored the metadata and focused on examining the listening habits. We developed two simple algorithms that track the listening habits and form a listener model—a profile of listening habits. The listener model is then used for automatic playlist generation. We developed a simple media player which tracks the listening habits and generates playlists according to the listener model. We tried the solution with a group of users. The experiment was not a successful one, but it threw some new light on the relationship between the listening habits and playlist generation.     

Fourth-Order Semi-Compact Scheme for Flow Past a Rotating and Translating Cylinder

In the present investigation, the newly developed Higher Order Semi-Compact (HOSC) finite difference scheme has been tested for its capability in capturing the very complex flow phenomenon of unsteady flow past a rotating and translating circular cylinder. The physical problem has been modeled in stream function and vorticity formulation and the obtained governing equations are transformed into curvilinear coordinates using body fitted coordinate system to enable the developed scheme to handle the non-rectangular geometry of the problem. Qualitative and quantitative comparisons have been done at low-rotation parameters and found that the results obtained are in excellent agreement with the existing literature. Then simulations have been carried out at high-rotation parameters and noticed that the HOSC scheme is able to simulate some of the flow features known experimentally but not simulated numerically to the present date.     

Linear Algebra Considerations for the Multi-Threaded Simulation of Mechanical Systems

A solution method suitable for the multi-threaded simulation ofmechanical systems represented in Cartesian coordinates isproposed and analyzed. In a state-space framework for thesolution of the Differential Algebraic Equations (DAE) ofMultibody Dynamics, the position/velocity stabilization and theacceleration computation are based on iterative solvers applied toequivalent reduced problems. The most in-depth computationalaspect analyzed is the preconditioning, i.e., the direct solutionof the reduced systems. Provided a topology index reduction is first applied to the model, the effort for the direct solution of the reduced systems is shown to be of order O(N _J ), where N _J is the number of joints in the model. The recurring theme of thepaper is the central role that the topology of the mechanicalsystem plays in the overall performance of the numericalsimulation. Based on the topology of the model, parallelcomputational threads can be established to start in the equationformulation and continue through the iterative numericalalgorithms employed for the numerical solution. Task schedulingthese parallel threads is expected to redeem real-time performancefor certain classes of complex applications.