Abstract: A method for executing a graph algorithm may include responding to a request from a client to execute a graph algorithm on graph data stored in a database by determining data required to execute the graph algorithm. In response to determining that a first portion of the data required to execute the graph algorithm is absent from an existing adjacency structure that includes a second portion of the data required to execute the graph algorithm, the existing adjacency structure may be modified to include the first portion of data. The graph algorithm may be executed based on the modified adjacency structure. The execution of the graph algorithm may include querying, based on the modified adjacency structure, the graph data stored in the database. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A method for performing a path finding operation in graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a weighted path operation on at least portion of the graph data. The portion of the graph data may correspond to a graph. The request may specify attributes associated with vertices and/or edges included in the graph. In response to the request, the weighted path operation may be performed by at least identifying a shortest path between two endpoints in the graph. The shortest path may minimize the one or more attributes of vertices and/or edges included in the shortest path. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A method for performing text searches on graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a text search to locate a target string in the graph data stored in the database. The request may be in accordance with a declarative graph query configured to query the graph data stored in the database. The response to the request may include performing the text search to locate, in the graph data stored in the database, one or more records of strings that are exact matches, approximate matches, and/or linguistic matches for the target string. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: The present disclosure relates to a set of at least 100 single-stranded oligonucleotide probes directed against (or complementary to) portions of a genomic target sequence of interest. The present disclosure also relates to a method of detecting a genomic target sequence of interest using the set of oligonucleotide probes and a method of generating the set of oligonucleotide probes. Further, the present disclosure relates to a kit comprising the set of oligonucleotide probes and at least one further component.

Abstract: An optical system includes an illumination optical unit configured to guide illumination radiation along a path to an object plane. The illumination optical unit includes comprising a first facet mirror; a second facet mirror disposed downstream of the first facet mirror along the path; and a condenser mirror. The optical system also includes a projection optical unit configured to image a first article in the object plane onto a second article in an image plane. The image plane is a first distance from the object plane. The condenser mirror a second distance from the object plane.

Abstract: A sensor element for a motor vehicle, includes a sensor circuit for detecting a physical variable, a first housing, in which the sensor circuit is arranged, a second housing, in which the first housing is arranged, a thermoplastic, which at least partially encloses the first housing and fixes the first housing in the second housing in a positioning position, at least two positioning recesses for receiving positioning pins being formed in the first housing in order to fix the first housing in the positioning position while the first housing is being enveloped by the thermoplastic.

Abstract: A device (1) for measuring the injection rate dm(t)/dt of an injection valve (2) for a fluid (4a), wherein m(t) is the injection quantity of the fluid (4a) as a function of the time (t), having a measurement volume (3) which is closed off on all sides and which is filled with a test fluid (4), having an opening (5a) in one wall (5) of the measurement volume (3) for the purposes of receiving the injection valve (2) such that the injection valve (2), in the installed position, projects with at least one injection opening (2a) into the measurement volume (3), and having a pressure sensor (6) which is arranged in the measurement volume (3), wherein correction means (8, 8a, 9a, 9b, 9c) are provided for determining the propagation time of a pressure wave (12), which originates from the injection opening (2a) and which propagates through the test fluid (4), to the pressure sensor (6) and for correcting the measured injection rate dm(t)/dt, taking said propagation time into consideration, to give a rectified injectio

Abstract: The present disclosure relates to a set of at least 100 single-stranded oligonucleotide probes directed against (or complementary to) portions of a genomic target sequence of interest. The present disclosure also relates to a method of detecting a genomic target sequence of interest using the set of oligonucleotide probes and a method of generating the set of oligonucleotide probes. Further the present disclosure relates to a kit comprising the set of oligonucleotide probes and at least one further component.

Abstract: An apparatus which comprises an expansion unit configured for expanding a foil, and a mounting unit configured for subsequently mounting the expanded foil on a frame and a workpiece, in particular a wafer, on the expanded foil.

Abstract: A system for processing graph-modeled data in a relational database is provided. The system can include at least one data processor and at least one memory storing instructions that are executed by the at least one data processor. Executing the instructions can result in operations comprising: receiving a request to execute a graph algorithm operating on graph-modeled data stored at a relational database; and executing the graph algorithm within the relational database, the executing comprising use of an adjacency structure within the relational database. Related methods and articles of manufacture, including computer program products, are also provided.

Abstract: The present disclosure relates to an in vitro method for releasing analytes from a sample involving contacting the sample with (i) a chaotropic agent, (ii) an organic solvent, (iii) a detergent, and (iv) at least one agent providing bicarbonate ions. The present disclosure further relates to a release agent for releasing analytes from a sample having the aforesaid compounds. Moreover, the present disclosure relates to uses, kits, methods and devices related to the method and the release agent of the present disclosure.

