Author: "Department of Computer Science [Purdue]" / Topic: computer science - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Department of Computer Science [Purdue]"' showing total 24 results

Start Over Author "Department of Computer Science [Purdue]" Topic computer science

24 results on '"Department of Computer Science [Purdue]"'

1. Urban Brush: Intuitive and Controllable Urban Layout Editing

Author: Xiaochen Zhou, Bedrich Benes, Marie-Paule R. Cani, Pascal Chang, Purdue University [West Lafayette], Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), and Department of Computer Science [Purdue]
Subjects: Engineering drawing, Computer science, 0211 other engineering and technologies, Volume (computing), Brush, 020207 software engineering, 021107 urban & regional planning, 02 engineering and technology, 15. Life on land, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], law.invention, Entertainment, Computer graphics, Set (abstract data type), Block (programming), law, Atomic operations, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], ComputingMethodologies_COMPUTERGRAPHICS
Abstract: International audience; We present a novel method for authoring landscapes with flora and fauna while considering their mutual interactions. Our algorithm outputs a steady-state ecosystem in the form of density maps for each species, their daily circuits, and a modified terrain with eroded trails from a terrain, climatic conditions, and species with related biological information. We introduce the Resource Access Graph, a new data structure that encodes both interactions between food chain levels and animals traveling between resources over the terrain. A novel competition algorithm operating on this data progressively computes a steady-state solution up the food chain, from plants to carnivores. The user can explore the resulting landscape, where plants and animals are instantiated on the fly, and interactively edit it by over-painting the maps. Our results show that our system enables the authoring of consistent landscapes where the impact of wildlife is visible through animated animals, clearings in the vegetation, and eroded trails. We provide quantitative validation with existing ecosystems and a user-study with expert paleontologist end-users, showing that our system enables them to author and compare different ecosystems illustrating climate changes over the same terrain while enabling relevant visual immersion into consistent landscapes.
Published: 2021
Full Text: View/download PDF

2. SHREC 2020: Classification in cryo-electron tomograms

Author: Remco C. Veltkamp, Min Xu, Nguyen P. Nguyen, Xuefeng Cui, Filiz Bunyak, Yu Hao, Xiangrui Zeng, Gijs van der Schot, Tommi A. White, Fa Zhang, Ilja Gubins, Xiao Wang, Daisuke Kihara, Marten L. Chaillet, Friedrich Förster, Xiaohua Wan, Emmanuel Moebel, Department of Information and Computing Sciences [Utrecht], Utrecht University [Utrecht], Department of Chemistry [Utrecht], CAS Institute of Computing Technology (ICT), Chinese Academy of Sciences [Beijing] (CAS), School of Computer Science and Technology [Jinan], Shandong University, Space-timE RePresentation, Imaging and cellular dynamics of molecular COmplexes (SERPICO), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Department of Computer Science [Purdue], Purdue University [West Lafayette], Computational Biology Department [Pittsburgh], Carnegie Mellon University [Pittsburgh] (CMU), Department of Computer Science Electrical Engineering [Kansas City], University of Missouri [Kansas City] (UMKC), University of Missouri System-University of Missouri System, University of Missouri [St. Louis], and University of Missouri System
Subjects: Artificial neural network, business.industry, Computer science, Template matching, Resolution (electron density), General Engineering, 020207 software engineering, Pattern recognition, Context (language use), 02 engineering and technology, Function (mathematics), Computer Graphics and Computer-Aided Design, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Human-Computer Interaction, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], 0202 electrical engineering, electronic engineering, information engineering, Benchmark (computing), 020201 artificial intelligence & image processing, Artificial intelligence, Tomography, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Focus (optics), business, [PHYS.PHYS.PHYS-DATA-AN]Physics [physics]/Physics [physics]/Data Analysis, Statistics and Probability [physics.data-an]
Abstract: International audience; Cryo-electron tomography (cryo-ET) is an imaging technique that allows us to three-dimensionally visualize both the structural details of macro-molecular assemblies under near-native conditions and its cellular context. Electrons strongly interact with biological samples, limiting electron dose. The latter limits the signal-to-noise ratio and hence resolution of an individual tomogram to about 50 (5 nm). Biological molecules can be obtained by averaging volumes, each depicting copies of the molecule, allowing for resolutions beyond 4 (0.4 nm). To this end, the ability to localize and classify components is crucial, but challenging due to the low signal-to-noise ratio. Computational innovation is key to mine biological information from cryo-electron tomography.To promote such innovation, we provide a novel simulated dataset to benchmark different methods of localization and classification of biological macromolecules in cryo-electron tomograms. Our publicly available dataset contains ten tomographic reconstructions of simulated cell-like volumes. Each volume contains twelve different types of complexes, varying in size, function and structure.In this paper, we have evaluated seven different methods of finding and classifying proteins. Six research groups present results obtained with learning-based methods and trained on the simulated dataset, as well as a baseline template matching, a traditional method widely used in cryo-ET research. We find that method performance correlates with particle size, especially noticeable for template matching which performance degrades rapidly as the size decreases. We learn that neural networks can achieve significantly better localization and classification performance, in particular convolutional networks with focus on high-resolution details such as those based on U-Net architecture.
Published: 2020
Full Text: View/download PDF

3. Semi‐Procedural Textures Using Point Process Texture Basis Functions

Author: Eric Galin, Jean-Michel Dischler, Rémi Allègre, Pascal Guehl, Bedrich Benes, Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et nanosciences d'Alsace (FMNGE), Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA), Department of Computer Science [Purdue], Purdue University [West Lafayette], Modélisation Géométrique, Géométrie Algorithmique, Fractales (GeoMod), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), Origami (Origami), ANR-16-CE33-0001,HDWorlds,Modèles procéduraux paramétriques pour la représentation d'univers virtuels complexes(2016), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)
Subjects: noise, Computer science, business.industry, 020207 software engineering, Pattern recognition, Basis function, 02 engineering and technology, material synthesis, procedural generation, Computer Graphics and Computer-Aided Design, Window function, texture synthesis, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], Convolution, Rendering (computer graphics), 0202 electrical engineering, electronic engineering, information engineering, Procedural texture, 020201 artificial intelligence & image processing, Artificial intelligence, business, Texture synthesis
Abstract: We introduce a novel semi-procedural approach that avoids drawbacks of procedural textures and leverages advantages of data-driven texture synthesis. We split synthesis in two parts: 1) structure synthesis, based on a procedural parametric model and 2) color details synthesis, being data-driven. The procedural model consists of a generic Point Process Texture Basis Function (PPTBF), which extends sparse convolution noises by defining rich convolution kernels. They consist of a window function multiplied with a correlated statistical mixture of Gabor functions, both designed to encapsulate a large span of common spatial stochastic structures, including cells, cracks, grains, scratches, spots, stains, and waves. Parameters can be prescribed automatically by supplying binary structure exemplars. As for noise-based Gaussian textures, the PPTBF is used as stand-alone function, avoiding classification tasks that occur when handling multiple procedural assets. Because the PPTBF is based on a single set of parameters it allows for continuous transitions between different visual structures and an easy control over its visual characteristics. Color is consistently synthesized from the exemplar using a multiscale parallel texture synthesis by numbers, constrained by the PPTBF. The generated textures are parametric, infinite and avoid repetition. The data-driven part is automatic and guarantees strong visual resemblance with inputs. Applications: this work is related to content creation tools for films and video games, especially procedural texture and material synthesis (e.g. Substance Designer), and inverse procedural modeling (e.g inverse shade tree approach). This paper has been published in the CGF journal (Computer Grapics Forum) in July 2020 and presented at the EGSR conference (Eurographics Symposium on Rendering) in July 2020 where it got an award: Honorable Mention from the Best Papers committee.
Published: 2020
Full Text: View/download PDF

4. Interactive example-based terrain authoring with conditional generative adversarial networks

