National Statistics
Pupil attainment data, grouped by gender, ethnicity and free school meal eligibility, broken down by the area in which pupils live.
PDF , 2.23MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 3.38MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 2.22MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 3.4MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 2.22MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 3.4MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 2.23MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 3.41MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 2.22MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 2.21MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 2.23MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 3.4MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 2.22MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 3.4MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 2.22MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
PDF , 3.4MB , 1 page
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
ZIP , 9.57MB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
Plain text , 756Bytes
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
The tables provide 2012 information on pupil residency-based small area pupil attainment (early years foundation stage profile (EYFSP) and key stages 1, 2, 4 and 5) broken down by gender, free school meal (FSM) eligibility (key stages 2 and 4 only) and ethnicity (key stages 2 and 4 only). The tables also provide information on pupil residency-based pupil absence broken down by gender for the 2011 to 2012 academic year.
The key points from the latest release are:
at EYFSP, girls consistently perform better than boys in almost all LADs
at key stage 1, key stage 2, key stage 4 and key stage 5, girls also outperform boys in all but a small number of LADs
overall, all other pupils perform significantly better than FSM pupils in all areas of the country, this performance gap can be seen at both key stage 2 and key stage 4
Chinese pupils continue to have the highest levels of attainment in all regions for key stage 2 and key stage 4
black pupils have some of the lowest levels of attainment across the country at these 2 key stages
there is smaller variation across the regions for pupils in primary schools with the Yorkshire and the Humber having the highest level of persistent absence and the South East the lowest
Download formats www.neighbourhood.statistics.gov.uk
Additional information on maps above:
map: early years foundation stage profile by local authority district - percentage of pupils in all schools and early years’ settings achieving a good level of development by local authority district (of pupil residence), 2012
map: early years foundation stage profile by middle layer super output area - percentage of pupils in all schools and early years’ settings achieving a good level of development by middle layer super output area (of pupil residence), 2012
map: key stage 1 average point score by local authority district - average point score of pupils in maintained schools by local authority district (of pupil residence), 2012
map: key stage 1 average point score by middle layer super output area - average point score of pupils in maintained schools by middle layer super output area (of pupil residence), 2012
map: key stage 2 by local authority district - percentage of pupils in maintained schools achieving level 4 or above in reading, writing and maths combined by local authority district (of pupil residence), 2012
map: key stage 2 by middle layer super output area - percentage of pupils in maintained schools achieving level 4 or above in reading, writing and maths combined by middle layer super output area (of pupil residence), 2012
map: key stage 4 - 5+ GCSEs at grades A* to C including English and mathematics by local authority district - percentage of pupils in maintained schools achieving 5 A* to C grades at GCSE or equivalent including English and mathematics GCSEs by local authority district (of pupil residence), 2012
map: key stage 4 - 5+ GCSEs at grades A* to C including English and mathematics by middle layer super output area - percentage of pupils in maintained schools achieving 5 A* to C grades at GCSE or equivalent including English and mathematics GCSEs by middle layer super output area (of pupil residence), 2012
map: key stage 4 English Baccalaureate by local authority district - percentage of pupils in maintained schools achieving the English Baccalaureate by local authority district (of pupil residence), 2012
map: key stage 5 - 2 or more passes by local authority district - percentage of students achieving 2 or more passes of A level equivalent size in maintained schools and further education sector colleges by local authority district (of student residence), 2012
map: key stage 5 average point score by local authority district - average performance table point score per student in maintained schools and further education sector colleges by local authority district (of student residence), 2012
map: key stage 5 average point score by middle layer super output area - average performance table point score per student in maintained schools and further education sector colleges by middle layer super output area (of student residence), 2012
map: overall absence by local authority district - percentage of half days missed in schools by local authority district (of pupil residence), 2011 to 2012 academic year
map: overall absence by middle layer super output area - percentage of half days missed in schools by middle layer super output area (of pupil residence), 2011 to 2012 academic year
map: persistent absence by local authority district - percentage of enrolments classified as persistent absentees in schools by local authority district (of pupil residence), 2011 to 2012 academic year
map: persistent absence by middle layer super output area - percentage of enrolments classified as persistent absentees in schools by middle layer super output area (of pupil residence), 2011 to 2012 academic year
Ben Howick
020 7783 8621
Published: 20 June 2013


Code Metrics (Function) : All File
The Function Metrics is provided only for
modified Function.
The Function Metrics cannot be provided if source code was not modified in Source Insight.
Function Name
CC(Cyclomatic Complexity)
SLOC
Function Name
CC(Cyclomatic Complexity)
SLOC


WVLT builds new weather center in Sevier County
SEVIER COUNTY, Tenn. (WVLT) -- Get ready, Sevier County! The WVLT News team just built a state-of-the-art weather center right in Pigeon Forge.
The addition comes as the WVLT Weather team seeks to get closer and more in-depth information about what's happening in our mountains. In the Great Smoky Mountains, elevation can change temperatures by 15 degrees.
WVLT Meteorologist and Sevier County Bureau Chief Kyle Grainger took a quick drive up Newfound Gap Road and spoke with Jim Renfro, a park representative, to talk about changes in weather in the Sevier County area.
Renfro said, in most cases, the air is colder the higher you go. It's as the air hits the mountains and moves upwards that you start to see changes.
"It condenses and forms clouds, and it forms enough condensation in those clouds, and it'll rain," Renfro said. He added that, depending on the mountain elevation, that moisture can turn into snow or rain.
The Great Smoky Mountains National Park has an elevation difference of more than a mile. For every 1,000 feet of elevation, on average it brings a cooling effect of two to three degrees.
"We're seeing those extremes year after year," Renfro said. "But the average is 20 to 25 inches [of precipitation] more tat the higher elevations. So just think of the snowfall."
One place that knows all about weather changes in Sevier County is Ober Gatlinburg. Grainger spoke to Ober representative Kate Barido.
On a good day, Barido said Ober can make 300 tons of snow.
"The change in elevation can definitely affect the weather here at Ober Gatlinburg. Based on where we are, it can be warmer or cooler from downtown Gatlinburg."
A "bad day" at Ober is called an inversion, which is when the air is actually warmer on top of the mountain than below.
For folks who live on some of these higher mountain tops, it's important to have a stock of food and water just in case you get iced in over winter.
Read more about WVLT's Winter Weather Outlook here.


Ok, hold your horses. Just let me explain the theory and then judge.
So according to my theory, every major popular music genre has roughly 30 years until it's done. Done in a sense that after that nothing can change our perception of what this genre is and what it should sound like.
As shown on the chart, every genre starts with a proto era (green area), in which it is slowly and gradually developing. Then comes the breakthrough single, that puts it on the map by drawing attention of listeners, artists and music business alike. This is the start of the genre's golden age which lasts roughly 10 years, and also a moment at which the clock starts ticking. Then follows 10 years of crisis in which usually two other genres steal the focus. In second half of this crisis, there emerges one sub-genre, that brings out the worst of the genre, examples of which are glam rock, hair metal, skate punk, bling rap and brostep. Crisis ends with a revival of a genre that usually consists of many new and diverse sub-genres.
And now comes a more controversial claim, that the death of a genre happens between two albums, made by an exceptional artist. One a masterpiece, that the artist is never again able to surpass, although he produces many more great albums, and the other the album after that. The masterpiece album rises expectations and appetites of many and the future of the genre seems bright, while actually it is standing on its last legs.
Another thing that might be controversial in this theory, besides the selection of the "chosen ones", are the genres they are associated with — namely Tom Waits with Rock and roll, Beck with Rock, LCD Soundsystem with Punk and Kendrick Lamar with Hip hop. Lamar is probably the least controversial choice among them, simply because he's a rapper, but still — if we look at the music on the Pimp a Butterfly, it's a mix of many diverse genres and sounds, everything from funk to jazz and that's something that is common to all chosen legendary albums. Specifically, Tom Waits' Big Time, a collection of live recordings of songs from his last three albums, could be described as anything from blues, gypsy music, ballads, blues rock and cabaret... Beck's Odelay could be described as a mixture of old-school hip hop, delta blues, country, grunge and noise. LCD Soundsystem's Sound of Silver contains mixture of electronica, funk, new wave, post-punk and Bowie's sound.
Let's focus on the selection of genres and why they are divided as they are. First it should be mentioned, that the selected genres are defined with broadest possible definitions. For instance: metal falls under rock, new wave and hardcore under punk, electro under hip hop, etc. After that, maybe the most glaring are the omissions of pop and jazz. Pop is, as it was mentioned many times before, the ultimate absorber and survivor, that will exist forever. Jazz is, on other hand, a genre that really comes to life only in a live setting and trough improvisation and something always gets lost when it's captured on a record. Also if you look closely at the EDM (electronic dance music), you'll notice that it does not start before 1990. This is because I excluded the EDM that is made for the dancefloor and only considered the part, that can be listened to sitting down.
Another curiosity is a quantity of genres crammed into rock and roll before its breakthrough single "Rock Around the Clock" that started the rock and roll craze in 1955. Reason for that is that the progress from boogie-woogie to fully developed rock and roll was exceptionally gradual. This evolution basically consists of additions of new instruments and vocals to the rhythm, that stayed pretty much the same from the beginning. Of course there were the sub-genres that had their own rhythms, and are not meant to be included into proto R'n'R, such as western music (that usually falls under country music).
Big reason for the breakthrough that happened in '55, lies in the fact that R&B and country markets started intersecting. Before the war almost no white people were buying black music and vice versa. It is also worth mentioning that this fact, together with a short time that it took for a single to be recorded and released, contributed to a more fluid progression of a style, that became known as a rock and roll.
As with rock and roll, every major genre that succeeded it, started with a huge hit single, that basically defined it — and so it happens that this singles were following each other in intervals of roughly 10 years. The other singles being "Satisfaction" by Rolling Stones for rock, "God Save the Queen" by Sex Pistols for punk, "Walk This Way" by Run-D.M.C. for hip hop and "Firestarter" by Prodigy for EDM.
For rock other candidates could be earlier single "You Really Got Me" by Kinks, if one would want to include the whole British garage rock scene or maybe some later single that was not anymore in style of garage rock, like "Light My Fire" by the Doors. "God Save the Queen" as a breakthrough single of a punk genre is hard to dispute, although Ramones' "Blitzkrieg Bop", from one year earlier was artistically much more significant. As for hip hop, I think "Walk This Way" is a good fit, although it could be argued, that it sounds too old-school and that some other artists from next two years, like N.W.A. or Public Enemy better defined hip hops step into golden age. Nonetheless, none of them had such a big hit as Run-D.M.C. had. Considering EDM—if we define it as an electronic dance music, that can be listened to sitting down—the commercial success of Prodigy's album Fat Of The Land must be the big breakthrough moment.
Now I should probably address the oddity of exceptionally long era of proto hip hop. I must admit that it wasn't in my model from the beginning when I recognized "Rapers delight" by Shugarhill Gang as a start of hip hop's proto phase. In this early version funk, disco and reggae were placed in a revival phase of rhythm and blues. Problem with this approach is that R&B was pretty much always just an umbrella term for black music styles that didn't exist before 1945. Also original R&B that was played from 1945 to 1955, was together with rockabilly basically what became known as rock and roll after its breakthrough in 1955 and it has stylistically little in common with later "R&B". Another solution could also be, to create a separate timeline for each one of these genres, but none of them had enough longevity and prominence to justify that also. So for that reason they got packaged inside the proto hip hop era.
So how come this eras coincide so neatly? I must admit I didn't bother with it too much, but it must have something to do with the economics. One theory could be based on the fact that the biggest force in sales were, at least from the mid 40s onward, the teenagers, which are probably at around the age of 15 most susceptible to the new music trends. And this new trends, must by definition sound and feel fresh and hip. They must be something your parents dislike and just don't get. So by this logic, if a genre is at the point of resurgence, this 15 year old teenager was 5 when it came into crisis — just young enough to not yet be susceptible to the popular music.
Only inconsistency on the timeline left is a lack of emergence of a new major genre around year 2006. There are two possible explanations. First one is that we can adequately classify popular music only in retrospective and that's why we are lacking the perspective that would allow us to fully understand what is currently happening in music. But this explanation just feels insufficient if we take into consideration, what a huge stir rock and roll and rock created in their first years, how distinctive punk was from the rock of its era, and the hard separation of hip hop from other genres by a simple fact that the lyrics are being rapped. In this case probably the more pessimistic explanation is true, namely that there are no new major genres because the music industry as we knew it was already in such a bad shape by the 2006 that it wasn't able to procreate by pushing out the next big thing (unless "indie" was the next big thing).
Lastly I must admit that I find it hard to believe that hip hop could have died in 2017. Maybe hip hop as we know it did, but a new kind, musically much more daring and vibrant has just been born — and Lamar's single "HUMBLE." might just be the big breakthrough of this new genre that was slowly fermenting during last 10 years.


