On a Two-Dimensional Search Problem

In this article we explore the so-called two-dimensional tree− search problem. We prove that for integers m of the form m = (2^(st) − 1)/(2^s − 1) the rectangles A(m, n) are all tight, no matter what n is. On the other hand, we prove that there exist infinitely many integers m for which there is an infinite number of n’s such that A(m, n) is loose. Furthermore, we determine the smallest loose rectangle as well as the smallest loose square (A(181, 181)). It is still undecided whether there exist infinitely many loose squares.

Exact solutions for the agricultural and the two-dimensional packing problems

Objectives and study method: The objective of this study is to develop exact algorithms that can be used as management tools for the agricultural production planning and to obtain exact solutions for two of the most well known twodimensional packing problems: the strip packing problem and the bin packing problem. For the agricultural production planning problem we propose a new hierarchical scheme of three stages to improve the current agricultural practices. The objective of the first stage is to delineate rectangular and homogeneous management zones into the farmer’s plots considering the physical and chemical soil properties. This is an important task because the soil properties directly affect the agricultural production planning. The methodology for this stage is based on a new method called “Positions and Covering” that first generates all the possible positions in which the plot can be delineated. Then, we use a mathematical model of linear programming to obtain the optimal physical and chemical management zone delineation of the plot. In the second stage the objective is to determine the optimal crop pattern that maximizes the farmer’s profit taken into account the previous management zones delineation. In this case, the crop pattern is affected by both management zones delineation, physical and chemical. A mixed integer linear programming is used to solve this stage. The objective of the last stage is to determine in real-time the amount of water to irrigate in each crop. This stage takes as input the solution of the crop planning stage, the atmospheric conditions (temperature, radiation, etc.), the humidity level in plots, and the physical management zones of plots, just to name a few. This procedure is made in real-time during each irrigation period. A linear programming is used to solve this problem. A breakthrough happen when we realize that we could propose some adaptations of the P&C methodology to obtain optimal solutions for the two-dimensional packing problem and the strip packing. We empirically show that our methodologies are efficient on instances based on real data for both problems: agricultural and two-dimensional packing problems. Contributions and conclusions: The exact algorithms showed in this study can be used in the making-decision support for agricultural planning and twodimensional packing problems. For the agricultural planning problem, we show that the implementation of the new hierarchical approach can improve the farmer profit between 5.27% until 8.21% through the optimization of the natural resources. An important characteristic of this problem is that the soil properties (physical and chemical) and the real-time factors (climate, humidity level, evapotranspiration, etc.) are incorporated. With respect to the two-dimensional packing problems, one of the main contributions of this study is the fact that we have demonstrate that many of the best solutions founded in literature by others approaches (heuristics approaches) are the optimal solutions. This is very important because some of these solutions were up to now not guarantee to be the optimal solutions.

Solutions of a two-dimensional dam-break problem

Solutions of a two-dimensional dam break problem are presented for two tailwater/reservoir height ratios. The numerical scheme used is an extension of one previously given by the author [J. Hyd. Res. 26(3), 293–306 (1988)], and is based on numerical characteristic decomposition. Thus approximate solutions are obtained via linearised problems, and the method of upwind differencing is used for the resulting scalar problems, together with a flux limiter for obtaining a second order scheme which avoids non-physical, spurious oscillations.

In-depth search focused on furans, lactones, volatile phenols, and acetals as potential age markers of Madeira wines by comprehensive two-dimensional gas chromatography with time-of-flight mass spectrometry combined with solid phase microextraction

