FLoC/SAT 10 Edinburgh, Scotland, UK
|
|
|
- Dana O’Brien’
- 5 years ago
- Views:
Transcription
1 July 14, 2010 FLoC/SAT 10 Edinburgh, Scotland, UK
2 What is SAT-Race? Competition for sequential/parallel SAT solvers Only industrial/application category benchmarks (no handcrafted or random) Short run-times (15 minutes timeout per instance) Mixture of satisfiable / unsatisfiable instances (thus not suitable for local-search solvers) Black-box solvers permitted 3 tracks: Main Track: Sequential CNF Special Track 1: Parallel CNF Special Track 2: Sequential AIG
3 Organizers Chair Carsten Sinz (Karlsruhe Institute of Technology, Germany) Advisory Panel Aarti Gupta (NEC Labs America, USA) Youssef Hamadi (Microsoft Research, UK) Himanshu Jain (Synopsys, USA) Daniel Le Berre (Université d'artois, France) Panagiotis Manolios (Northeastern University, USA) Yakov Novikov (OneSpin Solutions, Germany) Technical Management Florian Merz (Karlsruhe Institute of Technology, Germany)
4 Entrants Received 32 solvers by 23 submitters from 9 nations SAT-Race 2008: 43 solvers by 36 submitters from 16 nations SAT-Race 2006: 29 solvers by 23 submitters from 13 nations Australia" 1" Austria" 4" China" 1" France" 7" France / UK" 4" Germany 4 Iran 1" Spain" 1" Sweden" 4" USA" 5" 2 industrial solvers, 27 academic, 3 mixed 21 solvers in Main Track, 8 in Parallel Track, 3 in AIG Track
5 Qualification To ascertain solver correctness and efficiency One qualification round 100 benchmark instances (SAT-Race 2008) Successful participation required to participate in finals Qualification round took place in May
6 Results Qualification Round Main Track 19 solvers qualified (out of 21) by solving at least 70 out of 100 instances (no solver produced errors) 2 solvers produced wrong results during finals Parallel Track 6 solvers qualified (out of 8) by solving at least 70 out of 100 instances (1 solver had produced wrong results and was withdrawn) 1 solver produced wrong results during finals AIG Track: All 3 solvers qualified by solving more than 50 out of 100 instances Overall result: 28 (out of 32) solvers participated in finals 17 in Main Track (plus 3 parallel solvers running in sequential mode), 5 in Parallel Track, 3 in AIG Track One solver withdrawn, 3 solvers with wrong results during finals
7 Solvers Participating in Finals: Main Track Solver Affiliation Solver Affiliation Barcelogic TU Catalonia, Spain oprailleur CRIL-CNRS, France borg-sat U Texas, USA PicoSAT JKU Linz, Austria CircleSAT Donghua U, China PrecoSAT JKU Linz, Austria CryptoMiniSat glucose glucoser lingeling LySAT INRIA, France CRIL, France CRIL-CNRS, France JKU Linz, Austria INRIA-Microsoft JC, France riss rcl SApperloT SAT-Power SATHYS TU Dresden, Germany CRIL-CNRS, France U Tübingen, Germany U Isfahan, Iran CRIL-CNRS, France MiniSat Sörensson R&D, Sweden red: new solvers
8 Solvers Participating in Finals: Special Tracks Parallel Track: AIG Track: Solver Affiliation Solver Affiliation antom U Freiburg, Germany kw_aig Oepir, Sweden ManySAT 1.1 INRIA-Microsoft JC, France MiniSat++ Sörensson R&D, Sweden ManySAT 1.5 INRIA-Microsoft JC, France NFLSAT CMU, USA plingeling JKU Linz, Austria SArTagnan U Tübingen, Germany
9 Benchmark Instances: CNF Corpus of 490 instances Hardware verification / software verification / cryptography / mixed Mainly from former SAT Competitions/Races Additional software verification instances from NEC Selected 100 instances randomly 30 hardware verification (IBM, Velev, Manolios) 30 software verification (Babic, Bitverif, Fuhs, NEC, Post) 15 cryptography (desgen, md5gen, Mironov-Zhang) 25 mixed (Anbulagan, Bioinformatics, Diagnosis, ) Up to 10,950,109 variables, 32,697,150 clauses Smallest instance: 1694 variables, 5726 clauses
10 Sizes of CNF Benchmark Instances 1e+08 1e+07 #clauses 1e Hardware Verification Software Verification Cryptanalysis Mixed e+06 1e+07 1e+08 #variables
11 Benchmark Instances: AIG Corpus of 538 instances 9 Groups of Benchmark Sets (Anbulagan / Babic / c32sat / Mironov-Zhang / IBM / Intel / Manolios / Palacios / Mixed) Selected 100 instances randomly
12 Parallel Track: Special Rules Solver can use all 8 cores of a machine (2x Intel Xeon Quad-Core) Measured wall-clock time instead of CPU usage time Run-times for multi-threaded solvers can have high deviations (especially for satisfiable instances) 3 runs for each solver on each instance Instance considered solved, if solved in first run (SAT-Race 2008: at least 1 out of 3 runs)
13 Scoring Main criterion: number of solved instances Average run-time on solved instances to break ties
14 Computing Environment Linux-Cluster at Karlsruhe Institute of Technology (KIT) 20 compute nodes 2 Intel Xeon E5430 Processors (Quad-Core, 2.66 GHz) per node 32 GB of main memory per node Both 32-bit and 64-bit binaries supported Sequential/AIG Track: only one core per solver Parallel Track: 8 cores per solver
15 Results
16 Special Track 2 (AIG Sequential) solved instances 58 solved instances 53 solved instances
17 Runtime Comparison: AIG Track MiniSat++ kw_aig NFLSAT 700 runtime (sec.) #solved instances
18 Special Track 1 (CNF Parallel) solved instances 78 solved instances 72 solved instances next best solver: 70 solved
19 Runtime Comparison: Parallel Track plingeling ManySAT-1.5 ManySAT-1.1 SArTagnan antom runtime (sec.) #solved instances
20 Main Track (CNF Sequential) solved instances 74 solved instances 71 solved instances next best solver: 69 solved
21 Runtime Comparison: Main Track 900 runtime (sec.) CryptoMiniSat lingeling SAT-Power PrecoSAT MiniSat Barcelogic LySAT rcl borg-sat CircleSAT ManySAT-1.1 SApperloT antom PicoSAT glucose SATHYS ManySAT-1.5 glucoser riss orpailleur #solved instances
22 Runtime Comparison: CNF Seq.+Par. 900 runtime (sec.) plingeling ManySAT-1.5_par CryptoMiniSat lingeling ManySAT-1.1_par SAT-Power SArTagnan antom_par PrecoSAT MiniSat Barcelogic LySAT rcl borg-sat CircleSAT ManySAT-1.1_seq SApperloT antom_seq PicoSAT glucose SATHYS ManySAT-1.5_seq glucoser riss orpailleur #solved instances
23 Student Prize Special prize for a solver submitted by a (team of) (PhD) student(s) Two prizes: Main Track: SAT-Power by Abdorrahim Bahrami (3 rd place in Main Track) Parallel Track: SArTagnan by Stephan Kottler (4 th place in Parallel Track)
24 Conclusion Any Progress compared to SAT-Competition 2009? SAT-Race 2010 winner can solve 5 more instances than SAT-Competition 2009 winner (SAT+UNSAT Application Category) on our benchmark set 3 solvers (plus 4 parallel solvers) outperform SAT- Competition 2009 winner Parallel solvers gain importance; improved robustness (only small differences on 3 runs) Many new solvers and participants
25 SAT-Race 2010 on the Web:
Carsten Sinz Nina Amla João Marques Silva Emmanuel Zarpas Daniel Le Berre Laurent Simon
Carsten Sinz Nina Amla João Marques Silva Emmanuel Zarpas Daniel Le Berre Laurent Simon What is SAT-Race? Small SAT-Competition Only industrial category benchmarks (no handcrafted and random) Short run-times
Overview and Analysis of the SAT Challenge 2012 Solver Competition
Overview and Analysis of the SAT Challenge 2012 Solver Competition Adrian Balint a,1, Anton Belov b,2, Matti Järvisalo c,3,, Carsten Sinz d,4 a Institute of Theoretical Computer Science, Ulm University,
Sat4j 2.3.2: on the fly solver configuration System Description
Journal on Satisfiability, Boolean Modeling and Computation 8 (2014) 197-202 Sat4j 2.3.2: on the fly solver configuration System Description Daniel Le Berre Stéphanie Roussel Université Lille Nord de France,
Towards Ultra Rapid Restarts
Towards Ultra Rapid Restarts Shai Haim 1 and Marijn Heule 2 1 University of New South Wales and NICTA, Sydney, Australia 2 Delft University of Technology, Delft, The Netherlands Abstract. We observe a
COMPARE 2012 Comparative Empirical Evaluation of Reasoning Systems
(Eds.) COMPARE 2012 Comparative Empirical Evaluation of Reasoning Systems Proceedings of the International Workshop June 30, 2012, Manchester, United Kingdom Editors Karlsruhe Institute of Technology Institute
The Effect of Scrambling CNFs
Armin Biere 1 and Marijn J.H. Heule 2 1 Johannes Kepler University Linz 2 University of Texas at Austin Abstract It has been an ongoing, decades-long debate about how SAT solvers and in general different
Max-SAT Evaluation 2007
Max-SAT Evaluation 2007 Josep Argelich (Universitat de Lleida) Chu Min Li (Université de Picardie) Felip Manyà (Universitat de Lleida) Jordi Planes (University of Southampton) Objectives Evaluate the performance
A Parallel Monte-Carlo Tree Search Algorithm
A Parallel Monte-Carlo Tree Search Algorithm Tristan Cazenave and Nicolas Jouandeau LIASD, Université Paris 8, 93526, Saint-Denis, France cazenave@ai.univ-paris8.fr n@ai.univ-paris8.fr Abstract. Monte-Carlo
Exploring Predictability of SAT/SMT Solvers
Exploring Predictability of SAT/SMT Solvers Robert Brummayer Johannes Kepler University Linz, Austria robert.brummayer@jku.at Duckki Oe The University of Iowa Iowa City, Iowa, USA duckki-oe@uiowa.edu Aaron
A new mixed integer linear programming formulation for one problem of exploration of online social networks
manuscript No. (will be inserted by the editor) A new mixed integer linear programming formulation for one problem of exploration of online social networks Aleksandra Petrović Received: date / Accepted:
Towards Real-Time Volunteer Distributed Computing
Towards Real-Time Volunteer Distributed Computing Sangho Yi 1, Emmanuel Jeannot 2, Derrick Kondo 1, David P. Anderson 3 1 INRIA MESCAL, 2 RUNTIME, France 3 UC Berkeley, USA Motivation Push towards large-scale,
Online Supplement for An integer programming approach for fault-tolerant connected dominating sets
Submitted to INFORMS Journal on Computing manuscript (Please, provide the mansucript number!) Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes
Putting Queens in Carry Chains
Faculty of Computer Science Institute for Computer Engineering Putting Queens in Carry Chains Thomas B. Preußer Bernd Nägel Rainer G. Spallek Πάφoς, HIPEAC WRC 9 Itinerary Problem and Complexity Overview
Min Zinc Challenge 2017
Min Zinc Challenge 2017 P Peter J. Stuckey Challenge 2017 20 benchmarks * 5 instances = 100 instances 20 minutes time limit Scoring system: each instance compares each pair of solvers 1 point for every
On the Benefits of Enhancing Optimization Modulo Theories with Sorting Jul 1, Networks 2016 for 1 / MAXS 31
On the Benefits of Enhancing Optimization Modulo Theories with Sorting Networks for MAXSMT Roberto Sebastiani, Patrick Trentin roberto.sebastiani@unitn.it trentin@disi.unitn.it DISI, University of Trento
arxiv: v1 [cs.dm] 2 Jul 2018
![arxiv: v1 [cs.dm] 2 Jul 2018](/thumbs/81/84601098.jpg "arxiv: v1 [cs.dm] 2 Jul 2018")
A SAT Encoding for the n-fractions Problem Michael Codish Department of Computer Science, Ben-Gurion University of the Negev, Israel arxiv:1807.00507v1 [cs.dm] 2 Jul 2018 Abstract. This note describes
Recent Advances in Simulation Techniques and Tools
Recent Advances in Simulation Techniques and Tools Yuyang Li, li.yuyang(at)wustl.edu (A paper written under the guidance of Prof. Raj Jain) Download Abstract: Simulation refers to using specified kind
RAPS ECMWF. RAPS Chairman. 20th ORAP Forum Slide 1
RAPS George.Mozdzynski@ecmwf.int RAPS Chairman 20th ORAP Forum Slide 1 20th ORAP Forum Slide 2 What is RAPS? Real Applications on Parallel Systems European Software Initiative RAPS Consortium (founded
3 rd meeting of the Board of Funders Brussels, 30 June State of Play. Gustav Kalbe. Head of Unit, DG Connect European Commission
3 rd meeting of the Board of Funders Brussels, 30 June 2016 The new Flagship on 51214 Quantum Technologies State of Play Gustav Kalbe Head of Unit, DG Connect European Commission 2 Quantum Technologies
EECS 219C: Computer-Aided Verification Introduction & Overview. Sanjit A. Seshia EECS, UC Berkeley
EECS 219C: Computer-Aided Verification Introduction & Overview Sanjit A. Seshia EECS, UC Berkeley Computer-Aided Verification (informally) Does the system do what it is supposed to do? S. A. Seshia 2 The
Computing Interpolants without Proofs
Computing Interpolants without Proofs Hana Chockler, Alexander Ivrii, Arie Matsliah IBM Research Haifa Abstract. We describe an incremental algorithm for computing interpolants for a pair ϕ A, ϕ B of formulas
A TREE-SEARCH BASED HEURISTIC FOR A COMPLEX STACKING PROBLEM WITH CONTINUOUS PRODUCTION AND RETRIEVAL
A TREE-SEARCH BASED HEURISTIC FOR A COMPLEX STACKING PROBLEM WITH CONTINUOUS PRODUCTION AND RETRIEVAL Sebastian Raggl (a), Beham Andreas (b), Fabien Tricoire (c), Michael Affenzeller (d) (a,b,d) Heuristic
A Multipath Detection Scheme Using SAT
A Multipath Detection Scheme Using SAT Mohamed El-Tarhuni Department of Electrical Engineering American University of Sharjah, UAE mtarhuni@aus.edu Abstract This paper presents a new technique for multipath
SVC2004: First International Signature Verification Competition
SVC2004: First International Signature Verification Competition Dit-Yan Yeung 1, Hong Chang 1, Yimin Xiong 1, Susan George 2, Ramanujan Kashi 3, Takashi Matsumoto 4, and Gerhard Rigoll 5 1 Hong Kong University
Evaluation of CPU Frequency Transition Latency
Noname manuscript No. (will be inserted by the editor) Evaluation of CPU Frequency Transition Latency Abdelhafid Mazouz Alexandre Laurent Benoît Pradelle William Jalby Abstract Dynamic Voltage and Frequency
Competition SyStem The championship will be played within 11 days (9 game days plus 2 rest days).
Horarios Competition SyStem The championship will be played within 11 days (9 game days plus 2 rest days). preliminary round The 16 teams are divided into 4 groups (A, B, C, D) of 4 team each. Each team
2018 HEARTHSTONE NATIONALS OFFICIAL COMPETITION RULES
2018 HEARTHSTONE NATIONALS OFFICIAL COMPETITION RULES TABLE OF CONTENTS 1. INTRODUCTION... 1 2. HEARTHSTONE NATIONALS... 1 2.1. Acceptance of the Official Rules... 1 3. PLAYER ELIGIBILITY REQUIREMENTS...
An Efficient Framework for Image Analysis using Mapreduce
An Efficient Framework for Image Analysis using Mapreduce S Vidya Sagar Appaji 1, P.V.Lakshmi 2 and P.Srinivasa Rao 3 1 CSE Department, MVGR College of Engineering, Vizianagaram 2 IT Department, GITAM,
Controlling a Solver Execution: the runsolver Tool
Controlling a Solver Execution: the runsolver Tool Olivier ROUSSEL CRIL - CNRS UMR 8188 roussel@cril.univ-artois.fr http://www.cril.univ-artois.fr/ roussel/runsolver/ Controlling a Solver Execution: the
Computational Efficiency of the GF and the RMF Transforms for Quaternary Logic Functions on CPUs and GPUs
5 th International Conference on Logic and Application LAP 2016 Dubrovnik, Croatia, September 19-23, 2016 Computational Efficiency of the GF and the RMF Transforms for Quaternary Logic Functions on CPUs
Initiative to establish a European Lab for Learning & Intelligent Systems
Initiative to establish a European Lab for Learning & Intelligent Systems We are at a crossroads where (1) machine learning is at the heart of a technological and societal artificial intelligence revolution
Greedy or Not? Best Improving versus First Improving Stochastic Local Search for MAXSAT
Greedy or Not? Best Improving versus First Improving Stochastic Local Search for MAXSAT Darrell Whitley, Adele Howe and Doug Hains Department of Computer Science, Colorado State University, Fort Collins,
Research Article A New Iterated Local Search Algorithm for Solving Broadcast Scheduling Problems in Packet Radio Networks
Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2010, Article ID 578370, 8 pages doi:10.1155/2010/578370 Research Article A New Iterated Local Search Algorithm
royaldiamondtools.com Smartness Made in Italy Technology Customizations Worldwide OUR TAILOR MADE FOR YOUR BUSINESS COMPANY PROFILE
royaldiamondtools.com Smartness Made in Italy Technology Customizations Worldwide OUR TAILOR MADE FOR YOUR BUSINESS COMPANY PROFILE In your hands, the best tools. We design and produce diamond tools for
4th Workshop on Runtime and Operating Systems for the Many-core Era (ROME 2016)
4th Workshop on Runtime and Operating Systems for the Many-core Era (ROME 2016) held in conjunction with Euro-Par 2016 Carsten Clauss, Stefan Lankes Topics of interest Idea Predecessor: MARC Symposium
Parallelism Across the Curriculum
Parallelism Across the Curriculum John E. Howland Department of Computer Science Trinity University One Trinity Place San Antonio, Texas 78212-7200 Voice: (210) 999-7364 Fax: (210) 999-7477 E-mail: jhowland@trinity.edu
XCSP3 Competition 2018
XCSP3 Competition 2018 Results http://www.cril.fr/xcsp18/ Christophe Lecoutre and Olivier Roussel 24th International Conference Principles and Practice of Constraint Programming August 28, 2018 1 XCSP3
Université de Bretagne Occidentale BREST QUIMPER MORLAIX
Université de Bretagne Occidentale 2 2 Technology Parks 7 Higher Education Institutions A Regional Teaching Hospital An Ocean Discovery Park Océanopolis Brest 3 research centers Ifremer, IPEV, Roscoff
Encapsulated Transformers 115V + 115V Primary, Low Profile
Features: Robust construction. Wide range of secondary voltages available. Single voltage and Dual voltage secondary combination. 2.0VA up to 52VA. CE marked. Designed and manufactured according to international
Evaluation of CPU Frequency Transition Latency
Evaluation of CPU Frequency Transition Latency Abdelhafid Mazouz 1 Alexandre Laurent 1 Benoît Pradelle 1 William Jalby 1 1 University of Versailles Saint-Quentin-en-Yvelines, France ENA-HPC 2013, Dresden
Performance Metrics. Computer Architecture. Outline. Objectives. Basic Performance Metrics. Basic Performance Metrics
Computer Architecture Prof. Dr. Nizamettin AYDIN naydin@yildiz.edu.tr nizamettinaydin@gmail.com Performance Metrics http://www.yildiz.edu.tr/~naydin 1 2 Objectives How can we meaningfully measure and compare
2018 HEARTHSTONE GLOBAL GAMES OFFICIAL COMPETITION RULES
2018 HEARTHSTONE GLOBAL GAMES OFFICIAL COMPETITION RULES TABLE OF CONTENTS 1. INTRODUCTION... 1 2. HEARTHSTONE GLOBAL GAMES... 1 2.1. Acceptance of the Official Rules... 1 3. PLAYER ELIGIBILITY REQUIREMENTS...
3rd Workshop on Runtime and Operating Systems for the Many-core Era (ROME 2015)
3rd Workshop on Runtime and Operating Systems for the Many-core Era (ROME 2015) held in conjunction with Euro-Par 2015 Carsten Clauss, Stefan Lankes Topics of interest Operating system extensions for addressing
CUDA-Accelerated Satellite Communication Demodulation
CUDA-Accelerated Satellite Communication Demodulation Renliang Zhao, Ying Liu, Liheng Jian, Zhongya Wang School of Computer and Control University of Chinese Academy of Sciences Outline Motivation Related
STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES
STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES FLORIAN BREUER and JOHN MICHAEL ROBSON Abstract We introduce a game called Squares where the single player is presented with a pattern of black and white
Introduction to VI-HPS
Introduction to VI-HPS Martin Schulz Technische Universität München Virtual Institute High Productivity Supercomputing Goal: Improve the quality and accelerate the development process of complex simulation
AlphaPilot Innovation Challenge
d AlphaPilot Innovation Challenge Information Guide For The Artificial Intelligence Drone Racing Competition November 2018 1 What is AlphaPilot? The Overview AlphaPilot is a Lockheed Martin open-innovation
BIO Helmet EEL 4914 Senior Design I Group # 3 Frank Alexin Nicholas Dijkhoffz Adam Hollifield Mark Le
BIO Helmet EEL 4914 Senior Design I Group # 3 Frank Alexin Nicholas Dijkhoffz Adam Hollifield Mark Le Project Description and Motivation The goal of this project is to create and integrate a system that
A GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS
A GRASP HEURISTIC FOR THE COOPERATIVE COMMUNICATION PROBLEM IN AD HOC NETWORKS C. COMMANDER, C.A.S. OLIVEIRA, P.M. PARDALOS, AND M.G.C. RESENDE ABSTRACT. Ad hoc networks are composed of a set of wireless
A GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks
MIC2005: The Sixth Metaheuristics International Conference??-1 A GRASP heuristic for the Cooperative Communication Problem in Ad Hoc Networks Clayton Commander Carlos A.S. Oliveira Panos M. Pardalos Mauricio
GPU-accelerated SDR Implementation of Multi-User Detector for Satellite Return Links
DLR.de Chart 1 GPU-accelerated SDR Implementation of Multi-User Detector for Satellite Return Links Chen Tang chen.tang@dlr.de Institute of Communication and Navigation German Aerospace Center DLR.de Chart
Idea propagation in organizations. Christopher A White June 10, 2009
Idea propagation in organizations Christopher A White June 10, 2009 All Rights Reserved Alcatel-Lucent 2008 Why Ideas? Ideas are the raw material, and crucial starting point necessary for generating and
Building a Cell Ecosystem. David A. Bader
Building a Cell Ecosystem David A. Bader Acknowledgment of Support National Science Foundation CSR: A Framework for Optimizing Scientific Applications (06-14915) CAREER: High-Performance Algorithms for
Entrant s Name: Address: City, State, Zip: Phone: NAWCC #:
ENTRY FORM 2017 NAWCC CRAFTS COMPETITION 2017 National Convention, Arlington, TX June 28 July 1, 2017 People s Choice Award is given for the favorite entry. Entrant s Name: Address: City, State, Zip: Phone:
Keysight Technologies N9310A RF Signal Generator
Keysight Technologies N9310A RF Signal Generator 02 Keysight N9310A RF Signal Generator Brochure All the capability and reliability of a Keysight instrument you need at a price you ve always wanted Reliable
Post-Graduate Program in Computer Engineering (PPG-EC)
Post-Graduate Program in Computer Engineering (PPG-EC) Prof. Byron Leite Dantas Bezerra, Ph.D. Adjunct Professor POLI/UPE *** Coordinator Prof. Bruno José Torres Fernandes, Ph.D. Adjunct Professor POLI/UPE
BIKE - Bit-Flipping Key Encapsulation Presented to the NIST Post-Quantum Cryptography Standardization Conference April, 13 th 2018, Fort Lauderdale, Florida, USA Authors: Nicolas Aragon Paulo S. L. M.
A virtual On Board Control Unit for system tests
A virtual On Board Control Unit for system tests Ove Kalkan (ove.kalkan@ese.de) test4rail, 17.10.2017, Braunschweig Agenda Introduction: - What is an OBCU - System Test Approach Virtualization - Approach
Benchmarking of MCS on the Noisy Function Testbed
Benchmarking of MCS on the Noisy Function Testbed ABSTRACT Waltraud Huyer Fakultät für Mathematik Universität Wien Nordbergstraße 15 1090 Wien Austria Waltraud.Huyer@univie.ac.at Benchmarking results with
Global Competition 2010: The Keys to a Winning Entry. 20 January 2010
Global Competition 2010: The Keys to a Winning Entry 20 January 2010 Moderator Today s Moderator: Paula Berger NFC Forum Executive Director 2 Audio Tips All audio comes through your computer - Use your
FINDING VALUES FROM KNOWN AREAS 1. Don t confuse and. Remember, are. along the scale, but are
h. Find the IQ score separating the top 37% from the others. FINDING VALUES FROM KNOWN AREAS 1. Don t confuse and. Remember, are along the scale, but are under the. 2. Choose the correct of the. A value
Smart Grid Maturity Model: A Vision for the Future of Smart Grid
Smart Grid Maturity Model: A Vision for the Future of Smart Grid David W. White Smart Grid Maturity Model Project Manager White is a member of the Resilient Enterprise Management (REM) team in the CERT
Durham Research Online
Durham Research Online Deposited in DRO: 29 August 2017 Version of attached le: Accepted Version Peer-review status of attached le: Not peer-reviewed Citation for published item: Chiu, Wei-Yu and Sun,
Lecture 1: Introduction to Digital System Design & Co-Design
Design & Co-design of Embedded Systems Lecture 1: Introduction to Digital System Design & Co-Design Computer Engineering Dept. Sharif University of Technology Winter-Spring 2008 Mehdi Modarressi Topics
Evaluating Oscilloscope Bandwidths for your Application
Evaluating Oscilloscope Bandwidths for your Application Application Note 1588 Table of Contents Introduction....................... 1 Defining Oscilloscope Bandwidth..... 2 Required Bandwidth for Digital
Industrial Applications and Challenges for Verifying Reactive Embedded Software. Tom Bienmüller, SC 2 Summer School, MPI Saarbrücken, August 2017
Industrial Applications and Challenges for Verifying Reactive Embedded Software Tom Bienmüller, SC 2 Summer School, MPI Saarbrücken, August 2017 Agenda 2 Who am I? Who is BTC Embedded Systems? Formal Methods
Dr Jon Kirkpatrick Head of Connected Cities
Dr Jon Kirkpatrick Head of Connected Cities INNOVATION s RELIANCE ON DATA Role of the GDPR obstruction or facilitator for companies? What Is Organicity? OrganiCity is a service for experimentation that
Dr. Mohammed Bani Younis
Curriculum Vitae Dr. Mohammed Bani Younis Office Tel. (+ 962-6- 479900 ) ext.2221 Mobile (962-776173478) P. O. Box (1)Philadelphia, 19392- Amman Jordan: mby71@yahoo.com, mbaniyounis@philadelphia.edu.jo
Vampir Getting Started. Holger Brunst March 4th 2008
Vampir Getting Started Holger Brunst holger.brunst@tu-dresden.de March 4th 2008 What is Vampir? Program Monitoring, Visualization, and Analysis 1. Step: VampirTrace monitors your program s runtime behavior
Entrant s Name: Address: City, State, Zip: Phone: NAWCC#: E Mail:
ENTRY FORM 2018 NAWCC CRAFTS COMPETITION 2018 National Convention, York, PA July 20, 2018 July 22, 2018 People s Choice Award is given for the favorite entry. Entrant s Name: Address: City, State, Zip:
Biomedical Engineering Prosthetic Arm DEMONSTRATION EVENT
Biomedical Engineering Prosthetic Arm DEMONSTRATION EVENT LEVEL: Grades 11 and 12 MESA DAY CONTEST RULES 2009-2010 TYPE OF CONTEST: COMPOSITION OF TEAMS: NUMBER OF TEAMS: SPONSOR: Individual / Team 1-2
Generating Optimal Scheduling for Wireless Sensor Networks by Using Optimization Modulo Theories Solvers
Generating Optimal Scheduling for Wireless Sensor Networks by Using Optimization Modulo Theories Solvers IoT Research Institute Eszterhazy Karoly University Eger, Hungary iot.uni-eszterhazy.hu/en SMT 2017
LE160 LE320 Linear Equalizer Datasheet Tektronix Linear Equalizer
LE160 LE320 Linear Equalizer Datasheet Tektronix Linear Equalizer USB programmable output duty cycle symmetry control Precision output level controls permit signaling from 0 (Return to Zero) well in excess
Foundations Required for Novel Compute (FRANC) BAA Frequently Asked Questions (FAQ) Updated: October 24, 2017
1. TA-1 Objective Q: Within the BAA, the 48 th month objective for TA-1a/b is listed as functional prototype. What form of prototype is expected? Should an operating system and runtime be provided as part
TECHNICAL REPORT 2018 PHOTO CONTEST
TECHNICAL REPORT 2018 PHOTO CONTEST Foreword This report is designed to enable informed conversation within our community of professional visual journalism and storytelling. This is the third edition of
IEEE Open Milker Robot Version 1.1
IEEE Open 2016 2017 Milker Robot Version 1.1 Sumary Introduction Goals The scenario The Field Cows Gloves Terrines The Milk Tank Zones Markers Lighting conditions Dimensions The Robot Rules Arena initial
WPF CHARTS PERFORMANCE BENCHMARK Page 1 / 16. February 18, 2013
WPF CHARTS PERFORMANCE BENCHMARK Page 1 / 16 Test setup In this benchmark test, LightningChartUltimate for WPF s performance is compared to other WPF chart controls, which are marketed as high-performance
Chess South Africa Affiliate of FIDE and SASCOC
Chess South Africa Affiliate of FIDE and SASCOC Secretariat: Mrs Marcelle Agulhas : 6 Brand Street, Bellville South, Bellville, 7530, RSA Mobile No: +27 84 500 7159 Email: secretary@chessa.co.za : Website:
2018 College Graduate and Intern Compensation Survey Report
2018 College Graduate and Intern Compensation Survey Report College Graduate and Intern Compensation Survey Table of Contents 2018... Page 2-2 Participating Companies by Country... Page 2A-1 College Graduate
Real-time Pulsar Timing signal processing on GPUs
Real-Time Pulsar Timing Signal Processing on GPUs Plan : Pulsar Timing Instrumentations LPC2E, CNRS Orléans - FRANCE Ismaël Cognard, Gilles Theureau, Grégory Desvignes, Cédric Viou, Dalal Ait-Allal Pulsars
ΕΠΛ 605: Προχωρημένη Αρχιτεκτονική
ΕΠΛ 605: Προχωρημένη Αρχιτεκτονική Υπολογιστών Presentation of UniServer Horizon 2020 European project findings: X-Gene server chips, voltage-noise characterization, high-bandwidth voltage measurements,
Experience with new architectures: moving from HELIOS to Marconi
Experience with new architectures: moving from HELIOS to Marconi Serhiy Mochalskyy, Roman Hatzky 3 rd Accelerated Computing For Fusion Workshop November 28 29 th, 2016, Saclay, France High Level Support
Time Warner Inc. Report on Determination of Current Board Leadership Structure March 2015
Time Warner Inc. Report on Determination of Current Board Leadership Structure March 2015 This is the sixth annual report providing (i) a description of the Board of Directors policy and practices relating
Getting Started with the LabVIEW DSP Module
Getting Started with the LabVIEW DSP Module Version 1.0 Contents Introduction Introduction... 1 Launching LabVIEW Embedded Edition and Selecting the Target... 2 Looking at the Front Panel and Block Diagram...
Performance Evaluation of Multi-Threaded System vs. Chip-Multi-Processor System
Performance Evaluation of Multi-Threaded System vs. Chip-Multi-Processor System Ho Young Kim, Robert Maxwell, Ankil Patel, Byeong Kil Lee Abstract The purpose of this study is to analyze and compare the
Solving Sudoku Using Artificial Intelligence
Solving Sudoku Using Artificial Intelligence Eric Pass BitBucket: https://bitbucket.org/ecp89/aipracticumproject Demo: https://youtu.be/-7mv2_ulsas Background Overview Sudoku problems are some of the most
Some Cryptanalysis of the Block Cipher BCMPQ
Some Cryptanalysis of the Block Cipher BCMPQ V. Dimitrova, M. Kostadinoski, Z. Trajcheska, M. Petkovska and D. Buhov Faculty of Computer Science and Engineering Ss. Cyril and Methodius University, Skopje,
QuickSpecs. VIVE Pro VR System with Advantage+ Service Pack. Overview
Overview Introduction VIVE Pro is shaping the future of how companies engage with their consumers, train their employees and develop products. VIVE Pro is built to scale with your business requirements
Development of a parallel, tree-based neighbour-search algorithm
Mitglied der Helmholtz-Gemeinschaft Development of a parallel, tree-based neighbour-search algorithm for the tree-code PEPC 28.09.2010 Andreas Breslau Outline 1 Motivation 2 Short introduction to tree-codes
Programming and Optimization with Intel Xeon Phi Coprocessors. Colfax Developer Training One-day Labs CDT 102
Programming and Optimization with Intel Xeon Phi Coprocessors Colfax Developer Training One-day Labs CDT 102 Abstract: Colfax Developer Training (CDT) is an in-depth intensive course on efficient parallel
Tree Parallelization of Ary on a Cluster
Tree Parallelization of Ary on a Cluster Jean Méhat LIASD, Université Paris 8, Saint-Denis France, jm@ai.univ-paris8.fr Tristan Cazenave LAMSADE, Université Paris-Dauphine, Paris France, cazenave@lamsade.dauphine.fr
Alexandre Fréchette, Neil Newman, Kevin Leyton-Brown
Solving the Station Repacking Problem Alexandre Fréchette, Neil Newman, Kevin Leyton-Brown Agenda Background Problem Novel Approach Experimental Results Background A Brief History Spectrum rights have
Performance Evaluation of DV-Hop and NDV-Hop Localization Methods in Wireless Sensor Networks
Performance Evaluation of DV-Hop and NDV-Hop Localization Methods in Wireless Sensor Networks Manijeh Keshtgary Dept. of Computer Eng. & IT ShirazUniversity of technology Shiraz,Iran, Keshtgari@sutech.ac.ir
Techniques to Achieve Oscilloscope Bandwidths of Greater Than 16 GHz
Techniques to Achieve Oscilloscope Bandwidths of Greater Than 16 GHz Application Note Infiniium s 32 GHz of bandwidth versus techniques other vendors use to achieve greater than 16 GHz Banner specifications
The Wireless Network Jamming Problem Subject to Protocol Interference
The Wireless Network Jamming Problem Subject to Protocol Interference Author information blinded December 22, 2014 Abstract We study the following problem in wireless network security: Which jamming device
Stress Testing the OpenSimulator Virtual World Server
Stress Testing the OpenSimulator Virtual World Server Introduction OpenSimulator (http://opensimulator.org) is an open source project building a general purpose virtual world simulator. As part of a larger
Exploiting Circuit Duality to Speed Up SAT
2015 IEEE Computer Society Annual Symposium on VLSI Exploiting Circuit Duality to Speed Up SAT Luca Amarù 1, Pierre-Emmanuel Gaillardon 1, Alan Mishchenko 2, Maciej Ciesielski 3, Giovanni De Micheli 1
Virtual Global Search: Application to 9x9 Go
Virtual Global Search: Application to 9x9 Go Tristan Cazenave LIASD Dept. Informatique Université Paris 8, 93526, Saint-Denis, France cazenave@ai.univ-paris8.fr Abstract. Monte-Carlo simulations can be
c. Find the probability that a randomly selected adult has an IQ between 90 and 110 (referred to as the normal range).
c. Find the probability that a randomly selected adult has an IQ between 90 and 110 (referred to as the normal range). d. Find the probability that a randomly selected adult has an IQ between 110 and 120
ISO/TC268/SC1 Smart Community Infrastructures
ISO/TC268/SC1 Smart Community Infrastructures 05 February 2013 Dr. Yoshiaki Ichikawa IEC TC111 and ISO/TC268/SC1 Chair IS-INOTEK 2013 All rights reserved. 1 1. TC268/SC1 at a glance 2. Backgrounds 3. Purpose