OpenRaiser/Intern-Atlas huggingface dataset:
Path continuity for multi-wheeled AGVs
Venue: arXiv cs.RO 2021
Year: 2021

Notwithstanding the growing presence of AGVs in the industry, there is a lack of research about multi-wheeled AGVs which offer higher maneuverability and space efficiency. In this paper, we present generalized path continuity conditions as a continuation of previous research done for vehicles with more constrained kinematic capabilities. We propose a novel approach for analytically defining various kinematic modes (motion modes), that AGVs with multiple steer and drive wheels can utilize. This approach enables deriving vehicle kinematic equations based on the vehicle configuration and its constraints, path shape, and corresponding motion mode. Finally, we derive general continuity conditions for paths that multi-wheeled AGVs can follow, and show through examples how they can be utilized in layout design methods.
Focus-style proof systems and interpolation for the alternation-free $μ$-calculus
Venue: arXiv cs.LO 2021
Year: 2021

In this paper we introduce a cut-free sequent calculus for the alternation-free fragment of the modal $μ$-calculus. This system allows for cyclic proofs and uses a simple focus mechanism to control the unravelling of fixpoints along infinite branches. We show that the proof system is sound and complete and apply it to prove that the alternation-free fragment has the Craig interpolation property.
A Revisit of Shape Editing Techniques: from the Geometric to the Neural Viewpoint
Venue: arXiv cs.GR 2021
Year: 2021

3D shape editing is widely used in a range of applications such as movie production, computer games and computer aided design. It is also a popular research topic in computer graphics and computer vision. In past decades, researchers have developed a series of editing methods to make the editing process faster, more robust, and more reliable. Traditionally, the deformed shape is determined by the optimal transformation and weights for an energy term. With increasing availability of 3D shapes on the Internet, data-driven methods were proposed to improve the editing results. More recently as the deep neural networks became popular, many deep learning based editing methods have been developed in this field, which is naturally data-driven. We mainly survey recent research works from the geometric viewpoint to those emerging neural deformation techniques and categorize them into organic shape editing methods and man-made model editing methods. Both traditional methods and recent neural network based methods are reviewed.
Distributional Formal Semantics
Venue: arXiv cs.CL 2021
Year: 2021

Natural language semantics has recently sought to combine the complementary strengths of formal and distributional approaches to meaning. More specifically, proposals have been put forward to augment formal semantic machinery with distributional meaning representations, thereby introducing the notion of semantic similarity into formal semantics, or to define distributional systems that aim to incorporate formal notions such as entailment and compositionality. However, given the fundamentally different 'representational currency' underlying formal and distributional approaches - models of the world versus linguistic co-occurrence - their unification has proven extremely difficult. Here, we define a Distributional Formal Semantics that integrates distributionality into a formal semantic system on the level of formal models. This approach offers probabilistic, distributed meaning representations that are also inherently compositional, and that naturally capture fundamental semantic notions such as quantification and entailment. Furthermore, we show how the probabilistic nature of these representations allows for probabilistic inference, and how the information-theoretic notion of "information" (measured in terms of Entropy and Surprisal) naturally follows from it. Finally, we illustrate how meaning representations can be derived incrementally from linguistic input using a recurrent neural network model, and how the resultant incremental semantic construction procedure intuitively captures key semantic phenomena, including negation, presupposition, and anaphoricity.
On the Generalisation Capabilities of Fisher Vector based Face Presentation Attack Detection
Venue: arXiv cs.CV 2021
Year: 2021

In the last decades, the broad development experienced by biometric systems has unveiled several threats which may decrease their trustworthiness. Those are attack presentations which can be easily carried out by a non-authorised subject to gain access to the biometric system. In order to mitigate those security concerns, most face Presentation Attack Detection techniques have reported a good detection performance when they are evaluated on known Presentation Attack Instruments (PAI) and acquisition conditions, in contrast to more challenging scenarios where unknown attacks are included in the test set. For those more realistic scenarios, the existing algorithms face difficulties to detect unknown PAI species in many cases. In this work, we use a new feature space based on Fisher Vectors, computed from compact Binarised Statistical Image Features histograms, which allow discovering semantic feature subsets from known samples in order to enhance the detection of unknown attacks. This new representation, evaluated for challenging unknown attacks taken from freely available facial databases, shows promising results: a BPCER100 under 17% together with an AUC over 98% can be achieved in the presence of unknown attacks. In addition, by training a limited number of parameters, our method is able to achieve state-of-the-art deep learning-based approaches for cross-dataset scenarios.
Graph-Time Convolutional Neural Networks
Venue: arXiv cs.LG 2021
Year: 2021