Abstract: A measurement setup for measuring attenuation through an irregular surface of a device under test is described. The measurement setup comprises a positioning system, a reference reflector having a collection of diffuse scattering members, and a three dimensional imaging system. The measurement setup has a reference state and a measurement state, wherein respective images are taken in the different states. The imaging system is configured to compare the images taken in the reference state and the measurement state to determine the attenuation of the device under test. Further, a reference reflector as well as a method for measuring attenuation are described.

Abstract: This application relates generally to a method and apparatus to deposit particles onto one or more coupons, and harvest particles from one or more coupons, which may beneficially provide a more uniform or localized distribution of particles over a specified area on each coupon. The application relates to a method and apparatus for depositing particles onto one or more coupons using a sieve. The application also relates to a method and apparatus for depositing particles onto one or more coupons using a dust storm. The particle loadings achieved on each coupon or across an individual coupon may be substantially uniform. The application further relates to a laser-based method and apparatus for transferring particles deposited at localized points on a source coupon to a different substrate for further use.

Abstract: A facet mirror for EUV projection lithography has a plurality of facets for reflecting EUV illumination light. At least some of the facets are in the form of alignment facets and have a reflection surface, the edge contour of which is aligned along two alignment coordinates of an overall facet arrangement. The reflection surface of at least one of the alignment facets has a surface shape that exhibits different curvatures along two axes of curvature. The axes of curvature are tilted about a finite axis tilt angle relative to the alignment coordinates of the overall facet arrangement. The result is a facet mirror with increased EUV throughput, particularly for prolonged operation of a projection exposure apparatus that is equipped therewith.

Abstract: A device for processing wafer-shaped articles comprises a closed process chamber that provides a gas-tight enclosure. A rotary chuck is located within the closed process chamber. A heater is positioned relative to the chuck so as to heat a wafer shaped article held on the chuck from one side only and without contacting the wafer shaped article. The heater emits radiation having a maximum intensity in a wavelength range from 390 nm to 550 nm. At least one first liquid dispenser is positioned relative to the chuck so as to dispense a process liquid onto a side of a wafer shaped article that is opposite the side of the wafer-shaped article facing the heater.

Abstract: A method for performing a path finding operation in graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a weighted path operation on at least portion of the graph data. The portion of the graph data may correspond to a graph. The request may specify attributes associated with vertices and/or edges included in the graph. In response to the request, the weighted path operation may be performed by at least identifying a shortest path between two endpoints in the graph. The shortest path may minimize the one or more attributes of vertices and/or edges included in the shortest path. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A method for performing text searches on graph data stored in a database is provided. The method may include receiving, from a client, a request to perform a text search to locate a target string in the graph data stored in the database. The request may be in accordance with a declarative graph query configured to query the graph data stored in the database. The response to the request may include performing the text search to locate, in the graph data stored in the database, one or more records of strings that are exact matches, approximate matches, and/or linguistic matches for the target string. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A method for executing a graph algorithm is provided. The method may include responding to a request from a client to execute a graph algorithm on graph data stored in a database by determining data required to execute the graph algorithm. In response to determining that a first portion of the data required to execute the graph algorithm is absent from an existing adjacency structure that includes a second portion of the data required to execute the graph algorithm, the existing adjacency structure may be modified to include the first portion of data. The graph algorithm may be executed based on the modified adjacency structure. The execution of the graph algorithm may include querying, based on the modified adjacency structure, the graph data stored in the database. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A method for executing a graph algorithm is provided. The method may include responding to a request from a client to execute a graph algorithm on graph data stored in a database by determining data required to execute the graph algorithm. In response to determining that a first portion of the data required to execute the graph algorithm is absent from an existing adjacency structure that includes a second portion of the data required to execute the graph algorithm, the existing adjacency structure may be modified to include the first portion of data. The graph algorithm may be executed based on the modified adjacency structure. The execution of the graph algorithm may include querying, based on the modified adjacency structure, the graph data stored in the database. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: This application relates generally to a method and apparatus to deposit particles onto one or more coupons, and harvest particles from one or more coupons, which may beneficially provide a more uniform or localized distribution of particles over a specified area on each coupon. The application relates to a method and apparatus for depositing particles onto one or more coupons using a sieve. The application also relates to a method and apparatus for depositing particles onto one or more coupons using a dust storm. The particle loadings achieved on each coupon or across an individual coupon may be substantially uniform. The application further relates to a laser-based method and apparatus for transferring particles deposited at localized points on a source coupon to a different substrate for further use.