Octal-Tree Spatial Sorting and its Applications

An octal tree subdivision recursively divides a bounded three-dimensional volume into octanta about an internal division point. This scheme has been used to represent cellular or enumerated voxel models of solid objects. Given one or more sets of points sampled from the surface of a solid, an octal tree may be generated in which each leaf node contains m or less points. By specifying the tree traversal rule, the points are accessed in a sorted order. By defining m=3, a divide-and-conquer surface triangulation algorithm may be developed which does not require special sampling conditions (such as co-planarity) on subsets of the sample points. By element(octal) a pre-ordering is established on the faces. From any viewpoint, surface polygons can be visited in a priority ordered fashion by appropriate tree traversal. The pre-ordering established is shown to be useful in several graphics related contexts. The ability to preprocess the faces so as to establish a viewpoint independent data structure for priority sorting leads to a useful hidden surface techniques. By appropriate modification of the traversal rule a ray-tracing algorithms may visit only faces lying on the ray in a priority order. The tree traversal visits faces in a fashion which causes reference to regions in a frame buffer to be geometrically localized, substantiating reducing page faults in a virtual buffer. The sorting process allows for simple geometric merging of sets of surface measurements which contain no fiducial information

Non-destructive soluble solids content determination for ‘Rocha’ Pear Based on VIS-SWNIR spectroscopy under ‘Real World’ sorting facility conditions

In this paper we report a method to determine the soluble solids content (SSC) of 'Rocha' pear (Pyrus communis L. cv. Rocha) based on their short-wave NIR reflectance spectra (500-1100 nm) measured in conditions similar to those found in packinghouse fruit sorting facilities. We obtained 3300 reflectance spectra from pears acquired from different lots, producers and with diverse storage times and ripening stages. The macroscopic properties of the pears, such as size, temperature and SSC were measured under controlled laboratory conditions. For the spectral analysis, we implemented a computational pipeline that incorporates multiple pre-processing techniques including a feature selection procedure, various multivariate regression models and three different validation strategies. This benchmark allowed us to find the best model/preproccesing procedure for SSC prediction from our data. From the several calibration models tested, we have found that Support Vector Machines provides the best predictions metrics with an RMSEP of around 0.82 ∘ Brix and 1.09 ∘ Brix for internal and external validation strategies respectively. The latter validation was implemented to assess the prediction accuracy of this calibration method under more 'real world-like' conditions. We also show that incorporating information about the fruit temperature and size to the calibration models improves SSC predictability. Our results indicate that the methodology presented here could be implemented in existing packinghouse facilities for single fruit SSC characterization.Funding Agency CEOT strategic project UID/Multi/00631/2019 project OtiCalFrut ALG-01-0247-FEDER-033652 Ideias em Caixa 2010, CAIXA GERAL DE DEPOSITOS Fundacao para a Ciencia e a Tecnologia (Ciencia)info:eu-repo/semantics/publishedVersio

Optimized multi-objective design of herringbone micromixers

This paper was presented at the 2nd Micro and Nano Flows Conference (MNF2009), which was held at Brunel University, West London, UK. The conference was organised by Brunel University and supported by the Institution of Mechanical Engineers, IPEM, the Italian Union of Thermofluid dynamics, the Process Intensification Network, HEXAG - the Heat Exchange Action Group and the Institute of Mathematics and its Applications.A design method which systematically integrates Computational Fluids Dynamics (CFD) with an optimization scheme based on the use of the techniques Design of Experiments (DOE), Function Approximation technique (FA) and Multi-Objective Genetic Algorithm (MOGA), has been applied to the shape optimization of the staggered herringbone micromixer (SHM) at different Reynolds numbers. To quantify the mixing intensity in the mixer a Mixing index is defined on the basis of the intensity of segregation of the mass concentration on the outlet section. Four geometric parameters, i.e., aspect ratio of the mixing channel, ratio of groove depth to channel height, ratio of groove width to groove pitch and the asymmetry factor (offset) of groove, are the design variables selected for optimization. The mixing index at the outlet section and the pressure drop in the mixing channel are the performance criteria used as objective functions. The Pareto front with the optimum trade-offs, maximum mixing index with minimum pressure drop, is obtained. Experiments for qualitative and quantitative validation have been implemented.This study is supported by the Dorothy Hodgkin Postgraduate Award (DHPA) of the Engineering and Physical Sciences Research Council (EPSRC) of United Kingdom and Ebara Research Co. Ltd. of Japan

Formal Modeling of Connectionism using Concurrency Theory, an Approach Based on Automata and Model Checking

This paper illustrates a framework for applying formal methods techniques, which are symbolic in nature, to specifying and verifying neural networks, which are sub-symbolic in nature. The paper describes a communicating automata [Bowman & Gomez, 2006] model of neural networks. We also implement the model using timed automata [Alur & Dill, 1994] and then undertake a verification of these models using the model checker Uppaal [Pettersson, 2000] in order to evaluate the performance of learning algorithms. This paper also presents discussion of a number of broad issues concerning cognitive neuroscience and the debate as to whether symbolic processing or connectionism is a suitable representation of cognitive systems. Additionally, the issue of integrating symbolic techniques, such as formal methods, with complex neural networks is discussed. We then argue that symbolic verifications may give theoretically well-founded ways to evaluate and justify neural learning systems in the field of both theoretical research and real world applications