ion-based software development, Commun. ACM 29, 5 (May 1986), 402-415. [Index Terms and Review]

16 disjoint. It overcomes the hypothesis of existence of a precise final goal in goal-regression systems. Motivations have been shown to be useful in guiding the behavior of a mobile robot in variously configured indoor environments. Experimental results provide evidence that correlation does exist between motivational profile and environment, in order to get optimal performances of the agent. ...

UNIFY is a new scheme for maintaining consistency between aggregated and disaggregated levels. It does away with explicit switching between aggregated and disaggregated states, and instead, maintains all state information for all levels. Units can comply with interactions at different levels. Perceivers are responsible for demanding information they need. We solve the temporal consistency probl...

As already mentioned, the key distribution can be made simple and effective with smart cards which also contain the DES algorithm. The cards are customised by the operator and sent to each individual subscriber. The key stored in the card is uniquely related to the subscribers logical directory number, which again is uniquely related to the physical line. A smart card can thus only be used by t...

New spectral methods for ratio cut partitioning and clustering. A general purpose multi-way partitioning, Proc. We introduced a new natural metric, Via-Count, to better estimate inter-partition delays for evaluating partitioning solutions. We presented K-VIA-FM, an algorithm that iteratively improve solutions for the new metric. We compared the performance of K-VIA-FM with other algorithms, bot...

A high-throughput computing policy attempts to efficiently utilize all of the resources in a cluster to generate faster overall execution. It is acceptable for jobs running on a workstation serving remote pages to execute more slowly, if other jobs benefit by achieving faster execution times through the use of network RAM, as long as throughput is maximized. Further work must be done to fully u...

The concurrency is classified into two types: structured concurrency and nonstructured concurrency. After showing that the nonstructured concurrency cannot be represented by the conventional notations in the Petri net language, a method to represent such concurrency by the language is proposed. The proposed method allows us to utilize the existing approaches for analyzing properties of a nonstr...