Abstract: The present invention provides a composition, comprising ferrous amino acid chelate particles sintered from ferrous amino acid chelate, wherein the average particle size of the ferrous amino acid chelate particles ranges from 500 nm to 2600 nm, and the average molecular weight of the particles ranges from 1,500 Dalton to 600,000 Dalton. Besides, the present invention can be used for manufacturing a medicament for treating or ameliorating a pancreas-related disease, wherein the medicament comprises an effective amount of the composition and a pharmaceutically acceptable carrier.

Abstract: A composition includes sintered nanoparticles prepared by sintering a chelate of ferrous ions with an amino acid. The sintered nanoparticles have an average particle diameter ranging from 10 to 400 nm as determined by Electron Probe X-ray Micro-Analyzer. Also disclosed herein are a method for inhibiting and/or killing a virus in a subject and applications of such method. The method includes administering to the subject the composition.

Abstract: A composition includes sintered ferrous amino acid particles prepared by sintering a ferrous amino acid chelate which includes ferrous ions and an amino acid. The sintered ferrous amino acid particles have an average particle size ranging from 500 to 2600 nm and a weight average molecular weight ranging from 1,500 Dalton to 600,000 Dalton. Also disclosed herein are a method for inhibiting and/or killing a virus in a subject and applications of such method. The method includes administering to the subject the composition.

Abstract: A composition includes sintered ferrous amino acid particles prepared by sintering a ferrous amino acid chelate which includes ferrous ions and an amino acid. The sintered ferrous amino acid particles have an average particle size ranging from 500 to 2600 nm and a weight average molecular weight ranging from 1,500 Dalton to 600,000 Dalton. Also disclosed herein are a method for inhibiting and/or killing a virus in a subject and applications of such method. The method includes administering to the subject the composition.

Abstract: Disclosed herein is a method for treating infection by an enteropathogen and/or enhancing growth performance, which includes administering to a subject in need thereof a composition containing a ferrous amino acid chelate. Also disclosed herein is an animal feed containing the ferrous amino acid chelate.

Abstract: A composition includes sintered nanoparticles prepared by sintering a chelate of ferrous ions with an amino acid. The sintered nanoparticles have an average particle diameter ranging from 10 to 400 nm as determined by Electron Probe X-ray Micro-Analyzer. Also disclosed herein are a method for inhibiting and/or killing a virus in a subject and applications of such method. The method includes administering to the subject the composition.

Abstract: The present invention provides use of a composition comprising ferrous amino acid chelate for the manufacture of a medicament for treatment of liver dysfunction, wherein the medicament comprises an effective amount of the ferrous amino acid chelate composition and a pharmaceutically acceptable carrier. The present invention proves that the serum biochemistry values related to the liver function can be reduced by administering the composition comprising ferrous amino acid chelate. For animals whose liver functions cannot be improved by long-term administration of S-adenosylmethionine, their liver functions can be effectively improved by administration of the composition comprising ferrous amino acid chelate of the present invention instead. Furthermore, the composition comprising ferrous amino acid chelate can improve the functions of an aged liver.

Abstract: A composition includes sintered ferrous amino acid particles prepared by sintering a ferrous amino acid chelate which includes ferrous ions and an amino acid. The sintered ferrous amino acid particles have an average particle size ranging from 500 to 2600 nm and a weight average molecular weight ranging from 1,500 Dalton to 600,000 Dalton. Also disclosed herein are a method for inhibiting and/or killing a virus in a subject and applications of such method. The method includes administering to the subject the composition.

Abstract: Disclosed herein is a method for treating infection by an enteropathogen and/or enhancing growth performance, which includes administering to a subject in need thereof a composition containing a ferrous amino acid chelate. Also disclosed herein is an animal feed containing the ferrous amino acid chelate.

Abstract: A composition includes sintered ferrous amino acid particles prepared by sintering a ferrous amino acid chelate which includes ferrous ions and an amino acid. The sintered ferrous amino acid particles have an average particle size ranging from 500 to 2600 nm and a weight average molecular weight ranging from 1,500 Dalton to 600,000 Dalton. Also disclosed herein are a method for inhibiting and/or killing a virus in a subject and applications of such method. The method includes administering to the subject the composition.

Abstract: A computing system includes at least one processor and at least one module operable by the at least one processor to calculate a tail of a first dataset by determining elements of the first dataset that fall outside of a specified percentile, and determine locations of the first dataset at which elements of the first dataset that fall outside of the specified percentile are located. The at least one module may be operable to calculate a tail of a second dataset by populating a data structure with elements of the second dataset that correspond to the locations of the first dataset, and determining, using the data structure, elements of the second dataset that fall outside of the specified percentile. The at least one module may be operable to output an indication of at least one of the tail of the first dataset or the tail of the second dataset.

Abstract: A computing system includes at least one processor and at least one module operable by the at least one processor to calculate a tail of a first dataset by determining elements of the first dataset that fall outside of a specified percentile, and determine locations of the first dataset at which elements of the first dataset that fall outside of the specified percentile are located. The at least one module may be operable to calculate a tail of a second dataset by populating a data structure with elements of the second dataset that correspond to the locations of the first dataset, and determining, using the data structure, elements of the second dataset that fall outside of the specified percentile. The at least one module may be operable to output an indication of at least one of the tail of the first dataset or the tail of the second dataset.

