Simultaneous solving of balancing and sequencing problems with station-dependent assembly times for mixed-model assembly lines

In spite of many studies, investigating balancing and sequencing problems in Mixed-Model Assembly Line (MMAL) individually, this paper solves them simultaneously aiming to minimize total utility work. A new Mixed-Integer Linear Programming (MILP) model is developed to provide the exact solution of the problem with station-dependent assembly times. Because of NP-hardness, a Simulated Annealing (SA) is applied and compared to the Co-evolutionary Genetic Algorithm (Co-GA) from the literature. To strengthen the search process, two main hypotheses, namely simultaneous search and feasible search, are developed contrasting Co-GA. Various parameters of SA are reviewed to calibrate the algorithm by means of Taguchi design of experiments. Numerical results statistically show the efficiency and effectiveness of the proposed SA in terms of both the quality of solution and the time of achieving the best solution. Finally, the contribution of each hypothesis in this superiority is analyzed.     

Average-case analysis of the Modified Harmonic algorithm

In this paper we analyze the average-case performance of the Modified Harmonic algorithm for on-line bin packing. We first analyze the average-case performance for arbitrary distribution of item sizes over (0,1]. This analysis is based on the following result. Letf ₁ andf ₂ be two linear combinations of random variables {N _i } _i=1 ^k where theN _i 's have a joint multinomial distribution for eachn= _i=1 ^k ,N _i . LetE(f ₁) O andE(f ₂) 0. Then lim_n E(max(_{f 1},f ₂ ))/n = lim _n max(E(f ₁),E(f ₂))/n. We then consider the special case when the item sizes are uniformly distributed over (0,1]. For specific values of the parameters, the Modified Harmonic algorithm turns out to be better than the other two linear-time on-line algorithms—Next Fit and Harmonic—in both the worst case as well as the average case. We also obtain optimal values for the parameters of the algorithm from the average-case standpoint. For these values of the parameters, the average-case performance ratio is less than 1.19. This compares well with the performance ratios 1.333. and 1.2865. of the Next Fit algorithm and the Harmonic algorithm, respectively.     

A self-adjusting algorithm for byzantine agreement

Summary Byzantine Agreement is important both in the theory and practice of distributed computing. However, protocols to reach Byzantine Agreement are usually expensive both in the time required as well as in the number of messages exchanged. In this paper, we present a self-adjusting approach to the problem. The Mostly Byzantine Agreement is proposed as a more restrictive agreement problem that requires that in the consecutive attempts to reach agreement, the number of disagreements (i.e., failures to reach Byzantine Agreement) is finite. Fort faulty processes, we give an algorithm that has at mostt disagreements for 4t or more processes. Another algorithm is given forn3t+1 processes with the number of disagreements belowt ²/2. Both algorithms useO(n ³) message bits for binary value agreement. Yi Zhao is currently working on his Ph.D. degree in Computer Science at University of Houston. His research interests include fault tolerance, distributed computing, parallel computation and neural networks. He obtained his M.S. from University of Houston in 1988 and B.S. from Beijing University of Aeronautics and Astronautics in 1984, both in computer science. Farokh B. Bastani received the B. Tech. degree in electrical engineering from the Indian Institute of Technology, Bombay, India, and the M.S. and Ph.D. degrees in electrical engineering and computer science from the University of California, Berkeley. He joined the University of Houston in 1980, where he is currently an Associate Professor of Computer Science. His research interests include software design and validation techniques, distributed systems, and fault-tolerant systems. He is a member of the ACM and the IEEE and is on the editorial board of theIEEE Transactions on Software Engineering.     

Parallel depth first search. Part II. Analysis