Author: Julie Digne, Eric Galin, Bedrich Benes, Benoît Martinez, Christian Wolf, Adrien Peytavie, Eric Guérin, Modélisation Géométrique, Géométrie Algorithmique, Fractales (GeoMod), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), Extraction de Caractéristiques et Identification (imagine), Department of Computer Science [Purdue], Purdue University [West Lafayette], Ubisoft, Fonds National pour la Societé Numérique - PAPAYA P110720-2659260, ANR HDWorlds, ANR-16-CE33-0001,HDWorlds,Modèles procéduraux paramétriques pour la représentation d'univers virtuels complexes(2016), Wolf, Christian, and Modèles procéduraux paramétriques pour la représentation d'univers virtuels complexes - - HDWorlds2016 - ANR-16-CE33-0001 - AAPG2016 - VALID
Subjects: terrain generation, Computer science, Process (engineering), [INFO.INFO-GR] Computer Science [cs]/Graphics [cs.GR], ComputerApplications_COMPUTERSINOTHERSYSTEMS, Terrain, 02 engineering and technology, Machine learning, computer.software_genre, GeneralLiterature_MISCELLANEOUS, Set (abstract data type), Human–computer interaction, 0202 electrical engineering, electronic engineering, information engineering, procedural modeling, Procedural modeling, ComputingMethodologies_COMPUTERGRAPHICS, business.industry, deep learning, 020207 software engineering, Computer Graphics and Computer-Aided Design, Pipeline (software), [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], Sketch, 020201 artificial intelligence & image processing, Artificial intelligence, business, computer
Abstract: International audience; Authoring virtual terrains presents a challenge and there is a strong need for authoring tools able to create realistic terrains with simple user-inputs and with high user control. We propose an example-based authoring pipeline that uses a set of terrain synthesizers dedicated to specific tasks. Each terrain synthesizer is a Conditional Generative Adversarial Network trained by using real-world terrains and their sketched counterparts. The training sets are built automatically with a view that the terrain synthesizers learn the generation from features that are easy to sketch. During the authoring process, the artist first creates a rough sketch of the main terrain features, such as rivers, valleys and ridges, and the algorithm automatically synthesizes a terrain corresponding to the sketch using the learned features of the training samples. Moreover, an erosion synthesizer can also generate terrain evolution by erosion at a very low computational cost. Our framework allows for an easy terrain authoring and provides a high level of realism for a minimum sketch cost. We show various examples of terrain synthesis created by experienced as well as inexperienced users who are able to design a vast variety of complex terrains in a very short time.
Published: 2017
Full Text: View/download PDF

5. Authoring landscapes by combining ecosystem and terrain erosion simulation

Author: Guillaume Cordonnier, Marie-Paule Cani, Bedrich Benes, Eric Guérin, Adrien Peytavie, James Gain, Eric Galin, Intuitive Modeling and Animation for Interactive Graphics & Narrative Environments (IMAGINE ), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Modélisation Géométrique, Géométrie Algorithmique, Fractales (GeoMod), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), University of Cape Town, Department of Computer Science [Purdue], Purdue University [West Lafayette], ERC, Fonds National pour la Société Numérique, ANR, NSF, ANR-16-CE33-0001,HDWorlds,Modèles procéduraux paramétriques pour la représentation d'univers virtuels complexes(2016), European Project: 291184,EC:FP7:ERC,ERC-2011-ADG_20110209,EXPRESSIVE(2012), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Université de Lyon-Université Lumière - Lyon 2 (UL2)
Subjects: 010504 meteorology & atmospheric sciences, Exploit, Landscapes, Computer science, Interface (Java), Terrain, 02 engineering and technology, 01 natural sciences, GeneralLiterature_MISCELLANEOUS, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS, Computer graphics, 0202 electrical engineering, electronic engineering, information engineering, medicine, [INFO]Computer Science [cs], Ecosystem, ComputingMethodologies_COMPUTERGRAPHICS, 0105 earth and related environmental sciences, Vegetation, business.industry, Environmental resource management, 020207 software engineering, 15. Life on land, Computer Graphics and Computer-Aided Design, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], Stochastic, Variety (cybernetics), Erosion, medicine.symptom, Simulation of Natural Phenomena, Vegetation (pathology), business
Abstract: The paper was presented at Siggraph 2017; International audience; We introduce a novel framework for interactive landscape authoring that supports bi-directional feedback between erosion and vegetation simulation. Vegetation and terrain erosion have strong mutual impact and their interplay innuences the overall realism of virtual scenes. Despite their importance, these complex interactions have been neglected in computer graphics. Our framework overcomes this by simulating the eeect of a variety of geomor-phological agents and the mutual interaction between diierent material and vegetation layers, including rock, sand, humus, grass, shrubs, and trees. Users are able to exploit these interactions with an authoring interface that consistently shapes the terrain and populates it with details. Our method, validated through side-by-side comparison with real terrains, can be used not only to generate realistic static landscapes, but also to follow the temporal evolution of a landscape over a few centuries.
Published: 2017
Full Text: View/download PDF

6. Dendry: A Procedural Model for Dendritic Patterns

Author: Damien Rohmer, Bedrich Benes, Mathieu Gaillard, Marie-Paule Cani, Eric Galin, Eric Guérin, Guérin, Eric, Modèles procéduraux paramétriques pour la représentation d'univers virtuels complexes - - HDWorlds2016 - ANR-16-CE33-0001 - AAPG2016 - VALID, Department of Computer Science [Purdue], Purdue University [West Lafayette], Modélisation Géométrique, Géométrie Algorithmique, Fractales (GeoMod), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Fonds National pour la Societé Numérique - PAPAYA P110720-2659260, ANR HDWorlds, and ANR-16-CE33-0001,HDWorlds,Modèles procéduraux paramétriques pour la représentation d'univers virtuels complexes(2016)
Subjects: Computer science, [INFO.INFO-GR] Computer Science [cs]/Graphics [cs.GR], 020207 software engineering, 02 engineering and technology, Function (mathematics), 010502 geochemistry & geophysics, 01 natural sciences, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], Maxima and minima, Tree structure, 0202 electrical engineering, electronic engineering, information engineering, Range (statistics), Memory footprint, Geometric modeling, Procedural modeling, Algorithm, Smoothing, ComputingMilieux_MISCELLANEOUS, 0105 earth and related environmental sciences
Abstract: We introduce Dendry, a procedural function that generates dendritic patterns and is locally computable. The function is controlled by parameters such as the level of branching, the degree of local smoothing, random seeding and local disturbance parameters, and the range of the branching angles. It is also controlled by a global control function that defines the overall shape and can be used, for example, to initialize local minima. The algorithm returns the distance to a tree structure which is implicitly constructed on the fly, while requiring a small memory footprint. The evaluation can be performed in parallel for multiple points and scales linearly with the number of cores. We demonstrate an application of our model to the generation of terrain heighfields with consistent river networks. A quad core implementation of our algorithm takes about ten seconds for a 512 × 512 resolution grid on the CPU.
Published: 2019

7. A Review of Digital Terrain Modeling

