Police in Zanzibar holding Kenyan national after causing fatal accident
by John NamkwaheIn Summary
According to unconfirmed reports say the driver was under the influence of alcohol.
Zanzibar. Police in North Unguja-Zanzibar are holding a Kenyan national Juma Bakari, 24, after his car rammed into a wood curving shop at Nungwi killing two people, leaving one in critically injured.
North Unguja Regional Police Commander Mr Haji Hana said the driver will be taken to Court for further legal proceedings upon the completion of the ongoing Police investigation.
"We are still investigating the incident, " the RPC told The Citizen.
The deceased were identified as Amani Lazaro Masseuse, 24, and Fuateal Nasar, 38, both residents of Meru-Nungwi who were believed to be husband and wife, according to the Police Commander.
The injured Mr Hamad Juma Omari, 25, a resident of Fuoni suburb has been admitted at Kivunge Hospital for treatment after sustaining injuries, the RPC confirmed.
Further referring to the car incident, the RPC established that the Police officials had arrived at the scene shortly after, as scores of people gathered at the scene to see what was happening.
Advertisement
Upon their arrival at the scene, the Police officials arrested the driver and a passenger Ms Valeria Napkin, 40, an Italian citizen who was believed to be the driver's girlfriend.
"We have already released the Italian woman after a prolonged interrogation, we came to realize that she didn't commit the traffic offence, but the driver did," said the RPC.
According to unconfirmed reports, the driver was under the influence of alcohol, but when the Police Commander was asked about the allegations, he declined to further comment, insisting that the police were still investigating the matter.
The RPC's response came after footage showing the accident went viral on social media networks.


## -*- coding: utf-8 -*- <%inherit file="base.html" /> Which other account would you like to merge with this account?


After Swede killer's pardon, Sri Lanka frees 267 more prisoners
COLOMBO: More than 250 Sri Lankan convicts aged over 65 have been given amnesty just days after the president sparked outrage by pardoning the well-connected killer of a Swedish teen, officials said on Thursday (Nov 14).
Jude Jayamaha, the scion of a wealthy Sri Lankan family and convicted in 2005 of murdering Yvonne Jonsson, walked free from death row on Saturday after Maithripala Sirisena's pardon.
His release prompted outrage from the victim's family, rights groups, and people on social media - and also initiated a mini-rebellion from inmates at the country's main high-security prison, who demanded similar treatment.
In an apparent bid to calm the situation, Sirisena - due to step down after elections on Saturday - issued a pardon for some 267 prisoners aged over 65.
"We have now got orders from the president and the prisoners will walk free today and tomorrow," a justice ministry official told AFP.
Officials said all those granted pardons were serving time for offences other than rape or murder.
Jayamaha was initially sentenced to 12 years in jail for the brutal murder of Jonsson, who was 19. His trial heard her skull had been fractured into 64 pieces.
An appeal court upgraded the sentence to the death penalty, a decision reaffirmed by the Supreme Court in 2014.
Ruling party presidential candidate Sajith Premadasa said earlier this week he would consider every legal option to overturn the pardon if elected.
There are around 375 people on death row in Sri Lanka, but the country has had a moratorium on executions since 1976.


Desktop Deploy
A simple tool designed to download software and configure new PCs from a single controlled repository.
Desktop Deploy (DD) is an all-in-one tool designed for desktop technicians to download software, obtain computer diagnostic data and also run common scripts from one single location.
Common DD use cases
-
Download bundles of software from a single repository
-
Download bundles of scripts from a single location
-
Access commonly used PC diagnostics


