OpenRaiser/Intern-Atlas huggingface dataset:
Synthesizing New Retinal Symptom Images by Multiple Generative Models
Venue: arXiv cs.CV 2019
Year: 2019

Age-Related Macular Degeneration (AMD) is an asymptomatic retinal disease which may result in loss of vision. There is limited access to high-quality relevant retinal images and poor understanding of the features defining sub-classes of this disease. Motivated by recent advances in machine learning we specifically explore the potential of generative modeling, using Generative Adversarial Networks (GANs) and style transferring, to facilitate clinical diagnosis and disease understanding by feature extraction. We design an analytic pipeline which first generates synthetic retinal images from clinical images; a subsequent verification step is applied. In the synthesizing step we merge GANs (DCGANs and WGANs architectures) and style transferring for the image generation, whereas the verified step controls the accuracy of the generated images. We find that the generated images contain sufficient pathological details to facilitate ophthalmologists' task of disease classification and in discovery of disease relevant features. In particular, our system predicts the drusen and geographic atrophy sub-classes of AMD. Furthermore, the performance using CFP images for GANs outperforms the classification based on using only the original clinical dataset. Our results are evaluated using existing classifier of retinal diseases and class activated maps, supporting the predictive power of the synthetic images and their utility for feature extraction. Our code examples are available online.
Learning to Authenticate with Deep Multibiometric Hashing and Neural Network Decoding
Venue: arXiv cs.CV 2019
Year: 2019

In this paper, we propose a novel multimodal deep hashing neural decoder (MDHND) architecture, which integrates a deep hashing framework with a neural network decoder (NND) to create an effective multibiometric authentication system. The MDHND consists of two separate modules: a multimodal deep hashing (MDH) module, which is used for feature-level fusion and binarization of multiple biometrics, and a neural network decoder (NND) module, which is used to refine the intermediate binary codes generated by the MDH and compensate for the difference between enrollment and probe biometrics (variations in pose, illumination, etc.). Use of NND helps to improve the performance of the overall multimodal authentication system. The MDHND framework is trained in 3 steps using joint optimization of the two modules. In Step 1, the MDH parameters are trained and learned to generate a shared multimodal latent code; in Step 2, the latent codes from Step 1 are passed through a conventional error-correcting code (ECC) decoder to generate the ground truth to train a neural network decoder (NND); in Step 3, the NND decoder is trained using the ground truth from Step 2 and the MDH and NND are jointly optimized. Experimental results on a standard multimodal dataset demonstrate the superiority of our method relative to other current multimodal authentication systems
Nearest Neighbor Median Shift Clustering for Binary Data
Venue: arXiv cs.LG 2019
Year: 2019

We describe in this paper the theory and practice behind a new modal clustering method for binary data. Our approach (BinNNMS) is based on the nearest neighbor median shift. The median shift is an extension of the well-known mean shift, which was designed for continuous data, to handle binary data. We demonstrate that BinNNMS can discover accurately the location of clusters in binary data with theoretical and experimental analyses.
Riemannian joint dimensionality reduction and dictionary learning on symmetric positive definite manifold
Venue: arXiv cs.CV 2019
Year: 2019

Dictionary leaning (DL) and dimensionality reduction (DR) are powerful tools to analyze high-dimensional noisy signals. This paper presents a proposal of a novel Riemannian joint dimensionality reduction and dictionary learning (R-JDRDL) on symmetric positive definite (SPD) manifolds for classification tasks. The joint learning considers the interaction between dimensionality reduction and dictionary learning procedures by connecting them into a unified framework. We exploit a Riemannian optimization framework for solving DL and DR problems jointly. Finally, we demonstrate that the proposed R-JDRDL outperforms existing state-of-the-arts algorithms when used for image classification tasks.
Effects of empathy on the evolution of fairness in group-structured populations
Venue: arXiv cs.GT 2019
Year: 2019

The ultimatum game has been a prominent paradigm in studying the evolution of fairness. It predicts that responders should accept any nonzero offer and proposers should offer the smallest possible amount according to orthodox game theory. However, the prediction strongly contradicts with experimental findings where responders usually reject low offers below $20\%$ and proposers usually make higher offers than expected. To explain the evolution of such fair behaviors, we here introduce empathy in group-structured populations by allowing a proportion $α$ of the population to play empathetic strategies. Interestingly, we find that for high mutation probabilities, the mean offer decreases with $α$ and the mean demand increases, implying empathy inhibits the evolution of fairness. For low mutation probabilities, the mean offer and demand approach to the fair ones with increasing $α$, implying empathy promotes the evolution of fairness. Furthermore, under both weak and strong intensities of natural selection, we analytically calculate the mean offer and demand for different levels of $α$. Counterintuitively, we demonstrate that although a higher mutation probability leads to a higher level of fairness under weak selection, an intermediate mutation probability corresponds to the lowest level of fairness under strong selection. Our study provides systematic insights into the evolutionary origin of fairness in group-structured populations with empathetic strategies.
Post-Data Augmentation to Improve Deep Pose Estimation of Extreme and Wild Motions
Venue: arXiv cs.LG 2019
Year: 2019