Author: Guillaume Cordonnier, James Gain, Eric Galin, Bedrich Benes, Eric Guérin, Marie-Paule Cani, Adrien Peytavie, Modélisation Géométrique, Géométrie Algorithmique, Fractales (GeoMod), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX), Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Department of Computer Science [Purdue], Purdue University [West Lafayette], University of Cape Town, ANR HDWorlds, Fonds National pour la Societé Numérique - PAPAYA P110720-2659260, and ANR-16-CE33-0001,HDWorlds,Modèles procéduraux paramétriques pour la représentation d'univers virtuels complexes(2016)
Subjects: geography, geography.geographical_feature_category, Computer science, Landform, 020207 software engineering, Terrain, 02 engineering and technology, 15. Life on land, Computer Graphics and Computer-Aided Design, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], Variety (cybernetics), Computer graphics, Human–computer interaction, Component (UML), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Scale (map), Procedural modeling, Mountain range, ComputingMethodologies_COMPUTERGRAPHICS
Abstract: International audience; Terrains are a crucial component of three-dimensional scenes and are present in many Computer Graphics applications. Terrain modeling methods focus on capturing landforms in all their intricate detail, including eroded valleys arising from the interplay of varied phenomena, dendritic mountain ranges, and complex river networks. Set against this visual complexity is the need for user control over terrain features, without which designers are unable to adequately express their artistic intent. This article provides an overview of current terrain modeling and authoring techniques, organized according to three categories: procedural modeling, physically-based simulation of erosion and land formation processes, and example-based methods driven by scanned terrain data. We compare and contrast these techniques according to several criteria, specifically: the variety of achievable landforms; realism from both a perceptual and geomorphological perspective; issues of scale in terms of terrain extent and sampling precision; the different interaction metaphors and attendant forms of user-control, and computation and memory performance. We conclude with an in-depth discussion of possible research directions and outstanding technical and scientific challenges.
Published: 2019
Full Text: View/download PDF

8. Verifying a Concurrent Garbage Collector with a Rely-Guarantee Methodology

Author: Jan Vitek, Gustavo Petri, Yannick Zakowski, Delphine Demange, David Cachera, Suresh Jagannathan, David Pichardie, École normale supérieure - Rennes (ENS Rennes), Software certification with semantic analysis (CELTIQUE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Department of Computer Science [Purdue], Purdue University [West Lafayette], Northeastern University [Boston], ANR-14-CE28-0004,DISCOVER,Représentations Intermédiaires et Sémantiques de la Concurrence pour les Compilateurs Vérifiés(2014), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)
Subjects: Soundness, Intermediate language, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Programming language, Computer science, Concurrent data structure, Proof assistant, 020207 software engineering, 0102 computer and information sciences, 02 engineering and technology, computer.software_genre, 01 natural sciences, Computational Theory and Mathematics, 010201 computation theory & mathematics, Artificial Intelligence, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 0202 electrical engineering, electronic engineering, information engineering, Compiler, computer, Software, Program logic, Garbage collection
Abstract: International audience; Concurrent garbage collection algorithms are a challenge for program verification. In this paper, we address this problem by proposing a mechanized proof methodology based on the Rely-Guarantee proof technique. We design a compiler intermediate representation with strong type guarantees, dedicated support for abstract concurrent data structures, and high-level iterators on runtime internals. In addition, we define an Rely-Guarantee program logic supporting an incremental proof methodology where annotations and invariants can be progressively enriched. We formalize the intermediate representation, the proof system, and prove the soundness of the methodology in the Coq proof assistant. Equipped with this, we prove a fully concurrent garbage collector where mutators never have to wait for the collector.
Published: 2018
Full Text: View/download PDF

9. Feedforward Neural Networks for Caching: Enough or Too Much?

Author: Vladyslav Fedchenko, Bruno Ribeiro, Giovanni Neglia, Network Engineering and Operations (NEO ), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Department of Computer Science [Purdue], and Purdue University [West Lafayette]
Subjects: FOS: Computer and information sciences, Scheme (programming language), Computer Networks and Communications, Computer science, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Networking and Internet Architecture, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], 0202 electrical engineering, electronic engineering, information engineering, computer.programming_language, Networking and Internet Architecture (cs.NI), Hardware_MEMORYSTRUCTURES, Artificial neural network, business.industry, Estimator, 020206 networking & telecommunications, Recurrent neural network, 010201 computation theory & mathematics, Hardware and Architecture, Feedforward neural network, Artificial intelligence, business, computer, Software
Abstract: International audience; We propose a caching policy that uses a feedforward neural network (FNN) to predict content popularity. Our scheme outperforms popular eviction policies like LRU or ARC, but also a new policy relying on the more complex recurrent neural networks. At the same time, replacing the FNN predictor with a naive linear estimator does not degrade caching performance significantly, questioning then the role of neural networks for these applications.
Published: 2018
Full Text: View/download PDF

10. Revisiting random walk based sampling in networks: Evasion of burn-in period and frequent regenerations

Author: Vivek S. Borkar, Arun Kadavankandy, Jithin K. Sreedharan, Konstantin Avrachenkov, Network Engineering and Operations (NEO ), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Department of Electrical Engineering [IIT-Bombay] (EE-IIT), Indian Institute of Technology Kanpur (IIT Kanpur), Department of Computer Science [Purdue], and Purdue University [West Lafayette]
Subjects: Mean squared error, Respondent-driven sampling, Computer science, Stability (learning theory), 02 engineering and technology, Stochastic approximation, 01 natural sciences, lcsh:QA75.5-76.95, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], 010104 statistics & probability, symbols.namesake, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], Reinforcement learning, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Network sampling, Random walks on graph, lcsh:T58.5-58.64, lcsh:Information technology, Research, Sampling (statistics), Estimator, 020206 networking & telecommunications, Markov chain Monte Carlo, Complex network, Random walk, Computer Science Applications, Human-Computer Interaction, Modeling and Simulation, symbols, lcsh:Electronic computers. Computer science, Algorithm, Information Systems
Abstract: International audience; Background: In the framework of network sampling, random walk (RW) based estimation techniques provide many pragmatic solutions while uncovering the unknown network as little as possible. Despite several theoretical advances in this area, RW based sampling techniques usually make a strong assumption that the samples are in stationary regime, and hence are impelled to leave out the samples collected during the burn-in period. Methods: This work proposes two sampling schemes without burn-in time constraint to estimate the average of an arbitrary function defined on the network nodes, for example, the average age of users in a social network. The central idea of the algorithms lies in exploiting regeneration of RWs at revisits to an aggregated super-node or to a set of nodes, and in strategies to enhance the frequency of such regenerations either by contracting the graph or by making the hitting set larger. Our first algorithm, which is based on reinforcement learning (RL), uses stochastic approximation to derive an estimator. This method can be seen as intermediate between purely stochastic Markov chain Monte Carlo iterations and deterministic relative value iterations. The second algorithm, which we call the Ratio with Tours (RT)-estimator, is a modified form of respondent-driven sampling (RDS) that accommodates the idea of regeneration. Results: We study the methods via simulations on real networks. We observe that the trajectories of RL-estimator are much more stable than those of standard random walk based estimation procedures, and its error performance is comparable to that of respondent-driven sampling (RDS) which has a smaller asymptotic variance than many other estimators. Simulation studies also show that the mean squared error of RT-esti-mator decays much faster than that of RDS with time. Conclusion: The newly developed RW based estimators (RL-and RT-estimators) allow to avoid burn-in period, provide better control of stability along the sample path, and overall reduce the estimation time. Our estimators can be applied in social and complex networks.
Published: 2018
Full Text: View/download PDF

11. Verifying a Concurrent Garbage Collector using a Rely-Guarantee Methodology

Author: Gustavo Petri, David Cachera, Delphine Demange, Jan Vitek, David Pichardie, Yannick Zakowski, Suresh Jagannathan, Software certification with semantic analysis (CELTIQUE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Department of Computer Science [Purdue], Purdue University [West Lafayette], Northeastern University [Boston], ANR 14-CE28-0004, NSF CCF- 1318227, CCF-1544542, SHF-1518844, ONR N00014-15-1-2332, ANR-14-CE28-0004,DISCOVER,Représentations Intermédiaires et Sémantiques de la Concurrence pour les Compilateurs Vérifiés(2014), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique)
Subjects: Soundness, Intermediate language, Computer science, Programming language, Concurrent data structure, Proof assistant, [SCCO.COMP]Cognitive science/Computer science, 020207 software engineering, 0102 computer and information sciences, 02 engineering and technology, computer.software_genre, 01 natural sciences, 010201 computation theory & mathematics, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, 0202 electrical engineering, electronic engineering, information engineering, Compiler, computer, Garbage collection, Program logic
Abstract: International audience; Concurrent garbage collection algorithms are an emblematic challenge in the area of concurrent program verification. In this paper, we address this problem by proposing a mechanized proof methodology based on the popular Rely-Guarantee (RG) proof technique. We design a specific compiler intermediate representation (IR) with strong type guarantees, dedicated support for abstract concurrent data structures, and high-level iterators on runtime internals. In addition, we define an RG program logic supporting an incremental proof methodology where annotations and invariants can be progressively enriched.We formalize the IR, the proof system, and prove the soundness of the methodology in the Coq proof assistant. Equipped with this IR, we prove a fully concurrent garbage collector where mutators never have to wait for the collector.
Published: 2017
Full Text: View/download PDF

