📅 (2023-03-04 09:41:13 UTC)
# Packages matching: installed # Name # Installed # Synopsis base-bigarray base base-threads base base-unix base conf-findutils 1 Virtual package relying on findutils conf-gmp 4 Virtual package relying on a GMP lib system installation coq 8.15.2 Formal proof management system dune 3.6.2 Fast, portable, and opinionated build system ocaml 4.13.1 The OCaml compiler (virtual package) ocaml-base-compiler 4.13.1 Official release 4.13.1 ocaml-config 2 OCaml Switch Configuration ocaml-options-vanilla 1 Ensure that OCaml is compiled with no special options enabled ocamlfind 1.9.5 A library manager for OCaml zarith 1.12 Implements arithmetic and logical operations over arbitrary-precision integers # opam file: opam-version: "2.0" authors: [ "Andres Erbsen<EMAIL_ADDRESS>"Google Inc." "Jade Philipoom<EMAIL_ADDRESS><EMAIL_ADDRESS>"Massachusetts Institute of Technology" "Zoe Paraskevopoulou<EMAIL_ADDRESS>] maintainer: "Jason Gross<EMAIL_ADDRESS>homepage: "https://github.com/mit-plv/fiat-crypto" bug-reports: "https://github.com/mit-plv/fiat-crypto/issues" license: "MIT OR Apache-2.0 OR BSD-1-Clause" build: [ [make "-j%{jobs}%" "EXTERNAL_DEPENDENCIES=1" "SKIP_COQSCRIPTS_INCLUDE=1" "coq" "standalone-ocaml"] ] install: [make "EXTERNAL_DEPENDENCIES=1" "SKIP_COQSCRIPTS_INCLUDE=1" "BINDIR=%{bin}%" "install" "install-standalone-ocaml"] depends: [ "conf-findutils" {build} "ocaml" {build & >= "4.08~"} "ocamlfind" {build} "coq" {>= "8.15~"} "coq-coqprime" {>= "1.2.0"} "coq-rewriter" {>= "0.0.6" & <= "0.0.7"} "coq-rupicola" {= "0.0.6"} "coq-bedrock2-compiler" {= "0.0.4"} ] conflict-class: [ "coq-fiat-crypto" ] dev-repo: "git+https://github.com/mit-plv/fiat-crypto.git" synopsis: "Cryptographic Primitive Code Generation by Fiat" description: """ Coq code and proofs for a command-line binary that can synthesize proven-correct big-integer modular field arithmetic operations for cryptography. Target languages include C, Rust, Zig, Go, and bedrock2. """ tags: ["logpath:Crypto"] url { src: "https://github.com/mit-plv/fiat-crypto/archive/refs/tags/v0.0.17.tar.gz" checksum: "sha512=c7688c84fcc10cc063cff24d5d3d52edd04f26b16adb00e7389d648964e2a0cc0d81fa615d9091e491edd6fed81859f1ea4a12e19ba6793975be2b301369778a" }
true
Dry install with the current Coq version:
opam install -y --show-action coq-fiat-crypto.0.0.17 coq.8.15.2
Dry install without Coq/switch base, to test if the problem was incompatibility with the current Coq/OCaml version:
true
opam list; echo; ulimit -Sv 4000000; timeout 4h opam install -y --deps-only coq-fiat-crypto.0.0.17 coq.8.15.2
opam list; echo; ulimit -Sv 16000000; timeout 4h opam install -y -v coq-fiat-crypto.0.0.17 coq.8.15.2
# Packages matching: installed # Name # Installed # Synopsis base-bigarray base base-threads base base-unix base conf-findutils 1 Virtual package relying on findutils conf-gmp 4 Virtual package relying on a GMP lib system installation coq 8.15.2 Formal proof management system coq-bedrock2 0.0.4 A work-in-progress language and compiler for verified low-level programming coq-bedrock2-compiler 0.0.4 A work-in-progress language and compiler for verified low-level programming (compiler part) coq-bignums 8.15.0 Bignums, the Coq library of arbitrary large numbers coq-coqprime 1.2.0 Certifying prime numbers in Coq coq-coqutil 0.0.2 Coq library for tactics, basic definitions, sets, maps coq-record-update 0.3.1 Generic support for updating record fields in Coq coq-rewriter 0.0.7 Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting, experimental and tailored for use in Fiat Cryptography coq-riscv 0.0.3 RISC-V Specification in Coq, somewhat experimental coq-rupicola 0.0.6 Gallina to imperative code compilation, currently in design phase dune 3.6.2 Fast, portable, and opinionated build system ocaml 4.13.1 The OCaml compiler (virtual package) ocaml-base-compiler 4.13.1 Official release 4.13.1 ocaml-config 2 OCaml Switch Configuration ocaml-options-vanilla 1 Ensure that OCaml is compiled with no special options enabled ocamlfind 1.9.5 A library manager for OCaml zarith 1.12 Implements arithmetic and logical operations over arbitrary-precision integers [NOTE] Package coq is already installed (current version is 8.15.2). The following actions will be performed: - install coq-fiat-crypto 0.0.17 <><> Gathering sources ><><><><><><><><><><><><><><><><><><><><><><><><><><><><> Processing 1/1: [coq-fiat-crypto.0.0.17: http] [coq-fiat-crypto.0.0.17] downloaded from https://github.com/mit-plv/fiat-crypto/archive/refs/tags/v0.0.17.tar.gz Processing 1/1: <><> Processing actions <><><><><><><><><><><><><><><><><><><><><><><><><><><><> Processing 1/2: [coq-fiat-crypto: make coq] + /home/bench/.opam/opam-init/hooks/sandbox.sh "build" "make" "-j4" "EXTERNAL_DEPENDENCIES=1" "SKIP_COQSCRIPTS_INCLUDE=1" "coq" "standalone-ocaml" (CWD=/home/bench/.opam/ocaml-base-compiler.4.13.1/.opam-switch/build/coq-fiat-crypto.0.0.17) - ./src/Rewriter/PerfTesting/Specific/make.py primes.txt - GENTEST --makefile fiat-amd64/*.asm > Makefile.test-amd64-files.mk - ECHO > _CoqProject - COQ_MAKEFILE -f _CoqProject > Makefile.coq - Warning: native compilation is globally deactivated by the configure flag - fatal: not a git repository (or any parent up to mount point /) - Stopping at filesystem boundary (GIT_DISCOVERY_ACROSS_FILESYSTEM not set). - Makefile:154: warning: overriding recipe for target 'all' - Makefile.coq:386: warning: ignoring old recipe for target 'all' - Makefile:489: warning: overriding recipe for target 'validate' - Makefile.coq:514: warning: ignoring old recipe for target 'validate' - ECHO > src/Util/Tactics.v - fatal: not a git repository (or any parent up to mount point /) - Stopping at filesystem boundary (GIT_DISCOVERY_ACROSS_FILESYSTEM not set). - COQDEP VFILES - fatal: not a git repository (or any parent up to mount point /) - Stopping at filesystem boundary (GIT_DISCOVERY_ACROSS_FILESYSTEM not set). - Makefile:154: warning: overriding recipe for target 'all' - Makefile.coq:386: warning: ignoring old recipe for target 'all' - Makefile:489: warning: overriding recipe for target 'validate' - Makefile.coq:514: warning: ignoring old recipe for target 'validate' - COQC src/Util/ZUtil/Hints/Core.v - COQC src/Util/NatUtil.v - COQC src/Util/Pointed.v - COQC src/Util/IffT.v - COQC src/Util/Isomorphism.v - COQC src/Util/HProp.v - COQC src/Util/GlobalSettings.v - COQC src/Util/Tactics/Test.v - COQC src/Util/Tactics/ConstrFail.v - COQC src/Util/ZUtil/ZSimplify/Simple.v - COQC src/Util/ZUtil/Tactics/ReplaceNegWithPos.v - COQC src/Util/Tactics/GetGoal.v - COQC src/Util/Strings/Decimal.v - COQC src/Util/Tactics/Contains.v - COQC src/Util/Comparison.v - COQC src/Util/ZUtil/Tactics/SplitMinMax.v - COQC src/Util/Tactics/HasBody.v - COQC src/Util/Tactics/PrintContext.v - COQC src/Util/Tactics/DebugPrint.v - COQC src/Util/ListUtil/NthExt.v - COQC src/Util/Bool/Equality.v - COQC src/Util/ZUtil/Div/Bootstrap.v - COQC src/Util/ZUtil/Modulo/Bootstrap.v - COQC src/Util/ZUtil/Tactics/PrimeBound.v - COQC src/Util/ZUtil/Tactics/CompareToSgn.v - COQC src/Util/ZUtil/Tactics/DivideExistsMul.v - COQC src/Util/ZUtil/Lnot.v - COQC src/Util/Bool/LeCompat.v - COQC src/Util/ZUtil/N2Z.v - COQC src/Util/ZUtil/Pow2.v - COQC src/Util/ZUtil/Tactics/PeelLe.v - COQC src/Util/Tactics/NormalizeCommutativeIdentifier.v - COQC src/Util/Tactics/SetEvars.v - COQC src/Util/Tactics/SubstEvars.v - COQC src/Util/PER.v - COQC src/Util/ListUtil/FoldMap.v - COQC src/Util/ListUtil/PermutationCompat.v - COQC src/Util/NUtil/Sorting.v - COQC src/Util/NUtil/Testbit.v - COQC src/Util/Unit.v - COQC src/Util/ListUtil/SetoidListRev.v - COQC src/Util/ListUtil/RemoveN.v - COQC src/Algebra/Nsatz.v - COQC src/Util/ZUtil/Odd.v - COQC src/Util/Tactics/OnSubterms.v - COQC src/Util/Tactics/Revert.v - COQC src/Util/Factorize.v - COQC src/Util/Decidable/Bool2Prop.v - COQC src/Util/FueledLUB.v - COQC src/Util/Tactics/SimplifyRepeatedIfs.v - COQC src/TAPSort.v - COQC src/Util/ZUtil/Z2Nat.v - COQC src/Util/Tactics/ETransitivity.v - COQC src/Util/Tactics/SubstLet.v - COQC src/Util/ZUtil/ModExp.v - COQC src/Assembly/Parse/Examples/fiat_25519_carry_square_optimised.v - COQC src/Assembly/Parse/Examples/fiat_25519_carry_square_optimised_seed10.v - COQC src/Assembly/Parse/Examples/fiat_25519_carry_square_optimised_seed20.v - COQC src/Assembly/Parse/Examples/fiat_p256_mul_optimised_seed11.v - COQC src/Assembly/Parse/Examples/fiat_p256_mul_optimised_seed12.v - COQC src/Assembly/Parse/Examples/fiat_p256_mul_optimised_seed4.v - COQC src/Assembly/Parse/Examples/fiat_p256_square_optimised_seed103.v - COQC src/Assembly/Parse/Examples/fiat_p256_square_optimised_seed46.v - COQC src/Assembly/Parse/Examples/fiat_p256_square_optimised_seed6.v - COQC src/Assembly/Parse/Examples/boringssl_nasm_full_mul_p256.v - COQC src/Util/Loops.v - COQC src/PushButtonSynthesis/InvertHighLow.v - COQC src/Util/Tactics/ChangeInAll.v - COQC src/Util/DefaultedTypes.v - COQC src/Util/Pos.v - COQC src/Util/Sumbool.v - COQC src/Util/Bool/IsTrue.v - COQC src/Util/ZUtil/DistrIf.v - COQC src/Util/ZUtil/Ge.v - COQC src/Util/ZUtil/Mul.v - COQC src/Util/ZUtil/Sgn.v - COQC src/Util/ZUtil/Sorting.v - COQC src/Util/SideConditions/CorePackages.v - COQC src/Util/Logic/ImplAnd.v - COQC src/Util/Sigma/Associativity.v - COQC src/Util/Sigma/Lift.v - COQC src/Util/Sigma/MapProjections.v - COQC src/Util/Sigma/Related.v - COQC src/Util/Tactics/CPSId.v - COQC src/Util/Tactics/EvarNormalize.v - COQC src/Util/Tactics/ClearFree.v - COQC src/Util/Tactics/ClearAll.v - COQC src/Util/Tactics/ClearDuplicates.v - COQC src/Util/Tactics/ClearbodyAll.v - COQC src/Util/Tactics/ConvoyDestruct.v - COQC src/Util/Tactics/DestructTrivial.v - COQC src/Util/Tactics/ESpecialize.v - COQC src/Util/Tactics/EvarExists.v - COQC src/Util/Tactics/Forward.v - COQC src/Util/Tactics/PoseTermWithName.v - COQC src/Util/Tactics/SideConditionsBeforeToAfter.v - COQC src/Util/Tactics/SimplifyProjections.v - COQC src/Util/Tactics/TransparentAssert.v - COQC src/Util/Tactics/UnfoldArg.v - COQC src/Util/Tactics/UnifyAbstractReflexivity.v - COQC src/Util/Tactics/VM.v - COQC src/Util/ZUtil/Hints/ZArith.v - COQC src/Util/ZUtil/Hints/Ztestbit.v - COQC src/Util/ZUtil/Hints/PullPush.v - COQC src/Util/ZUtil/ZSimplify/Core.v - COQC src/Util/Equality.v - COQC src/Util/FixCoqMistakes.v - COQC src/Util/Tactics/Not.v - COQC src/Util/Tactics/SetoidSubst.v - COQC src/Util/PrimitiveProd.v - COQC src/Util/Tactics/FindHyp.v - COQC src/Util/DynList.v - COQC src/Util/Tactics/CountBinders.v - COQC src/Util/Tactics/AppendUnderscores.v - COQC src/Util/Tactics/PrintGoal.v - COQC src/Util/PrimitiveHList.v - COQC src/Util/Tactics/RunTacticAsConstr.v - COQC src/Util/Structures/Equalities.v - COQC src/Util/Structures/Equalities/Iso.v - COQC src/Util/Logic/Forall.v - COQC src/Util/Logic/Exists.v - COQC src/Util/ZUtil/Tactics/DivModToQuotRem.v - COQC src/Util/ZUtil/Modulo/PullPush.v - COQC src/Util/ZUtil/Tactics/LinearSubstitute.v - COQC src/Util/ZUtil/Opp.v - COQC src/Util/Logic/ProdForall.v - COQC src/Util/ListUtil/Partition.v - COQC src/Util/ListUtil/StdlibCompat.v - COQC src/Util/Structures/Equalities/Project.v - COQC src/Util/ListUtil/Concat.v - COQC src/Util/ListUtil/Filter.v - COQC src/Util/Logic.v - COQC src/Util/Structures/Equalities/Unit.v - COQC src/Util/Tactics/WarnIfGoalsRemain.v - COQC src/Util/ListUtil/CombineExtend.v - COQC src/Util/ZUtil/Nat2Z.v - COQC src/Util/Telescope/Core.v - COQC src/Util/ListUtil/Split.v - COQC src/Util/Tactics/RevertUntil.v - COQC src/Util/Curry.v - COQC src/Util/Tactics.v - COQC src/Util/Tower.v - COQC src/Util/Wf.v - COQC src/Util/Tactics/HeadUnderBinders.v - COQC src/Util/Structures/Equalities/Empty.v - COQC src/Util/Strings/String_as_OT.v - COQC src/Util/Strings/String_as_OT_old.v - COQC src/Util/Tactics/CacheTerm.v - COQC src/Util/Tactics/Delta1.v - COQC src/Util/ZUtil/Hints.v - COQC src/Util/Prod.v - COQC src/Util/Sigma.v - COQC src/Util/Tactics/Head.v - COQC src/Util/Tactics/DestructHyps.v - COQC src/Util/Notations.v - File "./src/Util/Sigma.v", line 376, characters 0-52: - Warning: The Ltac name inversion_sigma may be unusable because of a conflict - with a notation. [unusable-identifier,parsing] - COQC src/Util/Tactics/SpecializeBy.v - COQC src/Util/Tactics/DoWithHyp.v - COQC src/Util/Tac [...] truncated . - Refining with verified rewriter... - COQC src/Rewriter/Passes/FlattenThunkedRects.v - Reifying... - Compiling decision tree... - Splitting rewrite rules... - Assembling rewrite_head... - Reducing rewrite_head... - Tactic call ran for 0.484 secs (0.048u,0.s) (success) - Tactic call ran for 0.115 secs (0.011u,0.s) (success) - Tactic call ran for 0.846 secs (0.082u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Tactic call ran for 0.193 secs (0.017u,0.s) (success) - Tactic call ran for 1.322 secs (0.144u,0.s) (success) - Proving Rewriter_Interp... - Tactic call ran for 3.266 secs (0.348u,0.001s) (success) - Tactic call ran for 0.535 secs (0.058u,0.s) (success) - Assembling verified rewriter... - Refining with verified rewriter... - COQC src/Rewriter/Passes/MulSplit.v - Reifying... - Assembling rewrite_head... - Reducing rewrite_head... - Tactic call ran for 20.554 secs (2.199u,0.004s) (success) - Compiling decision tree... - Splitting rewrite rules... - Assembling rewrite_head... - Reducing rewrite_head... - Tactic call ran for 2.596 secs (0.328u,0.s) (success) - Tactic call ran for 7.485 secs (0.76u,0.s) (success) - Tactic call ran for 1.274 secs (0.129u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Tactic call ran for 3.7 secs (0.42u,0.006s) (success) - Tactic call ran for 41.055 secs (4.389u,0.031s) (success) - Proving Rewriter_Interp... - Tactic call ran for 110.421 secs (11.548u,0.027s) (success) - Tactic call ran for 45.692 secs (4.883u,0.031s) (success) - Assembling verified rewriter... - Refining with verified rewriter... - COQC src/Rewriter/Passes/MultiRetSplit.v - Reifying... - Tactic call ran for 1448.251 secs (151.922u,0.339s) (success) - Tactic call ran for 5.268 secs (0.55u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Tactic call ran for 26.186 secs (2.808u,0.s) (success) - Compiling decision tree... - Splitting rewrite rules... - Assembling rewrite_head... - Reducing rewrite_head... - Tactic call ran for 3.596 secs (0.411u,0.s) (success) - Tactic call ran for 38.169 secs (4.025u,0.007s) (success) - Tactic call ran for 19.3 secs (2.124u,0.s) (success) - Tactic call ran for 1.507 secs (0.15u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Proving Rewriter_Interp... - Tactic call ran for 6.75 secs (0.7u,0.004s) (success) - Tactic call ran for 68.768 secs (7.655u,0.003s) (success) - Tactic call ran for 101.563 secs (10.77u,0.039s) (success) - Proving Rewriter_Interp... - Tactic call ran for 60.139 secs (6.407u,0.s) (success) - Assembling verified rewriter... - Refining with verified rewriter... - Tactic call ran for 169.903 secs (17.665u,0.028s) (success) - COQC src/Rewriter/Passes/NoSelect.v - Reifying... - Compiling decision tree... - Splitting rewrite rules... - Assembling rewrite_head... - Reducing rewrite_head... - Tactic call ran for 1.407 secs (0.142u,0.s) (success) - Tactic call ran for 0.253 secs (0.017u,0.s) (success) - Tactic call ran for 0.894 secs (0.093u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Tactic call ran for 0.419 secs (0.045u,0.s) (success) - Tactic call ran for 7.026 secs (0.731u,0.004s) (success) - Proving Rewriter_Interp... - Tactic call ran for 92.197 secs (9.658u,0.035s) (success) - Tactic call ran for 15.848 secs (1.716u,0.s) (success) - Tactic call ran for 9.329 secs (1.009u,0.s) (success) - Assembling verified rewriter... - Refining with verified rewriter... - COQC src/Rewriter/Passes/RelaxBitwidthAdcSbb.v - Reifying... - Assembling verified rewriter... - Compiling decision tree... - Refining with verified rewriter... - Splitting rewrite rules... - Assembling rewrite_head... - Reducing rewrite_head... - Tactic call ran for 1.568 secs (0.164u,0.s) (success) - Tactic call ran for 0.683 secs (0.072u,0.s) (success) - Tactic call ran for 1.034 secs (0.108u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Tactic call ran for 0.898 secs (0.092u,0.s) (success) - Tactic call ran for 8.516 secs (0.898u,0.s) (success) - Proving Rewriter_Interp... - Tactic call ran for 23.341 secs (2.442u,0.s) (success) - Tactic call ran for 7.606 secs (0.759u,0.004s) (success) - Assembling verified rewriter... - Refining with verified rewriter... - COQC src/Rewriter/Passes/ToFancy.v - Reifying... - Compiling decision tree... - Splitting rewrite rules... - Assembling rewrite_head... - Reducing rewrite_head... - Tactic call ran for 0.264 secs (0.028u,0.s) (success) - Tactic call ran for 0.088 secs (0.008u,0.s) (success) - Tactic call ran for 0.818 secs (0.082u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Tactic call ran for 0.138 secs (0.011u,0.s) (success) - Tactic call ran for 0. secs (0.u,0.s) (success) - Proving Rewriter_Interp... - Tactic call ran for 2.825 secs (0.284u,0.s) (success) - Tactic call ran for 0. secs (0.u,0.s) (success) - Assembling verified rewriter... - Refining with verified rewriter... - COQC src/Rewriter/Passes/ToFancyWithCasts.v - COQC src/Rewriter/Passes/UnfoldValueBarrier.v - Reifying... - Reifying... - Compiling decision tree... - Splitting rewrite rules... - Assembling rewrite_head... - Reducing rewrite_head... - Tactic call ran for 0.312 secs (0.039u,0.s) (success) - Tactic call ran for 0.052 secs (0.008u,0.s) (success) - Tactic call ran for 0.612 secs (0.075u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Tactic call ran for 0.095 secs (0.011u,0.s) (success) - Tactic call ran for 0.421 secs (0.04u,0.s) (success) - Proving Rewriter_Interp... - Tactic call ran for 3.951 secs (0.388u,0.s) (success) - Tactic call ran for 0.001 secs (0.001u,0.s) (success) - Assembling verified rewriter... - Refining with verified rewriter... - COQC src/AbstractInterpretation/WfExtra.v - COQC src/AbstractInterpretation/Proofs.v - Compiling decision tree... - Splitting rewrite rules... - Assembling rewrite_head... - Reducing rewrite_head... - Tactic call ran for 16.498 secs (1.703u,0.004s) (success) - Tactic call ran for 2159.453 secs (230.45u,0.408s) (success) - Tactic call ran for 3.896 secs (0.429u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Tactic call ran for 35.903 secs (3.759u,0.s) (success) - COQC src/Arithmetic/BaseConversion.v - COQC src/PushButtonSynthesis/SaturatedSolinasReificationCache.v - Tactic call ran for 108.856 secs (11.416u,0.004s) (success) - Finished transaction in 38.591 secs (4.192u,0.022s) (successful) - Finished transaction in 22.58 secs (2.505u,0.s) (successful) - COQC src/PushButtonSynthesis/BaseConversionReificationCache.v - Tactic call ran for 565.722 secs (59.607u,0.242s) (success) - Tactic call ran for 2.728 secs (0.307u,0.s) (success) - Proving Rewriter_Interp... - Finished transaction in 18.585 secs (2.079u,0.027s) (successful) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Finished transaction in 16.252 secs (1.703u,0.s) (successful) - Proving Rewriter_Wf... - COQC src/Stringification/C.v - COQC src/Stringification/Rust.v - Tactic call ran for 20.949 secs (2.271u,0.s) (success) - COQC src/Stringification/Go.v - COQC src/Stringification/Java.v - COQC src/Stringification/JSON.v - COQC src/Stringification/Zig.v - COQC src/Arithmetic/BarrettReduction.v - Tactic call ran for 98.981 secs (10.232u,0.024s) (success) - Proving Rewriter_Interp... - Tactic call ran for 284.216 secs (30.276u,0.035s) (success) - COQC src/Arithmetic/FancyMontgomeryReduction.v - Tactic call ran for 104.859 secs (11.15u,0.s) (success) - Finished transaction in 4165.526 secs (436.239u,0.327s) (successful) - File "./src/UnsaturatedSolinasHeuristics/Tests.v", line 155, characters 0-1766: - Warning: native_compute disabled at configure time; falling back to - vm_compute. [native-compute-disabled,native-compiler] - Assembling verified rewriter... - Refining with verified rewriter... - COQC src/ArithmeticCPS/BaseConversion.v - COQC src/Assembly/WithBedrock/Proofs.v - Tactic call ran for 290.17 secs (30.881u,0.035s) (success) - Tactic call ran for 76.052 secs (8.32u,0.007s) (success) - Assembling verified rewriter... - Refining with verified rewriter... - COQC src/Bedrock/Field/Stringification/FlattenVarData.v - COQC src/Curves/Montgomery/AffineInstances.v - COQC src/PushButtonSynthesis/BarrettReductionReificationCache.v - Finished transaction in 66.8 secs (6.951u,0.023s) (successful) - COQC src/PushButtonSynthesis/FancyMontgomeryReductionReificationCache.v - Finished transaction in 40.441 secs (4.262u,0.004s) (successful) - COQC src/Rewriter/All.v - COQC src/Arithmetic/Freeze.v - Finished transaction in 57.021 secs (5.937u,0.027s) (successful) - COQC src/CompilersTestCases.v - Finished transaction in 27.157 secs (2.969u,0.s) (successful) - COQC src/ArithmeticCPS/Freeze.v - COQC src/Curves/Montgomery/XZProofs.v - COQC src/BoundsPipeline.v - COQC src/Arithmetic/WordByWordMontgomery.v - Finished transaction in 169.766 secs (18.284u,0.071s) (successful) - Warning: Native compiler is disabled, -native-compiler ondemand option - ignored. [native-compiler-disabled,native-compiler] - Warning: The native-compiler option is deprecated. To compile native files - ahead of time, use the coqnative binary instead. - [deprecated-native-compiler-option,deprecated] - Warning: Native compiler is disabled, -native-compiler ondemand option - ignored. [native-compiler-disabled,native-compiler] - Warning: The native-compiler option is deprecated. To compile native files - ahead of time, use the coqnative binary instead. - [deprecated-native-compiler-option,deprecated] The middle of the output is truncated (maximum 20000 characters)
No files were installed.
true


