| Patent application number | Description | Published |
|---|
| 20100088274 | SYSTEM AND METHOD FOR SYNCHRONIZING A REPOSITORY WITH A DECLARATIVE DEFINTION - The subject disclosure relates to a method and system for synchronizing a repository with a declarative definition. The method and system includes receiving the declarative definition in which the declarative definition represents a constraint-based execution model. A script is also created that translates the declarative definition into machine code. At least one function is then performed on the repository in which the script provides instructions for the at least one function. | 04-08-2010 |
| 20100088283 | SYSTEM AND METHOD FOR MANAGING DATABASE APPLICATIONS - The subject disclosure relates to a method and system for managing a database application. The method and system include receiving a deployment package, which includes deployed objects of a declarative execution model and defining a plurality of data structures extracted from the deployment package such that at least one data structure populates an extended catalog. The deployed objects are then stored in a manner consistent with the plurality of data structures. | 04-08-2010 |
| 20100088350 | PACKAGING SYSTEM TO FACILITATE DECLARATIVE MODEL-DRIVEN DEVELOPMENT - The subject disclosure relates to a method and system for packaging a post-processed definition of a programming module. Contents of a constraint-based and/or order-independent execution model are received, in which the contents include a declarative source code. The contents are stored into an extensible storage abstraction such that the source code is stored in a declarative format. Metadata describing attributes of the contents stored in the extensible storage abstraction is also defined. A file is then created, which includes the extensible storage abstraction and the metadata. | 04-08-2010 |
| 20100088685 | SYSTEM AND METHOD FOR MAPPING A DOMAIN MODELING LANGUAGE TO A RELATIONAL STORE - A method and system for mapping between constructs in a domain modeling language and a relational storage language is provided. A source code authored in a source language is received and a set of constructs in the source code are identified. The set of constructs in the source code are mapped to a set of constructs in a target language. The source code is then compiled into a target code authored in the target language such that one of the source code or target code include a declarative constraint-based and/or order-independent execution model. | 04-08-2010 |
| 20100250623 | GENERIC EDITOR FOR DATABASES - Facilitating generic database editing to allow for data to be received from a user for entry into a database without requiring the data to conform to schema constraints for the database. A method includes examining a first schema for a first database. The first schema including a first set of constraints specified in the first schema on data to be entered into the first database. The method further includes, based on the examination, constructing a second database corresponding to the first database. The second database is associated with a second schema with a second set of constraints. The second set of constraints is a relaxed version of the first set of constraints specified in the first schema. | 09-30-2010 |
| 20110099188 | DATA FRAMEWORK TO ENABLE RICH PROCESSING OF DATA FROM ANY ARBITRARY DATA SOURCE - Accessing data in a data store at a field granularity. A method includes receiving a query from a user. The query specifies one or more non-unique fields of a record. The method further includes sending the query to a data store to retrieve the fields of the record at a field granularity. The method further includes receiving data for the one or more non-unique fields of the record at a field granularity. | 04-28-2011 |
| 20110307524 | UNIFIED CONCURRENT CHANGES TO DATA, SCHEMA, AND APPLICATION - Changes are managed in a multi-user database application environment. Proposed changes are collected, including changes to data, schema, and/or application descriptions. A user may specify foreign key relationships between items belonging to one or more of these categories. A view is produced showing the impact proposed changes would have on the environment if successfully committed. The user's proposed changes are ordered according to their dependencies, and submitted for committal together in a single transaction, subject to optimistic concurrency and consistency checks. For example, a proposed change to a data value may be inconsistent with a change which removed a data element containing the data value. The commitment operation may return identifiers and other return values, in addition to indicating whether the commitment was successful. | 12-15-2011 |
| Patent application number | Description | Published |
|---|
| 20090193093 | REDUCING UNWANTED AND UNSOLICITED ELECTRONIC MESSAGES BY EXCHANGING ELECTRONIC MESSAGE TRANSMISSION POLICIES AND SOLVING AND VERIFYING SOLUTIONS TO COMPUTATIONAL PUZZLES - The present invention provides for generating inputs that can be provided to a message classification module to facilitate more reliable classification of electronic messages, such as, for example, as unwanted and/or unsolicited. In one embodiment, a sending messaging server provides an appropriate response to address verification data thereby indicating a reduced likelihood of the sending messaging server using a forged network address. In another embodiment, it is determined if a messaging server is authorized to send electronic messages for a domain. In yet another embodiment, electronic message transmission policies adhered to by a domain are identified. In yet a further embodiment, a sending computer system expends computational resources to solve a computational puzzle and includes an answer document in an electronic message. A receiving computer system receives the electronic message and verifies the answer document. | 07-30-2009 |
| 20090320099 | Content Retrieval - Content retrieval techniques are described. In an implementation, a determination is made as to whether a client is permitted to receive content requested by the client. When the client is permitted to receive the content, a communication is formed to be communicated via a wide area network that includes a hash list having a hash of each of a plurality of blocks of the content, each hash being configured to enable the client to locate a corresponding one of the blocks of the content via a local area network. | 12-24-2009 |
| 20090327505 | Content Identification for Peer-to-Peer Content Retrieval - Described is a technology in which client content requests to a server over a wide area network (WAN) are responded to with hash information by which the client may locate the content among one or more peer sources coupled to the client via a local area network (LAN). The hash information may be in the form of a segment hash that identifies multiple blocks of content, whereby the server can reference multiple content blocks with a single hash value. Segment boundaries may be adaptive by determining them according to criteria, by dividing streamed content into segments, and/or by processing the content based on the content data (e.g., via RDC or content/application type) to determine split points. Also described is content validation using the hash information, including by generating and walking a Merkle tree to determine higher-level segment hashes in order to match a server-provided hash value. | 12-31-2009 |
| 20110173699 | NETWORK INTRUSION DETECTION WITH DISTRIBUTED CORRELATION - A network security system employing multiple levels of processing to identify security threats. Multiple host machines may each contain an agent that detects possibilities of security threats based on raw data sensed locally at that host. The hosts may share information obtained from local analysis and each host may use information generated at one or more other hosts, in combination with information generated locally, to identify a security concern, indicating with greater certainty that a security threat exists. Based on security concerns generated by multiple hosts, a security threat may be indicated and protective action may be taken. | 07-14-2011 |
| 20110295948 | CONTENT IDENTIFICATION FOR PEER-TO-PEER CONTENT RETRIEVAL - Described is a technology in which client content requests to a server over a wide area network (WAN) are responded to with hash information by which the client may locate the content among one or more peer sources coupled to the client via a local area network (LAN). The hash information may be in the form of a segment hash that identifies multiple blocks of content, whereby the server can reference multiple content blocks with a single hash value. Segment boundaries may be adaptive by determining them according to criteria, by dividing streamed content into segments, and/or by processing the content based on the content data (e.g., via RDC or content/application type) to determine split points. Also described is content validation using the hash information, including by generating and walking a Merkle tree to determine higher-level segment hashes in order to match a server-provided hash value. | 12-01-2011 |
| 20120079569 | FEDERATED MOBILE AUTHENTICATION USING A NETWORK OPERATOR INFRASTRUCTURE - Architecture that utilizes the strong authentication mechanisms of network operators to provide authentication to mobile applications by identity federation. When a mobile client initiates request for access to an application outside the network operation infrastructure, the request is passed to an associated application secure token service. The application secure token service has an established trust and identity federation with the network operator. The application secure token service redirects the request to a network operator security token server, which then passes the request to a network operator authentication server for authentication against an operator identity service. Proof of authentication is then issued and returned from the network operator security token server to the application secure token service and the application, which allows the mobile client to access the application. | 03-29-2012 |
| 20120084851 | TRUSTWORTHY DEVICE CLAIMS AS A SERVICE - Embodiments of the invention make the issuance of trustworthy device claims available to client devices as a service, so that a client device to which device claims are issues may use the device claims in relation to an attempt to access a network application. The service may conduct an assessment of the device's characteristics and/or state, characterize the results of this assessment in device claims, and issue the device claims to the device. The service may be accessible to a client device from outside administrative boundaries of an entity that makes a network application accessible, and thus may be useful to entities making network applications accessible in business-to-consumer (B2C) and business-to-business (B2B) topologies, such as over the publicly accessible Internet. | 04-05-2012 |
| Patent application number | Description | Published |
|---|
| 20110246216 | Online Pre-Registration for Patient Intake - Described herein are techniques for enabling a patient to pre-register for a medical visit to a healthcare facility (e.g., a hospital) online. Also described herein are techniques that enable a hospital staff to pre-process a patient's pre-registration intake forms before the patient arrives for the medical visit at the healthcare facility. With some of the described techniques, the patient's pre-registration intake forms may have been customized to match the needs and desires of the healthcare facility, its departments, and/or the healthcare providers (e.g., nurses, physicians, etc.) taking care of the patient during the visit. | 10-06-2011 |
| 20110246230 | Identity Matching And Information Linking - A connection component establishes an identity of a person for permitting access to information in a database. Responsive to establishing the identity of the person, the connection component may link an external account to the information in the database for providing a flow of information between the database and the external account. | 10-06-2011 |
| 20110246231 | ACCESSING PATIENT INFORMATION - A connection component generates a user interface for display to a patient computing device. The user interface provides the patient computing device with access to hospital visit records of the patient maintained in a hospital database. The user interface may further receive selection of a care provider by the patient for granting the care provider electronic access to the patient's hospital visit records. | 10-06-2011 |
