Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Cole, WA
Bobbie L. Cole, Mukilteo, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20110062735 | PROTECTIVE KICK STRIP - In one embodiment, a kickstrip assembly comprises a base plate having a length extending along a longitudinal axis, and comprising an upper segment having an upper edge and an upper lip, a lower segment having a lower edge and a lower lip, the upper lip and the lower lip defining a middle section. The assembly further comprises an insert formed from a flexible polymeric material and comprising a faceplate, an upper edge depending from the faceplate, and a lower edge depending from the faceplate, wherein the faceplate is dimensioned to fit within middle section of the base plate. | 03-17-2011 |
Daniel J. Cole, Redmond, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20090182710 | Calculating and Storing Data Structures - Embodiments are provided to calculate and provide information based in part on a defined expression. In an embodiment, a database system can be configured to include a number of calculated columns as part of a database table structure. The database system can be configured to present a calculated result based in part on a determined result type. In one embodiment, a database system can be configured to enable calculated columns to be defined on a table of a database, wherein a component can be used to evaluate an expression associated with a column calculation to determine a proper result type. The proper result type can be stored and used when presenting a result of the calculation. Other embodiments are available. | 07-16-2009 |
Douglas G. Cole, Pullman, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100267130 | Chlamydomonas Intraflagellar Transport 88 (IFT-88) - The invention relates to various intraflagellar transport (IFT) polypeptides and the nucleic acids that encode them. The new IFT particle polypeptides and nucleic acids can be used in a variety, of diagnostic, screening, and therapeutic methods. | 10-21-2010 |
Frank D. Cole, Bothell, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20110164538 | Spectrum Allocation System and Method for Multi-Band Wireless RF Data Communications - A dual band spectrum allocation system and method for wireless data communications uses discrete bands for upstream and downstream data communications. A preferred embodiment uses unlicensed UNII bands for license-free data transmissions from a subscriber to a hub, and uses relatively interference free licensed bands for data transmissions from a hub to subscribers, thereby allowing use of greater bandwidth, simplifying system licensing and reducing filtering requirements for subscribers. | 07-07-2011 |
Garret Cole, Seattle, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20110179301 | AUTOMATIC DISCOVERY OF SERVER TO POWER-CIRCUIT CONNECTIONS - In a data center which includes a plurality of servers, a discovery computer, a power measurement system (PMS), and a plurality of power-circuits which supply power to the servers, the discovery computer performs the following actions for each server. It transmits a first command to the server causing the server to start generating a power consumption signature if the server is able to do so. Upon receiving a SUCCESS response from the server, it instructs the PMS to start measuring the power consumption from each power-circuit. After a prescribed interval of time has elapsed, it collects the measurements from the PMS and analyzes the measurements to look for the presence of the signature. Upon detecting the signature in the measurement taken from a particular power-circuit, the discovery computer concludes that the server is connected to the particular power-circuit and creates a mapping there-between. | 07-21-2011 |
James J. Cole, Arlington, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100170849 | BUFFERED COMPOSITIONS FOR DIALYSIS - Acid concentrates, and dialysate compositions prepared therefrom, contain citric acid and an effective amount of a buffering agent selected from acetate and/or lactate. The buffering agent allows a physiologically acceptable amount of citrate to maintain the desired pH of the dialysate. | 07-08-2010 |
| 20100176340 | BUFFERED COMPOSITIONS FOR DIALYSIS - Acid concentrates, and dialysate compositions prepared therefrom, contain citric acid and an effective amount of a buffering agent selected from acetate and/or lactate. The buffering agent allows a physiologically acceptable amount of citrate to maintain the desired pH of the dialysate. | 07-15-2010 |
| 20110172583 | HIGH CITRATE DIALYSATE AND USES THEREOF - The dose of dialysis in terms of urea clearance is marginal in many hemodialysis patients, and metabolic acidosis as determined by the pre-dialysis serum HCO | 07-14-2011 |
Jeffrey Cole, Redmond, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20090112905 | Self-Compacting Pattern Indexer: Storing, Indexing and Accessing Information in a Graph-Like Data Structure - An indexing system uses a graph-like data structure that clusters features indexes together. The minimum atomic value in the data structure is represented as a leaf node which is either a single feature index or a sequence of two or more feature indexes when a minimum sequence length is imposed. Root nodes are formed as clustered collections of leaf nodes and/or other root nodes. Context nodes are formed from root nodes that are associated with content that is being indexed. Links between a root node and other nodes each include a sequence order value that is used to maintain the sequencing order for feature indexes relative to the root node. The collection of nodes forms a graph-like data structure, where each context node is indexed according to the sequenced pattern of feature indexes. Clusters can be split, merged, and promoted to increase the efficiency in searching the data structure. | 04-30-2009 |
Jonathan M. Cole, Woodinville, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20110222442 | ROUTING REQUESTS FOR DUPLEX APPLICATIONS - The present invention extends to methods, systems, and computer program products for routing requests for duplex applications. Embodiments of the invention provide a multi-machine scalability mechanism for duplex messages patterns based on a polling mechanism. Client requests and polls can be distributed to service instances running within a cluster of machines by a session-unaware load balancer. Messages to and from a given client can be accessed by any service instance in the cluster service instance, which allows capacity scale-out and seamless failover between service instances. A coordinated inbound message store is used to affinitize application requests to a particular service instance. A coordinated outbound message store is used to route application responses from the machine running the application to the machine where a polling request arrived. Further, the lifetime of the service instance is decoupled from the inbound or outbound message stores, allowing the client-server conversation to potentially span many instances of the service. | 09-15-2011 |
Rachel M. Cole, Redmond, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20090254912 | SYSTEM AND METHOD FOR BUILDING APPLICATIONS, SUCH AS CUSTOMIZED APPLICATIONS FOR MOBILE DEVICES - A system and method for building applications, such as applications that cause a mobile device to perform a task, is described. In some examples, the system provides one or more plugins, a framework for the plugins, and configures the plugins to build a customized application for a mobile device. The plugins may include code configured to perform a task, display one or more pages associated with performance of the task, perform a transaction during performance of the task, and so on. | 10-08-2009 |
Richard J. Cole, Seattle, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100153955 | SAVING PROGRAM EXECUTION STATE - Techniques are described for managing distributed execution of programs. In at least some situations, the techniques include decomposing or otherwise separating the execution of a program into multiple distinct execution jobs that may each be executed on a distinct computing node, such as in a parallel manner with each execution job using a distinct subset of input data for the program. In addition, the techniques may include temporarily terminating and later resuming execution of at least some execution jobs, such as by persistently storing an intermediate state of the partial execution of an execution job, and later retrieving and using the stored intermediate state to resume execution of the execution job from the intermediate state. Furthermore, the techniques may be used in conjunction with a distributed program execution service that executes multiple programs on behalf of multiple customers or other users of the service. | 06-17-2010 |
Robin Cole, Seattle, WA US
| Patent application number | Description | Published |
|---|---|---|
| 20100182636 | SYSTEMS AND METHODS FOR PRINTER OPTIMIZATION - Systems and methods for printer optimization. A method for optimizing a readable dot pattern printed on paper for use with a digital pen is disclosed herein. A test sheet is printed on a selected printer; the first test sheet has a plurality of regions. Each of the regions has a partial digital pattern configured with digitally readable indicia. Each of the indicia has a defined area. An outline is applied to each of the plurality of regions on the test sheet. Ink is applied onto the digital paper using a digital pen within the applied outlines. Data is uploaded from the digital pen to a processor. The smallest indicia readable by the digital pen are determined. A printer control file is updated with the determined smallest indicia. | 07-22-2010 |
| 20100251089 | DETERMINING AN OBJECT LOCATION RELATIVE TO A DIGITAL DOCUMENT - Systems and methods for determining an object location relative to a digital document are disclosed herein. A marking is applied to at least one cell in at least one row and to at least one cell in at least one column of a digital document. The markings define an axis system for the digital document. Each object has a stored digital address within the digital document. When the digital document is converted into a fixed file format, a location of the object can be determined that will match the location of the object on the printed page. By comparing the digital address of the object to the axis system defined by the markings, after the document has been converted to a fixed document format, the location of the object is defined spatially. | 09-30-2010 |