Signal and noise of Diamond Pixel Detectors at High Radiation Fluences

CVD diamond is an attractive material option for LHC vertex detectors because of its strong radiation-hardness causal to its large band gap and strong lattice. In particular, pixel detectors operating close to the interaction point profit from tiny leakage currents and small pixel capacitances of diamond resulting in low noise figures when compared to silicon. On the other hand, the charge signal from traversing high energy particles is smaller in diamond than in silicon by a factor of about 2.2. Therefore, a quantitative determination of the signal-to-noise ratio (S/N) of diamond in comparison with silicon at fluences in excess of 10$^{15}$ n$_{eq}$ cm$^{-2}$, which are expected for the LHC upgrade, is important. Based on measurements of irradiated diamond sensors and the FE-I4 pixel readout chip design, we determine the signal and the noise of diamond pixel detectors irradiated with high particle fluences. To characterize the effect of the radiation damage on the materials and the signal decrease, the change of the mean free path $\lambda_{e/h}$ of the charge carriers is determined as a function of irradiation fluence. We make use of the FE-I4 pixel chip developed for ATLAS upgrades to realistically estimate the expected noise figures: the expected leakage current at a given fluence is taken from calibrated calculations and the pixel capacitance is measured using a purposely developed chip (PixCap). We compare the resulting S/N figures with those for planar silicon pixel detectors using published charge loss measurements and the same extrapolation methods as for diamond. It is shown that the expected S/N of a diamond pixel detector with pixel pitches typical for LHC, exceeds that of planar silicon pixels at fluences beyond 10$^{15}$ particles cm$^{-2}$, the exact value only depending on the maximum operation voltage assumed for irradiated silicon pixel detectors

Complete Solving for Explicit Evaluation of Gauss Sums in the Index 2 Case

Let $p$ be a prime number, $q=p^f$ for some positive integer $f$, $N$ be a positive integer such that $\gcd(N,p)=1$, and let \k be a primitive multiplicative character of order $N$ over finite field \fq. This paper studies the problem of explicit evaluation of Gauss sums in "\textsl{index 2 case}" (i.e. f=\f{\p(N)}{2}=[\zn:\pp], where \p(\cd) is Euler function). Firstly, the classification of the Gauss sums in index 2 case is presented. Then, the explicit evaluation of Gauss sums G(\k^\la) (1\laN-1) in index 2 case with order $N$ being general even integer (i.e. N=2^{r}\cd N_0 where $r,N_0$ are positive integers and $N_03$ is odd.) is obtained. Thus, the problem of explicit evaluation of Gauss sums in index 2 case is completely solved

Degeneracy Algorithm for Random Magnets

