Miracle-dz/UniFAR-FTUs huggingface dataset:
Asymptotically Achieving Centralized Rate on the Decentralized Network MISO Channel

In this paper, we analyze the high-SNR regime of the $M\times K$ Network MISO channel in which each transmitter has access to a different channel estimate, possibly with different precision. It has been recently shown that, for some regimes, this setting attains the same Degrees-of-Freedom as the ideal centralized setting with perfect Channel State Information (CSI) sharing, in which all the transmitters are endowed with the best estimate available at any transmitter. This result is restricted by the limitations of the Degrees-of-Freedom metric, as it only provides information about the slope of growth of the capacity as a function of the SNR, without any insight about the possible performance at a given SNR. In order to overcome this limitation, we analyze the affine approximation of the rate on the high-SNR regime for this decentralized Network MISO setting for the antenna configurations in which it achieves the Degrees-of-Freedom of the centralized setting. We show that, for a regime of antenna configurations, it is possible to asymptotically attain the same achievable rate as in the ideal centralized scenario. Consequently, it is possible to achieve the beamforming gain of the ideal perfect-CSI-sharing setting even if only a subset of transmitters is endowed with precise CSI, which can be exploited in scenarios such as distributed massive MIMO where the number of transmit antennas is much bigger than the number of served users. This outcome is a consequence of the synergistic compromise between CSI precision at the transmitters and consistency between the locally-computed precoders, which is an inherent trade-off of decentralized settings that does not exist in the centralized CSI configuration. We propose a precoding scheme achieving the previous result, which is built on an uneven structure in which some transmitters reduce the precision of their own precoding vector for the sake of using transmission parameters that can be more easily predicted by the other transmitters.
Finite-sample analysis of interpolating linear classifiers in the overparameterized regime

We prove bounds on the population risk of the maximum margin algorithm for two-class linear classification. For linearly separable training data, the maximum margin algorithm has been shown in previous work to be equivalent to a limit of training with logistic loss using gradient descent, as the training error is driven to zero. We analyze this algorithm applied to random data including misclassification noise. Our assumptions on the clean data include the case in which the class-conditional distributions are standard normal distributions. The misclassification noise may be chosen by an adversary, subject to a limit on the fraction of corrupted labels. Our bounds show that, with sufficient over-parameterization, the maximum margin algorithm trained on noisy data can achieve nearly optimal population risk.
Unsupervised Real Image Super-Resolution via Generative Variational AutoEncoder

Benefited from the deep learning, image Super-Resolution has been one of the most developing research fields in computer vision. Depending upon whether using a discriminator or not, a deep convolutional neural network can provide an image with high fidelity or better perceptual quality. Due to the lack of ground truth images in real life, people prefer a photo-realistic image with low fidelity to a blurry image with high fidelity. In this paper, we revisit the classic example based image super-resolution approaches and come up with a novel generative model for perceptual image super-resolution. Given that real images contain various noise and artifacts, we propose a joint image denoising and super-resolution model via Variational AutoEncoder. We come up with a conditional variational autoencoder to encode the reference for dense feature vector which can then be transferred to the decoder for target image denoising. With the aid of the discriminator, an additional overhead of super-resolution subnetwork is attached to super-resolve the denoised image with photo-realistic visual quality. We participated the NTIRE2020 Real Image Super-Resolution Challenge [24] . Experimental results show that by using the proposed approach, we can obtain enlarged images with clean and pleasant features compared to other supervised methods. We also compared our approach with state-of-the-art methods on various datasets to demonstrate the efficiency of our proposed unsupervised super-resolution model.
Muscle Synergy and Coupling for Hand