12. Error-Bounded and Feature Preserving Surface Remeshing with Minimal Angle Improvement

Author: Pierre Alliez, Dong-Ming Yan, Bedrich Benes, David Bommes, Kaimo Hu, Department of Computer Science [Purdue], Purdue University [West Lafayette], National Laboratory of Pattern Recognition [Beijing] (NLPR), Institute of Automation - Chinese Academy of Sciences, Rheinisch-Westfälische Technische Hochschule Aachen University (RWTH), Geometric Modeling of 3D Environments (TITANE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and European Project: 257474,EC:FP7:ERC,ERC-2010-StG_20091028,IRON(2011)
Subjects: Computational Geometry (cs.CG), FOS: Computer and information sciences, Surface (mathematics), Mathematical optimization, Computer science, 02 engineering and technology, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG], Operator (computer programming), Computer Science - Graphics, feature preserving, Approximation error, error-bounded, surface remeshing, minimal angle improvement, feature intensity, 0202 electrical engineering, electronic engineering, information engineering, Polygon mesh, ComputingMethodologies_COMPUTERGRAPHICS, Approximation algorithm, 020207 software engineering, Geometry processing, Computer Graphics and Computer-Aided Design, Graphics (cs.GR), Vertex (geometry), Bounded function, Signal Processing, Computer Science - Computational Geometry, 020201 artificial intelligence & image processing, Algorithm design, Computer Vision and Pattern Recognition, Algorithm, Software
Abstract: The typical goal of surface remeshing consists in finding a mesh that is (1) geometrically faithful to the original geometry, (2) as coarse as possible to obtain a low-complexity representation and (3) free of bad elements that would hamper the desired application. In this paper, we design an algorithm to address all three optimization goals simultaneously. The user specifies desired bounds on approximation error {\delta}, minimal interior angle {\theta} and maximum mesh complexity N (number of vertices). Since such a desired mesh might not even exist, our optimization framework treats only the approximation error bound {\delta} as a hard constraint and the other two criteria as optimization goals. More specifically, we iteratively perform carefully prioritized local operators, whenever they do not violate the approximation error bound and improve the mesh otherwise. In this way our optimization framework greedily searches for the coarsest mesh with minimal interior angle above {\theta} and approximation error bounded by {\delta}. Fast runtime is enabled by a local approximation error estimation, while implicit feature preservation is obtained by specifically designed vertex relocation operators. Experiments show that our approach delivers high-quality meshes with implicitly preserved features and better balances between geometric fidelity, mesh complexity and element quality than the state-of-the-art., Comment: 14 pages, 20 figures. Submitted to IEEE Transactions on Visualization and Computer Graphics
Published: 2017
Full Text: View/download PDF

13. Prediction of homo- and hetero-protein complexes by protein docking and template-based modeling: a CASP-CAPRI experiment

