This paper investigates the performance of a framework for low-outage downlink non-orthogonal multiple access (NOMA) signalling using a coordinated direct and relay transmission (CDRT) scheme with direct links to both the near-user (NU) and the far-user (FU). Both amplify-and-forward (AF) and decode-and-forward (DF) relaying are considered. In this framework, NU and FU combine the signals from BS and R to attain good outage performance and harness a diversity of two without any need for feedback. For the NU, this serves as an incentive to participate in NOMA signalling. For both NU and FU, expressions for outage probability and throughput are derived in closed form. High-SNR approximations to the outage probability are also presented. We demonstrate that the choice of power allocation coefficient and target rate is crucial to maximize the NU performance while ensuring a desired FU performance. We demonstrate performance gain of the proposed scheme over selective decode-and-forward (SDF) CDRT-NOMA in terms of three metrics: outage probability, sum throughput and energy efficiency. Further, we demonstrate that by choosing the target rate intelligently, the proposed CDRT NOMA scheme ensures higher energy efficiency (EE) in comparison to its orthogonal multiple access counterpart. Monte Carlo simulations validate the derived expressions.

Cloud computing depends on the dynamic allocation and release of resources, on demand, to meet heterogeneous computing needs. This is challenging for cloud data centers, which process huge amounts of data characterised by its high volume, velocity, variety and veracity (4Vs model). Managing such a workload is increasingly difficult using state-of-the-art methods for monitoring and adaptation, which typically react to service failures after the fact. To address this, we seek to develop proactive methods for predicting future resource exhaustion and cloud service failures. Our work uses a realistic test bed in the cloud, which is instrumented to monitor and analyze resource usage. In this paper, we employed the optimal Kalman filtering technique to build a predictive and analytic framework for cloud server KPIs, based on historical data. Our k-step-ahead predictions on historical data yielded a prediction accuracy of 95.59%. The information generated from the framework can best be used for optimal resources provisioning, admission control and cloud SLA management.

Decades of advances in computer architecture, software-intensive applications and system integration have created significant challenges for embedded systems designers and test engineers. Intrusive software instrumentation and breakpoint-based debugging are often viewed as the primary options for observing operational system internals. This narrow sight creates complicated test flows and convoluted debugging procedures. Modern embedded computing systems offer Embedded Trace as the technological answer to the encountered observability conundrum. Although an integral part of virtually all modern processors, it is frequently overlooked. Its technical foundations are little known to application engineers, test engineers, and project managers. This article explains Embedded Trace as an essential technology in the testing and debugging toolbox. It highlights its capabilities, limitations and opportunities.

Cyber-physical systems (CPSs) are complex and exhibit both continuous and discrete dynamics, hence it is difficult to guarantee that they satisfy given specifications, i.e., the properties that must be fulfilled by the system. Falsification of temporal logic properties is a testing approach that searches for counterexamples of a given specification, which can be used to increase the confidence that a CPS does fulfill its specifications. Falsification can be done using random search methods or optimization methods. In this paper, a method based on combining random parameters together with considering extreme combinations of parameter values is proposed. Evaluation results on benchmark problems show that this method performs well on many of the problems. Optimization methods are needed when optimization-free methods do not perform well in falsification. The efficiency of the falsification is affected by the optimization methods used to search for inputs that might falsify the specifications. This paper presents a new optimization method for falsification, Line-search falsification, where optimization is done over line segments through a vector of inputs in the n-dimensional parameter space. The evaluation results on the benchmark problems show that using this method improves the falsification performance by reducing the number of simulations necessary to falsify a specification.

Free-space optical (FSO) systems are able to offer the high data-rate, secure, and cost-efficient communication links required for applications such as wireless front- and backhauling for 5G and 6G communication networks. Despite the substantial advancement of FSO systems over the past decades, the requirement of a line-of-sight connection between transmitter and receiver remains a key limiting factor for their deployment. In this paper, we discuss the potential role of intelligent reflecting surfaces (IRSs) as a solution to relax this requirement. We present an overview of existing optical IRS technologies; compare optical IRSs with radio-frequency IRSs and optical relays; and identify various open problems for future research on IRS-assisted FSO communications.

