The paper considers the problem of how a distributed system of agents (who communicate only via a localised network) might achieve consensus by copying beliefs (copy) from each other and doing some belief pruning themselves (drop). This is explored using a social simulation model, where beliefs interact with each other via a compatibility function, which assigns a level of compatibility (which ...

We analyze a model of multi-period monopoly in durable goods. Taking into consideration the special conditions of software markets, we assume that there are no used software markets and that manufacturers stop selling older software when they introduce a replacement model. We show that nominal as well as discounted (real) prices decrease over time but are above cost, thereby violating the Coase...

Abstract The thermal test temperature acquisition system is one of the core systems in spacecraft. It uses thermocouple sensors for data acquisition, and its stability directly affects success or failure task. equipment types original environment were single, electromagnetic compatibility design was weak. With increase test, interference becoming more serious even collection. Based on principle...

The key of zero-shot learning (ZSL) is how to find the information transfer model for bridging the gap between images and semantic information (texts or attributes). Existing ZSL methods usually construct the compatibility function between images and class labels with the consideration of the relevance on the semantic classes (the manifold structure of semantic classes). However, the relationsh...

The stochastic three-dimensional compressible Navier-Stokes equations are considered in a bounded domain with multiplicative noise. The global existence of martingale solution is established through the Galerkin approximation method, stopping time, compactness method and the Jakubowski-Skorokhod theorem. A martingale solution is a weak solution for the fluid variables and the Brownian motion on...

In this paper we give a necessary condition and a sufficient condition for a graph to be a pairwise compatibility graph (PCG). Let G be a graph and let Gc be the complement of G. We show that if Gc has two disjoint chordless cycles then G is not a PCG. On the other hand, if Gc has no cycle then G is a PCG. Our conditions are the first necessary condition and the first sufficient condition for p...

In this note we relate Emerton’s Jacquet functor JP to his ordinary parts functor OrdP , by computing the χ-eigenspaces Ord χ P for central characters χ. This fills a small gap in the literature. One consequence is a weak adjunction property for unitary characters χ appearing in JP , with potential applications to local-global compatibility in the p-adic Langlands program in the ordinary case.

We consider a reasonably simple voting system which can be implemented for webbased ballots. Simplicity, modularity and the requirement of compatibility with current web browsers leads to a system which satisfies a set of security requirements for a ballot system which is not complete but sufficient in many cases. Due to weak-eligibility and vote-selling, this system cannot be used for politica...

We consider interpolation between keyframe hierarchies. We impose a set of weak constraints that allows smooth interpolation between two keyframe hierarchies in an animation or, more generally, allows the interpolation in an n parameter family of hierarchies. We use hierarchical triangulations obtained by the Rivara element bisection algorithm and impose a weak compatibility constraint on the s...

We prove a common fixed point theorem for four two pairs of hybrid mappings in compact metric space satisfying an implicit relations using the concept of strict occasionally weak compatibility which generalize theorems of [1, 4, 7, 28]. As an application we obtain a general fixed point theorem for hybrid pairs satisfying a contractive condition of integral type, which is a new result in compact...