Collision free region determination by modified polygonal Boolean operations

Cutting and packing problems are found in numerous industries such as garment, wood and shipbuilding. The collision free region concept is presented, as it represents all the translations possible for an item to be inserted into a container with already placed items. The often adopted nofit polygon concept and its analogous concept inner fit polygon are used to determine the collision free region. Boolean operations involving nofit polygons and inner fit polygons are used to determine the collision free region. New robust non-regularized Boolean operations algorithm is proposed to determine the collision free region. The algorithm is capable of dealing with degenerated boundaries. This capability is important because degenerated boundaries often represent local optimal placements. A parallelized version of the algorithm is also proposed and tests are performed in order to determine the execution times of both the serial and parallel versions of the algorithm.

Lecture 2 - Java

Programming Overview The JVM (The Java Virtual Machine) A brief look at Structure Class Method Statement Magic incantations main() output Coding a Dog Programming Principle(1) If and Boolean operations Coding a Bank Account Quick look at ToolBox

Análise da transformação do uso da terra, vegetação e impactos ambientais por meio de sensoriamento remoto e geoprocessamento

The mapping of the land use, vegetation and environmental impacts using remote sensing and geoprocessing allows detection, spatial representation and quantifying all alterations due to the human action in the nature, contributing to the monitoring and planning of those activities that cause damages to the environment. The aim of this research is analyze the transformation ocurred with the land use and vegetation in order to detect environmental impacts during the period from 1962 to 1995, considering a test area in the district of Assistência and surroundings, in the Rio Claro (SP) region. In order to archieve such aim the authors used boolean operations available in the Geographical Information System (GIS) - Idrisi. The maps were obtained through the ordinary (conventional) interpretation of aerial photos, later digitized in the software CAD Overlay and georeferenced in AutoCAD Map. It's observed that operations such as crossing digitized maps of one specific area in two differents dates, using GIS, produce overall results that might point out expansion or retraction's trends of the mapped classes, as well as quantify the intensity of the phenomena.

Carta de Aptidão para a implantação de rodovias e avaliação de alternativas de traçado com uso de geotecnologias

This study discuss the use of the geotechnologies to aid the planners on the terrain aptness definition for highways implantation and on the different trace evaluation to the extention of the Governador Carvalho Pinto highway, between Taubaté-SP and Aparecida do Norte-SP. Fratures on the area were mapping using Landsat ETM+, band Pan. In order to elaborate the phisical aptness chart for highway implantation was used the Analitical Hierarchy Process (AHP) operation, in on geographical information system (GIS). Using GIS were realized a ponderate middle with the soils, rocks, relief, slope, fractures and land use/cover maps. Using this physical aptness chart and joinning it with urban and restrict areas (that was inserted by the Boolean operation), were obtained a viability chart for highway implantation. Based on it were proposed three aleatory traces for the Carvalho Pinto highway. This traces were evaluated with the cross tabulation operation. The integration of the restrict areas, land use and phisical aptness in digital media can offer for the planners the cartography of the viability for the highway implantation. The evaliation of these three traces, based on the viability chart, can subsidyse the decision by the planners.

Parallel Layout Construction Algorithm for Irregular Shape Packing Problems

Cutting and packing problems arise in a variety of industries, including garment, wood and shipbuilding. Irregular shape packing is a special case which admits irregular items and is much more complex due to the geometry of items. In order to ensure that items do not overlap and no item from the layout protrudes from the container, the collision free region concept was adopted. It represents all possible translations for a new item to be inserted into a container with already placed items. To construct a feasible layout, collision free region for each item is determined through a sequence of Boolean operations over polygons. In order to improve the speed of the algorithm, a parallel version of the layout construction was proposed and it was applied to a simulated annealing algorithm used to solve bin packing problems. Tests were performed in order to determine the speed improvement of the parallel version over the serial algorithm

Álgebra de mapas de atributos de solos para estimativa da aptidão agrícola das terras.

The land suitability evaluation is used to establish land zonings for agriculture activities. Geographic information systems (GIS) are useful for integrating different attributes necessaries to define apt and not apt lands. The present study had as main objective to describe procedures to define land suitability using GIS tools, soils maps and data soils profiles data, emphasizing procedures to define soil atributes. The area studied was the watershed of Córrego Espraiado, Ribeirão Preto-SP, located on the recharging area of the Guarani Aquifer, with approximately 4,130 ha and predominance of sugar cane culture. The database project was developed using the GIS Idrisi 32. The land suitability evaluation was done considering the intensive agricultural production system predominant in the watershed, adjusted for the vulnerability of the areas of recharge and for the methodology of GIS tools. Numerical terrain models (NTM) had been constructed for cation exchange capacity, basis saturation, clay content and silt+clay content using kriging (geostatistical interpolator), and for aluminum saturation using the inverse-square-distance. Boolean operations for handling geographic fields (thematic maps and NTM) to produce information plans are described and a land suitability map obtained by GIS tools is presented, indicating that 85% of watershed lands are apt to annual cultures.