For multiprimary displays that have four or more primaries, a color may be reproduced using multiple alternative control vectors. We provide a complete characterization of the Metameric Control Set (MCS), i.e., the set of control vectors that reproduce a given color on the display. Specifically, we show that MCS is a convex polytope whose vertices are control vectors obtained from (parallelepiped) tilings of the gamut, i.e., the range of colors that the display can produce. The mathematical framework that we develop: (a) characterizes gamut tilings in terms of fundamental building blocks called facet spans, (b) establishes that the vertices of the MCS are fully characterized by the tilings of the gamut, and (c) introduces a methodology for the efficient enumeration of gamut tilings. The framework reveals the fundamental inter-relations between the geometry of the MCS and the geometry of the gamut developed in a companion Part I paper, and provides insight into alternative strategies for color control. Our characterization of tilings and the strategy for their enumeration also advance knowledge in geometry, providing new approaches and computational results for the enumeration of tilings for a broad class of zonotopes in R3.

Displays that render colors using combinations of more than three lights are referred to as multiprimary displays. For multiprimary displays, the gamut, i.e., the range of colors that can be rendered using additive combinations of an arbitrary number of light sources (primaries) with modulated intensities, is known to be a zonotope, which is a specific type of convex polytope. Under the specific three-dimensional setting relevant for color representation and the constraint of physically meaningful nonnegative primaries, we develop a complete, cohesive, and directly usable mathematical characterization of the geometry of the multiprimary gamut zonotope that immediately identifies the surface facets, edges, and vertices and provides a parallelepiped tiling of the gamut. We relate the parallelepiped tilings of the gamut, that arise naturally in our characterization, to the flexibility in color control afforded by displays with more than four primaries, a relation that is further analyzed and completed in a Part II companion paper. We demonstrate several applications of the geometric representations we develop and highlight how the paper advances theory required for multiprimary display modeling, design, and color management and provides an integrated view of past work on on these topics. Additionally, we highlight how our work on gamut representations connects with and furthers the study of three-dimensional zonotopes in geometry.

This paper proposes a new method for very fast extraction of symmetrical components.

Multi-access edge computing (MEC) has been recently considered in challenging environments lacking available terrestrial infrastructures by extending the computing resources to the air for further enhancing the computation capability of the new aerial user equipment (AUE). Additionally, wireless power transfer (WPT) is a promising solution to prolong the battery lifetime of energy-constrained wireless devices like AUEs. In this paper, we investigate the integration of laser-beamed WPT in the high-altitude platform (HAP) aided MEC systems for the HAP-connected AUEs. By discretizing the three-dimensional coverage space of the HAP, we present a multi-tier tile grid-based spatial structure to provide aerial locations for laser charging. With this setup, we identify a new privacy vulnerability caused by the openness during the air-to-air transmission of WPT signaling messages in the presence of a terrestrial adversary. A privacy-aware laser-powered aerial MEC framework is developed that addresses this vulnerability and enhances the location privacy of AUEs for laser WPT. Specifically, the interaction between the HAP as a defender and the adversary in their tile grid allocation as charging locations to AUEs is formulated as a Colonel Blotto game, which models the competition of the players for limited resources over multiple battlefields for a finite time horizon. Moreover, we derive the mixed-strategy Nash equilibria of the tile grid allocation game for both symmetric and asymmetric tile grids between the defender and the adversary. Simulations results show that the proposed framework significantly outperforms the design baselines with a given privacy protection level in terms of system-wide expected total utilities.

