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.     

Apollonius tenth problem via radius adjustment and Möbius transformations

The Apollonius Tenth Problem, as defined by Apollonius of Perga circa 200 B.C., has been useful for various applications in addition to its theoretical interest. Even though particular cases have been handled previously, a general framework for the problem has never been reported. Presented in this paper is a theory to handle the Apollonius Tenth Problem by characterizing the spatial relationship among given circles and the desired Apollonius circles. Hence, the given three circles in this paper do not make any assumption regarding on the sizes of circles and the intersection/inclusion relationship among them. The observations made provide an easy-to-code algorithm to compute any desired Apollonius circle which is computationally efficient and robust.     

Hazardous waste management problem: The case for incineration

We define the hazardous waste management problem as the combined decisions of selecting the disposal method, siting the disposal plants and deciding on the waste flow structure. The hazardous waste management problem has additional requirements depending on the selected disposal method. In this paper we focus on incineration, for which the main additional requirement is to satisfy the air pollution standards imposed by the governmental restrictions. We propose a cost-based mathematical model in which the satisfaction of air pollution standards is also incorporated. We used the Gaussian Plume equation in measuring the air pollution concentrations at population centers. A large-scale implementation of the proposed model within Turkey is provided.     

浙江省铜加工产业国际竞争力因素分析、应对思路

文章从提高铜加工产业国际竞争力角度,比较宏观地分析了浙江省铜加工产业国际竞争力提高的环境、积极与消极因素,针对性地提出了提升浙江省铜加工产业国际竞争力的应对思路。     

某半导体产品的设计和快速实现研究

研究了产品开发及快速实现过程中任务获取、任务分配、进度的协调、信息传输等相关问题,并以某半导体产品为例,进行了产品的设计和快速实现,为缩短产品开发和上市周期、提高产品的市场竞争力积累经验。     

Generation and Memory for Contextual Detail.

Generation enhances item memory but may not enhance other aspects of memory. In 12 experiments, the author investigated the effect of generation on context memory, motivated in part by the hypothesis that generation produces a trade-off in encoding item and contextual information. Participants generated some study words (e.g., hot-___) and read others (e.g., hot-cold). Generation consistently enhanced item memory but did not enhance context memory. More specifically, generation disrupted context memory for the color of the target word but did not affect context memory for location, background color, and cue-word color. The specificity of the negative generation effect in context memory argues against a general item-context trade-off. A processing account of generation meets greater success. In addition, the results provide no evidence that generation enhances recollection of contextual details. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Projection center calibration by motion

Camera calibration is the first step of three-dimensional machine vision. A fundamental parameter to be calibrated is the position of the camera projection center with respect to the image plane. This paper presents a method for the computation of the projection center position using images of a translating rigid object, taken by the camera itself.

Many works have been proposed in literature to solve the calibration problem, but this method has several desirable features. The projection center position is computed directly, independently of all other camera parameters. The dimensions and position of the object used for calibration can be completely unknown.

This method is based on a geometric relation between the projection center and the focus of expansion. The use of this property enables the problem to be split into two parts. First a suitable number of focuses of expansion are computed from the images of the translating object. Then the focuses of expansion are taken as landmarks to build a spatial back triangulation problem, the solution of which gives the projection center position.     

Geometric features of the flame propagation process for an SI engine having dual‐ignition system

Flame front surface area and enflamed volume (the volume enclosed with flame front) is theoretically analysed for a spark‐ignition engine, having cylindrical disc‐shaped combustion chamber with two spark plugs located axisymmetrically on cylinder head, between cylinder axis and cylinder wall. Spherical flame front assumption is used. A computer code is developed based on purely geometric consideration of the flame development process in combustion chamber, and is used to investigate the effects of variations of spark plugs' locations on geometric features of the flame front. A comparison has also been made with a spark‐ignition engine having one spark plug at the same location. Copyright © 2002 John Wiley & Sons, Ltd.     

Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search

The capacitated clustering problem (CCP) is the problem in which a given set of weighted objects is to be partitioned into clusters so that the total weight of objects in each cluster is less than a given value (cluster ‘capacity’). The objective is to minimize the total scatter of objects from the ‘centre’ of the cluster to which they have been allocated. A simple constructive heuristic, a R-interchange generation mechanism, a hybrid simulated annealing (SA) and tabu search (TS) algorithm which has computationally desirable features using a new non-monotonic cooling schedule, are developed. A classification of the existing SA cooling schedules is presented. The effects on the final solution quality of the initial solutions, the cooling schedule parameters and the neighbourhood search strategies are investigated. Computational results on randomly generated problems with size ranging from 50 to 100 customers indicate that the hybrid SA/TS algorithm out-performs previous simulated annealing algorithms, a simple tabu search and local descent algorithms.