Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Korn, US
David Korn, Boise, ID US
| Patent application number | Description | Published |
|---|---|---|
| 20090195967 | Constructions Comprising Hafnium Oxide And/Or Zirconium Oxide - The invention includes ALD-type methods in which two or more different precursors are utilized with one or more reactants to form a material. In particular aspects, the precursors are hafnium and aluminum, the only reactant is ozone, and the material is hafnium oxide predominantly in a tetragonal crystalline phase. | 08-06-2009 |
David S. Korn, Sunnyvale, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090271374 | SOCIAL NETWORK POWERED QUERY REFINEMENT AND RECOMMENDATIONS - Embodiments of the present invention enhance the search experience of a user by looking at the search history of one or more buddies to provide search enhancements to the user. Examples of search enhancements include an annotation or graphic adjacent to a search result indicating the search result has been visited by one of the user's buddies. In another embodiment, the relevance score assigned to a search result is increased if the search result has been visited by a buddy. In another aspect, alternative queries from the buddies' search history may be suggested to the user during the search session. | 10-29-2009 |
Jeff Korn, Lexington, MA US
| Patent application number | Description | Published |
|---|---|---|
| 20100129027 | Optical Coupler for Rotating Catheter - An optical coupler for coupling to a rotating catheter has a housing with a rotatable distal face and a stationary proximal face. The distal face has an eccentric port and a central port. A lens is disposed inside the housing to intercept a rotating collection beam emerging from the eccentric port and to re-direct the collection beam to a focus proximal to the lens as the collection beam rotates. A beam re-director disposed between the lens and the distal face is oriented to direct a delivery beam toward the central port. | 05-27-2010 |
Naomi S. Korn, Chicago, IL US
| Patent application number | Description | Published |
|---|---|---|
| 20100268184 | Disposable Absorbent Article Designed to Facilitate an Easy Change - A disposable absorbent article to be worn about the lower torso of a wearer that facilitates an easy, intuitive change is provided. The disposable absorbent article includes at least one serviceable indicium that facilitates an easy change by providing alignment of the article relative to an anatomical feature of the wearer or by externally highlighting one or more components of the article thereby indicating alignment and fit about the wearer's lower torso. | 10-21-2010 |
| 20110040276 | Disposable Absorbent Article Designed to Facilitate an Easy Change - A disposable absorbent article to be worn about the lower torso of a wearer that facilitates an easy, intuitive change is provided. The disposable absorbent article includes at least one serviceable indicium that facilitates an easy change by providing alignment of the article relative to an anatomical feature of the wearer or by externally highlighting one or more components of the article thereby indicating alignment and fit about the wearer's lower torso. | 02-17-2011 |
Peter Alex Korn, Oakland, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100077329 | METHOD AND SYSTEM FOR CREATING A FREE-FORM VISUAL USER INTERFACE ELEMENT - A method of creating a free-form visual user interface element includes receiving a command to associate a visual representation of at least one of a set of graphical user interface controller attributes with a free-form visual element, generating instructions defining the at least one of the set of graphical user interface controller attributes, and adapting the instructions to a data structure embodying the free-form visual element. The method also includes attaching the adapted instructions to the data structure to form a free-form visual user interface element. | 03-25-2010 |
Philip Korn, New York, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20090172058 | Computing time-decayed aggregates under smooth decay functions - Aggregates are calculated from a data stream in which data is sent in a sequence of tuples, in which each tuple comprises an item identifier and a timestamp indicating when the tuple was transmitted. The tuples may arrive at a data receiver out-of-order, that is, the sequence in which the tuples arrive are not necessarily in the same sequence as their corresponding timestamps. In calculating aggregates, more recent data may be given more weight by a decay function which is a function of the timestamp associated with the tuple and the current time. The statistical characteristics of the tuples are summarized by a set of linear data summaries. The set of linear data summaries are generated such that only a single linear data summary falls between a set of boundaries calculated from the decay function and a set of timestamps. Aggregates are calculated from the set of linear data summaries | 07-02-2009 |
| 20090172059 | Computing time-decayed aggregates in data streams - Aggregates are calculated from a data stream in which data is sent in a sequence of tuples, in which each tuple comprises an item identifier and a timestamp indicating when the tuple was transmitted. The tuples may arrive out-of-order, that is, the sequence in which the tuples arrive are not necessarily in the sequence of their corresponding timestamps. In calculating aggregates, more recent data may be given more weight by multiplying each tuple by a decay function which is a function of the timestamp associated with the tuple and the current time. The tuples are recorded in a quantile-digest data structure. Aggregates are calculated from the data stored in the quantile-digest data structure. | 07-02-2009 |
| 20090287721 | Generating conditional functional dependencies - Techniques are disclosed for generating conditional functional dependency (CFD) pattern tableaux having the desirable properties of support, confidence and parsimony. These techniques include both a greedy algorithm for generating a tableau and, for large data sets, an “on-demand” algorithm that outperforms the basic greedy algorithm in running time by an order of magnitude. In addition, a range tableau, as a generalization of a pattern tableau, can achieve even more parsimony. | 11-19-2009 |
| 20100153064 | Methods and Apparatus to Determine Statistical Dominance Point Descriptors for Multidimensional Data - Methods and apparatus to determine statistical dominance point descriptors for multidimensional data are disclosed. An example method disclosed herein comprises determining a first joint dominance value for a first data point in a multidimensional data set, data points in the multidimensional data set comprising multidimensional values, each dimension corresponding to a different measurement of a physical event, the first joint dominance value corresponding to a number of data points in the multidimensional data set dominated by the first data point in every dimension, determining a first skewness value for the first data point, the first skewness value corresponding to a size of a first dimension of the first data point relative to a combined size of all dimensions of the first data point, and combining the first joint dominance and first skewness values to determine a first statistical dominance point descriptor associated with the first data point. | 06-17-2010 |
| 20110131170 | Processing data using sequential dependencies - The specification describes data processes for analyzing large data steams for target anomalies. “Sequential dependencies” (SDs) are chosen for ordered data and present a framework for discovering which subsets of the data obey a given sequential dependency. Given an interval G, an SD on attributes X and Y, written as X→G Y, denotes that the distance between the Y-values of any two consecutive records, when sorted on X, are within G. SDs may be extended to Conditional Sequential Dependencies (CSDs), consisting of an underlying SD plus a representation of the subsets of the data that satisfy the SD. The conditional approximate sequential dependencies may be expressed as pattern tableaux, i.e., compact representations of the subsets of the data that satisfy the underlying dependency. | 06-02-2011 |
Philip Russell Korn, New York, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20090292726 | System and Method for Identifying Hierarchical Heavy Hitters in Multi-Dimensional Data - A method including receiving a plurality of elements of a data stream, storing a multi-dimensional data structure in a memory, said multi-dimensional data structure storing the plurality of elements as a hierarchy of nodes, each node having a frequency count corresponding to the number of elements stored therein, comparing the frequency count of each node to a threshold value based on a total number of the elements stored in the nodes and identifying each node for which the frequency count is at least as great as the threshold value as a hierarchical heavy hitter (HHH) node and propagating the frequency count of each non-HHH nodes to its corresponding parent nodes. | 11-26-2009 |
Phillip Korn, New York, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20100153379 | System and Method for Generating Statistical Descriptors for a Data Stream - Described is a system and method for receiving a data stream of multi-dimensional items, collecting a sample of the data stream having a predetermined number of items and dividing the sample into a plurality of subsamples, each subsample corresponding to a single dimension of each of the predetermined number of items. A query is then executed on a particular item in at least two of the subsamples to generate data for the corresponding subsample. This data is combined into a single value. | 06-17-2010 |
Ronald L. Korn, Paradise Valley, AZ US
| Patent application number | Description | Published |
|---|---|---|
| 20110087088 | COMPUTER-ASSISTED IDENTIFICATION AND TREATMENT OF AFFECTED ORGAN TISSUE - Computer-assisted processes are disclosed for using nuclear medicine image studies (e.g. PET or SPECT), preferably in combination with anatomic image studies (e.g., CT or MRI), to identify and quantify regions of affected organ tissue (e.g., myocardial infarcts), and to calculate doses of stem cells or other therapy to deliver to such regions. The resulting (static) image data showing the affected tissue may also be integrated with live (moving) image data, such as a fluoroscopy image, during a subsequent interventional procedure to generate a hybrid image showing the real time location of an injection catheter relative to the affected tissue. | 04-14-2011 |
| 20110087110 | MEDICAL IMAGING PROCESSES FOR FACILITATING CATHETER-BASED DELIVERY OF THERAPY TO AFFECTED ORGAN TISSUE - Medical imaging processes are disclosed for facilitating the catheter-based delivery of stem cells or other therapy to affected organ tissue, including myocardial infarct and peri-infarct tissue. The disclosed processes include the integration of static image data showing the affected tissue with a live/moving image (e.g., a fluoroscopy image) to generate a hybrid view showing the real time location of an injection catheter relative to the affected tissue. The static image data may include or be derived from one or more noninvasive nuclear medicine imaging scans (e.g., PET or SPECT) generated prior to the catheterization procedure. The live image may also be augmented with visual markers showing target and/or actual injection locations. Also disclosed are methods for calculating amounts of therapy to deliver to the affected tissue. | 04-14-2011 |