Inventors list

Assignees list

Classification tree browser

Top 100 Inventors

Top 100 Assignees


He, WA

Dandan He, Redmond, WA US

Patent application numberDescriptionPublished
20110258575DISPLAYING LARGE DATASETS IN A BROWSER ENVIRONMENT - A mechanism for displaying large datasets may download an approximate range of the dataset along with a subset of the dataset to a client. The client may display the subset as well as indicators for the approximate range. When a user moves to a position within the dataset that is not downloaded, the client may send a request for a second subset of the dataset, which may be displayed on the client. The user may interact with the dataset to select different items in the dataset, for example, and those interactions may be collected while the user views different portions of the dataset. The user may process all of the interactions over the entire dataset or a portion of the dataset by committing the changes.10-20-2011

Dingshan He, Bellevue, WA US

Patent application numberDescriptionPublished
20080256427SYSTEM, METHOD, AND SERVICE FOR PROVIDING A GENERIC RAID ENGINE AND OPTIMIZER - A generic RAID engine system accepts an access request, accepts a metadata input comprising a layout description and, optionally, a plurality of resource optimization objectives, accepts a dynamic input comprising a dynamic state of an I/O stack comprising the generic RAID engine and a fault configuration of a plurality of storage devices in the I/O stack, and accepts RAID code input comprising information about the RAID code used by the I/O stack. The metadata input, the dynamic input, and the RAID code input are utilized to transform the access request into individual device reads and individual device writes such that RAID code relationships for the storage devices are maintained at all times. An optional optimizer module selects strategies that meet the resource optimization objectives.10-16-2008
20080270704CACHE ARRANGEMENT FOR IMPROVING RAID I/O OPERATIONS - The embodiments of the invention provide a method, apparatus, etc. for a cache arrangement for improving RAID I/O operations. More specifically, a method begins by partitioning a data object into a plurality of data blocks and creating one or more parity data blocks from the data object. Next, the data blocks and the parity data blocks are stored within storage nodes. Following this, the method caches data blocks within a partitioned cache, wherein the partitioned cache includes a plurality of cache partitions. The cache partitions are located within the storage nodes, wherein each cache partition is smaller than the data object. Moreover, the caching within the partitioned cache only caches data blocks in parity storage nodes, wherein the parity storage nodes comprise a parity storage field. Thus, caching within the partitioned cache avoids caching data blocks within storage nodes lacking the parity storage field.10-30-2008
20080270878CACHE ARRANGEMENT FOR IMPROVING RAID I/O OPERATIONS - The embodiments of the invention provide a method, apparatus, etc. for a cache arrangement for improving RAID I/O operations. More specifically, a method begins by partitioning a data object into a plurality of data blocks and creating one or more parity data blocks from the data object. Next, the data blocks and the parity data blocks are stored within storage nodes. Following this, the method caches data blocks within a partitioned cache, wherein the partitioned cache includes a plurality of cache partitions. The cache partitions are located within the storage nodes, wherein each cache partition is smaller than the data object. Moreover, the caching within the partitioned cache only caches data blocks in parity storage nodes, wherein the parity storage nodes comprise a parity storage field. Thus, caching within the partitioned cache avoids caching data blocks within storage nodes lacking the parity storage field.10-30-2008

Jerry He, Redmond, WA US

Patent application numberDescriptionPublished
20110202509EFFICIENT EXTRACTION AND COMPRESSION OF DATA - A device for dynamically extracting and compressing information for a streaming media asset is provided. One embodiment of the device provides a computing device comprising a processor and memory comprising instructions stored therein that are executable by the processor. The instructions stored in the memory are executable to provide to a requesting computing device dynamically compressed information for a streaming media asset, the dynamically compressed information derived from an information file comprising variable data elements arranged in one or more data fields according to a well-known structure. For example, the instructions are executable to receive from the requesting computing device a request for the compressed information, extract the variable data elements from the information file, compress the variable data elements to form compressed data elements, and send to the requesting computing device a compressed file comprising the compressed data elements.08-18-2011