The tenth annual Suffolk Dog Day takes place at Helmingham Hall on Sunday 30 July. To mark this celebration of the county’s canine friends of all shapes and sizes, we’ve put together a list of our favourite dog-related children’s books.
Board books
Find Spot at the Museum, by Eric Hill
“Spot, Mum and Tom can’t wait to visit the museum. When Spot goes missing after being distracted by the gift shop, Tom and Mum search high and low, in some unexpected places, before finding him at last.”
Dogs, by Emily Gravett
“Gorgeous canines of every shape, size and colour are bounding through the irresistible ‘Dogs’ by Emily Gravett. Can you choose one dog to love best of all? With playful pencil and watercolour illustrations to delight children and adults alike, everyone will long to bark along with the chihuahua and tickle the dalmatian’s tummy.”
Picture books
Oi Dog!, by Kes Gray & Jim Field
“Frog is changing the rules - dogs no longer sit on frogs. Phew! Dogs now sit on logs - and everyone else is going to have to sit somewhere different too. Will cats want to sit on gnats? Will spiders like sitting on gliders? Will whales be happy to sit on nails? And, most importantly, where is FROG going to sit?”
Odd Dog Out, by Rob Biddulph
“It’s a dog’s life in the big city… Come join one busy dog on her journey to find her place in the world, in this third sublimely illustrated book from the bestselling, award-winning Rob Biddulph.”
Shifty McGifty and Slippery Sam, by Tracey Corderoy & Steven Lenton
“Shifty McGifty and Slippery Sam are two hapless robber dogs who decide on career change after one bungled burglary too many - proving that crime doesn’t pay, but cupcakes certainly do!”
Hide Me, Kipper!, by Mick Inkpen
“A little squeaky mouse comes running across the page and hides himself inside the ‘foldy bit’ in the middle of the book. Will the cat find him? Not if Kipper can help it.”
Oh No, George!, by Chris Haughton
“Harris is off to do some shopping. ‘Will you be good, George?’ he asks. George hopes he can. He really wants to, but chocolate cake is just so very delicious and he does love to chase cat. What will George do now?”
Dogger, by Shirley Hughes
“Dave has a very special soft brown toy called Dogger. Dave is very fond of Dogger and takes him everywhere. Then one day Dogger goes missing - and Dave won’t rest until he’s found.”
This classic is 40 years old this year and still as relevant as ever.
Hairy Maclary from Donaldson’s Dairy, by Lynley Dodd
“This is the story of the scruffy dog Hairy Maclary, who went off for a walk with a few of his friends, and got a nasty surprise. It is told in rhyme, using repetition to make it more accessible to young children.”
Short chapter books
Dixie O’Day in the Fast Lane, by Shirley Hughes & Clara Vulliamy
“Introducing Dixie O’Day and also, of course, his friend Percy! This dashing duo are always getting into adventures - here they enter the All-Day Car Race little knowing what is ahead of them! Dixie and Percy run into all sorts of peril, as does their arch enemy, Lou-Ella. But who will win, and will Lou-Ella get her comeuppance?”
The Hundred-Mile-An-Hour Dog, by Jeremy Strong
“Streaker is no ordinary dog. She’s a rocket on four legs with a woof attached, and Trevor has got until the end of the holidays to train her. If he fails, he’ll lose his bet with horrible Charlie Smugg, and something very nasty will happen.”
Blamehounds, by Ross Collins
“Whenever there’s a pong, poo or puddle that can’t be explained, Norman and Ringo are the hounds that take the blame. Determined to exploit their status for profit, Blamehound Inc. is soon in business and small dogs the world over are admitting responsibility for accidents, eruptions and even the occasional war.”
Part of Barrington Stoke’s wonderful range that dyslexic readers can enjoy.
Junior novels
Woof!, by Allan Ahlberg & Fritz Wegner
“He felt a curious tingling in his hands and feet. He felt his nose becoming cold and wet, his ears becoming flappy. The thought in his mind was: ‘I’m turning into a dog!’
“Eric is a perfectly ordinary boy. Perfectly ordinary that is, until the night when, in fifteen seconds flat, he turns into a dog!
Some parents might remember the TV adaptation that ran on CITV from 1989-1997. Woof! is still a great story for kids 30 years after it was first published.
A Dog So Small, by Philippa Pearce & Anthony Maitland
“For months, Ben Blewitt has been thinking about dogs. So he is very disappointed when, for his birthday, he receives not a dog, but a picture of a dog. But Ben’s imagination soon gets to work, and then the strange adventures begin.”
Five on a Treasure Island, by Enid Blyton
“This is the very first Famous Five adventure, featuring Julian, Dick, Anne, not forgetting tomboy George and her beloved dog, Timmy. There’s a shipwreck off Kirrin Island - but where is the treasure? The Famous Five are on the trail looking for clues but they’re not alone!”
If your child has already devoured the Famous Five series, the Secret Seven books feature a cocker spaniel called Scamper, while the canine element of the Five Find-Outers and Dog is a Scottish terrier named Buster.
The Hundred and One Dalmations, by Dodie Smith
“Pongo and Missis Pongo, pampered dogs from Regent’s Park, have their 15 beloved puppies stolen by the outrageous Cruella de Vil, who thinks their coats will make a nice fur jacket. The Pongos set out to rescue their pups from an isolated mansion.”
Picture books for older readers
The Great Dog Bottom Swap, by Peter Bently & Mei Matsuoka
“The day has arrived for the Dogs’ Summer Ball. It’s so high class in fact, that each dog must remove their bottom before they are allowed inside the hall. But in the middle of all the frivolity something unexpected happens and the dogs have to make a hasty exit - with or without the correct bottom!”
Prisoners of the Sun, by Hergé
How could we make this list without Tintin’s dog, Snowy?
“When Professor Calculus is kidnapped, Tintin and a desperate Captain Haddock set off to Peru on a rescue mission, braving runaway train carriages, yellow fever and avalanches. Then they must find an ancient Inca tribe if they are to find their great friend.”


Derivation
: derivation
(Please note: this part of the documentation is not yet completed.)
Language-specific feature identifying the form of derivation applied to a word.
Minen
: derivation with suffix -minen
Produces noun.
Examples
- [fi] valmistaminen “TODO”
References
- http://scripta.kotus.fi/visk/sisallys.php?p=221 (in Finnish)
Sti
: derivation with suffix -sti
Produces adverb.
Examples
- [fi] pysyvästi “TODO”
References
- http://scripta.kotus.fi/visk/sisallys.php?p=371 (in Finnish)
Inen
: derivation with suffix -inen
Produces adjective.
Examples
- [fi] omenainen “TODO”
References
- http://scripta.kotus.fi/visk/sisallys.php?p=261 (in Finnish)
Lainen
: derivation with suffix -lainen
Produces noun.
Examples
- [fi] Turkulainen “TODO”
References
- http://scripta.kotus.fi/visk/sisallys.php?p=190 (in Finnish)
Ja
: derivation with suffix -ja
Produces noun.
Examples
- [fi] oppija “TODO”
References
- http://scripta.kotus.fi/visk/sisallys.php?p=252 (in Finnish)
Ton
: derivation with suffix -ton
Produces adjective.
Examples
- [fi] voimaton “TODO”
References
- http://scripta.kotus.fi/visk/sisallys.php?p=292 (in Finnish)
Vs
: derivation with suffix -vs
Produces noun
Examples
- [fi] TODO “TODO”
References
-
(in Finnish)
Llinen
: derivation with suffix -llinen
Produces adjective.
Examples
- [fi] vaunullinen “TODO”
References
- http://scripta.kotus.fi/visk/sisallys.php?p=276 (in Finnish)
Ttain
: derivation with suffix -ttain
Produces adverb.
Examples
- [fi] lajeittain “TODO”
References
-
(in Finnish)
U
: derivation with suffix -u
Produces noun.
Examples
- [fi] lopettelu “TODO”
References
- http://scripta.kotus.fi/visk/sisallys.php?p=221 (in Finnish)
Ttaa
: derivation with suffix -ttaa
Produces verb.
Examples
- [fi] vaivaannuttaa “TODO”
References
- TODO (in Finnish)
Tar
: derivation with suffix -tar
Produces noun.
Examples
- [fi] suojelijatar “TODO”
References
- TODO (in Finnish)
Diffs
FinnTreeBank
The language-specific feature Derivation is not in use in FI_FTB.
Derivation in other languages: [fi]


Header: #include <modbusCommon.h>
Definitions and enums that are shared and used by both the A7 and M4 libraries to enable intercore communication.
| Enum | Description |
|---|---|
| messageProtocol | The protocol used to transmit the message. |
| modbusMsgTypes | The type of modbus message being transmitted. |
| serialPortMsgTypes | The type of serial port message being transmitted. |


You can add your custom phrases and save on keystrokes later. Give it a shot!
Set up your shortcut, font size, etc.


