Line balancing in a just-in-time production environment: balancing multiple U-lines

The introduction of multiple, independent production lines has helped many firms to increase their production flexibility, provide for redundancy when equipment breaks down, reduce idle time and labor costs, and achieve many other benefits. This paper introduces and formalizes the multiple U-line balancing problem. Optimal solution methodologies are provided for Type I (minimize the number of stations for a given cycle time), Type II (minimize the cycle time for a given number of stations), and cost-minimization line-balancing problems. A branch-and-bound algorithm is also developed for the situation in which equipment requirements are dependent on the line configuration and the task assignment to stations. Computational results indicate that the greatest benefit of exploiting multiple lines occurs for smaller cycle-time problems that require higher output.     

Time‐dependent heat transfer coefficient of a wall

A time‐dependent coefficient of heat transfer is proposed for the computation of thermal power required, so that a room temperature reaches a desired value within a given time. A mathematical formulation of the room heating transient phenomenon is constructed in a dimensionless form. Using an integral approximate solution an analytical expression for this coefficient is provided and it is verified by diagrams adopted by DIN 4701. Copyright © 2003 John Wiley & Sons, Ltd.     

Algorithms for processing the group K nearest-neighbor query on distributed frameworks

Distributed and Parallel Databases - Given two datasets of points (called Query and Training), the Group (K) Nearest-Neighbor (GKNN) query retrieves (K) points of the Training with the smallest sum...     

Toward a Conceptual Emulation Framework for the Preservation of Archaeological 3D Visualizations

Through the Preservation of Complex Objects Symposia (POCOS), leading researchers and practitioners have managed to propose strategies for preserving digital art and computer games. The same is not true for the preservation of archaeological visualizations. This article therefore discusses the following question: “Can emulation be employed to effectively preserve obsolete computer visualizations from the Archaeology domain?” Guidelines and test results coming from this work would be of great benefit to the archaeological community, and would contribute knowledge to other research communities, specifically those interested in similar data types/3D visualizations.     

Relay pursuit of a maneuvering target using dynamic Voronoi diagrams

This paper addresses the problem of the pursuit of a maneuvering target by a group of pursuers distributed in the plane. This pursuit problem is solved by associating it with a Voronoi-like partitioning problem that characterizes the set of initial positions from which the target can be intercepted by a given pursuer faster than any other pursuer from the same group. In the formulation of this partitioning problem, the target does not necessarily travel along prescribed trajectories, as it is typically assumed in the literature, but, instead, it can apply an “evading” strategy in an effort to delay or, if possible, escape capture. We characterize an approximate solution to this problem by associating it with a standard Voronoi partitioning problem. Subsequently, we propose a relay pursuit strategy, that is, a special group pursuit scheme such that, at each instant of time, only one pursuer is assigned the task of capturing the maneuvering target. During the course of the relay pursuit, the pursuer–target assignment changes dynamically with time based on the (time varying) proximity relations between the pursuers and the target. This proximity information is encoded in the solution of the Voronoi-like partitioning problem. Simulation results are presented to highlight the theoretical developments.     

New assembly techniques and fast reservation protocols for optical burst switched networks based on traffic prediction

We propose new burst assembly schemes and fast reservation (FR) protocols for Optical Burst Switched (OBS) networks that are based on traffic prediction. The burst assembly schemes aim at minimizing (for a given burst size) the average delay of the packets incurred during the burst assembly process, while the fast reservation protocols aim at further reducing the end-to-end delay of the data bursts. The burst assembly techniques use a linear prediction filter to estimate the number of packet arrivals at the ingress node in the following interval, and launch a new burst into the network when a certain criterion, different for each proposed scheme, is met. The fast reservation protocols use prediction filters to estimate the expected length of the burst and the time needed for the burst assembly process to complete. A Burst Header Packet (BHP) packet carrying these estimates is sent before the burst is completed, in order to reserve bandwidth at intermediate nodes for the time interval the burst is expected to pass from these nodes. Reducing the packet aggregation delay and the time required to perform the reservations, reduces the total time needed for a packet to be transported over an OBS network and is especially important for real-time applications. We evaluate the performance of the proposed burst assembly schemes and show that a number of them outperform the previously proposed timer-based, length-based and average delay-based burst assembly schemes. We also look at the performance of the fast reservation (FR) protocols in terms of the probability of successfully establishing the reservations required to transport the burst.     

The E3 architecture: enabling future cellular networks with cognitive and self‐x capabilities

Future mobile networks are expected to be complex heterogeneous systems. On the one hand this will enable users to take advantage of a number of different access technologies. On the other hand it will seriously affect network management procedures since more extensive operations and decisions will have to be dealt with. To tackle these challenges a number of new dynamic mechanisms need to be designed. It is imperative that certain network management tasks have to be performed without human intervention to reduce the OPEX costs and achieve faster responses in different events. To achieve this goal, the introduction of self‐x functionalities, combined with cognitive mechanisms and the ability to reconfigure network entities and terminals, is required. Moreover, the introduction of a new pilot channel needs to be considered to assist the terminals in selecting the most suitable radio access technology according to their requirements. We present the functional architecture of an evolved network that was designed in the context of the EU‐funded IP project ‘E³: End‐to‐End Efficiency’. This architecture aims to enhance existing procedures usually performed in traditional operation and maintenance systems (e.g. spectrum management, network planning, configuration actions). We explain the rationale of our design and provide specific examples to illustrate the role of the different functional entities and their interfaces. A considerable part of this architecture has recently been approved as a feasibility study by the ETSI Committee Reconfigurable Radio System. Copyright © 2010 John Wiley & Sons, Ltd.     

Adaptive Resource Management Platform for Reconfigurable Networks

Users’ expectations towards technology, in terms of quality, service availability and accessibility are ever increasing. Aligned with this, the wireless world is rapidly moving towards the next generation of systems, featuring cooperating and reconfiguring capabilities for coexisting (and upcoming) Radio Access Technologies (RATs), so that to improve connectivity and reduce costs. In this respect, conventional planning and management techniques ought to be replaced by advanced schemes that consider multidimensional characteristics, increased complexity and high speeds. To this effect, means are needed capable to support scalability and to cater for advanced service features, provided to users at high rates and cost-effectively. This article provides a scheme to optimize resource management in future systems, by describing a platform that accommodates engineering mechanisms that deal with dynamic, demand driven planning and managing of spectrum and radio resources in reconfigurable networks. To do so, it first discusses the fundamentals and the approach followed in the proposed architecture and then investigates the basic functional modules. The architecture is validated through a set of use-cases that exemplify the operational applicability and efficiency in a wide range of communication scenarios.

MRI-compatible intensity-modulated force sensor for cardiac catheterization procedures

This paper presents a novel, magnetic resonance imaging (MRI)-compatible, force sensor suitable for cardiac catheterization procedures. The miniature, fiber-optic sensor is integrated with the tip of a catheter to allow the detection of interaction forces with the cardiac walls. The optical fiber light intensity is modulated when a force acting at the catheter tip deforms an elastic element, which, in turn, varies the distance between a reflector and the optical fiber. The tip sensor has an external diameter of 9 Fr (3?mm) and can be used during cardiac catheterization procedures. The sensor is able to measure forces in the range of 0-0.85?N, with relatively small hysteresis. A nonlinear method for calibration is used and real-time MRI in vivo experiments are carried out, to prove the feasibility of this low-cost sensor, enabling the detection of catheter-tip contact forces under dynamic conditions.