scholarly journals Secure k-ish Nearest Neighbors Classifier

2020 ◽  
Vol 2020 (3) ◽  
pp. 42-61
Author(s):  
Hayim Shaul ◽  
Dan Feldman ◽  
Daniela Rus
Keyword(s):  
Breast Tumor ◽  
Communication Complexity ◽  
State Of The Art ◽  
Homomorphic Encryption ◽  
Nearest Neighbors ◽  
Coin Toss ◽  
Running Time ◽  
Current State ◽  
Statistical Distance ◽  
Double Blinded

AbstractThe k-nearest neighbors (kNN) classifier predicts a class of a query, q, by taking the majority class of its k neighbors in an existing (already classified) database, S. In secure kNN, q and S are owned by two different parties and q is classified without sharing data. In this work we present a classifier based on kNN, that is more efficient to implement with homomorphic encryption (HE). The efficiency of our classifier comes from a relaxation we make to consider κ nearest neighbors for κ ≈k with probability that increases as the statistical distance between Gaussian and the distribution of the distances from q to S decreases. We call our classifier k-ish Nearest Neighbors (k-ish NN). For the implementation we introduce double-blinded coin-toss where the bias and output of the toss are encrypted. We use it to approximate the average and variance of the distances from q to S in a scalable circuit whose depth is independent of |S|. We believe these to be of independent interest. We implemented our classifier in an open source library based on HElib and tested it on a breast tumor database. Our classifier has accuracy and running time comparable to current state of the art (non-HE) MPC solution that have better running time but worse communication complexity. It also has communication complexity similar to naive HE implementation that have worse running time.

scholarly journals Faster Motif Counting via Succinct Color Coding and Adaptive Sampling

2021 ◽  
Vol 15 (6) ◽  
pp. 1-27
Author(s):  
Marco Bressan ◽  
Stefano Leucci ◽  
Alessandro Panconesi
Keyword(s):  
Adaptive Sampling ◽  
Relative Frequency ◽  
State Of The Art ◽  
Color Coding ◽  
Input Graph ◽  
Large Graphs ◽  
Running Time ◽  
Uniform Sampling ◽  
Current State ◽  
Connected Subgraphs

We address the problem of computing the distribution of induced connected subgraphs, aka graphlets or motifs , in large graphs. The current state-of-the-art algorithms estimate the motif counts via uniform sampling by leveraging the color coding technique by Alon, Yuster, and Zwick. In this work, we extend the applicability of this approach by introducing a set of algorithmic optimizations and techniques that reduce the running time and space usage of color coding and improve the accuracy of the counts. To this end, we first show how to optimize color coding to efficiently build a compact table of a representative subsample of all graphlets in the input graph. For 8-node motifs, we can build such a table in one hour for a graph with 65M nodes and 1.8B edges, which is times larger than the state of the art. We then introduce a novel adaptive sampling scheme that breaks the “additive error barrier” of uniform sampling, guaranteeing multiplicative approximations instead of just additive ones. This allows us to count not only the most frequent motifs, but also extremely rare ones. For instance, on one graph we accurately count nearly 10.000 distinct 8-node motifs whose relative frequency is so small that uniform sampling would literally take centuries to find them. Our results show that color coding is still the most promising approach to scalable motif counting.

Computing Robust Principal Components by A* Search

2018 ◽  
Vol 27 (07) ◽  
pp. 1860013 ◽  
Author(s):  
Swair Shah ◽  
Baokun He ◽  
Crystal Maung ◽  
Haim Schweitzer
Keyword(s):  
State Of The Art ◽  
Principal Component ◽  
Low Rank ◽  
A Algorithm ◽  
Running Time ◽  
Current State ◽  
Dimensionality Reduction Technique ◽  
Related Variant ◽  
Low Rank Representation ◽  
The Cost

Principal Component Analysis (PCA) is a classical dimensionality reduction technique that computes a low rank representation of the data. Recent studies have shown how to compute this low rank representation from most of the data, excluding a small amount of outlier data. We show how to convert this problem into graph search, and describe an algorithm that solves this problem optimally by applying a variant of the A* algorithm to search for the outliers. The results obtained by our algorithm are optimal in terms of accuracy, and are shown to be more accurate than results obtained by the current state-of-the- art algorithms which are shown not to be optimal. This comes at the cost of running time, which is typically slower than the current state of the art. We also describe a related variant of the A* algorithm that runs much faster than the optimal variant and produces a solution that is guaranteed to be near the optimal. This variant is shown experimentally to be more accurate than the current state-of-the-art and has a comparable running time.

scholarly journals Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures

10.29007/73n4 ◽  
2018 ◽  
Author(s):  
Martin Aigner ◽  
Armin Biere ◽  
Christoph Kirsch ◽  
Aina Niemetz ◽  
Mathias Preiner
Keyword(s):  
Experimental Evaluation ◽  
State Of The Art ◽  
Memory System ◽  
Memory Access ◽  
Sat Solving ◽  
Running Time ◽  
Current State ◽  
The Individual

