An extended quantum process algebra eQPAlg approach for distributed quantum systems

In this work, we have expounded the communication procedure of quantum systems by means of process algebra . The main objective of our research effort is to formally represent the communication between distributed quantum systems . Examples have been provided to describe the working of the improved algebra that formally explain the sending and receiving of both classical as well as quantum data, keeping in mind the principalfeatures of quantum mechanics .…

Price Competition with LTE U and WiFi

LTE-U is an extension of the Long Term Evolution (LTE) standard for operationin unlicensed spectrum . The difference in spectralefficiency between LTE and WiFi also plays a role in the competition among SPs . The welfare impacts of this technology are subtle, depending in part on the amount of unlicensed spectrum and number of entures and the amount of unlicensed reservoirs used by the technology .…

Joint Communication and Computational Resource Allocation for QoE driven Point Cloud Video Streaming

Point cloud video is the most popular representation of hologram, which is the medium to precedent natural content in VR/AR/MR and is expected to be the next generation video . The inherent challenges lie in the large size by the necessity of recording the three-dimensional coordinates besides color information, and the associated high computation complexity of encoding .…

A Calculus for Modular Loop Acceleration

Loop acceleration can be used to prove safety, reachability, runtime bounds, and (non-termination) of programs operating on integers . We present a calculus that allows for combining acceleration techniques in a modular way . We propose two novel acceleration techniques that can be incorporated into our calculus seamlessly .…

A Diagrammatic Calculus for Algebraic Effects

We introduce a new diagrammatic notation for representing the result of(algebraic) effectful computations . Our notation explicitly separates theeffects produced during a computation from the possible values returned, thisway simplifying the extension of definitions and results on pure computationsto an effectful setting .…

Business Negotiation Definition Language

The target of this paper is to present an industry-ready prototype software for general game playing . This software can also be used as the central element for experimental economics research, interfacing of game-theoretic libraries, AI-driven software testing, algorithmic trade, human behavior mining and simulation of (strategic) interactions .…

Multi Agent Interactions Modeling with Correlated Policies

In multi-agent systems, complex interacting behaviors arise due to the highcorrelations among agents . DecentralizedAdversarial Imitation Learning algorithm with Correlated policies (CoDAIL) allows for decentralized training and execution . Various experiments demonstrate that CoDAIL can better regenerate complex interactions close to thedemonstrators and outperforms state-of-the-art multagent imitation learning methods .…

Hard 3 CNF SAT problems are in P A first step in proving NP P

The relationship between the complexity classes $P$ and $NP$ is an unsolved question in theoretical computer science . In the first part of this paper, a lattice framework is proposed to handle the 3-CNF-SAT problems . The complexity needed for the computation of $Im\; {\cal H}__\varphi$ the set of all solutions, is shown to be polynomial for hard 3-NAT problems, i.e.…

Cyberphysical Blockchain Enabled Peer to Peer Energy Trading

Scalability and security problems of the centralized architecture models incyberphysical systems have great potential to be solved by novel blockchainbased distributed models . A decentralized energy trading system takes advantageof various sources and effectively coordinates the energy to ensure optimalutilization of the available resources .…

Control Challenges for Resilient Control Systems

The main challenge for control systems is its cyber-physical nature which strongly couples the cyber systems with physical layerdynamics . Decentralized control of such systems is indispensable . We extend the resiliency framework to address distributed and collaborative resiliencies among decentralized control agents .…

Selfish Algorithm and Emergence of Collective Intelligence

We propose a model for demonstrating emergence of collectiveintelligent behavior from selfish individual agents . Agents’ behavior ismodeled using our proposed selfish algorithm ($SA$) with three learningmechanisms: reinforced learning ($SAL$), trust ($SAT$) and connection ($SAC$) The $SA$ provides a generalization of theself-organized temporal criticality ($SOTC$) model and shows thatself-interested individuals can simultaneously produce maximum social benefit from their decisions .…

Biometric and Physical Identifiers with Correlated Noise for Controllable Private Authentication

The problem of secret-key based authentication under privacy and storage constraints on the source sequence is considered . The identifier measurementchannels during authentication are assumed to be controllable via acost-constrained action sequence . The results are relevant for several user and deviceauthentication scenarios including physical and biometric identifiers with multiple measurements that provide diversity and multiplexing gains .…

Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa Szemerédi Graphs and Hypergraphs

One protocol leads to a simple and naturalextension of the original construction of Ruzsa and Szemer\'{e}di . Another protocol is an explicit (and slightly simpler) version of the construction of Alon,Moitra and Sudakov . We alsogeneralize the above protocols to more than three players, in order to construct dense uniform hypergraphs in which every edge lies in a positivesmall number of simplices .…

Coarse Grained Complexity for Dynamic Algorithms

To date, the only way to argue polynomial lower bounds for dynamic algorithms is via fine-grained complexity arguments . These arguments rely on strongassumptions about specific problems such as the Strong Exponential TimeHypothesis (SETH) and the Online Matrix- Vector Multiplication Conjecture (OMv) Dynamic algorithms missout some benefits and lessons from the traditional “coarse grained” approach .…

Incremental Monoidal Grammars

In this work we define formal grammars in terms of free monoidal categories . This allows us to link the categorical viewpoint on natural language to the standard machinelearning notion of probabilistic language model . We also develop a functor from the category of formal grammarmars to category ofautomata .…

