Crystal structures of anhydrous pinacol, the hexagonal pinacol, pinacol monohydrate, and pinacol hexahydrate were studied. In all the structures crystal packing is unusual and complicated. The origin of the complexity may be the difficulty in filling space densely and while also satisfying the H-bonding requirements when the molecule has few internal degrees of freedom. Five 15-crown-5 complexes of M(NO3)2 (M = Cu, Zn, Mg, Co, Mn) were synthesized and characterized using X-ray diffraction and differential scanning calorimetry. The system is rich in polymorphs. Nine definite solid-state phases were identified. More phases probably exist in the solid state at temperatures slightly above the room temperature. Most phase transformations in this system take place in single crystals without the loss of crystallinity. The nine phases crystallize in five crystal structures. The crown ether ligands have very similar conformation in all the structures. The asymmetric units in all the structures are complicated and pseudosymmetric, which is the consequence of the presence of the packing problem. The origin of the packing problem that leads to the complicated phase behavior is the odd number of -CH2-O-CH2- units in the crown ether ligand.

Code obfuscation techniques are increasingly being used in software for such reasons as protecting trade secret algorithms from competitors and deterring license tampering by those wishing to use the software for free. However, these techniques have also grown in popularity in less legitimate areas, such as protecting malware from detection and reverse engineering. This work examines two such techniques - packing and virtualization-obfuscation - and presents new behavioral approaches to analysis that may be relevant to security analysts whose job it is to defend against malicious code. These approaches are robust against variations in obfuscation algorithms, such as changing encryption keys or virtual instruction byte code.Packing refers to the process of encrypting or compressing an executable file. This process "scrambles" the bytes of the executable so that byte-signature matching algorithms commonly used by anti-virus programs are ineffective. Standard static analysis techniques are similarly ineffective since the actual byte code of the program is hidden until after the program is executed. Dynamic analysis approaches exist, but are vulnerable to dynamic defenses. We detail a static analysis technique that starts by identifying the code used to "unpack" the executable, then uses this unpacker to generate the unpacked code in a form suitable for static analysis. Results show we are able to correctly unpack several encrypted and compressed malware, while still handling several dynamic defenses.Virtualization-obfuscation is a technique that translates the original program into virtual instructions, then builds a customized virtual machine for these instructions. As with packing, the byte-signature of the original program is destroyed. Furthermore, static analysis of the obfuscated program reveals only the structure of the virtual machine, and dynamic analysis produces a dynamic trace where original program instructions are intermixed, and often indistinguishable from, virtual machine instructions. We present a dynamic analysis approach whereby all instructions that affect the external behavior of the program are identified, thus building an approximation of the original program that is observationally equivalent. We achieve good results at both identifying instructions from the original program, as well as eliminating instructions known to be part of the virtual machine.

No description available.

This thesis investigates the constant pressure cake filtration of interacting cellulose fibre/TiO2 (rutile) mixtures, and involved experimental studies using an automated pressure filtration apparatus. The influence of suspension composition, filtration pressure and solution environment on filtration has been discussed in relation to cake properties such as average cake porosity and specific resistance. To help interpret the filtration results, sedimentation data were also obtained. The average porosities of filter cakes formed from pure rutile and fibre suspensions in deionised water were approximately 0.6 and 0.75, respectively, and a steady and progressive increase in porosity with fibre fraction was generally observed. With filtrations at 450 kPa, the average specific cake resistances for pure fibre and rutile in deionised water were approximately 9.4x1013 and 4.2x1012 m kg-1 respectively, with the variation of specific resistance with solids composition showing a minimum. Similar trends were observed at other tested filtration pressures with suspensions in deionised water but not with filtrations of suspensions in 0.2 M NaCl and 0.1 M CaCl2 solutions. The minima in average specific cake resistance with solids composition for feeds in deionised water was attributed to rutile-fibre interactions. Abrupt transitions in cake structure were evident part way through some filtrations, and resulted in unexpected filtrate flow behaviour. This is an interesting phenomenon, and not only were the changes in cake structure relatively reproducible, but also the nature of the change could be altered by changes in filtration pressure, solids composition and/or solution environment. The study of fibre/particle binary filtration behaviour, in particular the porosity and specific cake resistance trends, were substantiated by relevant theoretical treatment and modelling analysis. With the porosity trends, an additive porosity concept seemed to represent the data better than interparticle penetration models. With the specific cake resistance trends, a semi-empirical equation was proposed which appeared to represent a wide range of binary mixture filtration data. A mathematical framework was also developed in an attempt to understand the underlying physical mechanisms which led to filter cake restructuring, and possible explanations were postulated.

