OpenRaiser/Intern-Atlas huggingface dataset:
Mutual Coupling and Unit Cell Aware Optimization for Reconfigurable Intelligent Surfaces
Venue: arXiv cs.IT 2020
Year: 2020

Reconfigurable intelligent surfaces (RISs) are an emerging technology for enhancing the performance of wireless networks at a low and affordable cost, complexity, and power consumption. We introduce an algorithm for optimizing a single-input single-output RIS-assisted system in which the RIS is modeled by using an electromagnetic-compliant framework based on mutual impedances. More precisely, we provide the following new contributions: (i) in the absence of mutual coupling among the scattering elements of the RIS, we derive a closed-form expression for the optimal tunable impedances, which inherently accounts for the interplay between the amplitude and phase of the lumped loads of the RIS; and (ii) in the presence of mutual coupling, we introduce an iterative algorithm for optimizing the tunable impedances of the RIS. The algorithm is proved to be convergent by showing that the objective function is non-decreasing and upper bounded. Numerical results reveal that the mutual coupling among the scattering elements of the RIS significantly affects the end-to-end signal-to-noise ratio (SNR) if the inter-distance is less than half of the wavelength. If the RIS is optimized by explicitly taking into account the impact of mutual coupling, a better end-to-end SNR is obtained.
Google Searches and COVID-19 Cases in Saudi Arabia: A Correlation Study
Venue: arXiv cs.IR 2020
Year: 2020

Background: The outbreak of the new coronavirus disease (COVID-19) has affected human life to a great extent on a worldwide scale. During the coronavirus pandemic, public health professionals at the early outbreak faced an extraordinary challenge to track and quantify the spread of disease. Objective: To investigate whether a digital surveillance model using google trends (GT) is feasible to monitor the outbreak of coronavirus in the Kingdom of Saudi Arabia. Methods: We retrieve GT data using ten common COVID-19 symptoms related keywords from March 2, 2020, to October 31, 2020. Spearman correlation were performed to determine the correlation between COVID-19 cases and the Google search terms. Results: GT data related to Cough and Sore Throat were the most searched symptoms by the Internet users in Saudi Arabia. The highest daily correlation found with the Loss of Smell followed by Loss of Taste and Diarrhea. Strong correlation as well was found between the weekly confirmed cases and the same symptoms: Loss of Smell, Loss of Taste and Diarrhea. Conclusions: We conducted an investigation study utilizing Internet searches related to COVID-19 symptoms for surveillance of the pandemic spread. This study documents that google searches can be used as a supplementary surveillance tool in COVID-19 monitoring in Saudi Arabia.
Improving Neural Network with Uniform Sparse Connectivity
Venue: arXiv cs.LG 2020
Year: 2020

Neural network forms the foundation of deep learning and numerous AI applications. Classical neural networks are fully connected, expensive to train and prone to overfitting. Sparse networks tend to have convoluted structure search, suboptimal performance and limited usage. We proposed the novel uniform sparse network (USN) with even and sparse connectivity within each layer. USN has one striking property that its performance is independent of the substantial topology variation and enormous model space, thus offers a search-free solution to all above mentioned issues of neural networks. USN consistently and substantially outperforms the state-of-the-art sparse network models in prediction accuracy, speed and robustness. It even achieves higher prediction accuracy than the fully connected network with only 0.55% parameters and 1/4 computing time and resources. Importantly, USN is conceptually simple as a natural generalization of fully connected network with multiple improvements in accuracy, robustness and scalability. USN can replace the latter in a range of applications, data types and deep learning architectures. We have made USN open source at https://github.com/datapplab/sparsenet.
Intrinsic Decomposition of Document Images In-the-Wild
Venue: arXiv cs.CV 2020
Year: 2020

