Data Fusion-based resilient control system under DoS attacks: A game theoretic approach

In this paper, the resilient control under the Denial-of-Service (DoS) attack is rebuilt within the framework of Joint Directors of Laboratories (JDL) data fusion model. The JDL data fusion process is characterized by the so-called Game-in-Game approach, where decisions are made at different layers. The interactions between different JDL levels are considered which take the form of Packet Delivery Rate of the communication channel. Some criterions to judge whether the cyber defense system is able to protect the underlying control system is provided. Finally, a numerical example is proposed to verify the validity of the proposed method.     

Calibration of imprecise and inaccurate numerical models considering fidelity and robustness: a multi-objective optimization-based approach

Traditionally, model calibration is formulated as a single objective problem, where fidelity to measurements is maximized by adjusting model parameters. In such a formulation however, the model with best fidelity merely represents an optimum compromise between various forms of errors and uncertainties and thus, multiple calibrated models can be found to demonstrate comparable fidelity producing non-unique solutions. To alleviate this problem, the authors formulate model calibration as a multi-objective problem with two distinct objectives: fidelity and robustness. Herein, robustness is defined as the maximum allowable uncertainty in calibrating model parameters with which the model continues to yield acceptable agreement with measurements. The proposed approach is demonstrated through the calibration of a finite element model of a steel moment resisting frame.     

Leon Battista Alberti as Author of <Emphasis Type="Italic">Hypnerotomachia Poliphili</Emphasis>

The enigmatic Hypnerotomachia Poliphili published anonymously in 1499 has long posed puzzles for historians and other scholars. This present text argues that the volume can credibly be attributed, not to Francesca Colonna as is often done, but to the Renaissance humanist and polymath Leon Battista Alberti. Evidence for this is found in the unravelling of arithmogrammatical evidence sprinkled throughout the work, similar to those found in other of Alberti’s works.     

Creating geometrically robust designs for highly sensitive problems using topology optimization

Resonance and wave-propagation problems are known to be highly sensitive towards parameter variations. This paper discusses topology optimization formulations for creating designs that perform robustly under spatial variations for acoustic cavity problems. For several structural problems, robust topology optimization methods have already proven their worth. However, it is shown that direct application of such methods is not suitable for the acoustic problem under consideration. A new double filter approach is suggested which makes robust optimization for spatial variations possible. Its effect and limitations are discussed. In addition, a known explicit penalization approach is considered for comparison. For near-uniform spatial variations it is shown that highly robust designs can be obtained using the double filter approach. It is finally demonstrated that taking non-uniform variations into account further improves the robustness of the designs.     

,,Location-based Services“ – Personalisierung mobiler Dienste durch Verortung

Zusammenfassung Im Zeitalter der Informationsgesellschaft, so wurde postuliert, spielten r?umliche Distanzen keine Rolle mehr und unsere r?umliche Mobilit?t n?hme ab. Die Mobilit?t in den letzten Jahren, speziell die Freizeitmobilit?t, hat hingegen zugenommen. Die Bereitstellung ortsbezogener Dienste – ,,Location-based Services“ – unterstützt und f?rdert dieses Verhalten.     

Parallel Lagrange interpolation on <Emphasis Type="Italic">k</Emphasis>-ary <Emphasis Type="Italic">n</Emphasis>-cubes with maximum channel utilization

This paper proposes an efficient parallel algorithm for computing Lagrange interpolation on k-ary n-cube networks. This is done using the fact that a k-ary n-cube can be decomposed into n link-disjoint Hamiltonian cycles. Using these n link-disjoint cycles, we interpolate Lagrange polynomial using full bandwidth of the employed network. Communication in the main phase of the algorithm is based on an all-to-all broadcast algorithm on the n link-disjoint Hamiltonian cycles exploiting all network channels, and thus, resulting in high-efficiency in using network resources. A performance evaluation of the proposed algorithm reveals an optimum speedup for a typical range of system parameters used in current state-of-the-art implementations.

Optimal infinite scheduling for multi-priced timed automata

This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for such double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules. This work has been mostly done while visiting CISS at Aalborg University in Denmark and has been supported by CISS and by ACI Cortos, a program of the French Ministry of Research.     

The Basic Constructive Logic for Negation-Consistency

In this paper, consistency is understood in the standard way, i.e. as the absence of a contradiction. The basic constructive logic B_Kc4, which is adequate to this sense of consistency in the ternary relational semantics without a set of designated points, is defined. Then, it is shown how to define a series of logics by extending B_Kc4 up to minimal intuitionistic logic. All logics defined in this paper are paraconsistent logics.     

Continuous State Dynamic Programming via Nonexpansive Approximation

This paper studies fitted value iteration for continuous state numerical dynamic programming using nonexpansive function approximators. A number of approximation schemes are discussed. The main contribution is to provide error bounds for approximate optimal policies generated by the value iteration algorithm.