Surface Modification of Ready-to-Use Hollow Fiber Ultrafiltration Modules for Oil/Water Separation

Reusing wastewater from oil-related industries is becoming increasingly important, especially in water-stressed oil-producing countries. Before oily wastewater can be discharged or reused, it must be properly treated, e.g., by membrane-based processes like ultrafiltration. A major issue of the applied membranes is their high fouling propensity. This paper reports on mitigating fouling inside ready-to-use ultrafiltration hollow-fiber modules used in a polishing step in oil/water separation. For this purpose, in-situ polyzwitterionic hydrogel coating was applied. The membrane performance was tested with oil nano-emulsions using a mini-plant system. The main factors influencing fouling were systematically investigated using statistical design of experiments.     

Tetranorsesquiterpenoids as Attractants of Yucca Moths to Yucca Flowers

Journal of Chemical Ecology - The obligate pollination mutualism between Yucca and yucca moths is a classical example of coevolution. Oviposition and active pollination by female yucca moths occur...     

Impact damage detection in carbon fibre composites using HTS SQUIDs and neural networks

A neural network-based data analysis tool, developed to speed the damage detection process for the NDE of impact damaged carbon fibre composites, is discussed. A feature extraction method utilising a gradient threshold search function and a feed forward neural network for pattern recognition were used to develop the system. Impact damaged carbon composite sample plates were scanned with an eddy current-based NDE setup using HTS SQUID gradiometers and double-D excitation coils. Detection of damage sites in data affected by noise spikes caused by environmental disturbances is demonstrated. Finally, a possible design for a future entirely automated scanning system is also introduced.     

Production of niobium powder by magnesiothermic reduction of niobium oxides in a cyclone reactor

In the last years, a variety of processes respectively process steps have been investigated for the production of niobium powder. This is due to the fact that niobium capacitors could be a viable alternative to tantalum capacitors from a performance, availability, and price point of view. The reduction of niobium pentoxide by magnesium results in fine powders with high specific surface area but has the disadvantages of a very exothermic nature and the formation of magnesium niobate. It is shown in this work that the application of a continuously operating cyclone reactor and the use of niobium(IV) oxide as raw material solve these problems. A good control of the highly exothermic reaction within the cyclone reactor was achieved in the cyclone reactor by the ratio between gas flow rate and powder flow rate as well as by a proper preheating of the gas.     

Moving loads on flexible structures presented in the floating frame of reference formulation

The introduction of moving loads in the Floating Frame of Reference Formulation is presented. We derive the kinematics and governing equations of motion of a general flexible multibody system and their extension to moving loads. The equivalence of convective effects with Coriolis and centripetal forces is shown. These effects are measured numerically and their significance in moving loads traveling at high speed is confirmed. A method is presented to handle discontinuities when moving loads separate from the flexible structure. The method is extended from beam models to general flexible structures obtained by means of the Finite Element Method. An interpolation method for the deformation field of the modal representation of these bodies is introduced.The work is concluded by application of the method to modern mechanical problems in numerical simulations.     

A competitive study of the pseudoflow algorithm for the minimum <Emphasis Type="Italic">s</Emphasis>–<Emphasis Type="Italic">t</Emphasis> cut problem in vision applications

Rapid advances in image acquisition and storage technology underline the need for real-time algorithms that are capable of solving large-scale image processing and computer-vision problems. The minimum s–t cut problem, which is a classical combinatorial optimization problem, is a prominent building block in many vision and imaging algorithms such as video segmentation, co-segmentation, stereo vision, multi-view reconstruction, and surface fitting to name a few. That is why finding a real-time algorithm which optimally solves this problem is of great importance. In this paper, we introduce to computer vision the Hochbaum’s pseudoflow (HPF) algorithm, which optimally solves the minimum s–t cut problem. We compare the performance of HPF, in terms of execution times and memory utilization, with three leading published algorithms: (1) Goldberg’s and Tarjan’s Push-Relabel; (2) Boykov’s and Kolmogorov’s augmenting paths; and (3) Goldberg’s partial augment-relabel. While the common practice in computer-vision is to use either BK or PRF algorithms for solving the problem, our results demonstrate that, in general, HPF algorithm is more efficient and utilizes less memory than these three algorithms. This strongly suggests that HPF is a great option for many real-time computer-vision problems that require solving the minimum s–t cut problem.     

Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity

This paper studies a new class of single-machine scheduling problems, which are faced by Just-in-Time-suppliers satisfying a given demand. In these models the processing of jobs leads to a release of a predefined number of product units into inventory. Consumption is triggered by predetermined time-varying, and product-specific demand requests. While all demands have to be fulfilled, the objective is to minimize the resulting product inventory. We investigate different subproblems of this general setting with regard to their computational complexity. For more restricted problem versions strongly polynomial time algorithms are presented. In contrast to this, NP-hardness in the strong sense is proven for more general problem versions. Moreover, for the most general version, even finding a feasible solution is shown to be strongly NP-hard.