Author: claimsbot

1. A method for determining nonuniformity correction parameters for a detector array, the method comprising the steps of:
for each element of the detector array, generating a plurality estimated and observed intensity pairs, wherein the estimated intensities for each element is calculated based upon corresponding observed intensities for that element;
generating a plurality of estimates of uncorrupted images, each of the estimates being generated by fitting a parametric patch model to the plurality estimated and observed intensity pairs for a neighborhood of noisy image samples, each uncorrupted image uniquely corresponding to one of a plurality of noisy images; and
determining at least one nonuniformity correction parameter by fitting a parametric curve to the plurality of estimates and the plurality of noisy images corresponding to each of the estimates;
identifying whether one or more elements of the detector array is faulty based upon the fitted parametric model and, if at least one detector is determined to be faulty, suppressing the output of the at least one faulty detector.
2. The method of claim 1, wherein the parametric patch model comprises a second-order model.
3. The method of claim 1, wherein fitting the parametric patch model comprises minimizing a predefined merit function using a least-squares procedure.
4. The method of claim 3, wherein the predefined merit function expresses a mathematical relationship between the plurality of noisy images and a plurality of parametric patch models, the mathematical relationship being defined by a coefficient matrix and an inverse covariance matrix.
5. The method of claim 1, wherein fitting the parametric curve comprises minimizing a predefined merit function using a least-squares procedure.
6. The method of claim 5, wherein the predefined merit function expresses a mathematical relationship between the plurality of estimates and the plurality of noisy images corresponding to each of the estimates, the mathematical relationship being defined by coefficient matrix and an inverse covariance matrix.
7. A method of updating nonuniformity correction parameters for a detector array, the method comprising the steps of:
(a) providing a plurality of noisy image samples;
(b) for each element of the detector array, generating a plurality estimated and observed intensity pairs, wherein the estimated intensities for each element is calculated based upon corresponding observed intensities for that element, and generating a plurality of estimates of uncorrupted images by fitting a curve to the plurality of estimated and observed intensity pairs for the plurality of noisy image samples and an initial set of correction parameters, each of the estimates of uncorrupted images corresponding to a unique one of the plurality of noisy images;
(c) generating a plurality of noise-reduced estimates of uncorrupted images using a set of spatial-neighborhood observations, each of the noise-reduced estimates of uncorrupted images corresponding to a unique one of the estimates of uncorrupted images; and
(d) determining an updated set of correction parameters based upon a predefined mathematical relation between each of the noise-reduced estimates of uncorrupted images and corresponding one of the estimates of uncorrupted images, identifying whether one or more elements of the detector array is faulty based upon the fitted curve, and, if at least one detector is determined to be faulty, suppressing the output of the at least one faulty detector.
8. The method of claim 7, further comprising the step of:
(e) setting the initial set of correction parameters equal to the updated set of correction parameters and repeating steps (a) through (d) to determine a different set of update correction parameters if the updated set of correction parameters and a previously determined updated set of correction parameters does not converge.
9. The method of claim 7, wherein the plurality of correction parameters comprises an offset parameter and a gain parameter.
10. The method of claim 7, wherein the step of generating a plurality of noise-reduced estimates of uncorrupted images comprises computing a weighted average of the set of spatial-neighborhood observations.
11. The method of claim 7, wherein the step of determining an updated set of correction parameters is based upon a linear relationship between each of the noise-reduced estimates of uncorrupted images and corresponding one of the estimates of uncorrupted images.
12. The method of claim 11, wherein the linear relationship is determined using a robust least-squares procedure.
13. The method of claim 7, wherein the step of determining the updated set of correction parameters further comprises determining the updated set of correction parameters based upon a predetermined set of damping coefficients.
14. The method of claim 13, wherein the damping coefficients define a recursive relation between a currently determined set of updated correction parameters and a previously determined set of updated correction parameters.
15. The method of claim 7, further comprising the step of:
(f) determining when the element of the array fails to function accurately.
16. The method of claim 15, further comprising the step of:
(g) suppressing a contribution of the element of the array to the determination of correction parameters if the element of the array is determined to be functioning inaccurately.
17. An imaging system for imaging a scene with a detector array having an array of imaging elements, the system comprising:
an image estimation module for generating a plurality estimates of uncorrupted images based upon a plurality of noisy images generated by the detector array, wherein the image estimation module is configured to generate a plurality estimated and observed intensity pairs for each element of the detector array, the estimated intensities for each element being calculated based upon a corresponding observed intensities for that element, and to generate the estimates of the uncorrupted images by fitting a curve to the plurality of estimated and observed intensity pairs; and
a parameter determination module for determining at least one nonuniformity correction parameter based upon the estimates of uncorrupted images.
18. The imaging system of claim 17, wherein the image estimation module generates the plurality of estimates of uncorrupted images by fitting a parametric patch model into a neighborhood of noisy image samples such that each estimate and uniquely corresponds to one of a plurality of noisy images; and wherein the parameter determination module determines at least one nonuniformity correction parameter by fitting a parametric curve to the plurality of estimates and the plurality of noisy images corresponding to each of the estimates.
19. The imaging system of claim 17, wherein the image estimation module generates a plurality of estimates of uncorrupted images based upon a plurality of noisy image samples and an initial set of correction parameters, each of the estimates of uncorrupted images corresponding to a unique one of the plurality of noisy images; and wherein the image estimation module further generates a plurality of noise-reduced estimates of uncorrupted images using a set of spatial-neighborhood observations, each of the noise-reduced estimates of uncorrupted images corresponding to a unique one of the estimates of uncorrupted images.
20. The imaging system of claim 19, wherein the parameter determination module determines an updated set of correction parameters based upon a predefined mathematical relation between each of the noise-reduced estimates of uncorrupted images and corresponding ones of the estimates of uncorrupted images.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. An anticorrosion ferrite-based pigment for use in a paint to coat a substrate, the pigment being derived from a hydrometallurgical purification process of EAF dust, said EAF dust being generated:
in an electric arc furnace or the like for producing carbon steel by processing source materials chosen from the group comprising scrap metals, direct reduced iron and pre-reduced hematite, and using a CaO-rich slag; and
from a condensation reaction of metal vapors of Fe, of Zn and of metals chosen from the group consisting of Mn, Mg, Si and Al, and suspended CaO-based particles and oxygen;