The establishment of potential age markers of Madeira wine is of paramount significance as it may contribute to detect frauds and to ensure the authenticity of wine. Considering the chemical groups of furans, lactones, volatile phenols, and acetals, 103 volatile compounds were tentatively identified; among these, 71 have been reported for the first time in Madeira wines. The chemical groups that could be used as potential age markers were predominantly acetals, namely, diethoxymethane, 1,1-diethoxyethane, 1,1-diethoxy-2-methyl-propane, 1-(1-ethoxyethoxy)-pentane, trans-dioxane and 2-propyl-1,3-dioxolane, and from the other chemical groups, 5-methylfurfural and cis-oak-lactone, independently of the variety and the type of wine. GC × GC-ToFMS system offers a more useful approach to identify these compounds compared to previous studies using GC−qMS, due to the orthogonal systems, that reduce coelution, increase peak capacity and mass selectivity, contributing to the establishment of new potential Madeira wine age markers. Remarkable results were also obtained in terms of compound identification based on the organized structure of the peaks of structurally related compounds in the GC × GC peak apex plots. This information represents a valuable approach for future studies, as the ordered-structure principle can considerably help the establishment of the composition of samples. This new approach provides data that can be extended to determine age markers of other types of wines.

Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm

In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer's pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. The method is able to find the optimal cutting pattern of a large number of pro blem instances of moderate sizes known in the literature and a counterexample for which the approach fails to find known optimal solutions was not found. For the instances that the required computer runtime is excessive, the approach is combined with simple heuristics to reduce its running time. Detailed numerical experiments show the reliability of the method. Journal of the Operational Research Society (2012) 63, 183-200. doi: 10.1057/jors.2011.6 Published online 17 August 2011

Two-Dimensional Bin Packing Problem with Guillotine Restrictions

This thesis, after presenting recent advances obtained for the two-dimensional bin packing problem, focuses on the case where guillotine restrictions are imposed. A mathematical characterization of non-guillotine patterns is provided and the relation between the solution value of the two-dimensional problem with guillotine restrictions and the two-dimensional problem unrestricted is being studied from a worst-case perspective. Finally it presents a new heuristic algorithm, for the two-dimensional problem with guillotine restrictions, based on partial enumeration, and computationally evaluates its performance on a large set of instances from the literature. Computational experiments show that the algorithm is able to produce proven optimal solutions for a large number of problems, and gives a tight approximation of the optimum in the remaining cases.

Two dimensional analysis of inflatable structures by the positional FEM

This paper presents a, simple two dimensional frame formulation to deal with structures undergoing large motions due to dynamic actions including very thin inflatable structures, balloons. The proposed methodology is based on the minimum potential energy theorem written regarding nodal positions. Velocity, acceleration and strain are achieved directly from positions, not. displacements, characterizing the novelty of the proposed technique. A non-dimensional space is created and the deformation function (change of configuration) is written following two independent mappings from which the strain energy function is written. The classical New-mark equations are used to integrate time. Dumping and non-conservative forces are introduced into the mechanical system by a rheonomic energy function. The final formulation has the advantage of being simple and easy to teach, when compared to classical Counterparts. The behavior of a bench-mark problem (spin-up maneuver) is solved to prove the formulation regarding high circumferential speed applications. Other examples are dedicated to inflatable and very thin structures, in order to test the formulation for further analysis of three dimensional balloons.

Two-dimensional supersonic nonlinear Schrodinger flow past an extended obstacle

Supersonic flow of a superfluid past a slender impenetrable macroscopic obstacle is studied in the framework of the two-dimensional (2D) defocusing nonlinear Schroumldinger (NLS) equation. This problem is of fundamental importance as a dispersive analog of the corresponding classical gas-dynamics problem. Assuming the oncoming flow speed is sufficiently high, we asymptotically reduce the original boundary-value problem for a steady flow past a slender body to the one-dimensional dispersive piston problem described by the nonstationary NLS equation, in which the role of time is played by the stretched x coordinate and the piston motion curve is defined by the spatial body profile. Two steady oblique spatial dispersive shock waves (DSWs) spreading from the pointed ends of the body are generated in both half planes. These are described analytically by constructing appropriate exact solutions of the Whitham modulation equations for the front DSW and by using a generalized Bohr-Sommerfeld quantization rule for the oblique dark soliton fan in the rear DSW. We propose an extension of the traditional modulation description of DSWs to include the linear ""ship-wave"" pattern forming outside the nonlinear modulation region of the front DSW. Our analytic results are supported by direct 2D unsteady numerical simulations and are relevant to recent experiments on Bose-Einstein condensates freely expanding past obstacles.

