Features of the dynamic stresses inthe neighbourhood of the joint of three elastic media

The solution of the problem of the harmonic oscillations of a piecewise-inhomogeneous domain, consisting of three joinedrectangles with different elastic properties, is constructed within the framework of a modified superposition method. The discontinuities in the wave field are investigated in the neighbourhood of singular point of the boundary at the joint of the rectangles.     

Multi‐layered Youden Rectangles

Multi‐layered Youden rectangles are introduced. These new designs include double and triple Youden rectangles as subdesigns. Though many double Youden rectangles are known, the triples, introduced in 1994, have to now yielded few nontrivial examples. Two infinite series of multi‐layered Youden rectangles are constructed, and so also many new triple Youden rectangles.     

Performance Bound for Bottom-Left Guillotine Packing of Rectangles

In this article we show that bottom-left guillotine placement of rectangles ordered by decreasing width in a fixed-width bin is not more than three times the height of an optimal placement. This bound is also true for bottom-left placement of rectangles without the guillotine constraints. Thus, bottom-left guillotine placement in which rectangles are ordered by decreasing width has the same worst case performance bound as bottom-left placement of rectangles without guillotine constraints.     

Multimagic rectangles based on large sets of orthogonal arrays

Large sets of orthogonal arrays (LOAs) have been used to construct resilient functions and zigzag functions by Stinson. In this paper, an application of LOAs in constructing multimagic rectangles is given. Further, some recursive constructions for multimagic rectangles are presented, and some infinite families of bimagic rectangles are obtained.     

An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles

This paper proposes an improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. Some improvements on the fitness function of genetic algorithm for the orthogonal packing of rectangles are also suggested. Solutions of two numerical examples show the effectiveness of these improvements.     

Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane

An intersection graph of rectangles in the (x, y)-plane with sides parallel to the axes is obtained by representing each rectangle by a vertex and connecting two vertices by an edge if and only if the corresponding rectangles intersect. This paper describes algorithms for two problems on intersection graphs of rectangles in the plane. One is an O(n log n) algorithm for finding the connected components of an intersection graph of n rectangles. This algorithm is optimal to within a constant factor. The other is an O(n log n) algorithm for finding a maximum clique of such a graph. It seems interesting that the maximum clique problem is polynomially solvable, because other related problems, such as the maximum stable set problem and the minimum clique cover problem, are known to be NP-complete for intersection graphs of rectangles. Furthermore, we briefly show that the k-colorability problem on intersection graphs of rectangles is NP-complete.     

Spotlight Tiling

This article introduces spotlight tiling, a type of covering which is similar to tiling. The distinguishing aspects of spotlight tiling are that the “tiles” have elastic size, and that the order of placement is significant. Spotlight tilings are decompositions, or coverings, and can be considered dynamic as compared to typical static tiling methods. A thorough examination of spotlight tilings of rectangles is presented, including the distribution of such tilings according to size, and how the directions of the spotlights themselves are distributed. The spotlight tilings of several other regions are studied, and suggest that further analysis of spotlight tilings will continue to yield elegant results and enumerations.     

基于模拟退火算法的矩形优化排样问题的研究

考虑了一种矩形优化排样系统中遗传算法和模拟退火算法的结合算法.首先建立了该系统的通用数学模型.然后给出了求解该问题的遗传模拟退火算法.最后用VC++6.0模拟算例的结果表明该算法是一种行之有效的方法.     

A problem of the bending of a plate for a doubly connected domain with a partially unknown boundary

The problem of the bending of an isotropic elastic plate, bounded by two rectangles with vertices lying on the same half-line, drawn from the common centre, is considered. The vertices of the inner rectangle are cut by convex smooth arcs (we will call the set of these arcs the unknown part of the boundary). It is assumed that normal bending moments act on each rectilinear section of the boundary contours in such a way that the angle of rotation of the midsurface of the plate is a piecewise-constant function. The unknown part of the boundary is free from external forces. The problem consists of determining the bending of the midsurface of the plate and the analytic form of the unknown part of the boundary when the tangential normal moment acting on it takes a constant value, while the shearing force and the normal bending moments and torques are equal to zero. The problem is solved by the methods of the theory of boundary-value problems of analytical functions.     

Existence of magic 3‐dimensional rectangles

Since the complete solution for the existence of magic 2‐dimensional rectangles in 1881, much attention has been paid on the existence of magic l‐dimensional rectangles for . The existence problem for magic l‐dimensional rectangles with even sizes has been solved completely for all integers . However, very little is known for the existence of magic l‐dimensional rectangles () with odd sizes except for some families and a few sporadic examples. In this paper, we focus our attention on the existence of magic 3‐dimensional rectangles and prove that the necessary conditions for the existence of magic 3‐dimensional rectangles are also sufficient. Our construction method is mainly based on a new concept, symmetric zero‐sum subset partition, which plays a crucial role in the recursive constructions of magic 3‐rectangles similar to that of PBD in the PBD‐closure construction in combinatorial design theory.     

Symmetry-breaking constraints for packing identical rectangles within polyhedra

