Isothermal calorimetry operated in gas perfusion mode (IGPC) is often used to quantify the amorphous content of pharmaceutical powders. Typically, the calibration line is constructed using the heat of crystallisation as the sample is exposed to high levels of a plasticising vapour. However, since the physical form to which the amorphous fraction crystallises may be dependent on the presence of ...

The asymptotic lattices and their transformations are studied within the line geometry approach. It is shown that the discrete asymptotic nets are represented by isotropic congruences in the Plücker quadric. On the basis of the Lelieuvre-type representation of asymptotic lattices and of the discrete analog of the Moutard transformation, it is constructed the discrete analog of the W–congruences...

Line following robots are applied in numerous application areas. High reliability of the line estimation could be obtained by the application of Track–Before–Detect algorithms, like Viterbi algorithm. The hardware and software of the robot are shown in the paper. Real–time constraint are discussed in this paper, related to the constructed robot. The obtained results shows the possibilities of t...

The length of a vector v = ( x y ) in R2 is || ( x y ) || = √ x2 + y2, and the distance between two vectors v and w is the length of their difference: ||v − w||. A function h : R2 → R2 is called an isometry when it preserves distances: ||h(v)− h(w)|| = ||v −w|| for all v and w in R2. Examples of isometries include translation by ( 1 −1/2 ) , a rotation by 40 degrees counterclockwise around the ...

On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5 w −1 4 chains to cover poset of width w. Felsner [3] introduced a variant of this problem considering only up-growing posets, i.e. on-line posets in which each new point is maximal at the moment of its arrival. He presented an algorithm using (

Consider all planar walks, with positive unit steps (1, 0) and (0, 1), from the origin (0, 0) to a given point (a, b). Let L be the line joining the beginning to the end, i.e., the line b x a y = 0. Call the region below L "downtown," and the region above L "uptown," the line L being the border-line between downtown and uptown. Each such walk has a + b 1 points, not counting the endpoints. For ...

An on-line chain partitioning algorithm receives the points of the poset from some externally determined list. Being presented with a new point the algorithm learns the comparability status of this new point to all previously presented ones. As each point is received, the algorithm assigns this new point to a chain in an irrevocable manner and this assignment is made without knowledge of future...

A layered graph is a connected graph whose vertices are partitioned into sets L0 = {s}, L1, L2, ..., and whose edges, which have nonnegative integral weights, run between consecutive layers. Its width is max{|Li|}. In the on-line layered graph traversal problem, a searcher starts at s in a layered graph of unknown width and tries to reach a target vertex t; however, the vertices in layer i and ...

w

ww