Patent application number | Description | Published |
20080201337 | METHOD AND SYSTEM FOR COLLECTING INFORMATION FROM COMPUTER SYSTEMS BASED ON A TRUSTED RELATIONSHIP - A method and system for retrieving data from devices in a way that seeks to preserve privacy and ensure the integrity of the retrieved data is provided. A retrieval system is implemented on a network of devices that communicate with each other via a secure communications link. Each device is directly connected to one or more “friend” devices that it trusts. The retrieval system operates by forwarding a request for data from one friend device to another friend device. Each friend device may optionally add data to the request until all the requested data is added. The request with the retrieved data is returned to the device that initiated the request. | 08-21-2008 |
20080298276 | Analytical Framework for Multinode Storage Reliability Analysis - A analytical framework is described for quantitatively analyzing reliability of a multinode storage system, such as a brick storage system. The framework defines a multidimensional state space of the multinode storage system and uses a stochastic process (such as Markov process) to determine a transition time-based metric measuring the reliability of the multinode storage system. The analytical framework is highly scalable and may be used for quantitatively predicting or comparing the reliability of storage systems under various configurations without requiring experimentation and large-scale simulations. | 12-04-2008 |
20090006064 | Replaying Distributed Systems - Replaying distributed systems involves playing a distributed system in a simulator using data from a real-world operation. In an example embodiment, a simulation process is to simulate a distributed system that has a first instance and a second instance. The simulation process includes a first simulation object corresponding to the first instance and a second simulation object corresponding to the second instance. In another example embodiment, communications between the first instance and the second instance are simulated within the simulation process using function calls between the first simulation object and the second simulation object. | 01-01-2009 |
20090100108 | Replica Placement and Repair Strategies in Multinode Storage Systems - A multimode storage system uses a global-placement and local-repair strategy for replica placement and repair of data objects. The data objects are initially placed randomly throughout the storage system, while the subsequent replacement replicas of any lost data objects are placed non-globally, for example within the same cluster as the repair source. This approach aggregates the bandwidth of all leaf switches/routers for repair and thus improves data repair bandwidth and repair speed. The approach also reserves more root switch bandwidth for tasks such as data rebalance, a process migrating data to the new nodes that have replaced failed ones. | 04-16-2009 |
20090248381 | Predicate Checking for Distributed Systems - Predicate checking in conjunction with distributed systems can enable an investigating user to check predicates in the context of instance states and/or distributed states of a distributed system. In an example embodiment, a method entails accepting distributed system simulation data and performing a simulation of a distributed system using the distributed system simulation data to create distributed system simulated states. At least a portion of the distributed system simulated states are exposed. The exposed portion of the distributed system simulated states is retrieved and stored as exposed states for the distributed system. The exposed states for the distributed system are compared to predicate states for the distributed system. If an inconsistency is detected between the exposed states and the predicate states based on the comparing at least one alarm is issued. | 10-01-2009 |
20090271707 | EXTENSIBLE BROWSER PLATFORM FOR WEB APPLICATIONS - An enhancement to a web browser offers an extension mechanism for web applications to utilize client-side resources, thereby moving more extensibility and flexibility to the client-side. The web browser may expose some control interfaces to meet various requirements from web applications. Using the extension mechanism, the web applications are able to offload the cloud servers, function when offline, and improve performance. The extension mechanism also provides users with full control to the data passing through their web browsers. | 10-29-2009 |
20090327458 | ONLINE PREDICATE CHECKING FOR DISTRIBUTED SYSTEMS - Exemplary methods, computer-readable media, and systems describe detecting a performance bug or a nontrivial correctness in a distributed system. The techniques describe using an online predicate checker by specifying a predicate on distributed properties of the distributed system. The process describes monitoring and checking the predicate when the system is deployed and providing a service. In response to detection of the performance bug, the process describes performing modifications of the predicate or installing new predicate. | 12-31-2009 |
20090327995 | ANNOTATION-AIDED CODE GENERATION IN LIBRARY-BASED REPLAY - Techniques for automatically generating replay-enabling code in a library based replay system. The technique requires a code template programmed by an operating system developer. Then, utilizing an application programming interface (API) annotation, either standard or user-defined, customized replay-enabled code is automatically generated for every specific API. | 12-31-2009 |
20090328002 | Analysis and Detection of Responsiveness Bugs - Described techniques increase runtime performance of software running in user space by analyzing and detecting soft hang program errors and giving suggestions for cures. This disclosure pertains to techniques for the analysis, detection, and cure of soft hang program errors. | 12-31-2009 |
20090328079 | SPACE SEPARATION FOR A LIBRARY BASED RECORD AND REPLAY TOOL - Techniques for separating application processes into a system space and a replay space are described in a record and replay tool. The technique permits applications to run in the replay space while a record and replay library runs and manages resources in system space ensuring accurate replay of saved data that are used by applications. | 12-31-2009 |
20100325476 | SYSTEM AND METHOD FOR A DISTRIBUTED OBJECT STORE - An improved system and method for flexible object placement and soft-state indexing of objects in a distributed object store is provided. A distributed object store may be provided by a large number of system nodes operably coupled to a network. A system node provided may include an access module for communicating with a client, an index module for building an index of a replicated data object, a data module for storing a data object on a computer readable medium, and a membership and routing module for detecting the configuration of operable nodes in the distributed system. Upon failure of an index node, the failure may be detected at other nodes, including those nodes that store the replicas of the object. These nodes may then send new index rebuilding requests to a different node that may rebuild the index for servicing any access request to the object. | 12-23-2010 |
20110178788 | Predicate Checking for Distributed Systems - Predicate checking in conjunction with distributed systems can enable an investigating user to check predicates in the context of instance states and/or distributed states of a distributed system. In an example embodiment, a method entails accepting distributed system simulation data and performing a simulation of a distributed system using the distributed system simulation data to create distributed system simulated states. At least a portion of the distributed system simulated states are exposed. The exposed portion of the distributed system simulated states is retrieved and stored as exposed states for the distributed system. The exposed states for the distributed system are compared to predicate states for the distributed system. If an inconsistency is detected between the exposed states and the predicate states based on the comparing, at least one alarm is issued. | 07-21-2011 |
20110306639 | HYDROCARBYLIDENE NITROHYDROZINECARBOXIMIDAMIDES AND A METHOD FOR MAKING THE SAME, AS WELL AS THEIR USES AS AN INSECTICIDE - The present invention discloses hydrocarbylidene nitrohydrozinecarboximidamides and the use thereof as well as a method for making the same. The structural general formula of the compounds are shown in formula I, wherein, R1 is C1-C10 saturated and/or unsaturated aliphatic hydrocarbonyl, benzyl, substituted benzyl, halogenated picolyl, halogenated thiazolyl methyl, tetrahydrofuryl methyl or oxazolyl methyl; R2 is hydrogen, C1-C5 saturated and/or unsaturated aliphatic hydrocarbonyl, phenyl, substituted phenyl, pyridyl or substituted pyridyl; R3 is hydrogen, C1-C10 saturated and/or unsaturated aliphatic hydrocarbonyl, furyl, phenyl, substituted phenyl, benzyl or substituted benzyl. The tests of insecticidal activity show that the hydrocarbylidene nitrohydrozinecarboximidamides shown by formula (I) have high preventive efficiency against insect pests of plants, such as aphid, plant hopper, cotton bollworm, asparagus caterpillar, and the like, and can be used as plant insecticides. | 12-15-2011 |
20120103508 | METHOD OF MANUFACTURING A CARD - The present invention discloses a method of manufacturing a (plastic) card with a flexible inlay. Said method comprises following steps: manufacturing a upper housing and a lower housing; coating colloidal on inner surfaces of the upper housing and the lower housing; placing the inlay in said upper housing or the lower housing; closing the upper housing and the lower housing together to have a housing-closed card; laminating the closed housings to have a finished card. Preferably, there is provided in either the upper housing or the lower housing a slot(s) in match with the inlay(s); the inlay is placed within the slot accordingly. By means of the invention, a card with flexible inlay is manufactured, for example, an intelligent card (i.e., smart card) comprising a flexible and active circuit board and a flexible display, and properties of a new kind of card with flexible inlay are guaranteed. | 05-03-2012 |
20120127206 | MULTI-TOUCH INTERFACE GESTURES FOR KEYBOARD AND/OR MOUSE INPUTS - A mouse-and-keyboard based user interface is updated based on gestures made on a touch screen that is displaying the mouse-and-keyboard based user interface. The user interface update process includes the steps of receiving one or more touch events in response to a gesture made on the touch screen, translating the touch events to a mouse-and-keyboard based command, transmitting the mouse-and-keyboard based command to an operating system, and receiving an updated display in response thereto. | 05-24-2012 |
20120131559 | Automatic Program Partition For Targeted Replay - Program partitioning of an application can include creating execution flow graphs and static flow graphs of targeted functions or operations of the application. Based on the execution flow graphs or static flow graphs, replay interfaces are created. The replay interfaces provide data flows that are usable in re-execution of the application during program development. | 05-24-2012 |
20120290867 | MATRIX COMPUTATION FRAMEWORK - Described herein are technologies pertaining to matrix computation. A computer-executable algorithm that is configured to execute perform a sequence of computations over a matrix tile is received and translated into a global directed acyclic graph that includes vertices that perform a sequence of matrix computations and edges that represent data dependencies amongst vertices. A vertex in the global directed acyclic graph is represented by a local directed acyclic graph that includes vertices that perform a sequence of matrix computations at the block level, thereby facilitating pipelined, data-driven matrix computation. | 11-15-2012 |
20130113655 | Location Watching - Techniques for watching a location of a device with respect to a destination target include obtaining a current location of a device from a localization operation, calculating an interval, and performing a next localization operation after the interval has expired. The interval may be calculated based on a velocity and a distance from the current location to a destination target. The techniques may also include calculating a displacement distance from the current location and adjusting the interval based on the displacement distance to thereby adjust a time for performing the next localization operation. The techniques may include performing state detection to determine a motion state of the device and performing the next localization operation based on the determined motion state. | 05-09-2013 |
20140288826 | Location Watching - Techniques for watching a location of a device with respect to a destination target include obtaining a current location of a device from a localization operation, calculating an interval, and performing a next localization operation after the interval has expired. The interval may be calculated based on a velocity and a distance from the current location to a destination target. The techniques may also include calculating a displacement distance from the current location and adjusting the interval based on the displacement distance to thereby adjust a time for performing the next localization operation. The techniques may include performing state detection to determine a motion state of the device and performing the next localization operation based on the determined motion state. | 09-25-2014 |
20140324935 | MATRIX COMPUTATION FRAMEWORK - Described herein are technologies pertaining to matrix computation. A computer-executable algorithm that is configured to execute perform a sequence of computations over a matrix tile is received and translated into a global directed acyclic graph that includes vertices that perform a sequence of matrix computations and edges that represent data dependencies amongst vertices. A vertex in the global directed acyclic graph is represented by a local directed acyclic graph that includes vertices that perform a sequence of matrix computations at the block level, thereby facilitating pipelined, data-driven matrix computation. | 10-30-2014 |