HE GOT GAME (1998)
A film review by Steve Kong Edited by Cher Johnson Copyright 1998 Steve Kong
Sports movies are a hard genre to work with, especially if you don't want to make a comedy or a family film - categories which most sports movies fall into. But, every once in a long while there comes a sports film that is neither, and that really hits home. The one that I remember most is Field of Dreams. I haven't seen a good sports film in a long time.
I'm certain that had He Got Game been done by any other writer/director it would have failed, but in the hands of Spike Lee, He Got Game is one of the best films of 1998 and will probably make my top 10 list.
Who's got game? A kid named Jesus Shuttlesworth (Ray Allen), who's a graduating senior at the real-life Lincoln high school on Coney Island. Jesus is so good at basketball that every college wants him and every NBA team wants him. What is Jesus going to do?
Someone else has game also, though. Jake Shuttlesworth (Denzel Washington) is the father of Jesus. He's currently serving time in a prison with 15 years to go. What landed Jake in prison? He killed his wife. With this act, he split his whole family apart - turning Jesus into an embittered young man who has taught himself to believe that he has no father. With a week to go before Jesus needs to decide about going to college or going pro, the governor has a proposal for Jake. He will try to reduce Jake's sentence and help him get early parole if Jake will convince Jesus to go to the governor's alma mater, Big State.
What Spike Lee does with He Got Game is amazing. He slowly unravels a story which on the surface looks and feels like a run-of-the-mill sports film. But underneath, he starts to reveal the pressure and events that happen around a star basketball player ready to make "the most important decision of his life." Lee starts showing us that from sex, to money, to new cars, the people around Jesus will try anything to convince him to do what they want. And with this, they also want a piece of what Jesus will be making.
He Got Game relies directly on the relationship between the father and son. Onscreen this relationship lives, and lives only because of a brilliant performance by Denzel Washington. Washington puts his all onscreen and it shows. This time around, Washington is not playing an egghead - as in Crimson Tide - or an everyday man - like in the forgettable but enjoyable Fallen. No, this time he plays a poor man with a lot of failings, including the killing of his wife. I walked in thinking that Washington would play Jake as a hard-nosed embittered man, but my hunch turned out all wrong. The only embittered one was Jesus. Washington plays Jake as a guy who regrets most of the things that he has done in his life.
The weak link in all of this is the stiff performance by Ray Allen. Although Lee coerces Allen into a decent performance, it's not enough to take He Got Game from a great film to an all-time great film. It is a good start for Allen, though, and I wish him well in his further acting jobs.
Spike Lee has always been a favourite writer and director of mine. His Do The Right Thing is one of my favourite films (and for those of you who don't know me personally, my nickname is Mookie, which is the name of Lee's character in Do The Right Thing.) With He Got Game, Lee has one-upped himself and this is now my favourite Spike Lee film. Lee has a particular style in the way that he shoots his films and this all shows in a wonderful opening montage of people playing basketball across America. This is one of the best openings I've ever experienced and shows the love of basketball that Lee has.
What's interesting to note is that although He Got Game is about basketball, there are no extended sequences of basketball in the movie. We only see a one-on-one game between Jake and Jesus. We get some flashes of basketball games, but the focus is never on the sport - Spike Lee uses it to explore the things that go around the game.
Worth mentioning is the music by Aaron Copland, which is downright American. Copland's music along with Lee's imagery is wonderous.
Next to Ray Allen, there are two smaller weak links in He Got Game. One is a sub-plot about a prostitute (Milla Jovovich) and Jake. And the other is the awkward symbolic ending, which irked me the most.
He Got Game is a Don't Miss movie that never fails to entertain. This film is powerful, moving, and all the while it holds our attention with a well-written relationship between a father and a son.
--- Steve Kong<EMAIL_ADDRESS>reviews from a guy who loves the cinema http://boiled.sbay.org/boiled/
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Your web browser must have JavaScript enabled in order for this application to display correctly.