Contributions of recent deep-neural-network (DNN) based techniques have been playing a significant role in human-computer interaction (HCI) and user interface (UI) domains. One of the commonly used DNNs is human pose estimation. This kind of technique is widely used for motion capturing of humans, and to generate or modify virtual avatars. However, in order to gain accuracy and to use such systems, large and precise datasets are required for the machine learning (ML) procedure. This can be especially difficult for extreme/wild motions such as acrobatic movements or motions in specific sports, which are difficult to estimate in typically provided training models. In addition, training may take a long duration, and will require a high-grade GPU for sufficient speed. To address these issues, we propose a method to improve the pose estimation accuracy for extreme/wild motions by using pre-trained models, i.e., without performing the training procedure by yourselves. We assume our method to encourage usage of these DNN techniques for users in application areas that are out of the ML field, and to help users without high-end computers to apply them for personal and end use cases.
Reading Protocol: Understanding what has been Read in Interactive Information Retrieval Tasks
Venue: arXiv cs.IR 2019
Year: 2019

In Interactive Information Retrieval (IIR) experiments the user's gaze motion on web pages is often recorded with eye tracking. The data is used to analyze gaze behavior or to identify Areas of Interest (AOI) the user has looked at. So far, tools for analyzing eye tracking data have certain limitations in supporting the analysis of gaze behavior in IIR experiments. Experiments often consist of a huge number of different visited web pages. In existing analysis tools the data can only be analyzed in videos or images and AOIs for every single web page have to be specified by hand, in a very time consuming process. In this work, we propose the reading protocol software which breaks eye tracking data down to the textual level by considering the HTML structure of the web pages. This has a lot of advantages for the analyst. First and foremost, it can easily be identified on a large scale what has actually been viewed and read on the stimuli pages by the subjects. Second, the web page structure can be used to filter to AOIs. Third, gaze data of multiple users can be presented on the same page, and fourth, fixation times on text can be exported and further processed in other tools. We present the software, its validation, and example use cases with data from three existing IIR experiments.
IEEE 802.11be Extremely High Throughput: The Next Generation of Wi-Fi Technology Beyond 802.11ax
Venue: arXiv cs.IT 2019
Year: 2019

Wi-Fi technology is continuously innovating to cater to the growing customer demands, driven by the digitalisation of everything, both in the home as well as the enterprise and hotspot spaces. In this article, we introduce to the wireless community the next generation Wi-Fi$-$based on IEEE 802.11be Extremely High Throughput (EHT)$-$, present the main objectives and timelines of this new 802.11be amendment, thoroughly describe its main candidate features and enhancements, and cover the important issue of coexistence with other wireless technologies. We also provide simulation results to assess the potential throughput gains brought by 802.11be with respect to 802.11ax.
VIZARD: Reliable Visual Localization for Autonomous Vehicles in Urban Outdoor Environments
Venue: arXiv cs.RO 2019
Year: 2019

Changes in appearance is one of the main sources of failure in visual localization systems in outdoor environments. To address this challenge, we present VIZARD, a visual localization system for urban outdoor environments. By combining a local localization algorithm with the use of multi-session maps, a high localization recall can be achieved across vastly different appearance conditions. The fusion of the visual localization constraints with wheel-odometry in a state estimation framework further guarantees smooth and accurate pose estimates. In an extensive experimental evaluation on several hundreds of driving kilometers in challenging urban outdoor environments, we analyze the recall and accuracy of our localization system, investigate its key parameters and boundary conditions, and compare different types of feature descriptors. Our results show that VIZARD is able to achieve nearly 100% recall with a localization accuracy below 0.5m under varying outdoor appearance conditions, including at night-time.
Distributed and Application-aware Task Scheduling in Edge-clouds
Venue: arXiv cs.DC 2019
Year: 2019

