Abstract: The invention provides a novel class of therapeutic agents that are safe and effective TYK2 inhibitors and pharmaceutical compositions of these compounds and methods of preparation and use thereof against various TYK2-mediated diseases and disorders.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating a data entity that causes a processing unit to process a computational graph. In one aspect, a method includes the actions of receiving data identifying a computational graph, the computational graph including a plurality of nodes representing operations; obtaining compilation artifacts for processing the computational graph on a processing unit; and generating a data entity from the compilation artifacts, wherein the data entity, when invoked, causes the processing unit to process the computational graph by executing the operations represented by the plurality of nodes.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating a data entity that causes a processing unit to process a computational graph. In one aspect, a method includes the actions of receiving data identifying a computational graph, the computational graph including a plurality of nodes representing operations; obtaining compilation artifacts for processing the computational graph on a processing unit; and generating a data entity from the compilation artifacts, wherein the data entity, when invoked, causes the processing unit to process the computational graph by executing the operations represented by the plurality of nodes.

Abstract: The invention provides a novel class of therapeutic agents that are safe and effective TYK2 inhibitors and pharmaceutical compositions of these compounds and methods of preparation and use thereof against various TYK2-mediated diseases and disorders.

Abstract: Hydrogel particles (microgels) generated using microfluidic methods have superb properties such as high size uniformity and precise control over degradation and release profiles, making them useful for applications in wound healing and injectable drug delivery. However, the throughput of microfluidics is constrained by the physics governing the flow of immiscible fluids confined within microchannels. This throughput tends to be several orders of magnitude lower than what would be necessary for commercial and clinical applications. Here, we demonstrate the scaling up of on-chip synthesis of microgels by parallelizing the microfluidic channels. Taking advantage of the established fabrication technologies developed by the semiconductor industry and a high flow control system, a 4-inch silicon microfluidic chip integrating more than 4,000 microfluidic devices is developed.

Abstract: The invention provides a novel class of therapeutic agents that are safe and effective TYK2 inhibitors and pharmaceutical compositions of these compounds and methods of preparation and use thereof against various TYK2-mediated diseases and disorders.

Abstract: Embodiments of the current disclosure include small diameter single-mode optical fibers having gratings and methods of forming thereof. In some embodiments, methods of forming a small diameter single-mode optical fibers having gratings include providing an optical fiber having a core and cladding with a combined outer diameter of 100 ?m to 125 ?m and a coating having a thickness of less than or equal to 20 ?m, wherein the coating comprises one of: (i) a high-modulus coating layer surrounding the cladding region; or (ii) a low-modulus coating layer surrounding the cladding region and a high-modulus coating layer surrounding the low-modulus coating layer; and exposing the core, through the coating, to a pattern of ultraviolet radiation to form an optical grating within the core.

Abstract: Embodiments of the current disclosure include small diameter single-mode optical fibers having gratings and methods of forming thereof. In some embodiments, methods of forming a small diameter single-mode optical fibers having gratings include providing an optical fiber having a core and cladding with a combined outer diameter of 100 ?m to 125 ?m and a coating having a thickness of less than or equal to 20 ?m, wherein the coating comprises one of: (i) a high-modulus coating layer surrounding the cladding region; or (ii) a low-modulus coating layer surrounding the cladding region and a high-modulus coating layer surrounding the low-modulus coating layer; and exposing the core, through the coating, to a pattern of ultraviolet radiation to form an optical grating within the core.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating a data entity that causes a processing unit to process a computational graph. In one aspect, a method includes the actions of receiving data identifying a computational graph, the computational graph including a plurality of nodes representing operations; obtaining compilation artifacts for processing the computational graph on a processing unit; and generating a data entity from the compilation artifacts, wherein the data entity, when invoked, causes the processing unit to process the computational graph by executing the operations represented by the plurality of nodes.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating a data entity that causes a processing unit to process a computational graph. In one aspect, method includes the actions of receiving data identifying a computational graph, the computational graph including a plurality of nodes representing operations; obtaining compilation artifacts for processing the computational graph on a processing unit; and generating a data entity from the compilation artifacts, wherein the data entity, when invoked, causes the processing unit to process the computational graph by executing the operations represented by the plurality of nodes.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating a data entity that causes a processing unit to process a computational graph. In one aspect, method includes the actions of receiving data identifying a computational graph, the computational graph including a plurality of nodes representing operations; obtaining compilation artifacts for processing the computational graph on a processing unit; and generating a data entity from the compilation artifacts, wherein the data entity, when invoked, causes the processing unit to process the computational graph by executing the operations represented by the plurality of nodes.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating efficient compiled code. In an example method, a compilation system obtains an un-optimized computational graph comprising a plurality of nodes representing operations and directed edges representing data dependencies. The un-optimized computational graph is analyzed using pattern matching to determine fusable operations that can be fused together into a single fusion operation. The un-optimized computational graph is transformed into an optimized computational graph by replacing the nodes representing the fusable operations in the un-optimized computational graph with a fusion node representing the single fusion operation. The compilation system produces efficient code by translating the fusion node of the optimized computational graph as a call that performs the fused operations.

Abstract: Methods, systems, and media for providing determinism in multithreaded programs are provided. In some embodiments, methods for providing determinism in multithreaded programs are provided, the methods comprising: instrumenting a program with: a proxy that: receives inputs to the program; and determines whether a schedule corresponding to a set of input constraints satisfied by the inputs has been memoized; and a replayer that: if it is determined that a schedule corresponding to a set of input constraints satisfied by the inputs has been memoized, processes the inputs by the program according to the schedule.

Abstract: A data partitioning plan is automatically generated that—given a data-parallel program and a large input dataset, and without having to first run the program on the input dataset—substantially optimizes performance of the distributed execution system that explicitly measures and infers various properties of both data and computation to perform cost estimation and optimization. Estimation may comprise inferring the cost of a candidate data partitioning plan, and optimization may comprise generating an optimal partitioning plan based on the estimated costs of computation and input/output.

Abstract: Methods, systems, and media for protecting applications from races are provided. In some embodiments, methods for protecting applications from races are provided, the methods comprising: adding to at least one cycle of the application an update check to determine when an update to the application is to be made; adding an update engine to the application, wherein the update engine is configured to: receive an update plan that is based on an execution filter that specifies how operations of the application are to be synchronized; and cause synchronization operations to be added to the application based on the update plan that prevent the race from occurring.

Abstract: Methods, systems, and media for protecting applications from races are provided. In some embodiments, methods for protecting applications from races are provided, the methods comprising: adding to at least one cycle of the application an update check to determine when an update to the application is to be made; adding an update engine to the application, wherein the update engine is configured to: receive an update plan that is based on an execution filter that specifies how operations of the application are to be synchronized; and cause synchronization operations to be added to the application based on the update plan that prevent the race from occurring.

Abstract: A data partitioning plan is automatically generated that—given a data-parallel program and a large input dataset, and without having to first run the program on the input dataset—substantially optimizes performance of the distributed execution system that explicitly measures and infers various properties of both data and computation to perform cost estimation and optimization. Estimation may comprise inferring the cost of a candidate data partitioning plan, and optimization may comprise generating an optimal partitioning plan based on the estimated costs of computation and input/output.