{# Each plot is wrapped in if/endif for robustness against missing plots #}
DESI Nightwatch
SurveyQA
Nightwatch Help
{#
timeseries plots
#}
Useful Information
Nightwatch documentation
on the DESI wiki.
Nightwatch troubleshooting
pages.
Click the question mark
(?)
button on each plot to jump to directly to plot-specific descriptions and troubleshooting.
Report problems
here
.


Roxie Hart and The Big Hangoverby Michael Asimow, UCLA Law School (November, 1997) This commentary focuses on two older courtroom comedies--Roxie Hart and The Big Hangover. Both films are available on video. If your local store doesn't have them, you can rent or buy them from reel.com. One film is great, one is lousy, but both of them are full of interesting insights about law, lawyers, and the legal system. Roxie Hart (1942) is one of the best and funniest legal comedies every made. The Kander & Ebb musical "Chicago" (currently in revival on Broadway) is based on the film. Ginger Rogers plays Roxie Hart, a gorgeous showgirl on trial for murder. In fact, Roxie is innocent but decides to stand trial anyway because the publicity will be good for her career.  In Chicago, juries adore these women and they are never convicted. For those interested in lawyer portrayals in the movies, Flynn is the classic shyster lawyer. He concocts a purely fictitious press bio for Roxie and makes up an equally bogus defense for her to use at trial. The use of perjured testimony is taken for granted. The media coverage of the trial is particularly funny; it's broadcast on the radio with commercials at every opportunity. Whenever anything good happens in the trial, photographers rush forward to take pictures. The judge always gets into the picture because he's running for re-election and the publicity couldn't hurt. And the dance scenes in jail, featuring the classic "black bottom," are just out of sight. The Internet Movie Database for Roxie Hart The Big Hangover (1951), which ran recently on Turner Classic Movies, is a loser. It's an unfunny comedy about a young lawyer, David Malden (Van Johnson), who has a neurotic aversion to alcohol. The slightest sip of the stuff triggers truly bizarre behavior. This resulted from his almost drowning in a cellar-full of brandy during the war. In this respect, Malden is like a recovering alcoholic who is always just one drink away from falling back into the gutter. Malden is first in his law school class and thus gets hired at a silk-stocking law firm. Elizabeth Taylor (in a role she'd probably rather forget) is the senior partner's daughter; she falls in love with Malden and tries to help him deal with his alcohol problem. Like many otherwise mediocre films about law, The Big Hangover has some interesting bits. One concerns a Chinese doctor who has been denied an apartment on racial grounds. The City Attorney is trying to force the owner to let him move in. I was surprised to learn that there were any housing anti-discrimination laws or ordinances back in 1951. Such an ordinance was a huge political issue in Berkeley in 1964. Of course the apartment owner is a client of Malden's firm. The idealistic young lawyer is horrified to see the dirty tricks the senior partners play to thwart the City Attorney and keep the doctor out of the apartment. Like many heroic film lawyers, Malden betrays his client (the apartment owner) for a greater good (getting the doctor into the apartment). The audience loves it, but lawyers cringe at the violation of ethical canons demanding loyalty to the client. The Big Hangover has some quaint material about how law students got jobs back then. You signed up on a clipboard in the hallway, giving your name and your class ranking! Today, of course, most law schools have abandoned class rankings entirely; if rankings exist at all, their secrecy is carefully guarded.
Mailbox for reply to Picturing Justice commentaries
|


Kodak Black Faces Additional Weapons Charges After 4-Year Prison Sentence
The rapper was arrested in Florida.
by Jeff YeungJust a week after being sentenced to four years in prison, rapper Kodak Black has now been hit with additional weapons charges in Florida. According to reports, the musician has been charged by state prosecutors with two counts of possession of a firearm by a convicted felon, with each charge carrying a maximum prison sentence of 30 years.
The latest charges come immediately after Kodak Black was sentenced to 46 months in prison for lying about his criminal history whilst purchasing firearms. In particular, he hid the fact that we was out on bond at the time for sexual assault charges in California when buying the weapons. He was arrested on his way to Rolling Loud in May and pleaded guilty in August.

Elsewhere in music, A Boogie Wit Da Hoodie linked up with Lil Uzi Vert for a new single, “Reply.”


--- title: The deepstream blog description: Covering every aspect of deepstream in your day to day life ---


public interface ReadWritablePeriod extends ReadablePeriod
The implementation of this interface will be mutable. It may provide more advanced methods than those in the interface.
| Modifier and Type | Method and Description |
|---|---|
void |
add(DurationFieldType field,
int value)
Adds to the value of one of the fields.
|
void |
add(int years,
int months,
int weeks,
int days,
int hours,
int minutes,
int seconds,
int millis)
Adds to each field of this period.
|
void |
add(ReadableInterval interval)
Adds an interval to this one by dividing the interval into
fields and then adding each field in turn.
|
void |
add(ReadablePeriod period)
Adds a period to this one by adding each field in turn.
|
void |
addDays(int days)
Adds the specified days to the number of days in the period.
|
void |
addHours(int hours)
Adds the specified hours to the number of hours in the period.
|
void |
addMillis(int millis)
Adds the specified millis to the number of millis in the period.
|
void |
addMinutes(int minutes)
Adds the specified minutes to the number of minutes in the period.
|
void |
addMonths(int months)
Adds the specified months to the number of months in the period.
|
void |
addSeconds(int seconds)
Adds the specified seconds to the number of seconds in the period.
|
void |
addWeeks(int weeks)
Adds the specified weeks to the number of weeks in the period.
|
void |
addYears(int years)
Adds the specified years to the number of years in the period.
|
void |
clear()
Clears the period, setting all values back to zero.
|
void |
set(DurationFieldType field,
int value)
Sets the value of one of the fields.
|
void |
setDays(int days)
Sets the number of days of the period.
|
void |
setHours(int hours)
Sets the number of hours of the period.
|
void |
setMillis(int millis)
Sets the number of millis of the period.
|
void |
setMinutes(int minutes)
Sets the number of minutes of the period.
|
void |
setMonths(int months)
Sets the number of months of the period.
|
void |
setPeriod(int years,
int months,
int weeks,
int days,
int hours,
int minutes,
int seconds,
int millis)
Sets all the fields in one go.
|
void |
setPeriod(ReadableInterval interval)
Sets all the fields in one go from an interval dividing the
fields using the period type.
|
void |
setPeriod(ReadablePeriod period)
Sets all the fields in one go from another ReadablePeriod.
|
void |
setSeconds(int seconds)
Sets the number of seconds of the period.
|
void |
setValue(int index,
int value)
Sets the value of one of the fields by index.
|
void |
setWeeks(int weeks)
Sets the number of weeks of the period.
|
void |
setYears(int years)
Sets the number of years of the period.
|
equals, get, getFieldType, getPeriodType, getValue, hashCode, isSupported, size, toMutablePeriod, toPeriod, toString
void clear()
void setValue(int index, int value)
index
- the field indexvalue
- the new value for the fieldIndexOutOfBoundsException
- if the index is invalidvoid set(DurationFieldType field, int value)
The field type specified must be one of those that is supported by the period.
field
- a DurationFieldType instance that is supported by this periodvalue
- the new value for the fieldIllegalArgumentException
- if the field is null or not supportedvoid setPeriod(ReadablePeriod period)
period
- the period to set, null means zero length periodIllegalArgumentException
- if an unsupported field's value is non-zerovoid setPeriod(int years, int months, int weeks, int days, int hours, int minutes, int seconds, int millis)
years
- amount of years in this period, which must be zero if unsupportedmonths
- amount of months in this period, which must be zero if unsupportedweeks
- amount of weeks in this period, which must be zero if unsupporteddays
- amount of days in this period, which must be zero if unsupportedhours
- amount of hours in this period, which must be zero if unsupportedminutes
- amount of minutes in this period, which must be zero if unsupportedseconds
- amount of seconds in this period, which must be zero if unsupportedmillis
- amount of milliseconds in this period, which must be zero if unsupportedIllegalArgumentException
- if an unsupported field's value is non-zerovoid setPeriod(ReadableInterval interval)
interval
- the interval to set, null means zero lengthvoid add(DurationFieldType field, int value)
The field type specified must be one of those that is supported by the period.
field
- a DurationFieldType instance that is supported by this periodvalue
- the value to add to the fieldIllegalArgumentException
- if the field is null or not supportedvoid add(ReadablePeriod period)
period
- the period to add, null means add nothingIllegalArgumentException
- if the period being added contains a field
not supported by this periodArithmeticException
- if the addition exceeds the capacity of the periodvoid add(int years, int months, int weeks, int days, int hours, int minutes, int seconds, int millis)
years
- amount of years to add to this period, which must be zero if unsupportedmonths
- amount of months to add to this period, which must be zero if unsupportedweeks
- amount of weeks to add to this period, which must be zero if unsupporteddays
- amount of days to add to this period, which must be zero if unsupportedhours
- amount of hours to add to this period, which must be zero if unsupportedminutes
- amount of minutes to add to this period, which must be zero if unsupportedseconds
- amount of seconds to add to this period, which must be zero if unsupportedmillis
- amount of milliseconds to add to this period, which must be zero if unsupportedIllegalArgumentException
- if the period being added contains a field
not supported by this periodArithmeticException
- if the addition exceeds the capacity of the periodvoid add(ReadableInterval interval)
interval
- the interval to add, null means add nothingArithmeticException
- if the addition exceeds the capacity of the periodvoid setYears(int years)
years
- the number of yearsIllegalArgumentException
- if field is not supported and the value is non-zerovoid addYears(int years)
years
- the number of yearsIllegalArgumentException
- if field is not supported and the value is non-zeroArithmeticException
- if the addition exceeds the capacity of the periodvoid setMonths(int months)
months
- the number of monthsIllegalArgumentException
- if field is not supported and the value is non-zerovoid addMonths(int months)
months
- the number of monthsIllegalArgumentException
- if field is not supported and the value is non-zeroArithmeticException
- if the addition exceeds the capacity of the periodvoid setWeeks(int weeks)
weeks
- the number of weeksIllegalArgumentException
- if field is not supported and the value is non-zerovoid addWeeks(int weeks)
weeks
- the number of weeksIllegalArgumentException
- if field is not supported and the value is non-zeroArithmeticException
- if the addition exceeds the capacity of the periodvoid setDays(int days)
days
- the number of daysIllegalArgumentException
- if field is not supported and the value is non-zerovoid addDays(int days)
days
- the number of daysIllegalArgumentException
- if field is not supported and the value is non-zeroArithmeticException
- if the addition exceeds the capacity of the periodvoid setHours(int hours)
hours
- the number of hoursIllegalArgumentException
- if field is not supported and the value is non-zerovoid addHours(int hours)
hours
- the number of hoursIllegalArgumentException
- if field is not supported and the value is non-zeroArithmeticException
- if the addition exceeds the capacity of the periodvoid setMinutes(int minutes)
minutes
- the number of minutesIllegalArgumentException
- if field is not supported and the value is non-zerovoid addMinutes(int minutes)
minutes
- the number of minutesIllegalArgumentException
- if field is not supported and the value is non-zeroArithmeticException
- if the addition exceeds the capacity of the periodvoid setSeconds(int seconds)
seconds
- the number of secondsIllegalArgumentException
- if field is not supported and the value is non-zerovoid addSeconds(int seconds)
seconds
- the number of secondsIllegalArgumentException
- if field is not supported and the value is non-zeroArithmeticException
- if the addition exceeds the capacity of the periodvoid setMillis(int millis)
millis
- the number of millisIllegalArgumentException
- if field is not supported and the value is non-zerovoid addMillis(int millis)
millis
- the number of millisIllegalArgumentException
- if field is not supported and the value is non-zeroArithmeticException
- if the addition exceeds the capacity of the periodCopyright © 2002–2020 Joda.org. All rights reserved.


Want to add your tool to this great website? Fill out this form and it'll even give you help on setting up your PubRunner instance.


Computation of effects under linear, logistic and Poisson regression models with transformed variables. Logarithm and power transformations are allowed. Effects can be displayed both numerically and graphically in both the original and the transformed space of the variables.
| Version: | 0.1.5 |
| Depends: | R (≥ 3.0.1), stats, utils, boot |
| Suggests: | knitr |
| Published: | 2017-04-10 |
| Author: | Jose Barrera-Gomez and Xavier Basagana |
| Maintainer: | Jose Barrera-Gomez <jose.barrera at isglobal.org> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| Materials: | NEWS |
| CRAN checks: | tlm results |
| Reference manual: | tlm.pdf |
| Vignettes: |
User's manual for the tlm package |
| Package source: | tlm_0.1.5.tar.gz |
| Windows binaries: | r-devel: tlm_0.1.5.zip, r-release: tlm_0.1.5.zip, r-oldrel: tlm_0.1.5.zip |
| OS X binaries: | r-release: tlm_0.1.5.tgz, r-oldrel: tlm_0.1.5.tgz |
| Old sources: | tlm archive |
Please use the canonical form https://CRAN.R-project.org/package=tlm to link to this page.


WebSocket Test
Output:
Commands:
send <MESSAGE> -> send message close [<REASON>] -> politely close connection with optional reason


QUESTION #1
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "code = ?", language.Code)
uadmin.Trail(uadmin.OK, language.EnglishName)
Result: Italian
Which uAdmin function will match the given statement above?
QUESTION #2
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "english_name = ?", language.EnglishName)
uadmin.Trail(uadmin.OK, language.Code)
Result: ru
Which uAdmin function will match the given statement above?
QUESTION #3
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "code = ?", language.Code)
uadmin.Trail(uadmin.OK, language.EnglishName)
Result: Korean
Which uAdmin function will match the given statement above?
QUESTION #4
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "english_name = ?", language.EnglishName)
uadmin.Trail(uadmin.OK, language.Code)
Result: de
Which uAdmin function will match the given statement above?
QUESTION #5
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "code = ?", language.Code)
uadmin.Trail(uadmin.OK, language.EnglishName)
Result: Japanese
Which uAdmin function will match the given statement above?
QUESTION #6
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "english_name = ?", language.EnglishName)
uadmin.Trail(uadmin.OK, language.Code)
Result: zh
Which uAdmin function will match the given statement above?
QUESTION #7
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "code = ?", language.Code)
uadmin.Trail(uadmin.OK, language.EnglishName)
Result: Polish
Which uAdmin function will match the given statement above?
QUESTION #8
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "english_name = ?", language.EnglishName)
uadmin.Trail(uadmin.OK, language.Code)
Result: es
Which uAdmin function will match the given statement above?
QUESTION #9
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "code = ?", language.Code)
uadmin.Trail(uadmin.OK, language.EnglishName)
Result: Latin
Which uAdmin function will match the given statement above?
QUESTION #10
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "english_name = ?", language.EnglishName)
uadmin.Trail(uadmin.OK, language.Code)
Result: ms
Which uAdmin function will match the given statement above?
QUESTION #11
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "code = ?", language.Code)
uadmin.Trail(uadmin.OK, language.EnglishName)
Result: English
Conditions: The language direction is left to right. It is set to default, active, and not available in GUI. The flag image is located in /media/flags/ path.
Which uAdmin function will match the given statement above?
QUESTION #12
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "english_name = ?", language.EnglishName)
uadmin.Trail(uadmin.OK, language.Code)
Result: fr
Conditions: The language direction is left to right. It is not set to default, active, and not available in GUI. The flag image is located in /media/flags/ path.
Which uAdmin function will match the given statement above?
QUESTION #13
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "code = ?", language.Code)
uadmin.Trail(uadmin.OK, language.EnglishName)
Result: Dutch
Conditions: The language direction is left to right. It is set to default, active, and available in GUI. The flag image is located in /media/flags/ path.
Which uAdmin function will match the given statement above?
QUESTION #14
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "english_name = ?", language.EnglishName)
uadmin.Trail(uadmin.OK, language.Code)
Result: ar
Conditions: The language direction is right to left. It is set to default, active, and available in GUI. The flag image is located in /media/flags/ path.
Which uAdmin function will match the given statement above?
QUESTION #15
Suppose you have given source code as shown:
// Your code
uadmin.Get(&language, "code = ?", language.Code)
uadmin.Trail(uadmin.OK, language.EnglishName)
Result: Kashmiri
Conditions: The language direction is right to left. It is not set to default, active, and not available in GUI. The flag image is located in /media/flags/ path.
Which uAdmin function will match the given statement above?


