Regular partitions of gentle graphs

Szemeredi’s Regularity Lemma is a very useful tool of extremal combinatorics . Several refinements of this seminal result were obtained for special,more structured classes of graphs . Many of these classes present challenging problems . Nevertheless, from the point of view of regularity lemma type statements, they appear as “gentle” classes .…

Benchmarking Software Model Checkers on Automotive Code

This paper reports on our experiences with verifying automotive C code by open source software model checkers . The embedded C code isautomatically generated from Simulink open-loop controller models . Its diversefeatures (decision logic, floating-point and pointer arithmetic, rate limitersand state-flow systems) makeverifying the code highly challenging .…

Order Effects of Measurements in Multi Agent Hypothesis Testing

All propositions from the set of events for an agent in a multi-agent system might not be simultaneously verifiable . A possible construction of a ‘noncommutative probabilityspace’, accounting for ‘incompatible events’ (events which cannot besimultaneously verified) is discussed . We prove that the minimum probability of error achieved in the secondapproach is the same as in the first approach .…

Geometric Sparsification of Closeness Relations Eigenvalue Clustering for Computing Matrix Functions

We show how to efficiently solve a clustering problem that arises in a method to evaluate functions of matrices . The problem requires finding the connected components of a graph whose vertices are eigenvalues of a real or complexmatrix . We have implemented both algorithms using CGAL, amature and sophisticated computational-geometry software library, and wedemonstrate that the new algorithm is much faster in practice than the naive algorithm .…

Data Driven Inference of Representation Invariants

A representation invariant is a property that holds of all values of abstracttype produced by a module . Representation invariants play important roles in software engineering and program verification . We develop a type-directed notion of visible inductiveness that ensures that the algorithm makes progress toward its goal as it alternates between weakening and strengthening candidate invariants .…

Edge Intelligence Architectures Challenges and Applications

Edge intelligence refers to a set of connected systems and devices for datacollection, caching, processing, and analysis in locations close to where data is captured based on artificial intelligence . The aim of edge intelligence is to enhance the quality and speed of data processing and protect the privacy and security of the data .…

Towards Better Opioid Antagonists Using Deep Reinforcement Learning

Developing better opioid antagonists is critical in combating theopioid epidemic . Naloxone has short brain retention ability, which limits its therapeuticefficacy . Instead of exhaustively searching in a huge chemical space, we adopt reinforcement learning which allow efficient gradient-based search towards molecules with desired physicochemicaland/or biological properties .…

XBlock EOS Extracting and Exploring Blockchain Data From EOSIO

EOSIO has richer diversity and higher volume of blockchain data than Bitcoin andEthereum . Few studies have been made on data analysis of EOSio . XBlock-EOS consists of 7 well-processed datasets: Block, Transaction and Action, Contract Information, Contract Invocation, Token Invocation and Token Action, 6) AccountCreation, 7) Resource Management.…

Minimising Good for Games automata is NP complete

This paper discusses the hardness of finding minimal good-for-games (GFG) Buchi, Co-Buchi, and parity automata with state based acceptance . The problem sits between finding small deterministic and smallnondeterministic automata, where minimality is NP-complete and PSPACE-complete . Recent work of Radi and Kupferman has shown thatminimising Co-buchi automata is tractable .…

Simultaneous 2nd Price Item Auctions with No Underbidding

We study the price of anarchy (PoA) of simultaneous 2nd price auctions (S2PA) We establish bounds on the PoA of S2PA under no underbidding for differentvaluation classes, in both full-information and incomplete informationsettings . We show that every auction that is $(1,1)$-revenue guaranteed has PoA at least $1/2 .…

A Misreport and Collusion Proof Crowdsourcing Mechanism without Quality Verification

The state-of-the-artwork is not suitable for large-scale crowdsourcing applications, since it is along haul for the requestor to verify task quality or select professional workers in a one-by-one mode . In this paper, we propose a misreport- andcollusion-proof crowdsourcing mechanism, guiding workers to truthfully report the quality of submitted tasks without collusion by designing a mechanism .…

Last Round Convergence and No Instant Regret in Repeated Games with Asymmetric Information

This paper considers repeated games in which one player has more information about the game than the other players . We develop a no-instant-regret algorithm for the column player to exhibit last round convergence to a minimax equilibrium . We show thatour algorithm is efficient against a large set of popular no-regregret algorithms, including the multiplicative weight update algorithm, the online mirror descent method/follow-the-regularized-leader, and the optimistic multiplicativeweight update algorithm .…

Deep Learning on Knowledge Graph for Recommender System A Survey

Recent advances in research have demonstrated the effectiveness of knowledgegraphs (KG) in providing valuable external knowledge to improve recommendationsystems (RS) A knowledge graph is capable of encoding high-order relationsthat connect two objects with one or multiple related attributes . With the help of the emerging Graph Neural Networks (GNN), it is possible to extract bothobject characteristics and relations from KG, which is an essential factor for successful recommendations .…

VIOLIN A Large Scale Dataset for Video and Language Inference

We introduce a new task, Video-and-Language Inference, for joint multimodal understanding of video and text . Given a video clip with aligned subtitles aspremise, paired with a natural language hypothesis based on the video content, a model needs to infer whether the hypothesis is entailed or contradicted by the given video clip .…

