A ny RF communications system that uses carrier on/off pulses can be designed to have better receiver sensitivity by using negative or zero group delay narrow band filters in the receiver. These filters greatly reduce the bandwidth normally required by removing the sidebands, while retaining the necessary information in the pulsed on/off carrier. SNR improvements greater than 40 dB are being ob...

It is known that the total (co)-homoloy of a 2-step nilpotent Lie algebra g is at least 2|z|, where z is the center of g. We improve this result by showing that a better lower bound is 2t, where t = |z|+ [ |v|+1 2 ] and v is a complement of z in g. Furthermore, we provide evidence that this is the best possible bound of the form 2t.

By means of the Schechter’s Linking method, we study the existence of 2T -periodic solutions of the non-autonomous fourth-order ordinary differential equation u′′′′ −Au′′ −Bu− Vu(t, u) = 0 where A > 0, B > 0, V (t, u) ∈ C1(R × R,R) is 2T -periodic in t and satisfies either 0 < θV (t, u) ≤ uVu(t, u) with θ > 2, or uVu(t, u) − 2V (t, u) ≥ d3|u| with r ≥ 1.

The paper characterizes (2t + 1)-regular graphs with circular flow number 2 + 2 2t−1 . For t = 1 this is Tutte’s characterization of cubic graphs with flow number 4. The class of cubic graphs is the only class of odd regular graphs where a flow number separates the class 1 graphs from the class 2 graphs. We finally state some conjectures and relate them to existing flow-conjectures.

I show that P(2, 3) has an embedding P(2, 3) ∼= Γ ⊂ P(4, 5, 6, 9) whose image Γ is contained in a quasismooth K3 hypersurface X24 ⊂ P(4, 5, 6, 9). The pair Γ ⊂ X24 unprojects to the codimension 4 K3 surface Y ⊂ P(4, 5, 5, 6, 7, 8, 9) with Basket = [ 1 2 (1, 1), 1 5 (1, 4), 1 5 (2, 3), 1 9 (4, 5) ]. Numerator = 1− t − t − 2t − 2t − 2t − t + t + 2t + 3t + 4t + 3t + · · · (Altınok4(111) in the Mag...

A set partition of [n] is a collection of pairwise disjoint nonempty subsets (called blocks) of [n] whose union is [n]. Let B(n) denote the family of all set partitions of [n]. A family A ⊆ B(n) is said to be m-intersecting if any two of its members have at least m blocks in common. For any set partition P ∈ B(n), let τ(P ) = {x : {x} ∈ P} denote the union of its singletons. Also, let μ(P ) = [...

A new fault attack, double counting attack (DCA), on the precomputation of 2t-ary modular exponentiation for a classical RSA digital signature (i.e., RSA without the Chinese remainder theorem) is proposed. The 2t-ary method is the most popular and widely used algorithm to speed up the RSA signature process. Developers can realize the fastest signature process by choosing optimum t. For example,...

Changes in plasma volume in vivo cause rapid changes in extracellular pH by altering the plasma bicarbonate concentration at a constant Pco(2) (Garella S, Chang BS, and Kahn SI. Kidney Int 8: 279, 1975). Few studies have examined the possibility that changes in cell volume produce comparable changes in intracellular pH (pH(i)). In the present study, alveolar macrophages were exposed to hyperosm...

Secure multiparty computation (MPC) allows a set of n parties to securely compute an agreed function, even if up to t parties are under the control of an adversary. In this paper, we propose a new Asynchronous secure multiparty computation (AMPC) protocol that provides information theoretic security with n = 4t+ 1, where t out of n parties can be under the influence of a Byzantine (active) adve...

We present a method for multi-target tracking that exploits the persistence in detection of object parts. While the implicit representation and detection of body parts have recently been leveraged for improved human detection, ours is the first method that attempts to temporally constrain the location of human body parts with the express purpose of improving pedestrian tracking. We pose the pro...