Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Krumm, US
Anton Krumm, Seattle, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20080305541 | Recombinant vectors for use in position-independent transgene expression within chromatin - The embodiments of the present invention are directed to discrete, cis-acting regulatory elements that include a barrier element, an insulating element, a silencing element, and matrix attachment regions (“MARs”). Additional embodiments of the present invention are directed to nucleic acid molecules that are useful for facilitating stable transgene expression within a chromatin environment. Additional embodiments of the present invention are directed to recombinant expression vectors including nucleic acid molecules of the present invention that can be incorporated into artificial chromosomes, eukaryotic cell-lines, non-human transgenic animals, and transgenic plants, to improve recombinant protein production in a broad range of eukaryotic hosts, and pharmaceutical compositions including nucleic acid molecules of the present invention that are also useful for gene therapy in the treatment of various genetic diseases. | 12-11-2008 |
Barry W. Krumm, Poughkeepsie, NY US
| Patent application number | Description | Published |
|---|---|---|
| 20090210627 | METHOD AND SYSTEM FOR HANDLING CACHE COHERENCY FOR SELF-MODIFYING CODE - A method for handling cache coherency includes allocating a tag when a cache line is not exclusive in a data cache for a store operation, and sending the tag and an exclusive fetch for the line to coherency logic. An invalidation request is sent within a minimum amount of time to an I-cache, preferably only if it has fetched to the line and has not been invalidated since, which request includes an address to be invalidated, the tag, and an indicator specifying the line is for a PSC operation. The method further includes comparing the request address against stored addresses of prefetched instructions, and in response to a match, sending a match indicator and the tag to an LSU, within a maximum amount of time. The match indicator is timed, relative to exclusive data return, such that the LSU can discard prefetched instructions following execution of the store operation that stores to a line subject to an exclusive data return, and for which the match is indicated. | 08-20-2009 |
| 20090210632 | MICROPROCESSOR AND METHOD FOR DEFERRED STORE DATA FORWARDING FOR STORE BACKGROUND DATA IN A SYSTEM WITH NO MEMORY MODEL RESTRICTIONS - A pipelined processor includes circuitry adapted for store forwarding, including: for each store request, and while a write to one of a cache and a memory is pending; obtaining the most recent value for at least one block of data; merging store data from the store request with the block of data thus updating the block of data and forming a new most recent value and an updated complete block of data; and buffering the updated block of data into a store data queue; for each additional store request, where the additional store request requires at least one updated block of data: determining if store forwarding is appropriate for the additional store request on a block-by-block basis; if store forwarding is appropriate, selecting an appropriate block of data from the store data queue on a block-by-block basis; and forwarding the selected block of data to the additional store request. | 08-20-2009 |
| 20090210679 | PROCESSOR AND METHOD FOR STORE DATA FORWARDING IN A SYSTEM WITH NO MEMORY MODEL RESTRICTIONS - A pipelined microprocessor includes circuitry for store forwarding by performing: for each store request, and while a write to one of a cache and a memory is pending; obtaining the most recent value for at least one complete block of data; merging store data from the store request with the complete block of data thus updating the block of data and forming a new most recent value and an updated complete block of data; and buffering the updated complete block of data into a store data queue; for each load request, where the load request may require at least one updated completed block of data: determining if store forwarding is appropriate for the load request on a block-by-block basis; if store forwarding is appropriate, selecting an appropriate block of data from the store data queue on a block-by-block basis; and forwarding the selected block of data to the load request. | 08-20-2009 |
| 20090216516 | METHOD, SYSTEM AND COMPUTER PROGRAM PRODUCT FOR GENERATING TRACE DATA - There is provided a method, system and computer program product for generating trace data related to a data processing system event. The method includes: receiving an instruction relating to the system event from a location in the system; determining a minimum number of trace segment records required to record instruction information; and creating a trace segment table including the number of trace segment records, the number of trace segment records including at least one instruction record. | 08-27-2009 |
| 20090216949 | METHOD AND SYSTEM FOR A MULTI-LEVEL VIRTUAL/REAL CACHE SYSTEM WITH SYNONYM RESOLUTION - Method and system for a multi-level virtual/real cache system with synonym resolution. An exemplary embodiment includes a multi-level cache hierarchy, including a set of L1 caches associated with one or more processor cores and a set of L2 caches, wherein the set of L1 caches are a subset of the set of L2 caches, wherein the set of L1 caches underneath a given L2 cache are associated with one or more of the processor cores. | 08-27-2009 |
| 20090240995 | METHOD AND APPARATUS FOR IMPROVING RANDOM PATTERN TESTING OF LOGIC STRUCTURES - A test method and apparatus for randomly testing logic structures. The method includes identifying and analyzing a functional behavior of a logic structure to be covered during the random testing, modifying the logic structure such that the logic structure behaves in a functional manner during random testing, and generating patterns to exercise the modified logic structure. | 09-24-2009 |
Charles F. Krumm, Newport Coast, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20080205465 | VERTICAL CAVITY SURFACE EMITTING LASER (VCSEL) AND RELATED METHOD - A vertical cavity surface emitting laser (VCSEL) is disclosed that has a relatively low vertical resistance between the Ohmic contact to the upper distributed Bragg reflector (DBR) and the active layer, and a structure to substantially confine the current flow to the laser cavity so that the VCSEL can produce a more efficient and substantially single-mode output. In particular, the VCSEL includes a substrate, a lower DBR disposed over the substrate, an active layer disposed over the lower DBR, and an upper DBR. The upper DBR includes a groove and an Ohmic contact situated within the groove to lower the vertical resistance between the contact and the active layer. An ion implanted layer is also formed along the side wall of the active layer to substantially confine the current flow to the laser cavity. | 08-28-2008 |
Christopher A. Krumm, Akron, OH US
| Patent application number | Description | Published |
|---|---|---|
| 20110232444 | MACHINE AND SYSTEM FOR PROCESSING STRIP MATERIAL - This invention relates to a machine and system for processing strip material which typically is removed from the edges of a sheet of material during the formation process. The strip material is formed in an apparatus and expelled at a variable line speed. The line speed is measured by a sensor which provides a signal representation of the speed to a cutter assembly. The cutter assembly cuts the strip material at a cutting speed which is sequenced to the line speed such that the strip material is cut into a plurality of pieces. The pieces are generally uniform in shape and size across variations in the line speed because the cutting speed is synchronized with the line speed. | 09-29-2011 |
| 20110232839 | METHOD FOR PRODUCING CORRUGATED MATERIAL - This invention relates to a method for producing corrugated material and processing strip material which is removed from the edges of the corrugated material during the formation process. The strip material is cut away from the corrugated material and expelled at a variable line speed to a trim processing machine. The line speed is measured by a sensor which provides a signal representation of the speed to a cutter assembly. The cutter assembly cuts the strip material at a cutting speed which is sequenced to the line speed such that the strip material is cut into a plurality of pieces. The pieces are generally uniform in shape and size across variations in the line speed as the cutting speed is synchronized with the line speed. | 09-29-2011 |
James L. Krumm, Toledo, OH US
| Patent application number | Description | Published |
|---|---|---|
| 20080300612 | Cutting blade storage apparatus - A scalpel blade storage device, including a cover having a first lever arm and a second lever arm defined therein and further including a base. The base has a face defining a blade pocket therein having a distal portion adapted to receive a blade portion of a surgical scalpel blade and a proximal portion adapted to receive a shank portion of a surgical scalpel blade. The base is disposed adjacent to the cover, with the face in which the blade pocket is defined facing said cover. A plurality of arms is fixed to one of the base and the cover. The arms envelop at least a portion of the other of the base and the cover to retain the base and the cover in a sliding relationship. The cover is movable between a first closed position in which the blade pocket is completely covered by the cover, and a second open position in which the blade pocket is at least partially uncovered. The invention further includes methods of withdrawing a scalpel blade to the storage device and mounting it on a scalpel handle, and for demounting the scalpel blade and returning it to the storage. | 12-04-2008 |
John Krumm, Redmond, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100305850 | Vehicle Route Representation Creation - Techniques and systems are disclosed that provide for creating an accurate representation of a roadway network, such as for planning vehicle travel routes. Positioning data is obtained, such as GPS data points from a plurality of vehicles, which mark traces of vehicular travel. A location of a trace is clarified using adjustment forces that are related to the traces, for example, to form coherent groups of traces. From these groups of clarified traces, a graph line is created by merging the traces. | 12-02-2010 |
| 20100332131 | ROUTING, ALERTING, AND TRANSPORTATION GUIDANCE BASED ON PREFERENCES AND LEARNED OR INFERRED RISKS AND DESIRABILITIES - Techniques and systems are disclosed that provide a risk-based assessment for a user based on user location information. Incident data is acquired for incidents that involve potential risks (e.g., to people and/or property) from a plurality of locations and contexts, considering such factors as date, time, weather, traffic, and velocity. The incident data is matched to the user's location and context directly or indirectly to provide one or more potential outcomes of interest (e.g., accidents, injuries, fatalities), and inferences regarding the likelihood of events are made available. These measures are compared to desired risk thresholds for the user. In one embodiment, routes, times, and conditions of travel may be preferred over others routes, times, and conditions. In another embodiment, users may be notified of a condition or a vehicle's maximum velocity may be reduced when the matched incident data meets/exceeds a user's risk threshold. | 12-30-2010 |
John Charles Krumm, Redmond, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100010733 | ROUTE PREDICTION - Driving history of a user with regard to a particular road intersection can be collected and retained in storage. A Markov model can be used to predict likelihood of the user making a particular decision regarding the intersection. A highest likelihood decision can be identified and used to create a travel route. In addition, contextual information can be taken into account when creating the route, such as time of day, road conditions, user situation, and the like. | 01-14-2010 |
| 20110205125 | INFERRING BEACON POSITIONS BASED ON SPATIAL RELATIONSHIPS - Estimating positions of beacons based on spatial relationships among neighboring beacons. Beacon reference data defining positions of beacons is stored from beacon fingerprints observed by devices (e.g., enabled with global positioning system receivers). For a received beacon fingerprint having at least one beacon for which the beacon reference data is missing (e.g., from a device without a GPS receiver), beacons in the received beacon fingerprint for which beacon reference data is available are identified. Based on these identified beacons, the missing beacon reference data is calculated. In some embodiments, a set of spatially diverse beacons is selected from the identified beacons prior to calculating the beacon reference data. | 08-25-2011 |