Abstract: A method of forming a glass-based article comprises depositing molten glass onto a first molding member and pressing the molten glass between the first and second molding members by moving the first molding member and the second molding member towards one another. The pressing of the molten glass comprises moving a portion of one of the first and second molding members relative to a remaining portion thereof to form a first reduced-area pressing zone and, after formation of the first reduced-area pressing zone, moving the portion relative to the remaining portion to form a second reduced-area pressing zone where the molten glass is compressed between the first and second molding members.

Abstract: Topologies for analog computing systems are provided. Qubits in the topology are grouped into cells, and cells are coupled to adjacent cells by inter-cell couplers. At least some cells are coupled to non-adjacent cells via long-range couplers. Long-range couplers may be arranged into coverings so that certain sets of qubits within a covering region may be coupled with a reduced number of couplers. Each cell within a covering region without a long-range coupler may be proximate to a cell with a long range coupler so that each cell within the covering region is no more than a certain coupling distance away from a long-range coupler. Long-range couplers may couple over a greater physical distance than inter-cell couplers. Long-range couplers may couple to qubits over a larger coupling region, and may extend across multiple crossing regions between qubits.

Abstract: Computational systems implement problem solving using heuristic solvers or optimizers. Such may iteratively evaluate a result of processing, and modify the problem or representation thereof before repeating processing on the modified problem, until a termination condition is reached. Heuristic solvers or optimizers may execute on one or more digital processors and/or one or more quantum processors. The system may autonomously select between types of hardware devices and/or types of heuristic optimization algorithms. Such may coordinate or at least partially overlap post-processing operations with processing operations, for instance performing post-processing on an ith batch of samples while generating an (i+1)th batch of samples, e.g., so post-processing operation on the ith batch of samples does not extend in time beyond the generation of the (i+1)th batch of samples. Heuristic optimizers selection is based on pre-processing assessment of the problem, e.g.

Abstract: Systems and methods formulate problems for solving by a quantum processor using hardware graph decomposition. A decomposition of a primal graph may be built in a first stage based on a hardware specific graph, and refined in a second stage by, for example, removing vertices from the decomposition. The hardware specific graph may be a graph that is specific to a piece of hardware, for instance a quantum processor comprising a plurality of qubits and couplers operable to communicatively couple pairs of qubits.

Abstract: Computational systems implement problem solving using heuristic solvers or optimizers. Such may iteratively evaluate a result of processing, and modify the problem or representation thereof before repeating processing on the modified problem, until a termination condition is reached. Heuristic solvers or optimizers may execute on one or more digital processors and/or one or more quantum processors. The system may autonomously select between types of hardware devices and/or types of heuristic optimization algorithms. Such may coordinate or at least partially overlap post-processing operations with processing operations, for instance performing post-processing on an ith batch of samples while generating an (i+1)th batch of samples, e.g., so post-processing operation on the ith batch of samples does not extend in time beyond the generation of the (i+1)th batch of samples. Heuristic optimizers selection is based on pre-processing assessment of the problem, e.g.

Abstract: Topologies for analog computing systems are provided. Qubits in the topology are grouped into cells, and cells are coupled to adjacent cells by inter-cell couplers. At least some cells are coupled to non-adjacent cells via long-range couplers. Long-range couplers may be arranged into coverings so that certain sets of qubits within a covering region may be coupled with a reduced number of couplers. Each cell within a covering region without a long-range coupler may be proximate to a cell with a long range coupler so that each cell within the covering region is no more than a certain coupling distance away from a long-range coupler. Long-range couplers may couple over a greater physical distance than inter-cell couplers. Long-range couplers may couple to qubits over a larger coupling region, and may extend across multiple crossing regions between qubits.

Abstract: Systems and methods allow formulation of embeddings of problems via targeted hardware (e.g., particular quantum processor). In a first stage, sets of connected subgraphs are successively generated, each set including a respective subgraph for each decision variable in the problem graph, adjacent decisions variables in the problem graph mapped to respective vertices in the hardware graph, the respective vertices which are connected by at least one respective edge in the hardware graph. In a second stage, the connected subgraphs are refined such that no vertex represents more than a single decision variable.

Abstract: Systems and methods allow formulation of embeddings of problems via targeted hardware (e.g., particular quantum processor). In a first stage, sets of connected subgraphs are successively generated, each set including a respective subgraph for each decision variable in the problem graph, adjacent decisions variables in the problem graph mapped to respective vertices in the hardware graph, the respective vertices which are connected by at least one respective edge in the hardware graph. In a second stage, the connected subgraphs are refined such that no vertex represents more than a single decision variable.

Abstract: A method of validating parameters of a request from a Web client to a Web application. The validation rules are sent to a Web client, together with a response to a Web client. The parameters in a response are updated by the Web client. The updated parameters are sent in a subsequent request to the Web client, along with the validation rules. The updated parameters are validated using the validation rules in the request, thus achieving stateless validation. The validation rules are preferably digitally signed.

