VerifyThis 2015

VerifyThis 2015 was a one-day program verification competition which took place on April 12th, 2015 in London, UK, as part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2015). It was the fourth instalment in the VerifyThis competition series. This article provides an overview of the VerifyThis 2015 event, the challenges that were posed during the competition, and a high-level overview of the solutions to these challenges. It concludes with the results of the competition and some ideas and thoughts for future instalments of VerifyThis.     

iOS application for quadrotor remote control

With the progress of electronics technology, the development of civilian UAV (unmanned aerial vehicle) applications becomes possible. In addition, smartphones have rapidly gained popularity and become very important due to the simple operability and mobility. Hence, there is a need to have an easy and flexible way to control a UAV using such technology. In this study, a remote controller using an iOS device is developed for a quadrotor to enable remote control with easy operations. Four basic programs for obtaining compass information, controlling a gimbal, autopilot function for return, and video preview function are developed and implemented for an iOS device. The basic functionalities of the programs are evaluated and confirmed through experiments using a quadrotor and an iOS device.     

A learning-based colour image segmentation with extended and compact structural tensor feature representation

In this paper a novel Tensor-Based Image Segmentation Algorithm (TBISA) is presented, which is dedicated for segmentation of colour images. A purpose of TBISA is to distinguish specific objects based on their characteristics, i.e. shape, colour, texture, or a mixture of these features. All of those information are available in colour channel data. Nonetheless, performing image analysis on the pixel level using RGB values, does not allow to access information on texture which is hidden in relation between neighbouring pixels. Therefore, to take full advantage of all available information, we propose to incorporate the Structural Tensors as a feature extraction method. It forms enriched feature set which, apart from colour and intensity, conveys also information of texture. This set is next processed by different classification algorithms for image segmentation. Quality of TBISA is evaluated in a series of experiments carried on benchmark images. Obtained results prove that the proposed method allows accurate and fast image segmentation.     

A deep learning scheme for mental workload classification based on restricted Boltzmann machines

The mental workload (MWL) classification is a critical problem for quantitative assessment and analysis of operator functional state in many safety-critical situations with indispensable human–machine cooperation. The MWL can be measured by psychophysiological signals. In this work, we propose a novel restricted Boltzmann machine (RBM) architecture for MWL classification. In relation to this architecture, we examine two main issues: the optimal structure of RBM and selection of the most important EEG channels (electrodes) for MWL classification. The trial-and-error and entropy-based pruning methods are compared for the RBM structure identification. The degree of importance of EEG channels is calculated from the weights in a well-trained network in order to select the most relevant channels for classification task. Extensive comparative results showed that the selected EEG channels lead to accurate MWL classification across subjects.     

Development of an internet and fuzzy based control system of manufacturing process

The aim of this work is to develop an Internet and fuzzy based control and data acquisition system for an industrial process plant which can ensure remote running and fuzzy control of a cement factory. Cases studies of the proposed system application in three cement factories in Algeria, SCAEK (Setif), SCIMAT (Batna), and SCT (Tebessa), are discussed. The remote process control consists of alarms generated during running of the processes while maintaining and synchronizing different regulation loops thus ensuring automatic running of processes smoothly. In addition, fuzzy control of the kiln and the other two mills ensures that the system is operational at all times with minimal downtime. The process control system contains different operator station (OP), alarms table and a provision to monitor trends analysis. The operator can execute any operation according to his authorised access assigned by the system administrator using user administration tool. The Internet technology is used for human security by avoiding all times presence of operators at site for maintenance. Further, in case of a breakdown, the problem would be remotely diagnosed and resolved avoiding requirement of an expert on site thus eliminating traveling cost, security risks, visa formalities, etc. These trips are difficult to organize (costs, visas, risks). So the enterprise can reduce downtimes and travel costs. In order to realize a process control system guided by operators in the main control room or through Internet, the process control is based on programming in PCS 7 utilizing Cemat library and Fuzzy Control++ Siemens tools.     

Refined entanglement concentration for electron-spin entangled cluster states with quantum-dot spins in optical microcavities

We present a refined entanglement concentration protocol (ECP) for an arbitrary unknown less-entangled four-electron-spin cluster state by exploring the optical selection rules derived from the quantum-dot spins in one-sided optical microcavities. In our ECP, the parties obtain not only the four-electron-spin systems in the partial entanglement with two unknown parameters, but also the less-entangled two-electron-spin systems in the first step. Utilizing the above preserved systems as the resource for the second step of our ECP, the parties can obtain a standard cluster state by keeping the robust odd-parity instances with two parity-check gates. Meanwhile, the systems in the rest three instances can be used as the resource in the next round of our ECP. The success probability of our ECP is largely increased by iteration of the ECP process. Moreover, all the coefficients of our ECP are unknown for the parties without assistance of extra single electron-spin, so our ECP maybe has good applications in quantum communication network in the future.     

Experimental realization of quantum cheque using a five-qubit quantum computer

Quantum cheques could be a forgery-free way to make transaction in a quantum networked banking system with perfect security against any no-signalling adversary. Here, we demonstrate the implementation of quantum cheque, proposed by Moulick and Panigrahi (Quantum Inf Process 15:2475–2486, 2016), using the five-qubit IBM quantum computer. Appropriate single qubit, CNOT and Fredkin gates are used in an optimized configuration. The accuracy of implementation is checked and verified through quantum state tomography by comparing results from the theoretical and experimental density matrices.     

Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms

A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch–Jozsa and Simon’s problem, both efficiently solvable on a quantum Turing machine, and both believed to lack efficient classical solutions. Here we present a framework that can simulate both quantum algorithms efficiently, solving the Deutsch–Jozsa problem with probability 1 using only one oracle query, and Simon’s problem using linearly many oracle queries, just as expected of an ideal quantum computer. The presented simulation framework is in turn efficiently simulatable in a classical probabilistic Turing machine. This shows that the Deutsch–Jozsa and Simon’s problem do not require any genuinely quantum resources, and that the quantum algorithms show no speed-up when compared with their corresponding classical simulation. Finally, this gives insight into what properties are needed in the two algorithms and calls for further study of oracle separation between quantum and classical computation.     

Continuous-variable quantum homomorphic signature

Quantum cryptography is believed to be unconditionally secure because its security is ensured by physical laws rather than computational complexity. According to spectrum characteristic, quantum information can be classified into two categories, namely discrete variables and continuous variables. Continuous-variable quantum protocols have gained much attention for their ability to transmit more information with lower cost. To verify the identities of different data sources in a quantum network, we propose a continuous-variable quantum homomorphic signature scheme. It is based on continuous-variable entanglement swapping and provides additive and subtractive homomorphism. Security analysis shows the proposed scheme is secure against replay, forgery and repudiation. Even under nonideal conditions, it supports effective verification within a certain verification threshold.     

Consensus of multiple Euler-Lagrange systems using one Euler-Lagrange System’s velocity measurements

International Journal of Control, Automation and Systems - This brief paper studies the stationary consensus of multiple Euler-Lagrange systems with nonlinear protocols. Two consensus protocols are...