Job-shop scheduling in a body shop

We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain operations of different jobs are not allowed to be processed at the same time and after processing an operation of a certain job a machine might be unavailable for a given time for operations of other jobs. As main results we will show that for three jobs and four machines the special case where only one machine is used by more than one job is already $\mathcal NP $ -hard. This also implies that the single machine scheduling problem that asks for a makespan minimal schedule of three chains of operations with delays between the operations of a chain is $\mathcal NP $ -hard. On the positive side, we present a polynomial algorithm for the two job case and a pseudo-polynomial algorithm together with an FPTAS  for an arbitrary but constant number of jobs. Hence for a constant number of jobs we fully settle the complexity status of the problem.     

Nonparametric Bayesian Image Segmentation

Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous groups. We propose a nonparametric Bayesian model for histogram clustering which automatically determines the number of segments when spatial smoothness constraints on the class assignments are enforced by a Markov Random Field. A Dirichlet process prior controls the level of resolution which corresponds to the number of clusters in data with a unique cluster structure. The resulting posterior is efficiently sampled by a variant of a conjugate-case sampling algorithm for Dirichlet process mixture models. Experimental results are provided for real-world gray value images, synthetic aperture radar images and magnetic resonance imaging data.     

Effect of Berezinskii-Kosterlitz-Thouless vortex fluctuations on the nuclear spin relaxation rate

In this work we examine the influence of the diffusive motion of vortices in highly anisotropic high-T_c superconductors near the Berezinskii-Kosterlitz-Thouless (BKT) transition temperature T _bkt on the spin-lattice relaxation rate T ₁ ^–1 .We find a jump in T ₁ ^–1 at the temperature T _bkt .     

Nanoporous Superalloy Membranes: A Review

The ability to produce metallic membrane materials with porosity on the nanoscale from Ni‐based superalloys, hitherto used exclusively for high temperature applications, has been discovered 15 years ago. The basic principle is to first convert the initial γ/γ′ microstructure, containing isolated γ′‐precipitates, into a bi‐continuous network where both phases are in themselves continuous and interpenetrate each other. Then, one of the two phases is selectively removed, so that a rigid structure consisting of the remaining phase with pores on the location of the removed phase results. This article reviews the progress made so far. In that time period, a number of ways to fabricate these unique materials have emerged, utilizing 1) single crystals and polycrystals as precursor materials as well as 2) coarsening of coherent and incoherent γ′‐precipitates to realize bi‐continuity of the microstructure. Consequently, a family of superalloy membranes has emerged with specific microstructures, properties, advantages, and limitations. It is the intention of this article to give an overview on these various manufacturing routes, as well as on resulting microstructures and properties. Finally, possible fields of applications are outlined. It is demonstrated that the particular manufacturing process from a solid to the porous material leads to certain advantages, such as the ability to structure the material in porous and solid areas as required by the application.

     

The shadow approach: An orphan detection protocol for mobile agents

Orphan detection in distributed systems is a well-researched field for which many solutions exist. These solutions exploit well defined parent-child relationships given in distributed systems. But they are not applicable in mobile agent systems, since no similar natural relationship between agents exist. Thus new protocols have to be developed. In this paper one such protocol for controlling mobile mobile agents and for orphan detection is presented. The shadow approach presented in this paper uses the idea of a placeholder (shadow) which is assigned by the agent system to each new agent. This defines an artificial relationship between agents and shadow. The shadow records the location of all dependent agents. Removing the root shadow implies that all dependent agents are declared orphan and are eventually be terminated. We introduce agent proxies that create a path from shadow to every agent. In an extension of the basic protocol we additionally allow the shadow to be mobile.The shadow approach can be used for termination of groups of agents even if the exact location of each single agent is not known.     

ID-Services: an RFID middleware architecture for mobile applications

The use of RFID middleware to support application development for and integration of RFID hardware into information systems has become quite common in RFID applications where reader devices remain stationary, which currently represents the largest part of all RFID applications in use. Another field for applying RFID technology which is offering a huge set of novel possibilities and applications are mobile applications, where readers are no longer fixed. In order to address the specific issues of mobile RFID-enabled applications and to support developers in rapid application development, we present ID-Services, an architecture for an RFID middleware that is designed to support mobile applications. The ID-Services approach has been used to implement MoVIS (Mobile Visitor Information System), a mobile application which allows museum visitors to request individually adapted multimedia information about exhibits in an intuitive way.