Jialin He, Redmond, WA US

Patent application numberDescriptionPublished
20100240413Smart Card File System - An application programming interface (API) may receive high level file commands and implement those commands using the storage mechanism on a smart card. The smart card may have a processor and storage mechanism and may communicate to a host device using a packet based communication protocol, such as ADPU. The API may translate the high level file commands into one or more ADPU commands, communicate with the smart card, receive APDU responses, and translate the responses into high level file commands. A high level file command may allow access to a file using long file names, a hierarchical directory structure, and may allow creating, writing, reading, and deleting a file. Some embodiments may have more complex functions for navigating and manipulating a hierarchical directory structure, as well as defining metadata including access privileges and file types to individual files.09-23-2010

Jianmin He, Redmond, WA US

Patent application numberDescriptionPublished
20100211204METHOD AND SYSTEM FOR ROBOTIC ASSEMBLY PARAMETER OPTIMIZATION - A method and system to optimize the parameters of a robot used in an assembly process. The assembly process is categorized based on its nature which may be cylindrical, radial and multi-stage insertion. The search pattern and search parameters are specified. The parameters are optimized and the optimized parameter set are verified and when a predetermined criteria such as assembly cycle time set and/or success rate is met the optimization process stops. When the optimization stops the verified parameters are used to cause the robot to perform the categorized assembly process. If the parameters do not meet the predetermined criteria, another round of optimization using the same or other parameters can be performed.08-19-2010

Jianmin He, Bellevue, WA US

Patent application numberDescriptionPublished
20100145509Method And System For In-Production Optimization of The Parameters Of A Robot Used for Assembly - A robot is used to repeatedly assemble part during a continuous production run of parts to be assembled. There are parameters of the robot associated with the assembly. These parameters are used to assemble the parts. Simultaneously with that repeated assembly the robot parameters are optimized. The parts to be assembled have a starting position for the assembly and the simultaneous optimization of the robot assembly parameters also includes the learning of the starting position. The robot assembly parameters can be optimized in a predefined manner. The optimized parameters can then be verified and the optimized and verified robot assembly parameters may then be used in place of the parameters of the robot associated with the parts assembly along with the learned starting position.06-10-2010

Quan He, Lacey, WA US

Patent application numberDescriptionPublished
20110209839Method for making absorbent products - A method of making personal hygiene articles of high absorbency from cellulosic fiber pulp without chemical cross-linking of the cellulosic fibers is disclosed. The method comprises interposing a sublayer of mechanically fluffed alkali extracted cellulosic fiber pulp between a fluid permeable layer and a fluid impermeable layer.09-01-2011

Rongsen He, Pullman, WA US

Patent application numberDescriptionPublished
20090141711Interleaved Multistage Switching Fabrics And Associated Methods - An interleaved multistage switching fabric includes Y multistage switching fabric panels, where Y is an integer greater than one. Each panel has primary inputs for receiving cells to be routed, local outputs for outputting routed cells, primary outputs for outputting non-routed cells, and reentry points for introducing non-routed cells into the panel. The switching fabric additionally includes at least one demultiplexer subsystem communicatively coupled to primary inputs of each panel, for interfacing the switching fabric with input lines. The switching fabric further includes at least one multiplexer subsystem communicatively coupled to local outputs of each panel, for interfacing the switching fabric with destination queues. The switching fabric additionally includes Y recirculation connections, where each recirculation connection communicatively couples primary outputs of one panel to reentry points of another panel.06-04-2009

Xiaodong He, Issaquah, WA US

