text
stringlengths 1
3.78M
| meta
dict |
|---|---|
Pontyclun
Pontyclun (or Pont-y-clun) is a village and community located in the County Borough of Rhondda Cynon Taf, Wales. Like the surrounding towns, it has seen a sharp increase in its population in the last ten years as people migrate south from the South Wales Valleys, and west from the capital city of Cardiff.
Pontyclun translates from the Welsh language as 'bridge [over] the River Clun', the Clun being a tributary of the River Ely that runs through Pontyclun. A bridge crosses the Afon Clun just above its confluence with the Ely.
The village is served by Pontyclun railway station on the South Wales Main Line. It has its own local rugby club.
The village falls under the remit of Pontyclun Community Council, which represents the communities of Brynsadler, Castell y Mwnws, Groes-faen, Miskin, Mwyndy, Pontyclun, Talygarn, and Ynysddu
History
It was the influx of workers for the iron ore and coal mining industries, together with the coming of the South Wales Railway (in 1851) that changed Pontyclun from a farm with just four to five households into a burgeoning Victorian industrial town. The Coedcae Colliery (first listed in 1856) and the Bute iron ore mine (which opened in October 1852) caused the population growth. By 1871, the census returns record an influx of Cornish miners who had suffered from the collapse of the copper mining industry in Cornwall. By 1870 the industries of the area had been expanded by the coming of the Ely Tin Plate Works, The Pipe Works and The Steam Joinery Company.
Administration
The Community Council was formed in 1985 and consists of eleven elected Community Councillors who are all residents of the area. They act on behalf of local people to try and preserve the best aspects of the villages, while also encouraging and supporting developments that will benefit the whole community and ensure that it will continue to thrive. The Community Council monitors all local planning applications and, where appropriate, suggests amendments or submits written objections.
Electoral ward
Pont-y-clun was an electoral ward to Mid Glamorgan County Council electing one county councillor from 1989 and 1993 elections, subsequently (from 1995) becoming a ward to Rhondda Cynon Taf County Borough Council, electing two councillors.
Religion
Bethel Baptist Chapel was built circa 1876. Bethel relocated to Bethel Baptist Church Centre on Heol Miskin in 1993. Cwrt Bethel is on the site of the old chapel. St Paul's church, Pontyclun was erected in 1895 as a district church within the Anglican parish of Llantrisant. In 1924, the new parish of Pontyclun and Talygarn was constituted from the parish of Llantrisant. Bethel Baptist Church, Hope Presbyterian Church and St Paul's Church are still active places of worship.
Schools & education
The village is served by Y Pant School, a secondary school with about 1,150 pupils, situated in the village of Talbot Green. In 2000 it was ranked 49th in Wales in terms of its GCSE results (based on 5 GCSEs, grades A-C). Since then, exam results have improved dramatically and according to the latest inspection report from Estyn, the school now has a pass rate of 72% which means it is in equal 19th place in Wales, or in the top 10%. It is also the best performing secondary school in Rhondda Cynon Taf, just ahead of St. John the Baptist School (Aberdare). The village also houses Pontyclun Primary school which achieved above average results in all foundation subjects in the most recent Estyn reports.
Sport
Pontyclun has both a football and rugby union team. Pontyclun Football Club were formed in 1896 and joined the Football Association of Wales in 1922. Pontyclun Rugby Football Club (otherwise known as the Pontyclun Badgers), were formed in 1886 and joined the Welsh Rugby Union in 1887. Pontyclun has produced at least one Welsh international, Tommy Rees who later played rugby league for Great Britain, and Oldham. Pontyclun also has produced an International Footballer - Keith Pontin (Cardiff City and Wales)
Pontyclun also has a number of other sports clubs including Pontyclun Flyers (Cycling) and Pontyclun Road Runners (Running)
Crown Brewery
The South Wales & Monmouth United Clubs Brewery Co. Ltd. purchased the small family brewery owned by D & T Davies in 1919. This Company had been formed to supply the expanding number of Workingmen's Clubs, which were having difficulties with supply of beer from the many local breweries throughout the area. The Sunday Closing (Wales) Act of 1881 had fuelled the expanding number of clubs that did not have to close on Sunday, as was the case with public houses.
By 1936 the brewery was producing 500 barrels per week, which continued to increase to 900 in 1938. This growth was halted by the outbreak of the Second World War in 1939 but when the war ended in 1945 the growth took off again. By 1954 the old brewery had been replaced by a completely new building that was big enough to produce the 1,200 barrels per week that the clubs demanded at that time. In 1984 Bob Smith was head brewer for the company and was only the fifth in the 65 years the company had been trading. In 1988 Crown merged with Wales' oldest brewery, Buckley's of Llanelly to form the Crown Buckley Brewery. In the spring of 1999, after 80 years of trading, the brewery closed following the takeover of the company by Cardiff based Brains Brewery.
External links
Pontyclun RFC
Bethel Baptist Church
Pontyclun History
Pontyclun Community Council
Old photos of Pontyclun
www.geograph.co.uk: photos of Pontyclun and surrounding area
References
Category:Villages in Rhondda Cynon Taf
Category:Pontyclun
Category:Communities in Rhondda Cynon Taf
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Today we made the difficult decision to temporarily close comments on stories about indigenous people. We hope to reopen them in mid-January after we've had some time to review how these comments are moderated and to provide more detailed guidance to our moderators.
I want to explain our rationale for taking this unusual step.
But let me begin by explaining why we have comments on our news site.
If you follow industry trends, you'll know that the value of commenting on media websites has been debated for years.
Many publishers, including some newspaper sites in Canada, have shut comments down. Others have turned the commenting function on their websites over to third-party social media platforms such as Facebook.
As Fortune's Mathew Ingram recently wrote, there are common complaints cited whenever a publisher makes this move: comment sections breed trolls and "garbage"; the proportion of readers that leaves comments is small compared with the general audience; it costs a lot of money and time to manage and moderate this community; and there are social media platforms better suited for this type of conversation.
Much of that is true.
But at CBC News, we also see many positives. We believe our comment section helps answer our mandate as a public broadcaster to reflect the country and its regions to itself. We believe it's important to provide the public with a democratic space where they can freely engage and debate the issues of the day.
Research shows that our audience not only expects comments on a news site like ours, but values them -- even if readers don't participate directly in the comment threads. Those who do leave comments consume far more of our content than average users, so they're a highly engaged segment of our audience.
We also have one of the most active comment spaces of any media organization in the country. In the last few months, we set records for the number of comments left on our pages, topping one million comments in September and October.
We've seen thoughtful, insightful and moving comments on our pages. We've seen ignorant, ill-informed and objectionable comments as well. All of it is acceptable, in our view, in a marketplace of ideas where the issues of the day are freely debated and tested. For that to work, the debate must be respectful, even if it's vigorous and pointed.
But as our guidelines make clear, we draw the line on hate speech and personal attacks.
While there are a number of subjects and groups of people who seem to bring out higher-than-average numbers of worrisome comments, we find ourselves with a unique situation when it comes to indigenous-related stories.
We've noticed over many months that these stories draw a disproportionate number of comments that cross the line and violate our guidelines. Some of the violations are obvious, some not so obvious; some comments are clearly hateful and vitriolic, some are simply ignorant. And some appear to be hate disguised as ignorance (i.e., racist sentiments expressed in benign language).
This comes at the same time CBC News has made a concerted effort to connect with indigenous communities in order to improve our journalism and better reflect these communities to a national audience. The success of our Aboriginal unit and our investigative journalism around missing and murdered indigenous women are just two examples of that commitment.
We don't want violations of our guidelines by a small minority of our commenters to derail our good work or alienate our audience. So we're taking a pause to see if we can put some structure around this. We will reopen comments as soon as possible.
Thank you for your patience in the meantime.
Brodie Fenlon
Acting director of digital news
CBC News and Centres
|
{
"pile_set_name": "OpenWebText2"
}
|
Cremastocheilus castaneae
Cremastocheilus castaneae is a species of scarab beetle in the family Scarabaeidae.
Subspecies
These four subspecies belong to the species Cremastocheilus castaneae:
Cremastocheilus castaneae brevisetosus Casey, 1915
Cremastocheilus castaneae castaneae Knoch, 1801
Cremastocheilus castaneae lecontei Westwood, 1874
Cremastocheilus castaneae pocularis Casey, 1915
References
Further reading
Category:Cetoniinae
Category:Articles created by Qbugbot
Category:Beetles described in 1801
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Region-dependent absorption of faropenem shared with foscarnet, a phosphate transporter substrate, in the rat small intestine.
Faropenem, a penem antibiotic, is orally active despite its hydrophilic nature. However, its intestinal absorption has not yet been characterised in detail. This study was undertaken to determine the factors regulating faropenem absorption using intestinal loops prepared in the rat duodenum, jejunum and terminal ileum. Faropenem disappearance was much greater than that of cefotaxime and meropenem, and faropenem disappeared more extensively from the terminal ileum than from the jejunum or duodenum. In contrast to faropenem, the disappearance of ceftibuten was much greater from the duodenum and jejunum than from the terminal ileum. As the accumulation and enzymatic degradation of faropenem was minimal in the intestinal mucosa, faropenem was considered to enter the portal vein smoothly after its disappearance from the intestinal loops. Faropenem disappearance was not significantly influenced by the presence of monocarboxylic acids, amino acids or bile acid. Dipeptides such as L-carnosine and glycylglycine slightly but significantly lowered faropenem disappearance from the terminal ileum. On the other hand, foscarnet exerted a marked inhibitory effect on faropenem disappearance, but the antiviral agent did not modulate ceftibuten absorption. The present results suggest that faropenem is in part absorbed via a phosphate transporter present in the rat small intestine.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Ponad połowę transmisji z meczów mundialu TVP pokaże w 4K
(fot.pixabay.com)
Telewizja Polska ponad połowę meczów Mistrzostw Świata w piłce nożnej pokaże w technologii 4K.
Maciej Stanecki z zarządu TVP mówi, że wszystkie mecze mundialu będą dostępne w 4K, ale w TVP zobaczyć będzie można ponad połowę z nich.
TVP pokaże spotkania w nowym kanale TVP 4K, dla którego wystąpiła już o koncesję do Krajowej Rady Radiofonii i Telewizji.
Stanecki nie chce potwierdzić, czy TVP 4K będzie oferowany wyłącznie klientom Orange Polska. Komentarza odmawia również rzecznik Orange Polska Wojciech Jabczyński. Klienci Orange mają ponad 106 tys. dekoderów 4K.
Mistrzostwa Świata w piłce nożnej rozpoczną się 14 czerwca i potrwają do 15 lipca.
(KOZ, 25.04.2018)
* Jeśli znajdziesz błąd, zaznacz go i wciśnij Ctrl + Enter
|
{
"pile_set_name": "OpenWebText2"
}
|
UberVU (the conversation tracking engine) just launched the public API today - mg1313
http://developer.ubervu.com/
======
ldeva
I think Backtype has already one...but this is interesting to see how it
evolves. I know uberVU and Disqus partnered and powers now the conversation
tracking on Mashable. Let's see what Artiklz.com will respond (another
competitor)...
~~~
omakase
Yes, our API is live and documented here:
<http://www.backtype.com/developers/comments-connect>
Also here's a great app that was built by a user of our API:
<http://convotrack.com/I1>
|
{
"pile_set_name": "HackerNews"
}
|
Karlstad, Minnesota
Karlstad is a city in Kittson County, Minnesota, United States. The population was 760 at the 2010 census.
U.S. Route 59 and Minnesota State Highway 11 are two of the main arterial routes in the city. The current mayor is Dale Nelson. The city's slogan is "The Moose Capital of the North".
History
A post office called Karlstad has been in operation since 1905. The city was named after Karlstad, in Sweden.
Enterprise
Karlstad's largest employers are Wikstrom Telephone Company (Wiktel) and Mattracks. Wiktel provides internet and phone services for much of Northwestern Minnesota, including the regional telephone directory. The company has a long history in Karlstad, going back to the early 1900s. It was founded by the Wikstrom family, and many of the current employees are Wikstroms. Mattracks, however, is a newly founded company within the last 15 years, and manufactures and markets track conversion systems. Started by Glen Brazier, the rapidly growing company recently opened a new plant in China. Other than these two companies, most town businesses are locally owned and employ only a few individuals. Businesses include Hardware Hank, Germundson's Home Furnishings, Tony's Supermarket, Kim's Shear Design & Tanning, Nordisk Hemslojd, a Scandinavian gifts shop, a few restaurants and bars, and insurance and accounting services (etc.). In addition, the local community is primarily a farming one.
From 1951 through 1995, the town had its own hospital.
Events
Every year Karlstad has the annual Kick'n Up Kountry Music Festival and Moosefest
Education
Karlstad has two schools: Tri-County Public Schools and Heritage Christian School. Both schools serve grades K-12. Tri-County School combines with Marshall County Central Schools of Newfolden, Minnesota, located 17 miles to the south, for all of its athletic programs. The name given for the consolidated team is the Northern Freeze. Girls and boys track are also combined with Badger School and Greenbush Middle River School. Baseball and Softball have included Stephen-Argyle School District in their sports coops. The Northern Freeze coop has proved to be a success for all schools involved. The Freeze, since the coop, have advanced to the State Tournament three times: Volleyball (2006, 6th place), Baseball (2009) and Girls Basketball (2010, 4th place).
Geography
According to the United States Census Bureau, the city has a total area of , all of it land.
Demographics
2010 census
As of the census of 2010, there were 760 people, 331 households, and 189 families residing in the city. The population density was . There were 399 housing units at an average density of . The racial makeup of the city was 99.1% White, 0.3% African American, 0.1% Native American, 0.3% Asian, and 0.3% from two or more races. Hispanic or Latino of any race were 0.4% of the population.
There were 331 households of which 24.2% had children under the age of 18 living with them, 44.4% were married couples living together, 8.5% had a female householder with no husband present, 4.2% had a male householder with no wife present, and 42.9% were non-families. 39.6% of all households were made up of individuals and 23.6% had someone living alone who was 65 years of age or older. The average household size was 2.16 and the average family size was 2.92.
The median age in the city was 47.5 years. 22.5% of residents were under the age of 18; 5.1% were between the ages of 18 and 24; 20% were from 25 to 44; 24.8% were from 45 to 64; and 27.6% were 65 years of age or older. The gender makeup of the city was 45.4% male and 54.6% female.
2000 census
As of the 2000 census, there were 794 people, 340 households, and 199 families residing in the city. The population density was 522.3 people per square mile (201.7/km²). There were 394 housing units at an average density of 259.2 per square mile (100.1/km²). The racial makeup of the city was 97.86% White, 0.63% Native American, 0.13% from other races, and 1.39% from two or more races. Hispanic or Latino of any race were 0.38% of the population. 47.5% were of Norwegian, 19.9% Swedish and 9.9% German ancestry.
There were 340 households out of which 24.1% had children under the age of 18 living with them, 44.7% were married couples living together, 10.6% had a female householder with no husband present, and 41.2% were non-families. 36.5% of all households were made up of individuals and 23.2% had someone living alone who was 65 years of age or older. The average household size was 2.15 and the average family size was 2.81.
In the city, the population was spread out with 21.9% under the age of 18, 7.1% from 18 to 24, 21.4% from 25 to 44, 22.0% from 45 to 64, and 27.6% who were 65 years of age or older. The median age was 45 years. For every 100 females, there were 85.9 males. For every 100 females age 18 and over, there were 83.4 males.
The median income for a household in the city was $25,208, and the median income for a family was $35,469. Males had a median income of $29,444 versus $20,893 for females. The per capita income for the city was $13,274. About 9.2% of families and 13.4% of the population were below the poverty line, including 14.4% of those under age 18 and 15.3% of those age 65 or over.
Notable people
Ned Beatty - American Actor
References
External links
City of Karlstad
Heritage Christian School
Tri-County Schools
Category:Cities in Minnesota
Category:Cities in Kittson County, Minnesota
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Q:
How to use variable between functions
I'm having a problem of using variables between functions. As you can see down below User.username is available and good at the sign up page, but when you go to the login page I told it to first alert the value of User.username, and it alerts undefined? I'm confused here. I'm pretty sure I'm missing a concept here. Anyways Thank you so much!:
Here is a plunkr: http://plnkr.co/edit/qB3Gkeq5ji1YQyy0kpGH
Here is my script.js:
app.controller("AuthCtrl", ["$scope", "Auth","$rootScope",
function($scope, Auth, $rootScope) {
var User = {}
$scope.createUser = function(username, email, password) {
$rootScope.usernames = username
User.username = username
$scope.message = null;
$scope.error = null;
var ref2 = new Firebase("https://uniquecoders.firebaseio.com/");
ref2.createUser({
email: $scope.email,
password: $scope.password
}, function(error, userData) {
if (error) {
switch (error.code) {
case "EMAIL_TAKEN":
alert("The new user account cannot be created because the email is already in use. Try to login");
break;
case "INVALID_EMAIL":
alert("The specified email is not a valid email.");
break;
case "INVALID_PASSWORD":
alert("The Specified Passowrd Is not valid.")
break;
default:
alert("Error creating user:", error);
}
} else {
alert("Successfully created user account with username" + User.username);
window.location.hash = "/User"
}
});
};
$scope.logIn = function(){
alert(User.username)
$rootScope.usernames = User.username
$scope.message = null;
$scope.error = null;
var ref2 = new Firebase("https://uniquecoders.firebaseio.com/");
ref2.authWithPassword({
"email" : $scope.logInemail,
"password" : $scope.logInemailpassword
}, function(error, userData){
if(error){
alert("Login Failed Because : " + error)
}
else{
alert("Logged In!")
window.location.hash = "/User"
}
})
}
/* $scope.removeUser = function() {
$scope.message = null;
$scope.error = null;
Auth.$removeUser({
email: $scope.email,
password: $scope.password
}).then(function() {
$scope.message = "User removed";
}).catch(function(error) {
$scope.error = error;
});
};*/
}
]);
A:
When page reloads the entire javascript is re executed. So user object populated in registration process is no longer available in login function because page has reloaded on clicking on signup button.
So we need to store the user name in cookie so that we can access it any time. Even when its removed from javascript runtime it will be there in the browser cache.
Its risky to store passwords in cookies for security issues.
On successful registration save the username in cookie.
Some thing like this
document.cookie ="username =" +username + "; " +"email ="+ email;
In login function get cookie values and check if email of user is same as entered
function getCookie(name ) {
var pairs = document.cookie.split("; "),
count = pairs.length, parts;
while ( count-- ) {
parts = pairs[count].split("=");
if ( parts[0] === name )
return parts[1];
}
return false;
}
var username=getCookie("username");
var email=getCookie("username");
if($scope.logInemail ==email)
{
alert(username);
}
|
{
"pile_set_name": "StackExchange"
}
|
Everything About You
You know I’ve always got your back, girl
So let me be the one you come running to, running to, r-r-running
I said it’s just matter of fact, girl
You just call my name
I’ll be coming through, coming through, I’ll get coming
On the other side of the world, it don’t matter
I’ll be there in two, I’ll be there in two, I’ll be there in two
I still feel it every time
It’s just something that you do
Now ask me why I want to
It’s everything about you, you, you
Everything that you do, do, do
From the way that we touch, baby
To the way that you kiss on me
It’s everything about you, you, you
The way you make it feel, new, new, new
Like every party is just us two
And there’s nothing I could point to
It’s everything about you, you, you
Everything about you, you, you
It’s everything that you do, do, do
It’s everything about you
Yes, I like the way you smile with your eyes
Other guys see you but don’t realize that it’s m-my loving
There’s something about your laugh that it makes me wanna have to
There’s nothing funny so we laugh at n-n-nothing
Every minute’s like our last so let’s just take it real slow
Forget about the clock that’s tick-tick-ticking
I still feel it every time
It’s just something that you do
Now ask me why I want to
It’s everything about you, you, you
Everything that you do, do, do
From the way that we touch, baby
To the way that you kiss on me
It’s everything about you, you, you
The way you make it feel, new, new, new
Like every party is just us two
And there’s nothing I could point to
It’s everything about you, you, you
Everything about you, you, you
It’s everything that you do, do, do
It’s everything about you
And you have always been the only one I wanted
And I wanted you to know without you I can’t face it
All we wanna have is fun
But they say that we’re too young
Let them say what they want
It’s everything about you, you, you
Everything that you do, do do
From the way that we touch, baby
To the way that you kiss on me
It’s everything about you, you, you
It’s everything that you do, do, do
Like every party is just us two
And there’s nothing I could point to
It’s everything about you, you, you
Everything about you, you, you
It’s everything that you do, do, do
It’s everything about you
|
{
"pile_set_name": "Pile-CC"
}
|
I LOVE finding out about different ways to appreciate the Sun and light in general. Use this forum to post your info or questions about various outside the mainstream ways to appreciate our life giving star!
|
{
"pile_set_name": "Pile-CC"
}
|
Restrictions to be placed on European broadcasters
TV stations on the continent will not be permitted to have commentary in English
European broadcasters are to be restricted to showing one live match only on Saturday afternoons as the Premier League fights back in its effort to prevent pubs in England showing the games using foreign decoders.
TV stations on the continent will also not be permitted to have commentary in English - another change from the current deal which allowed all the Saturday 3pm games to be shown on the continent and with no restrictions on commentary.
It follows last year's High Court victory for Portsmouth pub landlady Karen Murphy, who overturned her conviction for using a cut-price Greek satellite decoder to air Premier League matches.
Some of the top-flight clubs such as Sunderland have claimed attendances suffer badly from pubs in the city showing home matches live via foreign satellite decoders.
The new rules for European broadcasters mean pubs will not be able to show any match they choose even if they have a foreign decoder.
Although the league lost the High Court case, it claimed a partial victory after the European Court of Justice ruled it could take legal action for breach of copyright for clips such as opening video sequences, graphics and highlights of previous matches.
The Premier League has almost finalised its overseas rights deals for 2013-16 - only Europe, the Middle East and North Africa remain outstanding. Once those are in place, the total broadcasting income for the next three seasons in expected to top £5bn.
Spending controls
Meanwhile, a compromise solution on spending controls is expected to be agreed by the Premier League chairmen next month despite four of the leading clubs writing to demand UEFA's full financial fair play rules are brought in.
A letter from Arsenal, Tottenham, Manchester United and Liverpool to the league chief executive Richard Scudamore has called for full spending controls, where clubs must break even without wealthy owners being allowed to cover clubs' losses.
Manchester City and Chelsea are opposing any spending controls being brought in but it is likely the 20 clubs will agree at their meeting on 7 February on a compromise which will allow a fixed amount of losses to be covered by owners.
The letter from the four clubs states: "Thank you for your continued work on the vital subject of Financial Regulation for the Premier League.
"However, we do not feel that the latest proposals go far enough to curb the inflationary spending which is putting so much pressure on clubs across the entire League.
"We continue to believe that to be successful and have the best chance of gaining at least the 14 votes necessary, any proposals for Financial Regulation must include meaningful measures to restrict the owner funding of operating losses."
West Brom and Fulham also oppose any spending controls, while the remaining 12 favour some form of compromise solution.
|
{
"pile_set_name": "Pile-CC"
}
|
form=未知
tags=
暮云凝冻，
耸玉楼、拈断冰髯知几。
今岁天公悭破白，
未放六霙呈瑞。
瘗马发祥，
妖麋应祷，
终解从人意。
腊前三白，
瑶光一瞬千里。
便好翦刻漫空，
落花飞絮，
滚滚随风起。
莫待东皇催整驾，
点点消成春水。
巧思裁云，
新词胜雪，
引动眉间喜。
欺梅压竹，
看看还助吟醉。
|
{
"pile_set_name": "Github"
}
|
Q:
Creating a class in Angular
How to create a class in angularjs with a constructor, getter, setter, variables and methods?
Here is example of what I want to make in angulajs
class Abc {
int a;
string str ="Hello world";
public Abc(){
}
public show(){
return str;
}
public setStr(string str){
this.str = str;
}
public getStr(){
return this.str;
}
}
I don't want to use any type script.
Just want to know how to make a class in angularjs with the following abilities.
A:
That is not the way JS or angular work.
Update
Since what you are trying to do is to be able to create new instances, you should probably create this in a service, and then in the controller you can inject your service.
For example:
angular.module('app', function(){
});
angular.module('app').factory('Abc', function(){
return {
a: 0,
str: "Hello world",
show: function() {
return str;
},
setStr: function(str) {
this.str = str;
},
getStr: function() {
return str;
}
}
});
angular.module('app').controller('myController', function(Abc) {
$scope.newClass = new Abc;
});
Old answer.
Instead you create objects which have there own properties, usually inside the $scope of your controller.
An equivalent angular code to your code would be:
angular.module('app', function(){
});
angular.module('app').controller('Abc', function(){
$scope.a;
var str = "Hello world";
$scope.show = function() {
return str;
};
$scope.setStr = function(str) {
str = str;
};
$scope.getStr = function() {
return str;
};
});
|
{
"pile_set_name": "StackExchange"
}
|
b) = 6*b. Let s(z) = -z**2 - 13*z - 13. Let y be s(-12). Calculate o(y).
-6
Let n(g) = g - 2. Let o be (36/10)/((-6)/(-20)). Let p be 8/(-3)*(-18)/o. What is n(p)?
2
Let t(r) = 5*r - 1 - 6*r - 2*r. Let a(p) = 2*p**2 + 1 - p**2 - p + 0*p**2 - 3*p. Let w be a(4). Give t(w).
-4
Let r be 26/(-22) - (-5)/((-55)/(-2)). Let b(s) = -5*s**2 - 1. Calculate b(r).
-6
Let n(u) = -9*u - 25. Let x(p) = 5*p + 13. Let m(g) = 6*n(g) + 11*x(g). Determine m(5).
-2
Suppose -2*s = c + 3, -4*c + 0 + 10 = -3*s. Let j be (1 + 3)*s/(-4). Let v be (1 + 5)*j/(-3). Let z(w) = -w**2 - 5*w - 2. Determine z(v).
2
Let o(t) be the first derivative of -4*t**3 + t**2/2 - t - 16. What is o(1)?
-12
Let z(s) = -4 + 40*s - 86*s - s**2 + 40*s. Determine z(-3).
5
Let d(h) = -h**3 - 5*h**2 - 2*h + 5. Suppose -2*t + t - 4 = 0. Give d(t).
-3
Let v(b) = -b**2 - 7*b + 2. Suppose -10*z + 3*z - 35 = 0. Determine v(z).
12
Let i(f) = 7*f + 3 + 3 - 12*f + 7*f. Give i(-6).
-6
Let m(f) = f**2 + 6*f - 1. Let c = -10 - -13. Let s(a) = -a - 3. Let w be s(c). Determine m(w).
-1
Let a(g) = g - 7. Let i be a(6). Let y(v) be the first derivative of v**3/3 + v**2/2 - 1. Let m(q) = 18*q**2 + 9*q. Let o(p) = -m(p) + 9*y(p). Give o(i).
-9
Suppose -2 = -4*p - 6. Let b(r) = r**3 + 6*r**2 - 5. Let w(s) = -3*s**3 + 3 - 3 + s**3 + 9 - 11*s**2. Let h(y) = 11*b(y) + 6*w(y). Determine h(p).
0
Let g(m) = -4. Let h(w) = -w. Let d(b) = -g(b) + 4*h(b). Let j be -6*1*(-1)/2. Calculate d(j).
-8
Let x(g) = -4*g + 3. Let a(c) be the third derivative of c**5/60 + c**4/24 + c**3/2 + c**2. Let j be a(0). Give x(j).
-9
Let i(j) be the third derivative of j**5/15 - j**3/3 + 13*j**2. Give i(2).
14
Suppose -5*i + 18 = -h, -4*i + 0*i + 6 = -5*h. Let g(b) be the second derivative of h*b - 4/3*b**3 + 1/2*b**2 + 0. Give g(1).
-7
Let r(p) be the second derivative of p + 0 + 1/6*p**3 + 4*p**2. Let i(h) = 3*h + 25. Let w(a) = -2*i(a) + 7*r(a). What is w(-5)?
1
Let u(g) = -g**2 - g - 1. Let i be 0 + (2 - 0) + -9. Let n(b) = -b - 7. Let k be n(i). Determine u(k).
-1
Let u(w) = -w**2 - 6*w + 1. Suppose g + 32 = -4*y, -3*y - g + 0*g - 25 = 0. Give u(y).
-6
Let y(o) = -o**2 - o - 1. Let w(t) = t**2 + 2*t + 4. Let j(n) = w(n) + 4*y(n). Suppose k - 3 = -5. Calculate j(k).
-8
Let s(b) = b**2 - 4. Let c be ((-4)/5)/(3/15). Calculate s(c).
12
Suppose 3*w - 12 = -3. Let f(j) = 10 + 7*j + 7*j**2 + j + 10*j**3 - 9*j**w - 2. Determine f(-6).
-4
Let w = -35/2 + 18. Let m(s) be the first derivative of -w*s**4 + 0*s**2 - s**3 + s + 2. Give m(-2).
5
Let k(m) = m**3 + 4*m**2. Suppose -n + 8 = 5. Suppose 2*l = -n*l - 20. Let v be k(l). Let q(y) = -y**2 - 2. Calculate q(v).
-2
Let s(g) be the first derivative of g**3 + g**2/2 - g + 13. Determine s(1).
3
Let t(b) = -3*b + 1. Suppose 0*l + 5*n = -l - 23, -4*l + 23 = -3*n. Give t(l).
-5
Let h(n) = 0*n - 2*n + 3*n**2 + n**3 + 2*n - 4*n. Let s = 0 + 1. Let p be ((-2 - -3)*-4)/s. Give h(p).
0
Suppose 4*r - 9 = r. Let t(f) = -9*f**r + f + 0*f + 10*f**3 + f + f**2. Determine t(-2).
-8
Suppose 4*b = 2*b + 8. Suppose 0*v + 3*w + 5 = 4*v, -17 = 5*v + b*w. Let k(r) be the second derivative of -3*r**5/20 + r**4/12 + r. Calculate k(v).
4
Let p(w) = 7*w + 13. Let n(i) = 11*i + 19. Let z(q) = -q**3 - 9*q**2 + 1. Let d be z(-9). Let t be ((-10)/25)/(d/20). Let j(r) = t*p(r) + 5*n(r). Give j(-6).
-3
Suppose -2*i + 6 = -4. Suppose 4*b + 25 = i*j - 5, -3*b = j + 13. Let n(m) = m**2 + 2*m - 2. Give n(j).
6
Let t = 1 - 1. Suppose t = -0*l + l + 5. Let f(w) be the second derivative of -w**5/20 - 5*w**4/12 - w**3/6 + w**2/2 - 28*w. Calculate f(l).
6
Let d(w) = w**2 - 3*w + 3. Suppose 0 = 4*u + 1 - 17. Calculate d(u).
7
Let i(m) = m**2 + 4*m + 5. Let j(q) = -2*q**2 - 7*q - 9. Let c(s) = -11*i(s) - 6*j(s). What is c(3)?
2
Let g(z) be the third derivative of -z**5/60 - z**4/4 + z**3/2 - 24*z**2. Calculate g(-7).
-4
Suppose 5*t - 16 = 4*t. Suppose -2 = o + 2*i, -2*o + 4*o - t = i. Let j(r) be the second derivative of -r**3/6 + 5*r**2 + 3*r. Determine j(o).
4
Let b(u) = -4 + 4*u - u - 2. Let o = -10 + 15. Let w(t) = -3*t + 7. Let d(c) = o*w(c) + 6*b(c). What is d(-2)?
-7
Let d(k) be the second derivative of k**7/2520 + k**6/180 - k**5/20 - k**4/2 - 7*k. Let s(u) be the third derivative of d(u). Calculate s(-5).
-1
Let q(h) = -2*h - 9. Let i be q(-6). Let m(x) = x + x**2 - 3*x**3 - 4 + 2*x**i + 1 + 0*x**2. Determine m(0).
-3
Suppose -3*y + 5 + 4 = 0. Let j(l) = -5*l**3 - 3*l + 2*l + l**y + 2*l**2. Calculate j(1).
-3
Let g be ((-1)/3)/(2/(-6)). Suppose -3*b + 0*j + 5*j = -11, 3*b + j - 5 = 0. Let d(v) = 10*v**3 + 1 - 4*v**2 - 3*v**3 - 2 + 2*v**2 + b*v. What is d(g)?
6
Let z(l) = -2*l + 1. Let i be (-1)/(-5) - 355/25. Let a = -9 - i. Calculate z(a).
-9
Suppose 2*a = o - 5*o + 6, 0 = -o - 2*a + 3. Let l(q) = -5*q + 1. What is l(o)?
-4
Let s(k) = k**3 + 3*k**2 - 4. Let z be s(-3). Let v(r) = r**2 + 4*r + 2. What is v(z)?
2
Let t(u) = -7*u + 1. Let f(y) = -y**3 + 2*y**2 + 2*y - 2. Let q be f(2). Let v be 0/(-2 - -3) - q. Determine t(v).
15
Let j(w) = -2*w + w + 2*w**2 - w**2 + 1. Suppose 0 = 2*q - 6*q. Let n be j(q). Let p(z) = 3*z**3 - z**2 + 1. Determine p(n).
3
Let m(h) be the first derivative of -h**2 - 3*h + 48. Determine m(-6).
9
Let z(x) = -2. Let m(f) = -f. Let i(q) = -3*m(q) - z(q). Suppose 0 = 54*k - 52*k - 4. Determine i(k).
8
Let t(z) be the first derivative of -z**4/6 + z**3/3 + 3*z**2/2 - z + 4. Let r(h) be the first derivative of t(h). Give r(3).
-9
Let i(r) be the second derivative of -r**4/24 + r**2/2 + 3*r. Let x(a) be the first derivative of i(a). Let o(g) = 2*g - 3. Let n be o(3). What is x(n)?
-3
Let c(l) = -l - 6. Let i be c(-7). Let q(o) = -2*o + 1. Calculate q(i).
-1
Let z(j) = j**3 - 5*j**2 - 7*j + 7. Let r be z(6). Let m(v) = 17*v**2 - 1. Determine m(r).
16
Let m(j) be the third derivative of -j**5/60 + j**4/8 - 2*j**3/3 + 3*j**2. Let v = 10 + -7. Determine m(v).
-4
Let q(f) = -4*f + 11. Let p be q(4). Let c(x) = -x**3 - 6*x**2 - 4*x. Calculate c(p).
-5
Let g(z) = z**2 + 8*z + 9. Let w = 2 + -15. Let y = w - 2. Let f = y - -9. Determine g(f).
-3
Let m(q) = -q**2 - 6*q - 3. Suppose 0 = j + 5 - 0. Let c be (-5)/(-2 - (j + 2)). What is m(c)?
2
Let y be 124/(-28) + 12/28. Let s(f) = f + 4. Determine s(y).
0
Let c(r) = 0*r**3 + 7*r**3 + 1 - 60*r**2 + 6*r**3 + 59*r**2. Suppose -o + 3*o - 2 = 0. Calculate c(o).
13
Let w(k) be the second derivative of 1/20*k**5 + 9*k + 4/3*k**3 - 2/3*k**4 - 5*k**2 + 0. What is w(7)?
-3
Let m(o) = 3*o**2 + 1 - 2*o**2 - 4*o**2 + 2*o**2. Let p be (-2)/(-5) + (-12)/5. What is m(p)?
-3
Let h be (-4 + 2)/(4/10). Let t(a) = a**3 + 6*a**2 + 5*a + 2. Calculate t(h).
2
Let t be 2/(-4) - 6/4. Let k(n) be the first derivative of -n**5/20 + 2*n**3/3 + 3*n**2/2 + n - 1. Let s(l) be the first derivative of k(l). Determine s(t).
3
Let k(s) = 11*s**2 + 3*s - 13. Let x(h) = -5*h**2 - h + 6. Let f(j) = -6*k(j) - 13*x(j). Suppose -b + 5*z - 16 = 0, 3*b + z - 2*z + 20 = 0. Calculate f(b).
-6
Let l(f) = -4*f**3 - 2*f - 6*f - 10*f**2 - 12*f**2 - 25 - 4*f. Let n(b) = 3*b**3 + 15*b**2 + 8*b + 17. Let h(c) = 5*l(c) + 7*n(c). What is h(6)?
6
Let x be (-8)/12 - (-24)/9. Let t(i) = -i**x - 1 + 7*i - 6*i + 2*i**2. Calculate t(-4).
11
Let f(z) = -z**3 + z**2 - 1. Let q(g) = 4*g**3 + 9*g**2 + g + 17. Let b(o) = -3*f(o) - q(o). Calculate b(-12).
-2
Let x(w) = w**2 + 4*w. Let j be x(-2). Let m = j - -10. Let y(u) = u + 4 - m - u - u. Calculate y(-4).
2
Suppose -2*z = -3*z + 3. Let k(l) = 5*l - 2*l - z - 4. Give k(6).
11
Suppose 0 = -2*u + 4*s - 20, s - 5 = -4*u - 0*s. Suppose u*l = -2*l - 8. Let i(d) = d**2 + 3*d + 2. What is i(l)?
6
Let t(d) = -4 - 2 + d - 1. Let w = 25 + -20. Calculate t(w).
-2
Suppose 6 = 2*x - 3*x. Let v(n) = -n**2 - 5*n + 3. Calculate v(x).
-3
Let a(g) be the third derivative of -g**8/6720 + g**7/630 - g**6/240 - g**5/120 + g**4/12 + 2*g**2. Let r(d) be the second derivative of a(d). What is r(3)?
-1
Let j(t) = -t**2 - 3. Suppose 2*r + 0 = 6. Calculate j(r).
-12
Let b(j) be the third derivative of j**4/24 - j**3/6 - 13*j**2. Calculate b(-4).
-5
Let z(g) be the third derivative of -g**5/60 - g**3/3 + 9*g**2. Determine z(0).
-2
Let r(f) = 2*f - 1. Let n = -37 + 16. Let d be (-3)/((-27)/(-6))*n. Suppose -3*x + 4*g = -g - 1, -4*x = g + d. Determine r(x).
-7
Let a(n) = -6*n**2 + 2 + 8*n**3 - n**3 - 7*n
|
{
"pile_set_name": "DM Mathematics"
}
|
Cystatin C as biomarker of contrast-induced nephropathy in pediatric cardiac angiography.
The purpose of this study is to find the frequency of contrast-induced nephropathy (CIN) and to show the risk factors in the development of CIN and the diagnostic utility of serum cystatin C (CysC) and serum and urine neutrophil gelatinase-associated lipocalin (NGAL) during childhood following cardiac angiography. In this prospective study, we studied 46 children with congenital heart disease. The levels of serum creatinine, serum CysC, and serum NGAL were measured at 4, 24, and 48 h, while levels of urine NGAL and urine creatinine were measured at 4 to 8 and 48 h following cardiac angiography. According to serum creatinine levels, with a cutoff value of 4.1 mL/kg for development of CIN, sensitivity, specificity, area under the receiver-operating characteristic curve, and positive likelihood ratio were calculated as 69%, 70%, 0.67, and 2.29, respectively. The levels of serum CysC and serum creatinine significantly increased at 4, 24, and 48 h after the application of the contrast agent. The results of this study show that according to the definition of CIN, the incidence of CIN is significantly increased in pediatric patients with congenital heart disease. Moreover, the results support that serum CysC levels may allow the detection of CIN after cardiac angiography, like serum creatinine in present study.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
This 30" holiday wreath with handmade floral and handpainted ornaments comes with a wreath hanger for easy use.
Description
Decorate your home with this beautiful holiday wreath accented with handmade florals and handpainted ornaments. This piece is sure to add a touch of holiday elegance to any home or office. Perfect for doors and mantels.
Specifications
Handmade floral and ornaments
Metal wreath hanger included
Also available in Cozy Christmas and Inspired by Nature styles
Details
Assembled Country
China
Assembled Size
30" Diameter
Component Country
Imported
Ask & Answer
Warranty Information
This product is covered by the Sam's Club Member Satisfaction Guarantee.
There is no additional information available for this item.
Stay Connected
Mobile apps
Email Updates
Get the Sam's Club Insider email and save even more. At this time, registration for email is unavailable in Puerto Rico. For more information, visit our privacy policy.
|
{
"pile_set_name": "Pile-CC"
}
|
Prove it. Let the American voters, the press, and the global public see and read the fine print of this so-called "free trade" deal.
That's the basic message contained in a new statement released by Sen. Elizabeth Warren (D-Mass.) after President Obama said earlier this week that she and other opponents of the Trans-Pacific Partnership (TPP) were "wrong" when it came to their objections to the pending 12-nation agreement.
"We’ve all seen the tricks and traps that corporations hide in the fine print of contracts. We’ve all seen the provisions they slip into legislation to rig the game in their favor. Now just imagine what they have done working behind closed doors with TPP." —Sen. Elizabeth Warren"The Administration says I'm wrong – that there’s nothing to worry about," Warren wrote in a blog post addressed to constituents and the general public on Wednesday. "They say the deal is nearly done, and they are making a lot of promises about how the deal will affect workers, the environment, and human rights. Promises – but people like you can't see the actual deal."
Warren's statement came as members of the Senate Finance Committee on Wednesday evening—despite an attempt by Sen. Bernie Sanders to slam the brakes on the process—voted to pass trade promotion authority, or Fast Track, that would give President Obama and his administration the ability to negotiate the final terms of the TPP (as well as a similar deal with Europe), while relegating the congressional role to "all or nothing" up-or-down votes on the trade pacts.
Passed by a vote of 20-6, the Fast Track measure received support of seven Democrats on the committee and all but one Republican. In addition to Sen. Ron Wyden (Ore.), who co-sponsored the bill, the other Democrats who voted in favor of Fast Track were Sens. Maria Cantwell (Wash.), Ben Cardin (Md.), Bill Nelson (Fla.), Tom Carper (Del.), Mark Warner (Va.), and Michael Bennet (Colo.).
In his recent comments, Obama has called the TPP the "most progressive trade deal in history," but critics like Warren have responded by saying if that is true—if the deal is so great and wonderful—why won't the administration release the details so the American public can see for themselves? Though lawmakers have received numerous briefings and can see draft versions of the agreement, they are forbidden from disclosing the details of what it contains.
So why hasn't the deal—other than through bits and pieces of un-sanctioned leaks—been made available to the general public even though corporate interests have had a seat at the table throughout the multi-year negotiating process? According to Warren, and despite assurances from Obama and others, the reason is simple: "We can’t make this deal public because if the American people saw what was in it, they would be opposed to it."
She continued:
For more than two years now, giant corporations have had an enormous amount of access to see the parts of the deal that might affect them and to give their views as negotiations progressed. But the doors stayed locked for the regular people whose jobs are on the line. If most of the trade deal is good for the American economy, but there’s a provision hidden in the fine print that could help multinational corporations ship American jobs overseas or allow for watering down of environmental or labor rules, fast track would mean that Congress couldn’t write an amendment to fix it. It’s all or nothing. Before we sign on to rush through a deal like that – no amendments, no delays, no ability to block a bad bill – the American people should get to see what’s in it.
Sen. Warren also appeared on The Rachel Maddow show on Wednesday night to explain her opposition. When mentioned by Maddow that the White House has now promised that there would be a "public comment period" after the TPP was approved by Congress but before President Obama signs it, Warren laughed out loud. "They're asking [Congress] to vote now on greasing the skids," Warren said in response, "so that we give up any chance to be able to amend it, any chance to be able to block it, any chance to be able to slow it down. [The White House is saying,] 'Give all that up and then you'll get to see the deal on the other side.' I just don't think that's reasonable."
Watch:
With a separate vote on Fast Track scheduled for Thursday in the House Ways and Means Committee, the debate in Congress—and across Capitol Hill—has now reached a fevered pitch.
In extended comments from the Senate floor on Wednesday, Sen. Sanders explained his ongoing opposition to TPP and his attempt, though only briefly successful, to slow down the legislative push by TPP proponents who are currently moving as fast as they can to ram the deal through:
And as Sen. Warren concluded in her latest statement, "We’ve all seen the tricks and traps that corporations hide in the fine print of contracts. We’ve all seen the provisions they slip into legislation to rig the game in their favor. Now just imagine what they have done working behind closed doors with TPP. We can’t keep the American people in the dark."
|
{
"pile_set_name": "OpenWebText2"
}
|
James Wickham looks at mass immigration and the growth of inequality and shows why it is important to link immigration to changes in an economy’s occupational structure.
The claim that immigration is economically beneficial appears to be an article of faith amongst those who consider themselves progressive. However, mere changes in total GDP often mean little in terms of the lived reality of society. Much more important is whether or not mass immigration changes the social structure and the pattern of economic inequality.
Economic inequality (in the distribution of income and wealth) has been growing in virtually every developed society. It is clear that there is no single cause, but one important driver is changes in the occupational structure. In some countries, but especially in the UK and the USA, occupational growth has polarised: there are more well-paid high-skilled jobs, there are more low-paid jobs, but there are fewer moderately well-paid secure jobs in the middle.
A growing social science research suggests that the reason for the existence of low-paid jobs has been precisely the availability of a large pool of immigrant labour. Low-paid jobs have expanded simply because there are people prepared to do them. If this labour supply did not exist and, crucially, if there was no alternative labour supply, then the jobs would not exist. The argument that immigrants are ‘needed’ to fill existing jobs takes the existing jobs and hence the occupational structure for granted; furthermore, it accepts that immigrants are the only possible source of additional labour.
Join our growing community newsletter! "Social Europe publishes thought-provoking articles on the big political and economic issues of our time analysed from a European viewpoint. Indispensable reading!" Polly Toynbee Columnist for The Guardian Thank you very much for your interest! Now please check your email to confirm your subscription.
In some sectors enterprises’ business model depends upon paying low wages. The transformation of agriculture in the USA and more recently in the UK has involved a shift to forms of production and even to crops that are only viable because of low wages. Employers, sometimes supported by immigration advocates, now argue that food production can only occur if there is cheap immigrant labour.
Mass immigration and new servants
Until the 1980s domestic servants were declining in numbers. Today professionals and managers expect to employ domestic labour to clean their houses, mind their children, etc. These jobs are overwhelmingly taken by immigrants who are often illegals. Intriguingly, the particular beneficiaries are women earners at the upper end of the income distribution – purchasing labour in the home enables them to devote more time to their remunerative career. Thus, one US study shows that, in areas with a high immigrant population, high income women spend more time at work than in areas where there are fewer immigrants. Such privatised domestic employment ensures that there is less pressure on men to contribute to domestic labour – and certainly reduces the demand for effective publicly funded childcare.
The new availability of low wage labour has contributed to the survival and even expansion of low technology manufacturing. One US study shows that engineering firms are likely to use less capital in production in areas with high immigrant populations. Indeed, in some areas the availability of low wage labour is facilitating technological regression – the replacement of capital by labour. Instead of driving the car to a self-service car-wash, you get the car ‘valeted’ by workers who use nothing more advanced than a bucket and mop. Away from such public view, in many European cities there is a revival of the clothing industry, based on micro-workshops using only the very simplest technologies and immigrant workers with very long hours and low pay.
This relationship between mass immigration and occupational change cannot be generalised to all periods and places. The mass European migration in the second half of the 19th century to the USA and other areas of new settlement did not have this result, nor in fact did the mass immigration to Western Europe in the post-world war period. It is, however, clear that today those who call for ‘open borders’ – the unrestricted entry of unskilled workers into the EU – are facilitating a more polarised occupational structure, more low paid workers and greater social and economic inequality.
|
{
"pile_set_name": "OpenWebText2"
}
|
Lok Sabha elections 2019: Congress's Shashi Tharoor campaigns in Thiruvananthapuram
Congress leader from Kerala Shashi Tharoor, whose long-letter wordplays on Twitter in the past won him fans as well as critics, is caught in a farrago of criticism for a recent tweet about the fisherfolk community. While campaigning at a fish market in his constituency Thiruvananthapuram, he wrote a series of tweets, one of which was: "Found a lot of enthusiasm at the fish market, even for a squeamishly vegetarian MP!"
Then a massive backlash followed, with many, mostly his detractors slamming him for allegedly "insulting the fishing community" and a "savarna attitude" - referring to caste-based preference for vegetarianism.
In a tweet, writer NS Madhavan criticised the Congress parliamentarian, who is looking to score a hat-trick from Thiruvananthapuram Lok Sabha seat, saying, "Deconstruction: I'm a vegetarian, therefore I'm a savarna."
The BJP weighed in on Mr Tharoor's tweet. "A considerable population of Thiruvananthapuram are people who live by selling fish. They have no option but to live with that smell. Such statements can be expected only from people like Tharoor who live immersed with perfume worth lakhs," the BJP posted on its official Facebook page.
Reacting strongly, Mr Tharoor in a press conference denied allegations that he hurt the feelings of the fisherfolk.
"When I said squeamishly vegetarian, I was making a joke of myself, of my lifestyle choice. Most of the people in my family, including my sisters and one of my sons eat fish. I have nothing against it. I in no way pointed to the fishing community. And to say I am a casteist is ridiculous. Everyone knows I have written books on this and I grew up in a family where my father even dropped his surname", the Congress leader told reporters.
"My political rivals have nothing to raise their fingers against me and that's why they have indulged in false opportunism, weaved around lies. Let us face it. They are trying to eat into some of my votes. These lies will not work," he said.
"I have worked for and lived with the fishing community. I was the first one to call Defence Minister Nirmala Sitharaman during the floods and I repeatedly raised questions, demanding funds for cyclone Ockhi victims as well as drawing attention to the failure of Doppler radars," Mr Tharoor said.
In 2014, he won from Thiruvananthapuram with a narrow margin of 15,000 votes against BJP's O Rajagopal. It was the votes from the coastal belt that had come to Mr Tharoor's rescue in the last rounds.
Mr Tharoor is not new to controversies with his choice of words. In 2009, his comment on traveling "cattle class" was criticised even by some top Congress leaders.
|
{
"pile_set_name": "OpenWebText2"
}
|
Acraea neobule
Acraea neobule, the wandering donkey acraea, is a butterfly of the family Nymphalidae. It is found in Sub-Saharan Africa and south-western Arabia.
The wingspan is 48–55 mm for males and 50–56 mm for females. Adults are on the wing year round, but are more common from September to April.
The larvae feed on Passiflora edulis, Passiflora incarnata, Adenia gummifera and Hybanthus species.
Subspecies
Acraea neobule subsp. neobule
Range: Senegal, Gambia, Guinea-Bissau, Guinea, Burkina-Faso, Liberia, Ivory Coast, Mali, Ghana, Togo, Benin, Niger, Nigeria, Cameroon, Equatorial Guinea, Gabon, Congo, Central African Republic, Angola, DRC, Sudan, Uganda, Kenya, Ethiopia, Somalia, Tanzania, Malawi, Zambia, Mozambique, Zimbabwe, Botswana, Namibia, South Africa, Swaziland, Lesotho, Saudi Arabia, Yemen, Oman
Acraea neobule subsp. legrandi Carcasson, 1964
Range: Seychelles
References
External links
Images representing Acraea neobule at Bold
Images representing Acraea neobule neobule at Bold
Acraea neobule at Pteron
necoda
Category:Butterflies described in 1847
|
{
"pile_set_name": "Wikipedia (en)"
}
|
The effectiveness of progressive relaxation in chronic hemodialysis patients.
An experimental group of 38 patients on chronic hemodialysis were presented a 30-min, self-instructional, color videotape on progressive relaxation (PR) exercises; and a control group of 23 patients viewed a neutral videotape. Both groups were given the State-Trait Anxiety Inventory while on the dialysis machine, before and after the actual viewing. The experimental group significantly reduced its state anxiety level while the control group remained the same. Patients who reported higher levels of state anxiety and experienced tension more frequently tended to achieve the greater benefit from the program. It is postulated that PR can be a useful resource to overcome the sometimes severe anxiety related to the stresses of chronic hemodialysis.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Capillary electromigration techniques for studying interactions between analytes and lipid dispersions.
CE has matured into a well-known and much used separation technique, with applications covering more or less all types of samples. EKC, which originally was developed for the separation of uncharged compounds, is still today under much development, with main focus on finding the perfect or ideal carriers (pseudo-stationary phase) for a broad range of analytes. In this review, the use of lipid dispersions as pseudostationary phases in EKC performed in capillaries and microchips, in addition to CE frontal analysis and partial filling EKC using lipid dispersions is discussed. Various types of lipid dispersions including liposomes, PEG-stabilized aggregates, proteoliposomes, lipid-based nanoparticles, and commercial lipid emulsions are described. The purpose of the review is to give the reader an overview of how EKC, CE frontal analysis, and partial filling EKC, have been applied to the study of interactions between analytes and lipid membranes.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Check out our new site Makeup Addiction
add your own caption
add your own caption
add your own caption
add your own caption
add your own caption
add your own caption
add your own caption
add your own caption
add your own caption
add your own caption
add your own caption
Friend posts on my account It's my most successful submission
|
{
"pile_set_name": "OpenWebText2"
}
|
Arthur and Jane are stewards of the Matteson/Metzger family farm on Crandall Hill in Potter County, Pennsylvania. Now Certified Organic by Pennsylvania Certified Organic!
Monday, May 9, 2016
Certified Organic Garden Plants For Sale
Certified Organic Tomato Plants
As advertised, Metzger Heritage Farm has USDA Certified Organic Tomato and Pepper Plants available for sale. Some varieties could be ready to go this week while others will benefit from another week or two in the protected greenhouse.
And, as of last evening (Tuesday, May 10), Verizon has repaired our telephone line. The answering machine is ready to take your calls if we're out in the greenhouse. Also, email is good at metzgerfarm@gmail.com
These tomatoes are about four inches high this morning
They have been grown in organic seed starting mix and organic compost potting soil in individual peat pots. These plants are raised in a heated greenhouse space with supplemental lighting. They are healthy and sturdy. We have taken care to selected varieties with a short growing season to help ensure success in your home garden. We are offering discount for the purchase of six or more plants.
We planted the first of our tomatoes in the high tunnel on Wednesday. They have great root systems and have already begun their ascent up the twine.
No comments:
About Our Family Farm
Located on Dingman Run Road, five miles from the intersection of Route 6, just west of Coudersport, Pennsylvania.
Our participation in Path To Organic program of the Pa. Department of Agriculture led us to achieve USDA Organic Certification in 2015.
|
{
"pile_set_name": "Pile-CC"
}
|
Monthly Archives: July 2016
The University of St Andrews RFC is pleased to announce our new coaching team for the upcoming 2016/2017 season. Director of Rugby David Ross has added Luis Arola as forwards coach, and Chris Martin as 2nd XV coach for the upcoming season. Burhan Torgut will continue in his 3rd XV Head Coach, video analysis, and strength and conditioning roles.
David Ross had to say on the appointments, “Appointing such dedicated and enthusiastic coaches to compliment the work that Burhan Torgut and I have been doing for the last year is very exciting for the club. Both Luis and Chris are keen to make an impact at the club to ensure we remain the number 1 rugby programme in Scotland and become even better with their input. With pre-season just over a month away we are all planned and ready to go and will be working hard to prepare the teams for The Royal Bank of Scotland Scottish Varsity Match and the start of the BUCS season.”
New forwards coach, Luis Arola, formerly of Heriots FP RFC and Merchiston Castle School, noted, “Joining the University of St. Andrews RFC is an exciting opportunity. It brings immense responsibility to perform to the high standards this institution requires. I’m looking forward to working with both the coaches and players in the upcoming season to support the development of the club.”
2nd XV coach Chris Martin, currently a PE teacher at Madras College and former player for Howe of Fife RFC, had to say, “Being given the opportunity to become part of the team at St. Andrews is something I feel extremely privileged about. The culture of professionalism and the attention to detail that David has built up is incredible and it’s the type of environment you want to be part of as a coach. Since being forced to stop playing through injury, I’ve been waiting for the chance to express my passion for the game again and I’m now very excited to start working with the squad in August.”
The club would also like to thank departing 2nd XV coach Andrew Durward for his commitment to the club over the past four years, and wishes him well for his move to Edinburgh and engagement.
Building towards the 2016 Royal Bank of Scotland Scottish Varsity Match, the Saints are in very good hands to hit the ground running when they return for preseason in August.
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
What article would be correct here? A belief that / The belief that
Can I change the definite article in the following sentence and remain grammatical?
Once you adopt the belief that there's nothing you can do to change
something, you start to take a pernicious poison into your system.
I might mean that of all the beliefs someone might adopt you adopt one of them.
On this assumption, I might say ''There's a belief that there's nothing you can do etc.''
On the other hand, there might be only one belief that there's nothing you can do: the belief. If I can, what's the principle by which a native speaker chooses between the two? Thanks!
A:
Once you adopt the belief that there's nothing you can...
... is absolutely correct because you are specific about that belief. And, that is why it'd take the.
Again, you are right! Now, you are introducing that belief and that's why you can put an indefinite article. It's the same as you say - there's a place called Times Square. There is the belief somehow does not look idiomatic, at least to me.
|
{
"pile_set_name": "StackExchange"
}
|
Lymphoma in primary chronic cold hemagglutinin disease treated with chlorambucil.
Two patients with primary chronic cold hemagglutinin disease (CHAD) were treated with chlorambucil for ten and 7 1/2 years, with cumulative doses of 14 and 6.6 g, respectively. Both responded favorably, and malignant lymphoma eventually developed in both of them. An attempt to assess the incidence of lymphoma as part of the natural course of untreated CHAD failed for want of proof. Literature since 1970 reported no chlorambucil-associated lymphoma. Of 77 responses to a questionnaire mailed to 135 US hematology-oncology programs, 76 reported no examples of chlorambucil-associated lymphoma. One response, however, did relate that diffuse histiocytic lymphoma developed in three of 141 patients receiving prolonged chlorambucil therapy for polycythemia vera. Alkylating-agent therapy for CHAD might be associated with development of lymphoma.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Online Colleges in Arkansas
Online Arkansas Colleges and Universities
Are you thinking about pursuing an educational degree at a college in Arkansas? Are you not currently a resident of Arkansas, so you feel the need to do your homework in order to learn everything you can about what this state has to offer you? Have you already chosen your educational degree program and you want to be sure that a college in Arkansas will adequately prepare you for your future career path? If you said yes to each of these questions, then you won’t want to stop reading now. Below, you will find the most pertinent information regarding this wonderful state and all that it has to offer you in your educational pursuits.
Arkansas, which is known as the natural state, is home to three universities that are ranked among the top colleges in the United States. The southern state of Arkansas offers many geographical features, from areas of lowlands to regions of mountains. Within the landscape of the state of Arkansas you may have the chance to experience Hot Springs National Park, Buffalo National River, Fort Smith National Historic Site, and the Arkansas Post National Memorial.
One of the universities that you may want to consider is the University of Arkansas, which is located in Fayetteville. Along with being recognized for its great athletic programs, this university is also known for providing well-rounded degree programs in practically any field of study. Of particular interest at this university is the animal science degree programs, the poultry science degree programs, and the agricultural related programs. In addition, this university boasts a notable school of architecture, a school of business, a law school, and a doctoral program. A second viable option that you may want to consider as you pursue your educational path is the Harding University. This private, Christian college requires students to attend a chapel session each morning and to complete a daily devotion. It is important to note that this college may not have as many degree programs to offer their students as other traditional colleges or universities.
The third most popular educational option in the state of Arkansas is the University of Central Arkansas. This university, which boasts one of the most beautiful campuses, is located just north of Little Rock, in Conway, Arkansas. Although this university was founded to train aspiring teachers, in recent years it has expanded its academic curriculum to include practically any field of study that you can imagine. Within Arkansas, this university is quite well known for providing four campuses that each allow students to live on campus and attend school. Furthermore, University of Central Arkansas is also known for having a well-organized study abroad program that includes destinations such as China, Italy, and Africa. Although the University of Arkansas Little Rock is not noted as one of the top three universities in Arkansas, it does serve as the state’s only metropolitan college. Due to this fact, it is the second most popular educational choice based on enrollment. As with most universities, you can choose to study practically any field at this post-secondary school.
Accredited Online Colleges in Arkansas
Choosing a university can be a daunting task. It will be one of the most important decisions taken by someone, as it will shape up the future of the concerned person.
Choosing the right college depends on a lot of factors. For instance, you need to have the required grades to qualify for the college. Granted that requirement is met, the next step should be to choose the right place.
One of the most popular destinations for students seeking higher education is the United States of America. But being a huge country full of world class universities, students – both resident and international – often find it close to impossible to settle on any one of their choice. However, this task can be made much easier by first deciding on which state you prefer.
Arkansas is a great place to start. There are 24 institutions of higher education having four-year degree curriculums, and the great diversity in programs offered will interest every kind of student. In addition, there are lots of career opportunities in Arkansas, which makes studying here even more tempting. The different universities have different tuition costs, academic programs, and financial aid and scholarship options. To help you find the right university for you, we have devised a list consisting of some of the best universities in Arkansas.
University of Arkansas (UofA)
The University of Arkansas is one of the best colleges in Arkansas. It is a top-classified, Carnegie-endowed research university, and offers students 70 bachelor’s degree programs in fields such as liberal arts, business, agriculture, and other innovative options such as interior design and biological and agricultural engineering.
Over 26,000 students, from all over the world, enroll at UofA every year. Admission in this university will allow you to connect with more than 3000 fellow students, and learn from 700 amazing faculty. You can also enjoy benefits like the opportunity to study abroad, get research grants, and get special housing accommodation.
There are more than 50 centers for research and outreach on campus. Students are continually encouraged to conduct research on any topic of interest, with the findings being published bi-annually in the university’s Inquiry journal.
Some other bachelor’s degree programs offered by UofA include:Chemical Engineering
Students studying this degree program are given a broad and strong foundation in chemistry, physics, mathematics, economics, communication skills and the humanities. The courses cover topics such as thermodynamics, energy balances, fluid mechanics, reaction kinetics, heat and mass transfer, process control, computer methods, and other learning skills which are required of a practicing chemical engineer. This program also serves as an excellent preparation for dental, pharmacy, and law school.Accounting
This program provides students with a broad overall education, with solid basics in the common body of knowledge of business administration. The in-depth analysis of accounting helps students gain entry-level competence to pursuit a career in the business industry. Graduation in this program can also be followed by a Master of Accountancy degree, which is designed to convert the student from an apprentice to an accounting specialist. John Brown University (JBU)
Having a 5-mile mountain biking trail running along Sager Creek, JBU has a picturesque campus. The curriculum is rooted in the liberal arts, with degree options including the likes of Christian ministry and formation, art and illustration, and entrepreneurship. Moreover, arts students will find a wide range of performance opportunities with a variety of choirs, the Music Theater Workshop, and the Jazz Ensemble.
In addition to all the academic opportunities, student athletes and sports enthusiasts can get involved with club sport and intramural programs, and join the fantastic intercollegiate athletic teams.
Furthermore, The John Brown’s Leader Scholars Institute also offers a four year co-curricular program, which brings together the top academic performers and guides them to become strong leaders in their respective fields. JBU is known for producing students who have won a Fulbright Scholarship and been awarded the NASA Innovation Award for multi-robot design.
Some of the degrees students can enroll in include:Biochemistry
Students of this degree study organic and inorganic chemistry, as well as nanotechnology. In addition, they can conduct their own research, assist their faculties on research projects and work on community service projects related to their studies. They learn to solve real-world problems through significant laboratory experience, comprehensive classwork and research.Biblical and Theological Studies
This degree explores the foundation and the development of church history and prepares students for the ministry, seminary or graduate school. Original biblical languages are studied, as well as church history, faith philosophies, evangelical theology and the power of authentic church ministry. Central Baptist College
Founded in 1892, the Central Baptist College is one of the highest ranked colleges in Arkansas, and offers a Christian-based liberal arts education. It offers students 37 degree programs, with minors on fields such as the sciences, business, education, the arts and Biblical studies.
All programs offered by Central Baptist College are accredited by the Higher Learning Commission. Programs include not only the classical English or history, but also more modern, cutting-edge options such as molecular bioscience and multimedia communications.
This college houses more than 700 students and over 50 full-time faculty members. All necessities – such as campus safety resources, counseling services, chapel and spiritual events, and a student health clinic – are available on-campus. In addition to academics, students can partake in various activities throughout the year, such as sports events, themed parties, and movie nights.
Degrees offered include the likes of Biology, Psychology, Management, and Journalism, all of which prepare and enable the students to pursue careers in the ministry, serve in the mission field, or explore the business world. University of Arkansas – Fort Smith (UAFS)
UAFS was founded in 1928, and started its journey as a junior college with just 34 students. Today, it is a member of a group of Arkansas colleges that are part of the University of Arkansas system.
UAFS currently houses almost 7,000 students and offers a wide range of bachelor’s degrees in the arts and sciences. These degrees include innovative options like imaging sciences and animation technology, as well as professional programs like international business and organizational leadership.
UAFS graduates have a 100% record of establishing full-time careers or being accepted into graduate school after graduation. This gives potential students further incentive to choose UAFS. With an 18-1 students-professor class ratio, all class discussions are incredibly in-depth and meaningful. Moreover, freshmen scholarship recipients get an invitation to attend a UAFS Scholars Day held in collaboration with the Undergraduate Research Symposium, which offers students the chance to go through distinct research avenues and projects.
Some popular degree options students can enroll in include:Animation Technology
The Bachelor of Science in Animation Technology prepares students to practice and manage a wide range of operations related to computer graphics. Graduation in Animation Technology allows students to pursue careers in Applied Animation, State and National Parks, TV Stations, Video Game Companies, Medical Animations and 3D Mapping.Applied Science Degree
This four-year program is designed to help students open avenues for professional development, personal growth and career advancement. The curriculum focuses on the application of industrial management principles and strategy, diversity, teamwork, problem-solving and critical thinking for making decisions. Graduating in this program enables students to launch new business ideas and succeed in management positions.Hendrix College
Hendrix College is located in Conway, Arkansas, and is one of the best private liberal colleges in the state. It takes pride in its campus traditions – everything from student birthday celebrations to its famous Shirttails dance competition.
Hendrix College offers degree programs in the arts and sciences, making it impossible for students not to find a subject they like. Freshmen participate in The Collegiate Center, which is a general education curriculum that includes interdisciplinary courses designed to provide students with the knowledge and skills needed to develop into fully capable citizens.
Sophomores and upper-level students can pursue advanced study in literature and language with the help of the Murphy Scholars program. This allows them to go abroad for advanced studies, and correspond with distinguished writers, editors and translators.
Some of the most popular degree options studied at Hendrix College include:Neuroscience
This degree is related to the unique and interdisciplinary study of the development, organization and function of the nervous system, and how it is related to behavior and cognition in humans and animals. Students get an extensive integration of knowledge from several levels of analysis, and background study on biology, chemistry, psychology, philosophy and computer science. This diversity, along with research experience in the field, allows students to pursue their own interests in biochemical, cognitive-philosophical, behavioral-psychological, or even artificial intelligence specialization.Environmental Studies
The Environmental Studies program provides students with an integrated and interdisciplinary focus. It combines the strength of the natural sciences, social sciences, and humanities to make the students fully prepared to go out into the world and hit the ground running. This program teaches students to understand the structure and dynamics of the natural world, the ways in which humans belong to and interact with nature, and explore forms of sustainable community life.
The core topics of this degree program prepares students for graduate programs in Environmental Studies or other related fields, while the electives allow students to specialize in their individual interests. Arkansas Tech University
Arkansas Tech University is ranked among the very best universities in Arkansas. In addition to engineering and the applied sciences, it also offers bachelor’s degrees in business, education, the arts and humanities, and health sciences.
Arkansas Tech University’s diverse and global student body has a dedicated International and Multicultural Student Services Office to call on for any kind of help. Students can participate in the Global Connect program and mentor an international student. Freshmen are greeted with a Bridge to Excellence Freshman Mentoring Program, which assigns volunteer staff as their mentors during the first semester.
Some degree programs offered by Arkansas Tech University include:Electrical Engineering
This four-year degree program is accredited by the Engineering Accreditation Committee of ABET. It is one of only three accredited electrical engineering programs available at public institutions. Students get hands-on experience of many courses and lab projects, with graduates going on to pursue careers in fields such as the power industry, military contractors, robotics, etc. Economics and Finance
This degree teaches students economic and financial concept applications and relationships, relevant business verbiage, and financial decision making in addition to critical thinking and oral and written communication skills. Numerous organizations and resources help the students all the way.
Scholarships for Students in Arkansas
In addition to offering fantastic degree programs, all of the aforementioned universities offer various scholarships to aid the education of the students. Some of these scholarships include:The Presidential Scholarship (John Brown University)
Every year, five applicants who achieved outstanding academic performances are awarded the Presidential Scholarship. To qualify for this scholarship, applicants must meet the following requirements:
• ACT composite score of 29 or SAT 1280
• High school CGPA of 3.9 or above (on 4.0 scale)
• Leadership potential
This scholarship is fully renewable with a CGPA of 3.2.The Chancellor Scholarship (John Brown University)
This scholarship is awarded to forty-five applicants every year, who have demonstrated outstanding academic achievements. The qualifying requirements for this scholarship are as follows:
• ACT composite score of 29 or SAT 1280
• High school CGPA of 3.7 or above (on a 4.0 scale)
• Leadership potential
This scholarship is fully renewable with a CGPA of 3.2.Institutional Scholarships (Central Baptist College)
This scholarship is available in two categories: Category 1 and Category 2.
Category 1 covers the following:
Academic
• Tuition fees (varies from $2,250 to Full Tuition)
• Applicants must have a minimum ACT score of 19 and GPA of 2.5
Athletic
• The amounts vary, and are at the discretion of the Athletic department
• Applicants must meet admission criteria
GMA
• Awarded to the National Miss GMA
Category 2 covers the following:Legacy Scholarship
• Applicable only for those who have at least one parent or grandparent to have graduated from Central Baptist College, and is a current member of the Central Baptist College Alumni Association
• $500 per year or $250 per semester for up to 8 semesters
• Applicants must maintain a minimum GPA of 2.5 and enroll in a minimum of 12 hours per semester
Multiples Scholarship
• Applicable for twins, triplets, etc. who are attending Central Baptist College concurrently
• In case of twins, each will receive a tuition discount of 25%
• In case of triplets, each will receive a tuition discount of 30%
• In case of quadruplets, each will receive a tuition discount of 35%
• Recipients must maintain a minimum GPA of 2.5 and enroll in at least 12 hours per semesterSibling Scholarship
• Applicable only for siblings attending Central Baptist College concurrently
• $1,000 per year or $500 per semester per sibling for up to 8 semesters
• Recipients must maintain a minimum GPA of 2.5 and enroll in at least 12 hours per semester
Career Opportunities in Arkansas
There are plenty of career opportunities across Arkansas in both the public and the private sector. Graduating from any of these colleges will no doubt give students a massive boost in their hunt for stability in the job market, and establish their careers. Some potential careers include:Microbiologist
This line of work is most suited for those who graduate from a biology-based degree. It will require the concerned to perform all job functions safely, while complying with corporate policies and procedures. This position works with the site and staff to provide technical Quality support, perform Quality microbiological testing, conduct GMP and GLP audits and support the verifications and validations of equipment sanitization. Candidates will also be responsible for keeping track of microbiological data, investigating deviations, and overseeing improvements based on the results of their analysis.
The required educational qualifications and experience are as follows:
- Bachelor’s degree in Microbiology with at least 2 years of post-graduate experience in any microbiology related field
- 2 years of aseptic Quality Lab operation experience in a manufacturing or medical environment
- 2 years of Cosmetic Regulatory compliance
- Good understanding of Lab practices and regulations
- Strong analytical, communication, and computer skillsEnvironmental Engineer
Perfect for those who have studied environmental science and engineering, this position requires the candidate to perform the following:
- Assist with the management of environmental restoration and remediation programs
- Provide expertise in restoration and remediation
- Provide oversight and management of other environmental activities
The qualifications needed for this position are as follows:
- Bachelor’s degree or higher in Environmental Engineering or a closely related field
- Minimum of 5 years compliance, remediation and restoration experience
- Exceptional consultation, organization and communication skills (both oral and written)
- Strong problem solving and critical-thinking skillsBusiness Consultant
This position requires candidates to have graduated from a business-oriented degree. The required duties include:
- Research of the client’s business and industry to offer an alternative option or view
- Construction of visual models during meetings
- Organizing workshop logistics
- Documenting workshop outputs
- Facilitating part of the workshop
Educational requirements and experience needed are:
- Bachelor’s degree in Business
- 5 years’ experience in commercial or public sectorFinancial Services Specialist
This position is generally viewed as the expert in areas of branch sales and service. Primary responsibilities include:
- Excellent customer service and communication skills
- Ability to work under high pressure with immaculate attention to detail
- Meet and exceed branch sales quotas by identifying customer demands
- Referring clients to other businesses when potential need is recognized
The requirements that must be met for this position are:
- Bachelor’s degree in Business, Finance or other closely related fields
- Two years’ sales experience
- Strong computer skills
- Excellent communication skillsEnvironmental Program Associate
Another position which requires higher education in the Environmental Sciences. The duties include:
- Perfect coordination with project leaders and/or other supervisors
- Effective contributions to program design, conceptual framework, result dissemination, educational activities and the pursuit of extramural financial support
- Field activities in irrigation water management
- Repair and installation of irrigation equipment, planting and harvesting crops
- Retrieval of information from data logging equipment
- Data summarization and analysis of field experiments
- Training farmers and other trainers about Irrigation Water Management Practices
- Troubleshooting and design of irrigation system and components
This job requires the applicant to have the following qualifications:
- Bachelor’s degree in Mechanized Systems Management, Agriculture, Environmental Science, Agriculture Technology Management, Agronomy, Soil Science, Crop Science or other related field
- Three years’ related professional work experience
- Excellent written and verbal communication skills
- Strong proficiency in operating Microsoft Office applications, email programs and data management
- Ability to develop and deliver presentations
- Ability to make sound judgments and work independently
- Respond to the needs of the clients, subordinates and supervisors
In short, Arkansas is a state full of wonderful options for both higher education and career opportunities. Choosing a college will be much easier now thanks to this list, and the potential career opportunities are just waiting for you to pursue.
|
{
"pile_set_name": "Pile-CC"
}
|
Back in December, you hopefully thoroughly immersed yourself in The Map of Physics, an animated video--a visual aid for the modern age--that mapped out the field of physics, explaining all the connections between classical physics, quantum physics, and relativity.
You can't do physics without math. Hence we now have The Map of Mathematics. Created by physicist Dominic Walliman, this new video explains "how pure mathematics and applied mathematics relate to each other and all of the sub-topics they are made from." Watch the new video above. You can buy a poster of the map here. And you can download a version for educational use here.
Would you like to support the mission of Open Culture? Please consider making a donation to our site. It's hard to rely 100% on ads, and your contributions will help us continue providing the best free cultural and educational materials to learners everywhere.
Also consider following Open Culture on Facebook and Twitter and sharing intelligent media with your friends. Or sign up for our daily email and get a daily dose of Open Culture in your inbox.
Related Content:
Free Online Math Courses, a subset of our collection, 1,500 Free Online Courses from Top Universities
Free Math Textbooks
Mathematics Made Visible: The Extraordinary Mathematical Art of M.C. Escher
Citizen Maths: A Free Online Course That Teaches Adults the Math They Missed in High School
|
{
"pile_set_name": "OpenWebText2"
}
|
LOS ANGELES (AP) — A gigantic new Disney studio planned for oak-studded ranchland north of Los Angeles has won the approval of Los Angeles County — a milestone in the effort to build the half-million square feet of new production space in a state hard hit by runaway production.
County supervisors signed off on Tuesday on the Golden Oak Ranch project in the Santa Clarita Valley, although it still needs state and federal approval, the Los Angeles Times reported (http://lat.ms/147bZM0 ).
Disney/ABC Studios has spent the past four years attempting to build a high-tech production center in the area that Walt Disney selected decades ago to be the backdrop for his movies and television shows.
Rural and a short drive from major studios, the site has been depicted as a jungle, the Old West and other locations in productions such as "Old Yeller," ''Beverly Hills 90210" and "Pirates of the Caribbean: At World's End."
Golden Ranch would be one of the largest studio developments in more than a decade, with six pairs of soundstages along with shops, prop and costume storage areas, offices, writers' bungalows and a commissary.
Disney estimates the project would create $533 million a year in economic activity — a healthy jolt as California fights runaway production that has cost it more than 36,000 jobs since 1997, according to a 2010 Milken Institute Report.
"Many of the film production companies are now going out of state," Supervisor Michael D. Antonovich said before the 4-0 vote. "This is an opportunity to increase film production in Los Angeles County."
A handful of environmentalists testified against the project, voicing concerns about pollution, loss of wildlife habitat and the need to cut down 158 oak trees. However, more than 100 supporters were on hand, including nearby residents and business and political leaders.
Disney said the 58-acre development will cover less than 7 percent of the 890-acre Golden Oak Ranch property. Disney plans to retain most of the natural settings.
Despite runaway production, local demand for studio space remains high. TV shows, commercials and new media productions financed by companies such as Netflix and Amazon have helped keep the average occupancy rate for Los Angeles County soundstages at 70 percent to 90 percent, said Carl Muhlstein, managing director for Jones Lang LaSalle, a global real estate service provider.
ABC, which produces 14 to 18 TV shows at any given time in the Los Angeles area, has outgrown the space at its studio in nearby Burbank and rents other soundstages to accommodate the work.
|
{
"pile_set_name": "Pile-CC"
}
|
I think we all have heard a story about three little pigs. But this furry xxx comics shows us the story from quite another point of view! The matter is that the bad wolf actually got his paws on all three piggies and cruelly punished them! And one more thing to make it real fun – all of the characters were actually furry females! So that’s when this storry turns into a wild lesbian orgy – the bad wolf bitch ties the piggie who made her house of straw, cuffs the second sexy piggie, who made her house of sticks, and gives real hell to the third one! This furry porn comics is a real pussy massacre!
Some more fury gays for today. This time you’ll witness an incredible BDSM action starring handsome wolves who are involved in a kinky threesome. A master teaches his two slaves how to behave by tying them up and closing their eyes, making them lick each other’s cocks and beg him for mercy. Their sexy leather suits fit very close to their muscled figures, and their furry dicks are squeezed by tight rings to keep them up – that makes this furry BDSM a real masterpiece!
|
{
"pile_set_name": "Pile-CC"
}
|
845 F.2d 1014
128 L.R.R.M. (BNA) 2567
National Labor Relations Boardv.Eatontown Senior Care Center, Inc., Health Care Housekeeping Systems
NOS. 87-3568, 87-3607
United States Court of Appeals,Third Circuit.
MAR 01, 1988
1
Appeal From: N.L.R.B.
2
ORDER ENFORCED.
|
{
"pile_set_name": "FreeLaw"
}
|
WILMINGTON, Vt. — Just after sundown on a Thursday in early December, Chris Harrison — host of “The Bachelor” and its spinoffs — stood in a mountaintop lodge in this Vermont ski town. The cavernous room had been draped in the fashion typical to “Bachelor” cocktail parties; candles burned, sequined pillows beckoned, and a stocked bar stood at the ready. Mr. Harrison’s eyes scanned a cluster of sofas, all of them at that moment, empty.
“Who’s not here for the right reasons?” he said, invoking a “Bachelor” catchphrase as he looked out intensely at no one.
Mr. Harrison was rehearsing a scene for the ABC series, “The Bachelor Winter Games,” in which he would ask the cast to choose someone to send home that night. His script was familiar to any fan of the franchise, except for a tweak to the ending. Tonight, Mr. Harrison went on, the eliminated contestants would be “on a plane — back to whatever country you came from.”
“Winter Games” — which will debut Feb. 13, in direct opposition to NBC’s prime-time coverage of the Winter Olympics in South Korea — combines 26 alumni from both domestic and international versions of “The Bachelor” and “The Bachelorette.” The twist is a first for the franchise, and a gamble. “Bachelor” shows tend to feature the same faces, with talent hopping from one of the flagship shows to the other, then surfacing again on a spinoff, like the bacchanalian “Bachelor in Paradise.” With “Winter Games,” the franchise is challenging a fan base not particularly open to change to embrace a cast filled with contestants from outside the United States (and some who don’t speak much English).
|
{
"pile_set_name": "OpenWebText2"
}
|
Q:
How does this javascript object array work?
I am trying to understand something very basic. If I have an object like this:
var topics = {}
And I do this:
topics[name] = ["chapter 1", "chapter 2", "chapter 3"];
When I log this object, I don't see the name attribute. What have I done exactly? Have I created a key called name with the value of an array?
Of course I know I can do that by just doing
topics.name = ["chapter 1", "chapter 2", "chapter 3"];
But then what is this doing?
topics[name] = ["chapter 1", "chapter 2", "chapter 3"];
Could someone please clarify?
A:
Your are creating a property on the object with a name based on the value of the name variable. If you want to create a property called name in that way you need to do:
topics["name"] = ["chapter 1", "chapter 2", "chapter 3"];
A:
When you use the [] notation it expects an expression in between, that translates to a string.
Using name not enclosed in quotes 'name' it assumes you are using a variable called name.
Which in your case is undefined.
The correct usage would be
topics["name"] = ["chapter 1", "chapter 2", "chapter 3"];
If you want to use a variable you can do things like
var prop = 'name';
var topics = {};
topics[prop] = ["chapter 1", "chapter 2", "chapter 3"];
this will create the name property on the object.. useful for dynamic/automatic creation/filling of objects..
A:
That should generate an error, unless you have variable name defined as a string or a number.
These three are equivalent:
var name = "key";
topics[name] = "value";
topics["key"] = "value";
topics.key = "value";
|
{
"pile_set_name": "StackExchange"
}
|
Sequence of the DNA-binding protein gene of a human subgroup B adenovirus (type 7). Comparisons with subgroup C (type 5) and subgroup A (type 12).
The adenovirus type 7 (Ad7) single-stranded DNA-binding protein (DBP) structural gene has been sequenced and located between 66.7 and 62.3 map units. This region codes for a protein that contains 517 amino acid residues with a calculated molecular mass of 58,240 daltons. We compared the Ad7 amino acid sequence with those reported for the Ad5 (Kruijer, W., van Schaik, F.M.A., and Sussenbach, J.S. (1981) Nucleic Acids Res. 9, 4439-4457) and Ad12 (Kruijer, W., van Schaik, F.M.A., Speijer, J.G., and Sussenbach, J.S. (1983) Virology 128, 140-153) DNA-binding proteins. A greater amount of amino acid sequence homology was found in the carboxyl-terminal DNA-binding domain of the molecule. This homology is 61% between Ad7 and Ad5 and 49% when Ad12 was included in the comparison. The NH2-terminal domain of DBP retained a 49% homology between Ad7 and Ad5 and a 23% homology for all three serotypes. The greatest difference between the Ad7 and Ad5 DBPs is the absence, in the Ad7 protein, of 12 amino acids located between the two functional domains in the Ad5 protein (amino acids 151-162). In addition, three regions of high amino acid conservation between Ad5, Ad7, and Ad12 consisting of 9 (178-186), 9 (322-330), and 12 (464-475) consecutive amino acids (numbers refer to Ad5) in the DNA-binding portion of the molecule were revealed. These three regions contain a centrally located basic amino acid (183, 326, and 470) as well as an aromatic amino acid residue (181, 324, and 469). Since basic and aromatic amino acids have been implicated in other single-stranded DNA-binding protein/DNA interactions (Anderson, R.A., Nakashima, V., and Coleman, J.E. (1975) Biochemistry 14,907-917; Kowalczykowski, S.C., Lonberg, N., Newport, J.W., and von Hippel, P.H. (1981). J. Mol. Biol. 145, 75-104), these three conserved regions may represent DBP/DNA contact points.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
MARY'S OPINION HEADING
NO.
12-05-00206-CR
IN THE COURT OF APPEALS
TWELFTH COURT OF APPEALS
DISTRICT
TYLER,
TEXAS
TIMOTHY WHITLOCK, § APPEAL
FROM THE 241ST
APPELLANT
V. § JUDICIAL
DISTRICT COURT OF
THE
STATE OF TEXAS,
APPELLEE § SMITH
COUNTY, TEXAS
MEMORANDUM
OPINION
A jury convicted Appellant of the third degree felony of
tampering with physical evidence.
Appellant pleaded true to the two enhancement allegations contained in
the indictment, and the jury assessed his punishment at imprisonment for forty
years. Appellant presents two issues
challenging the legal and factual sufficiency of the evidence to support his
conviction. We affirm.
Background
Arp City Marshal, Stacy Langlinais, stopped Appellant for
a speeding violation. When she questioned
Appellant about his ability to pay an outstanding traffic warrant, he reached
in his pocket, and something fell from his pocket that appeared to the officer
to be a marijuana cigarette. When she
asked “[w]hat is that,” Appellant responded, “Oh my God,” snatched up the item
from the ground, and ate it. Appellant
began to vomit, and Langlinais called EMS (Emergency Medical Services), but
Appellant refused treatment. Langlinais
examined the vomit, but could not distinguish the object that Appellant had
just eaten. While being transported
between the jail and court by Smith
County Transport Officer April Ishee, Appellant volunteered the following: “Man,
I was drunk. A joint fell on the
ground. I bent down, picked it up, and
ate it. I ate half a joint.” Ishee testified that she did not ask
Appellant any questions and that Appellant simply volunteered the statement.
Appellant did not testify. At the punishment phase, the State presented
evidence that Appellant had three prior felony convictions and eight prior
misdemeanor convictions.
Legal and Factual Sufficiency
In his two issues, Appellant contends the evidence is
legally and factually insufficient to support his conviction.
Standard of Review
The standard for reviewing a legal sufficiency challenge
is whether, viewing the evidence in the light most favorable to the jury’s
verdict, any rational trier of fact could have found the essential elements of
the offense beyond a reasonable doubt. Jackson
v. Virginia, 443 U.S. 307, 318-19, 99 S. Ct. 2781, 2788-89, 61 L. Ed.
2d 560 (1979); see also Johnson v. State, 871 S.W.2d 183, 186
(Tex. Crim. App. 1993). In the
relatively recent case of Zuniga v. State, 144 S.W.3d 477 (Tex.
Crim. App. 2004), the court of criminal appeals explained the factual sufficiency
standard.
There
is only one question to be answered in a factual-sufficiency review:
Considering all of the evidence in a neutral light, was a jury rationally
justified in finding guilt beyond a reasonable doubt? However, there are two ways in which the
evidence may be insufficient. First,
when considered by itself, evidence supporting the verdict may be too weak to
support the finding of guilt beyond a reasonable doubt. Second, there may be both evidence supporting
the verdict and evidence contrary to the verdict. Weighing all the evidence under this
balancing scale, the contrary evidence may be strong enough that the
beyond-a-reasonable-doubt standard could not have been met, so [that] the
guilty verdict should not stand. This
standard acknowledges that evidence of guilt can “preponderate” in favor of
conviction but still be insufficient to prove the elements of the crime beyond
a reasonable doubt. Stated another way,
evidence supporting guilt can “outweigh” the contrary proof and still be
factually insufficient under a beyond-a-reasonable-doubt standard.
Id. at
484-85.
Applicable Law
Subsection 37.09(a)(1) of the Texas Penal Code provides,
in part, as follows:
(a)
A person commits an offense, if, knowing that an investigation or official
proceeding is pending or in progress, he:
(1)
alters, destroys, or conceals any record, document, or thing with intent to
impair its verity, legibility, or availability as evidence in the investigation
or official proceeding; . . .
Tex.
Pen. Code Ann. § 37.09(a)(1) (Vernon 2003).
The statute requires that the defendant know that an
investigation is “pending” or “in progress” when he or she alters, destroys, or
conceals the evidence. As used in the
statute, the terms “pending” and “in progress” are not synonymous. Lumpkin v. State, 129 S.W.3d
659, 663 (Tex. App.–Houston [1st Dist.] 2004, pet. ref’d). “Pending” means “impending or about to take
place. Id.; see also Model Penal Code § 241.7.
Discussion
It is undisputed that Appellant destroyed or concealed a
marijuana cigarette by swallowing it.
The question remaining is did Appellant act knowing that an
investigation was pending or in progress.
Appellant contends that at the time he ingested the marijuana, the
officer’s investigation concerned only a speeding violation and an outstanding
warrant for running a stop sign and that the marijuana he ate was not relevant
to any investigation then pending or in progress. We disagree.
After he was stopped for speeding and after the
subsequent discovery of the outstanding traffic warrant, Appellant reached in
his right front pocket. Officer
Langlinais testified that when Appellant withdrew his hand from his pocket, she
noticed an object fall to the ground that she believed was a marijuana
cigarette. She told the jury that at
that time the focus of her investigation shifted to Appellant’s possible
possession of marijuana. She immediately
shined her flashlight on the “joint” and asked, “What was that?” Appellant said, “Oh my God,” scooped the
cigarette off the ground, and ate it.
Very shortly thereafter, Appellant began to choke and then vomited on
the roadside.
Appellant maintains the facts in his case are similar to
those in Pannell v. State, 7 S.W.3d 222, 223 (Tex. App.–Dallas
1999, pet. ref’d), and that the resolution of the question of his knowledge
that an investigation for possession of marijuana was pending or in progress is
governed by the holding in that case. In
Pannell, a police officer attempted to stop the defendant for
speeding in a school zone. Id. at
223. When the officer turned on his
emergency lights, he saw Pannell throw what he thought was a cigarette out of
the window and then observed Pannell empty the contents of a baggie out of the
car window. Id. When Pannell stopped his car, he admitted to
the officer that he had thrown a marijuana cigarette out of his car window and
that the plastic bag he emptied had contained marijuana. Id. The court of appeals reversed Pannell’s
conviction for destroying evidence, reasoning that when Pannell threw the
marijuana from his car, the officer was investigating only a speeding
violation. Id. at
224. Because there was then no
investigation pending or in progress in which the marijuana would have served
as evidence, there was no evidence that Pannell destroyed the marijuana knowing
that an investigation was pending or in progress. Id.
In this case, Officer Langlinais’s investigation of
Appellant’s traffic violation was complete.
There is abundant evidence that from the moment Officer Langlinais saw
the joint fall from Appellant’s pocket, Appellant realized her investigation
related to his possession of marijuana.
When she questioned him about the cigarette, he quickly picked up the
evidence relevant to the investigation and ate it.
Measured against the appropriate standards of review, the
evidence is both legally and factually sufficient to support Appellant’s
conviction. Appellant’s first and second
issues are overruled.
Disposition
The judgment is affirmed.
BILL BASS
Justice
Opinion
delivered June 21, 2006.
Panel
consisted of Worthen, C.J., Griffith, J., and Bass, Retired Justice, Twelfth
Court of Appeals, Tyler, sitting by assignment.
(DO NOT PUBLISH)
|
{
"pile_set_name": "FreeLaw"
}
|
In over-the-air (OTA) and cable television distribution systems, television signals may be encoded in analog and/or digital formats. The encoded signals may then be modulated into a channel using digital or analog modulation. Different regions of the world use different transmission standards, which dictate the parameters of transmitted television signals. For example, in North America television signals may be transmitted OTA in the analog NTSC (National Television System Committee) format and/or the digital ATSC (Advanced Television Systems Committee) format. In addition, television signals may be transmitted through cables that connect to a television or associated set-top box. For example, many cable systems use QAM (Quadrature Amplitude Modulation), which includes variants such as 64-QAM, 256-QAM, etc.
In most television distribution systems, the available bandwidth is divided into channels, where each channel is allocated approximately 6-8 MHz of bandwidth. Each channel may include a digital or analog signal (or no signal). FIG. 1 is a graph of a frequency spectrum with channels 101-106. Channels 101 and 105 are analog channels, channels 103 and 106 are digital channels, and channels 102 and 104 have no signal.
Television receivers may include set top boxes, integrated televisions, video capture devices, personal video recorders, and/or other devices such as general purpose computers with software and/or hardware for tuning, demodulating and/or decoding television signals. FIGS. 2 and 3 show conventional arrangements 200 and 300 for demodulating and decoding multiple television formats. In FIG. 2, digital demodulator 220 and analog demodulator 221 receive tuned signals (e.g., intermediate frequency signals and/or digital samples) from separate radio frequency processors 210 and 211, respectively. Radio frequency processors 210 and 211 both generally tune a radio frequency channel (e.g., a band of frequencies such as band 101, 102, 103, etc. in FIG. 1), and may further process the tuned signal (e.g., to produce digital samples of the tuned channel). Demodulators 220 and 221 provide a demodulated signal to signal decoder/image processor 230 for further processing. In FIG. 3, digital demodulator 320 and analog demodulator 321 receive tuned signals from a single radio frequency processor 310.
Television receivers often need to scan a number of radio frequency channels when they are first set up (or when they are reconfigured) to initialize channel parameters. The setup scan may be used, for example, to set up a list of available channels, to pre-determine whether the channel is analog or digital, and/or to pre-determine other characteristics of each channel to enable faster signal acquisition when a user selects a channel to display.
FIG. 4A shows a graph 400 of times to scan a channel with a digital demodulator (e.g., digital demodulator 220 or 320). Time 401 represents an exemplary length of time Tacq_dtv for acquiring a digital television signal (e.g., when the channel does contain a digital signal). Time 402 represents an exemplary length of time Tout_dtv for the digital demodulator to time out when the signal cannot be demodulated (e.g., when the channel contains an analog television signal). Time 403 represents an exemplary length of time Tout_lowpwr_dtv for the digital demodulator to time out when no signal is present.
Similarly, FIG. 4B shows a graph 410 of times to scan a channel with an analog demodulator (e.g., analog demodulator 221 or 321). Time 411 represents an exemplary length of time Tacq_atv for acquiring an analog television signal (e.g., when the channel does contain an analog signal). Time 412 represents an exemplary length of time Tout_atv for the analog demodulator to time out when the signal cannot be demodulated (e.g., when the channel contains a digital television signal). Time 413 represents an exemplary length of time Tout_lowpwr_atv for the digital demodulator to time out when no signal is present.
Conventional receivers generally scan a range of frequencies by attempting to scan each channel using a first mode (e.g., using a digital demodulator) and then using a second mode (e.g., using an analog demodulator) if the first mode fails. FIG. 4C shows a flowchart showing conventional television signal acquisition timing. A receiver may, for example, scan a first channel (e.g., channel 101) during time period 421, a second channel (e.g., channel 102) during time period 422, etc.). For each channel, the receiver first tries to scan the channel digitally and, if the digital scan fails, the receiver tries to scan the channel as an analog channel. Thus, the total time to scan channels 101-106 would be (2*Tacq_dtv)+(2*Tout_dtv)+(2*Tacq_atv)+(2*Tout_lowpwr_dtv)+(2*Tout_lowpwr_atv). Television receiving components are often benchmarked and compared based on channel scan time and stability. Therefore it is desirable to reduce the amount of time spent scanning channels in a mixed-format environment without sacrificing stability.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Taxi Enquiry
Road direction to reach from Delhi to Kanpur by car:
Delhi to Kanpur Taxi
Are you looking taxi from Delhi to Kanpur? Then Delhi to Kanpur Taxi is best answer for your choice. For your information the distance between Delhi to Kanpur is 467 km. We offer a wide range of cars and luxury Buses to our customers for giving them the best of comforts.
We are providing our services 24 hours in a day and 365 days a year for our customers.
We are a taxi service company providing car, taxi, bus and Tempo Traveller services to the people India.
Delhi to Kanpur Taxi is one of the most experienced and recognized names in the travel industry. We provided the cab rental services in Kanpur, Delhi, Chandigarh, Jaipur, Agra, Dehradun, Haridwar, Mussoorie, Shimla and many more cities. We have built our business on trust and honesty.
We are only player to offer complete 360 degree solutions to completely transform from Delhi to Kanpur and Kanpur to Delhi. We are one-stop centre for all Car Rental needs with safety, security and customer satisfaction.
|
{
"pile_set_name": "Pile-CC"
}
|
EAST HAVEN, Conn. (AP) - The West Nile virus has been detected in Connecticut for the first time this season.
The state’s Mosquito Management Program announced Thursday that three mosquitoes trapped in East Haven tested positive for the potentially deadly virus.
Philip Armstrong, a medical entomologist with the Connecticut Agricultural Experiment Station, says West Nile is typically detected in mosquitoes from late-June to mid-July so this year’s detection is later than usual. He says further buildup of the virus from now through September is expected.
The West Nile virus has been detected in Connecticut every summer for the past 30 years.
There were 23 human cases of West Nile last year, with one fatality.
Authorities encourage residents to cover skin and use insect repellent, especially at dusk and dawn, to protect against the virus.
Sign up for Daily Newsletters Manage Newsletters
Copyright © 2020 The Washington Times, LLC.
|
{
"pile_set_name": "OpenWebText2"
}
|
As a junior in college, Delaney Dunne took an internship for class credit and $10 an hour at co-working company TekMountain in Wilmington, N.C.
On graduation day this year, she received a letter from TekMountain’s parent asking about her employment status and reminding her she had signed a noncompete agreement with TekMountain in November 2017 that restricted her employment options.
“I burst into tears hours before I was set to graduate from college,” Ms. Dunne, 22, said. “That noncompete (agreement) that I signed when I was 20 years old was still haunting me.”
Internships have long been an opportunity for inexperienced workers to try out different industries and build valuable contacts. For companies, it is a way to attract future talent.
But increasingly interns are being asked to sign noncompete, nondisclosure and forced arbitration agreements, restrictions once reserved for higher-ranking employees.
|
{
"pile_set_name": "OpenWebText2"
}
|
NoiseHush AS10 3.5mm Audio Splitter for BlackBerry Bold 9000
Want it by Monday, December 12? Order in the next 5 hours and 48 minutes & upgrade to Next Day Shipping.
Product Description
The NoiseHush AS10 3.5mm Audio Splitter is designed to connect two stereo headphones into a single stereo jack.
Ideal for mobile/smartphone, MP3 and DVD Players, or laptop computers equipped with a 3.5mm port. Its 19-inch flat cable design keeps your cable managable and tangle-free. Now you can enjoy your music or movies with a friend!
|
{
"pile_set_name": "Pile-CC"
}
|
An investment of $1000 will be put in a legal trust for 500 years.Assuming a modest 4% annual return, the investment will be approximately 328 billion dollars in the year 2515, at which point it will be spent on scientific research and the construction of a time machine. First stop for the time machine will be 2015 with a reception for the time travelers.
Over the past two decades, what have the U.S. trends been for the following important measures of social health: high school dropout rates, college enrollment, juvenile crime, drunken driving, traffic deaths, infant mortality, life expectancy, per capita gasoline consumption, workplace injuries, air pollution, divorce, male-female wage equality, charitable giving, voter turnout, per capita GDP and teen pregnancy?
The answer for all of them is the same: The trend is positive. Almost all those varied metrics of social wellness have improved by more than 20% over the past two decades. And that's not counting the myriad small wonders of modern medicine that have improved our quality of life as well as our longevity: the anti-depressants and insulin pumps and quadruple bypasses.
Income inequality has a snowballing effect on the wealth distribution: top incomes are being saved at high rates, pushing wealth concentration up; in turn, rising wealth inequality leads to rising capital income concentration, which contributes to further increasing top income and wealth shares. Our core finding is that this snowballing effect has been sufficiently powerful to dramatically affect the shape of the U.S. wealth distribution over the last 30 years.
|
{
"pile_set_name": "Pile-CC"
}
|
If you have been watching Kathleen Lights for a while now, you will know her love for Nail Polish!! So guess what now she has come out with her own line of polish called the “KL Polish”, it is cruelty-free, USA-made nail polish line that she has created. As of right now she just launched six on-trend lacquers as part of her line KL Polish in available NOW for preorder on KL Polish.com in the colors- Zoey, Gumption!, Snickerdoodle, Brick Sidewalk, Carmello, and Broccoli & Chocolate.
Shhh…She had been snapping and tweeting, sneek peeks about something that was coming out that she had been working on for a while and was close to her heart. Well now we know what she was talking about…her own freaking line of NAIL POLISH!!!
I'm JUST gonna leave this picture of some of my favorite fall red polishes right here for you………………………………………………………………….….…………………………………………………………………………………………………………….. #staytuned #ThatsAllImAllowedToSay #thatsallicanshowyou A photo posted by kathleenlights (@kathleenlights) on Nov 1, 2016 at 1:22pm PDT
She had been posting a lot of her nail polish photos on her Instagram and now it is confirmed why!
The five chic & beautiful KL Nail Polishes are –
Gumption!
“I actually named it this because of the movie The Holiday.”
Brick Sidewalk
The KL Polishes will be sold exclusively on KLPolish.com for $8.50. (The pre-sale for the December 5 launch date starts today!) I know I have my eyes on Snickerdoodle & Zoey for sure! What about you?
|
{
"pile_set_name": "OpenWebText2"
}
|
---
abstract: |
The [*disjointness graph*]{} $G=G({\cal S})$ of a set of segments ${\cal S}$ in ${{{\mathbb R}}}^d$, $d\ge 2,$ is a graph whose vertex set is ${\cal S}$ and two vertices are connected by an edge if and only if the corresponding segments are disjoint. We prove that the chromatic number of $G$ satisfies $\chi(G)\le(\omega(G))^4+(\omega(G))^3$, where $\omega(G)$ denotes the clique number of $G$. It follows, that $\cal S$ has $\Omega(n^{1/5})$ pairwise intersecting or pairwise disjoint elements. Stronger bounds are established for lines in space, instead of segments.
We show that computing $\omega(G)$ and $\chi(G)$ for disjointness graphs of lines in space are NP-hard tasks. However, we can design efficient algorithms to compute proper colorings of $G$ in which the number of colors satisfies the above upper bounds. One cannot expect similar results for sets of continuous arcs, instead of segments, even in the plane. We construct families of arcs whose disjointness graphs are triangle-free ($\omega(G)=2$), but whose chromatic numbers are arbitrarily large.
author:
- '[*János Pach*]{}[^1]'
- '[*Gábor Tardos*]{}[^2]'
- '[*Géza Tóth*]{}[^3]'
date:
-
-
title: Disjointness graphs of segments
---
Introduction
============
Given a set of (geometric) objects, their [*intersection graph*]{} is a graph whose vertices correspond to the objects, two vertices being connected by an edge if and only if their intersection is nonempty. Intersection graphs of intervals on a line [@H57], more generally, chordal graphs [@B61; @Di61] and comparability graphs [@D50], turned out to be [*perfect graphs*]{}, that is, for them and for each of their induced subgraph $H$, we have $\chi(H)=\omega(H)$, where $\chi(H)$ and $\omega(H)$ denote the chromatic number and the clique number of $H$, respectively. It was shown [@HS58] that the complements of these graphs are also perfect, and based on these results, Berge [@B61] conjectured and Lovász [@Lo72] proved that the complement of every perfect graph is perfect.
Most geometrically defined intersection graphs are not perfect. However, in many cases they still have nice coloring properties. For example, Asplund and Grünbaum [@AG60] proved that every intersection graph $G$ of axis-parallel rectangles in the plane satisfies $\chi(G)=O((\omega(G))^2)$. It is not known if the stronger bound $\chi(G)=O(\omega(G))$ also holds for these graphs. For intersection graphs of chords of a circle, Gyárfás [@G85] established the bound $\chi(G)=O((\omega(G))^24^{\omega(G)})$, which was improved to $O(2^{\omega(G)})$ in [@KoK97]. Here we have examples of $\chi(G)$ slightly superlinear in $\omega(G)$ [@Ko88]. In some cases, there is no functional dependence between $\chi$ and $\omega$. The first such example was found by Burling [@Bu65]: there are sets of axis-parallel boxes in ${{{\mathbb R}}}^3$, whose intersection graphs are [*triangle-free*]{} ($\omega=2$), but their chromatic numbers are arbitrarily large. Following Gyárfás and Lehel [@GL83], we call a family $\cal G$ of graphs [*$\chi$-bounded*]{} if there exists a function $f$ such that all elements $G\in\cal G$ satisfy the inequality $\chi(G)\le
f(\omega(G))$. The function $f$ is called a [*bounding function*]{} for $\cal
G$. Heuristically, if a family of graphs is $\chi$-bounded, then its members can be regarded “nearly perfect". Consult [@GL85; @G87; @Ko04] for surveys.
At first glance, one might believe that, in analogy to perfect graphs, a family of intersection graphs is $\chi$-bounded if and only if the family of their complements is. Burling’s above mentioned constructions show that this is not the case: the family of complements of intersection graphs of axis-parallel boxes in ${{{\mathbb R}}}^d$ is $\chi$-bounded with bounding function $f(x)=O(x\log^{d-1}x)$, see [@Ka91]. More recently, Pawlik, Kozik, Krawczyk, Lasoń, Micek, Trotter, and Walczak [@PKK14] have proved that Burling’s triangle-free graphs can be realized as intersection graphs of segments in the plane. Consequently, the family of these graphs is [*not*]{} $\chi$-bounded either. On the other hand, the family of their complements is, see Theorem 0.
To simplify the exposition, we call the complement of the intersection graph of a set of objects their [*disjointness graph*]{}. That is, in the disjointness graph two vertices are connected by an edge if and only if the corresponding objects are disjoint. Using this terminology, the following is a direct consequence of a result of Larman, Matoušek, Pach, and Törőcsik.
[**Theorem 0.**]{} [@LMPT94] [*The family of disjointness graphs of segments in the plane is $\chi$-bounded. More precisely, every such graph $G$ satisfies the inequality $\chi(G)\le(\omega(G))^4$.*]{}
For the proof of Theorem 0, one has to introduce [four]{} partial orders on the family of segments, and apply Dilworth’s theorem [@D50] four times. Although this method does not seem to generalize to higher dimensions, the statement does. We establish the following.
[**Theorem 1.**]{}
*The disjointness graph $G$ of any system of segments in ${{{\mathbb R}}}^d, d\ge 2$ satisfies the inequality $\chi(G)\le(\omega(G))^4+(\omega(G))^3$.*
Moreover, there is a polynomial time algorithm that, given the segments corresponding to the vertices of $G$, finds a complete subgraph $K\subseteq G$ and a proper coloring of $G$ with at most $|V(K)|^4+|V(K)|^3$ colors.
If we consider full lines in place of segments, we obtain stronger bounds.
[**Theorem 2.**]{}
*(i) Let $G$ be the disjointness graph of a set of lines in ${{{\mathbb R}}}^d, \; d\ge 3.$ Then we have $\;\; \chi(G)\le(\omega(G))^3.$*
\(ii) Let $G$ be the disjointness graph of a set of lines in the projective space ${{{\mathbb P}}}^d, \; d\ge 3.$ Then we have $\;\; \chi(G)\le(\omega(G))^2.$
In both cases, there are polynomial time algorithms that, given the lines corresponding to the vertices of $G$, find complete subgraphs $K\subseteq G$ and proper colorings of $G$ with at most $|V(K)|^3$ and $|V(K)|^2$ colors, respectively.
Note that the difference between the two scenarios comes from the fact that parallel lines in the Euclidean space are disjoint, but the corresponding lines in the projective space intersect.
Most computational problems for geometric intersection and disjointness graphs are hard. It was shown by Kratochvíl and Nešetřil [@KrN90] and by Cabello, Cardinal, and Langerman [@CaCL13] that finding the clique number $\omega(G)$ resp. the independence number $\alpha(G)$ of disjointness graphs of segments in the plane are NP-hard. It is also known that computing the chromatic number $\chi(G)$ of disjointness and intersection graphs of segments in the plane is NP-hard [@EET86]. Our next theorem shows that some of the analogous problems are also NP-hard for disjointness graphs of lines in space, while others are tractable in this case. In particular, according to Theorem 3(i), in a disjointness graph $G$ of lines, it is NP-hard to determine $\omega(G)$ and $\chi(G)$. In view of this, it is interesting that one can design polynomial time algorithms to find proper colorings and complete subgraphs in $G$, where the number of colors is bounded in terms of the size of the complete subgraphs, in the way specified in the closing statements of Theorems 1 and 2.
[**Theorem 3.**]{}
*(i) Computing the clique number $\omega(G)$ and the chromatic number $\chi(G)$ of disjointness graphs of lines in ${{\mathbb R}}^3$ or in ${{\mathbb P}}^3$ are NP-hard problems.*
\(ii) Computing the independence number $\alpha(G)$ of disjointness graphs of lines in ${{\mathbb R}}^3$ or in ${{\mathbb P}}^3$, and deciding for a fixed $k$ whether $\chi(G)\le k$, can be done in polynomial time.
The bounding functions in Theorems 0, 1, and 2 are not likely to be optimal. As for Theorem 2 (i), we will prove that there are disjointness graphs $G$ of lines in $\mathbb{R}^3$ for which $\frac{\chi(G)}{\omega(G)}$ are arbitrarily large. Our best constructions for disjointness graphs $G'$ of lines in the projective space satisfy $\chi(G')\ge2\omega(G')-1$; see Theorem 2.3.
The proof of Theorem 1 is based on Theorem 0. Any strengthening of Theorem 0 leads to improvements of our results. For example, if $\chi(G)=O((\omega(G))^\gamma)$ holds with any $3\le \gamma\le 4$ for the disjointness graph of every set of segments in the plane, then the proof of Theorem 1 implies the same bound for disjointness graphs of segments in higher dimensions. In fact, it is sufficient to verify this statement in $3$ dimensions. For $d\ge 4$, we can find a projection in a generic direction to the $3$-dimensional space that does not create additional intersections and then we can apply the $3$-dimensional bound. We focus on the case $d=3$.
It follows immediately from Theorem 0 that the disjointness (and, hence, the intersection) graph of any system of $n$ segments in the plane has a clique or an independent set of size at least $n^{1/5}$. Indeed, denoting by $\alpha(G)$ the maximum number of independent vertices in $G$, we have $$\alpha(G)\ge \frac{n}{\chi(G)}\ge\frac{n}{(\omega(G))^4},$$ so that $\alpha(G)(\omega(G))^4\ge n$. Analogously, Theorem 1 implies that $\max(\alpha(G),\omega(G))\ge (1-o(1))n^{1/5}$ holds for disjointness (and intersection) graphs of segments in any dimension $d\ge 2$. For disjointness graphs of $n$ lines in $\mathbb{R}^d$ (respectively, in $\mathbb{P}^d$), we obtain that $\max(\alpha(G),\omega(G))$ is $\Omega(n^{1/4})$ (resp., $\Omega(n^{1/3})$). Using more advanced algebraic techniques, Cardinal, Payne, and Solomon [@CPS16] proved the stronger bounds $\Omega(n^{1/3})$ (resp., $\Omega(n^{1/2})$).
If the order of magnitude of the bounding functions in Theorems 0 and 1 are improved, then the improvement carries over to the lower bound on $\max(\alpha(G),\omega(G))$. Despite many efforts [@LMPT94; @KaPT97; @Ky12] to construct intersection graphs of planar segments with small clique and independence numbers, the best known construction, due to Kynčl [@Ky12], gives only $$\max(\alpha(G),\omega(G))\le n^{\log 8/\log 169}\approx n^{0.405},$$ where $n$ is the number of vertices. This bound is roughly the square of the best known lower bound.
Our next theorem shows that any improvement of the lower bound on $\max(\alpha(G),\omega(G))$ in the plane, even if it was not achieved by an improvement of the bounding function in Theorem 0, would also carry over to higher dimensions.
[**Theorem 4.**]{} [*If the disjointness graph of any set of $n$ segments in the plane has a clique or an independent set of size $\Omega(n^\beta)$ for some fixed $\beta\le1/4$, then the same is true for disjointness graphs of segments in ${{{\mathbb R}}}^d$ for any $d>2$.*]{}
A continuous arc in the plane is called a [*string*]{}. One may wonder whether Theorem 0 can be extended to disjointness graphs of strings in place of segments. The answer is no, in a very strong sense.
[**Theorem 5.**]{} [*There exist triangle-free disjointness graphs of $n$ strings in the plane with arbitrarily large chromatic numbers. Moreover, we can assume that these strings are simple polygonal paths consisting of at most $4$ segments.*]{}
Very recently, Mütze, Walczak, and Wiechert [@MWW17] improved this result. They proved that the statement holds even if the strings are simple polygonal paths of at most $3$ segments, moreover, any two intersect at most once.
The following problems remain open.
[**Problem 6.**]{}
*(i) Is the family of disjointness graphs of polygonal paths, each consisting of at most two segments, $\chi$-bounded?*
\(ii) Is the previous statement true under the additional assumption that any two of the polygonal paths intersect in at most one point?
[**Problem 7.**]{} [*Is the family of intersection graphs of lines in ${{{\mathbb R}}}^3$ $\chi$-bounded?*]{}
By Theorem 2, the family of [*complements*]{} of intersection graphs of lines in ${{{\mathbb R}}}^3$ is $\chi$-bounded.
This paper is organized as follows. In the next section, we prove Theorem 2, which is needed for the proof of Theorem 1. Theorem 1 is established in Section 3. The proof of Theorem 4 is presented in Section 4. In Section 5, we construct several examples of disjointness graphs whose chromatic numbers are much larger than their clique numbers. In particular, we prove Theorem 5 and some similar statements. The last section contains the proof of Theorem 3 and remarks on the computational complexity of related problems.
Disjointness graphs of lines–Proof of Theorem 2
===============================================
[**Claim 2.1.**]{} [*Let $G$ be the disjointness graph of a set of $n$ lines in ${{\mathbb P}}^d$. If $G$ has an isolated vertex, then $G$ is perfect.*]{}
[**Proof.**]{} Let $\ell_0\in V(G)$ be a line representing an isolated vertex of $G$. Consider the bipartite multigraph $H$ with vertex set $V(H)=A\cup B$, where $A$ consists of all points of $\ell_0$ that belong to at least one other line $\ell\in V(G)$, and $B$ is the set of all ($2$-dimensional) planes passing through $\ell_0$ that contain at least one other line $\ell\in V(G)$ different from $\ell_0$. We associate with any line $\ell\in V(G)$ different from $\ell_0$ an edge $e_\ell$ of $H$, connecting the point $p=\ell\cap\ell_0\in A$ to the plane $\pi\in B$ that contains $\ell$. Note that there may be several parallel edges in $H$. See Figure 1.
Observe that two lines $\ell,\ell'\in V(G)\setminus\{\ell_0\}$ intersect if and only if $e_\ell$ and $e_{\ell'}$ share an endpoint. This means that $G$ minus the isolated vertex $\ell_0$ is isomorphic to the complement of the line graph of $H$. The line graphs of bipartite multigraphs and their complements are known to be perfect. (For the complements of line graphs, this is the König-Hall theorem; see, e. g., [@L93].) The graph $G$ can be obtained by adding the isolated vertex $\ell_0$ to a perfect graph, and is, therefore, also perfect. $\Box$
[**Proof of Theorem 2.**]{} We start with the proof of part (ii). Let $G$ be a disjointness graph of lines in ${{\mathbb P}}^d$. Let $C\subseteq G$ be a maximal clique in $G$. Clearly, $|C|\le\omega(G)$. By the maximality of $C$, for every $\ell\in V(G)\setminus C$, there exists $c\in C$ that is not adjacent to $\ell$ in $G$. Hence, there is a partition of $V(G)$ into disjoint sets $V_c, c\in C,$ such that $c\in V_c$ and $c$ is an isolated vertex in the induced subgraph $G[V_c]$ of $G$. Applying Claim 2.1 separately to each subgraph $G[V_c]$, we obtain $$\chi(G)\le\sum_{c\in C}\chi(G[V_c])=\sum_{c\in C}\omega(G[V_c])
\le|C|\omega(G)\le(\omega(G))^2.$$
Now we turn to the proof of part (i) of Theorem 2. Let $G$ be a disjointness graph of lines in ${{\mathbb R}}^d$. Consider the lines in $V(G)$ as lines in the projective space ${{\mathbb P}}^d$, and consider the disjointness graph $G'$ of these projective lines. Clearly, $G'$ is a subgraph of $G$ with the lines $\ell$, $\ell'\in V(G)$ adjacent in $G$ but not adjacent in $G'$ if and only if $\ell$ and $\ell'$ are parallel. Thus, an independent set in $G'$ induces a disjoint union of complete subgraphs in $G$, where the vertices of each complete subgraph correspond to pairwise parallel lines. If $k$ is the maximal number of pairwise parallel lines in $V(G)$, then $k\le\omega(G)$ and each independent set in $G'$ can be partitioned into at most $k$ independent sets in $G$. Applying part (ii), we obtain $$\chi(G)\le k\chi(G')\le \omega(G)(\omega(G'))^2\le(\omega(G))^3.$$
Finally, we prove the last claim concerning polynomial time algorithms. In the proof of part (ii), we first took a maximal clique $C$ in $G$. Such a clique can be efficiently found by a greedy algorithm. The partition of $V(G)$ into subsets $V_c, c\in C,$ such that $c\in V_c$ is an isolated vertex in the subgraph $G[V_c]$, can also be done efficiently. It remains to find a clique of maximum size and a proper coloring of each perfect graph $G[V_c]$ with the smallest number of colors. It is well known that for perfect graphs, both of these tasks can be completed in polynomial time. See e.g. Corollary 9.4.8 on page 298 of [@GLS88]. Alternatively, notice that in the proof of Claim 2.1 we showed that $G[V_c]$ is, in fact, the complement of the line graph of a bipartite multigraph (plus an isolated vertex). Therefore, finding a maximum size complete subgraph corresponds to finding a maximum size matching in a bipartite graph, while finding an optimal proper coloring of $G[V_c]$ corresponds to finding a minimal size vertex cover in a bipartite graph. This can be accomplished by much simpler and faster algorithms than the general purpose algorithms developed for perfect graphs.
To finish the proof of the algorithmic claim for part (ii), we can simply output as $K$ the set $C$ or one of the largest maximum cliques in $G[V_c]$ over all $c\in C$, whichever is larger. We color each $V_c$ optimally, with pairwise disjoint sets of colors.
For the algorithmic claim about part (i), first color the corresponding arrangement of projective lines, and then refine the coloring by partitioning each color class into at most $k$ smaller classes, where $k$ is the maximum number of parallel lines in the arrangement. It is easy to find the value of $k$, just partition the lines into groups of parallel lines. Output as $K$ the set we found for the projective lines, or a set of $k$ parallel lines, whichever is larger. $\Box$
[**Theorem 2.3.**]{}
*(i) There exist disjointness graphs $G$ of families of lines in $\mathbb{R}^3$ for which the ratio $\chi(G)/\omega(G)$ is arbitrarily large.*
\(ii) For any $k$ one can find a system of lines in $\mathbb{P}^3$ whose disjointness graph $G$ satisfies $\omega(G)=k$ and $\chi(G)=2k-1$.
[**Proof.**]{} First, we prove (i). For some $m$ and $d$ to be determined later, consider the set $W_m^d$ of integer points in the $d$-dimensional hypercube $[1,m]^d$. That is, $W_m^d=\{ 1, 2, \ldots , m\}^d$. A [*combinatorial line*]{} is a sequence of $m$ distinct points of $x^1,\ldots x^m\in W_m^d$ such that for every $1\le i\le d$, their $i$th coordinates $(x^j)_i$ are either the same for all $1\le j\le m$ or we have $(x^j)_i=j$ for all $1\le j\le m$. Note that the points of any combinatorial line lie on a geometric straight line. Let ${\cal L}$ denote the set of these geometric lines.
Let $G$ denote the disjointness graph of $\cal L$. Since each line in $\cal L$ passes through $m$ points of $W_m^d$, and $|W_m^d|=m^d$, we have $\omega(G)\le m^{d-1}$. (It is easy to see that equality holds here, but we do not need this fact for the proof.)
Consider any proper coloring of $G$. The color classes are families of pairwise crossing lines in $\cal L$. Observe that any such family has a common point in $W_m^d$, except some families consisting of $3$ lines. Take an optimal proper coloring of $G$ with $\chi(G)$ colors, and split each $3$-element color class into two smaller classes. In the resulting coloring, there are at most $2\chi(G)$ color classes, each of which has a point of $W_m^d$ in common. This means that the set of at most $2\chi(G)$ points of $W_m^d$ (the “centers” of the color classes) “hits” every combinatorial line. By the density version of the Hales-Jewett theorem, due to Furstenberg and Katznelson [@Bo98; @FK91], if $d$ is large enough relative to $m$, then any set containing fewer than half of the points of $W_m^d$ will miss an entire combinatorial line. Choosing any $m$ and a sufficiently large $d$ depending on $m$, we conclude that $2\chi(G)\ge
m^d/2$ and $\chi(G)/\omega(G)\ge m/4$.
Note that the family $\cal L$ consists of lines in ${{\mathbb R}}^d$. To find a similar family in 3-space, simply take the image of $\cal L$ under a projection to ${{\mathbb R}}^3$. One can pick a generic projection that does not change the disjointness graph $G$. This completes the proof of part (i). Note that the same construction does not work for projective lines, as the combinatorial lines in $W_m^d$ fall into $2^d-1$ parallel classes, so the chromatic number of the corresponding projective disjointness graph is smaller than $2^d$.
To establish part (ii), fix a positive integer $k$, and consider a set $S$ of $2k+1$ points in general position (no four in a plane) in $\mathbb{R}^3\subseteq
\mathbb{P}^3$. Let $\cal L$ denote the set of $\binom{2k+1}{2}$ lines determined by them. Note that by the general position assumption, two lines in $\cal L$ intersect if and only if they have a point of $S$ in common. This means that the disjointness graph $G$ of $\cal L$ is isomorphic to the [*Kneser graph*]{} $G^{*}(2k+1,2)$ formed by all $2$-element subsets of a $(2k+1)$-element set. Obviously, $\omega(G^{*}(n,m))=\lfloor n/m\rfloor$, so $\omega(G)=k$. By a celebrated result of Lovász [@Lo78], $\chi G^*(n,m)=n-2m+2$ for all $n\ge2m-1$. Thus, we have $\chi(G)=2k-1$, as claimed. $\Box$
Disjointness graphs of segments–Proof of Theorem 1
==================================================
If all segments lie in the same plane, then by Theorem 0 we have $\chi(G)\le(\omega(G))^4$. Our next theorem generalizes this result to the case where the segments lie in a bounded number of distinct planes.
[**Theorem 3.1.**]{}
*Let $G$ be the disjointness graph of a set of segments in $\mathbb{R}^d, d>2,$ that lie in the union of $k$ two-dimensional planes. We have $$\chi(G)\le(k-1)\omega(G)+(\omega(G))^4.$$*
Given the segments representing the vertices of $G$ and $k$ planes containing them, there is a polynomial time algorithm to find a complete subgraph $K\subseteq G$ and a proper coloring of $G$ with at most $(k-1)|V(K)|+|V(K)|^4$ colors.
[**Proof.**]{} Let $\pi_1, \pi_2, \ldots, \pi_k$ be the planes containing the segments. Partition the vertex set of $G$ into the classes $V_1, V_2, \ldots, V_k$ by putting a segment $s$ into the class $V_i$, where $i$ is the [*largest*]{} index for which $\pi_i$ contains $s$.
For $i=1, 2,\ldots, k,$ we define subsets $W_i, Z_i\subseteq V_i$ with $Z_i\subseteq W_i\subseteq V_i$ by a recursive procedure, as follows. Let $W_1=V_1$ and let $Z_1\subseteq W_1$ be a [*maximal size*]{} clique in $G[W_1]$.
Assume that the sets $W_1,\dots, W_i$ and $Z_1,\ldots, Z_i$ have already been defined for some $i<k$. Let $W_{i+1}$ denote the set of all vertices in $V_{i+1}$ that are adjacent to every vertex in $Z_1\cup Z_2\cup\ldots\cup
Z_i$, and let $Z_{i+1}$ be a maximal size clique in $G[W_{i+1}]$. By definition, $\bigcup_{i=1}^kZ_i$ induces a complete subgraph in $G$, and we have $$\sum_{i=1}^k|Z_i|\le\omega(G).$$
Let $s$ be a segment belonging to $Z_i$, for some $1\le i< k$. A point $p$ of $s$ is called a [*piercing point*]{} if $p\in \pi_j$ for some $j>i$. Notice that in this case, $s$ “pierces” the plane $\pi_j$ in a single point, otherwise we would have $s\subset\pi_j$, contradicting our assumption that $s\in V_i$. Letting $P$ denote the set of piercing points of all segments in $\bigcup_{i=1}^kZ_i$, we have $$|P|\le\sum_{i=1}^k(k-i)|Z_i|\le(k-1)\sum_{i=1}^k|Z_i|\le(k-1)\omega(G).$$
Let $V_0=V(G)\setminus\bigcup_{i=1}^kW_i$. We claim that every segment in $V_0$ contains at least one piercing point. Indeed, if $s\in V_i\setminus W_i$ for some $i\le k$, then $s$ is not adjacent in $G$ to at least one segment $t\in Z_1\cup\ldots\cup Z_{i-1}$. Thus, $s$ and $t$ are not disjoint, and their intersection point is a piercing point, at which $t$ pierces the plane $\pi_i$.
Assign a color to each piercing point $p\in P$. Coloring every segment in $V_0$ by the color of one of its piercing points, we get a proper coloring of $G[V_0]$ with $|P|$ colors, so that $\chi(G[V_0])\le|P|.$
For every $i\le k$, all segments of $W_i$ lie in the plane $\pi_i$. Therefore, we can apply Theorem 0 to their disjointness graph $G[W_i]$, to conclude that $\chi(G[W_i])\le(\omega(G[W_i]))^4$. By definition, $Z_i$ induces a maximum complete subgraph in $G[W_i]$, hence $|Z_i|=\omega(G[W_i])$ and $\chi(G[W_i])\le|Z_i|^4$.
Putting together the above estimates, and taking into account that $\bigcup_{i=1}^kZ_i$ induces a complete subgraph in $G$, we obtain $$\chi(G)\le\chi(G[V_0])+\sum_{i=1}^k\chi(G[W_i])\le|P|+\sum_{i=1}^k|Z_i|^4$$ $$\le(k-1)\omega(G)+(\sum_{i=1}^k|Z_i|)^4\le(k-1)\omega(G)+(\omega(G))^4,$$ as required.
We can turn this estimate into a polynomial time algorithm as required, using the fact that the proof of Theorem 0 is constructive. In particular, we use that, given a family of segments in the plane, one can efficiently find a subfamily $K$ of pairwise disjoint segments and a proper coloring of the disjointness graph with at most $|K|^4$ colors. This readily follows from the proof of Theorem 0, based on the four easily computable (semi-algebraic) partial orders on the family of segments, introduced in [@LMPT94].
Our algorithm finds the sets $V_i$, as in the proof. However, finding $W_i$ and a maximum size clique $Z_i\subseteq W_i$ is a challenge. Instead, we use the constructive version of Theorem 0 to find $Z_i\subseteq W_i$ and a proper coloring of $G[W_i]$. The definition of $W_i$ remains unchanged. Next, the algorithm identifies the piercing points.
The algorithm outputs the clique $K=\bigcup Z_i$ and the coloring of $G$. The latter one is obtained by combining the previously constructed colorings of the subgraphs $G[W_i]$ (using disjoint sets of colors for different subgraphs), and coloring each remaining vertex by a previously unused color, associated with one of the piercing points the corresponding segment passes through. $\Box$
[**Proof of Theorem 1.**]{} Consider the set of all lines in the [ *projective*]{} space $\mathbb{P}^d$ that contain at least one segment belonging to $V(G)$. Let $\bar{G}'$ denote the disjointness graph of these lines. Obviously, we have $\omega(\bar{G}')\le\omega(G)$. Thus, Theorem 2(ii) implies that $$\chi(\bar{G}')\le (\omega(\bar{G}'))^2\le(\omega(G))^2.$$
Let $C$ be the set of lines corresponding to the vertices of a maximum complete subgraph in $\bar{G}'$. Fix an optimal proper coloring of $\bar{G}'$. Suppose that we used $k$ “planar” colors (each such color is given to a set of lines that lie in the same plane) and $\chi(\bar{G'})-k$ “pointed” colors (each given to the vertices corresponding to a set of lines passing through a common point).
Consider now $G$, the disjointness graph of the segments. Let $G_0$ denote the subgraph of $G$ induced by the set of segments whose supporting lines received one of the $k$ planar colors in the above coloring of $\bar{G}'$. These segments lie in at most $k$ planes. Therefore, applying Theorem 3.1 to $G_0$, we obtain $$\chi(G_0)\le (k-1)\omega(G_0)+(\omega(G_0))^4
\le (k-1)\omega(G)+(\omega(G))^4.$$
For $i, 1\le i\le \chi(\bar{G}')-k,$ let $G_i$ denote the subgraph of $G$ induced by the set of segments whose supporting lines are colored by the $i$th pointed color. It is easy to see that $G_i$ is the complement of a chordal graph. That is, the complement of $G_i$ contains no induced cycle of length larger than $3$. According to a theorem of Hajnal and Surányi [@HS58], any graph with this property is perfect, so that $$\chi(G_i)=\omega(G_i)\le\omega(G).$$
Putting these bounds together, we obtain that $$\chi(G)\le \chi(G_0)+\sum_{i=1}^{\chi(\bar{G}')-k}\chi(G_i)
\le(k-1)\omega(G)+(\omega(G))^4+\sum_{i=1}^{\chi(\bar{G}')-k}\omega(G)$$ $$\le((\omega(\bar{G}'))^2-1)\omega(G)+(\omega(G))^4<(\omega(G))^3
+(\omega(G))^4.$$
To prove the algorithmic claim in Theorem 1, we first apply the algorithm of Theorem 2 to the disjointness graph $\bar G'$. We distinguish between planar and pointed color classes and find the subgraphs $G_i$. We output a coloring of $G$, where for each $G_i, i>0$ we use the smallest possible number of colors ($G_i$ is perfect, so its optimal coloring can be found in polynomial time), and we color $G_0$ by the algorithm described in Theorem 3.1. The subgraphs $G_i$ are colored using pairwise disjoint sets of colors. We output the largest clique $K$ that we can find. This may belong to a subgraph $G_i$ with $i>0$, or may be found in $G_0$ or in $\bar G'$ by the algorithms given by Theorem 3.1 or Theorem 2, respectively. (In the last case, we need to turn a clique in $\bar G'$ into a clique of the same size in $G$, by picking an arbitrary segment from each of the pairwise disjoint lines.) $\Box$
Ramsey-type bounds in $\mathbb{R}^2$ vs. $\mathbb{R}^3$–Proof of Theorem 4
==========================================================================
As we have pointed out in the Introduction, it is sufficient to establish Theorem 4 in $\mathbb{R}^3$. We rephrase Theorem 4 for this case in the following form.
[**Theorem 4.1.**]{}
*Let $f(m)$ be a function with the property that for any disjointness graph $G$ of a system of segments in $\mathbb{R}^2$ with $\max(\alpha(G),\omega(G))\le m$ we have $|V(G)|\le f(m).$*
Then for any disjointness graph $G$ of a system of segments in $\mathbb{R}^3$ with $\max(\alpha(G),\omega(G))$ $\le m$ we have $|V(G)|\le f(m)+m^4.$
Applying Theorem 4.1 with $f(k)=ck^{1/\beta}$, Theorem 4 immediately follows. We prove Theorem 4.1 by adapting the proof of Theorem 3.1.
[**Proof of Theorem 4.1.**]{} Let $G$ be the disjointness graph of a set of segments in $\mathbb{R}^3$ with $\omega(G)\le m$ and $\alpha(G)\le m$.
First, assume that all segments lie in the union of $k$ planes, for some $k\ge 1$. Define the sets of vertices $V_i$, $W_i$, and $Z_i$ for every $1\le i\le k$, as in the proof of Theorem 3.1, and let $V_0=V(G)\setminus\bigcup_{i=1}^kW_i$. Since all elements of $W_i$ lie in the same plane, the subgraph induced by them is a planar segment disjointness graph for every $i\ge1$. We can clearly represent these graphs by segments in a common plane $\pi$ such that two segments intersect if and only they come from the same set $W_i$ and there they intersect. In this way, we obtain a system of segments in the plane whose disjointness graph $G^*$ is the [*join*]{} of the graphs $G[W_i]$, i.e., $G^*$ is obtained by taking the disjoint union of $G[W_i]$ (for all $i\ge1$) and adding all edges between $W_i$ and $W_j$ for every pair $i\ne
j$. Clearly, we have $$\omega(G^*)=\sum_{i=1}^k\omega(G[W_i])=\sum_{i=1}^k|Z_i|\le\omega(G)\le m,$$ and $$\alpha(G^*)=\max_{i=1}^k\alpha(G[W_i])\le\alpha(G)\le m.$$
By our assumption, $G^*$ has at most $f(m)$ vertices, so that $\sum_{i=1}^k|W_i|\le f(m).$ As we have seen in the proof of Theorem 3.1, the total number of piercing points is at most $(k-1)\sum_{i=1}^k|Z_i|\le(k-1)\omega(G)<km$, and each segment in $V_0$ contains at least one of them. Each piercing point is contained in at most $m$ segments, because these segments induce an independent set in $G$. Thus, we have $|V_0|<km^2$ and $$|V(G)|=|V_0|+\bigcup_{i=1}^k|W_i|<km^2+|V(G^*)|\le km^2+f(m).$$
Now we turn to the general case, where there is no bound on the number of planes containing the segments. As in the proof of Theorem 1, we consider the disjointness graph $\bar{G}'$ of the supporting lines of the segments in the projective space $\mathbb{P}^3$. Clearly, we have $\omega(\bar{G}')\le\omega(G)\le m$, so by Theorem 1 we have $\chi(\bar{G}')\le m^2$. Following the proof of Theorem 1, take an optimal coloring of $\bar{G}'$, and let $G_0$ denote the subgraph of $G$ induced by the segments whose supporting lines received one of the planar colors. Letting $k$ denote the number of planar colors, for every $i, 1\le
i\le \omega(\bar{G}')-k,$ let $G_i$ denote the subgraph of $G$ induced by the set of segments whose supporting lines received the $i$th pointed color. As in the proof of Theorem 1, every $G_i, i\ge 1$ is perfect and, hence, its number of vertices satisfies $$|V(G_i)|\le\chi(G_i)\alpha(G_i)\le\omega(G_i)\alpha(G_i)\le\omega(G)\alpha(G)\le
m^2.$$ The segments belonging to $V(G_0)$ lie in at most $k$ planes. In view of the previous paragraph, $|V(G_0)|\le km^2+f(m)$ vertices. Combining the above bounds, we obtain $$|V(G)|=|V(G_0)|+\sum_{i=1}^{\chi(\bar{G}')-k}|V(G_i)|
\le km^2+f(m)+(\chi(\bar{G}')-k)m^2$$ $$\le km^2+f(m)+(m^2-k)m^2\le f(m)+m^4,$$ which completes the proof. $\Box$
Constructions–Proof of Theorem 5
================================
The aim of this section is to describe various arrangements of geometric objects in 2, 3, and 4 dimensions with triangle-free disjointness graphs, whose chromatic numbers grow logarithmically with the number of objects. (This is much faster than the rate of growth in Theorem 2.3.) Our constructions can be regarded as geometric realizations of a sequence of graphs discovered by Erdős and Hajnal.
[**Definition 5.1.**]{} [@EH64]. [*Given $m>1$, let $H\noindent_m$, the [*$m$-th shift graph*]{}, be a graph whose vertex set consists of all ordered pairs $(i, j)$ with $1\le i < j\le m$, and two pairs $(i, j)$ and $(k, l)$ are connected by an edge if and only if $j=k$ or $l=i$.*]{}
Obviously, $H_m$ is triangle-free for every $m>1$. It is not hard to show (see, e.g., [@L93], Problem 9.26) that $\chi(H_m) = \lceil \log_2m\rceil$. Therefore, Theorem 5 follows directly from part (vii) of the next theorem.
[**Theorem 5.2.**]{}
*For every $m$, the shift graph $H_m$ can be obtained as a disjointness graph, where each vertex is represented by*
\(i) a line minus a point in ${{\mathbb R}}^2$;
\(ii) a two-dimensional plane in ${{\mathbb R}}^4$;
\(iii) the intersection of two general position half-spaces in ${{\mathbb R}}^3$;
\(iv) the union of two segments in ${{\mathbb R}}^2$;
\(v) a triangle in ${{\mathbb R}}^4$;
\(vi) a simplex in ${{\mathbb R}}^3$;
\(vii) a polygonal curve in ${{\mathbb R}}^2$, consisting of four line segments.
[**Proof.**]{} (i) Let $\ell_1, \ldots , \ell_m$ be lines in general position in the plane. For any $1\le i < j\le m$, let us represent the pair $(i, j)$ by the “pointed line” $p_{ij}=\ell_i\setminus\ell_j$.
Fix $1\le i < j\le m$, $1\le k < l\le m$, and set $X=p_{ij}\cap
p_{kl}=(\ell_i\cap \ell_k)\setminus(\ell_j\cup\ell_l)$. If $i=k$, then $X$ is an infinite set.
Otherwise, $\ell_i\cap\ell_k$ consists of a single point. In this case, $X$ is empty if and only if this point belongs to $\ell_j\cup\ell_l$. By the general position assumption, this happens if and only if $j=k$ or $l=i$. Thus, the disjointness graph of the sets $p_{ij},\; 1\le i<j\le m,$ is isomorphic to the shift graph $H_m$.
\(ii) Let $h_1, \ldots h_m$ be hyperplanes in general position in ${{\mathbb R}}^4$. For every $i$, fix another hyperplane $h'_i$, parallel (but not identical) to $h_i$. For any $1\le i < j\le m$, represent the pair $(i, j)$ by the two dimensional plane $p_{ij}=h_i\cap h'_j$.
Given $1\le i < j\le m$, $1\le k < l\le m$, the set $X=p_{ij}\cap p_{k,l}=h_i\cap h'_j\cap h_k\cap h'_l$ is the intersection of four hyperplanes. If the four hyperplanes are in general position, then $X$ consists of a single point.
If the hyperplanes are not in general position, then some of the four indices must coincide. If $i=k$ or $j=l$, then two of the hyperplanes coincide and $X$ is a line. In the remaining cases, when $j=k$ or $l=i$, among the four hyperplanes two are parallel, so their intersection $X$ is empty.
\(iii) For $i=1,\dots,m$, define the half-space $h_i$ as $$h_i=\{(x,y,z)\in{{\mathbb R}}^3\mid ix+i^2y+i^3z<1\}.$$ Note that the bounding planes of these half-spaces are in general position. For any $1\le i < j\le m$, represent the pair $(i, j)$ by $p_{ij}=h_j\setminus h_i$.
Now let $1\le i < j\le m$, $1\le k < l\le m$. If $j=k$ or $l=i$, the sets $p_{ij}$ and $p_{kl}$ are obviously disjoint. If $i=k$ or $j=l$, then $p_{ij}\cap p_{kl}$ is the intersection of at most 3 half-spaces in general position, so it is unbounded and not empty.
It remains to analyze the case when all four indices are distinct. This requires some calculation. We assume without loss of generality that $j<l$. Consider the point $P=(x,y,z)\in{{\mathbb R}}^3$ with $x=\frac1i+\frac1j+\frac1k$, $y=-\frac1{ij}-\frac1{jk}-\frac1{ki}$ and $z=\frac1{ijk}$. This is the intersection point of the bounding planes of $h_i$, $h_j$ and $h_k$. Therefore, the polynomial $zu^3+yu^2+xu-1$ vanishes at $u=i,j,k$, and it must be positive at $u=l$, as $l>i,j,k$ and the leading coefficient is positive. This means that $P$ lies in the open half-space $h_l$. As the bounding planes of $h_i$, $h_j$ and $h_k$ are in general position, one can find a point $P'$ arbitrarily close to $P$ (the intersection point of these half-planes) with $P'\in
h_j\setminus(h_i\cup h_k)$. If we choose $P'$ close enough to $P$, it will also belong to $h_l$. Thus, $P'\in p_{ij}\cap p_{kl}$, and so $p_{ij}$ and $p_{kl}$ are not disjoint.
(iv), (v), and (vi) directly follow from (i), (ii) and (iii), respectively, by replacing the unbounded geometric objects representing the vertices with their sufficiently large bounded subsets.
\(vii) Let $C$ be an almost vertical, very short curve (arc) in the plane, convex from the right (that is, the set of points to the right of $C$ is convex) lying in a small neighborhood of $(0,1)$. Let $p_1, p_2, \ldots , p_{m}$ be a sequence of $m$ points on $C$ such that $p_j$ is above $p_i$ if and only if $j>i$. For every $1\le i\le m$, let $T_i$ be an equilateral triangle whose base is horizontal, whose upper vertex is $p_{i}$, and whose center is on the $x$-axis. Let $q_i$ and $r_i$ be the lower right and lower left vertices of $T_i$, respectively. It is easy to see that $T_j$ contains $T_i$ in its interior if $j>i$. Let $s_i$ be a point on $r_ip_{i}$, very close to $p_i$.
Let us represent the vertex $(i,j)$ of the shift graph $H_m$ by the polygonal curve $p_{ij}=t_{ij}p_jq_jr_js_j$, where the point $t_{ij}$ is on the $x$-axis slightly to the left of the line $p_ip_j$. Note that if $C$ is short enough and close enough to vertical, then $t_{ij}$ can be chosen so that it belongs to the interior of all triangles $T_k$ for $1\le k\le m$. In particular, the entire polygonal path $p_{ij}$ belongs to $T_j$.
It depends on our earlier choices of the vertices $p_{i'}$, how close we have to choose $s_i$ to $p_i$. Analogously, it depends on our earlier choices of $p_{i'}$ and $s_{i'}$, how close we have to choose $t_{ij}$ to the line. Instead of describing an explicit construction, we simply claim that with proper choices of these points, we obtain a disjointness representation of the shift graph.
To see this, let $1\le i < j\le m$, $1\le k < l\le m$. If $j=l$, then three of the four line segments in $p_{ij}$ and $p_{kl}$ are the same, so they intersect. Otherwise, assume without loss of generality that $j<l$. As noted above, $p_{ij}$ belongs to the triangle $T_j$, which, in turn, lies in the interior of $T_l$. Three segments of $p_{kl}$ lie on the edges of $T_l$, so if $p_{ij}$ and $p_{kl}$ meet, the fourth segment, $t_{kl}p_l$, must meet $p_{ij}$. This segment enters the triangle $T_j$, so it meets one of its edges. Namely, for $j>k$ it follows from the convexity of the curve $C$ that the segment $t_{kl}p_l$ intersects the edge $p_jq_j$ and, hence, also $p_{ij}$. Analogously, if $j<k$, then $t_{kl}p_l$ intersects the interior of the edge $r_jp_j$. This is true even if $t_{kl}$ were chosen [*on*]{} the line $p_kp_l$, so choosing $s_j$ close enough to $p_j$, one can make sure that $t_{kl}p_l$ intersects $r_js_j$ and, hence, also $p_{ij}$. On the other hand, if $j=k$, we choose $t_{kl}$ so that $t_{kl}p_l$ is just slightly to the left of $p_j=p_k$, so it enters $T_j$ through the interior of the segment $s_jp_j$ that is [*not*]{} contained in $p_{ij}$. To see that in this case $p_{ij}$ and $p_{kl}$ are disjoint, it is enough to check that $t_{kl}p_l$ and $t_{ij}p_j$ are disjoint. This is true, because $p_j$ is on the right of $t_{kl}p_l$ and (from the convexity of $C$) the slope of the segments is such that $p_j$ is the closest point of the segment $t_{ij}p_j$ to $t_{kl}p_l$. $\Box$
Complexity issues–Proof of Theorem 3
====================================
The aim of this section is to outline the proof of Theorem 3 and to establish some related complexity results. For simplicity, we only consider systems of lines in the [*projective*]{} space ${{\mathbb P}}^3$. It is easy to see that by removing a generic hyperplane (not containing any of the intersection points), we can turn a system of projective lines into a system of lines into ${{\mathbb R}}^3$ without changing the corresponding disjointness graph.
It is more convenient to speak about intersection graphs rather than their complement in formulating the next theorem.
[**Theorem 6.1**]{}
*(i) If $G$ is a graph with maximum degree at most $3$, then $G$ is an intersection graph of lines in ${{\mathbb P}}^3$.*
\(ii) For an arbitrary graph $G$ the [*line graph*]{} of $G$ is an intersection graph of lines in ${{\mathbb P}}^3$.
[**Proof.**]{} (i) Suppose first that $G$ is triangle-free. Let $V(G)=\{v_1,\dots,v_k\}$. Let vertex $v_1$ be represented by an arbitrary line $\ell_1$. Suppose, recursively, that the line $\ell_j$ representing vertex $j$ has already been defined for every $j<i$. We will maintain the “general position” property that no doubly ruled surface contains more than $3$ pairwise disjoint lines. We must choose $\ell_i$ representing $v_i$ such that
\(a) it intersects the lines representing the neighbors $v_j$ of $v_i$ with $j<i$,
\(b) it does not intersect the lines representing the non-neighbors $v_j$ with $j<i$, and
\(c) we maintain our general position conditions.
These are simple algebraic conditions. The vertex $v_i$ has at most $3$ neighbors among $v_j$ for $j<i$, and they must be represented by pairwise disjoint lines. Thus, the Zariski-closed conditions from (a) determine an irreducible variety of lines, so unless they force the violation of a specific other (Zariski-open) condition from (b) or (c), all of those conditions can be satisfied with a generic line through the lines representing the neighbors. In case $v_i$ has three neighbors $v_j$ with $j<i$, the corresponding condition forces $\ell_i$ to be in one of the two families of lines on a doubly ruled surface $\Sigma$. This further forces $\ell_i$ to intersect [*all*]{} lines of the other family on $\Sigma$, but due to the general position condition, none of the vertices of $G$ is represented by lines there, except the three neighbors of $v_i$. We would violate the general position condition with the new line $\ell_i$ if the family we choose it from already had three members representing vertices. However, this would mean that the degrees of the neighbors of $v_i$ would be at least $4$, a contradiction. In case $v_i$ has fewer than $3$ neighbors, the requirement of $\ell_i$ intersecting the corresponding lines does not force $\ell_i$ to intersect any further lines or to lie on any doubly ruled surface.
We prove the general case by induction on $|V(G)|$. Suppose that $a,b,c\in
V(G)$ form a triangle in $G$ and that the subgraph of $G$ induced by $V(G)\setminus\{a,b,c\}$ can be represented as the intersection graph of distinct lines in ${{\mathbb P}}^3$. Note that each of $a$, $b$ and $c$ has at most a single neighbor in the rest of the graph. We extend the representation of the subgraph by adding three lines $\ell_a$, $\ell_b$ and $\ell_c$, representing the vertices of the triangle. We choose these lines in a generic way so that they pass through a common point $p$, and $\ell_a$ intersects the line representing the neighbor of $a$ (in case it exists), and similarly for $\ell_b$ and $\ell_c$. It is clear that we have enough degrees of freedom (at least six) to avoid creating any further intersection. For instance, it suffices to choose $p$ outside all lines in the construction and all planes determined by intersecting pairs of lines.
\(ii) Assign distinct points of ${{\mathbb P}}^3$ to the vertices of $G$ so that no four points lie in a plane. Represent each edge $xx'\in E(G)$ by the line connecting the points assigned to $x$ and $x'$. As no four points are coplanar, two lines representing a pair of edges will cross if and only if the edges share an endpoint. Therefore, the intersection graph of these lines is isomorphic to the edge graph of $G$. $\Box$
The following theorem implies Theorem 3, as the disjointness graph $H=\bar{G}$ is the complement of the intersection graph $G$, and we have $\omega(G)=\alpha(H)$, $\alpha(G)=\omega(H)$, $\chi(G)=\theta(H)$, and $\theta(G)=\chi(H)$. Here $\theta(H)$ denotes the [*clique covering number*]{} of $H$, that is, the smallest number of complete subgraphs of $H$ whose vertex sets cover $V(H)$.
[**Theorem 6.2.**]{}
*Let $H$ be an intersection graph of $n$ lines in the Euclidean space ${{\mathbb R}}^3$ or in the projective space ${{\mathbb P}}^3$.*
\(i) Computing $\alpha(H)$, the independence number of $H$, is NP-hard.
\(ii) Computing $\theta(H)$, the clique covering number of $H$, is NP-hard.
\(iii) Deciding whether $\chi(H)\le3$, that is, whether $H$ is $3$-colorable, is NP-complete.
\(iv) Computing $\omega(H)$, the clique number of $H$, is in P.
\(v) Deciding whether $\theta(H)\le k$ for a fixed $k$ is in P.
\(vi) All the above statements remain true if $H$ is not given as an abstract graph, but with its intersection representation with lines.
[**Proof.**]{} We only deal with the case where the lines are in ${{\mathbb P}}^3$. The reduction of the Euclidean case to this case is easy.
\(i) The problem of determining the independence number of 3-regular graphs is $NP$-hard; see [@AK00]. By Theorem 6.1(i), all 3-regular graphs are intersection graphs of lines in ${{\mathbb P}}^3$.
\(ii) The [*vertex cover number*]{} of a graph $H$ is the smallest number of vertices with the property that every edge of $H$ is incident to at least one of them. Note that the vertex cover number of $H$ is $|V(H)|-\alpha(H)$. In [@P74], it was shown that the problem of determining the [*vertex cover number*]{} is $NP$-hard even for triangle-free graphs. We can reduce this problem to the problem of determining the clique covering number of an intersection graph of lines. For this, note that each complete subgraph of the line graph $H'$ of $H$ corresponds to a star of $H$ and thus $\theta(H')$ is the vertex cover number of $H$. The reduction is complete, as $H'$ is the intersection graph of lines in ${{\mathbb P}}^3$, by Theorem 6.1(ii).
\(iii) Deciding whether the [*chromatic index*]{} (chromatic number of the line graph) of a $3$-regular graph is $3$ is NP-complete, see [@Ho81]. Using that the line graph of any graph is an intersection graph of lines in ${{\mathbb P}}^3$ (Theorem 6.1(ii)), the statement follows.
\(iv) A maximal complete subgraph corresponds to a set of lines passing through the same point $p$ or lying in the same plane $\Pi$. Any such point $p$ or plane $\Pi$ is determined by two lines, and in both cases we can verify for each remaining line whether it belongs to the corresponding complete subgraph (whether it passes through $p$ or belongs to $\Pi$, respectively). This gives an $O(n^3)$-time algorithm, but we suspect that the running time can be much improved.
\(v) As we have seen in part (iv), there are polynomially many maximal complete subgraphs in $H$. We can check all $k$-tuples of them, and decide whether they cover all vertices in $H$.
\(vi) For this, we need to consider the constructions of lines in the representations described in the proof of Theorem 6.1, and show that they can be built in polynomial time. This is obvious in part (ii) of the theorem. For part (i), the situation is somewhat more complex. To find many possible representations of the next vertex intersecting the lines it should, is an algebraically simple task. In polynomial time, we can find one of them that is generic in the sense needed for the construction. However, if the coordinates of each line would be twice as long as those of the preceding line (a condition that is hard to rule out [*a priori*]{}), then the whole construction takes more than polynomial time.
A simple way to avoid this problem is the following. First, color the vertices of the triangle-free graph $G$ of maximal degree at most $3$ by at most $4$ colors, by a simple greedy algorithm. Find the lines representing the vertices in the following order: first for the first color class, next for second color class, etc. The coordinates of each line will be just slightly more complex than the coordinates of the lines representing vertices in [*earlier color classes*]{}. Therefore, the construction can be performed in polynomial time. A similar argument works also for graphs $G$ with triangles: First we find a maximal subset of pairwise vertex-disjoint triangles in $G$. Let $G_0$ be the graph obtained from $G$ by removing these triangles. Then we construct an auxiliary graph $G'$ with these triangles as vertices by connecting two of them with an edge if there is an edge in $G$ between the triangles. The graph $G'$ has maximum degree at most $3$, so it can be greedily $4$-colored. If we construct $G$ by adding back the triangles to $G_0$, in the order determined by their colors, then the procedure will end in polynomial time. $\Box$
P. Alimonti and V. Kann: Some APX-completeness results for cubic graphs, [*Theoret. Comput. Science*]{} [**237**]{} (2000), 123–134.
E. Asplund and B. Grünbaum: On a colouring problem, [*Math. Scand.*]{} [**8**]{} (1960), 181–188.
C. Berge: Färbung von Graphen, deren sämtlich bzw. deren ungerade Kreise starr sind. Beiträge zur Graphentheorie (Vorträge während des graphentheoretischen Kolloquiums in Halle im März 1960, German), [*Wiss. Zeitchr. Univ. Halle*]{} [**10**]{} (1961), 114.
B. Bollobás: [*Modern Graph Theory. Graduate Texts in Mathematics*]{} [**184**]{}, Springer-Verlag, New York, 1998.
J. P. Burling: [*On coloring problems of families of prototypes*]{} (PhD thesis), University of Colorado, Boulder, 1965.
S. Cabello, J. Cardinal, and S. Langerman: The clique problem in ray intersection graphs, [*Discrete Comput. Geom.*]{} [**50**]{}(3) (2013), 771–783.
J. Cardinal, M. S. Payne, and N. Solomon: Ramsey-type theorems for lines in 3-space, [*Discrete Mathematics & Theoretical Computer Science*]{} [**18**]{}(3) (2016), \#[14]{}. M. Chudnovsky, N. Robertson, P. Seymour, and R. Thomas: The strong perfect graph theorem, [*Ann. Math.*]{} [**164**]{}(1) (2006), 51–229.
R. P. Dilworth: A decomposition theorem for partially ordered sets, [*Ann. Math.*]{} [**51**]{}(1) (1950), 161–166.
G. A. Dirac: On rigid circuit graphs, [*Abh. Math. Sem. Univ. Hamburg*]{} [**25**]{} (1961), 71–76.
G. Ehrlich, S. Even, and R. E. Tarjan: Intersection graphs of curves in the plane, [*J. Combinatorial Theory Ser. B*]{} [**21**]{}(1) (1976), 8–20.
P. Erdős and A. Hajnal: Some remarks on set theory. IX. Combinatorial problems in measure theory and set theory. [*Michigan Math. J.*]{} [**11**]{} (1964), 107-127.
H. Furstenberg and Y. Katznelson: A density version of the Hales-Jewett theorem, [*J. Anal. Math.*]{} [**57**]{} (1991), 64–119.
M. R. Garey, D. S. Johnson, and L. Stockmeyer: Some simplified NP-complete problems, [*Theoret. Comput. Sci.*]{} [**1**]{} (1976), no. 3, 237–267.
M. Grötschel, L. Lovász, A. Schrijver: [*Geometric Algorithms and Combinatorial Optimization,*]{} Springer-Verlag, Berlin, Heidelberg, 1988.
A. Gyárfás: On the chromatic number of multiple interval graphs and overlap graphs, [*Discrete Math.*]{} [**55**]{}(2) (1985), 161–166. Corrigendum: [*Discrete Math.*]{} [**62**]{}(3) (1986), 333.
A. Gyárfás: Problems from the world surrounding perfect graphs, in: [ *Proceedings of the International Conference on Combinatorial Analysis and its Applications (Pokrzywna, 1985), Zastos. Mat.*]{} [**19**]{}(3–4) (1987), 413–441.
A. Gyárfás and J. Lehel: Hypergraph families with bounded edge cover or transversal number, [*Combinatorica*]{} [**3**]{}(3–4) (1983), 351–358.
A. Gyárfás and J. Lehel: Covering and coloring problems for relatives of intervals, [*Discrete Math.*]{} [**55**]{}(2) (1985), 167–180.
A. Hajnal and J. Surányi: Über die Auflösung von Graphen in vollständige Teilgraphen (German), [*Ann. Univ. Sci. Budapest. Eötvös. Sect. Math.*]{} [**1**]{} (1958), 113–121.
G. Hajós: Über eine Art von Graphen, [*Intern. Math. Nachr.*]{} [**11**]{} (1957), Sondernummer 65.
I. Holyer: The NP-Completeness of Edge-Coloring, [*SIAM J. Comput.*]{} [**10**]{}(4) (1981), 718–-720.
G. Károlyi: On point covers of parallel rectangles. [*Period. Math. Hungar.*]{} [**23**]{}(2) (1991), 105-–107.
G. Károlyi, J. Pach, and G. Tóth: Ramsey-type results for geometric graphs. I, ACM Symposium on Computational Geometry (Philadelphia, PA, 1996), [*Discrete Comput. Geom.*]{} [**18**]{}(3) (1997), 247–255.
A. V. Kostochka: Upper bounds for the chromatic numbers of graphs, [*Trudy Inst. Mat. (Novosibirsk), Modeli i Metody Optim. (Russian)*]{} [**10**]{} (1988), 204–226.
A. V. Kostochka: Coloring intersection graphs of geometric figures, in: [*Towards a Theory of Geometric Graphs*]{} (J. Pach, ed.), [*Contemporary Mathematics*]{} [**342**]{}, Amer. Math. Soc., Providence, 2004, 127–138.
A. V. Kostochka and J. Kratochvíl: Covering and coloring polygon-circle graphs, [*Discrete Math.*]{} [**163**]{}(1–3) (1997), 299–305.
J. Kratochvíl and J. Nešetřil: INDEPENDENT SET and CLIQUE problems in intersection-defined classes of graphs, [*Comment. Math. Univ. Carolin.*]{} [**31**]{}(1) (1990), 85–93.
J. Kynčl: Ramsey-type constructions for arrangements of segments, [ *European J. Combin.*]{} [**33**]{}(3) (2012), 336–339.
A Ramsey-Type Result for Convex Sets, [*Bull. London Math. Soc.*]{} [**26**]{} (1994), 132–136.
L. Lovász: Normal hypergraphs and the perfect graph conjecture, [*Discrete Math.*]{} [**2**]{}(3) (1972), 253–267.
L. Lovász: Kneser’s conjecture, chromatic number, and homotopy, [*J. Combinatorial Theory, Ser. A*]{} [**25**]{}(3) (1978), 319–324.
L. Lovász: [*Combinatorial Problems and Exercises, Second edition*]{}, North-Holland Publishing Co., Amsterdam, 1993.
T. Mütze, B. Walczak, V. Wiechert: Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane, manuscript.
A. Pawlik, J. Kozik, T. Krawczyk, M. Lasoń, P. Micek, W. T. Trotter, and B. Walczak: Triangle-free intersection graphs of line segments with large chromatic number, [*Journal of Combinatorial Theory, Ser. B*]{} [**105**]{} (2014), 6–10.
S. Poljak: A note on stable sets and colorings of graphs, [*Commun. Math. Univ. Carolinae*]{} [**15**]{} (1974), 307–309.
[^1]: Ecole Polytechnique Fédérale de Lausanne and Rényi Institute, Hungarian Academy of Sciences, P.O.Box 127 Budapest, 1364, Hungary; `pach@renyi.hu`. ; `pach@cims.nyu.edu`. Supported by Swiss National Science Foundation Grants 200021-165977 and 200020-162884.
[^2]: Rényi Institute, Hungarian Academy of Sciences, P.O.Box 127 Budapest, 1364, Hungary; `tardos@renyi.hu`. Supported by the Cryptography “Lendület” project of the Hungarian Academy of Sciences and by the National Research, Development and Innovation Office, NKFIH, projects K-116769 and SNN-117879.
[^3]: Rényi Institute, Hungarian Academy of Sciences, P.O.Box 127 Budapest, 1364, Hungary; `geza@renyi.hu`. Supported by National Research, Development and Innovation Office, NKFIH, K-111827.
|
{
"pile_set_name": "ArXiv"
}
|
Q:
Deadlock in a simple PL/pgsql stored procedure that updates a single row (called by Hibernate)
I wrote a simple stored procedure:
CREATE OR REPLACE FUNCTION "public"."update_table01" (
int4, -- $1 (population)
int2 -- $2 (id)
) RETURNS "pg_catalog"."void" AS
$body$
BEGIN
UPDATE "table01"
SET
population = $1
WHERE id = $2;
END;
$body$
LANGUAGE 'plpgsql'
VOLATILE
CALLED ON NULL INPUT
SECURITY INVOKER
COST 100;
I am calling this within my Java server (jre7), and I'm using Hibernate 4 with C3P0 as my connection pool. This is being executed on PostgreSQL 9.2.4. I have a Hibernate entity corresponding to table01 (mapped by annotations), and I specified this procedure to be used as SQL update:
@SQLUpdate(sql = "{call update_table01(?, ?)}", callable = true)
When I did a load test with multiple threads (around 20-30) that were frequently calling this, a few deadlocks occurred, much to my surprise. Here is the relevant part of the log:
2013-08-14 14:51:19 CEST [23495]: [3-1] LOG: process 23495 detected deadlock while waiting for ShareLock on transaction 140127434 after 1000.048 ms
2013-08-14 14:51:19 CEST [23495]: [4-1] STATEMENT: update table01 set population=$1 where id=$2
2013-08-14 14:51:19 CEST [23495]: [5-1] ERROR: deadlock detected
2013-08-14 14:51:19 CEST [23495]: [6-1] DETAIL: Process 23495 waits for ShareLock on transaction 140127434; blocked by process 23481.
Process 23481 waits for ShareLock on transaction 140127431; blocked by process 23495.
Process 23495: update table01 set population=$1 where id=$2
Process 23481: update table01 set population=$1 where id=$2
2013-08-14 14:51:19 CEST [23495]: [7-1] HINT: See server log for query details.
2013-08-14 14:51:19 CEST [23495]: [8-1] STATEMENT: update table01 set population=$1 where id=$2
2013-08-14 14:51:19 CEST [23481]: [3-1] LOG: process 23481 still waiting for ShareLock on transaction 140127431 after 1000.086 ms
2013-08-14 14:51:19 CEST [23481]: [4-1] STATEMENT: update table01 set population=$1 where id=$2
2013-08-14 14:51:19 CEST [23481]: [5-1] LOG: process 23481 acquired ShareLock on transaction 140127431 after 1000.227 ms
2013-08-14 14:51:19 CEST [23481]: [6-1] STATEMENT: update table01 set population=$1 where id=$2
2013-08-14 14:51:19 CEST [23938]: [3-1] LOG: process 23938 still waiting for ExclusiveLock on tuple (8,72) of relation 16890 of database 16751 after 1000.119 ms
2013-08-14 14:51:19 CEST [23938]: [4-1] STATEMENT: update table01 set population=$1 where id=$2
2013-08-14 14:51:19 CEST [23938]: [5-1] LOG: process 23938 acquired ExclusiveLock on tuple (8,72) of relation 16890 of database 16751 after 1000.174 ms
2013-08-14 14:51:19 CEST [23938]: [6-1] STATEMENT: update table01 set population=$1 where id=$2
2013-08-14 14:51:19 CEST [23520]: [3-1] LOG: duration: 970.319 ms execute <unnamed>: update table01 set population=$1 where id=$2
2013-08-14 14:51:19 CEST [23520]: [4-1] DETAIL: parameters: $1 = '5731', $2 = '294'
2013-08-14 14:51:19 CEST [23481]: [7-1] LOG: duration: 1000.361 ms execute <unnamed>: update table01 set population=$1 where id=$2
2013-08-14 14:51:19 CEST [23481]: [8-1] DETAIL: parameters: $1 = '1586', $2 = '253'
2013-08-14 14:51:19 CEST [23524]: [3-1] LOG: duration: 531.909 ms execute <unnamed>: update table01 set population=$1 where id=$2
2013-08-14 14:51:19 CEST [23524]: [4-1] DETAIL: parameters: $1 = '1546', $2 = '248'
2013-08-14 14:51:19 CEST [23938]: [7-1] LOG: duration: 1004.863 ms execute <unnamed>: update table01 set population=$1 where id=$2
I am bad at interpreting Postgres logs, so correct me if I am wrong. I think this says that two processes ended up in a deadlock. Both were executing the same statement.
A lot of stuff puzzles me her. The most important is: I do not understand how could two processes (that even update different rows) end up in a deadlock, when only a single row-level lock for a row that has that specific ID is obtained in the stored procedure? This is the only procedure that changes this table. Isn't it supposed to obtain an exclusive lock (the same when executing SELECT ... FOR UPDATE)? Where do ShareLocks come from? What is that process that show in later lines (23938)? My best guess is that 23938 was also waiting for the lock, and when 23495 was killed, it acquired the lock.
Then I tried the following:
CREATE OR REPLACE FUNCTION "public"."update_table01" (
int4, -- $1 (population)
int2 -- $2 (id)
) RETURNS "pg_catalog"."void" AS
$body$
BEGIN
PERFORM 1 FROM "table01" WHERE id = $2 FOR UPDATE;
UPDATE "table01"
SET
population = $1
WHERE id = $2;
END;
$body$
LANGUAGE 'plpgsql'
VOLATILE
CALLED ON NULL INPUT
SECURITY INVOKER
COST 100;
When I ran it again, I couldn't reproduce it. There were no more deadlocks.
Why is this happening?
EDIT: After investigating a little bit, it seems that Hibernate is calling this method by itself sometimes when flushing session. Several times in some cases, for different entities, all in the same transaction. This can cause deadlocking because each call to update_table01() locks specific table01 column row with FOR UPDATE lock. With some improper call ordering, it can create a circular wait. After I made this entity non-updatable (i.e. marked all columns with update=false), everything works as it should. Now, I am really surprised with this Hibernate behaviour, because table01 entities in RAM were not attached to any of sessions which were responsible for later transactions. And yet, Hibernate flushed these entities to database, and I don't know why.
As for the locks, I've identified two more stored procedures of mine that insert/update to some other table which references table01 (one of them changes the FK column). These will request a ShareLock on the appropriate FK row in table01, and will, therefore, conflict with update_table01(). So these three stored procedures will wait for each other to complete. This alone cannot create a circular wait, but it becomes possible if you add a couple of Hibernate-caused calls to update_table01() after calls to these stored procedures.
A:
Firstly, the exclusive lock you see in:
ExclusiveLock on tuple (8,72) of relation 16890 of database 16751
This should hopefully be your "table01" - try:
SELECT * FROM pg_class WHERE oid = 16890;
Secondly, yes you have processes 23495 and 23481 blocking each other. PostgreSQL detects this after waiting 1 second and cancels 23495. Then, a few lines further down 23481 goes through after 1000.361ms.
To test this, you'll want two terminals open, each running psql. That way you can control the pauses in each. Issue a BEGIN in each and try running the update in both terminals. Take a look at the pg_locks view to see what's going on.
None of my experimenting has been able to reproduce this, and I can't see how it can.
The ShareLock you see is probably the one preventing changes to the table while the UPDATE occurs. You wouldn't want someone dropping the column you are trying to update.
Naturally, two share-locks can't conflict so there must be something else at work.
What does strike me from your log extract is that you have a number of other simple updates that are all sat there for what seems like a long time for such a simple update.
It's possible that the deadlock detector was mistaken - your server was just under extreme load and there was no conflict between your two transactions. If your deadlock_timeout setting was a bit longer this might never have happened.
|
{
"pile_set_name": "StackExchange"
}
|
Digital Strategy
Redefine the role that your organization will play in the near future, with a digital strategy designed for success. Drive real value for your consumers and optimal ROI for your business with our data-first approach. Innovation starts with planning and digital strategy is the key to the first step. Digital strategy is the foundation for building the systems of engagement, intelligence and record. Through analytical insight, data-driven consumer profiles and ROI-focused optimizations the usage of digital strategy is the key to lead generation and higher profit margins. Digital strategy is a key component of digital transformation so make it count.
|
{
"pile_set_name": "Pile-CC"
}
|
Paulding County, Georgia
Paulding County is a county located in the northwestern part of the U.S. state of Georgia. The estimated 2018 population is 164,044. It is a suburban Atlanta county and a part of "Metro" Atlanta. The county seat is Dallas.
Paulding County is included in the Atlanta-Sandy Springs-Roswell, GA Metropolitan Statistical Area. It is in Georgia's 14th congressional district.
The Paulding County Courthouse, in Dallas, is listed on the National Register of Historic Places.
History
Paulding County was created from Cherokee County by an act of the Georgia General Assembly on December 3, 1832. In 1851, a portion of Paulding County was used to help create Polk County. Other portions of Paulding County were annexed to neighboring counties (Campbell, Carroll, Cobb, Douglas, Haralson, and Polk) between 1832 and 1874. Between 1850 and 1874, Paulding County was expanded through annexation of parts of Carroll, Cobb, Douglas, and Polk counties.
The County is named after John Paulding (October 16, 1758 – February 18, 1818), who was famous for the capture of the British spy Major John André in 1780 during the American Revolution. André was on a mission carrying secret papers from Benedict Arnold when he was captured.
Geography
According to the U.S. Census Bureau, the county has a total area of , of which is land and (0.7%) is water. The Tallapoosa River originates in Paulding County.
The southeastern portion of Paulding County, from just north of Hiram to north of Villa Rica, is located in the Middle Chattahoochee River-Lake Harding sub-basin of the ACF River Basin (Apalachicola-Chattahoochee-Flint River Basin). The very western portion of the county, centered on State Route 101, is located in the Upper Tallapoosa River sub-basin of the ACT River Basin (Coosa-Tallapoosa River Basin), with the majority of the central and northern portions of Paulding County located in the Etowah River sub-basin of the same ACT River Basin.
Adjacent counties
Bartow County – north
Cobb County – east
Douglas County – southeast
Carroll County – south
Haralson County – southwest
Polk County – west
Transportation
Major highways
U.S. Route 278
State Route 6
State Route 6 Business
State Route 61
State Route 92
State Route 101
State Route 113
State Route 120
State Route 120 Connector
State Route 360
State Route 381
Secondary highways
Dallas-Acworth Highway (Old S.R. 381)
Ridge Road (Old S.R. 61 Connector). Connector in South Paulding that runs between SR 92 and SR 61
East Paulding Drive (Old S.R. 120 Connector, S.R. 92 Connector and S.R. 176). Road formerly known as Dragstrip Road
Goldmine Road (Old U.S. 278/S.R. 6). Former route to Yorkville.
Bill Carruth Parkway, formerly known as West Hiram Parkway, originally known as Egg Farm Road
Bobo Road (Old S.R. 92)
Macland Road (Old S.R. 360). All of Macland Road west of S.R. 120.
Mulberry Rock Road
Braswell Mountain Road
Cedarcrest Road
Seven Hills Boulevard
Harmony Grove Church Road
Dabbs Bridge Road
Vinson Mountain Road
Brushy Mountain Road
Nebo Road
Pedestrians and cycling
Dallas Trail Connect
Graves Path
Lindsey Path
Silver Comet Trail
Demographics
2000 census
As of the census of 2000, there were 81,678 people, 28,089 households, and 22,892 families living in the county. The population density was 261 people per square mile (101/km²). There were 29,274 housing units at an average density of 93 per square mile (36/km²). The racial makeup of the county was 90.59% White, 6.96% Black or African American, 0.30% Native American, 0.40% Asian, 0.03% Pacific Islander, 0.57% from other races, and 1.16% from two or more races. 1.71% of the population were Hispanic or Latino of any race.
There were 28,089 households out of which 46.20% had children under the age of 18 living with them, 68.30% were married couples living together, 9.00% had a female householder with no husband present, and 18.50% were non-families. 14.60% of all households were made up of individuals and 3.80% had someone living alone who was 65 years of age or older. The average household size was 2.89 and the average family size was 3.20.
In the county, the population was spread out with 30.70% under the age of 18, 7.60% from 18 to 24, 38.40% from 25 to 44, 17.40% from 45 to 64, and 5.90% who were 65 years of age or older. The median age was 31 years. For every 100 females, there were 100.20 males. For every 100 females age 18 and over, there were 96.80 males.
The median income for a household in the county was $52,161, and the median income for a family was $56,039. Males had a median income of $38,637 versus $27,341 for females. The per capita income for the county was $19,974. About 4.00% of families and 5.50% of the population were below the poverty line, including 5.60% of those under age 18 and 9.50% of those age 65 or over.
Paulding County Georgia is ranked 7th (2007 Census) in population growth among the United States. Being the 2nd Fastest growing county in Georgia. Also the 2nd fastest growing county in Metro Atlanta.
2010 census
As of the 2010 United States Census, there were 142,324 people, 48,105 households, and 38,103 families living in the county. The population density was . There were 52,130 housing units at an average density of . The racial makeup of the county was 77.7% white, 17.1% black or African American, 0.9% Asian, 0.3% American Indian, 1.7% from other races, and 2.3% from two or more races. Those of Hispanic or Latino origin made up 5.1% of the population. In terms of ancestry, 14.7% were Irish, 11.6% were American, 11.2% were German, and 10.4% were English.
Of the 48,105 households, 47.7% had children under the age of 18 living with them, 61.5% were married couples living together, 12.8% had a female householder with no husband present, 20.8% were non-families, and 16.6% of all households were made up of individuals. The average household size was 2.94 and the average family size was 3.30. The median age was 33.8 years.
The median income for a household in the county was $62,348 and the median income for a family was $67,117. Males had a median income of $50,114 versus $37,680 for females. The per capita income for the county was $23,450. About 7.0% of families and 8.2% of the population were below the poverty line, including 9.4% of those under age 18 and 11.8% of those age 65 or over.
Education
Media
The county legal organ is The Dallas New Era.
Recreation
Silver Comet Trail
White Oak Park
Ben Hill Strickland Park
Taylor Farm Parks & Recreation
Burnt Hickory Park
Union Park
Samuel U. Braly Sports Complex
Mt. Tabor Park
Sara Babb Park (City of Dallas)
Veteran's Memorial Park
Cities and communities
Incorporated cities
Dallas
Hiram
Braswell
Unincorporated communities
New Hope
Yorkville (95.8 SQ-Miles (1/3 of Paulding)) (Population: 17,526 (2011))
New Georgia (formerly known as Oval)
Nebo
Vinings
Sudie
Notable people
Jayne County, formerly known as Wayne County: legendary punk rock star who became an influential transgender musician after leaving Paulding County for New York City in 1968
Caleb Lee Hutchinson, American Idol finalist
Patty Loveless, country music star; and her husband, record producer Emory Gordy, Jr.
Marty Pevey, Iowa Cubs manager
Riley Puckett, country music pioneer
Spencer Scott, Playboy Playmate of the Month for October, 2007
Ray Traylor, former WWF superstar
Travis Tritt, country music recording artist
Zack Wheeler, New York Mets starting pitcher
Politics
Pauling County is governed by a five-member board of commissioners, including a chairman and four Post members.
See also
National Register of Historic Places listings in Paulding County, Georgia
References
External links
Paulding County Government
AccessPaulding.com
GeorgiaInfo Paulding County Courthouse History
Category:Georgia (U.S. state) counties
Category:1832 establishments in Georgia (U.S. state)
Category:Populated places established in 1832
Category:Counties in the Atlanta metropolitan area
Category:Counties of Appalachia
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Q:
Showing the bijection between countable dense subset of a metric space $E×\mathbb{Q}→$neighborhoods of $E$ with rational radius
Let $X$ be a separable metric space.
Let $E$ be a countable dense subset of $X$.
Let $p_i$ enumerate $E$ and $q_j$ enumerate $\mathbb{Q}$.
Let $G=\{N(p_i,q_j) \subset X | i,j\in \omega\}$
Then $G$ is a base for $X$.
Can one show the bijection between $E×\mathbb{Q}$ and $G$ in ZF?
I want to show that $G$ is countable, and since $E×\mathbb{Q}$ is countable, if i can show the bijection, proof will be done. Help
I don't know whether $f:(p,q)→N(p,q)$ is a bijection and even if it is a bijection, i have no idea how to show that $f$ is injective..
A:
The map $(p,q)\mapsto N(p,q)$ is not necessarily bijection. Take $X=E=\mathbb Z$ as an example. (For any $z\in\mathbb Z$ the ordered pairs $(z,\frac1n)$ are mapped to the same set $N(z,\frac1n)=\{z\}$.)
However, you can take some well-ordering on $E\times\mathbb Q$ and define
$$N(p,q)\mapsto \min\{(a,b)\in E\times\mathbb Q; N(a,b)=N(p,q)\}.$$
(If you prefer, you can get a well-ordering of order type $\omega$ on the set $E\times\mathbb Q$. This can be obtained using any bijection between $E\times\mathbb Q$ and $\omega$. Since you are given enumeration of $E$ and $\mathbb Q$, exhibiting such a bijection does not need axiom of choice.)
The image of this map is a subset of countable well-ordered set $E\times\mathbb Q$. Therefore it is again a countable well-ordered set. So it is in bijection with some countable ordinal.
Additional question in your comment:
How do I show that $G$ is not finite.
If $E$ is infinite, then $G$ cannot be finite.
Just show by induction on $i$ that for each $p_i$ you can find $r_i\in\mathbb Q$ such that $N(p_i,r_i)$ is different from $N(p_j,r_j)$ for each $j<i$.
This can be done by induction, in the inductive step you choose $r_i < \min \{d(p_i,p_j); j<i\}$. (Note that $ \{d(p_i,p_j); j<i\}$ is a finite set of positive real numbers, so the minimum of this set is a positive real number and there exists a rational number smaller than this minimum.)
Then $i\mapsto N(p_i,r_i)$ is an injective map $\omega\to G$. (The point $p_i$ is contained in $N(p_i,r_i)$, but it does not belong to any of the sets $N(p_j,r_j)$ for $j<i$. Therefore any two sets $N(p_i,r_i)$ and $N(p_j,r_j)$, $i\ne j$, are different.)
|
{
"pile_set_name": "StackExchange"
}
|
Tag: Pelican Bay short corridor
We prisoners need to prepare for a massive peaceful protest and work stoppage if prison officials don’t change 1) The culture to which prisoners and their families are subjected: so much mental and physical torment; 2) End long term solitary confinement, as they promised; and 3) Implement our five core demands. Too many humans are suffering who don’t need to be suffering.
Men at Calipatria on general population yards A, B and C can show the same courage as the hunger strikers, who are honored around the world, by pledging to respect the Agreement to End Hostilities and stop all fighting and riots between racial groups. The Agreement must continue to hold within all California prisons and unity needs to spread across the state. Only then can justice be won.
Our Five Core Demands of the hunger strikes have not been met. And we see that reform always equals revisionism, which means it’s no change. The food has literally gotten worse, although for a month they attempted to adequately feed us. The medical care continues to be inadequate. The educational programs and privileges are not afforded, and prisoners are still made to suffer in these inhumane conditions, now familiar to us for years on end.
The Bay View helps one keep in touch with the struggle, today and historically – uplifting and empowering our people. Salutations to those active in the struggle and to those behind the walls pushing the struggle, because it may very well be twice as hard, due to the physical and mental restraints you may endure because of your political, revolutionary endeavors. Stay strong, keep striving, never give up hope.
Arbitrary and indefinite solitary confinement is an absolute assault on humankind and a barbarity the likes of which cannot be tolerated. We hold the utmost respect for those prisoners who from the depths of Solitary Confinement throughout California risked their lives to be heard. We heard them and now we ask that you do the same.
|
{
"pile_set_name": "Pile-CC"
}
|
Sepsis is a major cause of morbidity and mortality in modern intensive care units (ICUs). Although several studies have provided epidemiological data on sepsis in ICU patients in the developed world \[[@CIT0001]\], there is limited information on the global burden of sepsis worldwide \[[@CIT0007], [@CIT0008]\]. Yet, such data are crucially important to (1) increase awareness of the global impact of sepsis, (2) highlight the need for continued research into potential preventive and therapeutic interventions, and (3) help guide resource allocation \[[@CIT0009]\]. Information on patterns of sepsis around the globe is also of interest, including causative microorganisms, primary source of infection, and associated outcomes.
In 2012, the World Federation of Societies of Intensive and Critical Care Medicine conducted a worldwide audit of data from ICUs around the world, providing a large database from which to extract information. We used these data to explore the characteristics of patients with sepsis around the world, including international differences in occurrence rates, causative microorganisms, and outcomes. We also evaluated some factors associated with in-hospital mortality in these patients.
METHODS {#s5}
=======
The worldwide Intensive Care over Nations (ICON) audit recruited ICUs by open invitation, through national scientific societies, national and international meetings, e-mail lists, and individual contacts. Participation was entirely voluntary, with no financial incentive. Ethics committee approval was obtained by the participating institutions according to local ethical regulations. Informed consent was not required for this observational and anonymous audit. Of the 730 ICUs contributing to the study from 84 countries (see the participants list in Appendix 1), 419 (57.4%) were in university/academic hospitals. The organizational characteristics of these centers have been described previously \[[@CIT0010]\].
Each ICU was asked to prospectively collect data on all adult (\>16 years) patients admitted to their ICU between May 8 and May 18, 2012, except those who stayed in the ICU for \<24 hours for routine postoperative surveillance. Readmissions of previously included patients were not included. Data were collected daily for a maximum of 28 days in the ICU. Outcome data were collected at the time of ICU and hospital discharge or at 60 days. Data were entered anonymously using electronic case report forms via a secured internet-based website. Data collection on admission included demographic data and comorbidities. Clinical and laboratory data for simplified acute physiology (SAPS) II \[[@CIT0011]\] and Acute Physiologic Assessment and Chronic Health Evaluation (APACHE) II \[[@CIT0012]\] scores were reported as the worst values within the first 24 hours after admission. A daily evaluation of organ function was performed according to the sequential organ failure assessment (SOFA) score \[[@CIT0013]\]; organ failure was defined as a SOFA subscore \>2 for the organ in question. Clinical and microbiologic infections were reported daily as well as antimicrobial therapy.
Infection was defined according to the criteria of the International Sepsis Forum \[[@CIT0014]\]. Sepsis was defined as the presence of infection with associated organ failure \[[@CIT0015]\]. Septic shock was defined as sepsis associated with cardiovascular failure requiring vasopressor support (SOFA cardiovascular of 3 or 4). Intensive care unit-acquired infection was defined as infection identified at least 48 hours after ICU admission. Non-ICU acquired infection was defined as infection present on admission or within the first 48 hours after ICU admission. Only the first episode of infection was considered in the analysis.
Detailed instructions and definitions were available through a secured website for all participants before starting data collection and throughout the study period. Any additional queries were answered on a per case basis. Validity checks were made at the time of electronic data entry, including plausibility checks within each variable and between variables. Data were further reviewed by the coordinating center for completeness and plausibility, and any doubts were clarified with the participating center. There was no on-site monitoring. We did not attempt to verify the pathogenicity of the microorganisms, including the relevance of *Staphylococcus epidermidis* or the distinction between colonization and infection.
For the purposes of this audit, we divided the world into 8 geographic regions: North America, South America, Western Europe, Eastern Europe, South Asia, East and Southeast Asia, Oceania, and Africa. Individual countries were also classified into 3 income groups according to the 2011 gross national income (GNI) per capita, calculated using the World Bank Atlas method \[[@CIT0016]\]: GNI \<\$4035 = low and lower middle income; GNI \$4036--12475 = upper middle income; and GNI \>\$12476 = high income.
Statistical Analysis {#s6}
--------------------
Data are shown as means with standard deviation (SD), mean and 95% confidence intervals (CIs), medians and interquartile ranges (IQRs), numbers, and percentages. Differences between groups in distribution of variables were assessed using analysis of variance, Kruskal-Wallis test, Student's *t* test, Mann-Whitney test, χ^2^ test, or Fisher's exact test as appropriate.
To identify the risk factors associated with in-hospital mortality in septic patients, we used a 3-level multilevel technique with the structure of an individual patient (level 1) admitted to a hospital (level 2) within a country (level 3). The explanatory variables considered in the model were as follows:
- Individual-level factors: age, sex, SAPS II score, type of admission, source of admission, mechanical ventilation or renal replacement therapy at any time during the ICU stay, comorbidities, onset of infection, site of infection, and the most common microorganisms
- Hospital-level factors: type of hospital; ICU specialty; total number of ICU patients in 2011; number of staffed ICU beds
- Country-level factors: GNI
Individual-level variables to be included in the final model were selected on the basis of a multilevel model including country-level and hospital-level factors and each of the individual-level factors; variables with *P* \< .2 were considered in the final model. Collinearity between variables was checked by inspection of the correlation between them, by looking at the correlation matrix of the estimated parameters, and by looking at the change of parameter estimates and at their estimated standard errors (SEs) \[[@CIT0017]\]. Q-Q plots were drawn to check for normality in the residuals. The results of fixed effects (measures of association) are given as odds ratios (ORs) with their 95% CIs and the 80% interval OR. Random effects (measures of variation) measures included the variance (var) and its SE and the median OR. The statistical significance of covariates was calculated using the Wald test.
Data were analyzed using IBM SPSS Statistics software, version 22 for Windows and R software, version 2.0.1 (CRAN project). All reported *P* values are 2-sided, and *P* \< .05 was considered to indicate statistical significance. The results of fixed effects are given as OR with 95% CIs.
RESULTS {#s7}
=======
Characteristics of the Study Group {#s8}
----------------------------------
A total of 10069 patients were included in the audit; 2973 patients (29.5%) had sepsis, including 1808 (18.0%) with sepsis at admission to the ICU ([Figure 1](#F1){ref-type="fig"}). In the whole cohort, antimicrobials were given to 5975 (59.3%) patients during their ICU stay. Patients with sepsis were older, had higher severity scores on admission to the ICU, had more comorbidities, and were more commonly receiving mechanical ventilation and renal replacement therapy on admission to the ICU than patients without sepsis ([Table 1](#T1){ref-type="table"}). Patients with sepsis also had more organ failures than the other patients (median \[IQ\]: 3 \[1--4\] vs 1 \[0--2\] organs; *P* \< .001).
{#F1}
######
Characteristics of the Study Cohort on Admission to the ICU According to the Presence of Sepsis^a^
-----------------------------------------------------------------------------------------------
Characteristics All Patients\ No Sepsis\ Sepsis\ *P* Value
N = 10069 N = 7096 N = 2973
--------------------------------------- --------------- ------------- ------------- -----------
Age, years, mean ± SD 60.0 ± 18.0 59.4 ± 18.4 61.5 ± 17.0 \<.001
Male, n (%) 5973 (60.1) 4177 (59.7) 1796 (61.0) .21
Severity scores, mean ± SD
SAPS II score 40.2 ± 18.2 36.4 ± 17.4 49.2 ± 16.6 \<.001
SOFA score 5 \[3--9\] 4 \[2--7\] 8 \[6--11\] \<.001
Type of admission, n (%) \<.001
Surgical 3432 (36.0) 2475 (37.0) 957 (33.7)
Medical 5382 (56.5) 3646 (54.6) 1736 (61.1)
Trauma 643 (6.8) 512 (7.7) 131 (4.6)
Other 66 (0.7) 49 (.7) 17 (.6)
Source of admission, n (%) \<.001
ER/ambulance 3814 (37.9) 2780 (39.2) 1034 (34.8)
Hospital floor 2625 (26.1) 1664 (23.4) 961 (32.3)
OR/recovery 1811 (18.0) 1363 (19.2) 448 (15.1)
Other hospital 981 (9.7) 652 (9.2) 329 (11.1)
Other 838 (8.3) 637 (9.0) 201 (6.8)
Comorbidities, n (%)
COPD 1240 (12.3) 788 (11.1) 452 (15.2) \<.001
Cancer 1049 (10.4) 710 (10.0) 339 (11.4) .04
Diabetes mellitus, insulin-dependent 972 (9.7) 664 (9.4) 308 (10.4) .12
Heart failure, NYHA III/IV 921 (9.1) 588 (8.3) 333 (11.2) \<.001
Chronic renal failure 912 (9.1) 582 (8.2) 330 (11.1) \<.001
Cirrhosis 349 (3.5) 217 (3.1) 132 (4.4) \<.001
Immunosuppression 346 (3.4) 177 (2.5) 169 (5.7) \<.001
Metastatic cancer 332 (3.3) 221 (3.1) 111 (3.7) .11
Haematologic cancer 212 (2.1) 99 (1.4) 113 (3.8) \<.001
HIV infection 71 (.7) 37 (.5) 34 (1.1) \<.001
Number of comorbidities, n (%) \<.001
None 5512 (54.7) 4145 (58.4) 1367 (46.0)
1 2800 (27.8) 1880 (26.5) 920 (30.9)
2 1207 (12.0) 740 (10.4) 467 (15.7)
3 416 (4.1) 249 (3.5) 167 (5.6)
≥4 134 (1.3) 82 (1.2) 52 (1.7)
Procedures, n (%)
Mechanical ventilation 4776 (47.4) 2755 (38.8) 2021 (68.0) \<.001
Renal replacement therapy 537 (5.3) 264 (3.7) 273 (9.2) \<.001
Antimicrobials, n (%) 5975 (59.3) 3002 (42.3) 2973 (100) \<.001
Antibiotic 5935 (58.9) 2979 (42.0) 2956 (99.4) \<.001
Antifungal 784 (7.8) 202 (2.8) 582 (19.6) \<.001
Antiviral 273 (2.7) 80 (1.1) 193 (6.5) \<.001
-----------------------------------------------------------------------------------------------
Abbreviations: COPD, chronic obstructive pulmonary disease; ER, emergency room; HIV, human immunodeficiency virus; ICU, intensive care unit; NYHA, New York Heart Association Classification; OR, operating room; SAPS, simplified acute physiology; SOFA, sequential organ assessment; SD, standard deviation.
^a^Valid percentages are given after exclusion of missing values (data missing from 546 patients for type of admission).
Patterns of Infections {#s9}
----------------------
The most common source of sepsis was the respiratory tract (67.4%) followed by the abdomen (21.8%) ([Supplementary Table E1](#sup1){ref-type="supplementary-material"}). Positive isolates were retrieved in 69.6% (n = 2069) of patients with sepsis; two thirds of these patients had Gram-negative microorganisms isolated and half had Gram-positive microorganisms; 1068 (51.6%) of the sepsis patients with positive isolates had more than 1 microorganism isolated ([Table 2](#T2){ref-type="table"}). Patients with urinary tract (82.6% vs 43.9%), abdominal (77.1% vs 50.8%), and respiratory tract (70.0% vs 51.4%) infections were more likely to have Gram-negative than Gram-positive isolates ([Supplementary Table E1](#sup1){ref-type="supplementary-material"}). Microbiological patterns varied around the globe ([Table 2](#T2){ref-type="table"}), with Gram-positive isolates being much less frequent (21.4%) in South Asia than in other regions. Methicillin-resistant *Staphylococcus aureus* (MRSA) was more common in the Middle East (14.4%) and North America (12.8%) than in Western Europe (6.1%). *Klebsiella* spp isolates were most commonly reported in Africa (31.3%), Eastern Europe (28.5%), and South America (24.7%), and *Pseudomonas* spp was most frequent in Eastern Europe (21.1%) and South America (20.4%). Fungal organisms contributed to 14.5% and 14.8% of isolates in Western and Eastern Europe, respectively, but to only 5.1% of isolates in North America.
######
Distribution of the Most Common Microorganisms in Patients With Positive Isolates and Mortality Rates According to Geographic Region
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Characteristic All Patients Western\ Eastern\ South\ North\ East and\ South\ Oceania Middle\ Africa
Europe Europe America America Southeast Asia Asia East
------------------------------------------------- -------------- ------------- ------------ ------------ ------------ ---------------- ------------ ------------ ------------ -----------
Total number of patients, n 10 069 4335 1110 993 730 946 982 439 393 141
Patients with sepsis, n (%) 2973 (29.5) 1357 (31.3) 336 (30.3) 303 (30.5) 147 (20.1) 372 (39.3) 134 (13.6) 135 (30.8) 151 (38.4) 38 (27.0)
Patients with positive isolates, n (%)^a^ 2069 (69.6) 947 (69.8) 256 (76.2) 186 (61.4) 117 (79.6) 240 (64.5) 84 (62.7) 105 (77.8) 118 (78.1) 16 (42.1)
Gram-positive, n (%) 1030 (49.8) 517 (54.6) 144 (56.3) 84 (45.2) 59 (50.4) 86 (35.8) 18 (21.4) 57 (54.3) 58 (49.2) 7 (43.8)
Methicillin-sensitive *Staphylococcus aureus* 257 (12.4) 120 (12.7) 37 (14.5) 29 (15.6) 14 (12.0) 25 (10.4) 6 (7.1) 14 (13.3) 10 (8.5) 2 (12.5)
Methicillin-resistant *S aureus* 151 (7.3) 58 (6.1) 20 (7.8) 15 (8.1) 15 (12.8) 14 (5.8) 2 (2.4) 9 (8.6) 17 (14.4) 1 (6.3)
Coagulase-negative *Staphylococcus* 500 (24.2) 269 (28.4) 79 (30.9) 39 (21.0) 25 (21.4) 25 (10.4) 11 (13.1) 19 (18.1) 27 (22.9) 6 (37.5)
*Streptococcus*, D group 84 (4.1) 52 (5.5) 10 (3.9) 5 (2.7) 5 (4.3) 3 (1.3) \- 6 (5.7) 3 (2.5) \-
*Streptococcus*, Others 222 (10.7) 109 (11.5) 25 (9.8) 12 (6.5) 15 (12.8) 27 (11.3) 1 (1.2) 15 (14.3) 16 (13.6) 2 (12.5)
Other Gram-positive cocci 46 (2.2) 19 (2.0) 11 (4.3) \- 3 (2.6) 7 (2.9) \- 4 (3.8) 2 (1.7) \-
Gram negative, n (%) 1389 (67.1) 610 (64.4) 189 (73.8) 140 (75.3) 65 (55.6) 159 (66.3) 67 (79.8) 66 (62.9) 84 (71.2) 9 (56.3)
*Escherichia coli* 470 (22.7) 236 (24.9) 57 (22.3) 51 (27.4) 22 (18.8) 35 (14.6) 22 (26.2) 25 (23.8) 19 (16.1) 3 (18.8)
*Klebsiella* spp 356 (17.2) 124 (13.1) 73 (28.5) 46 (24.7) 13 (11.1) 45 (18.8) 18 (21.4) 13 (12.4) 19 (16.1) 5 (31.3)
*Pseudomonas* spp 337 (16.3) 147 (15.5) 54 (21.1) 38 (20.4) 18 (15.4) 35 (14.6) 13 (15.5) 12 (11.4) 20 (16.9) \-
*Acinetobacter* spp 243 (11.7) 39 (4.1) 55 (21.5) 36 (19.4) 5 (4.3) 51 (21.3) 24 (28.6) 1 (1.0) 29 (24.6) 3 (18.8)
*Enterobacter* spp 188 (9.1) 91 (9.6) 45 (17.6) 13 (7.0) 3 (2.6) 11 (4.6) 10 (11.9) 8 (7.6) 5 (4.2) 2 (12.5)
*Proteus* spp 121 (5.8) 63 (6.7) 25 (9.8) 6 (3.2) 5 (4.3) 7 (2.9) 1 (1.2) 5 (4.8) 6 (5.1) 3 (18.8)
Gram-negative, others 320 (15.5) 174 (18.4) 35 (13.7) 20 (10.8) 14 (12.0) 32 (13.3) 4 (4.8) 17 (16.2) 22 (18.6) 2 (12.5)
Anaerobes, n (%) 79 (3.8) 45 (4.8) 12 (4.7) 3 (1.6) 8 (6.8) 4 (1.7) \- 4 (3.8) 2 (1.7) 1 (6.3)
Other bacteria, n (%) 18 (0.9) 4 (0.4) 2 (0.8) 2 (1.1) 1 (0.9) 5 (2.1) 1 (1.2) 2 (1.9) 1 (0.8) \-
Fungi, n (%) 266 (12.9) 137 (14.5) 38 (14.8) 18 (9.7) 6 (5.1) 31 (12.9) 8 (9.5) 10 (9.5) 16 (13.6) 2 (12.5)
*Candida albicans* 185 (8.9) 93 (9.8) 31 (12.1) 9 (4.8) 3 (2.6) 23 (9.6) 6 (7.1) 9 (8.6) 10 (8.5) 1 (6.3)
*Candida* non-*albicans* 89 (4.3) 47 (5.0) 8 (3.1) 8 (4.3) 2 (1.7) 11 (4.6) 4 (4.8) 4 (3.8) 4 (3.4) 1 (6.3)
Fungi, others 44 (2.1) 28 (3.0) 4 (1.6) 2 (1.1) 1 (0.9) 5 (2.1) \- \- 4 (3.4) \-
Viruses and parasites, n (%) 59 (2.9) 31 (3.3) 5 (2.0) 6 (3.2) 2 (1.7) 10 (4.2) \- 1 (1.0) 3 (2.5) 1 (6.3)
Mortality rates in patients with sepsis, n (%)
Intensive care unit 753 (25.8) 309 (22.9) 118 (35.3) 102 (36.3) 27 (18.5) 76 (21.2) 37 (28.9) 16 (11.9) 53 (35.6) 15 (39.5)
Hospital 1004 (35.3) 439 (33.3) 146 (44.8) 119 (45.4) 37 (25.2) 108 (31) 44 (35.2) 26 (19.3) 68 (46.6) 17 (47.2)
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
^a^In patients with sepsis.
Patients with ICU-acquired infections (n = 764) were younger, more likely to be surgical admissions, and had lower SAPS II and SOFA scores on admission to the ICU, compared with those who had infections within the first 48 hours on the ICU ([Table 3](#T3){ref-type="table"} and [Supplementary Table E2](#sup1){ref-type="supplementary-material"}). Respiratory and catheter-associated infections were more frequent and abdominal infections less frequent in patients with ICU-acquired than in those with non-ICU-acquired infections ([Supplementary Table E2](#sup1){ref-type="supplementary-material"}). Patients with ICU-acquired infections were more likely to have positive isolates than patients with non-ICU-acquired infections (79.5% vs 66.2%, *P* \< .001) ([Supplementary Table E3](#sup1){ref-type="supplementary-material"}).
######
Severity Scores on Admission to the ICU, Maximum Number of Organ Failure, and Mortality Rates According to Sepsis Status
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Severity Scores, Mean ± SD\ Mortality Rates, % (95% CI)
------------------------------------- ------ ----------------------------- --------------- ----------------- ----------------------------- ---------------------- ----------------------
Onset of Sepsis
Within the first 48 hours^d^ 2209 50.5 ± 16.8 9.2 ± 3.9 5 \[2--10\] 3 \[2--4\] 26.0 (24.2--27.9) 35.8 (33.8--37.9)
Later 764 45.4 ± 15.5^e^ 7.5 ± 3.8^e^ 12 \[6--19\]^e^ 3 \[2--4\] 25.1 (22.0--28.3) 33.8 (30.3--37.2)
Severity of Sepsis on ICU Admission
No sepsis^d^ 8261 37.8 ± 17.5 5.3 ± 4.1 3 \[1--5\] 1 \[0--2\] 13.6 (12.9--14.4) 19.0 (18.1--19.9)
Sepsis without shock 822 46.2 ± 15.4^e^ 7.4 ± 2.9^e^ 5 \[2--9\]^e^ 2 \[1--3\]^e^ 20.1 (17.4--22.9)^e^ 30.3 (27.1--33.6)^e^
Septic shock 986 55.1 ± 17.2^e^ 11.3 ± 3.6^e^ 5 \[2--11\]^e^ 3 \[2--4\]^e^ 33.7 (30.7--36.7)^e^ 43.0 (39.9--46.2)^e^
Severity of Sepsis During ICU Stay
No sepsis^d^ 7096 36.4 ± 17.4 4.9 ± 4.0 2 \[1--4\] 1 \[0--2\] 12.1 (11.3--12.8) 16.7 (15.8--17.6)
Sepsis without shock 1292 44.6 ± 15.3^e^ 7.0 ± 3.2^e^ 6 \[3--11\]^e^ 2 \[1--3\]^e^ 14.3 (12.4--16.2)^f^ 23.6 (21.3--26.0)^e^
Septic shock 1681 52.7 ± 16.7^e^ 10.1 ± 3.9^e^ 7 \[3--14\]^e^ 3 \[2--4\]^e^ 34.6 (32.3--36.9)^e^ 44.2 (41.7--46.6)^e^
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Abbreviations: CI, confidence interval; ICU, intensive care unit; IQR, interquartile; LOS, length of stay; SAPS, simplified acute physiology score; SD, standard deviation; SOFA, sequential organ failure assessment score.
Missing observations: ^a^489, ^b^401, ^c^797.
^d^The reference group.
^e^ *P* \< .01 among groups.
^f^ *P* \< .05 among groups.
Outcomes {#s10}
--------
Intensive care unit mortality rates were 25.8% in patients with sepsis and 12.1% in those without (*P* \< .001); hospital mortality rates were 35.3% vs 16.7%, *P* \< .001). Intensive care unit and hospital mortality rates varied from 11.9% and 19.3% (Oceania) to 39.5% and 47.2% (Africa), respectively ([Table 2](#T2){ref-type="table"}). Intensive care unit length of stay was longer (6 \[3--13\] vs 2 \[1--4\] days, *P* \< .001) in patients with than in those without sepsis. As expected, there was a stepwise increase in ICU and hospital mortality rates according to the severity of sepsis ([Table 3](#T3){ref-type="table"}). Although patients with ICU-acquired sepsis had longer ICU stays than those who had sepsis within 48 hours of admission to the ICU, they did not have higher mortality rates ([Table 3](#T3){ref-type="table"}).
The crude risk of in-hospital death was higher in patients with infections caused by *Pseudomonas* spp, *Acinetobacter* spp, and fungi ([Table 4](#T4){ref-type="table"}). In the multilevel analysis, independent risk factors for in-hospital death in patients with sepsis were older age, higher SAPS II score, cirrhosis, metastatic cancer, chronic heart failure (NYHA III/IV), use of mechanical ventilation or renal replacement therapy at any time during the ICU stay, and infection with *Acinetobacter* spp ([Supplementary Table E4](#sup1){ref-type="supplementary-material"}). The use of mechanical ventilation and presence of comorbid cirrhosis more than doubled the risk of death. The relative risk of death was higher in patients admitted to ICUs in countries with upper middle GNI than in those with high GNI (1.77 \[1.31--2.39\], *P* \< .001). However, although the model suggested significant between-hospital variation (var = 0.28, *P* = .001) in the individual risk of in-hospital death, the between-country variation was not significant.
######
Outcome According to Isolated Microorganisms in Patients With Sepsis (n = 2973)
----------------------------------------------------------------------------------------------------------------------------------------------
Risk Factor ICU Mortality,\ Hospital Mortality, n (%) Crude Risk of In- Hospital Death\ *P* Value
n (%) OR (95% CI)
------------------------------------------------ ----------------- --------------------------- ----------------------------------- -----------
Gram-positive 267 (26.2) 360 (36.0) 1.05 (0.89--1.23) .55
*Staphylococcus aureus* methicillin sensitive 71 (28.0) 89 (36.0) 1.04 (0.79--1.36) .80
MRSA 36 (24.2) 51 (34.7) 0.97 (0.69--1.38) .87
*Staphylococcus*, coagulase negative 129 (26.0) 184 (37.9) 1.14 (0.93--1.40) .20
*Streptococcus*, D group 16 (19.3) 22 (27.5) 0.69 (0.42--1.13) .14
*Streptococcus*, others 57 (26.1) 77 (35.8) 1.02 (0.77--1.37) .87
Other Gram-positive cocci 9 (19.6) 13 (29.5) 0.77 (0.40--1.47) .42
Gram negative 364 (26.6) 492 (37.0) 1.15 (0.99--1.34) .07
*Escherichia coli* 114 (24.7) 162 (36.0) 1.04 (0.84--1.28) .74
*Enterobacter* spp 45 (24.1) 67 (36.8) 1.07 (0.79--1.46) .66
*Klebsiella* spp 92 (26.4) 128 (37.9) 1.13 (0.90--1.43) .29
*Acinetobacter* spp 88 (37.0) 110 (48.0) 1.78 (1.36--2.33) \<.01
*Proteus* spp 28 (23.1) 40 (33.6) 0.92 (0.63--1.36) .69
*Pseudomonas* spp 100 (30.1) 131 (40.4) 1.28 (1.01--1.62) .04
Gram negative, others 82 (25.9) 110 (35.7) 1.02 (0.80--1.31) .87
Anaerobes 23 (29.1) 31 (39.7) 1.22 (0.77--1.93) .41
Other bacteria 6 (33.3) 7 (38.9) 1.17 (0.45--3.02) .75
Fungi 77 (29.2) 107 (41.6) 1.34 (1.04--1.75) .03
*Candida albicans* 49 (26.8) 71 (39.9) 1.23 (0.90--1.68) .19
*Candida* non-*albicans* 26 (29.2) 38 (43.7) 1.44 (0.93--2.21) .10
Fungi, others 16 (36.4) 20 (45.5) 1.54 (0.85--2.80) .16
Viruses and parasites 16 (28.1) 21 (36.8) 1.07 (0.62--1.84) .81
----------------------------------------------------------------------------------------------------------------------------------------------
Abbreviations: CI, confidence interval; ICU, intensive care unit; MRSA, methicillin-resistant *Staphylococcus aureus*; OR, odds ratio.
DISCUSSION {#s11}
==========
The present audit confirms the considerable burden that sepsis presents in modern ICUs. This large study, including more than 10000 patients from 730 ICUs, indicates that approximately 30% of all ICU patients have sepsis, as defined by the presence of infection and organ dysfunction. This percentage is identical to that (29.5%) reported in the earlier Sepsis Occurrence in Acutely Ill Patients (SOAP) study \[[@CIT0001]\], a large European study that used the same methodology, and in a recent analysis of a large United Kingdom database \[[@CIT0018]\], but somewhat higher than in some other large studies \[[@CIT0004], [@CIT0005], [@CIT0019], [@CIT0020]\]. In addition to possible differences associated with different definitions of sepsis used in the various studies, 2 other major elements may account for these apparent inconsistencies. First, we did not include all patients admitted to the ICU, but only critically ill patients, excluding patients admitted to the ICU for postoperative surveillance without complications. Second, some studies focused on admission data \[[@CIT0020]\]; if we consider only the patients who had sepsis on admission in our study, the rate of sepsis was 18%. More importantly, the percentage of ICU patients with sepsis varied around the globe, with particularly high rates in East and Southeast Asia, confirming the high disease burden in this area \[[@CIT0021], [@CIT0022]\]. Although these data were collected in 2012, we believe they are still relevant, especially given the general lack of global data in this regard.
A strength of the present study compared with studies assessing only sepsis on admission or prevalence studies (eg, EPIC II \[[@CIT0002]\]) is that patients were followed throughout the ICU course, enabling evaluation of sepsis that developed during the ICU stay as well as sepsis present on admission. It is interesting to note that patients with ICU-acquired sepsis had similar outcomes to those of patients with sepsis on admission, and ICU-acquired sepsis was not independently associated with a higher risk of mortality after adjusting for confounders in the multilevel analysis. Although we were unable to assess this specifically, van Vught et al \[[@CIT0023]\] recently reported a low attributable mortality of ICU-acquired infections. Shankar-Hari et al \[[@CIT0024]\] reported that the inferred causal link between sepsis and long-term mortality was significantly confounded by age, comorbidity, and preacute illness trajectory. More importantly, in our multivariable regression analysis, all the above-mentioned factors were found to be significant determinants of mortality, suggesting that ICU-acquired sepsis may not on its own be a causative factor for mortality. Nevertheless, nosocomial infections are responsible for prolonged stays in the ICU and increased costs \[[@CIT0025], [@CIT0026]\].
Positive isolates were obtained in 70% of the patients with sepsis, a similar finding to that reported in other studies \[[@CIT0001], [@CIT0019], [@CIT0027], [@CIT0028]\]. Two thirds of these patients had Gram-negative organisms isolated and one half had Gram-positive organisms isolated. The most common Gram-negative microorganisms recovered were *E coli*, *Klebsiella* spp, *Pseudomonas* spp, and *Acinetobacter* spp, as in previous studies \[[@CIT0001], [@CIT0027], [@CIT0028]\]. It is interesting to note that Gram-positive organisms were more common in North America than in other parts of the world; MRSA was also more common in North America than in other parts of the world except the Middle East. These findings are important when using guidelines for management of infection and sepsis, because guidelines developed in one part of the world, for example North America, may not be relevant to other areas. The results also underline the ongoing importance of fungal infections, which were involved in 13% of cases of sepsis overall, although the frequency was lower in the United States (5%), perhaps because more stringent criteria are used to characterize fungal infections in the United States. Finally it is noteworthy that approximately 42% of patients without sepsis received antimicrobial agents. The reasons for this are unclear, but antimicrobials may still be prescribed despite sepsis resolution or exclusion. In a retrospective analysis of 269 patients who were diagnosed with suspected sepsis in the emergency department and started on antibiotic therapy, 29% of the patients were found not to have bacterial disease, but the median duration of antibiotics in these patients was still 7 days (IQR, 4--10) \[[@CIT0029]\].
Intensive care unit mortality rates in patients with sepsis were approximately 26% and were twice as high as those in nonseptic patients. This percentage is lower than the 32% observed in the SOAP study (using their "severe sepsis" definition that is equivalent to our current definition of sepsis) \[[@CIT0001]\] and in other studies \[[@CIT0001], [@CIT0019], [@CIT0027], [@CIT0028]\]. Intensive care unit mortality rates in patients with septic shock were approximately 35%, a percentage that is also lower than that reported in earlier studies \[[@CIT0001], [@CIT0005]\]. Increased awareness of sepsis diagnosis and improved early management may have contributed to improved outcomes over time. Mortality rates varied around the globe, but in multivariable analysis, the between-country variation was not significant. These findings are in contrast to those from the International Multicenter Prevalence Study on Sepsis (IMPreSS) study of 1794 patients with sepsis from 62 countries, in which mortality rates were higher in East Europe and Central/South America compared with North America after adjustment for adjusted for ICU admission, sepsis status, location of diagnosis, origin of sepsis, APACHE II score, and country \[[@CIT0030]\].
As expected, nonsurvivors were older and had more comorbidities. As in previous ICU studies \[[@CIT0001], [@CIT0002]\], *Pseudomonas* and fungal infections were associated with worse outcomes, although only *Acinetobacter* infection was an independent predictor for hospital death in the multilevel analysis. More importantly, our data do not infer a cause-effect relationship, and the presence of *Acinetobacter* may simply be a marker of severity. In a systematic review of 6 matched case-control and cohort studies, Falagas et al \[[@CIT0031]\] reported that *Acinetobacter* infection was associated with increased attributable mortality, although others have suggested no independent link between *Acinetobacter* infection and increased risk of death \[[@CIT0032]\].
Mechanical ventilation at any time during the ICU stay and pre-existing liver cirrhosis were also important prognostic factors, more than doubling the risk of death. Use of renal replacement therapy at any time during the ICU stay was also associated with increased mortality. We also identified significant between-center variation, suggesting that differences in local ICU organization may have an impact on outcomes of patients with sepsis. Some of the potential factors associated with between-center outcomes differences have been identified in the literature. In an international cohort of 13796 ICU patients, Sakr et al \[[@CIT0033]\] reported that a high nurse/patient ratio was independently associated with a lower risk of in-hospital death. Gaieski et al \[[@CIT0034]\] reported that sepsis outcomes were improved in centers with higher sepsis case volumes. In a multicenter study in Canada, Yergens et al \[[@CIT0035]\] reported that ICU occupancy\>90% was associated with an increase in hospital mortality in patients with sepsis admitted from the emergency department. We are unable to identify which particular organizational factors may have influenced outcomes from our data, and this is an area that needs further study.
Our database was very large, including considerable data on demographics, organ function, and outcomes. Nevertheless, to successfully collect a large amount of data in many ICUs requires some limitations in the level of detail of the collected data; therefore, we did not collect precise information on all subtypes of microorganisms or their resistance patterns or on the appropriateness of antimicrobial coverage. Moreover, data were collected by ICU doctors or research nurses who may not have specific expertise in infectious diseases, although the significance of this is uncertain. Our study has other limitations. First, although the audit included a large number of ICUs, the purely voluntary nature of the participation may have an impact on the representativeness of the data. Second, data collection was not monitored so small errors could not be corrected; only obvious incongruous data were verified. Third, in some countries, identification of microorganisms may have been incomplete because of the limited availability of microbiological testing. Moreover, the quality of the antimicrobials used in the treatment of infection has also been questioned in low-resource countries \[[@CIT0036]\]. Fourth, there was no means of differentiating between colonization and infection for some organisms, including *Acinetobacter* and coagulase-negative staphylococci. Therefore, microorganisms were weighted equally in the multilevel analysis. The absence of comparative large epidemiologic data that address this issue makes it difficult to judge whether the estimates of microorganisms provided in our study overestimate the frequency of these infections. Fifth, data were collected for the same period in all regions and therefore do not take into account any possible influence of seasonal variation. Sixth, we did not use the exact recent Sepsis-3 definitions \[[@CIT0037]\], which were published after our study, partly because we had no data on the evolution of SOFA scores before ICU admission and blood lactate levels were not available in all patients. Nevertheless, we used a definition based on the presence of organ dysfunction, a key feature of Sepsis-3. Finally, despite adjusting for a large number of variables that may influence outcome, the results of the multilevel analysis could not take into account other unmeasured variables that may have been of potential significance.
CONCLUSIONS {#s12}
===========
Sepsis, as defined by infection with organ dysfunction, remains a major health problem in ICU patients worldwide, associated with high mortality. There is wide variation in sepsis rates, causative microorganisms, and outcome in ICU patients around the world. A history of liver cirrhosis or metastatic cancer, use of mechanical ventilation or renal replacement therapy, and *Acinetobacter* infection were independently associated with an increased risk of in-hospital death. Global epidemiological data such as these help increase awareness of sepsis and provide crucial information for future healthcare planning. Further studies in this field should be done on a regular basis with standardized methodology to ensure the comparability of the results.
Supplementary Data {#s13}
==================
Supplementary materials are available at *Open Forum Infectious Diseases* online. Consisting of data provided by the authors to benefit the reader, the posted materials are not copyedited and are the sole responsibility of the authors, so questions or comments should be addressed to the corresponding author.
######
Click here for additional data file.
We thank Dr. Hassane Njimi (Department of Intensive Care, Erasme University Hospital, Brussels, Belgium) for help with the statistical analyses.
***Potential conflicts of interest.*** All authors: No reported conflicts of interest. All authors have submitted the ICMJE Form for Disclosure of Potential Conflicts of Interest.
|
{
"pile_set_name": "PubMed Central"
}
|
It is difficult to describe the predicament facing the people of Kinglake.
On the one hand they are deep in grief over the loss of friends and relatives, neighbours and acquaintances from their town.
They have got a massive clean-up in front of them, funerals to attend and children to care for. And then there are other old echoes of their previous lives.
Different banks seem to have different ideas about how the bushfire survivors should go about resuming mortgage repayments on houses that no longer exist.
Matt Falla says he is lucky his house survived, but just when he is getting back on his feet, he has had to worry about his mortgage.
"My wife went to the Commonwealth Bank who we have a mortgage with and spoke to the manager about some relief assistance with our mortgage," he said.
"I'm a sub-contract carpenter so I am unable to work at the moment.
"My wife does work part-time but she is unable to work. We are caring for our daughter because there is no schooling.
"We've been told that we can have a suspension of repayments for a period of three months, but at the end of that three months we need to repay the interest in full."
Mr Falla says should his mortgage line of credit go over its limit during that time, the excess amount will be charged at double the normal rate of interest.
"I relayed the story to our neighbour, Justin, who we fought the fire with on Saturday. He banks with the Bendigo Bank and they have suspended their mortgage for a period of three months on their principal and interest and they don't have to pay anything after that period."
Commonwealth Bank's national spokesman Steve Batton says the bank assesses each customer on an individual basis.
"Some customers have different needs to others," he said. "What we are looking at in the interim is a three-month moratorium.
"However as mentioned, we will look at individual customers' needs and assess whether or not there is a requirement for an extension."
Fiona Leadbeater, who lost her home in the fires, said her mortgage was the last thing on her mind.
"I have been too concerned about friends and family who have lost loved ones and just trying to help get the community back on its feet," she said.
"I am in a fortunate position that I don't have a house any more but only have a small mortgage.
"I feel very sorry for people that have got a large one because it must be a huge burden on top of everything else that has happened to them."
Mr Falla says a compulsion to stay and help his fellow residents outweighs any pressure to earn money to pay off his mortgage.
"I can't with my conscience, hop into my car, drive down to Melbourne to work to pay for a mortgage when I have got dead friends still on the ground," he said.
"Others who have no home. Others who are hurting and are injured and I am a builder and a carpenter and I can help here.
"I just can't do it."
|
{
"pile_set_name": "OpenWebText2"
}
|
Bloated Candy Crowley not concerned about Obama’s lack of diversity then gets destroyed by NRA President David Keen over gun sales (Video)
You see, since Obama is a Democrat, the fact that his cabinet appointees are nothing but pasty white middle aged men doesn’t matter. Had this been Mitt Romney, the media, including the whale Candy Crowley would be yelling at the top of their lungs at the lack of diversity in a Romney cabinet. Candy Crowley actually began a segment on the subject by asking her guests about the lack of diversity with the question “Does it matter?” As far as I’m concerned, I want the best individuals at the top position on government, regardless of race or gender. To me it doesn’t matter. But the hypocrisy of these leftist media hacks is just astounding.
Then as usual the the topic of gun control came up. Candy Crowley decided to badger NRA President David Keene. Not taking any BS, Keene destroyed Crowley and told her that the two people who are selling so-called assault rifles are Senator Feinstein and President Obama not us. Being that this was on CNN, hardly anyone of course watched it. More people will watch these two videos on various web sites, than actually saw the broadcast.
A note about comments: All discussion, comments are welcome. Because of progressive paid trolls, all offsite links go directly to moderation. You aren't being censored, it's because of these leftist paid trolls spamming their left wing hate sites that moderation of all off site links must be verified.
It is up to the moderators to allow or delete comments. Comments that contain spam, ads, threats of violence, anti-Semitism, racism or personal attacks on other commentators may be removed and result in a permanent ban.
|
{
"pile_set_name": "Pile-CC"
}
|
This invention relates to an illuminated system and, more specifically, to an optical dispersion system, wherein light provided through fiber optic fibers are magnified, reflected and refracted to produce a more brilliantly illuminated appearance.
With the advent of fiber optic lighting, many devices which have used other forms of lighting have begun moving away from other lighting systems, such as neon lights, to provide color-specific illumination of signs. Fiber optic lighting is used for many various types of signs. Such examples include signs that advertise businesses, billboards, and channel letters.
Typically, fiber optic lighting is used under two different concepts. The first is using the end, tip, or end glow, of a fiber strand, with a plurality of other fiber strands to produce the desired features of the sign. Under this concept, a greater number of strands are needed to produce the illustrated effect desired by a user. Viewing the a sign using fiber optic strands in this configuration, an observer can see the individual strands appearing as dots when viewed from certain distances from the sign.
Under another concept, instead of using the end of the fiber optic cables, the longitudinal side of a strand, or a bundle of strands are used to provide the desired illumination, referred to as side glow. Applicant believes that this concept is limiting, since even though this approach may be ideal for spelling out words, the amount of lamination is limited.
In view of the perceived limitations of the current state of the art, manufacturers of products, such as, but not limited, signs, including billboards, would benefit from an illumination system in which fiber optics are used to provide illumination. Such individuals would also benefit from fiber optic signage wherein the illumination emitting from a sign is uniform, even when viewed from various angles. Additionally users would benefit from an illumination system that consumes less electricity since fewer optical strands are illuminated which in turn is more environmentally beneficial since fewer strands would need to be manufactured.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Real Estate Litigation
litigating real property disputes
Real estate is most people's largest asset and is the means to generating tremendous wealth for those that own and control it. As such, real estate is highly litigated by owners, landlords/tenants, lenders, HOA's, and builders. The Allen Law Firm can help you defend and prosecute your real estate interests.
FORECLOSURE
In Texas, the non-judicial foreclosure procedure is governed by the Texas Property Code §51 and the underlying loan documents. A lien holder can often comply with all the foreclosure laws and take real property from a defaulting owner less than two months. A lien holder may also want to file a judicial foreclosure, home equity loan foreclosure, rescission of a vendor’s lien, quit title action, or more. Contact us now for a free case evaluation and to determine what foreclosure process is best under your circumstances.
EVICTIONS
The Texas eviction process is generally quick and straight forward. A landlord, real estate investor, buyer at a foreclosure/tax sale, REO department manager for a major servicer or bank can send a notice to vacate, file a forcible detainer lawsuit, and set the case for hearing in a matter of weeks. Evictions are usually expedited and heard quickly by a Justice of the Peace. The court will decide which party has the right to “immediate possession” of the Property. Contact us now for a free case evaluation and to determine whether a forcible detainer action is best under your circumstances.
TITLE DISPUTES
Real property title issues are more common that you might think. Property tax liens, HOA liens, mechanic liens, abstract of judgments, IRS liens, lis pendens, bad legal descriptions, seller finance cloud on title, missing deeds, probate transfer of title, affidavits of heirship, city liens, and more. These are all issues that will affect your ability to sell property and your rights to enforce a lien against property. Contact us now for a free case evaluation and to determine whether you have clear title.
MECHANIC/MATERIALMAN LIENS
A Mechanic/Materialman Lien can be filed when an owner fails to pay a contractor, or when a general contractor fails to pay a subcontractor for work completed during the construction, addition, remodeling, or improvement of real property. Mechanic liens can have short and relatively complicated deadlines that must be met. If you are owed money for work completed as a general contract or subcontractor for real property then call us now for a free case evaluation.
PARTITION OR FORCED SALE OF PROPERTY
Co-Owners of real property have rights and obligations to the other owner. One of those rights is the right to partition (split up the property) and sell your portion of the interest. If the property cannot be physically split, then a co-owner may have the right to force the sale of the entire property so as to recover his/her interest. Contact us now for a free case evaluation to see if a forced sale is right for you.
PURCHASE CONTRACTs (BUYER/SELLER)
Real property is bought and sold on a daily basis. The most common instrument used to initiate the sale of property is a purchase and sale contract. For residential homes, the Texas Real Estate Commission has promulgated forms that are used for most transactions. Commercial property sale contracts are often more complicated and robust. A contract to purchase real property establishes rules, rights, promises, and obligations for both the seller and the buyer. If one party fails to follow the rules, fails to keep a promise, or defaults on an obligation, then the other party has rights. Because these contracts are usually short term contracts, it is important to act quickly to protect or enforce your rights. We can help you understand your contractual rights and he can help you hold others responsible for promises and representation made.
LANDLORD/TENANT DISPUTES
Landlord/Tenant law is set by a series of statutes, case law, and contract terms. Often, contractual terms are not valid and cannot be legally enforced. Other times, rights exist outside of the contract by virtue of a statute or interpretive case law. If you have a disagreement with your landlord/tenant under a lease then Bret can help. Some examples might be that your landlord failed to return a security deposit; that living conditions in your home violate basic health and safety standards; or that a tenant has failed to pay rent or has vacated early. We can help you determine your rights.
HOA DISPUTES
An HOA is a set of real property covenants that restricts certain actions/conditions related to real property. Many times, a board consisting of fellow homeowners attempts to interpret the HOA covenants, and does it incorrectly. Bret can help you determine your rights under the HOA restrictions. We can also help associations navigate the default, demand, lien and foreclosure process under Texas law.
|
{
"pile_set_name": "Pile-CC"
}
|
Age, period and cohort models applied to cancer mortality rates.
We develop the application of age, period and cohort models to the representation of tables of age- and period-specific rates. A derivation is given by way of a familiar graphical technique. The identifiability problem is discussed, identification techniques are reviewed and a new approach is recommended that is based upon the success of the three two-variable submodels. Other constraints are introduced that enhance interpretation. Examples are given for two sites of cancer. This approach is contrasted with other methods designed to demonstrate trends. Finally, standard errors of the parameters and tests of goodness of fit are discussed.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Misskey, a decentralized microblogging platform with ActivityPub support - l2dy
https://github.com/syuilo/misskey
======
tree_of_item
Is this just a fork of Mastodon?
~~~
l2dy
No, it's a separate project that got ActivityPub support this year.
|
{
"pile_set_name": "HackerNews"
}
|
Jamie’s Suggestions (2)
Hunting for pet friendly hotels in Denver? There are many good hotels in Denver that are pleased to accept your furry friends.
If you are planning for a romantic getaway on your 14th Feb in London then do not hesitate as it is your Hotels in London that would confident to mark your rendezvous moments. With several city sights and distinctive style, you can have excitingly something for everybody.
Every year a massive extent in the hershey spa hotel and majestic Himalayas, Ananda is where one particular can discover via the hershey spa hotel and physique? Greatest spa hotels or a special hot stone therapy. It delivers a special service just for you. At this time, no a single knows if bathing in chocolate and consume it also.
Helstab goes on to speak about how the luxury-travel marketplace impacts the organization. The luxury-travel market led the recovery, and it continues to lead the recovery. The Middle East was the final to go into recession and was coming out of it nicely till the Arab Spring. We’re seeing very robust development on the corporate-travel side for 2012, as nicely as the meetings and events side. The leisure side stayed stronger through the downturn,” she adds in the report titled 4 Seasons Embraces Digital Advertising and marketing, Virtual Experiences, and Hotel Chain Accepts Unknown by Incorporating User-Generated Content material into New Site by Frederic Colas and Laurel Wentz.
The constructing will eventually crumble and die, so you have to figure in amortisation and maintenance fees of almost certainly 10%, and return on investment of say 20%. Each and every space has to produce 30% of its capital cost every single year. Even very good hotels often are not full all year round, so reckon on a 70% typical occupancy rate. 365 nights x 70% is 255 nights. 30% of $250,000 is $75,000. Just to meet the capital cost of delivering a area we need 255 nights at $295 a night. There are staffing charges for laundry, cleaning, reception, safety, and bookings and billing, possibly in the order of $20 per space per night. Added to this are property taxes, hotel taxes, electrical energy, heating, and marketing – say $ten a evening. So the expense prior to creating any profit is $325 a night. I assume bars and catering at least spend their way.
Post navigation
Welcome To Our Website!
Mentawaisurfcoaching.com is a website that will help you discover beautiful places to travel , interesting tips about the world of travel, and a cool article that will guide you in traveling . So what are you waiting for. Let's go around the world and make your trip easier with Mentawai Travel And Recreation Website ~
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
regex parsing delimited string
I am having trouble with parsing my delimited string with the following regex (this regex also takes into account situation, when user is using quotes as a grouping character):
"[^"]*"|[^;]*
This works perfectly fine when there is no empty space between the delimiter, such as following:
31.12.2015;M234;94 841,00;C
**results:**
31.12.2015
M234
94 841,00
C
However it fails, when some of the 'columns' / values are empty such as following:
31.12.2015;M234;94 841,00 ;C;;;0000-0000-00;0000000
The problem is, that it does not return empty space between my delimiters as a result and simply skips to a new delimiter.
What do I need to change to fix this regex?
Here is the code I am using to loop through values
For Each Match In sRegex.Execute(sRow)
If Match.Length > 0 Or bDelimiter = False Then
Debug.Print Match.Value
sHolder(UBound(sHolder)) = Match.Value
ReDim Preserve sHolder(0 To UBound(sHolder) + 1)
bDelimiter = True
Else
bDelimiter = False
Debug.Print "delimiter"
End If
Next Match
A:
I see the problem is identifying whether the empty string is actually an empty string before a ; after a valid item, or whether is an empty item itself.
I suggest changing the regex to "[^"]*"|([^;]*);? to capture all non-;s before an optional ; that will be consumed, and no empty space will no longer be available for the regex to match. Some more logic should be introduced though.
Here is an example code:
Sub ExecuteTest2()
Dim s As String
Dim sRegex As New regexp
Dim sHolder() As String
Dim strPattern As String
strPattern = """[^""]*""|([^;]*);?"
s = "31.12.2015;M234;94 841,00 ;C;;;0000-0000-00;0000000"
sRegex.Global = True
sRegex.MultiLine = False
sRegex.IgnoreCase = True
sRegex.pattern = strPattern
ReDim Preserve sHolder(0)
For Each match In sRegex.Execute(s)
If match.SubMatches.Count > 0 Then
Debug.Print match.SubMatches(0)
sHolder(UBound(sHolder)) = match.SubMatches(0)
ReDim Preserve sHolder(0 To UBound(sHolder) + 1)
Else
Debug.Print match.Value
sHolder(UBound(sHolder)) = match.Value
ReDim Preserve sHolder(0 To UBound(sHolder) + 1)
End If
Next match
End Sub
|
{
"pile_set_name": "StackExchange"
}
|
I’m happy to announce some exciting news — Mycroft is working with Aditya Mehra from our community and the KDE Desktop developers to become part of their Plasma environment!
KDE Plasma
In case you don’t know, KDE is one of the most widely used desktop environments in the Linux world. It can run on a variety of Linux distributions including the popular Kubuntu (KDE + Ubuntu) and Fedora KDE. A 2016 survey by LinuxQuestions.org found KDE to be the most popular Linux desktop environment (so did the 2015 and the 2014 surveys, BTW). It is it is a shining example of a successful community-driven open source project. And the KDE Plasma Desktop is simply a useful and beautiful interface.
KDE + Mycroft
Aditya (known as ”aix” on the Mycroft Slack channels) is a Mycroft community member. He got the Mycroft bug last year and started working early last summer on building GUIs for Mycroft. He initially created a Gnome-based extension, and more recently became enthralled with the KDE Plasma Desktop environment. So he decided to try his hand and building a Plasmoid for it.
His work on the Mycroft Plasmoid caught the attention of the KDE Development team. Over the last few months we have been working with Aditya and the KDE developers figuring out how we can work together. This weekend he officially moved his development repo onto the KDE servers as the first step in building an official Mycroft Plasmoid.
Community for the Win!
We are thrilled to be collaborating with the KDE Community on this project! This is perfect example of what happens when open development tools and technologies are made available to smart people. They make beautiful and interesting things!
Try It Out
So you want to give it a shot?
Installing Mycroft and the Plasmoid on KDE Neon
The Plasmoid is built on some of the latest technologies, so you need to be running KDE Plasma Desktop 5.9 or later. If you aren’t using that yet, you can try it out easily using a VM. Head over to the KDE Downloads page to get an ISO. You can use that to either create and old-school installer CD, or you can create a VM and load the ISO directly into the virtual disc drive.
Once you have KDE, you can simply download this script and run it. Here is a step by step:
Go to the Konsole (KDE’s terminal) Type: cd ~ Type: wget http://mycroft.ai/to/install_plasmoid_kde.sh Type: bash install_plasmoid_kde.sh
That’s it! You’ll be prompted a couple times to enter a password and the compile process will take a while, but it is straightforward.
Installing Mycroft and the Plasmoid on Fedora KDE
Fedora KDE users can try this too. All you need to do is:
Go to the Terminal Type: cd ~ Type: wget http://mycroft.ai/to/install_plasmoid_fedora.sh Type: bash install_plasmoid_fedora.sh
Adding it to your Desktop
After the install completes right click on the desktop and select “Add Widget…”. Scroll through the list until you see “Project Mycroft”, then just click and drag it to your desktop.
Using the Plasmoid
Click on the Mycroft icon to open it up. You”ll need to click the ▶️️ button at the top to tell Mycroft to begin listening. Then you can say “Hey Mycroft, register my device” to create your pairing with home.mycroft.ai. You’ll immediately notice the text is both spoken and displayed on screen in the widget.
In the alpha there were special handlers for “What’s the weather like?” that began to show the possibilities of combining voice interaction with a screen, combining voice and visuals. We’ll be exposing those capabilities to our Skill API soon for other developers to explore.
Join us on Slack to help shape the future of desktop computing in the #mycroft_desktop channel!
|
{
"pile_set_name": "OpenWebText2"
}
|
In the United States Court of Federal Claims
No. 11-770V (Pro Se)
(Filed Under Seal: April 9, 2019 | Reissued: April 26, 2019)*
KeyWords: Motion for Relief from
HEATHER ROGERO and WALTER A. Judgment; RCFC 60(b); RCFC 60(d)(3).
ROGERO, Il. Friend of W.R., a minor,
Petitioners,
SECRETARY OF THE DEPARTMENT OF
HEALTH AND HUMAN SERVICES,
)
)
)
)
)
)
v. )
)
)
)
)
Respondent. )
)
Heather Rogero and Waller A. Rogero, Mountain Home, AR, pro se.
Voris E. Johnson, Jr., Senior Trial Attorney, Torts Branch, Civil Division, U.S. Department of
Justice, Washington, DC, With whom Were Catharine E. Reeves, Deputy Director, C. Salvatore
D ’Alessio, Acting Director, and Joseph H. Hunt, Assistant Attorney General, for Respondent.
OPINION AND ORDER
KAPLAN, Judge.
Before the Court are two submissions received from pro se Petitioners Heather and
Walter A. Rogero (“the Rogeros”) in connection With this vaccine case concerning their son,
W.R. First, the Court received on March 6, 2019 a submission styled alternatively as a motion
for enlargement of pages, to correct the docket, for a supplemental pleading, and/or order of
Withdrawal (“motion to correct”). In substance, this document takes issue With the Court’s
decision to construe a March 4, 2019 motion which Was styled as “Petitioner’s Motion Under
RCFC 59” (“the Rule 59 motion”) as a motion for relief from judgment under Rule 60 of the
Rules of the Court of F ederal Claims (“RCFC”). E Docket No. 220.'
* This opinion Was previously issued under seal on April 9, 2019. The parties Were given the
opportunity to propose redactions on or before April 23, 2019. Because the only proposed
redactions did not comply With Vaccine Rule 18(b), the Court reissues this opinion and order in
its entirety.
l Although it Was construed as a motion filed pursuant to Rule 60, the Court Will refer to the self-
styled Rule 59 motion as “the Rule 59 motion” in order to avoid confusion With the Rule 60
motion received on March 21 , 2019.
The Clerk of the Court shall file this document under seal on the docket for this case. For
the reasons set forth below, the motion shall be DENIED-IN-PART to the extent it requests
correction or withdrawal of the Court’s previous order. The motion will also be DENIED as
moot to the extent it seeks permission to file a successive Rule 60 motion, because the Rogeros
do not need the Court’s approval on this front. Finally, the motion shall be GRANTED-IN-
PART to the extent that it seeks permission to exceed applicable page limits.
Second, the Court is in receipt of the Rogeros’ “Combined Redaction Response and
RCFC 60 Motion for Relief of Judgment Pursuant to 60(b) & (d) Grounds” (“the Rule 60
motion”) with an attached appendix and explanatory letter. The Clerk of the Court shall also file
this submission under seal on the docket. For the reasons discussed below, this Rule 60 motion
shall be DENIED. In addition, because the Rogeros have not requested any redactions permitted
by the governing rules, the Court’s previous opinion (Docket No. 222) shall be reissued in full as
a public document.
DISCUSSION
I. The Rogeros’ Objection and Motion to Correct as to the Court’s March 4, 2019
Opinion and Order
In the March 6 submission that is currently before the Court, the Rogeros object to the
Court’s decision to construe their Rule 59 motion as a motion filed under RCFC 60. The Rogeros
explain that they deliberately filed their March 4, 2019 motion under Rule 59 and intended to
reserve their right to later seek relief pursuant to Rule 60. They therefore request that the Court
allow an enlargement of pages, correct the docket, allow a supplemental pleading, and/or allow
them to withdraw their previous motion.
The Court treated the Rogeros’ Rule 59 motion as a motion under RCFC 60 because the
time for filing a Rule 59 motion seeking reconsideration of this Court’s January 12, 2018
decision was expired. The Court has the discretion to treat an untimely Rule 59 motion as a
motion for relief from judgment under Rule 60(b). § Piotrowski v. United States, No. 13-
760C, 2015 WL 1651610, at *2 (Fed. Cl. Apr. 10, 2015) (citing Mendez v. United States No.
11-160C, 2014 WL 2772590, at *1 (Fed. Cl. June 18, 2014), affd_, No. 2014-5116, 2015 WL
106585 (Fed. Cir. Jan. 8, 2015) (treating an untimely Rule 59(a) motion as a Rule 60(b) motion);
Branum v. Clark, 927 F.2d 698, 704 (2d Cir. 1991) (stating that an untimely Rule 59(e) motion is
properly considered a Rule 60(b) motion under the Federal Rules of Civil Procedure)).
The Rogeros appear to believe that their previous Rule 59 motion was timely, however,
because it was filed within twenty-eight days after the mandate was issued by the Federal Circuit
in the Rogeros’ appeal. §§ Motion to Correct at 3-4. But as the Court explained in its previous
order, the Rogeros’ time to file a Rule 59 motion with respect to any ruling of Qi§ Court elapsed
on February 9, 2018, which was twenty-eight days after this Court entered judgment on January
12, 2018. Docket No. 222 at l. The Rogeros cannot file a timely Rule 59 motion in this Court
now (and could not have when they filed their previous Motion) on the basis of the mandate
issued in the Federal Circuit, because this Court “lacks the authority to afford relief from a
judgment or order of the court of appeals.” lg at 4 n.2. And although the Rogeros accurately
state in their later-filed Rule 60 motion that the entry denoting the mandate of the Federal Circuit
references a “judgment,” relief as to th_at judgment would have to come from the Federal Circuit
through a petition for rehearing or the Supreme Court of the United States through a petition for
a writ of certiorari.2
The motion to correct is also animated by the Rogeros’ stated intent to preserve their
right to file a future Rule 60 motion, which they have now done. § Motion to Correct at 5-6.
But the Court’s decision to construe the Rogeros’ previous motion as one brought under Rule 60
rather than Rule 59 does not prevent them from filing a subsequent Rule 60 motion. Mora v.
Sec’v of Health & Human Servs., 673 F. App’x 991, 997 (Fed. Cir. 2016) (“[A] litigant can
bring successive Rule 60(b) motions.”). In other words, the relief the Rogeros have requested is
unnecessary to preserve their right to file such a motion.
Accordingly, because the Court permissibly construed the Rogeros’ Rule 59 motion as
one filed under Rule 60, the motion to correct is DENIED-IN-PART to the extent that it
requests that the Court correct the docket and/or withdraw its previous order. The motion is
GRANTED-IN-PART to the extent the Rogeros requested to file additional pages with their
subsequently filed Rule 60 motion. Finally, the motion to correct is DENIED as moot to the
extent the Rogeros have requested permission to file a successive Rule 60 motion, because case
law clearly affords them this right without the Court’s approval.
II. The Rogeros’ Rule 60 Motion
The Court has reviewed and carefully considered the Rogeros’ lengthy Rule 60 motion,
which was received on March 21 , 2019. Although the Rogeros have couched their objections in
the language of RCFC 60, in substance they are asking the Court to revisit the merits of the
Special Master’s decision because they continue to believe that it was unfair and incorrect. For
the reasons set forth below, the Rogero’s arguments do not provide an adequate basis for
granting their motion for relief under Rule 60.
As previously set forth in the Court’s March 4 order, RCFC 60(b) states that the Court
“may relieve a party . . . from a final judgment, order, or proceeding” for any of six enumerated
reasons:
(l) Mistake, inadvertence, surprise, or excusable neglect;
(2) Newly discovered evidence that, with reasonable diligence, could not have
been discovered in time to move for a new trial under RCFC 59(b);
(3) Fraud (whether previously called intrinsic or extrinsic), misrepresentation,
or misconduct by an opposing party;
(4) The judgment is void;
2 The Rogeros did, in fact, file a petition for rehearing in the F ederal Circuit that was denied on
January 18, 2019. Accordingly, they have the right to file a petition for a writ of certiorari with
the Supreme Court until April 18, 2019. § Sup. Ct. R. 13.
(5) The judgment has been satisfied, released, or discharged; it is based on an
earlier judgment that has been reversed or vacated; or applying it
prospectively is no longer equitable; or
(6) Any other reason that justifies relief.
RCFC 60(b).
“As a remedial provision, Rule 60(b) is to be ‘1iberally construed for the purpose of doing
substantial justice.”’ Patton v. Sec’v of Dep’t of Health & Human Servs., 25 F.3d 1021, 1030
(Fed. Cir. 1994) (citing 7 J ames W. Moore & Jo Desha Lucas, Moore’s Federal Practice
1111 60.18[8], 60.19 (2d ed. 1993)). At the same time, “[t]he United States Supreme Court has
‘cautioned that the Rule should only be applied in extraordinary circumstances.”’ Perry v. United
States, 558 F. App’x 1004, 1006 (Fed. Cir. 2014) (quoting Lilieberg v. Health Servs. Acquisition
m, 486 U.S. 847, 864 (1988)) (alterations omitted). Therefore, in ruling on a motion under
RCFC 60(b), a court must strike “a proper balance between the conflicting principles that
litigation must be brought to an end and that justice should be done.” Hutchins v. Zoll Med.
Ep_., 492 F.3d 1377, 1386 (Fed. Cir. 2007) (quoting 11 Charles A. Wright, Arthur R. Miller
& Mary Kay Kane, Federal Practice and Procedure § 2851 (2d ed. 1995)).
As noted in the Court’s March 4 order, motions seeking relief under RCFC 60(b)(1), (2),
or (3) must be filed within one year from the date of the judgment at issue. RCFC 60(0)(1).
Because the Rogeros filed their motion more than one year after the Court denied their motion
for review on January 11, 2018, they may not rely on RCFC 60(b)(1), (2), or (3).
Under RCFC 60(c)(1), a motion based on Rule 60(b)(4) or (6) must be filed within a
“reasonable” time. L3 Here, the Rogeros’ motion to vacate this Court’s judgment and remand to
the Special Master was not filed within a reasonable time. To the contrary, it was filed more than
a year after this Court’s decision and after the Rogeros had already unsuccessfully pursued relief
in the court of appeals, including an unsuccessful petition for rehearing.
ln any event, even assuming that the Court were to find that the Rogeros’ motion under
RCFC 60(b)(4) and (b)(6) was filed within a reasonable time period, it lacks merit. First, the
Supreme Court has defined a “void” judgment for purposes of Fed. R. Civ. P. 60(b)(4) as “one so
affected by a fundamental infirmity that the infirmity may be raised even after the judgment
becomes final.” United Student Aid Funds, Inc. v. Espinosa, 559 U.S. 260, 270 (2010).4 “The list
of such infirmities is exceedingly short.” Ld. A judgment is not void “simply because it is or may
have been erroneous.” Ld. (quotations and citations omitted). “lnstead, Rule 60(b)(4) applies only
in the rare instance where a judgment is premised either on a certain type of jurisdictional error
or on a violation of due process that deprives a party of notice or the opportunity to be heard.” §
at 271 (citations omitted); see also Brovhill Fumiture Indus., Inc. v. Craftmaster Fumiture Corp.,
12 F.3d 1080, 1084 (Fed. Cir. 1993) (“[l]t is well established that a judgment is void for
3 The Rogeros have not claimed that Rule 60(b)(5) can be invoked as an avenue for relief.
4 The language of Fed. R. Civ. P. 60(b) is essentially identical to that of RCFC 60(b).
purposes of 60(b)(4) only when the court that rendered the judgment lacked jurisdiction or failed
to act in accordance with due process of law.”).
In their motion, the Rogeros repeatedly assert that they seek relief based on due process
process principles They contend that Special Master Hastings failed to comprehend or
accurately describe their legal theory or to give adequate consideration to their proffered
evidence. They also accuse the Court, the Special Master and the government of
“misrepresenting” various facts and principles of law with which they disagree. These kinds of
arguments, however, do not support a claim under RCFC 60(b)(4) because they do not show that
the Rogeros suffered “a violation of due process that deprive[d them] of notice or the opportunity
to be heard.” United Student Aid Funds. Inc., 559 U.S. at 271. The Rogeros had ample
opportunity to be heard when the case was before the Special Master, and while they are
dissatisfied with the results, it is clear to the Court that the Special Master gave careful
consideration to their arguments In addition, the Rogeros pursued two rounds of review of the
Special Master’s decision, one before this Court and one in the court of appeals.
The Rogeros also contend that Special Master Hastings’s alleged errors constitute a
“manifest injustice” and warrant relief under Rule 60(b)(6). “A movant is entitled to relief under
Rule 60(b)(6)_the ‘catch-all’ provision-if ‘such action is appropriate to accomplish justice’
and only iri ‘extraordinary circumstances.”’ CEATS. lnc. v. Cont’l Airlines, Inc., 755 F.3d 1356,
1361 (Fed. Cir. 2014); see also Fiskars, Inc. v. Hunt Mfg. Co., 279 F.3d 1378, 1382 (Fed. Cir.
2002) (“Rule 60(b)(6) is available only in extraordinary circumstances and only when the basis
for relief does not fall within any of the other subsections of Rule 60(b).”). Although the Court
has no doubt that the Rogeros’ circumstances have involved significant hardships and
difficulties, their arguments do not support the existence of the kind of “extraordinary
circumstances” required to obtain relief under RCFC 60(b)(6). Instead, they are seeking to
relitigate claims that the Special Master_whose decision was affirmed by both this Court and
the court of appeals_already decided lacked merit.
To the extent that the Rogeros also argue that relief is appropriate under RCFC 60(d)(3)
based on “fraud on the court,” they misapprehend the nature of this ground. Because RCFC 60
also contains a fraud-related provision at (b)(3), courts narrowly construe the “fraud on the
court” provision found at (d)(3). E Broyhill, 12 F.3d at 1085. “Fraud on the court is typically
confined to the most egregious cases, such as bribery of a judge or juror, or improper influence
exerted on the court by an attorney, in which the integrity of the court and its ability to function
impartially is directly impinged.” Gravelle v. Kaba llco Corp., _ F. App’x -, 2018 WL
6444470, at *2 (Fed. Cir. Dec. 10, 2018) (internal citation, quotations, and alterations omitted).
The Rogeros have not made any allegations sufficient to invoke this provision.
In sum, and as the Court has noted previously, the Rogeros have presented their case to
Special Master Hastings in a six-day hearing and in voluminous briefs, have requested and
received review of the Special Master’s decision in this Court, and have also had their case
reviewed_and petition for rehearing denied_by the court of appeals. Rule 60 relief is not
available as a means to relitigate claims that have already been decided; if it were, then no
decision would ever be final. Accordingly, the Rogeros’ second Rule 60 motion must be
DENIED.
III. The Rogeros Have Not Proposed Redactions
The Court’s March 4 opinion and order was issued under seal, and requested redactions
Were due from the parties by March 18, 2019. § Docket Text for Entry No. 222. Although the
Rogeros styled their Rule 60 motion as a combined motion and “Redaction Response,” the only
redactions proposed therein are alterations to the Court’s previous order, changing the language
to match the Rogeros’ precise characterizations of their claims, legal theories, and view of the
case. Because the Rogeros have not proposed redactions consistent with the provisions of
Vaccine Rule 18(b), the entire opinion and order shall be made public. § Vaccine Rule
18(b)(2).
CONCLUSION
The Clerk shall file all of the Rogeros’ recent submissions under seal on the docket for
this case.
To the extent the Rogeros have moved to Vacate or otherwise amend the Court’s March 4
opinion and order, their motion is DENIED-IN-PART. To the extent they have requested
additional pages for their Rule 60 motion, their motion is GRANTED-IN-PART. And to the
extent the Rogeros have requested the Court’s permission to file their second Rule 60 motion, the
request is DENIED as moot because the Court’s permission is not required.
For the reasons discussed above, the Rogeros’ second Rule 60 motion is DENIED.
IT IS SO ORDERED.
S/ @'T\l }/{/
ELAINE D. KAPLAN
Judge
|
{
"pile_set_name": "FreeLaw"
}
|
Rating: 78% from 23 reviews
Real Reviews
These are trusted reviews from guests who have actually stayed here. We hope you find them helpful.
Note: we only give a property a rating once it has received a minimum of 3 reviews.
Page:2/2
Sort By:
Traveler Type:
Age:
“ We had a nice stay in one of the private twin rooms. The hostel was very cozy and the atmosphere laid-back, thanks to the helpful staff, cool decorations, and clean rooms. I recommend this to anyone going to Edinburgh; don't waste your time and money on hotels when you can go to the Backpackers' hostel! The location of this hostel is excellent: it is easily accessible by bus, close to both Old and New Town, and there are good restaurants in the neighbourhood. ”
91%
04 Jun 2014
Tiia
Finland
“ The kitchen facilities are old and insufficient. Some of the cooking utensils may cause heath hazards.Room's carpet is a bit dirty. The spring of the bed is too soft and uncomfortable. ”
66%
04 Jun 2014
KIM LEONG
Malaysia
“ Fun hostel! I may be biased because I love Edinburgh so much, but this hostel was a ton of fun. Yes it's in New Town, but there's still a lot's of good restaurants, pubs, and shopping close by. It also had a great common room and the beds were really comfortable. Easy to meet other travellers and the staff are really knowledgeable about whats up in the city. Would definitely recommend! ”
83%
07 May 2014
Rachel
Canada
“ There is a pub inside the building. It can get really noisy at night though good for socialising. Prepare blindfold and ear plug. I lived on the third floor, female dorm. There're 2 toilets, 3 showers, and 1 sink. So it can get quite busy in the morning. Waking up early is a good strategy. Given the price (a bit more expensive than their normal price as I went in the bank holiday weekend) and what it offers, it's just so-so. ”
|
{
"pile_set_name": "Pile-CC"
}
|
import { default as Wallet } from 'ethereumjs-wallet';
const worker: Worker = self as any;
interface DecryptionParameters {
keystore: string;
password: string;
nonStrict: boolean;
}
worker.onmessage = (event: MessageEvent) => {
const info: DecryptionParameters = event.data;
try {
const rawKeystore: Wallet = Wallet.fromV3(info.keystore, info.password, info.nonStrict);
worker.postMessage(rawKeystore.getPrivateKeyString());
} catch (e) {
worker.postMessage(e.message);
}
};
|
{
"pile_set_name": "Github"
}
|
As President Trump gears up to reveal a sweeping new immigration plan, Louisiana Republican Sen. John Kennedy said the country is in dire need of immigration laws that "look like somebody designed it on purpose."
During an interview with "America's Newsroom" on Thursday morning, Kennedy said he liked what he'd seen thus far regarding President Trump's new immigration plan, but needed to read the full proposal. He added that he feels there's a problem with Democrats in Washington who perceive the border as a "nuisance" and illegal immigration as a "moral good."
"Let me state the obvious. Illegal immigration is illegal, duh," Kennedy said. "Part of the problem is there are people in Washington, D.C. in positions of power to whom the border is just a nuisance, and I think some of them believe that illegal immigration is a moral good.
"It is not. It undermines legal immigration," Kennedy continued. "The president is trying to fix it long-term and again I want to read the bill. But we need a system that looks like somebody designed it on purpose."
GRAHAM UNVEILS BILL TO CHANGE ASYLUM LAW, SEND MIGRANTS BACK HOME
TRUMP ADMIN PUSH TO STOP ILLEGAL IMMIGRATION HAMPERED BY DISTRICT JUDGES, DESPITE SURGE: US ATTORNEY
President Trump's proposed plan, the Build America Visa system, would reportedly quadruple the number of immigrants admitted on the basis of their work skills, and slash the numbers admitted based on family ties.
Kennedy expressed his support for this type of merit-based system and highlighted the success Canada has had with similar policies.
"Canada has a merit system. We've got -- we admit people sometimes legally on the basis of a lottery. It is just like playing bingo," he said. "That makes no sense. I hope we can fix it."
Getting any type of immigration passed will take cooperation on both ends, something Kennedy isn't sure he'll see from his Democratic colleagues.
CLICK HERE TO GET THE FOX NEWS APP
"I could be convinced but I'm not convinced right now that all of my colleagues on the Democratic side really want to fix it," he said. "Some see this as a great political issue. We have to start thinking about the next generation and stop thinking about the next election so much," he concluded.
|
{
"pile_set_name": "OpenWebText2"
}
|
If you at all follow UFC goings-on (or even just follow someone on Twitter who accidentally watched a UFC card at a bar once), you’ve probably heard about the Biblical drama storm currently following Conor McGregor. This week McGregor “retired” from MMA over the UFC’s refusal to give him a slightly lighter promotional schedule. It’s been a confusing mess of whispers and speculation, so here’s some clarity: the UFC is absolutely being idiotic right now.
Here’s where things are at: after McGregor sauntered onto Twitter, picked up a microphone as if to say something, and then dropped it and walked away, UFC president Dana White claimed the whole spat arose because McGregor refused to fly to the US to do a press week for his fight at UFC 200 in July. McGregor was silent for a while, leading to rampant speculation about whether he actually retired, or if this was some kind of ploy to squeeze more money out of the UFC, or even if he’d been rattled by recently witnessing an MMA fight in which one of the combatants later died.
Yesterday, however, McGregor broke the silence, explaining that he requested a lighter press schedule ahead of UFC 200 because he’s pretty much been doing nonstop press for the UFC since the start of last year. He’s also jumped in and pulled the UFC’s ass from the fire multiple times, taking on last-second fights against top fighters like Chad Mendes and Nate Diaz. The latter fight, which saw McGregor jump up two weight classes to fight a guy heavier and taller than him, ended with McGregor’s first UFC loss.
“I am paid to fight,” McGregor wrote on Facebook, saying that he asked for a “slight adjustment” to his promotional duties for UFC 200. “I am not yet paid to promote. I have become lost in the game of promotion and forgot about the art of fighting. There comes a time when you need to stop handing out flyers and get back to the damn shop.”
He even said he’d fly out to New York for the day of his biggest media obligation of the upcoming press week (which would kick off in Vegas this weekend) and then return to training in Iceland after that. “It is time to be selfish with my training again, “McGregor added. “It is the only way. I feel the $400 million I have generated for the company in my last three events, all inside 8 months, is enough to get me this slight leeway.”
That whole faux-retirement thing? McGregor said it was his way of showing the UFC that he didn’t need to attend a few press conferences and do some interviews to justify the $10 million they put into marketing this event. In a single tweet, he grabbed the entire sporting world by the eye stalks.
So far, it seems that the UFC disagrees. Shortly before McGregor released his statement, Dana White continuously said things like, “You can’t not show up to promote your fight. You can’t do it.” He also referenced the time Nick Diaz (Nate’s older brother) no-showed a press conference and had a title shot against then-welterweight champ Georges St-Pierre yanked away from him. Now outlets like TMZ are reporting that the UFC has flatly refused McGregor’s offer. Unless somebody does something drastic, McGregor will not be fighting at UFC 200.
What the UFC is doing here is so categorically stupid that my brain feels like it’s been repeatedly concussed by Alistair Overeem during his steroid-fueled days of being part-man, part-horse torso. Let’s break this down:
At the heart of this whole fiasco is Conor McGregor’s unprecedented popularity, born of his notorious flare for self-promotion. Unlike many other fighters, he’s become a singular entity, responsible for some of the UFC’s highest earning pay-per-views to date. After a tough time during which the UFC lost stars like Brock Lesnar and Georges St-Pierre, McGregor (along with Ronda Rousey) helped put the UFC back on the map, gave it a larger chunk of cultural landmass than ever before. McGregor generates mindshare and conversation. People who don’t give a shit about the UFC do give a shit about Conor McGregor. My dad sometimes texts me about Conor McGregor. I’ve been following MMA for more than a decade. That’s a first.
The UFC, however, continues to be an operation that is first and foremost focused on The Brand. If a fighter dishonors or tarnishes The Brand—if they fail to dance the company dance in the company mandated Reebok ballgown—they’re on The Shitlist (also a Reebok product) in a heartbeat. The UFC has an abysmal track record when it comes to putting fighters first. See also: the fact that fighters are all contractors (not employees with benefits and bargaining power), the aforementioned Reebok deal, which drastically reduced the amount of money fighters could make while lining the UFC’s pockets and giving them a nice little prestige boost to match, letting go of beloved figures for bad-mouthing the Reebok deal, etc.
This has led to some moves in the past almost as baffling as the current McGregor situation. Remember when Dana White publicly threw Jon Jones under the bus for UFC 151's cancellation, even though it was the UFC’s decision and Jones had every right to turn down a last-second opponent switcheroo? At the time, Jones was the UFC’s star on the rise, their next great hope. But he put himself before The Brand, and that simply would not do. So the UFC put its foot down on Jones’ head and shot through its own foot to hit him. It was petty. It was short-sighted. In the long run, it didn’t help anybody, least of all the UFC.
What makes the McGregor situation unique is that the UFC actually helped McGregor prove a point they’ve been kicking and screaming to deny: McGregor is bigger than the UFC. See, the UFC wants to build superstars, but only to a point. If they don’t need the UFC anymore—if they won’t kowtow to the UFC’s demands—that’s a nightmare scenario. If a fighter gains that kind of leverage, why, that might slightly detract from money the UFC could make! The horror!
Meanwhile, for some time McGregor’s expressed interest in running his own fight promotion and co-promoting in partnership with the UFC. The first time McGregor said this, I imagine an alarm that sounded like a thousand banshees wailing in unison went off at UFC HQ, and a flock of ravens thick and black as coagulated blood devoured Dana White, forcing the UFC to release his sixth clone.
So, for the most part, the UFC just sort of gives McGregor whatever he wants at this point. Wanna win a belt and then jump up a division to fight for a different belt? We’ve expressly forbade other champs from doing it, but sure! Go ahead! Wanna continue to put the featherweight division on hold so you can avenge a loss to a guy at welterweight, a division you have no business beating your head against? Haha yeah do that I guess! Also here are some the biggest paydays in UFC history. Please don’t go.
It’s telling that this is how the UFC attempts to reassert dominance. They didn’t do anything of actual consequence. Oh no, that would be too risky. This is posturing, mean mugging for the camera, plain and simple. They could’ve (and at this point probably should) taken away McGregor’s featherweight championship. They could’ve suspended him. They could’ve fired him.
But in their heart of hearts, they know they need McGregor more than he needs them. The tweet heard ‘round the world just drove that point home. This weekend, the UFC is putting on one of its biggest shows of the year. Disgraced ex-light heavyweight champion Jon Jones is making his big return on a card that’s stacked with quality matches, including the most intriguing flyweight title fight in eons. Jones is, in all likelihood, the UFC’s third most popular fighter after McGregor and Rousey. But hardly anybody’s talking about that, especially in the mainstream sports world. It’s kinda hilarious, actually: A lot of outlets have posted videos and interviews in which they mostly asked people like Jon Jones and flyweight champion Demetrious Johnson about... McGregor. We’re on the verge of a marquee UFC event, but one tweet from McGregor is eclipsing it.
But OK, at the end of the day, the UFC is being self-interested. It’s a massive company, and massive companies are, by nature, self-interested. So, you might argue, they’re not being stupid at all. But even in the short term, ripping McGregor away from his throne atop UFC 200 is a moronic move. He just served them up a fantastic marketing angle on a silver platter, and they slapped it out of his hands, shoved his nose in it, and said, “NOW CLEAN IT UP.” For almost all of McGregor’s UFC tenure, we’ve known him as the guy with fancy suits, ridiculous bow ties, and ridiculous-er watches. Once upon a time, though, he was a poor Irish kid busting his ass and barely making ends meet. Now he’s going back to the basics to rediscover that part of himself, to train like a madman and shut out all other distractions.
So we have McGregor, this guy who’s been dominating airwaves, radiowaves, Internet waves, sine waves, and hell, probably even ocean waves (the UFC’s expansion into dolphin markets is doing better than expected), and suddenly, for a little while, he’s gonna disappear. Just as people were starting to get sick of hearing him talk and talk and talk, he... stops talking. To train for the biggest fight of his life. THAT IS ONE HELL OF AN ANGLE. COME ON UFC, HOW ARE YOU NOT GETTING THIS? You’ve got a built-in storyline, plus a rare quality you don’t find in modern marketing hype cycles: mystique. What will McGregor be like when he returns from his self-imposed exile? What will he say? How will he fight? As a fight fan, I would be out-of-my-mind excited by all of this! Thrilled! Curious! Unable to look away! It’s a perfect fucking storm.
But instead of promoting that, fight promotion company/lapse of judgement factory the UFC plans to pull the plug on McGregor’s UFC 200 fight entirely. It’s unbelievable. You’d think the UFC would’ve learned a lesson by now, but I guess their strategy of frequently stomping on fighters hasn’t led to a landmine yet. Maybe this will be it. Here’s hoping. It’s about damn time Dana White and co learn some kind of lesson.
|
{
"pile_set_name": "Pile-CC"
}
|
Protection
Earlier this month, it was getting worst between the two of them, and hard to be together.
They were trying to hold on to each other, but sometimes, holding on hurts more than letting go.
He was a famous political man, and she was his assistant. If one didn’t know her better, they’d say she was sleeping with her boss for the sake of her job.
But it’s not like that. They met and they fell for each other, like any 2 normal people, but they were everything but normal.
Other than him being famous, he was still married and getting a divorce.. But Her? she was just a woman, a young woman who studied hard and worked harder to get to be where she is now.
Somehow, they managed to last 8 months now.Eventually, their relationship hit rock…
|
{
"pile_set_name": "Pile-CC"
}
|
Media hysteria continues over Charlottesville; the two really good things that came out of it
One commentator wrote: “If it wasn’t already abundantly clear, today’s events made it increasingly evident the left and right cannot peacefully coexist under the same government. To avoid a civil war, there is only one way out. It is time to end the Union and secede.”
The smart-ass chick who got run over and killed after leftists smashed the car of James Fields
Threats against me right on my FB wall:
.
Really, geriatric?
Enjoy my collection of canes and dentures….oh, and this Marine shot expert and he always carries.
John de NugentOh, and this one on how Robert E. Lee was was mean to escaped slaves (other owners usually gave them an ice cream cone, I guess), and how he supposedly was a lousy general. (Gee, if so, why then did Lincoln offer the overrated Lee the supreme command of the UNION Armies? 😉 )https://www.yahoo.com/…/ap-explains-robert-e-lee-went…
John de NugentNote the twisting author says General Winfield Scott offered him the Union command. (I wonder if Scott just maybe consulted with President Abraham Lincoln first about that little job of crushing NINE STATES?)
It has been quite a weekend and a good one in a way. Let the Spencerian Alt-Righties get a strong whiff of reality. Repeatedly I have read his toxic meme of derogatory, arrogant remarks about WN “Boomers,” as if these young guys were going to go to Charlottesville and kick the cops’ ass, yes, defy the police state, which has been hounding WNs since J.Edgar Hoover’s FBI of the 1940s!
Spencer was almost whining in a vid how his rights were not respected and he got roughed up.
Well, Spencer, we “Boomer WNs” have been getting the “full treatment” for decades before you were born: beaten, defamed, framed and murdered.
Ava WagnerThe Alt Right wasn’t looking to fight the cops. They tried to coordinate and cooperate in the planning so that all would stay safe. What they didn’t plan on was the double cross. The cops take their orders from city and state leaders who are to blame for the deaths and multiple injured.
Владислав БучневIt isn’t about age or generations; a person is either a decent honest man or vile scum, regardless of age. I don’t think that there are more decent people in young generation now than there was in the past; most probably even less, because of obvious genetic degeneracy. The only difference is that the youngsters now are presented with a hard choice: either they lick negroe’s feet or begin resistance. There is any way out except of war; all those who would try to continue “peaceful coexistance” are sure to be killed by both sides.
Владислав БучневThe only language that communists understand is the language of force. It was well shown in 1920es in Germany. Any logical arguments would make any difference; sheer force and determination are the only factors.
Be the first to comment
Search
Search for:
Because I am so effective at combating Fake News, I am the constant target of online attacks and relentless hacking. This requires funds to pay for online security, secure hosting guaranteeing our right to speak freely, and more. Even a small donation is deeply appreciated. Thank You. Please donate below…
|
{
"pile_set_name": "Pile-CC"
}
|
{{menu.title}}
{{menu.title}}
Music, Mathematics and the Harmony of the Spheres
18:00 - 19:00, 29 November 2017
At Bronte Lecture Theatres
The development of the scientific world view, occurring in very broad terms between 1550 and 1750, is generally regarded as leading to the replacement of ‘magical thinking’ by the ‘scientific method’. This can however be seen as a much more ambivalent process, in which beliefs fluctuated and co-existed with each other, even in the minds of major scientists such as Newton and Hooke. Both these thinkers were profoundly influenced by the traditions of alchemy, astrology and the idea of sympathetic resonances throughout nature.
While mathematics certainly came to the fore in this period as the ‘language’ of science, this happened partly because of the ‘mystical’ belief persisting from the time of Pythagoras that numbers underlay the structure of everything in the cosmos.
Further, music, in the form of ‘harmonic theory’, was a major factor in both practical investigations of and in theorising about matter and material phenomena.
In this entertaining and non-technical talk, Hugh Peters explores 16th and 17th century thought, drawing on the work of Newton, Hooke and others and addresses the subjects of the ‘music of the spheres’ and the origins of Newton’s Principia. The speaker is an accomplished musician and will illustrate some of the concepts on the classical guitar.
This event is being held at the Bronte Lecture theatre on campus. Maps of the campus and directions to the University can be found HERE
This is a free event but please note that places are limites so please register for your place HERE
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
Show a child's Matrix within a Structure
I want to show a child entry and can so:
<ul>
{% for entry in craft.entries.section('products') %}
{% switch entry.level %}
{% case '1' %}
{# level 1 #}
<h1>{{ entry.title }}</h1>
{% case '2' %}
<li>
{# level 2 #}
<h2>{{ entry.title }}</h2>
{% case '3' %}
<ul> <li>
{# level 3 #}
<h4>{{ entry.title }}</h4>
</li>
</ul>
{% case '4' %}
{# level 4 #}
4
</li>
{% endswitch %}
{% endfor %}
</ul>
but I can't get a matrix field to show for the child entry, using:
{% for block in entry.myMatrix %}
{{ block.intro }}
{% endfor %}
within any of the cases?
A:
This should do it, user2569
{% for block in entry.myMatrix %}
{% if block.type == 'intro' %}
{{ block.intro }}
{% endif %}
{% endfor %}
|
{
"pile_set_name": "StackExchange"
}
|
Coronary perfusion: impact of flow dynamics and geometric design of 2 different aortic prostheses of similar size.
Aortic valve replacement leads to improvement of coronary flow but not to complete normalization. Coronary hypoperfusion contributes to higher left ventricular mass persistence, arrhythmias, congestive heart failure and sudden death. This prospective study compares 2 similarly sized aortic prostheses (mechanical and porcine) regarding coronary flow and hemodynamic performances in patients who underwent surgery for pure aortic stenosis. Sixty patients having undergone aortic valve replacement for pure aortic stenosis with Medtronic Mosaic Ultra bioprosthesis 21 mm (n = 30) or St Jude Regent mechanical valve 19 mm (n = 30) were evaluated preoperatively and 12 months postoperatively comparing the coronary flow and the hemodynamic behavior. Echocardiography and cardiac positron emission tomography were performed at rest and during exercise or adenosine maximal stimulation, respectively. The St Jude Regent mechanical valve, compared with the Medtronic Mosaic Ultra bioprosthesis, had reduced coronary flow reserve (2.1 ± 0.3 vs 2.3 ± 0.2; P = .003), less favorable systolic/diastolic time ratio (0.87 ± 0.02 vs 0.78 ± 0.03; P < .001), and higher mean transprosthetic gradient (46 ± 11 vs 38 ± 9; P = .003) during exercise. Multivariate analysis of impaired coronary reserve related indexed effective orifice area less than 0.65 cm/m(2) (risk ratio [RR], 1.9; 95% confidence intervals [CI], 1.5-2.8; P < .001), mechanical valve (RR, 2.5; 95% CI, 1.7-3.3; P < .001), and systolic/diastolic time ratio greater than 0.75 (RR, 2.6; 95% CI, 1.8-3.8; P < .001), as well as high transprosthetic gradient (RR, 1.7; 95% CI, 1.3-2.4; P < .001) ) during exercise with coronary reserve less than 2.2. Improvement of coronary flow and reserve was more evident for bioprostheses than for mechanical valves. The bioprostheses demonstrated superior hemodynamics during exercise, which may have some impact on exercise capability during normal daily life.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
AsciiDoc User Guide
===================
Stuart Rackham <srackham@gmail.com>
:Author Initials: SJR
:toc:
:icons:
:numbered:
:website: http://www.methods.co.nz/asciidoc/
AsciiDoc is a text document format for writing notes, documentation,
articles, books, ebooks, slideshows, web pages, blogs and UNIX man
pages.
.This document
**********************************************************************
This is an overly large document, it probably needs to be refactored
into a Tutorial, Quick Reference and Formal Reference.
If you're new to AsciiDoc read this section and the <<X6,Getting
Started>> section and take a look at the example AsciiDoc (`*.txt`)
source files in the distribution `doc` directory.
**********************************************************************
Introduction
------------
AsciiDoc is a plain text human readable/writable document format that
can be translated to DocBook or HTML using the asciidoc(1) command.
asciidoc(1) comes with a set of configuration files to translate
AsciiDoc articles, books and man pages to HTML or DocBook backend
formats.
.My AsciiDoc Itch
**********************************************************************
DocBook has emerged as the de facto standard Open Source documentation
format. But DocBook is a complex language, the markup is difficult to
read and even more difficult to write directly -- I found I was
and fixing syntax errors, than I was writing the documentation.
**********************************************************************
[[X6]]
Getting Started
---------------
Installing AsciiDoc
~~~~~~~~~~~~~~~~~~~
See the `README` and `INSTALL` files for install prerequisites and
procedures. Packagers take a look at <<X38,Packager Notes>>.
[[X11]]
Example AsciiDoc Documents
~~~~~~~~~~~~~~~~~~~~~~~~~~
The best way to quickly get a feel for AsciiDoc is to view the
AsciiDoc web site and/or distributed examples:
- Take a look at the linked examples on the AsciiDoc web site home
page {website}. Press the 'Page Source' sidebar menu item to view
corresponding AsciiDoc source.
- Read the `*.txt` source files in the distribution `./doc` directory
along with the corresponding HTML and DocBook XML files.
AsciiDoc Document Types
-----------------------
There are three types of AsciiDoc documents: article, book and
manpage.
Use the asciidoc(1) `-d` (`--doctype`) option to specify the AsciiDoc
document type -- the default document type is 'article'.
article
~~~~~~~
Used for short documents, articles and general documentation. See the
AsciiDoc distribution `./doc/article.txt` example.
AsciiDoc defines standard DocBook article frontmatter and backmatter
<<X93,section markup templates>> (appendix, abstract, bibliography,
glossary, index).
book
~~~~
Books share the same format as articles, with the following
differences:
- The part titles in multi-part books are <<X17,top level titles>>
(same level as book title).
- Some sections are book specific e.g. preface and colophon.
Book documents will normally be used to produce DocBook output since
DocBook processors can automatically generate footnotes, table of
contents, list of tables, list of figures, list of examples and
indexes.
AsciiDoc defines standard DocBook book frontmatter and backmatter
<<X93,section markup templates>> (appendix, dedication, preface,
bibliography, glossary, index, colophon).
.Example book documents
Book::
The `./doc/book.txt` file in the AsciiDoc distribution.
Multi-part book::
The `./doc/book-multi.txt` file in the AsciiDoc distribution.
|
{
"pile_set_name": "Github"
}
|
Denise White
Denise White is a former Miss Oregon USA who founded EAG Sports Management, a sports firm for high-end athletes.
Miss Oregon USA
Born in Escondido, California, White represented Oregon in the 1994 Miss USA pageant, broadcast live from South Padre Island, Texas on February 11, 1994, where she obtained the Congeniality Award, an honor she had previously received while competing for the Miss Oregon USA title.
Sports management career
White is the CEO and founder of her own sports firm, EAG Sports Management, which represents several high-end sports clients, which included her first client of fourteen years, eleven-time Pro Bowl selection and NFL Hall of Famer, Tony Gonzalez. Kellen Winslow II who appealed a suspension from Cleveland Browns' GM Phil Savage after Winslow criticized the team's handling of his hospitalization with staph infection; and defensive end for the Minnesota Vikings Jared Allen who has had some legal troubles and personally contributed $2500, along with White who donated another $2500, to an animal shelter for information leading to the arrest and conviction of the person responsible for abandoning a starving horse in LA.
In March 2016 it was announced by FOX2000 that a motion picture starring Jennifer Aniston portraying Denise White was in production for shooting in 2017. It is called "The Fixer". In 2018, White signed a deal with Apple and Jennifer Aniston's production company to develop a TV drama based on White's life and work.
References
External links
Official website
http://www.sportsbusinessdaily.com/Journal/Issues/2013/11/04/People-and-Pop-Culture/Plugged-In.aspx
http://abcnews.go.com/GMA/video/jennifer-aniston-play-beauty-queen-denise-white-fixer-36593913
https://variety.com/2016/film/news/jennifer-aniston-sports-drama-fixer-1201691334/
http://deadline.com/2016/01/jennifer-aniston-the-fixer-sports-dealmaker-denise-white-fox-2000s-1201692245/
http://www.mensjournal.com/magazine/the-woman-who-bails-out-the-nfls-bad-boys-20141114
http://www.sportsbusinessdaily.com/Journal/Issues/2016/02/08/Labor-and-Agents/Labor-and-Agents.aspx
Category:Year of birth missing (living people)
Category:Living people
Category:Businesspeople from California
Category:Miss USA 1994 delegates
Category:People from Escondido, California
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Aeningia
Aeningia is an island mentioned in the Natural History by Pliny the Elder, written in the 1st century CE. According to Pliny, Aeningia was inhabited by Sarmatians (Sarmati), Veneti (Venedi), Scirii (Sciri) and Hirri, bordering Vistula. Aeningia was probably a corrupted form of Aestingia (Estland) and referred to the area of the present-day Baltic states and northern Poland.
Some early European historians interpreted the name as a corrupt form of Finland, constructing a hypothetical Latin name Finningia as the original name. This probably originated from Olaus Magnus who was the first to place Finningia olim regnum on the map in 1539 or from Jacob Ziegler, who placed Finlandia and Einingia next to each other in present-day southwestern Finland in 1532.
References
Category:History of the Baltic states
Category:Classical geography
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Vehicle body structures provide structural support including components configured to provide protection to vehicle passengers during impact events.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Hundreds of Syrian refugees who have been waiting at the border for days to cross into Greece have dispersed a day after their representatives met with Prime Minister Ahmet Davutoğlu, who said Turkey could not open its borders for the security of the migrants unless European countries granted access.Davutoğlu previously said that Turkey would fly the refugees to wherever they wanted once the receiving countries agreed to accept them. During the meeting, he told the refugees' representatives that Turkey would gladly host them and care for all their needs as guests, but argued that it could not allow them to cross into Greece or Bulgaria because it feared for their safety if Europe did not legally allow them in.Hundreds of mostly Syrian migrants who had been blocked for days by police in the northwestern city of Edirne while trying to reach the nearby Greek border have agreed to abandon their roadside protest.A group of around 500 people, who had been engaged in a standoff with the police on the road leading into the city since Tuesday, lifted their makeshift camp Saturday night and left the area in buses provided by local authorities.Some joined a larger group of around 1,500 migrants still waiting inside the city for the chance to continue their journey over land to Greece, a mere 10 kilometers away, or Bulgaria, which is about twice that distance.Others took buses back to Istanbul, about 250 kilometers to the east.At a meeting with a delegation of refugees Saturday evening Prime Minister Ahmet Davutoglu had appealed to the refugees to "end their protest by Monday," he wrote on Twitter."The voices of our Syrian brothers have been heard by the entire world. They must now return to a normal life," Davutoglu wrote, promising more aid to the more than 2 million Syrian refugees living in Turkey to prevent them from trying to illegally cross into Europe.Prime Minister Davutoğlu met with the representatives of the Syrian refugees in Ankara Çankaya Palace on Saturday, calling on them to end their efforts to illegally cross the border, assuring them that he would be sending a letter to world leaders communicating their demands. "I will call on them to accept you. My request is for you to go back to your normal lives after making your demands heard by all through your protests."Davutoğlu talked to the members of the delegation after meeting with Austrian Foreign Minister Sebastian Kurz and Syrian National Coalition (SNC) member Khalid Hodja. The delegation, consisting of three representatives from refugees in Edirne and three more from Istanbul, was received by Davutoğlu, who was accompanied by Deputy Prime Minister Numan Kurtulmuş, Interior Minister Selami Altınok, the Prime Ministry's Disaster and Emergency Management Authority (AFAD) Chairman Fuat Oktay, Director General of Migration Atilla Toros and the prime minister's adviser on refugees Murtaza Yetiş.At the meeting, Davutoğlu assured the representatives of the refugees that all their needs would be addressed, but argued that as long as no country officially opened their doors to them, Turkey could not allow them to cross the border. "We are ready to send people to countries who open their doors to them, but unfortunately no country has given a favorable response so far," said the prime minister.Davutoğlu said he would be highlighting their plight at the United Nations General Assembly, which he is scheduled to visit to attend this year's opening of the session later this week. "We don't want Syrians to die in the Aegean Sea or on the roads," he told the representatives.The refugees gathered in Edirne, including a large number of children, had been demanding to be allowed travel to Europe by land instead of risking their lives in overcrowded migrant boats in the Aegean Sea.
|
{
"pile_set_name": "OpenWebText2"
}
|
Saturday, June 23, 2012
How to Make Yarn Pom Poms ~ fun for all ages!
All you need is card board (I use a cereal box!), scissors , and yarn of any kind!!
Children and adult of all ages can do this project. For younger children have an adult do the cutting!
Pom poms are used in many ways for many fun project and are not just for crocheters and Knitters! I will have a post coming up on how to make Monster friends and Princess friends out of them. They are also fun to make and toss up and down! They are so light there isn't a need to worry about breaking things! Add them to shoes, flip flops, hair clips for a fun way to accessorize!
I traced a glass to get the circle, Using a favorite cereal box can get less than eager children excited about crafts or make it more fun for ones that already love to craft!
There will be shrinkage so you will want to cut out the circle bigger than what you want your Pom pom to be.
Cut out 2 circles
They don't have to be perfect so feel free to let most 4 year olds and up ( with supervision) try to cut a circle out
next drawl a smaller circle ( again doesn't have to be perfect) and a v like shape
cut out both circles like this and you are ready to start!
Now you are done with your homemade pom pom maker!!! You can also purchase these at many crafts stores, But I think they are fun and easy to make!! However if you need to make alot of these before hand and want to save time there is less trimming involved with a store bought pom pom maker!
Now grab your yarn! Feel free to hold two or more stands of yarn at once when you wrap for a cool effect. I will show you with one multi color strand.
Place a small strand of yarn inside the two circles like this
tip* tape the outside perimeter of your circle if small children have trouble.
Now hold the two cardboard pieces together so the yarn doesn't slip out. Take the yarn from your ball or skein and begin to wrap your circles. I always start in the middle work my away to each side and back again so every spot was wrapped at least 2 twice. For a fuller one wrap 4 or 5 times.
Start wrapping
this is wrapped 4 times
Next we will cut the yarn placing the scissors between the two cardboard pieces like the pictures below
Now you need to tie a knot tightly with your two strings and remove the pom from the cardboard
trim to a nice round shape if desire or you can brush it with a fine tooth comb for a fuzzy look!!!
About Me
I started a crochet blog about 2 ish years ago just for fun, now I am reaching 10,000's every month :) I feel so blessed to be able to help teach so many how to crochet and I am glad so many love and share my FREE patterns and videos. In July 2014 I felt lead to start another blog about my faith/family and general crafts I do for both. For crochet patterns go to www.crochetchiq.com
|
{
"pile_set_name": "Pile-CC"
}
|
President Bill Clinton and Secretary Hillary Clinton are mourning the loss of rock 'n' roll pioneer Chuck Berry, who died at the age of 90 on Saturday (March 18).
The Clintons wrote in a statement that they are longtime fans of Berry’s music, and that the rock legend performed at the president’s inaugurations, and at the White House for his 25th Georgetown reunion.
“The man was inseparable from his music -- both were utterly original and distinctly American. He made our feet move and our hearts more joyful. And along the way he changed our country and the history of popular music,” the statement reads.
During his storied career, Berry's revolutionary sound and hits like “Maybellene,” “Roll Over Beethoven,” “Memphis,” “My Ding-a-Ling," “Sweet Little Sixteen" and “Johnny B. Goode” inspired many, and had a profound impact on the Billboard charts.
Read their full statement below.
“Hillary and I loved Chuck Berry for as long as we can remember. The man was inseparable from his music -- both were utterly original and distinctly American. He made our feet move and our hearts more joyful. And along the way he changed our country and the history of popular music. Chuck played at both my inaugurations and at the White House for my 25th Georgetown reunion, and he never slowed down, which is why his legend grew every time he stepped on stage. His life was a treasure and a triumph, and he’ll never be forgotten. Our hearts go out to his family and his countless friends and fans.”
|
{
"pile_set_name": "OpenWebText2"
}
|
Q:
Static Comments System for Jekyll
My blog currently runs Jekyll and the Minimal Mistakes theme, and uses the theme's built in functionality to add the Disqus comments system.
This JavaScript-based commenting system, to me sort of defeats the purpose of having a static blog in Jekyll, considering:
Its JavaScript creates a decisively non-static page.
Comments are not stored with the website.
Comments are stored in some database instead of flat-text files.
My question is, therefore: What is a suitable system for comments that stays as close to the Jekyll philosophy as possible (an ideally runs on gh-pages)?
I found several possible candidates:
Isso is a comments system which is looks similar to Disqus, it works with a SQLite database
Jekyll::StaticComments seems pretty suitable, but it means you have to manually add the comments from emails.
Are there any other options? If so, what would work with gh-pages, and what would work on a self-hosted Jekyll blog?
A:
Here's another solution which is dynamic and uses JavaScript, but doesn't store the comments at a 3rd party provider:
This guy made a static website with Jekyll, but uses GitHub's issue tracker to create his comments.
He uses GitHub Pages to host his blog, and for each new post, he creates a new issue in his blog's repository.
Then, he uses JavaScript to get the issue's comments from the GitHub API and show it on the page.
Here's a blog post which explains how to set this up:
GitHub hosted comments for GitHub hosted blogs
A:
Whether a javascript loaded, externally hosted comment system "defeats the purpose" of a static site is a matter of opinion.
For me, the point is to be able to host the site as entirely static resources, to take advantage of caching, CDN, distributed hosting, etc. I have seen huge advantages to that, and externally hosting my comments doesn't conflict at all.
That being said, it's an interesting question.
Isso (like Disqus) uses JS on the client side and requires server side software (Python based) that you have to manage, so it doesn't seem like this is any closer to your ideal.
Jekyll::StaticComments is in the right direction, but it's not supported on gh-pages if you have GitHub processing your Jekyll site (you can of course generate the static site yourself and then host it on GitHub Pages).
You also need a way for users to submit comments, and then to get those comments into a file that can be used by the generation process (not necessarily via email as you thought though).
So you need to take comments from somewhere, possibly email, possibly yet another third party hosted app (SimpleForm maybe).
And then you need to manually put them into the YAML site, regenerate, then publish, or, you can set up an automated build process for your site, which can pull the user submitted content when available and build and publish automatically.
Other than manually accepting comments through an off-site medium, you're going to deal with something dynamic somewhere.
|
{
"pile_set_name": "StackExchange"
}
|
Search This Blog
Books; People; Ideas : These are few of my favourite things. As I live between day-to-day compromises and change-the-world aspirations, this is the chronicle of my journey, full of moments of occasional despair and opportune discoveries, of connections and creations, and, most of all, my quest of knowledge as conversations.
Subscribe to this blog
Follow by Email
Transformation of Indian Higher Education: Noting The Signs of Change
For those who felt change is always slow and cumbersome in India, the recent move by the Indian government to annul the Rs. 500 and Rs 1000 notes overnight should be a clear sign that things have changed. Indeed, there are certain things which never change - the implementation was poor and thoughtless and the bewildering array of tinkering that came afterwards demonstrated the jugaad mentality - but Chinese-style decisive action may have now become politically fashionable.
This may give hope to those who thought India would open up its Higher Education sector eventually. There has been a bill, drafted and redrafted several times but never acted upon, to this effect dating back to 1990s. Various governments since then expressed its intention to make the Indian Higher Ed competitive globally, but in reality, had done the opposite. While India expanded its Higher Ed capacity significantly since 2006, creating a few thousand seats every day on average, the sector remained steadfastly parochial, corrupt and disconnected from global realities.
This is a tragedy if one considers the demographic and demand factors.
India hit a point of demographic advantage, with 2.1 million people turning 25 every single month in India. This made it the fastest growing Higher Education market in the world, with almost a quarter of the prospective students for college level education globally. Poor education made real the Confucian double threat: "Learning without thought is labour lost; thought without learning is dangerous."
Because of the demographic advantage, India is also poised to offer a quarter of world's new workers, about 25 million every year. And, yet, its very own IT service industries, caught in global recession, and threatened by increasing automation of what used to be called 'knowledge work', were poised to lose too many jobs. By some estimate, three-quarters of new service sector jobs in India, the ones that sustained the creation of the 'new middle class', are under threat of automation. And, while the talk is of 'moving up the value chain', the strengths that helped create the IT services industry - abundant pool of cheap manpower available for back office work - are precisely the weakness that prevents such a move.
The Indian students going abroad, given the rising aspirations and poor state of Indian Higher Education in general, is growing, though it was severely disrupted by the anti-immigration sentiments first in Australia (2007-8) and then in the UK (2011 onwards), two of three most popular destinations. However, despite this, the number of students travelling abroad for education is growing at almost 18% a year, and currently stands at 360,000 a year. Only China, with 700,000 students annually, has more students looking for global education (To put this in perspective, China's Higher Ed sector is nearly the double the size of India's in terms of number of students, the per capita income in China is about 5 times that of India and a number of foreign institutions have campuses or collaborative arrangements in China but almost nothing in India).
While India set itself on a path to create an open global economy, starting with structural reforms more than two decades ago, its insistence on a closed Higher Education system, which has become out of step with the rest of the world and decidedly anti-innovation, is inexplicable. The only explanation why things are this way can perhaps be found in the lobbying power of the 'Education Barons', the large, mostly South Indian (but not exclusively) College groups that would go any lengths to keep the market to themselves.
These groups were enormously powerful, not least because these colleges were effective licenses to print money. India, because of the demographic factors, is a sellers' market in education. It is also a market which combined excess demand with state regulation of fees that could be charged, resulting in a thriving black economy where the families would pay extortionate 'capitation fees' (or, once this was made illegal, some other form of payment) to send their children to college. The phenomena was well known and indeed the corruption was at all levels - a former Head of Indian Medical Council, which controls the Medical Schools across the country, was caught accepting a cash bribe from one of the colleges wanting to expand capacity - but these colleges controlled the politics through their money. Often, indeed, the college owners are the politicians, and vice versa.
However, this may be finally changing. When the government annulled the high denomination notes, these colleges were among the most affected: The very fact that it could even be done indicates a political shift. One could speculate about a weakening of the private education business in India: The low employability (about 18% for Engineering graduates), competition from different states (private engineering colleges and universities are no longer a monopoly of South Indian states), the demographic shift within India (with North and East having younger population, and South Indian population gradually ageing) and the weakness of the Indian IT services industries may all have contributed to the position.
The neglect of Higher Education has affected an entire generation of Indians, and the current government's mandate is, implicitly, to improve their lot. This may now happen. There are conversations in India about ring-fencing the profitable sectors, like Engineering and Medical Education, for domestic players, but allowing the Foreign Universities to offer courses in Basic Sciences and Liberal Arts. This may not be the ideal solution, but could be an important first step towards opening up an arcane and inward-looking system. There is also another idea, floated by the Indian Commerce Minister recently, about allowing Foreign Universities to open from Special Economic Zones, more like the UAE model (expect some 'Academic Cities'). This could work too, and there are some obvious candidate cities, like the upcoming city of Amravati, being built to become the capital of newly structured Indian state of Andhra Pradesh. The government's intention in transforming the education sector in general is evident in its efforts to get a new education bill passed (after a thirty year gap) and in breaking the monopoly of some professional organisations, like the Institute of Chartered Accountants of India (ICAI) or Indian Medical Council, on respective professional education areas. The current government, though socially conservative, is perhaps more aware than the previous ones about the middle class consensus that got it into office (and which can, in time, drive it out of it) and as a result, acutely keen on jobs and education that leads to jobs.
Overall, there is an opening - even if just a sliver of it right now - and a possibility of rapid transition of Indian Higher Ed sector. We have heard this before, but this time, it is more solid than it ever had been. The institutions in UK, which have more or less given up on India, because of the failed expectations, and Indian students, because of UK government's single-minded persecution of them, should now wake up and prepare to re-engage. And, indeed, they may need a different set of strategies than they used in the past: The usual institutional visits to Indian colleges, which had failed to yield any returns, intellectual or financial, now need to be abandoned. The Indian government is likely to depend on private initiatives to reform the Higher Ed sector, and it is likely that Indian companies and industrial groups would be the prime sponsors of the new projects involving foreign universities. This is a different kind of conversation, though not without precedent. But, this, a new institution-to-business conversation, may open up the world's most exciting Higher Education market for the UK universities, just as they ponder their options in the face of a sudden exit from European Union.
Comments
Popular posts from this blog
A friend has recently forwarded me a quote from Lord Macaulay's speech in the British Parliament on 2nd February 1835. I reproduce the quote below: "I have traveled across the length and breadth of India and I have not seen one person who is a beggar, who is a thief. Such wealth I have seen in this country, such high moral values, people of such calibre, that I do not think we would ever conquer this country, unless we break the very backbone of this nation, which is her spiritual and cultural heritage, and, therefore, I propose that we replace her old and ancient education system, her culture, for if the Indians think that all that is foreign and English is good and greater than their own, they will lose their self-esteem, their native self-culture and they will become what we want them, a truly dominated nation."
The email requested me to forward me to every indian I know. I was tempted, but there were two oddities about this quote. First, the language, which appeared …
Business gift giving has always been common and contentious at the same time. Business gifts are usually seen as an ‘advertising, sales promotion and marketing communication medium’ (Cooper etal, 1991). Arunthanesetal (1994) points out that such gifting is practised usually for three reasons: (a) in appreciation for past client relationships, placing a new order, referrals to other clients, etc.; (b) in the hopes of creating a positive, first impression which might help to establish an initial business relationship; and (c) giving may be perceived as a quid Pro quo (i.e. returning a favour or expecting a favour in return for something).
The practitioners of gift-giving generally argue that doing business is often an aggregation of personal interactions and relationships, and gift-giving should be seen as a natural way of maintaining and enhancing these relationships. ‘Business gifts, especially one given in the course of the festive season, is …
In an earlier post, I pointed out that the application of 'platform thinking' in education misses the mark, as it fails to understand how value is created in education. Since this apparently contradicts my earlier enthusiasm for the university as a 'user network', this statement needs further explanation.
To start with, Clayton Christiansen's idea that the universities of the Twentieth Century needs to evolve from its current 'value chain' model - wherein its value lies in its processes - to a form of User Network, where its value emanates from its community, still resonates with me. The Value Chain model, with departments, examinations, textbooks and degrees, that we know the university for, is very much a late Nineteenth/ early Twentieth century formulation. And, indeed, one can claim that the universities were always communities, and its value came from being a member of that community rather than its end product - the degrees - for much of history. It …
In most societies today, making profits are accepted as moral, if not especially praiseworthy. This was not as obvious as it appears today – people used to be embarrassed about making a profit not so long ago.
Crazy as it seems today, it is worth thinking why it was so.
Profits, as economists will put it, is the reward for risk-taking, for putting a business enterprise together in the pursuit of an objective. In this definition, remember, profits are not what it is commonly understood to be – the gross middle-line towards the bottom – but a figure net of entrepreneur’s earning [wages for his labour], dividends and interests on borrowed capital, and provisions for building and other physical assets [a sort of rent, offsetting what these assets could have earned if leased out]. This pure profit – surplus – accrues to a business as a reward to its organisation, for the act of entrepreneurship itself.
Economists were divided on how this surplus comes about. The conventional wisdom was, as I …
I wrote a note on Kolkata, the city I come from and would always belong to, in July 2010. Since then, the post attracted many visitors and comments, mostly critical, as most people, including those from Kolkata, couldn't see any future for the city. My current effort, some 18 months down the line, is also prompted by a recent article in The Economist, The City That Got Left Behind, which echo the pessimism somewhat.
I, at least emotionally, disagree to all the pessimism: After all Kolkata is home and I live in the hope of an eventual return. Indeed, some change has happened since I wrote my earlier post: The geriatric Leftist government that ruled the state for more than 30 years was summarily dispatched, and was replaced by a lumpen-capitalist populist government. Kolkata looked without a future with the clueless leftists at the helm; it now looks without hope.
However, apart from bad governance, there is no reason why Kolkata had to be poor and hopeless. It sits right inside …
Buzzwords have disadvantages. Right now, experiential learning is one, and that means we put the label on everything and it stops to mean anything. Also, this means reasonable conversation about experiential learning becomes difficult - at times such as this, either you preach experiential learning or you are traditional, antiquarian and hopelessly out of touch.
But, overlooking the limitations of experiential learning can cause big problems. Experiential Learning does many things - putting practice at the heart of learning is an important paradigm shift - but not everything, and it is important to be aware what it does not do.
Usually, we equate the terms Project-based Learning (the method) with Experiential Learning (the idea) and Learning from Experience (the ideal), treating them as one and the same and using the terms interchangeably. Any talk about distinctive meaning of these terms is usually seen as pedantic, but really represent very different ideas about education.
Learnin…
India's unemployment rate has reached a historical high and the government is panicking. It has rejected and suppressed the report and committed itself to inventing a new set of numbers. Members of the national statistical body have resigned, and the bad job numbers have become one of the worst kept secrets in its modern history.
As the government went down the road of obfuscation, it had also fooled itself believing that everything was fine. Once the statistical reports were questioned, the best explanation that the Head of the apex economic policy-making body could come up with was that Uber and other taxi-hailing companies have created millions of jobs in India. But then, the crisis is anything but hidden - walk on any street in any neighbourhood in any Indian city, and it is likely that you will see a few working-age people loitering, waiting or playing cards or carom in the middle of the day. IMF has recently warned that youth inactivity in India is highest among all develo…
Smart presentations don't mean valuable insights. So it is with the current fad of presenting the vision of an all-new 21st-century education - through presentations, conferences and infographics - style trumps substance all the way through.
For, despite the claims of revolutionary changes in society and the workplace, the neat charts that lay down 21st-century skills next to the 20th-century one's show do not how different they would be, but rather how similar these are projected to be.
We are told that we have arrived at a fundamentally disruptive moment in history and we need new skills. So, we need, for example, communication and critical thinking, learning to learn and a host of other cool things. Indeed, many of those terms are very familiar to the educator: Many of those were around for more than two centuries, ever since the dreams of liberal education were spelt out.
When these slides were presented, I often wondered whether the point about critical thinking meant …
I didn't write for almost three weeks as I was in India. The essence of my work there is to deal with employment creation. Part of my work is pro-bono - a city initiative focused on Industry 4.0 - and the other part is commercial, advising a large Indian corporation on the development of next-generation Skills training programmes. But the sense of crisis regarding unemployment cuts across scale and scope of my work and is a recurrent theme that pops up everywhere.
India has a really big challenge. About 2 million people reach working age every month in India, and even if only half of them are actively seeking employment, the few thousand jobs that the organised sector creates are woefully inadequate. India may be the fastest growing large economy in the world, but demonetisation of 2016 and poorly implemented General Sales Tax (GST) have hit businesses hard and froze up recruitment in many sectors. The widely promoted 'Make in India' initiative - the government's atte…
That governments are so enthusiastically trying to promote start-up cultures, handing out investment grants and building fancy new hubs, would make Milton Friedman turn in his grave: One can anticipate his protest - it is not the business of government to do business!
But then, democracy in its 'for the middle class, by the middle class' incarnation expects the government to be a job creation machine, and when all else fails, the Ministers say 'let start-ups be'! In fact, they celebrate it: In this affair, failure, the hallmark of government programmes, is some sort of credit. It allows the governments to celebrate the doctrine of creative destruction - ever so cool - while destructively creating a self-blaming proletariat, whose revolutions are limited to ventures and whose idea of nirvana is an Exit. There was never a better mantra invented to justify a permanent bureaucracy.
But, at this point, I must stop and make an important distinction. My post is about start-…
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
same image but getting different size when installing the app in simulator and device,AFNetWorking
I am doing like following to determine the size of the downloaded image during the block and then i will set the size of the uiimageview accordingly.
self.headerView is an outlet connection to uiimageview in the xib
__weak UIImageView *weakObj = self.headerView;
[self.headerView setImageWithURLRequest:[NSMutableURLRequest requestWithURL:[NSURL URLWithString:fundraiserInfo.imageUrl]]
placeholderImage:nil
success:^(NSURLRequest *request, NSHTTPURLResponse *response, UIImage *image) {
NSLog(@"image is %@",NSStringFromCGSize(image.size));
CGRect newFrame ;
newFrame = weakObj.frame;
newFrame.size.width = image.size.width;
newFrame.size.height = image.size.height;
weakObj.frame = newFrame;
}
failure:^(NSURLRequest *request, NSHTTPURLResponse *response, NSError *error) {
;
}
];
However, when running the app on the simulator (Device-Iphone), iam getting
image is {300, 222}
However, If I am using simulator (Retina 3.5) or (Retina 4) or I install the app on iphone4 or iphone 5, I am getting :
image is {150, 111}
Why it happens like that.
A:
Its because the image you're downloading isn't identified as a 'retina' image, so on retina devices it will appear as half the size it's actual pixels are. You can specify an image as retina by reading in an image who's filename is 'filenam@2x.jpg' or you can specify a UIImage's 'scale' value at the time of creation as 1.0 (non-retina) or 2.0 (retina)
[UIImage imageWithData:scale:]
[UIImage imageWithCGImage:scale:orientation:]
If you don't provide a scale value its assumed the image is the appropriate resolution as you've discovered.
|
{
"pile_set_name": "StackExchange"
}
|
Q:
Aligning of modal box
I am trying to align the modal box ( in this case it's a confirm box ) in the center of the page. So I set the position of the main container to be relative and then positioned the div element of the modal box using the following CSS code:
.confirmBox{
top:25%;
left:25%;
}
I have adjusted the values of the top and left attributes. This works fine at lower zoom but as I zoom in the box does not remain in the center of the page. How can I solve this using CSS?
The original code is actually big and i am not able to think of an instance for this case.
Still I am considering the div element with class="confirmBox" to be the code for confirmBox and attaching the fiddle http://jsfiddle.net/W6ATN/47/.
A:
You can use 50% left and top positions, and then subtract half of the width and height to make up for the size of the element:
position:absolute;
top:50%;
height: <your value>px;
margin-top: (negative value of your height, divided by 2);
width:<your value>px;
left:50%;
margin-left: (negative value of your width, divided by 2);
I think this way is easier to understand. If the width of the element is 40% (of its container), then it should be 30% to the left to be equally centered:
|-----30%-----|-------40%--------|-----30%-----|
which all == 100%
Or
you can use % width and % height, and use simple math to figure out the left and top positioning:
position:absolute;
height:40%;
width:40%;
left:30%; // (100 - width) divided by 2
top:30%; // (100 - height) divided by 2
|
{
"pile_set_name": "StackExchange"
}
|
Given the linear-gradient(black, white) value for background property,
should serialized value include implicit "top" gradient-line?
Quote from http://dev.w3.org/csswg/cssom/#css-values:
"Where CSS component values of the value can be omitted without changing
the meaning of the value (e.g. initial values in shorthand properties),
omit them. If this would remove all the values, then include the first
allowed value.
That could apply here but not necessary as it's unclear if it applies to
arguments of css functions too.
Currently, internal implementation in Opera does not return it. I can see
that webkit's does (and Gecko's is not quite up to date so not sure if
it's relevant).
--
Rafal Chlodnicki
Opera Software
|
{
"pile_set_name": "Pile-CC"
}
|
With plans for a full plebiscite doomed to fail in the Senate, PM Malcolm Turnbull says the Coalition is ready to spend $122 million of taxpayers' money on a postal vote starting from September 12.
Look back over the live blog.
|
{
"pile_set_name": "OpenWebText2"
}
|
How It Should Have Ended: ‘The Empire Strikes Back’
The comedic geniuses at HISHE (How It Should Have Ended) have set their sights on the classic “Star Wars: Episode V — The Empire Strikes Back” and come up with a hilarious take on how the movie … well … should have ended.
|
{
"pile_set_name": "Pile-CC"
}
|
The effect of sound intensity on the audiotactile crossmodal dynamic capture effect
Abstract
We investigated the effect of varying sound intensity on the audiotactile crossmodal dynamic capture effect. Participants had to discriminate the direction of a target stream (tactile, Experiment 1; auditory, Experiment 2) while trying to ignore the direction of a distractor stream presented in a different modality (auditory, Experiment 1; tactile, Experiment 2). The distractor streams could either be spatiotemporally congruent or incongruent with respect to the target stream. In half of the trials, the participants were presented with auditory stimuli at 75 dB(A) while in the other half of the trials they were presented with auditory stimuli at 82 dB(A). Participants’ performance on both tasks was significantly affected by the intensity of the sounds. Namely, the crossmodal capture of tactile motion by audition was stronger with the more intense (vs. less intense) auditory distractors (Experiment 1), whereas the capture effect exerted by the tactile distractors was stronger for less intense (than for more intense) auditory targets (Experiment 2). The crossmodal dynamic capture was larger in Experiment 1 than in Experiment 2, with a stronger congruency effect when the target streams were presented in the tactile (vs. auditory) modality. Two explanations are put forward to account for these results: an attentional biasing toward the more intense auditory stimuli, and a modulation induced by the relative perceptual weight of, respectively, the auditory and the tactile signals.
|
{
"pile_set_name": "Pile-CC"
}
|
-- Run-Length Encoding Compression algorithm implementation
-- See: https://en.wikipedia.org/wiki/Run-length_encoding
-- Compresses an input string using RLE algorithm
-- @str : an input string to be compressed
-- returns : the encoded string
function rle_encode(str)
local prev = str:sub(1,1)
local count = 0
local encoded = ''
for char in str:gmatch('.') do
if char == prev then
count = count + 1
else
encoded = encoded .. (count .. prev)
prev = char
count = 1
end
end
return encoded .. (count .. prev)
end
-- Decodes a given input
-- @str : an encoded string
-- returns : the original string
function rle_decode(str)
local decoded_str = ''
for count, match in str:gmatch('(%d+)([^%d]+)') do
decoded_str = decoded_str .. (match:rep(count))
end
return decoded_str
end
return {
encode = rle_encode,
decode = rle_decode,
}
|
{
"pile_set_name": "Github"
}
|
Planning Models for a Bus Rapid Transit System (BRT): The Case of Metrobus in Mexico City
Fernando Lambarry, Mara Maricela Trujillo, Luis Arturo Rivas
Abstract
This article is about the planningprocess of a bus rapid transit system in Mexico City, called Metrobus.It is aqualitative research that describes the two consolidated models of BRT planning, the one from the ResearchBoard of Transportation based in North America developed cities; and the one from the Institute of Policy forTransportation and Development applied in Latin American cities. Also the study describethe BRT system ofthe Mexico´s Cityin which fieldwork was done based on in-depth interviews to themanagers of the operatingcarrier companies of the 4 current BRT corridors. The Mexican case shows two variables that are not stronglyconsidered in the studied models and should be incorporated in similar context: the BRT environmental impactand the strategy of consensus withthe BRT operators.
To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.
|
{
"pile_set_name": "Pile-CC"
}
|
Fritz Glatz
Friedrich "Fritz" Glatz (July 21, 1943 – July 14, 2002) was an Austrian racing driver from Vienna. He raced under the pseudonyms Pierre Chauvet and Frederico Careca as well as a number of others.
Glatz began his career in 1980 racing in the German Formula Three Championship. The following year he drove in that series as well as the European Formula Three Championship and made his European Formula Two Championship debut. He competed in 10 Formula Two races in 1982 for Bertram Schäfer Racing but failed to score points, with a best finish of 8th. In 1983 again made 10 Formula Two starts, this time for Emco Sports but only succeeded in finishing twice and scored no points. In 1984 he returned to Emco Sports and finally broke into the points with a 6th place at Donington Park, with his single point good enough for 15th in the championship. Formula Two gave way to International Formula 3000 in 1985 and "Chauvet" only attempted two races with Oreca, failing to finish both races. In 1986 he drove in Formula 3000 nearly full-time for Jordan Racing but had a best finish of just 14th and he failed to qualify once. He also drove in two World Sports-Prototype Championship races for two teams (Roy Baker Racing in Jerez and Martin Schanche Racing in the Nürburgring, failing to score points on both occasions). Glatz was away from racing in 1987 but in 1988 returned to Formula 3000 at 45 years of age racing full-time for Racetech 3000. However, after 3 failures to qualify in 6 races, he left the team and went to Madgwick International. His best finish on the season was 12th, out of the points. He also made 3 World Sports-Prototype Championship starts. In 1989 he made one start in the inaugural season of British Formula 3000, which was good enough for 13th in points. He made a handful of sports car starts throughout the 1990s, mainly in Interserie.
In 2002 he was driving a 1996-vintage Arrows Footwork FA17 Formula One car in a EuroBOSS race at Autodrom Most when his car bounced over a curb and became airborne. Glatz died from his injuries.
Racing record
Complete European Formula Two Championship results
(key) (Races in bold indicate pole position; races in italics indicate fastest lap)
Complete International Formula 3000 results
(key) (Races in bold indicate pole position; races in italics indicate fastest lap.)
References
Category:1943 births
Category:2002 deaths
Category:Austrian racing drivers
Category:Racing drivers killed while racing
Category:German Formula Three Championship drivers
Category:FIA European Formula 3 Championship drivers
Category:European Formula Two Championship drivers
Category:International Formula 3000 drivers
Category:British Formula 3000 Championship drivers
Category:World Sportscar Championship drivers
Category:Sport deaths in the Czech Republic
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Probably the first question you are going to ask yourself when starting an rpg is what kind of storyline you’ll follow.
And while I cannot tell you what to do (that’s a decision you make for yourself) I can perhaps inform you what not to do:Read the rest of this entry →
|
{
"pile_set_name": "Pile-CC"
}
|
export interface LinkingCrossPlatform {
addEventListener: (
event: 'url',
handler: (payload: { url: string }) => void,
) => void
removeEventListener: (
event: 'url',
handler: (payload: { url: string }) => void,
) => void
canOpenURL(url: string): Promise<boolean>
clearCurrentURL(): void
getCurrentURL(): string
getInitialURL(): string
openURL(url: string): Promise<void>
}
export const Linking: LinkingCrossPlatform
|
{
"pile_set_name": "Github"
}
|
require('../../modules/es7.object.entries');
module.exports = require('../../modules/_core').Object.entries;
|
{
"pile_set_name": "Github"
}
|
Self-assembled monolayers (SAM) have been studied intensively due to their technological importance in various fields, from organic electronics to friction and catalysis (see, for example, refs [@b1], [@b2], [@b3], and references therein). Commonly it is assumed that the structure of the molecules within the SAM is only weakly dependent on their supra-molecular assembly. However, this is not necessarily the case, especially when dealing with SAM based on molecules well-known to exhibit structural diversity, such as oligopeptides.
Experiments performed more than a decade ago showed that the spin selectivity of photoelectrons transmitted (from a gold substrate) through an oligopeptide monolayer is affected by the direction of the dipole moment of the molecules relative to the electrons\' velocity[@b4] and that both are temperature-dependent[@b5]. These results are summarized in [Fig. 1](#f1){ref-type="fig"} for a gold-adsorbed monolayer of oligoalanine consisting of 22 amino acid units. By monitoring the work function of the sample (by means of its contact potential difference (CPD), with a reference gold surface) as a function of temperature, a change in the sign of the CPD is observed ([Fig. 1a](#f1){ref-type="fig"}). Although the null CPD signal does not necessarily coincide with the dipole flipping point, owing to the Pauli Push-back effect that changes the dipole of a monolayer-adsorbed surface even in the absence of a molecular dipole[@b6][@b7]. this change does reflect a change in surface dipole[@b8]. The dipole flip correlates with a change in the sign of the preferred spin of the transmitted photoelectrons ([Fig. 1b,c](#f1){ref-type="fig"}).
While the data of [Fig. 1](#f1){ref-type="fig"} may hint at a structural effect, the origin of the dipole and spin flipping remained unknown when these results were published. Indeed, determining structural changes in a monolayer at different temperatures, and correlating them with dipole and spin-filtering properties, is not a simple task.
Here, we augment the traditional characterization tools with a thorough computational investigation using molecular dynamics (MD) and density functional theory (DFT), as well as with a new experimental setup---the magnet-less Hall device, based on the recently discovered chirality-induced spin selectivity (CISS) effect[@b9][@b10][@b11][@b12]. The combined computational and experimental results reveal that the oligopeptide structure is highly temperature-dependent. We find that the surrounding chemical environment in the SAM can induce 'denaturation\' upon cooling, much as in biological systems 'cold denaturation\' can take place due to protein interaction with the surrounding water[@b13], but here the SAM plays the role of the solvent. This dramatic structural change results in a flip in the direction of the dipole moment of the adsorbed molecules, which, in turn, reverses the polarity of the preferred spin in electron transfer experiments. This phenomenon is of importance not only for the basic understanding of the structure of adsorbed molecules, but also opens new possibilities for controlling spin in organic spintronic devices[@b14].
Results
=======
Computational results
---------------------
Our working hypothesis at the outset of this investigation was that the oligopeptide chains may be entropy-driven to fold with increasing temperature. For investigating this initial idea, classical MD simulations were performed on a dense monolayer of 10-mer oligoalanine peptides attached covalently to a surface using the GROMACS package (see Methods section for details). Because the MD force fields are commonly calibrated at room temperature, simulations at very low temperatures are not necessarily reliable as they cannot be expected to represent the system energetics accurately. This difficulty was circumvented by avoiding the need to study the peptide chain explicitly over a wide temperature range. Instead, we tested the effect of folding directly by starting from two distinct organizations of the peptides in the self-assembled monolayer, an α-helical and an extended conformation. Each system was simulated for several nanoseconds at 300 K and was analyzed by focusing on the conformational energetics and dynamics of the central polyalanine peptide in the simulated monolayer. As shown in [Fig. 2a](#f2){ref-type="fig"}, the two configurations of the polyalanine monolayer exhibited different properties, with the monolayer of the helical peptides being more disordered and less packed. We further used the distribution of the inter-peptide angle ([Fig. 2c](#f2){ref-type="fig"}) to estimate the contribution of this degree of freedom for the configurational entropy. Using the simple relation *S*=−*k p*ln*p*, where *p* is the probability of the angle, we found that at room temperature this degree of freedom contributes 0.33 kcal mol^−1^ for the helical 10-mer monolayer but only 0.005 kcal mol^−1^ for the linear 10-mer monolayer. Confirming our hypothesis, the stability of the α-helix form at room temperature, thus, is indeed due to its relatively high entropy, while the linear form is more stable at low temperature because of its lower enthalpy. For example, the total number of hydrogen bonds for the central peptide is much larger when the peptide is linear than helical, as shown in [Fig. 2b](#f2){ref-type="fig"}. The detailed calculations suggest that polyalanine adsorbed as a self-assembled monolayer is going through 'cold denaturation\' upon cooling and is gradually transformed from the α-helix structure to an extended β-strand shape.
To examine the relation between the cold denaturation and electrical properties, we 'extracted\' the central peptide from MD runs with various degrees of stretching and examined the gas-phase dipole and electronic structure obtained from DFT calculations. Importantly, these calculations were performed using the optimally-tuned range-separated hybrid scheme (see Methods section)[@b15][@b16]. This approach was shown to provide accurate results for the outer-valence electronic structure of finite systems in general[@b17][@b18] and in particular predict their ionization potential and electron affinity from the highest occupied molecular orbital (HOMO) and lowest unoccupied molecular orbital (LUMO), respectively[@b15][@b16][@b19][@b20][@b21][@b22][@b23], where standard schemes typically fail[@b24][@b25]. This is of unique importance for highly polar systems[@b26], including protein and peptide molecules[@b27][@b28][@b29], where a strongly underestimated gap may lead, under a large internal electric field, to spurious gap closure and qualitative failure of the calculation.
Representative calculated structures of the model, 10-mer oligoalanine system are shown in [Fig. 3a](#f3){ref-type="fig"}. Importantly, and in agreement with the early experiments of [Fig. 1](#f1){ref-type="fig"}, we find that as the helical structure gradually unfolds and the terminal groups move further apart, the dipole becomes less negative and eventually changes sign. The flip in dipole direction upon structural change is not unique to this specific length of the peptide and also appeared in calculations of longer (20-mer) and shorter (4-mer) oligoalanines, not shown for brevity. The main effect causing the dipole flip is demonstrated schematically in [Fig. 3b](#f3){ref-type="fig"} for a 10-mer oligoalanine. For a linear conformation, the individual contributions of the local dipole moments formed by each of the peptide bonds add up coherently along the molecular axis, in the direction opposite to the dipole formed between the C-terminus and the N-terminus of the peptide. In the α-helical form, the direction of the same peptide-bond related local dipoles is flipped, due to additional hydrogen bonds that set the directionality of the oxygen atoms and change the relative direction of the O--N pairs in the peptide bond. The contribution of these local dipoles to the net dipole is then in the same direction as the contribution of the C-terminus to N-terminus dipole. This results in a larger net dipole moment in the case of the α-helix structure, which has an opposite sign to that of the linear structure. Accordingly, two different structures of similar length can lead to different dipole moments with different signs, as demonstrated by structures 3 and 4 in [Fig. 3a](#f3){ref-type="fig"}. Both structures are ∼25 Å long, but while in the somewhat shorter structure 3 many peptide bonds (which are closer to the C-terminus) are still within a helical form, in the somewhat longer structure 4 almost all peptide bonds are linearly aligned. This causes the dipole to flip sign along the molecular axis. Furthermore, the change of dipole sign is accompanied by a related flip in the position of the occupied and unoccupied orbitals, as visualized in [Fig. 3a](#f3){ref-type="fig"} by the charge density distributions of the HOMO and LUMO. This can be easily rationalized in terms of quasi-electron and quasi-hole states responding oppositely to the electric field[@b30].
Experimental results
--------------------
Encouraged by the above theoretical findings, we sought direct experimental evidence for chain elongation with decreasing temperature, through a combination of ellipsometry and FTIR (Fourier transform infrared spectroscopy see Methods section). Note that here and throughout this article, experiments were performed on {Ala-Aib} oligopeptides. These were chosen because they possess the same structure as the pure alanine-based ones, discussed so far, but exhibit better solubility. As shown below, they exhibit the exact same phenomena as the oligoalanine peptides. The IR spectroscopy showed consistently an increase in the absorption signal upon cooling to 14 K, with no significant changes observed below 100 K. However, while these data are consistent with the denaturation process, they do not constitute a clear indication for it. Ellipsometry data, given in [Table 1](#t1){ref-type="table"}, did provide clear evidence for chain elongation upon cooling. Experimentally, a length change that depends on the cooling time was observed. For very long cooling times the length is approximately doubled, in agreement with the theoretical prediction.
The remaining question, then, is the origin of the spin-transfer selectivity ([Fig. 1b](#f1){ref-type="fig"}) and whether cold denaturation can also explain its polarity inversion. Generally, spin-selectivity in electron transmission or tunneling through chiral layers is explained by the CISS effect[@b9][@b10][@b31], which has also been used to explain spin-specific electron transfer through oligopeptides[@b32] and even suggested to play a role in electron transfer through biological systems[@b33]. Briefly, as an electron moves along a chiral molecule it experiences the electrostatic potential of the molecule, which is chiral. In the electron\'s rest frame, the charge that defines the electrostatic potential generates a magnetic field which splits the degeneracy of the electron spin states. The sign of the spin being transferred more efficiently through the chiral molecules depends on the sign of the electric field acting on the electron. This is because spin-selectivity is controlled by spin--orbit coupling, which has the well-known form, , where is the electron velocity and is the electric field. Because the dipole flip induced by the cold denaturation necessarily implies a change in sign of the overall electric field across the oligopeptide, reversal in spin-filtering polarity emerges naturally.
While the above explanation is plausible, proving experimentally that indeed the preferred spin inversion is inexorably linked to structural changes is more difficult. To pursue this, we developed a new type of Hall-effect device, shown in [Fig. 4](#f4){ref-type="fig"} (see [Supplementary Fig. 1](#S1){ref-type="supplementary-material"}). The Hall effect is a long-known phenomenon[@b34]. Briefly, when current is flowing in a substrate between two electrodes, a magnetic field applied perpendicular to the current flow induces an electric potential perpendicular both to the current and the magnetic field. This effect is used as a standard tool for the study of properties of semiconductors, notably charge carrier concentration and mobility[@b35]. Here, we demonstrate that the spin-filtering capabilities of the chiral monolayer allow for the observation of the Hall effect without either an externally applied magnetic field or a permanent magnet. Instead, as explained below, the hall voltage arises from the accumulation of spin-transfer. This allows us to probe the relation between structural changes and spin inversion directly.
The device, shown schematically in [Fig. 4](#f4){ref-type="fig"}, is based on a two-dimensional electron gas structure, onto which two sets of Hall probe electrodes were evaporated. We have chosen to implement the device on a GaN substrate due to the long spin-lifetime of this material[@b36]. The width and length of the conducting channel were 40 and 700 μm, respectively. On the conduction channel, a SAM of NH~2~-{Ala-Aib}~8~-COCHNH~2~CH~2~PO~4~H~2~ or SHCH~2~CH~2~CO-{Ala-Aib}~5~-COOH oligopeptides were adsorbed, that is, either a phosphonate or a carboxylate group was used to bind the oligopeptide to the GaN surface. The IR spectra of the adsorbed layer are shown in [Supplementary Fig. 2](#S1){ref-type="supplementary-material"}. The oligopeptides chosen possess the same structure as the pure alanine-based ones discussed so far and were chosen because of their better solubility. CdSe nano particles (NPs) of ∼6 or ∼2 nm diameter were then attached to the amine or thiol tail. The SEM image of the layer with the nanoparticles is shown in [Supplementary Fig. 3](#S1){ref-type="supplementary-material"} and additional information is provided in the [Supplementary Methods](#S1){ref-type="supplementary-material"}. A constant current of 10 μA was injected along the structure, with the Hall voltage measured in the transverse direction (see Methods section).
The device was calibrated using an external magnetic field as shown in [Supplementary Fig. 4](#S1){ref-type="supplementary-material"}. As expected from standard theory, no Hall voltage is observed in the absence of a magnetic field under dark conditions. However, as shown in [Fig. 5](#f5){ref-type="fig"}, a Hall voltage appears - with either binding group, with two different sizes of NPs, and at both high and low temperature when the CdSe NPs are illuminated (with a 2.3 mW, 514 nm laser). Strikingly, the Hall voltage is of opposite sign at low and high temperatures.
Discussion
==========
How can these results be explained and how are they related to the spin-polarization results of [Fig. 1](#f1){ref-type="fig"}? A model explaining these results is given in [Fig. 6](#f6){ref-type="fig"}. Upon excitation of the NPs ([Fig. 6a](#f6){ref-type="fig"}), an electron is transferred from the substrate to the hole state on the NP ([Fig. 6b](#f6){ref-type="fig"}). Because the oligopeptides are chiral, it is expected that the electron transfer process is spin selective, according to the above-explained CISS effect. An electron with the opposite spin is then accumulated on the device surface, acting to magnetize the substrate and create an effective magnetic field for the Hall measurement. If spin--orbit coupling in the NP is large (which is the case for CdSe), the spin of the photo-excited electron on the NP is randomized such that it is spin-selected for transfer to the substrate, still within the lifetime of the net spin formed on the substrate side ([Fig. 6c](#f6){ref-type="fig"}). Both substrate and NP are now neutral again, but the net spin on the substrate is further enhanced ([Fig. 6d](#f6){ref-type="fig"}). If the spin-lifetime in the substrate is long relative to that in the NPs (which is indeed the case for a GaN substrate and CdSe NPs), a specific spin is accumulated on the device surface, creating net magnetization[@b37]. A Hall voltage can then be measured. Its magnitude must be proportional to the spin accumulation field and its sign must reflect the type of spin accumulated. Under continuous illumination, the net effect will naturally depend critically on the lifetime of the spin state at the substrate surface, the number of spins being transferred between the substrate and the NP during this time, and the rate of spin-randomization. The device presented here is unique because it allows, in principle, a high spin-polarization without a net charge polarization. Therefore, high sensitivity is achieved here due to spins 'loaded\' onto the device without encountering the difficulty of Coulomb repulsions that one may face when trying to spin-polarize a medium by injecting spin-polarized electrons. In this sense, the situation is similar to the known case of spin--torque transfer used to spin-polarized ferromagnetic materials[@b38].
With the model of [Fig. 6](#f6){ref-type="fig"} in mind, the results of [Fig. 5](#f5){ref-type="fig"} can now be rationalized. First and foremost, the spin transferred at room temperature is aligned parallel to the electron velocity, while at low temperature it is antiparallel to the velocity. This is in full agreement with an inversion of the CISS effect owing to the electrical dipole flip predicted theoretically in [Fig. 3](#f3){ref-type="fig"}. Other insights can also be drawn from the figure. Clearly, the Hall signal is larger in the case of the phosphonate linker than in the case of the carboxylic one. This result is consistent with reports on the stronger binding of the phosphonates to GaAs[@b39] and we assume, in light of these results, that the same applies to GaN. In addition, while at room temperature spin randomization is efficient both in the large and small NPs, due to phonon--spin interactions, at low temperature the signal is larger for small NPs. This can be explained by the quenching of the phonon--spin interaction and by the known faster spin-randomization in smaller NPs[@b40][@b41], by as much as an order of magnitude, due to spin interaction with the surface[@b41]. Therefore, when the spin randomization in the NPs is fast, the NPs can be excited many times during the lifetime of the spin polarization on the GaN (see [Fig. 5](#f5){ref-type="fig"}) and many spin-pairs can be injected into the GaN per NPs.
Using a calibration curve (see [Supplementary Fig. 4](#S1){ref-type="supplementary-material"}), we can estimate the effective magnetic field that would be required for obtaining the same Hall voltage from an ordinary Hall measurement. The fields are found to vary between several Gauss to almost 100 G. Because the density of atoms in GaN is ∼1 × 10^23^ atoms per cm^3^ and the volume of the dielectric (40 μm × 700 μm × 22 nm) is ∼6 × 10^−10^ cm^3^, the total number of atoms in this volume is about 6 × 10^13^. A simple organization of 10^12^ spins can create such a magnetic field if they are equally spaced in a box of the size of the dielectric above the conduction channel. Because the number of spins in this volume is significantly smaller than the number of atoms (by more than an order of magnitude), we can safely assume that the exchange interaction between them, which may limit spin-polarization, is not important. This number of spins implies that ∼10^3^--10^4^ spins must be transferred from each adsorbed NPs during the lifetime of spin-polarization in the GaN, which is between tens to hundreds of nanoseconds[@b36]. The spin lifetime on the NPs is of the order of a few psec[@b40][@b41]. This ratio of lifetimes is about an order of magnitude more than that required to produce the above net spin polarization, showing that the system can indeed produce the required effective magnetic field by spin polarization that does not involve charge polarization.
Last but not at all least: Beyond the computational evidence, can we establish a direct link between the above-discussed structural changes and the spin-transfer inversion? To probe this, the magnet-less Hall experiment was repeated with a *mixed* monolayer, consisting of 40% NH~2~-{Ala-Aib}~8~-COCHNH~2~CH~2~PO~4~H~2~ and 60% 11-mercaptoundecylphosphoric acid \[HSCH~2~(CH~2~)~9~CH~2~PO~4~H~2~\]. The phosphoric acid comprises alkane chains and therefore cannot form hydrogen bonds with the oligopeptide. Therefore the enthalpy gain expected from cold denaturation is much smaller and the effect should be much smaller, if not completely inhibited. The results are shown in [Fig. 7](#f7){ref-type="fig"}. Indeed, for the mixed monolayers, the Hall voltage does not change sign upon cooling. Some signal reduction is observed at low temperature, which we attribute to the fact that the two molecules do not mix ideally and there may well be small domains that include the oligopeptides alone and exhibit denaturation as above. Still, the results of [Fig. 7](#f7){ref-type="fig"} lend very strong support to the theoretical prediction and close the circle between denaturation, dipole inversion, and spin-transfer inversion.
To summarize, using MD and DFT calculations we have been able to explain hitherto baffling experimental results that indicated inversion of the dipole and spin-filtering properties of chiral oligopeptide monolayers upon cooling. The calculations showed that the α-helix structure of the adsorbed oligopeptides 'stretches\' upon cooling, in a manner reminiscent of 'cold denaturation\' in biological systems, but where the monolayer plays the role of the solvent. Furthermore, this structural change induces an inversion of the peptide dipole, owing primarily to rearrangement of hydrogen bonds. Phenomenological theory of the CISS effect then explains that this dipole flip must be accompanied by a concomitant change in the spin that is preferred in electron transfer experiments. We have then supported the structural prediction via ellipsometry measurements and confirmed the link between the structural changes and the spin-filtering properties using a novel magnet-less, solid-state hybrid organic--inorganic Hall device, employed with oligopeptide monolayers based on alanine and aminoisobutyric acid. The results were further supported by control experiments on mixed monolayers. The results presented indicate that inter-molecular interactions may be of importance in defining the structure of adsorbed molecules within a monolayer and its temperature-dependence may be strongly related to monolayer packing. In addition, we introduced here a new device that can monitor structural changes in adsorbed chiral molecules by their spin filtering properties. In the future, this may serve to probe the role of spin in electron transfer through bio-systems and its dependence on system structure.
Methods
=======
Device fabrication
------------------
A schematic representation of the AlGaN/GaN Hall devices and the setup is given in [Fig. 4](#f4){ref-type="fig"}. The AlGaN/GaN Hall devices were fabricated by standard photolithography. The AlGaN/GaN HEMT Epi wafers on sapphire-substrates were purchased from NTT AT. The structure consist of the following layers, from the bottom up (see [Fig. 4d](#f4){ref-type="fig"}): 1800, nm bulk i-GaN, 20 nm i-AlGaN, and a capping layer of 2 nm i-GaN. Ohmic contacts were achieved by e-beam evaporation of a standard Ti/Al/Ni/Au stack, followed by rapid thermal annealing at 900 °C. Device isolation was done by mesa etching using a BCl~3~/Cl~2~ base ICP-RIE (Plasma Therm).
Formation of monolayers
-----------------------
Three organic monolayers were adsorbed as SAM on the GaN: 11-mercaptoundecylphosphoric acid (PCI Synthesis), NH~2~-{Ala-Aib}~8~-COCHNH~2~CH~2~PO~4~H~2~ and SHCH~2~CH~2~CO-{Ala-Aib}~5~-COOH (both from Genemed Synthesis Inc.). Solvents were reagent grade or better (Merck, Baker, or Bio-Lab). The GaN devices were sonicated prior to molecular adsorption in hot acetone and ethanol for 10 s each, then etched for 30 s in 6 M HCl, rinsed in water, and dried under a N~2~ stream. The samples were then cleaned and oxidized in UV/ozone oxidation for 30 min and placed in the adsorption solution (1 m[M]{.smallcaps} in toluene) immediately. Vials with the absorption solutions were filled with N~2~ and placed in a desiccator for 19 h in the case of 1-mercaptoundecylphosphoric acid and NH~2~-{Ala-Aib}~8~-COCHNH~2~CH~2~PO~4~H~2~, and for 65 h in the case of SHCH~2~CH~2~CO-{Ala-Aib}~5~-COOH. After adsorption, the samples were rinsed with toluene and dried with nitrogen.
In order to form a monolayer of CdSe NPs on the top of the SAM coated substrates, the devices were immersed for 4 h in a solution of anhydrous toluene (99.8%, Aldrich) containing core-only CdSe with a diameter of 6.2--7.7 nm (MK Nano) or 2.4--2.6 nm (NN-Labs). The samples were than sonicated for 5--10 s and washed with toluene to remove excess NPs. More details are provided in the [Supplementary Methods](#S1){ref-type="supplementary-material"}.
Monolayer characterization
--------------------------
Monolayer formation was confirmed by FTIR in grazing-angle attenuated total reflectance mode (GATR-FTIR), using a ThermoScientific FTIR instrument (Nicolet 6700) equipped with a VariGATR accessory (Harrick Scientific) and with a single reflection Ge crystal. The spectra of the two oligopeptides, SHCH~2~CH~2~CO-{Ala-Aib}~5~-COOH and NH~2~-{Ala-Aib}~8~-COCHNH~2~CH~2~PO~4~H~2~, exhibit the characteristic peaks that include stretching frequencies at 1659 and 1648, cm^−1^, related to the amide I band, and peaks at 1544 and 1539, cm^−1^ due to the amide II band ([Fig. 8a,b](#f8){ref-type="fig"}). The spectrum of 1-mercaptoundecylphosphoric acid monolayer exhibits two large peaks at 2850 and 2917, cm^−1^, attributed to the symmetric and asymmetric CH~2~ stretching, respectively ([Fig. 8c](#f8){ref-type="fig"})[@b42][@b43]. A broad band between 1050 and 1200 cm^−1^ is related to the symmetric and antisymmetric P--O stretch and additional peaks associated with the P=O stretch appear at 1284 and 1315, cm^−1^ (ref. [@b44]).
Hall measurements
-----------------
The GaN Hall device was attached to a sample holder and electrically connected to the measuring units. A constant DC current of 10 μA was applied along the device using a Keithley 6221 current source and the Hall voltage (*V*~H~) across the device was measured using a Keithley Nanovoltmeter 2182A (see [Fig. 4](#f4){ref-type="fig"}). The resistance of the devices was in a range of 3--6 Ω. Chiral molecules were absorbed directly to the GaN, with CdSe NPs bound on top of them. The device was placed in between the magnetic poles and on a cold finger that could be cooled down to 14 K. A magnetic field of up to 0.5 T could be applied perpendicular to the sample plane by an electromagnet. The temperature of the sample holder was controlled by a temperature controller, with a temperature stability of 0.1% at 14 K and 0.3% at 300 K. For calibration, the conventional Hall voltage, as a function of external magnetic field, was measured for each device at several temperatures, 300, 120, 60 and 14 K. A representative plot taken at 300 K with a device coated with a monolayer of NH~2~-{Ala-Aib}~8~-COCHNH~2~CH~2~PO~4~H~2~ is shown in [Fig. 9](#f9){ref-type="fig"}.
Several control experiments were performed with circularly polarized light on devices coated with the different monolayers and with large and small nanoparticles, as shown in [Supplementary Figures 5,6](#S1){ref-type="supplementary-material"} and on a bare device (see [Supplementary Fig. 7](#S1){ref-type="supplementary-material"}) and with a device coated with 1-mercaptoundecylphosphoric acid and illuminated with circularly polarized light (see [Supplementary Fig. 8](#S1){ref-type="supplementary-material"}).
Molecular dynamics simulations of a polyalanine monolayer
---------------------------------------------------------
A monolayer composed of 25 Ala10 polyalanines was prepared *in silico* by organizing the peptides initially in 5 × 5 arrays. The longitudinal axes of the peptides were oriented along the Z axis of the simulation box. The peptide molecules were neutralized at the N-terminal end (contained a protonated amino group) and at the C-terminal end (contained a protonated carboxyl group). To imitate the monolayer conditions, the N-terminal nitrogen of the amino group of each peptide was constrained in the Z dimension, which results in the ability of the peptides in the brush to move freely only in the XY plane. Any other peptide atoms were completely free to move. The peptides were attached in either an α-helical or a linear (extended β-strand) conformation.
The initial distance between neighboring peptides was chosen empirically, such that the neighboring chains of ALA10 were placed as closely as possible, but without inter-chain clashes. During the MD the peptides were free to move in the XY plane and change the distance between neighboring peptides. The designed monolayers were studied using all-atom molecular dynamics simulations using the GROMACS package, Version 4.5.4 (ref. [@b45]) and with the CHARMM27 force field in vacuum conditions to mimic the dry environment of the monolayer[@b46]. In the initial step of the simulation conformations of the studied monolayers, the systems were relaxed using a conjugate gradient method of energy minimization. The LINCS algorithm[@b47] was used to control bonds during the simulation. The Leapfrog algorithm was employed with a step of 2 fs.
The 5 × 5 monolayers were simulated for 10 ns (analyses of the trajectories showed that longer simulations did not result in additional conformational changes) with a time step of 2 fs (ref. [@b28]). Temperature was controlled at 300 K using the Berendsen thermostat.
The conformations of Ala10 that were studied by DFT were generated by a pulling MD simulation when starting from a helical conformation. In this simulation, a force is applied at each terminal of the peptide at opposite directions. The pulling is done at rate of 0.01 nm/ps and with force constant of 1000, kJ per mol nm^2^. Several conformations were sampled along the transition from the α-helical to the β-strand structures, providing conformations with length varying between 15 and 32 Å.
Density functional theory calculations of gas-phase oligopeptides
-----------------------------------------------------------------
All gas-phase electronic-structure calculations were performed with Q-Chem[@b48], version 4.0, using the correlation-consistent polarized valence triple zeta basis set. We used the optimally-tuned range-separated hybrid approach[@b15], with a functional containing 80% short-range Perdew-Burke-Ernzerhof[@b49] exchange, 20% short-range Fock exchange, 100% long-range Fock exchange and full Perdew-Burke-Ernzerhof correlation. The range-separation parameter was optimally tuned so as to obey the ionization potential theorem for the peptides in the neutral form in case of an unbound LUMO level, and to obey the same theorem in both neutral and anionic forms for a bound LUMO level.
Additional information
======================
**How to cite this article**: Eckshtain-Levi, M. *et al.* Cold denaturation induces inversion of dipole and spin transfer in chiral peptide monolayers. *Nat. Commun.* 7:10744 doi: 10.1038/ncomms10744 (2016).
Supplementary Material {#S1}
======================
###### Supplementary Information
Supplementary Figures 1-8 and Supplementary Methods
We acknowledge the help of Dr Anup Kumar in performing the ellipsometry measurements. ME, EC, SM and RN acknowledge the support by the ERC-Adv grant and the Isreal Science Foundation. RN and YP acknowledge the support of the VW Foundation and the Israel Ministry of Science. SRA, SS and LK acknowledge support by the European Research Council, the Israel Science Foundation and the Lise Meitner Center for Computational Chemistry. SRA acknowledges an Adams Fellowship of the Israel Academy of Sciences and Humanities.
**Author contributions** M.E.-L and S.P.M. performed the experiments. E.C. produced the GaN devices and contributed to the data analysis. S.R.-A and S.S performed the DFT calculations. Y.G. performed the MD calculations. Y. P., Y. L., L. K. and R. N. conceived the project, supervised the experimental and computational work, assisted the analysis of the data and wrote the manuscript.
![Temperature-dependent contact potential (surface work function) and spin-polarized photoemission.\
(**a**) Temperature- dependent contact potential difference (CPD) measurement of gold coated with a self-assembled monolayer of L-polyalanine, bound to the surface through the carbon terminal. Zero voltage indicates the CPD of the bare gold. (**b**,**c**) Energy distribution of photoelectrons ejected from the gold substrate using a 248 nm laser with clockwise (+, blue) or counter clockwise (−, red) circularly polarized light, at temperatures of 297 K (**b**) or 250 K (**c**). Adapted from ref. [@b5], used with permission.](ncomms10744-f1){#f1}
{#f2}
{#f3}
{#f4}
{ref-type="fig"}, coated with 6 and 2 nm diameter CdSe nanoparticles that are attached to the GaN surface via NH~2~-{Ala-Aib}~8~-COCHNH~2~CH~2~PO~4~H~2~ or SHCH~2~CH~2~CO-{Ala-Aib}~5~-COOH molecules, at a current of 10 μA. The devices were illuminated with a 2.3 mW, 514 nm laser. Three sets of devices were measured and the variation in the signal among them is about 10%. The signal observed corresponds to effective magnetic fields of 20, 16, -5, -18, 73, 36, -8 and -22 G for panels **a**,**b**,**c**,**d**,**e**,**f**,**g** and **h**, respectively. All plots are presented after subtracting a background signal, measured for the same devices but covered with the non-chiral 11-mercaptoundecylphosphoric acid (see [Supplementary Fig. 8](#S1){ref-type="supplementary-material"}). Pink and light-blue areas correspond to 'light on\' and 'light off\' regimes, respectively.](ncomms10744-f5){#f5}
{#f6}
{ref-type="fig"} and [5](#f5){ref-type="fig"}, but with a mixed monolayer consisting of 40% NH~2~-{Ala-Aib}~8~-COCHNH~2~CH~2~PO~4~H~2~, 60% 11-mercaptoundecylphosphoric acid \[HSCH~2~(CH~2~)~9~CH~2~PO~4~H~2~\] molecules. The signal observed corresponds to effective magnetic fields of 11 and 3 G for the high and low temperature, respectively.](ncomms10744-f7){#f7}
{#f8}
{ref-type="fig"} was measured, with the Hall voltage shown as a function of applied magnetic field, measured for a device coated with NH~2~-{Ala-Aib}~8~-COCHNH~2~CH~2~PO~4~H~2~ monolayer.](ncomms10744-f9){#f9}
###### Monolayer thickness as a function of cooling time at 70K extracted from ellipsometry for a monolayer made from NH~2~-{Ala-Aib}~8~-COCHNH~2~CH~2~PO~4~H~2~ and adsorbed on Si/SiOx.
**Cooling time (min)** **Thickness of molecule before cooling (Å)** **Thickness of molecule after cooling (Å)** **Difference in thickness (Å)**
------------------------ ---------------------------------------------- --------------------------------------------- ---------------------------------
30 16±1 20±1 4
60 18±1 25±1 7
120 16±1 29±1 13
[^1]: These authors contributed equally to this work.
|
{
"pile_set_name": "PubMed Central"
}
|
REL: 10/31/2014
Notice: This opinion is subject to formal revision before publication in the advance
sheets of Southern Reporter. Readers are requested to notify the Reporter of Decisions,
Alabama Appellate Courts, 300 Dexter Avenue, Montgomery, Alabama 36104-3741 ((334) 229-
0649), of any typographical or other errors, in order that corrections may be made before
the opinion is printed in Southern Reporter.
SUPREME COURT OF ALABAMA
OCTOBER TERM, 2014-2015
____________________
1131282
____________________
Ex parte Stanford Pritchett
PETITION FOR WRIT OF CERTIORARI
TO THE COURT OF CRIMINAL APPEALS
(In re: Stanford Pritchett
v.
State of Alabama)
(Marengo Circuit Court, CC-7-112;
Court of Criminal Appeals, CR-13-0438)
STUART, Justice.
1131282
WRIT DENIED. NO OPINION.
Bolin, Parker, Shaw, Wise, and Bryan, JJ., concur.
Moore, C.J., dissents.
Main, J., recuses himself.*
*Justice Main was a member of the Court of Criminal
Appeals when that court considered an earlier appeal in this
case.
2
1131282
MOORE, Chief Justice (dissenting).
The trial court in this case denied Stanford Pritchett's
motion to withdraw his guilty plea. Because, in my view, the
Court of Criminal Appeals' unpublished memorandum affirming
the trial court's judgment, Pritchett v. State (No. CR-13-
0438, June 6, 2014), ___ So. 3d ___ (Ala. Crim. App. 2014)
(table), conflicts with the Alabama Rules of Criminal
Procedure and with our precedent on the requirements for a
guilty-plea colloquy, I respectfully dissent from the denial
of Pritchett's petition for a writ of certiorari.
Facts
Pritchett was charged with murder made capital because it
was committed by shooting into a vehicle; he pleaded guilty to
a lesser-included charge of murder and agreed to a negotiated
sentence of 23 years. During his plea hearing the trial judge
did not mention or review the explanation-of-rights form with
Pritchett or ask if he understood the rights he was waiving by
pleading guilty (except for the right to appeal). The trial
judge also did not review with Pritchett the maximum sentence
or minimum sentence for the crime to which he was pleading
guilty. The "Request for Guilty Plea" form Pritchett submitted
3
1131282
listed the sentencing range for the offense of murder as being
from 10 to 99 years' imprisonment or life imprisonment. In
fact, the range was 20 to 99 years' imprisonment because of an
applicable firearm enhancement. § 13A-5-6(a)(4), Ala. Code
1975.
Acting pro se, Pritchett moved to withdraw his guilty
plea. The trial court denied his motion. The Court of Criminal
Appeals affirmed its denial by an unpublished memorandum.
Pritchett v. State (No. CR-09-1050, Dec. 3, 2010), 92 So. 3d
816 (Ala. Crim. App. 2010) (table). This Court reversed the
Court of Criminal Appeals' judgment on the ground that
Pritchett was not represented by counsel in the proceedings on
his motion for withdrawal of the plea. Ex parte Pritchett, 117
So. 3d 356 (Ala. 2012). On remand, the trial court held a
hearing during which Pritchett's counsel raised the issue of
the court's failure to discuss with Pritchett the
minimum/maximum sentencing range. The trial court again denied
Pritchett's motion to withdraw his guilty plea. The Court of
Criminal Appeals again affirmed, by unpublished memorandum,
and Pritchett petitioned this Court for certiorari review.
Discussion
4
1131282
Explaining its most recent affirmance of the denial of
Pritchett's motion to withdraw his guilty plea, the Court of
Criminal Appeals stated in its unpublished memorandum:
"Pritchett filed in the circuit court a request to enter a
guilty plea, which he and his attorneys signed, that clearly
states the sentencing range for murder. Further, Pritchett
pleaded guilty pursuant to a negotiated agreement and received
the sentence upon which he agreed." Neither of these reasons
is persuasive.
"What is at stake for an accused facing death or
imprisonment demands the utmost solicitude of which courts are
capable in canvassing the matter with the accused to make sure
he has a full understanding of what the plea connotes and of
its consequence." Boykin v. Alabama, 395 U.S. 238, 243-44
(1969). Drawing on Boykin, this Court has held that "a
defendant, prior to pleading guilty, must be advised on the
record of the maximum and minimum potential punishment for his
crime." Carter v. State, 291 Ala. 83, 85, 277 So. 2d 896, 898
(1973) (emphasis added). Although at one time the Court of
Criminal Appeals noted that the submission of "a written
explanation of rights signed by appellant was more than
5
1131282
adequate to satisfy the requirements of Boykin," Ireland v.
State, 47 Ala. App. 65, 66, 250 So. 2d 602, 603 (Ala. Crim.
App. 1971), "a signed Ireland form is, alone, insufficient to
establish the voluntariness of a plea." Waddle v. State, 784
So. 2d 367, 370 (Ala. Crim. App. 2000).
Effective January 1, 1991, the Alabama Supreme Court
adopted the Alabama Rules of Criminal Procedure. Rule 14.4 of
those Rules reads as follows, in pertinent part:
"In all other cases [i.e., cases other than minor-
misdemeanor cases], except where the defendant is a
corporation or an association, the court shall not
accept a plea of guilty without first addressing the
defendant personally in the presence of counsel in
open court for the purposes of:
"(1) Ascertaining that the defendant has a full
understanding of what a plea of guilty means and its
consequences, by informing the defendant of and
determining that the defendant understands:
"(i) The nature of the charge and the
material elements of the offense to which
the plea is offered;
"(ii) The mandatory minimum penalty,
if any, and the maximum possible penalty
provided by law, including any enhanced
sentencing provisions ...."
Rule 14.4(a), Ala. R. Crim. P. (emphasis added).
"The court may comply with the requirements of Rule
14.4(a) by determining from a personal colloquy with
the defendant that the defendant has read, or has
6
1131282
had read to the defendant, and understands each item
contained in Form C-44B, CR-51, CR-52, or Form
C-44A, as the case may be."
Rule 14.4(d), Ala. R. Crim. P.
The trial court, though it engaged in a colloquy with
Pritchett, did not discuss with him the maximum and minimum
penalties for the crime of murder, nor did it mention or
discuss the CR-51 (Ireland) form that is used in non-habitual-
offender felony cases.1 The "Request for Guilty Plea" form
introduced at the hearing on Pritchett's motion to withdraw
his guilty plea, and cited by the Court of Criminal Appeals,
is not one of the forms identified in Rule 14.4(d), Ala. R.
Crim. P., as acceptable for use in conjunction with a guilty-
plea colloquy. In any event, that form contained incorrect
information and thus misinformed Pritchett that he faced a
minimum sentence of 10 years if convicted, rather than a
minimum sentence of 20 years.
For a defendant's decision to plead guilty to be
intelligent and voluntary, the defendant must know the correct
1
The CR-51 form introduced into evidence at the hearing
on Pritchett's motion to withdraw his guilty plea was a blank
form with no particularized information written on it and no
signatures. According to the Court of Criminal Appeals, the
record of Pritchett's previous appeal contains an Ireland form
indicating that the minimum sentence for murder is 10 years.
7
1131282
minimum sentence he or she will face by pleading guilty. "When
an accused who pleads guilty does so on the basis of
misinformation as to the range of punishment the guilty plea
is involuntary." Handley v. State, 686 So. 2d 540, 541 (Ala.
Crim. App. 1996). Furthermore, the trial judge did not
personally address Pritchett regarding either the "Request for
Guilty Plea" form or Form CR-51 as Rule 14.4(d) requires. The
Committee Comments to Rule 14.4 state:
"Section (d) is included to accommodate the
current Alabama practice of informing the defendant
of his rights through a form similar to that
approved in Ireland v. State, 47 Ala. App. 65, 250
So. 2d 602 (1971), and subsequent cases. The rule,
however, specifically retains the requirement that
the trial judge ... specifically question the
defendant concerning the information contained in
each item. Thus, in every case, the record should
affirmatively show a colloquy between the trial
judge and the defendant concerning all such matters.
... This rule requires such a colloquy and requires
that specific inquiry be made with regard to the
rights set out in Rule 14.4(a)(1) and (2)."
(Emphasis added.)
The Court of Criminal Appeals' holding in its unpublished
memorandum in this case that the "Request for Guilty Plea"
form, standing alone, satisfied the requirement that the plea
be voluntary was negated as long ago as 1973 in Carter. Rule
14.4, in effect since 1991, embodies the principle that
8
1131282
without a colloquy to review a true Ireland form stating all
the rights the defendant is forgoing by pleading guilty, a
guilty plea is not voluntary. Furthermore, the unsupported
statement of the Court of Criminal Appeals that the trial
court did not have to inform Pritchett of the minimum and
maximum sentences because he had agreed to a negotiated plea
finds no recognition in the Alabama Rules of Criminal
Procedure or in prior cases. Surely the information that the
minimum sentence, if the defendant is found guilty, is 20
years, as opposed to 10 years, is necessary for a defendant to
make a knowing and intelligent decision either to plead guilty
or to go to trial.2
Recently the Court of Criminal Appeals recognized this
principle in a case Pritchett cites frequently in his petition
for certiorari review. See Williams v. State, [Ms. CR-13-0436,
May 2, 2014] ___ So. 3d ___ (Ala. Crim. App. 2014) (holding
2
The Court of Criminal Appeals also argued that Pritchett
did not object to the trial court's failure to inform him of
the firearm enhancement. This objection, however, is included
in Pritchett's objection to the failure to inform him of the
correct sentencing range. See Anderson v. State, 668 So. 2d
159, 159 (Ala. Crim. App. 1995) (equating a failure to inform
a defendant of a sentencing enhancement with a failure to
inform him of "the correct minimum and maximum possible
sentences he could receive").
9
1131282
that a guilty plea was involuntary where the defendant was not
informed that a firearm enhancement would increase the minimum
sentence by 10 years). Because informing Pritchett of the
maximum and minimum possible sentences was "an absolute
constitutional prerequisite to acceptance of a guilty plea,"
Carter, 291 Ala. at 85, 277 So. 2d at 897, I believe
Pritchett's petition has merit. "The law in Alabama is clear
that the trial court's failure to correctly advise a defendant
of the minimum and maximum sentences before accepting his
guilty plea renders that guilty plea involuntary." White v.
State, 888 So. 2d 1288, 1290 (Ala. Crim. App. 2004). That the
sentence imposed (23 years) was within the legal range does
not control. "It does not matter that his sentence was legal.
'The accused's right to know the possible sentence he faces is
absolute.'" Bozeman v. State, 686 So. 2d 556, 559 (Ala. Crim.
App. 1996) (quoting Henry v. State, 639 So. 2d 583, 584 (Ala.
Crim. App. 1994)).
Conclusion
I would grant Pritchett's petition for a writ of
certiorari (1) to examine the apparent conflict between the
Court of Criminal Appeals' decision in this case and prior
10
1131282
decisions and (2) to maintain uniformity in our cases applying
Rule 14.4.
11
|
{
"pile_set_name": "FreeLaw"
}
|
If such a conflict goes away, we'll then be able to accept projects based on a particular brand or license.
...
Resolved Past Licensing Conflicts
We now welcome projects based on the following licenses that used to have conflicts:
Doctor Who - February 2014 Last updated February 25, 2014 Sometimes we have to turn down project submissions that refer to specific brands or licensed properties. We do this to avoid getting your hopes up for something we know we aren't able to make. In these cases, we already know the LEGO Group can't secure licensing rights to produce construction toys based on a particular brand or property, due to a conflicting interest with a third party.If such a conflict goes away, we'll then be able to accept projects based on a particular brand or license....We now welcome projects based on the following licenses that used to have conflicts:
(with thanks to Andrew Barnick)
Many fans ofand thebuilding toy sets have long wished for Doctor Who Lego toys. Now, a post on Lego's Cuusoo crowdsourcing design site suggests thatLego sets may be coming soon. Lego Cuusoo is a crowdsourcing platform where people can submit and vote on designs for Lego toy sets. If a project receives 10,000 votes of support, it is considered by a Lego review board, which decides whether the project is suitable to be produced commercially. Previous sets which have made it through this process include sets based on the Mars Curiosity rover,, and(available this summer).In the past, Lego Cuusoo proposals based onhave been rejected due to conflict with Character Building's license to producetoys. Character has produced Lego-compatible building toys since 2011 . It is not known whether Character's license has changed or expired, but today Lego posted the following on the Lego Cuusoo website:This does not mean that Lego is definitely going to license and producetoys, but it does mean that they no longer consider it impossible.
|
{
"pile_set_name": "OpenWebText2"
}
|
---
abstract: 'We consider graph states of arbitrary number of particles undergoing generic decoherence. We present methods to obtain lower and upper bounds for the system’s entanglement in terms of that of considerably smaller subsystems. For an important class of noisy channels, namely the Pauli maps, these bounds coincide and thus provide the exact analytical expression for the entanglement evolution. All the results apply also to (mixed) graph-diagonal states, and hold true for any convex entanglement monotone. Since any state can be locally depolarized to some graph-diagonal state, our method provides a lower bound for the entanglement decay of any arbitrary state. Finally, this formalism also allows for the direct identification of the robustness under size scaling of graph states in the presence of decoherence, merely by inspection of their connectivities.'
author:
- Daniel Cavalcanti
- Rafael Chaves
- Leandro Aolita
- Luiz Davidovich
- Antonio Acín
title: 'Open-system dynamics of graph-state entanglement'
---
*Introduction.–* Graph states [@graph_review] constitute an important class of entangled states with broad-reaching applications in quantum information, including measurement-based quantum computation [@Brie_review; @RausBrie], quantum error correction [@SchWer], and secure quantum communication [@DurCasBrie-ChenLo]. Moreover, instances of this family, such as the Greenberger-Horne-Zeilinger states, play a crucial role in fundamental tests of quantum non-locality [@GHZ]. Consequently, a great effort has been made both to theoretically understand their properties [@graph_review; @HeinEisBrie] and to create and coherently manipulate them experimentally [@ClusterExp]
Needless to say, it is crucial to understand the dynamics of their entanglement in realistic scenarios, where the system unavoidably decoheres due to experimental errors or to the interaction with its environment. Previous studies on the robustness of graph-state entanglement in the presence of decoherence observed a disentanglement time (or lower bounds thereof) insensitive to the system size . However, the disentanglement time on its own is not in general able to provide any faithful assessment about the entanglement’s robustness, since it can grow with the number $N$ of particles and yet the entanglement can get closer to zero the faster, the larger $N$ [@us]. The full dynamical evolution of entanglement must then be studied to draw conclusions on its fragility. Taking the latter into account, the entanglement of the linear-cluster states, an example of graph states, was shown to be robust with the size of the system against the particular case of collective dephasing decoherence [@Guhne].
The present work provides a general framework for the study of the entanglement evolution of graph states under decoherence. Our techniques apply to (i) any graph, and graph-diagonal, states; (ii) arbitrary kinds of noise, individual or collective; and (iii) any convex (bi- or multi-partite) entanglement quantifier that does not increase under local operations and classical communication (LOCC). In the developed formalism we consider local measurement protocols to efficiently obtain lower and upper bounds for the entanglement of the whole system contained in any given partition in terms of that of a considerably smaller subsystem consisting only of those qubits lying on the boundary of the partition. No optimization on the full system’s parameter space is required throughout. For an important class of noisy channels – namely arbitrary Pauli maps, to be defined below – the lower and upper bounds coincide, providing thus the exact entanglement evolution. With the same methods we also establish a second family of lower bounds that, despite less tight, depend only on the connectivity of the graph and not on its size. This allows us to assess the robustness based on the full dynamics of the entanglement and not just its disentanglement time. Our approach can also be used to establish lower bounds to the entanglement behavior of any initial quantum state.
*Graph states.–* Consider a mathematical graph $G_{(\mathcal{V},\mathcal{E})}\equiv\{\mathcal{V},\mathcal{E}\}$, composed of a set $\mathcal{V}$, of $N$ vertices $i \in
\mathcal{V}$, and a set $\mathcal{E}$, of edges $\{i,j\}\in
\mathcal{E}$ connecting each vertex $i$ to some other $j$. The associated physical state is operationally defined as follows: to each vertex $i$ associate a qubit, initialize all $N$ qubits in the product state ${| {g_{(\mathcal{V})}}_0 \rangle}\equiv\bigotimes_{i
\in\mathcal{V}} {| +_i \rangle}$, being ${| +_i \rangle}=({| 0_i \rangle}+{| 1_i \rangle})/\sqrt{2}$, and to all pairs $\{i,j\}$ of qubits joined by an edge apply a maximally-entangling control-$Z$ ($CZ$) gate, $CZ_{ij}={| 0_{i}0_{j} \rangle}{\langle 0_{i}0_{j} |}+{| 0_{i}1_{j} \rangle}{\langle 0_{i}1_{j} |}+{| 1_{i}0_{j} \rangle}{\langle 1_{i}0_{j} |}-{| 1_{i}1_{j} \rangle}{\langle 1_{i}1_{j} |}$. The resulting $N$-qubit graph state is $${| {G_{(\mathcal{V},\mathcal{E})}}_0 \rangle}=\bigotimes_{\{i,j\} \in \mathcal{E}} CZ_{ij}{| {g_{(\mathcal{V})}}_0 \rangle}.$$
![\[Graph\] (Color online) Example of a mathematical graph associated to a physical graph state. We have displayed a possible partition of this graph, splitting the system in three parts $\mathcal{A}$, $\mathcal{B}$, and $\mathcal{C}$. The vertices and edges in grey corresponds to the *boundary qubits* and the *boundary-crossing edges* respectively.](graph2){width="0.7\linewidth"}
An example of such graph is shown in Fig. \[Graph\], where the system is divided into three regions, $\mathcal{A}$, $\mathcal{B}$ and $\mathcal{C}$. We call all edges that go from one region to the other the *boundary-crossing edges* and label the subset of all such edges by $\mathcal{X}$. All qubits connected by the boundary-crossing edges are in turn called the *boundary qubits* and the subset composed of all of these is called $\mathcal{Y}$.
*Open-system dynamics.–* Our ultimate goal is to quantify the entanglement in any partition of arbitrary graph states undergoing a generic physical process during a time interval $t$. The action of such process on an initial density operator $\rho$ can be described by a completely-positive trace-preserving map $\Lambda$ as $\rho_t=\Lambda(\rho)$, where $\rho_t$ is the evolved density matrix after time $t$. All such maps can be expressed in a Kraus representation, $\Lambda(\rho)=\sum_\mu p_\mu K_\mu \rho
K_\mu^\dag$, where $\sqrt{p_\mu}K_\mu$ are called the Kraus operators (each of which appearing with probability $p_\mu$), which satisfy the normalization conditions Tr$[K_\mu^\dag K_\mu]=1$ and $\sum_\mu p_\mu =1$ [@nielsen]. The Kraus representation guarantees that the map is (completely) positive and preserves trace normalization. When the map can be factorized as the composition of individual maps acting independently on each qubit, the noise is said to be individual (or independent); if not, it is said to be collective.
A very important class of processes is described by the Pauli maps, separable (non-entangling) maps whose Kraus operators are given by tensor products of Pauli operators $X$, $Y$, $Z$, and the identity. Examples of these are the collective or individual depolarizing, dephasing or bit-flip channels [@nielsen]. As we show next, it is possible to determine the exact entanglement evolution of graph and graph-diagonal states (whose formal definition is provided below) subject to individual Pauli maps.
*Exact entanglement of graph states under Pauli maps.–*
Let us start by recalling that a graph state is the simultaneous eigenvector – of eigenvalue 1 – of the $N$ generators of the stabilizer group, that is, of the $N$ operators consisting each of which of one $X$ acting on each single qubit and $Z$’s on all its neighboring ones [@graph_review]. Therefore, the application of an $X$ or $Y$ operator on a qubit $k$ of a graph state is equivalent to the application of $Z$ operators on all neighboring qubits of $k$, or on all of its neighboring qubits and on $k$ itself, respectively. The action of any Pauli map $\Lambda$ on a graph state is thus equivalent to that of another separable map, $\tilde{\Lambda}$, whose Kraus operators $\tilde{K}_\mu$ are obtained from $K_\mu$ replacing in the latter each $X$ and $Y$ operators by tensor products of $Z$ and identity operators according to the rule just described [@comment]. Thus we need to consider how a general combination of $Z$ operators acts on a graph state. We use the multi-index $\tilde{\mu}=(\mu_1,...,\mu_N)$, with $\mu_i=\{0,1\}$, to denote such a combination through $Z^{\mu_1} \otimes Z^{\mu_2}\otimes...\otimes Z^{\mu_N}$. The action of such operator on a graph state ${| {G_{(\mathcal{V},\mathcal{E})}}_0 \rangle}$ generates another graph state ${| {G_{(\mathcal{V},\mathcal{E})}}_{\tilde{\mu}} \rangle}$, orthogonal to the former one [@graph_review; @HeinDurBrie]. These considerations imply that $\rho_t$ can be expressed as $$\begin{aligned}
\label{graph diagonal} \nonumber
\rho_t&=&\Lambda({| {G_{(\mathcal{V},\mathcal{E})}}_0 \rangle})=\tilde{\Lambda}({| {G_{(\mathcal{V},\mathcal{E})}}_0 \rangle})\\
&=&\sum_{\tilde{\mu}} \tilde{p}_{\tilde{\mu}}
{| {G_{(\mathcal{V},\mathcal{E})}}_{\tilde{\mu}} \rangle}{\langle {G_{(\mathcal{V},\mathcal{E})}}_{\tilde{\mu}} |}.\end{aligned}$$ All possible $2^N$ graph states ${| {G_{(\mathcal{V},\mathcal{E})}}_{\tilde{\mu}} \rangle}$ associated to the graph $G_{(\mathcal{V},\mathcal{E})}$ form a complete orthonormal basis of the $N$-qubit Hilbert space. State is a [*graph-diagonal state*]{}. Calculating the exact entanglement in any partition of the such state is in general a problem that involves an optimization over the entire parameter space of $\rho_t$. In what follows we will show that it is possible to greatly reduce the complexity of this optimization problem. Consider any partition of the state $\rho_t$. We now factor out explicitly all the $CZ$ gates but those corresponding to the boundary-crossing edges and write the state as $$\begin{aligned}
\label{rho_t} \rho_t&=&\bigotimes_{\{i,j\} \in \mathcal{E}/\mathcal{X}}
CZ_{ij}\sum_{\gamma,\delta} \tilde{p}_{\gamma,\delta}
{| {G_{(\mathcal{Y},\mathcal{X})}}_\gamma \rangle}{\langle {G_{(\mathcal{Y},\mathcal{X})}}_\gamma |}\nonumber\\
&\otimes&{| {g_{(\mathcal{V}/\mathcal{Y})}}_\delta \rangle}{\langle {g_{(\mathcal{V}/\mathcal{Y})}}_\delta |}\bigotimes_{\{k,l\} \in \mathcal{E}/\mathcal{X}}CZ_{kl},\end{aligned}$$ Here we have grouped together all indices inside $\tilde{\mu}$ into two new multiple indices, $\gamma$ and $\delta$. Multiple index $\gamma$ accounts for all possible graph states ${| {G_{(\mathcal{Y},\mathcal{X})}}_\gamma \rangle}$ generated by applying tensor products of $Z$ and identity operators to the graph state ${| {G_{(\mathcal{Y},\mathcal{X})}}_0 \rangle}\equiv\bigotimes_{\{i,j\}
\in\mathcal{X}} CZ_{ij}\otimes{| {g_{(\mathcal{Y})}}_0 \rangle}$, associated to the [*boundary graph*]{} $G_{(\mathcal{Y},\mathcal{X})}=\{\mathcal{Y},\mathcal{X}\}$, with ${| {g_{(\mathcal{Y})}}_0 \rangle}\equiv\bigotimes_{i \in\mathcal{Y}}
{| +_i \rangle}$. Multiple index $\delta$ on the other hand accounts for all states ${| {g_{(\mathcal{V}/\mathcal{Y})}}_\delta \rangle}$ generated from $Z$ or identity operators on the state ${| {g_{(\mathcal{V}/\mathcal{Y})}}_0 \rangle}\equiv\bigotimes_{i
\in\mathcal{V}/\mathcal{Y}} {| +_i \rangle}$ of the non-boundary qubits $\mathcal{V}/\mathcal{Y}$. Probability $\tilde{p}_{\gamma,\delta}$ is defined as the sum of all $p_{\mu}$ such that $\tilde{K}_\mu{| {G_{(\mathcal{Y},\mathcal{X})}}_0 \rangle}\otimes
{| {g_{(\mathcal{V}/\mathcal{Y})}}_0 \rangle}={| {G_{(\mathcal{Y},\mathcal{X})}}_\gamma \rangle}\otimes{| {g_{(\mathcal{V}/\mathcal{Y})}}_\delta \rangle}$. Because the $CZ$ gates explicitly factored out in state are local unitary operations with respect to the partition of interest, the entanglement of $\rho_t$, $E(\rho_t)$, reads $$\begin{aligned}
\label{ent}
E\big(\sum_{\gamma,\delta}
\tilde{p}_{\gamma,\delta}{| {G_{(\mathcal{Y},\mathcal{X})}}_\gamma \rangle}
{\langle {G_{(\mathcal{Y},\mathcal{X})}}_\gamma |}\otimes{| {g_{(\mathcal{V}/\mathcal{Y})}}_\delta \rangle}{\langle {g_{(\mathcal{V}/\mathcal{Y})}}_\delta |}\big).
\end{aligned}$$ where $E$ is any convex entanglement quantifier not increasing under LOCC. In what follows, we first establish a lower and upper bound to this expression and then show that these bounds coincide, obtaining the exact expression of the graph-state entanglement evolution.
First, consider an LOCC protocol consisting of measuring all the non-boundary qubits $\mathcal{V}/\mathcal{Y}$ of the state within brackets in Eq. in the product basis composed by all orthonormal states $\{{| {g_{(\mathcal{V}/\mathcal{Y})}}_\delta \rangle}\}$ and tracing out the measured subsystem after communicating the outcomes. The remaining subsystem $\mathcal{Y}$ is [*flagged*]{} by each measurement outcome $\delta$ – meaning that outcome $\delta$ provides full information about to which state $\mathcal{Y}$ has been projected after each measurement run. The final entanglement after the entire protocol is then given by the average entanglement over all measurement runs. Since $E$ is non-increasing under LOCC, $E(\rho_t)$ must satisfy $$\label{perfectlower} E(\rho_t)\geq\sum_\delta\tilde{p}_\delta E\Big(\sum_{\gamma}
\tilde{p}_{(\gamma|\delta)}{| {G_{(\mathcal{Y},\mathcal{X})}}_\gamma \rangle}
{\langle {G_{(\mathcal{Y},\mathcal{X})}}_\gamma |}\Big),$$ where $\tilde{p}_{\delta}\equiv\sum_{\gamma}\tilde{p}_{\gamma,\delta}$ is the total probability of occurrence of an event $\delta$ and $\tilde{p}_{(\gamma|\delta)}$ is the conditional probability of an event $\gamma$ given that event $\delta$ has happened.
On the other hand, convexity of $E$ implies that $E(\rho_t)$, as given by , must necessarily be smaller or equal to $\sum_\delta \tilde{p}_\delta E\Big(\sum_{\gamma}
\tilde{p}_{(\gamma|\delta)}{| {G_{(\mathcal{Y},\mathcal{X})}}_\gamma \rangle}
{\langle {G_{(\mathcal{Y},\mathcal{X})}}_\gamma |}\otimes{| {g_{(\mathcal{V}/\mathcal{Y})}}_\delta \rangle}{\langle {g_{(\mathcal{V}/\mathcal{Y})}}_\delta |}\Big)$, which, since locally added ancillary systems do not change the entanglement, is in turn equal to the right-hand side of . This means that the right-hand side of Eq. provides at the same time an upper and a lower bound to $E(\rho_t)$ and therefore yields its [*exact*]{} value, [[*[i.e. ]{}*]{}]{}:
$$\label{exact}
E(\rho_t)=\sum_\delta\tilde{p}_\delta E\Big(\sum_{\gamma}
\tilde{p}_{(\gamma|\delta)}{| {G_{(\mathcal{Y},\mathcal{X})}}_\gamma \rangle}
{\langle {G_{(\mathcal{Y},\mathcal{X})}}_\gamma |}\Big).$$
A comment on the implications of this exact result on the computational-cost is now in place. The calculation of the entanglement of systems composed by $N=N_\mathcal{Y}+N_{\mathcal{V}/\mathcal{Y}}$ qubits (being $N_\mathcal{Y}$ and $N_{\mathcal{V}/\mathcal{Y}}$ the number of boundary and non-boundary qubits respectively) is a problem that, in general, involves an optimization over $O\big(2^{2N}\big)$ real parameters. Through Eq. such calculation is reduced to that of the average entanglement over a sample of $2^{N_{\mathcal{V}/\mathcal{Y}}}$ states (one for each measurement outcome $\delta$) of $N_\mathcal{Y}$ qubits, which involves at most $2^{N_{\mathcal{V}/\mathcal{Y}}}$ optimizations over $O\big(2^{2N_\mathcal{Y}}\big)$ real parameters. Thus the present method provides an exponential decrease in the computational power needed to calculate $E(\rho_t)$, since only the boundary qubits appear in the computation of Eq. .
In order to illustrate the power of the method we have calculated, using , the exact entanglement of formation $E_F$ [@Wootters] of 1-D graph states under the action of independent depolarizing channels, which mix, with probability $p$, any one-qubit state with the maximally mixed state $\openone/2$ [@nielsen]. In Fig. \[Fig2\] we display the curves corresponding to the bipartition first qubit versus the rest, although other partitions can be considered. The 1-D graph state (also called the linear cluster state), given by ${| LC \rangle}=\bigotimes_{i=1}^{N-1} CZ_{i,i+1} \bigotimes_k^N{| +_k \rangle}$, evolves from $p=0$ towards a final maximally mixed state at $p=1$. Not only this calculation would have been impossible had we attempted a brute-force optimization approach, but also, since in this particular case the boundary qubits are just two, the use of allows to perform the calculation with no optimization at all, for an explicit formula for the entanglement of formation exists for arbitrary two-qubit systems [@Wootters].
![ \[Fig2\] (Color online.) Entanglement of formation ($E_F$) in the partition of the first particle versus the rest for 1-D graph states of 2 (black), 4 (grey) and 7 (red) particles undergoing individual depolarization as a function of the depolarization probability $p$. The dashed curve represents a size-independent lower bound. ](UptoSevennotDashed){width=".80\linewidth"}
*Beyond graph states and Pauli maps.–* The expression is actually a method for calculating the entanglement of any graph-diagonal state as the one in . Since Pauli maps acting on initial graph-diagonal states also produce graph-diagonal states, all the arguments used so far are also valid for this class of initial states. Furthermore, any quantum state can be depolarized to a graph-diagonal state by means of LOCC [@ADB]. Using again the fact that the entanglement of a state does not increase if an LOCC protocol is applied, one can see that the present method also provides (in general non-tight) lower bounds to the decay of the entanglement of any initial state subject to any decoherence process.
*Robustness of graph-state entanglement.–* The developed techniques can be further simplified to obtain new lower bounds to graph-state entanglement during all the evolution that, despite not being tight, can be calculated in a much more efficient way than and often turn out to be independent of the total number of qubits. This dramatically simplifies the study of the entanglement robustness of graph states as a function of the system’s size, a central question for the applicability of these states as quantum information resources. As an illustration, we compare next graph states of different sizes under the action of general $N$-qubit Pauli maps $\Lambda$ that scale with $N$ in a way such that, for each $\sqrt{p_{\mu}}K_\mu$, the Kraus operators of the map acting on $M$ more qubits are obtained as tensor products of $\sqrt{p_{\mu}}K_\mu$ with Pauli or identity operators on the other $M$ qubits, weighted with some new probabilities that sum up to one (for each $\mu$). That is, so that the total probability of event $\mu$ on the $N$ first qubits, $p_{\mu}$, remains the same. All the individual or collective Pauli maps mentioned above fall into this category. The state between brakets in Eq. can then be written also as $\sum_{\gamma}
\tilde{p}_{\gamma}{| {G_{(\mathcal{Y},\mathcal{X})}}_\gamma \rangle}{\langle {G_{(\mathcal{Y},\mathcal{X})}}_\gamma |}\otimes\sum_\delta
\tilde{p}_{(\delta|\gamma)}{| {g_{(\mathcal{V}/\mathcal{Y})}}_\delta \rangle}{\langle {g_{(\mathcal{V}/\mathcal{Y})}}_\delta |}\big)$, where $\tilde{p}_{\gamma}\equiv\sum_{\delta}\tilde{p}_{\gamma,\delta}$ and $\tilde{p}_{(\delta|\gamma)}$ is the conditional probability of $\delta$ given $\gamma$. By tracing out the state of the non-boundary qubits ([*i.e.*]{}, by disregarding the flag that lead to above) and using again the fact that $E$ does not increase under LOCC, we arrive at $$\label{size-independent LB}
E(\rho_t)\geq E\big(\sum_{\gamma}
\tilde{p}_{\gamma}{| {G_{(\mathcal{Y},\mathcal{X})}}_\gamma \rangle}{\langle {G_{(\mathcal{Y},\mathcal{X})}}_\gamma |}\big).$$ Now, notice that – for the maps here-considered – probability $\tilde{p}_{\gamma}$ depends only on the boundary graph $G_{(\mathcal{Y},\mathcal{X})}$ and the number of non-boundary qubits directly connected to it (the boundary graph is affected by the noise on up to its first neighbors), not on the total system size $N$. Bound is unaffected by the addition of $M$ extra particles if these new particles are not connected to the boundary subsystem. In the latter sense, and for the considered noise scenario, noisy graph-state entanglement is thus robust with respect to the variation of the system size provided $G_{(\mathcal{Y},\mathcal{X})}$ and its connectivity to the rest do not vary.
Size-independent bound (for the case of $E=E_F$) is compared with the exact entanglement, again for a linear cluster and the individual depolarizing channel, in Fig. \[Fig2\]
*Discussion.–* To summarize, in this work we have presented a general framework to study the entanglement decay of graph states under decoherence. It is important to emphasize that any function that satisfies the requirements of convexity and monotonicity under LOCC falls into the range of applicability of the machinery here-developed. This includes genuine multipartite entanglement quantifiers, as well as those functions aiming at quantifying the usefulness of quantum states for given quantum informational tasks.
To conclude with, let us make the following observations. First, the techniques developed to obtain perfect bounds can also be applied to tackle some cases other than Pauli maps. For example, for graph states in the presence of individual thermal baths at arbitrary temperature, an LOCC procedure similar to the one used to obtain the bound , but using general measurements instead of orthogonal ones, can be used to obtain highly non-trivial entanglement lower bounds.
Second, bound , when restricted to bipartite entanglement, provides the same type of lower bound as the one used in section V-B of Ref. [@HeinDurBrie] to find lower bounds to the entanglement lifetime for the case of $E$ being the negativity. The present bound has the advantage of dealing with other possible partitions and general entanglement quantifiers. All these topics will be touched upon elsewhere.
We thank J. Eisert, M. Plenio, F. Brandão, and A. Winter, for inspiring conversations, and the CNPq, the Brazilian Millenium Institute for Quantum Information, the PROBRAL CAPES/DAAD, the European QAP, COMPAS and PERCENT projects, the Spanish MEC FIS2007-60182 and Consolider-Ingenio QOIT projects, and the Generalitat de Catalunya, for financial support.
[20]{}
M. Hein [[*[et al.]{}*]{}]{}, arXiv:quant-ph/0602096.
H. J. Briegel, D. E. Browne, W. DŸr, R. Raussendorf, and M. Van den Nest, Nature Phys. [**5**]{}, 19 (2009).
R. Raussendorf and H. J. Briegel, Phys. Rev. Lett. [**86**]{}, 5188 (2001); R. Raussendorf, D. E. Browne, and H. J. Briegel, Phys. Rev. A [**68**]{}, 022312 (2003).
D. Schlingemann and R. F. Werner, Phys. Rev. A [**65**]{}, 012308 (2001).
W. Dür, J. Calsamiglia, and H. J. Briegel, Phys. Rev. A [**71**]{}, 042336 (2005); K. Chen, H.-K. Lo, Quant. Inf. and Comp. Vol.7, No.8 689 (2007).
D. M. Greenberger, M. A. Horne and A. Zeilinger, in [*Bell’s Theorem, Quantum Theory, and Conceptions of the Universe*]{}, M. Kafatos (Ed.), Kluwer, Dordrecht, 69 (1989).
M. Hein, J. Eisert, and H. J. Briegel, Phys. Rev. A [**69**]{}, 062311 (2004).
P. Walther [[*[et al.]{}*]{}]{}, Nature [**434**]{}, 169 (2005); N. Kiesel [[*[et al.]{}*]{}]{}, Phys. Rev. Lett. [**95**]{}, 210502 (2005); C. Y-. Lu et al., Nature Phys. [**3**]{}, 91 (2007); K. Chen [[*[et al.]{}*]{}]{}, Phys. Rev. Lett. [**99**]{},120503 (2007); G. Vallone, E. Pomarico, F. De Martini, and P. Mataloni, Phys. Rev. Lett. [**100**]{}, 160502 (2008).
C. Simon and J. Kempe, Phys. Rev. A [**65**]{}, 052327 (2002).
W. Dür and H.-J Briegel, Phys. Rev. Lett. [**92**]{}, 180403 (2004); M. Hein, W. Dür, H.-J. Briegel, Phys. Rev. A [**71**]{}, 032350 (2005).
L. Aolita, R. Chaves, D. Cavalcanti, A. Acín, and L. Davidovich, Phys. Rev. Lett. [**100**]{}, 080501 (2008); L. Aolita [[*[et al.]{}*]{}]{}, Phys. Rev. A [**79**]{}, 032322 (2009).
O. Gühne, F. Bodoky, and M. Blaauboer, Phys. Rev. A [**78**]{}, 060301 (2008).
M. A. Nielsen, I. L. Chuang, *Quantum Computation and Quantum Information* (Cambridge Univ. Press, Cambridge, 2000).
H. Aschauer, W. Dür, H. -J. Briegel, Phys. Rev. A [**71**]{}, 012319 (2005).
Notice that different indices $\mu$ can often lead to the same operator $\tilde{K}_\mu$ (the same product of $Z$ operators).
W. K. Wootters, , 2245 (1998).
|
{
"pile_set_name": "ArXiv"
}
|
Q:
How can I learn to think and interpret things more critically?
As a freelance journalist, I spend a lot of time reading the media. Often I'll come across an article that I admire, and feel is leaps and bounds above my own work. Naturally, I want to learn from such pieces: but often I struggle to understand exactly why I find them inspirational. Without that, they're not very helpful as learning tools.
I understand the oft-given advice that to improve as a writer, one must read a lot and read with a critical mind. However, I frequently feel that I'm not doing the latter bit as well as I should.
I studied Literature to A-level (age 16-18 - no idea what the US equivalent was), and did well. However as the years have passed and I've no longer needed to exercise those critical skills, they've atrophied. I've become more used to reading and interpreting things on their surface level, and not looking so hard to see what's underneath.
This is of particular importance to me because much of what I write is criticism. A lot of the material I cover doesn't offer layers of allegory or metaphor. But when it's there, I'm sure I often miss it. So I need to learn to be critical not just of writing but other media, and to learn the language of critical theory that goes with it.
There's also an element of self-discipline here. Why look harder when you don't need to? Especially when it comes to fast-paced media where it's easy to get caught up in the ride. When a moment rises that invites reflection, it's too late: you're swept on to the next scene.
So - what can I do to learn more about how to think critically, and to encourage myself to use those skills? I'm aware that a lot of Universities offer free videos of lecture courses nowadays, which on the surface would seem an ideal resource - but almost everything I've found in that vein is STEM focussed.
A:
You could read a text (literary or media) and then look at what other people have said about it. This can make you more aware of what to look for so that you can look for it in future and make you think about the text in a deeper way.
You could look into literary theory as a way to make you more aware of different ways of looking at texts. Personally, when I was taught about semiotics it changed how I looked at Shakespeare. If you want a start on literary theory I would recommend downloading the audio versions of the Open Yale course available here.
On a simpler level, try using the frameworks that you were given for analysing literature at A-Level.
|
{
"pile_set_name": "StackExchange"
}
|
Image copyright Reuters
Ryanair's information to customers about compensation for cancelled flights is "woefully short", consumer group Which? has said.
Ryanair has stepped up efforts to deal with the 2,100 flights it has cancelled during the next six weeks.
But Which? said it should make its compensation obligations clear.
Meanwhile, Italy's competition regulator has opened a probe into the cancellations which it said the low-cost airline could have prevented.
Ryanair is the biggest carrier in Italy, outstripping even Alitalia, which it is trying to buy.
The Irish airline could be fined as much as 5m euros.
The cancellations may have been "largely due to foreseen organisational and management reasons... not random, external causes outside of (the company's) control", said the Italian Competition and Market Authority (AGCM).
Cancellations
Ryanair said all 315,000 affected customers received emails on Monday, advising them of the flight changes and offering alternative flights and refunds, after it decided at the weekend to cancel 40 to 50 flights every day for the next six weeks.
It has blamed the fiasco on its own mistaken decision to force its pilots to take their remaining annual leave before the end of this year, rather than by the end of the financial year next March, which has left it without enough pilots to fly all its scheduled planes this month and next.
The airline said that by the end of Wednesday, it expected to have reassigned 55% of the customers - 175,000 - to other Ryanair flights.
More than 63,000 refunds will have been processed, it said.
However Ryanair pilots have knocked back a proposal from the carrier to pay them bonuses to encourage them to work through the enforced holiday leave.
'Blow to passengers'
The airline's current advice to customers on its website does not mention the word "compensation", to which customers are entitled under European legislation.
The Ryanair website only says: "We understand that flight cancellations may cause distress and we will accommodate your option of choice wherever possible, while complying with EU Regulation 261/2004."
Which? took a dim view of this oblique approach and said compensation should be paid automatically.
Its spokeswoman, Alex Neill, said: "Ryanair's approach to informing affected passengers about compensation falls woefully short.
"It is legally required to spell out compensation rules when a flight is cancelled and, in our view, has so far failed to do that, leaving passengers hunting around for information.
"This is another blow for the thousands of passengers who have already had to endure huge inconvenience as a result of this fiasco," she added.
Image copyright PA Image caption Ryanair boss Michael O'Leary announced full details of his airline's flight cancellations on Monday 18 September, 2017
Ryanair estimates that the cancellations will cost it up to 20m euros (£17.7m), though this figure could eventually be higher, as the airline's estimate amounts to only 63 euros per affected passenger.
The total number of passengers now affected is, however, lower than the airline's original figure of 390,000 because Ryanair's planes were only 70% booked in October, compared with 90% full in September.
The airline also said it had taken on extra office staff to deal with the backlog of flight changes and compensation requests.
It added that it hoped to have dealt with more than 95% of the affected customers by the end of this week.
Kenny Jacobs, Ryanair's chief marketing officer, apologised again for its mistakes.
"We have taken on extra customer service teams to speed up the rate at which we accommodate and action alternative flight requests or refund applications," he said.
"We expect to have the vast majority of these completed by the end of this week.
"The vast majority of these requests are being dealt with online, but as our call centres and chat lines are extremely busy, we ask affected customers to bear with us as we do everything we can to respond to their requests and try to resolve any problems we have created for them, for which we again sincerely apologise," he added.
|
{
"pile_set_name": "OpenWebText2"
}
|
The novel DPP-4 inhibitors linagliptin and BI 14361 reduce infarct size after myocardial ischemia/reperfusion in rats.
Dipeptidylpeptidase-4 inhibition is reported to have beneficial effects on myocardial ischemia. Mechanisms might include a reduced degradation of stromal cell-derived factor-1 alpha with subsequent increased recruitment of circulating stem cells and/or incretin receptor-dependent pathways. This study evaluated the novel xanthine-based dipeptidylpeptidase-4 inhibitors linagliptin (BI 1356) and BI 14361 in cardiac ischemia. Male Wistar rats were pretreated with linagliptin or BI 14361 and subjected to ligation of the left anterior descending coronary artery for 30 min. Dipeptidylpeptidase-4 inhibition significantly reduced the infarct size after 7 days (-27.7%, p<0.05) and 8 weeks (-18.0%, p<0.05). There was a significantly improved maximum rate of left ventricular pressure decline (dP/dt min) in linagliptin-treated animals 8 weeks after ischemia/reperfusion. Apart from that, treatment did not improve cardiac function as determined by echocardiography and cardiac catheterization. Immunohistological staining revealed an increased number of cells positive for stromal cell-derived factor-1 alpha, CXCR-4 and CD34 within and around the infarcted area of BI 14361-treated animals. Linagliptin and BI 14361 are able to reduce infarct size after myocardial ischemia. The immunohistological findings support the hypothesis that dipeptidylpeptidase-4 inhibition via reduced cleavage of stromal cell-derived factor-1 alpha might lead to an enhanced recruitment of CXCR-4+ circulating progenitor cells.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Regio-defined amino[5]oxa- and thiahelicenes: a dramatic impact of the nature of the heteroatom on the helical shape and racemization barriers.
The present approach to heterohelicenes provides original [5]oxa- and thiahelicenes, where both oxygen and sulfur atoms are located at the end of the inner helix. Quantum chemical calculations are carried out to determine the pathway for interconversion between two enantiomers and demonstrate that the energy barrier is strongly dependent on the nature of the heteroatom present on the helical shape.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
The State of Cloud Computing Around the World: Europe
A large number of potential adopters of cloud computing in Europe are averse to embracing the technology fully due to unfounded fears that it has unnecessary risks or dangers operations and management, resulting in the region falling behind a large part of the world.
While there are specific challenges that need to be hurdled with regard to cloud computing, they can be addressed, and in fact doing so would necessitate a faster and more streamlined adoption of cloud computing by Europe’s organisations, businesses, and public authorities, which would result in accelerated productivity growth and an increase in competitive across the board.
There are several key areas where actions are needed in order to help drive the adoption of cloud computing in Europe:
The market of Europe, to date, cannot be looked at as a single market because the European Union only unifies certain aspects of politics. By and large, each country continue to maintain their own laws on technologies, press freedom, and consumer rights
Aside from the fragmentation of the laws and culture, there is also the issue of unclear and highly debatable laws. These laws don’t clearly draw up the rights and protection of cloud consumers that prevents businesses to fully trust the cloud
Issues with contracts due to fears over data access and portability, as well as change of control and ownership of the data.
Various conflicting standards due to a proliferation of different standards and a lack of certainty as to which ones provide adequate levels of interoperability and portability.
The above factors prevent, or at least make it difficult to start, a “European Super-Cloud”, or a dedicated hardware infrastructure that will provide generic cloud computing services to the public sector users across Europe.
Digital Single Market
Due to its emancipation from geographical limitations, cloud computing is capable of elevating the digital single market to a new level. But this will only happen if we manage to implement single market rules. The gains to be had are potentially huge, with the estimated GDP to be generated by the public cloud amounting to 250 Billion Euro in 2020 with cloud-friendly policies implemented, compared to only 88 billion Euro if there is no intervention. It is also expected to generate around 2.5 million new hobs.
A large number of the steps needed to make Europe more a continent that is able to maximize the potentials of the cloud were already extensively discussed in the Single Market Pillar of the Digital Agenda for Europe and the Single Market Act. Majority of said steps are now being discussed by lawmen. In actuality, these items are not difficult to decide on. However, as in any other item in legislation, things are being dragged longer.
In Europe’s Digital Agenda, there is a campaign to simplify copyright clearance, management, and cross-order licensing. The key actions proposed by the Digital Agenda are designed to enhance Europe’s capacity to exploit the exciting new opportunities of cloud computing for both producers and consumers of digital content.
For the cloud to work well as a platform for digital content services, there is a need to enhance access to and use of all sorts of content and data across different devices and territories.
Besides completing the Digital Single Market, a climate of certainty and trust must be developed by allaying fears and stimulating the active adoption of cloud computing technology throughout Europe. In order to create trust in cloud technology, there is a chain of confidence building steps that need to be taken, such as:
Legislation, Legislation, Legislation
There is a need to come up with a wider standard, with endorsements of certificates by regulatory authorities in order to indicate compliance with industry standards and legal obligations. This will go a long way towards allaying fears over the cloud.
At the moment, individual vendors are all fighting for dominance by locking in their customers coming up with proprietary offshoots or variations of cloud computing technology, resulting in different technologies that lack interoperability, data portability, and reversability, and further stoking the fires of uncertainties towards the technology.
Fortunately, the path towards standardisation and certification are already underway, with the US National Institute for Standards and Technology (NIST) already managing to publish a series of documents that contain a widely accepted set of definitions. The European Telecommunications Standards Institute (ETSI) is also getting involved by organizing different groups operating under one umbrella to ensure that each country under the union is using a standardised program.
Much as this is a huge undertaking, it is far from being adequate. There are more issues that need to be dealt with and even more conflicts that need to be settled.
Drawing Clear Expectations and Commitments
Unlike traditional IT outsourcing arrangements, which are up front and described in detail, cloud computing contracts tend to be more open ended due to its greater flexibility. This results in most service level agreements for cloud services to be complex and multi-layered, with equally extensive and complicated disclaimers. These sort of contracts may be advantageous to providers who want to protect themselves, but it results in a lot of consumers turning away out of fear of being taken advantage of. Even large companies who usually have their own team of legal experts tend to stay away as the contracts rarely provide enough liability for data integrity, confidentiality, or even service continuity.
It is therefore imperative that a regulatory body be implemented in order to bridge the different, and usually diverging national sales law rules by providing contractual parties with a uniform set of rules.
The European Cloud Partnership
Shaping the European cloud computing market would require the help of the public sector, primarily because it is the largest buyer of IT services, and can therefore set stringent requirements for features, performance, security, interoperability, and data portability and compliance with technical requirements. Several member states have already started national initiatives, including Andromede in France, Trusted Cloud in Germany, and G-Cloud in the UK. Unfortunately, due to the fragmentation of the public sector market, the requirements provided by the initiatives have very little impact, with services integration being too low that the citizens do not always get the best value for money.
A more widely followed public requirements can only result in a more organized and adaptable set of rules that will enable businesses to afford the cloud. Enabling more businesses to adapt the cloud will reduce costs and make operations more seamless. The private sector can also stand to benefit from higher quality services, more competition, and faster standardisation for high-tech SMEs.
A new initiative called European Cloud Partnership (ECP) is being started in order to a more unified standard that all members of the EU can follow. This means that even when specifics of the law change from country to country, each member of the UE will follow the same principle.
It is designed to bring together industry expertise and public sector users that will work on common procurement requirements for cloud computing in a more transparent and open way. It does not mean that European countries are set to build data centers. It doesn’t even equate to a drive to encourage more cloud start-ups. It is geared towards creating a unified standards that will ensure all players that enter the European market work within the standards of Europe.
The ECP will also set out to help prevent fragmentation by ensuring that public cloud usage is safe, secure, greener, and interoperable in accordance with European rules. Under the guidance of a steering board, the ECP will bring together public authorities working with industry consortia in order to implement a pre-commercial procurement action to:
Identify requirements for the public sector cloud, as well as develop standardised specifications for IT procurement.
Aim towards joint procurement of cloud services via public bodies based on the emerging common user requirements.
Set up a coordinated effort between stakeholders when it comes to executing cloud-related actions as described in this document.
There will be a series of actions designed to support the three key actions above, as well as other initiatives that are conducive to faster cloud implementation and adoption for both consumers and businesses, such as broadband access, roaming, and open data.
Measures and Allies
There is a need to investigate how to make full use of all available instruments through research and development support under Horizon 2020 on long term challenges that pertain to cloud computing as well as in assisting the move towards cloud-based solutions (such as software for switching from legacy systems to cloud, and for managing hybrid services) and avoiding any lock-in to unfair SLAs.
There is also a need to launch physical centers and set up other equipment that would connect different European cloud facilities to protect cloud based public services, and for the implementation of a standalone cloud plan under the eCommission strategy, which will include a programme of actions that will move public services implemented under the community programs into the cloud.
Last but not the least, there also needs to be some sort of drive towards promoting e-skills and digital entrepreneurship related to cloud computing.
Due to the lack of technical barriers preventing cloud services at geographical borders, there is a need to not only take advantage of the opportunities presented by the Digital Single Market, but to look beyond the borders of Europe and target wider international situation for both the adoption supporting measures and the legal framework.
It is in Cloud computing’s nature to require a reinforced international dialogue on safe and seamless cross-border use. For instance, the various laws on security and cybercrime will have to be modified and standardised in order for cloud computing to be adopted on such a wide scale.
More and more third countries are starting to realise the importance of cloud computing. The USA, Japan, Australia, and Canada already have or are developing solid cloud computing strategies, and many South East Asian countries such as Malaysia, India, Korea, and Singapore are following suit, with some of them even managing to go toe to toe or even exceed the efforts of their western counterparts.
The main goals tend to be partnerships that will drive adoption by public bodies, via promotion of technological developments and further standardisation, as well as cross border collaboration and dialogue on legal and technical challenges that need to be hurdled. The EU must therefore deepen its collaboration with international partners not just for technological R&D, but also to smooth out legal issues, all of which will help in helping more businesses and individuals adapt the cloud.
The dialogues need to happen in a multilateral discussions like the UN or the OECD . This will help promote the goal of a seamless use of the cloud technology and eliminate any existing or future personal interests by cloud investors or politicians. It will also help pushing everyone to discuss the problems that cloud is experiencing that keeps others from realizing its possible role in fostering free trade with various countries, such as Singapore and India.
There will be an increased encouragement of international dialogues with other countries when it comes to key themes relating to cloud services like data protection, law enforcement agencies’ access to data, and implementation of Mutual Legal Assistance Agreements in order to avoid conflicts between companies with conflicting requests from public authorities. Other key themes include the standardisation of data security on a worldwide level, liability of intermediary service providers, interoperability requirements, and standards pertaining to public services; tax law as it applies to cloud services, and large scale collaboration and cooperation on research and development of the technology.
Conclusion
Cloud Computing Technology concerns a wide range of different policy fields, with ongoing policy initiatives like the data protection reform and the Common Eu Sales law needing fast and rapid adoption in order to help break through barriers to the wide scale growth of the cloud industry in the region.
The key actions outlined earlier in this document need to be implemented as early as 2013, particularly with regard to standardisation and certification of technologies related to cloud computing, and the development of safe and fair contract terms and conditions on the initial launch of the EU Cloud Partnership.
There is a need to be vigilant when it comes to emerging policy issues that can affect cloud computing’s societal and economic potential in various fields, such as public procurement, taxation, financial regulation, and even law enforcement – particularly in the latter as cloud computing’s inherent borderless nature presents a few issues regarding compliance, jurisdiction, and reporting.
The next two years will be very important, as the actions defined earlier in this document will be developed and implemented in order to lay the foundation for Europe’s status as a cloud computing powerhouse. The success of the drive will hinge on how fast the decisions are made and implementation take place, which is expected to run from 2014 to 2010. Being successful means an immediate CAGR (compound annual growth rate) of 38% can be achieved by cloud services that offered for free or cloud services that are available to individuals, which is twice the estimated growth rate if the legislations or laws outlined above are not put into place.
It is also largely up to Member States to adopt, embrace, and further enrich the potential of cloud computing, usually through the development of a public sector cloud that is based on common approaches that foster increased trust and performance while reducing costs. There needs to be more active participation in the European Cloud Partnership, and for close cooperation between the member states with regard to the development and adoption of common interoperability measures and standards.
Some valid pts here however one should also delve into the politics of the business. Who is raising questions about security? most likely the traditional vendors in the market as they would love to sell more infra, eg. firewalls, gatekeepers etc… One should ask the industry “do you have a firewall on your cell phone?”
|
{
"pile_set_name": "Pile-CC"
}
|
Several EU member states helped the Central Intelligence Agency and other U.S. authorities in a program of rendition, torture and the secret detention of people as "terror" suspects by the U.S., according to Amnesty International.The revelations by the human rights organization came on Wednesday after the U.S. Senate Intelligence Committee released a report which disclosed the CIA tortured people it had detained in a brutal manner, which led to scant intelligence information of any value.Erika Guevara Rosas, Americas Director at Amnesty International, said in a press release: "This report provides yet more damning detail of some of the human rights violations that were authorized by the highest authorities in the U.S.A. after 9/11.""Despite much evidence having been in the public realm for years, no one has been brought to justice for authorizing or carrying out the acts in these CIA programmes.''The Senate committee's report summary detailed how the CIA used techniques such as "waterboarding" - to simulate the sensation of drowning in a victim - mock execution, sexual threats and other forms of torture and degrading treatment against detainees who had been forcibly "disappeared".The effects of the techniques and detention conditions led to detainees suffering "hallucinations, paranoia, insomnia and attempts at self-harm and self-mutilation", the report revealed.Amnesty International said in its report that Italy, Lithuania, Romania, Sweden, and the UK were among EU states which worked with U.S. intelligence agents in carrying out the detention and torture program.Rosas added: "The declassified information contained in the (report's) summary, while limited, is a reminder to the world of the utter failure of the U.S.A. to end the impunity enjoyed by those who authorized and used torture and other ill-treatment.""This is a wake-up call to the U.S.A.; they must disclose the full truth about the human rights violations, hold perpetrators accountable and ensure justice for the victims.""This is not a policy nicety, it is a requirement under international law," he said.Ben Emmerson, the United Nations Special Rapporteur on Counter Terrorism and Human Rights, said the Senate report had confirmed what the international community had long believed-that there was a clear policy orchestrated at a high level within the administration of George W. Bush which allowed gross violations of international human rights law to be committed.Emmerson said in a statement: "The individuals responsible for the criminal conspiracy revealed in today's report must be brought to justice, and must face criminal penalties commensurate with the gravity of their crimes.""Now it is time to take action."The report, released on Tuesday, found that CIA officials had misled the U.S. Administration, Justice Department, Congress and the U.S. public over its torture program, which had been more brutal and ineffective than they had disclosed.The European Parliament called on EU member states to investigate their roles in the operations in 2012 and 2013.Amnesty said a 2007 report by the European Parliament led by then-rapporteur Claudio Fava had faced major opposition in the European Parliament, resulting in virtually no real accountability among EU countries.Governments which allegedly colluded with the CIA have an obligation under international human rights law to ensure an independent, impartial, thorough and effective investigation is carried out, according to the organization.EU's foreign policy chief Federica Mogherini said in a statement on Wednesday that "much remains to do" in tackling the use of torture.She said: ''The Convention against Torture was adopted by the UN 30 years ago today, and yet torture is still widely practiced around the world. This demands our urgent attention."
|
{
"pile_set_name": "OpenWebText2"
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.