Browns coach Kitchens: Benching of WR Callaway only 1 game
by TOM WITHERSCLEVELAND (AP) - Browns coach Freddie Kitchens said wide receiver Antonio Callaway’s benching was a one-game punishment.
Callaway didn’t play in Sunday’s 19-16 victory over the Buffalo Bills after being a surprising healthy scratch despite quarterback Baker Mayfield saying the receiver had been included in the game plan.
Kitchens did not divulge his reasons for sitting Callaway, who was suspended four games earlier this season by the NFL for violating the league’s drug policy.
On a conference call Monday, Kitchens said he wasn’t confident the 22-year-old Callaway would respond to the discipline.
“I don’t know if he got the message or not,” Kitchens said. “But I’m not wavering.”
Kitchens said any conversations with Callaway will remain “between Antonio and I” but added the benching “was only for yesterday.”
The benching gave more playing time to wide receiver Rashard Higgins, who caught a 7-yard touchdown pass with 1:44 left as the Browns snapped a four-game losing streak.
Kitchens was asked if he was disappointed or frustrated that he had to penalize Callaway, given his somewhat checkered history in college and during his short time as a pro. The Browns have been patient with him.
“I always want our players to make good choices,” Kitchens said. “I did what I felt like I needed to do. It’s over.”
Callaway has eight catches for 89 yards in four games this season. As a rookie, the second-round pick in 2018 from Florida had 43 receptions for 586 yards and five touchdowns.
More AP NFL: https://apnews.com/NFL and https://twitter.com/AP_NFL
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


The president has informed his advisers not to make dire predictions about the financial impact of the virus, The Washington Post reported
Newsweek's top fiction and nonfiction spring books to entertain and excite your imagination from the blustery days of late winter until the sun shines in the spring.
Newsweek's top fiction and nonfiction spring books to entertain and excite your imagination from the blustery days of late winter until the sun shines in the spring.
Newsweek's top fiction and nonfiction spring books to entertain and excite your imagination from the blustery days of late winter until the sun shines in the spring.
Black Lives Matter Co-Founder Endorses Sanders and Warren Patrisse Cullors said the former vice president was part of an "old establishment" and needed to make way for "new leadership" in the Democratic party.
Black Lives Matter Co-Founder Endorses Sanders and Warren Patrisse Cullors said the former vice president was part of an "old establishment" and needed to make way for "new leadership" in the Democratic party.
Black Lives Matter Co-Founder Endorses Sanders and Warren Patrisse Cullors said the former vice president was part of an "old establishment" and needed to make way for "new leadership" in the Democratic party.
Black Lives Matter Co-Founder Endorses Sanders and Warren Patrisse Cullors said the former vice president was part of an "old establishment" and needed to make way for "new leadership" in the Democratic party.
Black Lives Matter Co-Founder Endorses Sanders and Warren Patrisse Cullors said the former vice president was part of an "old establishment" and needed to make way for "new leadership" in the Democratic party.
Black Lives Matter Co-Founder Endorses Sanders and Warren Patrisse Cullors said the former vice president was part of an "old establishment" and needed to make way for "new leadership" in the Democratic party.
Black Lives Matter Co-Founder Endorses Sanders and Warren Patrisse Cullors said the former vice president was part of an "old establishment" and needed to make way for "new leadership" in the Democratic party.
Black Lives Matter Co-Founder Endorses Sanders and Warren Patrisse Cullors said the former vice president was part of an "old establishment" and needed to make way for "new leadership" in the Democratic party.
Black Lives Matter Co-Founder Endorses Sanders and Warren Patrisse Cullors said the former vice president was part of an "old establishment" and needed to make way for "new leadership" in the Democratic party.
Hal Donahue Is Scouting Worth Saving? Not Under the Boy Scouts of America
BY HAL DONAHUE
Hal Donahue Is Scouting Worth Saving? Not Under the Boy Scouts of America
BY HAL DONAHUE
Hal Donahue Is Scouting Worth Saving? Not Under the Boy Scouts of America
BY HAL DONAHUE
Hal Donahue Is Scouting Worth Saving? Not Under the Boy Scouts of America
BY HAL DONAHUE
Hal Donahue Is Scouting Worth Saving? Not Under the Boy Scouts of America
BY HAL DONAHUE
Hal Donahue Is Scouting Worth Saving? Not Under the Boy Scouts of America
BY HAL DONAHUE
Say Bye to Media Coverage If Pelosi Succeeds in Censoring Our Video
Say Bye to Media Coverage If Pelosi Succeeds in Censoring Our Video
Black Lives Matter Co-Founder Endorses Sanders and Warren
Black Lives Matter Co-Founder Endorses Sanders and Warren
Black Lives Matter Co-Founder Endorses Sanders and Warren
Black Lives Matter Co-Founder Endorses Sanders and Warren
Black Lives Matter Co-Founder Endorses Sanders and Warren
Black Lives Matter Co-Founder Endorses Sanders and Warren
Black Lives Matter Co-Founder Endorses Sanders and Warren
Black Lives Matter Co-Founder Endorses Sanders and Warren
Black Lives Matter Co-Founder Endorses Sanders and Warren
Black Lives Matter Co-Founder Endorses Sanders and Warren
SIGN UP FOR OUR NEWSLETTER
SEE ALL FEATURES
COVER
WORLD
Growth Can Be Green. Here's How
COVER
WORLD
Growth Can Be Green. Here's How
COVER
WORLD
Growth Can Be Green. Here's How
COVER
WORLD
Growth Can Be Green. Here's How
COVER
WORLD
Growth Can Be Green. Here's How
COVER
WORLD
Growth Can Be Green. Here's How
Lorem Ipsum Dolor Lorem Ipsum Dolor
"The words that are coming out from the United States about WikiLeaks revelations were hollow 10 years ago, and they don't increase in legitimacy as years go by," Kristinn Hrafnsson said.
"The words that are coming out from the United States about WikiLeaks revelations were hollow 10 years ago, and they don't increase in legitimacy as years go by," Kristinn Hrafnsson said.
"The words that are coming out from the United States about WikiLeaks revelations were hollow 10 years ago, and they don't increase in legitimacy as years go by," Kristinn Hrafnsson said.
"The words that are coming out from the United States about WikiLeaks revelations were hollow 10 years ago, and they don't increase in legitimacy as years go by," Kristinn Hrafnsson said.
"The words that are coming out from the United States about WikiLeaks revelations were hollow 10 years ago, and they don't increase in legitimacy as years go by," Kristinn Hrafnsson said.
"The words that are coming out from the United States about WikiLeaks revelations were hollow 10 years ago, and they don't increase in legitimacy as years go by," Kristinn Hrafnsson said.
"The words that are coming out from the United States about WikiLeaks revelations were hollow 10 years ago, and they don't increase in legitimacy as years go by," Kristinn Hrafnsson said.
"The words that are coming out from the United States about WikiLeaks revelations were hollow 10 years ago, and they don't increase in legitimacy as years go by," Kristinn Hrafnsson said.
#EatTheRich Trends After Mike Bloomberg Campaign Offices Vandalize
#EatTheRich Trends After Mike Bloomberg Campaign Offices Vandalize
#EatTheRich Trends After Mike Bloomberg Campaign Offices Vandalize
#EatTheRich Trends After Mike Bloomberg Campaign Offices Vandalize
#EatTheRich Trends After Mike Bloomberg Campaign Offices Vandalize
#EatTheRich Trends After Mike Bloomberg Campaign Offices Vandalize
#EatTheRich Trends After Mike Bloomberg Campaign Offices Vandalize
#EatTheRich Trends After Mike Bloomberg Campaign Offices Vandalize
#EatTheRich Trends After Mike Bloomberg Campaign Offices Vandalize
#EatTheRich Trends After Mike Bloomberg Campaign Offices Vandalize
All Access + Weekly Delivery. Choose A Membership That's Perfect for You!
SUBSCRIBE >Take back your inbox. Sign up for our newsletter and start making sense of the world around you.
SIGN UP >


16 Days Of Activism: Cops Appeal For Help To Crack Unsolved Crimes
by SG EditorMonday marks the start of 16 Days of Activism Against Gender-Based Violence and the police’s specialised unit dealing with sexual offences cases is asking for help from communities to crack unsolved crimes.
According to the latest statistics, crimes against women and children increased in six provinces in the year ending March 2019.

