Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Ezzat
Ahmed Ezzat, Cupertino, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090198703 | INTELLIGENT DATA STORAGE SYSTEM - An intelligent data storage system, comprising: one or more intelligent storage devices each comprising one or more processors, a memory, and a storage medium configured to store source data; and one or more application hosts each comprising one or more processors and a memory, communicatively coupled to said one or more intelligent storage devices and configured to generate an execution plan, comprising at least one data filtering parameter, to divide said execution plan into one or more fragments comprising said at least one data filtering parameter, and to provide said one or more fragment to said one or more intelligent storage devices, wherein said intelligent storage device is configured to execute said execution plan fragment on the source data to generate result data selected from the source data based on said at least one data filtering parameter. | 08-06-2009 |
Ahmed K. Ezzat, Cupertino, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100306479 | PROVIDING SHARED MEMORY IN A DISTRIBUTED COMPUTING SYSTEM - A distributed computing system includes a plurality of processors and shared memory service entities executable on the processors. Each of the shared memory service entities is associated with a local shared memory buffer. A producer is associated with a particular shared memory service entity, and the producer provides data that is stored in the local shared memory buffer associated with the particular shared memory service entity. The shared memory service entities propagate content of the local shared memory buffers into a global shared memory, wherein propagation of content of the local shared memory buffers to the global shared memory is performed using a procedure that relaxes guarantees of consistency between the global shared memory and the local shared memory buffers. | 12-02-2010 |
| 20110029508 | SELECTIVITY-BASED OPTIMIZED-QUERY-PLAN CACHING - Embodiments of the present invention partition optimized query plans into equivalence groups, each comprising one or more equivalence classes. Each equivalence group corresponds to a particular compiled, normalized, and parameterized query plan prior to optimization. Each equivalence class within an equivalence group corresponds to a different query plan corresponding to the particular compiled, normalized, and parameterized query plan represented by the equivalence group that has been optimized with respect to the selectivity of one or more predicate clauses of the query that is compiled to produce the particular compiled, normalized, and parameterized query plan. Optimized query plans are cached according to their respective equivalence groups and equivalence classes. When a query, similar to a query already compiled, optimized, and cached, is subsequently received and compiled, a selectivity for a predicate of the compiled query is computed, allowing the database management system to retrieve a cached query plan optimized for a similar query with similar selectivity. | 02-03-2011 |
| 20120101860 | PROVIDING BUSINESS INTELLIGENCE - The present disclosure provides a computer-implemented method of processing a business intelligence client request in real-time using Unified Information Access System architecture. The method includes receiving a business intelligence client request and acquiring data from a plurality of data sources relevant to the business intelligence client request. A first portion of the data is acquired from a first data source in a first data format native to the first data source, and a second portion of the data is acquired from a second data source in a second data format native to the second data source. The method also includes converting the data into a common data format and storing the data to a common data store. The method also includes processing the business intelligence client request on the common data store. | 04-26-2012 |
Antoine Ezzat, Newton, MA US
| Patent application number | Description | Published |
|---|---|---|
| 20110238412 | Method for Constructing Pronunciation Dictionaries - Embodiments of the invention disclose a system and a method for constructing a pronunciation dictionary by transforming an unaligned entry to an aligned entry. The unaligned entry and the aligned entry include a set of words and a set of pronunciations corresponding to the set of words. The method aligns each word in the aligned entry with a subset of pronunciations by determining a pronunciation prediction for each word, such that there is one-to-one correspondence between the word and the pronunciation prediction; mapping each pronunciation prediction to the subset of pronunciations to produce a predictions-pronunciation map having each pronunciation prediction aligned with the subset of pronunciations; and determining the aligned entry based on the predictions-pronunciation map using the one-to-one correspondence between the word and the pronunciation prediction. | 09-29-2011 |
Hazem Ezzat, Troy, MI US
| Patent application number | Description | Published |
|---|---|---|
| 20100252611 | Surgical Device and Method - A surgical device for cutting a portion of a body comprising a knife capable of moving from a first position to a second position which is spaced apart from the first position; a smart memory material (SMM) capable of going from one physical state to another physical state; and an activating apparatus which is in communication with the smart memory material and which can cause the change in the physical state of the smart memory material, which change in state causes the movement of the knife thereby facilitating cutting of the desired body portion. | 10-07-2010 |
Hesham A. Ezzat, Troy, MI US
| Patent application number | Description | Published |
|---|---|---|
| 20120118424 | REINFORCEMENT AND METHOD FOR TUBULAR STRUCTURES - A reinforcement and method for reinforcing a hollow tubular structure includes a first sheet of flexible fiber material impregnated with resin. The first sheet is rolled into a tubular shape and a seam is provided between first and second lateral edges of the first sheet to form a tubular reinforcement. An inflatable bladder extends through the tubular reinforcement and is inflated to press the tubular reinforcement into contact with the inside wall of the tubular structure. Curing of the resin will bond the first sheet to the inside wall to reinforce the tubular structure. The first sheet can have a region of built-up thickness to provide additional reinforcement. The seam between the lateral edges of the first sheet can be a separable seam that separates when the bladder is inflated to allow the first sheet to contact with a region of the tubular structure that is of larger circumference than the circumference of the tubular reinforcement. | 05-17-2012 |
Tony Ezzat, Boston, MA US
| Patent application number | Description | Published |
|---|---|---|
| 20090265162 | Method for Retrieving Items Represented by Particles from an Information Database - A set of words is converted to a corresponding set of particles, wherein the words and the particles are unique within each set. For each word, all possible partitionings of the word into particles are determined, and a cost is determined for each possible partitioning. The particles of the possible partitioning associated with a minimal cost are added to the set of particles. | 10-22-2009 |
Tony Ezzat, Newton, MA US
| Patent application number | Description | Published |
|---|---|---|
| 20100328342 | System and Method for Maximizing Edit Distances Between Particles - Embodiments of the invention disclose a system and a method for transforming a set of particles in an output set of particles representing a set of words suitable for use in an information retrieval system. The method generates, for each particle in the set of particles, combinations of parts of a particle, and replaces the particle in the set of particles with the parts of a combination maximizing a total minimum edit distance (MED) of the set of particles. For example, the method determines a MED of each particle in the set of particles, determines the total MED of the set of particles as summations of the MED of each particle, and then determines the combination maximizing the total MED of the set of particles. | 12-30-2010 |