Separability of the space of continuous functions that are continuous in Λ-variation

The Shao-Sablin index of a Λ-sequence Λ=(λi) is defined by . The main result of the paper states that the Banach space CΛBV of continuous functions of bounded Λ-variation with the standard Λ-variation norm is separable if and only if SΛ<2. Also, ΛBV=ΛBVc if and only if SΛ<2, where ΛBVc denotes the space of functions continuous in Λ-variation. A number of corollaries is drawn, and one of them being that the Garsia-Sawyer class GS is a dense subset of the Banach space HBV of functions of bounded harmonic variation.     

𝒞1 continuous discretization of gradient elasticity

For the modeling of size effects, gradient continua can be applied. In this contribution, strain gradients are used in a nonlinear hyperelastic material model. The resulting partial differential equations are solved numerically in terms of a Galerkin scheme requiring 𝒞¹ continuity of the shape functions. The performance of three 𝒞¹ continuous finite elements and the 𝒞¹ Natural Element method is compared. (© 2009 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Hyperchaotic set in continuous chaos–hyperchaos transition

Topological horseshoes with two-directional expansion imply invariant sets with two positive Lyapunov exponents (LE), which are recognized as a signature of hyperchaos. However, we find such horseshoes in two piecewise linear systems and one smooth system, which all exhibit chaotic attractors with one positive LE. The three concrete systems are the simple circuit by Tamaševičius et al., the Matsumoto–Chua–Kobayashi (MCK) circuit and the linearly controlled Lorenz system, respectively. Substantial numerical evidence from these systems suggests that a hyperchaotic set can be embedded in a chaotic attractor with one positive LE, and keeps existing while the attractor becomes hyperchaotic from chaotic. This paper presents such a new scenario of the continuous chaos–hyperchaos transition.     

Large deviations for Glauber dynamics of continuous gas

This paper is devoted to the large deviation principles of the Glauber-type dynamics of finite or infinite volume continuous particle systems.We prove that the level-2 empirical process satisfies the large deviation principles in the weak convergence topology,while it does not satisfy the large deviation principles in the T-topology.     

On a methodology for discrete–continuous scheduling

Discrete–continuous problems of scheduling nonpreemptable jobs on parallel machines are considered. The problems arise e.g. when jobs are assigned to multiple parallel processors driven by a common electric, hydraulic or pneumatic power source. Existing models have assumed job processing rates as a function of the number of jobs currently being processed, or equivalently the number of machines currently in operation. In this paper a more general model is proposed in which processing rates of a job assigned to a machine depend on the amount of a continuous, i.e. continuously divisible resource (e.g. power) allotted to this job at a time. Thus the problem consists of two interrelated subproblems: (i) to sequence jobs on machines, and (ii) to allocate the continuous resource among jobs already sequenced. We provide a comprehensive analysis of the problem. This includes properties of optimal schedules, efficiently (in particular analytically) solvable cases, formulations of the possibly simplest mathematical programming problems for finding optimal schedules in the general case, heuristics and the worst-case analysis. Although our objective function in this paper is to minimize makespan of a set of independent jobs, the presented methodology can be applied to other criteria, precedence-related jobs, and many resource types (apart from, or instead of machines).     

Higher-dimensional Contou-Carrère symbol and continuous automorphisms

We prove that the higher-dimensional Contou-Carrère symbol is invariant under the continuous automorphisms of algebras of iterated Laurent series over a ring. Applying this property, we obtain a new explicit formula for the higher-dimensional Contou-Carrère symbol. Unlike previously known formulas, this formula holds over an arbitrary ring, not necessarily a Q-algebra, and its derivation does not employ algebraic K-theory.     

Multiple machine continuous setup lotsizing with sequence-dependent setups

We address the short-term production planning and scheduling problem coming from the glass container industry. A furnace melts the glass that is distributed to a set of parallel molding machines. Both furnace and machine idleness are not allowed. The resulting multi-machine multi-item continuous setup lotsizing problem with a common resource has sequence-dependent setup times and costs. Production losses are penalized in the objective function since we deal with a capital intensive industry. We present two mixed integer programming formulations for this problem, which are reduced to a network flow type problem. The two formulations are improved by adding valid inequalities that lead to good lower bounds. We rely on a Lagrangian decomposition based heuristic for generating good feasible solutions. We report computational experiments for randomly generated instances and for real-life data on the aforementioned problem, as well as on a discrete lotsizing and scheduling version.     

Local search metaheuristics for discrete–continuous scheduling problems

Problems of scheduling nonpreemptable jobs which require simultaneously a machine from a set of parallel, identical machines and a continuous, renewable resource are considered. For each job there are known: its processing speed as a continuous, concave function of a continuous resource allotted at a time and its processing demand. The optimization criterion is the schedule length. The problem can be decomposed into two interrelated subproblems: (i) to sequence jobs on machines, and (ii) to find an optimal (continuous) resource allocation among jobs already sequenced. Problem (ii) can be formulated as a convex programming problem with linear constraints and solved using proper solvers. Thus, the problem remains to generate a set of all feasible sequences of jobs on machines (this guarantees finding an optimal schedule in the general case). However, the cardinality of this set grows exponentially with the number of jobs. Thus, we propose to use heuristic search methods defined on the space of feasible sequences. Three metaheuristics: tabu search (TS), simulated annealing (SA) and genetic algorithm (GA) have been implemented and compared computationally with a random sampling technique. The computational experiment has been carried out on an SGI PowerChallenge XL computer with 12 RISC R8000 processors. Some directions for further research have been pointed out.     

Dye’s theorem in the almost continuous category

Suppose X and Y are Polish spaces with non-atomic Borel probability measures μ and ν and suppose that T and S are ergodic measure-preserving homeomorphisms of (X, μ) and (Y, ν). Then there are invariant G _δ subsets X′ ⊂ X and Y′ ⊂ Y of full measure and a homeomorphism ϕ: X′ → Y′ which maps μ|X′ to ν|Y′ and maps T-orbits onto S-orbits. We also deal with the case where T and S preserve infinite invariant measures.     

On pseudoanalyticity of continuous functions with constant σ-extension

The theorem on pseudoanalyticity of continuous functions with constant -extension is proved; this is an analog of the well known results due to Bohr, Rademacher, Men'shov, and Trokhimchuk concerning the analyticity of functions with constant extension.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 4, pp. 459–465, April, 1993.     

Banach–Zaretsky theorem for compactly absolutely continuous mappings

For mappings of an interval into locally convex spaces, convex and compact convex analogs of absolute continuity, bounded variation, and the Luzin N-property are introduced and studied. We prove that, in the general case, a convex analog of the Banach–Zaretsky criteria can be “split” into sufficient and necessary conditions. However, in the Fréchet-space case, we have an exact compact analog of the criteria.     

Resource level minimization in the discrete–continuous scheduling

A discrete–continuous problem of non-preemptive task scheduling on identical parallel processors is considered. Tasks are described by means of a dynamic model, in which the speed of the task performance depends on the amount of a single continuously divisible renewable resource allotted to this task over time. An upper bound on the completion time of all the tasks is given. The criterion is to minimize the maximum resource consumption at each time instant, i.e., the resource level. This problem has been observed in many industrial applications, where a continuously divisible resource such as gas, fuel, electric, hydraulic or pneumatic power, etc., has to be distributed among the processing units over time, and it affects their productivity. The problem consists of two interrelated subproblems: task sequencing on processors (discrete subproblem) and resource allocation among the tasks (continuous subproblem). An optimal resource allocation algorithm for a given sequence of tasks is presented and computationally tested. Furthermore, approximation algorithms are proposed, and their theoretical and experimental worst-case performances are analyzed. Computer experiments confirmed the efficiency of all the algorithms.     

A continuous model for production–distribution system design

The production–distribution system design problem (PDSDP) involves decisions concerning the structure of a firm's supply chain. An overwhelming majority of the literature uses mixed integer programming formulations in representing such facility design decisions. In this paper, we present an alternative modeling framework, which is based on the use of continuous functions to represent spatial distributions of cost and customer demand. The proposed continuous model allows the derivation of a number of insights about the impact of problem parameters on facility design decisions. It is proposed that discrete and continuous modeling approaches complement each other.     

A continuous/discrete fractional Noether’s theorem

We prove a fractional Noether’s theorem for fractional Lagrangian systems invariant under a symmetry group both in the continuous and discrete cases. This provides an explicit conservation law (first integral) given by a closed formula which can be algorithmically implemented. In the discrete case, the conservation law is moreover computable in a finite number of steps.     

Pseudoanalyticity of continuous functions with the σ-preservation of angles

The following theorem is proved: Every continuous function satisfying the conditionK is pseudo-analytic. The conditionK is a generalization of the Men'shov condition, well known in the theory of analytic functions.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 8, pp. 1051–1057, August, 1993.     

Convergence and continuous dependence for the Brinkman–Forchheimer equations

This paper investigates the flow of fluid in a porous medium which is described in the Brinkman–Forchheimer equations and obtains the structural stability results for the coefficients.