Patent application number | Description | Published |
20140081221 | ANTISEPTIC APPICATOR HAVING HYDROPHOBIC FOAM FOR USE WITH ANTISEPTIC SOLUTIONS - An applicator having a hydrophobic foam that is suitable for use with antiseptic solutions may be a hydrophobic polyurethane foam that does not reduce the amount of active ingredient in the solution as it passes through the foam so that it can be applied to the skin. The foam may be used to deliver antiseptics solutions such as octenidine salts, chlorhexidine salts, or any cationic molecule to the skin. The solution may include alcohol solution. The foam may be attached to an applicator containing an antiseptic solution, or it may be used in conjunction with an unattached antiseptic solution reservoir. The foam also allows the solution to wick into the foam and fully saturate the foam without dripping or channeling. | 03-20-2014 |
20140081222 | ANTISEPTIC APPICATOR HAVING HYDROPHILIC FOAM FOR USE WITH ANTISEPTIC SOLUTIONS - An applicator having a hydrophilic foam that is suitable for use with antiseptic solutions may be a hydrophilic polyurethane foam that does not reduce the amount of active ingredient in the solution as it passes through the foam so that it can be applied to the skin. The foam may be used to deliver antiseptics solutions such as octenidine salts, chlorhexidine salts, or any cationic molecule to the skin. The foam may be attached to an applicator containing an antiseptic solution, or it may be used in conjunction with an unattached antiseptic solution reservoir. The foam also allows the solution to wick into the foam and fully saturate the foam without dripping or channeling. | 03-20-2014 |
20140205360 | ANTISEPTIC APPLICATOR - An applicator assembly includes a head portion having a proximal end, a distal end, and an interior portion defining a fluid chamber; a container for containing an antiseptic solution coupled to and in fluid communication with the proximal end of the head portion; and an application member in fluid communication with the fluid chamber and comprising a foam, having a first foam layer adjacent a second foam layer, wherein the first foam layer is disposed toward the distal end of the head portion and comprises a dye impregnated therein, and the second foam layer is disposed away from the distal end of the head portion and is free from the dye, and wherein, after the antiseptic solution passes from the container through the fluid chamber, the antiseptic solution passes into the first foam layer, whereupon the dye is solubilized by and tints the antiseptic solution. | 07-24-2014 |
20140261454 | TINTED ANTISEPTIC SOLUTIONS HAVING IMPROVED STABILITY - An antiseptic solution including, a cationic antiseptic agent, a film forming polymer, an anionic tinting agent, and a solvent, wherein the cationic antiseptic agent, the film forming polymer and the anionic tinting agent each remain solubilized within the solution for greater than about 1 hour at 25° C. and 60% relative humidity. The antiseptic agent is preferably octenidine dihydrochloride or chlorhexadine gluconate. The film forming polymer is preferably an acrylate polymer. The solvent is preferably ethanol, isopropanol, and n-propanol. When a drape is adhered to a dried surgical film via the antiseptic solution, the force required to peel the drape from the surgical film is at least about 105 g/25 mm. | 09-18-2014 |
Patent application number | Description | Published |
20090113263 | METHODS FOR ANALYZING SCAN CHAINS, AND FOR DETERMINING NUMBERS OR LOCATIONS OF HOLD TIME FAULTS IN SCAN CHAINS - In a method for determining a number of possible hold time faults in a scan chain of a DUT, an environmental variable of the scan chain is set to a value believed to cause a hold time fault in the scan chain, and then a pattern is shifted through the scan chain. The pattern has a background pattern of at least n contiguous bits of a first logic state, followed by at least one bit of a second logic state, where n is a length of the scan chain. The number of possible hold time faults in the scan chain can be determined as a difference between i) a clock cycle when the at least one bit is expected to cause a transition at an output of the scan chain, and ii) a clock cycle when the at least one bit actually causes a transition at the output of the scan chain. If a value of the environmental variable at which the scan chain operates correctly can be determined, the location of one or more hold time faults can also be determined. | 04-30-2009 |
20090113265 | LOCATING HOLD TIME VIOLATIONS IN SCAN CHAINS BY GENERATING PATTERNS ON ATE - A method for determining that failures in semiconductor test are due to a defect potentially causing a hold time violation in a scan cell in a scan chain, counting the number of potential defects, and, if possible, localizing, and ameliorating hold time defects in a scan chain. | 04-30-2009 |
20100031092 | METHOD FOR OPERATING A SECURE SEMICONDUCTOR IP SERVER TO SUPPORT FAILURE ANALYSIS - A method for operating a secure semiconductor IP access server to support failure analysis. A client presents a test failure and failure type to an automated server which traverses an electronic product design, definition, and test database to report specifically those components and interconnect likely to cause the failure with geometrical information which may be displayed on the client. Other aspects of semiconductor IP are protected by the server by limiting the trace mechanism and renaming components. | 02-04-2010 |
Patent application number | Description | Published |
20080259078 | Apparatus and Method for Determining Intersections - In a data processing system for determining intersections between geometric objects, the work is split between a CPU and a stream processor. The intersection determination is controlled by the CPU. Data processing intensive parts of intersection algorithms, such as checking possible overlap of objects, checking overlap of normal fields of objects, approximating the extent of an object, approximating the normal fields of an object, or making conjectures for intersection topology and/or geometry between objects, are run on the stream processor. The results of the algorithmic parts run on the stream processor are used by the part of the algorithms run on the CPU. In cases where conjectures for the computational result are processed on the stream processor, the conjectures are checked for correctness by algorithms run on the CPU. If the correctness check shows that the result found is incomplete or wrong, additional parts of the algorithm are run on the CPU and possibly on the stream processor. | 10-23-2008 |
20090164756 | Geological Response Data Imaging With Stream Processors - The invention describes a method to convert geological response data to graphical raw data by using at least one stream processor for this purpose. The geological response data is pre-processed by a CPU and the preprocessed geological response data is fed into one or more stream processors. The stream processor then does the calculation intensive work on the preprocessed geological response data and returns the processing results back to the CPU which does some post-processing on the results coming from the stream processor Stream processors comprise single or multiple programmable GPUs, clusters/networks of nodes with one or several GPU's; cell processors (or processors derived from it) or a cluster of cell processor nodes, game computers (in the spirit of Sony's PlayStation, Nintendo's GameCube, etc.) or clusters of game computers. | 06-25-2009 |
20090213144 | APPARATUS AND METHOD TO CALCULATE RASTER DATA - A computer apparatus is disclosed for determining high quality raster data generation of scalar fields or vector fields, represented by piecewise polynomials or piecewise rational functions. It comprise one or more CPUs operative to do portions of the raster data generation algorithm, initializing sub-algorithms thereof, control the sub-algorithms, and possibly read back the generated raster data or transfer the raster data to other processors in the system. The computer apparatus further comprises one or more stream processing units operative to receive parts of the raster data algorithm from the CPUs and to execute sub-algorithms of the raster data algorithm, resulting in raster data that can be directly visualized, read back to the CPU or transferred to other processors. | 08-27-2009 |
20120191423 | METHOD FOR LOCAL REFINEMENT OF GEOMETRIC OR PHYSICAL REPRESENTATION - The invention provides a method for spatially refining a computer generated l-dimensional (l>0) model in a computing environment, the l-dimensional model representing physical or geometrical properties, and where the l-dimensional model is represented by tensor product B-splines basis functions and l-dimensional coefficients, where the l-dimensional coefficients are in real or projective space, and the tensor product B-splines basis functions are spanning an r-variate spline space (r>0) having a parameter domain, the method comprising: a) inserting at least one axis parallel hyper rectangle degenerate in one dimension in said parameter domain, providing a splitting of a support of at least one of said tensor product B-spline basis functions; b) computing refined tensor product B-spline basis functions by subdivision on said at least one tensor product B-splines basis functions whose support is split, using at least one knot value of the at least one axis parallel hyper rectangle; and c) computing the resulting refined l-dimensional representation based on said refined tensor product B-spline basis functions. | 07-26-2012 |