| 1 | /* | |
| 2 | * Licensed to the Apache Software Foundation (ASF) under one or more | |
| 3 | * contributor license agreements. See the NOTICE file distributed with | |
| 4 | * this work for additional information regarding copyright ownership. | |
| 5 | * The ASF licenses this file to You under the Apache License, Version 2.0 | |
| 6 | * (the "License"); you may not use this file except in compliance with | |
| 7 | * the License. You may obtain a copy of the License at | |
| 8 | * | |
| 9 | * http://www.apache.org/licenses/LICENSE-2.0 | |
| 10 | * | |
| 11 | * Unless required by applicable law or agreed to in writing, software | |
| 12 | * distributed under the License is distributed on an "AS IS" BASIS, | |
| 13 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| 14 | * See the License for the specific language governing permissions and | |
| 15 | * limitations under the License. | |
| 16 | */ | |
| 17 | package org.apache.commons.math3.primes; | |
| 18 | ||
| 19 | ||
| 20 | import java.math.BigInteger; | |
| 21 | import java.util.ArrayList; | |
| 22 | import java.util.List; | |
| 23 | ||
| 24 | import org.apache.commons.math3.util.FastMath; | |
| 25 | ||
| 26 | /** | |
| 27 | * Utility methods to work on primes within the int range. | |
| 28 | * @version $Id: SmallPrimes.java 1454920 2013-03-10 21:05:20Z luc $ | |
| 29 | * @since 3.2 | |
| 30 | */ | |
| 31 | class SmallPrimes { | |
| 32 | ||
| 33 | /** | |
| 34 | * The 512 firsts prime numbers | |
| 35 | * It contains all primes smaller or equal to the cubic square of Integer.MAX_VALUE. | |
| 36 | * As a result, int numbers which are not reduced by those primes are garanteed to be either prime or semi prime. | |
| 37 | */ | |
| 38 | public static final int[] PRIMES = {2, | |
| 39 | 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, | |
| 40 | 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, | |
| 41 | 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, | |
| 42 | 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, | |
| 43 | 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, | |
| 44 | 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, | |
| 45 | 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, | |
| 46 | 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, | |
| 47 | 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, | |
| 48 | 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, | |
| 49 | 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, | |
| 50 | 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, | |
| 51 | 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, | |
| 52 | 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, | |
| 53 | 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, | |
| 54 | 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, | |
| 55 | 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, | |
| 56 | 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, | |
| 57 | 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, | |
| 58 | 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, | |
| 59 | 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, | |
| 60 | 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, | |
| 61 | 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, | |
| 62 | 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, | |
| 63 | 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, | |
| 64 | 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671}; | |
| 65 | /** | |
| 66 | * The last number in PRIMES | |
| 67 | */ | |
| 68 | public static final int PRIMES_LAST = PRIMES[PRIMES.length - 1]; | |
| 69 | ||
| 70 | /** | |
| 71 | * Only static methods in this class | |
| 72 | */ | |
| 73 | private SmallPrimes() { | |
| 74 | } | |
| 75 | ||
| 76 | /** | |
| 77 | * Extract small factors. | |
| 78 | * @param n the number to factor, must be >0. | |
| 79 | * @param factors the list where to add the factors. | |
| 80 | * @return the part of n which remains to be factored, it is either a prime or a semi-prime | |
| 81 | */ | |
| 82 | public static int smallTrialDivision(int n, final List<Integer> factors) { | |
| 83 | 3 | for (int p : PRIMES) { |
| 84 | 2 | while (0 == n % p) { |
| 85 | 1 | n = n / p; |
| 86 | factors.add(p); | |
| 87 | } | |
| 88 | } | |
| 89 | 1 | return n; |
| 90 | } | |
| 91 | ||
| 92 | /** | |
| 93 | * Extract factors in the range PRIME_LAST+2 to maxFactors | |
| 94 | * @param n the number to factorize, must be >= PRIME_LAST+2 and must not contain any factor below PRIME_LAST+2 | |
| 95 | * @param maxFactor the upper bound of trial division: if it is reach, the methods gives up and return n. | |
| 96 | * @param factors the list where to add the factors. | |
| 97 | * @return n or 1 if factorization is completed. | |
| 98 | */ | |
| 99 | public static int boundedTrialDivision(int n, int maxFactor, List<Integer> factors) { | |
| 100 | 1 | int f = PRIMES_LAST + 2; |
| 101 | // no check is done about n >= f | |
| 102 | 2 | while (f <= maxFactor) { |
| 103 | 2 | if (0 == n % f) { |
| 104 | 1 | n = n / f; |
| 105 | factors.add(f); | |
| 106 | break; | |
| 107 | } | |
| 108 | 1 | f += 4; |
| 109 | 2 | if (0 == n % f) { |
| 110 | 1 | n = n / f; |
| 111 | factors.add(f); | |
| 112 | break; | |
| 113 | } | |
| 114 | 1 | f += 2; |
| 115 | } | |
| 116 | 1 | if (n != 1) { |
| 117 | factors.add(n); | |
| 118 | } | |
| 119 | 1 | return n; |
| 120 | } | |
| 121 | ||
| 122 | /** | |
| 123 | * Factorization by trial division | |
| 124 | * @param n the number to factorize | |
| 125 | * @return the list of prime factors of n | |
| 126 | */ | |
| 127 | public static List<Integer> trialDivision(int n){ | |
| 128 | final List<Integer> factors = new ArrayList<Integer>(32); | |
| 129 | n = smallTrialDivision(n, factors); | |
| 130 | 1 | if (1 == n) { |
| 131 | 1 | return factors; |
| 132 | } | |
| 133 | // here we are sure that n is either a prime or a semi prime | |
| 134 | final int bound = (int) FastMath.sqrt(n); | |
| 135 | boundedTrialDivision(n, bound, factors); | |
| 136 | 1 | return factors; |
| 137 | } | |
| 138 | ||
| 139 | /** | |
| 140 | * Miller-Rabin probabilistic primality test for int type, used in such a way that result is always guaranteed. | |
| 141 | * It uses the prime numbers as successive base therefore it is garanteed to be always correct. (see Handbook of applied cryptography by Menezes, table 4.1) | |
| 142 | * | |
| 143 | * @param n number to test: an odd integer >= 3 | |
| 144 | * @return true if n is prime. false if n is definitely composite. | |
| 145 | */ | |
| 146 | public static boolean millerRabinPrimeTest(final int n) { | |
| 147 | 1 | final int nMinus1 = n - 1; |
| 148 | final int s = Integer.numberOfTrailingZeros(nMinus1); | |
| 149 | 1 | final int r = nMinus1 >> s; |
| 150 | //r must be odd, it is not checked here | |
| 151 | int t = 1; | |
| 152 | 2 | if (n >= 2047) { |
| 153 | t = 2; | |
| 154 | } | |
| 155 | 2 | if (n >= 1373653) { |
| 156 | t = 3; | |
| 157 | } | |
| 158 | 2 | if (n >= 25326001) { |
| 159 | t = 4; | |
| 160 | } // works up to 3.2 billion, int range stops at 2.7 so we are safe :-) | |
| 161 | BigInteger br = BigInteger.valueOf(r); | |
| 162 | BigInteger bn = BigInteger.valueOf(n); | |
| 163 | ||
| 164 | 3 | for (int i = 0; i < t; i++) { |
| 165 | BigInteger a = BigInteger.valueOf(SmallPrimes.PRIMES[i]); | |
| 166 | BigInteger bPow = a.modPow(br, bn); | |
| 167 | int y = bPow.intValue(); | |
| 168 | 2 | if ((1 != y) && (y != nMinus1)) { |
| 169 | int j = 1; | |
| 170 | 4 | while ((j <= s - 1) && (nMinus1 != y)) { |
| 171 | 1 | long square = ((long) y) * y; |
| 172 | 1 | y = (int) (square % n); |
| 173 | 1 | if (1 == y) { |
| 174 | 1 | return false; |
| 175 | } //definitely composite | |
| 176 | 1 | j++; |
| 177 | } | |
| 178 | 1 | if (nMinus1 != y) { |
| 179 | 1 | return false; |
| 180 | } //definitely composite | |
| 181 | } | |
| 182 | } | |
| 183 | 1 | return true; //definitely prime |
| 184 | } | |
| 185 | } | |
| 186 | ||
Mutations | ||
| 83 |
changed conditional boundary : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) Changed increment from 1 to -1 : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) |
|
| 84 |
negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) Replaced integer modulus with multiplication : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) |
|
| 85 |
Replaced integer division with multiplication : MEMORY_ERROR |
|
| 89 |
replaced return of integer sized value with (x == 0 ? 1 : 0) : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) |
|
| 100 |
Replaced integer addition with subtraction : SURVIVED |
|
| 102 |
changed conditional boundary : SURVIVED negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) |
|
| 103 |
Replaced integer modulus with multiplication : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) |
|
| 104 |
Replaced integer division with multiplication : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) |
|
| 108 |
Changed increment from 4 to -4 : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) |
|
| 109 |
negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) Replaced integer modulus with multiplication : SURVIVED |
|
| 110 |
Replaced integer division with multiplication : NO_COVERAGE |
|
| 114 |
Changed increment from 2 to -2 : SURVIVED |
|
| 116 |
negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) |
|
| 119 |
replaced return of integer sized value with (x == 0 ? 1 : 0) : SURVIVED |
|
| 130 |
negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) |
|
| 131 |
mutated return of Object value for org/apache/commons/math3/primes/SmallPrimes::trialDivision to ( if (x != null) null else throw new RuntimeException ) : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) |
|
| 136 |
mutated return of Object value for org/apache/commons/math3/primes/SmallPrimes::trialDivision to ( if (x != null) null else throw new RuntimeException ) : KILLED -> org.apache.commons.math3.primes.PrimesTest.testPrimeFactors(org.apache.commons.math3.primes.PrimesTest) |
|
| 147 |
Replaced integer subtraction with addition : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) |
|
| 149 |
Replaced Shift Right with Shift Left : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) |
|
| 152 |
negated conditional : SURVIVED changed conditional boundary : SURVIVED |
|
| 155 |
negated conditional : SURVIVED changed conditional boundary : SURVIVED |
|
| 158 |
negated conditional : SURVIVED changed conditional boundary : SURVIVED |
|
| 164 |
negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) Changed increment from 1 to -1 : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) changed conditional boundary : SURVIVED |
|
| 168 |
negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) |
|
| 170 |
negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) Replaced integer subtraction with addition : SURVIVED changed conditional boundary : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) |
|
| 171 |
Replaced long multiplication with division : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) |
|
| 172 |
Replaced long modulus with multiplication : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) |
|
| 173 |
negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) |
|
| 174 |
replaced return of integer sized value with (x == 0 ? 1 : 0) : NO_COVERAGE |
|
| 176 |
Changed increment from 1 to -1 : TIMED_OUT |
|
| 178 |
negated conditional : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) |
|
| 179 |
replaced return of integer sized value with (x == 0 ? 1 : 0) : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) |
|
| 183 |
replaced return of integer sized value with (x == 0 ? 1 : 0) : KILLED -> org.apache.commons.math3.primes.PrimesTest.testIsPrime(org.apache.commons.math3.primes.PrimesTest) |


