Because of their tiny size, they can get deep into the lungs and, once in the bloodstream, may be able to cross the blood-brain barrier. Particles deposited in the nasal region may be able to enter the brain by translocation along the olfactory nerve. Particles, especially composites, may be able to penetrate the skin, and even some protective equipment. The smaller the particle, the more likel...

To improve the cognitive radio user’s detection performance and reduce the complexity, this paper composites the Fractal box dimension algorithm and the 3th-order cyclic-cumulate (TCC) algorithm and improves the TCC algorithm, so a novel detection algorithm is proposed that the Fractal box dimension is used when the signal to noise (SNR) is high, while the improved TCC algorithm is used when th...

Protocols for group key exchange are cryptographic algorithms that allow a group of parties communicating over a public network to come up with a common secret key. One of the interesting results of research on group key exchange is the protocol compiler presented by Abdalla et al. in TCC ’07. Abdalla et al.’s compiler shows how one can transform any authenticated 2-party key exchange protocol ...

We study the classic cake cutting problem from a mechanism design perspective, in particular focusing on deterministic mechanisms that are strategyproof and fair. We begin by looking at mechanisms that are non-wasteful and primarily show that for even the restricted class of piecewise constant valuations there exists no direct-revelation mechanism that is strategyproof and even approximately pr...

Let C be a binary extremal self-dual doubly-even code of length n ≥ 48. If such a code has an automorphism σ of prime order p ≥ 5 then the number of fixed points in the permutation action on the coordinates is bounded by the number of p-cycles. It turns out that large primes p, i.e. n − p small, occur extremely rarely in Aut(C). Examples are the extended quadratic residue codes. We prove that d...