It has been known for a long time that the ground state problem of random magnets, e.g. random field Ising model (RFIM), can be mapped onto the max-flow/min-cut problem of transportation networks. I build on this approach, relying on the concept of residual graph, and design an algorithm that I prove to be exact for finding all the minimum cuts, i.e. the ground state degeneracy of these systems. I demonstrate that this algorithm is also relevant for the study of the ground state properties of the dilute Ising antiferromagnet in a constant field (DAFF) and interfaces in random bond magnets.Comment: 17 pages(Revtex), 8 Postscript figures(5color) to appear in Phys. Rev. E 58, December 1st (1998

Efficient implementation of selective recoupling in heteronuclear spin systems using Hadamard matrices

We present an efficient scheme which couples any designated pair of spins in heteronuclear spin systems. The scheme is based on the existence of Hadamard matrices. For a system of $n$ spins with pairwise coupling, the scheme concatenates $cn$ intervals of system evolution and uses at most $c n^2$ pulses where $c \approx 1$. Our results demonstrate that, in many systems, selective recoupling is possible with linear overhead, contrary to common speculation that exponential effort is always required.Comment: 7 pages, 4 figures, mypsfig2, revtex, submitted April 27, 199

The Netherlands Arrhythmogenic Cardiomyopathy Registry:design and status update

BACKGROUND: Clinical research on arrhythmogenic cardiomyopathy (ACM) is typically limited by small patient numbers, retrospective study designs, and inconsistent definitions. AIM: To create a large national ACM patient cohort with a vast amount of uniformly collected high-quality data that is readily available for future research. METHODS: This is a multicentre, longitudinal, observational cohort study that includes (1) patients with a definite ACM diagnosis, (2) at-risk relatives of ACM patients, and (3) ACM-associated mutation carriers. At baseline and every follow-up visit, a medical history as well information regarding (non-)invasive tests is collected (e. g. electrocardiograms, Holter recordings, imaging and electrophysiological studies, pathology reports, etc.). Outcome data include (non-)sustained ventricular and atrial arrhythmias, heart failure, and (cardiac) death. Data are collected on a research electronic data capture (REDCap) platform in which every participating centre has its own restricted data access group, thus empowering local studies while facilitating data sharing. DISCUSSION: The Netherlands ACM Registry is a national observational cohort study of ACM patients and relatives. Prospective and retrospective data are obtained at multiple time points, enabling both cross-sectional and longitudinal research in a hypothesis-generating approach that extends beyond one specific research question. In so doing, this registry aims to (1) increase the scientific knowledge base on disease mechanisms, genetics, and novel diagnostic and treatment strategies of ACM; and (2) provide education for physicians and patients concerning ACM, e. g. through our website ( www.acmregistry.nl ) and patient conferences

Information-bit error rate and false positives in an MDS code

In this paper, a refinement of the weight distribution in an MDS code is computed. Concretely, the number of codewords with a fixed amount of nonzero bits in both information and redundancy parts is obtained. This refinement improves the theoretical approximation of the information-bit and -symbol error rate, in terms of the channel bit-error rate, in a block transmission through a discrete memoryless channel. Since a bounded distance reproducing encoder is assumed, the computation of the here-called false positive (a decoding failure with no information-symbol error) is provided. As a consequence, a new performance analysis of an MDS code is proposed

Classic McEliece Implementation with Low Memory Footprint

The Classic McEliece cryptosystem is one of the most trusted quantum-resistant cryptographic schemes. Deploying it in practical applications, however, is challenging due to the size of its public key. In this work, we bridge this gap. We present an implementation of Classic McEliece on an ARM Cortex-M4 processor, optimized to overcome memory constraints. To this end, we present an algorithm to retrieve the public key ad-hoc. This reduces memory and storage requirements and enables the generation of larger key pairs on the device. To further improve the implementation, we perform the public key operation by streaming the key to avoid storing it as a whole. This additionally reduces the risk of denial of service attacks. Finally, we use these results to implement and run TLS on the embedded device

Faster Algorithms for Solving LPN

The LPN problem, lying at the core of many cryptographic constructions for lightweight and post-quantum cryptography, receives quite a lot attention recently. The best published algorithm for solving it at Asiacrypt 2014 improved the classical BKW algorithm by using covering codes, which claimed to marginally compromise the $80$-bit security of HB variants, LPN-C and Lapin. In this paper, we develop faster algorithms for solving LPN based on an optimal precise embedding of cascaded concrete perfect codes, in a similar framework but with many optimizations. Our algorithm outperforms the previous methods for the proposed parameter choices and distinctly break the 80-bit security bound of the instances suggested in cryptographic schemes like HB$^+$, HB$^\#$, LPN-C and Lapin

HIV-1 Vpr mediates the depletion of the cellular repressor CTIP2 to counteract viral gene silencing

Mammals have evolved many antiviral factors impacting different steps of the viral life cycle. Associated with chromatin-modifying enzymes, the cellular cofactor CTIP2 contributes to HIV-1 gene silencing in latently infected reservoirs that constitute the major block toward an HIV cure. We report, for the first time, that the virus has developed a strategy to overcome this major transcriptional block. Productive HIV-1 infection results in a Vpr-mediated depletion of CTIP2 in microglial cells and CD4+ T cells, two of the major viral reservoirs. Associated to the Cul4A-DDB1-DCAF1 ubiquitin ligase complex, Vpr promotes CTIP2 degradation via the proteasome pathway in the nuclei of target cells and notably at the latent HIV-1 promoter. Importantly, Vpr targets CTIP2 associated with heterochromatin-promoting enzymes dedicated to HIV-1 gene silencing. Thereby, Vpr reactivates HIV-1 expression in a microglial model of HIV-1 latency. Altogether our results suggest that HIV-1 Vpr mediates the depletion of the cellular repressor CTIP2 to counteract viral gene silencing.SCOPUS: ar.jinfo:eu-repo/semantics/publishe