A tuple centre is a Linda-like tuple space whose behaviour can be programmed by means of transactional reactions to the standard communication events. This paper de nes the notion of tuple centre, and shows the impact of its adoption as a coordination medium for a distributed multi-agent system on both the system design and the overall system e ciency.

Using the idea of local entropy theory, we characterize sequence tuple via mean forms sensitive in both topological and measure-theoretical senses. For sense, show that for an ergodic measure-preserving system, $\mu$-sequence tuple, $\mu$-mean $\mu$-sensitive coincide, give example to ergodicity condition is necessary. a certain class minimal systems, tuple.

This paper describes the N-Tuple Bandit Evolutionary Algorithm (NTBEA), an optimisation algorithm developed for noisy and expensive discrete (combinatorial) optimisation problems. The algorithm is applied to two game-based hyperparameter optimisation problems. The N-Tuple system directly models the statistics, approximating the fitness and number of evaluations of each modelled combination of p...

An overpartition of the nonnegative integer n is a non-increasing sequence of natural numbers whose sum is n in which the first occurrence of a number may be overlined. Let k ≥ 1 be an integer. An overpartition k-tuple of a positive integer n is a k-tuple of overpartitions wherein all listed parts sum to n. Let pk(n) be the number of overpartition k-tuples of n. In this paper, we will give a sh...

In this paper, we investigate the multiple attribute decision making problems with 2-tuple linguistic information. Motivated by the ideal of generalized weighted Bonferroni mean and generalized weighted geometric Bonferroni mean, we develop the 2-tuple linguistic generalized Bonferroni mean (2TLGBM) operator for aggregating the 2-tuple linguistic information and 2-tuple linguistic generalized g...

Let N ≥ 2 and let 1 < a1 < · · · < aN be relatively prime integers. Frobenius number of this N-tuple is defined to be the largest positive integer that cannot be expressed as ∑ N i=1 aixi where x1, ..., xN are non-negative integers. The condition that gcd(a1, ..., aN ) = 1 implies that such number exists. The general problem of determining the Frobenius number given N and a1, ..., aN is NP-hard...

Let N ≥ 2 and let 1 < a1 < · · · < aN be relatively prime integers. Frobenius number of this N-tuple is defined to be the largest positive integer that cannot be expressed as P N i=1 aixi where x1, ..., xN are non-negative integers. The condition that gcd(a1 , ..., aN ) = 1 implies that such number exists. The general problem of determining the Frobenius number given N and a1, ..., aN is NP-har...

TCP has historically been considered to be protected against spoofed off-path packet injection attacks by relying on the fact that it is difficult to guess the 4-tuple (the source and destination IP addresses and the source and destination ports) in combination with the 32-bit sequence number(s). A combination of increasing window sizes and applications using longer-term connections (e.g., H-32...

TCP has historically been considered to be protected against spoofed off-path packet injection attacks by relying on the fact that it is difficult to guess the 4-tuple (the source and destination IP addresses and the source and destination ports) in combination with the 32-bit sequence number(s). A combination of increasing window sizes and applications using longer-term connections (e.g., H-32...