📅 (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.16.tar.gz" checksum: "sha512=db5e3ce6eb30066150c3611222c48f0eaab02f5b6101faab20d8a586c4f23bacb0c46372eff03736d7f017195500b3ea0203895052bf6ade752030a08c77e86d" }
true
Dry install with the current Coq version:
opam install -y --show-action coq-fiat-crypto.0.0.16 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.16 coq.8.15.2
opam list; echo; ulimit -Sv 16000000; timeout 4h opam install -y -v coq-fiat-crypto.0.0.16 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.16 <><> Gathering sources ><><><><><><><><><><><><><><><><><><><><><><><><><><><><> Processing 1/1: [coq-fiat-crypto.0.0.16: http] [coq-fiat-crypto.0.0.16] downloaded from https://github.com/mit-plv/fiat-crypto/archive/refs/tags/v0.0.16.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.16) - ./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/SplitInContext.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/Sorting/Sorted/Proper.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/Ut [...] truncated for 0.258 secs (0.026u,0.s) (success) - Tactic call ran for 0.126 secs (0.006u,0.s) (success) - Tactic call ran for 0.709 secs (0.073u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Tactic call ran for 0.07 secs (0.01u,0.s) (success) - Tactic call ran for 0. secs (0.u,0.s) (success) - Proving Rewriter_Interp... - Tactic call ran for 2.287 secs (0.248u,0.003s) (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.428 secs (0.034u,0.001s) (success) - Tactic call ran for 0.045 secs (0.008u,0.s) (success) - Tactic call ran for 0.562 secs (0.07u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Tactic call ran for 0.099 secs (0.011u,0.s) (success) - Tactic call ran for 0.395 secs (0.035u,0.s) (success) - Proving Rewriter_Interp... - Tactic call ran for 3.739 secs (0.377u,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 - Tactic call ran for 103.237 secs (10.919u,0.007s) (success) - Proving Rewriter_Interp... - Compiling decision tree... - Splitting rewrite rules... - Tactic call ran for 262.615 secs (28.355u,0.016s) (success) - Assembling rewrite_head... - Reducing rewrite_head... - Tactic call ran for 15.941 secs (1.635u,0.s) (success) - Tactic call ran for 102.747 secs (10.778u,0.019s) (success) - Assembling verified rewriter... - Refining with verified rewriter... - COQC src/Arithmetic/BaseConversion.v - COQC src/PushButtonSynthesis/SaturatedSolinasReificationCache.v - Finished transaction in 38.113 secs (4.164u,0.009s) (successful) - COQC src/PushButtonSynthesis/BaseConversionReificationCache.v - Finished transaction in 23.154 secs (2.458u,0.003s) (successful) - COQC src/Stringification/C.v - Finished transaction in 20.498 secs (2.064u,0.019s) (successful) - COQC src/Stringification/Rust.v - Finished transaction in 16.179 secs (1.683u,0.s) (successful) - 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 - COQC src/Arithmetic/FancyMontgomeryReduction.v - Tactic call ran for 524.797 secs (55.302u,0.232s) (success) - Tactic call ran for 2.847 secs (0.309u,0.s) (success) - Assembling rewrite_head_no_dtree... - Reducing rewrite_head_no_dtree... - Proving Rewriter_Wf... - Tactic call ran for 21.214 secs (2.197u,0.004s) (success) - COQC src/ArithmeticCPS/BaseConversion.v - COQC src/Assembly/WithBedrock/Proofs.v - Tactic call ran for 94.13 secs (9.968u,0.008s) (success) - COQC src/Bedrock/Field/Stringification/FlattenVarData.v - COQC src/Curves/Montgomery/AffineInstances.v - Proving Rewriter_Interp... - COQC src/PushButtonSynthesis/BarrettReductionReificationCache.v - Finished transaction in 65.391 secs (6.691u,0.059s) (successful) - Finished transaction in 40.043 secs (4.296u,0.008s) (successful) - COQC src/PushButtonSynthesis/FancyMontgomeryReductionReificationCache.v - Finished transaction in 54.518 secs (5.602u,0.032s) (successful) - Finished transaction in 27.12 secs (2.785u,0.004s) (successful) - COQC src/Arithmetic/Freeze.v - Finished transaction in 3986.604 secs (416.834u,0.362s) (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] - COQC src/ArithmeticCPS/Freeze.v - COQC src/Curves/Montgomery/XZProofs.v - Tactic call ran for 288.136 secs (30.512u,0.057s) (success) - Tactic call ran for 73.125 secs (8.01u,0.004s) (success) - Assembling verified rewriter... - Refining with verified rewriter... - Finished transaction in 165.231 secs (17.386u,0.054s) (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] - COQC src/Rewriter/All.v - COQC src/Arithmetic/WordByWordMontgomery.v - build_inputs start - build_inputs end - build_merge_base_addresses start - build_merge_base_addresses end - build_merge_base_addresses start - Finished transaction in 347.184 secs (9.56u,0.512s) (successful) - Finished transaction in 43.764 secs (4.617u,0.018s) (successful) - build_merge_base_addresses end - build_merge_stack_placeholders start - COQC src/PushButtonSynthesis/UnsaturatedSolinasReificationCache.v - build_merge_stack_placeholders end - get callee_saved_registers start - get callee_saved_registers end - Finished transaction in 28.172 secs (2.885u,0.023s) (successful) - get callee_saved_registers start - SymexLines start - SymexLines end - Finished transaction in 17.94 secs (1.941u,0.002s) (successful) - Finished transaction in 30.371 secs (3.19u,0.003s) (successful) - get callee_saved_registers start - get callee_saved_registers end - Finished transaction in 22.88 secs (2.616u,0.007s) (successful) - LoadArray start - LoadArray end - LoadOutputs start - Finished transaction in 22.515 secs (2.423u,0.s) (successful) - LoadOutputs end - Finished transaction in 18.155 secs (1.953u,0.s) (successful) - LoadOutputs start - Finished transaction in 15.988 secs (1.635u,0.014s) (successful) - Finished transaction in 11.232 secs (1.296u,0.s) (successful) - LoadOutputs end - Finished transaction in 16.253 secs (1.633u,0.007s) (successful) - Finished transaction in 11.264 secs (1.237u,0.s) (successful) - Finished transaction in 5.852 secs (0.633u,0.s) (successful) - Finished transaction in 4.509 secs (0.452u,0.s) (successful) - Finished transaction in 8.616 secs (0.911u,0.s) (successful) - Finished transaction in 6.725 secs (0.71u,0.s) (successful) - Finished transaction in 10.351 secs (1.049u,0.s) (successful) - Finished transaction in 7.145 secs (0.713u,0.s) (successful) - Finished transaction in 16.439 secs (1.682u,0.003s) (successful) - Finished transaction in 12.776 secs (1.475u,0.003s) (successful) - Finished transaction in 15.3 secs (1.855u,0.011s) (successful) - Finished transaction in 16.907 secs (1.913u,0.s) (successful) - Finished transaction in 21.534 secs (2.152u,0.s) (successful) - Finished transaction in 16.92 secs (1.804u,0.s) (successful) - Finished transaction in 14.942 secs (1.713u,0.s) (successful) - Finished transaction in 10.557 secs (1.077u,0.s) (successful) - Finished transaction in 15.11 secs (1.622u,0.003s) (successful) - Finished transaction in 10.269 secs (1.035u,0.s) (successful) - Finished transaction in 15.189 secs (1.596u,0.003s) (successful) - Finished transaction in 9.45 secs (1.068u,0.s) (successful) - Finished transaction in 2.255 secs (0.245u,0.s) (successful) - Finished transaction in 0.67 secs (0.16u,0.003s) (successful) - Finished transaction in 2.573 secs (0.282u,0.s) (successful) - Finished transaction in 1.498 secs (0.14u,0.003s) (successful) - Finished transaction in 29.833 secs (3.331u,0.023s) (successful) - Finished transaction in 22.346 secs (2.217u,0.004s) (successful) - Finished transaction in 15.749 secs (1.639u,0.s) (successful) - Finished transaction in 9.178 secs (1.005u,0.s) (successful) - COQC src/PushButtonSynthesis/WordByWordMontgomeryReificationCache.v - Finished transaction in 63.076 secs (7.091u,0.046s) (successful) - Finished transaction in 37.974 secs (3.975u,0.011s) (successful) - Finished transaction in 15.191 secs (1.648u,0.003s) (successful) - Finished transaction in 10.047 secs (1.103u,0.003s) (successful) - Finished transaction in 14.936 secs (1.518u,0.003s) (successful) - Finished transaction in 8.753 secs (1.003u,0.s) (successful) - Finished transaction in 12.716 secs (1.497u,0.s) (successful) - Finished transaction in 9.807 secs (1.027u,0.s) (successful) - Finished transaction in 15.853 secs (1.712u,0.003s) (successful) - Finished transaction in 9.918 secs (1.062u,0.s) (successful) - Finished transaction in 14.414 secs (1.522u,0.s) (successful) - Finished transaction in 10.157 secs (1.141u,0.s) (successful) - Finished transaction in 0.506 secs (0.05u,0.s) (successful) - Finished transaction in 0.243 secs (0.023u,0.s) (successful) - Finished transaction in 2.995 secs (0.287u,0.003s) (successful) - Finished transaction in 1.81 secs (0.185u,0.s) (successful) - Finished transaction in 3.117 secs (0.328u,0.s) (successful) - Finished transaction in 1.789 secs (0.185u,0.s) (successful) - Finished transaction in 50.516 secs (5.796u,0.023s) (successful) - Finished transaction in 30.43 secs (3.281u,0.012s) (successful) - Finished transaction in 62.387 secs (6.684u,0.027s) (successful) - Finished transaction in 30.086 secs (3.426u,0.003s) (successful) - Finished transaction in 56.407 secs (6.159u,0.007s) (successful) - Finished transaction in 30.642 secs (3.236u,0.007s) (successful) - Finished transaction in 61.355 secs (6.457u,0.035s) (successful) - Finished transaction in 34.92 secs (3.726u,0.002s) (successful) - Finished transaction in 0.524 secs (0.056u,0.s) (successful) - Finished transaction in 0.148 secs (0.016u,0.002s) (successful) - Finished transaction in 56.607 secs (6.242u,0.019s) (successful) The middle of the output is truncated (maximum 20000 characters)
No files were installed.
true


--- layout: post permalink: r4dsds.html Tags: Array NameOfCoupon: R4DS-DS Cash Back Summary: See our R4DS-DS Coupon Code, R4DS-DS Rebate, R4DS-DS Promo Code, R4DS-DS Discount, R4DS-DS Coupon Cash Back Rebate here. MetaKeywords: R4DS-DS Coupon Code, R4DS-DS Rebate, R4DS-DS Promo Code, R4DS-DS Cash Back Rebate, R4DS-DS Discount, R4DS-DS Coupon Image: images/23314.gif LinkURL: http://www.shareasale.com/r.cfm?b=185272&u=412002&m=23314 affiliate_url_link: http://www.icouponblog.com/jane.php?id=1181 thesis_readmore: See the R4DS-DS Coupon thesis_thumb: http://www.icouponblog.com/tn.php?merchantURL=r4ds-ds.com Title: Save 4.00% - R4DS-DS Coupon Code for r4ds-ds.com. R4DS-DS Rebate & Discount thesis_description: Our R4DS-DS Discount Coupon Code for r4ds-ds.com. We have the best R4DS-DS Rebate anywhere. thesis_keywords: R4DS-DS, R4DS-DS Coupon Code, R4DS-DS Discount, R4DS-DS Rebate product_name: R4DS-DS hop_url: http://www.icouponblog.com/hop.php?id=1181 ---
If you are looking for R4 series flash cards, you can buy it directly from R4DS-DS a China based company that sells R4 series flash cards directly to the consumers. They have the lowest price and real fast and furious shipping services. (Please note, R4DS-DS is not manufactured or sponsored by Nintendo. They maybe used only for the purposes of legal playback of backups of orginal software, homebrew content, media files or other legitimate content), Check out the website at www.r4ds-ds.com. Use our discount coupons to get a great deal.
The R4 DS was the most popular Nintendo DS R4 card on the market and even today It is still one of the favorites. The R4 DS card is able to play music and watch videos on our Nintendo DS and accept Micro SD Card with capacities up to 2GB. You will love the website. Check it out. You will love the products and the prices. Just remember .R4DS-DS.com does not advise or support any illegal use of their R4DS and all other products.
If you loved the R4 series flash cards then, you will love it even more. Order online at www.r4ds-ds.com from the China based company. Get it shipped directly to you. Use our discount coupons to get an even better prices on an already discounted product. You will love www.r4ds-ds.com. Check it out today and start buying. Buy it for yourself and a loved one today.


We’re building a team of talented, passionate, and driven people to work on some of Canada’s biggest service delivery opportunities. From improving the citizenship process to helping veterans access their benefits, this is an opportunity to make a real impact for your country. Learn more about our mission.
Our small, multi-disciplinary teams are made up of developers, designers, researchers, data scientists, and product managers. We’re committed to building a team that’s diverse in gender, indigenous heritage, race, disability, age, language, and professional background.
We’re putting together multi-disciplinary project teams that work with departments to prototype, build, and deploy digital service solutions. Learn more about how we work.
We're hiring in five streams to make this happen:
Our hiring is a rolling campaign, so you can apply at any time.
We're hiring people at all levels of experience. We offer short, medium and long term employment and competitive salaries.
Currently, we're hiring in Ottawa but we plan to have people and teams working across the country.
An agile, dynamic team where you can work alongside experts from many digital disciplines.
An enabling environment, with access to the modern tools you need to do great work.
A laser-focus on users needs, with the ability to see the impact of your efforts.
Flexible work arrangements that ensure strong work-life balance.
You:
Are passionate about a user’s experience and want to create measurable improvements to service delivery.
Love working in multi-disciplinary teams and with external partners.
Create structure out of ambiguity, and forge a path in new environments.
Are excited about working in the open to benefit a larger community, and about sharing success and failures.
Are curious, and your humility helps you learn and grow.
Are in love with the problem, not the solution.
The Mandatory requirements:
Candidates must be fluent in one of Canada’s two official languages, English or French.
Preference will be given to Canadian citizens or permanent residents.
All candidates must be able to obtain a Government of Canada security clearance at either the Reliability or Secret level. We'll help you with this if you're offered a position.
You have experience in building an impressive public communications presence with a background in one or more of the following: developing and implementing communications strategies, content writing, stakeholder engagement, and training and learning.
You readily learn about new areas and, through your communication, help others learn and engage with new ideas.
You're ideally fluent in both English and French.
You are a communicator who knows how to write for different mediums and channels, like video, social media, and graphic design.
Engineers: You have experience serving as the engineer of complex technology implementations in a product-centric environment, and are comfortable with bridging the gap between legacy development or operations teams and working toward a shared culture and vision.
You have experience with data modeling, data transformation, and SQL, and have strong programming skills in modern languages (e.g., Python, Scala, Java, Ruby, Go).
Analysts: You possess advanced SQL skills, a working knowledge of Python or other modern programming languages, and experience in analyzing business processes to fully understand the problem space.
You're good at leveraging data visualization tools in the context of a project and service dashboards, and experience hacking on open data.
Scientists: You have experience building narratives around user behaviour at scale using data that you collect and analyze, and ensuring data is used to make informed decisions.
You have a background in planning, executing and analyzing A/B experiments, and a solid understanding of statistical concepts such as multivariate analysis, type I / type II errors, effect sizes, linear regression and survival analysis.
You're fluent in SQL and have some development experience preferably in R or Python.
User experience, interaction design, service design & design research
You have an extensive portfolio in one of the above areas of design.
You have a track record of removing complexity from services or products, and you champion simplicity.
You’re great at communicating with people who aren’t familiar with design, comfortable working alongside clients during the design process, and are excited to work with people on research and testing.
You take an approach that is inclusive and accessible from the start.
You’re able to sketch and prototype your ideas on paper, in software or code.
Front-end, back-end, dev ops
You have a passion and skill for delivering high quality code, in languages such as Javascript, PHP, Ruby, Python, SASS, and you’ve worked with technologies like NodeJS, Rails, React, Angular, Serverless.
You’re comfortable building APIs in a RESTful style or with GraphQL.
You’re used to working on an agile team, in sprints, constantly iterating, and are excited about Test-Driven Development.
You might also contribute to open source projects and share your work on GitHub or other public code repositories.
You have significant leadership experience and a proven track-record of building and delivering high quality digital products or services, including evolving the vision for a product and managing its development from start to finish.
You have experience balancing user needs and business goals to frame problems and set priorities for delivery teams.
You have a background in leading one or more multi-disciplinary teams on several products while working in an agile environment, and in working across the full spectrum of your team to remove roadblocks during the product journey.
You have experience identifying and developing product principles, practices and processes to allow teams to collaboratively build the right thing, the right way.
Our objective is to find the right fit for both the applicant and the organization. When you apply, here’s what you can generally expect:
Confirmation
After applying, you’ll get an email to let you know we’ve received your application.
Preliminary call
If after reviewing your application we’d like to get to know you better, we’ll set up a brief chat to get further information.
Interview and Testing
We may then reach out to you for an in-depth interview, either in-person or by video. This could include an exam component, such as completing a written or technical task.
Reference Checks
We’ll call your references to learn more about your professional experiences.
Meet the team
Meeting and chatting with the people you’re going to be working with every day, including the CDS leadership, is crucial to confirming the right fit.
Job offer!
We’ll make the formal offer, and figure out when you can start.
If you weren’t offered a job, we would be pleased to discuss your application and why we didn’t see a fit. In some cases, we’ll request to hold on to your application for future reference, as there may be a fit down the road.
We are iterating in everything we do! Whether you apply or not, we are happy to receive feedback on what we can do to make the process better, just send us an email.


Vue2 Component for resizable and draggable elements, without external dependencies.
The most basic component, without any props, free to move even outside the parent element.
<vue-draggable-resizable>
You can drag me around and resize me as you wish.
 </vue-draggable-resizable>
You can drag me around and resize me as you wish.
Component that cannot be dragged or resized outside its parent element, defined with the prop :parent="true"
<vue-draggable-resizable :parent="true">
You cannot move or resize me outside my parent.
 </vue-draggable-resizable>
Bonus: a component constrained in parent, can automatically fill the space just by double-clicking on it.
You cannot move me or resize me outside my parent.
Component that can be dragged and resized only on x axis. Drag constrain is defined using axis="x"
prop, while resizing costrain can be achieved by defining only left and right handles :handles="['ml','mr']"
.
<vue-draggable-resizable :parent="true" axis="x" :handles="['ml','mr']">
You can move me or resize me only horizontally.
 </vue-draggable-resizable>
You can move me or resize me only horizontally.
Component that can be snapped to a grid. Just set the dimensions of grid cells (height and width in pixels) with the grid prop :grid="[25,25]"
<vue-draggable-resizable :parent="true" :grid="[25,25]">
You can snap me on a grid.
 </vue-draggable-resizable>
You can snap me on a grid.
More complex example with event handling.
<vue-draggable-resizable :parent="true" @activated="onActivate" @deactivated="onDeactivate" @resizing="onResize" @dragging="onDrag">
I can render my position and my dimensions.
 </vue-draggable-resizable>
I can render my position and my dimensions.
X: {{ x }}px / Y: {{ y }}px | Width: {{ width }}px / Height: {{ height }}pxMultiple resizable and draggable components. Notice how the Component 3 automatically fits in its parent, even if its default size exceeds the boudaries.
<template v-for="element in elements"> <vue-draggable-resizable :parent="true" :resizable="true" :x="element.x" :y="element.y" style="border: 1px solid">
{{ element.text }}
 </vue-draggable-resizable> </template>
{{ element.text }}
You can sync the `active` prop in order to activate the component externally, e.g. using a button.
<vue-draggable-resizable :parent="true" :resizable="true" :active.sync="true" style="border: 1px solid">
Use the button to activate me!
 </vue-draggable-resizable>
Use the button to activate me!
Component that can be dragged only through a handle :drag-handle="'.drag'"
and component that cannot be dragged from a handle :drag-cancel="'.cancel'"
<vue-draggable-resizable :parent="true" style="border: 1px solid black;" :drag-handle="'.drag'">
Drag Only Here
 </vue-draggable-resizable> <vue-draggable-resizable :x="300" :y="0" :parent="true" style="border: 1px solid black;" :drag-cancel="'.cancel'">
Cannot Drag Here
 </vue-draggable-resizable>


%--- NOTICE: Changes made to this file do nothing. Additionally, this file will be overwritten with each plugin update and/or activation. If you have the Pro version, you can edit this file via plugin settings without it being overwritten. ---% {{#aggregate}}


College (1927)
Grade: 67
"College" is a silent film starring Buster Keaton. It is loaded with slapstick gags, most of which succeed. Two Keaton trademarks are missing here: there are no stunts to speak of, and the plot does not center on transportation (no boats, trains or automobiles star in this picture).
Keaton plays a nerdy Valedictorian graduate at high school. He wants to win "the most popular girl in school", but she prefers athletes. Now at college, Keaton tries out for the baseball and track teams in order to impress her. Keaton, of course, is a spectacular failure at every athletic event he attempts. More slapstick occurs as Keaton works at part-time jobs.
In this, as in other Keaton silent films, his character makes a sudden (and unlikely) transition from klutz to hero. In the climax, Keaton executes flawlessly all the track and field events that he was such a flop at earlier in the picture.
"College" was made the same year as "The General". However, it is not nearly as compelling. Perhaps this is because James Horne and not Keaton is credited as Director. Perhaps the shorter length puts the focus on a series of gags rather than developing character or broadening the plot. But "College" simply isn't very ambitious: it succeeds as a comedy, but the lack of drama limits the film.
http://members.tripod.com/~Brian_Koller/movies.html
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


jsreport ships the official node.js client which you can use to remotely communicate with the jsreport server API.
Additionally, jsreport is implemented in the node.js and can be easily customized through javascript or run as a part of another node application. See the article jsreport in node.js for the details how to integrate or adapt jsreport.
If the jsreport official package isn't the best fit for you. You can use the minimal jsreport core and build your app from the exact extensions you are interested in. See jsreport-core for the details.


"Kerbal Space Program is more than a game, it's a sandbox which has catalyzed players to learn physics, understand engineering, set themselves challenges and perhaps build the occasional monstrosity which pushes the limits of the physics engine. However in this age of digital downloads the game has never had a physical printed manual, and this book sets out to remedy this shortcoming. Guiding the reader through the basic building, flying and astronavigation skills needed to go anywhere in the Kerbol system. It even taught me a few things about modding and electronics. Fly Safe!" — Scott Manley, YouTuber |


Afenyo Markin reveals how Akufo-Addo personally views Auditor General
New Patriotic Party (NPP) Member of Parliament for Effutu constituency, Alexander Afenyo-Markin, has made a disclosure about the disposition of President Akufo-Addo towards Auditor General Daniel Domelovo regarding his work as a Government auditor.
Afenyo-Markin said Saturday on Newsfile on JoyNews monitored by MyNewsGh.com that it is not true that “the government doesn’t like him [Domelovo] or some people are after him.”
According to the MP who doubles as Ghana Water Company Board Chairman, President Akufo-Addo and all senior members of government “respect” Daniel Domelovo.
“Mr Domelovo is well respected by senior members of this government and he is respected by the president. Nobody should create the impression that ‘the government doesn’t like him’ or some people are after him. Even if some people don’t like him, he should keep his calm,” Mr Afenyo Markin said.
“The systems that are working today, nobody can take him to court and jail him, how?” he added.
Mr Afenyo also advised the Auditor-General to remain calm and cooperate with ongoing investigations by the Economic and Organised Crime Office (EOCO).
“He shouldn’t be emotional, he should not overly be engaging the media [and] he should relax.”
On Mr Domelovo’s decision not to cooperate with EOCO, the NPP MP said he doubts a lawyer gave Domelovo that advice.
“I don’t think any lawyer will advise him not to go to EOCO. I don’t think Mr Sory will give him that advice. He never said Thaddeus advised him,” he stressed.


Angelina Jolie once messed up an audition because her PVC pants 'fused together'
Cape Town - Angelina Jolie admitted that early in her career she failed to secure a part she auditioned for because of her fashion choices, as the shiny PVC material had "fused together" during her wait to be called to audition.
Speaking about her sense of style growing up, she said: "At school I wasn't that popular person. I was a punk. I loved leather, PVC, and fishnets. Those were my three favourite fabrics in my early 20s. I remember the first time I wore PVC pants. I was waiting for an audition, sitting in the sun in LA. By the time it was my turn, my pants had fused together. I didn't get the part."
But the experience didn't impact Angelina's love for PVC, as she also recalled wearing a similar outfit when she married her first husband Jonny Lee Miller.
Compiled by Graye Morkel


# ******************************************************************************
# Copyright 2017-2018 Intel Corporation
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
# ******************************************************************************
import numpy as np
[docs]def max_values_squad(data_train):
"""
Function to compute the maximum length of sentences in
paragraphs and questions
Args:
-----------
data_train: list containing the entire dataset
Returns:
--------
maximum length of question and paragraph
"""
max_hypothesis = len(data_train[0][1])
max_premise = len(data_train[0][0])
for ele in data_train:
len1 = len(ele[0])
len2 = len(ele[1])
if max_premise < len1:
max_premise = len1
if max_hypothesis < len2:
max_hypothesis = len2
return max_premise, max_hypothesis
[docs]def get_qids(args, q_id_path, data_dev):
"""
Function to create a list of question_ids in dev set
Args:
-----------
q_id_path: path to question_ids file
data_dev: development set
Returns:
--------
list of question ids
"""
qids_list = []
with open(q_id_path) as q_ids:
for ele in q_ids:
qids_list.append(ele.strip().replace(" ", ""))
final_qidlist = []
count = 0
for ele in data_dev:
para_idx = ele[0]
if len(para_idx) < args.max_para:
final_qidlist.append(qids_list[count])
count += 1
return final_qidlist
[docs]def create_squad_training(paras_file, ques_file, answer_file, data_train_len=None):
"""
Function to read data from preprocessed files and return
data in the form of a list
Args:
-----------
paras_file: File name for preprocessed paragraphs
ques_file: File name for preprocessed questions
answer_file: File name for preprocessed answer spans
vocab_file: File name for preprocessed vocab
data_train_len= length of train dataset to use
Returns:
--------
appended list for train/dev dataset
"""
para_list = []
ques_list = []
ans_list = []
with open(paras_file) as f_para:
for ele in f_para:
para_list.append(list(map(int, ele.strip().split())))
with open(ques_file) as f_ques:
for ele in f_ques:
ques_list.append(list(map(int, ele.strip().split())))
with open(answer_file) as f_ans:
for ele in f_ans:
ans_list.append(list(map(int, ele.strip().split())))
data_train = []
if data_train_len is None:
data_train_len = len(para_list)
for idx in range(data_train_len):
data_train.append([para_list[idx], ques_list[idx], ans_list[idx]])
return data_train
[docs]def get_data_array_squad(params_dict, data_train, set_val='train'):
"""
Function to pad all sentences and restrict to max length defined by user
Args:
---------
params_dict: dictionary containing all input parameters
data_train: list containing the training/dev data_train
set_val: indicates id its a training set or dev set
Returns:
----------
Returns a list of tuples with padded sentences and masks
"""
max_para = params_dict['max_para']
max_question = params_dict['max_question']
train_set = []
count = 0
for ele in data_train:
para = ele[0]
para_idx = ele[0]
if len(para_idx) < max_para:
pad_length = max_para - len(para_idx)
para_idx = para_idx + [0] * pad_length
para_len = len(para)
para_mask = np.zeros([1, max_para])
para_mask[0, 0:len(para)] = 1
para_mask = para_mask.tolist()[0]
question_idx = ele[1]
question = ele[1]
if len(question) < max_question:
pad_length = max_question - len(question)
question_idx = question_idx + [0] * pad_length
question_len = len(question)
ques_mask = np.zeros([1, max_question])
ques_mask[0, 0:question_len] = 1
ques_mask = ques_mask.tolist()[0]
train_set.append((para_idx, question_idx, para_len, question_len,
ele[2], para_mask, ques_mask))
if set_val == 'train':
count += 1
if count >= params_dict['train_set_size']:
break
return train_set
[docs]def create_data_dict(data):
"""
Function to convert data to dictionary format
Args:
-----------
data: train/dev data as a list
Returns:
--------
a dictionary containing dev/train data
"""
train = {}
train['para'] = []
train['answer'] = []
train['question'] = []
train['question_len'] = []
train['para_len'] = []
train['para_mask'] = []
train['question_mask'] = []
for (para_idx, question_idx, para_len, question_len, answer, para_mask, ques_mask) in data:
train['para'].append(para_idx)
train['question'].append(question_idx)
train['para_len'].append(para_len)
train['question_len'].append(question_len)
train['answer'].append(answer)
train['para_mask'].append(para_mask)
train['question_mask'].append(ques_mask)
return train


Nasdaq 100 Index 1985/11/01-2012/06/29
Yearly Performance
(x: index gain, y: index gain(%), radius: fluctuation/index ratio, color: gain/loss)
reset
Days by Gain/Loss
reset
Quarters
reset
Day of Week
reset
Days by Fluctuation(%)
reset
Monthly Index Abs Move & Volume/500,000 Chart
(Blue Line: Avg Index, Green Line: Index Fluctuation)
reset
select a time range to zoom in
selected out of
records |
Reset All
Date
Open
Close
Change
Volume


Sit back, enjoy and Let us help you generate your
Akan Name!
Lets get you to be part of the
Ghanian family.
This is a web application that
takes a user's birthday and
calculates the day of the week
they were born and then depending
on their gender outputs their
Akan Name.


IN THE HIGH COURT OF JUDICATURE AT PATNA Cr.Misc. No.21109 of 2005 1.M/S BHARAT SUGAR MILLS LTD. AT, P.O. & P.S. SIDHWALIA, DISTRICT GOPALGANJ THORUGH THE VICE PRESIDENT, FINANCE HOLDING POWER OF ATTORNEY ON BEHALF OF THE COMPANY ANIL KUMAR KEJRIWAL 2.B.K.SUREKA, THE SENIOR EXECUTIVE VICE PRESIDENT, BHARAT SUGAR MILLS LTD. AT, P.O. & P.S. SIDHWALIA, DISTRICT- GOPALGANJ. .............PETITIONERS Versus 1.STATE OF BIHAR 2.THE BIHAR STATE POLLUTION CONTROL BOARD THROUGH ITS MEMBERE SECRETARY, SHRI R.CHOUBEY, BORING ROAD, PATNA AT PRESENT HAVING ITS OFFICE AT 2ND FLOOR, BELTRON BHAWAN, SHASTRINAGAR, PATNA-800023. ..............RESPONDENTS with Cr.Misc. No.21998 of 2005 1.M/S BHARAT SUGAR MILLS LTD. AT, P.O. & P.S. SIDHWALIA, DISTRICT GOPALGANJ THORUGH THE VICE PRESIDENT, FINANCE HOLDING POWER OF ATTORNEY ON BEHALF OF THE COMPANY ANIL KUMAR KEJRIWAL 2.B.K.SUREKA, THE SENIOR EXECUTIVE VICE PRESIDENT, BHARAT SUGAR MILLS LTD. AT, P.O. & P.S. SIDHWALIA, DISTRICT- GOPALGANJ. .............PETITIONERS Versus 1.STATE OF BIHAR 2.THE BIHAR STATE POLLUTION CONTROL BOARD THROUGH ITS MEMBERE SECRETARY, SHRI R.CHOUBEY, BORING ROAD, PATNA AT PRESENT HAVING ITS OFFICE AT 2ND FLOOR, BELTRON BHAWAN, SHASTRINAGAR, PATNA-800023. .............RESPONDENTS -----------
For the Petitioners : Mr. Y.V.Giri, Sr.Advocate (in both the cases) Mr.Ashish Giri, Advocate For the Respondent : Mr.Shivendra Kishore, Advocate Board For the State : Mr. Indu Bala Pandey, A.P.P.
4 25.3.2010 In both these applications, the company M/s Bharat Sugar Mills Ltd through its Vice President is petitioner no.1 and one B.K.Sureka, Sr. Executive Vice President is petitioner no.2. Similarly, in both the cases Bihar State Pollution Control Board through its Member Secretary is Opposite party no.2 who happens to be the complainant in these cases and as such both these applications are heard together.
2In Cr.Misc.No.21109 of 2005, the petitioners pray for quashing the entire proceeding arising out of Misc. Case No.33(M)/1988, T.R.No.124/05, pending in the court of S.D.J.M., Gopalganj cum Special Magistrate for offences under Water (Prevention and Control of Pollution) Act, 1974 including the order dated 11.12.1999 by which non-bailable warrant has been issued against the accused persons.
In Cr.Misc.No.21998 of 2008, the petitioners pray for quashing the entire proceedings arising out of Misc. Case No. 24(M)/1987, T.R.No.126/05 pending in the court of S.D.J.M., Gopalganj cum Special Magistrate for offences under Water (Prevention and Control of Pollution) Act, 1974 including the order dated 15.11.2000 by which non bailable warrant has been issued against the accused persons.
The fact of the case lies in a narrow compass. The Opposite party no.2 filed a petition of complaint bearing Complaint Case No.33(M)/1988 for offences under sections 41, 42, 43 and 44 of the Water (Prevention and Control of Pollution) Act committed during the period from 1.1.1987 on wards. Similarly, other complaint bearing Complaint Case No.24(M)/1987, which is the subject matter in Cr.Misc.No.21998 of 2005, was filed by Opposite party no.2 for offences under section 33 of the Water (Prevention and Control of Pollution) Act for restraining the petitioners from carrying on production in their factory namely M/s Bharat Sugar Mills, Sidhwalia as they were discharging waste water and other trade effluents into the 3 river Ghoghari without any treatment resulting in great apprehension of pollution of water of the aforesaid river Ghoghari.
It is submitted that the petitioner M/s Bharat Sugar Mills was established in 1931 and the main allegations in the complaint are that they were discharging trade effluents after 1987 without previous sanction of the Bihar State Pollution Control Board .It appears from paragraph 8 of the complaint case that earlier the petitioner Sugar factory was given consent for discharge of its trade effluents for a period from 1.4.1985 to 31.12.1988 by the State Board with conditions inter alia that they would submit the effluent analysis report during the working season monthly and that the effluents parameters contained should remain within the permissible limit as fixed by the Board. The petitioners further submit that the letter requesting for renewal of consent dated 22.10.1986 was returned to the Sugar Factory vide State Board's letter dated 8.1.1987 with request to send Analysis report and time bound programme for installation of Effluent Treatment Plant. The complaint was filed against M/s Bharat Sugar Mills through its Executive President who was accused no.1 and then the Executive President of M/s Bharat Sugar Mills Ltd. was made accused no.2 in both the cases.
The petitioners have stated in paragraph 10 of the petition in Cr.Misc.No.21109 of 2005 that at the relevant time when alleged offence was instituted, one G.P.Dhurka was the Executive President of the company who died on 22.5.1995. In fact, he had appeared in the case and taken bail. Petitioner no.2 B.K.Sureka was not even posted in 4 the Sugar Mill at the relevant time when the alleged offence was committed under section 33, 41, 42, 43 and 44 of the Water(Prevention and Control of Pollution) Act (hereinafter referred to as 'the Water Pollution Act').
Counsel for the petitioners submits that sections 41, 42 and 43 provides for punishment for alleged violation of sub-section (2) or sub-section(3) of section 20 or orders issued under clause© of sub-section(1) of section 32 or directions issued under sub-section(2) of section 33 or section 33A for a term which may extend to three months or with fine which may extend to ten thousand. He further submits that no person either juristic or natural has been made an accused in the instant case apart from two accused mentioned in the complaint case. The company being juristic person cannot be sent to jail and the company which was said to be represented through the Executive President at the relevant time has died in the year 1995. He further submits that petitioner no.2 was not an accused and the prosecution case is pending since last 22 years and the as such continuance of proceeding over 20 years would be violative of Article 21 of the Constitution and concept of speedy trial. In support of his contention, he relied upon a decision in the case of P.Ramachandra Rao Vs State of Karnataka, reported in (2002)4 SCC 578, particularly para-29 at page-603.
Mr. Shivendra Kishore, learned counsel appearing on behalf of the Bihar State Pollution Control Board submits that the petitioners cannot dispute that no offence has been made in the facts 5 and circumstances of the case. The petitioner Sugar Mill after 1.1.1987 did not have any sanction of the Pollution Control Board for discharging its trade effluents. Section 25 mandates that no person without consent of the Board will establish or take any steps to establish any industry, operation or process, or any treatment and disposal system which is likely to discharge sewage or trade effluent into a stream or well or sewer. He submits that the aforesaid provision would also apply to the existing lease and industry. He further submits that Section 33 authorizes the Pollution Control Board to make an application to courts for restraining apprehended pollution of water in streams or wells and as such complaint bearing Misc.Case No.24(M)/1987 was filed which is subject matter of Cr.Misc.No.21998 of 2005 He submits that the second complaint has been filed for punishing the Opposite parties for discharge of trade effluent without proper sanction. He submits that even if the erstwhile Executive President of the Sugar Mill was made an accused who died on 22.5.1995, still vicarious liability would continue against the new incumbent.
It appears that accused no.1 M/s Bharat Sugar Mills was established in the year 1931. Nonetheless, section 26 of the Water Pollution Act, 1974 provides that provision of section 25 will also be applicable to the existing discharge of sewage or trade effluent by existing lease at the commencement of the Act. Section 25 of the Act provides restriction on new outlets and new discharges. It mandates that no person without consent of the Board will establish or take any 6 steps to establish any industry, operation or process, or any treatment and disposal system which is likely to discharge sewage or trade effluent into a stream or well or sewer.
It is not in dispute that the accused persons have got consent from the State Government till 1986 for discharge of trade effluents. In 1986 the petitioners applied for consent for further period which was not acceded. However, in March, 1990 the petitioner company established its Effluent Treatment Plant. Thus, it appears that for the period between 1.1.1987 to March, 1990 the Sugar Mill did not have the valid consent for discharge of effluents.
The issue is whether prosecution would be allowed to continue against the petitioners even after 22 years or whether it could at all continue against them, in view of the fact that one G.P.Dhurka, was represented petitioner no.1, the company, and was also arrayed as accused no.2 as well, died on 22.5.1995. Further more, whether B.K.Sureka, petitioner no.2 in both the cases holding the post of Senior Executive Vice President of the Sugar Mill having joined the company much after 1990 can be prosecuted?
In my view no person who at the relevant time was not associated in any manner with the affairs of the company can be criminally proceeded against. Petitioner no.2 joined the company much after 1990 and as such the prosecution against him would be an abuse of the process of the court and the same is hereby quashed.
So far as petitioner no.1 namely M/s Bharat Sugar Mills Ltd. is concerned, I find that it has not been controverted that the then 7 Executive President representing the company namely G.P. Dhurka died on 22.5.1995. Had G.P. Dhurka been alive he could have been prosecuted whether he continued to be the Executive President or not. It is well settled that sentence of imprisonment can be passed only against the natural person and not against juristic person. In this case, as the then Executive President has died, I find that no sentence of imprisonment can be legally passed against the company.
However, the vicarious liability of the company, so far as payment of fine is concerned, would subsist and the instant proceeding at best can proceed only so far as it relates to imposition of fiscal punishment. To the aforesaid extent I fully find substance in the submission of learned counsel for the Pollution Board.
This takes us to the next issue whether the proceeding should be allowed to continue even for the purpose of imposition of fiscal punishment against the company after 22 years of filing of the complaint. It is not in dispute that the Sugar Mill regularly approached the Water Pollution Board for consent for its effluent discharge which was also granted up to 1986. Further consent was denied to the petitioner company after 1986 despite its application. It appears that within three years, the petitioner company established its Effluent Treatment Plant in the year 1990 and thereafter it has regularly obtained consent of the appropriate authority for discharge of its effluent.
It appears that no evidence or witness has been examined in the instant case. In such circumstances allowing the proceeding to 8 continue after 22 years would be violative of principle of speedy trial in the facts of this case. As such the instant proceedings arising out of Misc. Case No.33(M)/1988 and Misc. Case No.24(M)/1987 pending in the court of S.D.J.M. Gopalganj cum Special Magistrate, under Water(Prevention and Control of Pollution)Act, 1974 are quashed.
In the result, these two applications are allowed. KHAN (Samarendra Pratap Singh,J)


Title For Someting
Hello there, awesome person!


Make sure you've joined the audio conference. Leave and re-join if necessary by using the following button
(the icon changes depending on your status: not participating, only listening, microphone enabled):
If that doesn't help, try re-joining the room by reloading the page.
If that doesn't help, check the following settings:
Audio settings: Make sure your device is set to the right audio output and the volume is not muted.
Browser settings: Some browser allow muting a tab. Right-click the heiconf browser tab in the tab bar (top of your browser window) and check if you can un-mute it there.
If the problem persists, click below to get further help.


[%- page.import({ title => 'Documentation', section => 'docs', description => 'Where to find reference material?' }) -%]
There are many Perl books, you may also find these links useful.


EARL GREY 4EVAAAAAA!!!!!!!
HATERS GONNA HATE
About Earl Grey:
You don't know me!
Reasons not to mess with me:
I know the right people.
I have money.
I hold a grudge.
I never learned to read.


---
layout: post
title: blendie is an interactive sensitive intelligent
date: '2007-11-14T23:55:21+00:00'
tags: []
tumblr_url: http://backlog.robbevan.com/post/19448147/blendie-is-an-interactive-sensitive-intelligent
---
Blendie is an interactive, sensitive, intelligent, voice controlled blender with a mind of its own


{% extends "base.html" %} {% block body %} Home Logout
Enter the email address for the mailbox you would like to add


The MPI-2 RMA model requires the user to identify the local memory that may be a target of RMA calls at the time the window is created. This has advantages for both the programmer (only this memory can be updated by one-sided operations and provides greater safety) and the MPI implementation (special steps may be taken to make one-sided access to such memory more efficient). However, consider implementing a modifiable linked list using RMA operations; as new items are added to the list, memory must be allocated. In a C or C++ program, this memory is typically allocated using malloc or new respectively. In MPI-2 RMA, the programmer must create a window with a predefined amount of memory and then implement routines for allocating memory from within the window's memory. In addition, there is no easy way to handle the situation where the predefined amount of memory turns out to be inadequate. To support this model, the routine MPI_WIN_CREATE_DYNAMIC creates a window that makes it possible to expose memory without remote synchronization. It must be used in combination with the local routines MPI_WIN_ATTACH and MPI_WIN_DETACH.
| MPI_WIN_CREATE_DYNAMIC(info, comm, win) | |
| IN info | info argument (handle) |
| IN comm | intra-communicator (handle) |
| OUT win | window object returned by the call (handle) |
int MPI_Win_create_dynamic(MPI_Info info, MPI_Comm comm, MPI_Win *win)
MPI_Win_create_dynamic(info, comm, win, ierror)
TYPE(MPI_Info), INTENT(IN) :: info
TYPE(MPI_Comm), INTENT(IN) :: comm
TYPE(MPI_Win), INTENT(OUT) :: win
INTEGER, OPTIONAL, INTENT(OUT) :: ierror
MPI_WIN_CREATE_DYNAMIC(INFO, COMM, WIN, IERROR)
INTEGER INFO, COMM, WIN, IERROR
This is a collective call executed by all processes in the group of comm. It returns a window win without memory attached. Existing process memory can be attached as described below. This routine returns a window object that can be used by these processes to perform RMA operations on attached memory. Because this window has special properties, it will sometimes be referred to as a dynamic window.
The info argument can be used to specify hints similar to the info argument for MPI_WIN_CREATE.
In the case of a window created with MPI_WIN_CREATE_DYNAMIC, the target_disp for all RMA functions is the address at the target; i.e., the effective window_base is MPI_BOTTOM and the disp_unit is one. For dynamic windows, the target_disp argument to RMA communication operations is not restricted to non-negative values. Users should use MPI_GET_ADDRESS at the target process to determine the address of a target memory location and communicate this address to the origin process.
Advice to users.
Users are cautioned that displacement arithmetic can overflow in
variables of type MPI_Aint and result in unexpected values on some
platforms.
The MPI_AINT_ADD and MPI_AINT_DIFF
functions can be used to safely perform address arithmetic with MPI_Aint
displacements.
( End of advice to users.)
Advice
to implementors.
In environments with heterogeneous data representations, care must be
exercised in communicating addresses between processes. For example, it
is possible that an address valid at the target process (for example, a
64-bit pointer) cannot be expressed as an address at the origin (for
example, the origin uses 32-bit pointers). For this reason, a portable
MPI implementation should ensure that the type MPI_AINT
(see Table 3
) is able to store addresses
from any process.
( End of advice to implementors.)
Memory at the target cannot be accessed with this window until that memory
has been
attached using the function MPI_WIN_ATTACH.
That is, in addition to using MPI_WIN_CREATE_DYNAMIC to
create an MPI window, the user must use MPI_WIN_ATTACH
before any local memory may be the target of an MPI RMA operation.
Only memory that is currently accessible may be attached.
| MPI_WIN_ATTACH(win, base, size) | |
| IN win | window object (handle) |
| IN base | initial address of memory to be attached |
| IN size | size of memory to be attached in bytes |
int MPI_Win_attach(MPI_Win win, void *base, MPI_Aint size)
MPI_Win_attach(win, base, size, ierror)
TYPE(MPI_Win), INTENT(IN) :: win
TYPE(*), DIMENSION(..), ASYNCHRONOUS :: base
INTEGER(KIND=MPI_ADDRESS_KIND), INTENT(IN) :: size
INTEGER, OPTIONAL, INTENT(OUT) :: ierror
MPI_WIN_ATTACH(WIN, BASE, SIZE, IERROR)
INTEGER WIN, IERROR
<type> BASE(*)
INTEGER (KIND=MPI_ADDRESS_KIND) SIZE
Attaches a local memory region beginning at base for remote access within the given window. The memory region specified must not contain any part that is already attached to the window win, that is, attaching overlapping memory concurrently within the same window is erroneous. The argument win must be a window that was created with MPI_WIN_CREATE_DYNAMIC. The local memory region attached to the window consists of size bytes, starting at address base. In C, base is the starting address of a memory region. In Fortran, one can pass the first element of a memory region or a whole array, which must be `simply contiguous' (for `simply contiguous,' see Section Problems Due to Data Copying and Sequence Association with Subscript Triplets ). Multiple (but non-overlapping) memory regions may be attached to the same window.
Rationale.
Requiring that memory be explicitly attached before it is exposed to
one-sided access by other processes can
simplify
implementations and improve performance. The ability to make memory
available for RMA operations without requiring a collective
MPI_WIN_CREATE call is needed for some one-sided programming
models.
( End of rationale.)
Advice to users.
Attaching memory to a window may require the use of scarce resources; thus, attaching large regions of memory is not recommended in portable programs. Attaching memory to a window may fail if sufficient resources are not available; this is similar to the behavior of MPI_ALLOC_MEM.
The user is also responsible for ensuring that MPI_WIN_ATTACH at the target has returned before a process attempts to target that memory with an MPI RMA call.
Performing an RMA operation to memory that has not been attached to
a window created with MPI_WIN_CREATE_DYNAMIC is
erroneous. ( End of advice to users.)
Advice
to implementors.
A high-quality implementation will attempt to make as much memory
available for attaching as possible. Any limitations should be
documented by the implementor.
( End of advice to implementors.)
Attaching memory is a local operation as defined by MPI, which means
that the call is not
collective and completes without requiring any MPI routine to be
called in any other process.
Memory may be detached with the routine
MPI_WIN_DETACH. After memory has been
detached, it may not be the target of an MPI RMA operation on
that window (unless the
memory is re-attached with MPI_WIN_ATTACH).
| MPI_WIN_DETACH(win, base) | |
| IN win | window object (handle) |
| IN base | initial address of memory to be detached |
int MPI_Win_detach(MPI_Win win, const void *base)
MPI_Win_detach(win, base, ierror)
TYPE(MPI_Win), INTENT(IN) :: win
TYPE(*), DIMENSION(..), ASYNCHRONOUS :: base
INTEGER, OPTIONAL, INTENT(OUT) :: ierror
MPI_WIN_DETACH(WIN, BASE, IERROR)
INTEGER WIN, IERROR
<type> BASE(*)
Detaches a previously attached memory region beginning at base. The arguments base and win must match the arguments passed to a previous call to MPI_WIN_ATTACH.
Advice to users.
Detaching memory may permit the implementation to make more
efficient use of special memory or provide memory that may be needed
by a subsequent MPI_WIN_ATTACH. Users are encouraged to
detach memory that is no longer needed.
Memory should be detached before it is freed by the user.
( End of advice to users.)
Memory becomes detached when the associated dynamic memory window is
freed, see Section Window Destruction
.


Programmer Language Suggestor
Click a language to learn more about it
Ruby
Python
C#
C++
Fill out the questionnaire below, and you will get a suggeston for what programming language you should learn!
Which type of businesses do you prefer to support?
Small Businesses
Medium Businesses
Big Businesses
Which of these movies do you like best?
Forest Gump
Toy Story
The Notebook
Which sport do you prefer to watch?
Basketball
Football
Soccer
Which holiday do you like best?
Christmas
Thanksgiving
Halloween
Of these flavors of pie, which is your favorite?
Apple Pie
Pumpkin Pie
Marionberry
Show Results
You should learn:
Click here
to hide your results
Coding is fun!


Introducing the world's first decentralized wireless shower head.
Token price is Ether. You currently have SHOWER
/ tokens sold
Loading...
Token price is Ether. You currently have SHOWER
/ tokens sold
Working closely with Oober's engineering team, we finally developed robust Smart Contracts that enables delegated transfer.
With the use of appropriate data structures, BlockShower's deep learning algorithm has been certified by Andrew Ing from G00Gle.
With quantum computing, BlockShower's performace has increased by 146.732%
"I really rate the product. A shower on-the-go? Whoa."
"This has revolutionized the way I live. Powered by quantum computing? Whoa."
"This is the pinnacle of human intelligence. Powered by AI? Whoa."


Wordpress Changes between 3.8 and 4.0
General
- Replace PNG-based plugins ratings stars with Dashicons for performance gains
- Improved help tab text in various screens
- Clicking "Check Again" on the Updates screen now provides more immediate feedback
- Heartbeat performance and API improvements
- A $taxonomy argument was added to each of the adjacent post functions.
- Define $is_nginx in vars.php
- Apply capital_P_dangit() to the wp_title filter
- Make sure ajaxurl is defined in the Customizer
- validate_active_plugins() now checks the manage_network_plugins capability instead of is_super_admin()
- Allow passing false for the meta_box_cb argument in register_taxonomy() to turn off the meta box display entirely
- Make it easier to target video shortcodes by adding a wp-video class to the parent container
- Add CSSMin, SASS, CSSJanus, and jsHint to build tools for core development
- The "update" message has been restored to the dashboard
- Add ability to output galleries as HTML5
- Introduce doing_filter() and doing_action() to identify hooks in progress
- Introduce .dashicons-before class to make it easier to use a Dashicon before an element
- Add ability to symlink plugins
- The core colors.css file was merged into wp-admin.css, resulting in 1,065 fewer lines of admin CSS
- Dashicons updated to latest. Adds line break, paragraph, code, and bbPress.
- Add a TTL to core update checks to allow narrowing of the 12-hour update window
- The 'role' attribute is now allowed in kses for all elements
- Rewrite endpoints can now specify a query variable name
Dashboard
- Consolidate several Dashboard widgets to improve readability
- Replace the 'Right Now' widget with the new and improved 'At a Glance' widget
Appearance
- Introduce 8 new admin color schemes
- Improved readability throughout using Open Sans typeface (where supported)
- Responsive Toolbar for smaller-screen devices
- Leverage Dashicons instead of icon sprites for crisper experience on all resolutions
- Big RTL improvements throughout
- Make the dashboard more usable on any size device with responsive all the things
- Improve the login screen experience for Internet Explorer 8 users
- Improve Quick Edit experience for non-English users
- Improve the Menus experience for mobile users
- Widget Customizer management
- Upload header images with cropping in the Customizer
- Improved theme install workflow
Themes
- New Default Theme -- Twenty Fourteen
- Make it possible to check for any post format assigned to a post with has_post_format()
- Better custom background theme support defaults, can now specify 'default-repeat', 'default-position-x', and 'default-attachment' arguments for background images.
- Tags for width changed to layout: responsive-layout, fluid-layout, and fixed-layout
- New tag: accessibility-ready to denote a theme is aware of accessibility best practices such as color contrast, keyboard navigation, and form/link focus. See WP theme accessibility guidelines.
- Theme screenshots' size have increased from 600 × 450 to 880 × 660.
- New click-to-add interface for adding widgets to sidebars
- Improved interface for devices of all resolutions
- Better drag-and-drop experience
Accessibility
- Make list table row actions keyboard accessible
- Improve color contrast throughout the admin
- Improved focus styles for form elements throughout the admin
- Keyboard accessibility added for theme install screen and theme action buttons
Multisite
- Improved performance when deleting users in Multisite
- Add autocomplete for the admin email account to the "new site" form
- Introduce get_network_by_path()
- Introduce wp_get_network()
- Introduce Function_Reference/get_site_by_path|get_site_by_path()
- Incremental improvements and bug fixes with the multisite load process
- Introduce an ms_site_not_found filter to replace NOBLOGREDIRECT
Bug Fixes
- Fix bug where top-level categories were only redirecting if they had no children
- Fix bug in wp_get_object_terms() where returned were strings not integers
- Fix a bug where passing a null value to meta_query resulted in wonkiness with the comparison operator
- Fix "'wp_signups' already exists for query" error after updating a Multisite network
- Fix bug in get_bookmarks() caused by missing parentheses
- Fix comment_notification_recipients filter behavior so that it is still respected even on comments left by the post author
- Fix a date comparison error in dashboard_relative_date()
- Fix keyboard accessibility for row actions in list tables.
- Fix no-js and accessibility modes in in the Widgets screen
- Fix a bug where menus could still be assigned to a non-existent theme location
- Silence jQuery Migrate errors in the General settings page
- wp_auth_check now runs properly on every Heartbeat tick
- Post/page items are now removed from nav menus when the post/page is deleted
- Ensure the $path is trailing-slashed in domain_exists()
- Fix bulk activation of network-only plugins
- Texturize: Massive performance improvements (~600% faster); better handling of braces, nbsp, double, and weird spaces
External Libraries
- Add a copyright notice to zxcvbn (password strength meter) script
- Update to TinyMCE 4.0
- Update to Masonry 3.0
- Update to Backbone 1.1.2
- Update to Underscore 1.6
- Update to PHPMailer 5.2.7
- Update to Plupload 2.1.1
- Update to jQuery 1.11.0
- Update to jQuery UI 1.10.4
- Update to MediaElement 2.14
Posts
- Add "Return to post editor" link from Revisions screen
- A "View Post" link will now show for any post an author can read
- Distraction Free Writing mode is now responsive to any size device
- Edit images from the Add Media modal
- Improvements to the "Attach Media" pop-up interface
- Better support for auto-playing videos
- Drag and Drop files into the editor
- Full-screen Drag and Drop zone in Distraction Free Writing
- oEmbed support added for imgur and meetup.com
- Small improvements to comment administration screens, link colors, language tweaks
Users
- Admin auto-complete improvements
- Make sure the "Send this password to the new user by email" toggle option value is remembered
Install Process
- Make it easier to customize the install process
- Passwords with apostrophes are no longer allowed on installation
JavaScript
- Autosave JS has been refactored to use the Heartbeat API
- Heartbeat: Hooks will now always receive unslashed data
- Options passed to Backbone.View’s constructor are no longer attached automatically. wp.Backbone.View now handles this
- Big improvements to documentation of Backbone media-views
- Updated media-views and wp.Backbone.View for Backbone 1.1
- Masonry has a new script handle, 'masonry', and no longer depends on jQuery
New Actions
- Introduce resetpass_form
- Introduce wp_install
- Introduce wp_upgrade
- Introduce wp_playlist_scripts
- Introduce dynamic_sidebar_before
- Introduce dynamic_sidebar_after
New Filters
- Introduce get_adjacent_post_query_args
- Introduce post_playlist
- Introduce wp_insert_attachment_data
- Introduce incompatible_sql_modes
- Introduce theme_page_templates
- Introduce pre_get_network_by_path
- Introduce network_by_path_segments_count
- Introduce site_by_path_segments_count
- Introduce pre_get_site_by_path
- Introduce pre_wp_nav_menu
- Introduce pre_set_theme_mod_$name
- Introduce determine_current_user
- Introduce playlist_styles
- Introduce dynamic_sidebar_has_widgets
- Introduce is_active_sidebar
- Introduce ms_site_not_found
- Introduce pre_update_option


| DOSE: |
7 tsp |
oral |
Yohimbe |
(ground / crushed) |
I had high hopes for yohimbe having read numerous favorable reports both on it's mild psychedelic properties and it's enhancement of libido and quality of erection. I contacted my girlfriend and on account of not having personal experience of the effects, we picked a date whereby we could try it out without worrying about work the next day (we are both hypnotherapists/neurolinguists working in the mental health field). I was familiar with reports of yohimbe inhibiting sleep, so we at the very least needed to take this into account.
Gauging doses on reports of other users I prepared 12 teaspoons of ground yohimbe by simmering in a pan of water for 10 minutes and leaving to cool. I then poured the water to give approximate doses of 7 teaspoons for me and 5 teaspoons for my girlfriend (who is of slight build).
We consumed the liquid on empty stomach at approximately 5pm with an expectation of about 2 hours to activation period. Despite the color and appearance of the liquid it wasn't entirely unpleasant to consume and at 6pm, one hour after consumption, we ate dinner.
At 7pm whilst running a bath I glanced in the mirror and noticed that my eyes were heavily blood shot red and that I had significant facial and neck flushing. I didn't feel any different and had I not looked into the mirror, I wouldn't have known. No erection or sexual arousal. Having heard reports of severe tachycardia, I took my pulse at this point and found no change to its normal baseline.
At 720pm my girlfriend joined me and when I spoke, I noticed a slight giggling effect to my speech. I quickly achieved erection but its quality was no different from usual. At around this time I noticed only a very slight kind of 'speedy' effect. We chatted about various trivia and by about 745pm, my girlfriend commented that my eyes were returning to normal and that the blotching on my face had gone. She at this point had experienced no noticeable effect at all.

At 9pm we drank some wine and had a couple of beers and went to bed for more sex, but again without any noticeable enhancement.
By 11pm neither of us felt tired and despite having both been up since 5am that day, sleep seemed like an impossibility, so we got up and drank another bottle of wine. What we both noticed was that the alcohol had little effect and although I had drank equivalent of a bottle of red wine and 3 beers, I didnít feel intoxicated at all.
Finally at around 120am, over seven hours after consuming the yohimbe we both felt tired enough for sleep.
The following day we both felt fine with no negative effects.
I have since been drinking the yohimbe as a tea each morning, approximately one teaspoon in boiling water and allowed to cool and have noticed a definite increase in energy levels without any other noticeable psychotropic effect. All in all, despite a definite physiological effect (vaso-dilation) to the blood vessels to the eyes and face, none of the proclaimed psycho-sexual effects were experienced.
Author's
Neurology and NLP Site
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


| CONTENTS | PREV | NEXT |
A directory service provides access to diverse kinds of information about users and resources in a network environment. It uses a naming system for the purpose of identifying and organizing directory objects to represent this information. A directory object provides an association between attributes and values. Thus, a directory service enables information to be organized in a hierarchical manner to provide a mapping between human understandable names and directory objects.
A fundamental facility in any computing system is the naming service - the means by which names are associated with objects, and by which objects are found given their names. In traditional systems, the naming service is seldom a separate service. It is usually integrated with another service, such as a file system, directory service, database, desktop, mail system, spreadsheet, or calendar. For example, a file system includes a naming service for files and directories; a spreadsheet has a naming service for cells and macros.
The computing environment of an enterprise typically consists of several naming services. There are naming services that provide contexts for naming common entities in an enterprise such as organizations, physical sites, human users and computers. Naming services are also incorporated in applications offering services such as file service, mail service, printer service, and so on. From a user's perspective, there exist several natural and logical relationships between these naming services. For example, it is natural to think of naming a variety of services such as files, mail, appointment calendar, and so on, in the context of a user. It is also natural to think of a user in the context of a department, within a division of an enterprise. Meaningful names can be composed using useful arrangements of naming services reflecting these relationships.
Every name is generated by a set of syntactic rules called a naming convention. An atomic name is an indivisible component of a name, as defined by the naming convention.
A compound name represents a sequence of zero or more atomic names composed according to the naming convention.
For
example, in UNIX pathnames, atomic names are ordered from left to
right, and are delimited by slash (`/') characters. The UNIX
pathname usr/local/bin
is a compound name representing
the sequence of atomic names, usr
, local
, and bin
. In names from the Internet Domain Name
System (DNS), atomic names are ordered from right to left, and are
delimited by dot (`.') characters. Thus, the DNS name
sales.Example.COM is a compound name representing the sequence of
atomic names, COM
, Example
, and
sales
.
The association of an atomic name with an object is called a binding.
A context is an object whose state is a set of bindings with distinct atomic names. Every context has an associated naming convention. A context provides a lookup (resolution) operation that returns an object, and may provide operations such as for binding names, unbinding names, listing bound names. An atomic name in one context object can be bound to another context object of the same type, called a subcontext, giving rise to compound names.
Resolution of compound names proceeds by looking up each successive atomic component in each successive context. The reader will find a familiar model in UNIX file naming, where directories serve as contexts, and pathnames may be compound names.
A naming system is a connected set of contexts of the same type (having the same naming convention) and providing the same set of operations with identical semantics.
A namespace is the set of all names in a naming system.
A composite name is a name that spans multiple naming systems. It consists of an ordered list of zero or more components. Each component is a name from the namespace of a single naming system.
For
example, the name
example.eng:/export/home/john/.signature
is a
composite name representation made up of a host name example.eng
from a host namespace, and the file name
/export/home/john/.signature
from a UNIX file
namespace. Another example is the Internet URL
http://www.example.org/public/index.html
, which is a
composite name representation made up of the scheme-id http from
the "URL scheme-id" namespace,
www.example.org
which is the DNS name of the machine
on which the web server is running, and
public/index.html
which is a file name from a file
namespace.
Every name is interpreted relative to some context, and every naming operation is performed on a context object. A client can obtain an initial context object that provides a starting point for resolution of names.
The primary function of a naming system is to map names to objects. The objects can be of any type. A directory object is a particular type of object that is used to represent the variety of information in a computing environment. A directory object can have associated with it attributes. An attribute has an identifier and a set of values.
A directory object provides operations for creating attributes, adding, removing, and modifying attributes associated with the directory object. If we make a directory object also be a naming context, we can represent trees of directory information where the interior nodes not only behave like naming contexts but also contain attributes.
The following diagram illustrates several things.
Uniform Resource Locators (URLs) are special
composite names whose syntax are determined by the URL's
definition. Clients of JNDI can use URLs to refer to arbitrary
types of objects. For example, a client can use
nfs://nfs.example.com/export/jndi/src/README
to refer
to a file object that is being accessed using the Network File
System (NFS) protocol. Similarly, a client can perform directory
operations on a directory object in an LDAP server using the URL
ldap://ldap.example.com/cn=Emily,ou=marketing
.
To support composite names in general, JNDI defines a composite name syntax and utilities for processing composite names. This allows clients of JNDI to refer to objects using names that span multiple namespaces.
As the naming/directory service plays an increasingly important role in the computing environment, the need to provide administration and monitoring tools to help manage changes in the service also increases. For such tools and other applications, the traditional request/response style of interaction needs to be augmented with an asynchronous notification model that allows applications to register interest in changes in the service.


FOOTBALL TRIVIA
Which player has the most Premier League appearances?
Emile Heskey
Jamie Carragher
Garry Speed
Ryan Giggs
Which gaming brand are one of the sponsors of the Champions League?
Playstation
Gameboy
Xbox
Nintendo
How many times did Sir Alex Ferguson win the Premier League?
10
13
7
15
Which club is the only team to go an entire Premier League season unbeaten?
Arsenal
Chelsea
Manchester United
Liverpool
Which player scoref the first ever Premier League goal to be screened on Live Tv?
Les Ferdinand
Alan Shearer
Eric Cantona
Teddy Sheringham
In the 2012-2013, what was Eden Hazard sent off for against?
Tackling
Kicking ballboy
Attacking linesman
Headbutting
View Results
And the answers are:
Ryan Giggs
Playstation
13
Arsenal
Teddy Sheringham
Kicking ballboy
Here are the answers, loser. Start studying your football facts.
Ryan Giggs
Playstation
13
Arsenal
Teddy Sheringham
Kicking ballboy


|
数字式立体视觉刺激系统
1.0.1
Digital Stereo System
|
#include <nvapi.h>
Public 属性 | |
| NvU32 | version |
| Version of this structure. 更多... | |
| NV_MOSAIC_TOPO | topo |
| The topology. 更多... | |
| NvU32 | enabled |
| 1 if topo is enabled, else 0 更多... | |
| NvU32 | isPossible |
| 1 if topo can be enabled, else 0 更多... | |
This is a "topology brief" structure. It tells you what you need to know about a topology at a high level. A list of these is returned when you query for the supported Mosaic information.
If you need more detailed information about the topology, call NvAPI_Mosaic_GetTopoGroup() with the topology value from this structure.
| NvU32 NV_MOSAIC_TOPO_BRIEF::enabled |
1 if topo is enabled, else 0
| NvU32 NV_MOSAIC_TOPO_BRIEF::isPossible |
1 if topo can be enabled, else 0
| NV_MOSAIC_TOPO NV_MOSAIC_TOPO_BRIEF::topo |
The topology.
| NvU32 NV_MOSAIC_TOPO_BRIEF::version |
Version of this structure.


blog
resume
portfolio
contact
home
Fortune Teller
Vanilla JS web app exploring the GreenSock animation library.
Github Link.


|
BSL430.NET
1.3.4
|
Scan All Result wraps Status and List of Devices - Bsl430NetDevice childs (FTDI, Libftdi, Serial, USB). More...
Properties | |
| ScanResult< FTDI_Device > | FtdiDevices [get, set] |
| /// FTDI Scan Result - Status and List of Devices - Bsl430NetDevice childs. More... | |
| ScanResult< Libftdi_Device > | LibftdiDevices [get, set] |
| /// Libftdi Scan Result - Status and List of Devices - Bsl430NetDevice childs. More... | |
| ScanResult< USB_HID_Device > | UsbDevices [get, set] |
| /// Serial (COM) Scan Result - Status and List of Devices - Bsl430NetDevice childs. More... | |
| ScanResult< Serial_Device > | SerialDevices [get, set] |
| /// USB Scan Result - Status and List of Devices - Bsl430NetDevice childs. More... | |
Scan All Result wraps Status and List of Devices - Bsl430NetDevice childs (FTDI, Libftdi, Serial, USB).
|
getset |
/// FTDI Scan Result - Status and List of Devices - Bsl430NetDevice childs.
|
getset |
/// Libftdi Scan Result - Status and List of Devices - Bsl430NetDevice childs.
|
getset |
/// USB Scan Result - Status and List of Devices - Bsl430NetDevice childs.
|
getset |
/// Serial (COM) Scan Result - Status and List of Devices - Bsl430NetDevice childs.


Information:
This script will read the public data available throught the Google+ API and present various statistics.
A nice summary of all the features has been created by +Johnathan Chung: j.mp/gplus-allmyplus
Privacy:
None of the retrieved information is saved on the site for longer than it takes to display the data to you.
Your authentication token is only saved temporarily to allow easy access to your data.
Contact:
If you have questions/suggestions/problems or want to stay updated on changes you can contact me on Google+.
Disclaimer:
This script is still in development and may be broken at times as I change stuff...
Known API issues:
- Not all posts can be retrieved
- The API sometimes times-out for users with lots of activity (sorry Robert and Tom)
- For some people the API client throws an "invalid json in service response" error
- Number of +1's and reshares isn't returned correctly all the time
All the data presented here is public information available through the Google+™ API.
Google+ is a trademark of Google Inc. Use of this trademarks is subject to Google Permissions.
I'm not the owner of any of the data and not responsible for any offensive material you might find.
This site is not affiliated with, sponsored by, or endorsed by Google Inc.
Programming by Gerwin Sturm, FoldedSoft e.U.


state() = #ailib_url_state{array_fun = function(), url = url()}
url() = #url{scheme = binary(), authority = binary(), userinfo = binary(), host = binary(), port = binary(), path = binary(), qs = list(), fragment = list()}
| authority/1 | |
| authority/2 | |
| build/1 | |
| build_query/1 | |
| host/1 | |
| host/2 | |
| new/0 | |
| new/1 | |
| parse/1 | |
| parse_query/1 | |
| port/1 | |
| port/2 | |
| scheme/1 | |
| scheme/2 | |
| urldecode/1 | Decode a percent encoded string. |
| urlencode/1 | Percent encode a string. |
authority(Ailib_url_state::state()) -> binary()
build(Record::state()) -> binary()
build_query(L::list()) -> binary()
host(Ailib_url_state::state()) -> binary()
new() -> state()
new(ArrayFun::function()) -> state()
parse(U::binary() | list()) -> state()
parse_query(B) -> any()
port(Ailib_url_state::state()) -> binary()
scheme(Ailib_url_state::state()) -> binary()
urldecode(B) -> B
Decode a percent encoded string. (RFC3986 2.1)
urlencode(B) -> B
Percent encode a string. (RFC3986 2.1)
Generated by EDoc


Defines | |
| #define | E_OK 0 |
| #define | E_FAIL 1 |
| #define | E_NOMEM 2 |
| #define | E_ARG 3 |
| #define | E_FORB 4 |
-E_NOMEM
.
|
|
Error Code: The given argument is wrong or inacceptable. |
|
|
Error Code: The operation failed. |
|
|
Error Code: The operation is forbidden at the current operation stage. |
|
|
Error Code: The System ran out of memory. |
|
|
Error Code: No Error (the operation was successful) |


Personal Brand Assessment Questionnaire
Status: No invitations have been sent yet.
Status: This Personal Brand Assessment questionnaire is open, with a due date of {{DUEDATE}}.
The questionnaire has been sent to {{NUM_INVITEES}} colleagues for feedback, and so far, {{NUM_RESPONDEES}} have provided feedback.
You can click on the "Close Questionnaire" button at any time
(under the "Results" tab)
at which point the questionnaire will be frozen and you will be able to see the results.
Status: This Personal Brand Assessment questionnaire has passed its due date of {{DUEDATE}}.
So far, {{NUM_RESPONDEES}} out of {{NUM_INVITEES}} have provided feedback.
You can click on the "Close Questionnaire" button at any time
(under the "Results" tab)
at which point the questionnaire will be frozen and you will be able to see the results.
Until you close the questionnaire, you can still invite additional people or change the due date.
Status: This Personal Brand Assessment questionnaire has been closed. No further changes can be made.
About the Personal Brand Assessment Questionnaire
The Personal Brand Assessment questionnaire allows you to ask colleagues for feedback on your personal brand.
There are four tabs:
- About - (Current tab) Provides background information and instructions for how to set up a Personal Brand Assessment auestionnaire.
- Self-Assessment - (Optional step) Allows you to fill out the assessment form yourself so that you can compare your self image with your colleagues' feedback.
- Invitations - On this tab, you enter the names and emails of the people to whom you would like to send the questionnaire, and also enter a due date. When all entries have been provided, click "Send Invitations", which will send emails to your colleagues
with instructions on how to provide feedback.
- Results - After the due date arrives, you can click on the "Close Questionnaire" button, which appears on the Invitations and Results tabs.
After closing the questionnaire, the software
will consolidate (and partially randomize) the feedback, and you will be able to see the feedback by going to the Results tab.
Self-Assessment (optional)
Questionnaire Results (Consolidated)
No invitations have been sent yet.
The questionnaire has not been closed yet.
To close the questionnaire, click on the "Close Questionnaire" button.
{{ASSESSMENT_FORM}}


Ruby Classes
In Ruby, classes are used to encapsulate data and methods for later use. Classes are just a convenient way to describe an object by defining what properties the object has and what the object can do. In this post, I will be trying to model a real-world object by using a class in Ruby.
Let's try to model a real-world object such as a car. Before we begin
programming, we must first allocate time to understanding precisely what
a car is, what it does, and what properties it has. Start with the basic
idea and then go into further detail; a car is "a wheeled, self-powered
motor vehicle used for transprotation. Most definitions of the term specify
that cars are designed to run primarily no roads, seat 1-8 people, and
have four wheels." Ok good, now we have a slightly better idea of what
a car is.
Let's focus on its properties:
- it must have energy (or gas)
- it must have a driver and certain amount of passengers
- velocity/acceleration
- turn signals (right/left and on/off)
- license plate
- type of car
- color of the car
There are probably more properties, but we can stick with these for now. Now let's focus on the actions that a car can perform:
- The car can turn on or off
- Drive (change velocity) or stop
- Turn right or left (this also affects the signals)
- Add or remove people
We should now have enough properties and methods in order to fulfill the basic definition of a car - a vehicle that can transport people across roads.
class Car
# this method is called when a car is first created
# it MUST be called 'initialize'
# the parameters in this method are passed when the car is created
def initialize(license, type, color, maxGas)
@license = license
@type = type
@color = color
@maxGas = maxGas # in gallons
@velocity = 0
@rightSignal = false
@leftSignal = false
@people = [] # array of names of people in the car. First person is the driver
@isOn = false
@totalDistance = 0 # in miles
end
This is the first part of the class. This is the initialization method which is automatically called when you first create an instance of a class. This will give the car default values when you make one, and it will also pass down properties that you can specify when you create the car (such as the license plate #, type of car, etc).
Now we have to add the methods that allow this car to function. Generally, the methods of the car will simply affect the properties of the car.
def turnOn
@isOn = true
end
def turnOff
@isOn = false
end
# drive straight
def drive(dist, mph)
@velocity = mph # change velocity
@totalDistance += dist # add to the total distance, dont replace
@rightSignal = false
@leftSignal = false
end
def stop
@velocity = 0
end
def turnRight
@rightSignal = true
end
def turnLeft
@leftSignal = true
end
def addPeople(name)
@people << name
end
def printState
puts "Car: #{@license}"
puts "Type: #{@type}"
puts "Color: #{@color}"
puts "Car on: #{@isOn}"
puts "Current speed: #{@velocity} mph"
puts "Right signal on: #{@rightSignal}"
puts "Left signal on: #{@leftSignal}"
puts "People within: #{@people}"
puts "Total distance: #{@totalDistance} miles"
end
end
That gives us pretty much all the functionality that we require. We have enough methods to navigate on the road, add people to the car, drive, switch lanes, and enough propeties to correctly identify the car. Now let us test it.
bmw = Car.new("ABC281A", "BMW", "Blue", 10) # these parameters are for the initialize method
bmw.addPeople("Jamal")
bmw.addPeople("Bob")
bmw.addPeople("Alice")
bmw.turnOn()
bmw.turnRight() # turn right, out of the driveway, onto the road
bmw.drive(5, 25) # drive 5 miles at 25mph
bmw.printState()
If we run that chunk of code, the following is output:
- Car: ABC281
- Type: BMW
- Color: Blue
- Car on: true
- Current speed: 25 mph
- Right signal on: false
- Left signal on: false
- People within: Jamal, Bob, Alice
- Total distance: 5 miles
And that is what we expected too! And of course, we can add more complexity to the class and make it more realistic (for example, you can print an error if you try to drive when the car is off). However, this should give you a good idea about how to create a class and give it the desired functionality. Always start with an idea, detail / psuedocode what you want it to do, and then program it step by step. Test it thoroughly to ensure you get the results you want -- you wouldn't want a fancy-looking, $20,000 car that doesn't turn on, would you?