Beyond Hellman\u27s Time-Memory Trade-Offs with Applications to Proofs of Space

Proofs of space (PoS) were suggested as more ecological and economical alternative to proofs of work, which are currently used in blockchain designs like Bitcoin. The existing PoS are based on rather sophisticated graph pebbling lower bounds. Much simpler and in several aspects more efficient schemes based on inverting random functions have been suggested, but they don\u27t give meaningful security guarantees due to existing time-memory trade-offs. In particular, Hellman showed that any permutation over a domain of size $N$ can be inverted in time $T$ by an algorithm that is given $S$ bits of auxiliary information whenever $S\cdot T \approx N$ (e.g. $S=T\approx N^{1/2}$). For functions Hellman gives a weaker attack with $S^2\cdot T\approx N^2$ (e.g., $S=T \approx N^{2/3}$). To prove lower bounds, one considers an adversary who has access to an oracle $f:[N]\rightarrow [N]$ and can make $T$ oracle queries. The best known lower bound is $S\cdot T\in \Omega(N)$ and holds for random functions and permutations. We construct functions that provably require more time and/or space to invert. Specifically, for any constant $k$ we construct a function $[N]\rightarrow [N]$ that cannot be inverted unless $S^k\cdot T \in \Omega(N^k)$ (in particular, $S=T\approx N^{k/(k+1)}$). Our construction does not contradict Hellman\u27s time-memory trade-off, because it cannot be efficiently evaluated in forward direction. However, its entire function table can be computed in time quasilinear in $N$, which is sufficient for the PoS application. Our simplest construction is built from a random function oracle $g:[N]\times[N]\rightarrow [N]$ and a random permutation oracle $f:[N]\rightarrow [N]$ and is defined as $h(x)=g(x,x\u27)$ where $f(x)=\pi(f(x\u27))$ with $\pi$ being any involution without a fixed point, e.g. flipping all the bits. For this function we prove that any adversary who gets $S$ bits of auxiliary information, makes at most $T$ oracle queries, and inverts $h$ on an $\epsilon$ fraction of outputs must satisfy $S^2\cdot T\in \Omega(\epsilon^2N^2)$

Revisiting with Chandra the Scaling Relations of the X-ray Emission Components (Binaries, Nuclei and Hot Gas) of Early Type Galaxies

