Optimization of multiweighing packing proceedings

In this paper we study the variability reduction gain that results from the use of multiweighing proceedings in packing processes with the objective of sales at constant nominal weights. According to this, we have proposed a packing algorithm that includes the formation of units with variable number of pieces and we have obtained the value of the percentage variability reduction index. Collaborator in the Catalan Institute of Tecnology (ICT).     

Maximum principles for discrete-time nonlinear stochastic control systems

In this paper we treat discrete-time stochastic control systems. Using corresponding results for systems, which are linear with respect to the state variables, we derive under convexity assumptions optimality conditions in form of maximum principles     

An infinite family of subcubic graphs with unbounded packing chromatic number

Recently, Balogh et al. (2018) answered in negative the question that was posed in several earlier papers whether the packing chromatic number is bounded in the class of graphs with maximum degree 3. In this note, we present an explicit infinite family of subcubic graphs with unbounded packing chromatic number.     

The reduction method,I

As a further development of the well-known algorithms for deriving theorems of the method of Lyapunov vector functions, this paper suggests the reduction method as a logical technique for formulating hypotheses.     

A reduction approach for solving the rectangle packing area minimization problem

In the rectangle packing area minimization problem (RPAMP) we are given a set of rectangles with known dimensions. We have to determine an arrangement of all rectangles, without overlapping, inside an enveloping rectangle of minimum area. The paper presents a generic approach for solving the RPAMP that is based on two algorithms, one for the 2D Knapsack Problem (KP), and the other for the 2D Strip Packing Problem (SPP). In this way, solving an instance of the RPAMP is reduced to solving multiple SPP and KP instances. A fast constructive heuristic is used as SPP algorithm while the KP algorithm is instantiated by a tree search method and a genetic algorithm alternatively. All these SPP and KP methods have been published previously. Finally, the best variants of the resulting RPAMP heuristics are combined within one procedure. The guillotine cutting condition is always observed as an additional constraint. The approach was tested on 15 well-known RPAMP instances (above all MCNC and GSRC instances) and new best solutions were obtained for 10 instances. The computational effort remains acceptable. Moreover, 24 new benchmark instances are introduced and promising results are reported.     

On set systems with a threshold property

For n,k and t such that 1<t<k<n, a set F of subsets of [n] has the (k,t)-threshold property if every k-subset of [n] contains at least t sets from F and every (k-1)-subset of [n] contains less than t sets from F. The minimal number of sets in a set system with this property is denoted by m(n,k,t). In this paper we determine m(n,4,3)exactly for n sufficiently large, and we show that m(n,k,2) is asymptotically equal to the generalized Turán number T_k-1(n,k,2).     

A modified Gauss-Seidel-algorithm with exclusion of suboptimal actions for A class of semi-Markovian decision problems

In this paper it is shown that a modified Gauss-Seidel-Algorithm with exclusion of suboptimai actions can be used for approximative solving a continuously discounted Semi-Markovian decision problem. Moreover it is proved that the overrelaxation factor of the algorithm introduced in [5] can be improved. If the sojourn times are constant and the overrelaxation factor is independent of states and actions one obtains results of Reetz [6,7] for (discrete) discounted Markovian decision problems. Finally, an example illustrates this method including exclusion of suboptimai actions     

概率空间（Ω，F，μ）中关于μ的packing维数与经典的实直线上的packing维数之间的关系

本文将概率空刚（Ω，μ）中ｐａｃｋｉｎｇ维数的定义与经典的实直线上的ｐａｃｋｉｎｇ维数的定义相联系，证明了在Ｌｅｂｅｓｇｕｅ情形，对所有的Ａ∈，关于μ的ｐａｃｋｉｎｇ维数Ｄｉｍ＿μ（Ａ）与被Ｔａｙｌｏｒ和Ｔｒｉｃｏｔ所定义的ｐａｃｋｉｎｇ维数Ｄｉｍ（Ａ）是一致的。Ｂｉｌｌｉｎｇｓｌｅｙ的结果与我们的结果相结合，表明在Ｌｅｂｅｓｇｕｅ情形，关于μ的分形与被Ｔａｙｌｏｒ所定义的分形是一致的。     

基于一般Ornstein-Uhlenbeck过程的最优log-Sobolev不等式

本文研究了取值于Hilbert空间H且具有唯一不变测度μ的Ornstein-Uhlenbeck过程,利用平稳Gauss过程的log-Sobolev不等式的相关结论,得到了该过程满足log-Sobolev不等式的充分必要条件和最优常数,推广了Gross在对称情形下的结果.     

Optimal spray patterns for counterflow cooling towers with structured packing

In counterflow cooling towers, non-uniform patterns of flow are the consequence of the application of water from circular spray nozzles set in a square manifold. A detailed computational model for the performance of a tower accounting for this non-uniform water flow in cellular packing has been developed. The radial spray pattern of individual nozzles producing the best possible thermal performance was determined by optimization. It was concluded that for a particular nozzle manifold and packing arrangement, a performance limitation exists due to the inherently non-uniform pattern of water flow.     

Computing the asymptotic worst-case of bin packing lower bounds

This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptotic worst-case performance of any lower bound for the problem and to derive for the first time the asymptotic worst-case of the well-known bound L₃ by Martello and Toth. We also show that the general result allows to easily derive the asymptotic worst-case of several lower bounds proposed in the literature.     