the pigment comprising:
condensed metal oxides, comprising a plurality of different ferrites of the general formula MOFe2O3, wherein M comprises Zn, Fe, Mn, Mg and complexes thereof for the different ferrites, and having ferrite or ferrite-like structures substantially preserved from the EAF dust, and forming aggregates of said ferrite or ferrite-like structures;
CaO entrapped by the ferrite or ferrite-like structures and being at least partially available to react with humid air andor water to protect the substrate against corrosion; and
from about 0.5% to about 20% by weight calcium.
2. The pigment of claim 1, wherein the source materials comprise scrap metals.
3. The pigment of claim 1, wherein the amount of Zn present in the ferrites is in greater amount than Mn or Mg and the ferrites are franklinite-based.
4. The pigment of claim 1, wherein the pigment has from about 20% to about 60% by weight Fe.
5. The pigment of claim 1, wherein the substrate is made of metal susceptible to corrosion.
6. An additive for use in paint, primer or coating formulations to produce an anticorrosive formulation, comprising the pigment defined in claim 1.
7. The pigment of claim 1, wherein the pigment has from about 4% to about 12% by weight calcium.
8. The pigment of claim 1, wherein the pigment has from about 5% to 40% by weight Zn.
9. The pigment of claim 8, wherein the pigment has from about 30% to about 35% by weight Zn.
10. The pigment of claim 1, having a granulometry presenting a bell curve like distribution with a median between 0.2 pm and 1.2 pm.
11. The pigment of claim 10, having a granulometry presenting a bell curve like distribution with a median between 0.3 pm and 0.8 pm.
12. The pigment of claim 1, wherein the pigment has undergone leaching with a solvent during the hydrometallurgical purification process.
13. The pigment of claim 12, wherein the solvent is water and the pigment produced is a ferrite pigment of a first grade.
14. The pigment of claim 12, wherein the solvent is sulfuric acid, the leaching is performed at a pH of 0.5 to 3 and the pigment produced is a ferrite pigment of a second grade.
15. The pigment of claim 12, wherein the solvent is nitric acid, the leaching is performed at a pH of 0 to 3, and the pigment produced is a ferrite pigment of a third grade.
16. The pigment of claim 1, wherein said pigment has a thermal color resistivity at about 250\xb0 C.
17. The pigment of claim 16, wherein said pigment has a thermal color resistivity 10 at about 300\xb0 C.
18. An antifouling formulation comprising the pigment defined in claim 1.
19. The antifouling formulation of claim 18, wherein the antifouling formulation is applied to a partially or fully submerged structure, for antifouling against selected organisms.
20. The pigment of claim 1, wherein a first portion of the CaO is physically entrapped within the aggregates.
21. The pigment of claim 20, wherein a second portion of the CaO is physically entrapped within the ferrite or ferrite-like structure.
22. The pigment of claim 21, wherein the first portion of CaO is available as a source of sacrificial calcium to react with humid air andor water to produce Ca(OH)2 and locally increase the pH.
23. The pigment of claim 22, wherein the second portion of CaO becomes increasingly available once the first portion of CaO is depleted, as a source of the sacrificial calcium.
24. The pigment of claim 22, wherein the Ca(OH)2 locally maintains the pH at or above 12.
25. The pigment of claim 22, wherein the sacrificial calcium further triggers the formation of at least one protective hydroxide phase.
26. The pigment of claim 25, wherein the at least one protective hydroxide phase are selected from amorphous calcium hydroxide phases and crystalline portlandite.
27. The pigment of claim 25, wherein the at least one protective hydroxide phase comprises Zn(OH)2.
28. The pigment of claim 25, wherein the at least one protective hydroxide phase presents a DTA fingerprint as shown in the graph of FIG. 21.
29. The pigment of claim 25, wherein the at least one protective hydroxide phase presents a TGA fingerprint as shown in the graph or FIG. 21.
30. The pigment of claim 25, wherein the at least one protective hydroxide phase comprises a calcium-zinc hydroxide.
31. The pigment of claim 30, wherein the calcium-zinc hydroxide is a crystallographic phase of CaZn2(OH)6 hydrate.
32. The pigment of claim 25, wherein the at least one protective hydroxide phase forms a physical protective layer on the metal substrate.
33. The pigment of claim 32, wherein the protective layer comprises from 25% to 70% by weight Zn from Zn(OH)2.
34. The pigment of claim 32, wherein the protective layer comprises from 35% to 55% by weight Zn from Zn(OH)2.
35. An anticorrosion ferrite-based pigment for use in a paint to coat a substrate, the pigment being derived from a hydrometallurgical purification process of EAF dust, said EAF dust being generated:
in an electric arc furnace or the like for producing carbon steel by processing source materials chosen from the group comprising scrap metals, direct reduced iron and pre-reduced hematite, and using a CaO-rich slag; and
from a condensation reaction of metal vapors of Fe, of Zn and of metals chosen from the group consisting of Mn, Mg, Si and Al, and suspended CaO-based particles and oxygen;