Automatic document content processing is affected by artifacts caused by the shape of the paper, non-uniform and diverse color of lighting conditions. Fully-supervised methods on real data are impossible due to the large amount of data needed. Hence, the current state of the art deep learning models are trained on fully or partially synthetic images. However, document shadow or shading removal results still suffer because: (a) prior methods rely on uniformity of local color statistics, which limit their application on real-scenarios with complex document shapes and textures and; (b) synthetic or hybrid datasets with non-realistic, simulated lighting conditions are used to train the models. In this paper we tackle these problems with our two main contributions. First, a physically constrained learning-based method that directly estimates document reflectance based on intrinsic image formation which generalizes to challenging illumination conditions. Second, a new dataset that clearly improves previous synthetic ones, by adding a large range of realistic shading and diverse multi-illuminant conditions, uniquely customized to deal with documents in-the-wild. The proposed architecture works in a self-supervised manner where only the synthetic texture is used as a weak training signal (obviating the need for very costly ground truth with disentangled versions of shading and reflectance). The proposed approach leads to a significant generalization of document reflectance estimation in real scenes with challenging illumination. We extensively evaluate on the real benchmark datasets available for intrinsic image decomposition and document shadow removal tasks. Our reflectance estimation scheme, when used as a pre-processing step of an OCR pipeline, shows a 26% improvement of character error rate (CER), thus, proving the practical applicability.
Approximation algorithms for hitting subgraphs
Venue: arXiv cs.DS 2020
Year: 2020

Let $H$ be a fixed undirected graph on $k$ vertices. The $H$-hitting set problem asks for deleting a minimum number of vertices from a given graph $G$ in such a way that the resulting graph has no copies of $H$ as a subgraph. This problem is a special case of the hypergraph vertex cover problem on $k$-uniform hypergraphs, and thus admits an efficient $k$-factor approximation algorithm. The purpose of this article is to investigate the question that for which graphs $H$ this trivial approximation factor $k$ can be improved.
Value Function Based Performance Optimization of Deep Learning Workloads
Venue: arXiv cs.LG 2020
Year: 2020

As machine learning techniques become ubiquitous, the efficiency of neural network implementations is becoming correspondingly paramount. Frameworks, such as Halide and TVM, separate out the algorithmic representation of the network from the schedule that determines its implementation. Finding good schedules, however, remains extremely challenging. We model this scheduling problem as a sequence of optimization choices, and present a new technique to accurately predict the expected performance of a partial schedule. By leveraging these predictions we can make these optimization decisions greedily and rapidly identify an efficient schedule. This enables us to find schedules that improve the throughput of deep neural networks by 2.6x over Halide and 1.5x over TVM. Moreover, our technique is two to three orders of magnitude faster than that of these tools, and completes in seconds instead of hours.
Blind signal decomposition of various word embeddings based on join and individual variance explained
Venue: arXiv cs.CL 2020
Year: 2020

In recent years, natural language processing (NLP) has become one of the most important areas with various applications in human's life. As the most fundamental task, the field of word embedding still requires more attention and research. Currently, existing works about word embedding are focusing on proposing novel embedding algorithms and dimension reduction techniques on well-trained word embeddings. In this paper, we propose to use a novel joint signal separation method - JIVE to jointly decompose various trained word embeddings into joint and individual components. Through this decomposition framework, we can easily investigate the similarity and difference among different word embeddings. We conducted extensive empirical study on word2vec, FastText and GLoVE trained on different corpus and with different dimensions. We compared the performance of different decomposed components based on sentiment analysis on Twitter and Stanford sentiment treebank. We found that by mapping different word embeddings into the joint component, sentiment performance can be greatly improved for the original word embeddings with lower performance. Moreover, we found that by concatenating different components together, the same model can achieve better performance. These findings provide great insights into the word embeddings and our work offer a new of generating word embeddings by fusing.
Optimally Supporting IoT with Cell-Free Massive MIMO
Venue: arXiv cs.IT 2020
Year: 2020

