Abstract: The invention provides a computer-implemented method for identifying the type of a vessel of a subject based on Doppler ultrasound data acquired from a subject. The computer-implemented method includes receiving ultrasound data acquired from the subject by way of an ultrasound probe and generating color Doppler ultrasound data from the received ultrasound data. A representation of a vessel of the subject is segmented from the color Doppler ultrasound data and pulse wave Doppler ultrasound data is obtained from the segmented vessel representation. A feature extraction algorithm is then applied to the pulse wave Doppler ultrasound data, thereby extracting a feature of the flow within the segmented vessel and the type of the vessel is identified as an artery or a vein based on the extracted feature of the flow.

Abstract: The invention relates to a method of imaging an interior of a turbid medium, a device for imaging an interior of a turbid medium, and a medical image acquisition device. A turbid medium is accommodated in a receiving volume (5), light from a light source is coupled into (10) and out of the receiving volume and detected (15) after which a dataset is obtained from the detected light (20). The dataset is then communicated to an image reconstruction algorithm (30) and an image of an interior of the turbid medium is reconstructed based on the detected light (35). According to the invention the dataset is changed prior to communicating the dataset to the image reconstruction algorithm into a further dataset (25), with a further dataset satisfying an input assumption underlying the image reconstruction algorithm.

Abstract: In a method for providing copy-protection services on a storage medium (for instance a solid state memory module), the data are arranged in sectors to which a field (S4T) is associated, where said field contains a random value Ri which is changed randomly when writing data to said sector. By encrypting the data stored on the medium using a key which depends critically on said random numbers, bit-by-bit copies (apart from said random numbers, which can not be deterministically changed by an application) to a second storage medium or recopies from some intermediate storage medium, can not be decrypted because the values of said random numbers will have changed, thus preventing unauthorized duplication and replay attacks.

Abstract: Data, stored in MRAM-cells should be protected against misuse or read-out by unauthorized persons. The present invention provides an array of MRAM-cells provided with a security device for destroying data stored in the MRAM-cells when they are tampered with. This is achieved by placing a permanent magnet adjacent the MRAM-array in combination with a soft-magnetic flux-closing layer. As long as the soft-magnetic layer is present, the magnetic field lines from the permanent magnet are deviated and flow through this soft-magnetic layer. When somebody is tampering with the MRAM-array, e.g. by means of reverse engineering, and the flux-closing layer is removed, the flux is no longer deviated and affects the nearby MRAM-array, thus destroying the data stored in the MRAM-cells.

Abstract: A universal memory device is presented that provides adaptability to existing hardware and software environments. The memory can “mimic” existing memory technology combining the advantages of integrating all memory capacity into one single technology and still providing the implicit protections and access characteristics known from the different existing memory technologies.

Abstract: Data, stored in MRAM-cells should be protected against misuse or read-out by unauthorised persons. The present invention provides an array of MRAM-cells provided with a security device for destroying data stored in the MRAM-cells when they are tampered with. This is achieved by placing a permanent magnet adjacent the MRAM-array in combination with a soft-magnetic flux-closing layer. As long as the soft-magnetic layer is present, the magnetic field lines from the permanent magnet are deviated and flow through this soft-magnetic layer. When somebody is tampering with the MRAM-array, e.g. by means of reverse engineering, and the flux-closing layer is removed, the flux is no longer deviated and affects the nearby MRAM-array, thus destroying the data stored in the MRAM-cells.

Abstract: Data, stored in MRAM-cells (12) should be protected against misuse or read-out by unauthorised persons. The present invention provides an array (10) of MRAM-cells (12) provided with a security device (14) for destroying data stored in the MRAM-cells (12) when they are tampered with. This is achieved by placing a permanent magnet (16) adjacent the MRAM-array (10) in combination with a soft-magnetic flux-closing layer (18). As long as the soft-magnetic layer (18) is present, the magnetic field lines (20) from the permanent magnet (16) are deviated and flow through this soft-magnetic layer (18). When somebody is tampering with the MRAM-array (10), e.g. by means of reverse engineering, and the flux-closing layer (18) is removed, the flux is no longer deviated and affects the nearby MRAM-array (10), thus destroying the data stored in the MRAM-cells (12).

Abstract: The invention relates to a method of imaging an interior of a turbid medium, a device for imaging an interior of a turbid medium, and a medical image acquisition device. A turbid medium is accommodated in a receiving volume (5), light from a light source is coupled into (10) and out of the receiving volume and detected (15) after which a dataset is obtained from the detected light (20). The dataset is then communicated to an image reconstruction algorithm (30) and an image of an interior of the turbid medium is reconstructed based on the detected light (35). According to the invention the dataset is changed prior to communicating the dataset to the image reconstruction algorithm into a further dataset (25), with a further dataset satisfying an input assumption underlying the image reconstruction algorithm.

Abstract: In order to provide a content managing module (100, 102) as well as a method for controlling interactive applications, wherein a first data stream (D1) comprising at least one first interactive application with first interactive content is received, the first data stream (D1) being transmitted on at least one first channel, wherein it is possible to prevent a lack of interactive content stream when a consumer or user changes channel (and somewhat later changes back) while watching interactive content, it is proposed to keep receiving the first interactive content when switching (s) from the first channel to at least one second channel on which a second data stream (D2), in particular comprising at least one second interactive application with second interactive content, is transmitted.

Abstract: The present invention relates to a write controller for a memory with a plurality of non-volatile storage cells, a read controller for a memory with a plurality of nonvolatile storage cells, to a combined write/read controller, to a solid state device comprising a memory with a plurality of non-volatile storage cells, a programmer device for writing a binary code to a non-volatile memory, to a method for writing data comprising at least one input bit to a memory having non-volatile storage cells, and to a method for controlling the integrity of data comprising at least one input bit stored in non-volatile storage cells of a memory. The basic concept of the present invention is to extend information stored in a non-volatile memory by at least one checking bit. The checking bit is allocated to one code bit, or to each of a plurality of code bits.