the pigment comprising:
condensed metal oxides, comprising a plurality of different ferrites of the general formula MOFe2O3, wherein M comprises Zn, Fe, Mn, Mg and complexes thereof for the different ferrites, and having ferrite or ferrite-like structures substantially preserved from the EAF dust, and forming aggregates of said ferrite or ferrite-like structures, wherein said aggregates form a coating, said coating being calcium- andor zinc-based and deposited on the pigment; and
CaO entrapped by the ferrite or ferrite-like structures and being at least partially available to react with humid air andor water to protect the substrate against corrosion.
36. The pigment of claim 35, wherein the coating is precipitated as a calcium-zinc-hydroxide phase.
37. The pigment of claim 35, wherein the pigment has from about 0.5% to about 20% by weight calcium.
38. The pigment of claim 37, wherein the pigment has from about 4% to about 12% by weight calcium.
39. An additive for use in paint, primer or coating formulations to produce an anticorrosive formulation, comprising the pigment defined in claim 35.
40. An antifouling formulation comprising the pigment defined in claim 35.
41. The antifouling formulation of claim 40, wherein the antifouling formulation is applied to a partially or fully submerged structure, for antifouling against selected organisms.

What is claimed is:

1. A method for generating a replacement value associated with a data cell of a multidimensional cube representing multidimensional data stored in relational tables, the method comprising the steps of:
generating a tile position that represents a position of a tile in which the cell resides relative to other tiles within the multidimensional cube;
generating a local position that represents a position of the cell relative to other cells within the tile in which the cell resides; and
generating a replacement value based on the tile position value and the local position value.
2. The method of claim 1, wherein the step of generating a replacement value comprises:
generating a single tile number based on the tile position; and
generating a single offset number based on the local position.
3. The method of claim 2, further comprising the step of:
storing within a single row of an index-only table, at least the particular cell value, and
the tile number associated with the particular cell value.
4. The method of claim 1, further comprising the step of:
representing the tile and zero or more other tiles that are associated with a particular range of dimension key values as a key-range partition of a fact table associated with the multidimensional data.
5. The method of claim 1, wherein the step of generating a tile position comprises the step of:
generating a tile position that includes a tile coordinate value for each dimension associated with the two or more dimension key values, wherein each tile coordinate value qj is equal to
xj DIV Tj;
wherein xj represents a respective global coordinate position of the cell within a respective dimension j; and
wherein Tj represents a number of dimension key values spanned by the tile along the respective dimension j.
6. The method of claim 5, wherein the step of generating a replacement value includes the step of generating a single tile number based on the tile position, and wherein the step of generating a single tile number includes the step of:
generating a tile number equal to
sum(N-1, 1, p1* . . . *pj*q(j1))qj1;
wherein qj represents a tile coordinate value associated with a respective dimension j; and
wherein pj represents a number of pages along dimension j.
7. The method of claim 1, wherein the step of generating a local position includes the step of:
generating a local position that includes a local coordinate value for each dimension associated with the two or more dimension key values, wherein each local coordinate value rj is equal to
xj MOD Tj;
wherein xj represents a respective global coordinate position of the cell within a respective dimension j; and
wherein Tj represents a number of dimension key values spanned by the tile along the respective dimension j.
8. The method of claim 7, wherein the step of generating a replacement value includes the step of generating a single offset based on the local position, and wherein the step of generating a single offset includes the step of:
generating an offset equal to
sum(N-1, 1, T1* . . . Tj*r(j1))rj1;
wherein rj represents a local coordinate value associated with a respective dimension j.
9. A method for manipulating multidimensional data in relational tables, the method comprising the steps of:
maintaining a fact table for storing cell values that are associated with a plurality of dimensions;
receiving a request to store a particular cell value that is associated with a particular set of dimension key values, the particular set of dimension key values including one dimension key value for each of the plurality of dimensions;
generating a tile position that represents a position of a tile in which the particular cell value resides relative to other tiles within a multidimensional cube representing the multidimensional data;
generating a local position that represents a position of the particular cell value relative to other cells within the tile in which the cell resides;
generating a replacement value based on the tile position value and the local position value; and
storing within the fact table
the particular cell value, and
the replacement value in association with the particular cell value.
10. The method of claim 9, further comprising the step of:
maintaining metadata in a dictionary indicating that a mapping exists between the particular cell that contains the particular cell value and the replacement value.
11. The method of claim 9, wherein a plurality of cell values and associated replacement values are stored within the fact table, the method further comprising the steps of:
receiving a query that includes a join predicate on the fact table;
extracting cell values contained in the fact table;
mapping replacement values associated with respective cell values to respective associated sets of dimension key values;
expressing the predicate in terms of one or more associated sets of dimension key values; and
applying the predicate to the multidimensional data according to the query.
12. The method of claim 9, wherein the step of generating a replacement value includes:
generating a single tile number based on the tile position; and
generating a single offset number based on the local position.
13. The method of claim 12, wherein a plurality of cell values and associated replacement values are stored with the fact table, the method comprising the steps of:
receiving a query that includes a join predicate on the fact table;
extracting cell values contained in the fact table;
mapping replacement values associated with respective cell values to respective associated sets of dimension key values; and
expressing the predicate in terms of one or more associated sets of dimension key values; and
applying the predicate to the multidimensional data according to the query.
14. A computer-readable medium storing an index that is built on a table that has a plurality of rows, the index comprising:
an index entry that contains a key value for a sub-part of a row of the plurality of rows, the index entry including
first data for locating the row; and
second data for locating, within the row, a value associated with the sub-part of the row.
15. The computer-readable medium of claim 14, wherein the sub-part of the row is part of an array, and wherein each member of the array is represented in the row.
16. The computer-readable medium of claim 14, wherein the index has a different index entry for each sub-part of the row.
17. A method for locating data within a relational table wherein the data is associated with a key value, the method comprising the steps of:
traversing an index that is built on the relational table to locate a first entry for the key value;
reading first data from the first entry to identify which row of a plurality of rows of the relational table contains data associated with the key value; and
reading second data from the first entry to locate a first sub-part, within the row that is associated with the key value.
18. The method of claim 17, wherein the index has a second entry for a key value for a second sub-part of the row, the method further comprising the steps of:
traversing the index based on the key value associated with the second sub-part;
reading first data from the second entry to identify the row; and
reading second data from the second entry to locate the second sub-part within the row.
19. A computer-readable medium carrying one or more sequences of instructions for generating a replacement value associated with a data cell of a multidimensional cube representing multidimensional data stored in relational tables, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the steps of:
generating a tile position that represents a position of a tile in which the cell resides relative to other tiles within the multidimensional cube;
generating a local position that represents a position of the cell relative to other cells within the tile in which the cell resides; and
generating a replacement value based on the tile position value and the local position value.
20. The computer-readable medium of claim 19, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the step of generating a replacement value by performing the step of:
generating a single tile number based on the tile position; and
generating a single offset number based on the local position.
21. The computer-readable medium of claim 20, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the step of:
storing within a single row of an index-only table, at least
the particular cell value, and
the tile number associated with the particular cell value.
22. The computer-readable medium of claim 19, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the step of:
representing the tile and zero or more other tiles that are associated with a particular range of dimension key values as a key-range partition of a fact table associated with the multidimensional data.
23. The computer-readable medium of claim 19, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the step of generating a tile position by performing the step of:
generating a tile position that includes a tile coordinate value for each dimension associated with the two or more dimension key values, wherein each tile coordinate value qj is equal to
xj DIV Tj;
wherein xj represents a respective global coordinate position of the cell within a respective dimension j; and
wherein Tj represents a number of dimension key values spanned by the tile along the respective dimension j.
24. The computer-readable medium of claim 23, wherein the step of generating a replacement value includes the step of generating a single tile number based on the tile position, and wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the step of generating a single tile number by performing the step of:
generating a tile number equal to
sum(N-1, 1, p1* . . . *pj*q(j1))qj1;
wherein qj represents a tile coordinate value associated with a respective dimension j; and
wherein pj represents a number of pages along dimension j.
25. The computer-readable medium of claim 19, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the step of generating a local position by performing the step of:
generating a local position that includes a local coordinate value for each dimension associated with the two or more dimension key values, wherein each local coordinate value rj is equal to
xj MOD Tj;
wherein xj represents a respective global coordinate position of the cell within a respective dimension j; and
wherein Tj represents a number of dimension key values spanned by the tile along the respective dimension j.
26. The computer-readable medium of claim 25, wherein the step of generating a replacement value includes the step of generating a single offset based on the local position, and wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the step of generating a single offset by performing the step of:
generating an offset equal to
sum(N-1, 1, T1* . . . Tj*r(j1))rj1;
wherein rj represents a local coordinate value associated with a respective dimension j.
27. A computer-readable medium carrying one or more sequences of instructions for manipulating multidimensional data in relational tables, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the steps of:
maintaining a fact table for storing cell values that are associated with a plurality of dimensions;
receiving a request to store a particular cell value that is associated with a particular set of dimension key values, the particular set of dimension key values including one dimension key value for each of the plurality of dimensions;
generating a tile position that represents a position of a tile in which the particular cell value resides relative to other tiles within a multidimensional cube representing the multidimensional data;
generating a local position that represents a position of the particular cell value relative to other cells within the tile in which the cell resides;
generating a replacement value based on the tile position value and the local position value; and
storing within the fact table
the particular cell value, and
the replacement value in association with the particular cell value.
28. The computer-readable medium of claim 27, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the step of:
maintaining metadata in a dictionary indicating that a mapping exists between the particular cell that contains the particular cell value and the replacement value.
29. The computer-readable medium of claim 27, wherein a plurality of cell values and associated replacement values are stored within the fact table, and wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the steps of:
receiving a query that includes a join predicate on the fact table;
extracting cell values contained in the fact table;
mapping replacement values associated with respective cell values to respective associated sets of dimension key values;
expressing the predicate in terms of one or more associated sets of dimension key values; and
applying the predicate to the multidimensional data according to the query.
30. The computer-readable medium of claim 27, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the step of generating a replacement value by performing the steps of:
generating a single tile number based on the tile position; and
generating a single offset number based on the local position.
31. The computer-readable medium of claim 30, wherein a plurality of cell values and associated replacement values are stored with the fact table, and wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the steps of:
receiving a query that includes a join predicate on the fact table;
extracting cell values contained in the fact table;
mapping replacement values associated with respective cell values to respective associated sets of dimension key values; and
expressing the predicate in terms of one or more associated sets of dimension key values; and
applying the predicate to the multidimensional data according to the query.
32. A computer-readable medium for locating data within a relational table wherein the data is associated with a key value, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the steps of:
traversing an index that is built on the relational table to locate a first entry for the key value;
reading first data from the first entry to identify which row of a plurality of rows of the relational table contains data associated with the key value; and
reading second data from the first entry to locate a first sub-part, within the row that is associated with the key value.
33. The computer-readable medium of claim 32, wherein the index has a second entry for a key value for a second sub-part of the row, and wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform the steps of:
traversing the index based on the key value associated with the second sub-part;
reading first data from the second entry to identify the row; and
reading second data from the second entry to locate the second sub-part within the row.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A computer implemented method to automatically deploy a next version of a software component from a plurality of software components in a cloud environment, the method comprising:
receiving, at a computer, a request to deploy the next version of the software component in the cloud environment;
receiving, at the computer, a dependency analysis of a plurality of dependencies among the plurality of software components of the cloud environment, wherein receiving the dependency analysis further comprises:
receiving data related to the requests for communication among the plurality of software components;
based on the received data, categorizing the requests into a plurality of request categories based on types of resources requested by the corresponding requests; and
determining frequency of requests by the request categories among the plurality of software components;