Home
Gallery
About us
Contact us
Menu
WELCOME TO SAN RESTAURANT
Fine dining with an African flair
"Discover pure food indulgence"
Instructions


StreamE is an easy way to watch your favorite live streamers across streaming platforms like Twitch and YouTube. Use the search bar at the top of the page to search for streamers you like, click the plus sign next to their name to follow them for watching later, and click their name to pull up their channel.
Frequently Asked Questions
What are the plus (+) and minus (-) signs next to a streamer's name when searching and on the left side bar?
- The plus (+) sign adds a streamer to your following list, which is the left side bar. The minus (-) sign removes a streamer for your following list.
What is my following list?
- The left side bar on the page (or below the search box on mobile view) is your following list. This is the list of streamers you're following on StreamE and is stored in your browser privately. Your following list also appears in the URL encoded as a hash after the pound (#) sign. These URLs/hashes are shareable with friends and other people, for easy sharing of entire following lists of streamers. Please note, this following list has no effect or relation to your personal account followings on Twitch or YouTube.
What is the nasty, long string in the URL?
- As mentioned in the above question, that is your personal list of streamers you're following encoded as a hash. You can bookmark/save the URL/hash for easy access later from another PC, or for sharing your list of favorite streamers with your friends.
YouTube search results/online indicator is not working. What's wrong?
- YouTube, unfortunately, has a rather low API rate-limit per day and we're subject to hit that rate-limit at times depending on site traffic. YouTube does take requests for increases in rate limits, and we do plan to apply for an increase if we continue to hit their API rate limit often.


