Patent application number | Description | Published |
20090125722 | CROSS-PLATFORM DIGITAL RIGHTS MANAGEMENT PROVIDING MULTI-LEVEL SECURITY INFORMATION FLOW TRACKING - A method and system for generating and controlling access to copy-protected digital media files. Digital media content is obtained and encoded in electronic file using a media codec. The encoded media content is encrypted in the electronic file and a multi-format renderer configured to render the encoded, encrypted electronic file is embedded in the electronic file. When the digital file is accessed, the multi-format renderer generates an invocation code identifying an operation-type in response to a requested operation. A transaction ID storing a user-access policy and associated with the electronic file is retrieved and compared to the invocation code. Based on a result of the comparison of the invocation code and the user-access policy, the multi-format renderer selectively allows the invocation code. | 05-14-2009 |
20140297292 | SYSTEM AND METHOD FOR INCREASING TRANSMISSION BANDWIDTH EFFICIENCY ("EBT2") - Systems and methods for increasing transmission bandwidth efficiency by the analysis and synthesis of the ultimate components of transmitted content are presented. To implement such a system, a dictionary or database of elemental codewords can be generated from a set of audio clips. Using such a database, a given arbitrary song or other audio file can be expressed as a series of such codewords, where each given codeword in the series is a compressed audio packet that can be used as is, or, for example, can be tagged to be modified to better match the corresponding portion of the original audio file. Each codeword in the database has an index number or unique identifier. For a relatively small number of bits used in a unique ID, e.g. 27-30, several hundreds of millions of codewords can be uniquely identified. By providing the database of codewords to receivers of a broadcast or content delivery system in advance, instead of broadcasting or streaming the actual compressed audio signal, all that need be transmitted is the series of identifiers along with any modification instructions to the identified codewords. After reception, intelligence on the receiver having access to a locally stored copy of the dictionary can reconstruct the original audio clip by accessing the codewords via the received IDs, modify them as instructed by the modification instructions, further modify the codewords either individually or in groups using the audio profile of the original audio file (also sent by the encoder) and play back a generated sequence of phase corrected codewords and modified codewords as instructed. In exemplary embodiments of the present invention, such modification can extend into neighboring codewords, and can utilize either or both (i) cross correlation based time alignment and (ii) phase continuity between harmonics, to achieve higher fidelity to the original audio clip. | 10-02-2014 |
20150142456 | SYSTEMS AND METHODS FOR IMPLEMENTING EFFICIENT CROSS-FADING BETWEEN COMPRESSED AUDIO STREAMS - Systems and methods are presented for efficient cross-fading (or other multiple clip processing) of compressed domain information streams on a user or client device, such as a telephone, tablet, computer or MP3 player, or any consumer device with audio playback. Exemplary implementation systems may provide cross-fade between AAC/Enhanced AAC Plus (EAACPIus) information streams or between MP3 information streams or even between information streams of unmatched formats (e.g. AAC to MP3 or MP3 to AAC). Furthermore, these systems are distinguished by the fact that cross-fade is directly applied to the compressed bitstreams so that a single decode operation may be performed on the resulting bitstream. Moreover, using the described methods, similar cross fade in the compressed domain between information streams utilizing other formats of compression, such as, for example, MP2, AC-3, PAC, etc. can also be advantageously implemented. Thus, in exemplary embodiments of the present invention a set of frames from each input stream associated with the time interval in which a cross fade is decoded, and combined and recoded with a cross fade or other effect now in the compressed bitstream. Once sent through the client device's decoder, the user hears the transitional effect. The only input data that is decoded and processed is that associated with the portion of each stream used in the crossfade, blend or other interstitial, and thus the vast majority of the input streams are left compressed. | 05-21-2015 |
Patent application number | Description | Published |
20090281999 | SYMBOLIC PROGRAM ANALYSIS USING TERM REWRITING AND GENERALIZATION - Systems and methods are disclosed for analyzing data-flow using program expressions or terms by extracting a control flow graph node from a work list; merging symbolic term values at join nodes; performing simplification of term values using rewriting logic; determining successors of the graph node to which data must be propagated; and updating symbolic data for elements of the successors. | 11-12-2009 |
20100235817 | FAST AND ACCURATE DATA RACE DETECTION FOR CONCURRENT PROGRAMS WITH ASYNCHRONOUS CALLS - A system and method for analyzing a concurrent program employ asynchronous function calls for communication and recursion. A control flow graph is constructed based on a context-sensitive pointer analysis, whereupon encountering a function pointer, a points-to set of the function pointer is computed in a context-sensitive fashion to determine a set of potential function calls. The context-sensitive pointer analysis is terminated when no new potential function calls are encountered and where the potential function calls may contribute new data races other than those that exist in the contexts traversed thus far. To decide this, a characterization of pointer aliasing based upon complete update sequences is employed. A set of contexts that may contribute to different data races are enumerated by tracking update sequences for function and lock pointers and pointers that are shared or point to shared memory locations. Data race detection is carried out on the control flow graph. | 09-16-2010 |
20100281306 | Modular Bug Detection with Inertial Refinement - Systems and methods are disclosed to detect an error in a software with a computer readable code by applying a modular analysis based on the principle of structural abstraction and refinement of program structure; and detecting an assertion violation indicative of a software bug. | 11-04-2010 |
20110078511 | PRECISE THREAD-MODULAR SUMMARIZATION OF CONCURRENT PROGRAMS - Methods and systems for concurrent program verification. A concurrent program is summarized into a symbolic interference skeleton (IS) using data flow analysis. Sequential consistency constraints are enforced on read and write events in the IS. Error conditions are checked together with the IS using a processor. | 03-31-2011 |
20120011492 | SYSTEMS AND METHODS FOR CONCURRENCY ANALYSIS - Systems and methods are disclosed to check properties of bounded concurrent programs by encoding concurrent control flow graph (CFG) and property for programming threads as a first-order formula F | 01-12-2012 |
20120117547 | EMBEDDING CLASS HIERARCHY INTO OBJECT MODELS FOR MULTIPLE CLASS INHERITANCE - A model is provided for transforming a program with a priori given class hierarchy that is induced by inheritance. An inheritance remover is configured to remove inheritance from a given program to produce an analysis-friendly program which does not include virtual-function pointer tables and runtime libraries associated with inheritance-related operations. The analysis-friendly program preserves the semantics of the given program with respect to a given class hierarchy. A clarifier is configured to identify implicit expressions and function calls and transform the given program into at least one intermediate program having explicit expressions and function calls. | 05-10-2012 |
20120179935 | DYNAMIC TEST GENERATION FOR CONCURRENT PROGRAMS - A computer implemented method for dynamic test generation for concurrent programs, which uses a combination of concrete and symbolic execution of the program to systematically cover all the intra-thread program branches and inter-thread interleavings of shared accesses. In addition, a coverage summary based pruning technique, which is a general framework for soundly removing both redundant paths and redundant interleavings and is capable of speeding up dynamic testing exponentially. This pruning framework also allows flexible trade-offs between pruning power and computational overhead to be exploited using various approximations. | 07-12-2012 |
Patent application number | Description | Published |
20090185496 | Network performance and reliability evaluation taking into account attributes other than only the capacities of edges - Network performability characteristics with improved accuracy are derived by taking into account, in the various analyzed network failure states, attributes of elements at the logical level other than just the capacities of edges, as well as by taking into account one or more “abstract components,” such as scheduled maintenance, and by using multiple traffic matrices. | 07-23-2009 |
20090185499 | Network performance and reliability evaluation taking into account abstract components - Network performability characteristics with improved accuracy are derived by taking into account, in the various analyzed network failure states, attributes of elements at the logical level other than just the capacities of edges, as well as by taking into account one or more “abstract components,” such as scheduled maintenance, and by using multiple traffic matrices. | 07-23-2009 |
20090187795 | Network performance and reliability evaluation taking into account multiple traffic matrices - Network performability characteristics with improved accuracy are derived by taking into account, in the various analyzed network failure states, attributes of elements at the logical level other than just the capacities of edges, as well as by taking into account one or more “abstract components,” such as scheduled maintenance, and by using multiple traffic matrices. | 07-23-2009 |
Patent application number | Description | Published |
20100128629 | METHODS AND APPARATUS TO SELECT COMPOSITE LINK COST-OUT THRESHOLDS - Methods and apparatus to select composite link cost-out thresholds are disclosed. A disclosed example method comprises collecting traffic statistics for a communication network, computing, based on the collected traffic statistics, a plurality of flow rates for a composite link of the communication network for respective ones of a plurality of potential fault conditions for the composite link, computing a plurality of remaining capacities of the composite link for respective ones of the plurality of fault conditions, computing a plurality of differences between respective ones of the plurality of flow rates and the plurality of remaining capacities, and selecting a cost-out threshold for the composite link based on the plurality of computed differences. | 05-27-2010 |
20110033183 | 1:N sparing of router resources at geographically dispersed locations - Systems and methods are described that that dynamically configure high-speed data link lightpaths between access routers and backbone routers at geographically dispersed locations to reassign traffic when a backbone router fails or is removed from service. Embodiments reduce the quantity of backbone router ports used in dual backbone router-homed networks. | 02-10-2011 |
20110122764 | Cross-layer reconfiguration method for surviving multiple-link network failures - A second link in a network is reconfigured after failure of a first link, so that multiple-link failures may be survived. After receipt of an OSPF link state advertisement (LSA) indicating use of a backup path b | 05-26-2011 |
20120269058 | Cross-Layer Reconfiguration Method for Surviving Multiple-Link Network Failures - A second link in a network is reconfigured after failure of a first link, so that multiple-link failures may be survived. After receipt of an OSPF link state advertisement (LSA) indicating use of a backup path b | 10-25-2012 |
20130163985 | 1:N Sparing Of Router Resources At Geographically Dispersed Locations - Systems and methods are described that that dynamically configure high-speed data link lightpaths between access routers and backbone routers at geographically dispersed locations to reassign traffic when a backbone router fails or is removed from service. Embodiments reduce the quantity of backbone router ports used in dual backbone router-homed networks. | 06-27-2013 |
20150155962 | METHOD AND APPARATUS FOR ROUTING TRAFFIC USING ASYMMETRICAL OPTICAL CONNECTIONS - A method, computer-readable storage device and apparatus for routing traffic in a reconfigurable optical add-drop multiplexer layer of a dense wavelength division multiplexing network are disclosed. For example, the method determines the reconfigurable optical add-drop multiplexer layer has asymmetric traffic, and routes the asymmetric traffic in the reconfigurable optical add-drop multiplexer layer over a plurality of asymmetrical optical connections, wherein the plurality of asymmetrical optical connections is provided with only uni-directional equipment in the reconfigurable optical add-drop multiplexer layer. | 06-04-2015 |