He said certain cases were solved quicker than others, but this depended on the evidence and experience of investigators.
“We win and solve cases through partnership. We need information from the community. The lack of information delays solving cases. Hence, we humbly request our communities to come forth.”
Uyinene Mrwetyana, Reeva Steenkamp, Karabo Mokoena, Anene Booysen, Dolly Tshabalala and the list goes on.
These women, who were victims of gender-based violence, did not die in silence.
Their cases were widely covered in the media, putting pressure on the police to move with speed.
But it’s small progress, as many other cases remain unsolved and are left to become part of the statistics in an already overburdened and under-resourced police service.
Mandy Silva, aged 37, was murdered in her Northwold home, in Randburg, in 2015. No one else other than her husband and then four-year-old son was in the house.
More than four years later, Silva’s mother, Eileen Brothy, is aching for answers: “You could see she was either kicked or hit. This has been going on for two years, that I know of.”
A 2018 report by Statistics South Africa on crimes against women shows that in 2000, the murder rate of women in South Africa was more than five times the world average but that it declined steadily during 2000 and 2015.
In terms of police response, more women were less satisfied than men and attributed this to a widely shared belief that nothing would be done.


Stock Database
Looking for something?
All Stocks
Apple Inc
Symbol: AAPL
Currency: USD
Exchange: NASDAQ
Country: United States
Type: Common Stock


--- layout: archive title: Zulip Chat Archive permalink: /stream/116395-maths/topic/physics.html ---
Is someone by any change formalizing (formalized) physics math in Lean?
I don't think so (unless calculus and linear algebra count as physics).
There was this thread by @Kevin Sullivan. I think the corresponding repository is here. This thread is also related to that project.
I think at some point, @Michael R Douglas was considering formalizing quantum field theories in Lean.
I am interested in it but there are many many prerequisites to do first.
Before working on QM and QFT we need basic functional analysis and especially Fourier analysis.
Another prerequisite of very broad relevance to physics and math is the theory of Lie algebras and Lie groups.
I started working on this with Anthony Bordg, we are doing it in Isabelle to use smooth manifolds as defined by Immler and Zhan.
Even this needs a good amount of additional material to get anywhere.
Here is my suggestion for a project with very very broad relevance: make a general definition of a hypersurface in R^n or C^n.
In other words one is given a function f:R^n\rightarrow R such that f=0 => grad f \ne 0, and the goal is to define the set of solutions of f(x)=0 as a smooth manifold with its maximal chart. This would enable us to define a huge list of manifolds including the most important Lie groups and homogeneous spaces in one shot!
Last updated: Apr 24 2020 at 19:02 UTC


__ __ _ _ | \/ | _____ ___ __ ___| (_) | |\/| |/ _ \ \ / / '_ \ _____ / __| | | | | | | __/\ V /| | | |_____| (__| | | |_| |_|\___| \_/ |_| |_| \___|_|_|Mevn-Cli Documentation Version 1.0.0
MEVN is a scaffolding tool which makes it easy to build universal apps using Mongo, Express, Vue and NodeJS. It minimises the setup time and gets you up to speed using proven technologies.
A CLI tool for getting started with MEVN stack. It offers a super simple boilerplate project and additional utilities for building a MEVN app. It helps for beginner developers to easily create a template for their Web application development.
________________
To install the package :-
npm install -g mevn-cli
npm install -g mevn-cli
mevn-cli init "Desired File Name"
- mevn-cli init appname - To initialize the project.
- mevn-cli create:route - To create the Routes-File(API)
- mevn-cli create:model - To create the Models-File(SCHEMA)
- mevn-cli create:controller - To create the Controller-File
- mevn-cli create:config- To create the Config-File
- mevn-cli run:server - To run the Server
- mevn-cli run:client - To run the Client
The Project is initialised by entering the Init command and entering your desired AppName and Type of BoilerPlate you want.
This Command is used to create the Routes File required to generate necessary code for routing purposes.
This Command is used to create Models-File which is used for creating some Database Schema Definitions.
This is used to create the controller file which contains the logic part.
It is used to create the Config-File which grabs the database from the user.
This command is used to Run Server.
This command is used to Run Client.
Modules are the way of organising different domain-specific modules in the project. MEVN-CLI contains the following Modules.
| - Post
| - __Mevn-Cli__- // all the tests for this module goes here
| - lib // Sub components of this module
| - Commands
| - routeslib.js
| - configlib.js.js
| - modelslib.js
| - controllerlib.js
| - files
|-external //sub components of this module
|-figlet.js
| - Run // Sub components of this module
| - client.js
| - server.js
| - config.json
| - index.js
| - package-lock.json
| - package.json
------------------------- Version 3.8.3 - May 7th, 2015 --------------------------- ------------------------------------------------------------------------------------ - Minor bug fixes - Code clean up andd add elegant-spinner - Added pwa boilerplate - expand scope of commands - Added tables and modif - Added new command - Command to run the app - Added more commands - Added Init Command - Created Basic structure - Initial commit
Code released under the MIT License.
For more information about copyright and license check choosealicense.com.


Click on the document image to learn more about downloading the code and viewing it in a web browser!
Click on the design image to learn more about the development of our AI and decisions we've made throughout the project!
Click on the movie icon to view a short video about our project and watch a game played against the AI!
Click on the Github octocat to view all our code from the HTML and JavaScript to the Python!
Just three computer science students struggling to finish their final project...


From the newsletter ... |
BC - AD: The Turning PointWhat made the birth of one baby boy the turning point, the start of a new era, the pivot of human history?
It was the boy himself - Jesus - God become man. He is the turning point of human history - and much more - since he was born, countless millions have found him the turning point of their lives. Are you one of them?
Cogges Parish | Other articles | Following issue © 1998; Published in Cogges Parish monthly newsletter, number 235, December 1998<EMAIL_ADDRESS>|