Spatiotemporal data can be represented as a process over a graph, which captures their spatial relationships either explicitly or implicitly. How to leverage such a structure for learning representations is one of the key challenges when working with graphs. In this paper, we represent the spatiotemporal relationships through product graphs and develop a first principle graph-time convolutional neural network (GTCNN). The GTCNN is a compositional architecture with each layer comprising a graph-time convolutional module, a graph-time pooling module, and a nonlinearity. We develop a graph-time convolutional filter by following the shift-and-sum principles of the convolutional operator to learn higher-level features over the product graph. The product graph itself is parametric so that we can learn also the spatiotemporal coupling from data. We develop a zero-pad pooling that preserves the spatial graph (the prior about the data) while reducing the number of active nodes and the parameters. Experimental results with synthetic and real data corroborate the different components and compare with baseline and state-of-the-art solutions.
Preferential attachment hypergraph with high modularity
Venue: arXiv cs.SI 2021
Year: 2021

Numerous works have been proposed to generate random graphs preserving the same properties as real-life large scale networks. However, many real networks are better represented by hypergraphs. Few models for generating random hypergraphs exist and no general model allows to both preserve a power-law degree distribution and a high modularity indicating the presence of communities. We present a dynamic preferential attachment hypergraph model which features partition into communities. We prove that its degree distribution follows a power-law and we give theoretical lower bounds for its modularity. We compare its characteristics with a real-life co-authorship network and show that our model achieves good performances. We believe that our hypergraph model will be an interesting tool that may be used in many research domains in order to reflect better real-life phenomena.
COVID-19 Digital Contact Tracing Applications and Techniques: A Review Post Initial Deployments
Venue: arXiv cs.CY 2021
Year: 2021

The coronavirus disease 2019 (COVID-19) is a severe global pandemic that has claimed millions of lives and continues to overwhelm public health systems in many countries. The spread of COVID-19 pandemic has negatively impacted the human mobility patterns such as daily transportation-related behavior of the public. There is a requirement to understand the disease spread patterns and its routes among neighboring individuals for the timely implementation of corrective measures at the required placement. To increase the effectiveness of contact tracing, countries across the globe are leveraging advancements in mobile technology and Internet of Things (IoT) to aid traditional manual contact tracing to track individuals who have come in close contact with identified COVID-19 patients. Even as the first administration of vaccines begins in 2021, the COVID-19 management strategy will continue to be multi-pronged for the foreseeable future with digital contact tracing being a vital component of the response along with the use of preventive measures such as social distancing and the use of face masks. After some months of deployment of digital contact tracing technology, deeper insights into the merits of various approaches and the usability, privacy, and ethical trade-offs involved are emerging. In this paper, we provide a comprehensive analysis of digital contact tracing solutions in terms of their methodologies and technologies in the light of the new data emerging about international experiences of deployments of digital contact tracing technology. We also provide a discussion on open challenges such as scalability, privacy, adaptability and highlight promising directions for future work.
Graph Information Vanishing Phenomenon inImplicit Graph Neural Networks
Venue: arXiv cs.LG 2021
Year: 2021

One of the key problems of GNNs is how to describe the importance of neighbor nodes in the aggregation process for learning node representations. A class of GNNs solves this problem by learning implicit weights to represent the importance of neighbor nodes, which we call implicit GNNs such as Graph Attention Network. The basic idea of implicit GNNs is to introduce graph information with special properties followed by Learnable Transformation Structures (LTS) which encode the importance of neighbor nodes via a data-driven way. In this paper, we argue that LTS makes the special properties of graph information disappear during the learning process, resulting in graph information unhelpful for learning node representations. We call this phenomenon Graph Information Vanishing (GIV). Also, we find that LTS maps different graph information into highly similar results. To validate the above two points, we design two sets of 70 random experiments on five Implicit GNNs methods and seven benchmark datasets by using a random permutation operator to randomly disrupt the order of graph information and replacing graph information with random values. We find that randomization does not affect the model performance in 93\% of the cases, with about 7 percentage causing an average 0.5\% accuracy loss. And the cosine similarity of output results, generated by LTS mapping different graph information, over 99\% with an 81\% proportion. The experimental results provide evidence to support the existence of GIV in Implicit GNNs and imply that the existing methods of Implicit GNNs do not make good use of graph information. The relationship between graph information and LTS should be rethought to ensure that graph information is used in node representation.
The Personalization Paradox: the Conflict between Accurate User Models and Personalized Adaptive Systems
Venue: arXiv cs.HC 2021
Year: 2021

