An active inference model of collective intelligence

To date, formal models of collective intelligence have lacked a plausiblemathematical description of the relationship between local-scale interactions between highly autonomous sub-system components (individuals) and global-scale behavior of the composite system . In this paper we use theActive Inference Formulation (AIF), a framework for explaining the behavior ofany non-equilibrium steady state system at any scale, to posit a minimalagent-based model .…

Permutation Invariant Subgraph Discovery

Permutation and Structured Perturbation Inference (PSPI) is a new problem formulation that abstracts many graph matching tasks that arise insystems biology . PSPI can be viewed as a robust formulation of the permutationinference or graph matching, where the objective is to find a permutationbetween two graphs under the assumption that a set of edges may have undergone a perturbation due to an underlying cause .…

A Comparison of Similarity Based Instance Selection Methods for Cross Project Defect Prediction

Previous studies have shown that training data instance selectionbased on nearest neighborhood (NN) information can lead to better performance in cross project defect prediction . Locality Sensitive Hashing (LSH) can be affective as exact methods . LSH and GIS favor recall more than precision, however, in environments where precision is considered more important NN-Filter should be considered .…

STARdom an architecture for trusted and secure human centered manufacturing systems

There is a lack of a single architecture specification that addresses the needs of trusted and secure Artificial Intelligence systems with humans in theloop . We propose an architecture thatintegrates forecasts, Explainable Artificial Intelligence, supports collecting feedback, and uses Active Learning and Simulated Reality to enhance forecasts and provide decision-making recommendations .…

Branch and cut algorithms for the covering salesman problem

The Covering Salesman Problem (CSP) is a generalization of the TravelingSalesman Problem . The objective of CSP is to find aminimum length Hamiltonian cycle over a subset of vertices that covers anundirected graph . A branch-and-cut framework assembles exact and heuristic separation routines for integer and fractional CSP solutions .…

Communication Complexity Corner Free Sets and the Symmetric Subrank of Tensors

We develop and apply new combinatorial and algebraic tools to understand multiparty communication complexity in the Number On the Forehead (NOF) model . We identify barriers for progress and propose new techniques to circumvent these . In particular, we make progress on the cornerproblem by proving the existence of a corner-free subset of a subset of size $3.16 n-o(n) The communication complexity of the Evalproblem over $G$ is at most $0.34n + O(\log n)$, which improvesthe previous upper bound $2.82^n$ of Linial, Pitassi and Shraibman (ITCS 2018) We introduce the symmetric subrank of tensors as a proposal to circumvent the induced matching barrier .…

Some Combinatorial Problems in Power law Graphs

The power-law behavior is ubiquitous in a majority of real-world networks . It has been shown to have a strong effect on various combinatorial, structural,and dynamical properties of graphs . In this paper, we study analytically several combinatorials problems for two power law graphs .…

A Systematic Literature Review on Phishing and Anti Phishing Techniques

Phishing is the number one threat in the world of internet . Spear phishing, Email Spoofing, Email Manipulation and phone phishing are the most commonly used phishing techniques . Machine learning approaches have the highest accuracy of preventing and detecting phishing attacks among all other anti-phishing approaches, according to the Systematic LiteratureReview(SLR) approach .…

Security Properties as Nested Causal Statements

Thinking in terms of causality helps us structure how different parts of asystem depend on each other, and how interventions on one part of a system may result in changes to other parts . We present a natural way to extend the Halpern-Pearl (HP)framework for causality to capture such nested causal statements .…

PolyDNN Polynomial Representation of NN for Communication less SMPC Inference

The structure and weights of Deep Neural Networks (DNN) typically encode and contain very valuable information about the dataset that was used to train thenetwork . One way to protect this information when DNN is published is to perform aninterference of the network using secure multi-party computations (MPC) In this paper, we suggest a translation of deep neural networks topolynomials, which are easier to calculate efficiently with MPC techniques .…

Trust based Blockchain Authorization for IoT

Access control for the Internet ofThings (IoT) should be tailored to take inherent network scale and device resource constraints into consideration . Common authorization systems in IoT employ conventional schemes, which suffer from overheads and centralization . We design a decentralized attribute-based access control mechanism with an auxiliary Trust and Reputation System (TRS) for IoT authorization .…

A Formal Analysis of the MimbleWimble Cryptocurrency Protocol

MimbleWimble (MW) is a privacy-oriented cryptocurrency technology which provides security and scalability properties that distinguish it from other protocols of its kind . We present and discuss those properties and outline thebasis of a model-driven verification approach to address the certification of the correctness of the protocol implementations .…

Trends in eBusiness and eGovernment

The first chapter is a critical review and a case study in eBusiness, withspecial attention to the digital currencies resource and its possibilities . The last chapter s purpose was todevelop a measuring and modelling framework, an instrument of IBSQ for theSouth African banking sector .…

The polarising effect of Review Bomb

The Review Bomb is a phenomenon consisting of a massiveattack by groups of Internet users on a website that displays users’ review on products . The Bomb occurs suddenly and for a shorttime, because in this way it leverages the notorious problem of cold-start: ifreviews are submitted by a lot of fresh new accounts, it makes hard to justifypreventative measures .…

Limiting Tags Fosters Efficiency

Tagging facilitates information retrieval in social media and other online communities by allowing users to organize and describe online content . Researchers found that the efficiency of tagging systems steadily decreases over time, because tags become less precise in identifying specific documents,i.e.,…

From banks to DeFi the evolution of the lending market

The Internet of Value (IOV) with its distributed ledger technology (DLT)underpinning has created new forms of lending markets . Lending protocols are gaining traction, holding an aggregate liquidity supply of over $40 billion . We discuss the persisting reliance of DeFi lending on the traditional financial system, and conclude with the outlook of the lending market in the IOV era .…