We have selected a sample of 30 normal (non-cD) early type galaxies, for all of which optical spectroscopy is available, and which have been observed with Chandra to a depth such to insure the detection of bright low-mass X-ray binaries (LMXBs) with Lx>1e38 erg/s. This sample includes a larger fraction of gas-poor galaxies than previously studied samples, and covers a wide range of stellar luminosity, velocity dispersion, GC specific frequency, and stellar age. We derive X-ray luminosities (or upper limits) from the different significant X-ray components of these galaxies: nuclei, detected and undetected LMXBs, coronally active binaries (ABs), cataclysmic variables (CVs), and hot gas. The ABs and CVs contribution is estimated from the Lx-LK scaling relation of M31 and M32. The contribution of undetected LMXBs is estimated both by fitting the spectra of the unresolved X-ray emission and by extrapolating the LMXB X-ray luminosity function. The results for the nuclei are consistent with those discussed by Pellegrini (2010). We derive a revised scaling relation between the integrated X-ray luminosity of LMXBs in a galaxy and the LK luminosity of the host galaxy: Lx(LMXB)/LK ~ 1e29 erg s-1 LK-1 with 50% 1sigma rms; moreover, we also obtain a tighter LX(LMXB)/LK - SN relation than previously published. We revisit the relations between hot gas content and other galaxy parameters. finding a steeper LX(gas)-LK relation with larger scatter than reported in the literature. We find a positive correlation between the luminosity and temperature of the hot ISM, significantly tighter than reported by earlier studies.[abridged

Open peer-to-peer systems over blockchain and ipfs: An agent oriented framework

In recent years, the increasing concerns around the centralized cloud web services (e.g. privacy, governance, surveillance, security) have triggered the emergence of new distributed technologies, such as IPFS or the Blockchain. These innovations have tackled technical challenges that were unresolved until their appearance. Existing models of peer-to-peer systems need a revision to cover the spectrum of potential systems that can be now implemented as peer-to-peer systems. This work presents a framework to build these systems. It uses an agent-oriented approach in an open environment where agents have only partial information of the system data. The proposal covers data access, data discovery and data trust in peer-to-peer systems where different actors may interact. Moreover, the framework proposes a distributed architecture for these open systems, and provides guidelines to decide in which cases Blockchain technology may be required, or when other technologies may be sufficient

Using the Autism-Spectrum Quotient to Discriminate Autism Spectrum Disorder from ADHD in Adult Patients With and Without Comorbid Substance Use Disorder

It is unknown whether the Autism-spectrum quotient (AQ) can discriminate between Autism Spectrum Disorder (ASD) and Attention Deficit and Hyperactivity Disorder (ADHD) with or without comorbid Substance Use Disorder (SUD). ANOVA’s were used to analyse the mean AQ (sub)scores of 129 adults with ASD or ADHD. We applied receiver operating characteristic (ROC) computations to assess discriminant power. All but one of the mean AQ (sub)scores were significantly higher for adults with ASD compared to those with ADHD. The SUD status in general was not significantly associated with AQ (sub)scores. On the Social Skills subscale patients with ASD and comorbid SUD showed less impairment than those without SUD. The cut-off score 26 yielded 73% correct classifications. The clinical use of the AQ in differentiating between ASD and ADHD is limited

National laboratory-based surveillance system for antimicrobial resistance: a successful tool to support the control of antimicrobial resistance in the Netherlands

An important cornerstone in the control of antimicrobial resistance (AMR) is a well-designed quantitative system for the surveillance of spread and temporal trends in AMR. Since 2008, the Dutch national AMR surveillance system, based on routine data from medical microbiological laboratories (MMLs), has developed into a successful tool to support the control of AMR in the Netherlands. It provides background information for policy making in public health and healthcare services, supports development of empirical antibiotic therapy guidelines and facilitates in-depth research. In addition, participation of the MMLs in the national AMR surveillance network has contributed to sharing of knowledge and quality improvement. A future improvement will be the implementation of a new semantic standard together with standardised data transfer, which will reduce errors in data handling and enable a more real-time surveillance. Furthermore, the

Molecular characteristics of carbapenemase-producing Enterobacterales in the Netherlands; results of the 2014–2018 national laboratory surveillance

Objectives: Carbapenem resistance mediated by mobile genetic elements has emerged worldwide and has become a major public health threat. To gain insight into the molecular epidemiology of carbapenem resistance in The Netherlands, Dutch medical microbiology laboratories are requested to submit suspected carbapenemase-producing Enterobacterales (CPE) to the National Institute for Public Health and the Environment as part of a national surveillance system. Methods: Meropenem MICs and species identification were confirmed by E-test and MALDI-TOF and carbapenemase production was assessed by the Carbapenem Inactivation Method. Of all submitted CPE, one species/carbapenemase gene combination per person per year was subjected to next-generation sequencing (NGS). Results: In total, 1838 unique isolates were received between 2014 and 2018, of which 892 were unique CPE isolates with NGS data available. The predominant CPE species were Klebsiella pneumoniae (n = 388, 43%), Escherichia coli (n = 264, 30%) and Enterobacter cloacae complex (n = 116, 13%). Various carbapenemase alleles of the same carbapenemase gene resulted in different susceptibilities to meropenem and this effect varied between species. Analyses of NGS data showed variation of prevalence of carbapenemase alleles over time with blaOXA-48 being predominant (38%, 336/892), followed by blaNDM-1 (16%, 145/892). For the first time in the Netherlands, blaOXA-181, blaOXA-232 and blaVIM-4 were detected. The genetic background of K. pneumoniae and E. coli isolates was highly diverse. Conclusions: The CPE population in the Netherlands is diverse, suggesting multiple introductions. The predominant carbapenemase alleles are blaOXA-48 and blaNDM-1. There was a clear association between species, carbapenemase allele and susceptibility to meropenem

The Liver Tumor Segmentation Benchmark (LiTS)

In this work, we report the set-up and results of the Liver Tumor Segmentation Benchmark (LITS) organized in conjunction with the IEEE International Symposium on Biomedical Imaging (ISBI) 2016 and International Conference On Medical Image Computing Computer Assisted Intervention (MICCAI) 2017. Twenty four valid state-of-the-art liver and liver tumor segmentation algorithms were applied to a set of 131 computed tomography (CT) volumes with different types of tumor contrast levels (hyper-/hypo-intense), abnormalities in tissues (metastasectomie) size and varying amount of lesions. The submitted algorithms have been tested on 70 undisclosed volumes. The dataset is created in collaboration with seven hospitals and research institutions and manually reviewed by independent three radiologists. We found that not a single algorithm performed best for liver and tumors. The best liver segmentation algorithm achieved a Dice score of 0.96(MICCAI) whereas for tumor segmentation the best algorithm evaluated at 0.67(ISBI) and 0.70(MICCAI). The LITS image data and manual annotations continue to be publicly available through an online evaluation system as an ongoing benchmarking resource.Comment: conferenc