Accelerating lattice reduction with FPGAs

International audienceWe describe an FPGA accelerator for the Kannan­–Fincke­–Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementation of KFP specifically targeting cryptographically relevant dimensions. In order to optimize this implementation, we theoretically and experimentally study several facets of KFP, including its efficient parallelization and its underlying arithmetic. Our FPGA accelerator can be used for both solving stand-alone instances of SVP (within a hybrid CPU­–FPGA compound) or myriads of smaller dimensional SVP instances arising in a BKZ-type algorithm. For devices of comparable costs, our FPGA implementation is faster than a multi-core CPU implementation by a factor around 2.12

Manufacturing flow line systems: a review of models and analytical results

The most important models and results of the manufacturing flow line literature are described. These include the major classes of models (asynchronous, synchronous, and continuous); the major features (blocking, processing times, failures and repairs); the major properties (conservation of flow, flow rate-idle time, reversibility, and others); and the relationships among different models. Exact and approximate methods for obtaining quantitative measures of performance are also reviewed. The exact methods are appropriate for small systems. The approximate methods, which are the only means available for large systems, are generally based on decomposition, and make use of the exact methods for small systems. Extensions are briefly discussed. Directions for future research are suggested.National Science Foundation (U.S.) (Grant DDM-8914277

Swarms Search for Cancerous Lesions: Artificial Intelligence Use for Accurate Identification of Bone Metastasis on Bone Scans

International audienceIn 1994, Josh Benaloh proposed a probabilistic homomorphic encryption scheme, enhancing the poor expansion factor provided by Goldwasser and Micali's scheme. Since then, numerous papers have taken advantage of Benaloh's homomorphic encryption function, including voting schemes, private multi-party trust computation, non-interactive verifiable secret sharing, online poker. In this paper we show that the original description of the scheme is incorrect, because it can result in ambiguous decryption of ciphertexts. Then we show on several applications that a bad choice in the key generation phase of Benaloh's scheme has a real impact on the behaviour of the application. For instance in an e-voting protocol, it can inverse the result of an election. Our main contribution is a corrected description of the scheme (we provide a complete proof of correctness). Moreover we also compute the probability of failure of the original scheme. Finally we show how to formulate the security of the corrected scheme in a generic setting suitable for several homomorphic encryptions

The trans-ancestral genomic architecture of glycemic traits

Glycemic traits are used to diagnose and monitor type 2 diabetes and cardiometabolic health. To date, most genetic studies of glycemic traits have focused on individuals of European ancestry. Here we aggregated genome-wide association studies comprising up to 281,416 individuals without diabetes (30% non-European ancestry) for whom fasting glucose, 2-h glucose after an oral glucose challenge, glycated hemoglobin and fasting insulin data were available. Trans-ancestry and single-ancestry meta-analyses identified 242 loci (99 novel; P < 5 x 10(-8)), 80% of which had no significant evidence of between-ancestry heterogeneity. Analyses restricted to individuals of European ancestry with equivalent sample size would have led to 24 fewer new loci. Compared with single-ancestry analyses, equivalent-sized trans-ancestry fine-mapping reduced the number of estimated variants in 99% credible sets by a median of 37.5%. Genomic-feature, gene-expression and gene-set analyses revealed distinct biological signatures for each trait, highlighting different underlying biological pathways. Our results increase our understanding of diabetes pathophysiology by using trans-ancestry studies for improved power and resolution.A trans-ancestry meta-analysis of GWAS of glycemic traits in up to 281,416 individuals identifies 99 novel loci, of which one quarter was found due to the multi-ancestry approach, which also improves fine-mapping of credible variant sets.Diabetes mellitus: pathophysiological changes and therap

Novel Loci for Adiponectin Levels and Their Influence on Type 2 Diabetes and Metabolic Traits : A Multi-Ethnic Meta-Analysis of 45,891 Individuals

J. Kaprio, S. Ripatti ja M.-L. Lokki työryhmien jäseniä.Peer reviewe

Pushing the Boundaries: Level-set Methods and Geometrical Nonlinearities in Structural Topology Optimization

This thesis aims at understanding and improving topology optimization techniques focusing on density-based level-set methods and geometrical nonlinearities. Central in this work are the numerical modeling of the mechanical response of a design and the consistency of the optimization process itself. Concerning the first topic, we investigate different means to improve the robustness of density-based numerical models including geometrical nonlinearities. The conventional approach (scaling the local material properties) can result in convergence problems due to excessive deformation in low-stiffness finite elements. To avoid excessive deformation, we combine the element connectivity parameterization method (adapting the connectivity between finite elements) with level-set-based topology optimization. Furthermore, we achieve greater robustness of analysis method using a second and improved approach called element deformation scaling. This approach eliminates the need for solving internal equilibrium equations (needed for the element connectivity parameterization method) via an explicit relation between the local internal and global external displacement field. The second focus of this thesis is on the optimization process of level-set-based topology optimization, and in particular its numerical consistency. We observe that signed-distance reinitialization of the level-set function affects the shape of a design in the optimization process. To minimize this effect, we propose a discrete level-set method that is based on an approximate Heaviside function and focusing on the implementation. Furthermore, we also propose a level-set-based topology optimization method using an exact Heaviside function and mathematical programming that effectively eliminates the need for reinitialization. We demonstrate that our density-based level-set method is closely related to conventional density-based topology optimization methods, while offering the advantage of more control over the geometrical complexity. On the other hand, we confirm that the dependence of the final result on the initial design which remains one of the big challenges for level-set-based topology optimization. The potential of the proposed level-set method is shown by applying it on problems with stress constraints and geometrical nonlinearities and performing manufacturing tolerant topology optimization. Finally, this thesis offers a review of level-set methods for structural topology optimization to identify and discuss the different approaches that are available in literature. We can distinguish between level-set methods by examination of their design parameterization, sensitivities, update procedures and regularization techniques. A level-set-based design parameterization offers the advantage of a crisp distinction between subdomains. For this reason, X-FEM approaches and conforming discretizations are an interesting option to retain the crisp nature of the level-set-based description of the design. Many level-set methods are combined with density-based numerical models and are, therefore, closely related to conventional density-based topology optimization methods. In particular, recently proposed projection methods have much in common with a level-set-based design description. The results of level-set-based TO methods often rely heavily on regularization techniques that introduce inconsistencies in the optimization process. Numerical consistency does not necessarily lead to the best search direction, but is essential to find a Karush-Kuhn-Tucker point of the discretized optimization problem.Precision and Microsystems EngineeringMechanical, Maritime and Materials Engineerin

Tendoscopy of the posterior tibial tendon

An anatomic cadaver study was performed and subsequently, in a prospective study, diagnostic and therapeutic tendoscopy (tendon sheath endoscopy) was performed in 16 consecutive patients with a history of persistent posteromedial ankle pain for at least 6 months. All patients had pain on palpation over the posterior tibial tendon, a positive tibial tendon resistance test, and local swelling. The indications were diagnostic procedure after surgery in 5 patients, diagnostic procedure after fracture in 5, diagnostic after trauma in 1, chronic tenosynovitis in 2, screw removal in 1, and posterior ankle arthrotomy in 2 patients. Inspection and surgery of the complete tendon and its tendon sheath can be performed by a standard two-portal technique. A new finding is the vincula that was consistently present in all our autopsy specimens as well as all our patients. At 1-year follow-up, 3 of the 4 patients in whom resection of a pathological thickened vincula, and 2 patients in whom tenosynovectomy and tendon sheath release were performed, were free of symptoms. Other procedures such as removal of adhesions and screw removal could well be performed. In 2 patients with a posteromedially located loose body, successful removal took place by means of a posterior tibial tendoscopic approach. There were no complication