Rethinking Trajectory Forecasting Evaluation

Forecasting the behavior of other agents is an integral part of the modernrobotic autonomy stack, especially in safety-critical scenarios with human-robot interaction, such as autonomous driving . Common to all works is theuse of the same few accuracy-based evaluation metrics, e.g.,…

Global Outliers Detection in Wireless Sensor Networks A Novel Approach Integrating Time Series Analysis Entropy and Random Forest based Classification

Wireless Sensor Networks (WSNs) have recently attracted greater attention due to their practicality in monitoring, communicating, and reportingspecific physical phenomena . The data collected by WSNs is often inaccurate as a result of unavoidable environmental factors, which may include noise, signalweakness, or intrusion attacks depending on the specific situation .…

COfEE A Comprehensive Ontology for Event Extraction from text with an online annotation tool

Event Extraction (EE) seeks to derive information about specific incidents and their actors from the text . EE is useful in many domains such as building a knowledge base,information retrieval, summarization and online monitoring systems . COfEE consists of twohierarchy levels (event types and event sub-types) that include new categoriesrelating to environmental issues, cyberspace, criminal activity and natural disasters .…

THz Transmission meets Untrusted UAV Relaying Trajectory and Communication Co design for Secrecy Energy Efficiency Maximization

Unmanned aerial vehicles (UAVs) and Terahertz (THz) technology are envisioned to play paramount roles in next-generation wireless communications . We present a secure two-phase transmission strategy with cooperative jamming . We assume that the UAV-mounted relay may act, besides providing services, as a potential adversary called the untrusted UAV relay.…

Dynamic RF Combining for Multi Antenna Ambient Energy Harvesting

Ambient radio frequency (RF) energy harvesting (EH) technology is key to realizing self-sustainable, always-on, low-power, massive Internet of Thingsnetworks . We introduce a dynamic RF combining architecture for ambientRF EH use cases . Among the proposed mechanisms, brute force (BF) demands the highest power consumption, while CB requires the highest-resolution phase shifters .…

Audio Captioning Transformer

Audio captioning aims to automatically generate a natural languaged description of an audio clip . Most captioning models follow an encoder-decoderarchitecture, where the decoder predicts words based on the audio featuresextracted by the encoder . Convolutional neural networks (CNNs) and recurrentneural networks (RNNs) are often used as the audio encoder.…

Bidirectional Approximate Message Passing for RIS Assisted Multi User MISO Communications

Reconfigurable intelligent surfaces (RISs) have been recently considered as apromising candidate for energy-efficient solutions in future wireless networks . Their dynamic and lowpower configuration enables coverage extension, massiveconnectivity, and low-latency communications . Due to a large number of unknownvariables referring to the RIS unit elements and the transmitted signals,channel estimation and signal recovery in RIS-based systems are the ones of themost critical technical challenges .…

Limits of Detecting Extraterrestrial Civilizations

The search for extraterrestrial intelligence (SETI) struggles with indeterminacy in what data to look for and when to do so . We show that electromagnetic signaling for detection requires much less power than for communication . We also show that detection as a function of power can be non-linear, andthat much of the analysis in this framework may be addressed usingcomputationally efficient optimization problems .…

Formal method of synthesis of optimal topologies of computing systems based on projective description of graphs

A deterministic method for synthesizing the interconnect topologies optimized for the required properties is proposed . The method is based on the originaldescription of graphs by projections, on establishing the bijectivecorrespondence of the required . properties and the projection properties of the initial graph, on postulating the corresponding restrictions of modified .…

Investigating External Interaction Modality and Design Between Automated Vehicles and Pedestrians at Crossings

In this study, we investigated the effectiveness and user acceptance of threeexternal interaction modalities (i.e., visual, auditory, and visual+auditory) in promoting communications between automated vehicle systems (AVS) and pedestrians at a crosswalk . We alsotested different visual and auditory interaction methods, and found that”Pedestrian silhouette on the front of the vehicle” was the best preferredoption .…

Optimal Operation of Power Systems with Energy Storage under Uncertainty A Scenario based Method with Strategic Sampling

The multi-period dynamics of energy storage (ES), intermittent renewablegeneration and uncontrollable power loads make the optimization of powersystem operation (PSO) challenging . The proposed Meth-od is computationally effective for mainly two reasons. The proposed strategic sampling significantly improvesthe computational efficiency of the scenario-based approach for solving the chance-constrained optimal PSO problem .…

Theory and Practice of Algorithm Engineering

There is an ongoing debate in computer science how algorithms should best bestudied . We take the empirical nature of algorithm engineering as a starting point . Our theoretical framework builds on threeareas discussed in the philosophy of science: ontology, epistemology andmethodology .…

Cell Free SUCRe Protocol A User Centric Adaptation

The motivation of this paper is to introduce a cell-free adaptation of the strongest-user collision resolution (SUCRe) protocol . The SUCRe protocol was originally proposed forcellular massive multiple-input multiple- input multiple-output (MIMO) networks . The goal with this adaptation is to show that a cell free network can better handle the attempts of users’ equipment (UEs) due to the augmented macro-diversity brought by the disposition of access points (APs) over the coverage area .…