TreeToaster Towards an IVM Optimized Compiler

A compiler’s optimizer operates over abstract syntax trees (ASTs), applying rewrite rules to replace subtrees of the AST with more efficient ones . Especially on large source repositories, even simply finding opportunities for a rewrite can be expensive . In this paper, we leverage the need to repeatedly find rewrites, and explore options for making the search faster through indexing and incrementalview maintenance (IVM) We consider bolt-on approaches that makeuse of embedded IVM systems like DBToaster, as well as two new approaches:Label-indexing and TreeToaster .…

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering

This paper presents new parallel algorithms for generating Euclidean minimumspanning trees and spatial clustering hierarchies . Our approach is based on generating a well-separated pair decomposition followed by using Kruskal’s minimum spanning tree algorithm and bichromatic closest paircomputations . We show that our algorithms are theoretically efficient: they have work (number ofoperations) matching their sequential counterparts, and polylogarithmic depth(parallel time) We implement our algorithms and propose a memory optimization that requiresonly a subset of well-Sepated pairs to be computed and materialized, leading to savings in both space (up to 10x) and time .…

Daisen A Framework for Visualizing Detailed GPU Execution

Graphics Processing Units (GPUs) have been widely used to accelerate artificial intelligence, physics simulation, medical imaging, and informationvisualization applications . Daisen is a framework that supports data collection from GPU simulators and provides visualization of thesimulator-generated GPU execution traces . The open-sourced implementation of Daisen can be found atgitlab.com/akita/vis…

An Evaluation of the Archive of Formal Proofs

Archive of Formal Proofs (AFP) is an online repository of formal proofs . It serves as a central location for publishing, discovering, and viewing libraries of proofs . Long-term users of the website are generally satisfied with the AFP but that there are anumber of areas, such as navigation, search and script browsing, that need improvement .…

Independent Sets in Semi random Hypergraphs

Given a hypergraph, computing the largest size independent set is an NP-hard problem . We study the independent set problem on hypergraphs in anatural semi-random family of instances . Our algorithms are based on rounding the “crude-SDP” of McKenzie et al.…

Curl Flow Pointwise Incompressible Velocity Interpolation forGrid Based Fluids

We propose a novel methodology to enhance grid-based fluid animation with pointwise divergence-free velocity interpolation . Our method supports irregular geometry through the use of levelset-based cut-cells . To recover a smooth and velocity-consistent discrete vector potential in 3D, we employ a sweeping approach followed by a gaugecorrection that requires a single scalar Poisson solve, rather than a vectorPoisson problem .…

NPMs Neural Parametric Models for 3D Deformable Shapes

Parametric 3D models have enabled a wide variety of tasks in computer graphics and vision, such as modeling human bodies, faces, and hands . However, construction of these parametric models is often tedious, as it requires manual tweaking . To this end, we propose Neural ParametricModels (NPMs), a novel, learned alternative to traditional, parametric 3d models, which does not require hand-crafted, object-specific constraints .…

Bounding the Inefficiency of Route Control in Intelligent Transport Systems

Route controlled autonomous vehicles could have a significant impact in reducing congestion in the future . We consider theproblem of distributed operating systems in a transportation network that control the routing choices of their assigned vehicles . We formulate anassociated network control game, consisting of multiple actors seeking tooptimise the social welfare of their .…

Fingerpad Contact Evolution Under Electrovibration

Displaying tactile feedback through a touchscreen via electrovibration has potential applications in mobile devices, consumer electronics, home appliances, and automotive industry though our knowledge and understanding on the underlying contact mechanics is very limited . The main cause of the increasein friction during full slip is due to an increase in real contact area and the .reduction…

Human Biases Preventing The Widespread Adoption Of Self Driving Cars

Self-driving cars offer a plethora of safety advantages over our accustomed human-driven ones . Many individuals feel uneasy sharing the road with thesemachines and entrusting their lives to their driving capabilities . Here we break downthe three primary psychological barriers that may hamstring or even wholly prevent their widespread adoption as well as how to tackle them .…

VisQA X raying Vision and Language Reasoning in Transformers

Visual Question Answering systems target answering open-ended textual questions given input images . They are a testbed for learning high-levelreasoning with a primary use in HCI, for instance assistance for the visually impaired . Recent research has shown that state-of-the-art models tend toproduce answers exploiting biases and shortcuts in the training data .…

GAVIN Gaze Assisted Voice Based Implicit Note taking

GAVIN, a gaze-assistedvoice note-taking application, enables readers to seamlessly take voicenotes on digital documents by implicitly anchoring them to text passages . Annotation is an effective reading strategy people often undertake while interacting with digital text . Annotating while reading in a desktop environment is considered trivial but, in a mobile setting where people read whilehand-holding devices, the task of highlighting and typing notes on a mobiledisplay is challenging .…

Use of off the shelf information extraction algorithms in clinical informatics a feasibility study of MetaMap annotation of Italian medical notes

Study tested feasibility of using ‘off the shelf’ information extraction algorithms to identify medical concepts from Italian clinical notes . We used MetaMap to map medical concepts to the Unified Medical Language System (UMLS) Results in EXP1 showed that theItalian UMLS Metathesaurus sources covered 91% of the medical terms of the’Disorders’ semantic group, as found in the studied dataset .…

GRN Generative Rerank Network for Context wise Recommendation

Generative Rerank Network (GRN) has outperformed state-of-the-art point-wise and list-wise methods . GRN has achieved a performanceimprovement of 5.2% on PV and 6.1% on IPV metric after the successfuldeployment in one popular recommendation scenario of Taobao application . Empirical resultsshow that GRN consistently and significantly outperforms state- of theartpoint-wise .…