Personalized adaptation technology has been adopted in a wide range of digital applications such as health, training and education, e-commerce and entertainment. Personalization systems typically build a user model, aiming to characterize the user at hand, and then use this model to personalize the interaction. Personalization and user modeling, however, are often intrinsically at odds with each other (a fact some times referred to as the personalization paradox). In this paper, we take a closer look at this personalization paradox, and identify two ways in which it might manifest: feedback loops and moving targets. To illustrate these issues, we report results in the domain of personalized exergames (videogames for physical exercise), and describe our early steps to address some of the issues arisen by the personalization paradox.
Conceptualising Contestability: Perspectives on Contesting Algorithmic Decisions
Venue: arXiv cs.CY 2021
Year: 2021

As the use of algorithmic systems in high-stakes decision-making increases, the ability to contest algorithmic decisions is being recognised as an important safeguard for individuals. Yet, there is little guidance on what `contestability'--the ability to contest decisions--in relation to algorithmic decision-making requires. Recent research presents different conceptualisations of contestability in algorithmic decision-making. We contribute to this growing body of work by describing and analysing the perspectives of people and organisations who made submissions in response to Australia's proposed `AI Ethics Framework', the first framework of its kind to include `contestability' as a core ethical principle. Our findings reveal that while the nature of contestability is disputed, it is seen as a way to protect individuals, and it resembles contestability in relation to human decision-making. We reflect on and discuss the implications of these findings.
COVID-19 vs Social Media Apps: Does Privacy Really Matter?
Venue: arXiv cs.CY 2021
Year: 2021

Many people around the world are worried about using or even downloading COVID-19 contact tracing mobile apps. The main reported concerns are centered around privacy and ethical issues. At the same time, people are voluntarily using Social Media apps at a significantly higher rate during the pandemic without similar privacy concerns compared with COVID-19 apps. To better understand these seemingly anomalous behaviours, we analysed the privacy policies, terms & conditions and data use agreements of the most commonly used COVID-19, Social Media & Productivity apps. We also developed a tool to extract and analyse nearly 2 million user reviews for these apps. Our results show that Social Media & Productivity apps actually have substantially higher privacy and ethical issues compared with the majority of COVID-19 apps. Surprisingly, lots of people indicated in their user reviews that they feel more secure as their privacy are better handled in COVID-19 apps than in Social Media apps. On the other hand, most of the COVID-19 apps are less accessible and stable compared to most Social Media apps, which negatively impacted their store ratings and led users to uninstall COVID-19 apps more frequently. Our findings suggest that in order to effectively fight this pandemic, health officials and technologists will need to better raise awareness among people about COVID-19 app behaviour and trustworthiness. This will allow people to better understand COVID-19 apps and encourage them to download and use these apps. Moreover, COVID-19 apps need many accessibility enhancements to allow a wider range of users from different societies and cultures to access to these apps.
A region-based descriptor network for uniformly sampled keypoints
Venue: arXiv cs.CV 2021
Year: 2021

Matching keypoint pairs of different images is a basic task of computer vision. Most methods require customized extremum point schemes to obtain the coordinates of feature points with high confidence, which often need complex algorithmic design or a network with higher training difficulty and also ignore the possibility that flat regions can be used as candidate regions of matching points. In this paper, we design a region-based descriptor by combining the context features of a deep network. The new descriptor can give a robust representation of a point even in flat regions. By the new descriptor, we can obtain more high confidence matching points without extremum operation. The experimental results show that our proposed method achieves a performance comparable to state-of-the-art.
Single and Parallel Machine Scheduling with Variable Release Dates
Venue: arXiv cs.AI 2021
Year: 2021

In this paper we study a simple extension of the total weighted flowtime minimization problem for single and identical parallel machines. While the standard problem simply defines a set of jobs with their processing times and weights and assumes that all jobs have release date 0 and have no deadline, we assume that the release date of each job is a decision variable that is only constrained by a single global latest arrival deadline. To our knowledge, this simple yet practically highly relevant extension has never been studied. Our main contribution is that we show the NP- completeness of the problem even for the single machine case and provide an exhaustive empirical study of different typical approaches including genetic algorithms, tree search, and constraint programming.
Virufy: A Multi-Branch Deep Learning Network for Automated Detection of COVID-19
Venue: arXiv cs.SD 2021
Year: 2021

