OpenRaiser/Intern-Atlas huggingface dataset:
Stochastic Reinforcement Learning
Venue: arXiv cs.LG 2019
Year: 2019

In reinforcement learning episodes, the rewards and punishments are often non-deterministic, and there are invariably stochastic elements governing the underlying situation. Such stochastic elements are often numerous and cannot be known in advance, and they have a tendency to obscure the underlying rewards and punishments patterns. Indeed, if stochastic elements were absent, the same outcome would occur every time and the learning problems involved could be greatly simplified. In addition, in most practical situations, the cost of an observation to receive either a reward or punishment can be significant, and one would wish to arrive at the correct learning conclusion by incurring minimum cost. In this paper, we present a stochastic approach to reinforcement learning which explicitly models the variability present in the learning environment and the cost of observation. Criteria and rules for learning success are quantitatively analyzed, and probabilities of exceeding the observation cost bounds are also obtained.
Brain MRI Segmentation using Rule-Based Hybrid Approach
Venue: arXiv cs.CV 2019
Year: 2019

Medical image segmentation being a substantial component of image processing plays a significant role to analyze gross anatomy, to locate an infirmity and to plan the surgical procedures. Segmentation of brain Magnetic Resonance Imaging (MRI) is of considerable importance for the accurate diagnosis. However, precise and accurate segmentation of brain MRI is a challenging task. Here, we present an efficient framework for segmentation of brain MR images. For this purpose, Gabor transform method is used to compute features of brain MRI. Then, these features are classified by using four different classifiers i.e., Incremental Supervised Neural Network (ISNN), K-Nearest Neighbor (KNN), Probabilistic Neural Network (PNN), and Support Vector Machine (SVM). Performance of these classifiers is investigated over different images of brain MRI and the variation in the performance of these classifiers is observed for different brain tissues. Thus, we proposed a rule-based hybrid approach to segment brain MRI. Experimental results show that the performance of these classifiers varies over each tissue MRI and the proposed rule-based hybrid approach exhibits better segmentation of brain MRI tissues.
Beamwidth Control for NOMA in Hybrid mmWave Communication Systems
Venue: arXiv cs.IT 2019
Year: 2019

In this paper, we propose a beamwidth control-based non-orthogonal multiple access (NOMA) scheme for hybrid millimeter wave (mmWave) communication systems. In particular, the proposed scheme allows multiple users in one NOMA group to share the same radio frequency chain and analog beam for superposition transmission. To overcome the physical limit of the narrow analog beam, a beamwidth control approach is proposed to widen the analog beamwidth to facilitate the formation of NOMA groups. Then, we characterize the main lobe power loss associated with the proposed beamwidth control and derive the asymptotically optimal analog beamformer to maximize the system sum-rate in the large number of antennas regime. The system sum-rate gain of the proposed beamwidth control-based NOMA scheme compared to a baseline scheme adopting time division multiple access (TDMA) is analyzed. Simulation results verify the accuracy of our performance analysis and unveil the importance of beamwidth control for practical mmWave NOMA systems.
Parametric analyses of attack-fault trees
Venue: arXiv cs.CR 2019
Year: 2019

Risk assessment of cyber-physical systems, such as power plants, connected devices and IT-infrastructures has always been challenging: safety (i.e. absence of unintentional failures) and security (i.e. no disruptions due to attackers) are conditions that must be guaranteed. One of the traditional tools used to help considering these problems is attack trees, a tree-based formalism inspired by fault trees, a well-known formalism used in safety engineering. In this paper we define and implement the translation of attack-fault trees (AFTs) to a new extension of timed automata, called parametric weighted timed automata. This allows us to parametrize constants such as time and discrete costs in an AFT and then, using the model-checker IMITATOR, to compute the set of parameter values such that a successful attack is possible. Using the different sets of parameter values computed, different attack and fault scenarios can be deduced depending on the budget, time or computation power of the attacker, providing helpful data to select the most efficient counter-measure.
Verification Code Recognition Based on Active and Deep Learning
Venue: arXiv cs.CR 2019
Year: 2019

A verification code is an automated test method used to distinguish between humans and computers. Humans can easily identify verification codes, whereas machines cannot. With the development of convolutional neural networks, automatically recognizing a verification code is now possible for machines. However, the advantages of convolutional neural networks depend on the data used by the training classifier, particularly the size of the training set. Therefore, identifying a verification code using a convolutional neural network is difficult when training data are insufficient. This study proposes an active and deep learning strategy to obtain new training data on a special verification code set without manual intervention. A feature learning model for a scene with less training data is presented in this work, and the verification code is identified by the designed convolutional neural network. Experiments show that the method can considerably improve the recognition accuracy of a neural network when the amount of initial training data is small.
Fast-SCNN: Fast Semantic Segmentation Network
Venue: arXiv cs.CV 2019
Year: 2019

