In this paper, we consider the rectilinear one-center problem on uncertain points in the plane. In this problem, we are given a set P of n (weighted) uncertain points in the plane and each uncertain point has m possible locations each associated with a probability for the point appearing at that location. The goal is to find a point q∗ in the plane which minimizes the maximum expected rectiline...

Let G be an abstract graph. Motivated by the Orchard relation, introduced in [3, 4], we have defined the Orchard crossing number of G [5], in a similar way to the well-known rectilinear crossing number of an abstract graph G (denoted by cr(G), see [1, 8]). A general reference for crossing numbers can be [6]. The Orchard crossing number is interesting for several reasons. First, it is based on t...

World population is raising, especially the part of people living in cities. With increased population and complex roles regarding their inhabitants and their surroundings, cities concentrate difficulties for design, planning and analysis. These tasks require a way to reconstruct/model a city. Traditionally, much attention has been given to buildings reconstruction, yet an essential part of cit...

The problem of efficient traffic coordination in urban street networks is carefully studied in the paper. The problem description was simplified as much as possible, by defining minimal set of decision variables and deriving necessary constraints on their values. The structure of feasible solutions is established introducing new basis of street network loops. The software package was worked out...

The paper describes successful coupling of adsorptive transfer stripping (AdTS) and elimination voltammetry with linear scan (EVLS) for the resolution of reduction signals of cytosine (C) and adenine (A) residues in hetero-oligodeoxynucleotides (ODNs). Short ODNs (9-mers and 20-mers) were adsorbed from a small volume on a hanging mercury drop electrode (HMDE). After washing of the ODN-modified ...

Using machine learning for predicting traffic is described in the context of a competition organized using the TunedIT platform. A heuristic is proposed for reconstructing the route of a car in a street graph from a temporal stream of its coordinates. A resilient propagation neural network for approximating the average velocity on a given street from irregular time series of instantaneous veloc...