Abstract: There is provided a method of increasing boot-up speed in a computer system (10). The system (10) includes computing devices (20) for processing data and a data store (60) coupled thereto for providing data to and receiving data from the devices (20). The store (60) is operable to write and/or read data in several regions (T1, T2, T3) of a data medium (200). Access between the regions is subject to associated jump delays (SK1/2, SK2/3; SK1/3, SL3/2). The store (60) includes a cache (320) for temporarily storing data read from and/or for writing data to the medium (200). On initial boot-up of the system (20), a log is made of a sequence in which the regions (T1, T2, T3) are accessed. Moreover, on subsequent boot-up of the system (10), the log is used to store data read from the medium (200) temporarily in the cache (310, 320) so as to provide for a more temporally efficient sequence of accessing the regions (T1, T2, T3) for speeding up said subsequent boot-up.

Abstract: A method for breathing of scheduling algorithms for a storage device (110). The method including: (a) computing a worst-case duration of a breathing cycle (P) for the storage device (110); (b) starting a breathing cycle; (c) determining if one of the following becomes true before the end of P: (i) a number of real-time requests is at least a predetermined threshold based on a number of data streams and performance parameters of the storage device; and (ii) a number of pending requests for any single stream becomes more than one; (d) if at least one of (i) and (ii) remain true during the duration of P, starting a subsequent breathing cycle after completion of the breathing cycle; and (e) if both of (i) and (ii) are not true during the duration of P, waiting P time units from the start of the breathing cycle before starting the subsequent breathing cycle.

Abstract: A digital television system includes a first tuner and first decoder for tuning to and decoding a selected digital television signal. A second tuner and second decoder are included for tuning to and decoding a separate digital television signal containing mosaic views of the receivable television signals. Upon a channel change command, first tuner is tuned to the new channel. Simultaneously, the output from the second decoder corresponding to the new channel is applied to the display. As such, the new channel is available for immediate viewing without waiting during the typical decoder delay.

Abstract: In a method for providing copy-protection services on a storage medium (for instance a solid state memory module), the data are arranged in sectors to which a field (S4T) is associated, where said field contains a random value Ri which is changed randomly when writing data to said sector. By encrypting the data stored on the medium using a key which depends critically on said random numbers, bit-by-bit copies (apart from said random numbers, which can not be deterministically changed by an application) to a second storage medium or recopies from some intermediate storage medium, can not be decrypted because the values of said random numbers will have changed, thus preventing unauthorized duplication and replay attacks.

Abstract: The invention relates to real-time handling of data in more in particular, estimation of time needed to retrieve frames for video rendering, taking fragmentation of frames into account. Especially for data retrieval for trick-play, this is non-trivial, as it is not known on beforehand whether the frames to be retrieved are fragmented. Retrieval of non contiguously fragmented frames takes at least twice as much time as retrieval of a non-fragmented frame. The invention provides various advantageous embodiments, taking into account that when allocation units are substantially larger than the size of frames to be retrieved. An embodiment of the invention provides a method for accurate retrieval time estimation when trick play speed, allocation unit size, frame size and logical data distance between frames to retrieve is known.

Abstract: Non-contiguous storage of data objects seriously hampers retrieval speed of said data objects (202). Furthermore, when multiple data objects are retrieved of which some are fragmented, retrieval time of all data objects gets less predictable. Therefore, it is desirable to retrieve non-fragmented data objects only. For certain cases, this is possible, as not necessarily one specific data object has to be retrieved. In such cases, retrieval of a similar data object, render of the same type, is sufficient. To this, the invention provides among others a method and circuit (124) for retrieval of data. The invention is especially suitable for retrieving audiovisual data for trickplay. When a first frame selected for rendering is stored fragmented, a second, not fragmented frame is selected and retrieved instead of the first frame.

Abstract: In a method for providing copy-protection services on a storage medium (for instance a solid state memory module), the data are arranged in sectors to which a field (S4T) is associated, where said field contains a random value Ri which is changed randomly when writing data to said sector. By encrypting the data stored on the medium using a key which depends critically on said random numbers, bit-by-bit copies (apart from said random numbers, which can not be deterministically changed by an application) to a second storage medium or recopies from some intermediate storage medium, can not be decrypted because the values of said random numbers will have changed, thus preventing unauthorized duplication and replay attacks.

Abstract: When a stream of audio-visual data like a television program is recorded (110) with a digital video recorder comprising a compression engine (113) for compressing the stream prior to storage using a variable bit-rate compression technique, the size of the full stream to be stored is unknown. The invention provides a method which solves this problem by providing information on the complexity of the stream to be stored. With this information, combined with information on the duration of the stream of audio-visual data and the compression algorithm used to compress the stream, the amount of storage space to be reserved for storing the stream of audio-visual data can be determined.

Abstract: Real-time software and a non-time OS co-exist in a system, wherein the real-time software controls the requests from the non-real-time OS for access of a shared resource. The requests are put into a queue and the real-time software determines when which pending request gets executed.

Abstract: A computer system includes a system memory (SM) and a non-volatile memory (NVM). The computer system is arranged to copy at least a part of the system state, stored in the system memory during a clean boot-up procedure, into the non-volatile memory (209, 329). During subsequent start-ups of the computer system, the system state is copied from the non-volatile memory into the system memory (205, 305), resulting in a significantly faster system start-up. In case the configuration of the computer system has changed, the complete boot-up procedure is executed again and the new system state is copied into the non-volatile memory, overwriting the previously stored system state.