Abstract: A computing system includes at least one processor and at least one module operable by the at least one processor to calculate a tail of a first dataset by determining elements of the first dataset that fall outside of a specified percentile, and determine locations of the first dataset at which elements of the first dataset that fall outside of the specified percentile are located. The at least one module may be operable to calculate a tail of a second dataset by populating a data structure with elements of the second dataset that correspond to the locations of the first dataset, and determining, using the data structure, elements of the second dataset that fall outside of the specified percentile. The at least one module may be operable to output an indication of at least one of the tail of the first dataset or the tail of the second dataset.

Abstract: A computing system includes at least one processor and at least one module operable by the at least one processor to calculate a tail of a first dataset by determining elements of the first dataset that fall outside of a specified percentile, and determine locations of the first dataset at which elements of the first dataset that fall outside of the specified percentile are located. The at least one module may be operable to calculate a tail of a second dataset by populating a data structure with elements of the second dataset that correspond to the locations of the first dataset, and determining, using the data structure, elements of the second dataset that fall outside of the specified percentile. The at least one module may be operable to output an indication of at least one of the tail of the first dataset or the tail of the second dataset.

Abstract: As disclosed herein a method, executed by a computer, for conducting non-recursive cascading reduction includes receiving a collection of floating point values, using a binary representation of an index corresponding to a value being processed to determine a reduction depth for elements on a stack to be accumulated, and according to the reduction depth, iteratively conducting a reduction operation on the current value and one or more values on the stack. In addition to accumulation, the reduction operation may include transforming the value with a corresponding function. The method may also include using a SIMD processing environment to further increase the performance of the method. The method provides results with both high performance and accuracy. A computer system and computer program product corresponding to the method are also disclosed herein.

Abstract: As disclosed herein a method, executed by a computer, for conducting non-recursive cascading reduction includes receiving a collection of floating point values, using a binary representation of an index corresponding to a value being processed to determine a reduction depth for elements on a stack to be accumulated, and according to the reduction depth, iteratively conducting a reduction operation on the current value and one or more values on the stack. In addition to accumulation, the reduction operation may include transforming the value with a corresponding function. The method may also include using a SIMD processing environment to further increase the performance of the method. The method provides results with both high performance and accuracy. A computer system and computer program product corresponding to the method are also disclosed herein.

Abstract: Techniques are disclosed for computing a real-time credit risk score. In one example, the method comprises at least one processor generating a computation graph comprising static computation nodes, dynamic computation nodes, and computation edges. The computation graph is a tree. Before receiving the real-time trade, the processor determines a pipeline kernel in the computation graph and computes the respective static information in the pipeline kernel. After computing the static information, the processor receives the real-time trade. The real-time trade is associated with a current exchange of assets for which a real-time credit risk score may be determined and comprises real-time information for use in computing the real-time credit risk score. The processor computes, based on the real-time trade and the computed static information, the dynamic information in the pipeline kernel and computes, based on the computed dynamic information, the real-time credit risk score.

Abstract: Techniques are disclosed for computing a real-time credit risk score. In one example, the method comprises at least one processor generating a computation graph comprising static computation nodes, dynamic computation nodes, and computation edges. The computation graph is a tree. Before receiving the real-time trade, the processor determines a pipeline kernel in the computation graph and computes the respective static information in the pipeline kernel. After computing the static information, the processor receives the real-time trade. The real-time trade is associated with a current exchange of assets for which a real-time credit risk score may be determined and comprises real-time information for use in computing the real-time credit risk score. The processor computes, based on the real-time trade and the computed static information, the dynamic information in the pipeline kernel and computes, based on the computed dynamic information, the real-time credit risk score.

Abstract: A method for rolling back speculative threads in symmetric-multiprocessing (SMP) environments is disclosed. In one embodiment, such a method includes detecting an aborted thread at runtime and determining whether the aborted thread is an oldest aborted thread. In the event the aborted thread is the oldest aborted thread, the method sets a high-priority request for allocation to an absolute thread number associated with the oldest aborted thread. The method further detects that the high-priority request is set and, in response, clears the high-priority request and sets an allocation token to the absolute thread number associated with the oldest aborted thread, thereby allowing the oldest aborted thread to retry a work unit associated with the absolute thread number. A corresponding apparatus and computer program product are also disclosed.

Abstract: A method for rolling back speculative threads in symmetric-multiprocessing (SMP) environments is disclosed. In one embodiment, such a method includes detecting an aborted thread at runtime and determining whether the aborted thread is an oldest aborted thread. In the event the aborted thread is the oldest aborted thread, the method sets a high-priority request for allocation to an absolute thread number associated with the oldest aborted thread. The method further detects that the high-priority request is set and, in response, modifies a local allocation token of the oldest aborted thread. The modification prompts the oldest aborted thread to retry a work unit associated with its absolute thread number. The oldest aborted thread subsequently initiates the retry of a successor thread by updating the successor thread's local allocation token. A corresponding apparatus and computer program product are also disclosed.