In real world applications such as the transporting of goods products, packing is a major issue. Goods products need to be packed such that the smallest space is wasted to achieve the maximum transportation efficiency. Packing becomes more challenging and complex when the product is circular/spherical. This thesis focuses on the best way to pack three-dimensional unit spheres into the smallest spherical and cubical space. Unit spheres are considered in lieu of non-identical spheres because the search mechanisms are more difficult in the latter set up and any improvements will be due to the search mechanism not to the ordering of the spheres. The two-unit sphere packing problems are solved by approximately using a variable neighborhood search (VNS) hybrid heuristic. A general search framework belonging to the Artificial Intelligence domain, the VNS offers a diversification of the search space by changing neighborhood structures and intensification by thoroughly investigating each neighborhood. It is exible, easy to implement, adaptable to both continuous and discrete optimization problems and has been use to solve a variety of problems including large-sized real-life problems. Its runtime is usually lower than other meta heuristic techniques. A tutorial on the VNS and its variants along with recent applications and areas of applicability of each variant. Subsequently, this thesis considers several variations of VNS heuristics for the two problems at hand, discusses their individual efficiencies and effectiveness, their convergence rates and studies their robustness. It highlights the importance of the hybridization which yields near global optima with high precision and accuracy, improving many best- known solutions indicate matching some, and improving the precision and accuracy of others. Keywords: variable neighborhood search, sphere packing, three-dimensional packing, meta heuristic, hybrid heuristics, multiple start heuristics.

This thesis concerns dimensions and projections of sets that could be described as fractals. The background is applied problems regarding analysis of human tissue. One way to characterize such complicated structures is to estimate the dimension. The existence of different types of dimensions makes it important to know about their properties and relations to each other. Furthermore, since medical images often are constructed by x-ray, it is natural to study projections. This thesis consists of an introduction and a summary, followed by three papers. Paper I, Anders Nilsson, Dimensions and Projections: An Overview and Relevant Examples, 2006. Manuscript. Paper II, Anders Nilsson and Peter Wingren, Homogeneity and Non-coincidence of Hausdorff- and Box Dimensions for Subsets of ℝn, 2006. Submitted. Paper III, Anders Nilsson and Fredrik Georgsson, Projective Properties of Fractal Sets, 2006. To be published in Chaos, Solitons and Fractals. The first paper is an overview of dimensions and projections, together with illustrative examples constructed by the author. Some of the most frequently used types of dimensions are defined, i.e. Hausdorff dimension, lower and upper box dimension, and packing dimension. Some of their properties are shown, and how they are related to each other. Furthermore, theoretical results concerning projections are presented, as well as a computer experiment involving projections and estimations of box dimension. The second paper concerns sets for which different types of dimensions give different values. Given three arbitrary and different numbers in (0,n), a compact set in ℝn is constructed with these numbers as its Hausdorff dimension, lower box dimension and upper box dimension. Most important in this construction, is that the resulted set is homogeneous in the sense that these dimension properties also hold for every non-empty and relatively open subset. The third paper is about sets in space and their projections onto planes. Connections between the dimensions of the orthogonal projections and the dimension of the original set are discussed, as well as the connection between orthogonal projection and the type of projection corresponding to realistic x-ray. It is shown that the estimated box dimension of the orthogonal projected set and the realistic projected set can, for all practical purposes, be considered equal.