The knowledge of the intuitive link between muscle activity and the finger movement is vital for the design of commercial prosthetic hands that do not need user pre-training. However, this link has yet to be understood due to the complexity of human hand. In this study, a relation spectrum using a controllable and human-readable polynomial neural network (CR-PNN) was developed for the first time and applied to analyze the muscle-finger system. We established CR-PNN models for six degrees of freedom ( DOFs) in 8 subjects. Multiple fingers may be controlled by a single muscle, or multiple muscles may control a single finger. Thus, the research is based on two aspects: muscle synergy and muscle coupling for hand. The research gave the relation spectrum of the muscle-finger system and the knowledge of muscle coupling. The article is very short but significant. The contributions of this paper can be divided into two parts: (1) The findings of hand can contribute to design prosthetic hands. (2) The relation spectrum using CR-PNN in the method can provide a reference for analyzing complex systems in multiple areas. (We're strong believers in Open Source, and provide CR-PNN code for others. GitHub: https://github.com/liugang1234567/CR-PNN#cr-pnn. And you can find the relation spectrum in” Read C-R PNN for System identification_LG.pdf” )
SFTM: Fast Comparison of Web Documents using Similarity-based Flexible Tree Matching

Tree matching techniques have been investigated in many fields, including web data mining and extraction, as a key component to analyze the content of web documents, existing tree matching approaches, like Tree-Edit Distance (TED) or Flexible Tree Matching (FTM), fail to scale beyond a few hundreds of nodes, which is far below the average complexity of existing web online documents and applications. In this paper, we therefore propose a novel Similarity-based Flexible Tree Matching algorithm (SFTM), which is the first algorithm to enable tree matching on real-life web documents with practical computation times. In particular, we approach tree matching as an optimisation problem and we leverage node labels and local topology similarity in order to avoid any combinatorial explosion. Our practical evaluation demonstrates that our approach compares to the reference implementation of TED qualitatively, while improving the computation times by two orders of magnitude.
On the Convergence of the JKO-scheme and Blow-up of solutions for a Multi-species Chemotaxis System with no Mass Preservation

This work considers a chemotaxis system for multi-species that includes birth or death rate terms, which implies no mass preservation of the populations. We aim to show the convergence to a $L^{\infty}\ -\ $weak solutions, that is local in time, of the JKO - scheme arising from the Optimal Transport Theory, in the spirit of [35,14]. Currently, $L^{\infty}$ solutions have shown to be important in order to get uniqueness. Since death rate case does not ensure global solutions, for arbitrary initial data, in this framework, it could be interest to analyze the Blowing-up phenomenon of this system. Therefore, in the last section, we get sufficient conditions that implies blowing-up phenomenon in finite time and we draw several stages where this occurs. This last part can be seen as a partial generalization of the blowing-up results in [16].
Non-Linear Trajectory Optimization for Large Step-Ups: Application to the Humanoid Robot Atlas

Performing large step-ups is a challenging task for a humanoid robot. It requires the robot to perform motions at the limit of its reachable workspace while straining to move its body upon the obstacle. This paper presents a non-linear trajectory optimization method for generating step-up motions. We adopt a simplified model of the centroidal dynamics to generate feasible Center of Mass trajectories aimed at reducing the torques required for the step-up motion. The activation and deactivation of contacts at both feet are considered explicitly. The output of the planner is a Center of Mass trajectory plus an optimal duration for each walking phase. These desired values are stabilized by a whole-body controller that determines a set of desired joint torques. We experimentally demonstrate that by using trajectory optimization techniques, the maximum torque required to the full-size humanoid robot Atlas can be reduced up to 20% when performing a step-up motion.
Question Answering over Curated and Open Web Sources

The last few years have seen an explosion of research on the topic of automated question answering (QA), spanning the communities of information retrieval, natural language processing, and artificial intelligence. This tutorial would cover the highlights of this really active period of growth for QA to give the audience a grasp over the families of algorithms that are currently being used. We partition research contributions by the underlying source from where answers are retrieved: curated knowledge graphs, unstructured text, or hybrid corpora. We choose this dimension of partitioning as it is the most discriminative when it comes to algorithm design. Other key dimensions are covered within each sub-topic: like the complexity of questions addressed, and degrees of explainability and interactivity introduced in the systems. We would conclude the tutorial with the most promising emerging trends in the expanse of QA, that would help new entrants into this field make the best decisions to take the community forward. Much has changed in the community since the last tutorial on QA in SIGIR 2016, and we believe that this timely overview will indeed benefit a large number of conference participants.
Data-Driven Construction of Data Center Graph of Things for Anomaly Detection

Data center (DC) contains both IT devices and facility equipment, and the operation of a DC requires a high-quality monitoring (anomaly detection) system. There are lots of sensors in computer rooms for the DC monitoring system, and they are inherently related. This work proposes a data-driven pipeline (ts2graph) to build a DC graph of things (sensor graph) from the time series measurements of sensors. The sensor graph is an undirected weighted property graph, where sensors are the nodes, sensor features are the node properties, and sensor connections are the edges. The sensor node property is defined by features that characterize the sensor events (behaviors), instead of the original time series. The sensor connection (edge weight) is defined by the probability of concurrent events between two sensors. A graph of things prototype is constructed from the sensor time series of a real data center, and it successfully reveals meaningful relationships between the sensors. To demonstrate the use of the DC sensor graph for anomaly detection, we compare the performance of graph neural network (GNN) and existing standard methods on synthetic anomaly data. GNN outperforms existing algorithms by a factor of 2 to 3 (in terms of precision and F1 score), because it takes into account the topology relationship between DC sensors. We expect that the DC sensor graph can serve as the infrastructure for the DC monitoring system since it represents the sensor relationships.
Biselective pulses for large-area atom interferometry

We present designs for the augmentation ``mirror'' pulses of large-momentum-transfer atom interferometers that maintain their fidelity as the wave-packet momentum difference is increased. These biselective pulses, tailored using optimal control methods to the evolving bimodal momentum distribution, should allow greater interferometer areas and hence increased inertial measurement sensitivity, without requiring elevated Rabi frequencies or extended frequency chirps. Using an experimentally validated model, we have simulated the application of our pulse designs to large-momentum-transfer atom interferometry using stimulated Raman transitions in a laser-cooled atomic sample of $^{85}\mathrm{Rb}$ at 1 $\ensuremath{\mu}\mathrm{K}$. After the wave packets have separated by 42 photon recoil momenta, our pulses maintain a fringe contrast of 90%, whereas, for adiabatic rapid passage and conventional $\ensuremath{\pi}$ pulses, the contrast is less than 10%. Furthermore, we show how these pulses may be adapted to be robust to laser intensity variations between pulses and to suppress the detrimental off-resonant excitation that limits other broadband pulse schemes.
Continuum Scale Non Newtonian Particle Transport Model for Haemorheology -- Implementation and Validation

We present a continuum scale particle transport model for red blood cells following collision arguments in a diffusive flux formulation. The model is implemented in FOAM, in a framework for haemodynamics simulations. Modern mechanistic rheology models are implemented and tested. The model is verified against a known analytical solution and shows excellent agreement for high quality meshes and good agreement for typical meshes as used in vascular flow simulations. Simulation results for different size and time scales show that migration of red blood cells does occur on physiologically relevany timescales on small vessels below 1 mm and that the haematocrit concentration modulates the non-Newtonian viscosity. This model forms part of a multi-scale approach to haemorheology and model parameters will be derived from meso-scale simulations using multi-component Lattice-Boltzmann methods. The code, haemoFoam, is made available for interested researchers.
4‐Separations in Hajós graphs

As a natural extension of the Four Color Theorem, Hajós conjectured that graphs containing no K5 ‐subdivision are 4‐colorable. Any possible counterexample to this conjecture with minimum number of vertices is called a Hajós graph. Previous results show that Hajós graphs are 4‐connected but not 5‐connected. A k ‐separation in a graph G is a pair (G 1 , G 2 ) of edge‐disjoint subgraphs of G such that ∣ V ( G 1 ∩ G 2 ) ∣ = k , G = G 1 ∪ G 2 , and G i ⊈ G 3 − i for i = 1 , 2 . In this paper, we show that Hajós graphs do not admit a 4‐separation ( G 1 , G 2 ) such that ∣ V ( G 1 ) ∣ ≥ 6 and G 1 can be drawn in the plane with no edge crossings and all vertices in V ( G 1 ∩ G 2 ) incident with a common face. This is a step in our attempt to reduce Hajós' conjecture to the Four Color Theorem.
Robust Screening of COVID-19 from Chest X-ray via Discriminative Cost-Sensitive Learning

This paper addresses the new problem of automated screening of coronavirus disease 2019 (COVID-19) based on chest X-rays, which is urgently demanded toward fast stopping the pandemic. However, robust and accurate screening of COVID-19 from chest X-rays is still a globally recognized challenge because of two bottlenecks: 1) imaging features of COVID-19 share some similarities with other pneumonia on chest X-rays, and 2) the misdiagnosis rate of COVID-19 is very high, and the misdiagnosis cost is expensive. While a few pioneering works have made much progress, they underestimate both crucial bottlenecks. In this paper, we report our solution, discriminative cost-sensitive learning (DCSL), which should be the choice if the clinical needs the assisted screening of COVID-19 from chest X-rays. DCSL combines both advantages from fine-grained classification and cost-sensitive learning. Firstly, DCSL develops a conditional center loss that learns deep discriminative representation. Secondly, DCSL establishes score-level cost-sensitive learning that can adaptively enlarge the cost of misclassifying COVID-19 examples into other classes. DCSL is so flexible that it can apply in any deep neural network. We collected a large-scale multi-class dataset comprised of 2,239 chest X-ray examples: 239 examples from confirmed COVID-19 cases, 1,000 examples with confirmed bacterial or viral pneumonia cases, and 1,000 examples of healthy people. Extensive experiments on the three-class classification show that our algorithm remarkably outperforms state-of-the-art algorithms. It achieves an accuracy of 97.01%, a precision of 97%, a sensitivity of 97.09%, and an F1-score of 96.98%. These results endow our algorithm as an efficient tool for the fast large-scale screening of COVID-19.
Internet of Things Architectures: A Comparative Study

