@article{doUnchained, author = {Ullrich, Sebastian and de Moura, Leonardo}, title = {‘Do’ Unchained: Embracing Local Imperativity in a Purely Functional Language (Functional Pearl)}, year = {2022}, issue_date = {August 2022}, publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, volume = {6}, number = {ICFP}, url = {https://doi.org/10.1145/3547640}, doi = {10.1145/3547640}, journal = {Proc. ACM Program. Lang.}, month = {aug}, articleno = {109}, numpages = {28}, keywords = {Lean, functional programming, interactive theorem proving}, documenturl = {https://leanprover.github.io/papers/do.pdf} }
@article{DBLP:journals/corr/abs-1802-03685, author = {Daniel Selsam and Matthew Lamm and Benedikt B{\"{u}}nz and Percy Liang and Leonardo de Moura and David L. Dill}, title = {Learning a {SAT} Solver from Single-Bit Supervision}, journal = {CoRR}, volume = {abs/1802.03685}, year = {2018}, url = {http://arxiv.org/abs/1802.03685}, archiveprefix = {arXiv}, eprint = {1802.03685}, timestamp = {Mon, 13 Aug 2018 16:47:15 +0200}, biburl = {https://dblp.org/rec/bib/journals/corr/abs-1802-03685}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/setss/BjornerMNW18, author = {Nikolaj Bj{\o}rner and Leonardo de Moura and Lev Nachmanson and Christoph M. Wintersteiger}, title = {Programming {Z3}}, booktitle = {Engineering Trustworthy Software Systems - 4th International School, {SETSS} 2018, Chongqing, China, April 7-12, 2018, Tutorial Lectures}, pages = {148--201}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-17601-3\_4}, doi = {10.1007/978-3-030-17601-3\_4}, timestamp = {Fri, 31 May 2019 09:51:39 +0200}, biburl = {https://dblp.org/rec/bib/conf/setss/BjornerMNW18}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{MetaProgLean, author = {Gabriel Ebner and Sebastian Ullrich and Jared Roesch and Jeremy Avigad and Leonardo de Moura}, title = {{A Metaprogramming Framework for Formal Verification}}, journal = {{Proc. ACM Program. Lang.}}, issue_date = {September 2017}, volume = {1}, number = {ICFP}, month = aug, year = {2017}, issn = {2475-1421}, pages = {34:1--34:29}, articleno = {34}, numpages = {29}, doi = {10.1145/3110278}, acmid = {3110278}, publisher = {ACM}, address = {New York, NY, USA}, keywords = {dependent type theory, metaprogramming, tactic language, theorem proving}, documenturl = {https://leanprover.github.io/papers/tactic.pdf} }
@inproceedings{10.1007/978-3-030-34175-6_13, author = {Leijen, Daan and Zorn, Benjamin and de Moura, Leonardo}, editor = {Lin, Anthony Widjaja}, title = {Mimalloc: Free List Sharding in Action}, booktitle = {Programming Languages and Systems}, year = {2019}, publisher = {Springer International Publishing}, address = {Cham}, pages = {244--265}, isbn = {978-3-030-34175-6}, documenturl = {https://www.microsoft.com/en-us/research/uploads/prod/2019/06/mimalloc-tr-v1.pdf} }
@inproceedings{10.1145/3453483.3454032, author = {Reinking, Alex and Xie, Ningning and de Moura, Leonardo and Leijen, Daan}, title = {Perceus: Garbage Free Reference Counting with Reuse}, year = {2021}, isbn = {9781450383912}, publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, url = {https://doi.org/10.1145/3453483.3454032}, doi = {10.1145/3453483.3454032}, booktitle = {Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation}, pages = {96–111}, numpages = {16}, keywords = {Reference Counting, Handlers, Algebraic Effects}, location = {Virtual, Canada}, series = {PLDI 2021}, documenturl = {https://alexreinking.com/downloads/papers/perceus-garbage-free-reference-counting-with-reuse.pdf} }
@misc{selsam2019learning, title = {Learning a SAT Solver from Single-Bit Supervision}, author = {Daniel Selsam and Matthew Lamm and Benedikt Bünz and Percy Liang and Leonardo de Moura and David L. Dill}, year = {2019}, eprint = {1802.03685}, archiveprefix = {arXiv}, primaryclass = {cs.AI}, documenturl = {https://arxiv.org/pdf/1802.03685.pdf} }
@inproceedings{UllrichdeMoura2019_1000120596, author = {Ullrich, Sebastian and de Moura, Leonardo}, year = {2019}, title = {Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming [in press]}, eventtitle = {31st Symposium on Implementation and Application of Functional Languages}, eventtitleaddon = {IFL 2019}, eventdate = {2019-09-25/2019-09-27}, venue = {Singapur, Singapur}, booktitle = {31st Symposium on Implementation and Application of Functional Languages}, language = {english}, documenturl = {https://arxiv.org/pdf/1908.05647.pdf} }
@inproceedings{10.1007/978-3-030-51054-1_10, author = {Ullrich, Sebastian and de Moura, Leonardo}, editor = {Peltier, Nicolas and Sofronie-Stokkermans, Viorica}, title = {Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages}, booktitle = {Automated Reasoning}, year = {2020}, publisher = {Springer International Publishing}, address = {Cham}, pages = {167--182}, isbn = {978-3-030-51054-1}, documenturl = {https://arxiv.org/pdf/2001.10490.pdf} }
@inproceedings{10.1007/978-3-030-79876-5_37, author = {Moura, Leonardo de and Ullrich, Sebastian}, editor = {Platzer, Andr{\'e} and Sutcliffe, Geoff}, title = {The Lean 4 Theorem Prover and Programming Language}, booktitle = {Automated Deduction -- CADE 28}, year = {2021}, publisher = {Springer International Publishing}, address = {Cham}, pages = {625--635}, isbn = {978-3-030-79876-5}, documenturl = {https://leanprover.github.io/papers/lean4.pdf} }
@misc{selsam2020tabled, title = {Tabled Typeclass Resolution}, author = {Daniel Selsam and Sebastian Ullrich and Leonardo de Moura}, year = {2020}, eprint = {2001.04301}, archiveprefix = {arXiv}, primaryclass = {cs.PL}, documenturl = {https://arxiv.org/pdf/2001.04301.pdf} }
@inproceedings{CCinITT, author = {Daniel Selsam and Leonardo de Moura}, title = {{Congruence Closure in Intensional Type Theory}}, booktitle = {Automated Reasoning, 8th International Joint Conference, University of Coimbra, Portugal}, year = {2016}, publisher = {Springer}, pages = {99--115}, isbn = {978-3-319-40229-1}, documenturl = {https://leanprover.github.io/papers/congr.pdf} }
@inproceedings{fmcad14/RTdM, author = {Andrew Reynolds and Cesare Tinelli and Leonardo de Moura}, title = {{Finding Conflicting Instances of Quantified Formulas in SMT}}, booktitle = {Proceedings of 14th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2014, 21-24 October 2014, Lausanne, Switzerland}, year = {2014}, documenturl = {http://leodemoura.github.io/files/qcf.pdf} }
@book{thprovinginlean, author = {Jeremy Avigad and Leonardo de Moura and Soonho Kong}, title = {{Theorem Proving in Lean}}, year = {2015}, documenturl = {http://leanprover.github.io/tutorial/tutorial.pdf} }
@inproceedings{Lean, author = {Leonardo de Moura and Soonho Kong and Jeremy Avigad and Floris van Doorn and Jakob von Raumer}, title = {{The Lean Theorem Prover}}, year = {2015}, booktitle = {Automated Deduction - CADE-25, 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings}, documenturl = {http://leodemoura.github.io/files/lean_cade25.pdf} }
@misc{LeanCnstr, author = {Leonardo de Moura and Jeremy Avigad and Soonho Kong and Cody Roux}, title = {Elaboration in Dependent Type Theory}, note = {Preprint, \url{http://arxiv.org/abs/1505.04324}}, year = {2015}, documenturl = {http://leodemoura.github.io/files/elaboration.pdf} }
@inbook{BdMF15, title = {{Proofs in Satisfiability Modulo Theories}}, author = {Clark Barrett and Leonardo de Moura and Pascal Fontaine}, booktitle = {All about Proofs, Proofs for All}, year = {2015}, series = {Mathematical Logic and Foundations}, editor = {David Delahaye and Bruno Woltzenlogel Paleo}, publisher = {College Publications}, address = {London, UK}, documenturl = {http://leodemoura.github.io/files/SMTProofs.pdf} }
@inproceedings{fmcad13/dbdm13, author = {Dejan Jovanovi\'{c} and Clark Barrett and Leonardo de Moura}, title = {The Design and Implementation of the Model Constructing Satisfiability Calculus}, booktitle = {Proceedings of 13th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2013, 20-23 October 2013, Porland, Oregon, USA}, year = {2013}, documenturl = {http://leodemoura.github.io/files/fmcad2013.pdf} }
@inproceedings{cade24/dmp13, author = {Leonardo de Moura and Grant Passmore}, title = {Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals}, booktitle = {Automated Deduction - CADE-24, 24th International Conference on Automated Deduction, Lake Placid, New York, June 9-14, 2013, Proceedings}, year = {2013}, documenturl = {http://z3.codeplex.com/wikipage?title=CADE24} }
@article{cutsat/jar2013, author = {Dejan Jovanovi\'{c} and Leonardo de Moura}, title = {Cutting to the Chase: Solving Linear Integer Arithmetic (to appear)}, journal = {Journal Automated Reasoning}, year = {2013}, documenturl = {http://leodemoura.github.io/files/cutsat-jar2013.pdf} }
@inbook{mcsat, title = {{The Strategy Challenge in SMT Solving}}, author = { Leonardo de Moura and Grant Passmore }, booktitle = { Automated Reasoning and Mathematics: Essays in Memory of William McCune }, year = {2013}, series = { Lecture Notes in Artificial Intelligence }, publisher = {Springer}, volume = { 7788 }, documenturl = {http://leodemoura.github.io/files/smt-strategy.pdf} }
@inproceedings{vmcai/demoura13, author = {Leonardo de Moura and Dejan Jovanovi\'{c} }, title = { A Model-Constructing Satisfiability Calculus }, booktitle = {14th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI, Rome, Italy, 2013}, year = {2013}, documenturl = { http://leodemoura.github.io/files/mcsat.pdf} }
@inproceedings{DBLP:conf/cav/HoderBM11, author = {Krystof Hoder and Nikolaj Bj{\o}rner and Leonardo de Moura}, title = { {muZ} - An Efficient Engine for Fixed Points with Constraints}, booktitle = {Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings}, year = {2011}, pages = {457-462}, ee = {http://dx.doi.org/10.1007/978-3-642-22110-1_36}, series = {Lecture Notes in Computer Science}, volume = {6806}, documenturl = {http://leodemoura.github.io/files/muze.pdf} }
@article{DBLP:journals/cacm/MouraB11, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, title = {Satisfiability modulo theories: introduction and applications}, journal = {Commun. ACM}, volume = {54}, number = {9}, year = {2011}, pages = {69-77}, documenturl = {http://dl.acm.org/citation.cfm?id=1995394}, documenturl = {http://cacm.acm.org/magazines/2011/9/122785-satisfiability-modulo-theories/fulltext} }
@inproceedings{DBLP:conf/cade/MouraB10, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, title = {Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development}, booktitle = {Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Edinburgh, UK, July 16-19, 2010. Proceedings}, year = {2010}, pages = {400-411}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {6173}, documenturl = { http://leodemoura.github.io/files/ijcar10.pdf} }
@inproceedings{DBLP:conf/lpar/VeanesBM10, author = {Margus Veanes and Nikolaj Bj{\o}rner and Leonardo de Moura}, title = {Symbolic Automata Constraint Solving}, booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings}, year = {2010}, pages = {640-654}, series = {Lecture Notes in Computer Science}, volume = {6397}, documenturl = { http://leodemoura.github.io/files/lpar2010.pdf} }
@article{DBLP:journals/jar/PiskacMB10, author = {Ruzica Piskac and Leonardo de Moura and Nikolaj Bj{\o}rner}, title = {Deciding Effectively Propositional Logic Using {DPLL} and Substitution Sets}, journal = {J. Autom. Reasoning}, volume = {44}, number = {4}, year = {2010}, pages = {401-424}, documenturl = {http://www.springerlink.com/content/p54255p52430242t/} }
@techreport{MSR:techreport:EPR08, author = {Ruzica Piskac and Leonardo de Moura and Nikolaj Bj{\o}rner}, title = {Deciding Effectively Propositional Logic with Equality}, year = {2008}, number = {MSR-TR-2008-181}, institution = { {Microsoft Research} }, documenturl = {http://research.microsoft.com/apps/pubs/default.aspx?id=76532} }
@inproceedings{DBLP:conf/fmcad/MouraB09, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, title = {Generalized, efficient array decision procedures}, year = {2009}, pages = {45-52}, booktitle = {Proceedings of 9th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2009, 15-18 November 2009, Austin, Texas, USA}, publisher = {IEEE}, documenturl = { http://leodemoura.github.io/files/fmcad09.pdf} }
@inproceedings{DBLP:conf/formats/BjornerM09, author = {Nikolaj Bj{\o}rner and Leonardo de Moura}, title = {Tapas: Theory Combinations and Practical Applications}, year = {2009}, pages = {1-6}, booktitle = {Formal Modeling and Analysis of Timed Systems, 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009. Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {5813}, documenturl = {http://www.springerlink.com/content/u510v392760624q5/} }
@inproceedings{DBLP:conf/sbmf/MouraB09, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, title = {Satisfiability Modulo Theories: An Appetizer}, year = {2009}, pages = {23-36}, booktitle = {Formal Methods: Foundations and Applications, 12th Brazilian Symposium on Formal Methods, SBMF 2009, Gramado, Brazil, August 19-21, 2009, Revised Selected Papers}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {5902}, documenturl = { http://leodemoura.github.io/files/sbmf09.pdf} }
@inproceedings{DBLP:conf/cade/MouraB08, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, title = {Deciding Effectively Propositional Logic Using {DPLL} and Substitution Sets}, year = {2008}, pages = {410-425}, booktitle = {Automated Reasoning, 4th International Joint Conference, IJCAR 2008, Sydney, Australia, August 12-15, 2008, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {5195}, documenturl = { http://leodemoura.github.io/files/epr.pdf} }
@inproceedings{DBLP:conf/cade/MouraB08a, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, title = { {Engineering DPLL(T) + Saturation} }, year = {2008}, pages = {475-490}, booktitle = {Automated Reasoning, 4th International Joint Conference, IJCAR 2008, Sydney, Australia, August 12-15, 2008, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {5195}, documenturl = { http://leodemoura.github.io/files/z3spc.pdf} }
@inproceedings{DBLP:conf/lpar/MouraB08, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, title = {Proofs and Refutations, and {Z3}}, year = {2008}, booktitle = {Proceedings of the LPAR 2008 Workshops, Knowledge Exchange: Automated Provers and Proof Assistants, and the 7th International Workshop on the Implementation of Logics, Doha, Qatar, November 22, 2008}, publisher = {CEUR-WS.org}, series = {CEUR Workshop Proceedings}, volume = {418}, documenturl = { http://leodemoura.github.io/files/iwil08.pdf} }
@inproceedings{DBLP:conf/tacas/MouraB08, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, title = { {Z3}: An Efficient {SMT} Solver}, year = {2008}, pages = {337-340}, booktitle = {Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {4963}, documenturl = {http://research.microsoft.com/projects/z3/z3.pdf} }
@article{DBLP:journals/entcs/MouraB08, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, title = {Model-based Theory Combination}, journal = {Electr. Notes Theor. Comput. Sci.}, volume = {198}, number = {2}, year = {2008}, pages = {37-49}, ee = {http://dx.doi.org/10.1016/j.entcs.2008.04.079}, bibsource = {DBLP, http://dblp.uni-trier.de}, documenturl = {http://research.microsoft.com/projects/z3/smt07.pdf} }
@inproceedings{DBLP:conf/cade/MouraB07, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, title = {Efficient {E-Matching} for {SMT} Solvers}, year = {2007}, pages = {183-198}, booktitle = {Automated Deduction - CADE-21, 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {4603}, documenturl = { http://leodemoura.github.io/files/ematching.pdf} }
@inproceedings{DBLP:conf/aisc/PassmorePM12, author = {Grant Olney Passmore and Lawrence C. Paulson and Leonardo de Moura}, title = {Real Algebraic Strategies for {MetiTarski} Proofs}, year = {2012}, pages = {358-370}, booktitle = {Intelligent Computer Mathematics - 11th International Conference, AISC 2012, 19th Symposium, Calculemus 2012, 5th International Workshop, DML 2012, 11th International Conference, MKM 2012, Systems and Projects, Held as Part of CICM 2012, Bremen, Germany, July 8-13, 2012. Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {7362}, documenturl = { http://leodemoura.github.io/files/CICM2012.pdf} }
@inproceedings{DBLP:conf/cade/JovanovicM12, author = {Dejan Jovanovi\'{c} and Leonardo de Moura}, title = {Solving Non-linear Arithmetic}, year = {2012}, pages = {339-354}, booktitle = {Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {7364}, documenturl = { http://leodemoura.github.io/files/IJCAR2012.pdf} }
@techreport{MSR:techreport:nonlinear12, author = {Dejan Jovanovi\'{c} and Leonardo de Moura}, title = {Solving Non-linear Arithmetic}, year = {2012}, number = {MSR-TR-2012-20}, institution = { {Microsoft Research} }, documenturl = {http://research.microsoft.com/apps/pubs/default.aspx?id=159549} }
@inproceedings{DBLP:conf/cade/JovanovicM11, author = {Dejan Jovanovi\'{c} and Leonardo de Moura}, title = {Cutting to the Chase Solving Linear Integer Arithmetic}, year = {2011}, pages = {338-353}, booktitle = {Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31 - August 5, 2011. Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {6803}, documenturl = { http://leodemoura.github.io/files/cutsat.pdf} }
@article{DBLP:journals/jar/BonacinaLM11, author = {Maria Paola Bonacina and Christopher Lynch and Leonardo de Moura}, title = {On Deciding Satisfiability by Theorem Proving with Speculative Inferences}, journal = {J. Autom. Reasoning}, volume = {47}, number = {2}, year = {2011}, pages = {161-189}, documenturl = { http://leodemoura.github.io/files/JAR2010dpllSPsi.pdf} }
@inproceedings{DBLP:conf/fmcad/WintersteigerHM10, author = {Christoph M. Wintersteiger and Youssef Hamadi and Leonardo de Moura}, title = {Efficiently solving quantified bit-vector formulas}, year = {2010}, pages = {239-246}, booktitle = {Proceedings of 10th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2010, Lugano, Switzerland, October 20-23}, publisher = {IEEE}, documenturl = { http://leodemoura.github.io/files/fmcad10.pdf} }
@inproceedings{DBLP:conf/cade/BonacinaLM09, author = {Maria Paola Bonacina and Christopher Lynch and Leonardo de Moura}, title = {On Deciding Satisfiability by {DPLL($\Gamma$+T)} and Unsound Theorem Proving}, year = {2009}, pages = {35-50}, booktitle = {Automated Deduction - CADE-22, 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {5663}, documenturl = { http://leodemoura.github.io/files/cade09.pdf} }
@inproceedings{DBLP:conf/cav/GeM09, author = {Yeting Ge and Leonardo de Moura}, title = {Complete Instantiation for Quantified Formulas in Satisfiability Modulo Theories}, year = {2009}, pages = {306-320}, booktitle = {Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {5643}, documenturl = { http://leodemoura.github.io/files/ci.pdf} }
@inproceedings{GeM09ext, author = {Yeting Ge and Leonardo de Moura}, title = {Complete Instantiation for Quantified Formulas in Satisfiability Modulo Theories (extended version)}, year = {2009}, documenturl = { http://leodemoura.github.io/files/citr09.pdf} }
@inproceedings{DBLP:conf/cav/WintersteigerHM09, author = {Christoph M. Wintersteiger and Youssef Hamadi and Leonardo de Moura}, title = {A Concurrent Portfolio Approach to {SMT} Solving}, year = {2009}, pages = {715-720}, booktitle = {Computer Aided Verification, 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009. Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {5643}, documenturl = { http://leodemoura.github.io/files/parallel_z3.pdf} }
@inproceedings{DBLP:conf/synasc/PassmoreM09, author = {Grant Olney Passmore and Leonardo de Moura}, title = {Superfluous {S-polynomials} in Strategy-Independent Groebner Bases}, year = {2009}, pages = {45-53}, booktitle = {11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2009, Timisoara, Romania, September 26-29, 2009}, publisher = {IEEE Computer Society}, documenturl = { http://leodemoura.github.io/files/synasc.pdf} }
@inproceedings{DBLP:conf/cav/MouraDS07, author = {Leonardo de Moura and Bruno Dutertre and Natarajan Shankar}, title = {A Tutorial on Satisfiability Modulo Theories}, year = {2007}, pages = {20-36}, booktitle = {Computer Aided Verification, 19th International Conference, CAV 2007, Berlin, Germany, July 3-7, 2007, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {4590}, documenturl = {http://www.springerlink.com/content/11r20jq883677834} }
@article{DBLP:journals/fmsd/BarrettMS07, author = {Clark W. Barrett and Leonardo de Moura and Aaron Stump}, title = {Design and results of the 2nd annual satisfiability modulo theories competition ({SMT-COMP} 2006)}, journal = {Formal Methods in System Design}, volume = {31}, number = {3}, year = {2007}, pages = {221-239}, documenturl = { http://leodemoura.github.io/files/smtcomp06.pdf} }
@inproceedings{DBLP:conf/cav/DutertreM06, author = {Bruno Dutertre and Leonardo de Moura}, title = {A Fast Linear-Arithmetic Solver for {DPLL(T)}}, year = {2006}, pages = {81-94}, booktitle = {Computer Aided Verification, 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {4144}, documenturl = { http://leodemoura.github.io/files/cav06.pdf} }
@inproceedings{DBLP:conf/cav/BarrettMS05, author = {Clark W. Barrett and Leonardo de Moura and Aaron Stump}, title = { {SMT-COMP}: Satisfiability Modulo Theories Competition }, year = {2005}, pages = {20-23}, booktitle = {Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {3576}, documenturl = { http://leodemoura.github.io/files/smtcomp05_short_paper.pdf} }
@article{BdMS05-JAR, author = {Clark Barrett and Leonardo de Moura and Aaron Stump}, doi = {10.1007/s10817-006-9026-1}, journal = {Journal of Automated Reasoning}, month = nov, number = {4}, pages = {373--390}, posted-at = {2011-02-08 17:43:04}, priority = {2}, publisher = {Springer Netherlands}, title = {Design and Results of the First Satisfiability Modulo Theories Competition ({SMT-COMP} 2005)}, documenturl = { http://leodemoura.github.io/files/smtcomp_jar.pdf}, volume = {35}, year = {2005} }
@article{DBLP:journals/entcs/MouraRS05, author = {Leonardo de Moura and Harald Rue{\ss} and Natarajan Shankar}, title = {Justifying Equality}, journal = {Electr. Notes Theor. Comput. Sci.}, volume = {125}, number = {3}, year = {2005}, pages = {69-85}, documenturl = { http://leodemoura.github.io/files/equality.pdf} }
@inproceedings{DBLP:conf/cav/MouraR04, author = {Leonardo de Moura and Harald Rue{\ss}}, title = {An Experimental Evaluation of Ground Decision Procedures}, year = {2004}, pages = {162-174}, booktitle = {Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {3114}, documenturl = { http://leodemoura.github.io/files/gdp.pdf} }
@inproceedings{DBLP:conf/cav/MouraORRSST04, author = {Leonardo de Moura and Sam Owre and Harald Rue{\ss} and John M. Rushby and Natarajan Shankar and Maria Sorea and Ashish Tiwari}, title = { {SAL 2} }, year = {2004}, pages = {496-500}, booktitle = {Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {3114}, documenturl = { http://leodemoura.github.io/files/sal2.pdf} }
@inproceedings{DBLP:conf/cade/MouraORRS04, author = {Leonardo de Moura and Sam Owre and Harald Rue{\ss} and John M. Rushby and Natarajan Shankar}, title = {The {ICS} Decision Procedures for Embedded Deduction}, year = {2004}, pages = {218-222}, booktitle = {Automated Reasoning - Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {3097}, documenturl = { http://leodemoura.github.io/files/ics.pdf} }
@inproceedings{DBLP:conf/sefm/HamonMR04, author = {Gr{\'e}goire Hamon and Leonardo de Moura and John M. Rushby}, title = {Generating Efficient Test Sets with a Model Checker}, year = {2004}, pages = {261-270}, booktitle = {2nd International Conference on Software Engineering and Formal Methods (SEFM 2004), 28-30 September 2004, Beijing, China}, publisher = {IEEE Computer Society}, documenturl = { http://leodemoura.github.io/files/testgen.pdf} }
@inproceedings{DBLP:conf/cav/MouraRS03, author = {Leonardo de Moura and Harald Rue{\ss} and Maria Sorea}, title = {Bounded Model Checking and Induction: From Refutation to Verification}, year = {2003}, pages = {14-26}, booktitle = {Computer Aided Verification, 15th International Conference, CAV 2003, Boulder, CO, USA, July 8-12, 2003, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {2725}, documenturl = { http://leodemoura.github.io/files/cav03.pdf} }
@inproceedings{DBLP:conf/wsc/RuessM03, author = {Harald Rue{\ss} and Leonardo de Moura}, title = {From simulation to verification (and back)}, year = {2003}, pages = {888-896}, booktitle = {Proceedings of the 35th Winter Simulation Conference: Driving Innovation, New Orleans, Louisiana, USA, December 7-10, 2003}, publisher = {ACM}, documenturl = { http://leodemoura.github.io/files/wsc03.pdf} }
@inproceedings{DBLP:conf/cade/MouraRS02, author = {Leonardo de Moura and Harald Rue{\ss} and Maria Sorea}, title = {Lazy Theorem Proving for Bounded Model Checking over Infinite Domains}, year = {2002}, pages = {438-455}, booktitle = {Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {2392}, documenturl = { http://leodemoura.github.io/files/cade02.pdf} }
@inproceedings{DBLP:conf/icsm/BaxterYMSB98, author = {Ira D. Baxter and Andrew Yahin and Leonardo de Moura and Marcelo Sant'Anna and Lorraine Bier}, title = {Clone Detection Using Abstract Syntax Trees}, booktitle = {International Conference on Software Maintenance ({ICSM'98}), Bethesda, Maryland, USA}, year = {1998}, pages = {368-377}, documenturl = { http://leodemoura.github.io/files/ICSM98.pdf} }
@techreport{SRI:yices:tool, author = { Bruno Dutertre and Leonardo de Moura}, title = { The {Yices} {SMT} solver }, year = {2006}, documenturl = {http://yices.csl.sri.com/tool-paper.pdf}, institution = { {SRI International} } }
@techreport{SRI:simplex:dpllt, author = { Bruno Dutertre and Leonardo de Moura}, title = { Integrating Simplex with {DPLL(T)} }, year = {2006}, institution = { {SRI International} }, documenturl = { http://leodemoura.github.io/files/sri-csl-06-01.pdf} }
@inproceedings{dMR:SAT'2002, author = {Leonardo de Moura and Harald Rue{\ss}}, title = { Lemmas on demand for satisfiability solvers }, year = {2002}, booktitle = {Symposium on the Theory and Applications of Satisfiability Testing (SAT'02), Cincinnati, USA}, documenturl = { http://leodemoura.github.io/files/sat02.pdf} }
@techreport{SRI:test:generation, author = { Gr{\'e}goire Hamon and Leonardo de Moura and John Rushby}, title = { Automated test generation with {SAL}}, year = {2005}, institution = { {SRI International} }, note = { {CSL} Technical Note}, documenturl = { http://leodemoura.github.io/files/salatg.pdf} }
@techreport{demoura2007relevancy, title = {Relevancy propagation}, author = {Leonardo de Moura and Nikolaj Bj{\o}rner}, year = {2007}, number = { {MSR-TR-2007-140} }, institution = { {Microsoft Research} }, documenturl = {http://research.microsoft.com/projects/z3/relevancy.pdf} }
@inproceedings{Moura05integratingverification, author = {Leonardo de Moura and Sam Owre and Harald Rue{\ss} and John Rushby and Natarajan Shankar}, title = {Integrating verification components}, booktitle = {In Verified Software: Theories, Tools, Experiments}, year = {2005}, documenturl = { http://leodemoura.github.io/files/vstte.pdf} }
@inproceedings{BjornerDeMoura2009, author = {Nikolaj Bj{\o}rner and Leonardo de Moura}, title = {$Z3^{10}$: Applications, Enablers, Challenges and Directions}, year = {2009}, booktitle = {Sixth International Workshop on Constraints in Formal Verification Grenoble, France}, documenturl = { http://leodemoura.github.io/files/cfv09.pdf} }
@inproceedings{deMouraPassmore09, author = {Leonardo de Moura and Grant Olney Passmore}, title = {On Locally Minimal Nullstellensatz Proofs}, year = {2009}, booktitle = {7th International Workshop on Satisfiability Modulo Theories, {SMT}, Montreal, Canada}, documenturl = { http://leodemoura.github.io/files/SMT-09.pdf} }
@techreport{deMouraPassmore09ext, author = {Leonardo de Moura and Grant Olney Passmore}, title = {On Locally Minimal Nullstellensatz Proofs}, year = {2009}, institution = { {Microsoft Research} }, documenturl = { http://leodemoura.github.io/files/MSR-TR-2009-90.pdf}, number = { {MSR-TR-2009-90} } }
@inproceedings{PassmoreDeMoura09, author = {Grant Olney Passmore and Leonardo de Moura}, title = {Universality of Polynomial Positivity and a Variant of {Hilbert's} 17th Problem}, year = {2009}, booktitle = { Automated Deduction: Decidability, Complexity, Tractability, {ADDCT'09}, Montreal, Canada}, documenturl = { http://leodemoura.github.io/files/addct-09.pdf} }
@inproceedings{LPAR:Join:08, author = { Nikolaj Bj{\o}rner and Bruno Dutertre and Leonardo de Moura }, title = {Accelerating Lemma Learning using Joins - {DPPL(Join)}}, year = {2008}, booktitle = { 15th International Conference on Logic for Programming Artificial Intelligence and Reasoning, {LPAR'08}}, documenturl = { http://leodemoura.github.io/files/joins.pdf} }
@article{Barrettetal2012JAR, author = {Clark Barrett and Morgan Deters and Leonardo de Moura and Albert Oliveras and Aaron Stump}, year = {2012}, title = { {6 Years of SMT-COMP} }, journal = {Journal of Automated Reasoning}, documenturl = {http://www.springerlink.com/content/t5302157331451k7/} }
@inproceedings{BjornerDeMouraTillmann09, author = { Nikolaj Bj{\o}rner and Leonardo de Moura and Nikolai Tillmann }, title = { Satisfiability Modulo Bit-precise Theories for Program Exploration }, year = {2008}, booktitle = { Fifth International Workshop on Constraints in Formal Verification, ({CFV'08}), Sydney, Australia }, documenturl = { http://leodemoura.github.io/files/smbpex.pdf} }
@misc{deMoura-etal:HCSS03, author = {Leonardo de Moura and Harald Rue{\ss} and John Rushby and Natarajan Shankar}, title = {Embedded Deduction With {ICS}}, booktitle = {National Security Agency's Third High Confidence Software and Systems Conference}, year = {2003}, documenturl = { http://leodemoura.github.io/files/hcss03.pdf} }
@article{whd12, author = {Christoph Wintersteiger and Youssef Hamadi and Leonardo de Moura}, title = {Efficiently solving quantified bit-vector formulas}, journal = {{Formal Methods in System Design}}, publisher = {Springer}, url = {http://dx.doi.org/10.1007/s10703-012-0156-2}, year = {2012}, documenturl = { http://leodemoura.github.io/files/ufbv_journal.pdf} }
@incollection{tractability, author = {Nikolaj Bj{\o}rner and Leonardo de Moura}, booktitle = {Handbook of Tractability}, title = {{Tractability and Modern Satisfiability Modulo Theories Solvers}}, publisher = {Cambridge University Press}, editors = {Lucas Bordeaux and Youssef Hamadi and Pushmeet Kohli and Robert Mateescu}, documenturl = { http://leodemoura.github.io/files/tractability.pdf}, year = {2012} }
This file was generated by bibtex2html 1.99.


| Figure 4 |
Grain yield in rainfed maize expressed as a percentage of gr ... |
| Figure 3 |
Simulated grain yield in rainfed maize expressed as a percen ... |
| Figure 1 |
Maize production areas in China, and the Chinese Maize Belt ... |
| Figure 2 |
Simulated combined effects of variety (varieties planted in ... |


|
Class Summary |
| BondCFTerminationEvent |
This class contains the current "liveness" state of the bond, and, if inactive, how it entered that state. |
| BondCouponParams |
Contains the coupon type, schedule, and the coupon amount for the bond. |
| BondCurrencyParams |
This class contains the bond's trade, the coupon, and the redemption currencies. |
| BondFixedPeriodGenerationParams |
This is the place-holder for the generic bondís period generation parameters. |
| BondFloaterParams |
Contains the bond's floating rate parameters. |
| BondIdentifierParams |
This class contains the bond's identifier parameters - ISIN, CUSIP, ID, and ticker. |
| BondIRValuationParams |
Contains the bond IR Valuation Parameters. |
| BondNotionalParams |
This class contains the notional schedule and the amount. |
| BondPeriodGenerationParams |
Class the generates the bond coupon periods from flexible inputs |
| BondTSYParams |
Class contains bond treasury benchmark parameters - the treasury benchmark set, and the names of the
treasury and the EDF IR curves. |
| CDXIdentifier |
This class implements the creation and the static details of the all the NA, EU, SovX, EMEA, and ASIA
standardized CDS indicies. |
| CompCRValParams |
CompCRValParams contains the credit related valuation parameters - use default pay lag, use curve or the
component recovery, component recovery, credit curve name, and whether there is accrual on default |
| CurrencyPair |
CurrencyPair class contains the numerator currency, the denominator currency, the quote currency, and the
PIP Factor |
| EmbeddedOptionSchedule |
This class is a place holder for the embedded option schedule for the bond. |
| FactorSchedule |
Contains array of dates and factors |
| TsyBmkSet |
Contains the treasury benchmark set - the primary treasury benchmark, and an array of secondary treasury
benchmarks |


German minister and US envoy have clash over Huawei’s possible participation in Germany’s 5G network - SCMP
by Ross J BurlandThe South China Morning Post has reported that the German minister and US envoy have clash over Huawei’s possible participation in Germany’s 5G network.
Opening paragraphs
German Chancellor Angela Merkel is facing more criticism for her Huawei Technologies-friendly approach to 5G development, as the American ambassador to Germany called her economic minister’s remarks on cybersecurity an “insult” to the US.
The latest rift emerged as the minister, Peter Altmaier, one of Merkel’s few allies on her 5G approach, on Sunday compared concerns over potential spying by the Chinese government to previous phone-tapping by the “unreliable” US government.
Key notes
- Economic minister Peter Altmaier says risk of Huawei transmitting data to Chinese intelligence agencies is no greater than what ‘unreliable’ US has already done.
- US ambassador Richard Grenell calls comparison ‘an insult’ to Americans ‘who contribute to the security of Germany’.
FX implications
Earlier in the day, there were additional reports of Chinese interest in opening up relations with Europe, which can on;y be a supportive factor for the euro as the US becomes isolated.


Block
and
Transaction
, peer connectivity via PeerGroup
,
and block chain management.See: Description
| Interface | Description |
|---|---|
| MasternodeManagerListener |
Created by Hash Engineering on 5/14/2016.
|
| MasternodeSyncListener |
Created by Hash Engineering on 2/28/2016.
|
| Monetary |
Classes implementing this interface represent a monetary value, such as a Bitcoin or fiat amount.
|
| PeerFilterProvider |
An interface which provides the information required to properly filter data downloaded from Peers.
|
| TransactionBag |
This interface is used to abstract the
Wallet and the Transaction |
| TransactionBroadcast.ProgressCallback |
An interface for receiving progress information on the propagation of the tx, from 0.0 to 1.0
|
| TransactionBroadcaster |
A general interface which declares the ability to broadcast transactions.
|
| TransactionConfidence.Listener |
A confidence listener is informed when the level of
TransactionConfidence is updated by something, like
for example a Wallet . |
| UTXOProvider |
A UTXOProvider encapsulates functionality for returning unspent transaction outputs,
for use by the wallet or other code that crafts spends.
|
| Class | Description |
|---|---|
| AbstractBlockChain |
An AbstractBlockChain holds a series of
Block objects, links them together, and knows how to verify that
the chain follows the rules of the NetworkParameters for this chain. |
| AbstractManager |
Created by Hash Engineering on 6/21/2016.
|
| ActiveMasternode |
Created by Hash Engineering on 2/22/2016.
|
| Address |
A Bitcoin address looks like 1MsScoe2fTJoq4ZPdQgqyhgWeoNamYPevy and is derived from an elliptic curve public key
plus a set of network parameters.
|
| AddressMessage |
Represents an "addr" message on the P2P network, which contains broadcast IP addresses of other peers.
|
| AlertMessage |
Alerts are signed messages that are broadcast on the peer-to-peer network if they match a hard-coded signing key.
|
| Base58 |
Base58 is a way to encode Bitcoin addresses (or arbitrary data) as alphanumeric strings.
|
| BitcoinSerializer |
Methods to serialize and de-serialize messages to the Bitcoin network format as defined in
the protocol specification.
|
| BitcoinSerializer.BitcoinPacketHeader | |
| Block |
A block is a group of transactions, and is one of the fundamental data structures of the Bitcoin system.
|
| BlockChain |
A BlockChain implements the simplified payment verification mode of the Bitcoin protocol.
|
| BloomFilter |
A Bloom filter is a probabilistic data structure which can be sent to another client so that it can avoid
sending us transactions that aren't relevant to our set of keys.
|
| BudgetManager |
Created by Eric on 2/27/2016.
|
| CheckpointManager |
Vends hard-coded
StoredBlock s for blocks throughout the chain. |
| ChildMessage |
Represents a Message type that can be contained within another Message.
|
| Coin |
Represents a monetary Bitcoin value.
|
| CoinDefinition |
Created with IntelliJ IDEA.
|
| Context |
The Context object holds various objects and pieces of configuration that are scoped to a specific instantiation of
mtnsj for a specific network.
|
| DarkCoinSystem |
Created by Hash Engineering on 2/8/2015.
|
| DarkSendElectionEntryMessage |
Created by Hash Engineering on 2/10/2015.
|
| DarkSendElectionEntryPingMessage |
Created by Eric on 2/10/2015.
|
| DarkSendEntryGetMessage |
Created by Hash Engineering on 2/10/2015.
|
| DarkSendQueue | |
| DumpedPrivateKey |
Parses and generates private keys in the form used by the Bitcoin "dumpprivkey" command.
|
| ECKey |
Represents an elliptic curve public and (optionally) private key, usable for digital signatures but not encryption.
|
| ECKey.ECDSASignature |
Groups the two components that make up a signature, and provides a way to encode to DER form, which is
how ECDSA signatures are represented when embedded in other data structures in the Bitcoin protocol.
|
| EmptyMessage |
Parent class for header only messages that don't have a payload.
|
| FilteredBlock |
A FilteredBlock is used to relay a block with its transactions filtered using a
BloomFilter . |
| FullPrunedBlockChain |
A FullPrunedBlockChain works in conjunction with a
FullPrunedBlockStore to verify all the rules of the
Bitcoin system, with the downside being a large cost in system resources. |
| GetAddrMessage |
Represents the "getaddr" P2P protocol message, which requests network
AddressMessage s from a peer. |
| GetBlocksMessage |
Represents the "getblocks" P2P network message, which requests the hashes of the parts of the block chain we're
missing.
|
| GetDataMessage |
Represents the "getdata" P2P network message, which requests the contents of blocks or transactions given their
hashes.
|
| GetHeadersMessage |
The "getheaders" command is structurally identical to "getblocks", but has different meaning.
|
| GetMasternodePaymentRequestSyncMessage |
Created by Hash Engineering on 2/27/2016.
|
| GetMasternodeVoteSyncMessage |
Created by Eric on 2/8/2015.
|
| GetSporksMessage |
Represents the "getaddr" P2P protocol message, which requests network
AddressMessage s from a peer. |
| GetUTXOsMessage |
This command is supported only by Bitcoin XT nodes, which
advertise themselves using the second service bit flag.
|
| GovernanceSyncMessage |
Created by Eric on 2/12/2017.
|
| HeadersMessage |
A protocol message that contains a repeated series of block headers, sent in response to the "getheaders" command.
|
| InventoryItem | |
| InventoryMessage |
Represents the "inv" P2P network message.
|
| ListMessage |
Abstract superclass of classes with list based payload, ie InventoryMessage and GetDataMessage.
|
| Masternode |
Created by Eric on 2/8/2015.
|
| MasternodeAddress |
A PeerAddress holds an IP address and port number representing the network location of
a peer in the Bitcoin P2P network.
|
| MasternodeBroadcast |
Created by Hash Engineering on 2/20/2015.
|
| MasternodeInfo |
Created by Eric on 2/8/2017.
|
| MasternodeManager |
Created by Hash Engineering on 2/20/2016.
|
| MasternodePayments |
Created by Eric on 2/21/2016.
|
| MasterNodePaymentWinner |
Created by Eric on 2/8/2015.
|
| MasternodePing | |
| MasternodeSignature |
Created by Hash Engineering on 2/20/2015.
|
| MasternodeSync |
Created by Eric on 2/21/2016.
|
| MasterNodeSystem |
Created by Eric on 2/8/2015.
|
| MasterNodeVote | |
| MemoryPoolMessage |
The "mempool" message asks a remote peer to announce all transactions in its memory pool, possibly restricted by
any Bloom filter set on the connection.
|
| Message |
A Message is a data structure that can be serialized/deserialized using the Bitcoin serialization format.
|
| MessageSerializer |
Generic interface for classes which serialize/deserialize messages.
|
| NetAddress |
A PeerAddress holds an IP address and port number representing the network location of
a peer in the Bitcoin P2P network.
|
| NetworkParameters |
NetworkParameters contains the data needed for working with an instantiation of a Bitcoin chain.
|
| NotFoundMessage |
Sent by a peer when a getdata request doesn't find the requested data in the mempool.
|
| PartialMerkleTree |
A data structure that contains proofs of block inclusion for one or more transactions, in an efficient manner.
|
| Peer |
A Peer handles the high level communication with a Bitcoin node, extending a
PeerSocketHandler which
handles low-level message (de)serialization. |
| PeerAddress |
A PeerAddress holds an IP address and port number representing the network location of
a peer in the Bitcoin P2P network.
|
| PeerGroup |
Runs a set of connections to the P2P network, brings up connections to replace disconnected nodes and manages
the interaction between them all.
|
| PeerSocketHandler |
Handles high-level message (de)serialization for peers, acting as the bridge between the
site.mtnsj.net classes and Peer . |
| Ping |
Instances of this class are not safe for use by multiple threads.
|
| Pong |
Instances of this class are not safe for use by multiple threads.
|
| PublicKey |
Created by Hash Engineering on 2/10/2015.
|
| RejectMessage |
A message sent by nodes when a message we sent was rejected (ie a transaction had too little fee/was invalid/etc).
|
| SendHeadersMessage |
Created by Eric on 10/16/2016.
|
| Sha256Hash |
A Sha256Hash just wraps a byte[] so that equals and hashcode work correctly, allowing it to be used as keys in a
map.
|
| SporkManager |
Created by Hash Engineering on 2/20/2016.
|
| SporkMessage |
Created by Eric on 2/8/2015.
|
| StoredBlock |
Wraps a
Block object with extra data that can be derived from the block chain but is slow or inconvenient to
calculate. |
| StoredUndoableBlock |
Contains minimal data neccessary to disconnect/connect the transactions
in the stored block at will.
|
| SyncStatusCount |
Created by Hash Engineering on 2/27/2015.
|
| Transaction |
A transaction represents the movement of coins from some addresses to some other addresses.
|
| TransactionBroadcast |
Represents a single transaction broadcast that we are performing.
|
| TransactionConfidence |
A TransactionConfidence object tracks data you can use to make a confidence decision about a transaction.
|
| TransactionInput |
A transfer of coins from one address to another creates a transaction in which the outputs
can be claimed by the recipient in the input of another transaction.
|
| TransactionLock | |
| TransactionLockCandidate |
Created by Eric on 2/7/2017.
|
| TransactionLockRequest |
Created by Hash Engineering Solutions on 2/22/2015.
|
| TransactionLockVote | |
| TransactionOutPoint |
This message is a reference or pointer to an output of a different transaction.
|
| TransactionOutPointLock |
Created by Eric on 2/7/2017.
|
| TransactionOutput |
A TransactionOutput message contains a scriptPubKey that controls who is able to spend its value.
|
| TransactionOutputChanges |
TransactionOutputChanges represents a delta to the set of unspent outputs.
|
| TxConfidenceTable |
Tracks transactions that are being announced across the network.
|
| UnknownMessage |
Instances of this class are not safe for use by multiple threads.
|
| UnsafeByteArrayOutputStream |
An unsynchronized implementation of ByteArrayOutputStream that will return the backing byte array if its length == size().
|
| Utils |
A collection of various utility methods that are helpful for working with the Bitcoin protocol.
|
| UTXO |
A UTXO message contains the information necessary to check a spending transaction.
|
| UTXOsMessage |
Message representing a list of unspent transaction outputs ("utxos"), returned in response to sending a
GetUTXOsMessage ("getutxos"). |
| VarInt |
A variable-length encoded unsigned integer using Satoshi's encoding (a.k.a.
|
| VersionAck |
The verack message, sent by a client accepting the version message they
received from their peer.
|
| VersionedChecksummedBytes |
In Bitcoin the following format is often used to represent some type of key:
|
| VersionMessage |
A VersionMessage holds information exchanged during connection setup with another peer.
|
| Enum | Description |
|---|---|
| AbstractBlockChain.NewBlockType | |
| Block.VerifyFlag |
Flags used to control which elements of block validation are done on
received blocks.
|
| BloomFilter.BloomUpdate |
The BLOOM_UPDATE_* constants control when the bloom filter is auto-updated by the peer using
it as a filter, either never, for all outputs or only for pay-2-pubkey outputs (default)
|
| CoinDefinition.CoinPrecision | |
| CoinDefinition.UnspentAPIType | |
| InventoryItem.Type | |
| NetworkParameters.ProtocolVersion | |
| PeerGroup.FilterRecalculateMode | |
| RejectMessage.RejectCode | |
| Transaction.Purpose |
This enum describes the underlying reason the transaction was created.
|
| Transaction.SigHash |
These constants are a part of a scriptSig signature on the inputs.
|
| TransactionConfidence.ConfidenceType |
Describes the state of the transaction in general terms.
|
| TransactionConfidence.IXType | |
| TransactionConfidence.Listener.ChangeReason |
An enum that describes why a transaction confidence listener is being invoked (i.e.
|
| TransactionConfidence.Source |
Information about where the transaction was first seen (network, sent direct from peer, created by ourselves).
|
| TransactionInput.ConnectionResult | |
| TransactionInput.ConnectMode |
| Exception | Description |
|---|---|
| AddressFormatException | |
| ECKey.KeyIsEncryptedException | |
| ECKey.MissingPrivateKeyException | |
| InsufficientMoneyException |
Thrown to indicate that you don't have enough money available to perform the requested operation.
|
| PeerException |
Thrown when a problem occurs in communicating with a peer, and we should
retry.
|
| ProtocolException | |
| PrunedException |
PrunedException is thrown in cases where a fully verifying node has deleted (pruned) old block data that turned
out to be necessary for handling a re-org.
|
| RejectedTransactionException |
This exception is used by the TransactionBroadcast class to indicate that a broadcast
Transaction has been rejected by the network, for example because it violates a
protocol rule.
|
| ScriptException | |
| UTXOProviderException | |
| VerificationException | |
| VerificationException.BlockVersionOutOfDate | |
| VerificationException.CoinbaseHeightMismatch | |
| VerificationException.CoinbaseScriptSizeOutOfRange | |
| VerificationException.DuplicatedOutPoint | |
| VerificationException.EmptyInputsOrOutputs | |
| VerificationException.ExcessiveValue | |
| VerificationException.LargerThanMaxBlockSize | |
| VerificationException.NegativeValueOutput | |
| VerificationException.UnexpectedCoinbaseInput | |
| WrongNetworkException |
This exception is thrown by the Address class when you try and decode an address with a version code that isn't
used by that network.
|
Block
and
Transaction
, peer connectivity via PeerGroup
,
and block chain management.
If what you're doing can be described as basic bitcoin tasks, the code is probably found here.
To learn more please consult the documentation on the website.Copyright © 2019. All rights reserved.


Slurm_exporter¶
The slurm_exporter is an open source exporter for Prometheus, and can be found here: https://github.com/vpenso/prometheus-slurm-exporter
By default, the slurm_exorter runs under the port 9817.
To access the metrics, either do:
curl http://localhost:9817/metrics
or access it directly in a browser. However, using curl can be handy, because you can grep the output, and do other nice things with it.
You should get something like this:
# TYPE promhttp_metric_handler_requests_total counter
promhttp_metric_handler_requests_total{code="200"} 3029
promhttp_metric_handler_requests_total{code="500"} 0
promhttp_metric_handler_requests_total{code="503"} 0
# HELP slurm_cpus_alloc Allocated CPUs
# TYPE slurm_cpus_alloc gauge
slurm_cpus_alloc 65792
# HELP slurm_cpus_idle Idle CPUs
# TYPE slurm_cpus_idle gauge
slurm_cpus_idle 0
# HELP slurm_cpus_other Mix CPUs
# TYPE slurm_cpus_other gauge
slurm_cpus_other 15616
# HELP slurm_cpus_total Total CPUs
# TYPE slurm_cpus_total gauge
slurm_cpus_total 81408
# HELP slurm_nodes_alloc Allocated nodes
# TYPE slurm_nodes_alloc gauge
slurm_nodes_alloc 257
# HELP slurm_nodes_comp Completing nodes
# TYPE slurm_nodes_comp gauge
slurm_nodes_comp 0
# HELP slurm_nodes_down Down nodes
# TYPE slurm_nodes_down gauge
slurm_nodes_down 28
Metrics¶
Here is an extract from the github page:
## Exported Metrics
### State of the CPUs
* **Allocated**: CPUs which have been allocated to a job.
* **Idle**: CPUs not allocated to a job and thus available for use.
* **Other**: CPUs which are unavailable for use at the moment.
* **Total**: total number of CPUs.
- [Information extracted from the SLURM **sinfo** command](https://slurm.schedmd.com/sinfo.html)
- [Slurm CPU Management User and Administrator Guide](https://slurm.schedmd.com/cpu_management.html)
### State of the Nodes
* **Allocated**: nodes which has been allocated to one or more jobs.
* **Completing**: all jobs associated with these nodes are in the process of being completed.
* **Down**: nodes which are unavailable for use.
* **Drain**: with this metric two different states are accounted for:
- nodes in ``drained`` state (marked unavailable for use per system administrator request)
- nodes in ``draining`` state (currently executing jobs but which will not be allocated for new ones).
* **Fail**: these nodes are expected to fail soon and are unavailable for use per system administrator request.
* **Error**: nodes which are currently in an error state and not capable of running any jobs.
* **Idle**: nodes not allocated to any jobs and thus available for use.
* **Maint**: nodes which are currently marked with the __maintenance__ flag.
* **Mixed**: nodes which have some of their CPUs ALLOCATED while others are IDLE.
* **Resv**: these nodes are in an advanced reservation and not generally available.
[Information extracted from the SLURM **sinfo** command](https://slurm.schedmd.com/sinfo.html)
### Status of the Jobs
* **PENDING**: Jobs awaiting for resource allocation.
* **PENDING_DEPENDENCY**: Jobs awaiting because of a unexecuted job dependency.
* **RUNNING**: Jobs currently allocated.
* **SUSPENDED**: Job has an allocation but execution has been suspended and CPUs have been released for other jobs.
* **CANCELLED**: Jobs which were explicitly cancelled by the user or system administrator.
* **COMPLETING**: Jobs which are in the process of being completed.
* **COMPLETED**: Jobs have terminated all processes on all nodes with an exit code of zero.
* **CONFIGURING**: Jobs have been allocated resources, but are waiting for them to become ready for use.
* **FAILED**: Jobs terminated with a non-zero exit code or other failure condition.
* **TIMEOUT**: Jobs terminated upon reaching their time limit.
* **PREEMPTED**: Jobs terminated due to preemption.
* **NODE_FAIL**: Jobs terminated due to failure of one or more allocated nodes.
[Information extracted from the SLURM **squeue** command](https://slurm.schedmd.com/squeue.html)
### Scheduler Information
* **Server Thread count**: The number of current active ``slurmctld`` threads.
* **Queue size**: The length of the scheduler queue.
* **Last cycle**: Time in microseconds for last scheduling cycle.
* **Mean cycle**: Mean of scheduling cycles since last reset.
* **Cycles per minute**: Counter of scheduling executions per minute.
* **(Backfill) Last cycle**: Time in microseconds of last backfilling cycle.
* **(Backfill) Mean cycle**: Mean of backfilling scheduling cycles in microseconds since last reset.
* **(Backfill) Depth mean**: Mean of processed jobs during backfilling scheduling cycles since last reset.
You can see more by looking at the local metrics.
Start service¶
To start the service, simply run:
systemctl start slurm_exporter
Note
all exporter services are under the /etc/systemd/system directory, and most binaries are under the /usr/local/bin directory
Alerts¶
All the alerts for the slurm_exporter are stored under /etc/prometheus/alerts/
Some of them include :
High RAM usage
High CPU usage
High mount volume
Host out of inodes
Unusual disk write latency
etc…
Dashboard¶
A dashboard is provided on the exporter github page.


Course example in Dutch
This would be the cover page of an article series or course
Let's start with Chapter One
Other languages:
Deutsch
Nederlands


pbmtext(1) pbmtext(1) NAME pbmtext - render text into a bitmap SYNOPSIS pbmtext [-font fontfile] [-builtin fontname] [-space pixels] [-lspace pixels] [text] DESCRIPTION Takes the specified text, either a single line from the command line or multiple lines from standard input, and renders it into a bitmap. In the bitmap, each line of input is a line of output. Formatting char‐ acters such as newline have no effect on the formatting; like any unprintable character, they turn into spaces. The bitmap is just wide enough for the longest line of text, plus mar‐ gins, and just high enough to contain the lines of text, plus margins. The left and right margins are twice the width of the widest character in the font; the top and bottom margins are the height of the tallest char‐ acter in the font. But if the text is only one line, all the margins are half of this. OPTIONS -font,-builtin By default, pbmtext uses a built-in font called bdf (about a 10 point Times-Roman font). You can use a fixed width font by speci‐ fying -builtin fixed. You can also specify your own font with the -font flag. The font‐ file is either a BDF file from the X window system or a PBM file. If the fontfile is a PBM file, it is created in a very specific way. In your window system of choice, display the following text in the desired (fixed-width) font: M ",/^_[`jpqy| M / !"#$%&'()*+ / < ,-./01234567 < > 89:;<=>?@ABC > @ DEFGHIJKLMNO @ _ PQRSTUVWXYZ[ _ { \]^_`abcdefg { } hijklmnopqrs } ~ tuvwxyz{|}~ ~ M ",/^_[`jpqy| M Do a screen grab or window dump of that text, using for instance xwd, xgrabsc, or screendump. Convert the result into a pbm file. If necessary, use pnmcut to remove everything except the text. Finally, run it through pnmcrop to make sure the edges are right up against the text. pbmtext can figure out the sizes and spac‐ ings from that. -space pixels Add pixels pixels of space between characters. This is in addi‐ tion to whatever space surrounding characters is built into the font, which is usually enough to produce a reasonable string of text. pixels may be negative to crowd text together, but the author has not put much thought or testing into how this works in every pos‐ sible case, so it might cause disastrous results. -B -lspace pixels Add pixels pixels of space between lines. This is in addition to whatever space above and below characters is built into the font, which is usually enough to produce a reasonable line spacing. pixels must be a whole number. pixels may be negative to crowd lines together, but the author has not put much thought or testing into how this works in every pos‐ sible case, so it might cause disastrous results. USAGE Often, you want to place text over another image. One way to do this is with ppmlabel. ppmlabel does not give you the font options that pbmtext does, though. Another way is to use pbmtext to create an image containing the text, then use pnmcomp to overlay the text image onto your base image. To make only the text (and not the entire rectangle containing it) cover the base image, you will need to give pnmcomp a mask, via its -alpha option. You can just use the text image itself as the mask, as long as you also spec‐ ify the -invert option to pnmcomp. If you want to overlay colored text instead of black, just use ppmchange to change all black pixels to the color of your choice before overlaying the text image. But still use the original black and white image for the alpha mask. If you want the text at an angle, use pnmrotate on the text image (and alpha mask) before overlaying. SEE ALSO pnmcut(1), pnmcrop(1), pnmcomp(1), ppmchange(1), pnmrotate(1), pbm‐ textps(1), ppmlabel(1), pbm(5) AUTHOR Copyright (C) 1993 by Jef Poskanzer and George Phillips 28 January 2001 pbmtext(1)


--- layout: default title: Sitespeed.io - Release notes 1.8.1 description: Sitespeed.io 1.8.1 release holds three really important bug fixes. author: Peter Hedenskog keywords: sitespeed.io, release, release-notes, 1.8.1 nav: image: http://sitespeed.io/img/sitespeed-1.5-twitter.jpg twitterdescription: Yes box, here are some really nice bug fixes. ---
There are three really important bug fixes in the 1.8.1 release, all three are now fixed in the sitespeed.io/YSlow branch and included in sitespeed.io
Also two other things fixed, first in the detailed summary page, the TTFB is in seconds, not milliseconds as done before. Thanks Peter van Gils for reporting!
The second thing is that now when every asset is fetched, the YSlow rule check if a favicon is cached was added and the favicon is now checked in the cache expire rules.
See the changelog for changes done in the past.


I use Salvia as an incense as it is intended for. First I purify some dried leaves with copal resin placed on a hot coal. I like the smell of copal, and it is good aid for meditation. After some time I then take the leaves and crush them and drop them on the coal. Then I just enjoy the fragrance of the leaves as they burn on the coal with the copal.
The incense gives me a very relaxing and anti-depressant, 'glowing' feeling, a lucid clarity of mind and a sense of well being. If done before sleep I will have incredible dreams and dream recall, and many times they will be lucid dreams. If used as intended, it is a beneficial for aid for meditation.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Game
Leaderboard
Reset thread
Pause
Resume
Disable Leaderboard
Enable Leaderboard
Ranked duration(minutes)
Set!
Current multiplier
Change multiplier
Set!
Add new player
Create!
Last ID
Copy to clipboard!
Last secret
Copy to clipboard!
Player zone
#
Name
Secret
DANGER ZONE
Seed without players
Seed with players


$blue: #3bbfce
$margin: 16px
.content-navigation
border-color: $blue
color: darken($blue, 9%)
.border
padding: $margin / 2
margin: $margin / 2
border-color: $blue
$blue: #3bbfce;
$margin: 16px;
.content-navigation {
border-color: $blue;
color:
darken($blue, 9%);
}
.border {
padding: $margin / 2;
margin: $margin / 2;
border-color: $blue;
}
Disclaimer: No influence intended
Support for SASS is greater. Over the last 12 months I have seen a trend in companies, individuals and applications supporting SASS over LESS
This doesn't just apply to progressive enhancement but is a common use of the parent selector in sass
.my-form {
input[type=checkbox],
input[type=radio] {
width: 18px;
height: 18px;
}
}
// Fat finger support
html.touch {
.my-form {
input[type=checkbox],
input[type=radio] {
width: 25px;
height: 25px;
}
}
}
.my-form
input[type=checkbox],
input[type=radio]
width: 18px
height: 18px
// Fat finger support
html.touch &
width: 25px
height: 25px
@include position(relative, 0px 0 0 100px);
@mixin prefixer ($property, $value, $prefixes) {
@each $prefix in $prefixes {
@if $prefix == webkit {
-webkit-#{$property}: $value;
}
@else if $prefix == moz {
-moz-#{$property}: $value;
}
@else if $prefix == ms {
-ms-#{$property}: $value;
}
@else if $prefix == o {
-o-#{$property}: $value;
}
@else if $prefix == spec {
#{$property}: $value;
}
@else {
@warn "Unrecognized prefix: #{$prefix}";
}
}
}
@mixin transform($property: none) {
@include prefixer(transform, $property, webkit moz ms o spec);
}
$blue: #3bbfce
$margin: 16px
.content-navigation
border-color: $blue
color: darken($blue, 9%)
.border
padding: $margin / 2
margin: $margin / 2
border-color: $blue
@blue: #3bbfce;
@margin: 16px;
.content-navigation {
border-color: @blue;
color:
darken(@blue, 9%);
}
.border {
padding: @margin / 2;
margin: @margin / 2;
border-color: @blue;
}
%separator
border-top: 1px solid black
hr
@extend %separator
.separator
@extend %separator
compiles to
hr,
.separator {
border-top: 1px solid black
}
... yes this IS more code, but its higher performance! It will also reduce the ammount of classes you have in your markup.
Compass is a Sass framework, designed to make the work of styling the web smooth and efficient. Much like Rails as a web application framework for Ruby, Compass is a collection of helpful tools and battle-tested best practices for Sass.
There little reason to not use SASS other than the very slight learning curve. I propose that for all new (and possibly for incubator projects) we use SASS. But I'll settle for SCSS.


{{ .Title }}
{{ .Content }}Hey, while you're here: I publish a weekly newsletter for ASP.NET Developers called ASP.NET Weekly, which helps you stay up to date on all the latest ASP.NET related news and blog posts. Please check it out and subscribe!
{{ define "main" }} {{ partial "support" . }}
Hey, while you're here: I publish a weekly newsletter for ASP.NET Developers called ASP.NET Weekly, which helps you stay up to date on all the latest ASP.NET related news and blog posts. Please check it out and subscribe!


picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick
picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick
picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick
picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick
picklerick picklerick picklerick picklerick Pickle Rick picklerick picklerick picklerick picklerick
picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick picklerick


| Figure 1 |
The time distribution of 17 models when global mean surface ... |
| Figure 2 |
The permafrost extent in Northern Hemisphere during the peri ... |
| Figure 3 |
The distribution of ALT (unit: cm) in permafrost region over ... |
| Figure 4 |
The extent of permafrost in Northern Hemisphere when global ... |


{% extends "top_base.html" %} {% block css_block %} {{ super() }} {% endblock %} {% block content_block %}
Product Name:
Product Description:
Price (per PIECE)
Price (per KG)
Price (per BOX)


Garhett Morgan
Project Lead - Software Engineer
Born and raised in Seattle. I have served in the Army for 5 years and, up until recently, was working in accounting for mid sized Kombucha Brewery. I decided to pursue my passion for computers by enrolling in Codefellows to study software engineering and haven't looked back. Now, I am on a journey to become a software engineer in cyber security.
Lindsey Shepard
Azure Software Engineer
My name is Lindsey and this is my first JavaScript course. When I started taking college courses I was looking into an accounting degree. When I was 22 I enlisted in the Marine Corps and because of the type of contract I signed I was placed into a Communications Platoon. I would maintain telephone and networks on tactical networks. The military introduced me to the Microsoft Software and Systems Academy (MSSA) course that is hosted by Embry-Riddle. Besides that boot camp I am new to the software industry.
I am excited about this class because I am learning JavaScript and I recently started a position with Microsoft as a Front-end Developer for Azure. I am hoping to gain a strong foundation with web design so I can contribute to my team and grow as an engineer.


People
Susan Desmond-Hellmann, MD, MPH, was born in Napa, California. Her father, a pharmacist, and mother, a teacher, raised the family of seven children in Reno, Nevada.
Desmond-Hellmann earned a Bachelor of Science degree at the University of Nevada, Reno in 1978 where she majored in pre-medicine. She continued on at UNR to earn her medical degree, graduating in 1982. Desmond-Hellmann later earned a master's degree in public health from UC Berkeley.
Desmond-Hellmann first came to UCSF in 1982 as an intern—an experience she says "transformed her" — and later served as chief resident. After completing her clinical training, she joined the UCSF faculty as associate adjunct professor of epidemiology and biostatistics and served two years as visiting faculty at the Uganda Cancer Institute, studying HIV/AIDS and cancer. Desmond-Hellmann then spent two years as a medical oncologist in private practice and afterward returned to clinical research.
Desmond-Hellmann worked for Genentech from 1995-2009, first as a clinical scientist. She was named chief medical officer in 1996 and executive vice president of development and product operations in 1999. Desmond-Hellmann served as president of product development at Genentech from March 2004-2009 and was responsible for preclinical and clinical development, process research and development, business development and product portfolio management.
In August of 2009, Desmond-Hellmann was named UCSF's ninth chancellor and became the first woman to hold the post. As chancellor, Desmond-Hellmann was actively involved in shaping biomedical policy and served as a member of the National Institutes of Health's advisory committee on the National Center for Advancing Translational Science. She also championed the new field of precision medicine, putting it on the roadmap for UCSF and the nation. To that end, in 2011 Desmond-Hellmann co-chaired a National Academy of Sciences (NAS) committee that produced the report, "Toward Precision Medicine: Building a Knowledge Network for Biomedical Research and a New Taxonomy of Disease."
She led the OME Precision Medicine Summit at UCSF Mission Bay in May 2013, a first-of-its-kind conference, which drew 170 of the world's foremost thinkers, creators and innovators in detailed discussions on how to medicine more proactive, preventive and precise.
Under her leadership and guidance, UCSF's excellence in patient care, research and education, and its public mission grew along with its size. UCSF's Mission Bay campus continued to thrive, adding the $1.5 billion state-of-the-art UCSF Medical Center at Mission Bay, which allowed for expansion of patient care services for women, children and cancer patients. "Mission Bay gives us new space and new opportunities for programs and to bring in new faculty," said Desmond-Hellmann. "It has allowed us to execute our mission of advancing health worldwide™ in ways that had been constrained. It's a huge uplift for everything we care about."
Desmond-Hellmann stepped down from chancellor of UCSF in March of 2014 to become the chief executive officer of the Bill & Melinda Gates Foundation. Praising Desmond-Hellmann's contributions to UCSF, UC President Janet Napolitano said: "With acrobatic precision, the Chancellor developed and executed an ambitious and creative vision for the campus, while navigating it through one of the worst fiscal crises in UC's history. She has been a champion of diversity, transparency and public service. Development of the [UCSF] Benioff Children's Hospital and her innovations in health care delivery are but two examples of her impact, not just on UCSF but also on the community it serves and within the broader realm of global health."
Desmond-Hellmann has garnered many distinctions. She was listed in Fortune magazine's "Top 50 Most Powerful Women in Business" in 2001 and from 2003-2008, listed as a "Woman to Watch" by the Wall Street Journal from 2004-2006, Healthcare Businesswomen's Association 2006 "Woman of the Year," named to the Biotech Hall of Fame in 2007, was inducted into the American Academy of Arts and Sciences and elected to the Institute of Medicine in 2010, and awarded an honorary Doctor of Science degree by Princeton University in 2011.


Horizontal

Spin

Slow

Fast

Shadow, vertical small

Shadow, vertical & horizontal small

Pulse

Float

Shake

Tada

Burst

Passing

Passing reverse

Flip horizontal


WITNESS LIST Cmte of the Whole on Leg & Cong Redistricting Committee May 12, 1997-11:00A SB 1564 For: Barbara Hankins (League of Women Voters), Austin Mac McGuire (himself), Austin Suzy Woodford (Common Cause), Austin SJR 41 For: Barbara Hankins (League of Women Voters), Austin Mac McGuire (himself), Austin Suzy Woodford (Common Cause), Austin


WITNESS LIST Public Safety Committee April 28, 1997-3:00P HB 414 For: Rep. Cuellar (Author HB 414) HB 1048 For: Rep. Gutierrez (Author HB 1048) HB 2251 Committee Substitute (Oakley) For: Rep. Wise (Author HB 2251) HB 2693 Committee Substitute (Oakley) For: Rep. Serna (Author HB 2693) HB 3128 Committee Substitute (Oakley) For: Rep. Naishtat (Author HB 3128)


October 08, 2015
For me, APIs (application program interfaces) ~~are~~ were like Homer’s island of Sirens - a beautiful sounding place where programmer happiness abounds but get to close and you’ll die a thousand deaths by poor documentation and JSON (Javascript Object Notation) spaghetti.
I was able to utilize a 3rd party API for one of my individual projects at General Assembly in conjunction with a data visualization library called HighCharts to extract basic data (number of alternative fuel stations by state) from NREL (the National Renewable Energy Laboratory), however, this project was done almost a year ago and since then I have been out of touch.
This post is a first in a series I hope to write documenting the things I learn when re-familiarizing myself with the world of APIs, jQuery, AJAX and JSON.
Let me begin with a simple premise: We should try to SEE the data we want to use. I found a great explanation provided by the GitHub API documentation here. Basically, it takes a very babystepish approach to utilizing HTTP to retrieve JSON:
Using cURL. cURL is a command line tool that allows you to use the keyword curl in your terminal (Mac) to retrieve or send files/data from/to a server using URL syntax. See list of cURL commands here.
When you use a curl command, it’s like making a GET request from the server using HTTP.
E.g. If you’re in the Terminal, type (replacing your GitHub username at the endpoint):
curl https://api.github.com/users/yourGitHubUserName
What you should see is a bunch of JSON with key, value pairs. This is the song the sirens sing. All JSON is is an object that represents something in key and value pairs. JSON objects can be nested within each other and this is where things can get confusing. For the purposes of this post, we are only concerned with familiarizing ourselves with how we can manipulate HTTP to retrieve data and what that data looks like.
Footnote: If you don’t want to use cURL, you can always enter the address into your browser to return the same results.
The GitHub API is not only well documented but the JSON returned, is very well organized and clear, for example if you type in https://api.github.com/users/dhh
you will see:
This info is all well and good but we want to see something more interesting. Let’s try to see info on all of DHH’s repos in his GitHub account. You’ll see that there is a secondary layer we must go down… the line:
repos_url: "https://api.github.com/users/dhh/repos",
has a link that will get us where we need to go (I do not magically know this, but have figured it out based on a little common sense and a 10 year old’s desire to play). Clicking here, we will see:
We now clearly see additional info on each of the repos belonging to the user DHH.
About a third of the way down, we see the following:
languages_url: "https://api.github.com/repos/dhh/asset-hosting-with-minimum-ssl/languages"
If we click here, we will see a nice, clean “languages” object showing us a key, value pair representing the langages used in that particular repo and the # of lines of code.
We’ve arrived on the island!


Are you a teenager planning to get a licence? Well before you do start applying for your licence it is very important that you know all the risks before you get on the road. Many of these risks will be outlined on this site.
Consequences of Bad Driving
This page will cover all common consquences of bad driving ranging from the least damaging to the worst outcome of bad driving
Common Road Accidents
This page will cover the most common road accidents, outlined by the Road Ready Course, and the best way to avoid and deal with them
Safe Road Practices
This page will cover the best practices to have while driving and what to do to minimise any sort of risk of crashes.


Quotes
Arnold Sommerfeld (c.1950) when asked why he had never written a book on thermodynamics:
"Thermodynamics is a funny subject. The first time you go through it, you don't understand it at all. The second time you go through it, you think you understand it, except for one or two small points. The third time you go through it, you know you don't understand it, but by that time you are so used to it, it doesn't bother you anymore."
Gyan on meetings:
"Meetings are where minutes are kept and hours are lost"
Colleague to grad student:
"It is an admirable thing to want to do things on your own, but it even more admirable to know when to ask for help"
From "The man who knew infinity: A life of the genius Ramanujan"
When Viswanatha Sastri got there a little later, Ramanujan was already eating yoghurt and sambhar. "If I had this in England," said Ramanujan. "I would not have gotten sick"
RRji when seeking funds for events:
"vacane kA daridrA?"
Samartha Guru Ramdas to Chhatrapati Shivaji:
"asAdhyam sAdhaya"


AP Top Science News at 1:02 a.m. EDT
by EndPlay3-2-1-Cookoff! Astronauts to bake cookies with new test oven
Spain offers Madrid as host of December UN climate summit
Greta Thunberg joins LA protest of oil drilling
Measles saps kids' ability to fight other germs
German court throws out climate challenge to Merkel govt
Hundreds of koalas feared dead in Australian wildfires
Science Says: How daylight saving time affects health
Activist Thunberg declines climate prize, urges more action
Dutch construction workers protest environmental rules
Swiss lament glacier melting as UN focuses on mountains


Class: ActionDispatch::Journey::GTG::Simulator
Do not use. This class is for internal use only.
| Relationships & Source Files | |
| Inherits: | Object |
| Defined in: | actionpack/lib/action_dispatch/journey/gtg/simulator.rb |
Constant Summary
-
INITIAL_STATE =
# File 'actionpack/lib/action_dispatch/journey/gtg/simulator.rb', line 17[ [0, nil] ].freeze
Class Method Summary
- .new(transition_table) ⇒ Simulator constructor
Instance Attribute Summary
- #tt readonly
Instance Method Summary
Constructor Details
.new(transition_table) ⇒ Simulator
# File 'actionpack/lib/action_dispatch/journey/gtg/simulator.rb', line 21
def initialize(transition_table) @tt = transition_table end
Instance Attribute Details
#tt (readonly)
[ GitHub ]# File 'actionpack/lib/action_dispatch/journey/gtg/simulator.rb', line 19
attr_reader :tt
Instance Method Details
#memos(string)
[ GitHub ]# File 'actionpack/lib/action_dispatch/journey/gtg/simulator.rb', line 25
def memos(string) input = StringScanner.new(string) state = INITIAL_STATE start_index = 0 while sym = input.scan(%r([/.?]|[^/.?]+)) end_index = start_index + sym.length state = tt.move(state, string, start_index, end_index) start_index = end_index end acceptance_states = state.each_with_object([]) do |s_d, memos| s, idx = s_d memos.concat(tt.memo(s)) if idx.nil? && tt.accepting?(s) end acceptance_states.empty? ? yield : acceptance_states end


text in body: Gotham Book 16pt
heading:Gotham Bold 20pt
regular text would look like this 16pt, 32pt line height
the font used for the small text would be playfare display


details
Filename: KryPtoN-PWR-20190604-1758.zip
Date: 2019/06/04
Size: 14.5 MB
Version: PWR
Changelog
- Upstream to 4.9.180 - Merge tag LA.UM.7.6.2.r1-08700-89xx.0 - Update sound control - add DTS:X Ultra - I'm forgot
details
Filename: KryPtoN-PWR-20190501-2028.zip
Date: 2019/05/01
Size: 14.4 MB
Version: PWR
Changelog
- Upstream to 4.9.170 - Add TCP congestion algorithm tsunami and scrable_re. tsunami is set to default - improve performance
details
Filename: KryPtoN-PWR-20190422-1034.zip
Date: 2019/04/22
Size: 14.5 MB
Version: PWR
Changelog
- Upstream to 4.9.171 - Add usb fast charge mode - Enable intractive gov - I forgot other change
details
Filename: KryPtoN-PWR-20190418-2250.zip
Date: 2019/04/18
Size: 14.3 MB
Version: PWR
Changelog
- Upstream to 4.9.170 - Add TCP congestion algorithm tsunami and scrable_re. tsunami is set to default - improve performance
details
Filename: KryPtoN-PWR-Pie-vince-20190303-1118.zip
Date: 2019/03/03
Size: 13.4 MB
Version: PWR
Changelog
- Merge tag 'LA.UM.7.6.2.r1-07100-89xx.0' - CPU input boost - Fast charging - OC GPU (725MHz) - OC CPU (500MHz)
details
Filename: KryPtoN-PWR-20190405-2216.zip
Date: 2019/04/05
Size: 11.6 MB
Version: PWR
Changelog
- Upstream to 3.18.138 - Improve performance - Add bfq I/O Scheduler and set default
details
Filename: KryPtoN-PWR-AOSP-Pie-vince-20190318-2134.zip
Date: 2019/03/18
Size: 11.6 MB
Version: PWR
Changelog
- lastest linux version and CAF tags - add scaling governor : * Alucard * Electron * Darkness (Not set by default) - add KSM and UKSM - add Klapse - add Adreno idler - TCP algorithm westwood - better performance - adaptive LMK - sound control - screen LED control - add fingerprint boost driver - add implementation DTS headphone:X Keep fiture : - OC CPU 200Mhz - Input bost CPU - Hotplug AutoSMP enable by default
details
Filename: KryPtoN-PWR-AOSP-Pie-vince-20190310-2248.zip
Date: 2019/03/10
Size: 11.6 MB
Version: PWR
Changelog
- Hotplug - OC GPU (725MHz) maybe not working - OC CPU (200MHz)
details
Filename: KryPtoN_-BLC-Pie-vince-20190217-1014.zip
Date: 2019/02/17
Size: 11.6 MB
Version: BLC
Changelog
- Hotplug - Merge latestes LA.UM.7.6.r1.04100-89xx.0 - Base latest pie-caf - devfreq boost driver - forgot change
details
Filename: KryPtoN-MIUI-PWR-20190524-1349.zip
Date: 2019/05/24
Size: 13.2 MB
Version: PWR
Changelog
- OC CPU 2.2GHz - OC GPU 750Mhz - Upstream to 3.18.140


Josh Gad Shows Off His Idina Menzel Impression On ‘The Late Late Show’
by Corey AtadJosh Gad has idolized Idina Menzel for ages.
Appearing on “The Late Late Show”, the “Frozen 2” star talked to host James Corden about his long history with his co-star, going all the way back to seeing her perform when he was in high school.
After doing a quick impression of her vocals, Gad recalled thinking, “I’m in love with this Jew from Long Island.”
He later saw her in Wicked on Broadway, again doing a hilarious impression of her singing “Defying Gravity”.
After Corden commented on how good his impression of Menzel is, Gad threw in an impression of her speaking that had the host in stitches.


Stories
A man who left a legacy
Rothman, who died in November after teaching writing at UCSC for four decades, knew that young writers began their academic careers the moment they set foot in their first college classroom.
One recent winner of the award, Sarah Edelstein, said she gained tremendous confidence from receiving the honor. "It was for the first paper I ever wrote at UCSC," she said. "To get that immediate validation was unbelievable for me."
Her parents, Bertram Edelstein and Karen Helrich, donated toward the endowment so other students and their parents could experience that same sense of well-earned pride. "When we found out the award was not fully funded, we wanted to do something to make sure other people benefited in the same way," Bertram Edelstein said.
Helrich was so thrilled about her daughter's award that she and her husband flew from San Diego to the ceremony and back again in the same day. "It was so worth it!" Helrich said. "My husband and I were holding hands, and tears were running down our cheeks. It was so beautiful to watch."
Now, supporters are close to reaching their initial goal of $25,000 to endow the fund, and hope to raise an additional $25,000, allowing them to increase the number of prizes and the amount of cash awards.
The growing endowment honors Rothman's memory in an impactful way, UCSC Writing Program chair James Wilson said.
"Don was really instrumental in making sure faculty and administrators understood that all students, from the time they enter the university, are part of the intellectual mission of the campus," Wilson said. "What better way to enact that belief than to set up an award like this?"
Since 2007 roughly 20 students have won prizes of up to $300.


{% extends 'brambling/user/__base_orders.html' %} {% load floppyforms humanize zenaida %} {% block title %}Order History – {{ block.super }}{% endblock %} {% block main %} {{ block.super }}
We found {{ claimable_orders|length|apnumber }} order{{ claimable_orders|pluralize }} associated with your email address.
| Event | Amount | Last transaction |
|---|---|---|
|
{{ order.event.name }}
{% include "brambling/event/_when.html" with event=order.event only %} |
{{ order.total|format_money:order.event.currency }} | {{ order.last_transaction_date }} |
| It doesn't look like you have any orders right now; get dancing! |


Twins prospect Ryan Costello found dead
by The Associated PressWELLINGTON, New Zealand (AP) — Minnesota Twins prospect Ryan Costello has been found dead in his Auckland hotel room days after joining the Auckland Tuatara in the Australian Baseball League.
The 23-year-old third baseman died in his sleep, apparently of natural causes, on Monday morning, team officials said.
“The Tuatara express their deepest condolences to Ryan’s family back home in the United States and to the whole Minnesota Twins organization,” the club said in the statement.
The statement said Costello’s teammates were “naturally devastated” by the news. Concerns were raised when Costello failed to report for training Monday morning, days ahead of the Tuatara’s opening game of the 2019-2020 ABL season.
Infielder Costello was traded to Minnesota last year as part of a deal that sent Zach Duke to the Seattle Mariners.
Born in Hartford, Connecticut, he played minor leagues for the Clinton Lumberjacks and later for the Fort Myers Miracle during their 2018 championship run.
Advertising
In an interview with Twins Daily in October, 2018, Costello said his greatest strength is “my ability to stay positive through tough times and understand that it’s part of the game and ups and downs are going to come.”
He spoke of his desire to spend time with family after his first professional season in 2019.
“My dad has a bass boat and has had it since I was a kid,” he told Twins Daily. “The first thing we do when I go home is go fishing.
“I’ve been home for seven days, I’ve been out fishing about four of those days. I live about five minutes from a river, the Connecticut River, so we go fishing on the river a lot.”
___
More AP MLB: https://apnews.com/MLB and https://twitter.com/AP_Sports
The Associated Press


There was an error. No page links to this page so if it occurs in the site map there was a link error.


Jenkins is a continuous integration tool. It is used to run builds and
continuously check the health of the project. If a test fails or the build breaks, it sends
emails to the dev team to immediately alert everyone of regressions.
The XUnit plugin allows Jenkins to tie
into testing tools. The tool just has to create an XML output file in the standard
XUnit format. Jenkins will fail the build
if the file shows errors.
Install
Install Jenkins
Install the XUnit plugin
Create a build
Add the something similar to the following to a shell build step. This script will run your
funcunit tests and copy the testresults.xml file into where jenkins wants it
Jenkins is a continuous integration tool. It is used to run builds and continuously check the health of the project. If a test fails or the build breaks, it sends emails to the dev team to immediately alert everyone of regressions.
The XUnit plugin allows Jenkins to tie into testing tools. The tool just has to create an XML output file in the standard XUnit format. Jenkins will fail the build if the file shows errors.
Install


Customer Experience Technology
We offer great service through our people. What can we offer through our technology?
Greenie, October 2017
Problem
Our clients can only progress their claims with the help from our team via emails, phone calls, or meetings. These channels rely on our team and our clients don't have enough transparency over their data nor our work.
Solution
Have a client portal that allows clients access to their claims and our resources.
Features
-
→ Simple claim progression
Clients know what's blocking us from filing their claims. -
Summary of the past
Clients know what we have done for them with a repository of past claims, amended returns, invoices, and raw data collected. -
Identity profiles
We build identity profiles on our clients both as organsations and as individuals which can be useful in our growth decisions. -
Data collection with live chat
Clients may have questions while giving us data, and we can integrate a live chat system to our existing data collection process. -
Our resources
We show how we work and how we price and can use this space to cross sell, promote partner offers and serve relevant content. -
Add-on services
We can add a widget to show results from the Grant Matching Tool or other tools that allow us to engage clients in more capacity than tax credits.
Quick demo
Everybody loves data
Our clients probably love data as much as we do. What can we do about that?
-
Reorganise our existing data
Start with a data entry project and translates figures from clients accounts, tax documents and claims into a database (in small batches for testing)
-
Test if useful
Run analysis reports or create simple infographics to show our clients data such as how much they have received in taxcredits, the percentage of their spend that is qualfiying R&D. Do our clients
-
To build or not to build
After finding the right reports, we can build the data collection component that enables these reports automatically.
Work
- Greenie is doing the research, the architecture design and will see through to the end or the handover of the project.
- Greg will work as a part-time developer on this as he cycles through other projects.
- One more in-house experienced software developer is needed with recruitment plans beginning when the architecture is nearly complete (begins recruitment mid-November and hopes to have someone up and running by January 2018).
MVP timeline
Towards end of Q1 in 2018, the first prototype with user authentication, repository of past claims and live chat for data collection will be ready.
After launch, we'll make decisions on the features to be prioritised.


{% extends 'bootstrap/base.html'%} {% import 'macros.html' as macro with context %}
News from all your favourite sources


Motif Finding
问题描述 :
Cell differentiation and development are fundamentally controlled by gene regulation. Only a subset of genes in the genome is expressed in a cell at a given time under given conditions. Regulatory sites on DNA sequence normally correspond to shared conservative sequence patterns among the regulatory regions of correlated genes. We call these conserved sequence motifs. The actual regulatory DNA sites corresponding to a motif are called the instances of that motif.
Identifying motifs and corresponding instances are very important, so biologists can investigate the interactions between DNA and proteins, gene regulation, cell development and cell reaction.Given two equal-length strings, the Hamming Distance is the number of positions in which the corresponding characters are different. For example, the Hamming Distance between “ACTG” and “ATCG” is 2 because they differ at the 2nd and 3rd positions.
The motif P is ATGCAACT.
Identifying motifs and corresponding instances are very important, so biologists can investigate the interactions between DNA and proteins, gene regulation, cell development and cell reaction.Given two equal-length strings, the Hamming Distance is the number of positions in which the corresponding characters are different. For example, the Hamming Distance between “ACTG” and “ATCG” is 2 because they differ at the 2nd and 3rd positions.
Your task is to find a motif for a few DNA sequences. Every DNA sequence consists of only A, C, G, T. If a substring of DNA sequence S has the same length with motif P and their Hamming Distance is not more than d, we say that S includes an instance of P. Given n DNA sequences with length of l. Among them, m sequences are “key sequences”. You need to find out the motif P whose length is w, so that every key sequence includes an instance of motif P. What’s more, the number of DNA sequences which include an instance of P should be as large as possible.
For example, n=7, m =7, l=40, w =8, d =2. The sequences are as follows (they are all key sequences):
The motif P is ATGCAACT.
输入:
The input contains several cases. The first line of each case contains three integers n (1 ≤ n ≤ 15), m (0 ≤ m ≤ n) and l (1 ≤ l ≤ 10,000). The second line contains two integers w (1 ≤ w ≤ 8) and d (0 ≤ d ≤ w). The third line contains m unique integers ranging from 0 to n-1, indicating the key sequences.Then followed by n lines, in which each line contains one sequence. The input is terminated by three zeros.
输出:
The input contains several cases. The first line of each case contains three integers n (1 ≤ n ≤ 15), m (0 ≤ m ≤ n) and l (1 ≤ l ≤ 10,000). The second line contains two integers w (1 ≤ w ≤ 8) and d (0 ≤ d ≤ w). The third line contains m unique integers ranging from 0 to n-1, indicating the key sequences.Then followed by n lines, in which each line contains one sequence. The input is terminated by three zeros.
样例输入:
3 2 4 3 1 0 2 ACTT CGTG CCCC 3 2 4 3 0 0 2 ACTT CGTG CCCC 0 0 0
样例输出:
CCT No solution
(adsbygoogle = window.adsbygoogle || []).push({});
古代有这种内裤了？ca，都是葫芦娃啊，蛇精呢
古代有这种内裤了？ca，都是葫芦娃啊，蛇精呢
古代有这种内裤了？ca，都是葫芦娃啊，蛇精呢
古代有这种内裤了？ca，都是葫芦娃啊，蛇精呢
古代有这种内裤了？ca，都是葫芦娃啊，蛇精呢
古代有这种内裤了？ca，都是葫芦娃啊，蛇精呢
古代有这种内裤了？ca，都是葫芦娃啊，蛇精呢
古代有这种内裤了？ca，都是葫芦娃啊，蛇精呢
等待后面的实现，多谢
头文件的颜色是有意设成这种灰暗色的吗？感觉看不清
gcc环境
居然看懂了
第二个是python代码啊。。
前排支持
文章写得挺好，就是最后的斐波那契那个没有看明白
很棒的网站，加油！⛽
有些说不通吧，只有1个孩子肯定是男孩了
算法是程序的灵魂，算法分简单和复杂，如果不搞大数据类，程序员了解一下简单点的算法也是可以的，但是会算法的一定要会编程才行，程序员不一定要会算法，利于自己项目需要的可以简单了解。
很好的思路，可以借鉴
您没有考虑 树的根节点是负数的情况， 若树的根节点是个很大的负数，那么就要考虑过不过另外一边子树了
。。。


Money Play. 0-0 to 7. How should Red play 52?
pips Red=127 White=133
(CorrectAnswer= 0/0, ErrorScore= 0)
The key to this position is to limit the number of Red blots to one.
23/16 follows the game plan of running for home when ahead but if one blot is hit the other becomes a liability.
The only move that is not a blunder is 23/18, 13/11. The 11-pt is very useful when Red has an open 5-pt. Meanwhile the rear blot starts its journey for home and Red can concentrate his efforts on that.
I think a lot of players would reflexively move 23/16 but that is a 1.5 blunder – perhaps a surprising result.
23/16 follows the game plan of running for home when ahead but if one blot is hit the other becomes a liability.
The only move that is not a blunder is 23/18, 13/11. The 11-pt is very useful when Red has an open 5-pt. Meanwhile the rear blot starts its journey for home and Red can concentrate his efforts on that.
I think a lot of players would reflexively move 23/16 but that is a 1.5 blunder – perhaps a surprising result.
1. Cubeful 2-ply 23/18 13/11 Eq.: +0.304 0.560 0.133 0.004 - 0.440 0.141 0.002 2. Cubeful 2-ply 13/6 Eq.: +0.186 (-0.119) 0.518 0.147 0.004 - 0.482 0.173 0.003 3. Cubeful 2-ply 23/16 Eq.: +0.185 (-0.119) 0.526 0.111 0.002 - 0.474 0.157 0.003 4. Cubeful 2-ply 13/11 13/8 Eq.: +0.170 (-0.134) 0.514 0.161 0.005 - 0.486 0.192 0.005 5. Cubeful 0-ply 11/4 Eq.: +0.103 (-0.201) 0.492 0.133 0.002 - 0.508 0.182 0.002


Through minimalism you can learn about ways to reduce your carbon footprint, support a healthier planet and improve your economy
This website is a simple project to use my web development skills to pull together some of the internet's resources on how to live a sustainable and minimal waste lifestyle. This is part of my projects to use technology to positively influence others to live healthier more efficient lives.


Benchmarking with Wrk
Today at Proleg Labs™ we're going to discuss the awesome bechmarking tool wrk. wrk is a badass little HTTP stress testing utility written by a mysterious open-source do-gooders. I'm gonna run through how we torture OlegDB with it to make sure everything is working in an acceptable fashion.
Building and installing wrk is outside the scope of this article, but it's not
hard. You just need to do your standard make && make install
dance and you'll
do fine. Once you have your wrk
executable handy, we can get started.
On my particular machine, I like to test with these settings:
$ ./wrk -t8 -c400 -d30s http://localhost:8080/test
This requires a little explanation.
-t8
is the number of threads to use. I've got eight cores, lets use eight threads.-c400
is the number of connections to have open. 400 seems like a nice, round number.-d30s
is the amount of time to stress test. Thirty seconds should be enough for anyone.
and the last parameter is the URL we'll be hitting with the wrk
jackhammer.
Since we need to actually test Oleg and not some 404 page we'll need to put
something into the database for wrk
to fetch. Results will vary based on how
much data you put in, but lets just test with this quote from
Thomas Hobbes' Leviathan:
Man is distinguished, not only by his reason, but by this singular passion from
other animals, which is a lust of the mind, that by a perseverance of delight
in the continued and indefatigable generation of knowledge, exceeds the short
vehemence of any carnal pleasure.
Say, thats neat Thomas Hobbes! Let's throw that into OlegDB, which I'll assume
you have running on localhost:8080
:
$ curl -X POST -d '
> Man is distinguished, not only by his reason, but by this singular passion from
> other animals, which is a lust of the mind, that by a perseverance of delight
> in the continued and indefatigable generation of knowledge, exceeds the short
> vehemence of any carnal pleasure.' http://localhost:8080/test
無駄
Just to do a quick test that it actually inserted (Hey, who knows, right?) let's curl it back out:
$ curl localhost:8080/test
Man is distinguished, not only by his reason, but by this singular passion from
other animals, which is a lust of the mind, that by a perseverance of delight
in the continued and indefatigable generation of knowledge, exceeds the short
vehemence of any carnal pleasure.
Excellent, now lets fire up wrk, point it at that URL and see what happens:
$ ./wrk -t8 -c400 -d30s http://localhost:8080/test
Running 30s test @ http://localhost:8080/test
8 threads and 400 connections
Thread Stats Avg Stdev Max +/- Stdev
Latency 18.05ms 93.64ms 866.52ms 96.72%
Req/Sec 4.71k 2.15k 16.44k 70.58%
1070154 requests in 30.00s, 420.48MB read
Socket errors: connect 0, read 0, write 0, timeout 27
Requests/sec: 35675.16
Transfer/sec: 14.02MB
Hey, 35,600
Requests/second. Not bad. Not bad at all. For fun, let's see how
Kyoto Tycoon performs with the same data and
conditions:
$ ./wrk -t8 -c400 -d30s http://localhost:1978/test
Running 30s test @ http://localhost:1978/test
8 threads and 400 connections
Thread Stats Avg Stdev Max +/- Stdev
Latency 3.05ms 2.47ms 340.86ms 99.65%
Req/Sec 17.59k 2.75k 37.67k 77.99%
3991195 requests in 30.00s, 1.39GB read
Requests/sec: 133041.46
Transfer/sec: 47.58MB
...well damn. I guess theres always room to improve.