We revisit the problem of privacy-preserving range search and sort queries on encrypted data in the face of an untrusted data store. Our new protocol RASP has several advantages over existing work. First, RASP strengthens privacy by ensuring forward security: after a query for range [a,b], any new record added to the data store is indistinguishable from random, even if the new record falls with...

Recursive partitioning methods from machine learning are being widely applied in many scientific fields such as, e.g., genetics and bioinformatics. The present work is concerned with the two main problems that arise in recursive partitioning, instability and biased variable selection, from a statistical point of view. With respect to the first issue, instability, the entire scope of methods fro...

Abstract. We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a single key. Each key has k ≥ 3 (distinct) associated buckets chosen uniformly at random and independently of the choices of other keys. A hash table can be constructed successfully if each key can be placed in...

We settle the question of tight thresholds for o ine cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a single key. Each key has k ≥ 3 (distinct) associated buckets chosen uniformly at random and independently of the choices of other keys. A hash table can be constructed successfully if each key can be placed into one of it...

Formal reasoning about hashing-based probabilistic data structures often requires random variables where when one variable gets larger (such as the number of elements hashed into bucket), others tend to be smaller (like other buckets). This is an example negative dependence , a generalization independence that has recently found interesting applications in algorithm design and machine learning....

A linear time heuristic for improving network partitions. 10] A. G. Hooman. The dynamic locking heuristic { a new graph partitioning algorithm. In Proc. 14 Krishnamurthy gain vector; this reopens the question of interpreting such seminal works in the literature as 16] and 13], whose studies used random bucket selection. Organizing the gain buckets as LIFO (Last-In-First-Out) stacks leads to a 3...

This project tries to understand American Graduate Admissions process by specifically analyzing MS Computer Science application over past 5 years. Edulix has been used as data source. After extensive data cleaning, I have tried to model admissions data based on patterns extracted from data and domain knowledge. The key to analyzing Graduate Admissions data is to analyze data in buckets rather t...

Farm youth often carry loads that are proportionally large and/or heavy, and field measurements have determined that these tasks are equivalent to industrial jobs with high injury risks. The purpose of this study was to determine the effects of age, load amount, and load symmetry on lower extremity joint moments during carrying tasks. Three age groups (8-10 years, 12-14 years, adults), three lo...

This paper proposes a novel feedback-based control technique that tackles distributed denial of service (DDoS) attacks in four consecutive phases. While protection routers close to the server control inbound traffic rate and keeps the server alive (phase 1), the server negotiate with upstream routers close to traffic sources to install leaky-buckets for its IP address. The negotiation continues...

difference aspects of multinomial statistical modelings and its classifications has been studied so far. in these type of problems y is the qualitative random variable with t possible states which are considered as classifications. the goal is prediction of y based on a random vector x ? ir^m. many methods for analyzing these problems were considered. one of the modern and general method of cla...