The container loading problem considered in this thesis is to determine placements of a set of packages within one or multiple shipping containers. Smaller packages are consolidated on pallets prior to being loaded in the shipping containers together with larger packages. There are multiple objectives which may be summarized as fitting all the packages while achieving good stability of the cargo as well as the shipping containers themselves. According to recent literature reviews, previous research in the field have to large extent been neglecting issues relevant in practice. Our real-world application was developed for the industrial company Atlas Copco to be used for sea container shipments at their Distribution Center (DC) in Texas, USA. Hence all applicable practical constraints faced by the DC operators had to be treated properly. A high variety in sizes, weights and other attributes such as stackability among packages added complexity to an already challenging combinatorial problem. Inspired by how the DC operators plan and perform loading manually, the batch concept was developed, which refers to grouping of boxes based on their characteristics and solving subproblems in terms of partial load plans. In each batch, an extensive placement heuristic and a load plan evaluation run iteratively, guided by a Genetic Algorithm (GA). In the placement heuristic, potential placements are evaluated using a scoring function considering aspects of the current situation, such as space utilization, horizontal support and heavier boxes closer to the floor. The scoring function is weighted by coefficients corresponding to the chromosomes of an individual in the GA population. Consequently, the fitness value of an individual in the GA population is the rating of a load plan. The loading optimization software has been tested and successfully implemented at the DC in Texas. The software has been proven capable of generating satisfactory load plans within acceptable computation times, which has resulted in reduced uncertainty and labor usage in the loading process. Analysis using real sea container shipments shows that the GA is able to tune the scoring coefficients to suit the particular problem instance being solved.

This thesis studies the open problem of packing rectangles. Is it possible to pack rectangles with dimensions 1/n x 1/(n+1) into a unit square? The aim of this thesis is analysis of the problem and the related algorithm. Attention will be focused mainly on the implementation of this algorithm and on study of its functioning. Powered by TCPDF (www.tcpdf.org)

O presente trabalho teve como objetivo estudar o controle do tripes (Thysanoptera) na cultura da bananeira (Musa sp), utilizando a proteção do cacho com sacos plásticos associados ou não com uso de inseticida, no momento da emissão da inflorescência e 15 dias após a emissão, fase em que o cacho apresenta as pencas formadas. O delineamento experimental utilizado foi o inteiramente casualizado, com oito tratamentos e cinco repetições. Foram instalados dois experimentos, sendo o primeiro de julho a novembro de 2009, e o segundo de novembro de 2009 a fevereiro de 2010. As avaliações foram feitas quinze dias após a emissão da inflorescência e no estádio de ponto de colheita dos frutos, quantificando os sintomas de tripes na segunda, quinta e penúltima pencas do cacho. Para o tripes da erupção foram verificados os sintomas existentes numa área de circulo de 2,85cm2 de cada fruto, e para o tripes da ferrugem foram avaliados a porcentagem dos sintomas existente na área do fruto mais atacado da penca. No primeiro experimento, realizado em temperaturas mais amenas ocorreu menor incidência de pragas, sendo que para tripes da ferrugem foi insignificante e para tripes da erupção os melhores tratamentos foram os que iniciaram a proteção na emissão da inflorescência com sacos plásticos e produtos químicos O segundo experimento, conduzido em época com temperaturas mais elevadas e maior precipitação pluvial, apresentou maior incidência do tripes e os melhores tratamentos para ambos os tipos de tripes foram também os que utilizaram a proteção com sacos plásticos e produtos químicos na emissão da inflorescência. Conclui-se que a proteção com saco plástico associado às diferentes formas de aplicação de inseticida na fase da emissão da inflorescência promove o melhor controle do tripes da erupção e da ferrugem, e a incidência do tripes varia de acordo com a época do ano, ocorrendo maiores ataques em épocas com temperaturas mais elevadas. / This work consisted in study the control of thrips (Thysanoptera) in banana (Musa sp), using the protection of the bunch with plastic bags or not associated with the use of insecticide at the time of issuance of the inflorescence and 15 days after issue stage in the bunch has the bunches formed. The experiment was a completely randomized design with eight treatments and five replications. Two experiments were established, the first being from July to November 2009 and November 2009 to February 2010. The assessments were made fifteen days after issuance of the inflorescence and at the stage of fruit harvest point, quantifying the symptoms of thrips in the second, fifth and penultimate bunches of grapes. For eruption thrips of existing symptoms were observed in an area of a circle of 2.85 cm2 of each fruit, and for rust thrips, the percentage of symptoms existing in the area of wholesale fruit bunch more. In the first experiment, carried out in milder temperatures occurred less incidence of pests, and for rust thrips was negligible and eruption thrips of the best treatments were those who started the issue of protection in the inflorescences with plastic bags and chemicals. The second experiment, which was conducted at higher temperatures and increased rainfall, higher incidence of thrips and better treatments for both types of thrips were also those who had used protection with plastic bags and chemicals in the issuance of the inflorescence. It is concluded that the protection associated with plastic bags for various forms of insecticide application at the stage of inflorescence emission promotes better control of rust thrips and of eruption thrips, and the incidence of thrips varies with the seasons, occurring more attacks in periods with higher temperatures.

