| Patent application number | Description | Published |
|---|
| 20090066846 | EVENT PRODUCTION KIT - According to various embodiments, an event production kit is provided that includes storage cases for storing production equipment, such as cameras, monitors, and microphones, and an electronic production equipment case for storing an audio mixer, a video switcher, and computers for encoding and distributing the production. In addition, in one embodiment, the electronic production equipment case includes a vertical panel that includes a plurality of ports that are pre-wired to the audio mixer, video switcher, and the computers for coupling the production equipment together. The storage cases and the pre-wired panel facilitate transporting the kit to the event location and reduce the amount of time and resources required for setting up the equipment prior to the event, according to various embodiments. In addition, the selection of the type of equipment included in the kit, according to one embodiment, provides for a high quality, lower cost production than is currently available. | 03-12-2009 |
| 20090070407 | SYSTEMS AND METHODS FOR SCHEDULING, PRODUCING, AND DISTRIBUTING A PRODUCTION OF AN EVENT - According to various embodiments, an event management system is provided that provides a single interface through which a production team can schedule a production of an event, produce the production of the event, and direct distribution of the production. For example, in one embodiment, the event management system provides a web interface through which a member of the production team can create, or build an event, by specifying the name of the event, type of event, specific details about the event, whether the event will be broadcast live, and the date and time of the broadcast for the event. The event management system stores this information and provides at least a portion of it to a distributor that will be distributing (or broadcasting) the event to viewers. In addition, the event management system displays a pre-production checklist to guide the production team through the testing and production set-up process. | 03-12-2009 |
| Patent application number | Description | Published |
|---|
| 20100181999 | TAMPER-DETECTING ELECTRONIC SYSTEM - An apparatus for detecting tampering with an integrated circuit (IC), the apparatus comprising a second circuit comprising at least one conductor for conducting electrical current, the electrical current comprising, during at least one period of time, current of known strength, the electrical current generating a magnetic field, at least one magnetic field sensing device operatively associated with the IC, the sensing device having at least one electrical characteristic responsive to changes in a sensed magnetic field, the magnetic field sensing device being positioned so as to sense the magnetic field generated by current in the at least one conductor, and an analyzer operatively associated with the at least one magnetic field sensing device and the IC, the analyzer determining that the IC is being tampered with based, at least in part, on changes in the at least one electrical characteristic of the at least one magnetic field sensing device in response to changes in the sensed magnetic field generated by the electrical current in the at least one conductor during the at least one period of time. Related apparatus and methods are also described. | 07-22-2010 |
| 20110083194 | SECURITY WITHIN INTEGRATED CIRCUITS - A method for hindering detection of information unintentionally leaked from a secret held in a memory unit is described, the method including receiving a triggering event waiting for at least a first amount of time to pass after the receipt of the triggering event, the memory unit being in a non-operational state during the at least a first amount of time after the at least a first amount of time has passed, changing at least one first condition under which the memory unit operates, thereby causing the memory unit to enter an operational state, waiting for a second amount of time to pass after the changing at least one first condition, and changing, after the second amount of time, at least one second condition under which the memory unit operates, thereby causing the memory unit to enter the non-operational state, wherein access to the secret information is enabled only during the second amount of time, and detection of secret information unintentionally leaked is limited during the first amount of time. Related apparatus and methods are also described. | 04-07-2011 |
| Patent application number | Description | Published |
|---|
| 20100161617 | INDEX SERVER ARCHITECTURE USING TIERED AND SHARDED PHRASE POSTING LISTS - An information retrieval system uses phrases to index, retrieve, organize and describe documents. Phrases are extracted from the document collection. Documents are the indexed according to their included phrases, using phrase posting lists. The phrase posting lists are stored in an cluster of index servers. The phrase posting lists can be tiered into groups, and sharded into partitions. Phrases in a query are identified based on possible phrasifications. A query schedule based on the phrases is created from the phrases, and then optimized to reduce query processing and communication costs. The execution of the query schedule is managed to further reduce or eliminate query processing operations at various ones of the index servers. | 06-24-2010 |
| 20110173527 | Determining Semantically Distinct Regions of a Document - A structured document is translated into an initial hierarchical data structure in accordance with syntactic elements defined in the structured document. The initial hierarchical data structure includes a plurality of nodes, and each node corresponds to one of the syntactic elements. The method then annotates a node with a set of attributes including geometric parameters of semantic elements in the structured document that are associated with the node in accordance with a pseudo-rendering of the structured document. Finally, the method merges the nodes in the initial hierarchical data structure into a tree of merged nodes in accordance with their respective attributes and a set of predefined rules such that each merged node is associated with a semantically distinct region of the pseudo-rendered document. The predefined rules include rules for merging nodes associated with semantic elements that have nearby positions and/or compatible attributes in the pseudo-rendered document. | 07-14-2011 |
| 20110173528 | Determining Semantically Distinct Regions of a Document - A structured document is translated into an initial hierarchical data structure in accordance with syntactic elements defined in the structured document. The initial hierarchical data structure includes a plurality of nodes, and each node corresponds to one of the syntactic elements. The method then annotates a node with a set of attributes including geometric parameters of semantic elements in the structured document that are associated with the node in accordance with a pseudo-rendering of the structured document. Finally, the method merges the nodes in the initial hierarchical data structure into a tree of merged nodes in accordance with their respective attributes and a set of predefined rules such that each merged node is associated with a semantically distinct region of the pseudo-rendered document. The predefined rules include rules for merging nodes associated with semantic elements that have nearby positions and/or compatible attributes in the pseudo-rendered document. | 07-14-2011 |
| 20110196664 | Location Assignment Daemon (LAD) Simulation System and Method - A system and method for simulating a state of a distributed storage system is provided. A current state of a distributed storage system and replication policies for the objects in the distributed storage system is obtained. Proposed modifications to the current state of the distributed storage system are received. The state of the distributed storage system is simulated over time based on the current state of the distributed storage system, the replication policies for the objects in the distributed storage system, and the proposed modifications to the current state of the distributed storage system. Then reports relating to the time evolution of the current state of the distributed storage system are generated based on the simulation. | 08-11-2011 |
| 20110196822 | Method and System For Uploading Data Into A Distributed Storage System - A method for uploading an object into a distributed storage system is implemented at a computing device The computing device splits an object into one or more chunks and uploads the one or more chunks into the distributed storage system. For each uploaded chunk, the computing device receives a write token from the distributed storage system, inserts an entry into an extents table of the object for the chunk in accordance with the received write token and the chunk ID, chunk offset, and chunk size of the chunk, generates a digest of the extents table, the digest representing the one or more chunks that the client expects to be within the distributed storage system, and sends the digest of the extents table to the distributed storage system. The distributed storage system is configured to use the digest to determine whether it has each of the one or more client-expected chunks. | 08-11-2011 |
| 20110196827 | METHOD AND SYSTEM FOR EFFICIENTLY REPLICATING DATA IN NON-RELATIONAL DATABASES - A method replicates data between instances of a distributed database. The method identifies at least two instances of the database at distinct geographic locations. The method tracks changes to the database by storing deltas. Each delta has a row identifier that identifies the piece of data modified, a sequence identifier that specifies the order in which the deltas are applied to the data, and an instance identifier that specifies where the delta was created. The method determines which deltas to send using an egress map that specifies which combinations of row identifier and sequence identifier have been acknowledged as received at other instances. The method builds a transmission matrix that identifies deltas that have not yet been acknowledged as received. The method then transmits deltas identified in the transmission matrix. After receiving acknowledgement that transmitted deltas have been incorporated into databases at other instances, the method updates the egress map. | 08-11-2011 |
| 20110196829 | Method and System for Providing Efficient Access to a Tape Storage System - A method for asynchronously replicating data onto a tape medium is implemented at one or more server computers associated with a distributed storage system and connected to a tape storage system. Upon receiving a first request from a client for storing an object within the tape storage system, a server computer stores the object within a staging sub-system of the distributed storage system and provides a first response to the requesting client. If a predefined condition is met, the server computer transfers objects from the staging sub-system to the tape storage system. For each transferred object, the server computer adds a reference to the object to a tape management sub-system, identifies a corresponding parent object associated with the object and its metadata within a parent object management sub-system of the distributed storage system, and updates the parent object's metadata to include the object's location within the tape storage system. | 08-11-2011 |
| 20110196830 | System and Method for Managing Replicas of Objects In A Distributed Storage System - A system and method for generating replication requests for objects in a distributed storage system is provided. Replication requests for objects in a distributed storage system are generated based at least in part on replication policies for the objects and a current state of the distributed storage system, wherein a respective replication request for a respective object instructs a respective instance of the distributed storage system to replicate the respective object so as to at least partially satisfy a replication policy for the respective object, wherein a respective replication policy includes criteria specifying at least storage device types on which replicas of object are to be stored. At least a subset of the replication requests is then distributed to the respective instances of the distributed storage system for execution. | 08-11-2011 |
| 20110196831 | Pruning of Blob Replicas - A system and method generating and distributing replica removal requests for objects in a distributed storage system is provided. Replica removal requests for objects in a distributed storage system are generated based at least in part on replication policies for the objects. A respective replica removal request instructs a respective instance of the distributed storage system to remove a respective replica of the respective object so as to at least partially satisfy replication policies for the respective object. Then the replica removal requests for the objects in the distributed storage system are distributed to respective instances of the distributed storage system corresponding to the replica removal requests for execution. | 08-11-2011 |
| 20110196832 | Location Assignment Daemon (LAD) For A Distributed Storage System - A system and method for generating replication requests for objects in a distributed storage system is provided. For a respective object in a distributed storage system the following is performed. Replication policies for the object that have not been satisfied are determined. Replication requests are ranked for the object whose replication policies have not been satisfied based on a number of replicas of the object that need to be created in order to satisfy the replication policies for the object. Replication requests are generated for the object based at least in part on the replication policies for the object that have not been satisfied and on a current state of the distributed storage system. At least a subset of the replication requests for the objects in the distributed storage system are distributed to respective instances of the distributed storage system corresponding to the replication requests for execution. | 08-11-2011 |
| 20110196838 | Method and System for Managing Weakly Mutable Data In A Distributed Storage System - A method for managing multiple generations of an object within a distributed storage system is implemented at a computing device. The computing device receives metadata and content of a first generation of an object from a first client connected to the distributed storage system and stores the first generation's metadata and content within a first storage sub-system. The computing device receives metadata and content of a second generation of the object from a second client connected to the distributed storage system and stores the second generation's metadata and content within a second storage sub-system. The computing device independently replicates the first generation's metadata and content from the first storage sub-system to the second storage sub-system and replicates the second generation's metadata and content from the second storage sub-system to the first storage sub-system such that both storage sub-systems include a replica of the object's first and second generations. | 08-11-2011 |
| 20120310903 | Method and System for Efficiently Replicating Data in Non-Relational Databases - A method replicates data between instances of a distributed database. The method identifies at least two instances of the database at distinct geographic locations. The method tracks changes to the database by storing deltas. Each delta has a row identifier that identifies the piece of data modified, a sequence identifier that specifies the order in which the deltas are applied to the data, and an instance identifier that specifies where the delta was created. The method determines which deltas to send using an egress map that specifies which combinations of row identifier and sequence identifier have been acknowledged as received at other instances. The method builds a transmission matrix that identifies deltas that have not yet been acknowledged as received. The method then transmits deltas identified in the transmission matrix. After receiving acknowledgement that transmitted deltas have been incorporated into databases at other instances, the method updates the egress map. | 12-06-2012 |
