OpenRaiser/Intern-Atlas huggingface dataset:
V0LTpwn: Attacking x86 Processor Integrity from Software
Venue: arXiv cs.CR 2019
Year: 2019

Fault-injection attacks have been proven in the past to be a reliable way of bypassing hardware-based security measures, such as cryptographic hashes, privilege and access permission enforcement, and trusted execution environments. However, traditional fault-injection attacks require physical presence, and hence, were often considered out of scope in many real-world adversary settings. In this paper we show this assumption may no longer be justified. We present V0LTpwn, a novel hardware-oriented but software-controlled attack that affects the integrity of computation in virtually any execution mode on modern x86 processors. To the best of our knowledge, this represents the first attack on x86 integrity from software. The key idea behind our attack is to undervolt a physical core to force non-recoverable hardware faults. Under a V0LTpwn attack, CPU instructions will continue to execute with erroneous results and without crashes, allowing for exploitation. In contrast to recently presented side-channel attacks that leverage vulnerable speculative execution, V0LTpwn is not limited to information disclosure, but allows adversaries to affect execution, and hence, effectively breaks the integrity goals of modern x86 platforms. In our detailed evaluation we successfully launch software-based attacks against Intel SGX enclaves from a privileged process to demonstrate that a V0LTpwn attack can successfully change the results of computations within enclave execution across multiple CPU revisions.
Minority report detection in refugee-authored community-driven journalism using RBMs
Venue: arXiv cs.CY 2019
Year: 2019

Our work seeks to gather and distribute sensitive information from refugee settlements to stakeholders to help shape policy and help guide action networks. In this paper, we propose the following 1) a method of data collection through stakeholder organizations experienced in working with displaced and refugee communities, 2) a method of topic modeling based on Deep Boltzmann Machines that identifies topics and issues of interest within the population, to help enable mapping of human rights violations, and 3) a secondary analysis component that will use the probability of fit to isolate minority reports within these stories using anomaly detection techniques.
Oktoberfest Food Dataset
Venue: arXiv cs.CV 2019
Year: 2019

We release a realistic, diverse, and challenging dataset for object detection on images. The data was recorded at a beer tent in Germany and consists of 15 different categories of food and drink items. We created more than 2,500 object annotations by hand for 1,110 images captured by a video camera above the checkout. We further make available the remaining 600GB of (unlabeled) data containing days of footage. Additionally, we provide our trained models as a benchmark. Possible applications include automated checkout systems which could significantly speed up the process.
Conformance Checking Approximation using Subset Selection and Edit Distance
Venue: arXiv cs.AI 2019
Year: 2019

Conformance checking techniques let us find out to what degree a process model and real execution data correspond to each other. In recent years, alignments have proven extremely useful in calculating conformance statistics. Most techniques to compute alignments provide an exact solution. However, in many applications, it is enough to have an approximation of the conformance value. Specifically, for large event data, the computing time for alignments is considerably long using current techniques which makes them inapplicable in reality. Also, it is no longer feasible to use standard hardware for complex processes. Hence, we need techniques that enable us to obtain fast, and at the same time, accurate approximation of the conformance values. This paper proposes new approximation techniques to compute approximated conformance checking values close to exact solution values in a faster time. Those methods also provide upper and lower bounds for the approximated alignment value. Our experiments on real event data show that it is possible to improve the performance of conformance checking by using the proposed methods compared to using the state-of-the-art alignment approximation technique. Results show that in most of the cases, we provide tight bounds, accurate approximated alignment values, and similar deviation statistics.
Imitation Learning via Off-Policy Distribution Matching
Venue: arXiv cs.LG 2019
Year: 2019

When performing imitation learning from expert demonstrations, distribution matching is a popular approach, in which one alternates between estimating distribution ratios and then using these ratios as rewards in a standard reinforcement learning (RL) algorithm. Traditionally, estimation of the distribution ratio requires on-policy data, which has caused previous work to either be exorbitantly data-inefficient or alter the original objective in a manner that can drastically change its optimum. In this work, we show how the original distribution ratio estimation objective may be transformed in a principled manner to yield a completely off-policy objective. In addition to the data-efficiency that this provides, we are able to show that this objective also renders the use of a separate RL optimization unnecessary.Rather, an imitation policy may be learned directly from this objective without the use of explicit rewards. We call the resulting algorithm ValueDICE and evaluate it on a suite of popular imitation learning benchmarks, finding that it can achieve state-of-the-art sample efficiency and performance.
Modelling and Simulation Environment for Self-Adaptive and Self-Aware Cloud Architectures
Venue: arXiv cs.SE 2019
Year: 2019

