Patents by Inventor Haim Kaplan
Haim Kaplan has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9779142Abstract: Methods and systems for estimate derivation are described. In one embodiment, a query may be received with a predicate for sets over a collection of items. Associated samples associated with the query may be accessed. Items of an associated sample may be accessed from the collection of items. A determination of whether the predicate is an attribute-based selection from a union of at least some sets may be made. Available items of the particular associated sample may be selected from the items. Identified items may be identified among the available items in the associated sample that satisfy the predicate. An adjusted weight may be assigned to an item based on a weight of the item and a distribution of the associated samples. An estimate may be generated based on the adjusted weight of the identified items of the associated samples that satisfy the predicate. Additional methods and systems are disclosed.Type: GrantFiled: April 30, 2014Date of Patent: October 3, 2017Assignee: AT&T Intellectual Property I, L.P.Inventors: Edith Cohen, Haim Kaplan
-
Publication number: 20140236966Abstract: Methods and systems for estimate derivation are described. In one embodiment, a query may be received with a predicate for sets over a collection of items. Associated samples associated with the query may be accessed. Items of an associated sample may be accessed from the collection of items. A determination of whether the predicate is an attribute-based selection from a union of at least some sets may be made. Available items of the particular associated sample may be selected from the items. Identified items may be identified among the available items in the associated sample that satisfy the predicate. An adjusted weight may be assigned to an item based on a weight of the item and a distribution of the associated samples. An estimate may be generated based on the adjusted weight of the identified items of the associated samples that satisfy the predicate. Additional methods and systems are disclosed.Type: ApplicationFiled: April 30, 2014Publication date: August 21, 2014Inventors: Edith Cohen, Haim Kaplan
-
Patent number: 8738618Abstract: Methods and systems for estimate derivation are described. In one embodiment, a query may be received with a predicate for sets over a collection of items. Associated samples associated with the query may be accessed. Items of an associated sample may be accessed from the collection of items. A determination of whether the predicate is an attribute-based selection from a union of at least some sets may be made. Available items of the particular associated sample may be selected from the items. Identified items may be identified among the available items in the associated sample that satisfy the predicate. An adjusted weight may be assigned to an item based on a weight of the item and a distribution of the associated samples. An estimate may be generated based on the adjusted weight of the identified items of the associated samples that satisfy the predicate. Additional methods and systems are disclosed.Type: GrantFiled: December 12, 2008Date of Patent: May 27, 2014Assignee: AT&T Intellectual Property I, L.P.Inventors: Edith Cohen, Haim Kaplan
-
Patent number: 8706737Abstract: A method and apparatus for processing top-k queries are disclosed. For example, the method receives a top-k query with a value for a number of samples and a value of a confidence parameter. The method samples in accordance to the number of samples, and determines a top-k weight of a sample top-k set. The method bounds the top-k weight in an interval having an upper bound and a lower bound such that the top-k weight is in the interval with a probability equal to one minus the value of the confidence parameter, and provides a response to the top-k query in accordance with the upper and lower bounds.Type: GrantFiled: December 31, 2008Date of Patent: April 22, 2014Assignee: AT&T Intellectual Property I, L.P.Inventors: Edith Cohen, Nadav Grossaug, Haim Kaplan
-
Patent number: 8195710Abstract: A method for producing a summary A of data points in an unaggregated data stream wherein the data points are in the form of weighted keys (a, w) where a is a key and w is a weight, and the summary is a sample of k keys a with adjusted weights wa. A first reservoir L includes keys having adjusted weights which are additions of weights of individual data points of included keys and a second reservoir T includes keys having adjusted weights which are each equal to a threshold value ? whose value is adjusted based upon tests of new data points arriving in the data stream. The summary combines the keys and adjusted weights of the first reservoir L with the keys and adjusted weights of the second reservoir T to form the sample representing the data stream upon which further analysis may be performed.Type: GrantFiled: December 18, 2009Date of Patent: June 5, 2012Assignee: AT&T Intellectual Property I, L.P.Inventors: Edith Cohen, Nicholas Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
-
Patent number: 8166047Abstract: Certain exemplary embodiments can provide a method, which can comprise automatically storing and computing a sketch of a dataset that supports an automatically determined estimator of properties of a dataset. The dataset can be related to any population. For example, the dataset can comprise data flows through a network node (e.g., a router), sales data, and/or marketing data, etc. The estimator can be based upon a sketch of the dataset.Type: GrantFiled: August 6, 2008Date of Patent: April 24, 2012Assignee: AT&T Intellectual Property I, L.P.Inventors: Edith Cohen, Haim Kaplan
-
Patent number: 8140539Abstract: Certain exemplary embodiments can provide a method, which can comprise automatically storing a sketch of a dataset that supports automatic determination of an estimator of properties of a dataset. The automatic determination can be based upon computed adjusted weights to the items included in a sketch of the dataset. The adjusted weights can be used to compute estimates on the weight of any subpopulation of the items in the dataset that is specified using a selection predicate. We propose the rank conditioning, the subset conditioning, and/or a Markov-chain based method to compute these adjusted weights. We also provide a method that provides upper and lower confidence bounds on the size of a subpopulation.Type: GrantFiled: August 6, 2008Date of Patent: March 20, 2012Assignee: AT&T Intellectual Property I, L.P.Inventors: Edith Cohen, Haim Kaplan
-
Patent number: 8005949Abstract: The present invention relates to a method of obtaining a generic sample of an input stream. The method is designated as VAROPTk. The method comprises receiving an input stream of items arriving one at a time, and maintaining a sample S of items i. The sample S has a capacity for at most k items i. The sample S is filled with k items i. An nth item i is received. It is determined whether the nth item i should be included in sample S. If the nth item i is included in sample S, then a previously included item i is dropped from sample S. The determination is made based on weights of items without distinguishing between previously included items i and the nth item i. The determination is implemented thereby updating weights of items i in sample S. The method is repeated until no more items are received.Type: GrantFiled: December 1, 2008Date of Patent: August 23, 2011Assignee: AT&T Intellectual Property I, LPInventors: Nicholas Duffield, Carsten Lund, Mikkel Thorup, Edith Cohen, Haim Kaplan
-
Publication number: 20110153554Abstract: A method for producing a summary A of data points in an unaggregated data stream wherein the data points are in the form of weighted keys (a, w) where a is a key and w is a weight, and the summary is a sample of k keys a with adjusted weights wa. A first reservoir L includes keys having adjusted weights which are additions of weights of individual data points of included keys and a second reservoir T includes keys having adjusted weights which are each equal to a threshold value ? whose value is adjusted based upon tests of new data points arriving in the data stream. The summary combines the keys and adjusted weights of the first reservoir L with the keys and adjusted weights of the second reservoir T to form the sample representing the data stream upon which further analysis may be performed.Type: ApplicationFiled: December 18, 2009Publication date: June 23, 2011Inventors: Edith Cohen, Nicholas Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
-
Patent number: 7774734Abstract: An algorithm referred to as REAL for the point-to-point shortest path problem combines A* search with landmark-based lower bounds and reach-based pruning. A symbiosis of these techniques is described, which gives a range of time and space tradeoffs, including those that improve both of these complexity measures. Locality is improved and exact reach computation is described.Type: GrantFiled: November 6, 2006Date of Patent: August 10, 2010Assignee: Microsoft CorporationInventors: Andrew V. Goldberg, Renato F. Werneck, Haim Kaplan
-
Patent number: 7764625Abstract: The invention relates to streaming algorithms useful for obtaining summaries over unaggregated packet streams and for providing unbiased estimators for characteristics, such as, the amount of traffic that belongs to a specified subpopulation of flows. Packets are sampled from a packet stream and aggregated into flows and counted by implementation of: (a) Adaptive Sampled NetFlow (ANF), and adjusted weight (AANF) of a flow (f) is calculated as follows: AANF(f)=i(f)/p?; i(f) being the number of packets counted for a flow f, and p? being the sampling rate at end of a measurement period; or (b) Adaptive Sample-and-Hold (ASH), and adjusted weight (AASH) of a flow (f) is calculated as follows: AASH(f)=i(f)+(1?p?)/p?; i(f) being the number of packets counted for a flow f, and p? being the sampling rate at end of a measurement period.Type: GrantFiled: June 10, 2008Date of Patent: July 27, 2010Assignee: AT&T Intellectual Property I, L.P.Inventors: Nicholas Duffield, Edith Cohen, Haim Kaplan, Carsten Lund, Mikkel Thorup
-
Publication number: 20100169360Abstract: A method and apparatus for processing top-k queries are disclosed. For example, the method receives a top-k query with a value for a number of samples and a value of a confidence parameter. The method samples in accordance to the number of samples, and determines a top-k weight of a sample top-k set. The method bounds the top-k weight in an interval having an upper bound and a lower bound such that the top-k weight is in the interval with a probability equal to one minus the value of the confidence parameter, and provides a response to the top-k query in accordance with the upper and lower bounds.Type: ApplicationFiled: December 31, 2008Publication date: July 1, 2010Inventors: Edith Cohen, Nadav Grossaug, Haim Kaplan
-
Patent number: 7746808Abstract: The invention relates to streaming algorithms useful for obtaining summaries over unaggregated packet streams and for providing unbiased estimators for characteristics, such as, the amount of traffic that belongs to a specified subpopulation of flows. Packets are sampled from a packet stream and aggregated into flows and counted by implementation of Adaptive Sample-and-Hold (ASH) or Adaptive NetFlow (ANF), adjusting the sampling rate based on a quantity of flows to obtain a sketch having a predetermined size, the sampling rate being adjusted in steps; and transferring the count of aggregated packets from SRAM to DRAM and initializing the count in SRAM following adjustment of the sampling rate.Type: GrantFiled: June 10, 2008Date of Patent: June 29, 2010Assignee: AT&T Intellectual Property II, L.P.Inventors: Nicholas Duffield, Edith Cohen, Haim Kaplan, Carsten Lund, Mikkel Thorup
-
Publication number: 20100153387Abstract: Methods and systems for estimate derivation are described. In one embodiment, a query may be received with a predicate for sets over a collection of items. Associated samples associated with the query may be accessed. Items of an associated sample may be accessed from the collection of items. A determination of whether the predicate is an attribute-based selection from a union of at least some sets may be made. Available items of the particular associated sample may be selected from the items. Identified items may be identified among the available items in the associated sample that satisfy the predicate. An adjusted weight may be assigned to an item based on a weight of the item and a distribution of the associated samples. An estimate may be generated based on the adjusted weight of the identified items of the associated samples that satisfy the predicate. Additional methods and systems are disclosed.Type: ApplicationFiled: December 12, 2008Publication date: June 17, 2010Applicant: AT&T Intellectual Property I, L.P.Inventors: Edith Cohen, Haim Kaplan
-
Publication number: 20100138529Abstract: The present invention relates to a method of obtaining a generic sample of an input stream. The method is designated as VAROPTk. The method comprises receiving an input stream of items arriving one at a time, and maintaining a sample S of items i. The sample S has a capacity for at most k items i. The sample S is filled with k items i. An nth item i is received. It is determined whether the nth item i should be included in sample S. If the nth item i is included in sample S, then a previously included item i is dropped from sample S. The determination is made based on weights of items without distinguishing between previously included items i and the nth item i. The determination is implemented thereby updating weights of items i in sample S. The method is repeated until no more items are received.Type: ApplicationFiled: December 1, 2008Publication date: June 3, 2010Applicant: AT&T INTELLECTUAL PROPERTY I, LPInventors: Nicholas Duffield, Carsten Lund, Mikkel Thorup, Edith Cohen, Haim Kaplan
-
Publication number: 20090303901Abstract: The invention relates to streaming algorithms useful for obtaining summaries over unaggregated packet streams and for providing unbiased estimators for characteristics, such as, the amount of traffic that belongs to a specified subpopulation of flows. Packets are sampled from a packet stream and aggregated into flows and counted by implementation of Adaptive Sample-and-Hold (ASH) or Adaptive NetFlow (ANF), adjusting the sampling rate based on a quantity of flows to obtain a sketch having a predetermined size, the sampling rate being adjusted in steps; and transferring the count of aggregated packets from SRAM to DRAM and initializing the count in SRAM following adjustment of the sampling rate.Type: ApplicationFiled: June 10, 2008Publication date: December 10, 2009Inventors: Nicholas Duffield, Edith Cohen, Haim Kaplan, Carsten Lund, Mikkel Thorup
-
Publication number: 20090303879Abstract: The invention relates to streaming algorithms useful for obtaining summaries over unaggregated packet streams and for providing unbiased estimators for characteristics, such as, the amount of traffic that belongs to a specified subpopulation of flows. Packets are sampled from a packet stream and aggregated into flows and counted by implementation of: (a) Adaptive Sampled NetFlow (ANF), and adjusted weight (AANF) of a flow (f) is calculated as follows: AANF(f)=i(f)/p?; i(f) being the number of packets counted for a flow f, and p? being the sampling rate at end of a measurement period; or (b) Adaptive Sample-and-Hold (ASH), and adjusted weight (AASH) of a flow (f) is calculated as follows: AASH(f)=i(f)+(1?p?)/p?; i(f) being the number of packets counted for a flow f, and p? being the sampling rate at end of a measurement period.Type: ApplicationFiled: June 10, 2008Publication date: December 10, 2009Inventors: Nicholas Duffield, Edith Cohen, Haim Kaplan, Carsten Lund, Mikkel Thorup
-
Publication number: 20080122848Abstract: An algorithm referred to as REAL for the point-to-point shortest path problem combines A* search with landmark-based lower bounds and reach-based pruning. A symbiosis of these techniques is described, which gives a range of time and space tradeoffs, including those that improve both of these complexity measures. Locality is improved and exact reach computation is described.Type: ApplicationFiled: November 6, 2006Publication date: May 29, 2008Applicant: Microsoft CorporationInventors: Andrew V. Goldberg, Renato F. Werneck, Haim Kaplan
-
Publication number: 20070156330Abstract: A graph is selected for preprocessing. Partial shortest path trees are constructed for the vertices of the graph and shortcuts are added to the graph to reduce the reach of certain vertices. The partial trees can be used to divide the arcs into two groups, a high reach group and a low reach group wherein a reach threshold is used to divide the groups. This threshold may be a function of the number of iterations of the preprocessing algorithm performed thus far. Upper bounds on reach of the low reach arcs are computed, and these arcs are deleted from the graph. The preprocessing algorithm is applied iteratively to the remaining arcs in the graph, with the reach threshold changing based on the current iteration. At the end of the preprocessing phase all arc reaches are below the current threshold and are deleted. The graph obtained from the input graph by adding the shortcuts, together with the reach values, may then be used during a query phase to compute shortest paths between two vertices.Type: ApplicationFiled: December 29, 2005Publication date: July 5, 2007Applicant: Microsoft CorporationInventors: Andrew Goldberg, Haim Kaplan, Renato Werneck
-
Patent number: 6606645Abstract: A method is disclosed for reducing user-perceived latency due to the time required to establish a connection to a server in a network. In accordance with the present invention, an open connection is established to a set of servers, there being some probability the user will contact one of the servers in the near future. This is referred to as preconnecting or prefetching the connection. In the context of a Web client-server network, a list of likely servers can be deduced from links on a current Web page a user is looking at or from a more sophisticated analysis of the user's browsing habits. When the user requests a resource from one of the identified servers, the network connection has already been established, thereby reducing latency and improving service quality, especially for higher bandwidth clients for whom the delay is most noticeable.Type: GrantFiled: October 29, 2001Date of Patent: August 12, 2003Assignee: AT&T Corp.Inventors: Edith Cohen, Haim Kaplan, Uri Zwick