We propose algorithms for developing (1) a rigid (constrained) and (2) a exible planetary gearbox model. The two methods are compared against each other and advantages/disadvantages of each method are discussed. The rigid model (1) has gear tooth reaction forces expressed by Lagrange multipliers. The exible approach (2) is being compared with the gear tooth forces from the rigid approach, rst w...

Work ows deal with the automation of business processes in which documents, data and tasks are transferred among participant roles according to a de ned set of rules to achieve a common goal. Workow management systems (WFMS) have mainly focused on implementing the control ow, paying few attention to the data ow. However, data-intensive work ow applications require advanced data handling capabil...

High Performance Distributed Computing (HPDC) applications require low-latency and high-throughput communication services and HPDC applications have diierent Quality of Service (QOS) requirements (e.g., bandwidth requirement, ow/error control algorithms, etc.). The communication services provided by traditional message-passing systems are xed and thus can not be changed to meet the requirements...

XML is arising as a new format to represent the enterprises' business processes, since it is a exible and interchangeable language. In the work ow area, one of the most discussed questions is the evolution of the work ow representations, in order to meet new requirements. Despite the number of existing proposals, none of them deals with evolution of work ows that use the XML syntax. In this pap...

|Precoding at the transmitter side is a practicable method for transmission over intersymbol interference channels. In contrast to decision{feedback equalization no error propagation occurs and coded modulation can be applied as for the intersymbol interference free channel. In this paper, Tomlinson{Harashima precoding and exible precoding are analyzed and compared. The dualities and di erences...

Using the Trellis human/computer interaction model as an implementation vehicle, we demonstrate how to use concurrency-supporting hypertext to provide visual displays of the execution ows through a parallel Lisp program. In addition to displays, the hypertext interface allows injection of control ow into an otherwise functional computation, and therefore provides reader control over the order o...

We show that an "-approximate solution of the cost-constrained K-commodity ow problem on an N-nodeM-arc network G can be computed by sequentially solving O K(" 2 + logK) logM log(" 1 K) single-commodity minimum-cost ow problems on the same network. In particular, an approximate minimumcost multicommodity ow can be computed in ~ O(" 2 KNM) running time, where the notation ~ O( ) means \up to log...

A novel integer linear programming (ILP) formulation for resource-constrained scheduling problems is presented. Existing ILP-based methods for the same problem typically have a complexity (measured in terms of the number of unknown integer variables) that is proportional to the latency bound of the problem. Hence, they are restricted in scope (e.g., high-level synthesis). Our approach consists ...

We present a ̄exible framework that enables work ̄ow systems to adapt to changing conditions. The model is designed to reveal key aspects of the tasks involved in representing and enacting business processes. These fundamental characteristics are identi®ed as state, behaviour, distribution, coordination and enactment. By isolating such core concepts in a way that allows them to be varied, we ope...

This paper presents an eecient algorithm for solving the xpoints that arise in complex program analysis based on abstract interpretation. The algorithm behaves like those based upon interval analysis of a ow graph, but without requiring the ow graph to be given a priori. In the general case, the structure of the x-point computation is not known prior to analysis. In the algorithm, the entailmen...