Edge computing is an emerging technology which places computing at the edge of the network to provide an ultra-low latency. Computation offloading, a paradigm that migrates computing from mobile devices to remote servers, can now use the power of edge computing by offloading computation to cloudlets in edge-clouds. However, the task scheduling of computation offloading in edge-clouds faces a two-fold challenge. First, as cloudlets are geographically distributed, it is difficult for each cloudlet to perform load balancing without centralized control. Second, as tasks of computation offloading have a wide variety of types, to guarantee the user quality of experience (QoE) in terms of task types is challenging. In this paper, we present Petrel, a distributed and application-aware task scheduling framework for edge-clouds. Petrel implements a sample-based load balancing technology and further adopts adaptive scheduling policies according to task types. This application-aware scheduling not only provides QoE guarantee but also improves the overall scheduling performance. Trace-driven simulations show that Petrel achieves a significant improvement over existing scheduling strategies.
Real Time Lateral Movement Detection based on Evidence Reasoning Network for Edge Computing Environment
Venue: arXiv cs.CR 2019
Year: 2019

Edge computing is providing higher class intelligent service and computing capabilities at the edge of the network. The aim is to ease the backhaul impacts and offer an improved user experience, however, the edge artificial intelligence exacerbates the security of the cloud computing environment due to the dissociation of data, access control and service stages. In order to prevent users from using the edge-cloud computing environment to carry out lateral movement attacks, we proposed a method named CloudSEC meaning real time lateral movement detection based on evidence reasoning network for the edge-cloud environment. The concept of vulnerability correlation is introduced. Based on the vulnerability knowledge and environmental information of the network system, the evidence reasoning network is constructed, and the lateral movement reasoning ability provided by the evidence reasoning network is used. CloudSEC realizes the reconfiguration of the efficient real-time attack process. The experiment shows that the results are complete and credible.
Evolving Robots on Easy Mode: Towards a Variable Complexity Controller for Quadrupeds
Venue: arXiv cs.RO 2019
Year: 2019

The complexity of a legged robot's environment or task can inform how specialised its gait must be to ensure success. Evolving specialised robotic gaits demands many evaluations - acceptable for computer simulations, but not for physical robots. For some tasks, a more general gait, with lower optimization costs, could be satisfactory. In this paper, we introduce a new type of gait controller where complexity can be set by a single parameter, using a dynamic genotype-phenotype mapping. Low controller complexity leads to conservative gaits, while higher complexity allows more sophistication and high performance for demanding tasks, at the cost of optimization effort. We investigate the new controller on a virtual robot in simulations and do preliminary testing on a real-world robot. We show that having variable complexity allows us to adapt to different optimization budgets. With a high evaluation budget in simulation, a complex controller performs best. Moreover, real-world evolution with a limited evaluation budget indicates that a lower gait complexity is preferable for a relatively simple environment.
SLNR Based Precoding for One-Bit Quantized Massive MIMO in mmWave Communications
Venue: arXiv cs.IT 2019
Year: 2019

Massive multiple-input multiple-output (MIMO) is a key technology for 5G wireless communications with a promise of significant capacity increase. The use of low-resolution data converters is crucial for massive MIMO to make the overall transmission as cost- and energy-efficient as possible. In this work, we consider a downlink millimeter-wave (mmWave) transmission scenario, where multiple users are served simultaneously by massive MIMO with one-bit digital-to-analog (D/A) converters. In particular, we propose a novel precoder design based on signal-to-leakage-plus-noise ratio (SLNR), which minimizes energy leakage into undesired users while taking into account impairments due to nonlinear one-bit quantization. We show that well-known regularized zero-forcing (RZF) precoder is a particular version of the proposed SLNR-based precoder, which is obtained when quantization impairments are totally ignored. Numerical results underscore significant performance improvements along with the proposed SLNR-based precoder as compared to either RZF or zero-forcing (ZF) precoders.
A Probabilistic Framework to Node-level Anomaly Detection in Communication Networks
Venue: arXiv cs.LG 2019
Year: 2019

In this paper we consider the task of detecting abnormal communication volume occurring at node-level in communication networks. The signal of the communication activity is modeled by means of a clique stream: each occurring communication event is instantaneous and activates an undirected subgraph spanning over a set of equally participating nodes. We present a probabilistic framework to model and assess the communication volume observed at any single node. Specifically, we employ non-parametric regression to learn the probability that a node takes part in a certain event knowing the set of other nodes that are involved. On the top of that, we present a concentration inequality around the estimated volume of events in which a node could participate, which in turn allows us to build an efficient and interpretable anomaly scoring function. Finally, the superior performance of the proposed approach is empirically demonstrated in real-world sensor network data, as well as using synthetic communication activity that is in accordance with that latter setting.
ACTRCE: Augmenting Experience via Teacher's Advice For Multi-Goal Reinforcement Learning
Venue: arXiv cs.LG 2019
Year: 2019

