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 |
20120191650 | SYNCHRONIZING DATABASE PROJECTS WITH PARTNER PROJECTS - A solution authoring tool that includes an authoring environment that allows for the authoring of multiple projects of a solution including a database project that has a schema and a partner project that has a reference to the schema. When the database project is built and deployed, the database schema is made ready for runtime. When the partner project is built and deployed, the schema reference is provided within the partner software such that the partner software may interface with the database schema at runtime. To reduce or eliminate database schema drift at development time causing runtime errors at runtime, a model bus at least partially synchronizes changes made to the schema in the database project to the schema reference in the partner project, and vice versa. | 07-26-2012 |
20120221507 | DECLARATIVE UPDATE TO A LIVE SYSTEM - A live system manager may retrieve a current state of the live system, allow a user to edit the state, and generate a set of incremental commands that modify the current state into a desired state. The set of incremental commands may be then executed to create the desired state. In some embodiments, the set of incremental commands may be executed as a transaction. The live system manager may compare the current state to a desired state to generate the incremental commands, and may perform various validation operations during operation. A user may be presented options at various points to disambiguate the user's intentions. | 08-30-2012 |
20120323946 | DATA FRAMEWORK TO ENABLE RICH PROCESSING OF DATA FROM ANY ARBITRARY DATA SOURCE - Data is accessed and updated in a data store at a field granularity. A user query specifies one or more non-unique fields of a record. The query is sent to a data store to retrieve the fields of the record at a field granularity, in satisfaction of the query. The fields of the record can also be modified by transmitting a record ID along with original content, while omitting some of the record data, and by also including the modification to be made. | 12-20-2012 |
20130110879 | DECLARATIVE SUPPORT FOR REFERENCE DATA IN RELATIONAL DATABASES | 05-02-2013 |
20130117011 | TELEMETRY OF SYSTEM CHANGES - A telemetry system can parse and transform one or more change sets from a format intended to be processed by a computer to a form that is readily consumable by a human. The report or display generated to present the results can be customized for a particular domain. | 05-09-2013 |
20130117232 | SNAPSHOTS OF DATABASE MODELS - Methods, systems, and computer program products are provided for capturing snapshots of database models. Metadata of a database model is captured. A database model snapshot object is generated based on the captured metadata. The generated database model snapshot object is transportable, extensible, secure, and human readable. Furthermore multiple database model snapshot objects may be compared to each other to determine differences in database models in different database systems, to track how a database model of a database system is changing over time, to track how database source projects evolve over time and/or for other uses. | 05-09-2013 |
20130117733 | Simultaneously targeting multiple homogeneous and heterogeneous runtime environments - A single software project in an integrated development environment (IDE) may be built for multiple target environments in a single build episode. Multiple different output artifacts may be generated by the build process for each of the target environments. The output artifacts are then deployed to the target environments, which may be homogeneous or heterogeneous environments. The same source project may be used to generate multiple output artifacts for the same target environment. | 05-09-2013 |
20130173672 | 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. | 07-04-2013 |
20130232123 | DRIFT DETECTION AND NOTIFICATION - A drift condition, or change, in a data structure can be detected and communicated to one or more subscribers. Data structure can be monitored by periodic configurable polling of a data source or on demand polling. Upon detection of a change in the in the data structure, subscribers can be notified of the change and optionally other information such as the identity of the object that changed and nature of the change. | 09-05-2013 |
20140331213 | 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. | 11-06-2014 |
Patent application number | Description | Published |
20120102504 | APPLICATION LIFETIME MANAGEMENT - In a computing device running multiple applications, a check is made as to whether a threshold value of multiple threshold values has been met. Each of the multiple threshold values is associated with a characteristic of one of the multiple applications or a characteristic of a resource of the computing device. If the threshold value has not been met, then the multiple applications are allowed to continue running on the computing device. However, if the threshold value has been met, then one or more of the multiple applications to shut down is selected based at least in part on the characteristic associated with the threshold value that has been met, and the selected application is shut down. | 04-26-2012 |
20130047198 | Policy Based Application Suspension and Termination - In accordance with one or more aspects, an application that is to be suspended on a computing device is identified based on a policy. The policy indicates that applications that are not being used are to be suspended. The application is automatically suspended, and is allowed to remain in memory but not execute while suspended. Additionally, when memory is to be freed one or more suspended applications to terminate are automatically selected based on the policy, and these one or more selected applications are terminated. | 02-21-2013 |
20130061212 | Modern Application Tracing - Modern application tracing techniques are described herein that enable dynamic logging of events declared in a static manifest. Various events for logging can be declared in a static manifest. The static manifest may then be compiled to translate the declared events into a library of corresponding functions that can be called by “modern” applications written using dynamic code. Calls made to these functions from dynamic code are converted to corresponding static events and forwarded to existing tracing application programming interfaces (APIs) designed to handle logging of static events for “legacy” applications that use compiled code. In this manner, static functions that are compatible with tracing APIs can be created and called dynamically from dynamic code. This can occur without requiring administrative rights to install the code and while preserving existing features for legacy applications, such that a tracing log can include events from both modern applications and legacy applications. | 03-07-2013 |
Patent application number | Description | Published |
20110295844 | ENHANCING FRESHNESS OF SEARCH RESULTS - Methods, systems, and computer-storage media for improving the freshness, or the apparent freshness, of search results are described. In an embodiment, the first portion of search results presented on a search results page are based on responsiveness to the search query and a second portion of results describe only recently published documents that are responsive to the search query. In an embodiment, a more recent version of the document, which is not directly used to determine responsiveness, is used to build the caption for a search result. Another way to make search results appear fresh is to include a publication time within the search result caption. In one embodiment, the publication time is generated by calculating a point in time between when a document is first added to a search index and the previous time the search engine visited the site where the document was found. | 12-01-2011 |
20120150831 | UPDATING A SEARCH INDEX USING REPORTED BROWSER HISTORY DATA - Methods, systems, and computer-readable media are provided for updating a search index with new uniform resource locators (URLs) and spiking URLs with increased user interest. History data, provided from browser applications residing on users' computers that indicate URLs accessed by the users, is parsed to identify new/previously unknown URLs. The history data also indicates URLs in which there is increased interest based on a number of recent hits as compared to an average number of hits determined over time. Author postings of new URLs to social networking sites and a quality rating of the authors may also be used to identify and filter new URLs. Search indexes are updated with the new and spiking URL data. As such, lag time between posting of new URLs and spiking of URL interest and inclusion of this data in a search index is greatly decreased. | 06-14-2012 |
Patent application number | Description | Published |
20120047121 | CONTENT SIGNATURE NOTIFICATION - A client application installed on end user computers generates metadata from the content of web pages visited by end users and provides the metadata to a search engine. When an end user visits a web page, the end user's computer downloads and displays the web page to the end user. The client application may simultaneously access the web page content and generate this metadata in the form of a content signature of the web page from the web page content. The client application then provides the content signature to a search engine. The search engine may employ content signatures to identify new web pages to crawl and index. Additionally, the search engine may employ content signatures to identify changes to web pages and determine the crawl frequency of web pages. | 02-23-2012 |
20120150833 | USING SOCIAL-NETWORK DATA FOR IDENTIFICATION AND RANKING OF URLS - Methods, systems, and computer-readable media are provided for updating a search index with new uniform resource locators (URLs) and with metadata for new and known URLs. Data associated with communications made by users using a social network is received. The communications include a URL therein that a user has shared, posted, or otherwise communicated to one or more other users using the social network. When the URL is not found in a search index it is identified as a new URL and is added to the search index. A measure of a trending interest, or virality, of the URL is determined from the data. The determined virality is associated with the URL in a search index as metadata. The virality is useable to inform a ranking of the URL against a plurality of other URLs for identification and presentation as a search result in a search engine results page. | 06-14-2012 |
20130041877 | Clustering Web Pages on a Search Engine Results Page - Methods, systems, and media are provided for delivering clustered search results for recent and non-recent events by maintaining the identification (ID) numbers of the respective clustered documents beyond the “fresh” life span of the clustered documents. When clusters are formed according to similar content, an ID number and associated attributes are assigned to each of the clusters. This provides a mechanism to track and retrieve the respective clusters for subsequent delivery of search results. The respective ID numbers of the clusters are maintained, even after the documents are no longer considered “fresh.” These similar-content clusters are further subdivided according to publication date. This provides individual subdivided clusters for similar content events that occurred at different time spans, which are delivered along with individual non-clustered search results in a SERP. | 02-14-2013 |
20140372425 | PERSONALIZED SEARCH EXPERIENCE BASED ON UNDERSTANDING FRESH WEB CONCEPTS AND USER INTERESTS - Architecture that employs a search engine to unobtrusively understand the concepts (topics) and entities in which a user is interested, while simultaneously understanding the current events of the world. These concepts/entities and current events are then mapped to each other to provide a personalized experience for each user that is informative as to the latest news of interest to the user. The user interests are mapped to current events, and queries are formulated, ranked, and displayed to the user that relate to what the user may be interested in searching about new events the user would not have considered without the search engine's assistance. The popular queries are combined with the understanding of what is being indexed in a super fresh tier to determine the current events. | 12-18-2014 |
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 |
20130305371 | 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 to indicated and protective action may be taken. | 11-14-2013 |
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 |
20120151557 | Progressive Consent - A consent management system is described which manages an entity's consent to consume application functionality on a per-feature level of granularity. To perform this task, the consent management system maintains consent information which describes a plurality of use conditions associated with the features of the application functionality. In one case, the consent information has a hierarchical data structure that identifies a hierarchy of application features. In operation, the consent management system accesses the content information whenever an entity seeks to access a particular application feature; it grants or denies access to the feature based on the consent information. The consent management system also includes a consent maintenance module that allows an administrator (or other entity) to cancel or modify any use condition in the consent information. | 06-14-2012 |