This example shows how to run a live chart with data retrieved from the server each second. Study the source code for details.
This is the content of the PHP file, live-server-data.php:
<?php // Set the JSON header header("Content-type: text/json"); // The x value is the current JavaScript time, which is the Unix time multiplied by 1000. $x = time() * 1000; // The y value is a random number $y = rand(0, 100); // Create a PHP array and echo it as JSON $ret = array($x, $y); echo json_encode($ret); ?>


play
pause
stop
mute
unmute
max volume
repeat
repeat off
Update Required
To play the media you will need to either update your browser to a recent version or update your
Flash plugin
.
Note: Seeking in jPlayer is not always accurate for compressed formats like mp3. Consider converting the track to a .wav file.


$7 Aldi wine wins top award at Great Australian Shiraz Challenge 2019
A $7 bottle of wine has taken out international Gold at one of Australia’s biggest wine competitions.
Aldi’s $6.99 One Road South Australian and Heathcote Shiraz won the Great Australian Shiraz Challenge 2019, in a huge win for both Aldi and those of us too cheap to pay more than $10 a bottle.
The supermarket’s One Road Gouldburn & King Valley Cabernet Merlot 2018 - also an absolute steal for $6.99 - and A.C Byrne & Co Margaret River Cabernet Merlot 2018 - just three dollars more at $9.99 - also took out Blue Gold in the Sydney International Wine Competition 2020.
Aldi’s popular champagne, the Veuve Monsigny Brut Champagne, on the shelf for just $21.99, also managed to land itself a spot in the top 100 wines of the competition.
Earlier this week, the supermarket giant released a list of its top products as voted by Australian customers.
While the aforementioned champagne was expected to take out the alcohol category, Aldi shoppers instead dubbed the South Point Estate Rosé their top pick, retailing for just $4.99.
Looks like now is the perfect time to shop for some award-winning wine to bring to Christmas dinner.


CS2 Assignment 4: Dynamic Programming
Due Tuesday, February 3, 2015, at 17:00 PST
Introduction
This is the CS2 assignment on dynamic programming. In particular, you will be implementing algorithms for DNA alignment and seam carving.
When finished, please enclose your submission as a ZIP file named cs2week4-[NAME].zip or a tar.gz file named cs2week4-[NAME].tar.gz, and upload it to the Week 4 assignment module on Moodle.
Assignment Background
DNA alignment
The problem to solve: Given two DNA sequences S and T, find an alignment of S and T with the greatest possible "score." A DNA sequence is a (non-empty) string consisting only of the characters A, C, T, and G. (However, the program you write will most likely be able to perform comparisons between arbitrary strings.)
We can align sequences S and T by inserting gaps throughout the sequences, including at their beginnings and ends, and then lining them up. For example, if S is the sequence ACTGGCCGT and T is the sequence TGACGTAA, one possible alignment is the following:
The dashes indicate locations where a gap has been inserted. We can compute the score for an alignment as follows.
- We define two negative integers called the gap score and the mismatch score and also
- a positive integer called the match score.
To compute the score for a given alignment, we sum up the scores for each position in the alignment. If at a given position, one sequence has a gap and the other does not, then we use the gap score. If both sequences have characters, but the characters are different, we use the mismatch score. If both sequences have the same character, we use the match score. We can describe the way the sequences fit together with an instruction string which as a "|" for every match, a "*" for every mismatch, and a "s" or "t" in every gap, indicating which string has a character in the gap. For example, using the scores given above, the score of the example alignment above is:
This is not, however, the way to combine these two strings with the highest score. Since we've set gaps to have such a high penalty, the best score is this:
This problem is not only relevant for DNA sequence alignment. It's also useful in things like plagiarism detection... and quantifying how similar the words "abracadabra" and "avada kedavra" are:
Seam carving
Seam carving is a method for content aware image resizing. The idea is to resize images by removing the lowest energy seams, or paths, from the image.
For an arbitary image, we can compute a saliency map, which is a grayscale image derived from the color image; the intensity of each pixel of the saliency map is a measure of how much "energy" that pixel has in the context of the image. Lighter areas on the saliency map correspond to higher energy areas of the original image, so they have a higher cost than low-energy (darker) areas.
To determine the lowest-cost path, we need to create a cost matrix from the saliency map. The first row of the cost matrix is simply the first row of the saliency map (since there are no pixels above it). For each subsequent row, we examine the pixel directly above, directly above and one pixel to the left, and directly above and one pixel to the right of the pixel we want to calculate cost for. Then, the value we should store for that pixel is the minimum value of the three aforementioned energies added to the energy of the pixel in question. For example, suppose we have a saliency map that looks like this:
| 5 | 6 | 1 | 3 |
| 2 | 9 | 0 | 5 |
| 4 | 8 | 7 | 2 |
We want to compute a cost matrix from the energy values given. For the first row, we just copy the first row of the saliency map. How do we compute the second row?
- The first value on the second row of the saliency map is 2. There are only two pixels above the pixel we want to calculate for, since we are on an edge; the minimum of 5 and 6 is 5, so add 5 + 2 = 7.
- The second value on the second row of the saliency map is 9. There are three pixels above the pixel we want to calculate for; the minimum of 5, 6, and 1 is 1, so add 9 + 1 = 10.
- The third value on the second row of the saliency map is 0, and again, there are three pixels above the pixel we want to calculate for. The minimum of 6, 1, and 3 is 1, so add 0 + 1 = 1.
- The last value on the second row of the saliency map is 5; we are on an edge again, so there are only two pixels above the pixel we want to calculate for. The minimum of 1 and 3 is 1, so add 5 + 1 = 6.
The final cost values are these:
| 5 | 6 | 1 | 3 |
| 7 | 10 | 1 | 6 |
| 11 | 9 | 8 | 3 |
Notice that, for the third row, we must look at the previous row of the cost matrix to get the value to add to the saliency for the current pixel, since the row 2 in the cost matrix is different from row 2 in the saliency map.
What happens when we get to the end? The seam ends on the minimum cost pixel in the last row. From there, we can follow our cost matrix up by choosing the minimum cost from the pixel directly above, directly above and one pixel to the left, and directly above and one pixel to the right. Remember edge conditions. Corners only have two pixels above and adjacent to them. The list of pixel x-values can be used to remove the seam from the image. Visually, you can check your seam-finding algorithm from the energy view in the GUI provided; if your seam intersects many white areas, you may be doing something wrong.
Prerequisites
- g++ 4.6.x+
- libsdl1.2-dev
- libsdl-gfx1.2-dev
Assignment (20 points)
For this assignment you will be implementing the DNA alignment and seam carving algorithms as described above.
Part 1: DNA alignment
Part 2: Seam carving
You have been given a simple GUI that displays the image specified by a command-line argument. Run the program as bin/seamcarve images/<name>.bmp you should test your implementation on both images provided for you. You can switch between image and energy views by pressing "i" and "e", respectively; pressing "f" finds a seam with your function, and pressing the space bar removes a seam.
If you want to create a 2-dimensional array for your seam carving implementation (this may come in handy!), here is the proper way to do so:
// Define a width and height for your array int w = WIDTH, h = HEIGHT; // Allocate memory for the array int **arr = new int*[w]; for (int i = 0; i < w; i++) arr[i] = new int[h]; // Now we can access whatever element we want! arr[0][2] = 5; // But when we're done, we have to deallocate for (int i = 0; i < w; i++) delete[] arr[i]; delete[] arr;
Notes and hints
As something between a hint and a test script, here are a good set of short strings and their proper alignment instruction strings (with -5, -1, 2 as the constants as mentioned above).| S | T | Inst |
| '' (empty) | 'a' | 't' |
| 'a' | '' | 's' |
| 'a' | 'b' | '*' |
| 'a' | 'a' | '|' |
| 'b' | 'ba' | |t |
| 'b' | 'ab' | 't|' |
| 'ab' | 'b' | 's|' |
| 'ba' | 'b' | '|s' |
| 'ab' | 'ba' | '**' |
| 'abc' | 'ac' | '|s|' |
| 'abc' | 'adc' | '|*|' |
Previous incarnation of this assignment, if you're curious: link.


