Filters








10,608 Hits in 6.2 sec

Differential Invariants as the Base of Triangulated Surface Registration

Pavel Krsek, Tomáš Pajdla, Václav Hlaváč
2002 Computer Vision and Image Understanding  
We propose a hybrid registration algorithm that combines advantages of working with small amounts of interest points (to attain computational speed), estimates the Euclidean transform matching both surfaces  ...  , and uses all available points and the iterative closest reciprocal point algorithm to refine the estimate and finally match surfaces (to attain high precision, good initial estimation avoids local minima  ...  Double Verification and Refinement of the Hypothesis The hypothesis is submitted for double verification and refinement.  ... 
doi:10.1006/cviu.2002.0980 fatcat:4vnawuxsmjapph5rjv63og4t6i

pfm-cracks: A parallel-adaptive framework for phase-field fracture propagation

Timo Heister, Thomas Wick
2020 Software Impacts  
Acknowledgments We thank Katrin Mang Clemson University is acknowledged for generous allotment of compute time on Palmetto cluster.  ...  Educational impact We decided to keep the same structure as a typical deal.II tutorial step.  ...  Potential future work is in experimental verifications and validations (very little work known to date), for instance several examples in elasticity are provided in [32] from which we have computed some  ... 
doi:10.1016/j.simpa.2020.100045 fatcat:sge2jwzhv5fzvbu3l2s4razmwi

Slicing-based Reductions for Rebeca

Hamideh Sabouri, Marjan Sirjani
2010 Electronical Notes in Theoretical Computer Science  
We also propose a static slicing algorithm for deadlock detection (in absence of any particular property).  ...  Slicing is a program analysis technique which can be used for reducing the size of the model and avoid state explosion in model checking.  ...  In the third slicing algorithm, step-wise slicing, an overapproximation of the original model is computed and then based on the verification result, the reduced model is refined if needed.  ... 
doi:10.1016/j.entcs.2009.12.039 fatcat:exia5xm2drafdnhci4s7pgfgaq

A comparison of tools for teaching formal software verification

Ingo Feinerer, Gernot Salzer
2008 Formal Aspects of Computing  
Acknowledgments We are grateful to two anonymous referees for their detailed and constructive criticism. Their advice lead to substantial improvements.  ...  Educational background Curricula of studies in computer science and software engineering currently undergo (or recently underwent) more or less dramatic changes at many universities.  ...  Jml annotations in the program (like loop invariants) are also useful for guiding the prover and thus constitute one more step towards automation of proofs.  ... 
doi:10.1007/s00165-008-0084-5 fatcat:ganizwaybjhcxeynuk33sga4rm

Numerical Verification Assessment in Computational Biomechanics [chapter]

Ekaterina Auer, Wolfram Luther
2009 Lecture Notes in Computer Science  
We address verification and validation assessment in PROREOP with special emphasis on numerical accuracy and performance.  ...  The use of such instruments is exemplified for the process of accurate femur reconstruction.  ...  One possible solution to these problems is to use computer-aided proofs, real number algorithms or algorithms with result verification.  ... 
doi:10.1007/978-3-642-01591-5_9 fatcat:kixb4uxudjfibh4ahsemaqgddy

Integrating computational thinking with K-12 science education using agent-based computation: A theoretical framework

Pratim Sengupta, John S. Kinnebrew, Satabdi Basu, Gautam Biswas, Douglas Clark
2013 Education and Information Technologies : Official Journal of the IFIP technical committee on Education  
We then present a critical review of the literature in educational computing, and propose a set of guidelines for designing learning environments on science topics that can jointly foster the development  ...  using a particular genre of computation: agent-based computation.  ...  Acknowledgements Thanks to Amanda Dickes, Amy Voss Farris, Gokul Krishnan, Brian Sulcer, Jaymes Winger, and Mason Wright (in no particular order), who helped in developing the system and running the 35  ... 
doi:10.1007/s10639-012-9240-x fatcat:njxfoy52qba3vcwz76biiu2ydi

VaLiPro: Linear Programming Validator for Cluster Computing Systems [article]

Leonid B. Sokolinsky, Irina M. Sokolinskaya
2021 arXiv   pre-print
The article presents and evaluates a scalable algorithm for validating solutions of linear programming problems on cluster computing systems.  ...  We provide the results of large-scale computational experiments on a cluster computing system to study the scalability of the VaLiPro algorithm.  ...  Acknowledgements The reported study was partially funded by the Russian Foundation for Basic Research (project No. 20-07-00092-a) and the Ministry of Science and Higher Education of the Russian Federation  ... 
arXiv:2106.05485v2 fatcat:o7bdxqfc25gzdd37po7jvmbyja

Application of the Occupational Analysis of Computational Thinking-Enabled STEM Professionals as a Program Assessment Tool

Joyce Malyn-Smith, Irene Lee
2012 The Journal of Computational Science Education  
This paper describes the application of findings from the National Science Foundation's project on Computational Thinking (CT) in America's Workplace to program assessment.  ...  The article presents ways this analysis can be used as a framework to guide the development of STEM learning outcomes and activities, and sets of directions for future work.  ...  in K-12 education.  ... 
doi:10.22369/issn.2153-4136/3/1/1 fatcat:4lrx3czu7zh6dcgcx3whne7bke

40 Years of Formal Methods [chapter]

Dines Bjørner, Klaus Havelund
2014 Lecture Notes in Computer Science  
By computing science we shall understand the study of and knowledge about how to construct those structures. The term programming methodology is here used synonymously with computing science.  ...  In this "40 years of formal methods" essay we shall first delineate, Sect. 1, what we mean by method, formal method, computer science, computing science, software engineering, and model-oriented and algebraic  ...  That document, in view of the availability of [120] , oncentrated on the analysis and verification domain. We dedicate this to our colleague of many years, Chris George.  ... 
doi:10.1007/978-3-319-06410-9_4 fatcat:5hrbtlj2vzc4zidekw6hoo5g7q

SMT Techniques for Fast Predicate Abstraction [chapter]

Shuvendu K. Lahiri, Robert Nieuwenhuis, Albert Oliveras
2006 Lecture Notes in Computer Science  
We also propose and evaluate a scheme for incremental refinement of approximations for predicate abstraction in the above framework.  ...  In this work, we demonstrate the use for this operation of a decision procedure based on the DPLL(T) framework for SAT Modulo Theories (SMT).  ...  In fact, our experiments reveal that (i) for small cube sizes, the computation times are extremely small, and that (ii) computing the full G P (ϕ) in successive steps slightly increasing the cube size  ... 
doi:10.1007/11817963_39 fatcat:bk53v3r7dvd4bp3wc4hrjmhhoq

ROCHADE: Robust Checkerboard Advanced Detection for Camera Calibration [chapter]

Simon Placht, Peter Fürsattel, Etienne Assoumou Mengue, Hannes Hofmann, Christian Schaller, Michael Balda, Elli Angelopoulou
2014 Lecture Notes in Computer Science  
On the detected pattern we apply a surface fitting based subpixel refinement specifically tailored for checkerboard X-junctions.  ...  We present a new checkerboard detection algorithm which is able to detect checkerboards at extreme poses, or checkerboards which are highly distorted due to lens distortion even on low-resolution images  ...  This publication was supported by the German Federal Ministry of Education and Research as part of the Spitzencluster Medical Valley program 13GW0029A.  ... 
doi:10.1007/978-3-319-10593-2_50 fatcat:dlsibc7ikvdrvnzmfo7jskv2ji

Teaching formal methods in the context of software engineering

Shaoying Liu, Kazuhiro Takahashi, Toshinori Hayashi, Toshihiro Nakayama
2009 ACM SIGCSE Bulletin  
These techniques have been tested over the last fifteen years in our formal methods education programs for undergraduate and graduate students at universities as well as practitioners at companies.  ...  In this paper, we discuss the importance of such a teaching paradigm and describe several specific techniques for teaching formal methods.  ...  We have adopted a systematic, step-by-step curriculum for formal methods education in the Department of Computer Science at Hosei University.  ... 
doi:10.1145/1595453.1595457 fatcat:doglbmnhtbbetm2rhrrvyfn7hi

Realizing the value of social media requires innovative computing research

Ben Shneiderman, Jennifer Preece, Peter Pirolli
2011 Communications of the ACM  
Adventurous researchers are already using social media to improve or speed their research, but the next step will be paradigm-shifting methods for conducting scholarly research in the computing sciences  ...  Copyright held by author. the next step will be paradigm-shifting methods for conducting scholarly research in the computing sciences and in every discipline.  ... 
doi:10.1145/1995376.1995389 fatcat:zz5ysjeohraovlkkjnslrh6fqe

Intelligent Systems and Formal Methods in Software Engineering

Bernhard Beckert, Tony Hoare, Reiner Hahnle, Douglas Smith, Cordell Green, Silvio Ranise, Cesare Tinelli, Thomas Ball, Sriram Rajamani
2006 IEEE Intelligent Systems  
Confidence in the correctness of the proof is very high because it has been generated and checked automatically by computer.  ...  The lure of these "small engines" is that you can use whatever algorithms and data structures are best for T, typically leading to better performance.  ...  He has proposed program verification as a computer science Grand Challenge. Deductive software verification is a core technology of formal methods.  ... 
doi:10.1109/mis.2006.117 fatcat:e3gffxrewbhubelnmkv7rvrf7i

Quality emphasis at IBM's Software Engineering Institute

M. B. Carpenter, H. K. Hallman
1985 IBM Systems Journal  
As computer science curricula were being developed, it was natural for the terminology in the literature to be used.  ...  The philosophy of stepwise refinement is that movement from a higher to a lower level of defi- nition should be taken in small, and therefore verifiable, steps, with each step containing inter- mediate  ... 
doi:10.1147/sj.242.0121 fatcat:oqs3iulfr5esnoh2tyidw6tw7i
« Previous Showing results 1 — 15 out of 10,608 results