Cloud-based software systems are increasingly becoming complex and operating in highly dynamic environments. Self-adaptivity and self-awareness have recently emerged to cope with such level of dynamicity and scalability. Meanwhile, designing and testing such systems have poven to be a challenging task, as well as research benchmarking. Despite the influx of research in both self-adaptivity and cloud computing, as well as the various simulations environments proposed so far, there is a general lack of modelling and simulation environments of self-adaptive and self-aware cloud architectures. To aid researchers and practioners in overcoming such challenges, this paper presents a novel modelling and simulation environment for self-adaptive and self-aware cloud architectures. The environment provides significant benefits for designing self-adaptive and self-aware cloud architectures, as well as testing adaptation and awareness mechanisms. The toolkit is also beneficial as a symbiotic simulator during runtime to support adaptation decisions. We experimentally validated and evaluated the implementation using benchmarks and evaluation use cases.
RoboCoDraw: Robotic Avatar Drawing with GAN-based Style Transfer and Time-efficient Path Optimization
Venue: arXiv cs.RO 2019
Year: 2019

Robotic drawing has become increasingly popular as an entertainment and interactive tool. In this paper we present RoboCoDraw, a real-time collaborative robot-based drawing system that draws stylized human face sketches interactively in front of human users, by using the Generative Adversarial Network (GAN)-based style transfer and a Random-Key Genetic Algorithm (RKGA)-based path optimization. The proposed RoboCoDraw system takes a real human face image as input, converts it to a stylized avatar, then draws it with a robotic arm. A core component in this system is the Avatar-GAN proposed by us, which generates a cartoon avatar face image from a real human face. AvatarGAN is trained with unpaired face and avatar images only and can generate avatar images of much better likeness with human face images in comparison with the vanilla CycleGAN. After the avatar image is generated, it is fed to a line extraction algorithm and converted to sketches. An RKGA-based path optimization algorithm is applied to find a time-efficient robotic drawing path to be executed by the robotic arm. We demonstrate the capability of RoboCoDraw on various face images using a lightweight, safe collaborative robot UR5.
Collective Identity Formation on Instagram -- Investigating the Social Movement Fridays for Future
Venue: arXiv cs.SI 2019
Year: 2019

In recent years, social media changed the way individuals participate in social movements. While activists demonstrate on the street to fight for a public goal, members of specific movements can also act collective online. Thus, different aspects might influence the formation of collective identity and therefore drive collective action on social media. This study combines the perspectives of social identity- and identity theory in order to examine how members of an opinion-based group contribute to the collective group/social identity formation and therefore, to collective action. To this end, we applied automated text classification techniques to Instagram communication related to the social movement Fridays for Future. Analysing 1,137 comments showed that individuals mainly express Group Cohesion and Emotional Attachment rather than Solidarity by commenting on Instagram. This study further presents a proposed model of collective group/social identity of collective action. Succeeding research aims at enhancing the classification and testing the model.
Recurrent Transform Learning
Venue: arXiv cs.LG 2019
Year: 2019

The objective of this work is to improve the accuracy of building demand forecasting. This is a more challenging task than grid level forecasting. For the said purpose, we develop a new technique called recurrent transform learning (RTL). Two versions are proposed. The first one (RTL) is unsupervised; this is used as a feature extraction tool that is further fed into a regression model. The second formulation embeds regression into the RTL framework leading to regressing recurrent transform learning (R2TL). Forecasting experiments have been carried out on three popular publicly available datasets. Both of our proposed techniques yield results superior to the state-of-the-art like long short term memory network, echo state network and sparse coding regression.
Lane Detection For Prototype Autonomous Vehicle
Venue: arXiv cs.CV 2019
Year: 2019

Unmanned vehicle technologies are an area of great interest in theory and practice today. These technologies have advanced considerably after the first applications have been implemented and cause a rapid change in human life. Autonomous vehicles are also a big part of these technologies. The most important action of a driver has to do is to follow the lanes on the way to the destination. By using image processing and artificial intelligence techniques, an autonomous vehicle can move successfully without a driver help. They can go from the initial point to the specified target by applying pre-defined rules. There are also rules for proper tracking of the lanes. Many accidents are caused due to insufficient follow-up of the lanes and non-compliance with these rules. The majority of these accidents also result in injury and death. In this paper, we present an autonomous vehicle prototype that follows lanes via image processing techniques, which are a major part of autonomous vehicle technology. Autonomous movement capability is provided by using some image processing algorithms such as canny edge detection, Sobel filter, etc. We implemented and tested these algorithms on the vehicle. The vehicle detected and followed the determined lanes. By that way, it went to the destination successfully.
Performance Analysis of the Libra Blockchain: An Experimental Study
Venue: arXiv cs.DC 2019
Year: 2019