{% extends 'anonbase.html' %} {% block content %} Your account activation failed. Use the contact us link if you have a problem. {% endblock content %}


In the age of today websites are second nature to all of us. We access our favorite websites each day and many times we may not even know it, it has just become second nature to us. We all have our favorite websites that we access each day. They can pretty much be anything from where we get news, social media, play games, have fun and much much more.
These are websites that I pretty much visit everyday. Most of these websites are informational, they provide me with information to many of the things I like such as skiing, sports and news. Some of them are just fun to go to as well, we all love losing hours upon hours watching youtube and eventually saying "how did we just watch Youtube videos for 2 hours." At least we had a great time doing it.


Hold a dumbbell in each hand with palms facing your sides and arms extended straight down. Keeping your upper arms against your sides, curl both weights at the same time, minimizing momentum used during the curl.
Lie back on a bench or the floor holding a dumbbell in each hand with palms facing each other. Press the weights over your chest, then bend your elbows to lower the weights toward your face until you feel a stretch in your triceps. Extend your elbows. Keep your elbows facing the ceiling the entire set.
Attach a D-handle to the low pulley of a cable machine, grasp the handle in your left hand, and step forward (away from the machine) until there's tension on the cable and your arm is drawn slightly behind your body. Stagger your feet so your right leg is in front. Curl the handle but do not allow your elbow to point forward.
Place your hands inside shoulder width and lower your body until your chest is about an inch above the floor. To increase the difficulty, elevate your feet on a bench or box.
Sit at a preacher bench and adjust the height so that your armpits touch the top of the bench. Grasp an EZ-curl bar at shoulder width with arms extended (but allow a slight bend at the elbows). Curl the bar, keeping the backs of your arms against the bench. Take three seconds to lower the bar back down.
Lie back on a flat bench with a dumbbell in each hand. Hold the weights at shoulder level and then press the weights straight over your chest.
Suspend yourself over the bars of a dip station. Lower your body until your upper arms are parallel to the floor.
Place your hands on the floor at shoulder width and extend your legs behind you. Do a pushup, pressing back up explosively so that your hands leave the floor. Catch yourself on the way down and lower into the next rep.
Attach single-grip handles to the top pulleys of two facing cable stations. Stagger your feet for balance and press the handles from shoulder level.
Lie back on the incline bench holding a dumbbell in each hand at shoulder level. Press the weights over your chest.
Lie on your back on the floor and wrap the band around the arches of your feet. Cross the ends of the band over each other to make an “X” and grasp the ends with opposite hands.   That’s one rep.
Hang from a pullup bar and extend your legs beneath you. Brace your abs and raise your legs until your toes touch the bar.
 The wheel should be directly under your shoulders. Brace your abs and roll the wheel forward until you feel you’re about to lose tension in your abs. Pull the wheel back.
Lie on your back on the floor, and place your hands by your ears. Crunch your torso up off the floor, and twist to your left side. Draw your left knee up to meet your right elbow. Reverse the motion, and repeat on the other side. You should look like you’re pedaling a bike. Don’t sacrifice range of motion for faster reps.
Kneel on the floor, and rest your forearms on a Swiss ball. The ball should be directly under your shoulders. Roll the ball forward, as you did with the abs wheel, until you’re about to lose tension in your abs, and then roll back.
Grab onto a bar and hang so that your arms are straight and your feet aren't touching the ground.  That's one rep.
Hold a dumbbell or kettlebell in one hand and stand with feet staggered. Bend your hips back to lower your torso until it’s parallel to the floor. Keeping your shoulders level to the floor, row the weight to your hip. Complete your reps, then repeat on the other side.
Hold a kettlebell or dumbbell in one hand and stand with feet shoulder width.
Set a barbell in a power rack (or use a Smith machine) at about hip height. Lie underneath it and grasp it with hands about shoulder-width apart. Hang from the bar so your body forms a straight line.
Use a trap bar and stand with feet hip width.
Set the bar up in a squat rack or cage and grasp it just outside shoulder width. Take the bar off the rack and hold it at shoulder level with your forearms perpendicular to the floor.
Stand on bands and hold the opposite ends.
Hold onto a sturdy object for support with your left hand. Hold a dumbbell in your right hand and lean away from your anchor point. Raise the weight until your arm is parallel with the floor.
Wedge the end of the barbell into a corner of the room (to avoid damage to the walls, you may have to wrap a towel around it). Load the opposite end with weight and grasp it toward the end of the sleeve with your left hand. Stagger your stance so your right leg is in front. Press the bar straight overhead.
Set up as you did for the neutral-grip row but with lighter dumbbells. Raise your arms out to your sides 90 degrees, squeezing your shoulder blades together at the top for a second. Complete your set and then rest until the end of three minutes, when your timer goes off.
Set up in a squat rack or cage. Grasp the bar as far apart as is comfortable and step under it. Squeeze your shoulder blades together and nudge the bar out of the rack. Step back and stand with your feet shoulder width and your toes turned slightly outward.  Push your knees outwards as you descend. Extend your hips to come back up, continuing to push your knees outward.
Grasp a dumbbell in your right hand and stand on a step or block that raises you a few inches above the floor. Step back with your right foot and lower your body until your left thigh is parallel to the floor and your rear knee nearly touches the floor. Keep your torso upright. Step forward to return to the starting position.
Stand lunge-length in front of a bench. Hold a dumbbell in each hand and rest the top of your left foot on the bench behind you. Lower your body until your rear knee nearly touches the floor and your front thigh is parallel to the floor.
Hold two dumbbells or kettlebells under your chin. Perform the front squat.
Stand with feet shoulder-width apart and squat down about halfway. Jump as high as you can. Land with soft knees and begin the next rep.