Fast and affordable solutions for COVID-19 testing are necessary to contain the spread of the global pandemic and help relieve the burden on medical facilities. Currently, limited testing locations and expensive equipment pose difficulties for individuals trying to be tested, especially in low-resource settings. Researchers have successfully presented models for detecting COVID-19 infection status using audio samples recorded in clinical settings [5, 15], suggesting that audio-based Artificial Intelligence models can be used to identify COVID-19. Such models have the potential to be deployed on smartphones for fast, widespread, and low-resource testing. However, while previous studies have trained models on cleaned audio samples collected mainly from clinical settings, audio samples collected from average smartphones may yield suboptimal quality data that is different from the clean data that models were trained on. This discrepancy may add a bias that affects COVID-19 status predictions. To tackle this issue, we propose a multi-branch deep learning network that is trained and tested on crowdsourced data where most of the data has not been manually processed and cleaned. Furthermore, the model achieves state-of-art results for the COUGHVID dataset [16]. After breaking down results for each category, we have shown an AUC of 0.99 for audio samples with COVID-19 positive labels.
Terahertz Ultra-Massive MIMO-Based Aeronautical Communications in Space-Air-Ground Integrated Networks
Venue: arXiv cs.IT 2021
Year: 2021

The emerging space-air-ground integrated network has attracted intensive research and necessitates reliable and efficient aeronautical communications. This paper investigates terahertz Ultra-Massive (UM)-MIMO-based aeronautical communications and proposes an effective channel estimation and tracking scheme, which can solve the performance degradation problem caused by the unique {\emph{triple delay-beam-Doppler squint effects}} of aeronautical terahertz UM-MIMO channels. Specifically, based on the rough angle estimates acquired from navigation information, an initial aeronautical link is established, where the delay-beam squint at transceiver can be significantly mitigated by employing a Grouping True-Time Delay Unit (GTTDU) module (e.g., the designed {\emph{Rotman lens}}-based GTTDU module). According to the proposed prior-aided iterative angle estimation algorithm, azimuth/elevation angles can be estimated, and these angles are adopted to achieve precise beam-alignment and refine GTTDU module for further eliminating delay-beam squint. Doppler shifts can be subsequently estimated using the proposed prior-aided iterative Doppler shift estimation algorithm. On this basis, path delays and channel gains can be estimated accurately, where the Doppler squint can be effectively attenuated via compensation process. For data transmission, a data-aided decision-directed based channel tracking algorithm is developed to track the beam-aligned effective channels. When the data-aided channel tracking is invalid, angles will be re-estimated at the pilot-aided channel tracking stage with an equivalent sparse digital array, where angle ambiguity can be resolved based on the previously estimated angles. The simulation results and the derived Cramér-Rao lower bounds verify the effectiveness of our solution.
Prior-free Dynamic Mechanism Design With Limited Liability
Venue: arXiv cs.GT 2021
Year: 2021

We study the problem of repeatedly auctioning off an item to one of $k$ bidders where: a) bidders have a per-round individual rationality constraint, b) bidders may leave the mechanism at any point, and c) the bidders' valuations are adversarially chosen (the prior-free setting). Without these constraints, the auctioneer can run a second-price auction to "sell the business" and receive the second highest total value for the entire stream of items. We show that under these constraints, the auctioneer can attain a constant fraction of the "sell the business" benchmark, but no more than $2/e$ of this benchmark. In the course of doing so, we design mechanisms for a single bidder problem of independent interest: how should you repeatedly sell an item to a (per-round IR) buyer with adversarial valuations if you know their total value over all rounds is $V$ but not how their value changes over time? We demonstrate a mechanism that achieves revenue $V/e$ and show that this is tight.
Parallel Machine Learning of Partial Differential Equations
Venue: arXiv cs.DC 2021
Year: 2021

In this work, we present a parallel scheme for machine learning of partial differential equations. The scheme is based on the decomposition of the training data corresponding to spatial subdomains, where an individual neural network is assigned to each data subset. Message Passing Interface (MPI) is used for parallelization and data communication. We use convolutional neural network layers (CNN) to account for spatial connectivity. We showcase the learning of the linearized Euler equations to assess the accuracy of the predictions and the efficiency of the proposed scheme. These equations are of particular interest for aeroacoustic problems. A first investigation demonstrated a very good agreement of the predicted results with the simulation results. In addition, we observe an excellent reduction of the training time compared to the sequential version, providing an almost perfect scalability up to 64 CPU cores.
Coffea-casa: an analysis facility prototype
Venue: arXiv cs.DC 2021
Year: 2021

Data analysis in HEP has often relied on batch systems and event loops; users are given a non-interactive interface to computing resources and consider data event-by-event. The "Coffea-casa" prototype analysis facility is an effort to provide users with alternate mechanisms to access computing resources and enable new programming paradigms. Instead of the command-line interface and asynchronous batch access, a notebook-based web interface and interactive computing is provided. Instead of writing event loops, the column-based Coffea library is used. In this paper, we describe the architectural components of the facility, the services offered to end-users, and how it integrates into a larger ecosystem for data access and authentication.