Effectively parallelizing SAT solving is an open andimportant issue. The current state-of-the-art isbased on parallel portfolios. This technique relieson running multiple solvers on the same instance inparallel. As soon one instance finishes the entirerun stops. Several succesful systems even use plainparallel portfolio (PPP), where the individual solversdo not exchange any information. This paper containsa thorough experimental evaluation which shows that PPPcan improve wall-clock running time because memory accessis still local, respectively the memory system can hidethe latency of memory access. In particular, there doesnot seem as much cache congestion as one might imagine.We also present some limits on the scalibility of PPP.Thus this paper gives one argument why PPP solvers are agood fit for todays multi-core architectures.

Behavioral Genetics: Concepts for Research and Practice in Language Development and Disorders

1995 ◽  
Vol 38 (5) ◽  
pp. 1126-1142 ◽  
Author(s):  
Jeffrey W. Gilger
Keyword(s):  
Language Development ◽  
Behavioral Genetics ◽  
State Of The Art ◽  
Genetic Research ◽  
Great Promise ◽  
Behavioral Genetic ◽  
Fine Grained ◽  
Future Goals ◽  
Current State ◽  
Research Designs

This paper is an introduction to behavioral genetics for researchers and practioners in language development and disorders. The specific aims are to illustrate some essential concepts and to show how behavioral genetic research can be applied to the language sciences. Past genetic research on language-related traits has tended to focus on simple etiology (i.e., the heritability or familiality of language skills). The current state of the art, however, suggests that great promise lies in addressing more complex questions through behavioral genetic paradigms. In terms of future goals it is suggested that: (a) more behavioral genetic work of all types should be done—including replications and expansions of preliminary studies already in print; (b) work should focus on fine-grained, theory-based phenotypes with research designs that can address complex questions in language development; and (c) work in this area should utilize a variety of samples and methods (e.g., twin and family samples, heritability and segregation analyses, linkage and association tests, etc.).

Schizophrenia Research: Current State of the Art

1976 ◽  
Vol 21 (7) ◽  
pp. 497-498
Author(s):  
STANLEY GRAND
Keyword(s):  
State Of The Art ◽  
Current State

Umbral Calculus

10.37236/24 ◽  
2002 ◽  
Vol 1000 ◽  
Author(s):  
A. Di Bucchianico ◽  
D. Loeb
Keyword(s):  
19Th Century ◽  
Finite Differences ◽  
State Of The Art ◽  
Umbral Calculus ◽  
Current State ◽  
Logical Foundation ◽  
Complete Bibliography ◽  
The 19Th Century ◽  
Mathematical Literature

We survey the mathematical literature on umbral calculus (otherwise known as the calculus of finite differences) from its roots in the 19th century (and earlier) as a set of “magic rules” for lowering and raising indices, through its rebirth in the 1970’s as Rota’s school set it on a firm logical foundation using operator methods, to the current state of the art with numerous generalizations and applications. The survey itself is complemented by a fairly complete bibliography (over 500 references) which we expect to update regularly.

The Receptor-Dependent QSAR Paradigm: An Overview of the Current State of the Art

2009 ◽  
Vol 5 (4) ◽  
pp. 359-366 ◽  
Author(s):  
Osvaldo Santos-Filho ◽  
Anton Hopfinger ◽  
Artem Cherkasov ◽  
Ricardo de Alencastro
Keyword(s):  
State Of The Art ◽  
Current State

scholarly journals Smoothing additive manufactured parts using ns-pulsed laser radiation

2021 ◽  
Author(s):  
Florian Kuisat ◽  
Fernando Lasagni ◽  
Andrés Fabián Lasagni
Keyword(s):  
Surface Roughness ◽  
Mechanical Performance ◽  
State Of The Art ◽  
Pulsed Laser ◽  
Industrial Applications ◽  
Laser Source ◽  
Pulsed Laser Radiation ◽  
Current State ◽  
The Impact

AbstractIt is well known that the surface topography of a part can affect its mechanical performance, which is typical in additive manufacturing. In this context, we report about the surface modification of additive manufactured components made of Titanium 64 (Ti64) and Scalmalloy®, using a pulsed laser, with the aim of reducing their surface roughness. In our experiments, a nanosecond-pulsed infrared laser source with variable pulse durations between 8 and 200 ns was applied. The impact of varying a large number of parameters on the surface quality of the smoothed areas was investigated. The results demonstrated a reduction of surface roughness Sa by more than 80% for Titanium 64 and by 65% for Scalmalloy® samples. This allows to extend the applicability of additive manufactured components beyond the current state of the art and break new ground for the application in various industrial applications such as in aerospace.

Sign in / Sign up

Export Citation Format

Share Document