Evaluation Methods
The procedure of information retrieval evaluation is straightforward. In response to a given set of users' queries, an algorithm searches the benchmark database and returns an ordered list of responses called the ranked list(s), the evaluation of the algorithm then is transformed to the evaluation of the quality of the ranked list(s). Next, we will discuss the evaluation method.
Different evaluation metrics measure different aspects of shape retrieval behavior. In order to make a thorough evaluation of a 2D scene sketch-based 3D scene retrieval algorithm with high confidence, we employ a number of common evaluation measures used in the information retrieval community.
Precision- Recall
Precision- Recall Graph is the most common metric to evaluate information retrieval system. Precision is the ratio of retrieved objects that are relevant to all retrieved objects in the ranked list. Recall is the ratio of relevant objects retrieved in the ranked list to all relevant objects.
Let A be the set of all relevant objects, and B be the set of all retrieved object then,
, (1)
Basically, Recall evaluates how well a retrieval algorithm finds what we want a;T ndprecision evaluates how well it weeds out what we don't want. There is a tradeoff between Recall and Precision, one can increase Recall by retrieving more, while, this can decrease Precision.
E-Measures
The idea is to combine precision and recall of into a single number to evaluation the whole system performance. First we introduce the F-measure, which is the weighted harmonic mean of precision and recall. F-measure is defined as
, where is the weight. (2)
Let be 1, the weight of precision and recall is same, and we have
(3)
Then, go over all points on the precision-recall curve of each model and compute the F-measure, we get the overall evaluation of F for a special algorithm.
The E-Measure is defined as E = 1- F,
(4)
Note that the maximum value is 1.0, and higher values indicate better results. The fact is that a user of a search engine is more interested in the first page of query results than in later pages. So, here we consider only the first 32 retrieved objects for every query and calculates the E-Measure over those results.
Cumulated gain -based measurements
Based on the idea that the greater the ranked position of a relevant object the less valuable it is for the user, because the less likely it is that the user will examine the object due to time, effort, and cumulated information from objects already seen.
In this evaluation, the relevance level of each object is used as a gained value measures for its ranked position m, the result and the gain is summed progressively from position 1 to n. Thus the ranked object lists (of some determined length) are turned to gained value lists by replacing object IDs with their relevance values. The binary relevance values 0, 1 are used (1 denoting relevant, 0 irrelevant) in our benchmark evaluation. Replace the object ID with the relevance values, we have for example:
G'=< 1, 1, 1, 0, 0, 1, 1,0,1,0 . . . . >
The cumulated gain at ranked position i is computed by summing from position 1 to i when i ranges from 1 to the length of the ranking list. Formally, let us denote position i in the gain vector G by G[i]. The cumulated gain vector CG is defined recursively as the vector CG where:
(5)
The comparison of matching algorithms is then equal to compare the cumulated gain, the greater the rank, the smaller share of the object value is added to the cumulated gain. A discounting function is needed which progressively reduces the object weight as its rank increases but not too steeply:
(6)
The actual CG and DCG vectors by a particular matching algorithm may also be compared to the theoretically best possible. And this is called normalized CG, normalized DCG. The latter vectors are constructed as follows. Let there be 5 relevant objects, and 5 irrelevant objects in each class, then, at the relevance levels 0 and 1. Then the ideal Gain vector is obtain by filling the first vector positions with 1, and the remaining positions by the values 0. Then compute CG and DCG as well as the average CG and DCG vectors and curves as above. Note that the curves will turn horizontal when no more relevant objects (of any level) can be found. The vertical distance between an actual DCG/CG curve and the theoretically best possible curve shows the effort wasted on less-than-perfect objects due to a particular matching algorithm.
Nearest Neighbor (NN), First-tier (Tier1) and Second-tier (Tier2)
These evaluation measures share the similar idea, that is, to check the ratio of models in the query's class that also appear within the top K matches, where K can be 1, the size of the query's class, or the double size of the query's class. Specifically, for a class with |C| members, K= 1 for Nearest Neighbor, K = |C| − 1 for the first tier, and K = 2 *(|C| − 1) for the second tier. For this evaluation C is always 20. The final score is an average over all the objects in database.


{% extends "emails/base.html" %}
{% load hc_extras %}
{% block content %}
Hello,
{% if membership %}
{% if membership.project.name %}
{{ membership.project.owner.email }} invites you to their
{% site_name %}
project {{ membership.project }}.
{% else %}
{{ membership.project.owner.email }} invites you to their
{% site_name %} account.
{% endif %}
{% if membership.role == "r" %}
You will be able to view their existing monitoring checks, but not modify them.
{% else %}
You will be able to manage their existing monitoring checks and set up new ones.
{% endif %}
If you already have your own account on {% site_name %}, you will be able to switch
between the two accounts.
{% endif %}
To log into {% site_name %},
please press the button below:
{% endblock %}
{% block content_more %}
Thanks,
The {% site_name %} Team
P.S. Need help getting started? Check out our
help documentation.
Or, just reply to this email with any questions or issues you have.
{% endblock %}


