Let X be a Hilbert bimodule over a C-algebra A and OX = A ⋊X Z. Using a finite section method we construct a sequence of completely positive contractions factoring through matrix algebras over A which act on sξs ∗ η as Schur multipliers converging to the identity. This shows immediately that for a finitely generated X the algebra OX inherits any standard approximation property such as nuclearit...

Tight cooperative control of mobile entities and resources is essential to enhance the efficiency and effectiveness of terminal operation. The paper aims at developing an integrated simulation model which integrates the traffic flow control of internal tractors and the berth operation of a container terminal for evaluation of control policies adopted. Terminal operation is modeled as a discrete...

Road trauma is an emergent global issue. There is huge disparity between the population affected by road trauma and the resource allocation. If the current trend continues, a predicted extra 5 million lives will be lost in this decade. This article aims to create an awareness of the scale of the problem of road trauma and the inequality in the resources available to address this problem. It als...

Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...

location-allocation is a combinatorial optimization problem, and is defined as non deterministic polynomial hard (np) hard optimization. therefore, solution of such a problem should be shifted from exact to heuristic or meta heuristic due to the complexity of the problem. locating medical centers and allocating injuries of an earthquake to them has high importance in earthquake disaster managem...

system designs, optimizing resource allocation to organization units, is still being considered as a complicated problem especially when there are multiple inputs and outputs related to a unit. the algorithm presented here will divide the frontiers obtained with dea. in this way, we investigate a new approach for resource allocation.

This chapter introduces the use of hybrid intelligent agents in a vessel berthing application. Vessel berthing in container terminals is regarded as a very complex, dynamic application, which requires autonomous decision-making capabilities to improve the productivity of the berths. In this chapter, the dynamic nature of the container vessel berthing system has been simulated with reinforcement...

Abstract In this work, the potentials of data-driven optimization for well-known berth allocation problem are studied. The aim robust scheduling is to derive conflict-free vessel assignments at quay a terminal, taking into account uncertainty regarding actual arrival times which may result from external influences as, e.g., cross wind and sea current. order achieve robustness, four different Ma...