Patent application number | Description | Published |
20110212446 | FAST PCR FOR STR GENOTYPING - Disclosed is a method of amplifying a nucleic acid sequence, wherein the method comprises subjecting a reaction mixture to at least one amplification cycle, wherein the reaction mixture comprises a double-stranded nucleic acid and at least two primers capable of annealing to complementary strands of the double-stranded nucleic acid and amplifying at least one short tandem repeat (STR) using a Family A DNA polymerase in a Fast PCR protocol having a two-step amplification cycle in 25 seconds or less. Also disclosed are real-time PCR methods using the two-step protocol and kits for STR profiling using the Fast PCR protocol. | 09-01-2011 |
20120070832 | SE33 MUTATIONS IMPACTING GENOTYPE CONCORDANCE - Disclosed are primer set compositions, methods and kits for human identification using the highly complex sequence locus, SE33 (ACTBP2) in single and multiplex PCR reactions. Additionally, disclosed are three newly discovered single nucleotide polymorphisms (SNPs) within the SE33 locus that can cause discordance seen as mobility shift or allelic dropout. Also disclosed are kits useful in human identification. | 03-22-2012 |
20120122093 | METHODS AND KITS FOR MULTIPLEX AMPLIFICATION OF SHORT TANDEM REPEAT LOCI - Compositions, methods and kits are disclosed for use in simultaneously amplifying at least 20 specific STR loci of genomic nucleic acid in a single multiplex reaction, as are methods and materials for use in the analysis of the products of such reactions. Included in the present invention are materials and methods for the simultaneous amplification of 23 and 24 specific loci in a single multiplex reaction, comprising the 13 CODIS loci, the Amelogenin locus, an InDel and at least six to ten additional STR loci, including methods, kits and materials for the analysis of these loci. | 05-17-2012 |
20140120541 | METHOD FOR DIRECT AMPLIFICATION FROM CRUDE NUCLEIC ACID SAMPLES - The present teachings relate to improved methods, kits, and reaction mixtures for amplifying nucleic acids. In some embodiments a novel direct buffer formulation is provided which allows for the direct amplification of the nucleic acids in a crude sample with minimal sample purification. | 05-01-2014 |
20140141422 | Fast PCR for STR Genotyping - Disclosed is a method of amplifying a nucleic acid sequence, wherein the method comprises subjecting a reaction mixture to at least one amplification cycle, wherein the reaction mixture comprises a double-stranded nucleic acid and at least two primers capable of annealing to complementary strands of the double-stranded nucleic acid and amplifying at least one short tandem repeat (STR) using a Family A DNA polymerase in a Fast PCR protocol having a two-step amplification cycle in 25 seconds or less. Also disclosed are real-time PCR methods using the two-step protocol and kits for STR profiling using the Fast PCR protocol. | 05-22-2014 |
20150037791 | METHODS AND KITS FOR MULTIPLEX AMPLIFICATION OF SHORT TANDEM REPEAT LOCI - Compositions, methods and kits are disclosed for use in simultaneously amplifying at least 20 specific STR loci of genomic nucleic acid in a single multiplex reaction, as are methods and materials for use in the analysis of the products of such reactions. Included in the present invention are materials and methods for the simultaneous amplification of 23 and 24 specific loci in a single multiplex reaction, comprising the 13 CODIS loci, the Amelogenin locus, an InDel and at least six to ten additional STR loci, including methods, kits and materials for the analysis of these loci. | 02-05-2015 |
Patent application number | Description | Published |
20140074641 | MECHANISM FOR FACILITATING AUTION-BASED RESOURCE SHARING FOR MESSAGE QUEUES IN AN ON-DEMAND SERVICES ENVIRONMENT - In accordance with embodiments, there are provided mechanisms and methods for facilitating an auction-based fair allocation and usage of thread resources for user messages according to one embodiment in an on-demand services environment. In one embodiment and by way of example, a method includes receiving job requests and bids from a plurality of organizations over a network, where each job request and the corresponding bid is placed by a user associated with an organization having a resource currency value within a multi-tenant database system via a user interface at a computing device over the network, determining resource currency values associated with pending jobs relating to the plurality of organizations, wherein the resource currency values corresponds to resources dedicated to the pending jobs, and performing an auction of the received bids for resources that are not dedicated and remains available for purchase, where a bid includes a purchase request to purchase the available resources. The method may further include prioritizing the job requests based on the dedicated resources and the auction of the available resources, and processing the job requests based on the prioritized job requests. | 03-13-2014 |
20140075017 | MECHANISM FOR FACILITATING A QUORUM-BASED COORDINATION OF BOOKER HEALTH FOR MANAGEMENT OF RESOURCES FOR APPLICATION SERVERS IN AN ON-DEMAND SERVICES ENVIROMENT - In accordance with embodiments, there are provided mechanisms and methods for facilitating a quorum-based coordination of broker health for management of resources for application servers in an on-demand services environment. In one embodiment and by way of example, a method includes monitoring, via health checkers, health of a cluster of brokers in a distributed environment having application servers in communication over a network, receiving an indication from at least one health checker that a broker is failing, wherein the broker is associated with a cluster of worker nodes, collecting health status reports relating to the broker from the health checkers, examining the health status reports based on a quorum-based voting policy, and classifying the broker as unhealthy if, based on the quorum-based voting policy, a percentage of the health status reports regards the broker as failed, wherein the percentage is greater than a first threshold percentage. | 03-13-2014 |
20140075030 | MANAGING ALLOCATION OF THREAD RESOURCES FOR MESSAGE QUEUES INAN ON-DEMAND SERVICES ENVIRONMENT - In accordance with embodiments, there are provided mechanisms and methods for facilitating a fair allocation and usage of thread resources for user messages according to one embodiment in an on-demand services environment. In one embodiment and by way of example, a method includes tracking resource usage associated with a plurality of messages performed and completed in response to requests placed by a user via a user interface at a computing device, where the tracking includes recording an amount of resources consumed by each completed message. The method may further include classifying the plurality of messages into job types based on the tracked resource usage associated with the plurality of messages, and enforcing, based on the classification of the messages, a message selection process to ensure equitable distribution of resources to subsequently received messages. | 03-13-2014 |
20140075445 | MECHANISM FOR PROVIDING A ROUTING FRAMEWORK FOR FACILITATING DYNAMIC WORKLOAD SCHEDULING AND ROUTING OF MESSAGE QUEUES FOR FAIR MANAGEMENT OF RESOURCES FOR APPLICATION SERCERS IN AN ON-DEMAND SERVICES ENVIRONMENT - In accordance with embodiments, there are provided mechanisms and methods for facilitating dynamic workload scheduling and routing of message queues for fair management of the resources for application servers in an on-demand services environment. In one embodiment and by way of example, a method includes detecting an organization of a plurality of organization that is starving for resources. The organization may be seeking performance of a job request at a computing system within a multi-tenant database system. The method may further include consulting, based on a routing policy, a routing table for a plurality of queues available for processing the job request, selecting a queue of the plurality of queues for the organization based on a fair usage analysis obtained from the routing policy, and routing the job request to the selected queue. | 03-13-2014 |
20140075446 | MECHANISM FOR FACILITATING SLIDING WINDOW RESOURCE TRACKING IN MESSAGE QUEUES FOR FAIR MANAGEMENT OF RESOURCES FOR APPLICATION SERVERS IN AN ON-DEMAND SERVICES ENVIRONMENT - In accordance with embodiments, there are provided mechanisms and methods for facilitating sliding window resource tracking in message queues for fair management of resources for application servers in an on-demand services environment. In one embodiment and by way of example, a method includes monitoring, in real-time, in-flight jobs in message queues for incoming jobs from organizations in a distributed environment having application servers in communication over a network, applying local sliding windows to the message queues to estimate wait time associated with each incoming job in a message queue. A local sliding window may include segment of time being monitored in each message queue for estimating the wait time. The method may further include allocating, in real-time, based on the estimated wait time, thread resources to one or more of the incoming jobs associated with the one or more of the organizations. | 03-13-2014 |
20150046279 | AUCTION-BASED RESOURCE SHARING FOR MESSAGE QUEUES IN AN ON-DEMAND SERVICES ENVIRONMENT - In accordance with embodiments, there are provided mechanisms and methods for facilitating an auction-based fair allocation and usage of thread resources for user messages according to one embodiment in an on-demand services environment. In one embodiment and by way of example, a method includes receiving, by and incorporating into the database system, a bid for allocation of resources to a tenant. The bid may be received from a computing device associated with the tenant and placed, via an auction interface, based on one or more factors including at least one of a budget, a reservation, and a price. The method may further include dynamically comparing the bid with one or more other bids associated with one or more other tenants seeking the resources, and allocating the resources to the tenant, if the bid is accepted over the one or more other bids. | 02-12-2015 |
20150178135 | FACILITATING TIERED SERVICE MODEL-BASED FAIR ALLOCATION OF RESOURCES FOR APPLICATION SERVERS IN MULTI-TENANT ENVIRONMENTS - In accordance with embodiments, there are provided mechanisms and methods for facilitating tiered service model-based fair allocation of resources for application servers in multi-tenant environments. In one embodiment and by way of example, a method includes collecting, by and incorporating into the database system, data relating to job types associated with one or more tenants of a plurality of tenants within a multi-tenant database system, computing, based on the data, an actual resource use and an expected resource allocation associated with each job type, and assigning classifications to the job types based on their corresponding actual resource use and the expected resource allocation. The method may further include routing the job types between tiers based on the assigned classifications, where the routing includes at least one of promoting, demoting, and maintaining one or more tiers for the job types. | 06-25-2015 |
20150237157 | TRANSPARENT SHARDING OF TRAFFIC ACROSS MESSAGING BROKERS - Embodiments regard transparent sharding of traffic across messaging brokers. An embodiment of a method of sharding message traffic across messaging brokers includes providing a message sharding service for message sharding among a plurality of registered message brokers, wherein providing the message sharding service includes applying a current message sharding strategy; and sharding messages among the registered message brokers according to the current message sharding strategy, including registering the message brokers and assigning message queues to registered message brokers according to the current message sharding strategy; wherein the current message sharding strategy is one of a plurality of message sharding strategies. | 08-20-2015 |