Left-forbidding cooperating distributed grammar systems

A left-forbidding grammar, introduced in this paper, is a context-free grammar, where a set of nonterminal symbols is attached to each context-free production. Such a production can rewrite a nonterminal provided that no symbol from the attached set occurs to the left of the rewritten nonterminal in the current sentential form. The present paper discusses cooperating distributed grammar systems with left-forbidding grammars as components and gives some new characterizations of language families of the Chomsky hierarchy. In addition, it also proves that twelve nonterminals are enough for cooperating distributed grammar systems working in the terminal derivation mode with two left-forbidding components (including erasing productions) to characterize the family of recursively enumerable languages.     

An adaptive, real-time, traffic monitoring system

In this paper we describe a computer vision-based traffic monitoring system able to detect individual vehicles in real-time. Our fully integrated system first obtains the main traffic variables: counting, speed and category; and then computes a complete set of statistical variables. The objective is to investigate some of the difficulties impeding existing traffic systems to achieve balanced accuracy in every condition; i.e. day and night transitions, shadows, heavy vehicles, occlusions, slow traffic and congestions. The system we present is autonomous, works for long periods of time without human intervention and adapts automatically to the changing environmental conditions. Several innovations, designed to deal with the above circumstances, are proposed in the paper: an integrated calibration and image rectification step, differentiated methods for day and night, an adaptive segmentation algorithm, a multistage shadow detection method and special considerations for heavy vehicle identification and treatment of slow traffic. A specific methodology has been developed to benchmark the accuracy of the different methods proposed.     

Adapting plans in progress in distributed supervisory work: aspects of complexity, coupling, and control

Distributed supervisory control systems often rely on complex and centralized plans to cope with a variety of unanticipated situations. Replanning requires practitioners to forgo standard procedures in favor of making simple plans without simplifying, managing task coupling, and anticipating team needs to provide decentralized and elaborate plans. This article proposes a plan classification scheme to study what features of plans facilitate or hinder adaptation and a framework to examine how features of plans influence the cognitive processes of replanning. The plan features have been assigned to the categories of plan complexity, coupling, and control. Plans are task networks sharing similar features of complexity and coupling to technical systems. The proposed framework sets out to explore how plan features influence the processes of recognizing plan disruptions, reviewing challenges and different team stances, repairing plans to resolve new risks, and reacting by coordinating team efforts to execute plans. The framework draws on the Extended Control Model (ECOM) to integrate the four processes of replanning into a set of control loops. The benefits of this framework are illustrated in the context of operator training and decision support.     

A generalized multiple layer data envelopment analysis model for hierarchical structure assessment: A case study in road safety performance evaluation

Data envelopment analysis (DEA) is a powerful analytical research tool for measuring the relative efficiency of a homogeneous set of decision making units (DMUs) by obtaining empirical estimates of relations between multiple inputs and multiple outputs related to the DMUs. To further embody multilayer hierarchical structures of these inputs and outputs in the DEA framework, which are prevalent in today’s performance evaluation activities, we propose a generalized multiple layer DEA (MLDEA) model. Starting from the input-oriented CCR model, we elaborate the mathematical deduction process of the MLDEA model, formulate the weights in each layer of the hierarchy, and indicate different types of possible weight restrictions. Meanwhile, its linear transformation is realized and further extended to the BCC form. To demonstrate the proposed MLDEA model, a case study in evaluating the road safety performance of a set of 19 European countries is carried out. By using 13 hierarchical safety performance indicators in terms of road user behavior (e.g., inappropriate or excessive speed) as the model’s input and 4 layered road safety final outcomes (e.g., road fatalities) as the output, we compute the most optimal road safety efficiency score for the set of European countries, and further analyze the weights assigned to each layer of the hierarchy. A comparison of the results with the ones from the one layer DEA model clearly indicates the usefulness and effectiveness of this improvement in dealing with a great number of performance evaluation activities with hierarchical structures.     

Suppressing intersample behavior in iterative learning control

Iterative Learning Control (ILC) is a control strategy to improve the performance of digital batch repetitive processes. Due to its digital implementation, discrete time ILC approaches do not guarantee good intersample behavior. In fact, common discrete time ILC approaches may deteriorate the intersample behavior, thereby reducing the performance of the sampled-data system. In this paper, a generally applicable multirate ILC approach is presented that enables to balance the at-sample performance and the intersample behavior. Furthermore, key theoretical issues regarding multirate systems are addressed, including the time-varying nature of the multirate ILC setup. The proposed multirate ILC approach is shown to outperform discrete time ILC in realistic simulation examples.     

Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems

We consider broadcasting in random d-regular graphs by using a simple modification of the random phone call model introduced by Karp et al. (Proceedings of the FOCS ’00, 2000). In the phone call model, in every time step, each node calls a randomly chosen neighbour to establish a communication channel to this node. The communication channels can then be used bi-directionally to transmit messages. We show that, if we allow every node to choose four distinct neighbours instead of one, then the average number of message transmissions per node required to broadcast a message efficiently decreases exponentially. Formally, we present an algorithm that has time complexity \(O(\log n)\) and uses \(O(n\log \log n)\) transmissions per message. In contrast, we show for the standard model that every distributed algorithm in a restricted address-oblivious model that broadcasts a message in time \(O(\log n)\) requires \(\Omega (n \log n{/} \log d)\) message transmissions. Our algorithm efficiently handles limited communication failures, only requires rough estimates of the number of nodes, and is robust against limited changes in the size of the network. Our results have applications in peer-to-peer networks and replicated databases.