Go to the source code of this file.
Classes | |
| struct | Board |
Typedefs | |
| typedef struct Board | Board |
Functions | |
| void | board_init (Board *) |
| Set a board to the starting position. | |
| int | board_set (Board *, const char *) |
| Set a board from a string description. | |
| int | board_from_FEN (Board *, const char *) |
| Set a board from a string description. | |
| int | board_compare (const Board *, const Board *) |
| Compare two board. | |
| bool | board_equal (const Board *, const Board *) |
| Compare two board for equality. | |
| void | board_symetry (const Board *, const int, Board *) |
| symetric board | |
| int | board_unique (const Board *, Board *) |
| unique board | |
| void | board_check (const Board *) |
| Check board consistency. | |
| int | board_count_last_flips (const Board *, const int) |
| unsigned long long | board_get_move (const Board *, const int, struct Move *) |
| Compute a move. | |
| bool | board_check_move (const Board *, struct Move *) |
| Check if a move is legal. | |
| void | board_swap_players (Board *) |
| Swap players. | |
| void | board_update (Board *, const struct Move *) |
| void | board_restore (Board *, const struct Move *) |
| void | board_pass (Board *) |
| Passing move. | |
| unsigned long long | board_next (const Board *, const int, Board *) |
| Compute a board resulting of a move played on a previous board. | |
| unsigned long long | board_pass_next (const Board *, const int, Board *) |
| Compute a board resulting of an opponent move played on a previous board. | |
| unsigned long long | board_get_hash_code (const Board *) |
| Compute a hash code. | |
| int | board_get_square_color (const Board *, const int) |
| Get square color. | |
| bool | board_is_occupied (const Board *, const int) |
| Check if a square is occupied. | |
| void | board_print (const Board *, const int, FILE *) |
| Print out the board. | |
| char * | board_to_string (const Board *, const int, char *) |
| convert the to a compact string. | |
| void | board_print_FEN (const Board *, const int, FILE *) |
| print using FEN description. | |
| char * | board_to_FEN (const Board *, const int, char *) |
| print to FEN description. | |
| bool | board_is_pass (const Board *) |
| Check if current player should pass. | |
| bool | board_is_game_over (const Board *) |
| Check if the game is over. | |
| int | board_count_empties (const Board *board) |
| Check if the game is over. | |
| unsigned long long | get_moves (const unsigned long long, const unsigned long long) |
| Get legal moves. | |
| bool | can_move (const unsigned long long, const unsigned long long) |
| Check if a player can move. | |
| unsigned long long | get_moves_6x6 (const unsigned long long, const unsigned long long) |
| Get legal moves on a 6x6 board. | |
| bool | can_move_6x6 (const unsigned long long, const unsigned long long) |
| Check if a player can move. | |
| int | get_mobility (const unsigned long long, const unsigned long long) |
| Count legal moves. | |
| int | get_weighted_mobility (const unsigned long long, const unsigned long long) |
| int | get_potential_mobility (const unsigned long long, const unsigned long long) |
| Get potential mobility. | |
| void | edge_stability_init (void) |
| Initialize the edge stability tables. | |
| int | get_stability (const unsigned long long, const unsigned long long) |
| Estimate the stability. | |
| int | get_edge_stability (const unsigned long long, const unsigned long long) |
| Estimate the stability of edges. | |
| int | get_corner_stability (const unsigned long long) |
| Estimate corner stability. |
Variables | |
| int(* | count_last_flip [BOARD_SIZE+1])(const unsigned long long) |
| unsigned long long(* | flip [BOARD_SIZE+2])(const unsigned long long, const unsigned long long) |
| void board_check | ( | const Board * | board | ) |
Check board consistency.
| board | the board to initialize |
Check if a move is legal.
| board | board |
| move | a Move. |
Compare two board.
| b1 | first board |
| b2 | second board |
| int board_count_empties | ( | const Board * | board | ) |
Check if the game is over.
| board | board. |
| int board_count_last_flips | ( | const Board * | , |
| const int | |||
| ) |
Compare two board for equality.
| b1 | first board |
| b2 | second board |
| int board_from_FEN | ( | Board * | board, |
| const char * | string | ||
| ) |
Set a board from a string description.
Read a Forsyth-Edwards Notation string and translate it into our internal Board structure.
| board | the board to set |
| string | string describing the board |
| unsigned long long board_get_hash_code | ( | const Board * | board | ) |
Compute a hash code.
| board | the board. |
Compute a move.
Compute how the board will be modified by a move without playing it.
| board | board |
| x | square on which to move. |
| move | a Move structure remembering the modification. |
| int board_get_square_color | ( | const Board * | board, |
| const int | x | ||
| ) |
Get square color.
returned value: 0 = player, 1 = opponent, 2 = empty;
| board | board. |
| x | square coordinate. |
| void board_init | ( | Board * | board | ) |
Set a board to the starting position.
| board | the board to initialize |
| bool board_is_game_over | ( | const Board * | board | ) |
Check if the game is over.
| board | board. |
| bool board_is_occupied | ( | const Board * | board, |
| const int | x | ||
| ) |
Check if a square is occupied.
| board | board. |
| x | square coordinate. |
| bool board_is_pass | ( | const Board * | board | ) |
Check if current player should pass.
| board | board. |
Compute a board resulting of a move played on a previous board.
| board | board to play the move on. |
| x | move to play. |
| next | resulting board. |
| void board_pass | ( | Board * | board | ) |
Passing move.
Modify a board by passing player's turn.
| board | board to update. |
Compute a board resulting of an opponent move played on a previous board.
Compute the board after passing and playing a move.
| board | board to play the move on. |
| x | opponent move to play. |
| next | resulting board. |
| void board_print | ( | const Board * | board, |
| const int | player, | ||
| FILE * | f | ||
| ) |
Print out the board.
Print an ASCII representation of the board to an output stream.
| board | board to print. |
| player | player's color. |
| f | output stream. |
| void board_print_FEN | ( | const Board * | board, |
| const int | player, | ||
| FILE * | f | ||
| ) |
print using FEN description.
Write the board according to the Forsyth-Edwards Notation.
| board | the board to write |
| player | turn's color. |
| f | output stream. |
| int board_set | ( | Board * | board, |
| const char * | string | ||
| ) |
Set a board from a string description.
Read a standardized string (See http://www.nada.kth.se/~gunnar/download2.html for details) and translate it into our internal Board structure.
| board | the board to set |
| string | string describing the board |
| void board_swap_players | ( | Board * | board | ) |
Swap players.
Swap players, i.e. change player's turn.
| board | board |
symetric board
| board | input board |
| s | symetry |
| sym | symetric output board |
| char* board_to_FEN | ( | const Board * | board, |
| const int | player, | ||
| char * | string | ||
| ) |
print to FEN description.
Write the board into a Forsyth-Edwards Notation string.
| board | the board to write |
| player | turn's color. |
| string | output string. |
| char* board_to_string | ( | const Board * | board, |
| const int | player, | ||
| char * | s | ||
| ) |
convert the to a compact string.
| board | board to convert. |
| player | player's color. |
| s | output string. |
unique board
Compute a board unique from all its possible symertries.
| board | input board |
| unique | output board |
| bool can_move | ( | const unsigned long long | P, |
| const unsigned long long | O | ||
| ) |
Check if a player can move.
| P | bitboard with player's discs. |
| O | bitboard with opponent's discs. |
| bool can_move_6x6 | ( | const unsigned long long | P, |
| const unsigned long long | O | ||
| ) |
Check if a player can move.
| P | bitboard with player's discs. |
| O | bitboard with opponent's discs. |
| void edge_stability_init | ( | void | ) |
Initialize the edge stability tables.
| int get_corner_stability | ( | const unsigned long long | P | ) |
Estimate corner stability.
Count the number of stable discs around the corner. Limiting the count to the corner keep the function fast but still get this information, particularly important at Othello. Corner stability will be used for move sorting.
| P | bitboard with player's discs. |
| int get_edge_stability | ( | const unsigned long long | P, |
| const unsigned long long | O | ||
| ) |
Estimate the stability of edges.
Count the number (in fact a lower estimate) of stable discs on the edges.
| P | bitboard with player's discs. |
| O | bitboard with opponent's discs. |
| int get_mobility | ( | const unsigned long long | P, |
| const unsigned long long | O | ||
| ) |
Count legal moves.
Compute mobility, ie the number of legal moves.
| P | bitboard with player's discs. |
| O | bitboard with opponent's discs. |
| unsigned long long get_moves | ( | const unsigned long long | P, |
| const unsigned long long | O | ||
| ) |
Get legal moves.
Compute a bitboard where each coordinate with a legal move is set to one.
| P | bitboard with player's discs. |
| O | bitboard with opponent's discs. |
| unsigned long long get_moves_6x6 | ( | const unsigned long long | P, |
| const unsigned long long | O | ||
| ) |
Get legal moves on a 6x6 board.
Compute a bitboard where each coordinate with a legal move is set to one.
| P | bitboard with player's discs. |
| O | bitboard with opponent's discs. |
| int get_potential_mobility | ( | const unsigned long long | P, |
| const unsigned long long | O | ||
| ) |
Get potential mobility.
Count the list of empty squares in contact of a player square.
| P | bitboard with player's discs. |
| O | bitboard with opponent's discs. |
| int get_stability | ( | const unsigned long long | P, |
| const unsigned long long | O | ||
| ) |
Estimate the stability.
Count the number (in fact a lower estimate) of stable discs.
| P | bitboard with player's discs. |
| O | bitboard with opponent's discs. |
| int get_weighted_mobility | ( | const unsigned long | long, |
| const unsigned long | long | ||
| ) |
| int(* count_last_flip[BOARD_SIZE + 1])(const unsigned long long) |
Array of functions to count flipped discs of the last move
| unsigned long long(* flip[BOARD_SIZE + 2])(const unsigned long long, const unsigned long long) |
Array of functions to compute flipped discs


This is a demo of the jQuery Backgrounder plugin. This plugin allows you to fill the background of a page with an image–all while maintaining the aspect ratio and gracefully handling window resizing.
This little plugin is licensed under the MIT license. See the MIT-LICENSE.txt file for details. The image used in this example (birthday.jpg) is copyrighted (by me) and may not be used by you. Why would you want a picture of my kid, anyway?


Bean Configuration
Objects are the key element in Java programming and the Spring Framework handles them in a very special way. Unlike a regular Java Object that is created with the new operator and then used, a Spring Object must be registered with the ApplicationContext first. When an Object is registered with the ApplicationContext it is referred to as a Bean (or “Managed Bean” or “Component”). When Spring manages an Object as a Bean it is creating a Proxy around your object and can do very interesting things with it.
How to configure a Bean
Spring Framework: Bean overview
Beans can be configured in three primary ways: XML, Java, or Annotations. We will focus on Annotation based configuration.
Read: spring.io: Annotation-based container configuration
Spring provides a few different annotations to drive the creation of beans. Ultimately Spring will use @Bean or @Component to create a Bean. Here are the most common ways to define Beans.
| Annotation | Location | Description |
|---|---|---|
| @Configuration | class | Indicates that this class defines @Bean’s to be |
| @Bean | method | Creates a Bean from the return value of the method |
| @Component | class | Instruct Spring to create a Bean out of the class |
| @Service | class | Is a @Component but Stereotyped as a Service |
| @Repository | class | Is a @Component but Stereotyped as a Repository |
| @Controller | class | Is a @Component but Stereotyped as a Controller |
| @RestController | class | Same as @Controller but meant REST end-points |
Read: Advantages of using spring stereotypes (stackoverflow.com)
Read: Difference between @Component, @Repository, @Service (stackoverflow.com)
Read: Difference between @Controller and @RestController (stackoverflow.com)
Read: @RestController vs @Controller (genuitec.com)
// Declare a Singleton Bean - one instance for the entire application
@Component
class UserTransformer { }
// Declare a Request Scope Bean - one instance per Web Request
@Component
@Scope("request", proxyMode = ScopedProxyMode.INTERFACES)
class UserWebRequestContext : UserRequestContext { }
// Declare a class that defines definition of Beans
@Configuration
class MyConfig {
// Declare a Session Scope Bean - one instance per Web Session
@Bean
@Scope("session")
fun userSessionContext() = UserSessionContext()
}
// Declares a Bean with the Service stereotype
@Service
class UserService { }
// Declares a Bean with the Repository stereotype
@Repository
class UserRepository { }
@RestController
class HelloController {
@RequestMapping("/hello")
fun hello() = "Hello, World!"
}
Bean Lifecycle
Spring Framework: Lifecycle callbacks
As Spring Beans are created they follow a Lifecycle where you can hook-in callback listeners to do interesting things when the Beans are first created and destroyed.
Read: thejavaprogrammer.com: Spring Bean Life Cycle
A common use-case is to validate that certain properties are set on your Bean after it is created.
@Component
class ConnectionManager(
@Value("\${connection.url}") var url: String = "") {
@PostConstruct
fun init(){
Assert.isTrue(!url.isNullOrBlank(), "url must be set")
Assert.isTrue(url.startsWith("http://"), "http is the only support protocol")
}
}


This script partially implements the Firebug Console API for server-side JavaScript using the Wildfire/FirePHP protocol. It currently runs on Aptana Jaxer and “Classic” ASP, and AppJet, though support for other server-side JavaScript platforms is planned for future releases.
or
or
The Firebug Console API lets you log multiple objects in one statement and use them with the string substition (i.e. console.log("My object: %o", obj)
). This implementation only lets you log a single object at a time. If the first argument to one of the functions is an object (that is, anything that responds with "object"
to the typeof
operator) it will be shown using FirePHP's Variable Viewer. If the list of arguments starts with a string or number, it will be logged as a text message.
These methods of the Firebug Console API are not currently implemented:
These features of FirePHP are not implemented:
Some of these will be implemented in future releases, others will not.
In addition, you can enable and disable messages from appearing with console.enable()
and console.disable()
respectively.
<script src="prototype.js" language="JavaScript" runat="server"></script>
<script src="console.js" language="JavaScript" runat="server"></script>
<script language="JavaScript" runat="server">
console.log("Hello world!");
console.info("And", "so", "on");
</script>
The console library is hosted at http://lib-console.appjet.net/. You can use it in your own AppJet applications by calling import('lib-console');
.
An example page is hosted at http://console-test.appjet.net/.
<script src="console.js" runat="server"></script>
<script runat="server">
console.log("Hello world!");
console.info("And", "so", "on");
</script>
Download the Jaxer extension and place it into your local_jaxer/extensions
directory. Once Jaxer is restarted, the Jaxer.console
object becomes available to all scripts. Usage is the same as above, except the script does not need to be included and Jaxer.console
is used instead of console
.
Echoing to the Jaxer log can be enabled and disabled by setting Jaxer.console.echo
to true and false respectively.
These Boolean options can also be set in your local_jaxer/conf/config.js
:
CONSOLE_DISABLED
CONSOLE_ECHO_TO_LOG
This script would not have been possible without the help of these people:
sprintf
implementation


Tel Aviv Marathon
Tel Aviv ISR
Website: www.tlvmarathon.co.il/Default.aspx?l=en
Race Winners
(25 runnings)
24
Apr
2009
2:38:06 3:07:41 1996-2008
---
---
12 Mar 1995
---
---
15 Mar
1994
2:19:37
2:40:44
15 Mar
1993
2:21:37
3:10:57
16 Mar
1992
2:14:56
2:47:47
15 Apr
1991
2:19:50
2:58:12
15 Mar
1990
2:30:32
3:20:12
16 Mar
1989
2:13:23
2:53:18
06 Mar
1988
2:22:21
2:44:03
19 Mar
1987
2:23:27
3:26:28
03 Mar
1986
2:30:05
2:49:32
07 Mar
1985
2:23:06
3:01:27
19 Mar
1984
2:27:05
---
28 Mar
1983
---
---
09 Mar
1982
2:26:56
4:31:15 19 Mar
1981
2:35:47
---
22 Feb
2019
2:14:31
Samuel Demie (ETH)
2:58:18
Margaret Wangui Njuguna-4
23 Feb
2018
2:19:54
Ernest Kiprugut Kebenei (KEN)
2:40:26
Margaret Wangui Njuguna-3
24 Feb
2017
2:12:12
Belete Mekonen Gezu (ETH)
2:35:51
Margaret Wangui Njuguna-2
26 Feb
2016
2:10:51
William Yegon Kiprono-2
2:40:17
Korlima Chemtai (KEN)
27 Feb
2015
2:10:30
William Yegon Kiprono (KEN)
2:51:24
Azeb Weldehawariat (ETH)
28 Feb
2014
2:14:40
Ezekiel Koech (KEN)
2:44:25
Margaret Wangui Njuguna (KEN)
15 Mar
2013
---
cancelled due to excessive heat
---
cancelled
due to excessive heat
30 Mar
2012
2:15:15
Samuel Tarus Too (KEN)
2:38:27
Abeba Tola Eda (ETH)
08 Apr
2011
2:19:02
Josephat Rono Kipkemboi (KEN)
2:40:35
Worknesh Shasha Oda (ETH)
14
May 2010
2:49:34
Avraham Hailemelkot (ISR)
3:13:30
Orna Blau-2
Daniel Kipchumba (KEN)
Orna Blau (ISR)
not held
not held
n/a
n/a
Gezahenge Birra (ETH)
Czeslawa Mentlewicz-2
Aiduna Aitnafa (ETH)
Cinzia Allasia (ITA)
Tumo Turbo (ETH)
Alina Magamedirova (RUS)
Tesfaye Segne (ETH)
Loredana Ricci-2
Hannu Korkalainen (FIN)
Loredana Ricci (ITA)
Osmiro daSilva (BRA)
Czeslawa Mentlewicz (POL)
Jean-Claue Louison (FRA)
Adriana Barbu (ROM)
Michel Constant (FRA)
Erika
Kruger (GER)
Michel Schwind (FRA)
Elena Murgoci (ROM)
Jean-Michel Charbonnel-2
Lise Kristiansen (DEN)
Gheorghe Sandu (ROM)
n/a
n/a
n/a
Yves Seigneuric (FRA) + Claude Minni (FRA)
Navah Ezra (ISR)
Jean-Michel Charbonnel (FRA)
n/a
Notes: The course used for the 1989 race is generally considered to have been short.
Most Wins (1981/1997)
Men
2
Jean-Michel Charbonnel (FRA)
1981,1985
William Yegon Kiprono (KEN)
2015-16
Women
4
Margaret Wangui Njugna (KEN)
2014,2017-19
Prize Money
(ADR qualified runners)
Year Men Woman Total 2017 $7,500 $6,250 $13,750 2016 7,500 7,500 15,000 2015 18,750 7,500 26,250 2014 8,600 8,600 17,200 2012 11,200 11,200 22,400 2011 8,710 8,710 17,420 .... 2009 1,000 1,750 2,750 Sums $63,260 $51,510 $114,770
Race Time Bias
Year Men Women 1989 -3.8 n/c
Note: Times are generally slow at this race. The course used for 1989 is considered
suspect.
Competitive Level
Insufficient data to compute the competitive level.
Quality Performances through 2019
Men <2:11 2 <2:12 2 <2:13 6 <2:14 7 <2:15 13 <2:16 16 <2:17 17 <2:18 20 <2:19 21 <2:20 28 Women <2:38 1 <2:40 2 <2:42 9 <2:44 10 <2:46 14 <2:48 16 <2:50 20
Last Updated on 24 Apr 2019 mp
Contributors: Franco Civai (35), Yves Seigneuric (2), David Eiger (40)


Reviews
User Name: Xiaoran Lin
this dish is amazing, I really wanna try it again.
User Name: Xiaoran Lin
this dish is amazing, I really wanna try it again.
User Name: Xiaoran Lin
this dish is amazing, I really wanna try it again.
User Name: Xiaoran Lin
this dish is amazing, I really wanna try it again.
User Name: Xiaoran Lin
this dish is amazing, I really wanna try it again.
User Name: Xiaoran Lin
this dish is amazing, I really wanna try it again.


|
A collection of rasters with a single defined spatial reference and discretization |
|
API for Mosaic- open a mosaic of rasters |
|
Open a mosaic of rasters as a dask array to enable numpy-like syntax and methods. |
daskaic.
Mosaic
(rasters, **kwargs)¶A collection of rasters with a single defined spatial reference and discretization
Creating a mosaic requires an iterable of GDAL-supported raster data sources. The spatial definition of the mosaic will be inferred if no kwargs are provided.
path (list) – An iterable with paths to raster data
Bounding extent of the mosaic in the target spatial reference. Order: (top, bottom, left, right)
Defaults to 'union'
, which is the bounds of all input rasters
Chunks used for mapped data access by dask. Specify explictly using a dict in the form
{'bands': <number of bands>, 'x': <chunks in the x-direction>, 'y': <chunks in the y-direction>}
Otherwise, specify a block size multiplier for the raster with the smallest block size. Defaults to 8
.
Method to align, or reduce raster bands during data access. This may be a dict in the form:
{1: [<raster 1 band>, <raster 2 band>], 2: [<raster 1 band>, <raster 2 band>]}
where the keys are the output bands (z-dimensions) when data are read, and the values are lists with exactly
the same length as the rasters in the mosaic with band numbers mapped in order.
This argument may also be the value 'number'
, which means all band numbers from all rasters will
align by index.
The numpy-like data type of output data when read. See numpy.dtype
. Defaults to the highest
precision of all input rasters, prioritizing floating point numbers over integers.
An iterable of GDAL resample algorithms that is exactly the same length as the number of input rasters.
See Mosaic.gdal_resample_methods
for a list.
Defaults to 'near'
for integer rasters and 'bilinear'
for floating point rasters.
The method used to merge data from different rasters when their band alignment intersects. Use one of
the methods specified in Mosaic.merge_methods
Defaults to 'last'
, which uses the value of the last raster in the input list
Spatial reference to use to align all rasters in the mosaic. Use a format compatible with
pyproj.CRS.from_user_input
, or one of 'first'
or 'last'
, where either the spatial
reference from the first or last raster in the list is used.
Defaults to 'first'
Input cell size in the x-direction. Use one of 'smallest'
, 'largest'
, 'average'
or the
exact cell size. Defaults to 'smallest'
, which is the smallest of all rasters (transformed to
distance units of the mosaic coordinate system).
Input cell size in the y-direction. Use one of 'smallest'
, 'largest'
, 'average'
or the
exact cell size. Defaults to 'smallest'
, which is the smallest of all rasters (transformed to
distance units of the mosaic coordinate system).
Value of null or no data in output arrays when collecting data. Defaults to an inferred maximum or minimum possible value using the data type of the mosaic.
dask
¶Return the dask array of the mosaic
save
(raster_path)¶Store the computed mosaic into a raster data target
raster_path (str) – Input path to a raster source.
slice
(extent)¶Collect a dask array of an extent within the mosaic.
Note
If the extent does not line up with the cell edges exactly, the extent of resulting data are snapped to a greater window matching the mosaic cell size.
extent (tuple) – Extent coordinates in the form (top, bottom, left, right)
Dask array of sliced data from the mosaic
store
(dask, raster_path)¶Store a computed dask array into a new raster path. The format of the output raster will be interpreted by GDAL, although additional parameters will be implicitly added for a GeoTiff output to make it cloud optimized.
Note
The dask should have been created using the same Mosaic instance that is used to store it. Also, if the dask graph includes subsequent reductions or slicing, the dask may not fit the mosaic spatial definition.
dask (dask.Array) – Input dask array
raster_path (str) – Input path to a raster source.
daskaic.
open_mosaic
(rasters, **kwargs)¶API for Mosaic- open a mosaic of rasters
from daskaic import open_mosaic
rasters = ['raster_1.tif', 'raster_2.tif', 'raster_3.tif']
mosaic = open_mosaic(rasters)
Alternatively, add some specs to the mosaic, using parameters specified in Mosaic
mosaic = open_mosaic(rasters, sr=4326, merge_method='average', chunks={'bands': 1, 'x': 1024, 'y': 1024})
daskaic.
open_dask
(rasters, **kwargs)¶Open a mosaic of rasters as a dask array to enable numpy-like syntax and methods. A masked array is returned, which will avoid use of no data values when supported operations are used.
Note
Always check which masked operations are supported to avoid erroneous results that include no data values
from daskaic import open_dask
import dask.array as da
rasters = ['rasters_1.tif', 'raster_2.tif', 'raster_3.tif']
a = open_dask(rasters)
b = da.cos(a * 2)


if sys.argv[-1] == "publish":
os.system("python setup.py sdist upload")
sys.exit()
class PyTest(TestCommand):
def finalize_options(self):
readme = open("README.rst").read()
history = open("HISTORY.rst").read().replace(".. :changelog:", "")
requires = [] //during runtime
tests_require=["pytest>=2.3"] //for testing


Full
This is full
Halve
This is a Halve
About fluidLESS
fluidLESS is currently capable of spliting up its framework into 3 sections within the body consisting of a header, content and footer. Within each of these (primarly focusing on the content) it is possible for one to place multiple dynamic sections. Some current sections. Selections currently available for use include:
- Full width
- Split
- Third
- Quarter


21 Intent i = new Intent(context, DReceiver.class);
22 i.putExtra("time", System.currentTimeMillis() + 3000);
23 mPendingIntent = PendingIntent.getService(context, 0x123, i,
24PendingIntent.FLAG_UPDATE_CURRENT); 25 }
26 if (null == am)
Note: This issue has an associated quickfix operation in Android Studio/IntelliJ & Eclipse/ADT
Priority: 6 / 10
Category: Correctness
Severity: Warning
Explanation: Using inlined constants on older versions.
This check scans through all the Android API field references in the application and flags certain constants, such as static final integers and Strings, which were introduced in later versions. These will actually be copied into the class files rather than being referenced, which means that the value is available even when running on older devices. In some cases that's fine, and in other cases it can result in a runtime crash or incorrect behavior. It depends on the context, so consider the code carefully and device whether it's safe and can be suppressed or whether the code needs tbe guarded.
If you really want to use this API and don't need to support older devices just set the minSdkVersion in your build.gradle or AndroidManifest.xml files.
If your code is deliberately accessing newer APIs, and you have ensured (e.g. with conditional execution) that this code will only ever be called on a supported platform, then you can annotate your class or method with the @TargetApi annotation specifying the local minimum SDK to apply, such as @TargetApi(11), such that this check considers 11 rather than your manifest file's minimum SDK as the required API level.
17 18 @Override
19 public int onStartCommand(Intent intent, int flags, int startId) {
20 Notification.Builder builder = new Notification.Builder(this); 21 builder.setSmallIcon(R.mipmap.ic_launcher);
22 startForeground(250, builder.build());
18 @Override
19 public int onStartCommand(Intent intent, int flags, int startId) {
20 Notification.Builder builder = new Notification.Builder(this);
21 builder.setSmallIcon(R.mipmap.ic_launcher); 22 startForeground(250, builder.build());
23 new Thread(new Runnable() {
19 public int onStartCommand(Intent intent, int flags, int startId) {
20 Notification.Builder builder = new Notification.Builder(this);
21 builder.setSmallIcon(R.mipmap.ic_launcher);
22 startForeground(250, builder.build()); 23 new Thread(new Runnable() {
24 @Override
19 public int onStartCommand(Intent intent, int flags, int startId) {
20 Notification.Builder builder = new Notification.Builder(this);
21 builder.setSmallIcon(R.mipmap.ic_launcher);
22startForeground(250, builder.build()); 23 new Thread(new Runnable() {
24 @Override
26 if (null == am)
27 am = (AlarmManager) context.getSystemService(Context.ALARM_SERVICE);
28 long time = intent.getLongExtra("time", System.currentTimeMillis());
29 am.setExact(AlarmManager.ELAPSED_REALTIME_WAKEUP, time, mPendingIntent); 30 }
31 }
Note: This issue has an associated quickfix operation in Android Studio/IntelliJ & Eclipse/ADT
Priority: 6 / 10
Category: Correctness
Severity: Error
Explanation: Calling new methods on older versions.
This check scans through all the Android API calls in the application and warns about any calls that are not available on all versions targeted by this application (according to its minimum SDK attribute in the manifest).
If you really want to use this API and don't need to support older devices just set the minSdkVersion in your build.gradle or AndroidManifest.xml files.
If your code is deliberately accessing newer APIs, and you have ensured (e.g. with conditional execution) that this code will only ever be called on a supported platform, then you can annotate your class or method with the @TargetApi annotation specifying the local minimum SDK to apply, such as @TargetApi(11), such that this check considers 11 rather than your manifest file's minimum SDK as the required API level.
If you are deliberately setting android: attributes in style definitions, make sure you place this in a values-vNN folder in order to avoid running into runtime conflicts on certain devices where manufacturers have added custom attributes whose ids conflict with the new ones on later platforms.
Similarly, you can use tools:targetApi="11" in an XML file to indicate that the element will only be inflated in an adequate context.
../../src/main/AndroidManifest.xml:4: On SDK version 23 and up, your app data will be automatically backed up and restored on app install. Consider adding the attribute android:fullBackupContent to specify an @xml resource which configures which files to backup. More info: https://developer.android.com/preview/backup/index.html
By default, this flag is set to true. When this flag is set to true, application data can be backed up and restored by the user using adb backup and adb restore.
This may have security consequences for an application. adb backup allows users who have enabled USB debugging to copy application data off of the device. Once backed up, all application data can be read by the user. adb restore allows creation of application data from a source specified by the user. Following a restore, applications should not assume that the data, file permissions, and directory permissions were created by the application itself.
Setting allowBackup="false" opts an application out of both backup and restore.
To fix this warning, decide whether your application should support backup, and explicitly set android:allowBackup=(true|false)".
If not set to false, and if targeting API 23 or later, lint will also warn that you should set android:fullBackupContent to configure auto backup.
../../src/main/AndroidManifest.xml:4: App is not indexable by Google Search; consider adding at least one Activity with an ACTION-VIEW intent-filler. See issue explanation for more details.
Note: This issue has an associated quickfix operation in Android Studio/IntelliJ & Eclipse/ADT
Priority: 3 / 10
Category: Accessibility
Severity: Warning
Explanation: Image without contentDescription
Non-textual widgets like ImageViews and ImageButtons should use the contentDescription attribute to specify a textual description of the widget such that screen readers and other accessibility tools can adequately describe the user interface.
Note that elements in application screens that are purely decorative and do not provide any content or enable a user action should not have accessibility content descriptions. In this case, just suppress the lint warning with a tools:ignore="ContentDescription" attribute.
Note: This issue has an associated quickfix operation in Eclipse/ADT
Priority: 5 / 10
Category: Internationalization
Severity: Warning
Explanation: Hardcoded text.
Hardcoding text attributes directly in layout files is bad for several reasons:
* When creating configuration variations (for example for landscape or portrait)you have to repeat the actual text (and keep it up to date when making changes)
* The application cannot be translated to other languages by just adding new translations for existing string resources.
In Android Studio and Eclipse there are quickfixes to automatically extract this hardcoded string into a resource lookup.
The following issues were not run by lint, either because the check is not enabled by default, or because it was disabled with a command line flag or via one or more lint.xml configuration files in the project directories.
"Other platforms use an explicit back button with label to allow the user to navigate up the application's hierarchy. Instead, Android uses the main action bar's app icon for hierarchical navigation and the navigation bar's back button for temporal navigation."
This check is not very sophisticated (it just looks for buttons with the label "Back"), so it is disabled by default to not trigger on common scenarios like pairs of Back/Next buttons to paginate through screens.
An "easter egg" is code deliberately hidden in the code, both from potential users and even from other developers. This lint check looks for code which looks like it may be hidden from sight.
Accessing a field within the class that defines a getter for that field is at least 3 times faster than calling the getter. For simple getters that do nothing other than return the field, you might want to just reference the local field directly instead.
NOTE: As of Android 2.3 (Gingerbread), this optimization is performed automatically by Dalvik, so there is no need to change your code; this is only relevant if you are targeting older versions of Android.
There are predefined sizes (for each density) for launcher icons. You should follow these conventions to make sure your icons fit in with the overall look of the platform.
The BuildConfig class (available in Tools 17) provides a constant, "DEBUG", which indicates whether the code is being built in release mode or in debug mode. In release mode, you typically want to strip out all the logging calls. Since the compiler will automatically remove all code which is inside a "if (false)" check, surrounding your logging calls with a check for BuildConfig.DEBUG is a good idea.
If you really intend for the logging to be present in release mode, you can suppress this warning with a @SuppressLint annotation for the intentional logging calls.
Note: This issue has an associated quickfix operation in Eclipse/ADT
Disabled By: Default
Priority: 2 / 10
Category: Correctness
Severity: Error
Explanation: Mangled file line endings.
On Windows, line endings are typically recorded as carriage return plus newline: \r\n.
This detector looks for invalid line endings with repeated carriage return characters (without newlines). Previous versions of the ADT plugin could accidentally introduce these into the file, and when editing the file, the editor could produce confusing visual artifacts.
Margin values should be positive. Negative values are generally a sign that you are making assumptions about views surrounding the current one, or may be tempted to turn off child clipping to allow a view to escape its parent. Turning off child clipping to do this not only leads to poor graphical performance, it also results in wrong touch event handling since touch events are based strictly on a chain of parent-rect hit tests. Finally, making assumptions about the size of strings can lead to localization problems.
Note: This issue has an associated quickfix operation in Android Studio/IntelliJ
Disabled By: Default
Priority: 4 / 10
Category: Correctness
Severity: Warning
Explanation: Newer Library Versions Available.
This detector checks with a central repository to see if there are newer versions available for the dependencies used by this project. This is similar to the GradleDependency check, which checks for newer versions available in the Android SDK tools and libraries, but this works with any MavenCentral dependency, and connects to the library every time, which makes it more flexible but also much slower.
More info:
To suppress this error, use the issue id "NewerVersionAvailable" as explained in the Suppressing Warnings and Errors section.
SelectableText
Note: This issue has an associated quickfix operation in Android Studio/IntelliJ
Disabled By: Default
Priority: 7 / 10
Category: Usability
Severity: Warning
Explanation: Dynamic text should probably be selectable.
If a <TextView> is used to display data, the user might want to copy that data and paste it elsewhere. To allow this, the <TextView> should specify android:textIsSelectable="true".
This lint check looks for TextViews which are likely to be displaying data: views whose text is set dynamically. This value will be ignored on platforms older than API 11, so it is okay to set it regardless of your minSdkVersion.
Note: This issue has an associated quickfix operation in Android Studio/IntelliJ
Disabled By: Default
Priority: 10 / 10
Category: Correctness
Severity: Warning
Explanation: Code contains STOPSHIP marker.
Using the comment // STOPSHIP can be used to flag code that is incomplete but checked in. This comment marker can be used to indicate that the code should not be shipped until the issue is addressed, and lint will look for these.
Note: This issue has an associated quickfix operation in Android Studio/IntelliJ & Eclipse/ADT
Disabled By: Default
Priority: 5 / 10
Category: Usability:Typography
Severity: Warning
Explanation: Straight quotes can be replaced with curvy quotes.
Straight single quotes and double quotes, when used as a pair, can be replaced by "curvy quotes" (or directional quotes). This can make the text more readable.
Note that you should never use grave accents and apostrophes to quote, `like this'.
(Also note that you should not use curvy quotes for code fragments.)
This resource id definition appears not to be needed since it is not referenced from anywhere. Having id definitions, even if unused, is not necessarily a bad idea since they make working on layouts and menus easier, so there is not a strong reason to delete these.
Lint errors can be suppressed in a variety of ways:
1. With a @SuppressLint annotation in the Java code
2. With a tools:ignore attribute in the XML file
3. With ignore flags specified in the build.gradle file, as explained below
4. With a lint.xml configuration file in the project
5. With a lint.xml configuration file passed to lint via the --config flag
6. With the --ignore flag passed to lint.
To suppress a lint warning with an annotation, add a @SuppressLint("id") annotation on the class, method or variable declaration closest to the warning instance you want to disable. The id can be one or more issue id's, such as "UnusedResources" or {"UnusedResources","UnusedIds"}, or it can be "all" to suppress all lint warnings in the given scope.
To suppress a lint warning in an XML file, add a tools:ignore="id" attribute on the element containing the error, or one of its surrounding elements. You also need to define the namespace for the tools prefix on the root element in your document, next to the xmlns:android declaration: xmlns:tools="http://schemas.android.com/tools"
To suppress a lint warning in a build.gradle file, add a section like this:
Here we specify a comma separated list of issue id's after the disable command. You can also use warning or error instead of disable to change the severity of issues.
To suppress lint warnings with a configuration XML file, create a file named lint.xml and place it at the root directory of the project in which it applies.
The format of the lint.xml file is something like the following:
<?xml version="1.0" encoding="UTF-8"?>
<lint>
<!-- Disable this given check in this project -->
<issue id="IconMissingDensityFolder" severity="ignore" />
<!-- Ignore the ObsoleteLayoutParam issue in the given files -->
<issue id="ObsoleteLayoutParam">
<ignore path="res/layout/activation.xml" />
<ignore path="res/layout-xlarge/activation.xml" />
</issue>
<!-- Ignore the UselessLeaf issue in the given file -->
<issue id="UselessLeaf">
<ignore path="res/layout/main.xml" />
</issue>
<!-- Change the severity of hardcoded strings to "error" -->
<issue id="HardcodedText" severity="error" />
</lint>
To suppress lint checks from the command line, pass the --ignore flag with a comma separated list of ids to be suppressed, such as: $ lint --ignore UnusedResources,UselessLeaf /my/project/path


13 Festive Horror Movies You Need to Watch This Holiday Season
by Maggie PanosExcited about the impending holidays, but not exactly raring to dig into those sappy Christmas movies? We have just the ticket! We've pulled together 13 holiday-themed horror movies that will probably make you terrified of Santa Claus — but in a fun way. A couple aren't terribly scary in case you're a bit of a wimp, but all of them will give you a dose of holiday cheer. Take a look and check out all the best horror movies on Netflix! (OK, in case you do want a bit of cheese with your wine, here are the best romances on Netflix, as well.)
1 Krampus
Adam Scott, Toni Collette, and Allison Tolman (Fargo) star in Krampus, the tale of a young boy who accidentally summons a demon on Christmas. It's funny, but if you know about the real legend, it'll also make you jump.
2 Santa's Slay
Get it? Like Santa's sleigh! The 2005 black comedy starts off when a murderous Santa ruins Christmas dinner by killing an entire family, including James Caan as the ill-fated father. Also involved: "hell-deer," the Canadian art of curling, and death by Zamboni.
3 Silent Night
How did you miss this 2012 gem featuring Jaime King, Malcolm McDowell, and Donal Logue? A murderous Santa is on the loose, but since it's Christmas Eve, tons of Santas are roaming the streets! Who's the real killer? You better hope they find out before more bodies drop.
4 Jack Frost
There's no way you don't want to see a movie about a serial killer who gets in a freak accident that results in his body fusing with snow. He becomes a killer snowman! He also rapes a girl, which makes this 1997 flick the most twisted movie on the list. In case you're wondering, there's a sequel: Jack Frost 2: Revenge of the Mutant Killer Snowman.
5 Edward Scissorhands
Edward Scissorhands is great year-round, but it's particularly relevant around Halloween and Christmas. A chunk of the movie takes place during the holiday season, when Edward (Johnny Depp) creates a giant ice sculpture of Kim (Winona Ryder). And, yes, this movie is scary, OK?
6 The Nightmare Before Christmas
Tim Burton's holiday classic, The Nightmare Before Christmas, also isn't a traditional horror movie, but it does have lots of scary elements — like basically everything in Halloween Town.
7 Silent Night, Deadly Night
This 1984 slasher film has spawned four sequels, and it's the inspiration for 2012's Silent Night, mentioned above. The movie features a young boy whose parents are murdered by a man in a Santa suit. The trauma changes him forever, and when he grows up, he goes on a killing spree of his own.
8 A Christmas Horror Story
What do you mean you don't even remember seeing commercials for this 2015 horror movie? Well, it's on demand now, so settle in for a night of William Shatner as a DJ host whose broadcast strings together four different nightmarish stories. Krampus makes an appearance in this one, too!
9 Silent Night, Bloody Night
If you inherit a house that was once an insane asylum, get rid of it as fast as possible. That's the message from 1974's Silent Night, Bloody Night. The movie follows an ax murderer who goes on a spree on Christmas Eve.
10 Black Christmas (1974)
You're in for a good time with 1974's dark classic Black Christmas. It's the story of a group of sorority girls who are picked off one by one by a murderer in the days leading up to Christmas, and it's often cited as an inspiration for Halloween.
11 Black Christmas (2006)
Katie Cassidy, Michelle Trachtenberg, and Oliver Hudson star in the equally terrifying (if not slightly campier) remake.
12 Christmas Evil
This 1980 slasher movie has earned a cult following in the decades since its release. When young Harry (Brandon Maggart) sees Santa touching his mom on Christmas Eve, he's scarred for life. (Don't worry, it's just his dad dressed up as Santa . . . but Harry doesn't know that.) He grows up, has a mental breakdown, and convinces himself that he's the real Santa — and the people on his "naughty" list need to be punished.
13 Gremlins
Gremlins (1984) may not be your typical holiday horror story, but Billy (Zach Galligan) does receive his new pet as a Christmas present. It's only later, when Billy stops following the three rules that Gizmo came with, that things start to get scary.


Online Judge
问题描述 :
Ignatius is building an Online Judge, now he has worked out all the problems except the Judge System. The system has to read data from correct output file and user’s result file, then the system compare the two files. If the two files are absolutly same, then the Judge System return "Accepted", else if the only differences between the two files are spaces(‘ ‘), tabs(‘\t’), or enters(‘\n’), the Judge System should return "Presentation Error", else the system will return "Wrong Answer".
Given the data of correct output file and the data of user’s result file, your task is to determine which result the Judge System will return.
输入:
The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case has two parts, the data of correct output file and the data of the user’s result file. Both of them are starts with a single line contains a string "START" and end with a single line contains a string "END", these two strings are not the data. In other words, the data is between the two strings. The data will at most 5000 characters.
Each test case has two parts, the data of correct output file and the data of the user’s result file. Both of them are starts with a single line contains a string "START" and end with a single line contains a string "END", these two strings are not the data. In other words, the data is between the two strings. The data will at most 5000 characters.
输出:
For each test cases, you should output the the result Judge System should return.

解题思路：
只需要判断两个文件中不同的地方是不是都是空格或者换行或者\t就好了。其他的是一些细节问题，比如数据的输入，换行的处理。
主要练习下字符串的处理~O(∩_∩)O~。
#include <stdio.h> #include <string.h> char str[5010]; void Ready() { while(gets(str),strcmp(str,"START")); } void Deal(char* c) { while(gets(str),strcmp(str,"END")) { if(str[0]=='\0') strcat(c," "); else strcat(c,str); } } int main() { int z,i,j,Li,Lj; bool PE,WA; char ac[5010],my[5010]; scanf("%d",&z); while(z--) { PE = WA = false; ac[0] = my[0] = '\0'; Ready(); Deal(ac); Ready(); Deal(my); i = j = 0; Li = strlen(ac); Lj = strlen(my); while(i<Li || j<Lj) { if(ac[i] == my[j]) { i ++;j ++; continue; } PE = true; if(ac[i]==' ' || ac[i]=='\t') { i ++; continue; } if(my[j]==' ' || my[j]=='\t') { j ++; continue; } WA = true; break; } puts(WA?"Wrong Answer":(PE?"Presentation Error":"Accepted")); } return 0; }
(adsbygoogle = window.adsbygoogle || []).push({});
这个是代码高亮功能，那就再换一个颜色
感谢~速度真快，我很喜欢这个网站，从基础看起。
很有意思，可惜我很菜啊
不同的编译器，printf(),执行的顺序不同，所以结果也就不同，建议不要那么写
递归实现的代码部分
14句和18句的 wt[n - 1]是不是应该改为 wt[ n ] ?
大致看了下，算法的时间复杂度没有很本性的提升，算不上高效。
很好的思路，可以借鉴
无需用转移方程也可以解决，哈哈
目前为止见过的最易懂的一个，多谢分享
给力！
nice!!!
不同的编译器，printf(),执行的顺序不同，所以结果也就不同，建议不要那么写
递归还真是一门学问，学习了
正确


Bayesian Latent Class Analysis using several different methods.
| Version: | 1.7 |
| Depends: | e1071, coda |
| Imports: | fields, nlme, MCMCpack |
| Published: | 2015-04-10 |
| Author: | Arthur White [aut, cre] (Previous email address: arthur.white@ucdconnect.ie), Thomas Brendan Murphy [aut, ths] |
| Maintainer: | Arthur White <arwhite at tcd.ie> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| Citation: | BayesLCA citation info |
| In views: | Cluster, Psychometrics |
| CRAN checks: | BayesLCA results |
| Reference manual: | BayesLCA.pdf |
| Package source: | BayesLCA_1.7.tar.gz |
| Windows binaries: | r-devel: BayesLCA_1.7.zip, r-release: BayesLCA_1.7.zip, r-oldrel: BayesLCA_1.7.zip |
| OS X binaries: | r-release: BayesLCA_1.7.tgz, r-oldrel: BayesLCA_1.7.tgz |
| Old sources: | BayesLCA archive |
Please use the canonical form https://CRAN.R-project.org/package=BayesLCA to link to this page.


Thresholds
Thresholds can be used to filter out comments based on moderation results. Results consist of count (total number of votes cast), up (number of positive votes), down (number of negative votes) and sum (up - down, possibly negative when down > up). Two kinds of filters can be used.
Simple thresholds
A single numerical value filters out all comments with sum below the specified value.
Advanced thresholds
Arbitrary expressions can specify what comments to show, using the variables c (count), u (up), d (down) and s (sum), like
- s >= 0 show only comments with sum greater or equal 0
- (u * 100) / c >= 75 show only comments with at least 75% up votes
- c < 5 | (u * 100) / c >= 75 same as above, but show comments with less than 5 votes, too
- c = 0 show only unmoderated comments
- c > 10 & s < 3 & s > -3 show comments with many votes, but sum near zero (highly polarizing comments)
Arithmetic operators are +, -, * and / (division by zero results in value zero), calculation is floating point.
Comparison operators are = (equal), != (unequal), < (less), <= (less or equal), > (greater) and >= (greater or equal).
Boolean operators are | (or), & (and).
Parentheses work around arithmetic and comparitive parts, not boolean parts (yet).


Home
Session 7
Homepage
435A2 Session X
This document is a scripting exercise! Click the buttons to run the scripts.
Question 1
Run Script ‣
Output:


Hello World! The blackjack game is up and can be found on the projects page or my github page. Functionality so far is relatively simple with the user inputting their name. Afterwards, the cards will be dealt and the user will be asked whether they would like to hit or to hold. The user is allowed to hit as long as their total is less than or equal to 21. After the player’s turn, the computer will hit as long as their total is less than 17.
There are still a number of improvements to be made to the program. Mainly there is some redundancy and abstraction improvements to be made on the player’s turn and the computer’s. Some takeaways from this project was the need to consider Aces being two values as well as the data structure used for the deck of cards. I went with an ArrayList with Card objects which had enums for the value and the suit but I’m sure there are other ways that are probably better.
I will probably work on the redundancy and abstraction in my spare time but overall I’m pretty happy with how the project turned out. Some other points of improvement could be in how the information is output to the user as well as how abrupt the game seems to end. I think this would be a great project to revisit later in the future to try and implement a GUI.
Invysti


--- layout: post title: no title date: '2009-03-03T21:22:54+00:00' tags: [] tumblr_url: http://backlog.robbevan.com/post/83247275/the-crisis-of-credit-visualized-on-vimeo-via ---
The Crisis of Credit Visualized on Vimeo (via Vimeo)


The pile task plays a particularly purposeful part in the process. It keeps track of the progress of a set of documents as it goes through the scriptorium.
Documents are grouped together in piles to help maintain documents in time order. It is assumed that a pile represents all the documents for the time period covered by the pile. If piles are delivered to librarians in time order, and the documents within each pile are delivered in time order, the customer will get all documents in time order.
| id | Unique ID for the task and the pile collected by it |
| agreement_id | The ID of the agreement under which the pile was collected |
| data_start_ts | The earliest data in the pile1 |
| data_end_ts | The latest data in the pile1 |
| posted_ts | The time the task was posted |
| posted_by | The generator of the request: abbot | administrator_user_id |
| claimed_by | The server and process ID of the provisioner that claimed the task |
| claimed_ts | The time the provisioner claimed the task |
| completed_ts | The time the provisioner completed the ask |
| n_docs_attempted | Number of documents the provisioner attempted to collect |
| n_docs_collected | Number of documents the provisioner successfully collected |
| collection_errors | List of the errors encountered during a collection |
| customers | List of the customers expected to want transcriptions of these documents, and the status of the librarian's packaging of those transcriptions |


Fouaad Mirza seals historic Olympic qualification
New Delhi: Fouaad Mirza on Friday became the first Indian equestrian in 20 years to seal an Olympic quota. The double Asian Games medallist finished top in Group G in the individual event category of the qualifiers for South East Asia, Oceania.
Mirza is thus in line to becoming only the third individual to have represented the country in an equestrian event at the Olympics after Imtiaz Anees (Sydney 2000) and Late Wing Commander IJ Lamba (Atlanta 1996).
Mirza finished with a total of 64 points from six qualifying events, securing 34 on his first horse Fernhill Facetime and 30 with his second horse Touchingwood. IANS
Also Read: Happy Outing for India in the 18th Edition of the Asian Games
Also Watch: MOU signed between Marwari Hospitals and Delhi’s Sir Ganga Ram Hospital in Guwahati


A random variate generator is used to join a random number generator together with a random number distribution. Boost.Random provides a vast choice of generators as well as distributions .
variate_generator
#include <boost/random/variate_generator.hpp> template<class Engine, class Distribution> class variate_generator { public: typedef Engine engine_type; typedef Distribution distribution_type; typedef typename Distribution::result_type result_type; variate_generator(Engine e, Distribution d); result_type operator()(); template<class T> result_type operator()(T value); engine_value_type& engine(); const engine_value_type& engine() const; result_type min() const; result_type max() const; };
Instantations of class template variate_generator
model a
number generator.
The argument for the template parameter Engine
shall be of
the form U, U&, or U*, where U models a uniform random number
generator. Then, the member engine_value_type
names U (not the
pointer or reference to U).
Specializations of variate_generator
satisfy the
requirements of CopyConstructible. They also satisfy the requirements of
Assignable unless the template parameter Engine is of the form U&.
The complexity of all functions specified in this section is constant. No function described in this section except the constructor throws an exception.
variate_generator(engine_type eng, distribution_type d)
Effects: Constructs a variate_generator
object with the associated uniform random number generator eng
and the associated random distribution d
.
Throws: If and what the copy constructor of Engine or
Distribution throws.
result_type operator()()
Returns: distribution()(e)
Notes: The sequence of numbers produced by the uniform
random number generator e
, se, is obtained from the
sequence of numbers produced by the associated uniform random number
generator eng
, seng, as follows: Consider the
values of numeric_limits<T>::is_integer
for
T
both Distribution::input_type
and
engine_value_type::result_type
. If the values for both types
are true
, then se is identical to seng.
Otherwise, if the values for both types are false
, then the
numbers in seng are divided by
engine().max()-engine().min()
to obtain the numbers in
se. Otherwise, if the value for
engine_value_type::result_type
is true
and the
value for Distribution::input_type
is false
, then
the numbers in seng are divided by
engine().max()-engine().min()+1
to obtain the numbers in
se. Otherwise, the mapping from seng to se
is implementation-defined. In all cases, an implicit conversion from
engine_value_type::result_type
to
Distribution::input_type
is performed. If such a conversion
does not exist, the program is ill-formed.
template<class T> result_type operator()(T value)
Returns: distribution()(e, value)
. For the
semantics of e
, see the description of
operator()()
.
engine_value_type& engine()
Returns: A reference to the associated uniform random number generator.
const engine_value_type& engine() const
Returns: A reference to the associated uniform random number generator.
distribution_type& distribution()
Returns: A reference to the associated random distribution.
const distribution_type& distribution() const
Returns: A reference to the associated random distribution.
result_type min() const
Precondition: distribution().min()
is
well-formed
Returns: distribution().min()
result_type max() const
Precondition: distribution().max()
is
well-formed
Returns: distribution().max()
Revised 05 December, 2006
Copyright © 2003-2004 Jens Maurer
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)


Locations
Vindicator's Base
54
Vindicator's Base
Spacecraft
unknown
['https://rickandmortyapi.com/api/character/252']


Open tabs in foreground
When activated, all tabs affected by this add-on will be opened in foreground. This option replaces the global preference for said tabs.


We're sorry but duel doesn't work properly without JavaScript enabled. Please enable it to continue.
Switch orintation.


This package used to be the OROMatcher library and provides both
generic regular expression interfaces and Perl5 regular expression
compatible implementation classes.
Note: The following information will be moved into the user's guide.
Perl5 regular expressions
Here we summarize the syntax of Perl5.003 regular expressions, all of
which is supported by the Perl5 classes in this package. However, for
a definitive reference, you should consult the
perlre
man page
that accompanies the Perl5 distribution and also the book
Programming Perl, 2nd Edition from O'Reilly & Associates.
We are working toward implementing the features added after Perl5.003
up to and including Perl 5.6. Please remember, we only guarantee
support for Perl5.003 expressions in version 2.0.
- Alternatives separated by |
- Quantified atoms
- {n,m}
- Match at least n but not more than m times.
- {n,}
- Match at least n times.
- {n}
- Match exactly n times.
- *
- Match 0 or more times.
- +
- Match 1 or more times.
- ?
- Match 0 or 1 times.
- Atoms
- regular expression within parentheses
- a . matches everything except \n
- a ^ is a null token matching the beginning of a string or line
(i.e., the position right after a newline or right before
the beginning of a string)
- a $ is a null token matching the end of a string or line
(i.e., the position right before a newline or right after
the end of a string)
- Character classes (e.g., [abcd]) and ranges (e.g. [a-z])
- Special backslashed characters work within a character
class (except for backreferences and boundaries).
- \b is backspace inside a character class
- Special backslashed characters
- \b
- null token matching a word boundary (\w on one side
and \W on the other)
- \B
- null token matching a boundary that isn't a
word boundary
- \A
- Match only at beginning of string
- \Z
- Match only at end of string (or before newline
at the end)
- \n
- newline
- \r
- carriage return
- \t
- tab
- \f
- formfeed
- \d
- digit [0-9]
- \D
- non-digit [^0-9]
- \w
- word character [0-9a-z_A-Z]
- \W
- a non-word character [^0-9a-z_A-Z]
- \s
- a whitespace character [ \t\n\r\f]
- \S
- a non-whitespace character [^ \t\n\r\f]
- \xnn
- hexadecimal representation of character
- \cD
- matches the corresponding control character
- \nn or \nnn
- octal representation of character
unless a backreference. a
- \1, \2, \3, etc.
- match whatever the first, second,
third, etc. parenthesized group matched. This is called a
backreference. If there is no corresponding group, the
number is interpreted as an octal representation of a character.
- \0
- matches null character
- Any other backslashed character matches itself
- Expressions within parentheses are matched as subpattern groups
and saved for use by certain methods.
By default, a quantified subpattern is greedy .
In other words it matches as many times as possible without causing
the rest of the pattern not to match. To change the quantifiers
to match the minimum number of times possible, without
causing the rest of the pattern not to match, you may use
a "?" right after the quantifier.
- *?
- Match 0 or more times
- +?
- Match 1 or more times
- ??
- Match 0 or 1 time
- {n}?
- Match exactly n times
- {n,}?
- Match at least n times
- {n,m}?
- Match at least n but not more than m times
Perl5 extended regular expressions are fully supported.
- (?#text)
- An embedded comment causing text to be ignored.
- (?:regexp)
- Groups things like "()" but doesn't cause the
group match to be saved.
- (?=regexp)
-
A zero-width positive lookahead assertion. For
example, \w+(?=\s) matches a word followed by
whitespace, without including whitespace in the
MatchResult.
- (?!regexp)
-
A zero-width negative lookahead assertion. For
example foo(?!bar) matches any occurrence of
"foo" that isn't followed by "bar". Remember
that this is a zero-width assertion, which means
that a(?!b)d will match ad because a is followed
by a character that is not b (the d) and a d
follows the zero-width assertion.
- (?imsx)
- One or more embedded pattern-match modifiers.
i enables case insensitivity, m enables multiline
treatment of the input, s enables single line treatment
of the input, and x enables extended whitespace comments.