Over the past two decades, the Internet of Things (IoT) has become an underlying concept to a variety of solutions and technologies that it is now hardly possible to enumerate and describe all of them. The concept behind the Internet of Things is as powerful as it is complex, and for the components in the IoT solution tomesh together perfectly, they all have to be part of a well-thought-out structure. That is where understanding the IoT architecture becomes paramount. Because of the vast domain of IoT, there is no single consensus on IoT architecture. Different researchers and organizations proposed different architectures under a variety of classifications, mainly: conceptual, standard and, industrial or commercial adoption. It is indispensable to make a systematic analysis of IoT architecture to be able to compare the industrial proposals and identify their similarities and their differences. In this work, we summarize information about seven IoT industrial architectures in order to propose an approach that makes possible a comparative analysis between different IoT architectures. This work presents two main contributions: (i) an approach for analyzing and comparing IoTarchitectures using Layer-Model; (ii) a comparative study of seven industrial IoT architectures.
Explainable Deep CNNs for MRI-Based Diagnosis of Alzheimer’s Disease

Deep Convolutional Neural Networks (CNNs) are becoming prominent models for semi-automated diagnosis of Alzheimer’s Disease (AD) using brain Magnetic Resonance Imaging (MRI). Although being highly accurate, deep CNN models lack transparency and interpretability, precluding adequate clinical reasoning and not complying with most current regulatory demands. One popular choice for explaining deep image models is occluding regions of the image to isolate their influence on the prediction. However, existing methods for occluding patches of brain scans generate images outside the distribution to which the model was trained for, thus leading to unreliable explanations. In this paper, we propose an alternative explanation method that is specifically designed for the brain scan task. Our method, which we refer to as Swap Test, produces heatmaps that depict the areas of the brain that are most indicative of AD, providing interpretability for the model’s decisions in a format understandable to clinicians. Experimental results using an axiomatic evaluation show that the proposed method is more suitable for explaining the diagnosis of AD using MRI while the opposite trend was observed when using a typical occlusion test. Therefore, we believe our method may address the inherent black-box nature of deep neural networks that are capable of diagnosing AD.
Inter-sequence Enhanced Framework for Personalized Sequential Recommendation

