Patent application number | Description | Published |
20090198934 | FULLY ASYNCHRONOUS MEMORY MOVER - A data processing system has a processor and a memory coupled to the processor and an asynchronous memory mover coupled to the processor. The asynchronous memory mover has registers for receiving a set of parameters from the processor, which parameters are associated with an asynchronous memory move (AMM) operation initiated by the processor in virtual address space, utilizing a source effective address and a destination effective address. The asynchronous memory mover performs the AMM operation to move the data from a first physical memory location having a source real address corresponding to the source effective address to a second physical memory location having a destination real address corresponding to the destination effective address. The asynchronous memory mover has an associated off-chip translation mechanism. The AMM operation thus occurs independent of the processor, and the processor continues processing other operations independent of the AMM operation. | 08-06-2009 |
20110145791 | TECHNIQUES FOR DEBUGGING CODE DURING RUNTIME - A technique for debugging code during runtime includes providing, from an outside process, a trigger to a daemon. In this case, the trigger is associated with a registered callback function. The trigger is then provided, from the daemon, to one or more designated tasks of a job. The registered callback function (that is associated with the trigger) is then executed by the one or more designated tasks. Execution results of the executed registered callback function are then returned (from the one or more designated tasks) to the daemon. | 06-16-2011 |
20110173258 | Collective Acceleration Unit Tree Flow Control and Retransmit - A mechanism is provided for collective acceleration unit tree flow control forms a logical tree (sub-network) among those processors and transfers “collective” packets on this tree. The system supports many collective trees, and each collective acceleration unit (CAU) includes resources to support a subset of the trees. Each CAU has limited buffer space, and the connection between two CAUs is not completely reliable. Therefore, to address the challenge of collective packets traversing on the tree without colliding with each other for buffer space and guaranteeing the end-to-end packet delivery, each CAU in the system effectively flow controls the packets, detects packet loss, and retransmits lost packets. | 07-14-2011 |
20110238956 | Collective Acceleration Unit Tree Structure - A mechanism is provided in a collective acceleration unit for performing a collective operation to distribute or collect data among a plurality of participant nodes. The mechanism receives an input collective packet for a collective operation from a neighbor node within a collective tree. The input collective packet comprises a tree identifier and an input data field and wherein the collective tree comprises a plurality of sub trees. The mechanism maps the tree identifier to an index within the collective acceleration unit. The index identifies a portion of resources within the collective acceleration unit and is associated with a set of neighbor nodes in a given sub tree within the collective tree. For each neighbor node the collective acceleration unit stores destination information. The collective acceleration unit performs an operation on the input data field using the portion of resources to effect the collective operation. | 09-29-2011 |
20120296915 | Collective Acceleration Unit Tree Structure - A mechanism is provided in a collective acceleration unit for performing a collective operation to distribute or collect data among a plurality of participant nodes. The mechanism receives an input collective packet for a collective operation from a neighbor node within a collective tree. The input collective packet comprises a tree identifier and an input data field and wherein the collective tree comprises a plurality of sub trees. The mechanism maps the tree identifier to an index within the collective acceleration unit. The index identifies a portion of resources within the collective acceleration unit and is associated with a set of neighbor nodes in a given sub tree within the collective tree. For each neighbor node the collective acceleration unit stores destination information. The collective acceleration unit performs an operation on the input data field using the portion of resources to effect the collective operation. | 11-22-2012 |
20130067479 | Establishing A Group Of Endpoints In A Parallel Computer - A parallel computer executes a number of tasks, each task includes a number of endpoints and the endpoints are configured to support collective operations. In such a parallel computer, establishing a group of endpoints receiving a user specification of a set of endpoints included in a global collection of endpoints, where the user specification defines the set in accordance with a predefined virtual representation of the endpoints, the predefined virtual representation is a data structure setting forth an organization of tasks and endpoints included in the global collection of endpoints and the user specification defines the set of endpoints without a user specification of a particular endpoint; and defining a group of endpoints in dependence upon the predefined virtual representation of the endpoints and the user specification. | 03-14-2013 |
20130152101 | PREPARING PARALLEL TASKS TO USE A SYNCHRONIZATION REGISTER - A job may be divided into multiple tasks that may execute in parallel on one or more compute nodes. The tasks executing on the same compute node may be coordinated using barrier synchronization. However, to perform barrier synchronization, the tasks use (or attach) to a barrier synchronization register which establishes a common checkpoint for each of the tasks. A leader task may use a shared memory region to publish to follower tasks the location of the barrier synchronization register—i.e., a barrier synchronization register ID. The follower tasks may then monitor the shared memory to determine the barrier synchronization register ID. The leader task may also use a count to ensure all the tasks attach to the BSR. This advantageously avoids any task-to-task communication which may reduce overhead and improve performance. | 06-13-2013 |
20130152103 | PREPARING PARALLEL TASKS TO USE A SYNCHRONIZATION REGISTER - A job may be divided into multiple tasks that may execute in parallel on one or more compute nodes. The tasks executing on the same compute node may be coordinated using barrier synchronization. However, to perform barrier synchronization, the tasks use (or attach) to a barrier synchronization register which establishes a common checkpoint for each of the tasks. A leader task may use a shared memory region to publish to follower tasks the location of the barrier synchronization register—i.e., a barrier synchronization register ID. The follower tasks may then monitor the shared memory to determine the barrier synchronization register ID. The leader task may also use a count to ensure all the tasks attach to the BSR. This advantageously avoids any task-to-task communication which may reduce overhead and improve performance. | 06-13-2013 |
20130247069 | Creating A Checkpoint Of A Parallel Application Executing In A Parallel Computer That Supports Computer Hardware Accelerated Barrier Operations - In a parallel computer executing a parallel application, where the parallel computer includes a number of compute nodes, with each compute node including one or more computer processors, the parallel application including a number of processes, and one or more of the processes executing a barrier operation, creating a checkpoint of a parallel application includes: maintaining, by each computer processor, global barrier operation state information, the global barrier operation state information includes an aggregation of each process's barrier operation state information; invoking, for each process of the parallel application, a checkpoint handler; saving, by each process's checkpoint handler as part of a checkpoint for the parallel application, the process's barrier operation state information; and exiting, by each process, the checkpoint handler. | 09-19-2013 |
20140280432 | Responding To A Timeout Of A Message In A Parallel Computer - Methods, apparatuses, and computer program products for responding to a timeout of a message in a parallel computer are provided. The parallel computer includes a plurality of compute nodes operatively coupled for data communications over one or more data communications networks. Each compute node includes one or more tasks. Embodiments include a first task of a first node sending a message to a second task on a second node. Embodiments also include the first task sending to the second node a command via a parallel operating environment (POE) in response to a timeout of the message. The command instructs the second node to perform a timeout motivated operation. | 09-18-2014 |
20140282557 | Responding To A Timeout Of A Message In A Parallel Computer - Methods, apparatuses, and computer program products for responding to a timeout of a message in a parallel computer are provided. The parallel computer includes a plurality of compute nodes operatively coupled for data communications over one or more data communications networks. Each compute node includes one or more tasks. Embodiments include a first task of a first node sending a message to a second task on a second node. Embodiments also include the first task sending to the second node a command via a parallel operating environment (POE) in response to a timeout of the message. The command instructs the second node to perform a timeout motivated operation. | 09-18-2014 |
20140282612 | Acknowledging Incoming Messages - Acknowledging incoming messages, including: determining, by an acknowledgement dispatching module, whether an incoming message has been received in an active message queue; responsive to determining that the incoming message has been received in the active message queue, resetting, by the acknowledgement dispatching module, an acknowledgment iteration counter; incrementing, by the acknowledgement dispatching module, the acknowledgment iteration counter; determining, by the acknowledgement dispatching module, whether the acknowledgment iteration counter has reached a predetermined threshold; and responsive to determining that the acknowledgment iteration counter has reached the predetermined threshold, processing, by the acknowledgement dispatching module, all messages in the active message queue. | 09-18-2014 |
20140282613 | Acknowledging Incoming Messages - Acknowledging incoming messages, including: determining, by an acknowledgement dispatching module, whether an incoming message has been received in an active message queue; responsive to determining that the incoming message has been received in the active message queue, resetting, by the acknowledgement dispatching module, an acknowledgment iteration counter; incrementing, by the acknowledgement dispatching module, the acknowledgment iteration counter; determining, by the acknowledgement dispatching module, whether the acknowledgment iteration counter has reached a predetermined threshold; and responsive to determining that the acknowledgment iteration counter has reached the predetermined threshold, processing, by the acknowledgement dispatching module, all messages in the active message queue. | 09-18-2014 |
20150205888 | SIMULATION OF HIGH PERFORMANCE COMPUTING (HPC) APPLICATION ENVIRONMENT USING VIRTUAL NODES - A method, apparatus and program product simulate a high performance computing (HPC) application environment by creating a cluster of virtual nodes in one or more operating system instances executing on one or more physical computing node, thereby enabling a plurality of parallel tasks from an HPC application to be executed on the cluster of virtual nodes. | 07-23-2015 |
Patent application number | Description | Published |
20090022685 | Orthotopic, controllable, and genetically tractable non-human animal model for cancer - This invention provides a genetically tractable in situ non-human animal model for hepatocellular carcinoma. The model is useful, inter alia, in understanding the molecular mechanisms of liver cancer, in understanding the genetic alterations (e.g., in oncogenes and tumor suppressor genes) that lead to chemoresistance or poor prognosis, and in identifying and evaluating new therapies against hepatocellular carcinomas. The liver cancer model of this invention is made by altering hepatocytes to increase oncogene expression, to reduce tumor suppressor gene expression or both, preferably by inducible, reversible, and/or tissue specific expression of double-stranded RNA molecules that interfere with the expression of a target gene, and by transplanting the resulting hepatocytes into a recipient non-human animal. The invention further provides a method to treat cancer involving cooperative interactions between a tumor cell senescence program and the innate immune system. | 01-22-2009 |
20100273660 | ONCOGENOMICS-BASED RNAi SCREEN AND USE THEREOF TO IDENTIFY NOVEL TUMOR SUPPRESSORS - In some aspects, the invention provides a genetically tractable in situ non-human animal model for hepatocellular carcinoma. The model is useful, inter alia, in understanding the molecular mechanisms of liver cancer, in understanding the genetic alterations that lead to chemoresistance or poor prognosis, and in identifying and evaluating new therapies against hepatocellular carcinomas. The liver cancer model of this invention is made by altering hepatocytes to increase oncogene expression, to reduce tumor suppressor gene expression or both and by transplanting the resulting hepatocytes into a recipient non-human animal. | 10-28-2010 |
20110035814 | COOPERATING ONCOGENES IN CANCER - This invention provides methods of diagnosis, drug screening, and treatment based on the discovery that cIAP1 and Yap are co-amplified oncogenes that cooperate to contribute to oncogenesis and tumor maintenance. | 02-10-2011 |
Patent application number | Description | Published |
20100045978 | SPECTRAL SIGNATURE EXTRACTION FOR DRUG VERIFICATION AND IDENTIFICATION - Systems and methods perform signature extraction from an acquired spectrum of a pharmaceutical. An acquired spectrum of the pharmaceutical is measured using a spectrometer. The acquired spectrum is obtained from the spectrometer using a processor. A system-response function of the spectrometer is removed from the acquired spectrum using the processor. An intensity of the acquired spectrum is normalized to a predetermined scale using the processor. Fluorescence is removed from the acquired spectrum using the processor. Finally, an extracted signature of the pharmaceutical is obtained from the remainder of the acquired spectrum using the processor. If the acquired spectrum of the pharmaceutical is measured by the spectrometer through a container holding the pharmaceutical, a spectrum of the container is removed from the remainder of the acquired spectrum to produce the extracted signature of the pharmaceutical using the processor. | 02-25-2010 |
20100235030 | SYSTEM AND METHOD FOR OPERATION OF HYBRID VEHICLES - A system for operating a hybrid vehicle includes a computer programmed to identify a location of a hybrid vehicle, access a map and identify a plurality of links therein, pre-screen the plurality of links to identify if any of the plurality of links is within a given bounds of the current location, and if one or more possible links are identified, then match the current location of the hybrid vehicle to one of the identified links, and upload power data for the hybrid vehicle corresponding to the matched location into a database. | 09-16-2010 |
20110131595 | METHODS AND SYSTEMS FOR ONLINE RECOMMENDATION - A method for recommending videos is presented. The method includes generating a cross-usage matrix based upon a data of video sessions for a plurality of videos, generating a temporal matrix based upon release dates of the plurality of videos, generating a cross-temporal matrix based upon the cross-usage matrix and the temporal matrix, computing a global video rank corresponding to each of the plurality of videos based upon the cross-temporal matrix, generating a similarity score corresponding to each pair of videos in the plurality of videos based upon meta-data of the plurality of videos, and generating a local video rank corresponding to each of the plurality of videos relative to another video in the plurality of videos based upon the generated cross-usage matrix, the computed global video rank and the generated similarity score. | 06-02-2011 |
20130132982 | METHODS AND SYSTEMS FOR ONLINE RECOMMENDATION - A method for recommending videos is presented. The method includes generating a cross-usage matrix based upon a data of video sessions for a plurality of videos, generating a temporal matrix based upon release dates of the plurality of videos, generating a cross-temporal matrix based upon the cross-usage matrix and the temporal matrix, computing a global video rank corresponding to each of the plurality of videos based upon the cross-temporal matrix, generating a similarity score corresponding to each pair of videos in the plurality of videos based upon meta-data of the plurality of videos, and generating a local video rank corresponding to each of the plurality of videos relative to another video in the plurality of videos based upon the generated cross-usage matrix, the computed global video rank and the generated similarity score. | 05-23-2013 |
20140321758 | IMAGE CONCEALING VIA EFFICIENT FEATURE SELECTION - A novel technique for unsupervised feature selection is disclosed. The disclosed methods include automatically selecting a subset of a feature of an image. Additionally, the selection of the subset of features may be incorporated with a congealing algorithm, such as a least-square-based congealing algorithm. By selecting a subset of the feature representation of an image, redundant and/or irrelevant features may be reduced or removed, and the efficiency and accuracy of least-square-based congealing may be improved. | 10-30-2014 |
20150324663 | IMAGE CONGEALING VIA EFFICIENT FEATURE SELECTION - A novel technique for unsupervised feature selection is disclosed. The disclosed methods include automatically selecting a subset of a feature of an image. Additionally, the selection of the subset of features may be incorporated with a congealing algorithm, such as a least-square-based congealing algorithm. By selecting a subset of the feature representation of an image, redundant and/or irrelevant features may be reduced or removed, and the efficiency and accuracy of least-square-based congealing may be improved. | 11-12-2015 |
Patent application number | Description | Published |
20130185819 | Genetically Modified Major Histocompatibility Complex Animals - The invention provides genetically modified non-human animals that express chimeric human/non-human MHC I polypeptide and/or human or humanized β2 microglobulin polypeptide, as well as embryos, cells, and tissues comprising the same. Also provided are constructs for making said genetically modified animals and methods of making the same. Methods of using the genetically modified animals to study various aspects of human immune system are provided. | 07-18-2013 |
20150320021 | HUMANIZED IL-4 AND IL-4Ra ANIMALS - Non-human animals comprising a human or humanized IL-4 and/or IL-4Rα nucleic acid sequence are provided. Non-human animals that comprise a replacement of the endogenous IL-4 gene and/or IL-4Rα gene with a human IL-4 gene and/or IL-4Rα gene in whole or in part, and methods for making and using the non-human animals, are described. Non-human animals comprising a human or humanized IL-4 gene under control of non-human IL-4 regulatory elements is also provided, including non-human animals that have a replacement of non-human IL-4-encoding sequence with human IL-4-encoding sequence at an endogenous non-human IL-4 locus. Non-human animals comprising a human or humanized IL-4Rα gene under control of non-human IL-4Rα regulatory elements is also provided, including non-human animals that have a replacement of non-human IL-4Rα-encoding sequence with human or humanized IL-4Rα-encoding sequence at an endogenous non-human C IL-4Rα locus. Non-human animals comprising human or humanized IL-4 gene and/or IL-4Rα sequences, wherein the non-human animals are rodents, e.g., mice or rats, are provided. | 11-12-2015 |
20150320022 | HUMANIZED IL-4 AND IL-4Ra ANIMALS - Non-human animals comprising a human or humanized IL-4 and/or IL-4Rα nucleic acid sequence are provided. Non-human animals that comprise a replacement of the endogenous IL-4 gene and/or IL-4Rα gene with a human IL-4 gene and/or IL-4Rα gene in whole or in part, and methods for making and using the non-human animals, are described. Non-human animals comprising a human or humanized IL-4 gene under control of non-human IL-4 regulatory elements is also provided, including non-human animals that have a replacement of non-human IL-4-encoding sequence with human IL-4-encoding sequence at an endogenous non-human IL-4 locus. Non-human animals comprising a human or humanized IL-4Rα gene under control of non-human IL-4Rα regulatory elements is also provided, including non-human animals that have a replacement of non-human IL-4Rα-encoding sequence with human or humanized IL-4Rα-encoding sequence at an endogenous non-human C IL-4Rα locus. Non-human animals comprising human or humanized IL-4 gene and/or IL-4Rα sequences, wherein the non-human animals are rodents, e.g., mice or rats, are provided. | 11-12-2015 |
Patent application number | Description | Published |
20120271740 | MANAGING FRESH-PRODUCT INVENTORY - Freshness inventory control problem may be formulated as a stochastic dynamic program. In one aspect, a stochastic dynamic programming formulation takes as input inventory status, stochastic demand forecast and cost information associated with on-hand inventory. The stochastic dynamic programming formulation is maximized to determine order quantity and depletion quantity of the product per period. | 10-25-2012 |
20120290500 | CONFIGURATION PRICING STRATEGIES FOR MULTI-COMMODITY REQUEST-FOR-QUOTES - Win probability estimation model that statistically computes the probability of winning a bid at a given price, and profit optimization models that compute the optimal price for a bid balancing the probability of winning a bid at a price with the profitability of the bid at the given price. In one stage, an expected profit margin of a product may be formulated as a function of its profit margin and win probability to compute its optimal profit margin. In another stage, an expected profit for one or more product accessories may be formulated as a function of the profit margin and their conditional win probability given the server win to compute their optimal profit margins. The conditional win probabilities for the product accessories may be modeled as a function of the utilities of the various purchase options that contain the product and that accessory. | 11-15-2012 |
20130132147 | MANAGING FRESH-PRODUCT INVENTORY - Freshness inventory control problem may be formulated as a stochastic dynamic program. In one aspect, a stochastic dynamic programming formulation takes as input inventory status, stochastic demand forecast and cost information associated with on-hand inventory. The stochastic dynamic programming formulation is maximized to determine order quantity and depletion quantity of the product per period. | 05-23-2013 |
20130268415 | JOINT PRICING AND REPLENISHMENT OF FRESHNESS INVENTORY - Joint pricing and replenishment of freshness inventory or products having different qualities determines the joint pricing and inventory strategies to optimize the retailer's benefits from product freshness, employing a dynamic programming formulation that incorporates a demand model that captures consumer choice based on both the freshness and price. | 10-10-2013 |
20140310064 | PRICING PERSONALIZED PACKAGES WITH MULTIPLE COMMODITIES - A top-down and bottom-up approach that decomposes product bundles to components, classifies them into different groups corresponding to a component similarity measure, and detects their inherent values. The bundles are reassembled and characterized by several key attributes according to their component inherent values, and classified into segments. A normalized utility model is constructed for each product bundle segment, taking into account the additive effect among different commodity types and product families. The goodness of fit of the top-down and the bottom-up model may be validated. The model may be applied in an RFQ pricing environment. | 10-16-2014 |
20140310065 | PRICING PERSONALIZED PACKAGES WITH MULTIPLE COMMODITIES - A top-down and bottom-up approach that decomposes product bundles to components, classifies them into different groups corresponding to a component similarity measure, and detects their inherent values. The bundles are reassembled and characterized by several key attributes according to their component inherent values, and classified into segments. A normalized utility model is constructed for each product bundle segment, taking into account the additive effect among different commodity types and product families. The goodness of fit of the top-down and the bottom-up model may be validated. The model may be applied in an RFQ pricing environment. | 10-16-2014 |