Patent application number | Description | Published |
20100325715 | BROWSER PLUG-IN FOR SECURE CREDENTIAL SUBMISSION - Described is a technology by which a plug-in (e.g., an ActiveX® control) instantiated by a web browser calls functions of a credential service to use a set of credential data (e.g., a card file) for logging into a website. If the credential service determines that a previously used card file for the website exists, a representation of that card file is displayed in the browser, and the data of that card file is used to obtain a token for logging in the user. If not found, an icon is presented instead, by which the user can select a user interface that allows selection of another card file that meets that meet the website's requirements. | 12-23-2010 |
20140043325 | FACETTED BROWSING - Concepts and technologies are described herein for facetted browsing. In accordance with the concepts and technologies disclosed herein, data can be obtained at a computer system. The data can include data values and geographic information. The computer system can generate a geospatial visualization of the data based, at least partially, upon the data values and the geographic location information. The computer system can also generate an overlay visualization of the data based, at least partially, upon the data values. The computer system can also output the geospatial visualization and the overlay visualization. | 02-13-2014 |
20140047381 | 3D DATA ENVIRONMENT NAVIGATION TOOL - Concepts and technologies are described herein for providing a 3D data environment navigation tool. In accordance with some concepts and technologies disclosed herein, the 3D data environment navigation tool provides a way for a user to manipulate a 3D data environment in which productivity data is rendered. The 3D data environment navigation tool may provide a user interacting with the 3D data environment the ability to manipulate the viewing angle of data rendered in a 3D data environment, thus allowing the user to “tour” or “move around” the data. The 3D data environment navigation tool may be configured to aggregate data at various zoom levels. | 02-13-2014 |
Patent application number | Description | Published |
20090217029 | KERBEROS TICKET VIRTUALIZATION FOR NETWORK LOAD BALANCERS - An exemplary group ticket for a Kerberos protocol includes a service ticket encrypted with a dynamic group key and a plurality of enveloped pairs where each pair includes a name associated with a member of a group and an encrypted the dynamic group key for decryption by a key possessed by the member of the group where decryption of an encrypted dynamic group key allows for decryption of the service ticket. Other exemplary methods, systems, etc., are also disclosed. | 08-27-2009 |
20090328140 | ADVANCED SECURITY NEGOTIATION PROTOCOL - This disclosure describes methods, systems and application programming interfaces for creating an advanced security negotiation package. This disclosure describes creating an advanced security negotiation protocol under a Simple and Protected Negotiation Mechanism (SPNEGO) protocol to negotiate an authentication scheme. The protocol describes defining a Windows Security Type (WST) Library message to protect negotiation data during the advanced security negotiation protocol. The protocol sends an initial message that carries multiple authentication messages to reduce redundant roundtrips and implements key exchanges by a mini Security Support Provider (SSP). | 12-31-2009 |
20090328154 | ISOLATION OF SERVICES OR PROCESSES USING CREDENTIAL MANAGED ACCOUNTS - This disclosure describes methods, systems, and application programming interfaces for creating a credential managed account. This disclosure describes creating a new password managed account, defining the password managed account, wherein the password managed account is to access a service on a managed computing device, identifying the password managed account for a lifecycle, and automatically managing the password managed account by updating and changing a password for the password managed account on a periodic basis. | 12-31-2009 |
20100228982 | FAST-RECONNECTION OF NEGOTIABLE AUTHENTICATION NETWORK CLIENTS - Modern network communications often require a client application requesting data to authenticate itself to an application providing the data. Such authentication requests can be redundant, especially in the case of stateless network protocols. When a full authentication is performed, a conversation identifier and one or more encryption keys can be agreed upon. Subsequent authentication requests can be answered with a fast reconnect token comprising the conversation identifier and a cryptographically signed version of it using the one or more encryption keys. Should additional security be desirable, a sequence number can be established and incremented in a pre-determined or a random manner to enable detection of replayed fast reconnect tokens. If the recipient can verify the fast reconnect token, the provider can be considered to have been authenticated based on the prior authentication. If an aspect of the fast re-authentication should fail, recourse can be had to the original full authentication process. | 09-09-2010 |
20120131661 | BACK-END CONSTRAINED DELEGATION MODEL - A client can communicate with a middle tier, which can then, in turn, communicate with a back end tier to access information and resources on behalf of the client within the context of a system that can scale well. Each individual back end can establish a policy that defines which computing device can delegate to that back end. That policy can be enforced by a domain controller within the same administrative domain as the particular back end. When a middle tier requests to delegate to a back end, the domain controller to which that request was directed can either apply the policy, or, if the domain controller is in a different domain than the targeted back end, it can direct the middle tier to a domain controller in a different domain and can sign relevant information that the middle tier can utilize when communicating with that different domain controller. | 05-24-2012 |
Patent application number | Description | Published |
20090313628 | DYNAMICALLY BATCHING REMOTE OBJECT MODEL COMMANDS - A client-server architecture provides mechanisms to assist in minimizing round trips between a client and server. The architecture exposes an object model for client use that is structured similarly to the server based object model. The client batches commands and then determines when to execute the batched commands on the server. Proxy objects act as proxies for objects and serve as a way to suggest additional data retrieval operations for objects which have not been retrieved. Conditional logic and exceptions may be handled on the server without requiring additional roundtrips between the client and server. | 12-17-2009 |
20100192193 | SECURITY RESTRICTION TECHNIQUES FOR BROWSER-BASED APPLICATIONS - Various technologies and techniques are disclosed for restricting security levels that can be used with browser-based applications. When a request is received from an external application to retrieve data for use in a client browser, an intersection is performed on a permission set of a user of the client browser and of the external application to determine a new permission set to use for retrieving the requested data. Techniques for restricting operations of an external application that is being run in a client browser are also described. A session token is returned to a client browser after validating access can be granted to the client browser. Validation is performed to confirm access can be granted to an external application. A request for data is received from the external application, with the request for data containing the session token. The requested data is retrieved and returned to the external application. | 07-29-2010 |
20100199357 | SECURE HOSTING FOR UNTRUSTED CODE - Various technologies and techniques are disclosed for increasing security in execution environments. A system is described for handling DLL calls made from untrusted code. An execution environment instantiates a lower trust process when a high trust process determines a need to call untrusted code. When the untrusted code calls a method in an original DLL, the execution environment loads a shim DLL into the lower trust process. The shim DLL has a clone of the method from the original DLL. A method for increasing security when processing calls from untrusted code is described. A shim DLL is created from an original DLL, and is deployed so an execution environment will load the shim DLL instead of the original DLL. When an execution environment receives a call from a caller DLL to the original DLL, the call is routed through the shim DLL. A pluggable validation system is also described. | 08-05-2010 |
20110258562 | CROSS-BROWSER WEB DIALOG PLATFORM - A cross-browser dialog platform is provided for supporting hosted web pages in a dialog, such that a web page may be used inside or outside the dialog. Select elements on the hosted page may be hidden when in a dialog, different behavior may be specified for hyperlinks inside or outside the dialog, and a proper size of the dialog may be inferred from its contents without designer input. | 10-20-2011 |
20130145014 | PROVIDING NOTIFICATION OF DOCUMENT REPOSITORY EVENTS TO EXTERNAL SYSTEMS - Remote event receivers can register with a document repository computing system to receive notifications of events occurring at a document repository. The remote event receivers may register to receive notifications synchronously, whereby the remote event receivers can provide a response to the notification prior to the occurrence of the event, or asynchronously, whereby the remote event receivers provide no response. Synchronous remote event receivers can also specify in a response to the notification that the event should be canceled or may specify properties that should be changed. Remote event receivers can be pre-event receivers that receive notifications prior to the occurrence of an event, or post-event receivers that receive notifications following the event. When an event is to occur at the document repository, notifications are provided to the pre-event remote event receivers. Once the event has occurred, notifications are provided to the post-event remote event receivers. | 06-06-2013 |
20130145427 | AUTHORIZING APPLICATION ACCESS TO SECURE RESOURCES - An application submits a permission request to a resource server. In response to receiving the request, the resource server generates a user interface that asks the user to grant or deny the requested permissions. If the permissions are granted, data is stored indicating that the application has the requested permissions. When a runtime request for a resource is received, the resource server determines whether the request has been made by a user, by an application, or by an application on behalf of a user. If the request is made by an application only, the request is granted only if the application has permission to access the resource by way of a direct call not on behalf of a user. If the request is made by an application on behalf of a user, the request is granted only if both the user and the application have sufficient permission. | 06-06-2013 |
Patent application number | Description | Published |
20100083257 | ARRAY OBJECT CONCURRENCY IN STM - A software transactional memory system is provided that creates an array of transactional locks for each array object that is accessed by transactions. The system divides the array object into non-overlapping portions and associates each portion with a different transactional lock. The system acquires transactional locks for transactions that access corresponding portions of the array object. By doing so, different portions of the array object can be accessed by different transactions concurrently. The system may use a shared shadow or undo copy for accesses to the array object. | 04-01-2010 |
20100191930 | TRANSACTIONAL MEMORY COMPATIBILITY MANAGEMENT - Transactional memory compatibility type attributes are associated with intermediate language code to specify, for example, that intermediate language code must be run within a transaction, or must not be run within a transaction, or may be run within a transaction. Attributes are automatically produced while generating intermediate language code from annotated source code. Default rules also generate attributes. Tools use attributes to statically or dynamically check for incompatibility between intermediate language code and a transactional memory implementation. | 07-29-2010 |
20100211931 | STM WITH GLOBAL VERSION OVERFLOW HANDLING - A software transactional memory system is provided with overflow handling. The system includes a global version counter with an epoch number and a version number. The system accesses the global version counter prior to and subsequent to memory accesses of transactions to validate read accesses of the transaction. The system includes mechanisms to detect global version number overflow and may allow some or all transactions to execute to completion subsequent to the global version number overflowing. The system also provides publication, privatization, and granular safety properties. | 08-19-2010 |
20100228929 | EXPEDITED COMPLETION OF A TRANSACTION IN STM - A software transactional memory system is provided that provides privatization safety. The system identifies situations where the completion of a transaction may be expedited because a privatization artifact will not occur. The system determines whether a privatization artifact may occur using a read and write set intersection test, transactional variables, pessimistic locks, or declared privatizing transactions. If a privatization artifact will not occur for a transaction, then the system may allow the transaction to complete prior to one or more earlier transactions. | 09-09-2010 |
20110314230 | ACTION FRAMEWORK IN SOFTWARE TRANSACTIONAL MEMORY - A software transactional memory system implements a lightweight key-based action framework. The framework includes a set of unified application programming interfaces (APIs) exposed by an STM library that allow clients to implement actions that can be registered, queried, and updated using specific keys by transactions or transaction nests in STM code. Each action includes a key, state information, and a set of one or more callbacks that can be hooked to the validation, commit, abort, and/or re-execution phases of transaction execution. The actions extend the built-in concurrency controls of the STM system with customized control logics, support transaction nesting semantics, and enable integration with garbage collection systems. | 12-22-2011 |
20110314244 | COMPOSITION OF LOCKS IN SOFTWARE TRANSACTIONAL MEMORY - A software transactional memory (STM) system allows the composition of traditional lock based synchronization with transactions in STM code. The STM system acquires each traditional lock the first time that a corresponding traditional lock acquire is encountered inside a transaction and defers all traditional lock releases until a top level transaction in a transaction nest commits or aborts. The STM system maintains state information associated with traditional lock operations in transactions and uses the state information to eliminate deferred traditional lock operations that are redundant. The STM system integrates with systems that implement garbage collection. | 12-22-2011 |
20110314458 | BINDING DATA PARALLEL DEVICE SOURCE CODE - A compile environment is provided in a computer system that allows programmers to program both CPUs and data parallel devices (e.g., GPUs) using a high level general purpose programming language that has data parallel (DP) extensions. A compilation process translates modular DP code written in the general purpose language into DP device source code in a high level DP device programming language using a set of binding descriptors for the DP device source code. A binder generates a single, self-contained DP device source code unit from the set of binding descriptors. A DP device compiler generates a DP device executable for execution on one or more data parallel devices from the DP device source code unit. | 12-22-2011 |
20120005662 | INDEXABLE TYPE TRANSFORMATIONS - A high level programming language provides an extensible set of transformations for use on indexable types in a data parallel processing environment. A compiler for the language implements each transformation as a map from indexable types to allow each transformation to be applied to other transformations. At compile time, the compiler identifies sequences of the transformations on each indexable type in data parallel source code and generates data parallel executable code to implement the sequences as a combined operation at runtime using the transformation maps. The compiler also incorporates optimizations that are based on the sequences of transformations into the data parallel executable code. | 01-05-2012 |
20120124564 | MAP TRANSFORMATION IN DATA PARALLEL CODE - A high level programming language provides a map transformation that takes a data parallel algorithm and a set of one or more input indexable types as arguments. The map transformation applies the data parallel algorithm to the set of input indexable types to generate an output indexable type, and returns the output indexable type. The map transformation may be used to fuse one or more data parallel algorithms with another data parallel algorithm. | 05-17-2012 |
20120131552 | READ-ONLY COMMUNICATION OPERATOR - A high level programming language provides a read-only communication operator that prevents a computational space from being written. An indexable type with a rank and element type defines the computational space. For an input indexable type, the read-only communication operator produces an output indexable type with the same rank and element type as the input indexable type but ensures that the output indexable type may not be written. The read-only communication operator ensures that any attempt to write to the output indexable type will be detected as an error at compile time. | 05-24-2012 |
20120166444 | CO-MAP COMMUNICATION OPERATOR - A high level programming language provides a co-map communication operator that maps an input indexable type to an output indexable type according to a function. The function maps an index space corresponding to the output indexable type to an index space corresponding to the input indexable type. By doing so, the co-map communication operator lifts a function on an index space to a function on an indexable type to allow composability with other communication operators. | 06-28-2012 |
20150127915 | ARRAY OBJECT CONCURRENCY IN STM - A software transactional memory system is provided that creates an array of transactional locks for each array object that is accessed by transactions. The system divides the array object into non-overlapping portions and associates each portion with a different transactional lock. The system acquires transactional locks for transactions that access corresponding portions of the array object. By doing so, different portions of the array object can be accessed by different transactions concurrently. The system may use a shared shadow or undo copy for accesses to the array object. | 05-07-2015 |
Patent application number | Description | Published |
20110314256 | Data Parallel Programming Model - Described herein are techniques for enabling a programmer to express a call for a data parallel call-site function in a way that is accessible and usable to the typical programmer. With some of the described techniques, an executable program is generated based upon expressions of those data parallel tasks. During execution of the executable program, data is exchanged between non-data parallel (non-DP) capable hardware and DP capable hardware for the invocation of data parallel functions. | 12-22-2011 |
20110314444 | Compiler-Generated Invocation Stubs for Data Parallel Programming Model - Described herein are techniques for generating invocation stubs for a data parallel programming model so that a data parallel program written in a statically-compiled high-level programming language may be more declarative, reusable, and portable than traditional approaches. With some of the described techniques, invocation stubs are generated by a compiler and those stubs bridge a logical arrangement of data parallel computations to the actual physical arrangement of a target data parallel hardware for that data parallel computation. | 12-22-2011 |
20120159458 | RECONSTRUCTING PROGRAM CONTROL FLOW - The present invention extends to methods, systems, and computer program products for reconstructing program control flow. Embodiments include implementing or morphing a control flow graph (“CFG”) into an arbitrary loop structure to reconstruct (preserve) control flow from original source code. Loop structures can be optimized and can adhere to target platform constraints. In some embodiments, C++ source code (a first higher level format) is translated into a CFG (a lower level format). The CFG is then translated into HLSL source code (a second different higher level format) for subsequent compilation into SLSL bytecode (that can then be executed at a Graphical Processing Unit (“GPU”)). The control flow from the C++ source code is preserved in the HLSL source code. | 06-21-2012 |
20120167062 | EMULATING POINTERS - The present invention extends to methods, systems, and computer program products for emulating pointers. Pointers can be emulated by replacing the pointers with a pair and replacing each dereference site with a switch on the tag and a switch body that executes the emulated pointer access on the corresponding variable the pointer points to. Data flow optimizations can be used to reduce the number of switches and/or reduce the number of cases which need be considered at each emulated pointer access sites. | 06-28-2012 |
20120317394 | TRANSFORMING ADDRESSING ALIGNMENT DURING CODE GENERATION - The present invention extends to methods, systems, and computer program products for changing addressing mode during code generation. Generally, embodiments of the invention use a compiler transformation to transform lower level code from one address alignment to another address alignment. The transformation can be based upon assumptions of a source programming language. Based on the assumptions, the transformation can eliminate arithmetic operations that compensate for different addressing alignment, resulting in more efficient code. Some particular embodiments use a compiler transformation to transform an Intermediate Representation (“IR”) from one-byte addressing alignment into multi-byte (e.g., four-byte) addressing alignment. | 12-13-2012 |
20120317556 | OPTIMIZING EXECUTION OF KERNELS - The present invention extends to methods, systems, and computer program products for optimizing execution of kernels. Embodiments of the invention include an optimization framework for optimizing runtime execution of kernels. During compilation, information about the execution properties of a kernel are identified and stored alongside the executable code for the kernel. At runtime, calling contexts access the information. The calling contexts interpret the information and optimize kernel execution based on the interpretation. | 12-13-2012 |
20120317558 | BINDING EXECUTABLE CODE AT RUNTIME - The present invention extends to methods, systems, and computer program products for binding executable code at runtime. Embodiments of the invention include late binding of specified aspects of code to improve execution performance. A runtime dynamically binds lower level code based on runtime information to optimize execution of a higher level algorithm. Aspects of a higher level algorithm having a requisite (e.g., higher) impact on execution performance can be targeted for late binding. Improved performance can be achieved with minimal runtime costs using late binding for aspects having the requisite execution performance impact. | 12-13-2012 |
20120324430 | ALIASING BUFFERS - The present invention extends to methods, systems, and computer program products for aliasing buffers. Embodiment of the inventions supporting buffer aliasing through introduction of a level of indirection between a source program's buffer accesses and the target executable physical buffers, and binding the logical buffer accesses to actual physical buffer accesses at runtime. A variety of techniques for can be used supporting runtime aliasing of buffers, in a system which otherwise disallows such runtime aliasing between separately defined buffers in the target executable code. Binding of logical buffer accesses in the source program to the actual physical buffers defined in the target executable code is delayed until runtime. | 12-20-2012 |
20130007712 | DEBUGGING IN A MULTIPLE ADDRESS SPACE ENVIRONMENT - The present invention extends to methods, systems, and computer program products for debugging in a multiple address space environment. Embodiments of the invention include techniques for recording debug information used for translating between an abstract unified address space and multiple address spaces at a target system (e.g., a co-processor, such as, a GPU or other accelerator). A table is stored in the recorded debug information. The table includes one or more entries mapping compiler assigned IDs to address spaces. During debugging within a symbolic debugger, the recorded debug information can be used for viewing program data across multiple address spaces in a live debugging session. | 01-03-2013 |
20140223131 | OPTIMIZING DATA TRANSFERS BETWEEN HETEROGENEOUS MEMORY ARENAS - Embodiments are directed to optimizing data transfers between heterogeneous memory arenas. In one scenario, a computer system receives an indication that a data chunk is to be transferred from a first memory arena to a third memory arena, and then determines that for the data chunk to be transferred from the first memory arena to the third arena, the data chunk is to be transferred from the first memory arena to a second memory arena, and from the second memory arena to the third memory arena. The computer system divides the data chunk into smaller data portions and copies a first data portion from the first memory arena to the second memory arena. The computer system then copies the first data portion from the second memory arena to the third memory arena and copies a second data portion from the first memory arena to the second memory arena in parallel. | 08-07-2014 |
20150186165 | EMULATING POINTERS - The present invention extends to methods, systems, and computer program products for emulating pointers. Pointers can be emulated by replacing the pointers with a variable offset pair and replacing each dereference site with a switch on the tag and a switch body that executes the emulated pointer access on the corresponding variable the pointer points to. Data flow optimizations can be used to reduce the number of switches and/or reduce the number of cases which need be considered at each emulated pointer access sites. | 07-02-2015 |
Patent application number | Description | Published |
20120019559 | Methods and Apparatus for Interactive Display of Images and Measurements - Methods and apparatus for the interactive display of images and measurements of samples. A user may interact with embodiments of the present invention to display measurements for a set of biological samples and subsequently display images associated with particular biological samples of interest. For example, selecting data indicators in the set may result in the display of an image associated with a biological sample as well as one or more overlays presenting information of interest as well as controls affecting the display of the image or the information. | 01-26-2012 |
20120207360 | Systems and Methods for Object Identification - Systems and methods for object identification. Objects in a color image of a biological sample are identified by using a signal function to transform the color image into a single-channel image with localized extrema. The localized extrema may be segmented into objects by an iterative thresholding process and a merit function may be used to determine the quality of a given result. | 08-16-2012 |
20120262366 | ELECTRONIC SYSTEMS WITH TOUCH FREE INPUT DEVICES AND ASSOCIATED METHODS - Embodiments of electronic systems, devices, and associated methods of operation are described herein. In one embodiment, a computing system includes an input module configured to acquire images of an input device from a camera, the input device having a plurality of markers. The computing system also includes a sensing module configured to identify segments in the individual acquired images corresponding to the markers. The computing system further includes a calculation module configured to form a temporal trajectory of the input device based on the identified segments and an analysis module configured to correlate the formed temporal trajectory with a computing command. | 10-18-2012 |
20130194173 | TOUCH FREE CONTROL OF ELECTRONIC SYSTEMS AND ASSOCIATED METHODS - Various embodiments of electronic systems and associated methods of hands-free operation are described. In one embodiment, a method includes acquiring an image of a user's finger and/or an object associated with the user's finger with a camera, recognizing a gesture of the user's finger or the object based on the acquired image, and determining if the recognized gesture correlates to a command or a mode change for a processor. If the monitored gesture correlates to a command for a processor, the method includes determining if the processor is currently in a standby mode or in a control mode. If the processor is in the control mode, the method includes executing the command for the processor; otherwise, the method includes reverting to monitoring a gesture of the user's finger. | 08-01-2013 |
20130249793 | TOUCH FREE USER INPUT RECOGNITION - Embodiments of electronic systems, devices, and associated methods of touch free user input recognition are described. In one embodiment, a method includes detecting a plurality of spatial positions of a user's finger or an object associated with the user's finger with respect to time. The method also includes calculating a section length and a direction change for a plurality of pairs of consecutive detected spatial positions of the user's finger or the object associated with the user's finger. The method further includes determining if a temporal trajectory formed by the plurality of spatial positions of the user's finger or the object associated with the user's finger correspond to natural shakiness of the user's finger based on the calculated section lengths and direction changes. | 09-26-2013 |
20150123976 | METHODS AND APPARATUS FOR INTERACTIVE DISPLAY OF IMAGES AND MEASUREMENTS - Methods and apparatus for the interactive display of images and measurements of samples. A user may interact with embodiments of the present invention to display measurements for a set of biological samples and subsequently display images associated with particular biological samples of interest. For example, selecting data indicators in the set may result in the display of an image associated with a biological sample as well as one or more overlays presenting information of interest as well as controls affecting the display of the image or the information. | 05-07-2015 |
20150186755 | Systems and Methods for Object Identification - Systems and methods for object identification. Objects in a color image of a biological sample are identified by using a signal function to transform the color image into a single-channel image with localized extrema. The localized extrema may be segmented into objects by an iterative thresholding process and a merit function may be used to determine the quality of a given result. | 07-02-2015 |
Patent application number | Description | Published |
20100082551 | DATA PLACEMENT TRANSPARENCY FOR HIGH AVAILABILITY AND LOAD BALANCING - A method of updating a clone data map associated with a plurality of nodes of a computer system is disclosed. The clone data map includes node identification data and clone location data. A node failure event of a failed node of the computer system that supports a primary clone is detected. The clone data map is updated such that a secondary clone stored at a node other than the failed node is marked as a new primary clone. In addition, clone data maps may be used to perform node load balancing by placing a substantially similar number of primary clones on each node of a node cluster or may be used to increase or decrease a number of nodes of the node cluster. Further, data fragments that have a heavy usage or a large fragment size may be reduced in size by performing one or more data fragment split operations. | 04-01-2010 |
20100088289 | TRANSITIONING CLONE DATA MAPS AND SYNCHRONIZING WITH A DATA QUERY - Methods, systems, and computer-readable media are disclosed for transitioning clones and clone data access maps in response to node or media failure without blocking queries. In a system, a data request interface is configured to receive a query to access data at a storage device. Data management logic is configured to access clone state information of a plurality of clones including clones in a static state and clones in a transitory state. The data management logic is further configured to process the query to access the data according to the dynamic clone data access map, with functional correctness maintained. | 04-08-2010 |
20100274768 | DE-DUPLICATION AND COMPLETENESS IN MULTI-LOG BASED REPLICATION - Aspects of the subject matter described herein relate to multi-log based replication. In aspects, database fragments are associated with different logs. Each change to a duplicated database record may be recorded in multiple logs. A history data structure is used to determine when duplication schemas are valid. A duplication schema indicates what database fragments duplicate one or more database records. For a particular time range, the duplication schema history is used to determine whether currently available logs include all changes. If multiple logs include the same change, one log may be selected to provide the change. Non-duplicative changes may be placed into a single data stream usable to update a remote database. | 10-28-2010 |
20110251997 | LOGICAL REPLICATION IN CLUSTERED DATABASE SYSTEM WITH ADAPTIVE CLONING - Architecture that addresses an end-to-end solution for logical transactional replication from a shared-nothing clustered database management system, which uses adaptive cloning for high availability. This can be time based using a global logical timestamp. The disclosed architecture, used for refreshing stale clones, does not preserve user transaction boundaries, which is a more complex situation than where the boundaries are preserved. In such a scenario it is probable that for a given data segment no clone of the segment may contain the complete user transaction history, and hence, the history has to be pieced together from the logs of multiple different clones. This is accomplished such that log harvesting is coordinated with the clone state transitions to ensure the correctness of logical replication. | 10-13-2011 |
20120239616 | SEAMLESS UPGRADES IN A DISTRIBUTED DATABASE SYSTEM - Embodiments are directed to providing distributed database service upgrades of database server instances in a computer cluster using multiple database server instances and to monitoring and maintaining a distributed database service during upgrade. In an embodiment, each computer system in a computer cluster instantiates at least two different database server instances on each of the nodes in the cluster. The first database server instances are configured to operate using a current distributed database version and the second instances are configured to operate using a new, updated distributed database service version. The computer system receives an indication that the distributed database service is to be upgraded. Then, based on the received indication, the computer system migrates database replicas from the first database server instances to the second database server instances which operate the new, updated service version, substantially without user-visible downtime. | 09-20-2012 |
20140195489 | LOGICAL REPLICATION IN CLUSTERED DATABASE SYSTEM WITH ADAPTIVE CLONING - Architecture that addresses an end-to-end solution for logical transactional replication from a shared-nothing clustered database management system, which uses adaptive cloning for high availability. This can be time based using a global logical timestamp. The disclosed architecture, used for refreshing stale clones, does not preserve user transaction boundaries, which is a more complex situation than where the boundaries are preserved. In such a scenario it is probable that for a given data segment no clone of the segment may contain the complete user transaction history, and hence, the history has to be pieced together from the logs of multiple different clones. This is accomplished such that log harvesting is coordinated with the clone state transitions to ensure the correctness of logical replication. | 07-10-2014 |
Patent application number | Description | Published |
20140282460 | ENTERPRISE DEVICE UNENROLLMENT - A method and apparatus are described for unenrolling applications, such as from a mobile device. An enterprise can be associated with one or more applications. Rather than uninstalling the applications individually, a single unenroll user interface command can be used to remove all data on the mobile device associated with the enterprise. Moreover, the applications associated with the enterprise can be uninstalled. A user's personal data on the mobile device is not affected during the unenrollment. | 09-18-2014 |
20140282836 | ENTERPRISE DEVICE POLICY MANAGEMENT - When receiving multiple security policy configurations from different management sources, a computer device can apply the most secure of the policy configurations to the device. If one of the policy configurations is removed from the device, a determination can be made regarding which of the remaining security policy configurations is the most secure. Once the determination is made, one of the remaining security policies that is the most secure is applied. | 09-18-2014 |
20140282839 | UNIFIED ENTERPRISE DEVICE ENROLLMENT - A unified enrollment client is described that allows authentication and communication with disparate enterprise management source types. A first enterprise management source type can have a corporate-based management server which is on the premises of the corporation. A second enterprise management source type can have a cloud-based management server in which a corporate server communicates through a federation gateway to a cloud-based management server. Authentication can be handled regardless of the source type through the use of a discovery request which identifies the source type so that the enrollment client knows how to tailor the authentication, if any is needed, to the particular enterprise management source. | 09-18-2014 |
Patent application number | Description | Published |
20130159497 | Heuristic-Based Rejection of Computing Resource Requests - A computing system includes an authentication layer, the authentication layer being programmed to receive a request for resources of the computing system and to authenticate an identity of a user requesting the resources, and a command layer, the command layer being programmed to execute one or more commands from the request for resources, wherein the command layer logs characteristics associated with one or more of the commands, wherein the computing system monitors each logged command to determine when a threshold is met, and wherein the computing system blocks a subsequent request for resources from the user when the threshold is met. | 06-20-2013 |
20140196048 | IDENTIFYING AND THROTTLING TASKS BASED ON TASK INTERACTIVITY - The described implementations relate to processing of electronic data. One implementation is manifest as a system that can include logic and at least one processing device configured to execute the logic. The logic can be configured to receive a first task request to execute a first task that uses a resource when performed. The first task can have an associated first level of interactivity. The logic can also be configured to receive a second task request to execute a second task that also uses the resource when performed. The second task can have an associated second level of interactivity. The logic can also be configured to selectively throttle the first task and the second task based upon the first level of interactivity and the second level of interactivity. | 07-10-2014 |
20140379894 | USING DIFFERENT CONNECTIVITY CHECKS TO DETERMINE CAUSES OF CONNECTIVITY ISSUES - Connectivity is tested using different locations and contexts selected from different possible failure zones. The failure zones may include: client failure zones; Internet failure zones; and online service failure zones. The results relating to different connectivity tests performed using the different failure zones are correlated and analyzed in an attempt to determine a root cause of the connectivity issue. For example, the root cause may be determined to be a configuration problem of the client, a problem with the client's networking equipment, an ISP problem, an Internet backbone problem; a problem of the online service, and the like. Different contexts may also be used when performing the tests. These results may be compared to the other connectivity test results. The results from the tests may be provided to the client experiencing the problem. Aggregated test results may also be used to detect service wide issues and trigger an alert. | 12-25-2014 |
Patent application number | Description | Published |
20090276696 | HIGH-FIDELITY RENDERING OF DOCUMENTS IN VIEWER CLIENTS - Tools and techniques are described for high-fidelity rendering of documents in viewer clients. Methods provided by these tools and techniques may detect whether client systems have a plug-in installed for rendering high-fidelity content. in response to detecting that a given client system has installed the rendering plug-in, these methods may select a first high-fidelity format compatible with the plug-in for rendering the content on the client system. However, in response to detecting that the client system has not installed the rendering plug-in, the methods may select a second high-fidelity format for rendering the content on the client system, without installing the plug-in on the client system. These methods may also request document pages for rendering on the client system in the selected format, and may receive at least a subset of the document pages in the selected format. | 11-05-2009 |
20100218086 | FONT HANDLING FOR VIEWING DOCUMENTS ON THE WEB - A request is received for a rendered document corresponding to a document. The document is retrieved from a storage device. The document is transformed into the rendered document. One or more server font files associated with the rendered document are generated. The rendered document and the server font files are stored. | 08-26-2010 |
20100229086 | CONTENT RENDERING ON A COMPUTER - Portions of content are transformed into portions of rendered content. While the portions of the content are being transformed into portions of the rendered content, each discrete portion of the rendered content can be provided to the application program after that portion is completed. | 09-09-2010 |
20120331377 | Content Rendering on a Computer - Portions of content are transformed into portions of rendered content. While the portions of the content are being transformed into portions of the rendered content, each discrete portion of the rendered content can be provided to the application program after that portion is completed. | 12-27-2012 |