Abstract: A method of controlling data transfer between a Web client and a Web application by building a response with a target. The target indicates a destination to an impromptu component of the Web application. The target is signed when a response is built. After receiving the response by the Web client; the corresponding a request from the Web client includes the signed target. The request is received by an entry point of the Web application. The entry point has existing validation rules. The validation rules are by-passed when the signed target is verified. The target is restored in the request to the original state; and dispatched to the impromptu component.

Abstract: Systems and methods formulate problems for solving by a quantum processor using hardware graph decomposition. A decomposition of a primal graph may be built in a first stage based on a hardware specific graph, and refined in a second stage by, for example, removing vertices from the decomposition. The hardware specific graph may be a graph that is specific to a piece of hardware, for instance a quantum processor comprising a plurality of qubits and couplers operable to communicatively couple pairs of qubits.

Abstract: Systems and methods allow formulation of embeddings of problems via targeted hardware (e.g., particular quantum processor). In a first stage, sets of connected subgraphs are successively generated, each set including a respective subgraph for each decision variable in the problem graph, adjacent decisions variables in the problem graph mapped to respective vertices in the hardware graph, the respective vertices which are connected by at least one respective edge in the hardware graph. In a second stage, the connected subgraphs are refined such that no vertex represents more than a single decision variable.

Abstract: A mechanism is provided for synchronizing a first user session and a second user session in a client-server system. The first user session is between a first Web service and a client and the second user session is between a second Web service and the same client. A request is received with a first session value by the second Web service. An indicator of the first session value is assigned to a shadow, and the shadow is sent in a response to the client. A subsequent request with the shadow and a subsequent session value is received from the client. The indicator is used to verify the subsequent session value at the second Web service. The second user session is terminated if the indicator in the shadow does not correspond to the subsequent session value.

Abstract: A packaging receptacle, made from a flexible film, has a first side sealed to a second side, a top edge and an open top, an interior chamber, and a tear initiator. A product is placed in the internal chamber within the packaging receptacle, and the receptacle sealed closed. The flexible film has a linear tear property and an imbalanced internal stress so that the film exhibits a linear tear property in combination with the torn edges curling outwardly and away from the interior chamber within the packaging article. The packaging receptacle is particularly suited for the packaging of medical products to be sterilized while in the package. Also disclosed is a manually-openable packaged product, a process for preparing and transferring a product, and a process of opening a packaged product made from a packaging receptacle.

Abstract: The present invention provides inhibitors of kinases, specifically I?B kinases, JAK1, JAK2, JAK3 and TYK2. The invention also provides for compositions comprising such inhibitory compounds and methods of inhibiting said kinase activity by administering the compound to a patient in need of treatment for myeloproliferative disorders, cancer or NF-?B-mediated diseases.

Abstract: Method and system for centralized control of data transfers between a Web client and a Web application by receiving a response from the Web application. After determining an offending character is present, cloaking the response from the Web application to a request from a Web client, and sending the cloaked response to the Web client through a security product which otherwise rejects the offending character.

Abstract: The present invention relates to piperidine-based renin inhibitor compounds having carboxylate or carboxylic acid terminal groups, and their use in treating cardiovascular events and renal insufficiency.

Abstract: The present invention relates to biphenyl-based renin inhibitor compounds having amino-terminal groups, and their use in treating cardiovascular events and renal insufficiency.

Abstract: Apparatus for use with a slatted floor comprises a floor covering apparatus for placement on the individual slats of a slatted floor. Each floor covering apparatus includes an elongated elastomeric mat (410) adapted to be fitted to a floor slat. The mat has a rigid fixing base (411), a flexible core (11) and an outer skin (415). The rigid fixing base (411), the flexible core (11) and the outer skin (415) are integrally formed together. The mat has a longitudinal leg (413) at each side to locate the mat. Also a flap valve (412) is mounted on each leg and protrudes into the gap between adjacent slats.

Abstract: Heterocyclic compounds of structural formula (I), or a pharmaceutically acceptable salt thereof, wherein W is a R1— substituted heteroaryl, R1 is an heteroaryl ring substituted with an ester or carboxylic acid containing radical, X-T is N—CR5R6, C?CR5 or CR13—CR5R6, Y is a bond or —C(O)—, a and b represent an integer selected from 1 to 4, and Ar is an optionally substituted phenyl or naphtyl, are inhibitors of stearoyl-coenzyme A delta-9 desaturase (SCD) The heterocyclic compounds are useful for the prevention and treatment of conditions related to abnormal lipid synthesis and metabolism, including cardiovascular disease, atherosclerosis, obesity, diabetes, neurological disease, Metabolic Syndrome, insulin resistance, cancer, liver steatosis, and non-alcoholic steatohepatitis.