Your money journey results
Congratulations, {{ overall.heading_html|safe }}
{{ overall.msg_html|safe }}
{% set car_position = overall.position_idx %} {% if car_position < 2 >= 0 %} {% set car_position = (car_position * 100) + (40) %} {% elif car_position < 5 >= 2 %} {% set car_position = (car_position * 100) + (100) %} {% else %} {% set car_position = (car_position * 100) + (150) %} {% endif %} {% set level = overall.level_idx %} {% set color = '#addc91' %} {% set stroke_color = 'green' %} {% include 'results-graph.html' %} {# modal content #} {% include './modals/share-url.html' %} {% include './modals/print.html' %} {% include './modals/reset.html' %}Now what? Read more about your results below. Think about things you’re doing well and things you could do better. Be sure to save your results so you can see them again later or share them with your teacher or a trusted adult.
Your money journey
Your money journey includes three important subjects:
- {{ content.get('BB0') }}
- {{ content.get('BB1') }}
- {{ content.get('BB2') }}
Exploring each of these subjects will help you get the money future you want.
Stop and think
Which path is your strongest? Which one do you want to work on?
What now?
Use the Taking the next steps on your money journey worksheet to think about your strengths and set goals to get the money future you want. Talk with your teacher, your parents, or another trusted adult about your money map. They can also help you set your goals.
 Everyone, no matter how old or young they are, can always get better at managing money.


|
Assimp
5.0.1, master @ cd42b955
|
Intermediate representation of a BLEND scene. More...
Namespaces | |
| Assimp | |
| Helper structures for the Collada loader. | |
| Assimp::Blender | |
Macros | |
| #define | AI_BLEND_MESH_MAX_VERTS<PHONE_NUMBER>L |
| #define | FAIL |
| #define | MA_RAYMIRROR 0x40000 |
| #define | MA_RAYTRANSP 0x20000 |
| #define | MA_TRANSPARENCY 0x10000 |
| #define | MA_ZTRANSP 0x00040 |
| #define | WARN |
Variables | |
| static const size_t | Assimp::Blender::MaxNameLen = 1024 |
Intermediate representation of a BLEND scene.
| #define AI_BLEND_MESH_MAX_VERTS<PHONE_NUMBER>L |
| #define FAIL |
| #define MA_RAYMIRROR 0x40000 |
| #define MA_RAYTRANSP 0x20000 |
| #define MA_TRANSPARENCY 0x10000 |
| #define MA_ZTRANSP 0x00040 |
| #define WARN |


This function should not be used. The TipWizard has been removed from Microsoft Excel.
Return to index


This page tracks the progress of funding for Binance. The listing fee can be anywhere from 10 - 25 BTC due to the voting process involved (voting with BNB token). This tracker is set to the max of 25 BTC.
BTCZ/BTC exchange rate is an estimate based on the weighted average by Coinmarketcap. The values on this page are automatically updated every 5 minutes.
| Exchange | Currency | Address | Balance | ||
|---|---|---|---|---|---|
| Binance | BTCZ | t1L2h7WyVsxEvbw1acefwXWBQWYReQnN7MF | 0 | 0 | |
| BTC | 14deH7yqwmV8gcPHzLwUXmRSnZ1gQYK1Ka | 0 | 0 | ||
| LTC | LPprE3sC5oTjpEZM5AcjTKzZdRf7sLgSGo | 0 | 0 | ||
| ETH | 0xBAd0dC6003D3F6a7222c0A1Cf6228b364BB011C9 | 0 | 0 | ||
| ZEC | t1SCNiZ2qNv3Y97CMLgpkFFzrPgeAsZzmrb | 0 | 0 | ||
|
|
0 | 0% |
made by hodler95 & cryptorex
stored by BitcoinZ Community at Community GitHub


---
layout: archive
title: "Personal"
permalink: /personal/
author_profile: true
---
Achievements
-
CCNA R&S training in Cisco Networking Academy along with a CCNA-Routing and Switching Certification from Cisco Systems.
-
Completed Certificate Program in Programming with Python for Data Science at NIIT T. Nagar, Chennai with Excellent performance, which is recognized as the Top IT Training Company for 20 consecutive years by Cybermedia publications.
-
Secured first place for our team’s ideas by Cisco for presentation of ideas on how to make a city smart and secure at Be a Ninja (on Cyber Forensics) workshop conducted during Anokha 2018. Our idea was to design a Smart Car Parking mobile app that
leverages sensors, blockers, CCTV cameras and Google Maps. The app allows users to reserve parking spots in advance using an online payment system and provides OTP based authentication to grant access to parking spots.
-
Completed Certificate Program in Network Virtualization Concepts provided by VMware.
Volunteering Activities
-
Led one of the teams in Public Relations department for tech fest Anokha 2020 – reached out to other colleges and invited them to the event.
-
Helped organize Amrita Inter-Campus Cultural Fest "Sargamritam -2019".
-
Volunteered in Amritavarsham 66, an event celebrated on the occasion of the birthday of Mata Amritanandamayi “hugging saint” to pray for world peace on 27th September 2019 at Amritapuri, Kerala.
Personal Details
-
Hobbies : Chess, Tennis, Abacus(UCMAS – completed 8/10
levels) and Calligraphy and Digital Arts
-
Address : Chennai, Tamil Nadu
-
Languages known : English, Tamil and Telugu.
{% for post in site.history reversed %}
{% include archive-single-talk.html %}
{% endfor %}


myTimesheet
Temporizador
00:00:00
Tarefas
Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages, and more recently with desktop publishing software like Aldus PageMaker including versions of Lorem Ipsum.
An item An itemAn item An item An item
Projetos
An item An itemAn item An item An item
Web app
Configurações
ID
Cliente
Ação


Data Preprocessing¶
Trodes Data¶
Here we go over a collection of modules for extracting, reading, parsing and preprocessing trodes data produced by various ReachMaster routines.
Extract trodes data to python¶
SpikeGadgets provides this script to import data from Trodes to Python. For further documentation, visit SpikeGadgets .
-
trodes_data.readTrodesExtractedDataFile3.
readTrodesExtractedDataFile
(filename)[source]¶ Read a DIO or analog Trodes .dat file. These files are typically produced after converting the raw .rec files using the exportdio or exportanalog bash scripts provided by SpikeGadgets. Visit SpikeGadgets for more details.
Parameters: filename (str) – Path to file Returns: fieldText – A nested dictionary with the extracted data Return type: dict
Calibration data parser¶
A library for reading, parsing, and preprocessing trodes data collected during robot calibration routines.
-
trodes_data.calibration_data_parser.
get_calibration_frame
(data_dir, trodes_name, sampling_rate=3000, valve_period=0.175, pot_units='cm')[source]¶ Generate a data frame that can be used to estimate calibration parameters.
Parameters: - data_dir (str) – Parent directory where the trodes data lives
- trodes_name (str) – Name of original .rec trodes file
- sampling_rate (int) – Specifying a rate (Hz) lower than the SpikeGadgets MCU clock rate of 30 kHz will downsample the data and speed up the parsing.
- valve_period (float) – Time (sec) between valve command onsets
- pot_units (str) – Units to return potentiometer recordings. Can be cm, volts, or bits.
Returns: data_frame – A pandas data frame with columns onset_time, x_position, x_duration, x_displacement, y_position, y_duration, y_displacement, z_position, z_duration, and z_displacement.
Return type: pandas.core.frame.DataFrame
-
trodes_data.calibration_data_parser.
get_trodes_files
(data_dir, trodes_name)[source]¶ Generate names of all the trodes files from a calibration recording. Assumes data is saved in the default trodes filesystem and channels are named appropriately in the trodes configuration file.
Parameters: - data_dir (str) – Parent directory where the trodes data lives
- trodes_name (str) – Name of original .rec trodes file
Returns: trodes_files – The file names for each channel of a calibration recording. More specifically, x_push_file is the *.dat file for the x actuator push valve command recording. Similarly, y_pot_file is the *.dat for the y actuator poteniometer recording.
Return type: dict
-
trodes_data.calibration_data_parser.
get_valve_transitions
(calibration_data)[source]¶ Get the valve start and stop times.
Parameters: calibration_data (dict) – All of the digital (DIO) and analog data corresponding to the trodes files for the a calibration recording. For example, as returned by read_data(). Returns: - start_times (dict) – Times at which each of the valves transitioned from closed to open
- stop_times (dict) – Times at which each of the valves transitioned from open to closed
-
trodes_data.calibration_data_parser.
pots_to_bits
(calibration_data, supply_voltage=3.3, controller_max_bits=1023)[source]¶ Convert the potentiometer data units to microcontroller bits.
Parameters: - calibration_data (dict) – All of the digital (DIO) and analog data corresponding to the trodes files for the a calibration recording. For example, as returned by read_data().
- supply_voltage (float) – Maximum voltage for the potentiometers
- controller_max_bits (int) – Maximum bits for the microcontroller
Returns: calibration_data – Calibration data with potentiometer data convert to microcontroller bits
Return type: dict
-
trodes_data.calibration_data_parser.
pots_to_cm
(calibration_data, supply_voltage=3.3, pot_range=5.0)[source]¶ Convert the potentiometer data units to cm.
Parameters: - calibration_data (dict) – All of the digital (DIO) and analog data corresponding to the trodes files for the a calibration recording. For example, as returned by read_data().
- supply_voltage (float) – Maximum voltage for the potentiometers
- pot_range (float) – Potentiometer maximum travel range in cm
Returns: calibration_data – Calibration data with potentiometer data convert to cm
Return type: dict
-
trodes_data.calibration_data_parser.
pots_to_volts
(calibration_data)[source]¶ Convert the potentiometer data units to volts.
Parameters: calibration_data (dict) – All of the digital (DIO) and analog data corresponding to the trodes files for the a calibration recording. For example, as returned by read_data(). Returns: calibration_data – Calibration data with potentiometer data convert to volts Return type: dict
-
trodes_data.calibration_data_parser.
read_data
(trodes_files, sampling_rate=3000)[source]¶ Read all the trodes file data using the SpikeGadgets readTrodesExtractedDataFile script.
Parameters: - trodes_files (dict) – The file names for each channel of a calibration recording. For example, as returned by get_trodes_files().
- sampling_rate (int) – Specifying a rate (Hz) lower than the SpikeGadgets MCU clock rate of 30 kHz will downsample the data and speed up the parsing.
Returns: calibration_data – All of the digital (DIO) and analog data corresponding to the trodes files for the a calibration recording.
Return type: dict
-
trodes_data.calibration_data_parser.
to_numpy
(calibration_data)[source]¶ Convert the calibration data to numpy arrays
Parameters: calibration_data (dict) – All of the digital (DIO) and analog data corresponding to the trodes files for the a calibration recording. For example, as returned by read_data(). Returns: calibration_data – Numpy-converted calibration data. Return type: dict
-
trodes_data.calibration_data_parser.
to_seconds
(calibration_data, start_at_zero=True)[source]¶ Convert the calibration data time units to seconds.
Parameters: - calibration_data (dict) – All of the digital (DIO) and analog data corresponding to the trodes files for the a calibration recording. For example, as returned by read_data().
- start_at_zero (bool) – If True, the start time will be set to 0.
Returns: calibration_data – Seconds-converted calibration data
Return type: dict


featured projects
C++ point of sale system
online furniture shop
safaricom page css styling
testimonials
Daniel karori
web developer
0746578783
James Njuguna
programmer
0734765213
Nicholas yomon
database developer
0745674902
I am martin njue,a dit student at zetech university who is passionate about programming using different programming languages such as html,css,java and python.
C++ point of sale system
online furniture shop
safaricom page css styling
Daniel karori
web developer
0746578783
James Njuguna
programmer
0734765213
Nicholas yomon
database developer
0745674902


Overview
PHPCap is a PHP API (Application Programming Interface) for REDCap, that lets you:
- export/import/delete data in REDCap
- export/import/delete project information (e.g., field names and types) in REDCap
PHPCap makes accessing REDCap from a PHP program easier by providing:
- a high-level interface
- improved error checking
REDCap is a web application for building and managing online surveys and databases. For information about REDCap, please see http://www.project-redcap.org.


This very page loads a working example of DefineJS along with a new way of loading AMD modules. Check out the console to see the logs and the loading process of AMD modules.
Using DefineJS you can use yield keyword to load a module asynchronously:
//main.js
require(function* () {
var app = yield require('app');
console.log('required app object:', app);
app.lunch();
});
//app.js
define(function* () {
var utils = yield require('utils'),
$ = yield require('../vendor/jquery');
var app = {
body:$('body').get(0),
utils: utils,
lunch: function () {
console.log('App just got lunched!');
}
};
return app;
});
//utils.js
define(function () {
var util = {
version: 'v0.0.1',
isObject: function (o) {
return o === Object(o);
}
};
return util;
});
As you can see using ES6 function generators along with promises, has helped us acheive such an interesting asynchronous way of coding.


--- layout: default title: Kubernetes ---
Kubernetes is a cluster orchestration system for containerized workloads. Out of the box, it is configured with YAML files, making it a natural fit for Jsonnet.
Jsonnet's output JSON can be consumed by kubecfg which treats it as if it were YAML. This approach also works for other configuration formats that extend JSON, such as Javascript or HashiCorp's Configuration Language (HCL).
If we configure only a single Kubernetes object in each run of Jsonnet, we miss out on the ability to remove duplication not just within an object, but across sets of objects with commonalities. Fortunately, there are three ways to configure sets of Kubernetes objects: Use YAML stream output, multi-file output, or a single kubectl list object. This latter option is provided by Kubernetes without requiring any special support from Jsonnet. It allows us to group several Kubernetes objects into a single object. This is the most popular option because it does not require intermediate files, and other tools don't always reliably support YAML streams.
The Kubernetes community has been very active with Jsonnet, and the following resources may be helpful:As a convenience, the following tool allows you to convert YAML Kubernetes examples into basic Jsonnet files. It simply converts the YAML to JSON and then runs the Jsonnet formatter on that JSON to make it look a bit cleaner. Sorry, the original file's comments are lost during the YAML parsing. This tool just helps you get started. You will want to further clean up the code to remove duplication.
In some places, the Kubernetes API objects use lists of named objects or (name, value) pairs rather than using objects to map names to values. This makes those objects hard to reference and extend in Jsonnet. For example, the containers part of the Pod spec looks like this:
local PodSpec = { containers: [ { name: 'foo', env: [ { name: 'var1', value: 'somevalue' }, { name: 'var2', value: 'somevalue' }, ], }, { name: 'bar', env: [ { name: 'var2', value: 'somevalue' }, { name: 'var3', value: 'somevalue' }, ], }, ], };
If we wanted to override this to modify the var3
environment variable of
bar
, we could use array indexes to reference the particular container and
environment variable, but the resulting code is brittle and ugly:
PodSpec { containers: [ super.containers[0], super.containers[1] { env: [ super.env[0], super.env[1] { value: 'othervalue' }, ], }, ], }
A better solution is to use an object to represent the mapping, converting to the Kubernetes representation post-hoc. We can now create a new Pod spec with the same override, specified much more easily and safely:
Such a pattern also makes referencing easier. Now, you can use the following code to access the same environment variable:
PodSpec.containersObj.bar.envObj.var3


Boiler Vroom
0
Stream
(with a small delay)
Mixer
(read only)
High
Mid
Low
Vol
Vol
High
Mid
Low
Cue
Play
Cue
Play
Remix deck sequence
Patterns
Samples volumes
Kick
Clap
Snare
Hat
Effects
Filter (deck 1)
Filter (deck 2)


Tori Huang
developer
&
engineer
Thanks for checking out my site! Please take a look around. You'll find a little information about myself, my blog, and some projects I worked hard to create.
↫ Hello
Projects ↯
Blog ↬


73. al-Muzammil: The Mantled One
1
O thou wrapped up in thy raiment!
2
Keep vigil the night long, save a little -
3
A half thereof, or abate a little thereof
4
Or add (a little) thereto - and chant the Qur'an in measure,
5
For we shall charge thee with a word of weight.
6
Lo! the vigil of the night is (a time) when impression is more keen and speech more certain.
7
Lo! thou hast by day a chain of business.
8
So remember the name of thy Lord and devote thyself with a complete devotion -
9
Lord of the East and the West; there is no God save Him; so choose thou Him alone for thy defender -
10
And bear with patience what they utter, and part from them with a fair leave- taking.
11
Leave Me to deal with the deniers, lords of ease and comfort (in this life); and do thou respite them awhile.
12
Lo! with Us are heavy fetters and a raging fire,
13
And food which choketh (the partaker), and a painful doom
14
On the day when the earth and the hills rock, and the hills become a heap of running sand.
15
Lo! We have sent unto you a messenger as witness against you, even as We sent unto Pharaoh a messenger.
16
But Pharaoh rebelled against the messenger, whereupon We seized him with no gentle grip.
17
Then how, if ye disbelieve, will ye protect yourselves upon the day which will turn children grey,
18
The very heaven being then rent asunder. His promise is to be fulfilled.
19
Lo! This is a Reminder. Let him who will, then, choose a way unto his Lord.
20
Lo! thy Lord knoweth how thou keepest vigil sometimes nearly two-thirds of the night, or (sometimes) half or a third thereof, as do a party of those with thee. Allah measureth the night and the day. He knoweth that ye count it not, and turneth unto you in mercy. Recite, then, of the Qur'an that which is easy for you. He knoweth that there are sick folk among you, while others travel in the land in search of Allah's bounty, and others (still) are fighting for the cause of Allah. So recite of it that which is easy (for you), and establish worship and pay the poor-due, and (so) lend unto Allah a goodly loan. Whatsoever good ye send before you for your souls, ye will find it with Allah, better and greater in the recompense. And seek forgiveness of Allah. Lo! Allah is Forgiving, Merciful.
-- Sura 73 --


This component consists of 2 revolute joints with parallel axes of rotation that and a prismatic joint with a translational axis that is orthogonal to the revolute joint axes, see the default animation in the following figure (the axes vectors are not part of the default animation):
This joint aggregation introduces neither constraints nor state variables and should therefore be used in kinematic loops whenever possible to avoid non-linear systems of equations. It is only meaningful to use this component in planar loops. Basically, the position and orientation of the 3 joints as well as of frame_ia, frame_ib, and frame_im are calculated by solving analytically a non-linear equation, given the position and orientation at frame_a and at frame_b.
Connector frame_a is the "left" side of the first revolute joint whereas frame_ia is the "right side of this revolute joint, fixed in rod 1. Connector frame_b is the "right" side of the prismatic joint whereas frame_ib is the "left" side of this prismatic joint, fixed in rod 2. Finally, connector frame_im is the connector at the "right" side of the revolute joint in the middle, fixed in rod 2. The frames frame_b, frame_ib, frame_im are always parallel to each other.
The easiest way to define the parameters of this joint is by moving the MultiBody system in a reference configuration where all frames of all components are parallel to each other (alternatively, at least frame_a, frame_ia, frame_im, frame_ib, frame_b of the JointRRP joint should be parallel to each other when defining an instance of this component).
Basically, the JointRRP model consists internally of a universal - spherical - prismatic joint aggregation (= JointUSP). In a planar loop this will behave as if 2 revolute joints with parallel axes and 1 prismatic joint are connected by rigid rods.


Robin goes to work at the police station the next day and tells Al that Matt said he was her father. Matt, certain that Tui could not be pregnant, searches for and finds her with her newborn baby. As he is about to kill the baby, Tui appears and kills Matt. As the final twist, Robin discovers Sgt Parker has been pimping young boys and girls from the barista training, including Tui, to other men for sex.


This work was supported by FNRS (Grant agreement no. T.0007.14), the PRIMAVERA EU-H2020 project (Grant agreement no. 641727), the Ministerio de Economía, Indistria y Competitividad (MINECO) and Belgian Science Policy Office. K.C. Armour was supported by National Science Foundation award OCE-1523641. H. Goosse is the Research Director within the Fonds National de la Recherche Scientifique (F.R.S.-FNRS-Belgium). François Massonnet is a F.R.S-FNRS Post-Doctoral Researcher. Jennifer Kay's efforts were supported by NASA 15-CCST15-0025. A. Bodas-Salcedo was supported by the Joint UK BEIS/Defra Met Office Hadley Centre Climate Programme (GA01101). P. Kushner acknowledges the support of the Natural Sciences and Engineering Research Council of Canada's Canadian Sea Ice and Snow Evolution Network (see www.CanSISE.ca). This paper is the outcome of a workshop held in May 2016 at the Université catholique de Louvain, Belgium in the framework of the Polar Climate Prediction Initiative supported by the World Climate Research Programme.


Within the SaddleBrooke community, you will find seven restaurants for dining choices from morning to evening. At SaddleBrooke One, the casual RoadRunner Grill and patio offers breakfast and lunch. There are themed evenings and special events scheduled on the patio which overlooks the golf course. Gourmet pizza is found at Brooke One Pizza Kitchen.
For your evening dining pleasure, the place to relax and order from a wide-selection of menu items is upstairs in The Vistas Dining and The Agave Lounge with its twilight views of the Catalina Mountains. You can even choose to order meals to go, seven days a week. Menus are updated frequently and posted to the Residents Website.
Frequently offered, special culinary events feature wine tasting, creative menus and themed dinners. Meet your friends for dinner, plan a special event dinner or just stop by for a spur-of-the-moment snack. All of that is within easy reach at our SaddleBrooke restaurants.
A reciprocal use agreement with SaddleBrooke Two rounds out the restaurant options with a the MountainView Bistro, Mesquite Grill and Preserve Restaurant.
Amenities
Here are some things you can enjoy as a member of our community.
Golf
There are three courses: SaddleBrooke, Tucson and Catalina, which may be played in any combination to create a unique golf experience.
Tennis
Membership in the SaddleBrooke Tennis Club is open to all residents of SaddleBrooke but membership is not a requirement to use the courts.
Dining
Within the SaddleBrooke community, you will find seven restaurants for dining choices from morning to evening.
Community
A lifestyle typically reflects an individual's attitudes, way of life, and values. It is a way of life in which an individual chooses activities that are of importance to him/her.


Single-blog vs multi-blog
Pebble has the ability to host one or many blogs from a single web application deployment. This page details the key differences between running Pebble either way.
Single-blog (multiBlog=false)
By default, a single Pebble web application instance hosts a single blog, which is specified by setting the multiBlog
property
in the /WEB-INF/applicationContext-pebble.xml
file to false
. In this mode, the
home page of the Pebble web application represents the home page of the blog and all URLs are relative to this.
For example, assuming Pebble is deployed at http://localhost:8080/blog/
:
- http://localhost:8080/blog/ : the home page of the blog
- http://localhost:8080/blog/rss.xml : the main RSS feed for the blog
- http://localhost:8080/blog/2006/01.html : the permalink to content for January 2006 for the blog
Multi-blog (multiBlog=true)
By changing the multiBlog
property
in the /WEB-INF/applicationContext-pebble.xml
file to true
, a single Pebble web application
can host multiple blogs. In this case, the home page of the Pebble web application represents an aggregated
view over the blogs managed by the Pebble instance, and each blog has a slightly different home page URL.
Assuming Pebble is deployed at http://localhost:8080/blogs/
and manages 3 blogs (blog1, blog2 and blog3):
- http://localhost:8080/blogs/ : shows an aggregated view, showing the N most recent blog entries across all blogs
- http://localhost:8080/blogs/rss.xml : the aggregated RSS feed, containing the N most recent blog entries across all blogs
- http://localhost:8080/blogs/blog1/ : the home page of blog1
- http://localhost:8080/blogs/blog2/ : the home page of blog2
- http://localhost:8080/blogs/blog3/ : the home page of blog3
- http://localhost:8080/blogs/blog1/rss.xml : the main RSS feed for blog1
- http://localhost:8080/blogs/blog1/2006/01.html : the permalink to content for January 2006 for blog1
Switching modes
The rationale for providing two different modes of operation is to keep the URLs as short as possible when only running a single blog. Behind the scenes, the data for all blogs (regardless of whether Pebble is hosting one or more than one blog) is stored in exactly the same way. For this reason, you can start with Pebble running in single-blog mode and switch to multi-blog in the future. If you do this, your blog URL will change as follows:
- Before (single-blog mode) : http://localhost:8080/blog/
- After (multi-blog mode) : http://localhost:8080/blog/default/
After switching to multi-blog mode, you can create additional blogs by logging into Pebble as a blog admin and use the administration features. This process is detailed in the online help, which can be accessed after logging in.


Date of Birth: 8THSeptember 1994
Gender: Male
Marital Status: Single
Nationality: Kenyan
I aim to become accomplished in my pursuits which i engaged in both as an academician, a leader and a responsible citizen.
To work in an organization that exposes me in a challenging and conducive working environment that can help build me in my profession and cope with trending issues in information technology.
PERSONAL PROFILEI am determined, diligent and can work under minimum supervision to achieve set goals and meet tight deadlines.
I have got good inter-personal and communication skills.
My role is responsible for designing, coding and modifying websites, from layout to function and according to a client's specifications. Strive to create visually appealing sites that feature user-friendly design and clear navigation.
I develop a comprehensive plan and instructions which can be given to other programmers.
Designing and planning the entire system.I also Selecting the right technologies to use in terms of software and hardware. My technical experience is valuable to be able to compare and contrast what is available.
Writing the Design Specification that the developers will use to guide their work and Producing the test plan for the testers.
I Liaise with the System Analyst once the Requirements Specification is available
I talk to the coders, programmers, technicians and engineers before the development stage begins. This is to help them understand what will be needed before the formal design specification is released.
I also explain to the clients, in non-technical terms, how the system will work and to get their feedback and opinions. If changes are needed, then it is back to the System Analyst once more to get them to update the Requirements Specification
I apply the principles of software engineering to the design, development, maintenance, testing, and evaluation of the software that make computers or other devices containing software work in school and clinics.
I apply the act of supporting and maintaining computer hardware. This includes diagnosing computer hardware issues, upgrading hardware on a computer and repairing computer hardware for my clients.
Install PC hardware. - Install and update hardware drivers. - Diagnose computer hardware problems. - Maintain computer hardware.

I am is responsible for keeping an organization’s computer network up to date and running smoothly. Any company or organization that uses multiple computers or software platforms needs a network admin to coordinate the different systems.
GPA: 3.23
Grade attained B
Kenya Certificate of Primary Education marks attained (362 out of 500 marks)
Apart from being a software developer,Neworking,web developer and designer, I enjoy most of my time being outdoors.I like traveling and long walks on the beach.I spend my free time watching football,movies and music.
On holidays i Like Mountain climbing,Home projects,Drawing,Gardening,cooking and Reading novals and magzines


| VRA8-P CTRL 1.0.1 Digital Synth VRA8-P Controller (View on GitHub), We recommend Google Chrome |
| MIDI IN | MIDI OUT | KBD TRANSPOSE | -1 |
| PRESET |
| UNISON | OSC WAVEFORM | OSC DETUNE | AMP EG | ||||
| -1 | -1 | -1 | -1 | ||||
| (OFF/ON) | (SAW/ORGAN/SQ) | (OFF/ON) | |||||
| FILTER CUTOFF | FILTER RESO | FILTER EG AMT | EG DECAY | ||||
| -1 | -1 | -1 | -1 | ||||
| (MINUS/ZERO/PLUS) |
| C#3 | D#3 | F#3 | G#3 | A#3 | C#4 | D#4 | F#4 | G#4 | A#4 |
| C3 | D3 | E3 | F3 | G3 | A3 | B3 | C4 | D4 | E4 | F4 | G4 | A4 | B4 | C5 |


| UN {carData} | R Documentation |
National health, welfare, and education statistics for 213 places, mostly UN members, but also other areas like Hong Kong that are not independent countries.
data(UN)
A data frame with 213 rows on the following 7 variables.
region
Region of the world: Africa
, Asia
, Caribbean
, Europe
,
Latin Amer
, North America
, NorthAtlantic
, Oceania
.
group
A factor with levels oecd
for countries that
are members of the OECD, the Organization for Economic Co-operation and
Development, as of May 2012, africa
for countries on the African
continent, and other
for all other countries. No OECD countries are
located in Africa.
fertility
Total fertility rate, number of children per woman.
ppgdp
Per capita gross domestic product in US dollars.
lifeExpF
Female life expectancy, years.
pctUrban
Percent urban.
infantMortality
Infant deaths by age 1 year per 1000 live births
Similar data, from the period 2000-2003, appear in the alr3
package
under the name UN3
.
This data set was formerly named UNlla
and replaces the older dataset named UN
.
All data were collected from UN tables accessed at http://unstats.un.org/unsd/demographic/products/socind/ on April 23, 2012. OECD membership is from https://www.oecd.org/, accessed May 25, 2012.
Weisberg, S. (2014). Applied Linear Regression, 4th edition. Hoboken NJ: Wiley.
summary(UN)


SEO is the process of affecting the visibility
Every company owner wants to see his/her company in a leading position of the industry. We are ready to give your business such an advantage.
We work in areas as diverse as search engine optimization, social media marketing, email marketing and digital marketing.
Our team of specialists consistently delivers outstanding results combining creative ideas with our vast experience. We can help you build a sustainable, meaningful relationship with your clients by engaging them with your brand using social media.
book your serviceSEOStudio can give you lots of advantages, from which you will surely benefit.
Hot!SEOStudio is your choice in the world of online marketing. Contact us now!
I would just like to say thank you for your effective online marketing services, for your friendly and professional support and answers to my questions!
Thank you for the SEOs you delivered. You helped my website attract new partners and promote my own services to a greater number of customers.
SEOStudio is the only agency that provides high quality online marketing and promotion services. The members of their team are real professionals in search engine optimization.
Your team worked hard before the project to come up with a perfect SMM solution that met our requirements. Every team member did their job well and I appreciate it.
Keep up with our always upcoming news, updates, and publications. Enter your e-mail and subscribe to our newsletter.
You can contact us any way that is convenient for you. We are available 24/7 via fax or email. You can also use a quick contact form below or visit our office personally.


{% extends 'base.html' %} {% load i18n %} {% block title %}{% trans "Network Topology" %}{% endblock %} {% block main %} {% include "project/network_topology/client_side/_balloon_container.html" %} {% include "project/network_topology/client_side/_balloon_device.html" %} {% include "project/network_topology/client_side/_balloon_port.html" %} {% include "project/network_topology/client_side/_balloon_net.html" %} {% include "project/network_topology/client_side/_balloon_instance.html" %} {% include 'project/network_topology/_actions_list.html' %}


Skeleton Template for Lisp Project
Table of Contents
[in package SXABLONO.DOCS with nicknames SXDOCS]
This is a skeleton template for a Lisp project that includes tests and documentation facilities. The purpose of this project is to create a starting point for the development of new small/medium libraries. Testing uses the FIVEAM framework. Documentation uses the MGL-PAX system.
Project name: sxablono =>
skeleton in Esperanto!
1 ASDF Details
Version: 1.0.0
Description: Skeleton template for Lisp project with test and documentation generator.
License: Unlicense.
Author: Prashanth Kumar
Mailto<EMAIL_ADDRESS>Homepage: http://prasxanth.github.io/sxablono/
Bug tracker: https://github.com/prasxanth/sxablono/issues
Source control: http://github.com/sxablono.git
2 Project Structure
The file and folder structure for the project are organized as follows,
├── LICENSE
├── docs
│ ├── build.lisp
│ ├── docs.lisp
│ ├── jquery.min.js
│ ├── package.lisp
│ ├── style.css
│ └── toc.min.js
├── src
│ ├── aux.lisp
│ ├── package.lisp
│ └── utils.lisp
├── sxablono.asd
└── tests
├── aux-tests.lisp
├── package.lisp
├── tests-suite.lisp
└── utils-tests.lisp
There are three main directories for each of the components,
Source Code:
src/
Tests:
tests/
Documentation:
docs/
sxablono.asd
contains all the system defintions for the source code, tests and documentation. The package.lisp
file in each directory contains the respective package definitions. License documentation is in the LICENSE
file.
The following sections explain each of the components and directory contents in more detail.
2.1 Source Code
The src/
folder contains all the core package files,
├── src
│ ├── aux.lisp
│ ├── package.lisp
│ └── utils.lisp
package.lisp
contains the usual definitions for use, imports and exports,
(uiop:read-file-string "../src/package.lisp")
=> (defpackage #:sxablono
(:nicknames #:sxbl)
(:use #:cl)
(:import-from #:mgl-pax
#:defsection)
(:export #:do-the-job
#:foo)
(:documentation "This is docstring for the package.
The package contains a function which does it's job by
applying transformation to the first and second arguments.
Note, despite the docstring indentation, it is displayed
correctly. And PAX is smart enough to distinguish the common
indentation and indentation of a code block below:
(apply #'foo 42)
"))
The example files aux.lisp
and utils.lisp
contain the full definitions in the package (macros, functions etc.).
2.2 Tests
The FIVEAM framework is used for testing,
(uiop:read-file-string "../tests/package.lisp")
=> (defpackage #:sxablono.tests
(:nicknames #:sxtests)
(:documentation "Unit tests for SXABLONO")
(:use #:cl #:fiveam #:sxablono)
(:export #:principal-suite
#:run-principal-suite))
As per Common Lisp convention, the filename containing the tests for each corresponding file in the src/
folder is suffixed with -tests
. Hence, utils-tests.lisp
contains all the tests for src/utils.lisp
, and aux-tests.lisp
for src/aux.lisp
.
└── tests
├── aux-tests.lisp
├── package.lisp
├── tests-suite.lisp
└── utils-tests.lisp
The tests-suite.lisp
contains principal-suite
, the parent suite for all the tests.
To run the tests using ASDF
,
(ql:quickload :sxablono)
(asdf:test-system :sxablono)
2.3 Documentation
MGL-PAX is used to generate the documentation.
(uiop:read-file-string "package.lisp")
=> (defpackage #:sxablono.docs
(:nicknames #:sxdocs)
(:use #:cl #:iterate)
(:import-from #:mgl-pax
#:section
#:defsection)
(:import-from #:sxablono
#:@aux
#:@utils)
(:export #:build))
docs.lisp
contains the main narrative and contents. It includes both handwritten documentation and docstrings from functions in src/
.
├── docs
│ ├── build.lisp
│ ├── docs.lisp
│ ├── jquery.min.js
│ ├── package.lisp
│ ├── style.css
│ └── toc.min.js
Documentation is generated using the build
function defined in build.lisp
.
This does the following,
Updates only the
index.html
file. This file is created if it does not exist.Generates and overwrites the
README
andREADME.md
files in the project root directory
After generating the documentation, the folder structure should resemble,
├── README
├── README.md
├── docs
│ ├── build.lisp
│ ├── docs.lisp
│ ├── index.html
│ ├── jquery.min.js
│ ├── package.lisp
│ ├── style.css
│ └── toc.min.js
A single index.html
simplifies maintenance. It also eases hosting on Github.
Larger documentation (distributed across multiple files) can be placed in a separate build/
sub-directory. However, this makes the process of hosting the documentation slightly more complicated as the contents have to be moved or copied to the gh-pages
branch of the repository.
3 How to Use
As an example, consider a project named spectre
, in the ~/lisp
directory, used to analyze and plot continous spectra data. The core functionality is contained in two files, analyze.lisp
and plot.lisp
.
To adapt this template for the project, follow the steps below,
- Download a copy to
~/lisp
and rename the folder tospectre
. Replace all instances ofsxablono
withspectre
in all the files. - In the
src/
directory,- Update
package.lisp
, - Confirm that the package name is
spectre
. - Modify the uses, imports and exports.
- Do not delete the import of
defsection
frommgl-pax
. - Include documentation for the package.
- Add source files,
- Add the core functionality (functions, macros, classes etc.). This can be in a single file or distributed across multiple files.
- Ensure
(in-package :spectre)
is at the top of every file.
- Update
- In the
tests/
directory,- Confirm that the package name is
spectre.tests
. - Update
package.lisp
with the uses, imports and exports. - Tests for each file in the
src/
directory should be in a corresponding file with the same name suffixed with-tests
. So, tests should be calledanalyze-tests.lisp
andplot-tests.lisp
. - Update
tests-suite.lisp
with any additional tests.
- Confirm that the package name is
- In the
docs/
directory,- Confirm that the package name is
spectre.docs
. - Update
package.lisp
with the uses, imports and exports. - Import documentation for all exported function from relevant files in
src/
.
- Confirm that the package name is
- Modify the
spectre.asd
file,- Add/update the metadata (author, license, version, description etc.)
- Include all the details from the
package.lisp
files in each of thesrc/
,tests/
anddoc/
directories.
- Update the
LICENSE
file if applicable. - The directory structure should look like,
├── LICENSE ├── docs │ ├── build.lisp │ ├── docs.lisp │ ├── jquery.min.js │ ├── package.lisp │ ├── style.css │ └── toc.min.js ├── spectre.asd ├── src │ ├── analyze.lisp │ ├── package.lisp │ └── plot.lisp └── tests ├── analyze-tests.lisp ├── package.lisp ├── plot-tests.lisp └── tests-suite.lisp
- Create a softlink to
~/quicklisp/local-projects
,ln -s ~/lisp/spectre ~/quicklisp/local-projects/spectre
- Quickload the project in SLIME to make it available,
(ql:quickload :spectre)
- Run the tests,
(asdf:test-system :spectre)
- Generate the documentation,
(ql:quickload :spectre.docs) (spectre.docs:build)
The folder structure should now look like,
├── LICENSE ├── README ├── README.md ├── docs │ ├── build.lisp │ ├── docs.lisp │ ├── index.html │ ├── jquery.min.js │ ├── package.lisp │ ├── style.css │ └── toc.min.js ├── spectre.asd ├── src │ ├── analyze.lisp │ ├── package.lisp │ └── plot.lisp └── tests ├── analyze-tests.lisp ├── package.lisp ├── plot-tests.lisp └── tests-suite.lisp
4 API Reference
4.1 Auxillary Functions
[in package SXABLONO with nicknames SXBL]
This documentation is for the aux.lisp
file.
It contains only one function definition:
[function] FOO FIRST &KEY (OTHER 100500)
Synopsis -- Function to concatentate arguments
Input Arguments
FIRST
-- an objectOTHER
-- an object. Defaults to 100500.Return Values
RESULT -- a string
Description
The documentation layout of this function is the template to be followed when documenting any function.
Example of referencing another function --
sxablono:do-the-job
.Examples
The intent of the documentation is to ensure that it is as descriptive as possible, so the use of examples is highly encouraged. Liberal use of doctests, AKA transcripts in
MGL-PAX
terminology, as examples are strongly recommended as they are often better at conveying information. Along with tests, transcripts provide an additional layer of validation to the code.With default value of
:OTHER
,(foo :abc) => "ABC 100500"
With custom value of
:OTHER
,(foo :abc :other 10101) => "ABC 10101"
Note that this capability to interleave file or package documentation within an overarching narrative can be used to provide context to the internal definitions.
An example of cross-referencing ->
For sxablono
, here FOO
references SXABLONO:DO-THE-JOB
, which is desribed in Utility Functions.
4.2 Utility Functions
[in package SXABLONO with nicknames SXBL]
[function] DO-THE-JOB FIRST SECOND
Synopsis -- Function to concatenate arguments
Input Arguments
FIRST
-- an objectSECOND
-- an objectReturn Values
RESULT -- a string
Description
The documentation layout of this function is the template to be followed when documenting any function. It is akin to the man pages on Linux system.
Examples
The intent of the documentation is to ensure that it is as descriptive as possible so the use of examples is highly encouraged.
(do-the-job :abc 1) => "ABC 1"


{% include head.html %}
{% include nav-en.html %} {% include header-atlassian-en.html %} {% include services-atlassian-en.html %} {% include contact-en.html %} {% include scripts.html %}


Definitions
- Block RAM (BRAM): hardened RAM resource. More efficient memories than using LUTs for more than a few elements.
- Compute Unit (CU): An OpenCL device has one or more compute units. A work-group executes on a single compute unit. A compute unit is composed of one or more processing elements and local memory. A compute unit may also include dedicated texture filter units that can be accessed by its processing elements3.
- Digital Signal Processor (DSP): performs multiplication and other arithmetic in the FPGA
- Field-Programmable Gate Array (FPGA): semiconductor devices that are based around a matrix of configurable logic blocks (CLBs) connected via programmable interconnects. FPGAs can be reprogrammed to desired application or functionality requirements after manufacturing.
- Flip Flops (FF): control the flow of data with the clock pulse. Used to build the pipeline and achieve high throughput
- Hardware Description Language (HDL): a specialized computer language used to describe the structure and behavior of electronic circuits, and most commonly, digital logic circuits2.
- High Level Synthesis (HLS): compiler for C, C++, SystemC into FPGA IP cores
- Kernel: An OpenCL kernel is a function declared in a program and executed on an OpenCL device. A kernel is identified by the kernel or kernel qualifier applied to any function defined in a program3.
- Look Up Table (LUT): generic functions on small bitwidth inputs (the logic itself). Combine many to build the algorithm.
- Register Transfer Level (RTL): a design abstraction (typically graphical) which models a synchronous digital circuit in terms of the flow of digital signals (data) between hardware registers, and the logical operations performed on those signals. The very low level description of the function and connection of logic gates: Register-transfer-level abstraction is used in hardware description languages (HDLs) like Verilog and VHDL to create high-level representations of a circuit, from which lower-level representations and ultimately actual wiring can be derived. Design at the RTL level is typical practice in modern digital design.
- Robot Operating System (ROS): a framework for robot application development. Includes tools, libraries, conventions and a community. The de-facto standard in robotics.
- VHSIC Hardware Description Language (VHDL): a hardware description language (HDL) that can model the behavior and structure of digital systems.
- Verilog: standardized as IEEE 1364, is a hardware description language (HDL) used to model electronic systems.
-
Hardware description language. Wikipedia. Retrieved from https://en.wikipedia.org/wiki/Hardware_description_language ↩
-
Register-transfer level. Wikipedia. Retrieved from https://en.wikipedia.org/wiki/Register-transfer_level ↩
-
The OpenCL™ Specification Version V2.2-11. Retrieved from https://www.khronos.org/registry/OpenCL/specs/2.2/html/OpenCL_API.html. ↩↩


--- layout: post title: When you look into the abyss... date: '2011-04-05T00:00:00+02:00' tags: - android - ios - app - photography tumblr_url: http://aladac.tumblr.com/post/19947800797/when-you-look-into-the-abyss ---
..you might want to capture the foreground razor sharp and the background slightly blurred.
I am far from being a photography expert, so for me a tool like a depth of field calculator is very useful.
My favorite app so far is DoF Calc. for the Android
In the words of the USMC oath “there are many like it” for both Android and iOS devices: