Disassembly sequence planning in a disassembly cell context

In this paper a two-phase approach is proposed for determining the optimal disassembly sequence when the disassembly system has a cellular configuration. Operations are first grouped into cells based on the resources they require with the goal of minimizing machine acquisition costs. The aim is to group together those operations that use similar equipment in order to achieve good utilization levels of such equipment. A maximum cell size may be imposed. Once the cells have been formed and the operations have been assigned to them, a metaheuristic algorithm (namely GRASP) is used to search for the disassembly sequence for each product that leads to the minimum number of intercellular movements. To account for uncertainty regarding the condition in which the product may arrive, each disassembly task is assumed to be required with a certain probability, regardless of the other tasks. AND/OR precedence relations among the disassembly tasks are also considered. The proposed approach is illustrated on a randomly generated disassembly problem.     

Phosphine-induced sterility in Ephestia cautella (Lepidoptera: Pyralidae)

The present study was conducted to explore the sterilizing effect of phosphine on Ephestia cautella. Three to four-day old pupae were exposed to 0, 0.007, 0.014, 0.021, 0.028, 0.035, 0.042 and 0.049 mg/l of phosphine for 24 h at room temperature. The normally developed adults of each treatment were pair mated and several physiological and genetical parameters were investigated. The results showed gradual increases with dose in pupal mortality and adult malformation. The crossing results showed no changes in adult longevity and mating frequency. However, consistent reduction was noted in the fecundity and fertility of normally emerged adults. Preliminary data indicated similar levels of inherited sterility in the F₁ adults raised from the above mentioned crosses.     

Towards the automatic generation of software diagrams

The authors formulate the criteria for drawing dataflow diagrams and describe the placement and routing algorithms used in a system called MONDRIAN. A generalized approach to the question of software diagrams is proposed based on the authors' experience with MONDRIAN and a metasystem approach to the creation of CASE (computer-aided software engineering) environments. A formal approach to the definition of software objects and their graphical representation is given. The use of location constraints as a basis for generalized layout algorithms is discussed     

Determination of Discrete-Structure Parameters of Coatings with Allowance for Residual Stresses

The authors suggest that the dimensions of a discrete section of a coating should be chosen on the basis of calculation of the critical crack spacing in cohesion cracking. This approach allows for residual stresses in the coating. The reliability of the calculation method has been verified experimentally by direct measurement of the crack spacing.     

Features of the photoconductivity of iodine-doped cotton fibers illuminated in the fundamental absorption range

The photoelectric properties of cotton fibers treated with iodine were studied in the fundamental absorption range. The samples exhibit a sublinear illumination-current characteristic and a long-term relaxation of photoconductivity (PC) after UV irradiation (hν=5 eV) of the iodine-doped fibers. A PC mechanism is proposed which explains both the nonlinear variation of photocurrent with illumination intensity and the PC decay according to a bimolecular recombination law after UV irradiation of the iodine-doped fiber in the fundamental absorption range.     

A RKHS interpolator-based graph matching algorithm

We present an algorithm for performing attributed graph matching. This algorithm is derived from a generalized framework for describing functionally expanded interpolators which is based on the theory of reproducing kernel Hilbert spaces (RKHS). The algorithm incorporates a general approach to a wide class of graph matching problems based on attributed graphs, allowing the structure of the graphs to be based on multiple sets of attributes. No assumption is made about the adjacency structure of the graphs to be matched