text:
Q: How do I generate a random string of up to a certain length? I would like to generate a random string (or a series of random strings, repetitions allowed) of length between 1 and n characters from some (finite) alphabet. Each string should be equally likely (in other words, the strings should be uniformly distributed).
The uniformity requirement means that an algorithm like this doesn't work:
alphabet = "abcdefghijklmnopqrstuvwxyz"
len = rand(1, n)
s = ""
for(i = 0; i < len; ++i)
    s = s + alphabet[rand(0, 25)]

(pseudo code, rand(a, b) returns a integer between a and b, inclusively, each integer equally likely)
This algorithm generates strings with uniformly distributed lengths, but the actual distribution should be weighted toward longer strings (there are 26 times as many strings with length 2 as there are with length 1, and so on.) How can I achieve this?

A: Okay, there are 26 possibilities for a 1-character string, 262 for a 2-character string, and so on up to 2626 possibilities for a 26-character string.
That means there are 26 times as many possibilities for an (N)-character string than there are for an (N-1)-character string. You can use that fact to select your length:
def getlen(maxlen):
    sz = maxlen
    while sz != 1:
        if rnd(27) != 1:
            return sz
        sz--;
    return 1

I use 27 in the above code since the total sample space for selecting strings from "ab" is the 26 1-character possibilities and the 262 2-character possibilities. In other words, the ratio is 1:26 so 1-character has a probability of 1/27 (rather than 1/26 as I first answered).
This solution isn't perfect since you're calling rnd multiple times and it would be better to call it once with an possible range of 26N+26N-1+261 and select the length based on where your returned number falls within there but it may be difficult to find a random number generator that'll work on numbers that large (10 characters gives you a possible range of 2610+...+261 which, unless I've done the math wrong, is 146,813,779,479,510).
If you can limit the maximum size so that your rnd function will work in the range, something like this should be workable:
def getlen(chars,maxlen):
    assert maxlen >= 1
    range = chars
    sampspace = 0
    for i in 1 .. maxlen:
        sampspace = sampspace + range
        range = range * chars
    range = range / chars
    val = rnd(sampspace)
    sz = maxlen
    while val < sampspace - range:
        sampspace = sampspace - range
        range = range / chars
        sz = sz - 1
    return sz

Once you have the length, I would then use your current algorithm to choose the actual characters to populate the string.

Explaining it further:
Let's say our alphabet only consists of "ab". The possible sets up to length 3 are [ab] (2), [ab][ab] (4) and [ab][ab][ab] (8). So there is a 8/14 chance of getting a length of 3, 4/14 of length 2 and 2/14 of length 1.
The 14 is the magic figure: it's the sum of all 2n for n = 1 to the maximum length. So, testing that pseudo-code above with chars = 2 and maxlen = 3:
    assert maxlen >= 1 [okay]
    range = chars [2]
    sampspace = 0
    for i in 1 .. 3:
        i = 1:
            sampspace = sampspace + range [0 + 2 = 2]
            range = range * chars [2 * 2 = 4]
        i = 2:
            sampspace = sampspace + range [2 + 4 = 6]
            range = range * chars [4 * 2 = 8]
        i = 3:
            sampspace = sampspace + range [6 + 8 = 14]
            range = range * chars [8 * 2 = 16]
    range = range / chars [16 / 2 = 8]
    val = rnd(sampspace) [number from 0 to 13 inclusive]
    sz = maxlen [3]
    while val < sampspace - range: [see below]
        sampspace = sampspace - range
        range = range / chars
        sz = sz - 1
    return sz