Author: Eichiro Ichiishi, Dmitri Beglov, Bernard Maigret, Gyu Rie Lee, Artem B. Mamonov, Shoshana J. Wodak, Jonathan C. Fuller, Dima Kozakov, Jong Young Joung, Petr Popov, Xiaofeng Yu, Keehyoung Joo, João P. G. L. M. Rodrigues, Anna Vangone, Koen M. Visscher, Xiaoqin Zou, Paul A. Bates, Andriy Kryshtafovych, Shourya S. Roy Burman, Daisuke Kihara, Romina Oliva, Efrat Ben-Zeev, Jeffrey J. Gray, Yang Shen, Li C. Xue, Sameer Velankar, Emilie Neveu, Shruthi Viswanath, Dina Schneidman-Duhovny, Juan Esquivel-Rodríguez, Mieczyslaw Torchala, Amit Roy, Alexandre M. J. J. Bonvin, David R. Hall, Tanggis Bohnuud, Xusi Han, David W. Ritchie, Ron Elber, Daisuke Kuroda, Zhiwei Ma, Joan Segura, Carlos A. Del Carpio, Nicholas A. Marze, Jong Yun Kim, Andrej Sali, Petras J. Kundrotas, Ezgi Karaca, Neil J. Bruce, Chaok Seok, Panagiotis L. Kastritis, Shen You Huang, Ilya A. Vakser, Lim Heo, Sanbo Qin, Raphael A. G. Chaleil, Adrien S. J. Melquiond, Miguel Romero-Durana, Anisah W. Ghoorah, Surendra S. Negi, Andrey Tovchigrechko, Françoise Ochsenbein, Narcis Fernandez-Fuentes, Liming Qiu, Miriam Eisenstein, Mehdi Nellen, Marie-Dominique Devignes, Lenna X. Peterson, Jinchao Yu, Minkyung Baek, Brian G. Pierce, Hasup Lee, Toshiyuki Oda, Rebecca C. Wade, Raphael Guerois, Juan Fernández-Recio, Iain H. Moal, Edrisse Chermak, Sergei Grudinin, Sangwoo Park, Ivan Anishchenko, Chengfei Yan, Thom Vreven, Kentaro Tomii, Bing Xia, Hyung Rae Kim, Chiara Pallara, Jooyoung Lee, Kazunori D. Yamada, Xianjin Xu, Kenichiro Imai, Zhiping Weng, Luigi Cavallo, Tyler M. Borrman, Jianlin Cheng, Marc F. Lensink, Huan-Xiang Zhou, Jilong Li, Gydo C. P. van Zundert, Brian Jiménez-García, Tsukasa Nakamura, Scott E. Mottarella, Sandor Vajda, Institut de Recherche Interdisciplinaire [Villeneuve d'Ascq] ( IRI ), Université de Lille, Sciences et Technologies-Université de Lille, Droit et Santé-Centre National de la Recherche Scientifique ( CNRS ), European Molecular Biology Laboratory, European Bioinformatics Institute, Genome Center [UC Davis], University of California at Davis, Research Support Computing [Columbia], University of Missouri-Columbia, Bioinformatics Consortium and Department of Computer Science [Columbia], Department of Bioengineering and Therapeutic Sciences, University of California [San Francisco] ( UCSF ), Department of Pharmaceutical Chemistry, Department of Bioengineering and Therapeutic Sciences, Department of Pharmaceutical Chemistry, University of California [San Francisco] ( UCSF ) -California Institute for Quantitative Biosciences, GN7 of the National Institute for Bioinformatics (INB) and Biocomputing Unit, Centro Nacional de Biotecnología (CSIC), Institute of Biological, Environmental and Rural Sciences ( IBERS ), Institute for Computational Engineering and Sciences [Austin] ( ICES ), University of Texas at Austin [Austin], Department of Computer Science, Department of Chemistry, Algorithms for Modeling and Simulation of Nanosystems ( NANO-D ), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Laboratoire Jean Kuntzmann ( LJK ), Université Pierre Mendès France - Grenoble 2 ( UPMF ) -Université Joseph Fourier - Grenoble 1 ( UJF ) -Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique ( CNRS ) -Université Grenoble Alpes ( UGA ) -Université Pierre Mendès France - Grenoble 2 ( UPMF ) -Université Joseph Fourier - Grenoble 1 ( UJF ) -Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique ( CNRS ) -Université Grenoble Alpes ( UGA ) -Institut National Polytechnique de Grenoble ( INPG ), Moscow Institute of Physics and Technology [Moscow] ( MIPT ), Seoul National University [Seoul], Florida State University [Tallahassee] ( FSU ), Computational Algorithms for Protein Structures and Interactions ( CAPSID ), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Department of Complex Systems, Artificial Intelligence & Robotics ( LORIA - AIS ), Laboratoire Lorrain de Recherche en Informatique et ses Applications ( LORIA ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université de Lorraine ( UL ) -Centre National de la Recherche Scientifique ( CNRS ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université de Lorraine ( UL ) -Centre National de la Recherche Scientifique ( CNRS ) -Laboratoire Lorrain de Recherche en Informatique et ses Applications ( LORIA ), Institut National de Recherche en Informatique et en Automatique ( Inria ) -Université de Lorraine ( UL ) -Centre National de la Recherche Scientifique ( CNRS ) -Université de Lorraine ( UL ) -Centre National de la Recherche Scientifique ( CNRS ), University of Mauritius, Biomolecular Modelling Laboratory, The Francis Crick Institute, Lincoln's Inn Fields Laboratory, G-INCPM, Weizmann Institute of Science, Chemical Research Support [Rehovot], Sealy Center for Structural Biology and Molecular Biophysics, The University of Texas Medical Branch ( UTMB ), Program in Bioinformatics and Integrative Biology [Worcester], University of Massachusetts Medical School [Worcester] ( UMASS ), Institut de Biologie Intégrative de la Cellule ( I2BC ), Université Paris-Saclay-Centre National de la Recherche Scientifique ( CNRS ) -Commissariat à l'énergie atomique et aux énergies alternatives ( CEA ) -Université Paris-Sud - Paris 11 ( UP11 ), Bijvoet Center for Biomolecular Research [Utrecht], Utrecht University [Utrecht], Dalton Cardiovascular Research Center [Columbia], Department of Computer Science [Columbia], Informatics Intitute, Department of Biochemistry, University of Missouri, UNIVERSITY OF MISSOURI, Toyota Technological Institute at Chicago [Chicago] ( TTIC ), Department of Biological Sciences, Purdue University, Purdue University [West Lafayette], Department of Computer Science [Purdue], Bioinformatics and Computational Biosciences Branch, Rocky Mountain Laboratories, Molecular and Cellular Modeling Group, Heidelberg Institute of Theoretical Studies, Center for Molecular Biology ( ZMBH ), Universität Heidelberg [Heidelberg], Interdisciplinary Center for Scientiﬁc Computing ( IWR ), Department of Molecular Biosciences [Lawrence], University of Kansas [Lawrence] ( KU ), Computational Biology Research Center ( CBRC ), National Institute of Advanced Industrial Science and Technology ( AIST ), Graduate School of Frontier Sciences, The University of Tokyo, Joint BSC-CRG-IRB Research Program in Computational Biology, Barcelona Supercomputing Center - Centro Nacional de Supercomputacion ( BSC - CNS ), Center for In-Silico Protein Science, Korea Institute for Advanced Study ( KIAS ), Center for Advanced Computation, Department of Biomedical Engineering [Boston], Boston University [Boston] ( BU ), Institute of Biological Diversity, International Pacific Institute of Indiana, Drosophila Genetic Resource Center, Kyoto Institute of Technology, International University of Health and Welfare Hospital ( IUHW Hospital ), International University of Health and Welfare Hospital, Department of Chemical and Biomolecular Engineering [Baltimore], Johns Hopkins University ( JHU ), Program in Molecular Biophysics [Baltimore], King Abdullah University of Science and Technology ( KAUST ), University of Naples, J Craig Venter Institute, Structural Biology Research Center, VIB, 1050 Brussels, Belgium, Institut de Recherche Interdisciplinaire [Villeneuve d'Ascq] (IRI), Université de Lille, Sciences et Technologies-Université de Lille, Droit et Santé-Centre National de la Recherche Scientifique (CNRS), European Bioinformatics Institute [Hinxton] (EMBL-EBI), EMBL Heidelberg, University of California [Davis] (UC Davis), University of California (UC)-University of California (UC), University of Missouri [Columbia] (Mizzou), University of Missouri System, University of California [San Francisco] (UC San Francisco), Centro Nacional de Biotecnología [Madrid] (CNB-CSIC), Consejo Superior de Investigaciones Científicas [Madrid] (CSIC)-Consejo Superior de Investigaciones Científicas [Madrid] (CSIC), Institute of Biological, Environmental and Rural Sciences (IBERS), Institute for Computational Engineering and Sciences [Austin] (ICES), Algorithms for Modeling and Simulation of Nanosystems (NANO-D), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Moscow Institute of Physics and Technology [Moscow] (MIPT), Seoul National University [Seoul] (SNU), Florida State University [Tallahassee] (FSU), Computational Algorithms for Protein Structures and Interactions (CAPSID), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Complex Systems, Artificial Intelligence & Robotics (LORIA - AIS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Biomolecular Modelling Laboratory [London], The Francis Crick Institute [London], Weizmann Institute of Science [Rehovot, Israël], The University of Texas Medical Branch (UTMB), University of Massachusetts Medical School [Worcester] (UMASS), University of Massachusetts System (UMASS)-University of Massachusetts System (UMASS), Institut de Biologie Intégrative de la Cellule (I2BC), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Assemblage moléculaire et intégrité du génome (AMIG), Département Biochimie, Biophysique et Biologie Structurale (B3S), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Institut de Biologie Intégrative de la Cellule (I2BC), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), University of Missouri System-University of Missouri System, Toyota Technological Institute at Chicago [Chicago] (TTIC), Department of Biological Sciences [Lafayette IN], Heidelberg Institute for Theoretical Studies (HITS ), Center for Molecular Biology (ZMBH), Universität Heidelberg [Heidelberg] = Heidelberg University, Interdisciplinary Center for Scientiﬁc Computing (IWR), University of Kansas [Lawrence] (KU), Computational Biology Research Center (CBRC), National Institute of Advanced Industrial Science and Technology (AIST), The University of Tokyo (UTokyo), Barcelona Supercomputing Center - Centro Nacional de Supercomputacion (BSC - CNS), Korea Institute for Advanced Study (KIAS), Boston University [Boston] (BU), International University of Health and Welfare Hospital (IUHW Hospital), Johns Hopkins University (JHU), King Abdullah University of Science and Technology (KAUST), University of Naples Federico II = Università degli studi di Napoli Federico II, J. Craig Venter Institute, VIB-VUB Center for Structural Biology [Bruxelles], VIB [Belgium], Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Droit et Santé-Université de Lille, Sciences et Technologies, University of California-University of California, University of California [San Francisco] (UCSF), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), University of Naples Federico II, Barcelona Supercomputing Center, NMR Spectroscopy, and Sub NMR Spectroscopy
Subjects: 0301 basic medicine, Protein Conformation, alpha-Helical, Protein Folding, Computer science, International Cooperation, Amino Acid Motifs, Oligomer state, Homoprotein, DATA-BANK, computer.software_genre, Molecular Docking Simulation, Biochemistry, CAPRI Round 30, DESIGN, Structural Biology, ALIGN, Blind prediction, AFFINITY, Protein interaction, Enginyeria biomèdica [Àrees temàtiques de la UPC], ZDOCK, Oligomer State, computer.file_format, Articles, Protein structure prediction, Proteïnes--Investigació, 3. Good health, WEB SERVER, CASP, Thermodynamics, Data mining, CAPRI, Protein docking, Molecular Biology, Algorithms, INTERFACES, Protein Binding, [ INFO.INFO-MO ] Computer Science [cs]/Modeling and Simulation, Bioinformatics, STRUCTURAL BIOLOGY, Computational biology, Molecular Dynamics Simulation, Article, 03 medical and health sciences, [ INFO.INFO-BI ] Computer Science [cs]/Bioinformatics [q-bio.QM], Heteroprotein, Humans, Protein binding, Macromolecular docking, Protein Interaction Domains and Motifs, Homology modeling, ALGORITHM, Protein-protein docking, Internet, Binding Sites, Models, Statistical, 030102 biochemistry & molecular biology, Bacteria, Sequence Homology, Amino Acid, Computational Biology, Proteins, Protein Data Bank, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Protein Structure, Tertiary, 030104 developmental biology, Structural biology, Docking (molecular), Protein structure, Protein Conformation, beta-Strand, Protein Multimerization, oligomer state, blind prediction, protein interaction, protein docking, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], computer, Software
Abstract: We present the results for CAPRI Round 30, the first joint CASP-CAPRI experiment, which brought together experts from the protein structure prediction and protein–protein docking communities. The Round comprised 25 targets from amongst those submitted for the CASP11 prediction experiment of 2014. The targets included mostly homodimers, a few homotetramers, and two heterodimers, and comprised protein chains that could readily be modeled using templates from the Protein Data Bank. On average 24 CAPRI groups and 7 CASP groups submitted docking predictions for each target, and 12 CAPRI groups per target participated in the CAPRI scoring experiment. In total more than 9500 models were assessed against the 3D structures of the corresponding target complexes. Results show that the prediction of homodimer assemblies by homology modeling techniques and docking calculations is quite successful for targets featuring large enough subunit interfaces to represent stable associations. Targets with ambiguous or inaccurate oligomeric state assignments, often featuring crystal contact-sized interfaces, represented a confounding factor. For those, a much poorer prediction performance was achieved, while nonetheless often providing helpful clues on the correct oligomeric state of the protein. The prediction performance was very poor for genuine tetrameric targets, where the inaccuracy of the homology-built subunit models and the smaller pair-wise interfaces severely limited the ability to derive the correct assembly mode. Our analysis also shows that docking procedures tend to perform better than standard homology modeling techniques and that highly accurate models of the protein components are not always required to identify their association modes with acceptable accuracy. We are most grateful to the PDBe at the European Bioinformatics Institute in Hinxton, UK, for hosting the CAPRI website. Our deepest thanks go to all the structural biologists and to the following structural genomics initiatives: Northeast Structural Genomics Consortium, Joint Center for Structural Genomics, NatPro PSI:Biology, New York Structural Genomics Research Center, Midwest Center for Structural Genomics, Structural Genomics Consortium, for contributing the targets for this joint CASP-CAPRI experiment. MFL acknowledges support from the FRABio FR3688 Research Federation “Structural & Functional Biochemistry of Biomolecular Assemblies.”
Published: 2016
Full Text: View/download PDF

