OpenRaiser/Intern-Atlas huggingface dataset:
Thermal coupling and effect of subharmonic synchronization in a system of two VO2 based oscillators
Venue: arXiv cs.NE 2020
Year: 2020

We explore a prototype of an oscillatory neural network (ONN) based on vanadium dioxide switching devices. The model system under study represents two oscillators based on thermally coupled VO2 switches. Numerical simulation shows that the effective action radius RTC of coupling depends both on the total energy released during switching and on the average power. It is experimentally and numerically proved that the temperature change dT commences almost synchronously with the released power peak and T-coupling reveals itself up to a frequency of about 10 kHz. For the studied switching structure configuration, the RTC value varies over a wide range from 4 to 45 mkm, depending on the external circuit capacitance C and resistance Ri, but the variation of Ri is more promising from the practical viewpoint. In the case of a "weak" coupling, synchronization is accompanied by attraction effect and decrease of the main spectra harmonics width. In the case of a "strong" coupling, the number of effects increases, synchronization can occur on subharmonics resulting in multilevel stable synchronization of two oscillators. An advanced algorithm for synchronization efficiency and subharmonic ratio calculation is proposed. It is shown that of the two oscillators the leading one is that with a higher main frequency, and, in addition, the frequency stabilization effect is observed. Also, in the case of a strong thermal coupling, the limit of the supply current parameters, for which the oscillations exist, expands by ~ 10 %. The obtained results have a universal character and open up a new kind of coupling in ONNs, namely, T-coupling, which allows for easy transition from 2D to 3D integration. The effect of subharmonic synchronization hold promise for application in classification and pattern recognition.
A Block-based Generative Model for Attributed Networks Embedding
Venue: arXiv cs.LG 2020
Year: 2020

Attributed network embedding has attracted plenty of interest in recent years. It aims to learn task-independent, low-dimensional, and continuous vectors for nodes preserving both topology and attribute information. Most of the existing methods, such as random-walk based methods and GCNs, mainly focus on the local information, i.e., the attributes of the neighbours. Thus, they have been well studied for assortative networks (i.e., networks with communities) but ignored disassortative networks (i.e., networks with multipartite, hubs, and hybrid structures), which are common in the real world. To enable model both assortative and disassortative networks, we propose a block-based generative model for attributed network embedding from a probability perspective. Specifically, the nodes are assigned to several blocks wherein the nodes in the same block share the similar linkage patterns. These patterns can define assortative networks containing communities or disassortative networks with the multipartite, hub, or any hybrid structures. To preserve the attribute information, we assume that each node has a hidden embedding related to its assigned block. We use a neural network to characterize the nonlinearity between node embeddings and node attributes. We perform extensive experiments on real-world and synthetic attributed networks. The results show that our proposed method consistently outperforms state-of-the-art embedding methods for both clustering and classification tasks, especially on disassortative networks.
Security and Privacy Challenges in Upcoming Intelligent Urban Micromobility Transportation Systems
Venue: arXiv cs.CR 2020
Year: 2020

Micromobility vehicles are gaining popularity due to their portable nature, and their ability to serve short distance urban commutes better than traditional modes of transportation. Most of these vehicles, offered by various micromobility service providers around the world, are shareable and can be rented (by-the-minute) by riders, thus eliminating the need of owning and maintaining a personal vehicle. However, the existing micromobility ecosystem comprising of vehicles, service providers, and their users, can be exploited as an attack surface by malicious entities - to compromise its security, safety and privacy. In this short position paper, we outline potential privacy and security challenges related to a very popular urban micromobility platform, specifically, dockless battery-powered e-scooters.
Joint Communication and Computational Resource Allocation for QoE-driven Point Cloud Video Streaming
Venue: arXiv cs.MM 2020
Year: 2020

Point cloud video is the most popular representation of hologram, which is the medium to precedent natural content in VR/AR/MR and is expected to be the next generation video. Point cloud video system provides users immersive viewing experience with six degrees of freedom and has wide applications in many fields such as online education, entertainment. To further enhance these applications, point cloud video streaming is in critical demand. The inherent challenges lie in the large size by the necessity of recording the three-dimensional coordinates besides color information, and the associated high computation complexity of encoding. To this end, this paper proposes a communication and computation resource allocation scheme for QoE-driven point cloud video streaming. In particular, we maximize system resource utilization by selecting different quantities, transmission forms and quality level tiles to maximize the quality of experience. Extensive simulations are conducted and the simulation results show the superior performance over the existing schemes
Frequency Fitness Assignment: Making Optimization Algorithms Invariant under Bijective Transformations of the Objective Function Value
Venue: arXiv cs.NE 2020
Year: 2020