Identification of when and where moving areas intersect is an important problem in maritime operations and air traffic control. This problem can become particularly complicated when considering large numbers of objects, and when taking into account the curvature of the earth. In this paper, we present an approach to conflict identification as a series of stages where the earlier stages are fast, but may result in a false detection of a conflict. These early stages are used to reduce the number of potential conflict pairs for the later stages, which are slower, but more precise. The stages use R-trees, polygon intersection, linear projection and nonlinear programming. Our approach is generally applicable to objects moving in piece-wise straight lines on a 2D plane, and we present a specific case where the Mercator Projection is used to transform objects moving along rhumb lines on the earth into straight lines to fit in our approach. We present several examples to demonstrate our methods, as well as to quantify the empirical time complexity by using randomly generated areas.

In cross-chain scenarios, there are different blockchains, which need to cooperate. Cooperation among different blockchains is done by smart contracts that work together to complete cross-chain tasks. When numerous cooperative smart contracts are involved, smart contracts form a complex interaction network, which makes it difficult to evaluate the cooperation. It needs a common model to quantitatively analyze the cross-chain cooperation of associated smart contracts. In this paper, we model the cooperation among smart contracts as conditions and their corresponding actions, the condition-trigger model. Then we propose the method to calculate the cooperation probabilities by the graph weight. As the edge weight lacks the information of interaction probabilities, we introduce the dimension of the edge weight to calculate the probabilities. Finally, we verify the proposed condition-trigger model and its different types. It demonstrates that our proposed methods can effectively analyze the cross-chain cooperation among smart contracts.

In this article, we investigate mechanism of torque ripple generation by time and space harmonic magnetic fields in permanent magnet synchronous motors to obtain advanced motor designs. The general expression between the torque ripples and harmonic air-gap flux densities in the motor is derived by using Maxwell stress tensor. Both the numerical and experimental verifications of this expression are carried out. Then, the major harmonic magnetic fields that produce the torque ripples are specified and the differences between the surface and interior permanent magnet synchronous motors are investigated. According to these investigations, the shape of the rotor surface of an interior permanent magnet motor is optimized. It is clarified that specific harmonic components of the torque ripples in interior permanent magnet synchronous motors can be reduced to be nearly zero by optimizing the rotor surface shape.

Haptic feedback is critical in a broad range of human-machine/computer-interaction applications. However, the high cost and low portability/wearability of haptic devices remain unresolved issues, severely limiting the adoption of this otherwise promising technology. Electrotactile interfaces have the advantage of being more portable and wearable due to their reduced actuators’ size, as well as their lower power consumption and manufacturing cost. The applications of electrotactile feedback have been explored in human-computer interaction and human-machine-interaction for facilitating hand-based interactions in applications such as prosthetics, virtual reality, robotic teleoperation, surface haptics, portable devices, and rehabilitation. This paper presents a technological overview of electrotactile feedback, as well a systematic review and meta-analysis of its applications for hand-based interactions. We discuss the different electrotactile systems according to the type of application. We also discuss over a quantitative congregation of the findings, to offer a high-level overview into the state-of-art and suggest future directions. Electrotactile feedback systems showed increased portability/wearability, and they were successful in rendering and/or augmenting most tactile sensations, eliciting perceptual processes, and improving performance in many scenarios. However, knowledge gaps (e.g., embodiment), technical (e.g., recurrent calibration, electrodes’ durability) and methodological (e.g., sample size) drawbacks were detected, which should be addressed in future studies.

A document by Caijilahu Bao . Click on the document to view its contents.