Using set operations to deal with the frame problem

This paper presents a simple approach to the so-called frame problem based on some ordinary set operations, which does not require non-monotonic reasoning. Following the notion of the situation calculus, we shall represent a state of the world as a set of fluents, where a fluent is simply a Boolean-valued property whose truth-value is dependent on the time. High-level causal laws are characterised in terms of relationships between actions and the involved world states. An effect completion axiom is imposed on each causal law, which guarantees that all the fluents that can be affected by the performance of the corresponding action are always totally governed. It is shown that, compared with other techniques, such a set operation based approach provides a simpler and more effective treatment to the frame problem.

Luminescent Photoinduced Electron Transfer (PET) Molecules for Sensing and Logic Operations

Chemical species can serve as inputs to supramolecular devices so that a luminescence output is created in a conditional manner. Conditionality is built into these devices by employing the classical photochemical process of photoinduced electron transfer (PET) to compete with luminescence emission. The response of these devices in the analogue regime leads to sensors that can operate in nanometric, micrometric, and millimetric spaces. Some of these devices serve in membrane science, cell physiology, and medical diagnostics. The response in the digital regime leads to Boolean logic gates. Some of these find application in improving aspects of medical diagnostics and in identifying small objects in large populations.

Unconventional Computing: A Boolean Chemical Perspective

Elementary computing operations can be arranged within molecules so that problems in chemical, biochemical, and biological situations can be addressed. Problems that are found in small and/or living spaces, where the corresponding semiconductor logic devices cannot operate conveniently, are particularly amenable to this approach. The visualization and monitoring of intracellular species is one such category. Problems in medical diagnostics and therapy form additional categories. Chemists and biologists employ chemical synthesis and molecular biology techniques to build molecular logic devices. The photochemical approach to molecular logic devices is particularly prevalent. The fluorescent photoinduced electron transfer (PET) switching principle is particularly useful for designing logic functions into small molecules.

Vector Boolean Functions: Applications in Symmetric Cryptography

Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa una función booleana vectorial se puede inicializar de manera muy flexible mediante diferentes estructuras de datas tales como la Tabla de verdad, la Representación de traza y la Forma algebraica normal entre otras. De esta manera VBF permite evaluar los criterios criptográficos más relevantes de los algoritmos de cifra en bloque y de stream, así como funciones hash: por ejemplo, proporciona la no-linealidad, la distancia lineal, el grado algebraico, las estructuras lineales, la distribución de frecuencias de los valores absolutos del espectro Walsh o del espectro de autocorrelación, entre otros criterios. Adicionalmente, VBF puede llevar a cabo operaciones entre funciones booleanas vectoriales tales como la comprobación de igualdad, la composición, la inversión, la suma, la suma directa, el bricklayering (aplicación paralela de funciones booleanas vectoriales como la empleada en el algoritmo de cifra Rijndael), y la adición de funciones coordenada. La tesis también muestra el empleo de la librería VBF en dos aplicaciones prácticas. Por un lado, se han analizado las características más relevantes de los sistemas de cifra en bloque. Por otro lado, combinando VBF con algoritmos de optimización, se han diseñado funciones booleanas cuyas propiedades criptográficas son las mejores conocidas hasta la fecha. ABSTRACT This thesis develops the theoretical foundations and designs an open collection of C++ classes, called VBF, designed for analyzing vector Boolean functions (functions that map a Boolean vector to another Boolean vector) from a cryptographic perspective. This new implementation uses the NTL library from Victor Shoup, adding new modules which complement the existing ones making VBF better suited for cryptography. The fundamental class representing a vector Boolean function can be initialized in a flexible way via several alternative types of data structures such as Truth Table, Trace Representation, Algebraic Normal Form (ANF) among others. This way, VBF allows the evaluation of the most relevant cryptographic criteria for block and stream ciphers as well as for hash functions: for instance, it provides the nonlinearity, the linearity distance, the algebraic degree, the linear structures, the frequency distribution of the absolute values of the Walsh Spectrum or the Autocorrelation Spectrum, among others. In addition, VBF can perform operations such as equality testing, composition, inversion, sum, direct sum, bricklayering (parallel application of vector Boolean functions as employed in Rijndael cipher), and adding coordinate functions of two vector Boolean functions. This thesis also illustrates the use of VBF in two practical applications. On the one hand, the most relevant properties of the existing block ciphers have been analysed. On the other hand, by combining VBF with optimization algorithms, new Boolean functions have been designed which have the best known cryptographic properties up-to-date.

Recognizing Decomposition of a Partial Boolean Function

A hard combinatorial problem is investigated which has useful application in design of discrete devices: the two-block decomposition of a partial Boolean function. The key task is regarded: finding such a weak partition on the set of arguments, at which the considered function can be decomposed. Solving that task is essentially speeded up by the way of preliminary discovering traces of the sought-for partition. Efficient combinatorial operations are used by that, based on parallel execution of operations above adjacent units in the Boolean space.