Neeman
Alisa Neeman, Santa Cruz, CA US
Patent application number | Description | Published |
---|---|---|
20100281356 | Construction and analysis of markup language document representing computing architecture having computing elements - A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships. Redundant attributes among the relationships can thus be detected. | 11-04-2010 |
20110320929 | Construction and analysis of markup language document representing computing architecture having computing elements - A markup language document representing computing elements of a computing architecture, such as data storage elements of a data storage architecture, is constructed and analyzed. A first computing element contained by a second computing element is represented; a first tag of the document corresponding to the first computing element is nested within a second tag of the markup language document corresponding to the second computing element. A non-containing/contained relationship from the first computing element to a third computing element is also represented; a pointer tag of the document corresponding to the data access path is nested within the first tag, and references a third tag of the document corresponding to the third computing element. Get-pointer-node and get-child-node application programming interfaces for the markup language are called to traverse among containing/contained relationships. Pointer tags are followed to traverse among non-containing/contained relationships. Redundant attributes among the relationships can thus be detected. | 12-29-2011 |
Itay Neeman, Beverly Hills, CA US
Patent application number | Description | Published |
---|---|---|
20080301758 | Distributed knowledge access control - Techniques for distributed knowledge access control are disclosed herein. These techniques may enable access control information to be provided in the form of a statement that includes an assertion and a construct that targets the assertion to one or more intended entities. By targeting the statement to intended entities, the construct may help protect resources from unauthorized use and may also help protect the issuer of the statement from accountability resulting from misuse of the statement. | 12-04-2008 |
Itay Neeman, Seattle, WA US
Patent application number | Description | Published |
---|---|---|
20150039641 | EXECUTING STRUCTURED QUERIES ON UNSTRUCTURED DATA - Technologies are described herein for executing queries expressed with reference to a structured query language against unstructured data. A user issues a structured query through a traditional structured data management (“SDM”) application. Upon receiving the structured query, an SDM driver analyzes the structured query and extracts a data structure from the unstructured data, if necessary. The structured query is then converted to an unstructured query based on the extracted data structure. The converted unstructured query may then be executed against the unstructured data. Results from the query are reorganized into structured data utilizing the extracted data structure and are then presented to the user through the SDM application. | 02-05-2015 |
Itay A. Neeman, Seattle, WA US
Patent application number | Description | Published |
---|---|---|
20140366001 | SYSTEM FOR DISPLAYING NOTIFICATION DEPENDENCIES BETWEEN COMPONENT INSTANCES - The disclosed embodiments relate to a system that facilitates developing applications in a component-based software development environment. This system provides an execution environment comprising instances of application components and a registry that maps names to instances of application components. Within the registry, each entry is associated with a list of notification dependencies that specifies component instances to be notified when the registry entry changes. Upon receiving a command to display notification dependencies for the registry, the system generates and displays a dependency graph containing nodes representing component instances and arrows between the nodes representing notification dependencies between the component instances. Upon receiving a command to display a timeline for with the registry, the system generates and displays a timeline representing events associated with the registry in chronological order. | 12-11-2014 |
20140366044 | APPLICATION FRAMEWORK PROVIDING A REGISTRY FOR MAPPING NAMES TO COMPONENT INSTANCES - The disclosed embodiments relate to a system that facilitates developing applications in a component-based software development environment. This system provides an execution environment comprising instances of application components and a registry that maps names to instances of application components. Upon receiving a call to register a mapping between a name and an instance of an application component, the system updates the registry to include an entry for the mapping. Moreover, upon receiving a call to be notified about registry changes for a name, the system updates the registry to send a notification to a caller when a registry change occurs for the name. | 12-11-2014 |
Trey Neeman, Glendale, AZ US
Patent application number | Description | Published |
---|---|---|
20110004551 | CONSOLIDATED PAYMENT ACCOUNT SYSTEM AND METHOD - The present invention provides a system and method for providing and/or facilitating complete on-line payment services while protecting the privacy of the transaction participants. The comprehensive payment service is based upon a consolidated account used to store value acquired through on-line transactions. The invention provides private payment numbers for protecting the identities of the participants and includes processes for authenticating participants, authorizing transactions, and settling payments. Thus, the present invention enables merchants to effectively accept non-standard forms of payment without changing their current payment infrastructures and enables the provision of value for purchases at any network merchant using any source of value. | 01-06-2011 |
Ziv Neeman, Potomac, MD US
Patent application number | Description | Published |
---|---|---|
20080234721 | Venous Filters - Venous filters having at least two struts (110) each having a connected end and a non-connected end, wherein each of the struts includes a strut portion and an anchor portion ( | 09-25-2008 |