Patent application number | Description | Published |
20090106867 | RED LETTUCE - The present invention relates to a head-forming lettuce plant of the species | 04-23-2009 |
20100229255 | LETTUCE VARIETY EMERSON - The present invention relates to a new lettuce (Lactuca sativa) variety, seed designated as 79-11 RZ, which exhibits a combination of an extraordinary high number of leaves, resistance to many Bremia-races, and an extraordinary low number of apices under many growing conditions, the representative seed having been deposited with the National Collections of Industrial, Marine and Food Bacteria (NCIMB) in Bucksburn, Aberdeen AB21 9YA, Scotland, UK and assigned NCIMB Acession No. 41614, The present invention also relates to a Lactuca sativa plant produced by growing the 79-11 RZ (Emerson) seed. The invention further relates to methods for producing the lettuce cultivar, represented by lettuce variety 79-11 RZ. | 09-09-2010 |
20100306872 | DOWNY MILDEW RESISTANT LETTUCE - The present invention relates to a lettuce cultivar having resistance to downy mildew ( | 12-02-2010 |
20100325749 | LETTUCE VARIETY 79-88 RZ - The present invention relates to a lettuce cultivar having resistance to downy mildew ( | 12-23-2010 |
20120210470 | RED LETTUCE - The present invention relates to a head-forming lettuce plant of the species | 08-16-2012 |
20120311732 | LETTUCE VARIETY 79-41 RZ - The present invention relates to a | 12-06-2012 |
20120328764 | LETTUCE VARIETY 79-190 OR 79-107 RZ - The present invention relates to a | 12-27-2012 |
20120331577 | LETTUCE VARIETY 79-163 RZ - The present invention relates to a | 12-27-2012 |
20130019335 | LETTUCE VARIETY 79-02 RZ - The present invention relates to a | 01-17-2013 |
20130019336 | LETTUCE VARIETY 79-176 RZ - The present invention relates to a | 01-17-2013 |
20130019337 | LETTUCE VARIETY 79-82 RZ - The present invention relates to a | 01-17-2013 |
20130111629 | LETTUCE VARIETY 79-190 RZ OR 79-107 RZ | 05-02-2013 |
20130164431 | LETTUCE VARIETY 79-69 RZ "TRIPLEX RZ" - The present invention relates to a | 06-27-2013 |
20140065286 | LETTUCE VARIETY 79-86 RZ WINTEX RZ - The present invention relates to a | 03-06-2014 |
20140101787 | LETTUCE VARIETY 79-315 RZ, DRAKE - The present invention relates to a | 04-10-2014 |
20140143903 | LETTUCE VARIETY 79-51 RZ - The present invention relates to a | 05-22-2014 |
20140143904 | LETTUCE VARIETY 79-226 RZ - The present invention relates to a | 05-22-2014 |
20140272085 | LETTUCE VARIETY PASCAL RZ (79-110 RZ) - The present invention relates to a | 09-18-2014 |
20140272087 | LETTUCE VARIETY STEFANO RZ (79-93 RZ) - The present invention relates to a | 09-18-2014 |
20140283193 | LETTUCE VARIETY 79-348 RZ - The present invention relates to a | 09-18-2014 |
20150121565 | LETTUCE VARIETY 79-504 RZ - The present invention relates to a | 04-30-2015 |
Patent application number | Description | Published |
20090304768 | Gastro-Retentive System for the Delivery of Macromolecules - The present invention provides a gastro-retentive delivery assembly (GRDA) comprising a folded multi-layered device comprising a macromolecule-containing compartment bordered by enveloping layers and one or more enforcing strips, the device being adapted to unfold when in a subject's stomach, whereupon unfolding, the macromolecule is released from said device via at least one aperture in an enveloping layer. The invention also provides a method for gastroretentive delivery of macromolecules via the GRDA of the invention; a method of preparing the GRDA of the invention as well as a method for treating a subject for a pathological condition, making use of the GRDA of the invention. | 12-10-2009 |
20110091542 | BACLOFEN AND R-BACLOFEN GASTRORETENTIVE DRUG DELIVERY SYSTEMS - A biodegradable, multi-layered controlled release gastroretentive baclofen or R-baclofen dosage form which is optionally divided into a first dosage of baclofen or R-baclofen for immediate release and a second dosage of baclofen or R-baclofen for controlled release in the stomach and gastrointestinal tract of a patient, folded into a capsule which disintegrates upon contact with gastric juice and the dosage form unfolds rapidly upon contact with gastric juice. The biodegradable, multi-layered gastroretentive dosage forms of the invention provide fast onset of baclofen or R-baclofen activity with prolonged absorption and minimal undesirable side effects. | 04-21-2011 |
20110117192 | CARBIDOPA/LIPODOPA GASTRORETENTIVE DRUG DELIVERY - A gastroretentive drug formulation for the sustained release of an active agent in the gastrointestinal tract comprises an internal layer or compartment comprising an active agent and one or more pharmaceutical excipients, of which at least one is a polymer and two membranes forming together an envelope around the inner membrane, each membrane comprising at least one polymeric combination of an enteric polymer which is not soluble in gastric juice, and an hydrophilic swelling polymer, and at least one plasticizer. | 05-19-2011 |
20120021051 | ZALEPLON GASTRORETENTIVE DRUG DELIVERY SYSTEM - A biodegradable, multi-layered controlled release gastroretentive dosage form which is optionally divided into a first dosage of zaleplon for controlled release and a second dosage of zaleplon for immediate release in the stomach and gastrointestinal tract of a patient, folded into a capsule which disintegrates upon contact with gastric juice and the gastroretentive dosage form unfolds rapidly upon contact with gastric juice. The biodegradable, multi-layered gastroretentive dosage forms of the invention provide efficient sleep induction with good sleep maintenance and minimal next day residual effects. | 01-26-2012 |
20120321706 | NOVEL GASTRORETENTIVE DOSAGE FORMS OF POORLY SOLUBLE DRUGS - Disclosed is a multi-layered gastroretentive dosage form for the controlled release of a poorly soluble drug or diagnostic in the stomach and gastrointestinal tract of a patient, folded into a capsule which disintegrates rapidly and the said multi-layered dosage form unfolds rapidly upon contact with the gastric juice. The mechanisms of the gastric retention are not dependent on and do not influence the materials and methods used in controlling the release of the said poorly soluble drug. | 12-20-2012 |
20140314842 | CARBIDOPA/LIPODOPA GASTRORETENTIVE DRUG DELIVERY - A gastroretentive drug formulation for the sustained release of an active agent in the gastrointestinal tract comprises an internal layer or compartment comprising an active agent and one or more pharmaceutical excipients, of which at least one is a polymer and two membranes forming together an envelope around the inner membrane, each membrane comprising at least one polymeric combination of an enteric polymer which is not soluble in gastric juice, and an hydrophilic swelling polymer, and at least one plasticizer. | 10-23-2014 |
20150366832 | CARBIDOPA/LEVODOPA GASTRORETENTIVE DRUG DELIVERY - A gastroretentive drug formulation for the sustained release of an active agent in the gastrointestinal tract comprises an internal layer or compartment comprising an active agent and one or more pharmaceutical excipients, of which at least one is a polymer and two membranes forming together an envelope around the inner membrane, each membrane comprising at least one polymeric combination of an enteric polymer which is not soluble in gastric juice, and an hydrophilic swelling polymer, and at least one plasticizer. | 12-24-2015 |
Patent application number | Description | Published |
20090234801 | APPROXIMATING QUERY RESULTS BY RELATIONS OVER TYPES FOR ERROR DETECTION AND OPTIMIZATION - A method and system is provided for computing an approximation of the results of a query. The approximation represents a superset of all possible results, by computing a set of records of types (as opposed to a set of records of values, which is the normal result of a query). This is different from conventional systems, which typically infer types for each field individually. For each record of types, one may also keep track of equalities of fields to improve the precision of the approximation. The approximation can be used to detect erroneous parts of queries that always return an empty result, regardless of the contents of the data source. Furthermore, the same approximation is also useful in performing optimizations: first, by eliminating parts of procedure calls that are guaranteed to be irrelevant to the calling context, and second, by eliminating unnecessary type tests in the query. | 09-17-2009 |
20090240649 | APPROXIMATING RELATION SIZES USING FIELD DEPENDENCIES - A method and system is provided for computing an approximation of the number of distinct results of a query over a relational data source. The approximation uses information about dependencies between fields of relations, in particular the number of distinct values of a field for each possible value of another field. This information can be obtained by analysis of the data stored in the relational data source, or may be specified as annotations to a database schema. An approximation of the number of results is and the dependencies between fields of each part of the query are computed. The approximation can be used to reorder parts of a query, by using the estimated size of parts to guide reordering. The approximation can further be used to determine which parts of a query are relevant to the evaluation of a subquery, which can be used to guide the magic sets transformation. | 09-24-2009 |
20120016912 | TYPE INFERENCE FOR DATALOG WITH COMPLEX TYPE HIERARCHIES - What is disclosed are a novel system and method for inferring types of database queries. In one embodiment a program and associated database schema that includes a type hierarchy is accessed. The program includes query operations to a database that contains relations described by a database schema. Types are inferred from definitions in the program by replacing each database relationship in the program by the types in the database schema. A new program is generated with the types that have been inferred with the new program only accessing unary relations in the database. In another embodiment, testing of each of the types that have been inferred is performed for type emptiness. In response to type emptiness being found for a type that have been inferred, a variety of different operations are performing including removing the type, providing a notification regarding the emptiness found for the type, and more. | 01-19-2012 |
20120239678 | CREATING CONCISE AND RE-USEABLE QUERIES OVER COMPLEX DATA - A novel system, computer readable storage medium and method for creating re-usable queries over complex data including hierarchies, trees and graphs is described. This is achieved by an object-oriented query language, where a class is a logical property of a data item, and inheritance is implication between such properties. Virtual method calls execute all relevant method implementations in most specific classes. Expressions can be multi-valued, thus avoiding the need for naming intermediate results. All constructs closely follow the syntax of mainstream object-oriented languages like Java. | 09-20-2012 |
20150309790 | SOURCE CODE VIOLATION MATCHING AND ATTRIBUTION - Methods, systems, and apparatus, including computer programs encoded on computer storage media, for matching and attributing code violations. One of the methods includes receiving a snapshot S of a code base of source code and a different snapshot T of the code base. Data representing first violations in the snapshot S and second violations in the snapshot T is received. Pairs of matching violations are determined using performing two or more matching processes, including performing a first matching process, the first matching process determining first pairs of matching violations according to a first matching algorithm and performing a second matching process, the second matching process determining second pairs of matching violations according to a second matching algorithm from violations not matched by the first matching process. The first pairs of matching violations and the second pairs of matching violations are included in the determined pairs of matching violations. | 10-29-2015 |
20150324195 | SOURCE CODE VIOLATION MATCHING AND ATTRIBUTION - Methods, systems, and apparatus, including computer programs encoded on computer storage media, for matching and attributing code violations. One of the methods includes receiving a snapshot S of a code base of source code and a different snapshot T of the code base. Data representing first violations in the snapshot S and second violations in the snapshot T is received. Pairs of matching violations are determined using performing two or more matching processes, including performing a first matching process, the first matching process determining first pairs of matching violations according to a first matching algorithm and performing a second matching process, the second matching process determining second pairs of matching violations according to a second matching algorithm from violations not matched by the first matching process. The first pairs of matching violations and the second pairs of matching violations are included in the determined pairs of matching violations. | 11-12-2015 |
20160098271 | SOURCE CODE VIOLATION MATCHING AND ATTRIBUTION - Methods, systems, and apparatus, including computer programs encoded on computer storage media, for matching and attributing code violations. One of the methods includes receiving a snapshot S of a code base of source code and a different snapshot T of the code base. Data representing first violations in the snapshot S and second violations in the snapshot T is received. Pairs of matching violations are determined using performing two or more matching processes, including performing a first matching process, the first matching process determining first pairs of matching violations according to a first matching algorithm and performing a second matching process, the second matching process determining second pairs of matching violations according to a second matching algorithm from violations not matched by the first matching process. The first pairs of matching violations and the second pairs of matching violations are included in the determined pairs of matching violations. | 04-07-2016 |