Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


Medard

Alain Medard, Paris FR

Patent application numberDescriptionPublished
20110065933PHOTOCHEMICAL PROCESS FOR PRODUCING ARTEMISININ - Provided is a new photochemical process for preparing artemisinin. Also provided are certain dihydroartemisinic acid derivatives useful for preparing artemisinin.03-17-2011

Alain Medard, Fontaines Sur Saone FR

Patent application numberDescriptionPublished
20110118481METHOD FOR PREPARING AZETIDINE DERIVATIVES - This invention discloses and claims an industrial method for the production of azetidine derivatives, such as, N-(1-benzhydrylazetidin-3-yl)-N-phenylmethylsulphonamide.05-19-2011

Eric Medard, Le Kremlin Bicetre FR

Patent application numberDescriptionPublished
20100292391Rubbery Polymer WIth Low Compression Set - A rubbery polymer comprising: 11-18-2010

Muriel Medard, Belmont, MA US

Patent application numberDescriptionPublished
20100046371FEEDBACK-BASED ONLINE NETWORK CODING - A method, apparatus and computer program product for feedback-based online network coding is presented. In one embodiment, a transmitting node determines a linear combination of packets to transmit from a transmit queue. The transmitting node transmits the linear combination of packets. The transmitting node determines whether a packet can be removed from the transmit queue, wherein when a determination is made that a packet can be removed from the transmit queue then removing the packet from the transmit queue, and when a determination is made that a packet cannot be removed from the transmit queue then refraining from removing the packet from the transmit queue.02-25-2010
20100054164Random Linear Network Coding for Time Division Duplexing - A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receiver to acknowledge (ACK) the number of degrees of freedom, if any, that are required to decode correctly the information. Provided herein is an analysis of this problem to show that there is an optimal number of coded data packets, in terms of mean completion time, to be sent before stopping to listen. This number depends on the latency, probabilities of packet erasure and ACK erasure, and the number of degrees of freedom that the receiver requires to decode the data. This scheme is optimal in terms of the mean time to complete the transmission of a fixed number of data packets. It is shown that its performance is very close to that of a full-duplex system, while transmitting a different number of coded packets can cause large degradation in performance, especially if latency is high. Also described herein is the throughput performance of the novel system and technique along with a comparison to existing half-duplex Go-back-N and Selective Repeat ARQ schemes. Numerical results, obtained for different latencies, show that the novel system and technique described herein has similar performance to the Selective Repeat in most cases and considerable performance gain when latency and packet error probability is high.03-04-2010
20100074492METHODS AND APPARATUS FOR AUTOMATED BASE-CALLING ON MULTIPLE DNA STRANDS - In some aspects, a method of automated base-calling using at least one image obtained from a chemical sequencing process performed simultaneously on a plurality of DNA strands, the at least one image including intensity information corresponding to locations of at least one base in the plurality of DNA strands is provided. The method comprises processing the at least image to obtain a function corresponding to the intensity information in the at least one image for the at least one base, the function incorporating intensity information corresponding to each of the plurality of DNA strands, identifying a plurality of peaks in the function, the plurality of peaks indicating possible locations for the at least one base in the plurality of DNA strands, assigning membership to each of the plurality of peaks by determining whether each of the plurality of peaks is believed to have resulted from none, one or multiple of the plurality of DNA strands, and computing a sequence for the at least one base for each of the plurality of DNA strands based, at least in part, on the membership assignment.03-25-2010
20100185768RESOURCE ALLOCATION AND MODIFICATION USING STATISTICAL ANALYSIS - In one aspect, a computer-implemented method includes generating a workload using at least one schema defined by combinations of ranges of each of at least two attributes. The computer-implemented method also includes receiving a request to provide content. The computer-implemented method further includes provisioning the content based upon the workload.07-22-2010
20110131326Arrangements and Methods for Access to Stored Data - An access server generates a handshake with storage servers resulting in more rapid access to the stored data, for example, video data, by a user. The handshake also results in load balancing effects.06-02-2011
20110243324Secure Network Coding for Multi-Resolution Wireless Video Streaming - Described herein is a method and system for hierarchical wireless video with network coding which limits encryption operations to a critical set of network coding coefficients in combination with multi-resolution video coding. Such a method and system achieves hierarchical fidelity levels, robustness against wireless packet loss and efficient security by exploiting the algebraic structure of network coding.10-06-2011

Muriel Medard, Cambridge, MA US

Patent application numberDescriptionPublished
20120096124RANDOM LINEAR CODING APPROACH TO DISTRIBUTED DATA STORAGE - A method and computer program product for providing a random linear coding approach to distributed data storage is presented. A file is broken into a plurality of pieces. For every peer (peer means storage-location with limited storage space), the number of coded-pieces the peer can store is determined. Each of the coded-piece is determined by taking random linear combination of all the pieces of the entire file. The associate code-vector is stored for every coded-piece. The file is retrieved by collecting code-vectors and the coded-pieces from the peers and viewing the collected code-vectors as a matrix. When a dimension of the matrix is equal to the number of pieces of the file, the file is recovered using the collection of code vectors in the matrix.04-19-2012