We study internet of things (IoT) systems supported by cell-free (CF) massive MIMO (mMIMO) with optimal linear channel estimation. For the uplink, we consider optimal linear MIMO receiver and obtain an uplink SINR approximation involving only large-scale fading coefficients using random matrix (RM) theory. Using this approximation we design several max-min power control algorithms that incorporate power and rate weighting coefficients to achieve a target rate with high energy efficiency. For the downlink, we consider maximum ratio (MR) beamforming. Instead of solving a complex quasi-concave problem for downlink power control, we employ a neural network (NN) technique to obtain comparable power control with around 30 times reduction in computation time. For large networks we proposed a different NN based power control algorithm. This algorithm is sub-optimal, but its big advantage is that it is scalable.
Beyond LunAR: An augmented reality UI for deep-space exploration missions
Venue: arXiv cs.HC 2020
Year: 2020

As space exploration efforts shift to deep space missions, new challenges emerge regarding astronaut communication and task completion. While the round trip propagation delay for lunar communications is 2.6 seconds, the time delay increases to nearly 22 minutes for Mars missions. This creates a need for astronaut independence from earth-based assistance, and places greater significance upon the limited communications that are able to be delivered. To address this issue, we prototyped an augmented reality user interface for the new xEMU spacesuit, intended for use on planetary surface missions. This user interface assists with functions that would usually be completed by flight controllers in Mission Control, or are currently completed in manners that are unnecessarily difficult. We accomplish this through features such as AR model-based task instruction, sampling task assistance, note taking, and telemetry monitoring and display.
Heuristic Domain Adaptation
Venue: arXiv cs.CV 2020
Year: 2020

In visual domain adaptation (DA), separating the domain-specific characteristics from the domain-invariant representations is an ill-posed problem. Existing methods apply different kinds of priors or directly minimize the domain discrepancy to address this problem, which lack flexibility in handling real-world situations. Another research pipeline expresses the domain-specific information as a gradual transferring process, which tends to be suboptimal in accurately removing the domain-specific properties. In this paper, we address the modeling of domain-invariant and domain-specific information from the heuristic search perspective. We identify the characteristics in the existing representations that lead to larger domain discrepancy as the heuristic representations. With the guidance of heuristic representations, we formulate a principled framework of Heuristic Domain Adaptation (HDA) with well-founded theoretical guarantees. To perform HDA, the cosine similarity scores and independence measurements between domain-invariant and domain-specific representations are cast into the constraints at the initial and final states during the learning procedure. Similar to the final condition of heuristic search, we further derive a constraint enforcing the final range of heuristic network output to be small. Accordingly, we propose Heuristic Domain Adaptation Network (HDAN), which explicitly learns the domain-invariant and domain-specific representations with the above mentioned constraints. Extensive experiments show that HDAN has exceeded state-of-the-art on unsupervised DA, multi-source DA and semi-supervised DA. The code is available at https://github.com/cuishuhao/HDA.
A Survey on Deep Learning for Software Engineering
Venue: arXiv cs.SE 2020
Year: 2020

In 2006, Geoffrey Hinton proposed the concept of training ''Deep Neural Networks (DNNs)'' and an improved model training method to break the bottleneck of neural network development. More recently, the introduction of AlphaGo in 2016 demonstrated the powerful learning ability of deep learning and its enormous potential. Deep learning has been increasingly used to develop state-of-the-art software engineering (SE) research tools due to its ability to boost performance for various SE tasks. There are many factors, e.g., deep learning model selection, internal structure differences, and model optimization techniques, that may have an impact on the performance of DNNs applied in SE. Few works to date focus on summarizing, classifying, and analyzing the application of deep learning techniques in SE. To fill this gap, we performed a survey to analyse the relevant studies published since 2006. We first provide an example to illustrate how deep learning techniques are used in SE. We then summarize and classify different deep learning techniques used in SE. We analyzed key optimization technologies used in these deep learning models, and finally describe a range of key research topics using DNNs in SE. Based on our findings, we present a set of current challenges remaining to be investigated and outline a proposed research road map highlighting key opportunities for future work.
Zero-Shot Calibration of Fisheye Cameras
Venue: arXiv cs.CV 2020
Year: 2020

