Patent application number | Description | Published |
20090157204 | Temporally accurate watermarking system and method of operation - A system for identifying audio data is provided. The system includes a transform system receiving left channel audio data and right channel audio data and generating a plurality of frequency bins of left channel magnitude data, left channel phase data, right channel magnitude data and right channel phase data. A watermarking system receives watermarking data and modifies predetermined frequency bins of the left channel phase data and the right channel phase data to encode the watermarking data. A magnitude system receives the left channel magnitude data and the right channel magnitude data and increases the left channel magnitude data and the right channel magnitude data for one or more of the predetermined frequency bins to a threshold level if the left channel magnitude data and the right channel magnitude data for the corresponding frequency bin is less than the threshold level. | 06-18-2009 |
20100011391 | Decoder-specific content provision system and method - A system for providing decoder-specific content is provided. The system includes a receiver list system receiving a receiver identifier and transmitting authentication data to a receiver. A receiver authentication system receives the authentication data and transmits content delivery data to a content server, such as data that authorizes the content server to provide content to the receiver. A receiver update system transmits update data to the receiver, such as a list of available channels of content. | 01-14-2010 |
20140109103 | DISTRIBUTING TRANSCODING TASKS ACROSS A DYNAMIC SET OF RESOURCES USING A QUEUE RESPONSIVE TO RESTRICTION-INCLUSIVE QUERIES - A method and system for performing processing tasks is disclosed. At a resource, a detection is made as to when the resource is available to perform a processing task. Usage of the resource for performing processing tasks associated with each client of a set of clients is monitored. A restriction limiting which processing task is to be assigned to the resource is identified. The restriction identifies a hierarchy amongst at least two clients of the set of clients. The hierarchy is based on the monitored usage. A query identifying the restriction is generated. The query is transmitted to a remote queue in communication with a plurality of independent resources. The plurality of independent resources includes the resource. A response is received from the queue. The response identifies a processing task. | 04-17-2014 |
20140344398 | CONTROL SYSTEMS AND METHODS FOR CLOUD RESOURCE MANAGEMENT - A machine-implementable method for managing cloud-based transcoding resources available to a content delivery network includes maintaining a queue of video transcoding jobs that may be executed by internal transcoders of the content delivery network or by external transcoders of a plurality of cloud-based resources, utilizing a server of the content delivery network. The method further includes determining, at first and second times, corresponding first and second transcoder supply deviations, and a trend indicator; and determining whether to activate, deactivate, or make no change to the number of transcoders that are currently activated for transcoding, based at least on the second transcoder supply deviation and the trend indicator. | 11-20-2014 |
20150189018 | EXTREMELY LOW DELAY VIDEO TRANSCODING - A content delivery network transcodes content objects from a content provider for transmission to end users. The content delivery network includes network storage and servers. When a content object is uploaded, the network storage stores a copy of the content object, and a copy of the content object is directed to external file-based storage. At least one of the servers directs segments of the content object to a plurality of transcoding servers. Each of the transcoding servers informs a segment engine about which of the segments the transcoding server has received, transcodes the received segment to form a transcoded segment receivable by at least one of the end users, and transmits the transcoded segment to a permanent storage location. The content delivery network verifies that the copy of the content object is stored in the external file-based storage, and deletes the local copy of the content object. | 07-02-2015 |
Patent application number | Description | Published |
20080293450 | Consumption of Items via a User Device - An item-providing system supplies items to a user device for consumption at the user device via communication infrastructure. In one illustrative implementation, the communication infrastructure may rely, in part, on wireless communication. The device may correspond to a book reader device or other type of device. | 11-27-2008 |
20110276863 | Providing Text Content Embedded with Multimedia Content - Text content embedded with multimedia content is provided from a content provider to a client device. The multimedia content may be provided to the client device separate from the text content. In particular, multimedia content metadata indicating a storage location of the multimedia content may be provided to the client device after the text content. The client device may request the multimedia content from the content provider based on the multimedia content metadata. The content provider may send the requested multimedia content to the client device after receiving an authenticated version of the multimedia content metadata. | 11-10-2011 |
20140006567 | Managing a Fleet of Electronic Devices | 01-02-2014 |
20140090033 | Context Aware Content Distribution - Described herein are systems and methods for context aware content distribution. Content such as e-books, presentations, audio, video, applications, and so forth may be distributed to user devices after establishing a trust relationship. An invitation to provide content may be sent to a user device based on the context of the user device, such as proximity to pre-determined devices, location, and so forth. Upon acceptance of the invitation to opt-in to receiving content, a trust relationship may be established which provides for the transfer of content to the user device. | 03-27-2014 |
Patent application number | Description | Published |
20090212914 | DATA MANAGEMENT FOR INTERMITTENTLY CONNECTED SENSORS - A computer implemented method, apparatus, and computer usable program code for managing data on an intermittently connected sensor. A data management system manages the data on radio frequency identification tags. The data management system comprises a radio frequency identification tag capable of storing the data, program code stored on the radio frequency identification tag, and a reader data processing system. The reader data processing system is capable of receiving the data and the program code from the radio frequency identification tag in a radio frequency signal and capable of executing the program code to read the data. | 08-27-2009 |
20100254395 | METHODS AND APPARATUS FOR ROUTING DATA TO NODES - A method is described for routing data from a first node to a second node via a gateway. The second node is detected at the gateway, which determines a local identifier of the second node. A name and a global address are associated with the second node. The name and the global address are published to a name service, such that the first node can retrieve the global address based on the name. The gateway receives data from the first node that is addressed to the global address and transmits the data to the second node using the local identifier. The gateway includes software implementing a service-oriented architecture (SOA). Any number of additional services may be added to process messages passing through the gateway. | 10-07-2010 |
20110013539 | SYSTEM AND METHOD FOR MANAGING INTERNETWORK COMMUNICATIONS AMONG A PLURALITY OF NETWORKS - A system for managing internetwork communications among a plurality of networks includes: (a) a plurality of edge network nodes; each respective edge network node being coupled to manage internetwork communications between a respective own network and other networks of the plurality of networks than the respective own network; and (b) at least one gateway-capable edge network node communicatingly coupled with each respective network node. Each respective edge network node includes a native communication network management unit for managing communications by the respective edge network node using a native communication protocol. Each respective edge network node includes an overlay communication network management unit for managing communications by the respective edge network node using an overlay communication protocol. | 01-20-2011 |
20110103393 | SYSTEM, APPARATUS, AND METHOD FOR COMMUNICATION IN A TACTICAL NETWORK - A system, apparatus, and method are described for communication in a tactical network. A gateway is communicatively couplable to one or more tactical nodes and to one or more other gateways. The gateway is programmed to transmit information to and/or receive information from other gateways. Information exchanged includes gateway attributes, link attributes, service availability, and/or data availability. The gateway optionally provides quality of service, distributed persistence, load balancing, and/or transformation services. Services are provided in a modular, service-oriented architecture (SOA) to accommodate the addition of services and/or applications. | 05-05-2011 |
20140183261 | PASSIVE RFID ASSISTED ACTIVE RFID TAG - A radiofrequency identification (RFID) device includes an active RFID tag that includes a power source and a passive RFID tag reader, the passive RFID tag reader electrically coupled to the power source of the active RFID tag. | 07-03-2014 |
20150016248 | SYSTEM FOR COMMUNICATION IN A TACTICAL NETWORK - A system is described for communication in a tactical network. A gateway is communicatively couplable to one or more tactical nodes and to one or more other gateways. The gateway is programmed to transmit information to and/or receive information from other gateways. Information exchanged includes gateway attributes, link attributes, service availability, and/or data availability. The gateway optionally provides quality of service, distributed persistence, load balancing, and/or transformation services. Services are provided in a modular, service-oriented architecture (SOA) to accommodate the addition of services and/or applications. | 01-15-2015 |
Patent application number | Description | Published |
20100100688 | LOW-LEVEL CONDITIONAL SYNCHRONIZATION SUPPORT - A low-overhead conditional synchronization instruction operates on a synchronization variable which includes a lock bit, a state specification, and bits for user-defined data. The instruction specifies the memory address of the synchronization variable and a condition. During the synchronization instruction the condition is compared to the state specification within an atomic region. The match succeeds if the condition matches the state specification and the lock bit is clear. The synchronization instruction may operate with a cache under a cache coherency protocol, or without a cache, and may include a timeout operand. | 04-22-2010 |
20110145516 | USING BUFFERED STORES OR MONITORING TO FILTER REDUNDANT TRANSACTIONAL ACCESSES AND MECHANISMS FOR MAPPING DATA TO BUFFERED METADATA - A method and apparatus for accelerating a Software Transactional Memory (STM) system is herein described. A data object and metadata for the data object may each be associated with a filter, such as a hardware monitor or ephemerally held filter information. The filter is in a first, default state when no access, such as a read, from the data object has occurred during a pendancy of a transaction. Upon encountering a first access to the metadata, such as a first read, access barrier operations, such as logging of the metadata; setting a read monitor; or updating ephemeral filter information with an ephemeral/buffered store operation, are performed. Upon a subsequent/redundant access to the metadata, such as a second read, access barrier operations are elided to accelerate the subsequent access based on the filter being set to the second state to indicate a previous access occurred. Additionally, mapping of data objects to ephemeral information may be provided by software, such as through a pointer to the ephemeral information associated with the data object; an offset from a base address of the data object to the ephemeral information included associated with the data object; an index into a segment containing the ephemeral information associated with the data object; mapping the data object to the ephemeral information utilizing address arithmetic; and a hash that maps the data object to ephemeral information. | 06-16-2011 |
20110150472 | Data center with free-space optical communications - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 06-23-2011 |
20110150473 | Data center with free-space optical communications - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 06-23-2011 |
20110150480 | Data center with free-space optical communications - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 06-23-2011 |
20110150486 | Data centerr with free-space optical communications - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 06-23-2011 |
20110150489 | Data center with free-space optical communications - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 06-23-2011 |
20110150490 | Data center with free-space optical communications - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 06-23-2011 |
20110150491 | Data center with free-space optical communications - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 06-23-2011 |
20110150492 | Data center with free-space optical communications - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 06-23-2011 |
20110164880 | Data center with free-space optical communications - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 07-07-2011 |
20110262137 | Data center with free-space optical communications - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 10-27-2011 |
20110286748 | Data Center with free-space optical communications - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 11-24-2011 |
20130110853 | SQL CONSTRUCTS PORTED TO NON-SQL DOMAINS | 05-02-2013 |
Patent application number | Description | Published |
20090300134 | LINEAR PROGRAMMING FORMULATION OF RESOURCES IN A DATA CENTER - An exemplary method for performing work in a data center includes receiving a request for resources in a data center, solving a linear programming formulation that accounts for the request and at least some of the resources in the data center and performing work the request based at least in part on the solving of the linear programming formulation. Such a method can include a linear programming formulation that accounts for multi-core chips and DRAM systems. Various other method, devices, systems, etc., are also disclosed. | 12-03-2009 |
20090327580 | OPTIMIZATION OF NON-VOLATILE SOLID-STATE MEMORY BY MOVING DATA BASED ON DATA GENERATION AND MEMORY WEAR - An exemplary method includes writing data to locations in non-volatile solid-state memory and deciding whether to move data written to one location in the memory to another location in the memory based on generation of the data and wear of the other location. Such a method may be used for non-volatile random access memory (NVRAM). Various other methods, devices, systems, etc., are also disclosed. | 12-31-2009 |
20100058347 | DATA CENTER PROGRAMMING MODEL - An exemplary method includes hosting a service at a data center, the service relying on at least one software component developed according to a programming model and the data center comprising a corresponding programming model abstraction layer that abstracts resources of the data center; receiving a request for the service; and in response to the request, assigning at least some of the resources of the data center to the service to allow for fulfilling the request wherein the programming model abstraction layer performs the assigning based in part on reference to a resource class in the at least one software component, the resource class modifiable to account for changes in one or more resources of the data center. Various other devices, systems and methods are also described. | 03-04-2010 |
20100318454 | Function and Constraint Based Service Agreements - An exemplary matching module includes instructions for receipt of information about sellable resources for running web-based services; for a solver for minimizing or maximizing a function subject to constraints; and for output of cost information for purchasing or buying sellable resources for running web-based services where the cost information is based at least in part on minimizing or maximizing the function. An exemplary matching module may be configured to receive information in a domain-specific language. Other methods, devices and systems are also disclosed. | 12-16-2010 |
20110247001 | Resource Management In Computing Scenarios - This patent application pertains to urgency-based resource management in computing scenarios. One implementation can identify processes competing for resources on a system. The implementation can evaluate an urgency of individual competing processes. The implementation can also objectively allocate the resources among the competing processes in a manner that reduces a total of the urgencies of the competing processes. | 10-06-2011 |
20130216234 | DATA CENTER WITH FREE-SPACE OPTICAL COMMUNICATIONS - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 08-22-2013 |
20140143593 | MEMORY SEGMENT REMAPPING TO ADDRESS FRAGMENTATION - The techniques discussed herein identify failed segments of memory in a memory region. The techniques may then manage the failed segments of memory by logically clustering the failed segments of memory at an outlying portion of the memory region using a remapping process. The remapping process may include creating and storing remapping metadata defining segment remapping entries for the memory region. Accordingly, the failure clustering logically eliminates or reduces the memory fragmentation so that a system can allocate larger portions of contiguous memory for object storage. | 05-22-2014 |
20140348510 | DATA CENTER WITH FREE-SPACE OPTICAL COMMUNICATIONS - A data center for executing a data processing application includes processing units, sub-units or servers. Each of the processing units, sub-units or servers can execute a part or all of the data processing application. The processing units, sub-units or servers are electrical disjoint with respect to data communications, but can communicate with each other over free space optical links. | 11-27-2014 |
Patent application number | Description | Published |
20100106758 | COMPUTING DISCRETE FOURIER TRANSFORMS - A system described herein includes a selector component that receives input data that is desirably transformed by way of a Discrete Fourier Transform, wherein the selector component selects one of a plurality of algorithms for computing the Discrete Fourier Transform from a library based at least in part upon a size of the input function. An evaluator component executes the selected one of the plurality of algorithms to compute the Discrete Fourier Transform, wherein the evaluator component causes leverages shared memory of a processor to compute the Discrete Fourier Transform. | 04-29-2010 |
20100114885 | QUERY SUBMISSION PIPELINE USING LINQ - Described is a technology comprising a query processing pipeline in which a SPARQL query is processed into an intermediate LINQ query, which is then processed by a LINQ provider. The LINQ provider decides which instructions correspond to flat database queries, and routes those instructions a database engine (e.g., SQL server) for querying a database. Other instructions are provided to a reasoning engine for processing, e.g., by performing a graph traversal and/or database queries. The pipeline may include a parser that parses the query into an abstract syntax tree, and an optimizer that processes the abstract syntax tree into a LINQ query, including by reordering LINQ instructions and/or associating a flag with each of the instructions that indicates whether to query the database or provide the instruction to a reasoning engine. | 05-06-2010 |
20100332753 | WAIT LOSS SYNCHRONIZATION - Synchronizing threads on loss of memory access monitoring. Using a processor level instruction included as part of an instruction set architecture for a processor, a read, or write monitor to detect writes, or reads or writes respectively from other agents on a first set of one or more memory locations and a read, or write monitor on a second set of one or more different memory locations are set. A processor level instruction is executed, which causes the processor to suspend executing instructions and optionally to enter a low power mode pending loss of a read or write monitor for the first or second set of one or more memory locations. A conflicting access is detected on the first or second set of one or more memory locations or a timeout is detected. As a result, the method includes resuming execution of instructions. | 12-30-2010 |
20100332768 | FLEXIBLE READ- AND WRITE-MONITORED AND BUFFERED MEMORY BLOCKS - A computing system includes a number of threads. The computing system is configured to allow for monitoring and testing memory blocks in a cache memory to determine effects on memory blocks by various agents. The system includes a processor. The processor includes a mechanism implementing an instruction set architecture including instructions accessible by software. The instructions are configured to: set per-hardware-thread, for a first thread, memory access monitoring indicators for a plurality of memory blocks, and test whether any monitoring indicator has been reset by the action of a conflicting memory access by another agent. The processor further includes mechanism configured to: detect conflicting memory accesses by other agents to the monitored memory blocks, and upon such detection of a conflicting access, reset access monitoring indicators corresponding to memory blocks having conflicting memory accesses, and remember that at least one monitoring indicator has been so reset. | 12-30-2010 |
20100332771 | PRIVATE MEMORY REGIONS AND COHERENCE OPTIMIZATIONS - Private or shared read-only memory regions. One embodiment may be practiced in a computing environment including a plurality of agents. A method includes acts for declaring one or more memory regions private to a particular agent or shared read only amongst agents by having software utilize processor level instructions to specify to hardware the private or shared read only memory address regions. The method includes an agent executing a processor level instruction to specify one or more memory regions as private to the agent or shared read-only amongst a plurality of agents. As a result of an agent executing a processor level instruction to specify one or more memory regions as private to the agent or shared read-only amongst a plurality of agents, a hardware component monitoring the one or more memory regions for conflicting accesses or prevents conflicting accesses on the one or more memory regions. | 12-30-2010 |
20100332808 | MINIMIZING CODE DUPLICATION IN AN UNBOUNDED TRANSACTIONAL MEMORY SYSTEM - Minimizing code duplication in an unbounded transactional memory system. A computing apparatus including one or more processors in which it is possible to use a set of common mode-agnostic TM barrier sequences that runs on legacy ISA and extended ISA processors, and that employs hardware filter indicators (when available) to filter redundant applications of TM barriers, and that enables a compiled binary representation of the subject code to run correctly in any of the currently implemented set of transactional memory execution modes, including running the code outside of a transaction, and that enables the same compiled binary to continue to work with future TM implementations which may introduce as yet unknown future TM execution modes. | 12-30-2010 |
20140325154 | Private Memory Regions and Coherence Optimizations - A system for optimizing cache coherence message traffic volume is disclosed. The system includes a plurality of caches in a multi-level memory hierarchy and a plurality of agents. Each agent is associated with a cache. The system includes one or more monitoring engines. Each agent in the plurality of agents is associated with a monitoring engine. The agents can execute a processor level software instruction causing a memory region to be private to the agent. Each of the agents is configured to execute a memory access for data on an associated cache and to send a request for data up the hierarchy on a cache miss. The monitoring engine is configured to intercept request for data from an agent and to prevent snooping for the cache line in peer caches when the cache line associated with a memory region represented as private to the agent. | 10-30-2014 |
Patent application number | Description | Published |
20090117112 | IMMUNOMODULATORY COMPOSITIONS AND USES THEREFOR - The poxvirus proteins designated A41L and 130L bind to three receptor-like protein tyrosine phosphatases (RPTP), leukocyte common antigen related protein (LAR), RPTP-δ, and RPTP-σ, that are present on the cell surface of immune cells. When a host is infected with the poxvirus, binding of A41L to cell surface proteins on the host cells results in suppression of the immune response. The present invention provides agents such as antibodies, and antigen-binding fragments thereof, small molecules, aptamers, small interfering RNAs, and peptide-IgFc fusion polypeptides that interact with one or more of LAR, RPTP-δ, and RPTP-σ expressed by immune cells or interact with a polynucleotide encoding the RPTP. Also provided are RPTP Ig domain oligomers and Fc fusion polypeptides. Such agents are useful for treating an immunological disorder in a subject according to the methods described herein. | 05-07-2009 |
20090264349 | CD30 Ligand - There is disclosed a polypeptide (CD30-L) and DNA sequences, vectors and transformed host cells useful in providing CD30-L polypeptides. The CD30-L polypeptide binds to the receptor known as CD30, which is expressed on a number of cell types, among which are Hodgkin's Disease tumor cells, large cell anaplastic lymphoma cells, adult T-cell leukemia (T-ALL) cells, and a number of other malignant cell types. CD30-L polypeptides find use as carriers for delivering diagnostic and cytotoxic agents to cells expressing the CD30 receptor. | 10-22-2009 |
20090270592 | Purified TNFR preparations - Purified protein preparations comprising tumor necrosis factor are disclosed. | 10-29-2009 |
20100239579 | CD47 Related Compositions and Methods for Treating Immunological Diseases and Disorders - Provide herein are fusion polypeptides that comprise a CD47 extracellular domain or a variant thereof that is fused to a Fc polypeptide. The fusion polypeptides are useful for treating an immunological disease or disorder in a subject according to the methods described herein. The fusion polypeptides are capable of suppressing immunoresponsiveness of an immune cell, inhibiting production of proinflammatory cytokines, including inhibiting immune complex-induced production of cytokines. | 09-23-2010 |
20130129748 | METHODS FOR IDENTIFYING POLYPEPTIDE TARGETS AND USES THEREOF FOR TREATING IMMUNOLOGICAL DISEASES - The present invention provides methods for identifying viral virulence factors and for identifying cellular polypeptides to which the viral polypeptides bind. The cellular polypeptide is useful as a therapeutic target or as a therapeutic agent for treating diseases and disorders, including immunological diseases or disorders. | 05-23-2013 |
Patent application number | Description | Published |
20090112937 | SPREADSHEET COLLABORATION BETWEEN RICH AND BROWSER CLIENTS - Techniques for collaborating on a spreadsheet file by client computers in real time are disclosed herein. In particular, a revision manager module is preferably provided with a host machine which receives updates from the client computers, processes such updates, and then applies them to the spreadsheet file. Additionally, a technique is described for handling updates sent to the revision manager by clients simultaneously or near simultaneously. In this case, the revision manager determines whether the updates to the spreadsheet file are transformable or able to be merged. If so, the updates are combined into the spreadsheet file and applied thereto. If the updates are not transformable, the revision manager confirms that all clients have received all previous updates before applying the non-transformable update to the spreadsheet file. | 04-30-2009 |
20090112990 | PRIVATE VIEWS OF DATA AND LOCAL CALCULATIONS DURING REAL TIME COLLABORATION - Techniques for performing a process during a real time collaboration by multiple users or clients on a spreadsheet file are disclosed herein which may permit calculations to be performed locally by at least one of the clients. By doing so, increases in performance are realized since only data updates need to be provided to the host machine. As such, a determination is preferably made whether calculations performed locally can result in different data. If conflicting data is a possibility, then the calculations for the spreadsheet file will usually be performed remotely by a host machine. If not, then each client capable of doing so will perform the calculations locally and then provide only the updated data to the host machine. The determination of whether to perform the calculations locally or not may also be made dynamically, such as when one or more new formulas are added to the spreadsheet file. | 04-30-2009 |
20120216103 | PRIVATE VIEWS OF DATA AND LOCAL CALCULATIONS DURING REAL TIME COLLABORATION - Techniques for performing a process during a real time collaboration by multiple users or clients on a spreadsheet file are disclosed herein which may permit calculations to be performed locally by at least one of the clients. By doing so, increases in performance are realized since only data updates need to be provided to the host machine. As such, a determination is preferably made whether calculations performed locally can result in different data. If conflicting data is a possibility, then the calculations for the spreadsheet file will usually be performed remotely by a host machine. If not, then each client capable of doing so will perform the calculations locally and then provide only the updated data to the host machine. The determination of whether to perform the calculations locally or not may also be made dynamically, such as when one or more new formulas are added to the spreadsheet file. | 08-23-2012 |
Patent application number | Description | Published |
20130311287 | CONTEXT-AWARE VIDEO PLATFORM SYSTEMS AND METHODS - A video-platform server may obtain and provide context-specific metadata to remote playback devices, including identifying advertising campaigns and/or games that match one or more assets (e.g., actors, locations, articles of clothing, business establishments, or the like) that are depicted in or otherwise associated with a given video segment. | 11-21-2013 |
20130332972 | CONTEXT-AWARE VIDEO PLATFORM SYSTEMS AND METHODS - A video-platform server may obtain and provide context-specific metadata to remote playback devices via an application programming interface. Context-specific metadata may include tags describing one or more assets (e.g., actors, locations, articles of clothing, business establishments, or the like) that are depicted in or otherwise associated with a given video segment. | 12-12-2013 |
20140059595 | CONTEXT-AWARE VIDEO SYSTEMS AND METHODS - Media-playback devices may render context-aware media along with a continually updated set of selectable asset identifiers that correspond to assets (e.g., actors, locations, articles of clothing, business establishments, or the like) currently presented in the media. Using the currently-presented assets or asset controls, a viewer can access contextually relevant information about a selected asset. | 02-27-2014 |
20140344070 | CONTEXT-AWARE VIDEO PLATFORM SYSTEMS AND METHODS - A video-platform server may obtain and provide context-specific metadata to remote playback devices, including identifying advertising campaigns and/or games that match one or more assets (e.g., actors, locations, articles of clothing, business establishments, or the like) that are depicted in or otherwise associated with a given video segment. | 11-20-2014 |
Patent application number | Description | Published |
20130235591 | RESIN-BASED SCULPTURES WITH AESTHETICALLY PLEASING HARDWARE - The disclosure involves resin-based sculptures, such as resin-based lighting fixtures, that include resin pieces secured together by resin-based fasteners. One or more resin-based fasteners secure the resin pieces. Furthermore, the resin-based fasteners are configured to blend in with the resin pieces in a manner that reduces the visibility of the resin-based fasteners. For instance, the resin-based fasteners can have a color and/or shade that match the color and/or shade of the resin strips. | 09-12-2013 |
20130265758 | SUN LIGHT FIXTURE - Implementations of the present invention relate to systems, methods, and apparatus for illuminating and/or providing an aesthetically pleasing lighted structure. In particular, implementations of the present invention provide a light fixture, which can incorporate resin elements surrounding a lighted core. Additionally, one or more implementations also include methods of manufacturing the lighted fixture to achieve a desirable aesthetic thereof. Furthermore, in one or more implementations, the light fixture can resemble or imitate a sun, which can appeal to a viewer thereof. | 10-10-2013 |
20140153257 | LIGHTING FIXTURE ASSEMBLY - Implementations of the present invention comprise lighting fixture assemblies that minimize the visibility of hardware and shadows. In particular, the lighting fixture assemblies may include no supporting hardware extending through an internal space defined, in whole or in part, by the lighting fixture assembly. In addition, the lighting fixture assemblies may include a gap between a bottom/top panel and a side panel of the lighting fixture assembly. Accordingly, lighting fixture assemblies of one or more implementations of the present invention can reduce or eliminate the visibility of internal supporting hardware and shadows on the exterior surfaces of the lighting fixture assemblies. | 06-05-2014 |