Confirmation Sampling for Exact Nearest Neighbor Search

Locality-sensitive hashing (LSH), introduced by Indyk and Motwani in STOC ’98, has been an extremely influential framework for nearest neighbor search in high-dimensional data sets. While theoretical work has focused on the approximate nearest neighbor problem, in practice LSH data structures with suitably chosen parameters are used to solve the exact nearest neighbor problem (with some error probability). Sublinear query time is often possible in practice even for exact nearest neighbor search, intuitively because the nearest neighbor tends to be significantly closer than other data points. However, theory offers little advice on how to choose LSH parameters outside of pre-specified worst-case settings. We introduce the technique of confirmation sampling for solving the exact nearest neighbor problem using LSH. First, we give a general reduction that transforms a sequence of data structures that each find the nearest neighbor with a small, unknown probability, into a data structure that returns the nearest neighbor with probability 1−δ , using as few queries as possible. Second, we present a new query algorithm for the LSH Forest data structure with L trees that is able to return the exact nearest neighbor of a query point within the same time bound as an LSH Forest of Ω(L) trees with internal parameters specifically tuned to the query and data

Accurate and Fast Retrieval for Complex Non-metric Data via Neighborhood Graphs

We demonstrate that a graph-based search algorithm-relying on the construction of an approximate neighborhood graph-can directly work with challenging non-metric and/or non-symmetric distances without resorting to metric-space mapping and/or distance symmetrization, which, in turn, lead to substantial performance degradation. Although the straightforward metrization and symmetrization is usually ineffective, we find that constructing an index using a modified, e.g., symmetrized, distance can improve performance. This observation paves a way to a new line of research of designing index-specific graph-construction distance functions

The Randomized Slicer for CVPP: Sharper, Faster, Smaller, Batchier

Following the recent line of work on solving the closest vector problem with preprocessing (CVPP) using approximate Voronoi cells, we improve upon previous results in the following ways:-We derive sharp asymptotic bounds on the success probability of the randomized slicer, by modelling the behaviour of the algorithm as a random walk on the coset of the lattice of the target vector. We thereby solve the open question left by Doulgerakis\xe2\x80\x93Laarhoven\xe2\x80\x93De Weger [PQCrypto 2019] and Laarhoven\xc2\xa0[MathCrypt 2019].-We obtain better trade-offs for CVPP and its generalisations (strictly, in certain regimes), both with and without nearest neighbour searching, as a direct result of the above sharp bounds on the success probabilities.-We show how to reduce the memory requirement of the slicer, and in particular the corresponding nearest neighbour data structures, using ideas similar to those proposed by Becker\xe2\x80\x93Gama\xe2\x80\x93Joux [Cryptology ePrint Archive, 2015]. Using 20.185d+o(d)memory, we can solve a single CVPP instance in 20.264d+o(d)time.-We further improve on the per-instance time complexities in certain memory regimes, when we are given a sufficiently large batch of CVPP problem instances for the same lattice. Using memory, we can heuristically solve CVPP instances in amortized time, for batches of size at least.Our random walk model for analysing arbitrary-step transition probabilities in complex step-wise algorithms may be of independent interest, both for deriving analytic bounds through convexity arguments, and for computing optimal paths numerically with a shortest path algorithm. As a side result we apply the same random walk model to graph-based nearest neighbour searching, where we improve upon results of Laarhoven [SOCG 2018] by deriving sharp bounds on the success probability of the corresponding greedy search procedure

Morphological evidences indicate that the interference of cimetidine on the peritubular components is responsible for detachment and apoptosis of Sertoli cells

Cimetidine, referred as antiandrogenic agent, has caused alterations in the seminiferous tubules, including alterations in the peritubular tissue and death of myoid cells by apoptosis. Regarding the structural and functional importance of the peritubular tissue for the maintenance of Sertoli cells (SC), we purpose to investigate the SC-basement membrane interface, focusing the morphological features of SC and their interaction with the basement membrane in the affected tubules by cimetidine. Ten animals were distributed into two groups, control (CG) and cimetidine (CmG) which received saline solution and 50 mg of cimetidine per kg of body weight, respectively, for 52 days. The testes were fixed, dehydrated and embedded for analyses under light and transmission electron microscopy. Paraffin sections were submitted to the TUNEL method; sections of testes embedded in glycol methacrylate were submitted to PAS method and stained by H&E for morphological and quantitative analyses of Sertoli Cells. In the CmG, the SC nuclei were positive to the TUNEL method and showed typical morphological alterations of cell death by apoptosis (from early to advanced stages). A significant reduction in the number of Sertoli Cells was probably due to death of these cells by apoptosis. A close relationship between SC nuclear alterations (including a high frequency of dislocated nuclei from the basal portion) and damage in the peritubular tissue was observed. The ultrastructural analysis showed a parallelism between the gradual advancement of apoptotic process in SC and detachment of the anchoring sites (hemidesmosomes) of SC plasma membrane from the lamina densa. The presence of portions of lamina densa underlying the detached hemidesmosomes indicates a continuous deposition of lamina densa, resulting in the thickening of the basal lamina. The results indicate a possible disarrangement of the SC cytoskeleton, including the focal adhesion structure. These alterations are related to SC apoptosis and probably result from disturbs induced by cimetidine on the peritubular tissue

Cryptanalysis of GlobalPlatform Secure Channel Protocols