The encoder-decoder framework is state-of-the-art for offline semantic image segmentation. Since the rise in autonomous systems, real-time computation is increasingly desirable. In this paper, we introduce fast segmentation convolutional neural network (Fast-SCNN), an above real-time semantic segmentation model on high resolution image data (1024x2048px) suited to efficient computation on embedded devices with low memory. Building on existing two-branch methods for fast segmentation, we introduce our `learning to downsample' module which computes low-level features for multiple resolution branches simultaneously. Our network combines spatial detail at high resolution with deep features extracted at lower resolution, yielding an accuracy of 68.0% mean intersection over union at 123.5 frames per second on Cityscapes. We also show that large scale pre-training is unnecessary. We thoroughly validate our metric in experiments with ImageNet pre-training and the coarse labeled data of Cityscapes. Finally, we show even faster computation with competitive results on subsampled inputs, without any network modifications.
Center of circle after perspective transformation
Venue: arXiv cs.CV 2019
Year: 2019

Video-based glint-free eye tracking commonly estimates gaze direction based on the pupil center. The boundary of the pupil is fitted with an ellipse and the euclidean center of the ellipse in the image is taken as the center of the pupil. However, the center of the pupil is generally not mapped to the center of the ellipse by the projective camera transformation. This error resulting from using a point that is not the true center of the pupil directly affects eye tracking accuracy. We investigate the underlying geometric problem of determining the center of a circular object based on its projective image. The main idea is to exploit two concentric circles -- in the application scenario these are the pupil and the iris. We show that it is possible to computed the center and the ratio of the radii from the mapped concentric circles with a direct method that is fast and robust in practice. We evaluate our method on synthetically generated data and find that it improves systematically over using the center of the fitted ellipse. Apart from applications of eye tracking we estimate that our approach will be useful in other tracking applications.
Can Massive MIMO Support Uplink Intensive Applications?
Venue: arXiv cs.IT 2019
Year: 2019

Current outdoor mobile network infrastructure cannot support uplink intensive mobile applications such as connected vehicles that collect and upload large amount of real time data. Our investigation reveals that with maximum-ratio (MR) decoding, it is theoretically impossible to support such applications with cell-free Massive MIMO, and it requires a very large number of service antennas in single cell configuration, making it practically infeasible; but with zero-forcing (ZF) decoding, such applications can be easily supported by cell-free Massive MIMO with very moderate number of access points (AP's), and it requires a lot more service antennas in single cell configuration. Via the newly derived SINR expressions for cell-free Massive MIMO with ZF decoding we show that uplink power control is unnecessary, and that with 10 MHz effective bandwidth for uplink data transmission, in urban and suburban morphologies, on the 2 GHz band, 90 single antenna AP's per square kilometer and 32 single antenna AP's per square kilometer are enough to support 18 autonomous vehicles respectively. In rural morphology, using 450 MHz band, only 2 single antenna AP's per square kilometer is enough.
Enhancing Fault Tolerance of Neural Networks for Security-Critical Applications
Venue: arXiv cs.LG 2019
Year: 2019

Neural Networks (NN) have recently emerged as backbone of several sensitive applications like automobile, medical image, security, etc. NNs inherently offer Partial Fault Tolerance (PFT) in their architecture; however, the biased PFT of NNs can lead to severe consequences in applications like cryptography and security critical scenarios. In this paper, we propose a revised implementation which enhances the PFT property of NN significantly with detailed mathematical analysis. We evaluated the performance of revised NN considering both software and FPGA implementation for a cryptographic primitive like AES SBox. The results show that the PFT of NNs can be significantly increased with the proposed methodology.
Wireless energy and information transfer in networks with hybrid ARQ
Venue: arXiv cs.PF 2019
Year: 2019

In this paper, we consider a class of wireless powered communication devices using hybrid automatic repeat request (HARQ) protocol to ensure reliable communications. In particular, we analyze the trade-off between accumulating mutual information and harvesting RF energy at the receiver of a point-to-point link over a time-varying independent and identically distributed (i.i.d.) channel. The transmitter is assumed to have a constant energy source while the receiver relies, solely, on the RF energy harvested from the received signal. At each time slot, the incoming RF signal is split between information accumulation and energy accumulation with the objective of minimizing the expected number of re-transmissions. A major finding of this work is that the optimal policy minimizing the expected number of re-transmissions utilizes the incoming RF signal to either exclusively harvest energy or to accumulate mutual information. This finding enables achieving an optimal solution in feasible time by converting a two dimensional uncountable state Markov decision process (MDP) with continuous action space into a countable state MDP with binary decision space.
User-Antenna Selection for Physical-Layer Network Coding based on Euclidean Distance
Venue: arXiv cs.IT 2019
Year: 2019

In this paper, we present the error performance analysis of a multiple-input multiple-output (MIMO) physical-layer network coding (PNC) system with two different user-antenna selection (AS) schemes in asymmetric channel conditions. For the first antenna selection scheme (AS1), where the user-antenna is selected in order to maximize the overall channel gain between the user and the relay, we give an explicit analytical proof that for binary modulations, the system achieves full diversity order of $min(N_A , N_B ) \times N_R$ in the multiple-access (MA) phase, where $N_A$, $N_B$ and $N_R$ denote the number of antennas at user $A$, user $B$ and relay $R$ respectively. We present a detailed investigation of the diversity order for the MIMO-PNC system with AS1 in the MA phase for any modulation order. A tight closed-form upper bound on the average SER is also derived for the special case when $N_R = 1$, which is valid for any modulation order. We show that in this case the system fails to achieve transmit diversity in the MA phase, as the system diversity order drops to $1$ irrespective of the number of transmit antennas at the user nodes. Additionally, we propose a Euclidean distance (ED) based user-antenna selection scheme (AS2) which outperforms the first scheme in terms of error performance. Moreover, by deriving upper and lower bounds on the diversity order for the MIMO-PNC system with AS2, we show that this system enjoys both transmit and receive diversity, achieving full diversity order of $\min(N_A, N_B) \times N_R$ in the MA phase for any modulation order. Monte Carlo simulations are provided which confirm the correctness of the derived analytical results.
Progressively Growing Generative Adversarial Networks for High Resolution Semantic Segmentation of Satellite Images
Venue: arXiv cs.CV 2019
Year: 2019

Machine learning has proven to be useful in classification and segmentation of images. In this paper, we evaluate a training methodology for pixel-wise segmentation on high resolution satellite images using progressive growing of generative adversarial networks. We apply our model to segmenting building rooftops and compare these results to conventional methods for rooftop segmentation. We present our findings using the SpaceNet version 2 dataset. Progressive GAN training achieved a test accuracy of 93% compared to 89% for traditional GAN training.
Quantifying the Loss of Information from Binning List-Mode Data
Venue: arXiv cs.IT 2019
Year: 2019

List-mode data is increasingly being uesd in SPECT and PET imaging, among other imaging modalities. However, there are still many imaging designs that effectively bin list-mode data before image reconstruction or other estimation tasks are performed. Intuitively, the binning operation should result in a loss of information. In this work we show that this is true for Fisher information and provide a computational method for quantifying the information loss. In the end we find that the information loss depends on three factors. The first factor is related to the smoothness of the mean data function for the list-mode data. The second factor is the actual object being imaged. Finally, the third factor is the binning scheme in relation to the other two factors.
Time-aware Test Case Execution Scheduling for Cyber-Physical Systems
Venue: arXiv cs.SE 2019
Year: 2019

Testing cyber-physical systems involves the execution of test cases on target-machines equipped with the latest release of a software control system. When testing industrial robots, it is common that the target machines need to share some common resources, e.g., costly hardware devices, and so there is a need to schedule test case execution on the target machines, accounting for these shared resources. With a large number of such tests executed on a regular basis, this scheduling becomes difficult to manage manually. In fact, with manual test execution planning and scheduling, some robots may remain unoccupied for long periods of time and some test cases may not be executed. This paper introduces TC-Sched, a time-aware method for automated test case execution scheduling. TC-Sched uses Constraint Programming to schedule tests to run on multiple machines constrained by the tests' access to shared resources, such as measurement or networking devices. The CP model is written in SICStus Prolog and uses the Cumulatives global constraint. Given a set of test cases, a set of machines, and a set of shared resources, TC-Sched produces an execution schedule where each test is executed once with minimal time between when a source code change is committed and the test results are reported to the developer. Experiments reveal that TC-Sched can schedule 500 test cases over 100 machines in less than 4 minutes for 99.5% of the instances. In addition, TC-Sched largely outperforms simpler methods based on a greedy algorithm and is suitable for deployment on industrial robot testing.
Channel-Statistics-Based Hybrid Precoding for Millimeter-Wave MIMO Systems With Dynamic Subarrays
Venue: arXiv cs.IT 2019
Year: 2019

This paper investigates the hybrid precoding design for millimeter wave (mmWave) multiple-input multiple-output (MIMO) systems with finite-alphabet inputs. The mmWave MIMO system employs partially-connected hybrid precoding architecture with dynamic subarrays, where each radio frequency (RF) chain is connected to a dynamic subset of antennas. We consider the design of analog and digital precoders utilizing statistical and/or mixed channel state information (CSI), which involve solving an extremely difficult problem in theory: First, designing the optimal partition of antennas over RF chains is a combinatorial optimization problem, whose optimal solution requires an exhaustive search over all antenna partitioning solutions; Second, the average mutual information under mmWave MIMO channels lacks closed-form expression and involves prohibitive computational burden; Third, the hybrid precoding problem with given partition of antennas is nonconvex with respect to the analog and digital precoders. To address these issues, this study first presents a simple criterion and the corresponding low complexity algorithm to design the optimal partition of antennas using statistical CSI. Then it derives the lower bound and its approximation for the average mutual information, in which the computational complexity is greatly reduced compared to calculating the average mutual information directly. In addition, it also shows that the lower bound with a constant shift offers a very accurate approximation to the average mutual information. This paper further proposes utilizing the lower bound approximation as a low-complexity and accurate alternative for developing a manifold-based gradient ascent algorithm to find near optimal analog and digital precoders. Several numerical results are provided to show that our proposed algorithm outperforms existing hybrid precoding algorithms.
Automated Segmentation of the Optic Disk and Cup using Dual-Stage Fully Convolutional Networks
Venue: arXiv cs.CV 2019
Year: 2019

Automated segmentation of the optic cup and disk on retinal fundus images is fundamental for the automated detection / analysis of glaucoma. Traditional segmentation approaches depend heavily upon hand-crafted features and a priori knowledge of the user. As such, these methods are difficult to be adapt to the clinical environment. Recently, deep learning methods based on fully convolutional networks (FCNs) have been successful in resolving segmentation problems. However, the reliance on large annotated training data is problematic when dealing with medical images. If a sufficient amount of annotated training data to cover all possible variations is not available, FCNs do not provide accurate segmentation. In addition, FCNs have a large receptive field in the convolutional layers, and hence produce coarse outputs of boundaries. Hence, we propose a new fully automated method that we refer to as a dual-stage fully convolutional networks (DSFCN). Our approach leverages deep residual architectures and FCNs and learns and infers the location of the optic cup and disk in a step-wise manner with fine-grained details. During training, our approach learns from the training data and the estimated results derived from the previous iteration. The ability to learn from the previous iteration optimizes the learning of the optic cup and the disk boundaries. During testing (prediction), DSFCN uses test (input) images and the estimated probability map derived from previous iterations to gradually improve the segmentation accuracy. Our method achieved an average Dice co-efficient of 0.8488 and 0.9441 for optic cup and disk segmentation and an area under curve (AUC) of 0.9513 for glaucoma detection.
On the Expressive Power of Kernel Methods and the Efficiency of Kernel Learning by Association Schemes
Venue: arXiv cs.LG 2019
Year: 2019

We study the expressive power of kernel methods and the algorithmic feasibility of multiple kernel learning for a special rich class of kernels. Specifically, we define \emph{Euclidean kernels}, a diverse class that includes most, if not all, families of kernels studied in literature such as polynomial kernels and radial basis functions. We then describe the geometric and spectral structure of this family of kernels over the hypercube (and to some extent for any compact domain). Our structural results allow us to prove meaningful limitations on the expressive power of the class as well as derive several efficient algorithms for learning kernels over different domains.
Relative rationality: Is machine rationality subjective?
Venue: arXiv cs.AI 2019
Year: 2019

Rational decision making in its linguistic description means making logical decisions. In essence, a rational agent optimally processes all relevant information to achieve its goal. Rationality has two elements and these are the use of relevant information and the efficient processing of such information. In reality, relevant information is incomplete, imperfect and the processing engine, which is a brain for humans, is suboptimal. Humans are risk averse rather than utility maximizers. In the real world, problems are predominantly non-convex and this makes the idea of rational decision-making fundamentally unachievable and Herbert Simon called this bounded rationality. There is a trade-off between the amount of information used for decision-making and the complexity of the decision model used. This explores whether machine rationality is subjective and concludes that indeed it is.
Delog: A Privacy Preserving Log Filtering Framework for Online Compute Platforms
Venue: arXiv cs.IR 2019
Year: 2019

In many software applications, logs serve as the only interface between the application and the developer. However, navigating through the logs of long-running applications is often challenging. Logs from previously successful application runs can be leveraged to automatically identify errors and provide users with only the logs that are relevant to the debugging process. We describe a privacy preserving framework which can be employed by Platform as a Service (PaaS) providers to utilize the user logs generated on the platform while protecting the potentially sensitive logged data. Further, in order to accurately and scalably parse log lines, we present a distributed log parsing algorithm which leverages Locality Sensitive Hashing (LSH). We outperform the state-of-the-art on multiple datasets. We further demonstrate the scalability of Delog on publicly available Thunderbird log dataset with close to 27,000 unique patterns and 211 million lines.