Nehme
Alissar Nehme, Mission Viejo, CA US
Patent application number | Description | Published |
---|---|---|
20130123223 | 4-PREGENEN-11BETA-17-21-TRIOL-3,20-DIONE DERIVATIVES - The present invention relates to novel 4-pregenen-11β-17-21-triol-3,20-dione derivatives, processes for preparing them, pharmaceutical compositions containing them and their use as pharmaceuticals, as modulators of glucocorticoid or mineralocorticoid receptors. The invention relates specifically to the use of these compounds and their pharmaceutical compositions to treat disorders associated with glucocorticoid or mineralocorticoid receptor modulation. | 05-16-2013 |
20130123226 | PHARAMCEUTICAL COMPOSITIONS AND METHODS OF USE 4-PREGENEN-11BETA-17-21-TRIOL-3,20-DIONE DERIVATIVES - The present invention relates to pharmaceutical compositions comprising 4-pregenen-11β-17-21-triol-3,20-dione derivatives, and their use as pharmaceuticals as modulators of the glucocorticoid receptors (GR) and/or the mineralocorticoid receptors (MR). The invention relates specifically to the use of these compounds and their pharmaceutical compositions to treat ocular conditions associated with the glucocorticoid receptors (GR) and/or the mineralocorticoid receptors (MR). | 05-16-2013 |
20150057258 | 4-PREGENEN-11BETA-17-21-TRIOL-3,20-DIONE DERIVATIVES - The present invention relates to novel 4-pregenen-11β-17-21-triol-3,20-dione derivatives, processes for preparing them, pharmaceutical compositions containing them and their use as pharmaceuticals, as modulators of glucocorticoid or mineralocorticoid receptors. The invention relates specifically to the use of these compounds and their pharmaceutical compositions to treat disorders associated with glucocorticoid or mineralocorticoid receptor modulation. | 02-26-2015 |
Carl Elie Nehme, Cambridge, MA US
Patent application number | Description | Published |
---|---|---|
20100228533 | SYSTEM AND METHOD FOR MODELING SUPERVISORY CONTROL OF HETEROGENEOUS UNMANNED VEHICLES THROUGH DISCRETE EVENT SIMULATION - A system and method for modeling supervisory control of heterogeneous unmanned vehicles through discrete event simulation is provided. Generally, the system contains a memory and a processor configured by the memory to perform the steps of: simulating events in the system; simulating arrival processes for the events in the system; simulating how long a human operator takes to respond to the simulated events in the system, where the time that the human operator takes to respond to a simulated event is referred to as a service time; and prioritizing the events to be handled by the human operator, wherein the system models human operator involvement in the unmanned vehicle system. | 09-09-2010 |
Nicolas A. Nehme, Olathe, KS US
Patent application number | Description | Published |
---|---|---|
20120076137 | Configuring Guest Users for a VoIP Device of a Primary User - A method to providing VoIP telephony to a plurality of users of a VoIP network includes authenticating and registering a primary user to a VoIP device to support call signaling associated with the primary user. A guest user subscriber of the VoIP network having a guest user directory number is authenticated in response to a password. The guest user directory number is mapped to the unique hardware identifier of the VoIP device, and a second set of VoIP parameters are downloaded from the VoIP network to the VoIP device in order to support call signaling associated with the guest user. VoIP calls are then within the VoIP network in response to the mappings of the primary user directory number and the guest user directory number to the same unique hardware identifier. | 03-29-2012 |
Rimma Nehme, Madison, WI US
Patent application number | Description | Published |
---|---|---|
20140089294 | SQL GENERATION FOR ASSERT, UPDATE AND DELETE RELATIONAL TREES - Presented is a system and method for evaluating relational database queries in a distributed system. An optimized query plan is received by a control node. The query plan is decoded to a SQL statement that is semantically equivalent to the query plan, even though the query plan contains elements that have no direct analogue in SQL. The decoded SQL is transmitted to a compute node for execution. | 03-27-2014 |
Rimma Nehme, Indianapolis, IN US
Patent application number | Description | Published |
---|---|---|
20090327254 | CONFIGURATION-PARAMETRIC QUERY OPTIMIZATION - Described herein are techniques for Configuration-Parametric Query Optimization (C-PQO) that can improve performance of database tuning tools. When first optimizing a query, a compact representation of the optimization space is generated. The representation can then be used to efficiently produce other execution plans for the query under arbitrary hypothetical configurations. | 12-31-2009 |
Rimma V. Nehme, Madison, WI US
Patent application number | Description | Published |
---|---|---|
20140114952 | OPTIMIZING QUERIES OF PARALLEL DATABASES - The present invention extends to methods, systems, and computer program products for optimizing queries of parallel databases. Queries can be partially optimized at an optimizer that is unaware of its use to optimize queries for parallel processing. The optimizer can produce a data structure (e.g., a SQL Server MEMO) that encapsulates a logical serial plan search space. The logical serial plan search space may not incorporate any notion of parallelism into the plan space itself. A parallel-aware optimizer can parallelize the logical serial plan search space by augmenting the data structure (e.g., transforming the SQL Server MEMO into a parallel MEMO). Augmentation can be with data movement operations that move data associated one or more compute nodes in a distributed architecture. Cost estimates can be calculated for the operations contained in the parallelized data structure. The parallel plan with the lowest estimated cost can be selected for the query. | 04-24-2014 |
20140137237 | SINGLE SYSTEM IMAGE VIA SHELL DATABASE - A single system image is provided for a parallel data warehouse system by exposing a shell database within a database management system comprising metadata and statistics regarding externally stored data. Further, functionality of the database management system can be exploited to perform pre-execution tasks. In one instance, one or more execution plans can be generated by the database management system for an input command and subsequently employed to generate a distributed execution plan. | 05-15-2014 |
20140164353 | OPTIMIZING PARALLEL QUERIES USING INTERESTING DISTRIBUTIONS - The present invention extends to methods, systems, and computer program products for optimizing parallel queries using interesting distributions. For each logical operator in an SQL server MEMO, in a top down manner from a root operator to the leaf operators, interesting distributions for the operators can be identified based on the properties of the operators. Identified interesting distributions can be propagated down to lower operators by annotating the lower operators with the interesting distributions. Thus, a SQL server MEMO can be annotated with interesting distributions propagated top down from root to leaf logical operators to generate an annotated SQL server MEMO. Parallel query plans can then be generated from the annotated SQL server MEMO in a bottom up manner from leaf operators to a root operator. Annotated interesting properties can be used to prune operators, thereby facilitating a more tractable search space for a parallel query plan. | 06-12-2014 |
Rimma Vladimirovna Nehme, Madison, WA US
Patent application number | Description | Published |
---|---|---|
20120117065 | AUTOMATED PARTITIONING IN PARALLEL DATABASE SYSTEMS - Embodiments are directed to determining optimal partition configurations for distributed database data and to implementing parallel query optimization memo data structure to improve partition configuration cost estimation efficiency. In an embodiment, a computer system accesses a portion of database data and various database queries for a given database. The computer system determines, based on the accessed database data and database queries, a partition configuration search space which includes multiple feasible partition configurations for the database data and a workload of queries expected to be executed on that data. The computer system performs a branch and bound search in the partition configuration search space to determine which data partitioning path has the lowest partitioning cost. The branch and bound search is performed according to branch and bound search policies. The computer system also outputs the partition configuration with the determined lowest partitioning cost. | 05-10-2012 |
Rimma Vladimirovna Nehme, Indianapolis, IN US
Patent application number | Description | Published |
---|---|---|
20100241766 | Min-Repro Framework for Database Systems - The min-repro finding technique described herein is designed to ease and speed-up the task of finding a min-repro, a minimum configuration that reproduces a problem in database-related products. Specifically, in one embodiment the technique simplifies transformations in order to find one or more min-repros. One embodiment provides a high-level script language to automate some sub-tasks and to guide the search for a simpler the configuration that reproduces the problem. Yet another embodiment provides record-and-replay functionality, and provides an intuitive representation of results and the search space. These tools can save hours of time for both customers and testers to isolate the problem and can result in faster fixes and large cost savings to organizations. | 09-23-2010 |
Ziad A. Nehme, Richmond, TX US
Patent application number | Description | Published |
---|---|---|
20140330419 | SOLID IDENTIFICATION GRID ENGINE FOR CALCULATING SUPPORT MATERIAL VOLUMES, AND METHODS OF USE - A method for calculating a support material volume, the method comprising generating a grid of cells for a tree data structure of a digital part, where the cells define a plurality of cell arrays, and pinging the cells of one of the cell arrays until a cell containing a subset of the tree data structure is reached or until each cell in the cell array is pinged, where if a cell containing the subset of the tree data structure is reached, then designating the reached cell and all remaining unpinged cells in the cell array as filled. The method also includes repeating the pinging step for each remaining cell array to determine a total filled volume, and subtracting a volume of the digital part from the total filled volume to determine a support material volume. | 11-06-2014 |
Ziad A. Nehme, Knoxville, TN US
Patent application number | Description | Published |
---|---|---|
20130066812 | SOLID IDENTIFICATION GRID ENGINE FOR CALCULATING SUPPORT MATERIAL VOLUMES, AND METHODS OF USE - A method for calculating a support material volume, the method comprising generating a grid of cells for a tree data structure of a digital part, where the cells define a plurality of cell arrays, and pinging the cells of one of the cell arrays until a cell containing a subset of the tree data structure is reached or until each cell in the cell array is pinged, where if a cell containing the subset of the tree data structure is reached, then designating the reached cell and all remaining unpinged cells in the cell array as filled. The method also includes repeating the pinging step for each remaining cell array to determine a total filled volume, and subtracting a volume of the digital part from the total filled volume to determine a support material volume. | 03-14-2013 |