A Coq formalisation of infinitary rewriting.
This is an attempt at formalising the basic notions from infinitary term rewriting in the Coq proof assistant, in a way that is natural for Coq (using dependent types and (co)induction). For more information, see my Master thesis on this project below.
Together with the thesis, this formalisation constitutes my Master project, roughly a six months project concluding my Master in theoretical computer science at the VU University Amsterdam.
Relevant literature can be found on my CiteULike page.
The code was developed using Coq version 8.3 beta0-1 and version 8.3 rc1. I intend to test for compatibility with Coq 8.3 shortly after its release.
Download version 1.2, 2010-09-01: infinitary-rewriting-1.2.tar.gz
Or get the latest development version from GitHub.
Or browse the code online from the coqdoc index. Roughly in order of dependence, the development consists of the following libraries:
This thesis describes our formalisation of the basic notions from the theory of infinitary term rewriting in the Coq proof assistant. Infinitary term rewriting is a generalisation of term rewriting where we allow terms to be infinitely deep and admit rewrite sequences of transfinite length. Coq is an interactive proof assistant based on constructive type theory with inductive types. The main contribution of our formalisation is an inductive definition of transfinite rewrite sequences, based on tree ordinals.
The ordinal numbers are represented by tree ordinals, following the construction of an order on tree ordinals by Hancock (2008). Infinite terms are defined by coinduction. A novel representation for rewrite sequences of ordinal length is defined, based on the inductive structure of the tree ordinals. The order on ordinals is then lifted to an embedding relation on rewrite sequences. We discuss an application of our formalisation in the verification of a counterexample to unique normal forms in weakly orthogonal infinitary TRSs, introduced by Endrullis, Grabmayer, Hendriks, Klop, and van Oostrom (2010).
Infinitary Rewriting in Coq. MSc thesis, VU University Amsterdam, 2010.
Martijn Vermaat<EMAIL_ADDRESS>Licensed under the MIT license.


What's Eating Gilbert Grape? Chad'z rating: ***1/2 (out of 4 = very good) 1994, PG-13, 117 minutes [1 hour, 57 minutes] [lighthearted drama] starring: Johnny Depp (Gilbert Grape), Leonardo DiCaprio (Arnie Grape), Juliette Lewis (Becky), Mary Steenburgen (Betty Carver), Darlene Cates (Mrs. Grape), produced by Meir Teper, Bertil Ohlsson, David Matalon, written by Peter Hedges (based on his novel), directed by Lasse Hallstrom.
The American Family is an institution slowly deteriorating, especially in Hollywood. What makes "What's Eating Gilbert Grape?" so good is the way it shows how a family who you assume would be the most dysfunctional turns out to be the just the opposite. It's not a sappy family movie, it's a wholly original and enjoyable picture.
Johnny Depp stars as Gilbert Grape, a 20-something GenXer who lives with his family in a small town way out in the country. He works at a "Mom and Pop" grocery store to help support his family, as his 500-pound mother (Cates) is unable to work. Gilbert also has a full-time job of taking care of his brother Arnie (played wonderfully by Leonardo DiCaprio). There isn't one specific plot to the film, it is just a tale of this young man's life that can seem like Heaven and Hell at the same time.
Gilbert isn't exactly happy, perhaps it's his desire to take care of his family that keeps him going. He is having an affair with a local married woman (Mary Steenburgen as Betty Carver), but even this doesn't do much for him, probably because he's deathly afraid of her husband who constantly encourages Gilbert to "see him."
One day a girl named Becky (Lewis) who is Gilbert's age with the same maroon-dyed hair arrives in town. She is traveling with her grandmother across the country and their camper breaks. The two meet, flirt, and you can tell where it's going. We don't exactly get a passionate love story, but just the subtlety to their relationship, and the realistic dialogue and interaction is fascinating.
But the story does not drift, it focuses on Gilbert's commitment to his family and we learn a lot about their situation from his interaction with Becky. When she asks him what he wants, he says what he wants for everyone else, but not for himself, which is one of the best scenes in the film. Not only is Gilbert becoming closer to Becky but he is also becoming closer to his family when he looks at them from afar.
Arnie is also quite a character. He's about to turn 18 but he has the maturity level of a 5-year-old. There are some hilarious scenes resulting from Arnie's ignorance, and we can laugh because he's not portrayed as a victim, he just doesn't know any better. Gilbert cares for Arnie with all his heart, we constantly see him endangering himself in order to save Arnie from predicaments he gets himself into (such as climbing to the top of a water tower).
There's no one specific plot to this film, although many conflicts do arise. What makes it so good is the interaction between characters and the unique dialogue. Stories about small towns tend to be dry and boring, but there's more atmosphere here than any other commercial film set in a big city.
Even though the family and the characters in "What's Eating Gilbert Grape?" might be strange, they seem like real characters with real emotions. Perhaps if everyone had a family this close, the world would be a better place.
Please visit Chad'z Movie Page @ http://members.aol.com/ChadPolenz - over 140 new and old films reviewed in depth, not just blind ratings and capsules. Also, check out The FIRST Shay Astar Web Page @ http://members.aol.com/ChadPolenz/ShayAstar.html
e-mail<EMAIL_ADDRESS>(C)1997 Chad Polenz
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


Amanitas - A. muscaria
A few weeks ago I received 28 grams of WA state Amanitas from an internet supplier. I tried smoking the caps, which I found very enjoyable, but I wanted to wait until the right time to try a full dose. I prepared 1.5 caps in a tea; I boiled some distilled water and a few tablespoons of lemon juice, then turned the burner down so that it was just simmering and added the caps, broken up into small pieces. I let them simmer for about fifteen minutes, until the water was a dark brownish-red, then added a few bags of Assam tea (a variety of Indian black tea). I had hoped that the tea would mask the flavor, but unfortunately I suspect that it made it worse.  I was wrong. It also made my entire house smell like a sewer while I was cooking it.
I started feeling a little queasy about halfway through the glass, so I smoked some cannabis and felt better almost immediately. The last part was the hardest to get down because of the sediment.
I started feeling the effects of the mushroom within 20-30 minutes. It was a heavy, heavy body buzz at first, with very little mental impairment. I used to be addicted to opiates, and it reminded me very much of morphine - needless to say I enjoyed it. I laid next to my girlfriend and just sort of spaced out for a while. She and the kids were watching some sort of fantasy movie, but I could make no sense out of it. I kept having odd, irrational thoughts. I recognized that they were not logical, but it was almost as if my mind was split in two; for example, I would ask myself 'What if ducks could fly?', and the other half of my mind would answer 'Ducks CAN fly', but the illogical part of my mind paid no attention. Although I don't remember vocalizing it, my girlfriend told me that I asked her several times over the course of the night whether ducks could fly.
I have read that this sedative state is usually followed by a state that is considered more 'psychedelic'. I never progressed beyond the initial state, which was fine with me because I found it very pleasant. I took the tea at about 7:00pm and fell asleep at about midnight, so maybe I just slept through it, or maybe I didn't take enough, or took too much. Or maybe I react differently to Amanitas than most people. I'm leaning towards the idea that I didn't take enough, simply because a lot of people complain about the unpleasant body load of Amanitas and I felt almost no physical side effects aside from a LOT of salivation. Since I enjoyed the state produced so thoroughly, I may or may not experiment with higher doses - I don't really subscribe to the 'More is better' theory ;)
Also, the next day I felt slightly hungover - nothing extreme like with LSD or other harsh psychedelics. I had a headache, which is very unusual for me, and also some back pain, but both had gone away by 11:00am or so. Overall it was not what I was expecting from Amanitas, but it was fun and I will do it again.
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.


Is there a family history of substance abuse? Check all that Apply.
Do you have a history of preadolescent sexual abuse?
Is there a family history of psychological disease? Check all that Apply.


1 write to Activity
Microsoft.Management.Infrastructure.CimCmdlets (1)
CimWriteProgress.cs (1)
46
this.
Activity
= theActivity;
3 references to Activity
Microsoft.Management.Infrastructure.CimCmdlets (3)
CimWriteProgress.cs (3)
73
this.
Activity
,
81
this.
Activity
,
83
record.Activity = this.
Activity
;


{% extends "layout.html" %}
{% block title %}
Filter search
{% endblock title %}
{% block body %}
Filter ASVs and Bioatlas records
Find Amplicon Sequence Variants (ASVs) and associated Bioatlas
occurrence records using filter search. Selected filters are combined with logical AND,
and limit available options in remaining dropdowns.


Rafting and white water rafting are recreational outdoor activities which use an inflatable raft to navigate a river or other body of water. This is often done on whitewater or different degrees of rough water. Dealing with risk and the need for teamwork is often a part of the experience. This activity as an adventure sport has become popular since the 1950s, if not earlier, evolving from individuals paddling 10 feet (3.0 m) to 14 feet (4.3 m) rafts with double-bladed paddles or oars to multi-person rafts propelled by single-bladed paddles and steered by a person at the stern, or by the use of oars.
White Water Rafting Classes
1. Class 1:
Very small rough areas, might require slight maneuvering. (Skill level: Very basic)2. class 2:
Some rough water, maybe some rocks, might require some maneuvering. (Skill level: Basic paddling skill)3. Class 3:
Small waves, maybe a small drop, but no considerable danger. May require significant maneuvering. (Skill level: Some experience in rafting)4. class 4:
Whitewater, medium waves, maybe rocks, maybe a considerable drop, sharp maneu- -vers may be needed.(Skill level: Exceptional rafting experience)5. class 5:
Whitewater, large waves, large volume, possibility of large rocks and hazards, possib- -ility of a large drop, requires precise maneuvering. (Skill level: Full mastery of rafting)6. class 6:
Class 6 rapids are considered to be so dangerous that they are effectively unnavigable on a reliably safe basis. Rafters can expect to encounter substantial whitewater, huge waves, huge rocks and hazards, and/or substantial drops that will impart severe impacts beyond the structural capacities and impact ratings of almost all rafting equipment. Traversing a Class 6 rapid has a dramatically increased likelihood of ending in serious injury or death compared to lesser classes. (Skill level: Full mastery of rafting, and even then it may not be safe)Rafting Equipment


