Fractal regularity results on optimal irrigation patterns

In this paper the problem of the regularity, i.e. fractal behaviour, of the minima of the branched transport problem is addressed. We show that, under suitable conditions on the irrigated measure, the minima present a fractal regularity, that is on a given branch of length l the number of branches bifurcating from it whose length is comparable with ε   can be estimated both from above and below by l/ε$l/\epsilon$.     

Blow-up of optimal sets in the irrigation problem

We consider the minimization problem for an average distance functional in the plane, among all compact connected sets of prescribed length. For a minimizing set, the blow-up sequence in the neighborhood of any point is investigated. We show existence of the blow up limits and we characterize them, using the results to get some partial regularity statements.     

Elementary properties of free extensions

For any partial groupoid , let Fr be the free extension of to a total groupoid. We show that implies and that the theory of Fr is uniformly recursive in the theory of . These results fail if “groupoid” is replaced by “semigroup”, “commutative semigroup”, “group”, “abelian group”, “semilattice”, “K-lattice” for any nontrivial varietyK of lattices, or “Boolean algebra”. Research supported in part by NSF Grant MCS78-01867. We thank the referee for his valuable comments. Presented by B. Jónsson.     

Simplest optimal cutting patterns for equal rectangles

This paper presents branch-and-bound algorithms that can guarantee the simplest optimal cutting patterns of equal rectangles. An existing linear algorithm determines the global upper bound exactly. The branching process ends when a branch of a lower bound equal to the global upper bound is found.     

A linear programming model for the optimal levelling of an irrigation surface

In this paper a model is given for the optimal levelling of any kind of surface to be irrigated. The optimization problem is solved by a large scale linear programming model using the matrix generating program developed by the author. In a practical application of the model the matrix had 1359 rows.     

Elementary properties of categories of acts over monoids

We explore connections between elementary equivalence of categories of acts over monoids and second-order equivalence of monoids. __________ Translated from Algebrai Logika, Vol. 45, No. 6, pp. 687–709, November–December, 2006.     

Elementary properties of arcwise connected sets and functions

The purpose of this paper is to investigate some elementary, basic properties of arcwise connected sets and functions. Since these concepts are generalizations of convexity, it is natural to ask if any of the basic properties of convex sets and functions are carried over to these new generalized classes. All the functions involved are considered to be not necessarily differentiable.     

A multi-objective optimal allocation model for irrigation water resources under multiple uncertainties

This paper proposed a multi-objective optimal water resources allocation model under multiple uncertainties. The proposed model integrated the chance-constrained programming, semi-infinite programming and integer programming into an interval linear programming. Then, the developed model is applied to irrigation water resources optimal allocation system in Minqin’s irrigation areas, Gansu Province, China. In this study, the irrigation areas’ economic benefits, social benefits and ecological benefits are regarded as the optimal objective functions. As a result, the optimal irrigation water resources allocation plans of different water types (surface water and groundwater) under different hydrological years (wet year, normal year and dry year) and probabilities are obtained. The proposed multi-objective model is unique by considering water-saving measures, irrigation water quality impact factors and the dynamic changes of groundwater exploitable quantity in the irrigation water resources optimal allocation system under uncertain environment. The obtained results are valuable for supporting the adjustment of the existing irrigation patterns and identify a desired water-allocation plan for irrigation under multiple uncertainties.     

Structural properties of optimal schedules with preemption

Scheduling problems with preemption are considered, where each operation can be interrupted and resumed later without any penalty. We investigate some basic properties of their optimal solutions. When does an optimal schedule exist (provided that there are feasible schedules)? When does it have a finite/polynomial number of interruptions? Do they occur at integral/rational points only? These theoretical questions are also of practical interest, since structural properties can be used to reduce the search space in a practical scheduling application. In this paper we answer some of these basic questions for a rather general scheduling model (including, as the special cases, the classicalmodels such as parallelmachine scheduling, shop scheduling, and resource constrained project scheduling) and for a large variety of the objective functions including nearly all known. For some two special cases of objective functions (including, however, all classical ones), we prove the existence of an optimal solution with a special “rational structure.” An important consequence of this property is that the decision versions of these optimization scheduling problems belong to class NP.     

Convergence properties of optimal controls of pseudo-parabolic problems

Approximation properties of pseudo-parabolic optimal controls to the parabolic optimal control are considered for two concrete problems.     

Large deviation properties for patterns

Deciding whether a given pattern is over- or under-represented according to a given background model is a key question in computational biology. Such a decision is usually made by computing some p-values reflecting the “exceptionality” of a pattern in a given sequence or set of sequences. In the simplest cases (short and simple patterns, simple background model, small number of sequences), an exact p-value can be computed with a tractable complexity. The realistic cases are in general too complicated to get such an exact p-value. Approximations are thus proposed (Gaussian, Poisson, Large deviation approximations). These approximations are applicable under some conditions: Gaussian approximations are valid in the central domain while Poisson and Large deviation approximations are valid for rare events. In the present paper, we prove a large deviation approximation to the double strands counting problem that refers to a counting of a given pattern in a set of sequences that arise from both strands of the genome. In that case, dependencies between a sequence and its reverse complement cannot be neglected. They are captured here for a Bernoulli model from general combinatorial properties of the pattern. A large deviation result is also provided for a set of small sequences.     

Generating optimal cutting patterns for rectangular blanks of a single size

This paper deals with the problem of minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts. First we prove that we can obtain the unconstrained optimal layout by searching among normal multi-section layouts. Next we present an unconstrained algorithm to search for it. The unconstrained algorithm uses a branch-and-bound method with a tight upper bound. Later we discuss the algorithm for the constrained problem where the blank demand must be met exactly. Finally, the unconstrained algorithm is extended to cope with the blade length constraint. Experimental computations show that the algorithms are extremely efficient.     

Two-derivative Runge-Kutta methods with optimal phase properties

In this work, we consider two-derivative Runge-Kutta methods for the numerical integration of first-order differential equations with oscillatory solution. We construct methods with constant coefficients and special properties as minimum phase-lag and amplification errors with three and four stages. All methods constructed have fifth algebraic order. We also present methods with variable coefficients with zero phase-lag and amplification errors. In order to examine the efficiency of the new methods, we use four well-known oscillatory test problems.