GlobalPlatform (GP) card specifications are the de facto standards for the industry of smart cards. Being highly sensitive, GP specifications were defined regarding stringent security requirements. In this paper, we analyze the cryptographic core of these requirements; i.e. the family of Secure Channel Protocols (SCP). Our main results are twofold. First, we demonstrate a theoretical attack against SCP02, which is the most popular protocol in the SCP family. We discuss the scope of our attack by presenting an actual scenario in which a malicious entity can exploit it in order to recover encrypted messages. Second, we investigate the security of SCP03 that was introduced as an amendment in 2009. We find that it provably satisfies strong notions of security. Of particular interest, we prove that SCP03 withstands algorithm substitution attacks (ASAs) defined by Bellare et al. that may lead to secret mass surveillance. Our findings highlight the great value of the paradigm of provable security for standards and certification, since unlike extensive evaluation, it formally guarantees the absence of security flaws

Reticular synthesis and the design of new materials

The long-standing challenge of designing and constructing new crystalline solid-state materials from molecular building blocks is just beginning to be addressed with success. A conceptual approach that requires the use of secondary building units to direct the assembly of ordered frameworks epitomizes this process: we call this approach reticular synthesis. This chemistry has yielded materials designed to have predetermined structures, compositions and properties. In particular, highly porous frameworks held together by strong metal-oxygen-carbon bonds and with exceptionally large surface area and capacity for gas storage have been prepared and their pore metrics systematically varied and functionalized.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/62718/1/nature01650.pd

The LifeCycle Project-EU Child Cohort Network : a federated analysis infrastructure and harmonized data of more than 250,000 children and parents

Early life is an important window of opportunity to improve health across the full lifecycle. An accumulating body of evidence suggests that exposure to adverse stressors during early life leads to developmental adaptations, which subsequently affect disease risk in later life. Also, geographical, socio-economic, and ethnic differences are related to health inequalities from early life onwards. To address these important public health challenges, many European pregnancy and childhood cohorts have been established over the last 30 years. The enormous wealth of data of these cohorts has led to important new biological insights and important impact for health from early life onwards. The impact of these cohorts and their data could be further increased by combining data from different cohorts. Combining data will lead to the possibility of identifying smaller effect estimates, and the opportunity to better identify risk groups and risk factors leading to disease across the lifecycle across countries. Also, it enables research on better causal understanding and modelling of life course health trajectories. The EU Child Cohort Network, established by the Horizon2020-funded LifeCycle Project, brings together nineteen pregnancy and childhood cohorts, together including more than 250,000 children and their parents. A large set of variables has been harmonised and standardized across these cohorts. The harmonized data are kept within each institution and can be accessed by external researchers through a shared federated data analysis platform using the R-based platform DataSHIELD, which takes relevant national and international data regulations into account. The EU Child Cohort Network has an open character. All protocols for data harmonization and setting up the data analysis platform are available online. The EU Child Cohort Network creates great opportunities for researchers to use data from different cohorts, during and beyond the LifeCycle Project duration. It also provides a novel model for collaborative research in large research infrastructures with individual-level data. The LifeCycle Project will translate results from research using the EU Child Cohort Network into recommendations for targeted prevention strategies to improve health trajectories for current and future generations by optimizing their earliest phases of life.Peer reviewe

Cation-Dependent Intrinsic Electrical Conductivity in Isostructural Tetrathiafulvalene-Based Microporous Metal-Organic Frameworks

Isostructural metal–organic frameworks (MOFs) M[subscript 2](TTFTB) (M = Mn, Co, Zn, and Cd; H[subscript 4]TTFTB = tetrathiafulvalene tetrabenzoate) exhibit a striking correlation between their single-crystal conductivities and the shortest S···S interaction defined by neighboring TTF cores, which inversely correlates with the ionic radius of the metal ions. The larger cations cause a pinching of the S···S contact, which is responsible for better orbital overlap between pz orbitals on neighboring S and C atoms. Density functional theory calculations show that these orbitals are critically involved in the valence band of these materials, such that modulation of the S···S distance has an important effect on band dispersion and, implicitly, on the conductivity. The Cd analogue, with the largest cation and shortest S···S contact, shows the largest electrical conductivity, σ = 2.86 (±0.53) × 10[subscript –4] S/cm, which is also among the highest in microporous MOFs. These results describe the first demonstration of tunable intrinsic electrical conductivity in this class of materials and serve as a blueprint for controlling charge transport in MOFs with π-stacked motifs.United States. Department of Energy. Office of Basic Energy Sciences (Award DE-SC0006937)National Science Foundation (U.S.). Graduate Research Fellowship Program (Award 1122374)David & Lucile Packard Foundation (Fellowship

cohesion and conflict in transnational merchant families

How do people negotiate the diversity of positionalities within kin groups? Through a diachronic approach, I investigate how Ali and Jalal, two merchants with Azeri and Gilaki ethnic identifications who came to Hamburg in the 1930s, mobilized kin to generate capital along the lines of generation, gender, and age. The reader simultaneously learns about the local history of Iranian immigration. Building on literature about historical merchant networks, the social organization of the Iranian marketplace (bazaar), the anthropology of kinship and transnational families, I question the social cohesion on which Aihwa Ong's study of flexible capital creation relies. The material suggests that the experience of family relations influences agents' positioning in the local Iranian social field