Inverse analysis FOR two-dimensional structures using the boundary element method

Inverse analysis is currently an important subject of study in several fields of science and engineering. The identification of physical and geometric parameters using experimental measurements is required in many applications. In this work a boundary element formulation to identify boundary and interface values as well as material properties is proposed. In particular the proposed formulation is dedicated to identifying material parameters when a cohesive crack model is assumed for 2D problems. A computer code is developed and implemented using the BEM multi-region technique and regularisation methods to perform the inverse analysis. Several examples are shown to demonstrate the efficiency of the proposed model. (C) 2010 Elsevier Ltd. All rights reserved,

Two-dimensional balanced sampling plans excluding contiguous units

A balanced sampling plan excluding contiguous units (or BSEC for short) was first introduced by Hedayat, Rao and Stufken in 1988. These designs can be used for survey sampling when the units are arranged in one-dimensional ordering and the contiguous units in this ordering provide similar information. In this paper, we generalize the concept of a BSEC to the two-dimensional situation and give constructions of two-dimensional BSECs with block size 3. The existence problem is completely solved in the case where lambda = 1.

Recent misconceptions about the "database search problem": a probabilistic analysis using Bayesian networks

This paper analyses and discusses arguments that emerge from a recent discussion about the proper assessment of the evidential value of correspondences observed between the characteristics of a crime stain and those of a sample from a suspect when (i) this latter individual is found as a result of a database search and (ii) remaining database members are excluded as potential sources (because of different analytical characteristics). Using a graphical probability approach (i.e., Bayesian networks), the paper here intends to clarify that there is no need to (i) introduce a correction factor equal to the size of the searched database (i.e., to reduce a likelihood ratio), nor to (ii) adopt a propositional level not directly related to the suspect matching the crime stain (i.e., a proposition of the kind 'some person in (outside) the database is the source of the crime stain' rather than 'the suspect (some other person) is the source of the crime stain'). The present research thus confirms existing literature on the topic that has repeatedly demonstrated that the latter two requirements (i) and (ii) should not be a cause of concern.

Recent misconceptions about the "database search problem": a probabilistic analysis using Bayesian networks

This paper analyses and discusses arguments that emerge from a recent discussion about the proper assessment of the evidential value of correspondences observed between the characteristics of a crime stain and those of a sample from a suspect when (i) this latter individual is found as a result of a database search and (ii) remaining database members are excluded as potential sources (because of different analytical characteristics). Using a graphical probability approach (i.e., Bayesian networks), the paper here intends to clarify that there is no need to (i) introduce a correction factor equal to the size of the searched database (i.e., to reduce a likelihood ratio), nor to (ii) adopt a propositional level not directly related to the suspect matching the crime stain (i.e., a proposition of the kind 'some person in (outside) the database is the source of the crime stain' rather than 'the suspect (some other person) is the source of the crime stain'). The present research thus confirms existing literature on the topic that has repeatedly demonstrated that the latter two requirements (i) and (ii) should not be a cause of concern.

Methods for the analysis of two dimensional measurement data of paper web