Since Bitcoin was first introduced in 2008, many types of cryptocurrencies have been proposed based on blockchain. However, the performance of permissionless blockchains restricts the widespread of cryptocurrency. Recently, Libra was proposed by Facebook based on a permissioned blockchain, i.e. the Libra blockchain. The vision of Libra is to become a global currency supporting financial applications, but it is doubted whether the performance of the Libra blockchain is able to support frequent micropayment scenarios. In this paper, we propose a methodology to evaluate the performance of blockchain platforms and conducted an experimental study on the Libra blockchain. The results show that the Libra blockchain can only process about one thousand transactions per second at most, and the performance drops significantly as the number of validators increases. Although it outperforms permissionless blockchain platforms, the performance of the Libra blockchain is still unsatisfactory compared to other permissioned blockchains like Hyperledger Fabric and needs to make effective improvements in order to support global micropayment in the future.
Automatic quality assessment for 2D fetal sonographic standard plane based on multi-task learning
Venue: arXiv cs.CV 2019
Year: 2019

The quality control of fetal sonographic (FS) images is essential for the correct biometric measurements and fetal anomaly diagnosis. However, quality control requires professional sonographers to perform and is often labor-intensive. To solve this problem, we propose an automatic image quality assessment scheme based on multi-task learning to assist in FS image quality control. An essential criterion for FS image quality control is that all the essential anatomical structures in the section should appear full and remarkable with a clear boundary. Therefore, our scheme aims to identify those essential anatomical structures to judge whether an FS image is the standard image, which is achieved by three convolutional neural networks. The Feature Extraction Network aims to extract deep level features of FS images. Based on the extracted features, the Class Prediction Network determines whether the structure meets the standard and Region Proposal Network identifies its position. The scheme has been applied to three types of fetal sections, which are the head, abdominal, and heart. The experimental results show that our method can make a quality assessment of an FS image within less a second. Also, our method achieves competitive performance in both the detection and classification compared with state-of-the-art methods.
A Stable Nuclear Future? The Impact of Autonomous Systems and Artificial Intelligence
Venue: arXiv cs.CY 2019
Year: 2019

The potential for advances in information-age technologies to undermine nuclear deterrence and influence the potential for nuclear escalation represents a critical question for international politics. One challenge is that uncertainty about the trajectory of technologies such as autonomous systems and artificial intelligence (AI) makes assessments difficult. This paper evaluates the relative impact of autonomous systems and artificial intelligence in three areas: nuclear command and control, nuclear delivery platforms and vehicles, and conventional applications of autonomous systems with consequences for nuclear stability. We argue that countries may be more likely to use risky forms of autonomy when they fear that their second-strike capabilities will be undermined. Additionally, the potential deployment of uninhabited, autonomous nuclear delivery platforms and vehicles could raise the prospect for accidents and miscalculation. Conventional military applications of autonomous systems could simultaneously influence nuclear force postures and first-strike stability in previously unanticipated ways. In particular, the need to fight at machine speed and the cognitive risk introduced by automation bias could increase the risk of unintended escalation. Finally, used properly, there should be many applications of more autonomous systems in nuclear operations that can increase reliability, reduce the risk of accidents, and buy more time for decision-makers in a crisis.
Crossing Reduction of Sankey Diagram with Barycentre Ordering via Markov Chain
Venue: arXiv cs.DS 2019
Year: 2019

Sankey diagram is popular for analyzing primary flows in network data. However, the growing complexity of data and hence crossings in the diagram begin to reduce its readability. In this work, we studied the NP-hard weighted crossing reduction problem of the Sankey diagram with both the common parallel form and the circular form. We expect to obtain an ordering of entities that reduces weighted crossings of links. We proposed a two-staged heuristic method based on the idea of barycentre ordering and used Markov chain to formulate the recursive process of obtaining such ordering. In the experiments, our method achieved 300.89 weighted crossings, compared with the optimum 278.68 from an integer linear programming method. Also, we obtained much less weighted crossings (87.855) than the state-of-art heuristic method (146.77). We also conducted a robust test which provided evidence that our method performed consistently against the change of complexity in the dataset.
Deep Learning Methods for Signature Verification
Venue: arXiv cs.CV 2019
Year: 2019

