The Slodderwetenschap Sloppy Science of Stochastic Parrots A Plea for Science to NOT take the Route Advocated by Gebru and Bender

This article is a position paper written in reaction to the now-infamous paper titled “On the Dangers of Stochastic Parrots: Can Language Models Be TooBig?” by Timnit Gebru, Emily Bender, and others . I find the ethics of the Parrot Paper lacking, and in that lack, I worry about the direction in which computer science, machinelearning, and artificial intelligence are heading .…

A Julia implementation of Algorithm NCL for constrained optimization

Algorithm NCL is designed for smooth optimization problems where first and second derivatives are available . It is equivalent to the LANCELOT augmented Lagrangian method, reformulated as a sequence of nonlinearly constrained subproblems that can be solved efficiently by IPOPT and KNITRO, with warm starts on eachsubproblem .…

The Slodderwetenschap Sloppy Science of Stochastic Parrots A Plea for Science to NOT take the Route Advocated by Gebru and Bender

This article is a position paper written in reaction to the now-infamous paper titled “On the Dangers of Stochastic Parrots: Can Language Models Be TooBig?” by Timnit Gebru, Emily Bender, and others . I find the ethics of the Parrot Paper lacking, and in that lack, I worry about the direction in which computer science, machinelearning, and artificial intelligence are heading .…

The Future of Artificial Intelligence and its Social Economic and Ethical Consequences

Recent development in AI has enabled the expansion of its application tomultiple domains . A huge amount of money has been poured into AI research dueto its exciting discoveries . Technology giants like Google, Facebook, Amazon, and Baidu are the driving forces in the field today .…

Explainable Artificial Intelligence XAI An Engineering Perspective

eXplainable Artificial Intelligence (XAI) is the set oftechniques and methods to convert the so-called black-box AI algorithms to white-box algorithms . The results achieved by these algorithms and thevariables, parameters, and steps taken by the algorithm to reach the obtained results, are transparent and explainable .…

Neurocognitive Informatics Manifesto

Informatics studies all aspects of the structure of natural and artificial systems . Human information processing is still unmatched in many areas, including information management, representation and understanding . Neurocognitive informatics is a new, emerging field that should help to improve the matching of artificial and natural systems, and inspire better algorithms to solve problems that are still beyond the reach of machines .…

Target Detection and Segmentation in Circular Scan Synthetic Aperture Sonar Images using Semi Supervised Convolutional Encoder Decoders

We propose a saliency-based, multi-target detection and segmentation framework for multi-aspect, semi-coherent imagery formed from circular-scan,synthetic-aperture sonar (CSAS) Our framework relies on a multi-branch,convolutional encoder-decoder network (MB-CEDN) The encoder portion extract features from one or more CSAS images of the targets .…

Nested Rollout Policy Adaptation (NRPA) is a Monte Carlo search algorithm for single player games . We propose to modify NRPA in order to improve the stability of the algorithm . Experiments show it improves the algorithm for different application domains: SameGame, Traveling Salesman withTime Windows and Expression Discovery .…

Summaformers LaySumm 20 LongSumm 20

Summarization is acognitively challenging task – extracting summary worthy sentences islaborious, and expressing semantics in brief is complicated . System is simple, intuitive and based on how specific paper sections contribute to human summaries . On blind test corpora, our system ranks first and third for the LongSumm and LaySumm tasks respectively.…

Heatmap based Object Detection and Tracking with a Fully Convolutional Neural Network

The ability to detect and trackfast-moving objects is crucial for various applications of ArtificialIntelligence like autonomous driving, ball tracking in sports, robotics orobject counting . As part of this paper the Fully Convolutional Neural Network”CueNet” was developed . It detects and tracks the cueball on a labyrinth gamerobustly and reliably .…

Entropic Causal Inference Identifiability and Finite Sample Results

Entropic causal inference is a framework for inferring the causal direction between two categorical variables from observational data . The central assumption is that the amount of unobserved randomness in the system is not toolarge . This is measured by the entropy of the exogenous variable in the underlying structural causal model, which governs the causalrelation between the observed variables .…

Detecting Hostile Posts using Relational Graph Convolutional Network

This work is based on the submission to the competition Hindi Constraint conducted by AAAI@2021 for detection of hostile posts in Hindi on social media platforms . Our best submission with RGCN achieves an F1 score of 0.97 (7thRank) on coarse-grained evaluation and achieved best performance on identifying fake posts .…

An Unsupervised Learning Method with Convolutional Auto Encoder for Vessel Trajectory Similarity Computation

