The periodic table: contest and exhibition

The systemization and organization of ideas and concepts is an integral part of science. In chemistry, the organization of the periodic table of the chemical elements in the 1860s was one of the greatest scientific breakthroughs ever made and in fact during the 20th century it became a universally recognized scientific icon (1). The periodic table is the fundamental classificatory scheme of the elements and summarizes the realm of chemistry (2). Simply knowing the position of an element in the periodic table tells us about its properties and is usually enough to predict how the element will behave in a wide variety of different situations or reactions (1). Based on this potential mine of information, it is possible to make reliable predictions of the properties of the compounds that each element forms. Nowadays, the concept of the periodic table is starting to interact with other sciences and reports of periodic tables of amino acids (3), genetic codes (4), protein structures (5), and biology (6) can be found in the specialized literature. Symbiosis between science and art, for example, “The Periodic Table of The Elephants” (7), can also be seen. To appeal to a better understanding of the periodic table, the Instituto Superior de Engenharia do Instituto Politécnico do Porto and the Centro de Química da Universidade do Porto promoted a contest and exhibit with the goal of stimulating a wide and heterogeneous audience, ranging from young children and their parents to graduate students from several disciplines, to explore the nature of this icon. Imaginative educational activities such as contests (8–10), games (11, 12), and puzzles (13–15) provided a way to communicate with the general public with the goal of attracting students to science. This also constituted an interesting, informative, and entertaining alternative to non-interactive lectures. Simultaneously, artistic creativity was combined with scientific knowledge.

Using WorldFIP networks to support periodic and sporadic real-time traffic

In this paper we address the ability of WorldFIP to cope with the real-time requirements of distributed computer-controlled systems (DCCS). Typical DCCS include process variables that must be transferred between network devices both in a periodic and sporadic (aperiodic) basis. The WorldFIP protocol is designed to support both types of traffic. WorldFIP can easily guarantee the timing requirements for the periodic traffic. However, for the aperiodic traffic more complex analysis must be made in order to guarantee its timing requirements. This paper describes work that is being carried out to extend previous relevant work, in order to include the actual schedule for the periodic traffic in the worst-case response time analysis of sporadic traffic in WorldFIP networks

The generalized multiprocessor periodic resource interface model for hierarchical multiprocessor scheduling

Composition is a practice of key importance in software engineering. When real-time applications are composed it is necessary that their timing properties (such as meeting the deadlines) are guaranteed. The composition is performed by establishing an interface between the application and the physical platform. Such an interface does typically contain information about the amount of computing capacity needed by the application. In multiprocessor platforms, the interface should also present information about the degree of parallelism. Recently there have been quite a few interface proposals. However, they are either too complex to be handled or too pessimistic.In this paper we propose the Generalized Multiprocessor Periodic Resource model (GMPR) that is strictly superior to the MPR model without requiring a too detailed description. We describe a method to generate the interface from the application specification. All these methods have been implemented in Matlab routines that are publicly available.

Detection of quasi-periodic processes in complex systems: how do we quantitatively describe their properties?

It has been shown that in reality at least two general scenarios of data structuring are possible: (a) a self-similar (SS) scenario when the measured data form an SS structure and (b) a quasi-periodic (QP) scenario when the repeated (strongly correlated) data form random sequences that are almost periodic with respect to each other. In the second case it becomes possible to describe their behavior and express a part of their randomness quantitatively in terms of the deterministic amplitude–frequency response belonging to the generalized Prony spectrum. This possibility allows us to re-examine the conventional concept of measurements and opens a new way for the description of a wide set of different data. In particular, it concerns different complex systems when the ‘best-fit’ model pretending to be the description of the data measured is absent but the barest necessity of description of these data in terms of the reduced number of quantitative parameters exists. The possibilities of the proposed approach and detection algorithm of the QP processes were demonstrated on actual data: spectroscopic data recorded for pure water and acoustic data for a test hole. The suggested methodology allows revising the accepted classification of different incommensurable and self-affine spatial structures and finding accurate interpretation of the generalized Prony spectroscopy that includes the Fourier spectroscopy as a partial case.

Exact admission-control for integrated aperiodic and periodic tasks

Admission controllers are used to prevent overload in systems with dynamically arriving tasks. Typically, these admission controllers are based on suÆcient (but not necessary) capacity bounds in order to maintain a low computational complexity. In this paper we present how exact admission-control for aperiodic tasks can be eÆciently obtained. Our rst result is an admission controller for purely aperiodic task sets where the test has the same runtime complexity as utilization-based tests. Our second result is an extension of the previous controller for a baseload of periodic tasks. The runtime complexity of this test is lower than for any known exact admission-controller. In addition to presenting our main algorithm and evaluating its performance, we also discuss some general issues concerning admission controllers and their implementation.

Quasi-periodic Gaits in Multi-legged Robots

5th International Conference on Climbing and Walking Robots and the Support Technologies for Mobile Machines