Patent application numberDescriptionPublished
20080201139Generic framework for large-margin MCE training in speech recognition - A method and apparatus for training an acoustic model are disclosed. A training corpus is accessed and converted into an initial acoustic model. Scores are calculated for a correct class and competitive classes, respectively, for each token given the initial acoustic model. Also, a sample-adaptive window bandwidth is calculated for each training token. From the calculated scores and the sample-adaptive window bandwidth values, loss values are calculated based on a loss function. The loss function, which may be derived from a Bayesian risk minimization viewpoint, can include a margin value that moves a decision boundary such that token-to-boundary distances for correct tokens that are near the decision boundary are maximized. The margin can either be a fixed margin or can vary monotonically as a function of algorithm iterations. The acoustic model is updated based on the calculated loss values. This process can be repeated until an empirical convergence is met.08-21-2008
20090063126Validation of the consistency of automatic terminology translation - A method of determining the consistency of training data for a machine translation system is disclosed. The method includes receiving a signal indicative of a source language corpus and a target language corpus. A textual string is extracted from the source language corpus. The textual string is aligned with the target language corpus to identify a translation for the textual string from the target language corpus. A consistency index is calculated based on a relationship between the textual string from the source language corpus and the translation. An indication of the consistency index is stored on a tangible medium.03-05-2009
20090112573Word-dependent transition models in HMM based word alignment for statistical machine translation - A word alignment modeler uses probabilistic learning techniques to train “word-dependent transition models” for use in constructing phrase level Hidden Markov Model (HMM) based word alignment models. As defined herein, “word-dependent transition models” provide a probabilistic model wherein for each source word in training data, a self-transition probability is modeled in combination with a probability of jumping from that particular word to a different word, thereby providing a full transition model for each word in a source phrase. HMM based word alignment models are then used for various word alignment and machine translation tasks. In additional embodiments sparse data problems (i.e., rarely used words) are addressed by using probabilistic learning techniques to estimate word-dependent transition model parameters by maximum a posteriori (MAP) training.04-30-2009
20090240486HMM ALIGNMENT FOR COMBINING TRANSLATION SYSTEMS - A computing system configured to produce an optimized translation hypothesis of text input into the computing system. The computing system includes a plurality of translation machines. Each of the translation machines is configured to produce their own translation hypothesis from the same text. An optimization machine is connected to the plurality of translation machines. The optimization machine is configured to receive the translation hypotheses from the translation machines. The optimization machine is further configured to align, word-to-word, the hypotheses in the plurality of hypotheses by using a hidden Markov model.09-24-2009
20100161330SPEECH MODELS GENERATED USING COMPETITIVE TRAINING, ASYMMETRIC TRAINING, AND DATA BOOSTING - Speech models are trained using one or more of three different training systems. They include competitive training which reduces a distance between a recognized result and a true result, data boosting which divides and weights training data, and asymmetric training which trains different model components differently.06-24-2010
20100311030USING COMBINED ANSWERS IN MACHINE-BASED EDUCATION - Described is a technology for learning a foreign language or other subject. Answers (e.g., translations) to questions (e.g., sentences to translate) received from learners are combined into a combined answer that serves as a representative model answer for those learners. The questions also may be provided to machine subsystems to generate machine answers, e.g., machine translators, with those machine answers used in the combined answer. The combined answer is used to evaluate each learner's individual answer. The evaluation may be used to compute profile information that is then fed back for use in selecting further questions, e.g., more difficult sentences as the learners progress. Also described is integrating the platform/technology into a web service.12-09-2010

Patent applications by Xiaodong He, Issaquah, WA US

Yaming He, Redmond, WA US

Patent application numberDescriptionPublished
20100316126MOTION BASED DYNAMIC RESOLUTION MULTIPLE BIT RATE VIDEO ENCODING - A video encoding system encodes video streams for multiple bit rate video streaming using an approach that permits the encoded resolution to vary based, at least in part, on motion complexity. The video encoding system dynamically decides an encoding resolution for segments of the multiple bit rate video streams that varies with video complexity so as to achieve a better visual experience for multiple bit rate streaming. Motion complexity may be considered separately, or along with spatial complexity, in making the resolution decision.12-16-2010