14. Inference in OSNs via Lightweight Partial Crawls

Author: Bruno Ribeiro, Jithin K. Sreedharan, Konstantin Avrachenkov, Models for the performance analysis and the control of networks (MAESTRO), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Department of Computer Science [Purdue], Purdue University [West Lafayette], Bell Labs Inria Joint Lab, and ADR Network Science
Subjects: Theoretical computer science, Computer science, Computer Networks and Communications, Bayesian inference, Context (language use), 02 engineering and technology, Crawling, computer.software_genre, 01 natural sciences, Social network analysis, 010104 statistics & probability, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Graph sampling, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Random walk on graphs, 0101 mathematics, Random graph, Application programming interface, Social network, business.industry, Node (networking), Social network analysis (criminology), 020206 networking & telecommunications, Distributed algorithm, Hardware and Architecture, Data mining, Web crawler, business, computer, Software
Abstract: International audience; Are Online Social Network (OSN) A users more likely to form friendships with those with similar attributes? Do users at an OSN B score content more favorably than OSN C users? Such questions frequently arise in the context of Social Network Analysis (SNA) but often crawling an OSN network via its Application Programming Interface (API) is the only way to gather data from a third party. To date, these partial API crawls are the majority of public datasets and the synonym of lack of statistical guarantees in incomplete-data comparisons, severely limiting SNA research progress. Using regenerative properties of the random walks, we propose estimation techniques based on short crawls that have proven statistical guarantees. Moreover, our short crawls can be implemented in massively distributed algorithms. We also provide an adaptive crawler that makes our method parameter-free, significantly improving our statistical guarantees. We then derive the Bayesian approximation of the posterior of the estimates, and in addition, obtain an estima-tor for the expected value of node and edge statistics in an equivalent configuration model or Chung-Lu random graph model of the given network (where nodes are connected randomly) and use it as a basis for testing null hypotheses. The theoretical results are supported with simulations on a variety of real-world networks.
Published: 2016
Full Text: View/download PDF

15. Parallelism in Matrix Computations

Author: Ahmed H. Sameh, Efstratios Gallopoulos, Bernard Philippe, Simulations and Algorithms on Grids for Environment (SAGE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Department of Computer Science [Purdue], Purdue University [West Lafayette], Department of Computer Engineering and Informatics [Patras], University of Patras, CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), University of Patras [Patras], Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)
Subjects: Analysis of parallel algorithms, Numerical linear algebra, Matrix-free methods, Computer science, MathematicsofComputing_NUMERICALANALYSIS, 020206 networking & telecommunications, 010103 numerical & computational mathematics, 02 engineering and technology, computer.software_genre, 01 natural sciences, Toeplitz matrix, Algebra, Matrix (mathematics), Fundamental matrix (linear differential equation), Matrix function, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Algorithm, computer, ComputingMilieux_MISCELLANEOUS, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], Sparse matrix
Abstract: This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations. It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded, Vandermonde, Toeplitz, and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of parallel iterative linear system solvers with emphasis on scalable preconditioners, (b) parallel schemes for obtaining a few of the extreme eigenpairs or those contained in a given interval in the spectrum of a standard or generalized symmetric eigenvalue problem, and (c) parallel methods for computing a few of the extreme singular triplets. Part IV focuses on the development of parallel algorithms for matrix functions and special characteristics such as the matrix pseudospectrum and the determinant. The book also reviews the theoretical and practical background necessary when designing these algorithms and includes an extensive bibliography that will be useful to researchers and students alike. The book brings together many existing algorithms for the fundamental matrix computations that have a proven track record of efficient implementation in terms of data locality and data transfer on state-of-the-art systems, as well as several algorithms that are presented for the first time, focusing on the opportunities for parallelism and algorithm robustness.
Published: 2016
Full Text: View/download PDF

16. Security-Aware Business Process as a Service by hiding provenance

Author: Salima Benbernou, Mehdi Bentounsi, Mikhail J. Atallah, Laboratoire d'Informatique Paris Descartes (LIPADE - EA 2517), Université Paris Descartes - Paris 5 (UPD5), Department of Computer Science [Purdue], Purdue University [West Lafayette], and CIFRE 1169-2010
Subjects: [INFO.INFO-WB] Computer Science [cs]/Web, Computer science, Business process, Cloud computing, 02 engineering and technology, BPaaS, Computer security, computer.software_genre, Outsourcing, Business process management, Business process discovery, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Process composition, business.industry, Artifact-centric business process model, Security by design, [INFO.INFO-WB]Computer Science [cs]/Web, Business process modeling, Secure by design, Hardware and Architecture, 020201 artificial intelligence & image processing, Process reuse, business, Law, computer, Software
Abstract: We adress in this paper the security issues that arise when outsourcing business processes in the BPaaS (Business Process as a Service). In particular when sharing and reusing process fragments coming from different organizations for faster and easier development of process-based applications (PBA). The goal is twofold, to preserve the process fragment provenance, i.e., the companies's business activities which provide the reused fragments in order to avoid the competition, and to guarantee the end-to-end availability of PBA to fragment's consumers. We formally define the problem, and offer an efficient anonymization-based protocol. Experiments have been conducted to show the effectiveness of the proposed solution. We address the security issues that arise when outsourcing business processes in the cloud as BPaaS (Business Process as a Service).We formally define the concept of sharing and reusing process fragments for faster and easier development of process-based applications.We provide an efficient anonymization-based protocol to preserve the process fragment provenance, and to guarantee the end-to-end availability of process-based applications.We evaluate the performance of the proposed approach on real datasets.
Published: 2015
Full Text: View/download PDF

