11,986 research outputs found
On Limits of Dense Packing of Equal Spheres in a Cube
We examine packing of congruent spheres in a cube when is close but
less than the number of spheres in a regular cubic close-packed (ccp)
arrangement of spheres. For this family of packings, the
previous best-known arrangements were usually derived from a ccp by omission of
a certain number of spheres without changing the initial structure. In this
paper, we show that better arrangements exist for all . We introduce an optimization method to reveal improvements of
these packings, and present many new improvements for
Effective retrieval and new indexing method for case based reasoning: Application in chemical process design
In this paper we try to improve the retrieval step for case based reasoning for preliminary design. This improvement deals with three major parts of our CBR system. First, in the preliminary design step, some uncertainties like imprecise or unknown values remain in the description of the problem, because they need a deeper analysis to be withdrawn. To deal with this issue, the faced problem description is soften with the fuzzy sets theory. Features are described with a central value, a percentage of imprecision and a relation with respect to the central value. These additional data allow us to build a domain of possible values for each attributes. With this representation, the calculation of the similarity function is impacted, thus the characteristic function is used to calculate the local similarity between two features. Second, we focus our attention on the main goal of the retrieve step in CBR to find relevant cases for adaptation. In this second part, we discuss the assumption of similarity to find the more appropriated case. We put in highlight that in some situations this classical similarity must be improved with further knowledge to facilitate case adaptation. To avoid failure during the adaptation step, we implement a method that couples similarity measurement with adaptability one, in order to approximate the cases utility more accurately. The latter gives deeper information for the reusing of cases. In a last part, we present a generic indexing technique for the base, and a new algorithm for the research of relevant cases in the memory. The sphere indexing algorithm is a domain independent index that has performances equivalent to the decision tree ones. But its main strength is that it puts the current problem in the center of the research area avoiding boundaries issues. All these points are discussed and exemplified through the preliminary design of a chemical engineering unit operation
Recommended from our members
Some applications of continuous variable neighbourhood search metaheuristic (mathematical modelling)
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In the real world, many problems are continuous in nature. In some cases, finding the global solutions for these problems is di±cult. The reason is that the problem's objective function is non convex, nor concave and even not differentiable. Tackling these problems is often computationally too expensive. Although the development in computer technologies are increasing the speed of computations, this often is not adequate, particularly if the size of the problem's instance are large. Applying exact methods on some problems may necessitate their linearisation. Several new ideas using heuristic approaches have been considered particularly since they tackle the problems within reasonable computational time and give an approximate solution. In this thesis, the variable neighbourhood search (VNS) metaheuristic (the framework for building heuristic) has been considered. Two variants of variable neighbourhood search
metaheuristic have been developed, continuous variable neighbourhood search and reformulation descent variable neighbourhood search. The GLOB-VNS software (Drazic et al., 2006) hybridises the Microsoft Visual Studio C++ solver with variable neighbourhood search metaheuristics. It has been used as a starting point for this research and then adapted and modified for problems studied in this thesis. In fact, two problems have been considered, censored quantile regression and the circle packing problem. The results of this approach for censored quantile regression outperforms other methods described in the literature, and the near-optimal solutions are obtained in short running computational time. In addition, the reformulation descent variable neighbourhood search variant in solving circle packing problems is developed and the computational results are provided
Evaluating the performance of microstructure generation algorithms for 2-D foam-like representative volume elements
This investigation evaluates various numerical algorithms; each designed to generate periodic 2-D Representative Volume Elements (RVEs) containing foam-like microstructures suitable for direct import into commercial finite element software for mechanical evaluation. The operation of each algorithm is discussed and the resulting RVEs are examined from both a mechanical and a morphological perspective. A basic Voronoi-based algorithm is found to be simple to implement but the method is shown to produce inherently anisotropic microstructures. Increasing the degree of irregularity of the microstructure reduces the anisotropy but at the cost of creating unrealistic microstructures, containing highly angular cells. A method of modifying such unrealistic microstructures using a centroidal tessellation relaxation algorithm is demonstrated, ultimately producing RVEs with relatively realistic mono-disperse microstructures. An alternative algorithm is also investigated the advantage of this algorithm is its ability to generate poly-disperse microstructures, with a controllable degree of poly-dispersity and an almost fully isotropic mechanical response
- …