In this paper, we present a novel zero-shot camera calibration method that estimates camera parameters with no calibration image. It is common sense that we need at least one or more pattern images for camera calibration. However, the proposed method estimates camera parameters from the horizontal and vertical field of view information of the camera without any image acquisition. The proposed method is particularly useful for wide-angle or fisheye cameras that have large image distortion. Image distortion is modeled in the way fisheye lenses are designed and estimated based on the square pixel assumption of the image sensors. The calibration accuracy of the proposed method is evaluated on eight different commercial cameras qualitatively and quantitatively, and compared with conventional calibration methods. The experimental results show that the calibration accuracy of the zero-shot method is comparable to conventional full calibration results. The method can be used as a practical alternative in real applications where individual calibration is difficult or impractical, and in most field applications where calibration accuracy is less critical. Moreover, the estimated camera parameters by the method can also be used to provide proper initialization of any existing calibration methods, making them to converge more stably and avoid local minima.
Quantitative Analysis of Assertion Violations in Probabilistic Programs
Venue: arXiv cs.PL 2020
Year: 2020

In this work, we consider the fundamental problem of deriving quantitative bounds on the probability that a given assertion is violated in a probabilistic program. We provide automated algorithms that obtain both lower and upper bounds on the assertion violation probability in exponential forms. The main novelty of our approach is that we prove new and dedicated fixed-point theorems which serve as the theoretical basis of our algorithms and enable us to reason about assertion violation bounds in terms of pre and post fixed-point functions. To synthesize such fixed-points, we devise algorithms that utilize a wide range of mathematical tools, including repulsing ranking super-martingales, Hoeffding's lemma, Minkowski decompositions, Jensen's inequality, and convex optimization. On the theoretical side, we provide (i) the first automated algorithm for lower-bounds on assertion violation probabilities, (ii) the first complete algorithm for upper-bounds of exponential form in affine programs, and (iii) provably and significantly tighter upper-bounds than the previous approach of stochastic invariants. On the practical side, we show that our algorithms can handle a wide variety of programs from the literature and synthesize bounds that are several orders of magnitude tighter in comparison with previous approaches.
Prior and Prejudice: The Novice Reviewers' Bias against Resubmissions in Conference Peer Review
Venue: arXiv cs.DL 2020
Year: 2020

Modern machine learning and computer science conferences are experiencing a surge in the number of submissions that challenges the quality of peer review as the number of competent reviewers is growing at a much slower rate. To curb this trend and reduce the burden on reviewers, several conferences have started encouraging or even requiring authors to declare the previous submission history of their papers. Such initiatives have been met with skepticism among authors, who raise the concern about a potential bias in reviewers' recommendations induced by this information. In this work, we investigate whether reviewers exhibit a bias caused by the knowledge that the submission under review was previously rejected at a similar venue, focusing on a population of novice reviewers who constitute a large fraction of the reviewer pool in leading machine learning and computer science conferences. We design and conduct a randomized controlled trial closely replicating the relevant components of the peer-review pipeline with $133$ reviewers (master's, junior PhD students, and recent graduates of top US universities) writing reviews for $19$ papers. The analysis reveals that reviewers indeed become negatively biased when they receive a signal about paper being a resubmission, giving almost 1 point lower overall score on a 10-point Likert item ($Δ= -0.78, \ 95\% \ \text{CI} = [-1.30, -0.24]$) than reviewers who do not receive such a signal. Looking at specific criteria scores (originality, quality, clarity and significance), we observe that novice reviewers tend to underrate quality the most.
UWB @ DIACR-Ita: Lexical Semantic Change Detection with CCA and Orthogonal Transformation
Venue: arXiv cs.CL 2020
Year: 2020