Under Frequency Fitness Assignment (FFA), the fitness corresponding to an objective value is its encounter frequency in fitness assignment steps and is subject to minimization. FFA renders optimization processes invariant under bijective transformations of the objective function value. On TwoMax, Jump, and Trap functions of dimension s, the classical (1+1)-EA with standard mutation at rate 1/s can have expected runtimes exponential in s. In our experiments, a (1+1)-FEA, the same algorithm but using FFA, exhibits mean runtimes that seem to scale as $s^2\ln{s}$. Since Jump and Trap are bijective transformations of OneMax, it behaves identical on all three. On OneMax, LeadingOnes, and Plateau problems, it seems to be slower than the (1+1)-EA by a factor linear in s. The (1+1)-FEA performs much better than the (1+1)-EA on W-Model and MaxSat instances. We further verify the bijection invariance by applying the Md5 checksum computation as transformation to some of the above problems and yield the same behaviors. Finally, we show that FFA can improve the performance of a memetic algorithm for job shop scheduling.
Machine learning materials physics: Multi-resolution neural networks learn the free energy and nonlinear elastic response of evolving microstructures
Venue: arXiv cs.CE 2020
Year: 2020

Many important multi-component crystalline solids undergo mechanochemical spinodal decomposition: a phase transformation in which the compositional redistribution is coupled with structural changes of the crystal, resulting in dynamically evolving microstructures. The ability to rapidly compute the macroscopic behavior based on these detailed microstructures is of paramount importance for accelerating material discovery and design. Here, our focus is on the macroscopic, nonlinear elastic response of materials harboring microstructure. Because of the diversity of microstructural patterns that can form, there is interest in taking a purely computational approach to predicting their macroscopic response. However, the evaluation of macroscopic, nonlinear elastic properties purely based on direct numerical simulations (DNS) is computationally very expensive, and hence impractical for material design when a large number of microstructures need to be tested. A further complexity of a hierarchical nature arises if the elastic free energy and its variation with strain is a small-scale fluctuation on the dominant trajectory of the total free energy driven by microstructural dynamics. To address these challenges, we present a data-driven approach, which combines advanced neural network (NN) models with DNS to predict the homogenized, macroscopic, mechanical free energy and stress fields arising in a family of multi-component crystalline solids that develop microstructure. The hierarchical structure of the free energy's evolution induces a multi-resolution character to the machine learning paradigm: We construct knowledge-based neural networks (KBNNs) with either pre-trained fully connected deep neural networks (DNNs), or pre-trained convolutional neural networks (CNNs) that describe the dominant characteristic of the data to fully represent the hierarchically evolving free energy.
Dissecting Catastrophic Forgetting in Continual Learning by Deep Visualization
Venue: arXiv cs.LG 2020
Year: 2020

Interpreting the behaviors of Deep Neural Networks (usually considered as a black box) is critical especially when they are now being widely adopted over diverse aspects of human life. Taking the advancements from Explainable Artificial Intelligent, this paper proposes a novel technique called Auto DeepVis to dissect catastrophic forgetting in continual learning. A new method to deal with catastrophic forgetting named critical freezing is also introduced upon investigating the dilemma by Auto DeepVis. Experiments on a captioning model meticulously present how catastrophic forgetting happens, particularly showing which components are forgetting or changing. The effectiveness of our technique is then assessed; and more precisely, critical freezing claims the best performance on both previous and coming tasks over baselines, proving the capability of the investigation. Our techniques could not only be supplementary to existing solutions for completely eradicating catastrophic forgetting for life-long learning but also explainable.
Topic Extraction of Crawled Documents Collection using Correlated Topic Model in MapReduce Framework
Venue: arXiv cs.IR 2020
Year: 2020

The tremendous increase in the amount of available research documents impels researchers to propose topic models to extract the latent semantic themes of a documents collection. However, how to extract the hidden topics of the documents collection has become a crucial task for many topic model applications. Moreover, conventional topic modeling approaches suffer from the scalability problem when the size of documents collection increases. In this paper, the Correlated Topic Model with variational Expectation-Maximization algorithm is implemented in MapReduce framework to solve the scalability problem. The proposed approach utilizes the dataset crawled from the public digital library. In addition, the full-texts of the crawled documents are analysed to enhance the accuracy of MapReduce CTM. The experiments are conducted to demonstrate the performance of the proposed algorithm. From the evaluation, the proposed approach has a comparable performance in terms of topic coherences with LDA implemented in MapReduce framework.
Meta-modal Information Flow: A Method for Capturing Multimodal Modular Disconnectivity in Schizophrenia
Venue: arXiv cs.LG 2020
Year: 2020

