Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Nehme
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, 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 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 |
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 |