{% extends "index.html" %} {% block body %}
The table and map below displays the data from Google Analytics on the total number of visitors to ProDy API website since Jun 2011. More detailed statistics from Google Analytics are given below
ProDy is developed in Python and C. Detailed breakdown of code lines and other factoids can be found on Ohloh.


THE BACHELOR (New Line) Starring: Chris O'Donnell, Renee Zellweger, Hal Holbrook, James Cromwell, Artie Lange, Marley Shelton, Edward Asner, Peter Ustinov. Screenplay: Steve Cohen, based on the film SEVEN CHANCES. Producers: Bing Howenstein and Lloyd Segan. Director: Gary Sinyor. MPAA Rating: PG-13 (profanity, adult themes) Running Time: 100 minutes. Reviewed by Scott Renshaw.
I came to an epiphany while watching THE BACHELOR, an innocuous-enough-on-the-surface romantic comedy. It's not the sort of film in which one would expect to achieve any moment of clarity, but there it was nonetheless. I sat there watching this marshmallow of a movie unfold when suddenly I realized what is so ridiculously wrong with the entire romantic comedy genre circa 1999. In a word, it's the same thing that's wrong with so many movies circa 1999: writing. More to the point, it's the refusal to acknowledge that characterizations matter when you're telling a story about a relationship. THE BACHELOR is merely the latest in a long line of films where we're expected to get dewy-eyed over any pairing of attractive, pleasant people just because they're attractive and pleasant.
In this particular case, Attractive and Pleasant Exhibit A is Jimmy Shannon (Chris O'Donnell), a single guy who has been watching his friends slowly but surely sucked into marriage. It's a scary notion for Jimmy, even though he dearly loves Attractive and Pleasant Exhibit B Anne (Renee Zellweger), his girlfriend of three years. Convinced despite his reservations that it's time to "sh*t or get off the pot," Jimmy proposes to Anne -- very badly. Anne refuses, which leaves Jimmy in a very odd position when his eccentric grandfather (Peter Ustinov) dies and leaves a very specific video will. Jimmy stands to inhereit $100 million if he is married by 6:05 p.m. on his 30th birthday, stays married for 10 years and produces a child. There are only a couple of minor problems: 1) Jimmy's 30th birthday is the next day; 2) Anne is nowhere to be found, meaning Jimmy has to find another willing bride from among his many ex-girlfriends.
It's a wacky, BREWSTER'S MILLIONS-esque premise (acknowledged as such in one of the film's better, more self-aware lines of dialogue), the kind where a shallow and materialistic guy learns What Really Matters. At least that would be the case if Jimmy weren't already a world-class altruist. Screenwriter Steve Cohen slides into the story an even more draconian condition in the will: If Jimmy doesn't get married, not only will he lose all the money, but the family billiard table buisness will be sold out from under him, costing hudreds of jobs. From the outset, Jimmy's motivation isn't cash; it's the livelihoods of his devoted employees. It's almost embarrassing for his marital misgivings to play a role in THE BACHELOR's plot development. By any human standard, the guy is impossibly selfless.
And that's the essence of the gutlessness endemic to films like THE BACHELOR -- the fear of giving the characters flaws to overcome on their way to happiness. There's never any tension between the two star-crossed lovers, because there's no sense that anything remotely significant is at stake. The blandly nice O'Donnell couldn't pull off a randy cad if he tried, so the filmmakers don't even let him; Zellweger's Anne may have issues with her sickeningly affectionate parents as an impossible standard to live up to, but no one dares make her anything but the woman (lightly) wronged. And forget about seeing enough of Jimmy and Anne together to feel invested in their potential reconciliation. The parade of sit-com set pieces had better be damned funny, since they're all that stands between us and a blissfully sweet foregone conclusion.
I'll admit a couple of those set pieces are amusing, including Ustinov's rantings about procreation and a restaurant full-to-bursting with men popping questions and champagne corks. Far more of them are either tedious or downright ghastly, like the shudder-inducing sight of Brooke Shields as an icy fortune-hunter or the hideous collection of stereotypes when hundreds of potential brides gather in a church. You're never going to get too many raucous belly laughs from a film like THE BACHELOR, but that's not the real problem. Nor is it the real problem that you know exactly the kind of warm-n-fuzzy conclusion it's leading up to. The problem are a beginning and middle that are equally warm-n-fuzzy -- there's no spark, no energy, no humanity. It's an emotional pudding guaranteed not to offend any consumer's digestions. We've reached a point where our proxies for cinematic romantic wish fulfillment don't even have a pulse. THE BACHELOR is love among the mannequins.
On the Renshaw scale of 0 to 10 wedded blahs: 3.
Visit Scott Renshaw's Screening Room http://www.inconnect.com/~renshaw/ *** Subscribe to receive new reviews directly by email! See the Screening Room for details, or reply to this message with subject "Subscribe".
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Ah the age old question of what is and isn’t a pastry! It confuses quite a bit of us but here is the most basic way to understand
it: Look at the recipe.
Yup, that’s the best way to know. I’m sure most of you are unaware of what it takes to make most of
the pastries you eat, or those featured in our site. Which is completely understandable considering many
of our favorites take a long time to make-- Kouign-Amann comes to mind.
In essence a pastry is usually made with flour, water and a fat. Now it can also have sugar and other
items as we know but usually it is sweet. The fat that usually delivers the best flavors is of course,
butter. Butter just makes pretty much every pastry delicious. Now you’re probably thinking, well then
a cake is a pastry too! But a cake gets mixed, while pastries are created with a dough which is rolled
or shaped. A pastry also starts with the fat which is still solid while being added to the mixture. Other
common fats used besides butter are shortening or lard.
Pastries take a lot of work in getting the dough to behave the way you need it to for the pastry to
come out correctly. Even the simplest of pastries still requires manipulation of the dough and will leave
you with a messy kitchen.
 Here at pastry punks we
sure do!
Rosie Olaivar
Co-Owner, Web Developer, CDO


VICTON's 7-person photo for their 3rd anniversay sparks conversation about Seungwoo's return to the group
by jennywillFans are abuzz with a chance that Seungwoo can return to VICTON sooner than anticipated.
With X1 currently facing a stark lack of promotions and a possible disbandment due to Ahn Joon Young admitting that 'Produce X 101' and 'Produce 48' ranking was manipulated, Seungwoo fans have found a silver lining - the chance that he may be able to return to VICTON sooner.
Seungwoo's #3 place at the end of 'Produce X 101' was bittersweet, as both new and old fans had gotten to realize VICTON meant a lot to him. VICTON members revealed that Seungwoo was still keeping active tabs on VICTON, monitoring their stages and giving them encouragement, and it was further revealed that Seungwoo cried after recording his message to VICTON.
When a netizen asked, "If Seungwoo come back to VICTON, will you accept him?", answers were variants on absolutely yes. Comments read, "It's not that he's being accepted. It's that he's coming back," "Seungwoo is originally VICTON. He's not being accepted. It's something obvious," "There will be a celebration as soon as he comes back," and more.
How do you feel about this?


You have contracted covid19, and ended up in hospital. You are lucky your symptoms are mild and you only need to self quarantine for 14 days at home. Pay more attention to your interactions or you will not be so lucky next time.
For more information about how to protect yourself visit
who.int.


--- layout: post title: rare pencil sketch date: '2014-03-06T07:30:00+01:00' categories: - Sketches picture_url: https://film-Storyboards.tumblr.com/post/78745905532/rare-pencil-sketch ---
rare pencil sketch


Privacy Statement for mathsisfun.com
Also Read: Internet Safety Guide
Overview
Mathsisfun.com does not have memberships or subscriptions, and does not keep any personally identifiable information (except what you say when you contact us).
We use "cookies" to store some settings. Advertisers may also use information about you that is out of our control.
Here are the details:
This privacy statement discloses the privacy practices for mathsisfun.com, and advises you of what information may be collected via this website and what will happen to it.
- What personally identifiable information of yours or third party personally identification is collected from you through the web site
- The organization collecting the information
- How the information is used
- With whom the information may be shared
- What choices are available to you regarding collection, use and distribution of the information
- The kind of security procedures that are in place to protect the loss, misuse or alteration of information under mathsisfun.com control
- How you can correct any inaccuracies in the information.
If you feel that we are not abiding by our privacy policy, please contact us
Information Collection and Use
Mathsisfun.com is the sole owner of the information collected on this site. We will not sell, share, or rent this information to others in ways different from what is disclosed in this statement. Mathsisfun.com collects only enough information to provide basic functionality and security.
 Usage of a cookie is in no way linked to any personally identifiable information while on our site. For instance, by setting a cookie on our site, the site can know if you pressed "hide ads". If a user rejects the cookie, they may still use our site. The only drawback to this is that the user will be limited in some areas of our site.
Advertisers
We use third-party advertising companies to serve ads when you visit our website. These companies may use information about your visits to this and other websites in order to provide advertisements about goods and services of interest to you.
Log Files
We use IP addresses to analyze trends, administer the site, track movement, and gather broad demographic information for aggregate use. IP addresses are not linked to personally identifiable information. We may share aggregated demographic information with our partners and advertisers. This is not linked to any personal information that can identify any individual person.
Links to Other Sites
This web site contains links to other sites. Please be aware that mathsisfun.com is not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects personally identifiable information. This privacy statement applies solely to information collected by this Web site.
Security
As mathsisfun.com is a free information only service and sells no products directly there is no secure server connection. At no time will mathsisfun.com directly request address or payment details. However, some partner sites do sell direct. Where possible it has been checked that these sites are using a secure server. Please check as mathsisfun.com cannot be responsible for insecure transactions from other web sites.
Notification of Changes
If we decide to change our privacy policy, we will notify users on our Homepage so our users are always aware of what information we collect, how we use it, and under circumstances, if any, we disclose it. We will use information in accordance with the privacy policy under which the information was collected.
Last Updated: Tuesday 28 Feb 2012


Please note: this is slow by definition!
Generate your app via Angular-CLI instead! (next chapter in the book)
If you can read this message for more than 15 seconds please try to disable your AdBlocker.
It might block the loading of packages from https://unpkg.com.


Sphere (1998) * A movie review by Serdar Yegulalp Copyright 1998 by Serdar Yegulalp
I'm spoiled. Long before I had ever read a single Michael Crichton novel, I read Stanislaw Lem, the Polish science-fiction writer who has far more to say in one book than Crichton has had to say in all of his. The book in question was SOLARIS, a novel about a planet that appears to be a life form unto itself. Crichton probably didn't plagarize SOLARIS to write SPHERE, but it's simply an infinitely inferior book compared to Lem's novel.
SPHERE, the movie from said novel, suffers from all the same drawbacks. Worse, there has already been a movie made of SOLARIS, by the Russian filmmaker Andrei Tarkovsky, which is haunting and chilling in ways that this film, directed passively by Barry Levinson as a holding action before WAG THE DOG, cannot even begin to conceive of.
The plot: A ways back, a psychologist by the name of Norma Hoffman (played by *Dustin* Hoffman), put together a government report on what to do if E.T. comes calling. He named several colleagues of his as members of a "contact team" -- almost jokingly, it seems, but the government gets the last laugh when the team is activated for a mission to the South Pacific. Sure enough, down on the ocean floor, there are the remains of a spaceship that crashed there -- almost 300 years ago. (There is one funny moment straight from the book about the maker of the ship's electronics that I will not spoil here.)
What they find is by turns intriguing and idiotic. A pattern gets set up: we get the hint of something that may be an explanation, and then we're forced to discard it and start from absolute scratch. This is annoying. When we finally DO understand what the Sam Hill is going on, it doesn't make any sense -- and the conclusion the movie tries to draw from it is just plain limp. The effects are decent, but they are no more than a light show to support a movie that really isn't about much of anything. I kept harkening back to THE ABYSS, which generated horrible suspense with nothing more than a broken umbilical cable -- or the exploding rivets of DAS BOOT. Nothing like that holds the attention here.
The actors try. They do not get far. Samuel Jackson is probably the best of the bunch, since he can pretty much survive anything through a show of attitude. Sharon Stone, who is a better actor than people realize (see LAST DANCE and CASINO, and the upcoming THE MIGHTY!), is totally lost. And Dustin Hoffman himself does a reprise of the same territory he did with OUTBREAK. No wonder they're content to just drift: the material they're given doesn't afford them a chance to really make their performances matter.
So. When do we get a Tarkovsky revival?
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


"The most important thing is to get the basic principles of coding down, practice a lot, and be ready to change to another language when your job inevitably does."
For more information, please visit Epicodus.
"The most important thing is to get the basic principles of coding down, practice a lot, and be ready to change to another language when your job inevitably does."
For more information, please visit Epicodus.
"The most important thing is to get the basic principles of coding down, practice a lot, and be ready to change to another language when your job inevitably does."
For more information, please visit Epicodus.


Connecting Builder signals
signals in UI definitions
User interfaces may be defined by in XML documents. Such documents are typically edited with Glade.
Signals, along with a named handler, maybe appear in a definition.
<interface>
...
<object class="GtkButton" id="ok_button">
<signal name="clicked" handler="ok_button_clicked"/>
</object>
...
</interface>
The handler
attribute value provides a name
that can be used to associate the signal with a handler function.
connecting
To connect signals from a UI definition,
call Builder
’s ConnectSignals
method.
The single argument is a map of handler names to handler functions
The map keys should match handler
attribute values in
the UI definition.
The handler function signatures must match the signal’s
equivalent Connect...
function.
example
builder := gtk.BuilderNewFromString(`
<interface>
<object class="GtkButton" id="ok_button">
<signal name="clicked" handler="ok_button_clicked"/>
<signal name="draw" handler="draw"/>
</object>
</interface>
`)
err := builder.ConnectSignals(map[string]interface{}{
"ok_button_clicked": func(button *gtk.Button) {
// handle the click
},
"draw": func(widget *gtk.Widget, cr *cairo.Context) bool {
// draw something in the context
return false
},
})
See the tests in gtkbuilder-connect-signals_test.go for more examples including some error scenarios.
errors
There are a number of errors that may occur while connecting signals.
* A key in the map passed to ConnectSignals
may not match any
handler
attribute value in the UI definition.
* A handler function’s signature may be incorrect.
* A signal name may be valid, but the signal may not be supported by gobbi.
Any of these will result in an error
being returned.


As part of a security audit, I was asked to help in finding all accounts marked with "Trusted for Delegation"
What is "Trust for Delegation"
You can try reading the TechNet Article, but in short - delegation (also known as kerberos double-hop) is allowing a service to impersonate clients in order to access other services, e.g. allowing an ASP.NET site to pull CRM records via CRM web service, using the client's credentials (and so showing only records relevant to the client).
The Risk
Accounts that are trusted for delegation can access other services in
the domain (e.g. Active Directory, Exchange, in-house software that uses
kerberos authentication, external software using ADFS) without the
user's explicit action or consent (sometimes without him even accessing
the system, see next paragraph) and without any limits or indication
that it's not the original user.
Some configurations also allow the delegate access to any service in the
domain (as opposed to specified ones) or giving the delegate access
without the user actually accessing the delegate in the first place
(read on).
To sum it up, delegation must be used sparingly due to its dangerous
nature.
Technical Implementation and Quirks
Delegation is all about an application getting a kerberos TGS (Ticket Granting Service) for another resource, using the client's identity (allowing the server to impersonate the client for that resource).
Delegation configuration is saved like that:
| Configuration | UserAccountControl & 0x80000 (TRUSTED_FOR_DELEGATION) | UserAccountControl & 0x100000 (TRUSTED_TO_AUTHENTICATE_FOR_DELEGATION) | msDS-AllowedToDelegateTo |
|---|---|---|---|
| Do not trust this user for delegation | X | X | X |
| Trust this user for delegation to any service (Kerberos only) | V | X | X |
| Trust this user for delegation for specified services only (Kerberos protocol) | X | X | V (List of SPNs) |
| Trust this user for delegation for specified services only (Any authentication protocol) | X | V | V (List of SPNs) |
Notes
- When "Any protocol" is enabled, services don't need to present an existing kerberos TGS, but can fabricate one using only the user's id. (Source: Technet)
This method is designed to accommodate services that don't use kerberos authentication (e.g. websites that use forms authentication), but has a very serious implication - accounts allowed to do so don't have to present any proof that a specific user has even accessed the system - they can create any TGS out of thin air. - When constrained to specific services, the resulting TGS is itself delegation-constrained to those services, so to allow a "triple hop" like this:
S1 > S2 > S3
S1
must be configured either to allow delegation toany service
or toS2
ANDS3
. - For really sensitive accounts (such as domain admins), one can mark "Account is sensitive and cannot be delegated" to prevent AD allowing any form of delegation with this account. This account will suffer from reduced functionality on applications requiring delegation to work (like the site described earlier).
Finding Allowed Accounts
Although PowerShell's module for Active Directory has some calculated variables for delegation (e.g. TrustedForDelegation
), they can't be used to filter ADObject
(only ADUSer
or ADComputer
), so I built my own script
to find trusted-for-delegation accounts:
Get-ADObject -fi {(msDS-AllowedToDelegateTo -like '*') -or (UserAccountControl -band 0x0080000) -or (UserAccountControl -band 0x1000000)} -prop samAccountName,msDS-AllowedToBeDelegateTo,servicePrincipalName,userAccountControl `
| select DistinguishedName,ObjectClass,samAccountName,servicePrincipalName,
@{name='DelegationStatus';expression={if($_.UserAccountControl -band 0x80000){'AllServices'}else{'SpecificServices'}}},
@{name='AllowedProtocols';expression={if($_.UserAccountControl -band 0x1000000){'Any'}else{'Kerberos'}}},
@{name='DestinationServices';expression={$_.'msDS-AllowedToDelegateTo'}}


Enumerable#group_by method
11/24/2014
Ruby Enumerable
class offers a lot of useful methods which allow to easily manipulate the contents of object lists. One of these methods is Enumerable#group_by
.
group_by
allows to group the elements into a map of arrays with the specified group names.
This is a sample of the return value {:group1=>[1,2,3], :group2=>[3,4,5]}
.
It is incredibly flexible as it takes a Ruby block as an argument which should return a group key for each passed element. This is a sample of the block which groups an array of integers such as [1,2,3,4,5,6,7,8,9]
into two groups: odd and even:
[1,2,3,4,5,6,7,8,9].group_by {|element| element%2==0 ? "even":"odd"}
#<= {"odd"=>[1, 3, 5, 7, 9], "even"=>[2, 4, 6, 8]}
Grouping of elements is a typical task for a programmer and this methods makes life so much easier by providing a one line method to do what otherwise would take at least 4 - 5 lines of code to implement.