Objective: Multimodal measurements of the same phenomena provide complementary information and highlight different perspectives, albeit each with their own limitations. A focus on a single modality may lead to incorrect inferences, which is especially important when a studied phenomenon is a disease. In this paper, we introduce a method that takes advantage of multimodal data in addressing the hypotheses of disconnectivity and dysfunction within schizophrenia (SZ). Methods: We start with estimating and visualizing links within and among extracted multimodal data features using a Gaussian graphical model (GGM). We then propose a modularity-based method that can be applied to the GGM to identify links that are associated with mental illness across a multimodal data set. Through simulation and real data, we show our approach reveals important information about disease-related network disruptions that are missed with a focus on a single modality. We use functional MRI (fMRI), diffusion MRI (dMRI), and structural MRI (sMRI) to compute the fractional amplitude of low frequency fluctuations (fALFF), fractional anisotropy (FA), and gray matter (GM) concentration maps. These three modalities are analyzed using our modularity method. Results: Our results show missing links that are only captured by the cross-modal information that may play an important role in disconnectivity between the components. Conclusion: We identified multimodal (fALFF, FA and GM) disconnectivity in the default mode network area in patients with SZ, which would not have been detectable in a single modality. Significance: The proposed approach provides an important new tool for capturing information that is distributed among multiple imaging modalities.
Experimental Analysis of Reinforcement Learning Techniques for Spectrum Sharing Radar
Venue: arXiv cs.LG 2020
Year: 2020

In this work, we first describe a framework for the application of Reinforcement Learning (RL) control to a radar system that operates in a congested spectral setting. We then compare the utility of several RL algorithms through a discussion of experiments performed on Commercial off-the-shelf (COTS) hardware. Each RL technique is evaluated in terms of convergence, radar detection performance achieved in a congested spectral environment, and the ability to share 100MHz spectrum with an uncooperative communications system. We examine policy iteration, which solves an environment posed as a Markov Decision Process (MDP) by directly solving for a stochastic mapping between environmental states and radar waveforms, as well as Deep RL techniques, which utilize a form of Q-Learning to approximate a parameterized function that is used by the radar to select optimal actions. We show that RL techniques are beneficial over a Sense-and-Avoid (SAA) scheme and discuss the conditions under which each approach is most effective.
Artificial Intelligence for Social Good: A Survey
Venue: arXiv cs.CY 2020
Year: 2020

Artificial intelligence for social good (AI4SG) is a research theme that aims to use and advance artificial intelligence to address societal issues and improve the well-being of the world. AI4SG has received lots of attention from the research community in the past decade with several successful applications. Building on the most comprehensive collection of the AI4SG literature to date with over 1000 contributed papers, we provide a detailed account and analysis of the work under the theme in the following ways. (1) We quantitatively analyze the distribution and trend of the AI4SG literature in terms of application domains and AI techniques used. (2) We propose three conceptual methods to systematically group the existing literature and analyze the eight AI4SG application domains in a unified framework. (3) We distill five research topics that represent the common challenges in AI4SG across various application domains. (4) We discuss five issues that, we hope, can shed light on the future development of the AI4SG research.
Network-Based Analysis of Public Transportation Systems in North American Cities
Venue: arXiv cs.SI 2020
Year: 2020

A comprehensive data analysis system is implemented for the extraction of information and comparison of North American public transport systems. The system is based on network representations of the transport systems and makes use of a span of metrics and algorithms from the established properties in graph theory to complicated domain specific measurements. Due to nature of big data systems and the requirement of scalability, many heuristic optimizations and approximations have been considered in the system. Integration with other sources of data specially population density maps is also executed in the system. Formal evaluations are done on subcomponents of the system to make sure the approximations have reasonable precision. Results on comparison of four cities, San Francisco, Boston, Toronto and Los Angeles, approves that the big data approach to comparison of public transit systems can successfully reveal the underlying similarities and differences.
A Conceptual Paper on SERVQUAL-Framework for Assessing Quality of Internet of Things (IoT) Services
Venue: arXiv cs.HC 2020
Year: 2020

Service quality possesses the vital prominence in usability of innovative products and services. As technological innovation has made the life synchronized and effective, Internet of Things (IoT) is matter of discussion everywhere. From users' perspective, IoT services are always embraced by various system characteristics of security and performance. A service quality model can better present the preference of such technology customers. the study intends to project theoretical model of service quality for internet of things (IoT). Based on the existing models of service quality and the literature in internet of things, a framework is proposed to conceptualize and measure service quality for internet of things.This study established the IoT-Servqual model with four dimensions (i.e., Privacy, Functionality, Efficiency, and Tangibility) of multiple service quality models. These dimensions are essential and inclined towards the users' leaning of IoT Services. This paper contributes to research on internet of things services by development of a comprehensive framework for customers' quality apprehension. This model will previse the expression of information secrecy of users related with internet of things (IoT). This research will advance understanding of service quality in modern day technology and assist firms to devise the fruitful service structure.
Optimal Transmission of Multi-Quality Tiled 360 VR Video by Exploiting Multicast Opportunities
Venue: arXiv cs.IT 2020
Year: 2020

