Abstract We study the one-dimensional discrete time totally asymmetric simple exclusion process with parallel update rules on a spatially periodic domain. A multi-point space-time joint distribution formula is obtained for general initial conditions. The involves contour integrals of Fredholm determinants kernels acting certain spaces. For class conditions satisfying technical assumptions, we a...

Generally, the existing graph-based multi-view clustering models consists of two steps: (1) graph construction; (2) eigen-decomposition on Laplacian matrix to compute a continuous cluster assignment matrix, followed by post-processing algorithm get discrete one. However, both construction and are time-consuming, two-stage process may deviate from directly solving primal problem. To this end, we...

We present an approach to agents that can reason, react to the environment and are able to update their own knowledge as a result of new incoming information. Each agents’ view of the social relationships among agents (itself and others) is represented by a graph, which in turn can be updated, allowing for the representation of such social evolution.

In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...

Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...

In this paper, a discrete-time multi-agent system is presented which is formulated in terms of the delta operator. The proposed multi-agent system can unify discrete-time and continuous-time multi-agent systems. In a multi-agent network, in practice, the communication among agents is acted upon by various factors. The communication network among faulty agents may cause link failures, which is m...

one main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. this paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. indeed, the nature of products is considered different and hub capacity constraint is also applied. due to ...

Necessary and sufficient conditions for a class of dissipative nonlinear multiinput multi-output discrete-time systems are given. The conditions existing in the literature, addressed as Kalman-Yakubovich-Popov conditions, for the dissipative, passive or lossless cases, are derived from the proposed dissipativity characterization. Feedback passivity is solved for a class of multi-input multi-out...