The paper presents two approaches to aspect assignment in a knowledgebased English-Polish machine translation (MT) system. The first method uses a set of heuristic rules based on interlingua (IR) representation provided by the system, whereas the other employs machine learning techniques. Both methods have similar performance and obtain high accuracy of over 88% on test data. The crucial differ...

Asynchronous pipelining is a form of parallelism in which processors execute diierent loop tasks (loop statements) as opposed to diierent loop iterations. An asynchronous pipeline schedule for a loop is an assignment of loop tasks to processors, plus an order on instances of tasks assigned to the same processor. This variant of pipelining is particularly relevant in distributed memory systems (...

Automatic optimization of address offset assignment for DSP applications, which reduces the number of address arithmetic instructions to meet the tight memory size restrictions and performance requirements, received a lot of attention in recent years. However, most of current research focuses at the basic block level and does not distinguish different program structures, especially loops. Moreo...

The instability mechanisms, related to the implementation of distributed delay controllers in the context of finite spectrum assignment, were studied in detail in the past few years. In this note we introduce a distributed delay control law that assigns a finite closed-loop spectrum and whose implementation with a sum of point-wise delays is safe. This property is obtained by implicitly includi...

This paper considers the problem of assigning the closed-loop eigenvalues of linear large-scale systems in a desired stable region using decentralized control. A new method for robust decentralized control of the system via eigenstructure assignment of the subsystems is given. Based on the matrix perturbation theory, sufficient conditions for eigenstructure of each isolated subsystem are derive...

A new method is presented for job assignment to and reassignment between machines in a computing cluster. Our method is based on a theoretical framework that has been experimentally tested and shown to be useful in practice. This “opportunity cost” method converts the usage of several heterogeneous resources in a machine to a single homogeneous “cost.” Assignment and reassignment is then perfor...