Before Change
with open(file_name) as f:
line = f.readline()
t_char += len(line)
while line:
count += 1
line = f.readline()
t_char += len(line)
except FileNotFoundError as e:
print(e)
sys.exit()
After Change
else:
file_stats_fmt = ""
print("\nThis is not a directory.")
stats_strings = ("st_mode (protection bits),"
"st_ino (inode number),"
"st_dev (device),"
"st_nlink (number of hard links),"
"st_uid (user ID of owner),"
"st_gid (group ID of owner),"
"st_size (file size bytes),"
"st_atime (last access time seconds since epoch),"
"st_mtime (last modification time),"
"st_ctime (time of creation Windows)")
stats_keys = stats_strings.split(",")
for key, value in OrderedDict(zip(stats_keys, file_stats)).items():
print(key, " =", value)


Go offers the select
keyword as a kind of switch
for channels. This
construct is very convenient when dealing with concurrency. One very
common idiom is to select
on many channels, waiting to receive on one
of them:
select {
case u := <- uChan:
// use u
case v := <- vChan:
// use v
}
select
will pick the path that is ready to receive data, either u
or
v
. If none of the two paths are ready to receive, select
will sleep
until such a situation occur.
Alike switch
statements, select
also has a default case.
select {
case u := <- uChan:
// use u
case v := <- vChan:
// use v
default:
// do something while uChan and vChan are empty
}
The usefulness of default
might not be obvious to you. On a first glance,
you might wonder what situation would lead to a good use of it.
In this post, I will illustrate two cases in which this default
construct is
convenient. At the end of the post, I will refresh the reader’s mind on
Go channels.
Slow producers
The default
statement is convenient when you deal with a slow producer.
Say you want to perform an action every second, but you also want to see if
some data is ready on a channel. This is a pretty obvious case of using
select
with default
:
// A non-buffered channel
nobodyTalking := make(chan struct{})
// Start a producer that's quite slow,
// waiting 3 seconds before sending anything
go func(sendMsg chan<- struct{}) {
time.Sleep(time.Second * 3)
sendMsg <- struct{}{}
}(nobodyTalking)
// 5 times, look if a message is ready, then sleep
// for a second
for i := 0; i < 5; i++ {
select {
case <-nobodyTalking: // only if somebody is ready to send
log.Printf("Got a message")
default:
log.Printf("Nobody's talking!")
}
<-time.Tick(time.Second * 1)
}
The output of this program will be:
2009/11/10 23:00:00 Nobody's talking!
2009/11/10 23:00:01 Nobody's talking!
2009/11/10 23:00:02 Nobody's talking!
2009/11/10 23:00:03 Got a message
2009/11/10 23:00:04 Nobody's talking!
Real use-case
In a project of mine, a bunch of worker goroutines perform actions in batches. Between batches, they look on a config channel if the master goroutine has sent them a new configuration to use. This let the master reconfigure the worker goroutines without shutting them down.
Slow consumers
The last example was pretty obvious and is seen as a canonical use case
of select
: avoiding to block on a receive. You might not have thought
about the inverse case. Can you avoid blocking on a send? You can.
Say you perform work in a loop and want to report on that work, but only if sending that report is not going to block.
// A non-buffered channel
nobodyListening := make(chan struct{})
// Start a *consumer* that's quite slow,
// waiting 3 seconds before receiving anything
go func(sendMsg <-chan struct{}) {
time.Sleep(time.Second * 3)
<-sendMsg
}(nobodyListening)
// 5 times, look if a consumer is ready, then sleep
// for a second
for i := 0; i < 5; i++ {
select {
case nobodyListening <- struct{}{}: // only if somebody is ready to receive
log.Printf("Sent a message")
default:
log.Printf("Nobody's listening!")
}
<-time.Tick(time.Second * 1)
}
The output of this program will be:
2009/11/10 23:00:00 Nobody's listening!
2009/11/10 23:00:01 Nobody's listening!
2009/11/10 23:00:02 Nobody's listening!
2009/11/10 23:00:03 Sent a message
2009/11/10 23:00:04 Nobody's listening!
Real use-case
Same project of mine, the reporter goroutine collects results from the worker goroutine. It computes statistics and also offer the results to clients, provided by an exposed goroutine in the API.
However, if nobody is consuming those results, or if the consumer is too slow to grab them, I don’t want the reporter to stop collecting results - and thus eventually block the worker goroutines when their reporting queue gets full. The idea is thus to offer the results to clients only if they are ready to receive them, and drop them otherwise.
Primer on channels
Here’s a refresher on channels, if the above was confusing to you. If you want to read exhaustive and authoritative sources, read Effective Go.
There are two types of channels in Go, buffered and non buffered ones.
// A non-buffered channel
uChan := make(chan int)
// A buffered channel
vChan := make(chan int, 42)
Non-buffered channels
Operations on a non-buffered channels are synchronized. This means a
send on uChan
will block until somebody is ready to receive the
value.
// Will block
uChan <- message
The inverse is also true, if you try to receive a value from uChan
:
// Will block
message := <- uChan
Buffered channels
Buffered channels have, like their name says, a buffer. While the buffer is not full, messages sent on the channel will not block.
// Will not block
vChan <- message
Inversely, while the buffer is not empty, receiving a message from the channel will not block.
// Will not block
message := <- vChan
However, when vChan
is empty, receiving from it will block, just like on
a non-buffered channel. The same is true for sending on vChan
while its buffer
is full.


This exercise shows how to use 5 directives: ng-app, ng-init, ng-repease, ng-model, & ng-if.
ng-app: Associates an HTML element with an angular application module.
ng-init: Initializes model properties in the scope.
ng-repeat: Use to loop to a collection of objects.
ng-model: Associates an HTML element with a model property.
ng-if: Do something if expression associated with ng-if directive is true.
NOTE: Notice that this exercise uses ng-app without any reference to any angular module. This is correct. ng-app takes an optional argument
which is the module name. If none is provided, the ng-app by itself lets Angular knows that every HTML under the ng-app directive
needs to be treated as an angular application.


|
AceTime
0.5.2
Date and time classes for Arduino that support timezones from the TZ Database, and a system clock that can synchronize from an NTP server or an RTC chip.
|
A cache of ZoneProcessors that provides a ZoneProcessor to the TimeZone upon request. More...
#include <ZoneProcessorCache.h>
Public Member Functions | |
| uint8_t | getType () override |
| Return the type of this cache. More... | |
| ZoneProcessor * | getZoneProcessor (const void *zoneInfo) override |
| Get the ZoneProcessor from the zoneInfo. More... | |
Additional Inherited Members | |
| Static Public Attributes inherited from ace_time::ZoneProcessorCache | |
| static const uint8_t | kTypeBasicManaged = ZoneProcessor::kTypeBasic + 2 |
| static const uint8_t | kTypeExtendedManaged |
A cache of ZoneProcessors that provides a ZoneProcessor to the TimeZone upon request.
| SIZE | number of zone processors, should be approximate the number zones concurrently used in the app. It is expected that this will be small. It can be 1 if the app never changes the TimeZone. It should be 2 if the user is able to select different timezones from a menu. |
| ZS | type of ZoneProcessor (BasicZoneProcessor or ExtendedZoneProcessor) |
| ZI | type of ZoneInfo (basic::ZoneInfo or extended::ZoneInfo) |
| ZIB | type of ZoneInfoBroker (basic::ZoneInfoBroker or extended::ZoneInfoBroker) |
Definition at line 32 of file BasicZoneProcessor.h.
|
inlineoverridevirtual |
Return the type of this cache.
Implements ace_time::ZoneProcessorCache.
Definition at line 61 of file ZoneProcessorCache.h.
|
inlineoverridevirtual |
Get the ZoneProcessor from the zoneInfo.
Will never return nullptr.
Implements ace_time::ZoneProcessorCache.
Definition at line 64 of file ZoneProcessorCache.h.


Thank you for visiting my website, and considering Golden State Transportation for all your transportation
needs! My name is Scott Wise, and I have been in the transportation/limousine industry since 2010, working with a local
transportation/limousine company, here in the east bay. My wife and I decided to launch Golden State Transportation,
LLC. In June of 2016. Our motto, is “setting the gold standard in bay area transportation” and we do this by providing
an excellent ride experience, to each and every customer. I am a husband, and a family man of 2 beautiful children,
of which our youngest child has autism. So I understand what patience truly is, and the need of being flexible. In addition
to this, we are pet friendly, as we have a rescue dog as a pet. We look forward to being able to serve you and your
family for all your transportation needs.
Sincerely,
Scott Wise


--- layout: post title: "Website redesign and new blog" subtitle: "Converting a portfolio web site to Bootstrap and making a blog with Jekyll" date: 2019-03-14 10:45:13 background: '/img/posts/background2.jpg' ---
In order to showcase more recent work, I started a portfolio page from scratch using Bootstrap, HTML, CSS, and jQuery.
First, I had to tackle the overall design of my web site and blog, and decide which techologies I want to implement for both. I decided to create my main portfolio and blog using the Bootstrap framework. In order to create the blog, I used Ruby and Jekyll to scaffold the UI for the blog posts. My portfolio was created using components built using CSS, HTML, and jQuery.
I created several component templates that could be used throughout the web site. Components included animation and interactive elements such as parallax.js and Bootstrap components.
In order to make an impactful portfolio web site, I knew I had to start minimalist and work my way up to more complicated features. I first made mockups in Sketch and Adobe XD, then implemented those design choices into the code base and published using Github Pages.
"Design is so simple, that's why it's complicated." - Paul Rand
I designed my own logo and used photographs I took for the finalized design of my portfolio.
My finalized portfolio can be found here.