So, from that code, the first iteration of the final loop will exit with sz = 3 if val is greater than or equal to sampspace - range [14 - 8 = 6]. In other words, for the values 6 through 13 inclusive, 8 of the 14 possibilities.
Otherwise, sampspace becomes sampspace - range [14 - 8 = 6] and range becomes range / chars [8 / 2 = 4].
Then the second iteration of the final loop will exit with sz = 2 if val is greater than or equal to sampspace - range [6 - 4 = 2]. In other words, for the values 2 through 5 inclusive, 4 of the 14 possibilities.
Otherwise, sampspace becomes sampspace - range [6 - 4 = 2] and range becomes range / chars [4 / 2 = 2].
Then the third iteration of the final loop will exit with sz = 1 if val is greater than or equal to sampspace - range [2 - 2 = 0]. In other words, for the values 0 through 1 inclusive, 2 of the 14 possibilities (this iteration will always exit since the value must be greater than or equal to zero.

In retrospect, that second solution is a bit of a nightmare. In my personal opinion, I'd go for the first solution for its simplicity and to avoid the possibility of rather large numbers.

A: Instead of picking a length with uniform distribution, weight it according to how many strings are a given length.  If your alphabet is size m, there are mx strings of size x, and (1-mn+1)/(1-m) strings of length n or less.  The probability of choosing a string of length x should be mx*(1-m)/(1-mn+1).
Edit:
Regarding overflow - using floating point instead of integers will expand the range, so for a 26-character alphabet and single-precision floats, direct weight calculation shouldn't overflow for n<26.
A more robust approach is to deal with it iteratively.  This should also minimize the effects of underflow:
int randomLength() {
  for(int i = n; i > 0; i--) {
    double d = Math.random();
    if(d > (m - 1) / (m - Math.pow(m, -i))) {
      return i;
    }
  }
  return 0;
}

To make this more efficient by calculating fewer random numbers, we can reuse them by splitting intervals in more than one place:
int randomLength() {
  for(int i = n; i > 0; i -= 5) {
    double d = Math.random();
    double c = (m - 1) / (m - Math.pow(m, -i))
    for(int j = 0; j < 5; j++) {
      if(d > c) {
        return i - j;
      }
      c /= m;
    }
  }
  for(int i = n % 0; i > 0; i--) {
    double d = Math.random();
    if(d > (m - 1) / (m - Math.pow(m, -i))) {
      return i;
    }
  }
  return 0;
}

A: Building on my comment posted as a reply to the OP:

I'd consider it an exercise in base
  conversion. You're simply generating a
  "random number" in "base 26", where
  a=0 and z=25. For a random string of
  length n, generate a number between 1
  and 26^n. Convert from base 10 to base
  26, using symbols from your chosen
  alphabet.

Here's a PHP implementation.  I won't guaranty that there isn't an off-by-one error or two in here, but any such error should be minor:
<?php
$n = 5;

var_dump(randstr($n));

function randstr($maxlen) {
        $dict = 'abcdefghijklmnopqrstuvwxyz';
        $rand = rand(0, pow(strlen($dict), $maxlen));
        $str = base_convert($rand, 10, 26);
        //base convert returns base 26 using 0-9 and 15 letters a-p(?)
        //we must convert those to our own set of symbols
        return strtr($str, '1234567890abcdefghijklmnopqrstuvwxyz', $dict);
}

A: Edit: This answer isn't quite right. See the bottom for a disproof. I'll leave it up for now in the hope someone can come up with a variant that fixes it.
It's possible to do this without calculating the length separately - which, as others have pointed out, requires raising a number to a large power, and generally seems like a messy solution to me.
Proving that this is correct is a little tough, and I'm not sure I trust my expository powers to make it clear, but bear with me. For the purposes of the explanation, we're generating strings of length at most n from an alphabet a of |a| characters.
First, imagine you have a maximum length of n, and you've already decided you're generating a string of at least length n-1. It should be obvious that there are |a|+1 equally likely possibilities: we can generate any of the |a| characters from the alphabet, or we can choose to terminate with n-1 characters. To decide, we simply pick a random number x between 0 and |a| (inclusive); if x is |a|, we terminate at n-1 characters; otherwise, we append the xth character of a to the string. Here's a simple implementation of this procedure in Python:
def pick_character(alphabet):
  x = random.randrange(len(alphabet) + 1)
  if x == len(alphabet):
    return ''
  else:
    return alphabet[x]

Now, we can apply this recursively. To generate the kth character of the string, we first attempt to generate the characters after k. If our recursive invocation returns anything, then we know the string should be at least length k, and we generate a character of our own from the alphabet and return it. If, however, the recursive invocation returns nothing, we know the string is no longer than k, and we use the above routine to select either the final character or no character. Here's an implementation of this in Python:
def uniform_random_string(alphabet, max_len):
  if max_len == 1:
    return pick_character(alphabet)
  suffix = uniform_random_string(alphabet, max_len - 1)
  if suffix:
    # String contains characters after ours
    return random.choice(alphabet) + suffix
  else:
    # String contains no characters after our own
    return pick_character(alphabet)

If you doubt the uniformity of this function, you can attempt to disprove it: suggest a string for which there are two distinct ways to generate it, or none. If there are no such strings - and alas, I do not have a robust proof of this fact, though I'm fairly certain it's true - and given that the individual selections are uniform, then the result must also select any string with uniform probability.
As promised, and unlike every other solution posted thus far, no raising of numbers to large powers is required; no arbitrary length integers or floating point numbers are needed to store the result, and the validity, at least to my eyes, is fairly easy to demonstrate. It's also shorter than any fully-specified solution thus far. ;)
If anyone wants to chip in with a robust proof of the function's uniformity, I'd be extremely grateful.
Edit: Disproof, provided by a friend:
dato: so imagine alphabet = 'abc' and n = 2
dato: you have 9 strings of length 2, 3 of length 1, 1 of length 0
dato: that's 13 in total
dato: so probability of getting a length 2 string should be 9/13
dato: and probability of getting a length 1 or a length 0 should be 4/13
dato: now if you call uniform_random_string('abc', 2)
dato: that transforms itself into a call to uniform_random_string('abc', 1)
dato: which is an uniform distribution over ['a', 'b', 'c', '']
dato: the first three of those yield all the 2 length strings
dato: and the latter produce all the 1 length strings and the empty strings
dato: but 0.75 > 9/13
dato: and 0.25 < 4/13

A: What you need to do is generate your length and then your string as two distinct steps.  You will need to first chose the length using a weighted approach.  You can calculate the number of strings of a given length l for an alphabet of k symbols as k^l.  Sum those up and then you have the total number of strings of any length, your first step is to generate a random number between 1 and that value and then bin it accordingly.  Modulo off by one errors you would break at 26, 26^2, 26^3, 26^4 and so on.  The logarithm based on the number of symbols would be useful for this task.
Once you have you length then you can generate the string as you have above.

A: // Note space as an available char
alphabet = "abcdefghijklmnopqrstuvwxyz "

result_string = ""

for( ;; )
{
    s = ""

    for( i = 0; i < n; i++ )
        s += alphabet[rand(0, 26)]

    first_space = n;

    for( i = 0; i < n; i++ )
        if( s[ i ] == ' ' )
        {
            first_space = i;
            break;
        }

    ok = true;

    // Reject "duplicate" shorter strings
    for( i = first_space + 1; i < n; i++ )
        if( s[ i ] != ' ' )
        {
            ok = false;
            break;
        }

    if( !ok )
        continue;

    // Extract the short version of the string
    for( i = 0; i < first_space; i++ )
        result_string += s[ i ];

    break;
}

Edit: I forgot to disallow 0-length strings, that will take a bit more code which I don't have time to add now.
Edit: After considering how my answer doesn't scale to large n (takes too long to get lucky and find an accepted string), I like paxdiablo's answer much better. Less code too.

A: Personally I'd do it like this:
Let's say your alphabet has Z characters. Then the number of possible strings for each length L is:

L | Z
--------------------------
1 | 26
2 | 676 (= 26 * 26)
3 | 17576 (= 26 * 26 * 26)

...and so on.
Now let's say your maximum desired length is N. Then the total number of possible strings from length 1 to N that your function could generate would be the sum of a geometric sequence:

(1 - (Z ^ (N + 1))) / (1 - Z)

Let's call this value S. Then the probability of generating a string of any length L should be:

(Z ^ L) / S

OK, fine. This is all well and good; but how do we generate a random number given a non-uniform probability distribution?
The short answer is: you don't. Get a library to do that for you. I develop mainly in .NET, so one I might turn to would be Math.NET.
That said, it's really not so hard to come up with a rudimentary approach to doing this on your own.
Here's one way: take a generator that gives you a random value within a known uniform distribution, and assign ranges within that distribution of sizes dependent on your desired distribution. Then interpret the random value provided by the generator by determining which range it falls into.
Here's an example in C# of one way you could implement this idea (scroll to the bottom for example output):
RandomStringGenerator class
public class RandomStringGenerator
{
    private readonly Random _random;
    private readonly char[] _alphabet;

    public RandomStringGenerator(string alphabet)
    {
        if (string.IsNullOrEmpty(alphabet))
            throw new ArgumentException("alphabet");

        _random = new Random();
        _alphabet = alphabet.Distinct().ToArray();
    }

    public string NextString(int maxLength)
    {
        // Get a value randomly distributed between 0.0 and 1.0 --
        // this is approximately what the System.Random class provides.
        double value = _random.NextDouble();

        // This is where the magic happens: we "translate" the above number
        // to a length based on our computed probability distribution for the given
        // alphabet and the desired maximum string length.
        int length = GetLengthFromRandomValue(value, _alphabet.Length, maxLength);

        // The rest is easy: allocate a char array of the length determined above...
        char[] chars = new char[length];

        // ...populate it with a bunch of random values from the alphabet...
        for (int i = 0; i < length; ++i)
        {
            chars[i] = _alphabet[_random.Next(0, _alphabet.Length)];
        }

        // ...and return a newly constructed string.
        return new string(chars);
    }

    static int GetLengthFromRandomValue(double value, int alphabetSize, int maxLength)
    {
        // Looping really might not be the smartest way to do this,
        // but it's the most obvious way that immediately springs to my mind.
        for (int length = 1; length <= maxLength; ++length)
        {
            Range r = GetRangeForLength(length, alphabetSize, maxLength);
            if (r.Contains(value))
                return length;
        }

        return maxLength;
    }

    static Range GetRangeForLength(int length, int alphabetSize, int maxLength)
    {
        int L = length;
        int Z = alphabetSize;
        int N = maxLength;

        double possibleStrings = (1 - (Math.Pow(Z, N + 1)) / (1 - Z));
        double stringsOfGivenLength = Math.Pow(Z, L);
        double possibleSmallerStrings = (1 - Math.Pow(Z, L)) / (1 - Z);

        double probabilityOfGivenLength = ((double)stringsOfGivenLength / possibleStrings);
        double probabilityOfShorterLength = ((double)possibleSmallerStrings / possibleStrings);

        double startPoint = probabilityOfShorterLength;
        double endPoint = probabilityOfShorterLength + probabilityOfGivenLength;

        return new Range(startPoint, endPoint);
    }
}

Range struct
public struct Range
{
    public readonly double StartPoint;
    public readonly double EndPoint;

    public Range(double startPoint, double endPoint)
        : this()
    {
        this.StartPoint = startPoint;
        this.EndPoint = endPoint;
    }

    public bool Contains(double value)
    {
        return this.StartPoint <= value && value <= this.EndPoint;
    }
}

Test
static void Main(string[] args)
{
    const int N = 5;
    const string alphabet = "acegikmoqstvwy";
    int Z = alphabet.Length;

    var rand = new RandomStringGenerator(alphabet);

    var strings = new List<string>();
    for (int i = 0; i < 100000; ++i)
    {
        strings.Add(rand.NextString(N));
    }

    Console.WriteLine("First 10 results:");
    for (int i = 0; i < 10; ++i)
    {
        Console.WriteLine(strings[i]);
    }

    // sanity check
    double sumOfProbabilities = 0.0;

    for (int i = 1; i <= N; ++i)
    {
        double probability = Math.Pow(Z, i) / ((1 - (Math.Pow(Z, N + 1))) / (1 - Z));
        int numStrings = strings.Count(str => str.Length == i);

        Console.WriteLine("# strings of length {0}: {1} (probability = {2:0.00%})", i, numStrings, probability);

        sumOfProbabilities += probability;
    }

    Console.WriteLine("Probabilities sum to {0:0.00%}.", sumOfProbabilities);

    Console.ReadLine();
}

Output:

First 10 results:
wmkyw
qqowc
ackai
tokmo
eeiyw
cakgg
vceec
qwqyq
aiomt
qkyav
# strings of length 1: 1 (probability = 0.00%)
# strings of length 2: 38 (probability = 0.03%)
# strings of length 3: 475 (probability = 0.47%)
# strings of length 4: 6633 (probability = 6.63%)
# strings of length 5: 92853 (probability = 92.86%)
Probabilities sum to 100.00%.

A: My idea regarding this is like:
you have 1-n length string.there 26 possible 1 length string,26*26 2 length string and so on.
you can find out the percentage of each length string of the total possible strings.for example percentage of single length string is like
((26/(TOTAL_POSSIBLE_STRINGS_OF_ALL_LENGTH))*100).
similarly you can find out the percentage of other length strings.
Mark them on a number line between 1 to 100.ie suppose percentage of single length string is 3 and double length string is 6 then number line single length string lies between 0-3 while double length string lies between 3-9 and so on.
Now take a random number between 1 to 100.find out the range in which this number lies.I mean suppose for examplethe number you have randomly chosen is 2.Now this number lies between 0-3 so go 1 length string or if the random number chosen is 7 then go for double length string.
In this fashion you can see that length of each string choosen will be proportional to the percentage of the total number of that length string contribute to the all possible strings.
Hope I am clear.
Disclaimer: I have not gone through above solution except one or two.So if it matches with some one solution it will be purely a chance.
Also,I will welcome all the advice and  positive criticism and correct me if I am wrong.
Thanks and regard
Mawia

A: Matthieu: Your idea doesn't work because strings with blanks are still more likely to be generated. In your case, with n=4, you could have the string 'ab' generated as 'a' + 'b' + '' + '' or '' + 'a' + 'b' + '', or other combinations. Thus not all the strings have the same chance of appearing.

redpajama_set_name: RedPajamaStackExchange


text:
Underground Theory
Underground Theory aired on Sydney community radio station Radio Skid Row 2RSR 88.9 FM on Thursday nights from 11:30 PM to 1:30 AM starting in late 1995 and running until late 1996. It then changed its name to Diggin' In The Crates and in 1997 moved to a new time slot of 4PM to 6PM on Saturday afternoons.
- Robert Sacchinelli
8 Episodes in the Archive
February 22, 1996 2RSR (88.9 FM) Sydney, AU
March 1, 1996 2RSR (88.9 FM) Sydney, AU
March 14, 1996 2RSR (88.9 FM) Sydney, AU
April 4, 1996 2RSR (88.9 FM) Sydney, AU
April 11, 1996 2RSR (88.9 FM) Sydney, AU
June 13, 1996 2RSR (88.9 FM) Sydney, AU
DJs/Hosts

redpajama_set_name: RedPajamaCommonCrawl


"Sunrise", 5-room house 120 m2 on 2 levels. Bright, partly renovated in 2015, practical and comfortable furnishings: living/dining room with satellite TV. Exit to the terrace. 1 double bedroom with shower/bidet/WC. Exit to the terrace. 1 room with 3 beds. Exit to the terrace. Kitchen (4 hot plates, oven, freezer). Bath/bidet/WC. Upper floor: (exterior staircase), 1 double bedroom. Exit to the terrace. Living/dining room with dining table, kitchen corner and satellite TV (flat screen). Bath/bidet/WC. Air-conditioning, forced-air heating (extra). Heating available only from 01.11. to 31.03. 2 large terraces, small garden. Terrace furniture, deck chairs. Marvellous panoramic view of the sea. Facilities: washing machine. Internet (WiFi, free). Suitable for families.


Subject Ives, Edward B. (Edward Bernard), 1855-1903, USMA 1878. ; Ives, Edward B. (Edward Bernard), 1855-1903, USMA 1878 -- Portraits. ; United States Military Academy -- Faculty.
Description Portrait of Edward Bernard Ives. CU 2731.


Bharat Scouts and Guides Madhya Pradesh has liberated A latest job notification in regard to BSGMP Recruitment to inform the Ambitious, fascinated and proactive Job appliers for the 07 vacant positions of District Organization Commissioner, Assistant. Eligible Individuals can apply for BSGMP vacancy by submitting their prescribed application form before the last date that is 15th November 2017.
Education Info: Aspirants must have 8th / 10th / Graduation Degree from well recognized Board/ University/ Institute according to post.
Age of contenders must be between 18 to 45 Years as on 01-01-2018.
Pay Scale: Selected aspirants for District Organization Commissioner, Assistant will get the salary pay band of Rs. 4000 - 6000/- (For Post 1), Rs. 3050 - 4590/- (For Post 2), Rs. 2550 - 3200/- (For Post 3).
Contender will be recruited against this recruitment on the basis of their performance in Written Exam/Interview which is about to be conducted by the recruitment committee of organization.
Job seekers are interested to apply for above mentioned positions firstly they need to go through the official website that is http://www.mpinfo.org.
Closing Date of Offline Submission of Applications Is : 15-11-2017.
Check BSGMP Recruitment Notification Here.
Aspirants can also get latest updates about BSGMP Vacancies by bookmarking this page using CTRL+D.


text:
Connecting with Different Cultures Through Travel
By Tom Barber, 7th May, 2019 , Culture
Despite the dangerously polarising effect of social media and unscrupulous politicians, we all share the same hopes and fears, the same fundamental human condition, and there's no better way to remind yourself of these universal truths than through travel. Yes, the clothing, customs, cuisine and all-round culture in your destination may be deliciously different, but they all celebrate the same basic humanity. Returning home feeling a little more connected with your fellow man has to be the greatest reward in travel...
Bushmen of the Kalahari, Botswana
The Zu'hoasi bushmen of the Kalahari Desert eke out a hunter-gatherer existence almost unchanged in the last two thousand years. We can arrange for a few privileged guests to spend time with a local tribe, learning about their way of life; from hunting to marriage and their religious beliefs, all in the company of a guide who has lived alongside them for decades. To avoid any accusations of voyeurism, it's all done incredibly sensitively, and many of our clients come away from the experience radically reassessing their world view and vowing to simplify their existence.
When to Go: You can meet the Zu'hoasi Bushmen all year around, but travel in the dry season (June to September) is best.
Timkat Festival, Ethiopia
Enkutatash, Hidar Tsion, Debre Damo; the list of Ethiopian festivals might read like the cast of a Star Wars film, but these ancient celebrations are far, far away from George Lucas's intergalactic oeuvre on the cultural spectrum. Arguably the most idiosyncratic of all is Timkat - celebrating the baptism of Jesus - where thousands of white-robed worshippers swim in the holy Fasilides' Bath in the medieval city of Gondar. Join our small group tour to experience Timkat and more of this magical country with an expert tour leader who will bring it all even more vividly to life.
When to Go: Timkat falls on the 19th or 20th of January each year. Ethiopia is generally best visited from September to February.
Longhouse Homestay, Malaysia
The Iban Tribe were some of the most revered warriors in Malaysian Borneo, fiercely defending their territory and earning a reputation as headhunters in the process. Today the Iban have left their fearsome customs behind, but retained a traditional way of life, inhabiting longhouses and communicating in the jaku Iban language. Adventurous travellers can stay overnight in an Iban longhouse, sleeping under a mozzie net in the communal area, dining (a highlight) and drinking with the tribe before bed. Prepare to leave with full bellies, lasting memories - and heads firmly attached.
When to Go: Malaysian Borneo's optimum weather coincides with our summer and stays in a traditional longhouse are best in these drier months.
Viticulture in Bordeaux, France
As a cultural destination France has got the lot, thanks to an almost unparalleled roll call of artists, composers, poets, designers and architects who have left their indelible cultural marks on this remarkably diverse country. But while we love those other art forms, is there any more closely tied to what it is to be French than the art of winemaking? Our concept of the Big Short Break could have been invented just for a trip to the Bordeaux region and the delectable Sources de Caudalie hotel, where guests can enjoy wine-based spa treatments, fine food and, of course, wine tasting. Santé!
When to Go: Any time of year is great, though perhaps the most interesting time is around the vendange (harvest) season in late summer/early autumn, when the weather is also usually excellent.
Cities of the Silk Road, Uzbekistan
Hidden in the heart of central Asia, Uzbekistan is one of our favourite off the beaten track cultural destinations. Famed for its vital location along the ancient Silk Road to Europe, as well as its magnificent turquoise tiled Persian-style mosques and mausoleums, this is a country steeped in fascinating history and striking architecture. Get to grips with both on a guided small group tour to Samarkand and the other ancient cities along the Silk Road.
When to Go: Our expert guide Amelia is leading her next Silk Road Tour between the 10th and 24th May 2019. We can also arrange tailor-made tours and recommend travelling to Uzbekistan in spring or autumn.
Enrol Into The School Of Life
It might sound clichéd, but travel is one of life's greatest teachers. Whether you want to encourage your kiddos to learn by taking them to see the frescos in Florence, or by meeting the cast of The Lion King and understanding their habitat on a Big Five safari in South Africa, our travel…
Cultural spots in San Sebastián
Kaixo (hello in Basque) and welcome to San Sebastian, or Donostia as it's known locally. The city is the capital of Spain's brilliant and ever so slightly batty Basque region. Here's all you need to know about this peaceful and beautiful city, with its miniature Rio de Janeiro vibe, complete…
Mashatu: The Land of the Giants
Secreted away in a hidden corner of south-eastern Botswana lies the Tuli Block, a little known game reserve lying on the South African and Zimbabwean borders. Unbeknown to many, 'here be giants'...
Just How Much Has Cuba Changed?
It was with some trepidation that I booked my first return to Cuba since my backpacking days of 1994 - I'd spent over a month there and it still ranks in the top five of the best ever holidays. Just how much would this once unique nation have changed and how would the experience differ from…
Five Unmissable Experiences in Japan
Japan is one of our hottest destinations at the moment and, with a rather large rugby tournament fast approaching in 2019, it's only going to become more popular. Fortunately, we're on hand to make sure you very much catch the worm early doors and our experts can recommend the very best…
Live Like a Local in: Marrakech
You might think you've been there, done that and got the metaphorical (and sometimes literal) Moroccan rug, but hidden among the souqs and labyrinthine side streets of Marrakech, there are always more secret spots waiting to be discovered…
The Best Secret Glamping Locations in the World
A very fussy princess could once feel a pea at the bottom of several huge mattresses and 20 feather beds placed beneath her. Now, we aren't saying we would necessarily be able feel a minute garden pea (no matter how many corgis we buy, we are sadly still not 'HRH' status), but when it comes…
Seven Reasons to visit Ortigia Now
One of the prettiest places in south-east Sicily, Ortigia is a small island which sits within Syracuse and is less than an hour's drive south of Catania. Here are my reasons why you should visit right now:
Destination Inspiration for Slow Travel
The frenetic pace of modern life is a common complaint, but since the world shows no signs of stopping so we can get off, we need a few less radical solutions. Enter: the concept of slow travel; an opportunity to take your foot off the gas and enjoy the world around you at a gentler pace...
Reboot Your Resolutions
'New year, new me'. Many of us have uttered those immortal words, certain that this year we really will start morning spinning classes and dedicate our evenings to learning Spanish. Almost inevitably, once the first week of best intentions wears off, those resolutions start to slip. In fact,…
What it's Like To Stay in a Japanese Ryokan
On my recent trip to Japan, I had the opportunity to experience five different ryokans - traditional Japanese inns - and I can highly recommend the experience. It is completely different to staying in a hotel and you can get a great feel for the original style of Japanese home life.


text:
Private Sector Leading The Way
The private sector is generally considered the engine of growth and the Reserve Bank of Fiji says this sector is taking the lead again in driving our growth. Governor, Barry
by rachna lal and maraia vula, suva
From left: The late Patterson Shipping Director Trevor Patterson, Prominent Suva lawyer Graham Leung and Patterson Shipping Director George Patterson. Source: Graham Leung FB Page.
The private sector is generally considered the engine of growth and the Reserve Bank of Fiji says this sector is taking the lead again in driving our growth.
Governor, Barry Whiteside, made these comments yesterday while presenting on the economic status of our country at Finance Minister Aiyaz Sayed-Khaiyum's Special Budget Forum at the Grand Pacific Hotel in Suva.
In the past two years, investment to GDP has exceeded Government's target of 25 per cent.
Mr Whiteside said that target hasn't been hit for many years going back as far as 1980s.
He highlighted that 15 per cent of this was from the private sector which meant that 15% of GDP is contributed by the private sector as opposed to 2010 when it was 3.5 per cent of GDP.
"It shows the confidence of the business community," he said.
Meanwhile, in a survey conducted by the Reserve Bank in June on Business Expectations, 60 per cent of the 250 large companies in Fiji surveyed, said they will invest in buildings in the next 12 months.
Mr Whiteside also highlighted that 56 per cent of the respondents said they will be investing in plant and machinery in the next three months.
Whilst 75 per cent said they will invest in plant and machinery in the next 12 months from June of this year.
Mr Whiteside said this showed the confidence businesses have.
"Because if you invest in buildings, it shows you are expanding. If you invest in plant and equipment, it might be just to replace the machinery. But the numbers seem really strong for us," he said.
Feedback: rachnal@fijisun.com.fj
Asia PacificGovernment


text:
About the Accra Team
Check out our meetup page to find the next Accra event!
Email: You can contact us using our email: accra _at_ wimlds.org
The Accra Team
Salomey Osei
Miss Salomey Osei holds a Bachelor of Science degree in Mathematics from the Kwame Nkrumah University of Science and Technology (KNUST), Ghana. She graduated from the African Institute for Mathematical Sciences (AIMS Cameroon) with a Master of Science in Mathematics. Currently, she has been awarded the Google and Facebook scholarship to study a Master of Science in Machine Intelligence. She aspires to be one of the few researchers in the area of Machine Learning applied to Finance and also have an interest in translating African languages especially Ghanaian languages. Her long term goal is to extend this knowledge to others by lecturing in a University in Ghana.
Deborah Dormah Kanubala
Ms. Kanubala holds a master's degree in Mathematical Science with a specialization in Big Data and financial mathematics. She is currently enrolled in the African Masters In Machine Intelligence program in Ghana. Her research interest is in the applications of machine learning algorithms in the development of robust credit scoring models. She is a recipient of several awards and grants including the Mastercard Foundation scholars grant, Alumnode grant from Germany and MIT Prize and google awards during Indaba in Kenya and Indabax Ghana respectively. Ms Kanubala was also voted among the 20 Most influential people in Northern Ghana, STEM Category. Fun Fact:I love to travel around the world, sing and dance : )
Aseda Addai-Deseh
Aseda is a Data Scientist at Wave-2 Analytics Limited, based in Ghana. She holds a BSc. in Computer Science from the Kwame Nkrumah University of Science and Technology, Ghana. She is a Delta Analytics Global Teaching Fellow and is currently the lead for the PyLadies Ghana Data Science subgroup where she mentors young women pursuing a career in Data Science. She is also a member of the Ghana Data Science Summit organizing team.


text:
No more sleeping at the wheel: There's no wheel in fully driverless cars!
AMEinfo Staff January 12, 2018
autonomous carsdriverless carGeneral Motors
Can you imagine yourself riding in a car with no pedals or wheel at all?
You should probably start getting used to the idea because one year from now the first fully automated vehicle will be released by General Motors (GM) in the US, but someone in the GCC will flaunt it then, for sure.
According to Business Insider, the automaker stressed that the fully autonomous vehicle would emphasize safety without creating any legal problems.
Dubai has laid the ground for launching semi-autonomous vehicles in the years to come.
Read: The UAE's rain-dance needs the right moves or risk being in hot water
According to Auto Middle East, a website for car news, the first step in introducing driverless cars in Dubai began in August 2017 as the Emirates Authority for Standardisation and Metrology (ESMA) issued a preparation of regulation requirements for autonomous vehicles in the UAE.
ESMA will work with the Federal Authority for Land and Maritime Transport, the Telecommunications Regulatory Authority, the Dubai Police, and the Roads and Transport Authority to draft the first set of regulations.
Driverless Dubai
The Emirate also launched a number of initiatives to move forward in this direction.
The Roads and Transport Authority (RTA) issued 'Dubai Autonomous Transportation Strategy' aiming to transform 25% of the total transportation in Dubai to autonomous mode by 2030, involving 5 million daily trips, saving AED 22 billion ($6bn) in annual economic costs.
Check this: Fear Factor: Crypto coins falling, $billions lost, and future uncertain
The strategy includes the launch of 'Dubai World Autonomous Transportation Challenge' to encourage the world's most innovative international companies, academic institutions and centers of research and development to test the latest advances in this technology.
Meanwhile, RTA said it had signed in February 2017 an agreement with Tesla Inc., a world-leading manufacturer of autonomous electric vehicles, for buying 200 hybrid electric vehicles fitted with several components of autonomous driving technologies.
Tesla made in September the first delivery of 50 cars, and the new fleet includes both Model S sedans and Model X SUVs, each equipped with Tesla's latest Autopilot software.
Also, a joint venture, signed on November 1st, saw the RTA and Emaar Properties study the launch of autonomous vehicles while using smart traffic signals at crossings between Dubai Mall and the Boulevard areas.
What's new off the factory?
Fully autonomous manufacturers
According to Inside EVs, a website for electric vehicles news, VW will start testing fully autonomous cars in the near future.
Don't miss: How does Kuwait reduce a $23.6bn budget deficit? Layoffs!
Further down the line, fleets of self-driving cars will be launched in 2-5 cities all over the world by 2021, according to Inside EVs.
It said that Audi also has the Aicon envisioned with level 5 autonomy, meaning it doesn't have a steering wheel or pedals.
Also, global startup Nio unveiled plans to sell a fully autonomous electric car in the US market by 2020.
Qatar Tribune revealed that the car will be "a digital companion, a robot on wheels" equipped with "an artificial intelligence engine with an intuitive human interface, providing verbal and visual connections both within the vehicle and with the outside world."
Saudi Bakr bin Laden gives up SBG control: Campaign on power brokers full on!
Warning: Bitcoin bubble set to burst, return to May 10, 2017 levels at $1800


Chris Fite-Wassilak is a writer and curator based in London. He frequently contributes to Art Monthly, Tate Etc., and other journals. His essays and articles elaborate on art, cultural histories and moments that break open to the uncertainties of chance.
Available to order from your local bookshop or online.


text:
Pro Bike
Vali Höll's Trek Session with a prototype RockShox BlackBox Boxxer fork
Custom paint and a host of new or unreleased parts for the 20-year-old Austrian
This competition is now closed
By Robin Weaver, George Scott
Published: August 26, 2022 at 12:05 pm
Vali Höll goes into Saturday's UCI World Championship downhill elite women's race among the leading riders – and this is the custom-painted Trek Session that the Austrian will ride.
Höll arrived in Les Gets, France, in red-hot form having won the Mont St. Anne round of the World Cup in Canada, only last week. Can the 20-year-old, who won the junior world title in 2019, stand on the top step of the elite podium?
Höll gets this smart Trek Session for the Les Gets worlds, with a slew of new or unreleased SRAM/RockShox parts.
That includes a BlackBox Boxxer fork which, we're guessing, features the new Charger 3 damper and DebonAir+ air spring, introduced on the 2023 RockShox Pike, Lyrik and ZEB forks earlier this year. From what we can see here, we reckon Höll is also using beefier 38mm upper tubes, as found on the single-crown RockShox Zeb fork.
The RockShox Super Deluxe Coil Ultimate shock is also new, while the BlackBox kit extends to the yet-to-be-released SRAM Code (we assume) brake calipers.
As for the Trek Session high-pivot bike itself, this is different to the production model, with an updated idler/chainstay arrangement for Höll.
There's lots to look at here, so let's get stuck in.
Vali Höll's custom Trek Session ready for action at the Les Gets World Championships in France. Alongside the special paint job, look closely and you'll see that the machine in front of you here, is a little different to the production version of the bike.
Jack Tennyson / Our Media
A BlackBox Boxxer fork, from headline sponsor RockShox, sits proudly at the front of Höll's bike. SRAM (parent company of RockShox) BlackBox components will only ever be found on the bikes of the brand's top-performing sponsored riders, as part of the RockShox's special prototype, development and testing program. We're guessing that this BlackBox Boxxer features some form of the new Charger 3 damper, DebonAir+ air spring and, by the looks of it, beefier 38mm upper tubes as found on the single-crown ZEB.
The new RockShox Super Deluxe Coil Ultimate shock takes care of the 200mm of rear-wheel travel. Look closely at the lower shock eyelet and you'll see a flip-chip that'll let you tune how progressive the back-end of the bike is. At this point, Höll (well, her mechanic) has it set to 25 per cent rather than 20 per cent, as this will likely work better with the coil shock fitted here.
Höll's not quite found her junior form (where she completely dominated the category for the duration of the time she was in it) since joining the elite women's field, but still managed to clinch the overall World Cup title in 2021 and now has a slew of wins and podiums under her belt. After recently winning the Mont St. Anne World Cup in Canada, she's looking to carry that winning form over to Les Gets and earn her first senior set of rainbow stripes.
SRAM Code RSC brake levers and the latest HS2 rotors (which are 200mm rather than the bigger 220mm options) are items we're all familiar with. The new calipers that can be seen on Höll's bike are something new and rather special, though. More on these in a moment.
Lever angle is a really personal thing and will vary from rider to rider.
Just in case you wondered about Höll's bar setup, SRAM's Truvativ bars have the details usefully printed on them. Of course, we're assuming the bars are left at the full 760mm width, although they could be cut down further. At 20mm, the rise is relatively low, compared to what we're seeing elsewhere in the pits.
One of the features of the new 2023 RockShox Super Deluxe Coil Ultimate shock is the Hydraulic Bottom Out adjuster which allows riders to fine-tune the final part of the shock's stroke.
The BlackBox kit extends further than just the fork. Here, you can see the new yet-to-be-released Code (we're assuming) calipers. Again, only a handful of riders are fortunate enough to sport these, Höll being one of them.
If you think this Session looks a little different to the production version, you'd be right. We're used to seeing the chainstay wrap around either side of the idler wheel, yet here, it's mounted externally. Trek could have potentially shifted its position to alter the level of anti-squat the bike has, or upped the size of the idler.
The Boxxer Club. If you're in this, chances are you're one of the best in the world at riding bikes down hills.
These CushCore valves are a clear indicator that Höll is running puncture-preventing/bump-damping tyre inserts at the front and rear of her Session. The DT Swiss EX511 wheels are running on Maxxis Minion DHR II tyres.
The Ergon SM Downhill Pro Titanium is Höll's saddle of choice.
There's certainly no doubting who this rather lovely Trek Session belongs to.
Robin Weaver
Technical editor-in-chief
Rob Weaver is BikeRadar's technical editor-in-chief. Rob manages all of the testing here at BikeRadar and across our magazines, Mountain Biking UK and Cycling Plus. Rob first graced the pages of MBUK back in 2001 when working as a freelance writer and went on to start testing bikes for the title in 2007. In 2010 he joined the team full-time and has been keeping a close eye on all things test-related ever since. Rob's expansive knowledge of bikes comes courtesy of his passion for racing. He cut his teeth racing cross-country mountain bikes in the early 90s before finding his feet in downhill. After many years competing on the UK national circuit (including a year attempting to race UCI DH World Cups), Rob realised his know-how and passion for bike setup, tech and writing clearly outweighed his racing ability. A degree in sports technology and decades of riding experience all help to give Rob a thorough understanding of what's needed to create a great bike or product. While Rob's a mountain biker at heart and never happier than when he's sliding down a Welsh hillside, he's more than happy to put the miles in on the road or gravel bike, too.
George Scott is BikeRadar's editor-in-chief. He has been writing about bikes for more than a decade and riding them for much longer. He's a road cyclist at heart and is happiest in the mountains, even if he can't climb them particularly quickly. George has ridden the Etape du Tour, Maratona dles Dolomites and Haute Route sportives, but has also caught the gravel riding bug. George also contributes to the BikeRadar Podcast and YouTube channel, and, as well as being the former editor of RoadCyclingUK.com, has also written about cycling for Rouleur, Cyclist.co.uk and T3.
Sponsored Deals
Save 30% & Choose your Castelli Jacket, worth £70!
Subscribe to Cycling Plus magazine today from just £58.99 by annual Direct Debit and get a Castelli Squadra Stretch Jacket!
Hurry, available whilst stocks last
MBUK magazine
Save 35% + Lezyne pocket drive HV pump when you subscribe to MBUK magazine.
Compare cycling insurance deals


Campbell, an Ennis native who has been at Oregon for more than 30 years, laughs at the story.
Some of the Oregon influence can be seen in the Ohio State offense, notably tempo.
But the Ducks are used to seeing other teams try to do what they do.
Helfrich doesn't sweat it too much.


text:
HomeContentAccepted Issues101(3) May 2006
MEM INST OSWALDO CRUZ, RIO DE JANEIRO, 101(3) May 2006
PAGES: 239-243 DOI: S0074-02762006000300002 Editorial
In vitro susceptibility to antifungal agents of environmental Cryptococcus spp. isolated in the city of Ribeirão Preto, São Paulo, Brazil
Reginaldo dos Santos Pedroso1; Joseane Cristina Ferreira; Regina Celia Candido
Laboratório de Micologia Clínica, Departamento de Análises Clínicas, Toxicológicas e Bromatológicas, Faculdade de Ciências Farmacêuticas de Ribeirão Preto, Universidade de São Paulo, Via do Café, s/nº, 14040-903 Ribeirão Preto, SP, Brasil
Infections by Cryptococcus strains other than C. neoformans have been detected in immunocompromised patients. Of these strains, three are considered human pathogens: C. albidus, C. laurenttii, and C. uniguttulatus. This study deals with the in vitro susceptibility of Cryptococcus to drugs such as amphotericin B, itraconazole, fluconazole, and 5-fluorocytosine. Environmental Cryptococcus isolates (50) distributed as follows: C. neoformans var. neoformans (16), C. albidus (17), C. laurentii (14), and C. uniguttulatus (3) were evaluated by the micro and macrodilution techniques, according to EUCAST and NCCLS recommendations, respectively. Considering both methodologies the respective minimal inhibitory concentrations (MIC) were 0.125 and 2 µg/ml for amphotericin B, 0.06 and 8 µg/ml for itraconazole, and 0.5 and more than 64 µg/ml for fluconazole and 5-fluorocytosine. Agreement percentages for the two methodologies were 100% for amphotericin B and fluconazole for all the strains tested. For itraconazole, the agreement percentage was 81.3% in the C. neoformans strain and 100% for all the others. All species had a agreement percentage of 94.1 to 100% when susceptibility to 5-fluorocytosine was tested. It is concluded that environmental isolates of C. neoformans var. neoformans, C. albidus, C. laurentii, and C. uniguttulatus may show high MICs against certain drugs, suggesting in vitro primary resistance to the antifungals tested.
susceptibility
Cryptococcus spp.
Infections by Cryptococcus species other than C. neoformans are seldom described in the literature, but they do occur in immunocompromised patients, with hematological or oncologic diseases or are human immunodeficiency virus infected. Among the infective species, three are considered human pathogens, C. albidus, C. laurentii, and C. uniguttulatus (Johnson et al. 1998, McCurdy & Morrow 2001). Variable clinical manifestations are reported, such as instances of cutaneous infections (Kamalam et al. 1977, Johnson et al. 1998), ventriculitis (McCurdy & Morrow 2001), meningitis (Kordossis et al. 1998), fungemia (Loison et al. 1996, Johnson et al. 1998, Kordossis et al. 1998, Kunova & Krcmery 1999), pneumonia and pulmonary abscesses (Johnson et al. 1998).
The species in vitro susceptibility to antifungals is also not well known, although it is very important that this type of previous information guide the clinician in his choice of antifungals to a certain group of microorganisms (Aller et al. 2000).
Cryptococcus susceptibility studies reported so far are mostly related to clinical or environmental C. neoformans, while other clinically important species are poorly described (Franzot & Hamdan 1996, Alves et al. 2001, Garcia-Martos et al. 2002, Moraes et al. 2003).
In this report the in vitro antifungal susceptibility of different environmental yeast species of the Cryptococcus genus was evaluated, utilizing in broth micro and macrodilution methods according to guidelines of the National Committee for Clinical Laboratory Standards (NCCLS 2002).
Microorganisms tested - Environmental isolates in the city of Ribeirão Preto, state of São Paulo, Brazil, were distributed as follows: 16 C. neoformans var. neoformans, 17 C. albidus, 14 C. laurentii, and 3 C. uniguttulatus.
Susceptibility tests to antifungals - The antifungals tested were: amphotericin B (Fungizon, Bristol Myers Squibb do Brazil, Brazil), 5-fluorocytosine (Roche, Brazil), fluconazole (Pfizer, Sandwich, UK) and itraconazole (Janssen, Beerse, Belgium). Dimethyl sulfoxide (Vetec, Rio de Janeiro, Brazil) was used to prepare stock solutions of amphotericin B and itraconazole in the concentrations of 320 µg/ml. Aqueous solutions of fluconazole and 5-fluorocytosine, were prepared in sterile distilled water in the concentrations of 1280 µg/ml. Drug final concentrations in the tests were 16 to 0.03 µg/ml for amphotericin B and itraconazole and 64 to 0.25 µg/ml for fluconazole and 5-fluorocytosine. The culture medium, RPMI-1640 containing L-glutamine, but no sodium bicarbonate was supplemented with glucose (18 g/l) and buffered to pH 7 with 0.165M morpholinepropanesulfonic acid (MOPS), according to EUCAST (2002) recommendations. The primary yeast inocula equivalent to 0.5 in the McFarland scale (1 to 5 ' 106 cells/ml) were prepared in deionized sterile water according to NCCLS document M27-A2 (NCCLS 2002). The confirmation of inoculum sizes was determined with the final higher test inoculum for both macro and microdilution tests. These diluted yeast suspensions were mixed with a vortex, and diluted 1:10. One hundred microliter aliquots of the latter suspension were removed with a pipette, and this volume was spread onto a Sabouraud dextrose agar plate with a sterile, bent glass rod. Plates were incubated at 30 and 35ºC during 5 days, and the CFU per milliliter were determined. This allowed counts of 10 to 50 colonies per plate (Espinel-Ingroff et al. 1992, Rodriguez-Tudela et al. 2000, EUCAST 2002, NCCLS 2002).
Macrodilution method - One hundred microliter aliquots of each drug dilution were mixed, in a glass tube 13 ' 100 mm, with 900 µl of the RPMI-1640 containing 0.5 to 2.5 ' 106 cells/ml. Control tubes were prepared containing just drug diluents (negative controls) and others (positive controls) containing microorganism suspensions and drug diluents. All tubes, in duplicate, were incubated at 30oC during 48 h, except for C. neoformans var. neoformans and the control strains incubated at 35oC for the same time. Growth in each test tube was compared to the equivalent controls without drugs. Minimal inhibitory concentration (MIC), for azoles and 5-fluorocytosine, was defined as the smallest concentration inhibiting at least 50% of the control tube growth (0.5 ml of growth control plus 0.5 ml of uninoculated RPMI), and for amphotericin B as the smallest concentration able to completely inhibit (100%) growth.
Microdilution method - Ninety-six well plates containing 100 µl aliquots of each drug dilution/well were stored at 20oC for up to 30 days. The initial inoculum suspension, RPMI diluted (1:10) was the test material. In duplicate tests, 100 µl of the diluted suspension was added to each of the wells in the plates containing the drug. Positive and negative controls were established in separate wells. The plates were incubated at 30oC except for C. neoformans var. neoformans and control strains, which were incubated at 35oC. MIC, for azoles and 5-fluorocytosine, was defined as the smallest concentration inhibiting at least 50% of the control tube growth, and for amphotericin B as the smallest concentration able to completely inhibit (100%) growth.
Control microorganisms - Strains of Candida parapsilosis ATCC 22019 and C. krusei ATCC 6258 were used as controls.
Result analysis - The endpoints for fluconazole, itraconazole and 5-fluorocytosine were the ones suggested by NCCLS (2002) and the ones for amphotericin B by Rodriguez-Tudela et al. (1998). Microorganisms showing MICs ³ 2 µg/ml were considered resistant to amphotericin B; for itraconazole resistance was determined for MICs ³ 1 µg/ml, for 5-fluorocytosine ³ 32 µg/ml and ³ 64 µg/ml for fluconazole. By comparing the values in the micro and macrodilution methods the correlation analysis between MICs for each drug and microorganism was established. The values were considered equivalent when both were equal or differed by at the most two dilutions (reference value ± 2 dilutions). In other conditions the difference in values was expressed as units of dilution. Based on the result equivalence definition, the agreement percentage was calculated meaning the percentage of the total compared results, obtained in the two methods, considered as being equivalent (Pfaller & Barry 1994).
Controls, C. parapsilosis ATCC 22019 and C. krusei ATCC 6258 showed MIC values according to the NCCLS (2002) described range. The MICs and MIC intervals for the four drugs inhibiting 50% and 90% of the isolates (MIC50 and MIC90) are summarized in Tables I to IV.
Amphotericin B MIC range values were the smallest among the drugs tested and within the group C. laurentii was the largest (Table I). For itraconazole the widest MIC range was seen with C. neoformans var. neoformans, and C. albidus in both methods. The highest MIC50 and MIC90 were shown by C. albidus (Table II). Fluconazole had the highest MIC ranges in susceptibility tests with C. neoformans var. neoformans. The micro and macrodilution methods showed the highest MIC50 values for C. albidus; MIC90 values results were higher than 64 µg/ml for all strains, except C. laurentii, in both methods (Table III). 5-fluorocytosine showed the widest MIC ranges for all strains, the smallest being with C. uniguttulatus (Table IV).
Table V shows agreement percentages (AP) for the results obtained by the micro and macrodilution methods. It can be seen that for C. neoformans var. neoformans the index was 100% against amphotericin B, fluconazole and 5-fluorocytosine, considering ± 1 dilution, while for itraconazole the AP was 56.3 or 81.3% considering ± 1 or ± 2 dilutions respectively. For the other strains, AP was 100% against amphotericin B; APs of 82.3 and 100% were shown by C. albidus against itraconazole and 71.5 and 100% with C. laurentii considering ± 1 and ± 2 dilutions, respectively. To 5-fluorocytosinethe AP was 88.2 and 94.1% for C. albidus, and 85.7 and 100% for C. laurentii, ± 1 and ± 2 dilutions respectively. AP was 100% for both dilutions when C. uniguttulatus was tested against the four antifungals studied. The smallest APs were found for itraconazole and the strains C. neoformans var. neoformans and C. laurentii in dilution ± 1.
Antifungal susceptibility data of non C. neoformans strains are scarce in the literature, even if one considers strains isolated from patients (Kordossis et al. 1998, Bauters et al. 2001, Chen et al. 2001, McCurdy & Morrow 2001, Averbuch et al. 2002, Garcia-Martos et al. 2002, Quindos et al. 2004). The amphotericin B results obtained in both methods tested in this study indicated a similar MIC range. A small number of C. neoformans var. neoformans strains showed MIC values of 2 µg/ml suggesting in vitro resistance to the antifungal. Amphotericin B high MIC values for environmental C. neoformans var. neoformans have not been reported previously (Franzot & Hamdan 1996, Garcia-Martos et al. 2002, Moraes et al. 2003, Souza et al. 2005). For C. albidus, and C. uniguttulatus the MICs confirm the values of 1 µg/ml reported by Garcia-Martos et al. (2002). However, the same is not true for C. laurentii, which showed MICs of 2 µg/ml in our tests suggesting again a primary resistance to this antifungal. Based on these results, the testing of greater numbers of clinical and environmental isolates should be considered in order to not only profile the species behavior against the antifungal, but also to be attentive to resistance developments and future research on its mechanisms.
There are no reports of resistance to amphotericin B by C. albidus and C. laurentii even considering the different methodologies employed by several authors (Bauters et al. 2001, Chen et al. 2001, Averbuch et al. 2002).
All strains tested showed MIC90 values ³ 1 µg/ml for itraconazole, suggesting primary resistance in environmental strains. The values were lower for C. laurentii and high for C. uniguttulatus. The highest MIC50 value was found for C. albidus, indicating that these strains are more resistant to itraconazole when compared to C. neoformans var. neoformans and C. laurentii. Environmental C. neo-formans var. neoformans resistance to itraconazole is seldom reported in the literature (Garcia-Martos et al. 2002). Also, Brazilian studies (Franzot & Hamdan 1996, Alves et al. 2001, Moraes et al. 2003) did not show the presence of environmental C. neoformans strains resistant to this antifungal. However, 80% of C. albidus isolates were resistant to itraconazole as were C. uniguttulatus strains. Most strains of C. laurentii were sensitive to the drug confirming results by Garcia-Martos et al. (2002). Other reports indicate different resistance levels to itraconazole in clinical C. laurentii isolates (Bauters et al. 2001, Chen et al. 2001, Averbuch et al. 2002, Serena et al. 2004).
Fluconazole is one of the main drugs used in the treatment of meningeal cryptococcosis and frequently also in maintenance therapy. Most cases of C. neoformans meningitis resistant to the drug were reported in AIDS patients after long treatment periods and prophylaxis (Franzot & Hamdan 1996, Alves et al. 2001). MIC ranges for fluconazole were quite wide for all strains, but were smaller for C. laurentii suggesting that the antifungal is more active in this strain, which confirms previous results reported by Garcia-Martos et al. (2002) and Serena et al. (2004).
Most strains were resistant in vitro to 5-fluorocytosine, the drug with the highest MIC50 for all strains tested. Furthermore, clinical use of 5-fluorocytosine in the treatment of C. neoformans infections has been frequently associated to in vivo resistance development, despite in vitro variable results from different studies (Franzot & Hamdan 1996, Alexander & Perfect 1997, Alves et al. 2001, Moraes et al. 2003). Also, clinical isolates of C. laurentii and C. albidus show variable resistance to the antifungal (Kordossis et al. 1998, Bauters et al. 2001, Averbuch et al. 2002). Quindos et al. (2004) in a study in Spain, reported resistance indexes as high as 80%, with MIC values above 128 µg/ml.
Barchiesi et al. (1994) and Espinel-Ingroff et al. (1992) in comparative studies confirmed the correlation of broth macrodilution and microdilution techniques for in vitro antifungal susceptibility testing. The APs for broth macro and microdilution techniques in this report were considered adequate, since all combinations had percentages above 81% for ± 2 dilutions. Aller et al. (2000) consider that APs above 80%, in ± 2 dilutions is indeed an indication of a good correlation.
Previous reports by Barchiesi et al. (1994) concerning C. neoformans and antifungals fluconazole, 5-fluorocytosine and amphotericin B were confirmed in this study, showing APs above 92%, in ± 2 dilutions. The lower APs found for itraconazole suggest the necessity of further and better evaluation of the applied methods. It is possible that method optimization by a strict control of interfering variables, such as antifungal solubility, inoculum concentration and time of incubation might improve these percentages. It is important to emphasize the in vitro and in vivo correlation studies, that allow analysis and understanding of clinical data and to determine MIC ranges for C. neoformans and other emergent clinical strains.
According to the reported results, it is concluded that environmental isolates of C. neoformans var. neoformans, C. albidus, C. laurentii, and C. uniguttulatus may show high MICs for certain drugs, which preliminarily suggest in vitroprimary resistance. Amphotericin B and fluconazole showed the best APs for all strains tested, while for itraconazole and 5-fluorocytosine, APs were dependent on the strain.
Alexander BD, Perfect JR 1997. Antifungal resistance trends towards the year 2000. Implications for therapy and new approaches. Drugs 54: 657-678.
Aller AI, Martin-Mazuelos E, Gutierrez MJ, Bernal S, Chavez M, Recio FJ 2000. Comparison of the Etest and microdilution method for antifungal susceptibility testing of Cryptococcus neoformans to four antifungal agents. J Antimicrob Chemother 46: 997-1000.
Alves SH, Oliveira LT, Costa JM, Lubeck I, Casali AK, Vainstein MH 2001. In vitro susceptibility to antifungal agents of clinical and environmental Cryptococcus neoformans isolated in Southern of Brazil. Rev Inst Med Trop São Paulo 43: 267-270.
Averbuch D, Boekhout T, Falk R, Engelhard D, Shapiro M, Block C, Polacheck I 2002. Fungemia in a cancer patient caused by fluconazole-resistant Cryptococcus laurentii. Med Mycol 40: 479-484.
Barchiesi F, Colombo AL, McGough DA, Rinaldi MG 1994. Comparative study of broth macrodilution and microdilution techniques for in vitro antifungal susceptibility testing for yeasts by using the National Committee for Clinical Laboratory Standards proposed standard. J Clin Microbiol 32: 2494-2500.
Bauters TGM, Swinne D, Boekhout T, Noens L, Nelis HJ 2001. Repeated isolation of Cryptococcus laurentii from the oropharynx of an immunocompromized patient. Mycopathologia153: 133-135.
Chen MF, Chiou CC, Liu YC, Wang HZ, Hsieh KS 2001. Cryptococcus laurentii fungemia in a premature neonate. J Clin Microbiol 39: 1608-1611.
Espinel-Ingroff A, Kish CWJr, Kerkering TM, Fromtling RA, Bartizal K, Galgiani JN, Villareal K, Pfaller MA, Gerarden T, Rinaldi MG 1992. Collaborative comparison of broth macrodilution and microdilution antifungal susceptibility tests. J Clin Microbiol 30: 3138-3145.
EUCAST-European Committee on Antimicrobial Susceptibility Testing 2002. Discussion Document E. Dis. 7.1: Method for the determination of minimum inhibitory concentration (MIC) by broth dilution of fermentative yeasts, EUCAST, Muniz, p. 1-21.
Franzot SP, Hamdan JS 1996. In vitro susceptibilities of clinical and environmental isolates of Cryptococcus neoformans to five antifungal drugs. Antimicrob Agents Chemother 40: 822-824.
Garcia-Martos P, Noval JF, Garcia-Tapia A, Marin P, Puerto JL, Sepulveda A 2002. Sensibilidad a antifúngicos de especies de Cryptococcus de interés clínico. Med Clin 119: 211-213.
Johnson LB, Bradley SF, Kauffman CA 1998. Fungaemia due to C. laurentii and a review of non-neoformans crypto-coccaemia. Mycoses 41: 277-280.
Kamalam A, Yesudian P, Thambiah AS 1977. Cutaneous infection by Cryptococcus laurentii. Br J Dermatol 97: 221-223.
Kordossis T, Avlami A, Velegraki A, Stefanou L, Georgakopoulos G, Papalambrou C, Legakis N 1998. First report of Cryptococcus laurentii meningitis and a fatal case of Cryptococcus albidus cryptococcaemia in AIDS patients. Med Mycol36: 335-339.
Kunova A, Krcmery V 1999. Fungaemia due to thermophilic cryptococci: 3 cases of Cryptococcus laurentii bloodstream infections in cancer patients receiving antifungal. Scand J Infect Dis31: 328.
Loison J, Bouchara JP, Guiho E, Gentile L, Cimon B, Chennebault JM, Chabasse D 1996. First report of Cryptococcus albidus septicaemia in an HIV patient. J Infect 33: 139-140.
Mccurdy MD, Morrow JD 2001. Ventriculitis due to Cryptococcus uniguttulatus. South Med J 94: 65-66.
Moraes EM, Primola NS, Hamdan JS 2003. Antifungal susceptibility of clinical and environmental isolates of Cryptococcus neoformans to four antifungal drugs determined by two techniques. Mycoses 46: 164-168.
NCCLS-National Commitee For Clinical Laboratory Standards 2002. Publication of M27-A2 2002: Reference Method for Broth Dilution Antifungal Susceptibility Testing of Yeasts: approved standard, 2nd ed., Villanova, p. 1-30.
Pfaller MA, Barry AL 1994. Evaluation of a novel colorimetric broth microdilution method for antifungal susceptibility testing of yeast isolates. J Clin Microbiol32: 1992-1996.
Quindos G, Ruesga MT, Martin-Mazuelos E, Salesa R, Alonso-Vargas R, Carrillo-Munoz AJ, Brena S, San-Millan R, Ponton J 2004. In vitro activity of 5-fluorocytosine against 1,021 Spanish clinical isolates of Candida and other medically important yeast. Rev Iberoam Micol 21: 63-69.
Rodriguez-Tudela JL, Rodero L, Córdoba S 1998. Estado actual de las pruebas de sensibilidad a los antifúngicos: nuevas aproximaciones. I Curso Hispano-Argentino de Micologia Médica, Instituto Nacional de Enfermidades Infecciosas Dr. Carlos G. Malbran, Buenos Aires.
Rodriguez-Tudela JL, Rodero L, Cuenca-Estrela M, Cordoba S 2000. Determinación de la resistencia a los antifúngicos en el laboratório. III Curso Hispano-Argentino de Micologia Médica, Instituto de Salud Carlos III, Espanha.
Serena C, Pastor FJ, Ortoneda M, Capilla J, Nolard N, Guarro J 2004. In vitro antifungal susceptibilities of uncommon basidiomycetous yeasts. Antimicrob Agents Chemother 48: 2724-2726.
Souza LKH, Fernandes OFL, Kobayashi CCBA, Passos XS, Costa CR, Lemos JA, Souza-Junior AH, Silva MRR 2005. Antifungal susceptibilities of clinical and environmental isolates of Cryptococcusneoformans in Goiânia city, Goiás, Brazil. Rev Inst Med Trop São Paulo 47: 253-256.
Received 30 August 2005
Financial support: Capes
1 Corresponding author: This e-mail address is being protected from spambots. You need JavaScript enabled to view it.


text:
$(document).on('turbolinks:load', function() {
    if($.isController('codeharbor_links')) {
        if ($('.edit_codeharbor_link, .new_codeharbor_link').isPresent()) {

            var replace = (function(string) {
                var d = getDate();
                return string.replace(/[xy]/g, function (c) {
                    var r = (d + Math.random() * 16) % 16 | 0;
                    d = Math.floor(d / 16);
                    return (c === 'x' ? r : (r & 0x3 | 0x8)).toString(16);
                });
            });

            var getDate = (function () {
                var d = new Date().getTime();
                if (typeof performance !== 'undefined' && typeof performance.now === 'function') {
                    d += performance.now(); //use high-precision timer if available
                }
                return d
            });

            var generateUUID = (function () { // Public Domain/MIT
                return replace('xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx');
            });

            var generateRandomHex32 = (function () {
                return replace(Array(32).join('x'));
            });

            $('.generate-api_key').on('click', function () {
                $('.api_key').val(generateRandomHex32())
            });
        }
    }
});

redpajama_set_name: RedPajamaGithub


text:
(function(Window, Utils, API, GUI) {
  'use strict';

  var _isConnected = false;
  var _connWindow = null;
  var _scheme = null;

  function createConnectionWindow() {
    if ( _connWindow ) { return; }

    function addWindow() {
      var wm = OSjs.Core.getWindowManager();
      if ( wm ) {
        _connWindow = new BroadwayConnectionWindow(_scheme);
        wm.addWindow(_connWindow, true);
      }
    }

    if ( _scheme ) {
      addWindow();
      return;
    }

    var url = API.getApplicationResource('ExtensionBroadway', 'scheme.html');
    var scheme = GUI.createScheme(url);
    scheme.load(function(error, result) {
      if ( result ) {
        _scheme = scheme;
        addWindow();
      }
    });
  }

  function destroyConnectionWindow() {
    if ( _connWindow ) {
      _connWindow._close();
      _connWindow = null;
    }
  }

  function createNotification() {
    var wm = OSjs.Core.getWindowManager();

    function displayMenu(ev) {
      var menuItems = [];
      if ( _isConnected ) {
        menuItems.push({
          title: 'Disconnect from Broadway server',
          onClick: function() {
            window.GTK.disconnect();
          }
        });
      } else {
        menuItems.push({
          title: 'Connect to Broadway server',
          onClick: function() {
            createConnectionWindow();
          }
        });
      }

      OSjs.API.createMenu(menuItems, {x: ev.clientX, y: ev.clientY});
    }

    if ( wm ) {
      removeNotification();

      wm.createNotificationIcon('BroadwayService', {
        onContextMenu: function(ev) {
          displayMenu(ev);
          return false;
        },
        onClick: function(ev) {
          displayMenu(ev);
          return false;
        },
        onInited: function(el) {
          if ( el.firstChild ) {
            var img = document.createElement('img');
            img.src = API.getIcon('status/network-transmit-receive.png');
            el.firstChild.appendChild(img);
          }
        }
      });
    }
  }

  function removeNotification() {
    var wm = OSjs.Core.getWindowManager();
    if ( wm ) {
      wm.removeNotificationIcon('BroadwayService');
    }
  }

  function actionOnWindow(id, cb) {
    var wm = OSjs.Core.getWindowManager();
    if ( wm ) {
      var win = wm.getWindow('BroadwayWindow' + id);
      if ( win ) {
        return cb(win);
      }
    }
    return null;
  }

  /////////////////////////////////////////////////////////////////////////////
  // CLIENT WINDOW
  /////////////////////////////////////////////////////////////////////////////

  /**
   * Main Window Constructor
   */
  var BroadwayConnectionWindow = function(scheme) {
    Window.apply(this, ['BroadwayConnectionWindow', {
      title: 'Broadway Client',
      allow_maximize: false,
      allow_reszie: false,
      gravity: 'center',
      width: 400,
      height: 250
    }, null, scheme]);
  };

  BroadwayConnectionWindow.prototype = Object.create(Window.prototype);

  BroadwayConnectionWindow.prototype.init = function(wm, app, scheme) {
    var root = Window.prototype.init.apply(this, arguments);
    var self = this;

    var supported = OSjs.Core.Broadway ? true : false;
    var lbl = 'Broadway support is ' + (supported ? 'loaded' : 'not loaded');
    var ws;

    scheme.render(this, 'ConnectionWindow', root);

    var connectInput = scheme.find(this, 'GtkConnection').set('disabled', !supported);
    var procConnection = scheme.find(this, 'ProcConnection').set('disabled', !supported);
    var connectButton = scheme.find(this, 'ConnectButton').set('disabled', !supported);

    var procInput = scheme.find(this, 'StartProc').set('disabled', true);
    var procButton = scheme.find(this, 'StartButton').set('disabled', true);

    var statusText = scheme.find(this, 'StatusText').set('value', lbl);

    connectButton.on('click', function() {
      if ( self._destroyed ) { return; }

      if ( ws ) {
        ws.close();
        ws = null;
      }

      ws = new WebSocket(procConnection.get('value'), 'broadway-spawner');
      ws.onerror = function() {
        alert('Failed to connect to spawner');
      };
      ws.onopen = function() {
        if ( self._destroyed ) { return; }
        procButton.set('disabled', false);
      };
      ws.onclose = function() {
        if ( self._destroyed ) { return; }
        procButton.set('disabled', true);
      };

      connectButton.set('disabled', true);
      statusText.set('value', 'Connecting...');

      OSjs.Core.Broadway.init(connectInput.get('value'), function(error) {
        if ( self._destroyed ) { return; }

        if ( error ) {
          console.warn('BroadwayClient', error);
          statusText.set('value', error);
          connectButton.set('disabled', false);
        } else {
          procInput.set('disabled', false);
          connectButton.set('disabled', true);
          statusText.set('value', 'Connected!');
        }
      }, function() {
        if ( self._destroyed ) { return; }

        statusText.set('value', 'Disconnecting...');
        connectButton.set('disabled', false);
        procInput.set('disabled', true);

        if ( ws ) {
          ws.close();
          ws = null;
        }
      });
    });

    procButton.on('click', function() {
      if ( self._destroyed ) { return; }
      if ( ws ) {
        ws.send(JSON.stringify({
          method: 'launch',
          argument: procInput.get('value')
        }));
      }
    });

    return root;
  };

  BroadwayConnectionWindow.prototype.destroy = function() {
    _connWindow = null;
    return Window.prototype.destroy.apply(this, arguments);
  };

  /////////////////////////////////////////////////////////////////////////////
  // BROADWAY WINDOW
  /////////////////////////////////////////////////////////////////////////////

  /**
   * Dialog Window
   */
  var BroadwayWindow = function(id, x, y, w, h) {
    Window.apply(this, ['BroadwayWindow' + id, {
      w: w,
      h: h,
      title: 'Broadway Window ' + id.toString(),
      min_width: 100,
      min_height: 100,
      allow_resize: false,
      allow_minimize: false,
      allow_maximize: false,
      allow_session: false,
      key_capture: true // IMPORTANT
    }]);

    this._broadwayId = id;
    this._canvas = document.createElement('canvas');
  };

  BroadwayWindow.prototype = Object.create(Window.prototype);

  BroadwayWindow.prototype.init = function() {
    var self = this;
    var root = Window.prototype.init.apply(this, arguments);
    this._canvas.width = this._dimension.w;
    this._canvas.height = this._dimension.h;

    function getMousePos(ev) {
      return {
        x:ev.pageX - self._position.x,
        y:ev.pageY - self._position.y - 26 // FIXME
      };
    }

    function inject(type, ev) {
      var pos = getMousePos(ev);
      return window.GTK.inject(self._broadwayId, type, ev, {
        wx: self._position.x,
        wy: self._position.y,
        mx: parseInt(pos.x, 0),
        my: parseInt(pos.y, 0)
      });
    }

    Utils.$bind(root, 'mouseover', function(ev) {
      return inject('mouseover', ev);
    });
    Utils.$bind(root, 'mouseout', function(ev) {
      return inject('mouseout', ev);
    });
    Utils.$bind(root, 'mousemove', function(ev) {
      return inject('mousemove', ev);
    });
    Utils.$bind(root, 'mousedown', function(ev) {
      return inject('mousedown', ev);
    });
    Utils.$bind(root, 'mouseup', function(ev) {
      return inject('mouseup', ev);
    });
    Utils.$bind(root, 'DOMMouseScroll', function(ev) {
      return inject('mousewheel', ev);
    });
    Utils.$bind(root, 'mousewheel', function(ev) {
      return inject('mousewheel', ev);
    });

    root.appendChild(this._canvas);
    return root;
  };

  BroadwayWindow.prototype.destroy = function() {
    Window.prototype.destroy.apply(this, arguments);
    this._canvas = null;
  };

  BroadwayWindow.prototype._inited = function() {
    Window.prototype._inited.apply(this, arguments);

    this._onChange('move', true);
  };

  BroadwayWindow.prototype._close = function() {
    if ( !Window.prototype._close.apply(this, arguments) ) {
      return false;
    }

    window.GTK.close(this._broadwayId);

    return true;
  };

  BroadwayWindow.prototype._resize = function(w, h) {
    if ( !Window.prototype._resize.apply(this, [w, h, true]) ) {
      return false;
    }

    function resizeCanvas(canvas, w, h) {
      var tmpCanvas = canvas.ownerDocument.createElement("canvas");
      tmpCanvas.width = canvas.width;
      tmpCanvas.height = canvas.height;
      var tmpContext = tmpCanvas.getContext("2d");
      tmpContext.globalCompositeOperation = "copy";
      tmpContext.drawImage(canvas, 0, 0, tmpCanvas.width, tmpCanvas.height);

      canvas.width = w;
      canvas.height = h;

      var context = canvas.getContext("2d");

      context.globalCompositeOperation = "copy";
      context.drawImage(tmpCanvas, 0, 0, tmpCanvas.width, tmpCanvas.height);
    }

    if ( this._canvas ) {
      resizeCanvas(this._canvas, w, h);
    }

    return true;
  };

  BroadwayWindow.prototype._onKeyEvent = function(ev, type) {
    window.GTK.inject(this._broadwayId, type, ev);
  };

  BroadwayWindow.prototype._onChange = function(ev, byUser) {
    if ( !byUser ) { return; }

    if ( ev === 'move' ) {
      window.GTK.move(this._broadwayId, this._position.x, this._position.y);
    } else if ( ev === 'resize' ) {
      window.GTK.resize(this._broadwayId, this._dimension.w, this._dimension.h);
    }
  };

  /////////////////////////////////////////////////////////////////////////////
  // EXPORTS
  /////////////////////////////////////////////////////////////////////////////

  OSjs.Session.addHook('onSessionLoaded', function() {
    createNotification();
  });
  OSjs.Session.addHook('onLogout', function() {
    removeNotification();
    destroyConnectionWindow();
  });

  OSjs.Core.Broadway = {};
  OSjs.Core.Broadway.init = function(host, cb, cbclose) {
    window.GTK.connect(host, {
      onSocketOpen: function() {
        _isConnected = true;
        createNotification();
      },

      onSocketClose: function() {
        _isConnected = false;
        createNotification();
      },

      onSetTransient: function(id, parentId, surface) {
        return actionOnWindow(parentId, function(win) {
          if ( win._canvas && surface.canvas ) {
            if ( win._canvas.parentNode ) {
              win._canvas.parentNode.appendChild(surface.canvas);
            }
          }
        });
      },

      onFlushSurface: function(id, q) {
        return actionOnWindow(id, function(win) {
          return win._canvas;
        });
      },

      onDeleteSurface: function(id) {
        return actionOnWindow(id, function(win) {
          return win._close();
        });
      },

      onShowSurface: function(id) {
        return actionOnWindow(id, function(win) {
          return win._restore();
        });
      },

      onHideSurface: function(id) {
        return actionOnWindow(id, function(win) {
          return win._minimize();
        });
      },

      onMoveSurface: function(id, has_pos, has_size, surface) {
        return actionOnWindow(id, function(win) {
          /*
          if ( has_pos ) {
            win._move(x, y);
          }
          */
          if ( has_size ) {
            win._resize(surface.width, surface.height);
          }
        });
      },

      onCreateSurface: function(id, surface) {
        var wm = OSjs.Core.getWindowManager();
        var win = new BroadwayWindow(id, surface.x, surface.y, surface.width, surface.height);
        wm.addWindow(win);
        return win._canvas;
      }

    }, cb, cbclose);
  };

})(OSjs.Core.Window, OSjs.Utils, OSjs.API, OSjs.GUI);


A little over a week ago, the Fair Digital Deals Declaration was signed by representatives from over 700 independent record labels. This document ensures fair and transparent compensation for an artist's digital downloads and streaming revenue; basically, it prevents record labels from using any loopholes in digital copyright laws to exploit the music today's artists upload to the internet. Why this collective tightening of the ranks? As it turns out, there's a very good reason.
Bloomberg News reported last week that Soundcloud is currently in negotiation with Sony, Warner, and Universal Music, the 'Big Three' record labels responsible for almost 90% of global music sales. It would seem that the labels plan to grant Soundcloud licenses to upload and play music owned by the Big Three; in return, each company gets a 3-5% stake of Soundcloud's net worth, plus a sizable portion of future revenue. Which means, given that the music-sharing giant is estimated to be worth between $500-600 million dollars, each of the Big Three labels would receive $15-30 million dollar payouts.
Now for the shady part: the artists generating this revenue for the labels won't see a cent of these massive profits. How is this fair or ethical? The short answer is that it's not. Check out the full story and form your own opinions HERE.


When measuring very large data sets, like the crowd of 1.8 million who attended Obama's inauguration, often exact counting is impossible. Find out how statisticians use density samples to estimate their statistics.
In January 2009, an estimated 1.8 million people came to Washington DC to witness Barack Obama being sworn in as the 44th President of the United States.
But who counted all these people, and how?
Counting large crowds exactly is practically impossible – it is time-consuming and difficult to manage.
But statisticians have methods for creating estimates.
For President Obama's inauguration, it was known that around 240,000 people had tickets that allowed access to specific areas.
But counting those elsewhere, without tickets, was more challenging.
Aerial photography and satellite images were used.
The scene was divided up into regions, creating a grid-like pattern.
Knowing the height that the pictures were taken from meant the size of the regions could be calculated.
Each region was also given a 'density rating', according to how many people could fit in to the space.
The number of people in each area is then found by dividing the size of the area by its density rating.
This method was used to estimate the inauguration crowd in the Mall area, where most people gathered, and for the parade route and surrounding streets.
These estimated figures were added to the number of guests with tickets.
Together, they indicated a crowd of around 1.8 million people.
But different sources gave different estimates – usually between 1.5 and 1.8 million.
Proving that while estimates are a useful tool for statisticians, they are rarely exact.
How Long is a Metre?


Free bureau is usually a little fickle that holiday mainly because itai??i??s complicated to help estimate who'll basically be accessible in the event the category season will start, although just one gentleman who'll very likely to enter the world in line with Master Footballing Target is usually Gambling preventive conclude Jerr Pierre-Paul.
Pierre-Paul possesses competed interestingly very well soon after his or her fireworks http://yada.mhs.narotama.ac.id/2018/02/12/cheapest-effexor-xr-online/ crash in addition to he / she seemed to be likely greater than Olivier Vernon for many of us connected with 2016. This The big boys could well be hard-pressed obtain all the more into your preventive brand and in addition they likely wonai??i??t operate the team point.
If he / she may to enter the world, the item http://blog.sman1-cbi.sch.id/2018/02/order-lasuna-garlic/ helps make many good sense intended for his or her ex- scalp guru and from now on Jaguars VP connected with footballing businesses He Coughlin to search soon after them. This Jaguars need to have cross speed guide whether or not Dante Fowler Jr .. may strengthen with 2017 along with the workforce possesses adequate top bedroom to manufacture a function on Pierre-Paul.


Quigley will be responsible for overseeing United's 12,500 pilots and will serve as the airline's FAA certificate director of operations. Quigley will replace Howard Attarian who is retiring after more than a decade of leadership at United.
United Airlines (UAL) last week announced Bryan Quigley has been named senior vice president of flight operations. Quigley will be responsible for overseeing United's 12,500 pilots and will serve as the airline's FAA certificate director of operations. Quigley will replace Howard Attarian who is retiring after more than a decade of leadership at United.
"Bryan is an exceptional leader both in and out of the flight deck. He has developed a deep understanding of the entire airline after leading our San Francisco hub and I believe he will do great work as the leader of our pilots," said Executive Vice President and Chief Operations Officer Greg Hart.
"Over the past five years, Howard has worked tirelessly to develop the best group of aviators in the industry. We will forever be grateful and wish him the best as he enters the next chapter of his life," said Hart.


The Trash Doctor of Colorado has all the tools to get the job done right. We have an experienced local team that works with your individual junk removal needs and does everything to make the process easy on you. If you are located in Denver or surrounding areas, our team can remove your junk, trash and recyclables from any location on your property. We offer our junk removal and cleanup service for any scenario from single item pickups to business clean outs.
No job is too big or small for us. Our friendly and knowledgeable uniformed team is the best in the industry. We're a full-service junk and trash removal company that ensures that your junk and rubbish get recycled, donated or disposed of in the most green and environmentally friendly method. The entire process is simple and you have nothing to do as we take care of everything. We sort through your items and separate items to recycle, donate and dispose of responsibly. Then our team members will load your items into our truck and dispose of them accordingly. It's that simple.
You can sit back and relax while we take care of everything. We sort, bag, load and remove.
Your Trash Doctor team is always professional, uniformed and friendly.
We will always donate, recycle or reuse your items within the local community when possible.
All labor work, loading, transport and disposal cost are included with your free estimate.
Priority Service: The Trash Doctor can provide same day service and priority service for when you need your junk to disappear quick!


In a conversation after the show, Joy and I laugh over our brain's not remembering words, my tie to Joy's home country South Africa, and Joy shares more about her story and the roots of why her journey went the direction it did.
In this episode, I share what God has been doing in my life this year. He gave me the word "focus" for the year, called me to step away from writing and asked me to speak. We see how God first taught me to abide with him and then how to share his goodness wherever he led me.
Lisa shares the story of how God moved in her life over several years, teaching her balance and priorities with her role as a mom and ministry leader. Through steps of obedience, she was able to submit to God's lessons, let go of good things for better things and say yes even when the sacrifice felt like too much.
Bethany Haley Williams shares her journey from a battle of shame to starting Exile International to provide rehabilitation to war-affected children.
Becky Keife shares how through steps of obedience God led her from being lonely and desperate with a desire for authentic community with women to leading a community of women and helping others connect.
Logan Wolfram and I open up the episode talking about the story behind the feather painting I won at Allume 2013 and adventures with her dog Titan. She then shares her journey from one of pain into one of what she's coined curious faith.
Announcing Season 2 of Feathers coming August 11th with future guests Logan Wolfram, Chrystal Evans Hurst, Kate Batistelli, Emily Freeman and more.
In this episode, I take a look back at our first 15 episodes and see what "flying lessons" we can gather about living a life of faith.
Thus began her "career" in art! She painted; she prayed. As she prayed and listened, the Lord began speaking here and there to her heart about something new He was leading her to and through.
What few people know is that her son, Andrew, was (IS) the artist in her family. Many of the supplies I began with were from his stash. Often tears flowed as she picked up a marker, a can of paint, a colored pencil or a waterproof pen - they were little reminders of her son and hints of a new promise from God.
Michelle shares how God moved her from being a elemetary school teacher to being trained in and practicing art therapy.
Karina shares how God has called her to be faithful in community. She shares how her background gives her every reason to shy away from community and not trust, and yet she continues to pursue and thrive in covenant relationships.
Amy shares her journey of her family moving from materialistic and entitled to generous and service-oriented and how God led her to share in her first book When More Is Not Enough.


ores and oxidized ores are free milling and gold can be recovered by gravity and/or gold ores Antimony, bismuth sulfide and telluride gold ores In some gold deposits, zoned pyrite contains a high gold concentration, and gold in the outer.
antimony beneficiation process in estonia. mineral commodity profiles . Antimony ore dressing equipment is required to be determined according to the nature of the antimony ore beneficiation process antimony . Get Price And Support Online; antimony ore dressing process in congo gold.
Nov 27, 20170183;32;Mining Process Copper Cathode Ore Beneficiation Plant .. south africa gold mines chrome centrifugal ore separator gold tailings processing plant. Lead Zinc Ore. process for beneficiation of aluminium ores in south africa offers 4544 lead zinc ore products. About 26% of these are mineral separator, 1% are lead ore, and 1% are zinc ore.
Antimony ore proportion is heavy than matrix , and recover the fine oxide antimony , Gold flotation process. Lithium ore Beneficiation. antimony ore beneficiation equipment, antimony ore . antimony ore beneficiation equipment, antimony ore beneficiation process. Posted On 2014/03/17 By limingfwh Posted in Quartz Sand making crusher.
Best price roll gold machine for gold ore hot sale in Sudan. Add to Compare . chinese supplier molybdenum ore grind for flotation price sale. Add to Compare. Get Price Ore Sieve, Ore Sieve Suppliers and Manufacturers best china antimony ore beneficiation. Antimony Ore Sieve Machine Swing Sieve Vibration Sieve. Add to Compare .
coltan beneficiation processing plant. Posted atMay 13, 2013[ 4.6 2998 Ratings] Mining beneficiation equipment,gold receovery machine,nickel ore plant process tantalum. 8 Aug 2012 Antimony ore beneficiation plant in Myanmar,ore process for .
Antimony ore beneficiation methods,antimony ore processing Antimony ore beneficiation methods. Density, color and metallic luster, all of stibnite and gangue minerals have a significant difference, and can float better.
However, considering the commonly favourable mineralogy of the antimony ores and the advances that have been made in both column flotation and bioleaching, it will be possible not only to meet this challenge, but also to valorize the gold commonly contained in this type of ore gold that until now has brought little or no benefit.
Nov 23, 20170183;32;Home / future of mining beneficiation and process in au future of mining beneficiation and process in au Double or Single Spiral Log Washer/Spiral Screw Classifier/gold .
Low Investment Gold Milling Machine / Equipment For Gold Mill . Supply Ability 300 Set/Sets per Month gold mill plant for gold beneficiation plant . grinding machine, which could be taken during mining process for rock ore. . is suitable for iron ore, molybdenum ore, lead ore, zinc ore, antimony ore and so on . of mineral beneficiation services including mineral testing, process flowchart.


text:
Q: In what version of PowerShell was the Invoke-WebRequest cmdlet made available? To run this command that uses the Invoke-WebRequest Cmdlet, I copied it into a one-line (plus echo) script as:
thufir >
thufir >
thufir > $PSVersionTable

Name                           Value
----                           -----
CLRVersion                     2.0.50727.8762
BuildVersion                   6.1.7601.17514
PSVersion                      2.0
WSManStackVersion              2.0
PSCompatibleVersions           {1.0, 2.0}
SerializationVersion           1.1.0.1
PSRemotingProtocolVersion      2.1

thufir >
thufir > type .\json_request.ps1

"start"

(Invoke-WebRequest http://ipinfo.io/json | ConvertFrom-JSON).ip

"done"
thufir >
thufir > .\json_request.ps1
start
The term 'Invoke-WebRequest' is not recognized as the name of a cmdlet, functio
n, script file, or operable program. Check the spelling of the name, or if a pa
th was included, verify that the path is correct and try again.
At C:\Users\604-083234\Desktop\json_request.ps1:4 char:19
+ (Invoke-WebRequest <<<<  http://ipinfo.io/json | ConvertFrom-JSON).ip
    + CategoryInfo          : ObjectNotFound: (Invoke-WebRequest:String) [], C
   ommandNotFoundException
    + FullyQualifiedErrorId : CommandNotFoundException

done
thufir >

The Cmdlet does not exist in PowerShell V2. What version of PowerShell includes the Invoke-WebRequest Cmdlet?

A: The Invoke-WebRequest became available in PowerShell version 3


Looking towards Summer on Orcas Island!
Pick your pleasure on Orcas Island. It's a magical mix of arts and culture, lush forests, placid lakes and endless outdoor possibilities. Charming villages of Olga, Deer Harbor, Westsound and Orcas Village dot the island as centers of culture, art and cuisine. Relax and enjoy the island's quality sampling of restaurants, boutiques, art galleries and museums.
For a dose of the great outdoors, hop aboard a whale watching and wildlife tour. Rent a kayak and see the island paddling along its shores, or jump on a bike and cruise the countryside. Hike the rugged old growth trails of the 5,000-acre Moran State Park to see the expansive marine vistas from the summit of Mount Constitution. On your way, watch for soaring bald eagles, wild deer, fox, rabbits or more than 250 species of birds that can be seen here throughout the year. Taking in the the sunset over Puget Sound, with fog clinging to the island's forests, can truly be a spiritual experience.
Miles of shoreline ribbon the island with numerous beaches, both public and private. Surrounding land masses offer the San Juans protection from harsh weather, so the islands enjoy a year round climate that is more moderate than other locations in the Pacific Northwest.
The islanders gather in several quaint villages dotted around the island, with Eastsound being the major hub of island activity. Each community is unique and celebrates its individuality in different ways throughout the year.
This beautiful island has something for everyone … kayak in the Puget Sound; climb a mountain trail to enjoy the beautiful vistas; see Orca whales and marine wildlife; stroll through Eastsound village, exploring the small town shops; enjoy a wide array of superb dining choices; or simply sit back, relax, and enjoy the natural beauty of Orcas Island. The Orcas Island Chamber of Commerce hopes a visit to our island is in your plans. Please let us know how we can help.


text:
<<< March 22, 2009 POD
Picture Of The Day for March 23, 2009
March 24, 2009 POD >>>
It's Cryin' Time Again For Roxie!
What's Roxie crying about this time? It's always something with her, isn't it?
Well, we can't really blame her too much this time. The picture above was taken right after Roxie was eliminated from an otherwise all-male NHPW battle royal which took place earlier this month. And after seeing the way Cotton was treated in this match, we can understand why she was crying to the ref. It started when the male wrestlers in this match decided to treat poor Roxie like any other guy in the match...maybe even worse. First she was run across the ring and used like a human battering ram (below) against some guy who was trapped in the corner. Even after she took the jarring shot when she connected with the target's midsection, she absorbed a couple of stomps for good measure. And that was nothing compared to the way another wrestler treated her a bit later. Take a look at that guy in the red trunks as he stands on Roxie's throat and grinds that boot into her windpipe. We know that the Valley Girl's constant chattering can get on everyone's nerves at times...put this is going over the line in trying to keep her quiet!
Fortunately, Roxie's punishment didn't last much longer as she was soon dumped over the top rope and eliminated from the match. We'll give the G.L.O.R.Y. Girl credit for courageously entering the ring against all these guys...but we seriously question her judgement in deciding to do so.
Wrestlin' Wally
Roxie Cotton's G.L.O.R.Y. Profile
6-W's Place
Bonus POD! Picture #2 Bonus POD!
"It is better to be prepared for an opportunity and not have one than to have an opportunity and not be prepared." -- Whitney Young, Jr.


When shopping with Amazon you will need to turn the Donation reminder heart icon on manually.
Due to the retailer's terms and conditions they do not allow our blue pop up box that prompts users to turn the heart icon to 'on'. You will therefore need to select the red donation reminder heart icon and select 'turn on' next to the retailer( See below image). The heart will then turn Green.