Abstract: Examples are disclosed for upgrading services of a software-based service according to a predefined sequence to account for dependencies between services. An upgrade package that includes a manifest defining an order for upgrading services of the software-based system is retrieved. Each service is upgraded according to the sequence and a status log is modified following each upgrade to include a unified status summary associated with all services being upgraded.

Abstract: Solid state forms of Ivosidenib, processes for preparation thereof, pharmaceutical compositions thereof, and uses thereof are disclosed.

Abstract: Examples are disclosed for upgrading services of a software-based service according to a predefined sequence to account for dependencies between services. An upgrade package that includes a manifest defining an order for upgrading services of the software-based system is retrieved. Each service is upgraded according to the sequence and a status log is modified following each upgrade to include a unified status summary associated with all services being upgraded.

Abstract: Examples for upgrading third-party services for a virtualized computing environment are discussed. A request is obtained to upgrade services associated with the virtualized computing environment. An upgrade bundle is obtained that includes a manifest defining an order for upgrading the third-party services. In the order defined in the manifest, each third-party upgrade is executed and a status log is modified to indicate the completion of the upgrade.

Abstract: Solid state forms of Ivosidenib, processes for preparation thereof, pharmaceutical compositions thereof, and uses thereof are disclosed.

Abstract: Solid state forms of Ivosidenib, processes for preparation thereof, pharmaceutical compositions thereof, and uses thereof are disclosed.

Abstract: In a computer-implemented method for updating schema of a database, execution of an application in a computing environment is initiated, where the application persists data in a database, and where the schema of the database is updatable responsive to an update of the application. Responsive to determining that the schema is updated, a first instance of the schema executing in the database is received, a second instance of the schema maintained in the application is received, the first instance of the schema is compared to the second instance of the schema, a difference between the first instance of the schema and the second instance of the schema is determined, and the first instance of the schema is updated to incorporate the difference between the first instance of the schema and the second instance of the schema.

Abstract: Examples for upgrading third-party services for a virtualized computing environment are discussed. A request is obtained to upgrade services associated with the virtualized computing environment. An upgrade bundle is obtained that includes a manifest defining an order for upgrading the third-party services. In the order defined in the manifest, each third-party upgrade is executed and a status log is modified to indicate the completion of the upgrade.

Abstract: Solid state forms of Ivosidenib, processes for preparation thereof, pharmaceutical compositions thereof, and uses thereof are disclosed.

Abstract: In a computer-implemented method for updating schema of a database, execution of an application in a computing environment is initiated, where the application persists data in a database, and where the schema of the database is updatable responsive to an update of the application. Responsive to determining that the schema is updated, a first instance of the schema executing in the database is received, a second instance of the schema maintained in the application is received, the first instance of the schema is compared to the second instance of the schema, a difference between the first instance of the schema and the second instance of the schema is determined, and the first instance of the schema is updated to incorporate the difference between the first instance of the schema and the second instance of the schema.

Abstract: Systems, apparatuses, and methods for reducing the load on the bitlines of a ROM bitcell array are described. The connections between nets of a ROM bitcell array may be assigned based on their programmed values using a traditional approach. Then, a plurality of optimizations may be performed on the assignment of nets to reduce the load on the bitlines of the array. A first optimization may swap the connections between ground and bitline for the nets of a given column responsive to detecting that the number of connections to the corresponding bitline is greater than the number of connections to ground for the given column. A second optimization may remove the connection of a net to a bitline if three consecutive nets of a given column are connected to the bitline.

Abstract: Systems, apparatuses, and methods for reducing the area of a semiconductor structure. A spacing violation may be detected for a gap width used to separate first and second regions of a layer of semiconductor material. In response to detecting the violation, the first and second regions are merged into a combined region, and then a cut mask layer is formed above the combined region. Next, an etch process is performed through the cut mask layer to remove an exposed third region within the combined region, wherein the exposed third region is interposed between first and second region portions of the combined region.

Abstract: Systems, apparatuses, and methods for reducing the area of a semiconductor structure. A spacing violation may be detected for a gap width used to separate first and second regions of a layer of semiconductor material. In response to detecting the violation, the first and second regions are merged into a combined region, and then a cut mask layer is formed above the combined region. Next, an etch process is performed through the cut mask layer to remove an exposed third region within the combined region, wherein the exposed third region is interposed between first and second region portions of the combined region.