O empacotamento irregular de fita é um grupo de problemas na área de corte e empacotamento, cuja aplicação é observada nas indústrias têxtil, moveleira e construção naval. O problema consiste em definir uma configuração de itens irregulares de modo que o comprimento do contêiner retangular que contém o leiaute seja minimizado. A solução deve ser válida, isto é, não deve haver sobreposição entre os itens, que não devem extrapolar as paredes do contêiner. Devido a aspectos práticos, são admitidas até quatro orientações para o item. O volume de material desperdiçado está diretamente relacionado à qualidade do leiaute obtido e, por este motivo, uma solução eficiente pressupõe uma vantagem econômica e resulta em um menor impacto ambiental. O objetivo deste trabalho consiste na geração automática de leiautes de modo a obter níveis de compactação e tempo de processamento compatíveis com outras soluções na literatura. A fim de atingir este objetivo, são realizadas duas propostas de solução. A primeira consiste no posicionamento sequencial dos itens de modo a maximizar a ocorrência de posições de encaixe, que estão relacionadas à restrição de movimento de um item no leiaute. Em linhas gerais, várias sequências de posicionamentos são exploradas com o objetivo de encontrar a solução mais compacta. Na segunda abordagem, que consiste na principal proposta deste trabalho, métodos rasterizados são aplicados para movimentar itens de acordo com uma grade de posicionamento, admitindo sobreposição. O método é baseado na estratégia de minimização de sobreposição, cujo objetivo é a eliminação da sobreposição em um contêiner fechado. Ambos os algoritmos foram testados utilizando o mesmo conjunto de problemas de referência da literatura. Foi verificado que a primeira estratégia não foi capaz de obter soluções satisfatórias, apesar de fornecer informações importantes sobre as propriedades das posições de encaixe. Por outro lado, a segunda abordagem obteve resultados competitivos. O desempenho do algoritmo também foi compatível com outras soluções, inclusive em casos nos quais o volume de dados era alto. Ademais, como trabalho futuro, o algoritmo pode ser estendido de modo a possibilitar a entrada de itens de geometria genérica, o que pode se tornar o grande diferencial da proposta. / Irregular nesting belongs to the area of cutting and packing problems and are employed in the textile, wood and shipbuilding industries. The problem consists in determining a configuration for a set of irregular items which minimizes the length of the rectangular container in which the layout is located. The solution must be feasible, i.e., items must not overlap nor protrude the container walls. Due to practical reasons, up to four orientations are allowed for an item. The volume of wasted material is directly affected by the quality (density) of the layout. Thus, an efficient solution produces a positive economic and environmental impact. In this work, the objective is to automatically obtain layouts such that their density and the performance of the algorithm are competitive with other solutions in literature. So as to achieve this goal, two approaches are proposed. The first method uses a special sequential placement heuristic such that the algorithm maximizes exact placements, which consist of constrained positions for items. In general terms, a search is performed in the placement sequence in order to obtain a compact layout. In the second approach, which is the main subject of this work, raster methods are employed to guide the translation of items, which are free to move within the layout, and may overlap other items. The method is based on overlap minimization techniques, in which the objective is to eliminate the overlap in a fixed dimensions container. Both algorithms were tested using benchmark problems from the literature. The first strategy yielded unsatisfactory results, though it provided important information about the properties of exactly fitting placements. On the other hand, the main approach was able to produce competitive solutions. The performance was also compatible with other solutions, even in cases which the data volume was high. Moreover, as a future work, an extension for the algorithm can be developed such that items with generic geometry can be considered, which would be an important advance in research terms.