This work is devoted to the problem of reconstructing the basis weight structure at paper web with black{box techniques. The data that is analyzed comes from a real paper machine and is collected by an o®-line scanner. The principal mathematical tool used in this work is Autoregressive Moving Average (ARMA) modelling. When coupled with the Discrete Fourier Transform (DFT), it gives a very flexible and interesting tool for analyzing properties of the paper web. Both ARMA and DFT are independently used to represent the given signal in a simplified version of our algorithm, but the final goal is to combine the two together. Ljung-Box Q-statistic lack-of-fit test combined with the Root Mean Squared Error coefficient gives a tool to separate significant signals from noise.

Two-dimensional probabilistic inversion of plane-wave electromagnetic data: Methodology, model constraints and joint inversion with electrical resistivity data

Probabilistic inversion methods based on Markov chain Monte Carlo (MCMC) simulation are well suited to quantify parameter and model uncertainty of nonlinear inverse problems. Yet, application of such methods to CPU-intensive forward models can be a daunting task, particularly if the parameter space is high dimensional. Here, we present a 2-D pixel-based MCMC inversion of plane-wave electromagnetic (EM) data. Using synthetic data, we investigate how model parameter uncertainty depends on model structure constraints using different norms of the likelihood function and the model constraints, and study the added benefits of joint inversion of EM and electrical resistivity tomography (ERT) data. Our results demonstrate that model structure constraints are necessary to stabilize the MCMC inversion results of a highly discretized model. These constraints decrease model parameter uncertainty and facilitate model interpretation. A drawback is that these constraints may lead to posterior distributions that do not fully include the true underlying model, because some of its features exhibit a low sensitivity to the EM data, and hence are difficult to resolve. This problem can be partly mitigated if the plane-wave EM data is augmented with ERT observations. The hierarchical Bayesian inverse formulation introduced and used herein is able to successfully recover the probabilistic properties of the measurement data errors and a model regularization weight. Application of the proposed inversion methodology to field data from an aquifer demonstrates that the posterior mean model realization is very similar to that derived from a deterministic inversion with similar model constraints.

Some defects in two-dimensional spin-1/2 Heisenberg antiferromagnets: a numerical study of magnetic effects

En del av de intressantaste fenomenen inom dagens materialfysik uppstår ur ett intrikat samspel mellan myriader av elektroner. Högtemperatursupraledare är det mest berömda exemplet. Varken klassiska teorier eller modeller där elektronerna är oberoende av varandra kan förklara de häpnadsväckande effekterna i de starkt korrelerade elektronsystemen. I vissa kopparoxider, till exempel La2CuO4, är det känt att valenselektronerna till följd av en stark ömsesidig växelverkan lokaliseras en och en till kopparatomerna i föreningens CuO2 plan. Laddningarnas inneboende magnetiska moment—spinnet—får då en avgörande roll för materialets elektriska och magnetiska egenskaper, vilka i exemplets fall kan beskrivas med Heisenbergmodellen som är den grundläggande teoretiska modellen för mikroskopisk magnetism. Men exakt varför föreningarna kan bli supraledande då de dopas med överskottsladdningar är än så länge en obesvarad fråga. Min avhandling undersöker orenheters inverkan på Heisenbergmodellens magnetiska egenskaper—ett problem av både experimentell och teoretisk relevans. En etablerad numerisk metod har använts—en kvantmekanisk Monte Carlo teknik—för att utföra omfattande datorsimuleringar av den matematiska modellen på två dedikerade Linux datorkluster. Arbetet hör till området beräkningsfysik. De teoretiska modellerna för starkt korrelerade elektronsystem, däribland Heisenbergmodellen, är ytterst invecklade matematiskt sett och de kan inte lösas exakt. Analytiska utredningar bygger för det mesta på antaganden och förenklingar vars inverkningar på slutresultatet är ofta oklara. I det avseende kan numeriska studier vara exakta, det vill säga de kan behandla modellerna som de är. Oftast behövs bägge tillvägagångssätten. Den röda tråden i arbetet har varit att numeriskt testa vissa högaktuella analytiska förutsägelser rörande effekterna av orenheter i Heisenbergmodellen. En del av dem har vi på basen av mycket noggranna data kunnat bekräfta. Men våra resultat har också påvisat felaktigheter i de analytiska prognoserna som sedermera delvis reviderats. En del av avhandlingens numeriska upptäckter har i sin tur stimulerat till helt nya teoretiska studier.