The discriminator of an integer sequence s = (s(i))i≥0, introduced by Arnold, Benkoski, and McCabe in 1985, is the function Ds(n) that sends n to the least integer m such that the numbers s(0), s(1), . . . , s(n−1) are pairwise incongruent modulo m. In this note we present a class of exponential sequences that have the special property that their discriminators are shift-invariant, i.e., that t...

conclusions: use of ginger was effective at decreasing postoperative nausea. ginger could be used as a safe antiemetic drug at post operation. results: mean nausea score at 2 hours post operation was significantly lower in the experimental group (p= 0.04). mean nausea score at 4 and 6 hours post operation was lower in the experimental group; however, there was no significant difference between ...

With the improvement of the urbanization level, the mixed city water has surged and the traditional denitrogenating cost in the course of wastewater reuse has been unbearable. This experiment used the technology of the constructed rapid infiltration (CRI) and applied the soil column simulation method in the laboratory. The results show that nitrogen removal rates of two soil columns are 73.73% ...

Many economic outcomes appear to be influenced by habit or commitment, giving rise to persistence. In cases where the decision is binary and persistent, the aggregation of individual time series can result in a fractionally integrated process for the aggregate data. Certain television programmes appear to engender commitment on the part of viewers and the decision to watch or not is clearly bin...

In the paper output feedback control of Boolean control networks (BCNs) is investigated. First, necessary and sufficient conditions for the existence of a time-invariant output feedback (TIOF) law, stabilizing the BCN to some equilibrium point, are given, and constructive algorithms to test the existence of such a feedback law are proposed. Two sufficient conditions for the existence of a stabi...

We establish a new bound for the exponential sum x∈X y∈Y γ(y) exp(2πiaλ xy /p) , where λ is an element of the residue ring modulo a large prime number p, X and Y are arbitrary subsets of the residue ring modulo p − 1 and γ(n) are any complex numbers with |γ(n)| ≤ 1. In particular, we improve several previously known bounds.

Advance of search engines has removed an end-user’s constraint on search such as cost (free), operation time (fast response), language (cross-lingual), media (multimedia), and more recently, time-lag from content generation (realtime search). Consequently, we do not usually perceive strong constraint on the use of search engines. The removal of constraint is often seen as an improvement of a sy...

In this work, we describe a simple and efficient construction of a large subset S of Fp , where p is a prime, such that the set A(S) for any non-identity affine map A over Fp has small intersection with S . Such sets, called affine-evasive sets, were defined and constructed in [ADL14] as the central step in the construction of non-malleable codes against affine tampering over Fp , for a prime p...