the computer, postponing a deployment of the next version of the software component based on the dependency analysis until a currently processed deployment of another software component is processed when a first set of affected software components affected by deployment of the next version of the software component overlaps with a second set of affected software components affected by the currently processed deployment of the another software component;
deploying, from the computer, the next version of the software component in the cloud environment in accordance with the scheduled deployment;
the computer, quarantining the next version of the software component until a predefined criteria is satisfied;
comparing an error rate of responses generated by a current version of the software component with the error rate of responses generated by the next version of the software component; and
releasing the next version of the software component from the quarantine upon determining that a difference between the error rate of the next version of the software component and the error rate of the current version software component is below a predefined threshold.
2. The method of claim 1, wherein quarantining the next version of the software component further comprises:
running a current version of the software component and the next version of the software component concurrently until the next version is released from the quarantine, and
processing a portion of a plurality of requests to the software component by the next version of the software component.
3. The method of claim 1 further comprising:
upon satisfying the predefined criteria, releasing the version of the software component from the quarantine.
4. The method of claim 1 further comprising:
upon successfully processing requests from the plurality of request categories by the next version of the software component, releasing the next version of the software component from the quarantine.
5. A computer system to automatically deploy in a cloud infrastructure a next version of a software component from a plurality of software components of the cloud infrastructure, the system including:
at least one processor and memory to execute program code, which when executed cause the computer to perform operations comprising:
receiving a plurality of requests between the plurality of software components, wherein based on the received plurality of requests an analysis of a plurality of dependencies among the plurality of software components of the cloud infrastructure is generated, wherein the analysis of the plurality of dependencies further comprises:
receiving data related to the requests for communication among the plurality of software components;
based on the received data, categorizing the requests into a plurality of request categories based on types of resources requested by the corresponding requests; and
determining frequency of requests by the request categories among the plurality of software components;