Abstract: Systems, apparatuses, and methods for reducing the load on the bitlines of a ROM bitcell array are described. The connections between nets of a ROM bitcell array may be assigned based on their programmed values using a traditional approach. Then, a plurality of optimizations may be performed on the assignment of nets to reduce the load on the bitlines of the array. A first optimization may swap the connections between ground and bitline for the nets of a given column responsive to detecting that the number of connections to the corresponding bitline is greater than the number of connections to ground for the given column. A second optimization may remove the connection of a net to a bitline if three consecutive nets of a given column are connected to the bitline.

Abstract: A CT system includes a gantry, an x-ray source, a detector, and a grating collimator that includes alternating first and second materials. The system includes a controller configured to emit a first beam of x-rays from a first focal spot and to a first detector pixel, wherein the first beam of x-rays passes along a ray and through one of the first materials of the grating collimator, and subsequently emit a second beam of x-rays from a second focal spot and to the first detector pixel, wherein the second beam of x-rays passes substantially along the ray and through one of the second materials of the grating collimator. The system includes a computer programmed to generate first and second kVp image datasets using data acquired from the first beam and second beams of x-rays, and reconstruct a basis material image of the object.

Abstract: A system and computer-implemented method for generating an optimized allocation of a plurality of tasks across a plurality of processors or slots for processing or execution in a distributed computing environment. In a cloud computing environment implementing a MapReduce framework, the system and computer-implemented method may be used to schedule map or reduce tasks to processors or slots on the network such that the tasks are matched to processors or slots in a data locality aware fashion wherein the suitability of node and the characteristics of the task are accounted for using a minimum cost flow function.

Abstract: The present invention provides a method and system for distributed probabilistic matrix factorization. In accordance with a disclosed embodiment, the method may include partitioning a sparse matrix into a first set of blocks on a distributed computer cluster, whereby a dimension of each block is MB rows and NB columns. Further, the method shall include initializing a plurality of matrices including first mean matrix ?, a first variance matrix ?, a first prior variance matrix ?P, a second mean matrix V, a second variance matrix {tilde over (V)}, and a second prior variance matrix {tilde over (V)}P, by a set of values from a probability distribution function. The plurality of matrices can be partitioned into a set of blocks on the distributed computer cluster, whereby each block can be of a shorter dimension K, and the plurality of matrices can be updated iteratively until a cost function of the sparse matrix converges.

Abstract: An imaging system includes an x-ray source, a detector, a data acquisition system (DAS) operably connected to the detector, and a computer operably connected to the DAS. The computer is programmed to obtain CT scan data with two or more incident energy spectra, decompose the obtained CT scan data into projection CT data of a first basis material and a second basis material, generate a first basis material image and a second basis material image using the decomposed projection CT data, generate a first monochromatic image from the first basis material image and the second basis material image at a first energy that is selected based on an amount of correlated noise at the first energy, noise-reduce the first monochromatic image to generate a noise-reduced first monochromatic image, and generate a final monochromatic image based at least on the noise-reduced first monochromatic image.

Abstract: A system and method for material decomposition optimization in the image domain include a non-transitory computer readable medium has stored thereon a sequence of instructions which, when executed by a computer, causes the computer to access a reconstructed basis material image. For a first voxel of the reconstructed basis material image, the instructions also cause the computer to optimize a concentration of a pair of materials (a,b) in the first voxel exclusively in the image domain and based on a first probability based on random perturbations and a second probability based on random perturbations. The optimization is further based on a third probability based on known materials and a fourth probability based on concentrations of the pair of materials in a pair of voxels neighboring the first voxel.

Abstract: A CT system includes a gantry, an x-ray source, a detector, and a grating collimator that includes alternating first and second materials. The system includes a controller configured to emit a first beam of x-rays from a first focal spot and to a first detector pixel, wherein the first beam of x-rays passes along a ray and through one of the first materials of the grating collimator, and subsequently emit a second beam of x-rays from a second focal spot and to the first detector pixel, wherein the second beam of x-rays passes substantially along the ray and through one of the second materials of the grating collimator. The system includes a computer programmed to generate first and second kVp image datasets using data acquired from the first beam and second beams of x-rays, and reconstruct a basis material image of the object.