Yiwu He, Mercer Island, WA US

Patent application numberDescriptionPublished
20110245092DIAGNOSING AND MONITORING DEPRESSION DISORDERS BASED ON MULTIPLE SERUM BIOMARKER PANELS - Materials and Methods related to developing a unipolar depression (MDD) disease score in a subject using a multi-parameter system to measure a plurality of parameters, and an algorithm to calculate a score.10-06-2011

Yudong He, Kirkland, WA US

Patent application numberDescriptionPublished
20090157326Diagnosis and prognosis of breast cancer patients - The present invention relates to genetic markers whose expression is correlated with breast cancer. Specifically, the invention provides sets of markers whose expression patterns can be used to differentiate clinical conditions associated with breast cancer, such as the presence or absence of the estrogen receptor ESR1, and BRCA1 and sporadic tumors, and to provide information on the likelihood of tumor distant metastases within five years of initial diagnosis. The invention relates to methods of using these markers to distinguish these conditions. The invention also relates to kits containing ready-to-use microarrays and computer software for data analysis using the statistical methods disclosed herein.06-18-2009
20090204333METHODS FOR USING CO-REGULATED GENESETS TO ENHANCE DETECTION AND CLASSIFICATION OF GENE EXPRESSION PATTERNS - The present invention provides methods for enhanced detection of biological response patterns. In one embodiment of the invention, genes are grouped into basis genesets according to the co-regulation of their expression. Expression of individual genes within a geneset is indicated with a single gene expression value for the geneset by a projection process. The expression values of genesets, rather than the expression of individual genes, are then used as the basis for comparison and detection of biological response with greatly enhanced sensitivity. In another embodiment of the invention, biological responses are grouped according to the similarity of their biological profile.08-13-2009
20090239214Prognosis of breast cancer patients - The present invention relates to sets of genetic markers whose expression is correlated with prognosis of breast cancer in individuals having breast cancer. Specifically, the invention provides sets of markers whose expression patterns can be used to differentiate individuals having a good prognosis, e.g., no reoccurrence or metastasis within five years of initial diagnosis, and individuals having a poor prognosis, e.g., reoccurrence or metastasis within five years of initial diagnosis. The invention relates to methods of prognosis using these markers. The invention also relates to microarrays containing probes to these markers, and to kits containing ready-to-use microarrays and computer software for data analysis using the prognostic and statistical methods disclosed herein.09-24-2009

Patent applications by Yudong He, Kirkland, WA US

Zifeng He, Redmond, WA US

Patent application numberDescriptionPublished
20080222598Using a system of annotations to generate views and adapters - Various technologies and techniques are disclosed for using annotations in contracts to generate views and adapters. A framework is provided that supports annotations that can be used in a contract to allow a user to express how one or more members of the contract should be represented in at least one view, and to express how to adapt the members in at least one adapter. Annotations can also be used to indicate which of the components should be programmatically generated. The contract is accessed and at least a portion of the at least one view and the at least one adapter are generated based on the annotations and other information contained in the contract. For example, source code can programmatically be generated for a host side view, an add-in side view, a host side adapter, and an add-in side adapter using the various contract details and the annotations.09-11-2008
20090006629Instantiating a communication pipeline between software - An embodiment not only instantiates a pipeline that allows communication between first and second executable nodes regardless of whether the nodes have compatible or incompatible interface views, but also structures the pipeline based on the relationship between the interface views so, for example, the pipeline does not consume unnecessary overhead or introduce unnecessary data-transfer delay. For example, an embodiment compares a first interface view of a first executable node to a second interface view of a second executable node. A first communication pipeline having a first structure is instantiated between the first and second nodes if the first view has a first pre-established relationship to the second view, and a second communication pipeline having a second structure is instantiated between the first and second nodes if the first view has a second pre-established relationship to the second view.01-01-2009