Sparse reward is one of the most challenging problems in reinforcement learning (RL). Hindsight Experience Replay (HER) attempts to address this issue by converting a failed experience to a successful one by relabeling the goals. Despite its effectiveness, HER has limited applicability because it lacks a compact and universal goal representation. We present Augmenting experienCe via TeacheR's adviCE (ACTRCE), an efficient reinforcement learning technique that extends the HER framework using natural language as the goal representation. We first analyze the differences among goal representation, and show that ACTRCE can efficiently solve difficult reinforcement learning problems in challenging 3D navigation tasks, whereas HER with non-language goal representation failed to learn. We also show that with language goal representations, the agent can generalize to unseen instructions, and even generalize to instructions with unseen lexicons. We further demonstrate it is crucial to use hindsight advice to solve challenging tasks, and even small amount of advice is sufficient for the agent to achieve good performance.
Finite Horizon Throughput Maximization for a Wirelessly Powered Device over a Time Varying Channel
Venue: arXiv cs.PF 2019
Year: 2019

In this work, we consider an energy harvesting device (EHD) served by an access point with a single antenna that is used for both wireless power transfer (WPT) and data transfer. The objective is to maximize the expected throughput of the EHD over a finite horizon when the channel state information is only available causally. The EHD is energized by WPT for a certain duration, which is subject to optimization, and then, EHD transmits its information bits to the AP until the end of the time horizon by employing optimal dynamic power allocation. The joint optimization problem is modeled as a dynamic programming problem. Based on the characteristic of the problem, we prove that a time dependent threshold type structure exists for the optimal WPT duration, and we obtain closed form solution to the dynamic power allocation in the uplink period.
Communication over a time correlated channel with an energy harvesting transmitter
Venue: arXiv cs.PF 2019
Year: 2019

In this work, communication over a time-correlated point-to-point wireless channel is studied for an energy harvesting (EH) transmitter. In this model, we take into account the time and energy cost of acquiring channel state information. At the beginning of the time slot, the EH transmitter, has to choose among three possible actions: i) deferring the transmission to save its energy for future use, ii) transmitting without sensing, and iii) sensing the channel before transmission. At each time slot, the transmitter chooses one of the three possible actions to maximize the total expected discounted number of bits transmitted over an infinite time horizon. This problem can be formulated as a partially observable Markov decision process (POMDP) which is then converted to an ordinary MDP by introducing a belief on the channel state, and the optimal policy is shown to exhibit a threshold behavior on the belief state, with battery-dependent threshold values. Optimal threshold values and corresponding optimal performance are characterized through numerical simulations, and it is shown that having the sensing action and intelligently using it to track the channel state improves the achievable long-term throughput significantly.
Machine Reading Comprehension for Answer Re-Ranking in Customer Support Chatbots
Venue: arXiv cs.CL 2019
Year: 2019

Recent advances in deep neural networks, language modeling and language generation have introduced new ideas to the field of conversational agents. As a result, deep neural models such as sequence-to-sequence, Memory Networks, and the Transformer have become key ingredients of state-of-the-art dialog systems. While those models are able to generate meaningful responses even in unseen situation, they need a lot of training data to build a reliable model. Thus, most real-world systems stuck to traditional approaches based on information retrieval and even hand-crafted rules, due to their robustness and effectiveness, especially for narrow-focused conversations. Here, we present a method that adapts a deep neural architecture from the domain of machine reading comprehension to re-rank the suggested answers from different models using the question as context. We train our model using negative sampling based on question-answer pairs from the Twitter Customer Support Dataset.The experimental results show that our re-ranking framework can improve the performance in terms of word overlap and semantics both for individual models as well as for model combinations.
Global labor flow network reveals the hierarchical organization and dynamics of geo-industrial clusters in the world economy
Venue: arXiv cs.SI 2019
Year: 2019

Groups of firms often achieve a competitive advantage through the formation of geo-industrial clusters. Although many exemplary clusters, such as Hollywood or Silicon Valley, have been frequently studied, systematic approaches to identify and analyze the hierarchical structure of the geo-industrial clusters at the global scale are rare. In this work, we use LinkedIn's employment histories of more than 500 million users over 25 years to construct a labor flow network of over 4 million firms across the world and apply a recursive network community detection algorithm to reveal the hierarchical structure of geo-industrial clusters. We show that the resulting geo-industrial clusters exhibit a stronger association between the influx of educated-workers and financial performance, compared to existing aggregation units. Furthermore, our additional analysis of the skill sets of educated-workers supplements the relationship between the labor flow of educated-workers and productivity growth. We argue that geo-industrial clusters defined by labor flow provide better insights into the growth and the decline of the economy than other common economic units.