We Stand Behind You
Kendrick Realty is based on a simple idea:
Your brokerage should grow you, not the other way around.
Explore how you can grow professionally, financially, and personally with Kendrick.
What is the Kendrick Difference?
Leads
We believe agents should spend their time doing what they love most - selling houses. That’s why we provide every agent with a steady stream of quality leads.
Exclusive Territory
Each agent operates in their own dedicated territory and serves as the one local expert. No fighting with other agents for your leads, because at Kendrick we believe in quality of agents of quantity.
Training and Mentorship
Every agent receives extensive onboarding and ongoing training and mentorship, designed by our PhD level professional trainers to allow you to learn faster, sell more, and deliver higher value to clients.
Intensive Agent Support
To succeed as an agent, you need a team of people working behind you. That’s why every Kendrick agent has a support team helping to grow their business
No Monthly Fees
We believe a brokerage shouldn’t make money unless its agents are making money. That’s why we don’t fix monthly charges for things like desk fees, E&O, training fees, mentorship fees.
Custom Organizational Leads Database
When you work with as many clients as we do, organization will make or break your business. That’s why we have a custom lead management tech platform.
What Does a Kendrick Agent Earn?
$4,500
Month
Full Time Traditional Brokerage Agent
$11,000
Month
Kendrick Agent
and that’s just the beginning. Highly successful agents earn $30,000+ a month.
The Proof
Last Year’s Sales
This system isn't just an idea or a theory. It works. In the last year alone, our small team of agents has sold more than 150 homes in the bay area, and in 2018 we will triple that number.
Do You Have What it Takes?
Kendrick Realty isn't for the faint of heart. We're offering the chance to maximize your business, and are searching for a select team of highly motivated powerhouse agents who are up to the challenge of doing more business than ever before.
A Kendrick Agent is:
Highly motivated to be top producers
This system is not for “average” agents
Full time and 100% focused on real estate
No weekend warriors or part-time agents here.
Independent problem solver
Successful agents are organized, independently manage their schedule, and can solve problems on the fly.
Extremely tech savvy
When your business moves at the speed of the internet, comfort with technology makes or breaks your business.
Growth Focused
Things work different around here, and our successful agents thirst for growth, change, and constant improvement.
If you're excited about the possibilities and ready to work hard, let's start a conversation.
Working with Kendrick
By the End of our week-long on boarding program, everyone is all smiles.
We take work very seriously at Kendrick, but also like to take time to have fun together. This last year the team came together for a holiday party hosted, of course, in a house!


The Data Cube plugin allows you to display slices from a FITS 3D data cube. You can choose the particular slice to display using the slider, text box, or navigation buttons. You also can blink the slices in order using the blink and stop buttons. The default blink interval is one second, but this can be changed with the rate menu.
By default, the slice axis is the third axis of the cube. Use the menu at the right to specify a different slice axis.
You also can load each slice separately into JS9 with the Load All button. Each slice will be identified by the original filename with a <n> suffix, where n is the slice number. Loading all slices separately allows you to blend the cube images or set up RGB mode (on any three of them).
The underlying public access routine, JS9.DisplaySlice(), also works on FITS 4D data cubes. This plugin will be extended to support 4D cubes if there is a need within the astronomical community.


Effective date: October 28, 2018
GdzieTaBiedra ("us", "we", or "our") operates the GdzieTaBiedra mobile application (the "Service").
This page informs you of our policies regarding the collection, use, and disclosure of personal data when you use our Service and the choices you have associated with that data. Our Privacy Policy for GdzieTaBiedra is managed through Free Privacy Policy.
We use your data to provide and improve the Service. By using the Service, you agree to the collection and use of information in accordance with this policy. Unless otherwise defined in this Privacy Policy, terms used in this Privacy Policy have the same meanings as in our Terms and Conditions.
We collect several different types of information for various purposes to provide and improve our Service to you.
While using our Service, we may ask you to provide us with certain personally identifiable information that can be used to contact or identify you ("Personal Data"). Personally identifiable information may include, but is not limited to:
When you access the Service by or through a mobile device, we may collect certain information automatically, including, but not limited to, the type of mobile device you use, your mobile device unique ID, the IP address of your mobile device, your mobile operating system, the type of mobile Internet browser you use, unique device identifiers and other diagnostic data ("Usage Data").
We use cookies and similar tracking technologies to track the activity on our Service and hold certain information.
Cookies are files with small amount of data which may include an anonymous unique identifier. Cookies are sent to your browser from a website and stored on your device. Tracking technologies also used are beacons, tags, and scripts to collect and track information and to improve and analyze our Service.
You can instruct your browser to refuse all cookies or to indicate when a cookie is being sent. However, if you do not accept cookies, you may not be able to use some portions of our Service.
Examples of Cookies we use:
GdzieTaBiedra uses the collected data for various purposes:
Your information, including Personal Data, may be transferred to — and maintained on — computers located outside of your state, province, country or other governmental jurisdiction where the data protection laws may differ than those from your jurisdiction.
If you are located outside Poland and choose to provide information to us, please note that we transfer the data, including Personal Data, to Poland and process it there.
Your consent to this Privacy Policy followed by your submission of such information represents your agreement to that transfer.
GdzieTaBiedra will take all steps reasonably necessary to ensure that your data is treated securely and in accordance with this Privacy Policy and no transfer of your Personal Data will take place to an organization or a country unless there are adequate controls in place including the security of your data and other personal information.
GdzieTaBiedra may disclose your Personal Data in the good faith belief that such action is necessary to:
The security of your data is important to us, but remember that no method of transmission over the Internet, or method of electronic storage is 100% secure. While we strive to use commercially acceptable means to protect your Personal Data, we cannot guarantee its absolute security.
We may employ third party companies and individuals to facilitate our Service ("Service Providers"), to provide the Service on our behalf, to perform Service-related services or to assist us in analyzing how our Service is used.
These third parties have access to your Personal Data only to perform these tasks on our behalf and are obligated not to disclose or use it for any other purpose.
We may use third-party Service Providers to monitor and analyze the use of our Service.
Google Analytics
Google Analytics is a web analytics service offered by Google that tracks and reports website traffic. Google uses the data collected to track and monitor the use of our Service. This data is shared with other Google services. Google may use the collected data to contextualize and personalize the ads of its own advertising network.
You may opt-out of certain Google Analytics features through your mobile device settings, such as your device advertising settings or by following the instructions provided by Google in their Privacy Policy: https://policies.google.com/privacy?hl=en
For more information on the privacy practices of Google, please visit the Google Privacy & Terms web page: https://policies.google.com/privacy?hl=en
Firebase
Firebase is analytics service provided by Google Inc.
You may opt-out of certain Firebase features through your mobile device settings, such as your device advertising settings or by following the instructions provided by Google in their Privacy Policy: https://policies.google.com/privacy?hl=en
We also encourage you to review the Google's policy for safeguarding your data: https://support.google.com/analytics/answer/6004245. For more information on what type of information Firebase collects, please visit please visit the Google Privacy & Terms web page: https://policies.google.com/privacy?hl=en
Our Service may contain links to other sites that are not operated by us. If you click on a third party link, you will be directed to that third party's site. We strongly advise you to review the Privacy Policy of every site you visit.
We have no control over and assume no responsibility for the content, privacy policies or practices of any third party sites or services.
Our Service does not address anyone under the age of 18 ("Children").
We do not knowingly collect personally identifiable information from anyone under the age of 18. If you are a parent or guardian and you are aware that your Children has provided us with Personal Data, please contact us. If we become aware that we have collected Personal Data from children without verification of parental consent, we take steps to remove that information from our servers.
We may update our Privacy Policy from time to time. We will notify you of any changes by posting the new Privacy Policy on this page.
We will let you know via email and/or a prominent notice on our Service, prior to the change becoming effective and update the "effective date" at the top of this Privacy Policy.
You are advised to review this Privacy Policy periodically for any changes. Changes to this Privacy Policy are effective when they are posted on this page.
If you have any questions about this Privacy Policy, please contact us:


1, Chrome
Install extension from here
Then restart your browser, use the 3rd icon to trigger it.
2, Firefox (coming soon)


| Interface | Description |
|---|---|
| AuthenticationService |
The AuthenticationService interface defines the signatures of all the
operations provided by authentication service; it is used to publish these
operations as a web service.
|
| Class | Description |
|---|---|
| AuthenticationServiceImpl |
The AuthenticationServiceImpl class implements the AuthenticationService
interface, i.e.
|
| ConfigurationUtils |
The class LDAPAccess provides access methods to LDAP registry; it
encapsulates all the details of LDAP connection and data access.
|
| EncryptionUtils |
The EncryptionUtils class provides methods to sign and encrypt XML element
|
| LDAPAccess |
The class LDAPAccess provides access methods to LDAP registry; it
encapsulates all the details of LDAP connection and data access.
|
| RSTUtils | |
| SAMLTokenUtils |
The SAMLTokenUtils class provides a method to build a SAML token.
|
| Exception | Description |
|---|---|
| WebServiceException |
The WebServiceException class defines a custom web service exception
|


Corn spot could be trading at $4.00/bushel today. In the next few months, corn supplies will begin decreasing as the new crop is being planted. Corn futures therefore could be trading at higher and higher prices until the new crop is harvested.


This repository hosts some Jupyter Notebooks, covering various subjects. Go to nbviewer to read them.
You can also launch an interactive environment to play with the code by yourself, using one of these platforms:
At the beginning, this repository was only here to host some small experiments, for me to learn how to use the wonderful Jupyter tools correctly (baby notebooks :baby_bottle:)…
bash
commands (or some of my
command-line scripts), see for example
a tutorial on head and a tail
(on GitHub?).
I am a passionate user of the Python programming language.
This notebook written for the Pi Day 2017 (on GitHub?) demonstrates a dozen of easy algorithms to compute from 10 to 100000 digits of the number pi.
This notebook implements a simple example of the simulated annealing algorithm (on GitHub?) to minimize black-box functions :sunglasses:.
This notebook shows a hand-written and clear implementation
(on GitHub?) of several
Hashing functions, like MD5
, SHA1
, and all variants of
SHA2
(SHA256
, SHA224
,
SHA512
, SHA384
).
This notebook shows a manual implementation (on GitHub?) of the Lempel-Ziv complexity in pure Python, and then as optimized Python code, with Cython or Numba. I also wrote a version in Julia (in the same notebook), and compare the 4 implementations! I then published my code as a Pypy package, see here on pypi.org.
This notebook shows a hand-written and clear implementation (on GitHub?) of several Pseudo-Random Number Generators, including the famous Mersenne twister algorithm, and then uses it to samples from the most famous discrete and continuous distributions, showcasing use of the Inverse-Transform method and Acceptance-Rejection method (cf. Markov Chain Monte-Carlo methods).
This notebook implements and compares different Runge-Kutta methods (on GitHub?) for integrating Ordinary Differential Equations in Python. And also in Julia (on GitHub?), and also in OCaml (on GitHub?). I wanted to compare the three languages for the same algorithms. Well, obviously, Julia is the fastest and simplest for numerical simulations like this.
:fr: Ce petit notebook en français (sur GitHub ?) implémente les algorithmes de vérifications des numéros de cartes bleues, de sécurité sociale et d’IBAN en Python.
This notebook implements and explore the Exponential Integral function Ei(x) (on GitHub?).
This notebook shows how to solve the equation
exp(- a x²)=x
both numerically and formally (with the
Lambert W function)
(on GitHub?).
This notebook implements Kullback-Leibler divergences for some parametric distributions, and KL-UCB indexes, in naive Python and compare with optimized versions using JIT compilation by Numba or C compilation by Cython (on GitHub?).
This short notebook defines and studies the Rényi entropy (on GitHub?).
:fr: Ce notebook présente des approches simples pour générer un dictionnaire des mots français adaptés à l’écriture inclusive, comme beau/belle -> beau·elle, professeur/professeure -> professeur·e, il/elle -> iel/ielle etc (on GitHub?). Ici ce trouve le dictionnaire généré (contenant environ 26 000 mots différents). Work in progress… (je ne terminerai pas, c’est trop compliqué de faire ça parfaitement)
:fr: Ce notebook en français présente les problèmes de bandits multi-bras stochastiques (on GitHub?) (multi-armed bandit, MAB), et les algorithmes dits “de bandits” pour les résoudre (UCB “Upper Confidence Bounds”, KL-UCB, Thompson Sampling, Approximated Finite-Horizon Gittins index etc). C’est une bonne introduction aux outils que j’utilise pour ma thèse.
:fr: I corrected some maths & programming problems from the annals of the CentraleSupelec national competitive exam (in France), in this notebook Oraux_CentraleSupelec_PSI__Juin_2017.ipynb (on GitHub?) (for this kind of oral exam). Again in 2018, Oraux_CentraleSupelec_PSI__Juin_2018.ipynb (on GitHub?).
:fr: Ce notebook en français est un petit tutoriel pour apprendre à résoudre des problèmes/programmes linéaires en Python avec SciPy, pour le cours ALGO2 à l’ENS Rennes en janvier 2021 (on GitHub?).
:fr: Ce notebook en français montre une expérimentation de visualisation interactive de l’algorithme du Simplexe, pour le cours ALGO2 à l’ENS Rennes en février 2021 (on GitHub?).
:fr: Ce petit notebook en français présente un challenge : « Comptez le nombre de mois de février répondant à ce critère (je n’ai pas trouvé de nom précis), depuis l’année de création de l’ENS Rennes (1994, enfin pour Cachan antenne Bretagne) jusqu’à 2077 (1994 et 2077 inclus). ». (on GitHub?).
I will try to write more artistic notebooks, showcasing nice pieces of code :art:!
This small notebook
(on GitHub?) is a fun experiment, where I tried to use
[James Powell (@dutc)](https://GitHub.com/dutc)
rwatch module to write a
Python context manager to add a Gaussian white noise to every numbers
inside the context… Something like:
with noise(): x = 10
will produce
x = 10.325
for instance… It fails, but I almost got it,
and it works (without breaking the interpreter) for complex numbers.
That’s already intersting!
This notebook (on GitHub?) is a small experiment, written quickly, about floating-point error propagation when using a non-naive polynomial multiplication with evaluation-and-interpolation. Sadly, this approach fails!
A tiny presentation on how to do time/memory profiling (on GitHub?) from inside the Jupyter notebook interface, with various approaches.
This notebook shows how to register a custom HTML writer for
builtins or user-defined types in IPython and Jupyter
(on GitHub?), for the sake of the example I wrote a nice LaTeX/MathJax-powered
print function that nicely displays polynomials from the
numpy.polynomial.Polynomial
module or class.
A small benchmark between Python, Pypy and Julia for the Romberg numerical integration algorithm (on GitHub?). Julia is the fastest, but Pypy is very fast too :snake: !
Demo of the RISE Jupyter extension to easily write a dynamic slideshow in a Jupyter notebook, for Python (on GitHub?) and for OCaml (on GitHub?) :loudspeaker:.
And more will come… soon! :bullettrain_front:
Anyone can use the mybinder.org website (by clicking on the icon above) to run the notebook in her/his web-browser. You can then play with it as long as you like, for instance by modifying the values or experimenting with the code.
Note: Only the Python kernel is supported on the MyBinder interface!
All the requirements can be installed with
pip
and by running
a few python -m ...
commands.
Note: if you use Python 3 instead of Python 2, you might have to replace
pip
andpython
bypip3
andpython3
in the next commands (if both pip and pip3 are installed).
It will also install all the dependencies, afterward you should have a
jupyter-notebook
command (or a jupyter
command,
to be ran as jupyter notebook
) available in your
PATH
:
$ whereis jupyter-notebook
jupyter-notebook: /usr/local/bin/jupyter-notebook
$ jupyter-notebook --version # version >= 4 is recommended
4.2.1
They are only needed to run the notebooks written for Bash or Octave (or OCaml):
bash
installed (already there
on all Linux distribution, installable with
brew
or
macports
on Mac OS,
available on Windows through
cygwin
):
bash_kernel
with these
two commands:
octave
installed (installable with the package manager on major Linux
distributions (apt-get
, pacman
,
yum
etc), installable with
brew
or
macports
on Mac OS,
available on Windows through
cygwin
or
natively):
bash_kernel
with these
two commands:
OCaml-Jupyter
It is quite easy to install, with opam:
I started by using this OCaml kernel called IOCaml. The instructions were not so simple, cf. the tutorial by @andrewray on iocaml’s wiki. It was prone to some bugs, and I had to manually implement a script to be able to convert the notebooks to PDF with
jupyter-nbconvert --to pdf
. Note that I also had to write a custom Exporter for jupyter-nbconvert in order to convert the notebooks to OCaml scripts (.ml
).
- More information about notebooks (on the documentation of IPython) or on the FAQ on Jupyter’s website.
- More information about mybinder.org: on this example repository.
All the notebooks in this repository are published under the terms of the MIT License (file LICENSE.txt). © Lilian Besson, 2016-18.


FAN RAP
Rangers yob fined £750 for chanting sectarian support of UVF outside Rugby Park
by Campbell ThomasA RANGERS yob has been fined for chanting sectarian support of the UVF.
Mark Ashe, 23, was with other away fans who were singing as they waited to enter Kilmarnock's Rugby Park ground in Ayrshire on February 9.
Ashe was originally accused of swearing and "singing sectarian lyrics and lyrics in support of a terrorist organisation".
Prosecutors did not specify any particular armed group in the statutory breach of the peace charge at Kilmarnock Sheriff Court.
Ashe, who denied the offence, was found guilty of an amended charge of threatening or abusive behaviour likely to cause fear and alarm, aggravated by religious prejudice.
Sheriff Shirley Foran cleared him of swearing and replaced the words "singing sectarian lyrics and lyrics in support of a terrorist organisation" with "repeatedly chanted lyrics in support of the UVF".
The only lyric that could be identified clearly was "UVF", the court heard.
Ashe, of Winchburgh, West Lothian, was fined £750.
Sheriff Foran ruled the first offender should not be given a football banning order.


FORM
First Name:
Last Name :
Date :
Gender :
<
Male
<
Female
Show gender :
Female+Male
Female
Male
SHOW AGE
submit
Save
Load


FlightSurety
Airline Registration
Airline
Register Airline
Fund Airline
Flight Registration
Flight
Register Flight
Buy Insurance
Submit to Oracles
Passenger Insurance
Claim Insurance


I was walking to my house one afternoon at about 2:40 pm and I was unusually spunky, mostly because I had just bought $40 of shrooms for only $20, and I had never done them before. I had smoked weed, done painkillers, and even tried coke, but I had never done a real psychadelic. My friends had been chanting 'eat them, eat them' for 20 minutes by then and finally they convinced me.
I took out one cap at a time, put them in my mouth and chewed/swallowed, albeit with the help of Mountain Dew. Two of the caps had stems on them and I decided that I wasn't going to eliminate any of the experience by being a wuss and taking off the stem. I noted that the caps tasted like chewy, unsalted peanut shells. I left a good number of caps (but mostly stems) for one of my friends who also wanted to try shrooms. The whole half an hour walk from there home I complained about how 'This better not be a crock of shit.'
As soon as my friends and I parted ways for the rest of the way to my house, I began to feel heavier.  When I arrived at my house I didn't feel much different. I continued losing and gaining back the sensations that I experienced walking home. I walked up the staircase towards my room. I turned on Pink Floyd's 'The Dark Side of the Moon' and waited. Within 5 minutes my world was a blur.
I felt the music envelope me like a cloth. I grooved with the beat without my mind's consent, and every time I tried to stop I'd laugh and continue on grooving. Soon I had lost almost all of my motor skills except for my neck, so I rested my head up against the wall and grooved. By the song 'Time' I had lost a grip on all of reality. I had forgotton that I had a body below my neck. My head became a fish swimming upstream from the ocean to breed. I continued this until 'The Great Gig in the Sky' when I decided that it was time for a movie.
I looked out the window and the sunshine was blinding. I looked at my movie rack (somehow I had regained my ability to control my body) and I chose a movie well suited to my current state: Austin Powers. I put it in the VCR and laid back again. The commercials came on and I proceded to watch. I had forgotten that one of the commercials for Austin Powers preceding the movie is for Spawn. As soon as I saw this I freaked out. The clown started coming out of the television and as I got up to turn off the television a monster's hand reached out for me. I snatched the remote and turned off the T.V. like I was firing a gun at a super villian. After that, I heard the garage door open and I knew my mom was home. I knew that if my mom saw me like this she'd disown me, so I stayed up in my room for another 20 minutes and turned on the T.V., but not really watching it.
At 3:50 I decided to chance getting caught and go downstairs and head outside for a walk in the park. I said 'Hey mom, I'm gonna hang out with some friends in the park, ok?'  'It's raining outside.' I turned around and saw that the outside was completely pitch black and was raining like a hurricane. 'Uhh, yeah... I know... but we only meeting in the park,' I said, dumbfounded. 'Ok, just don't be too long.' I agreed and left with my cd player.
I had all of my favorite CDs with me, but I didn’t feel much like listening to Pink Floyd, so I decided to listen to something else, but it currently escapes me what it was. I walked up the road and by then, it was dry and sunny again. I turned into the park and to my wonder and amazement, everything was truly alive. Not just alive, but living, breathing, and caring. It looked as though all of the plants had mini lights inside of them and illuminated the path. Even the needled plants looked friendly. I followed the trails farther down, talking to myself the whole time, not caring if someone was listening. I was experiencing a body high like nothing before and an indescribable intelligence boost. I knew all of the answers to the universe and then some, and it all seemed so simple. I knew that this drug tested my character, and I needed to face whatever demons it dealt me.
I was turning the corner out of the park area to the main path when I turned my head to get one last peak at heaven’s grotto, and then the whole path I had just tread on melted and twisted into faces, arms, torsos of people moaning, crying, needing my help. I really looked like Dante’s Inferno. I turned away because I didn’t want to see so much horror, but then realized that I had to look, for the sake of myself, but when I looked again, it was gone.
I continued down the trail thinking about what just happened, still not listening to my music. I thought “Who can I talk to right now? I am so very lonely.” I used my cell phone to call friend #1, who was eating dinner, and then friend #2 who was also eating dinner. I wanted to call this girl whom I had affection for, but I then realized that she doesn’t like people who do drugs, so I just listened to one of her recordings she left on my cell phone’s answering machine for 15 minutes. It was all I could do to keep from dying of lonliness.
I decided that I was getting pretty sad and continued on where I had come from but instead of going toward my house form the park, I went the other way. I stopped by friend #3’s house. He was a straight-edge sort of fellow, but I figured since I’m not trying to get him to be my girlfriend it’s all right. I rang his doorbell and he came running down the stairs. He opened the door and looked at me kind of weird, mostly because I had never talked to him or come to his house without someone else before, but also partly because my face was completely red and I kept touching it. “Hey. What’s up,” he asked. “Oh not much. Just tripping on some shrooms,” I replied. That was when he gave me the most shocked/repulsed/scared look of my life, and I would pay $20 to see it again. “Do you need to sit down?” he asked, not knowing what to do. “Yeah man, I’d love to sit.”
So we sat on the bench facing his tree for a bit and I ranted on about how life is beautiful and trees are beautiful and that he was a beautiful person and that I was beautiful but after what seemed like a million years to him, he said “Well I got to go now. See ya ‘round.  I left and put In Utero into my CD player. As I walked down form his house the teenage angst and depressionism got to me. I started to get lonely again and wandered back toward my house. I said to myself “Shit, I can’t go home like this. I’m still a mess.” So I took a right onto a trail that leads to my house, but takes a while longer.
As I walked down the trail I reached a spot where I could sit. I was tired from all of the walking and I was still sad. I could tell that I was coming down from the trip by then. I sat there for 45 minutes thinking about my death and my lonliness and why it always rains on me when I’m sad and can’t feel my legs. I then proceeded home to where I was confronted by my mom who accused me of being stoned, but I truthfully told her that I was not and that she was just being paranoid and that I was just tired from walking for 2 hours.
In retrospect I believe shrooms are the best substance I have abused yet, and I have done them a few times more since this experience. I also plan on continuing, since it is a great way to learn about myself, others, life, and a great way to pass the time.
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.


{{- template "layouts/pages/belize.tmpl.html" (MapValAdd . (MapVal "Belize" (Map (MapVal "Issue" 1) (MapVal "Title" "Travel and destination") (MapVal "MainPhotoURL" "https://www.dropbox.com/s/jzur601nl51348j/2W4A1487.JPG?dl=1") )) ) -}}


{* Copyright 2011-2013 Here's A Hand Limited 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. *} {extends file="page.htm"} {block name="navButtons"} Setup a holiday now Update your schedule {/block} {block name="content"} {if $requestResponsePosted}


JSON to CSV Converter
CSV to JSON Converter
Paste Your JSON Here:
Based on code posted here on StackOverflow


A few things caught my attention while analysing the new iOS 7 beta...
Usually, when an iOS beta comes out, the first thing I do is to analyse the filesystem, to check for new stuff, like applications, frameworks, system services, changes in the filesystem layout, etc.
Back in the days, I developed a tiny iOS app to display the content of the iOS filesystem.
It used to be on the AppStore, before Apple decided to remove it, for security reasons. I then made it available on GitHub, as an OpenSource project.
The app was running nice, displaying all iOS partitions, and filesystem hierarchy, permissions, file's contents...
It was really nice, from a developer's perspective, to see how the iOS filesystem was organised, to see how the sandboxing was made, etc...
So I ran it on the first iOS 7 beta...
The app ran just fine, but I was surprised to see that almost all directories on the root partition were empty.
Directories like «/Applications» (system apps), or «/tmp» were still browsable, but directories like «/System», «/Library» or «/var» were reported as empty folders...
The last one surprised me a lot, as «/var» is in fact a mount point were all the user data is stored, including third-party applications.
I first thought of a bug in my own code, but after a few tests, it's definitively not.
So iOS 7 adds some security layer in all filesystem operations, hiding everything related to the system to a third-party app.
It's not that those locations aren't accessible, in terms of filesystem permissions. They are simply hidden (I guess by the Foundation framework).
So as an example, let's take a look at the following code:
NSError * e; NSLog( @"%@", [ [ NSFileManager defaultManager ] contentsOfDirectoryAtPath: @"/Applications/" error: &e ] ); NSLog( @"%@", e ); e = nil; NSLog( @"%@", [ [ NSFileManager defaultManager ] contentsOfDirectoryAtPath: @"/System/" error: &e ] ); NSLog( @"%@", e );
Simple stuff. It will just log the contents of the «/System» and «/Applications» directories to the console, reporting a potential error, if any.
Previous to iOS 7, it just works. In both cases, it displays the directories content.
But on iOS 7, while the first case works as expected, the second one, asking for the contents of the «/System» directory, simply fails, with the following error:
Error Domain=NSCocoaErrorDomain Code=257 "The operation couldn’t be completed. (Cocoa error 257.)" UserInfo=0x146397e0 { NSUnderlyingError=0x14639720 "The operation couldn’t be completed. Operation not permitted", NSFilePath=/System/, NSUserStringVariant=(Folder) }
Looks like I missed something from the keynote... : )


Curly and Floppy Twistytail, the Funny Piggie Boys
by Howard R. Garis
Chapter 29: “The Piggies and Santa Claus”
Additional Information
- Year Published: 1918
- Language: English
- Country of Origin: United States of America
- Source: Garis, H. R. (1918). Curly and Floppy Twistytail, the Funny Piggie Boys. New York, NY: A. L. Burt Co.
-
Readability:
- Flesch–Kincaid Level: 4.8
- Word Count: 1,381
- Genre: Fantasy
- ✎ Cite This
Downloads
“Oh, so many things as I have for you to do today!” exclaimed Mrs. Twistytail, the pig lady, to her two boys, Flop Ear and Curly Tail, one morning. “Such a lot of work!”
“My!” exclaimed Flop Ear. “What is it, mamma? Have we wood to chop or water to bring in?”
“Oh, neither one,” said Mrs. Twistytail, with a smile, as she shook the crumbs off the tablecloth, for the family had just finished dinner. “I mean we have so many things yet to get for Christmas. There are plums to buy for the plum pudding, and the candy and nuts and oranges and figs and dates and the sour milk lollypops and everything that Santa Claus hasn’t time to bring.”
“Why!” exclaimed Baby Pinky, who was putting on her new lemonade-colored hair ribbon, “I thought Santa Claus brought everything.”
“No, not quite everything,” explained Mrs. Twistytail. “He brings all the presents, of course, but he lets the papas and mammas get the good things to eat, because different children like different things.
“For those things are for Billie and Johnny Bushytail, the squirrel boys,” went on Mrs. Twistytail. “And they wouldn’t like to have sour milk, and cold boiled potatoes, and the things that you like.
“So, as I say, there are lots of things for us to do to get ready for Christmas, and you boys will have to help me. I think today I’ll send you to the store for some raisins and citron and plums and other things to make puddings and pies.”
“Oh, goodie!” cried Flop Ear.
“And maybe we can clean out some of the cake and pie dishes after you get through baking,” suggested his brother.
“I think you may,” said their mamma.
“But what can I do?” asked Baby Pinky, the littlest pig of them all. “Can I go to the store for anything?”
“You will stay home with me,” said Mrs. Twistytail, “and help me bake. Now, boys, you had better start, so as to get home before dark. Here are the things I want,” and she gave them a list written out on paper.
Oh! so many lovely victuals as there were! I can’t write about them, for I haven’t had my supper yet, and I’m so hungry, when I think of the good things, that I might even take a bite out of my typewriter, and then I couldn’t print any more stories for you, and that would be too bad for me.
Anyhow, there were many good things that Mrs. Twistytail wanted, and soon Curly and Flop were on their way to the store with a big basket.
They got them all, and they took sniffs and smells, though not so much as weenyteeny nibble of the Christmas things. But, oh! how they did wish the time would come when they might really eat them!
“What do you most want for Christmas?” asked Curly as he and his brother tramped on through the snow-covered woods.
“A toy steam engine,” replied Flop Ear.  Stand still there, if you please. Some of the things are slipping off my sleigh, and I want to fasten them on. Whoa there, reindeer!”
“Listen to that, would you now!” whispered Curly Tail to his brother, as they hid down behind some bushes.
“Reindeer!” exclaimed Flop Ear. “There’s only one person who has reindeer and he is—”
“Santa Claus!” interrupted Curly Tail. “We’ve found Santa Claus, Floppy, and this is the best chance in the world to tell him what presents we want for Christmas!”
“That’s right,” agreed the other piggie boy.
“What ho! Hello!” cried Santa Claus, when he saw the piggie boys. “What are you doing here?”
“We are on our way home from buying Christmas things,” said Flop Ear. “But have you really Christmas presents there, Mr. Santa Claus?”
“I have indeed,” replied the jolly old saint, with a twinkle in his eyes. “But no one is allowed to see them until the right time. You see I am traveling about, measuring the sizes of different chimneys, so I can tell whether or not I can slide down them. Just as I got here some of the toys began to slip off the sleigh and I stopped to fasten them on.
“Why, what is the matter?” asked Curly.
“Alas,” said Santa Claus. “This year I have only one toy engine, and a poor little lame boy has asked for that in a letter he sent to me up the chimney the other night. And I have only one toy auto, and a little boy who has no papa or mamma, and who is very poor, has asked for that. I was going to give the toys to them, but since you have met me in the woods I must grant your request, since whoever meets Santa Claus face to face, can have just what they ask of him.
 Still it can’t be helped. I will grant your wishes, Floppy and Curly, but—”
“Stop!” suddenly cried Flop Ear.
“Hold on!” exclaimed Curly Tail.
Then, somehow, into their hearts there came a feeling of sadness, and yet not so much sadness as gladness and happiness.
“I—I guess I don’t want a toy steam engine,” said Flop Ear. “Give it to the lame boy.”
“Good,” cried Santa Claus.
“And I don’t need the toy auto very much,” went on Curly Tail. “Give it to the poor little boy.”
“Good!” cried Santa Claus again, and then his face seemed to shine like the sun, and there seemed to be wreaths of holly and bunches of mistletoe sticking all over him, and he sprang into his sleigh, the reindeer shook their horns, making the bells jingle like anything, and then, off on top of the snowflakes rode Santa Claus, calling back:
“All right, piggie boys, I won’t forget you, or any of the earth children. It will soon be Christmas, and if you don’t get autos or steam engines you’ll get something else,” and then he vanished from sight, and Flop Ear and Curly Tail went home, wondering very much at what had happened.
And in the next story, in case the telephone man doesn’t crawl through the water pipe and scare the window shutter so that it goes bang-bang all day, I’ll tell you about Flop Ear and the stockings.


{% extends './base.html' %} {% import 'bootstrap/wtf.html' as wtf %} {% block body %}
Don't have an account? Sign up here


-
Notification on efficient & effective service delivery during lockdown posted on
-
Emergencies and Essential Services during lockdown posted on Aug 12th 2020
-
Public Notification on service delivery by Dzongkhag Task Force Committee posted on 16-Aug
-
Focals for Essential services (Central Region) posted on 14-Aug
-
Focals for Essential services (Central Region) - DZO posted on 14-Aug
-
OPD & In-patient services during lockdown in Trongsa Hospital posted on Aug 12th 2020
Essential Supplies
Various
General Health Services
Local Leaders
Toll Free Number
Dzongkhag Webpage


We're sorry but this website doesn't work properly without JavaScript enabled. Please enable it to continue.


5 references to s_binders
System.Management.Automation (5)
engine\runtime\Binding\Binders.cs (5)
940
lock (
s_binders
)
942
while (
s_binders
.Count <= i)
944
s_binders
.Add(null);
947
return
s_binders
[i] ?? (
s_binders
[i] = new PSArrayAssignmentRHSBinder(i));


Mauricio Del Razo Sarmina
Advisors:
Randall J. LeVeque
&
Hong Qian
University of Washington
Department of Applied Mathematics
Understanding biochemical processes in the cell!
- Cell are too complicated; however, simple models might
display similar qualitative behavior.
- Current SRD models are not very rigorous.
Consider:
$ A + B \overset{k_f}{\underset{k_b}\rightleftharpoons} C $
with [A] & [B] constant.
Relation diagram between the LMA, CME and FPE:
The CME is more fundamental.
$A + B \overset{k_S}\rightarrow C$
$$ \frac{\partial u(r,t)}{\partial t} = \frac{D}{r^2}\frac{\partial}{\partial r} \left(r^2 \frac{\partial }{\partial r} u(r,t)\right) \\ u(R,t) = 0 \hspace{5mm} u(R_\infty,t) = c_0 $$
Partially diffusion controlled BC:
Flux $\propto$ Concetration
$$ 4\pi R^2 D u'(R) = \kappa u(r) \\
k_{CK} = \frac{k_S \kappa}{k_S + \kappa} $$
PDF of particles under a potential $U(r)$ follows
$$ \frac{\partial u(r,t)}{\partial t} =
\frac{D}{r^2}\frac{\partial}{\partial r}
\left(r^2 e^{-\beta U(r)}\frac{\partial [e^{\beta U(r)}u(r,t)]}{\partial r}\right)$$
Smoluchowski → Blue
Collins & Kimball → Red
- Given uniformly distributed B's around A:
- What is the expected time for first encounter with A:   $t_1$
- Can also ask time for second encounter starting on A boundary:   $t_2$
Reaction rates related to FPT:
$$ t_1=\frac{1}{k_S c_0} \hspace{10mm} t_2=\frac{1}{k_s c_0} + \frac{1}{\kappa c_0} \\
k_{CK} = \frac{1}{t_2 c_0} = \frac{k_S \kappa}{k_S + \kappa}$$
Consider:
$ A + B \overset{k_f}{\underset{k_b}\rightleftharpoons} C $
- How to write an equation for the PDF?
- In a simulation context:
- Simulate trajectories within the PDF (similar to Gillespie algorithm).
For         $ A + B \overset{k_f}{\underset{k_b}\rightleftharpoons} C $
- Only simulates trajectories.
- Not accurate close to A molecules.
- Lacking rigorous mathematical/physical foundation.
$$ \frac{\partial f_u(r,t)}{\partial t} = \frac{D_u}{r^2} \frac{\partial }{\partial r} \left( r^2 e^{-\beta U_u(r)}
\frac{\partial}{\partial r} e^{\beta U_u(r)} f_A(r,t)\right) -\alpha(r)f_u(r,t) + \lambda(r)f_b(t) \\
\frac{\partial f_b(r,t)}{\partial t} = \frac{D_b}{r^2} \frac{\partial }{\partial r} \left( r^2 e^{-\beta U_b(r)}
\frac{\partial}{\partial r} e^{\beta U_b(r)} f_A(r,t)\right) + \alpha(r)f_u(r,t) - \lambda(r)f_b(t) $$
- Using $\alpha(r)=\frac{k_0 \delta(r-R)}{4\pi r^2}$, $U_u=0$ and $\lambda(r)=0$
$\Rightarrow$ recovers Collins & Kimball
- Additionally using $\lambda(r)=\frac{k_1\delta(r-U_r)}{4\pi r^2}$ $\Rightarrow$ consistency with KMC model.
- FCS: experimental technique to measure diffusion coefficients and reaction rates.
- It is based on correlations of linear fluctuation around equilibrium.
- Fluctuations contain information of diffusion and reaction
- Correlation curves match for linear reactions.
- Slightly deviate for nonlinear reactions
- They match in asymptotic cases:
nonlinear $\rightarrow$ linear
- Shock waves travel from air to your skull and brain (interfaces).
- Experimentalists have interfaces in their experimental setups.
- Cells might behave as interfaces too.
Not limited to TBI, original motivation began with localized drug delivery.
We are trying to find out...
Experimental setup done with endothelial cells, since the blood-brain barrier is composed by them.
Cartoon of cylindrical cross-section of shock tube.
\[ \begin{aligned} \frac{\partial}{\partial t} \left[\begin{array}{c} \rho \\ \rho u_r \\ \rho u_z \\ E \end{array} \right] + \frac{\partial}{\partial r} \left[\begin{array}{c} \rho u_r \\ \rho u_r^2 + P \\ \rho u_r u_z \\ u_r(E+p) \end{array} \right] + \frac{\partial}{\partial z} \left[\begin{array}{c} \rho u_z \\ \rho u_r u_z \\ \rho u_z^2 + p \\ u_z(E+p) \end{array} \right] = \left[\begin{array}{c} -(\rho u_r)/r \\ -(\rho u_r^2)/r \\ -(\rho u_r u_z)/r \\ -u_r(E+p)/r \end{array} \right] \end{aligned} \]
The Equation of State (EOS) relates pressure
with density and internal energy to close the system of eqs.
Stiffened gas equation of state (SGEOS) or Tamman EOS:
Different materials = different parameters for SGEOS
| Parameter | $\gamma$                 | $P_\infty$ |
| Air | 1.4 | 0.0 |
| Water | 7.15 | $3\times 10^8$ |
Problem can be stiff at interfaces!
$\Rightarrow$ Interfaces not trivial to implement.
System of 2D hyperbolic conservation laws with source terms.
$$ Q_{i}^{n+1} = Q_i^n - \frac{\Delta t}{\Delta x} \times\\ \left[\sum_{p=1}^m(\lambda^p)^+ W_{i-1/2}^p + \sum_{p=1}^m(\lambda^p)^- W_{i+1/2}^p\right] $$
Implemented into Clawpack 5.0
One dimensional simulation:
3D Simulation $\Rightarrow$
Vapour pressure at room Temperature:
2 493 Pa
Major insights:
Stochastic reaction diffusion
Fluid interface problems
Final Comments


BRANCHES
MIT COLLEGE OF POLYTECHNIC,AURANGABAD
Computer Engineering
Mechanical Engineering
Electronics Engineering
Civil Engineering


{{site.user_description}}
Lemme introduce ma self. Ma name is Fithratul Husna. You can call me "Fithra"
Iam Student of Information System at State Islamic University of Sultan Syarif Kasim Riau or in Indonesian language called UIN SUSKA RIAU
If you wanna know me better, please contact me on my bio below this!
With Love, Fithra❤


Get insights that help your business grow.
Discover the benefits of data analytics and make better decisions regarding revenue, customer experience, and over all efficiency.
10k+
Companies
314
templates
12M+
queries
Discover the benefits of data analytics and make better decisions regarding revenue, customer experience, and over all efficiency.
Companies
templates
queries


Here's what £200,000 will get you in Burton's property market
On the move?
by Jane McFarlaneEvery penny counts when you're looking for a new home.
And whether it's a flat, a terraced house or a semi-detached property you're looking for, it's important that you stick to your budget and get value for money.
But what will £200,000 get you in the Burton property market?
Quite a lot if truth be told, including bungalows and detached properties including ones in Stretton and Outwoods.
Some have been extended and include four bedrooms and even a conservatory.
We've rounded up 10 properties priced around £200,000 in Burton for sale on property website RightMove.
But don't forget, you'll also need to factor in other costs such as solicitor's fees, stamp duty and paying a removal firm to name but three.
Properties in Burton costing around £200k
-
Fairham Road, Stretton, OIRO £200,000
A beautifully presented and extended four bedroom semi-detached home in Stretton.
This family home has had a rear extension which has increased the living space and added an extra bedroom to offer far more than your average property in this location.
Having a large family lounge and spacious dining room plus a larger kitchen, this is the perfect property for those that want more space.
The upstairs bedrooms are of a good size and the family bathroom is of a modern specification.
-
Bedford Road, Burton, OIRO £200,000
A substantially extended three bedroom semi-detached home which offers fantastic living space due to the large rear extension which has nearly doubled the size of the family lounge.
With a large breakfast kitchen, conservatory, three double bedrooms and much more, this could be an ideal home for a growing family that is looking for more space.
-
The Poplar at Coopers Croft, Tatenhill Lane, Branston, from £200,000
The Poplar is a new property and benefits from a fully fitted kitchen a spacious living/dining room with glazed doors to the garden, a downstairs cloakroom and useful under stairs store, two double bedrooms and a well equipped family bathroom.
-
Glen Rise, Burton, £205,000
Located at the top of a cul-de-sac situated close to town centre this bungalow offers spacious living and comprises of in brief: entrance hall, family bathroom, two bedrooms, reception room and a fitted kitchen.
The property also benefits from UPVC double glazing and recently installed new gas central heating boiler.
Outside there is a hard landscaped fore garden with driveway for multiple vehicles and detached garage, while to the rear there is a paved patio with and area laid to lawn.
-
Cascade Close, Burton, offers in excess of £205,000
A well-presented three storey family house decorated in neutral tones throughout.
An entrance hallway has access to the guest cloakroom and stairs leading to the first floor.
There is a dining kitchen with a range of matching units and appliance space. The lounge has twin doors providing access to the rear garden.
To the first floor are three bedrooms and the family bathroom while on the second floor is the master bedroom suite.
Outside, an enclosed garden to the rear has a patio and lawns. There is a garage and a driveway offering off street parking.
-
Harbury Street, Burton, £205,000
This smart double fronted detached traditional bungalow is in a popular residential location convenient for Queen's Hospital and also a short drive from Burton town centre.
There are two double bedrooms, a good sized dining kitchen, extensive driveway and a large rear garden.
-
Cascade Close, Burton, £207,500
A three bedroom detached family home with entrance hall, cloakroom, lounge, inner hallway, kitchen/dining room, landing, master bedroom with en suite, two further bedrooms and a family bathroom.
UPVC double glazing, gas central heating, driveway to garage, front and rear gardens. No upward chain.
-
Cascade Close, Burton, £209,950
A delightfully three bedroom detached property, located in a select development of similar built homes. Originally constructed by Bellway Homes in 2016 and fitted to exacting standards throughout.
Highlights include three well-proportioned bedrooms, larger than average integral garage with utility area, guest cloakroom, lounge, kitchen/diner, principal bedroom with en suite facilities, and a family bathroom.
A particular feature of the home is the substantial conservatory off the kitchen.
-
Outwoods Street, Burton, £209,950
Set in a popular residential location and handy for the those who work at Burton's Queen's Hospital together with excellent access to the town centre, A38, A50 and beyond is this superb refitted traditional semi-detached home.
The house impresses throughout and has a brand new boiler and central heating system plus all new carpets and flooring.
-
Bosworth Drive, Outwoods, £210,000
This detached home has a refitted kitchen and bathroom.
Inside there is an entrance hallway, a 19 ft lounge, refitted kitchen, three bedrooms or two with a dining room, (or master bedroom with a dressing room), and a refitted family bathroom.
There is also a garage and parking for three cars.
We've got apps for both Android and Apple devices which can be tailored to deliver the news and sport that you're interested in.
And if you download our app, you can sign up for push notifications for Burton by selecting 'discover' and choosing 'Burton' from the 'more topics' list.


{% extends "faq/base.html" %} {% block body %} {% load url from future %}
If you aren't seeing any data below, or if you're getting random 404s, make
sure you've loaded the sample data by running ./manage.py loaddata
faq_test_data
.
Here are some options to try:
{% templatetag openblock %} faq_list 3 as faqs
{% templatetag closeblock %}
.


Apple: $768
Northeast High School (Philadelphia) $187/student
Can renovate 164 homes $127,000
Update
Click me
Clicks:
0


Unlike the Gaussian algorithm, which operates in the 2-dimensional case, the LLL algorithm outputs a shortest vector in n-dimensional space. However, the shortest vector is not always the shortest actually, but often a very short vector. This restriction has the advantage that the algorithm works in polynomial time, so a good solution can be found quickly.
Two important components of the algorithm are on the one hand the Gram-Schmidt orthogonalization, which is generated for the given vectors mutually orthogonal vectors that span the same vector space. On the other hand, this is the Lovász condition with which the reduced form can be checked.
In order to ensure that the reduced lattice still generates the same lattice as in the beginning, only such transformations are performed, which form an unimodular matrix. Unimodular means that the determinant is +1 or -1. This unimodular transformation matrix can be found, in addition to the reduced base and their successive minima in the log.


this address RHmnjh4jB5qkxjdoeYgV1Vd1rsXHj19W8t(edited)
NNoperator09-Apr-19 05:05 AM
Guess not. Really odd to see dual nearly identical simultaneous transactions.(edited)
CHMEX09-Apr-19 05:08 AM
I have seen that in that past but not sure why somebody does that.
I can think of a basic jumblr ( not really anom ) but certainly some people will give up tracing back the original address at some point
on another note it drives up the transaction count
NNoperator09-Apr-19 05:12 AM
right now they fixate on 8015.64906847 size UTXO. Not really obfuscating effectively, maybe it has to do with mm2 ?
newvulcan09-Apr-19 07:45 AM
I'm getting this error now and again in the TXSCLCC log - ERROR: AcceptToMemoryPool: tx inputs not found. Is that anything to be concerned about ?
blackjok3r09-Apr-19 07:45 AM
no its fine
newvulcan09-Apr-19 07:45 AM
Ok, thanks
MadCryptoHead09-Apr-19 09:35 AM
After running ./m_notary_testnet, should Iguana daemon remain active?
Hello everyone, by the way
CHMEX09-Apr-19 09:38 AM
yes iguana has to be active and is the communication service between the nn nodes
MadCryptoHead09-Apr-19 09:44 AM
For any reason Iguana is starting but it's not remaining active. After some seconds running it stops working. When I run m_notary_testnet it gives me the following output:
~/2019NNtestnet/iguana$ INIT with 2 notaries
[KMD].0 PIZZA 00387b4f6e2169ab05e0e4bf54b93b90e1bbef7ec25711ba3ec4157a835f03ed height.77834 vs last.77833
[KMD].77834 PIZZA 004f881bfae5d1d20aabe65c75d1a620fec795bea0e80946acced1ed0cf6a726 height.77835 vs last.77835
minerkey33-> 03d95226cd5dc77874c580b2232aa56a43f3a6fb7ea9b690adc20449fe67446c89 statemachinestart this node R9mhvxbvG6RFDYtSPpUnzecCcAcMK3edty R9mhvxbvG6RFDYtSPpUnzecCcAcMK3edty is not official notary numnotaries.2 kmdht.1305430 bpht.0
How should I proceed to indentify the cause of the problem? Again, thanks for your support
CHMEX09-Apr-19 09:45 AM
INIT with 2 notaries that looks wrong
I believe we are at 15+
mrlynch09-Apr-19 09:51 AM
24 i think
MadCryptoHead09-Apr-19 09:52 AM
I don't know why is not getting the whole notaries list
mrlynch09-Apr-19 10:01 AM
check testnet.json(edited)
did u clone 2019testnet repo?
newvulcan09-Apr-19 10:13 AM
@MadCryptoHead I had the same thing yesterday - it's to do with not having your details on the 2019NNtestnet. I cloned the repo, made the changes to m_notary_testnet and testnet.json files and then submitted a PR. Just waiting for it to be actioned now, and it should be ok
Oh, and I think you have to restart iguana to load the new notaries file once actioned
blackjok3r09-Apr-19 10:15 AM
yes once hte PR is merged you need to restart
MadCryptoHead09-Apr-19 10:28 AM
Hello Newvulcan. I already did it but it seems that there was a problem with the m_notary_testnet file that I downloaded. I re-downloaded it and now seems to get the notaries properly. Now is that it says that I have no funds... not being true. I'm going to investigate further
blackjok3r09-Apr-19 10:30 AM
send the balance to youself before splitting if you mined blocks
MadCryptoHead09-Apr-19 11:10 AM
I have sent the funds to myself. Where can I find an explanation abour splitting my UTXOs?
blackjok3r09-Apr-19 11:10 AM
./acsplit BEER 50
MadCryptoHead09-Apr-19 11:23 AM
Ok, splitting now
Should I split the other assets after BEER ends (it is taking a while)
?
PHBA206109-Apr-19 11:25 AM
you don't have to wait, because they are independant
MadCryptoHead09-Apr-19 11:26 AM
Should then split PIZZA and TXSCLCC?
PHBA206109-Apr-19 11:34 AM
yes you should, otherwise you won't be able to notarize without 0.0001 utxo
MadCryptoHead09-Apr-19 11:35 AM
Ok, I'm going to. Thanks to all
MadCryptoHead09-Apr-19 11:44 AM
What would be the right way to check that all is working properly? By now my notarized_confirms are 0
siu - Chainmakers09-Apr-19 11:53 AM
Remember to vote for Chainmakers!
ComputerGenie 👴👴👴09-Apr-19 12:04 PM
wants votes too
1
--------------------------
@MadCryptoHead I use some scripts from: https://github.com/KMDLabs/StakedNotary
they need editing to work for NNtest, but they work quite well to see what's going on(edited)
If you have a compatible server and fancy a bit of Optane memory as an alternative DDR4, hey you can get yourself a 512GB stick for almost 8000 USD....
Lumbi09-Apr-19 01:09 PM
have the 2019VOTE tokens been added to agama yet?
ComputerGenie 👴👴👴09-Apr-19 01:10 PM
doubt it, probably only a couple days around the drop date so people don't get confused


"The Sixth Sense" (1999) 3 1/2 stars out of 4. Starring Bruce Willis, Haley Joel Osment and Toni Collette. Written and directed by M. Night Shyamalan.
Some movies require patience and a modicum of faith from the viewer. You can sit for an hour or more asking yourself, "Where is this movie going?" or "When is something going to happen?"

That is how you should approach "The Sixth Sense." This supernatural thriller requires careful attention. If you pick up on the nuances, then you will find this a most satisfying feature. If you're the type that needs to be walloped over the head with a sledgehammer, then I suggest you go see "Deep Blue Sea" or "Brokedown Palace."
"The Sixth Sense" is a chiller for serious moviegoers, those who pay close attention to everything that happens on screen.
Writer-director M. Night Shyamalan, with the aid of cinematographer Tak Fujimoto, creates an aura of uneasiness. The movie has an almost surreal quality to it. You know something is not quite right, but you can't put your finger on what it is until the denouncement.
An eerie score by John Newton Howard helps to heighten the suspense. Actually, "The Sixth Sense" is a movie in which - dramatically - not much really happens, yet paradoxically, events are transpiring constantly.
Bruce Willis plays renowned child psychologist Dr. Malcolm Crowe who comes to the aid of Cole Sear (Haley Joel Osment). The boy harbors a dark secret, he is continually visited by ghosts. Everywhere he looks, he sees them.
At 8, Cole is too frightened and confused by his paranormal gift to understand its meaning.
Cole and Crowe work together to uncover the truth and explain the unexplainable. For Crowe, saving Cole would be redemption because of his guilt for not being able to help an earlier patient.
Shyamalan elicits a complex and tortured performance from young Osment. The young man deserves a supporting actor Oscar nod for his portrayal of a little boy overwhelmed by circumstances he can't even comprehend.
Willis is low-key, speaking in mostly whispers as the anguished Dr. Crowe, who is trying - by helping Cole - to put his life back together.
Toni Collette, who made quite an impression a few years ago in "Muriel's Wedding," is confused and vulnerable as Cole's mother. She tries to be supportive and loving, while being totally mystified by what is troubling her son.
 You have the time to take in all the sights, sounds and smells.
It, along with "The Blair Witch Project," emphasize that you don't need bloody special effects to create an atmosphere of horror or terror. As always, the mind is the biggest bogeyman of all.
So, savor "The Sixth Sense," like a fine glass of expensive wine. It is a movie that demands you attention and will earn your respect.
Bob Bloom is the film critic at the Journal and Courier in Lafayette, IN. He can be reached by e-mail at<EMAIL_ADDRESS>or at<EMAIL_ADDRESS>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