Modeling the sequential correlation of users' historical interactions is essential in sequential recommendation. However, the majority of the approaches mainly focus on modeling the \emph{intra-sequence} item correlation within each individual sequence but neglect the \emph{inter-sequence} item correlation across different user interaction sequences. Though several studies have been aware of this issue, their method is either simple or implicit. To make better use of such information, we propose an inter-sequence enhanced framework for the Sequential Recommendation (ISSR). In ISSR, both inter-sequence and intra-sequence item correlation are considered. Firstly, we equip graph neural networks in the inter-sequence correlation encoder to capture the high-order item correlation from the user-item bipartite graph and the item-item graph. Then, based on the inter-sequence correlation encoder, we build GRU network and attention network in the intra-sequence correlation encoder to model the item sequential correlation within each individual sequence and temporal dynamics for predicting users' preferences over candidate items. Additionally, we conduct extensive experiments on three real-world datasets. The experimental results demonstrate the superiority of ISSR over many state-of-the-art methods and the effectiveness of the inter-sequence correlation encoder.
Interpretation of Deep Temporal Representations by Selective Visualization of Internally Activated Units

Recently deep neural networks demonstrate competitive performances in classification and regression tasks for many temporal or sequential data. However, it is still hard to understand the classification mechanisms of temporal deep neural networks. In this paper, we propose two new frameworks to visualize temporal representations learned from deep neural networks. Given input data and output, our algorithm interprets the decision of temporal neural network by extracting highly activated periods and visualizes a sub-sequence of input data which contributes to activate the units. Furthermore, we characterize such sub-sequences with clustering and calculate the uncertainty of the suggested type and actual data. We also suggest Layer-wise Relevance from the output of a unit, not from the final output, with backward Monte-Carlo dropout to show the relevance scores of each input point to activate units with providing a visual representation of the uncertainty about this impact.
GymFG: A Framework with a Gym Interface for FlightGear

Over the past decades, progress in deployable autonomous flight systems has slowly stagnated. This is reflected in today's production air-crafts, where pilots only enable simple physics-based systems such as autopilot for takeoff, landing, navigation, and terrain/traffic avoidance. Evidently, autonomy has not gained the trust of the community where higher problem complexity and cognitive workload are required. To address trust, we must revisit the process for developing autonomous capabilities: modeling and simulation. Given the prohibitive costs for live tests, we need to prototype and evaluate autonomous aerial agents in a high fidelity flight simulator with autonomous learning capabilities applicable to flight systems: such a open-source development platform is not available. As a result, we have developed GymFG: GymFG couples and extends a high fidelity, open-source flight simulator and a robust agent learning framework to facilitate learning of more complex tasks. Furthermore, we have demonstrated the use of GymFG to train an autonomous aerial agent using Imitation Learning. With GymFG, we can now deploy innovative ideas to address complex problems and build the trust necessary to move prototypes to the real-world.