In this paper, we describe our method for detection of lexical semantic change (i.e., word sense changes over time) for the DIACR-Ita shared task, where we ranked $1^{st}$. We examine semantic differences between specific words in two Italian corpora, chosen from different time periods. Our method is fully unsupervised and language independent. It consists of preparing a semantic vector space for each corpus, earlier and later. Then we compute a linear transformation between earlier and later spaces, using CCA and Orthogonal Transformation. Finally, we measure the cosines between the transformed vectors.
Fog Computing Approaches in Smart Cities: A State-of-the-Art Review
Venue: arXiv cs.NI 2020
Year: 2020

These days, the development of smart cities, specifically in location-aware, latency-sensitive, and security-crucial applications (such as emergency fire events, patient health monitoring, or real-time manufacturing) heavily depends on a more advance computing paradigms that can address these requirements. In this regard, fog computing, a robust cloud computing complement, plays a preponderant role by virtue of locating closer to the end-devices. Nonetheless, utilized approaches in smart cities are frequently cloud-based, which causes not only the security and time-sensitive services to suffer but also its flexibility and reliability to be restricted. So as to obviate the limitations of cloud and other related computing paradigms such as edge computing, this paper proposes a systematic literature review (SLR) for the state-of-the-art fog-based approaches in smart cities. Furthermore, according to the content of the reviewed researches, a taxonomy is proposed, falls into three classes, including service-based, resource-based, and application-based. This SLR also investigates the evaluation factors, used tools, evaluation methods, merits, and demerits of each class. Types of proposed algorithms in each class are mentioned as well. Above all else, by taking various perspectives into account, comprehensive and distinctive open issues and challenges are provided via classifying future trends and issues into practical sub-classes.
Adaptive Bit Partitioning for Reconfigurable Intelligent Surface Assisted FDD Systems with Limited Feedback
Venue: arXiv cs.IT 2020
Year: 2020

In frequency division duplexing systems, the base station (BS) acquires downlink channel state information (CSI) via channel feedback, which has not been adequately investigated in the presence of RIS. In this study, we examine the limited channel feedback scheme by proposing a novel cascaded codebook and an adaptive bit partitioning strategy. The RIS segments the channel between the BS and mobile station into two sub-channels, each with line-of-sight (LoS) and non-LoS (NLoS) paths. To quantize the path gains, the cascaded codebook is proposed to be synthesized by two sub-codebooks whose codeword is cascaded by LoS and NLoS components. This enables the proposed cascaded codebook to cater the different distributions of LoS and NLoS path gains by flexibly using different feedback bits to design the codeword structure. On the basis of the proposed cascaded codebook, we derive an upper bound on ergodic rate loss with maximum ratio transmission and show that the rate loss can be cut down by optimizing the feedback bit allocation during codebook generation. To minimize the upper bound, we propose a bit partitioning strategy that is adaptive to diverse environment and system parameters. Extensive simulations are presented to show the superiority and robustness of the cascaded codebook and the efficiency of the adaptive bit partitioning scheme.
On structural parameterizations of the selective coloring problem
Venue: arXiv cs.DS 2020
Year: 2020

In the Selective Coloring problem, we are given an integer $k$, a graph $G$, and a partition of $V(G)$ into $p$ parts, and the goal is to decide whether or not we can pick exactly one vertex of each part and obtain a $k$-colorable induced subgraph of $G$. This generalization of Vertex Coloring has only recently begun to be studied by Demange et al. [Theoretical Computer Science, 2014], motivated by scheduling problems on distributed systems, with Guo et al. [TAMC, 2020] discussing the first results on the parameterized complexity of the problem. In this work, we study multiple structural parameterizations for Selective Coloring. We begin by revisiting the many hardness results of Demange et al. and show how they may be used to provide intractability proofs for widely used parameters such as pathwidth, distance to co-cluster, and max leaf number. Afterwards, we present fixed-parameter tractability algorithms when parameterizing by distance to cluster, or under the joint parameterizations treewidth and number of parts, and co-treewidth and number of parts. Our main contribution is a proof that, for every fixed $k \geq 1$, Selective Coloring does not admit a polynomial kernel when jointly parameterized by the vertex cover number and the number of parts, which implies that Multicolored Independent Set does not admit a polynomial kernel under the same parameterization.