Abstract: A method and system for providing charting data visualizations of associated data sets is described. The method includes rendering a graphical user interface that includes one or more data interface regions. The one or more data interface regions are configured to detect and analyze a data interface component encoded with and representing data attributes which are mapped and bound to elements of a chart data visualization. Upon detecting the receipt of the graphical data interface component into the one or more data interface regions, the graphical data interface component is analyzed to determine the data attributes and the mapping. Based on the analysis of the data attributes and the data set, a data chart is rendered on a display and dynamically updated based on user interaction with the charting data visualization.

Abstract: A method and system for providing charting data visualizations of associated data sets is described. The method includes rendering a graphical user interface that includes one or more data interface regions. The one or more data interface regions are configured to detect and analyze a data interface component encoded with and representing data attributes which are mapped and bound to elements of a chart data visualization. Upon detecting the receipt of the graphical data interface component into the one or more data interface regions, the graphical data interface component is analyzed to determine the data attributes and the mapping. Based on the analysis of the data attributes and the data set, a data chart is rendered on a display and dynamically updated based on user interaction with the charting data visualization.

Abstract: Techniques for video encoding and decoding channel switch frames (CSF) to enable acquisition and re/synchronization of the video stream while preserving compression efficiency is provided. Systems and methods to process multimedia data enabling channel switching are presented. The systems generate a CSF with one or more network adaptation layer (NAL) units as a random access point (RAP) frame. Back-to-back frames are transmitted which include the CSF and a non-RAP frame, each having the same frame ID number.

Abstract: To set one or more events without intermediate scheduling of threads in a multi-threaded system, a scheduler is first rendered essentially ineffective. The events are then set, for example, by repeatedly calling a function to set a single event, once for each event to be set. The scheduler is then restored to its normal effectiveness. The scheduler may be rendered ineffective by artificially setting the priority of the current thread being processed to the highest possible priority level. This prevents the current thread from being preempted by another thread during the time that events are being set. After all events have been set, the priority of the current thread is restored to the original priority level, which then restores the scheduler to its normal effectiveness.

Abstract: Techniques for video encoding and decoding channel switch frames (CSF) to enable acquisition and re/synchronization of the video stream while preserving compression efficiency is provided. Systems and methods to process multimedia data enabling channel switching are presented. The systems generate a CSF with one or more network adaptation layer (NAL) units as a random access point (RAP) frame. Back-to-back frames are transmitted which include the CSF and a non-RAP frame, each having the same frame ID number.

Abstract: To set one or more events without intermediate scheduling of threads in a multi-threaded system, a scheduler is first rendered essentially ineffective. The events are then set, for example, by repeatedly calling a function to set a single event, once for each event to be set. The scheduler is then restored to its normal effectiveness. The scheduler may be rendered ineffective by artificially setting the priority of the current thread being processed to the highest possible priority level. This prevents the current thread from being preempted by another thread during the time that events are being set. After all events have been set, the priority of the current thread is restored to the original priority level, which then restores the scheduler to its normal effectiveness.