17. MPEG-7 based description schemes for multi-level video content classification

Author: Mohand-Said Hacid, Ahmed K. Elmagarmid, Athena Vakali, Aristotle University of Thessaloniki, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), Department of Computer Science [Purdue], and Purdue University [West Lafayette]
Subjects: Information retrieval, Multimedia, Computer science, Multimedia database, Search engine indexing, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, Video modeling, computer.software_genre, Description Definition Language, Signal Processing, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, Computer Vision and Pattern Recognition, XML schema, Representation (mathematics), computer, Implementation, computer.programming_language
Abstract: International audience; MPEG-7 has emerged as the standard for multimedia data content description for efficiently describing multimedia content. In this context, its primary goal is to provide flexible and effective searching and retrieval of multimedia resources. Most of the earlier work on MPEG-7 description schemes (DSs) and descriptors (Ds) focuses on the description of a single multimedia document, whereas MPEG-7 can be further exploited to support more advances implementations under multimedia database systems. Therefore, it is important to reconsider issues related to high level multimedia modeling and representation, in the light of the MPEG-7 perspective. In this paper, we propose a high level multimedia representation and description scheme based on multi-level video modeling and semantic video classification. The proposed multi-level multimedia representation and DSs are expected to support more effective video content indexing and accessing operations. The presented DSs and Ds are further described by using the XML Schema language, which has been adopted as the basis of the Description Definition Language (DDL) of the MPEG-7 standard.
Published: 2004
Full Text: View/download PDF

18. Atomicity Refinement for Verified Compilation

Author: Jan Vitek, Vincent Laporte, Gustavo Petri, David Pichardie, Suresh Jagannathan, Department of Computer Science [Purdue], Purdue University [West Lafayette], Software certification with semantic analysis (CELTIQUE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)
Subjects: Mechanized proof assistant (Coq), Correctness, Java, Computer science, Concurrency, Compiler, Thread (computing), 0102 computer and information sciences, 02 engineering and technology, computer.software_genre, 01 natural sciences, Synchronization (computer science), 0202 electrical engineering, electronic engineering, information engineering, Abstraction (linguistics), computer.programming_language, Atomicity, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Programming language, Computer Graphics and Computer-Aided Design, Memory management, 010201 computation theory & mathematics, 020201 artificial intelligence & image processing, Memory model, computer, Software, Garbage collection, Memory semantics
Abstract: International audience; We consider the verified compilation of high-level managed languages like Java or C# whose intermediate representations provide support for shared-memory synchronization and automatic memory management. Our development is framed in the context of the Total Store Order relaxed memory model. Ensuring com-plier correctness is challenging because high-level actions are translated into sequences of non-atomic ac-tions with compiler-injected snippets of racy code; the behavior of this code depends not only on the actions of other threads, but also on out-of-order executions performed by the processor. A naïve proof of correctness would require reasoning over all possible thread interleavings. In this paper we propose a refinement-based proof methodology that precisely relates concurrent code expressed at different abstraction levels, cognizant throughout of the relaxed memory semantics of the underlying processor. Our technique allows the compiler writer to reason compositionally about the atomicity of low-level concurrent code used to implement man-aged services. We illustrate our approach with examples taken from the verification of a concurrent garbage collector.
Published: 2014

19. Plan B: A Buffered Memory Model for Java

Author: Lei Zhao, Delphine Demange, Suresh Jagannathan, Jan Vitek, Vincent Laporte, David Pichardie, Software certification with semantic analysis (CELTIQUE), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), Department of Computer Science [Purdue], Purdue University [West Lafayette], Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)
Subjects: Java, Computer science, Java Memory Model, Programming language, strictfp, Concurrency, [SCCO.COMP]Cognitive science/Computer science, Generics in Java, computer.software_genre, Java concurrency, Computer Graphics and Computer-Aided Design, Bytecode, Real time Java, Virtual machine, Compiler, Memory model, computer, Java annotation, Implementation, Software, Java Modeling Language, computer.programming_language
Abstract: International audience; Recent advances in verification have made it possible to envision trusted implementations of real-world languages. Java with its type-safety and fully specified semantics would appear to be an ideal candidate; yet, the complexity of the translation steps used in production virtual machines have made it a challenging target for verifying compiler technology. One of Java's key innovations, its memory model, poses significant obstacles to such an endeavor. The Java Memory Model is an ambitious attempt at specifying the behavior of multithreaded programs in a portable, hardware agnostic, way. While experts have an intuitive grasp of the properties that the model should enjoy, the specification is complex and not well-suited for integration within a verifying compiler infrastructure. Moreover, the specification is given in an axiomatic style that is distant from the intuitive reordering-based reasonings traditionally used to justify or rule out behaviors, and ill suited to the kind of operational reasoning one would expect to employ in a compiler. This paper takes a step back, and introduces a Buffered Memory Model (BMM) for Java. We choose a pragmatic point in the design space sacrificing generality in favor of a model that is fully characterized in terms of the reorderings it allows, amenable to formal reasoning, and which can be efficiently applied to a specific hardware family, namely x86 multiprocessors. Although the BMM restricts the reorderings compilers are allowed to perform, it serves as the key enabling device to achieving a verification pathway from bytecode to machine instructions. Despite its restrictions, we show that it is backwards compatible with the Java Memory Model and that it does not cripple performance on TSO architectures.
Published: 2013

20. Privacy-Preserving Business Process Outsourcing

Author: Mikhail J. Atallah, Mehdi Bentounsi, Salima Benbernou, Laboratoire d'Informatique Paris Descartes (LIPADE - EA 2517), Université Paris Descartes - Paris 5 (UPD5), Department of Computer Science [Purdue], Purdue University [West Lafayette], and CIFRE 2010/1169
Subjects: Information privacy, Process management, Privacy-Preserving, [INFO.INFO-WB] Computer Science [cs]/Web, Computer science, business.industry, Process (engineering), Data_MISCELLANEOUS, [INFO.INFO-WB]Computer Science [cs]/Web, Cloud computing, BPaaS, Computer security, computer.software_genre, Outsourcing, Privacy preserving, Business process discovery, Cost reduction, Web service, business, computer
Abstract: International audience; Many cloud providers offer on demand applications as Business Process as a Service (BPaaS), allowing companies to outsource their processes. For cost saving, some process fragments can be reused on the cloud regardless of privacy risks. In this paper, we propose an anonymization-based approach to preserve client business activity while sharing process fragments between organizations on the cloud.
Published: 2012
Full Text: View/download PDF

21. Component-Oriented Development for Real-Time Java