The computation of vessel trajectorysimilarity has recently attracted increasing attention in the maritime datamining research community . Traditional shape- and warping-based methods often suffer from several drawbacks such as high computational cost and sensitivity to unwanted artifacts . Toeliminate these drawbacks, we propose an unsupervised learning method which extracts low-dimensional features through a convolutionalauto-encoder (CAE) The CAE can learn the low-dimension representationsof informative trajectory images in a manner .…

Provably Approximated ICP

The goal of the \emph{alignment problem is to align a point cloud $P= \{p_1,\cdots,p_n\}$ to another (observed) point cloud . Heuristics such as the IterativeClosest Point (ICP) algorithm and its variants were suggested for these problems . None yield a provable non-trivial approximation for the globaloptimum .…

The Logic for a Mildly Context Sensitive Fragment of the Lambek Grishin Calculus

No such characterizations were known for tree-adjoining grammars in the last forty years . HLG is defined indisplay calculus with cut-admissibility . Several new techniques are introduced for HLG, such as purely structural connectives, usefulness, and agraph-theoretic argument on proof nets for HLGs .…

A Heuristic driven Ensemble Framework for COVID 19 Fake News Detection

With the COVID-19 pandemic raging, social media has become morerelevant and widely used than ever before . Along with this, there has been a resurgence in the circulation of fake news and tweets that demand immediate attention . We have used an ensemble model consisting of pre-trained models that helped us achieve a joint 8th position on the leader board .…

Adaptive Prototypical Networks with Label Words and Joint Representation Learning for Few Shot Relation Classification

Relation classification (RC) task is one of fundamental tasks of informationextraction . We propose to encode each class prototype in an adaptive way from twoaspects . The results show that the proposed adaptive prototypical networks with label words and jointrepresentation learning has not only achieved significant inaccuracy, but also increased the generalization ability of few-shot RC models .…

BERT Family Eat Word Salad Experiments with Text Understanding

Ourexperiments show that state-of-the-art models consistently fail to recognizethem as ill-formed, and instead produce high confidence predictions on them . We define simple heuristics to construct such examples . We show that if models are explicitly trained to recognize invalid inputs, they can be robust to such attacks without a drop in performance .…

Quantum Secure Direct Communication with MutualAuthentication using a Single Basis

In this paper, we propose a new theoretical scheme for quantum secure direct communication (QSDC) with user authentication . Different from the previous QSDCprotocols, the present protocol uses only one orthogonal basis of single-qubitstates to encode the secret message . This is a one-time and one-way communication protocol, which uses qubits prepared in a randomly chosenarbitrary basis, to transmit the message .…

Cybersecurity of Industrial Cyber Physical Systems A Review

Industrial cyber-physical systems (ICPSs) manage critical infrastructures by controlling processes based on the “physics” data gathered by edge sensornetworks . As the interconnectivity in ICPSs increases, so does the attack surface . The most common vulnerabilities are related to weak boundary protection .…

Perspectives and Challenges in the Analysis of Prison Systems Data A Systematic Mapping

The vastmajority of the analyzed papers (75%) used restricted data . Only 18 studies provided data, which hampers replication initiatives . This indicates the need to analyze prison system in an integrated fashion, in whichmultidisciplinary and transparency are relevant issues to consider in suchstudies .…

Con Pi A Distributed Container based Edge and Fog Computing Framework for Raspberry Pis

Edge and Fog computing paradigms overcome limitations of Cloud-centricexecution for different latency-sensitive Internet of Things (IoT) applications . Con-Pi harnesses Docker containers to run IoT applications as microservices on RPis . The performance of the proposed framework is compared with the state-of-the-art frameworks by means of real-world experiments .…

Kuksa Self Adaptive Microservices in Automotive Systems

Automotive systems should be self-adaptive, thereby they can make real-time decisions based on changing operating conditions . Emerging modern solutions, such as microservices could improveself-adaptation capabilities and ensure higher levels of quality performance in many domains . The results of our study indicate the importance of design trade-offs for qualityrequirements’ satisfaction levels of each microservices and the whole system for the optimal performance of an adaptive system at runtime.…

Beyond Helly graphs the diameter problem on absolute retracts

In this paper, we study the complexity ofcomputing the diameter within the absolute retracts of various hereditary graphclasses . We show how to compute the diameter of certain hereditary graphs in randomized time . For the special case of chordal bipartite graphs, it can be improved to linear time, and the algorithm even computes all the eccentricities .…

Shortest non separating st path on chordal graphs

Many NP-Hard problems on general graphs, such as maximum independence set,maximal cliques and graph coloring can be solved efficiently on chordal graphs . In this paper, we explore the problem of non-separating st-paths defined onedges for a connected undirected graph and two vertices .…

A Thermodynamic Core using Voltage Controlled Spin Orbit Torque Magnetic Tunnel Junctions

Magnetic devices within computing cores harness thermodynamics through its thermal stability . The evolution of network states isguided by the spin-orbit-torque effect . The results of this work pave the path towards the realization of high-performance thermodynamic computing hardware . Finally,this paper will also give a perspective of computing beyond thermodynamiccomputing.…

Incentive Design and Profit Sharing in Multi modal Transportation Network

The market structure allows themulti-modal platform to coordinate profits across modes and also provideincentives to the passengers . We assume that the platform sets incentive(subsidy or tax) along every edge in the transportation network . We use the asymmetric Nash bargaining solution to design a fair profit sharing scheme among the service providers .…

Using Crowdsourcing to Train Facial Emotion Machine Learning Models with Ambiguous Labels

Current emotion detection classifiers predict discrete emotions . Compound and ambiguous facialexpressions are often evoked by humans . Crowdsourced labels from the crowd tend to match the consensus from the originalCAFE raters, validating the utility of crowdsourcing . The output probability vector of the crowd-trained classifier much more closely resembles the distribution ofhuman labels (t=3.2827, p=0.0014) For many applications of affectivecomputing, reporting an emotion probability distribution that more closelyresembles human interpretation can be more important than traditional machinelearning metrics .…

Context Aware Target Apps Selection and Recommendation for Enhancing Personal Mobile Assistants

Users install many apps on their smartphones, raising issues related toinformation overload for users and resource management for devices . The recent increase in the use of personal assistants has made mobile devices even more pervasive in users’ lives . This paper addresses two research problemsthat are vital for developing effective personal mobile assistants: target appsselection and recommendation .…

Towards Long term Fairness in Recommendation

As Recommender Systems influence more and more people in their dailylife, the issue of fairness in recommendation is becoming more important . Most of the prior approaches to fairness-aware recommendation have been situated in a static or one-shot setting . This fails to consider the dynamic nature of the recommender systems, where attributes such as item popularity may changeover time due to the recommendation policy and user engagement .…

Delay Minimization in Sliced Multi Cell Mobile Edge Computing MEC Systems

We consider the problem of jointly optimizing users’ offloading decisions, communication and computing resource allocation in a sliced multi-cell mobile edge computing (MEC) network . We minimize the weighted sum of the gap betweenthe observed delay at each slice and its corresponding delay requirement, whereweights set the priority of each slice .…

Robust and Scalable Routing with Multi Agent Deep Reinforcement Learning for MANETs

We address the packet routing problem in highly dynamic mobile ad-hocnetworks (MANETs) In the network routing problem each router chooses the next-hop(s) of each packet to deliver the packet to a destination with lowerdelay, higher reliability, and less overhead in the network .…

A series representation of the discrete fractional Laplace operator of arbitrary order

A series representation of the discrete fractional Laplace operator for positive non-integer powers is developed . Its convergence to aseries representation of a known case of positive integer powers is proven . We show that the newrepresentation for arbitrary real-valued positive powers of the .…

Randomised maximum likelihood based posterior sampling

Minimization of a stochastic cost function is commonly used for approximatesampling in high-dimensional Bayesian inverse problems with Gaussian priordistributions and multimodal posterior distributions . The density of the samples generated by minimization is not the desired target density, unless theobservation operator is linear, but the distribution of samples is useful as a proposal density for importance sampling or for Markov chain Monte Carlomethods .…

Accuracy and Architecture Studies of Residual Neural Network solving Ordinary Differential Equations

In this paper we consider utilizing a residual neural network (ResNet) to solve ordinary differential equations . Stochastic gradient descent method is applied to obtain the optimal parameter set of weights and biases of thenetwork . The well trained ResNet behaves just as itscounterpart of the corresponding one-step finite difference method .…

A Spatial Temporal asymptotic preserving scheme for radiation magnetohydrodynamics

The radiation magnetohydrodynamics (RMHD) system couples the ideal magnetic equations with a gray radiation transfer equation . The main idea is to decompose the radiative intensity into three parts, each part is treated differently . The performances of thesemi-implicit method are presented, for both optically thin and thick regions, as well as for radiative shock problem .…

Random Conical Tilt Reconstruction without Particle Picking in Cryo electron Microscopy

We propose a method to reconstruct the 3-D molecular structure from micrographs collected at just one sample tilt angle in the random conical tiltscheme in cryo-electron microscopy . We demonstrate reconstructions with simulated data and investigate theeffect of the missing-cone region .…

A New Numerical Method for Div Curl Systems with Low Regularity Assumptions

This paper presents a numerical method for div-curl systems with normalboundary conditions by using a finite element technique known as primal-dualweak Galerkin (PDWG) The PDWG finite element scheme offers an accurate and reliablenumerical solution under the low $H^\alpha$-regularity($\alpha0$) assumption for the true solution .…

Implementation of Polygonal Mesh Refinement in MATLAB

We present a simple and efficient MATLAB implementation of the local refinement for polygonal meshes . The purpose of this implementation is primarily educational, especially on the teaching of adaptive virtual elementmethods .…

The shifted ODE method for underdamped Langevin MCMC

In this paper, we consider the underdamped Langevin diffusion (ULD) andpropose a numerical approximation using its associated ordinary differentialequation (ODE) When used as a Markov Chain Monte Carlo (MCMC) algorithm, the ODE approximation achieves a $2$-Wasserstein error of$\varepsilon$ in$\mathcal{O\big(d^{\frac{1)3) The main feature of the proposed numerical method isthat it can utilize additional smoothness of the target log-density$f\$.…

Analysis of an abstract mixed formulation for viscoelastic problems

This study provides an abstract framework to analyze mixed formulations inviscoelasticity in the classic saddle point form . Standard hypothesis formixed methods are adapted to the Volterra type equations in order to obtainstability of the proposed problem . Error estimates are derived for suitablefinite element spaces .…

Bandwidth Allocation for Multiple Federated Learning Services in Wireless Edge Networks

This paper studies a federated learning (FL) system where multiple services co-exist in a wireless network and share common wireless resources . It fills the void of wireless resource allocation for multiple simultaneous FL services in the existing literature . For cooperative FL service providers, we design a distributed bandwidth allocational algorithm to optimize the overall performance of multiple FL services, while cater to the fairness among FL services and the privacy of clients .…

Compliant Fins for Locomotion in Granular Media

In this paper, we present an approach to study the behavior of compliant plates in granular media and optimize the performance of a robot that utilizesthis technique for mobility . This concept utilizes one-sided joint limits to create anasymmetric gait cycle that avoids more complicated alternatives often found in other swimming/digging robots .…

Sub Goal Social Force Model for Collective Pedestrian Motion Under Vehicle Influence

Analytical modeling of collective pedestrian motion can benefit intelligent transportation practices like shared space design and urbanautonomous driving . In mixed traffic scenarios, a certain number of pedestrians might coexist in a small area while interacting with vehicles . In this situation, every pedestrian must simultaneously react to the surrounding pedestrians and vehicles .…

Cross Modal Contrastive Learning of Representations for Navigation using Lightweight Low Cost Millimeter Wave Radar for Adverse Environmental Conditions

Existing methods are limited by reliance on cameras and LiDAR devices, which have degraded sensing under adverse environmental conditions . In response, we propose the use of single-chipmillimeter-wave (mmWave) radar, which is lightweight and inexpensive, for learning-based autonomous navigation . Our proposed end-to-end deep RLpolicy with contrastive learning successfully navigated the robot through smoke-filled maze environments and achieved better performance compared withgenerative reconstruction methods .…

Reinforcement Learning Enabled Automatic Impedance Control of a Robotic Knee Prosthesis to Mimic the Intact Knee Motion in a Co Adapting Environment

Automatically configuring a robotic prosthesis to fit its user’s needs and conditions is a great technical challenge and a roadblock to the adoption of the technology . Previously, we have successfully developedreinforcement learning (RL) solutions toward addressing this issue . Yet, ourdesigns were based on using a subjectively prescribed target motion profile for the robotic knee during level ground walking .…

Learning Student Interest Trajectory for MOOCThread Recommendation

Massive Open Online Courses (MOOCs) have witnessed immensegrowth in popularity . Discussion forums are primarymeans of interaction among learners and instructors . With growingclass size, students face the challenge of finding useful and informativediscussion forums . The fundamental challenge is that the studentinterests drift as they progress through the course, and forum contents evolveas students or instructors update them .…

Eating Garlic Prevents COVID 19 Infection Detecting Misinformation on the Arabic Content of Twitter

The rapid growth of social media content during the current pandemic provides tools for disseminating information which has also become a root formisinformation . There is an urgent need for fact-checking and techniques for detecting misinformation in social media . The wordembedding models exploit more than two millionArabic tweets related to COVID-19 .…

Towards Repairing Scenario Based Models with Rich Events

We show how rich,scenario-based models can be model-checked, and then repaired to prevent safety violations . The actual repair is performed by adding newscenario objects to the model, and without altering existing ones – in a way that is well aligned with the principles of scenario-based modeling .…

Locating Faults with Program Slicing An Empirical Analysis

Study of 457 bugs (369 single faults and 88 multiple faults) in 46 C programs . Dynamic slicing is more effective for programs with single faults, but statistical debugging performs better on multiple faults . Best results obtained by a hybrid approach: If programmers first examine atmost the top five most suspicious locations from statistical debugging, and then switch to dynamic slices, on average, they will need to examine 15% (30 lines) of the code .…