Iris-based human identity recognition with machine learning methods and discrete fast Fourier transform

Innovations in Systems and Software Engineering - One of the most important modules of computer systems is the one that is responsible for user safety. It was proven that simple passwords and...     

Anti-BlUFf: towards counterfeit mitigation in IC supply chains using blockchain and PUF

International Journal of Information Security - The complexity of today’s integrated circuit (IC) supply chain, organised in several tiers and including many companies located in different...     

Discrete time sliding mode control with reduced switching – a new reaching law approach

In this paper, a novel reaching law for discrete‐time variable structure systems is proposed. It ensures that the representative point (state) of the controlled plant approaches the switching plane in finite time and then crosses it in every subsequent step. Moreover, the proposed reaching law ensures that for the nominal plant the absolute value of the sliding variable asymptotically decreases to zero, and for the perturbed plant, it converges to a smaller interval around zero than with the application of previously proposed reaching laws. The control method proposed in this paper guarantees asymptotic stability of the nominal system and uniform ultimate boundedness of the perturbed one. Furthermore, the method ensures that the sliding variable rate of change (i.e. the difference between its values at any two subsequent sampling instants) is bounded by design parameters, which do not depend on the system initial conditions. This is a highly desirable property, as it results in a priori specified, ‘almost’ constant convergence rate of the sliding variable when the system state is far off the switching plane and helps enforce state constraints in the system. Copyright © 2014 John Wiley & Sons, Ltd.     

Precise control of reflection response in bandwidth‐enhanced planar antennas

In this work, the issues of bandwidth enhancement of planar antennas and the relevance of precise and automated response control through numerical optimization have been investigated. Using an example of a planar antenna with parasitic radiator we illustrate possible effects of even minor modifications of the antenna geometry (here, applied to the ground plane) on its reflection performance. In particular, a proper handling of geometry parameters may lead to considerable broadening of the antenna bandwidth. For the sake of computational efficiency, the adjustment of geometry parameters is carried out using surrogate‐based optimization methods exploiting coarse‐discretization EM simulations as the underlying low‐fidelity antenna model. Additionally, suitably defined penalty function allows us to precisely control the maximum in‐band reflection so that sufficient margin to accommodate possible manufacturing tolerances can be achieved. The optimized designs of the two antenna structures considered in this work exhibit over 1.75 GHz (>31%) and 2.15 GHz (>38%) bandwidth, respectively, for the center frequency of 5.6 GHz. Simulation results are validated using measurements of the fabricated prototypes. Comparison with state‐of‐the‐art designs is also provided. © 2016 Wiley Periodicals, Inc. Int J RF and Microwave CAE 26:653–659, 2016.     

AmbiKraf

This paper presents, AmbiKraf, a non-emissive fabric display that subtly animates patterns on common fabrics. We use thermochromic inks and peltier semiconductor elements to achieve this technology. With this technology we have produced numerous prototypes from animated wall paintings to pixilated fabric displays. The ability of this technology to subtly and ubiquitously change the color of the fabric itself has made us able to merge different fields and technologies with AmbiKraf. In addition, with an animated room divider screen, Ambikraf merged its technology with Japanese Byobu art to tighten the gap between traditional arts and contemporary technologies. Through this AmbiKraf Byobu art installation and other installations, we discuss the impact of this technology as a ubiquitous fabric display. With focus to improvements of some limitations of the existing system, we present our future vision that enables us to merge this technology into more applications fields thus making this technology a platform for ubiquitous interactions on our daily peripherals.     

Probabilistic motion-compensated prediction in distributed video coding

Distributed video coding (DVC) constitutes an original coding framework to meet the stringent requirements imposed by uplink-oriented and low-power mobile video applications. The quality of the side information available to the decoder and the efficiency of the employed channel codes are primary factors determining the success of a DVC system. This contribution introduces two novel techniques for probabilistic motion compensation in order to generate side information at the Wyner-Ziv decoder. The employed DVC scheme uses a base layer, serving as a hash to facilitate overlapped block motion estimation at the decoder side. On top of the base layer, a supplementary Wyner-Ziv layer is coded in the DCT domain. Both proposed probabilistic motion compensation techniques are driven by the actual correlation channel statistics and reuse information contained in the hash. Experimental results report significant rate savings caused by the novel side information generation methods compared to previous techniques. Moreover, the compression performance of the presented DVC architecture, featuring the proposed side-information generation techniques, delivers state-of-the-art compression performance.     

Low-latency atomic broadcast in the presence of contention

The Atomic Broadcast algorithm described in this paper can deliver messages in two communication steps, even if multiple processes broadcast at the same time. It tags all broadcast messages with the local real time, and delivers all messages in the order of these timestamps. Both positive and negative statements are used: “m broadcast at time 51” vs. “no messages broadcast between times 31 and 51”. To prevent crashed processes from blocking the system, the -elected leader broadcasts negative statements on behalf of the processes it suspects () to have crashed. A new cheap Generic Broadcast algorithm is used to ensure consistency between conflicting statements. It requires only a majority of correct processes (n > 2f) and, in failure-free runs, delivers all non-conflicting messages in two steps. The main algorithm satisfies several new lower bounds, which are proved in this paper.