Directed 3-cycle decompositions of complete directed graphs with quadratic leaves

Let G be a vertex-disjoint union of directed cycles in the complete directed graph D_t, let |E(G)| be the number of directed edges of G and suppose or if t=5, and if t=6. It is proved in this paper that for each positive integer t, there exist -decompositions for D_t−G if and only if .     

Vibration reduction in ultrasonic machine to external and tuned excitation forces

The dynamic response of mechanical and civil structures subject to high-amplitude vibration is often dangerous and undesirable. Sometimes controlled vibration is desirable as in ultrasonic machining (USM). Ultrasonic machining (USM) is the removal of material by the abrading action of grit-loaded liquid slurry circulating between the workpiece and a tool vibrating perpendicular to the workface at a frequency above the audible range. A high-frequency power source activates a stack of magnetostrictive material, which produces a low-amplitude vibration of the toolholder. This motion is transmitted under light pressure to the slurry, which abrades the workpiece into a conjugate image of the tool form. This can be achieved via passive and active control methods. In this paper, multi-tool techniques are used in the ultrasonic machining via reducing the vibration in the tool holder and providing reasonable amplitudes for the tools represented by the absorbers. The coupling of the tool holder and absorbers simulating ultrasonic cutting process are investigated. This leads to a multi-degree-of-freedom system subject to external and tuned excitation forces. Multiple scale perturbation method is applied to obtain the solution up to the second order approximation. Different resonance cases are reported and studied numerically. The stability of the system is investigated applying both phase-plane and frequency response techniques. The effects of the different parameters of the absorbers on the system behavior are studied numerically. Comparison with the available published work is reported.     

Linear models for the approximate solution of the problem of packing equal circles into a given domain

The linear models for the approximate solution of the problem of packing the maximum number of equal circles of the given radius into a given closed bounded domain G are proposed. We construct a grid in G; the nodes of this grid form a finite set of points T, and it is assumed that the centers of circles to be packed can be placed only at the points of T. The packing problems of equal circles with the centers at the points of T are reduced to 0–1 linear programming problems. A heuristic algorithm for solving the packing problems based on linear models is proposed. This algorithm makes it possible to solve packing problems for arbitrary connected closed bounded domains independently of their shape in a unified manner. Numerical results demonstrating the effectiveness of this approach are presented.     

控制图判断准则的显著性检验

徐哲，段晓江．控制图判断准则的显著性检验．数理统计与管理，１９９８，１７（３），４５～４８．利用控制图判断生产过程的状态是一种统计判断，必然犯两种错误。本文在规定“小概率事件”标准的基础上，对休哈特控制图判断准则假设检验的显著性水平进行了分析，并直观解释了各种异常情况的系统性变化特点，最后简述了计算机辅助质量控制图的应用     

Ore-type conditions implying 2-factors consisting of short cycles

For every graph G, let . The main result of the paper says that every n-vertex graph G with contains each spanning subgraph H all whose components are isomorphic to graphs in . This generalizes the earlier results of Justesen, Enomoto, and Wang, and is a step towards an Ore-type analogue of the Bollobás-Eldridge-Catlin Conjecture.     

Packing cylinders and rectangular parallelepipeds with distances between them into a given region

This paper considers the problem of packing cylinders and parallelepipeds into a given region so that the height of the occupied part of the region is minimal and the distances between each pair of items, and the distance between each packed item and the frontier of the region must be greater than or equal to given distances. A mathematical model of the problem is built and some characteristics of the mathematical model are investigated. Methods for fast construction of starting points, searching for local minima, and a special non-exhaustive search of local minima to obtain good approximations to a global minimum are offered. A numerical example is given. Runtimes to obtain starting points, local minima and approximations to a global minimum are adduced.     

A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints

The two-dimensional loading heterogeneous fleet vehicle routing problem (2L-HFVRP) is a variant of the classical vehicle routing problem in which customers are served by a heterogeneous fleet of vehicles. These vehicles have different capacities, fixed and variable operating costs, length and width in dimension, and two-dimensional loading constraints. The objective of this problem is to minimize transportation cost of designed routes, according to which vehicles are used, to satisfy the customer demand. In this study, we proposed a simulated annealing with heuristic local search (SA_HLS) to solve the problem and the search was then extended with a collection of packing heuristics to solve the loading constraints in 2L-HFVRP. To speed up the search process, a data structure was used to record the information related to loading feasibility. The effectiveness of SA_HLS was tested on benchmark instances derived from the two-dimensional loading vehicle routing problem (2L-CVRP). In addition, the performance of SA_HLS was also compared with three other 2L-CVRP models and four HFVRP methods found in the literature.     

Sets in Abelian groups with distinct sums of pairs

A subset S={s₁,…,sk} of an Abelian group G is called an St-set of size k if all sums of t different elements in S are distinct. Let s(G) denote the cardinality of the largest S₂-set in G. Let v(k) denote the order of the smallest Abelian group for which s(G)?k. In this article, bounds for s(G) are developed and v(k) is determined for k?15 by computing s(G) for Abelian groups of order up to 183 using exhaustive backtrack search with isomorph rejection.