Author: Ales Plsek, Michal Malohlava, Frédéric Loiret, Department of Computer Science [Purdue], Purdue University [West Lafayette], Adaptive Distributed Applications and Middleware (ADAM), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Distributed Systems Research Group (DSRG), Charles University [Prague] (CU), Higuera-Toledano, M. Teresa, Wellings, and Andy J.
Subjects: Architecture description language, Java, Computer science, Process (engineering), Programming language, media_common.quotation_subject, 020206 networking & telecommunications, 020207 software engineering, 02 engineering and technology, Systems modeling, computer.software_genre, Programming style, Real time Java, 0202 electrical engineering, electronic engineering, information engineering, Programming paradigm, computer, Java annotation, computer.programming_language, media_common
Abstract: International audience; The Real-Time Specification for Java (RTSJ) offers developers an attractive platform for development of software that is composed of variously stringent real-time and non real-time tasks. However, the RTSJ introduces a programming model involving several non-intuitive rules and restrictions which make systems modeling and development a complex and error-prone task. In this chapter we introduce an advanced software engineering technology that allows developers to address these challenges - component-oriented development. In the first part, we present the general concepts and identify the key benefits of this technology. We further show one of the possible approaches on how to embrace this technology when mitigating the complexities of RTSJ development - the Hulotte framework. The framework provides a continuum between the component-oriented design and implementation process of RTSJ systems. The RTSJ concepts are treated as first-class entities which enables the modeling and automatized preparation of their implementation by em- ploying code-generation techniques. We conclude this chapter with an extensive case study comparing object-oriented and component-oriented implementation of the Collision Detector Benchmark. Our empirical evaluation shows that the performance overhead of the framework is minimal in comparison to manually written object-oriented applications without imposing any restrictions on the programming style.
Published: 2012

22. The 'Art' of Programming Gossip-based Systems

Author: Pascal Felber, Patrick Eugster, Fabrice Le Fessant, Department of Computer Science [Purdue], Purdue University [West Lafayette], Institut d'Informatique [Neuchâtel] (IIUN), Université de Neuchâtel (UNINE), As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), Université de Rennes (UR)-Inria Saclay - Ile de France, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Theoretical computer science, Computer science, Interface (Java), business.industry, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Probabilistic logic, Intrinsics, Gossip, Programming paradigm, General Earth and Planetary Sciences, Gossip protocol, Imperfect, Artificial intelligence, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Completeness (statistics), business, General Environmental Science
Abstract: International audience; How does one best go about building actual gossip-based protocols? Trying to answer this question has brought us to address two preliminary questions, namely (1) what the in- trinsics of such systems or protocols are, and (2) what kind of applications would in the end be built on top of such protocols. We address the first question by arguing that gossip-based protocols are all built following one and the same pattern, and describing three building blocks which we claim are used to support this recurrent pattern—most notably a source of randomness. We validate these claims by devising simplified versions of well-known protocols, in a layered fashion, on top of a conceptual interface describing these basic services. The second question is addressed by ar- guing that gossip-based protocols exhibit some probabilistic or imperfect flavor (e.g., probabilistic or partial completion), and by proposing to take such probabilistic behavior into ac- count when devising interfaces for applications building on top of gossip-based protocols. We argue for inherent support for these probabilities in the programming model.
Published: 2007

23. On the multisearching problem for hypercubes

Author: Mikhail J. Atallah, Andreas Fabri, Department of Computer Science [Purdue], Purdue University [West Lafayette], Geometry, Algorithms and Robotics (PRISME), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Ce travail a été partiellement soutenu par National Science Foundation et Esprit Research Basic Action N°7141 (ALCOM II), and INRIA
Subjects: Control and Optimization, Parallel algorithms, Computer science, Trapezoidal decomposition, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Parallel algorithm, Multisearch, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Combinatorics, Set (abstract data type), Computer Science::Hardware Architecture, Multisearching, 0202 electrical engineering, electronic engineering, information engineering, Point location, Time complexity, Mathematics, Discrete mathematics, Sequence, Computer Sciences, Sorting, ComputerSystemsOrganization_PROCESSORARCHITECTURES, Binary logarithm, Computational geometry, Search tree, Computer Science Applications, 020202 computer hardware & architecture, Hypercube, Computational Mathematics, Computational Theory and Mathematics, 010201 computation theory & mathematics, 020201 artificial intelligence & image processing, Geometry and Topology, Constant (mathematics)
Abstract: We build on the work of Dehne and Rau-Chaplin and give improved bounds for the multisearch problem on a hypercube. This is a parallel search problem where the elements in the structure S to be searched are totally ordered, but where it is not possible to compare in constant time any two given queries q and q'. This problem is fundamental in computational geometry, for example it models planar point location in a slab. More precisely, we are given on a n-processor hypercube a sorted n-element sequence S and a set Q of n queries and we need to find for each query q [??]Q its location in the sorted S. Note that one cannot solve this problem by sorting S[??] Q, because every comparison- based parallel sorting algorithm needs to compare a pair q, q' [??]Q in constant time. We present an improved algorithm for the multisearch problem, one that takes 0(log n(log log n)3) time on a n-processor hypercube. This essentially replaces a logarithmic factor in the time complexities of previous schemes by a (log log n)3 factor. The hypercube model for which we claim our bounds is the standard one, with 0(1) memory registers per processor, and with one-port communication. Each register can store 0(log n) bits, so that a processor knows its ID.
Published: 1994
Full Text: View/download PDF

24. Co-Design and Verification of an Available File System

Author: Patrick Eugster, Marc Shapiro, Mahsa Najafzadeh, Department of Computer Science [Purdue], Purdue University [West Lafayette], DistributEd aLgorithms and sYStems (DELYS), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Isil Dillig, and Jens Palsberg
Subjects: File system, Structure (mathematical logic), Computer science, Semantics (computer science), Concurrency, Strong consistency, 0102 computer and information sciences, 02 engineering and technology, computer.software_genre, 01 natural sciences, 010201 computation theory & mathematics, POSIX, 0202 electrical engineering, electronic engineering, information engineering, Operating system, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], Sequential model, Distributed File System, computer
Abstract: International audience; Distributed file systems play a vital role in large-scale enterprise services. However, the designer of a distributed file system faces a vexing choice between strong consistency and asynchronous replica-tion. The former supports a standard sequential model by synchronising operations, but is slow and fragile. The latter is highly available and responsive, but exposes users to concurrency anomalies. In this paper, we describe a rigorous and general approach to navigating this trade-off by leveraging static verification tools that allow to verify different file system designs. We show that common file system operations can run concurrently without synchronisation, while still retaining a semantics reasonably similar to Posix hierarchical structure. The one exception is the move operation, for which we prove that, unless synchronised, it will have an anomalous behaviour.
Full Text: View/download PDF

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources

Refine your results

24 results on '"Department of Computer Science [Purdue]"'

1. Urban Brush: Intuitive and Controllable Urban Layout Editing

2. SHREC 2020: Classification in cryo-electron tomograms

3. Semi‐Procedural Textures Using Point Process Texture Basis Functions

4. Interactive example-based terrain authoring with conditional generative adversarial networks

5. Authoring landscapes by combining ecosystem and terrain erosion simulation

6. Dendry: A Procedural Model for Dendritic Patterns

7. A Review of Digital Terrain Modeling

8. Verifying a Concurrent Garbage Collector with a Rely-Guarantee Methodology

9. Feedforward Neural Networks for Caching: Enough or Too Much?

10. Revisiting random walk based sampling in networks: Evasion of burn-in period and frequent regenerations

11. Verifying a Concurrent Garbage Collector using a Rely-Guarantee Methodology

12. Error-Bounded and Feature Preserving Surface Remeshing with Minimal Angle Improvement

13. Prediction of homo- and hetero-protein complexes by protein docking and template-based modeling: a CASP-CAPRI experiment

14. Inference in OSNs via Lightweight Partial Crawls

15. Parallelism in Matrix Computations

16. Security-Aware Business Process as a Service by hiding provenance

17. MPEG-7 based description schemes for multi-level video content classification

18. Atomicity Refinement for Verified Compilation

19. Plan B: A Buffered Memory Model for Java

20. Privacy-Preserving Business Process Outsourcing

21. Component-Oriented Development for Real-Time Java

22. The 'Art' of Programming Gossip-based Systems

23. On the multisearching problem for hypercubes

24. Co-Design and Verification of an Available File System

Catalog

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Journal

Database

Publisher

24 results on '"Department of Computer Science [Purdue]"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources