Abstract: Housing for an electronic card includes a chassis that has a base, a cover, and an insertion wall. The base has a female element and a pocket. The electronic card can be introduced/extracted through a window of the insertion wall. The electronic card also includes guide walls, each including: a guide groove to receive the electronic card; a male element to cooperate with the female element; a tongue disposed at an end of the guide wall oriented on a side opposing the insertion wall and forming an arm having a stud to be inserted in the pocket; a clip disposed at the guide wall end and forming an elastic blade with a tooth oriented towards the base, and a face of the blade is oriented towards the cover and is designed to abut the latter; and a backplane electronic card to be inserted between the blade and the arm.

Abstract: Housing for an electronic card includes a chassis that has a base, a cover, and an insertion wall. The base has a female element and a pocket. The electronic card can be introduced/extracted through a window of the insertion wall. The electronic card also includes guide walls, each including: a guide groove to receive the electronic card; a male element to cooperate with the female element; a tongue disposed at an end of the guide wall oriented on a side opposing the insertion wall and forming an arm having a stud to be inserted in the pocket; a clip disposed at the guide wall end and forming an elastic blade with a tooth oriented towards the base, and a face of the blade is oriented towards the cover and is designed to abut the latter; and a backplane electronic card to be inserted between the blade and the arm.

Abstract: Method of broadcasting a set of national and regional DVB-T2 programs not requiring duplicating the broadcasting of the national programs nor uploading the regional programs to a central point. This method is based on the creation of various T2-MI streams using PLP technology. A T2-MI stream is dedicated to the national programs. T2-MI streams are created for the regional programs. The national programs intended to be replaced by regional programs are isolated in specific pipes. The frame durations and the size of the box are harmonized between the various pipes. Each transmitter receives firstly the national T2-MI stream and at least one regional T2-MI stream. It has a device for replacing at least one pipe of the national T2-MI stream with a pipe of the regional T2-MI stream in order to generate the T2-MI stream to be transmitted.

Abstract: Method of broadcasting a set of national and regional DVB-T2 programs not requiring duplicating the broadcasting of the national programs nor uploading the regional programs to a central point. This method is based on the creation of various T2-MI streams using PLP technology. A T2-MI stream is dedicated to the national programs. T2-MI streams are created for the regional programs. The national programs intended to be replaced by regional programs are isolated in specific pipes. The frame durations and the size of the box are harmonized between the various pipes. Each transmitter receives firstly the national T2-MI stream and at least one regional T2-MI stream. It has a device for replacing at least one pipe of the national T2-MI stream with a pipe of the regional T2-MI stream in order to generate the T2-MI stream to be transmitted.

Abstract: The present invention consists of a method for managing the consistency of service lists broadcasted by a digital television network, the service lists containing parameters corresponding to each broadcasted services and being received in a television receiver and stored in a memory, wherein, it comprises the step of the method wherein it comprises the step of triggering a consistency check between said at least one customized list of services and the downloaded update of a list of services available to the receiver, the moment for triggering being chosen by an application in said receiver, so as not to disrupt receiver use by said check. The invention can be used in the field of digital television. The invention concerns also the receiver using the method.

Abstract: A technique wherein the number and position of a quantization parameter node is determined in response to the quantization parameters and a preselected error. The size of scene graph and the corresponding amount of memory required to store the scene graph can be reduced by selective placement of quantization parameter nodes in a scene graph. The scene graph is traversed depth first to establish an order and then traversed in reverse. At each node, a calculation relating to (1) the relative cost of inserting a quantization parameter node and (2) the relative savings that result from insertion of a quantization node is performed. Quantization parameter nodes are selectively placed in response to a result of these calculations. The maximum degree of acceptable error value is chosen for each quantization type. This error value limits the number of quantization parameter nodes that can be placed in a scene graph.

Abstract: A method and system for rendering mixed media at a presentation workstation in response to a mixed media stream, in which the amount of computation is minimized. A tree structure includes nodes, each of which might point to sub-trees, and each of which designates a geometric object, a transformation to be applied to a geometric object, or a time-varying presentation. A scene includes nodes for each element in the scene. Depending from these would be nodes describing aspects of those elements, such as their texture and shape. A root node join the descriptions of each of the objects in the scene. Optimizing the amount of computation includes selecting nodes in the tree and calculating how to render each sub-tree. When possible, rendering information is calculated for only those portions of objects that will ultimately be shown to the user.

Abstract: A technique wherein the number and position of a quantization parameter node is determined in response to the quantization parameters and a preselected error. The size of scene graph and the corresponding amount of memory required to store the scene graph can be reduced by selective placement of quantization parameter nodes in a scene graph. The scene graph is traversed depth first to establish an order and then traversed in reverse. At each node, a calculation relating to (1) the relative cost of inserting a quantization parameter node and (2) the relative savings that result from insertion of a quantization node is performed. Quantization parameter nodes are selectively placed in response to a result of these calculations. The maximum degree of acceptable error value is chosen for each quantization type. This error value limits the number of quantization parameter nodes that can be placed in a scene graph.

Abstract: A technique wherein the number and position of a quantization parameter node is determined in response to the quantization parameters and a preselected error. The size of scene graph and the corresponding amount of memory required to store the scene graph can be reduced by selective placement of quantization parameter nodes in a scene graph. The scene graph is traversed depth first to establish an order and then traversed in reverse. At each node, a calculation relating to (1) the relative cost of inserting a quantization parameter node and (2) the relative savings that result from insertion of a quantization node is performed. Quantization parameter nodes are selectively placed in response to a result of these calculations. The maximum degree of acceptable error value is chosen for each quantization type. This error value limits the number of quantization parameter nodes that can be placed in a scene graph.

Abstract: A technique wherein the number and position of a quantization parameter node is determined in response to the quantization parameters and a preselected error. The size of scene graph and the corresponding amount of memory required to store the scene graph can be reduced by selective placement of quantization parameter nodes in a scene graph. The scene graph is traversed depth first to establish an order and then traversed in reverse. At each node, a calculation relating to (1) the relative cost of inserting a quantization parameter node and (2) the relative savings that result from insertion of a quantization node is performed. Quantization parameter nodes are selectively placed in response to a result of these calculations. The maximum degree of acceptable error value is chosen for each quantization type. This error value limits the number of quantization parameter nodes that can be placed in a scene graph.

Abstract: A technique wherein the number and position of a quantization parameter node is determined in response to the quantization parameters and a preselected error. The size of scene graph and the corresponding amount of memory required to store the scene graph can be reduced by selective placement of quantization parameter nodes in a scene graph. The scene graph is traversed depth first to establish an order and then traversed in reverse. At each node, a calculation relating to (1) the relative cost of inserting a quantization parameter node and (2) the relative savings that result from insertion of a quantization node is performed. Quantization parameter nodes are selectively placed in response to a result of these calculations. The maximum degree of acceptable error value is chosen for each quantization type. This error value limits the number of quantization parameter nodes that can be placed in a scene graph.

Abstract: A technique wherein the number and position of a quantization parameter node is determined in response to the quantization parameters and a preselected error. The size of scene graph and the corresponding amount of memory required to store the scene graph can be reduced by selective placement of quantization parameter nodes in a scene graph. The scene graph is traversed depth first to establish an order and then traversed in reverse. At each node, a calculation relating to (1) the relative cost of inserting a quantization parameter node and (2) the relative savings that result from insertion of a quantization node is performed. Quantization parameter nodes are selectively placed in response to a result of these calculations. The maximum degree of acceptable error value is chosen for each quantization type. This error value limits the number of quantization parameter nodes that can be placed in a scene graph.

Abstract: A technique wherein the number and position of a quantization parameter node is determined in response to the quantization parameters and a preselected error. The size of scene graph and the corresponding amount of memory required to store the scene graph can be reduced by selective placement of quantization parameter nodes in a scene graph. The scene graph is traversed depth first to establish an order and then traversed in reverse. At each node, a calculation relating to (1) the relative cost of inserting a quantization parameter node and (2) the relative savings that result from insertion of a quantization node is performed. Quantization parameter nodes are selectively placed in response to a result of these calculations. The maximum degree of acceptable error value is chosen for each quantization type. This error value limits the number of quantization parameter nodes that can be placed in a scene graph.

Abstract: A method and system for rendering mixed media at a presentation workstation in response to a mixed media stream, in which the amount of computation is minimized. A tree structure includes nodes, each of which might point to sub-trees, and each of which designates a geometric object, a transformation to be applied to a geometric object, or a time-varying presentation. A scene includes nodes for each element in the scene. Depending from these would be nodes describing aspects of those elements, such as their texture and shape. A root node join the descriptions of each of the objects in the scene. Optimizing the amount of computation includes selecting nodes in the tree and calculating how to render each sub-tree. When possible, rendering information is calculated for only those portions of objects that will ultimately be shown to the user.

Abstract: A technique wherein a data stream received by a viewer is responsive to input from other viewers. The data stream is sent from a server to a set of users who generate various responses to the media stream. The responses are analyzed and the analysis or other appropriate response is back to the users. In this way, the information displayed by a user is modified by how other users interact with the media stream. Additionally, the response of a particular user to a data stream may result in personalized information being sent to that user in real time. Various configurations are used to multicast or unicast a program to users and multicast or unicast additional information that is responsive to input from those users.

Abstract: The invention provides a technique for integrating a plurality of media streams, including a main program and a stream of customized information at a terminal so that a user gets a single playback. Prior to streaming a main program to a user, the main program is embedded with placeholders. These placeholders include a definition of a location for insertion of customized media content and a pointer to another server. As the user receives the main program and embedded placeholders, these pointers get directed from the user's terminal to streaming server, which responds by identifying appropriate media and streaming the media to the user's terminal. Software on the user's terminal (also known as a “player”) integrates the various data streams and synchronizes them to a main program. The user's terminal may receive many media streams from different streaming servers and integrate each stream into a single playback.

Abstract: The present invention relates to a method of controlling access to audio-visual programs on a digital receiver of audio-visual programs, wherein it comprises, regardless of the program, a phase of locking the current program generated by an manual action during the current programme displaying. In this way, the user can, with the aid of a particularly simple command, lock or unlock the program currently being displayed.

Abstract: The invention relates to a receiver in a cyclic packet data transmission system, the said system furthermore including at least one transmitter.

Abstract: The present invention relates to a process for constructing databases for digital television services, wherein it comprises a step of tuning to a carrier frequency, a step of extracting the data representing the information table of the network corresponding to this frequency, a step of storing the trio of information items constituted by the information table, the carrier frequency, and an identifier, a step of extracting and storing the trio constituted by the service table, the frequency of the carrier and the identification of the SDT service table.