Representing Unordered Data Using Complex Weighted Multiset Automata

Unordered, variable-sized inputs arise in many settings across multiplefields . The ability for set- and multiset-oriented neural networks to handle this type of input has been the focus of much work in recent years . We propose a new theoretical andintuitive justification for the Transformer model’s representation of positions using sinusoidal functions .…

Quick or cheap Breaking points in dynamic markets

We examine two-sided markets where players arrive stochastically over time and are drawn from a continuum of types . The cost of matching a client and provider varies, so a social planner is faced with two contending objectives:a) to reduce players’ waiting time before getting matched; and b) to formefficient pairs in order to reduce matching costs .…

Toward Optimal Adversarial Policies in the Multiplicative Learning System with a Malicious Expert

We consider a learning system based on the conventional multiplicative weight(MW) rule that combines experts’ advice to predict a sequence of true outcomes . In the offline setting where the malicious expert must choose its entire sequence of decisions a priori, we show somewhat surprisingly that asimple greedy policy of always reporting false prediction is asymptoticallyoptimal with an approximation ratio of $1+O(\sqrt{\frac{\ln N}{N) $N$is the total number of prediction stages .…

From Drinking Philosophers to Wandering Robots

In this paper, we consider the multi-robot path execution problem where agroup of robots move on predefined paths from their initial to target positions . We then propose modifications to an existing DrPP algorithm to allow more concurrent behavior, and provide conditions under which our method is deadlock-free .…

DeepFakes and Beyond A Survey of Face Manipulation and Fake Detection

Thissurvey provides a thorough review of techniques for manipulating face images including DeepFake methods . Inparticular, four types of facial manipulation are reviewed: entire facesynthesis, identity swap (DeepFakes), attribute manipulation, and expression swap . In addition to the survey information, we also discuss open issues and future trends that should be considered to advance in the field .…

DoWhy An End to End Library for Causal Inference

DoWhy is an open-source Python library that is built with causal assumptions as its first-class citizens . DoWhy implements a number of robustness checks including placebo tests, bootstrap tests, and tests for unobervedconfounding . The library is available at https://://://github.com/Microsoft/dowhy and the library is free to download from http://www.mnt.org/doWhy-why-pennifera-gui-a-libraries-to-measurement-by-mechanical-association-assumption-checker-assertions.…

Fourier based and Rational Graph Filters for Spectral Processing

Data are represented as graphs in a wide range of applications, such as Computer Vision and Graphics . We introduce a spectrum-free approach, which requires the solution of a small set of sparse, symmetric, well-conditioned linear systems . Approximating arbitrary graph filters with rational polynomials provides a more accurate andnumerically stable alternative with respect to polyomials .…

Designing Game Feel A Survey

The act of polishing that determines game feel, takes the shape of tuning, juicing, and streamlining respectively . Tuning thephysicality of game objects creates cohesion, predictability, and the resultingmovement informs many other design aspects . Juicing is the act of plishingamplification and it results in empowerment and provides clarity of feedback by communicating the importance of game events .…

Assembling a Pipeline for 3D Face Interpolation

This paper describes a pipeline built with open source tools forinterpolating 3D facial expressions taken from images . Given the input photos, corresponding 3D face models are constructed and texture-mappedusing the photos as textures aligned with facial features . Animations are thengenerated by morphing the models by interpolation of the geometries andtextures of the models .…

Deep Learning Based Human Pose Estimation A Survey

The goal of this survey paper is toprovide a comprehensive review of recent deep learning-based solutions for both 2D and 3D pose estimation . More than 240research papers since 2014 are covered in this survey . The challenges involved,applications, and future research directions are concluded .…

An Marching Cube Algorithm Based on Edge Growth

Marching Cube algorithm is currently one of the most popular 3D surface rendering algorithms . It forms cube voxels through the input image, then uses 15 basic topological configurations to extract theisosurfaces in the voxel . The algorithm first extractsseed triangles, then grows the seed triangles and reconstructs the entire 3D model .…

TopoKnit A Process Oriented Representation for Modeling the Topology of Yarns in Weft Knitted Textiles

Machine knitted textiles are complex multi-scale material structuresincreasingly important in many industries . Wepropose a process-oriented representation, TopoKnit, that defines afoundational data structure for representing the topology of weft-knittedtextiles at the yarn scale . Process space serves as an intermediary between themachine and fabric spaces, and supports a concise, computationally efficientevaluation approach based on on-demand, near constant-time queries .…

PAVEL Decorative Patterns with Packed Volumetric Elements

Ouralgorithm works by determining the locations in which to add the decorative elements and then removing the non-physical overlap between them while preserving the decoration volume . It can be used to enhance virtual surfaces, as well as 3D-printed pieces, by assembling the decorations onto real-surfacesto obtain tangible reproductions .…

Meta PU An Arbitrary Scale Upsampling Network for Point Cloud

Point cloud upsampling is vital for the quality of the mesh in three-dimensional reconstruction . The methods need to train a specific model for eachscale factor, which is both inefficient and impractical for storage and computing in real applications . We propose a novel method called “Meta-PU” to support point cloudupsampling of arbitrary scale factors with a single model .…