This paper presents the analysis of a parallel formulation of depth-first search. At the heart of this parallel formulation is a dynamic work-distribution scheme that divides the work between different processors. The effectiveness of the parallel formulation is strongly influenced by the work-distribution scheme and the target architecture. We introduce the concept of isoefficiency function to characterize the effectiveness of different architectures and work-distribution schemes. Many researchers considered the ring architecture to be quite suitable for parallel depth-first search. Our analytical and experimental results show that hypercube and shared-memory architectures are significantly better. The analysis of previously known work-distribution schemes motivated the design of substantially improved schemes for ring and shared-memory architectures. In particular, we present a work-distribution algorithm that guarantees close to optimal performance on a shared-memory/-network-with-message-combining architecture (e.g. RP3). Much of the analysis presented in this paper is applicable to other parallel algorithms in which work is dynamically shared between different processors (e.g., parallel divide-and-conquer algorithms). The concept of isoefficiency is useful in characterizing the scalability of a variety of parallel algorithms.This work was supported by Army Research Office Grant No. DAAG29-84-K-0060 to the Artificial Intelligence Laboratory, and Office of Naval Research Grant N00014-86-K-0763 to the Computer Science Department at the University of Texas at Austin.     

160 t钢包翻包机结构与功能

新型钢包翻包机是九十年代从国外引进的一种专用设备,其以高效、安全、便捷等特点越来越多的应用于大型钢铁厂.本文介绍了160 t翻包机结构与功能.     

Recommending suitable learning scenarios according to learners’ preferences: An improved swarm based approach

The paper presents a new approach for recommending suitable learning paths for different learners groups. Selection of the learning path is considered as recommendations to choosing and combining the sequences of learning objects (LOs) according to learners’ preferences. Learning path can be selected by applying artificial intelligence techniques, e.g. a swarm intelligence model. If we modify and/or change some LOs in the learning path, we should rearrange the alignment of new and old LOs and reallocate pheromones to achieve effective learning recommendations. To solve this problem, a new method based on the ant colony optimisation algorithm and adaptation of the solution to the changing optimum is proposed. A simulation process with a dynamic change of learning paths when new LOs are inserted was chosen to verify the method proposed. The paper contributes with the following new developments: (1) an approach of dynamic learning paths selection based on swarm intelligence, and (2) a modified ant colony optimisation algorithm for learning paths selection. The elaborated approach effectively assist learners by helping them to reach most suitable LOs according to their preferences, and tutors – by helping them to monitor, refine, and improve e-learning modules and courses according to the learners’ behaviour.     

D301树脂分离衣康酸的工艺研究

采用弱碱性阴离子交换树脂Ｄ３０１对发酵法生产的衣康酸进行了分离研究。通过静态交换实验，研究了Ｄ３０１树脂对衣康酸的静态交换动力学，确定了传质机制和影响因素；通过动态交换实验，研究了以硫酸为洗脱剂，以氨水为再生剂的工艺过程，确定了主要工艺参数。     

On the preparation and properties of CuZSM-5 catalysts for NO decomposition

Equilibrium exchange isotherms were determined for the exchange of Cu²⁺ with NaZSM-5 at varying Cu(Ac)₂ concentrations in solutions of constant volume and zeolite weight. At low Cu²⁺ levels the solid scavenged all the copper ions. When copper could be detected in the equilibrated solutions, overexchange was observed. The extent of overexchange was higher at pH 6 than at pH 4. These results were analyzed in relation to catalytic activity.On leave from the Central Institute for Chemistry, Hungarian Academy of Sciences, H1525 Budapest, Hungary.     

CO2在全氟羧酸离子交换膜内促进传质特性的研究

本文以全氟羧酸离子交换膜为支撑体、乙二胺(EDA)为活性络合剂、制备促进传质膜。在常用的工业条件下,测定了纯CO_2以及CO_2/N_2二元混合物在该膜内的渗透通量。实测结果表明,此膜对CO_2的促进因子可达13.8,而对CO_2/N_2的分离因子高达316。本文假设促进传质过程的控制步骤为气体在膜相的扩散,据此导出了相应的机理模型,该模型与实测结果吻合良好。