Commentaries on Learning Sensorimotor Control with Neuromorphic Sensors Toward Hyperdimensional Active Perception Science Robotics Vol 4 Issue 30 2019 1 10

This correspondence comments on the findings reported in a recent ScienceRobotics article by Mitrokhin et al. The main goal of this commentary is to expand on some of the issues touched on in that article . Hyperdimensional computing is very different from other approaches to computing and it can take considerable exposure to its concepts before it can be useful to understand .…

Adaptive Conditional Neural Movement Primitives via Representation Sharing Between Supervised and Reinforcement Learning

Conditional Neural MovementPrimitives (CNMP) can learn non-linear relations between environmentparameters and complex multi-modal trajectories from a few expertdemonstrations . This enables the CNMP network to generalize to new environments by adapting its internal representations . Learning by Demonstration provides a sample efficient way to equip robots with complex sensorimotor skills in supervised manner .…

Planning with Brain inspired AI

This article surveys engineering and neuroscientific models of planning as acognitive function . It aims to present existing planning models as references for realizing the planning function in AI or artificial general intelligence . It also proposesthemes for the research and development of brain-inspired AI from the viewpoint of tasks and architecture, such as tasks .…

Topology and adjunction in promise constraint satisfaction

The approximate graph colouring problem concerns colouring a $k$-colourablegraph with $c$ colours, where $c\geq k$. This problem naturally generalises topromise graph homomorphism and further to promise constraint satisfaction problems . Complexity analysis of all these problems is notoriously difficult . In this paper, we introduce two new techniques to analyse the complexity ofpromise CSPs: one is based on topology and the other on adjunction .…

Fair packing of independent sets

In this work we add a graph theoretical perspective to a classical problem offairly allocating indivisible items to several agents . Agents have differentprofit valuations of items and we allow an incompatibility relation betweenpairs of items described in terms of a conflict graph .…

A Fully Accelerated Surface Integral Equation Method for the Electromagnetic Modeling of Arbitrary Objects

Surface integral equation (SIE) methods are of great interest for thenumerical solution of Maxwell’s equations in the presence of homogeneous objects . We present a scalable SIE algorithm based on the generalized impedance boundary condition which can handle, in a unified manner, both dielectrics and conductors over awide range of conductivity, size and frequency .…

A Formalization of SQL with Nulls

The full standard is based on ambiguous natural language rather than formalspecification . Commercial SQL implementations interpret the standard in different ways . The lack of a well-understood formalsemantics makes it very difficult to validate the soundness of database systems .…

Robust Stochastic Bayesian Games for Behavior Space Coverage

A key challenge in multi-agent systems is the design of intelligent agents solving real-world tasks in close interaction with other agents . We present an approach to this challenge based on a new framework ofRobust Stochastic Bayesian Games (RSBGs) An RSBG defines hypothesis sets bypartitioning the physically feasible, continuous behavior space of the otheragents .…

Impact of the Number of Votes on the Reliability and Validity of Subjective Speech Quality Assessment in the Crowdsourcing Approach

The subjective quality of transmitted speech is traditionally assessed in acontrolled laboratory environment according to ITU-T Rec. P.800.808 . Crowdworkers participate in a subjective online experiment using their own listening device, and in their own working environment . Despite suchless controllable conditions, the increased use of crowdsourcing micro-taskplatforms for quality assessment tasks has pushed a high demand for standardized methods .…

Co Optimizing Performance and Memory FootprintVia Integrated CPU GPU Memory Management anImplementation on Autonomous Driving Platform

Cutting-edge embedded system applications, such as self-driving cars and drone software, are reliant on integrated CPU/GPU platforms for their DNNs-driven workload . By conducting per-task memory management policy switching and kernel overlapping, the scheduler can significantly relieve the system memory pressure and reduce the multitasking response time .…

Commutators for Stochastic Rewriting Systems Theory and Implementation in Z3

In the semantics of stochastic rewriting systems (SRSs) based on rulealgebras, the evolution equations for average expected pattern counts arecomputed via so-called commutators counting the distinct sequential sequential sequentialcompositions of rules and observable patterns regarded as identity rules . However, graphs are often subject to constraints, so we develop strategies for computing rule composition, both theoretically and using the SMT solver Z3 with its Python interface .…

Deep Weisfeiler Leman

Weisfeiler Leman algorithms (DeepWL) allow the design of purely combinatorial graph isomorphism tests that are more powerful than the well-known algorithm . Our main technical result states that for each class of graphs (satisfying some mild closure condition) if there is a polynomial time DeepWLisomorphism test then there is also a polyomial canonisation algorithm for thisclass .…

FacebookVideoLive18 A Live Video Streaming Dataset for Streams Metadata and Online Viewers Locations

With the advancement in personal smart devices and pervasive networkconnectivity, users are no longer passive content consumers, but alsocontributors in producing new contents . This expansion in live services requires a detailed analysis of broadcasters’ and viewers’ behavior to maximize users’ Quality of Experience (QoE) In this paper, we present a datasetgathered from one of the popular live streaming platforms: Facebook .…