Signature is widely used in human daily lives, and serves as a supplementary characteristic for verifying human identity. However, there is rare work of verifying signature. In this paper, we propose a few deep learning architectures to tackle this task, ranging from CNN, RNN to CNN-RNN compact model. We also improve Path Signature Features by encoding temporal information in order to enlarge the discrepancy between genuine and forgery signatures. Our numerical experiments demonstrate the effectiveness of our constructed models and features representations.
LightFDG: An Integrated Approach to Flow Detection and Grooming in Optical Wireless DCNs
Venue: arXiv cs.NI 2019
Year: 2019

LightFDG is an integrated approach to flow detection (FD) and flow grooming (FG) in optical wireless data center networks (DCNs), which is interconnected via wavelength division multiplexing (WDM) based free-space optical (FSO) links. Since forwarding bandwidth-hungry elephant flows (EFs) and delay-sensitive mice flows (MFs) on the same path can cause severe performance degradation, the LightFDG optically grooms flows of each class into rack-to-rack (R2R) flows. Then, R2R-MF and R2R-EF flows are separately forwarded over lightpaths of separate MF and EF virtual topologies, respectively. Lightpaths are provisioned by jointly determining the capacity and route based on flows' arrival rate, size, and completion time request. To prevent EFs from congesting the MF lightpaths, high speed and accurate flow-detection mechanisms are also necessary for classifying EFs as soon as possible. Therefore, a fast-lightweight-and-accurate flow detection framework is developed by leveraging the transmission control protocol (TCP) behaviors. The proposed FD scheme has the flexibility of being implemented as in-network or centralized to classify flows of modifiable and unmodifiable hosts, respectively. Since the centralized scheme incurs considerable overhead, the processing and communication overhead is also mitigated by proposed techniques. Numerical results show that LightFDG outperforms traditional load balancers by about 3x for EFs and 10x for MFs. Along with the developed overhead mitigation methods, the centralized scheme is shown to provide up to 62x lower overhead with 100% accuracy and with about 224x higher detection speeds than the existing centralized solutions.
Representation of Federated Learning via Worst-Case Robust Optimization Theory
Venue: arXiv cs.LG 2019
Year: 2019

Federated learning (FL) is a distributed learning approach where a set of end-user devices participate in the learning process by acting on their isolated local data sets. Here, we process local data sets of users where worst-case optimization theory is used to reformulate the FL problem where the impact of local data sets in training phase is considered as an uncertain function bounded in a closed uncertainty region. This representation allows us to compare the performance of FL with its centralized counterpart, and to replace the uncertain function with a concept of protection functions leading to more tractable formulation. The latter supports applying a regularization factor in each user cost function in FL to reach a better performance. We evaluated our model using the MNIST data set versus the protection function parameters, e.g., regularization factors.
Object Recognition with Human in the Loop Intelligent Frameworks
Venue: arXiv cs.CV 2019
Year: 2019

Classifiers embedded within human in the loop visual object recognition frameworks commonly utilise two sources of information: one derived directly from the imagery data of an object, and the other obtained interactively from user interactions. These computer vision frameworks exploit human high-level cognitive power to tackle particularly difficult visual object recognition tasks. In this paper, we present innovative techniques to combine the two sources of information intelligently for the purpose of improving recognition accuracy. We firstly employ standard algorithms to build two classifiers for the two sources independently, and subsequently fuse the outputs from these classifiers to make a conclusive decision. The two fusion techniques proposed are: i) a modified naive Bayes algorithm that adaptively selects an individual classifier's output or combines both to produce a definite answer, and ii) a neural network based algorithm which feeds the outputs of the two classifiers to a 4-layer feedforward network to generate a final output. We present extensive experimental results on 4 challenging visual recognition tasks to illustrate that the new intelligent techniques consistently outperform traditional approaches to fusing the two sources of information.
A recipe for creating ideal hybrid memristive-CMOS neuromorphic computing systems
Venue: arXiv cs.ET 2019
Year: 2019

The development of memristive device technologies has reached a level of maturity to enable the design of complex and large-scale hybrid memristive-CMOS neural processing systems. These systems offer promising solutions for implementing novel in-memory computing architectures for machine learning and data analysis problems. We argue that they are also ideal building blocks for the integration in neuromorphic electronic circuits suitable for ultra-low power brain-inspired sensory processing systems, therefore leading to the innovative solutions for always-on edge-computing and Internet-of-Things (IoT) applications. Here we present a recipe for creating such systems based on design strategies and computing principles inspired by those used in mammalian brains. We enumerate the specifications and properties of memristive devices required to support always-on learning in neuromorphic computing systems and to minimize their power consumption. Finally, we discuss in what cases such neuromorphic systems can complement conventional processing ones and highlight the importance of exploiting the physics of both the memristive devices and of the CMOS circuits interfaced to them.