We study, from an information theoretic perspective, the merits of joint sourcechannel (JSC) coding versus traditional tandem coding, which consists of separately performing and concatenating source and channel coding. Specifically, we provide a systematic comparison of the JSC coding error exponent EJ (Q, W ) with the tandem coding error exponent ET (Q, W ) for communication systems with discr...

BACKGROUND In 5 percent of paternity determination cases, only DNA samples from the alleged father and child pairs are tested. The absence of the mother's DNA increases the probability of false paternity inclusions, which affects laboratories that use a limited number of DNA markers. The effect of coincidental matches between unrelated individuals on DNA tests of motherless cases was determined...

In an earlier study we showed that a blend of thermoresponsive and nonthermoresponsive hydroxyalkylcelluloses could be used to create a thermally tunable polymer network for double-stranded (ds) DNA separation. Here, we show the generality of this approach using a family of polymers suited to a wider range of DNA separations: a blended mixture of N,N-dialkylacrylamide copolymers with different ...

We introduce Legendre sequences and generalised Legendre pairs (G Lpairs). We show how to construct an Hadamard matrix of order 2£ + 2 from a GL-pair of length f. We review the known constructions for GLpairs and use the discrete Fourier transform (DFT) and power spectral density (PSD) to enable an exhaustive search for GL-pairs for lengths f ::::; 47 and partial searches for other f, 1 Definit...

W develop and test an incentive-compatible Conjoint Poker (CP) game. The preference data collected in the context of this game are comparable to incentive-compatible choice-based conjoint (CBC) analysis data. We develop a statistical efficiency measure and an algorithm to construct efficient CP designs. We compare incentive-compatible CP to incentive-compatible CBC in a series of three experime...

Let W be the free monoid over a finite alphabet A. We prove that a congruence of W generated by a finite number of pairs 〈au, u〉, where a ∈ A and u ∈ W , is always decidable.

Five commercially available encryption packages for the IBM PC are described and broken.

We reformulate the notion of uncertainty pairs unitary operators within context guessing games and derive an entropic relation for a pair such operators. show how distinguishable are compatible while maximal incompatibility can be connected to bases some subspace which mutually unbiased.

The first measurements of production cross sections polarized same-sign W±W± boson pairs in proton-proton collisions are reported. based on a data sample collected with the CMS detector at LHC center-of-mass energy 13TeV, corresponding to an integrated luminosity 137fb−1. Events selected by requiring exactly two leptons, electrons or muons, moderate missing transverse momentum, and jets large r...

Abstract We study pre-Lie pairs, by which we mean a pair of homotopy Lie algebra and with compatible action. Such pairs provide wealth algebraic structure, in particular can be used to analyze the part pair. Our main application motivation for this development are dg algebras hairy graphs computing rational groups mapping spaces little disks operads. show that twisting certain Maurer–Cartan ele...