In this paper, we would like to investigate fundamental impacts of multicast opportunities on efficient transmission of a 360 VR video to multiple users in the cases with and without transcoding at each user. We establish a novel mathematical model that reflects the impacts of multicast opportunities on the average transmission energy in both cases and the transcoding energy in the case with user transcoding, and facilitates the optimal exploitation of transcoding-enabled multicast opportunities. In the case without user transcoding, we optimize the transmission resource allocation to minimize the average transmission energy by exploiting natural multicast opportunities. The problem is nonconvex. We transform it to an equivalent convex problem and obtain an optimal solution using standard convex optimization techniques. In the case with user transcoding, we optimize the transmission resource allocation and the transmission quality level selection to minimize the weighted sum of the average transmission energy and the transcoding energy by exploiting both natural and transcoding-enabled multicast opportunities. The problem is a challenging mixed discrete-continuous optimization problem. We transform it to a Difference of Convex (DC) programming problem and obtain a suboptimal solution using a DC algorithm. Finally, numerical results demonstrate the importance of effective exploitation of transcoding-enabled multicast opportunities in the case with user transcoding.
Automated Pavement Crack Segmentation Using U-Net-based Convolutional Neural Network
Venue: arXiv cs.CV 2020
Year: 2020

Automated pavement crack image segmentation is challenging because of inherent irregular patterns, lighting conditions, and noise in images. Conventional approaches require a substantial amount of feature engineering to differentiate crack regions from non-affected regions. In this paper, we propose a deep learning technique based on a convolutional neural network to perform segmentation tasks on pavement crack images. Our approach requires minimal feature engineering compared to other machine learning techniques. We propose a U-Net-based network architecture in which we replace the encoder with a pretrained ResNet-34 neural network. We use a "one-cycle" training schedule based on cyclical learning rates to speed up the convergence. Our method achieves an F1 score of 96% on the CFD dataset and 73% on the Crack500 dataset, outperforming other algorithms tested on these datasets. We perform ablation studies on various techniques that helped us get marginal performance boosts, i.e., the addition of spatial and channel squeeze and excitation (SCSE) modules, training with gradually increasing image sizes, and training various neural network layers with different learning rates.
Prediction of Drug Synergy by Ensemble Learning
Venue: arXiv cs.LG 2020
Year: 2020

One of the promising methods for the treatment of complex diseases such as cancer is combinational therapy. Due to the combinatorial complexity, machine learning models can be useful in this field, where significant improvements have recently been achieved in determination of synergistic combinations. In this study, we investigate the effectiveness of different compound representations in predicting the drug synergy. On a large drug combination screen dataset, we first demonstrate the use of a promising representation that has not been used for this problem before, then we propose an ensemble on representation-model combinations that outperform each of the baseline models.
CNN 101: Interactive Visual Learning for Convolutional Neural Networks
Venue: arXiv cs.HC 2020
Year: 2020

The success of deep learning solving previously-thought hard problems has inspired many non-experts to learn and understand this exciting technology. However, it is often challenging for learners to take the first steps due to the complexity of deep learning models. We present our ongoing work, CNN 101, an interactive visualization system for explaining and teaching convolutional neural networks. Through tightly integrated interactive views, CNN 101 offers both overview and detailed descriptions of how a model works. Built using modern web technologies, CNN 101 runs locally in users' web browsers without requiring specialized hardware, broadening the public's education access to modern deep learning techniques.
The Langberg-Médard Multiple Unicast Conjecture: Stable $3$-Pair Networks
Venue: arXiv cs.IT 2020
Year: 2020

The Langberg-Médard multiple unicast conjecture claims that for a strongly reachable $k$-pair network, there exists a multi-flow with rate $(1,1,\dots,1)$. In this paper, we show that the conjecture holds true for {\em stable} $3$-pair networks.
Exploring Unknown Universes in Probabilistic Relational Models
Venue: arXiv cs.AI 2020
Year: 2020

Large probabilistic models are often shaped by a pool of known individuals (a universe) and relations between them. Lifted inference algorithms handle sets of known individuals for tractable inference. Universes may not always be known, though, or may only described by assumptions such as "small universes are more likely". Without a universe, inference is no longer possible for lifted algorithms, losing their advantage of tractable inference. The aim of this paper is to define a semantics for models with unknown universes decoupled from a specific constraint language to enable lifted and thereby, tractable inference.