Neural Fixed Point Acceleration for Convex Optimization

Fixed-point iterations are at the heart of numerical computing and are often a computational bottleneck in real-time applications that typically need a fast solution of moderate accuracy . We present neural fixed-point acceleration which combines ideas from meta-learning and classical acceleration methods .…

Empowering End users with Object aware Processes

Business process management systems from various vendors are used by companies around the globe . Most of these systems allow for the full or partialautomation of business processes by ensuring that tasks and data are presented to the right person at the right time during process execution .…

Guided Generation of Cause and Effect

We present a conditional text generation framework that posits sententialexpressions of possible causes and effects . This framework depends on a very large-scale collection of English sentences expressing causal patterns CausalBank . We extend prior work in lexically-constrained decoding to support disjunctive positive constraints .…

Fast and Multiscale Formation of Isogeometric matrices of Microstructured Geometric Models

The matrix formation associated to high-order discretizations is known to benumerically demanding . We design a multiscale assembly procedure to reduce the exorbitant assembly time in the context of isogeometric linear elasticity of complexmicrostructured geometries modeled via spline compositions . The strategy turns out to be of great interest not only to form finite elementoperators but also to compute other quantities in a fast manner as for instancesensitivity analyses commonly used in design optimization .…

Predicting Issue Types on GitHub

Ticket Tagger is a GitHub app that analyzes the issue title and description through machine learning techniquesto automatically recognize the types of reports submitted on GitHub and assign labels to each issue accordingly . We empirically evaluated the tool’s performance on about 30,000 GitHub issues .…

DOA Estimation for Hybrid Massive MIMO Systems using Mixed ADCs Performance Loss and Energy Efficiency

Due to power consumption and high circuit cost in antenna arrays, thepractical application of massive multiple input multiple-input multiple-output (MIMO) in thesixth generation (6G) and future wireless networks is still challenging . Employing lowresolution analog-to-digital converters (ADCs) and hybrid analogand digital (HAD) structure is two low-cost choice with acceptable performanceloss .…

Towards Plug and Play Visual Graph Query Interfaces Data driven Canned Pattern Selection for Large Networks

Canned patterns (i.e. small subgraph patterns) in visual graph queryinterfaces (a.k.a GUI) facilitate efficient query formulation by enablingpattern-at-a-time construction mode . TATTOO takes a data-driven approach to automaticallyselecting canned patterns for a . GUI from large networks . It first decomposes the underlying network into truss-infested and truss .oblivious…

An Exploration of Exploration Measuring the ability of lexicase selection to find obscure pathways to optimality

Parent selection algorithms steer populations through a problem’s search space, often trading off between exploitation and exploration . We introduce an “exploration diagnostic” that diagnoses a selection scheme’scapacity for search space exploration . Findings provide hypotheses for further exploration and actionable insights and recommendations for using lexicase selection, we say .…

Communication Lower Bounds for Nested Bilinear Algorithms

We develop lower bounds on communication in the memory hierarchy or betweenprocessors for nested bilinear algorithms . We build on a previous framework that establishescommunication lower bounds by use of the rank expansion of a matrix . We apply the rankexpansion lower bounds to obtain novel communication lower bounds for nestedToom-Cook convolution, Strassen’s algorithm, and fast algorithms for partiallysymmetric contractions .…

Filament Plots for Data Visualization

We construct a computationally inexpensive 3D extension of Andrew’s plots . We consider linear isometries from a Euclidean data space to infinite dimensional spaces of 2D curves . Weparametrize the linear isometry that produces (on average) optimally smoothcurves over a given dataset .…

Training Electric Vehicle Charging Controllers with Imitation Learning

The problem of coordinating the charging of electric vehicles gains more importance as the number of such vehicles grows . In order to train the controllers, we use the idea of imitation learning . The method is evaluated on realistic data and shows improved performance and training speed compared to similar controllers trained using evolutionary algorithms .…

Convergence of the implicit MAC discretized Navier Stokes equations with variable density and viscosity on non uniform grids

A priori-estimates on the unknownsare obtained, and along with a topological degree argument they lead to theexistence of a solution of the discrete scheme at each time step . We conclude the proof of the convergence of the scheme toward the continuous problem as mesh size and time step tend toward zero with the limit of the sequence ofdiscrete solutions being a solution to the weak formulation of the problem .…

How to Tell Deep Neural Networks What We Know

We present a short survey of ways in which existing scientific knowledge are included when constructing models with neural networks . The inclusion of domain-knowledge is of special interest not just to constructing scientificassistants, but also, many other areas that involve understanding data using human-machine collaboration .…

Cluster Consensus on Matrix weighted Switching Networks

This paper examines the cluster consensus problem of multi-agent systems onmatrix-weighted switching networks . Necessary and/or sufficient conditions under which cluster consensus can be achieved are obtained . Thesteady-state of the system lies in the intersection of the null space of the matrix-valued Laplacians corresponding to all switching networks.…