Patent application number | Description | Published |
20100287237 | SYSTEM, METHOD AND COMPUTER PROGRAM FOR RECIPIENT CONTROLLED COMMUNICATIONS - A communication system is provided in which users associate handling data identifying how messages are to be processed with contact data. Handling data for the identified contacts in the contact data then dispatched to those contacts. Subsequently when messages are dispatched from the locations identified by the contact data a sender of a message selects handling data to be associated with a message being dispatched. Upon receipt of a message associated with handling data the message is then processed in the manner identified by the handling data. | 11-11-2010 |
20110302311 | SYSTEM, METHOD AND COMPUTER PROGRAM FOR RECIPIENT CONTROLLED COMMUNICATIONS - A communication system is provided in which users associate handling data identifying how messages are to be processed with contact data. Handling data for the identified contacts in the contact data is then dispatched to those contacts. Subsequently when messages are dispatched from the locations identified by the contact data a sender of a message selects handling data to be associated with a message being dispatched. Upon receipt of a message associated with handling data the message is then processed in the manner identified by the handling data. | 12-08-2011 |
20120264404 | SYSTEM, METHOD AND COMPUTER PROGRAM FOR RECIPIENT CONTROLLED COMMUNICATIONS - A communication system is provided in which users associate handling data identifying how messages are to be processed with contact data. Handling data for the identified contacts in the contact data is then dispatched to those contacts. Subsequently when messages are dispatched from the locations identified by the contact data a sender of a message selects handling data to be associated with a message being dispatched. Upon receipt of a message associated with handling data the message is then processed in the manner identified by the handling data. | 10-18-2012 |
20130290445 | SYSTEM, METHOD AND COMPUTER PROGRAM FOR RECIPIENT CONTROLLED COMMUNICATIONS - A communication system is provided in which users associate handling data identifying how messages are to be processed with contact data. Handling data for the identified contacts in the contact data is then dispatched to those contacts. Subsequently when messages are dispatched from the locations identified by the contact data a sender of a message selects handling data to be associated with a message being dispatched. Upon receipt of a message associated with handling data the message is then processed in the manner identified by the handling data. | 10-31-2013 |
Patent application number | Description | Published |
20090142385 | COMPOSITIONS FOR TREATING BONE DEFECTS - In certain described embodiments, implantable medical materials comprise a scaffolding material, a liquid organic binder, and entrapped calcium-containing particles. The medical materials can incorporate an osteoinductive factor such as a protein. The scaffolding material can bind the factor. In additional described embodiments, implantable medical materials include an osteoconductive scaffolding material, an incorporated osteoinductive factor, and a biodegradable barrier material effective to delay release of the factor from the scaffolding material. The scaffolding material can bind the factor. Also described a methods for preparing and implanting the described medical materials. | 06-04-2009 |
20120245629 | SELF-RETAINING VARIABLE LOOP SUTURES - A suture having a first end for penetrating tissue, an elongated suture body having a periphery; a plurality of retainers on the periphery, and a second end having a variable loop of variable circumference, wherein the variable loop includes a fixed loop slidably engaging the elongated body for slidingly varying the circumference of the variable loop, and wherein the first end may pass through the variable loop to secure tissue as an anchor, the anchor preventing movement of the suture in the direction of deployment of the first end. | 09-27-2012 |
20130180966 | LASER CUTTING SYSTEM AND METHODS FOR CREATING SELF-RETAINING SUTURES - A laser-machining system and method is disclosed for forming retainers on a suture thread. The laser system is preferably a femtosecond laser system which is capable of creating submicron features on the suture thread while preserving strength of the suture thread. The laser-machining system enables creation of retainers and self-retaining suture systems in configurations which are difficult and/or impossible to achieve using mechanical cutting technology. | 07-18-2013 |
20130317545 | DRUG-ELUTING SELF-RETAINING SUTURES AND METHODS RELATING THERETO - A drug-eluting self-retaining suture comprises a filament, a plurality of retainers, and a drug impregnated in or coated on the filament. The shape and distribution of retainers modifies the in vivo release kinetics of the drug. The drug release kinetics may be modified uniformly or region by region. The self-retaining suture may for example be used for reattaching severed nerves and release nerve growth factor or other regeneration accelerating agents into the region of the nerve injury. | 11-28-2013 |
Patent application number | Description | Published |
20090032016 | AIRWAY INTUBATION DEVICE - An airway intubation device having a one-piece molded body of biocompatible material with an ergonomically designed hand piece for left hand manipulation. The body includes a cap piece and linear-curved-linear insertion piece having a channel in one side thereof for insertion of an endotracheal tube. The channel has a wide entry portal disposed ahead of the hand piece so that a clinician may load the channel with a tube while the insertion piece is in the mouth of the patient without having to view the entry portal. The device includes illumination means and viewing means comprising an eye piece or a video display unit mounted to the cap piece so that a clinician can view the insertion of the tube between the vocal cords of a patient without contact. | 02-05-2009 |
20110112542 | ADJUSTABLE REVISION GUIDE - An axial height adjustable, revision cutting in the shape of a final distal femur implant component. The revision guide includes a rod adapted for intimate contact within an intramedullary canal of a femur, and includes a threaded passageway. The revision cutting guide is adapted for removable attachment to a distal portion of the femur. A vernier-bolt is rotatably positioned through the shaped body of the revision cutting guide so as to be adjustably received within the threaded passageway thereby providing for movement of the shaped body of the revision cutting guide relative to the distal portion of the femur. | 05-12-2011 |
20130197517 | ADJUSTABLE REVISION GUIDE - An axial height adjustable, revision cutting in the shape of a final distal femur implant component. The revision guide includes a rod adapted for intimate contact within an intramedullary canal of a femur, and includes a threaded passageway. The revision cutting guide is adapted for removable attachment to a distal portion of the femur. A vernier-bolt is rotatably positioned through the shaped body of the revision cutting guide so as to be adjustably received within the threaded passageway thereby providing for movement of the shaped body of the revision cutting guide relative to the distal portion of the femur. | 08-01-2013 |
20130345518 | AIRWAY INTUBATION DEVICE - An airway intubation device having a one-piece molded body of biocompatible material with an ergonomically designed hand piece for left hand manipulation. The body includes a cap piece and linear-curved-linear insertion piece having a channel in one side thereof for insertion of an endotracheal tube. The channel has a wide entry portal disposed ahead of the hand piece so that a clinician may load the channel with a tube while the insertion piece is in the mouth of the patient without having to view the entry portal. The device includes illumination means and viewing means comprising an eye piece or a video display unit mounted to the cap piece so that a clinician can view the insertion of the tube between the vocal cords of a patient without contact. | 12-26-2013 |
20140276865 | ADJUSTABLE REVISION GUIDE - An axial height adjustable, revision cutting in the shape of a final distal femur implant component. The revision guide includes a rod adapted for intimate contact within an intramedullary canal of a femur, and includes a threaded passageway. The revision cutting guide is adapted for removable attachment to a distal portion of the femur. A vernier-bolt is rotatably positioned through the shaped body of the revision cutting guide so as to be adjustably received within the threaded passageway thereby providing for movement of the shaped body of the revision cutting guide relative to the distal portion of the femur. | 09-18-2014 |
Patent application number | Description | Published |
20100074381 | METHODS AND SYSTEMS FOR IMPROVING ITERATIVE SIGNAL PROCESSING - A method for iteratively decoding a set of encoded samples received from a transmission channel is provided. A data signal indicative of a noise level of the transmission channel is received. A scaling factor is then determined in dependence upon the data signal and the encoded samples are scaled using the scaling factor. The scaled encoded samples are then iteratively decoded. Furthermore, a method for initializing edge memories is provided. During an initialization phase initialization symbols are received from a node of a logic circuitry and stored in a respective edge memory. The initialization phase is terminated when the received symbols occupy a predetermined portion of the edge memory. An iterative process is executed using the logic circuitry storing output symbols received from the node in the edge memory and a symbol is retrieved from the edge memory and provided as output symbol of the node. Yet further an architecture for a high degree variable node is provided. A plurality of sub nodes forms a variable node for performing an equality function in an iterative decoding process. Internal memory is interposed between the sub nodes such that the internal memory is connected to an output port of a respective sub node and to an input port of a following sub node, the internal memory for providing a chosen symbol if a respective sub node is in a hold state, and wherein at least two sub nodes share a same internal memory. | 03-25-2010 |
20110231731 | METHOD AND SYSTEM FOR DECODING - Low-Density Parity-Check (LDPC) codes offer error correction at rates approaching the link channel capacity and reliable and efficient information transfer over bandwidth or return-channel constrained links with data-corrupting noise present. LDPC codes also offer error correction performance approaching channel capacity exponentially fast in terms of the code length, linear processing complexity, and parallelism that scales with the code length. They also offer challenges relating to the decoding complexity of the binary error-correction codes themselves and error floors limiting achievable bit-error rates. A new Relaxed Half-Stochastic (RHS) decoding algorithm is presented that reduces decoding complexity for high decoding throughput applications. The RHS algorithm uses an approach based on stochastic decoding algorithms but differs significantly from the conventional approaches of LDPC decoder implementation. The RHS algorithm also leads to a randomized decoding technique called redecoding that addresses the error floor limitation. | 09-22-2011 |
20130117344 | Methods and Systems for Decoding Polar Codes - Coding within noisy communications channels is essential but a theoretical maximum rate defines the rate at which information can be reliably transmitted on this noisy channel. Capacity-achieving codes with an explicit construction eluded researchers until polar codes were proposed. However, whilst asymptotically reaching channel capacity these require increasing code lengths, and hence increasingly complex hardware implementations. It would be beneficial to address architectures and decoding processes to reduce polar code decoder complexity both in terms of the number of processing elements required, but also the number of memory elements and the number of steps required to decode a codeword. Beneficially architectures and design methodologies established by the inventors address such issues whilst reducing overall complexity as well as providing methodologies for adjusting decoder design based upon requirements including, but not limited to, cost (e.g. through die area) and speed (e.g. through latency, number of cycles, number of elements etc). | 05-09-2013 |
20140219279 | METHODS AND SYSTEMS FOR NETWORK ADDRESS LOOKUP ENGINES - Internet routers are a key component in today's Internet. Each router forwards received packets toward their final destinations based upon a Longest Prefix Matching (LPM) algorithm select an entry from a routing table that determines the closest location to the final packet destination among several candidates. Prior art solutions to LPM lookup offer different tradeoffs and that it would be beneficial for a design methodology that provides for low power large scale IP lookup engines addressing the limitations within the prior art. According to embodiments of the invention a low-power large-scale IP lookup engine may be implemented exploiting clustered neural networks (CNNs). In addition to reduced power consumption embodiments of the invention provide reduced transistor count providing for reduced semiconductor die footprints and hence reduced die cost. | 08-07-2014 |
Patent application number | Description | Published |
20080256343 | Convergence determination and scaling factor estimation based on sensed switching activity or measured power consumption - A method and system for determining convergence of iterative processes and estimating a scaling factor in decoding processes based on switching activity of the logic circuitry are provided. During execution of an iterative process using logic circuitry comprising logic gates switching activity of a plurality of the logic gates is sensed to determine switching data indicative of a total switching activity of the plurality of the logic gates. The iterative process is iterated using the logic circuitry until convergence is indicated by the switching data. Similarly, a scaling factor for use in decoding processes is determined based on the switching data. | 10-16-2008 |
20080294970 | Method for implementing stochastic equality nodes - The present invention relates to a decoding method and system for stochastic decoding of linear block codes with parity check matrix. Each encoded sample of a set of encoded samples is converted into a corresponding probability. For each probability a corresponding probability message is the generated by encoding each probability as a sequence of digital symbols. Each probability message is then provided to a respective node of a logic circuitry for stochastic decoding. The logic circuitry represents a factor graph of the parity check matrix of the linear block code. Using the logic circuitry each probability message is processed for determining an estimated sequence of information symbols. If an equality node is in a hold state a chosen symbol is provided from a corresponding memory which is updated by storing output symbols from the equality node when the same is in a state other than a hold state. | 11-27-2008 |
20090100313 | METHODS AND APPARATUSES OF MATHEMATICAL PROCESSING - Disclosed is a pipelined iterative process and system. Data is received at an input port and is processed in a symbolwise fashion. Processing of each symbol is performed other than relying on completing the processing of an immediately preceding symbol such that operation of the system or process is independent of an order of the input symbols. | 04-16-2009 |
20100017676 | DECODING OF LINEAR CODES WITH PARITY CHECK MATRIX - A decoding method and system for stochastic decoding of linear codes with the parity check matrix comprising elements of a Galois field is provided. Each encoded sample of a set of encoded samples is first scaled by a scaling factor proportional to a noise level of the set of encoded samples. Each of the scaled encoded samples is then converted into a corresponding probability. For each probability a corresponding probability message is the generated by encoding each probability as a sequence of symbols or bits. Each probability message is then provided to a respective variable node of a logic circuitry for stochastic decoding. The logic circuitry represents a factor graph of the parity check matrix of the linear code. Using the logic circuitry each probability message is passed through the factor graph by performing for each received symbol at the variable nodes the equality function, at the permutation nodes one of multiplication and division, and at the parity check nodes the parity check function, wherein each of the variable nodes provides an output symbol in dependence upon each received symbol. | 01-21-2010 |
20110293045 | METHODS AND SYSTEMS FOR IMPROVING ITERATIVE SIGNAL PROCESSING - A method for iteratively decoding a set of encoded samples received from a transmission channel is provided. A data signal indicative of a noise level of the transmission channel is received. A scaling factor is then determined in dependence upon the data signal and the encoded samples are scaled using the scaling factor. The scaled encoded samples are then iteratively decoded. Furthermore, a method for initializing edge memories is provided. During an initialization phase initialization symbols are received from a node of a logic circuitry and stored in a respective edge memory. The initialization phase is terminated when the received symbols occupy a predetermined portion of the edge memory. An iterative process is executed using the logic circuitry storing output symbols received from the node in the edge memory and a symbol is retrieved from the edge memory and provided as output symbol of the node. Yet further an architecture for a high degree variable node is provided. A plurality of sub nodes forms a variable node for performing an equality function in an iterative decoding process. Internal memory is interposed between the sub nodes such that the internal memory is connected to an output port of a respective sub node and to an input port of a following sub node, the internal memory for providing a chosen symbol if a respective sub node is in a hold state, and wherein at least two sub nodes share a same internal memory. | 12-01-2011 |