Two problems related to packing identical rectangles within a polyhedron are tackled in the present work. Rectangles are allowed to differ only by horizontal or vertical translations and possibly 90° rotations. The first considered problem consists in packing as many identical rectangles as possible within a given polyhedron, while the second problem consists in finding the smallest polyhedron of a given type that accommodates a fixed number of identical rectangles. Both problems are modeled as mixed integer programming problems. Symmetry-breaking constraints that facilitate the solution of the MIP models are introduced. Numerical results are presented.     

货物尺寸相同的2维装箱问题的等价类(英文)

在生产与储运领域,把小长方体货物（盒子）装入大长方体箱子是一项重要的工作.本文涉及的问题是:把相同尺寸（a×b×c）的盒子装到一个箱子X×Y×Z中,使所装入箱子的盒子数量为最大.由于某些条件的限止,有时要求货物只能按一个重力方向进行装箱,从而使装箱问题变为把尺寸相同的2维盒子（a×b）填装到一个2维箱子X×Y中.本文讨论当盒子尺寸（a×b包括 b×a）给定,箱子尺寸充分大时,在本文所给的等价意义下,共有多少种互不等价的箱子X×Y.     

Packing into the smallest square: Worst-case analysis of lower bounds

We address the problem of packing a given set of rectangles into the minimum size square. We consider three versions of the problem, arising when the rectangles (i) are squares; (ii) have a fixed orientation; (iii) can be rotated by 90. For each case we study lower bounds, and analyze their worst-case performance ratio. In addition, we evaluate through computational experiments their average performance on instances from the literature.     

Exact algorithms for the two-dimensional strip packing problem with and without rotations

We propose exact algorithms for the two-dimensional strip packing problem (2SP) with and without 90° rotations. We first focus on the perfect packing problem (PP), which is a special case of 2SP, wherein all given rectangles are required to be packed without wasted space, and design branch-and-bound algorithms introducing several branching rules and bounding operations. A combination of these rules yields an algorithm that is especially efficient for feasible instances of PP. We then propose several methods of applying the PP algorithms to 2SP. Our algorithms succeed in efficiently solving benchmark instances of PP with up to 500 rectangles and those of 2SP with up to 200 rectangles. They are often faster than existing exact algorithms specially tailored for problems without rotations.     

Counting dissections into integral squares

A squared rectangle is a rectangle dissected into squares. Similarly a rectangled rectangle is a rectangle dissected into rectangles. The classic paper ‘The dissection of rectangles into squares’ of Brooks, Smith, Stone and Tutte described a beautiful connection between squared rectangles and harmonic functions. In this paper we count dissections of a rectangle into a set of integral squares or a set of integral rectangles. Here, some squares and rectangles may have the same size. We introduce a method involving a recurrence relation of large sized matrices to enumerate squared and rectangled rectangles of a given sized rectangle and propose the asymptotic behavior of their growth rates.     

An effective recursive partitioning approach for the packing of identical rectangles in a rectangle

In this work, we deal with the problem of packing (orthogonally and without overlapping) identical rectangles in a rectangle. This problem appears in different logistics settings, such as the loading of boxes on pallets, the arrangements of pallets in trucks and the stowing of cargo in ships. We present a recursive partitioning approach combining improved versions of a recursive five-block heuristic and an L-approach for packing rectangles into larger rectangles and L-shaped pieces. The combined approach is able to rapidly find the optimal solutions of all instances of the pallet loading problem sets Cover I and II (more than 50?000 instances). It is also effective for solving the instances of problem set Cover III (almost 100?000 instances) and practical examples of a woodpulp stowage problem, if compared to other methods from the literature. Some theoretical results are also discussed and, based on them, efficient computer implementations are introduced. The computer implementation and the data sets are available for benchmarking purposes.     

Nonisomorphic complete sets of F-rectangles with prime power dimensions

A technique for constructing nonisomorphic complete sets of frequency rectangles with prime power dimensions is described. This procedure is used to establish a conservative general lower bound for the number of possible nonisomorphic complete sets of frequency rectangles of prime power order. Several cases are considered in detail which improve the lower bound for those orders. The technique can also be applied to the construction of inequivalent orthogonal arrays of strength 2.     

Facet bending driven by the planar crystalline curvature with a generic nonuniform forcing term

We study crystalline driven curvature flow with spatially nonuniform driving force term. We assume special monotonicity properties of the driving term, which are motivated by our previous work on Berg's effect. We consider special initial data which we call ‘bent rectangles.’ We prove existence of solutions for a generic forcing term as well as generic subclass of bent rectangles. We show the initially flat facets may begin to bend, provided, loosely speaking, they are too large. Moreover, depending on the initial configuration we notice instantaneous loss of regularity of the moving curve.     

Decay of solutions for 2D Navier–Stokes equations posed on Lipschitz and smooth bounded and unbounded domains

Initial–boundary value problems for 2D Navier–Stokes equations posed on bounded and unbounded rectangles as well as on bounded and unbounded smooth domains were considered. The existence and uniqueness of regular global solutions in bounded rectangles and bounded smooth domains as well as exponential decay of solutions on bounded and unbounded domains were established.     

Cutting Polygons Composed of Equal Rectangles into Similar Rectangles

Mathematical Notes - Assume that a polygon is composed of equal rectangles. We find all quadratic irrationalities $$r$$ for which the polygon under study can be cut into similar rectangles with...