Background/foreground separation is one of the most fundamental tasks in computer vision, especially for video data. Robust PCA (RPCA) and its tensor extension, namely, Robust Tensor PCA (RTPCA), provide an effective framework for background/foreground separation by decomposing the data into low-rank and sparse components, which contain the background and the foreground (moving objects), respectively. However, in real-world applications, the video data is contaminated with noise. For example, in metal additive manufacturing (AM), the processed X-ray video to study melt pool dynamics is very noisy. RPCA and RTPCA are not able to separate the background, foreground, and noise simultaneously. As a result, the noise will contaminate the background or the foreground or both. There is a need to remove the noise from the background and foreground. To achieve the three terms decomposition, a smooth sparse Robust Tensor Decomposition (SS-RTD) model is proposed to decompose the data into static background, smooth foreground, and noise, respectively. Specifically, the static background is modeled by the low-rank tucker decomposition, the smooth foreground (moving objects) is modeled by the spatiotemporal continuity, which is enforced by the total variation regularization, and the noise is modeled by the sparsity, which is enforced by the L1 norm. An efficient algorithm based on alternating direction method of multipliers (ADMM) is implemented to solve the proposed model. Extensive experiments on both simulated and real data demonstrate that the proposed method significantly outperforms the state-of-the-art approaches for background/foreground separation in noisy cases.

Automatic Modulation Classification (AMC) receives significant interest in the context of current and future wireless communication systems. Deep learning emerged as a powerful AMC tool, as it allows for the joint learning of discriminative features, and signal classification. However, the optimization of Deep Neural Network (DNN) architectures for AMC is a manual and time-consuming process that requires profound domain knowledge and much effort. Moreover, most proposed solutions focus mainly on classification accuracy, while optimization of network complexity is neglected. In this paper, we propose a novel bi-objective memetic algorithm, BO-NSMA, to search optimal DNN architectures for AMC to maximize classification accuracy and minimize network complexity. We show that BO-NSMA, with a small initial population of six individuals and only ten generations, finds a DNN architecture that outperforms all human-crafted State-of-the-Art (SoA) models. BO-NSMA discovered the first low-complexity Convolutional Neural Network (CNN)-based model, which achieves slightly better performance than costly Recurrent Neural Network (RNN)-based approaches, allowing a 2.8-fold reduction in network complexity with 0.7% performance improvement. Compared to its counterparts from Network Architecture Search (NAS), BO-NSMA finds the best architecture, which achieves up to 18.24% accuracy gain and up to a 78.71-fold reduction in network complexity.

Deep Learning (DL) has been utilized pervasively in the Internet of Things (IoT). One typical application of DL in IoT is device identification from wireless signals, namely Non-cryptographic Device Identification (NDI). However, learning components in NDI systems have to evolve to adapt to operational variations, such a paradigm is termed as Incremental Learning (IL). Various IL algorithms have been proposed and many of them require dedicated space to store the increasing amount of historical data, and therefore, they are not suitable for IoT or mobile applications. However, conventional IL schemes can not provide satisfying performance when historical data are not available. In this paper, we address the IL problem in NDI from a new perspective, firstly, we provide a new metric to measure the degree of topological maturity of DNN models from the degree of conflict of class-specific fingerprints. We discover that an important cause for performance degradation in IL enabled NDI is owing to the conflict of devices’ fingerprints. Second, we also show that the conventional IL schemes can lead to low topological maturity of DNN models in NDI systems. Thirdly, we propose a new Channel Separation Enabled Incremental Learning (CSIL) scheme without using historical data, in which our strategy can automatically separate devices’ fingerprints in different learning stages and avoid potential conflict. Finally, We evaluated the effectiveness of the proposed framework using real data from ADS-B (Automatic Dependent Surveillance-Broadcast), an application of IoT in aviation. The proposed framework has the potential to be applied to accurate identification of IoT devices in a variety of IoT applications and services. Data and code available at IEEE Dataport (DOI: 10.21227/1bxc-ke87) and \url{https://github.com/pcwhy/CSIL}}.

This paper presents a convex recovery method for block-sparse signals whose block partitions are unknown a priori. We first introduce a nonconvex penalty function, where the block partition is adapted for the signal of interest by minimizing the mixed l2/l1 norm over all possible block partitions. Then, by exploiting a variational representation of the l2 norm, we derive the proposed penalty function as a suitable convex relaxation of the nonconvex one. For a block-sparse recovery model designed with the proposed penalty, we develop an iterative algorithm which is guaranteed to converge to a globally optimal solution. Numerical experiments demonstrate the effectiveness of the proposed method.