Valence-Driven Connectivity Encoding for 3D Meshes

In this paper, we propose a valence-driven, single-resolution encoding technique for lossless compression of triangle mesh connectivity. Building upon a valence-based approach pioneered by Touma and Gotsman²² , we design a new valence-driven conquest for arbitrary meshes that always guarantees smaller compression rates than the original method. Furthermore, we provide a novel theoretical entropy study of our technique, hinting the optimality of the valence-driven approach. Finally, we demonstrate the practical efficiency of this approach (in agreement with the theoretical prediction) on a series of test meshes, resulting in the lowest compression ratios published so far, for both irregular and regular meshes, small or large.     

Efficient solution of the 3G network planning problem

The 3G universal mobile telecommunications system (UMTS) planning problem is combinatorially explosive and difficult to solve optimally, though solution methods exist for its three main subproblems (cell, access network, and core network planning). We previously formulated the entire problem as a single integrated mixed-integer linear program (MIP) and showed that only small instances of this global planning problem can be solved to optimality by a commercial MIP solver within a reasonable amount of time ( St-Hilaire, Chamberland, & Pierre, 2006). Heuristic methods are needed for larger instances. This paper provides the first complete formulation for the heuristic sequential method ( St-Hilaire, Chamberland, & Pierre, 2005) that re-partitions the global formulation into the three conventional subproblems and solves them in sequence using a MIP solver. This greatly improves the solution time, but at the expense of solution quality. We also develop a new hybrid heuristic that uses the results of the sequential method to generate constraints that provide tighter bounds for the global planning problem with the goal of reaching the provable optimum solution much more quickly. We empirically evaluate the speed and solution accuracy of four solution methods: (i) the direct MIP solution of the global planning problem, (ii) a local search heuristic applied to the global planning problem, (iii) the sequential method and (iv) the new hybrid method. The results show that the sequential method provides very good results in a fraction of the time needed for the direct MIP solution of the global problem, and that optimum results can be provided by the hybrid heuristic in greatly reduced time.     

A VNS heuristic for escaping local extrema entrapment in normalized cut clustering

Normalized cut is one of the most popular graph clustering criteria. The main approaches proposed for its resolution are spectral clustering methods and a multilevel approach of Dhillon et al. (TPAMI 29:1944–1957, 2007), called graclus. Their aim is to obtain good solutions in a small amount of time for large instances. Metaheuristics are general frameworks for stochastic searches often employed in global optimization to improve the solutions obtained by other heuristics. Variable neighborhood search (VNS) is a metaheuristic which exploits systematically the idea of neighborhood change during the search. In this paper, we propose a VNS heuristic for normalized cut segmentation. Computational experiments show that in most cases this VNS heuristic improves significantly, and in moderate time, the solutions obtained by the current state-of-the-art algorithms, i.e., graclus and a spectral method proposed by Yu and Shi (ICCV, 2003).     

A Computational Damage Micromodel of Laminated Composites

A new computational damage micromodel for laminates, which takes into account classical experimental micro- and macro-observations for various stacking sequences, is described. The first computational examples are shown.     

3D numerical simulation of the behaviour of a spherical particle suspended in a Newtonian fluid and submitted to a simple shear

The 3D flow around a rigid spherical particle suspended in a Newtonian fluid and submitted to simple shear is numerically studied using Rem3D^® finite element code. The sphere motion is imposed by a sticking contact between the sphere and the fluid. The effect of the particle size as compared with the finite dimension of the shear cell was investigated. The direct calculations show that 3D modelling is necessary to correctly predict the sphere behaviour. The proximity of the particle and the cell walls strongly affects the flow velocities, the sphere motion (increase of the rotation period of the sphere) and the stress field (change of orientation angle and increase of maximal local stresses).     

Shear Stress in Smooth Rectangular Open-Channel Flows

The average bed and sidewall shear stresses in smooth rectangular open-channel flows are determined after solving the continuity and momentum equations. The analysis shows that the shear stresses are function of three components: (1) gravitational; (2) secondary flows; and (3) interfacial shear stress. An analytical solution in terms of series expansion is obtained for the case of constant eddy viscosity without secondary currents. In comparison with laboratory measurements, it slightly overestimates the average bed shear stress measurements but underestimates the average sidewall shear stress by 17% when the width–depth ratio becomes large. A second approximation is formulated after introducing two empirical correction factors. The second approximation agrees very well (R2>0.99 and average relative error less than 6%) with experimental measurements over a wide range of width–depth ratios.     

Port Placement Planning in Robot-Assisted Coronary Artery Bypass

Properly selected port sites for robot-assisted coronary artery bypass graft (CABG) improve the efficiency and quality of these procedures. In clinical practice, surgeons select port locations using external anatomic landmarks to estimate a patient's internal anatomy. This paper proposes an automated approach to port selection based on a preoperative image of the patient, thus avoiding the need to estimate internal anatomy. Using this image as input, port sites are chosen from a grid of surgeon-approved options by defining a performance measure for each possible port triad. This measure seeks to minimize the weighted squared deviation of the instrument and endoscope angles from their optimal orientations at each internal surgical site. This performance measure proves insensitive to perturbations in both its weighting factors and moderate intraoperative displacements of the patient's internal anatomy. A validation study of this port site selection was performed. cardiac algorithm also Six surgeons dissected model vessels using the port triad selected by this algorithm with performance compared to dissection using a surgeon-selected port triad and a port triad template described by Tabaie et al., 1999. With the algorithm-selected ports, dissection speed increased by up to 43% (p = 0.046) with less overall vessel trauma. Thus, this algorithmic approach to port site selection has important clinical implications for robot-assisted CABG which warrant further investigation.     

Orphan gene finding—an exon assembly approach

This paper introduces an algorithm for finding eukaryotic genes. It particularly addresses the problem of orphan genes, that is of genes that cannot, based on homology alone, be connected to any known gene family and to which it is therefore not possible to apply traditional gene finding methods. To the best of our knowledge, this is also the first algorithm that attempts to compare in an exact way two DNA sequences that contain both coding (i.e. exonic) and non-coding (i.e. intronic and, possibly, intergenic) parts. The comparison is performed following an algorithmical model of a gene that is as close as possible to the biological one (we consider in this paper the “one ORF, one gene” problem only). A gene is seen as a set of exons that are pieces of an assembly and are not independent. The algorithm is efficient enough: although the constants are higher than for usual sequence comparison, its time complexity is proportional to the product of the sequences lengths while its space complexity scales linearly with the length of the smallest sequence.     

From the Hough Transform to a New Approach for the Detection and Approximation of Elliptical Arcs

The edges of simple geometrical (e.g., manufactured) parts can generally be approximated sufficiently accurately by straight-line segments and elliptical arcs in order, for example, to carry out a dimensional analysis of these parts, such as required by inspection tasks. Hough transforms are robust methods for the detection of straight-line segments but are not directly suitable for the detection of elliptical arcs, for which the processing time and memory space necessary are too important. We present in this paper a new method which allows the determination of the parameters of elliptical arcs (or of ellipses) by use of a two-dimensional discretized parameter space defined similarly to the usual Hough space. This new method allows both the detection and characterization of ellipses whose major and minor axis lengths can be as small as four pixels long or of elliptical arcs with a small angular aperture.