postponing deployment of the next version of the software component based on the received analysis until a currently processed deployment of another software component is processed when a first set of affected software components affected by deployment of the next version of the software component overlaps with a second set of affected software components affected by the currently processed deployment of the another software component;
deploying the next version of the software component onto the cloud infrastructure in accordance with the scheduled deployment;
quarantining the next version of the software component until a predefined criteria is satisfied;
comparing an error rate of responses generated by a current version of the software component with the error rate of responses generated by the next version of the software component; and
releasing the next version of the software component from the quarantine upon determining that a difference between the error rate of the next version of the software component and the error rate of the current version software component is below a predefined threshold.
6. The system of claim 5, wherein the operations further comprising:
dispatching a portion of a plurality of requests to the software component to the next version of the software component.
7. The system of claim 5, wherein the operations further comprising:
upon satisfying a predefined criteria, releasing the next version of the software component from the quarantine, and
dispatching incoming requests to the software component to the next version of the software component.
8. The system of claim 5, wherein the operations comprising:
upon successfully processing requests from the plurality of request categories by the next version of the software component, releasing the next version of the software component from the quarantine.
9. A non-transitory computer readable medium storing instructions thereon, which when executed by a processor cause a computer system to:
receive a request to deploy a next version of the software component from a plurality of software components in a cloud environment;
receive a dependency analysis of a plurality of dependencies among the plurality of software components of the cloud environment, wherein the dependency analysis is generated by:
receiving data related to a plurality of requests between the software components;
based on the received data, categorizing the plurality of requests into a plurality of request categories based on types of resources requested by the corresponding plurality of requests; and
determining frequency of requests by the request categories among the plurality of software components;

postpone deployment of the next version of the software component based on the dependency analysis until a currently processed deployment of another software component is processed when a first set of affected software components affected by deployment of the next version of the software component overlaps with a second set of affected software components affected by the currently processed deployment of the another software component;
deploy the next version of the software component in the cloud environment in accordance with the scheduled deployment;
quarantine the next version of the software component until a predefined criteria is satisfied;
comparing an error rate of responses generated by a current version of the software component with the error rate of responses generated by the next version of the software component; and
releasing the next version of the software component from the quarantine upon determining that a difference between the error rate of the next version of the software component and the error rate of the current version software component is below a predefined threshold.
10. The computer readable medium of claim 9, wherein quarantining the next version of the software component further comprises:
running a current version of the software component and the next version of the software component concurrently until the next version is released from the quarantine, and
processing a portion of a plurality of requests to the software component by the next version of the software component.
11. The computer readable medium of claim 9 further comprising:
upon satisfying the predefined criteria, releasing the version of the software component from the quarantine.