text
stringlengths 14
5.22M
| meta
dict | __index_level_0__
int64 0
9.97k
| input_ids
sequencelengths 128
128
| attention_mask
sequencelengths 128
128
| labels
sequencelengths 128
128
|
|---|---|---|---|---|---|
You are here: About Us » Governors
A very warm welcome to you on behalf of the Governors of the Whitby Secondary Partnership
The Whitby Secondary Partnership was formed on 8 July 2019. At that moment the two Governing Bodies of Eskdale School and Caedmon College were brought together to form one single Governing Body responsible for both schools and for Whitby Sixth Form.
The main aim of the Whitby Secondary Partnership is that everyone involved in secondary education should work together to provide the best possible education and opportunities for all students in the Whitby area.
Eskdale School and Caedmon College remain as separate schools, with their own DfE number and separate admissions procedures. The two schools do some things in the same way and some things differently. The Governors are happy to support this as long as both schools are delivering the best for pupils. More important than the differences, however, are the similarities. The leadership and staff of both schools share a vision around providing the best education for all students and the value of working together to achieve that.
These changes to Whitby Secondary education are not something that happen overnight. The two Heads and the Senior Leadership teams are now working together to develop a more joined-up way of working. There is also really positive collaboration between a number of departments in both schools and we intend to develop a guaranteed offer of educational and enrichment opportunities for all secondary students in the Whitby area.
The Governors are also committed to maintaining Post 16 education in Whitby. We believe that students should be able to access an excellent Post 16 offer here, in the town, and the Heads and Senior Leadership of both schools are working together to develop Whitby Sixth Form as a shared facility. The Sixth Form already offers an excellent programme of courses and extra-curricular opportunities and we hope to do more. We believe, not just in achieving the best possible grades, but also in preparing our students for young adulthood. We would like to grow the Sixth Form and we very much hope that local families will support us in this.
The Governors of the Whitby Secondary Partnership believe that it is through collaboration that we can provide the broadest educational offer, the best enrichment opportunities and pastoral care and the best opportunities for staff professional development. We also believe that it is through collaboration, friendship and mutual support that we can model to our students the values and behaviours which will help them to be good citizens of the future.
The Governors are absolutely committed to doing the very best we can for all students.
Please feel free to contact me through the Clerk to Governors, Mrs. Sally Nedley.
Pen Cruz
Chair of Governors
About Caedmon College Whi... | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 9,617 | [
128000,
2675,
527,
1618,
25,
10180,
4073,
8345,
91089,
198,
32,
1633,
8369,
10788,
311,
499,
389,
17981,
315,
279,
91089,
315,
279,
27484,
1729,
44634,
47362,
198,
791,
27484,
1729,
44634,
47362,
574,
14454,
389,
220,
23,
5887,
220,
679,
24,
13,
2468,
430,
4545,
279,
1403,
94984,
1251,
81446,
315,
59469,
35283,
6150,
323,
14751,
291,
1677,
9304,
1051,
7263,
3871,
311,
1376,
832,
3254,
94984,
1251,
14285,
8647,
369,
2225,
8853,
323,
369,
27484,
1729,
68077,
3459,
627,
791,
1925,
9395,
315,
279,
27484,
1729,
44634,
47362,
374,
430,
5127,
6532,
304,
14580,
6873,
1288,
990,
3871,
311,
3493,
279,
1888,
3284,
6873,
323,
10708,
369,
682,
4236,
304,
279,
27484,
1729,
3158,
627,
36,
4991,
35283,
6150,
323,
14751,
291,
1677,
9304,
7293,
439
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
2675,
527,
1618,
25,
10180,
4073,
8345,
91089,
198,
32,
1633,
8369,
10788,
311,
499,
389,
17981,
315,
279,
91089,
315,
279,
27484,
1729,
44634,
47362,
198,
791,
27484,
1729,
44634,
47362,
574,
14454,
389,
220,
23,
5887,
220,
679,
24,
13,
2468,
430,
4545,
279,
1403,
94984,
1251,
81446,
315,
59469,
35283,
6150,
323,
14751,
291,
1677,
9304,
1051,
7263,
3871,
311,
1376,
832,
3254,
94984,
1251,
14285,
8647,
369,
2225,
8853,
323,
369,
27484,
1729,
68077,
3459,
627,
791,
1925,
9395,
315,
279,
27484,
1729,
44634,
47362,
374,
430,
5127,
6532,
304,
14580,
6873,
1288,
990,
3871,
311,
3493,
279,
1888,
3284,
6873,
323,
10708,
369,
682,
4236,
304,
279,
27484,
1729,
3158,
627,
36,
4991,
35283,
6150,
323,
14751,
291,
1677,
9304,
7293,
439,
-100
] |
ProService Takes Lead in Addressing State Unemployment Tax Increases
December 11, 2020 January 5, 2023 Press Release
HONOLULU, HAWAII (December 11, 2020) – ProService Hawaii is sounding the alarm on what could be a devastating effect for Hawaii's businesses if the State Unemployment Tax Act (SUTA) rate increases due to the depletion of the state Trust Fund that endows unemployment benefits for people who are laid off or furloughed. Hawaii employers are 100% liable for the cost of unemployment insurance through withholding a payroll tax. Due to the COVID-19 pandemic, SUTA tax rates could triple per state law come January 2021.
Although the Trust Fund was healthy prior to COVID, unemployment rose to 23.8% causing the trust to quickly deplete to a $1 billion deficit. Although Hawaii took a federal loan to cover the gap, the SUTA tax will increase by law because unemployment claims still need to be paid. According to the Department of Labor, rates will increase from Schedule C in 2020 to Schedule H in 2021 (the highest tax rate). For example, an employer paying about $1,159 per year in SUTA taxes for employees making $48,000 or more could pay $2,506 per employee in 2021.
"Small businesses are going to be sorely impacted if the SUTA tax increases," says Ben Godsey, president and CEO of ProService Hawaii. "We believe this steep tax increase cannot be placed on our business community so we've been working with the Governor's administration and lawmakers to advocate for much more moderate SUTA rate increases than those mandated."
ProService is no stranger to advocating for similar issues that affect the business community. During the Great Recession in 2010, ProService was successful at working with the State to pass HB2169, which became Act 2, lowering mandated SUTA rate increases and spreading them out, allowing businesses time to recover. Without a legislative change to the current SUTA tax, ProService predicts that employers will see a huge increase in tax liability that slows business recovery and creates disincentives to hire employees.
For more about the SUTA tax click here. | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 3,459 | [
128000,
1360,
1898,
38707,
30982,
304,
9356,
287,
3314,
1252,
21093,
15545,
68148,
198,
33246,
220,
806,
11,
220,
2366,
15,
6186,
220,
20,
11,
220,
2366,
18,
8612,
17836,
198,
39,
715,
1971,
1112,
52,
11,
473,
14757,
32,
5660,
320,
33246,
220,
806,
11,
220,
2366,
15,
8,
1389,
1322,
1898,
28621,
374,
49227,
279,
17035,
389,
1148,
1436,
387,
264,
33318,
2515,
369,
28621,
596,
9873,
422,
279,
3314,
1252,
21093,
15545,
3298,
320,
50,
1406,
32,
8,
4478,
12992,
4245,
311,
279,
92948,
315,
279,
1614,
17236,
13492,
430,
842,
4336,
26690,
7720,
369,
1274,
889,
527,
17551,
1022,
477,
282,
1103,
1409,
291,
13,
28621,
23234,
527,
220,
1041,
4,
35473,
369,
279,
2853,
315,
26690,
8276,
1555,
81612,
264,
46208,
3827,
13
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
1360,
1898,
38707,
30982,
304,
9356,
287,
3314,
1252,
21093,
15545,
68148,
198,
33246,
220,
806,
11,
220,
2366,
15,
6186,
220,
20,
11,
220,
2366,
18,
8612,
17836,
198,
39,
715,
1971,
1112,
52,
11,
473,
14757,
32,
5660,
320,
33246,
220,
806,
11,
220,
2366,
15,
8,
1389,
1322,
1898,
28621,
374,
49227,
279,
17035,
389,
1148,
1436,
387,
264,
33318,
2515,
369,
28621,
596,
9873,
422,
279,
3314,
1252,
21093,
15545,
3298,
320,
50,
1406,
32,
8,
4478,
12992,
4245,
311,
279,
92948,
315,
279,
1614,
17236,
13492,
430,
842,
4336,
26690,
7720,
369,
1274,
889,
527,
17551,
1022,
477,
282,
1103,
1409,
291,
13,
28621,
23234,
527,
220,
1041,
4,
35473,
369,
279,
2853,
315,
26690,
8276,
1555,
81612,
264,
46208,
3827,
13,
-100
] |
Morissette drops new song, announces Jagged Little Pill tour
Morissette
Alanis Morissette has released new music from her first album in eight years and also announced a 2020 tour.
The 31-stop tour will launch in June 2020 to mark the 25th anniversary of her seminal album Jagged Little Pill and the Canadian rocker will be joined by her alt contemporaries Liz Phair and Garbage.
45-year-old Morissette, who last played Ireland when she appeared in Dublin's Iveagh Gardens last year, offered fans a taste of her upcoming ninth studio album Such Pretty Forks in the Road, which is due out on May 1 next year, with the release of the lead single Reasons I Drink.
Jagged Little Pill was met with critical and commercial fanfare when it was released in 1995. It sold 33 million copies and Morissette scored smash songs, including Ironic, Hand in My Pocket and You Oughta Know.
The album is also the basis of a Broadway musical, set to open in New York on Thursday.
Such Pretty Forks in the Road will be Morissette's first album since 2012's Havoc and Bright Lights.
Morissette has previously said she never felt comfortable with fame and insists she didn't have any fun at the height of her success.
Morissette: ''I didn't know what I was signing up for."
Last year, the singer revealed she had no idea that Jagged Little Pill would catapult her to stardom and says she grew increasingly uncomfortable with life in the spotlight.
Speaking to Event magazine, Morissette said she didn't enjoy any of her success as she had no support network.
''I didn't know what I was signing up for."
''I was already quite an isolated person, and it got worse. I became averse to people even looking at me. I was always a people-watcher, I'd sit for hours observing, and then all of a sudden, every eyeball was on me. I was horrified by it.
Jagged Little Pill sold an extraordinary 33 million copies
''I started landing at airports internationally and there were 30,000 people there. I wound up hiding in my hotel room, but if I walked past the window, even my shadow on the drapes would cause people to scream outside.
''People would break in and leave notes in my underwear when I was doing a show. It felt like an obliteration of my boundaries...
''I had no one, apart from a couple of therapists who I would phone from the road, desperately, at three in the morning.''
More music news, reviews and interviews here | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 1,090 | [
128000,
42778,
4993,
668,
21701,
502,
5609,
11,
48782,
30511,
3640,
15013,
35236,
7364,
198,
42778,
4993,
668,
198,
68724,
285,
8613,
4993,
668,
706,
6004,
502,
4731,
505,
1077,
1176,
8176,
304,
8223,
1667,
323,
1101,
7376,
264,
220,
2366,
15,
7364,
627,
791,
220,
2148,
42311,
7364,
690,
7195,
304,
5651,
220,
2366,
15,
311,
1906,
279,
220,
914,
339,
22310,
315,
1077,
90773,
8176,
30511,
3640,
15013,
35236,
323,
279,
12152,
96226,
690,
387,
11096,
555,
1077,
4902,
59504,
5548,
48299,
2405,
1334,
323,
12471,
21305,
627,
1774,
4771,
6418,
8613,
4993,
668,
11,
889,
1566,
6476,
14990,
994,
1364,
9922,
304,
33977,
596,
87750,
34856,
43143,
1566,
1060,
11,
9076,
7359,
264,
12945,
315,
1077,
14827,
43641,
14356,
8176,
15483,
36416,
48950,
82,
304
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
42778,
4993,
668,
21701,
502,
5609,
11,
48782,
30511,
3640,
15013,
35236,
7364,
198,
42778,
4993,
668,
198,
68724,
285,
8613,
4993,
668,
706,
6004,
502,
4731,
505,
1077,
1176,
8176,
304,
8223,
1667,
323,
1101,
7376,
264,
220,
2366,
15,
7364,
627,
791,
220,
2148,
42311,
7364,
690,
7195,
304,
5651,
220,
2366,
15,
311,
1906,
279,
220,
914,
339,
22310,
315,
1077,
90773,
8176,
30511,
3640,
15013,
35236,
323,
279,
12152,
96226,
690,
387,
11096,
555,
1077,
4902,
59504,
5548,
48299,
2405,
1334,
323,
12471,
21305,
627,
1774,
4771,
6418,
8613,
4993,
668,
11,
889,
1566,
6476,
14990,
994,
1364,
9922,
304,
33977,
596,
87750,
34856,
43143,
1566,
1060,
11,
9076,
7359,
264,
12945,
315,
1077,
14827,
43641,
14356,
8176,
15483,
36416,
48950,
82,
304,
-100
] |
Video: Louisville police track down girl kidnapped while riding bike, arrest suspect
Louisville Police Department
LOUISVILLE, Ky. (AP) — Authorities say a Kentucky girl who was snatched from her bicycle by a stranger was found quickly, returned to her family, and a suspect was charged with kidnapping thanks to the quick actions of neighbors and police.
A Louisville Police Department spokesperson told news outlets that neighbors who witnessed the girl get taken from her Louisville neighborhood on July 2 quickly called 911 with a detailed description of the vehicle and a partial license plate number.
Police say officers responded immediately and saturated the area. Within 30 minutes, police say Sgt. Joe Keeling was able to stop the suspect vehicle and waited for backup to arrive.
Police say Officer Jason Burba then rescued the 6-year-old girl from the vehicle as the suspect, 40-year-old Robby Wildt, was being apprehended.
Wildt has been charged with kidnapping a minor and has pleaded not guilty.
The police department shared body camera footage from the officers who found the girl on its YouTube channel. In the video, you can hear the girl crying and saying, "I want my daddy."
"This is a rare situation, stranger kidnapping. More commonly we see custodial issues as kidnappings. Although we do not want the community to be alarmed, this is certainly an educational opportunity for parents to remind their children that 'stranger danger' is real. It is important to talk to your kids about any adult who tries to use a ruse to lure them to their vehicles or away from public view," said Louisville police spokesperson Aaron M. Ellis in a statement. | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 88 | [
128000,
10955,
25,
46134,
4379,
3839,
1523,
3828,
55945,
1418,
20427,
13260,
11,
8163,
15562,
198,
67215,
8078,
10289,
6011,
198,
1623,
29621,
90241,
11,
23727,
13,
320,
2599,
8,
2001,
68415,
2019,
264,
26036,
3828,
889,
574,
4224,
35344,
505,
1077,
36086,
555,
264,
35058,
574,
1766,
6288,
11,
6052,
311,
1077,
3070,
11,
323,
264,
15562,
574,
11684,
449,
62782,
9523,
311,
279,
4062,
6299,
315,
19228,
323,
4379,
627,
32,
46134,
10289,
6011,
29003,
3309,
3754,
28183,
430,
19228,
889,
32126,
279,
3828,
636,
4529,
505,
1077,
46134,
12818,
389,
5887,
220,
17,
6288,
2663,
220,
17000,
449,
264,
11944,
4096,
315,
279,
7458,
323,
264,
7276,
5842,
12235,
1396,
627,
22993,
2019,
9808,
16846,
7214,
323,
50585,
279,
3158,
13,
25218,
220,
966,
4520
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
10955,
25,
46134,
4379,
3839,
1523,
3828,
55945,
1418,
20427,
13260,
11,
8163,
15562,
198,
67215,
8078,
10289,
6011,
198,
1623,
29621,
90241,
11,
23727,
13,
320,
2599,
8,
2001,
68415,
2019,
264,
26036,
3828,
889,
574,
4224,
35344,
505,
1077,
36086,
555,
264,
35058,
574,
1766,
6288,
11,
6052,
311,
1077,
3070,
11,
323,
264,
15562,
574,
11684,
449,
62782,
9523,
311,
279,
4062,
6299,
315,
19228,
323,
4379,
627,
32,
46134,
10289,
6011,
29003,
3309,
3754,
28183,
430,
19228,
889,
32126,
279,
3828,
636,
4529,
505,
1077,
46134,
12818,
389,
5887,
220,
17,
6288,
2663,
220,
17000,
449,
264,
11944,
4096,
315,
279,
7458,
323,
264,
7276,
5842,
12235,
1396,
627,
22993,
2019,
9808,
16846,
7214,
323,
50585,
279,
3158,
13,
25218,
220,
966,
4520,
-100
] |
Johnathan Ettman's bonus lo-fi footage.
This entry was posted on November 1, 2012 by Nick Nicks. It was filed under Skateboarding, Video and was tagged with Bonus, Brad Cromer, DVD, fl, Florida, Johnathan Ettman, lo-fi, Shred Shed, Skate, Skateboarding, video, West Palm Beach. | {
"redpajama_set_name": "RedPajamaC4"
} | 5,034 | [
128000,
13379,
14308,
469,
5683,
1543,
596,
12306,
781,
37731,
22609,
627,
2028,
4441,
574,
8621,
389,
6841,
220,
16,
11,
220,
679,
17,
555,
15341,
452,
5908,
13,
1102,
574,
13019,
1234,
97796,
38669,
11,
8519,
323,
574,
38213,
449,
29298,
11,
17478,
92707,
261,
11,
18584,
11,
1344,
11,
9784,
11,
3842,
14308,
469,
5683,
1543,
11,
781,
37731,
11,
1443,
1171,
95552,
11,
97796,
11,
97796,
38669,
11,
2835,
11,
4410,
33578,
13011,
13,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
13379,
14308,
469,
5683,
1543,
596,
12306,
781,
37731,
22609,
627,
2028,
4441,
574,
8621,
389,
6841,
220,
16,
11,
220,
679,
17,
555,
15341,
452,
5908,
13,
1102,
574,
13019,
1234,
97796,
38669,
11,
8519,
323,
574,
38213,
449,
29298,
11,
17478,
92707,
261,
11,
18584,
11,
1344,
11,
9784,
11,
3842,
14308,
469,
5683,
1543,
11,
781,
37731,
11,
1443,
1171,
95552,
11,
97796,
11,
97796,
38669,
11,
2835,
11,
4410,
33578,
13011,
13,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
Collas Crill: Offshore Law Firm
CC Life & Careers
All Teams Banking & Finance Capital Markets Collas Crill Compliance Limited Collas Crill Corporate Services Limited Collas Crill IP Corporate & Commercial Dispute Resolution Employment, Housing & Immigration Investment Funds Middle East Group Private Client Advisory Property Risk & Regulatory Technology Trusts & Fiduciary UK Real Estate Wills, Probate & Succession
All Titles Strategy Board Partners Of Counsel & Consultants Senior Associates Associates Conveyancing Team Legal Assistants Trainees & Paralegals Business Services
All Locations BVI Cayman Guernsey Hong Kong (Representative Office) Jersey London Singapore
Z Z
Group & Advisory Services
Employment, Housing & Immigration
Investment Funds & Private Equity
Middle East Group
Risk & Regulatory
Trusts & Fiduciary
UK Real Estate
Wills, Probate & Succession
Collas Crill Compliance Ltd
Collas Crill Corporate Services Ltd
Collas Crill IP Management Ltd
Hong Kong (Representative Office)
Banks' care duty to customers January '20
Channel Islands update: Effectiveness of anti-Bartlett clauses confirmed
The Hong Kong Court of Final Appeal (Court of Final Appeal) has delivered its highly anticipated judgment in Zhang Hong Li and others v DBS Bank (Hong Kong) Limited and others (DBS Case), overturning the earlier judgments and confirming that trustees may continue to rely on the provisions in trust instruments, commonly known as 'anti-Bartlett' clauses, which seek to negate a trustee's duty to enquire into or interfere in the management of underlying companies within a trust structure.
The DBS Case - facts
In 2005, Zhang Hong Li (Zhang) and his wife Ji Zhengrong (Ji) set up a Jersey-law governed family trust (Trust) with the help of the defendant bank, DBS Bank (Hong Kong) (Bank). Zhang and Ji were the settlors. The sole asset of the Trust was a BVI company (Wise Lords) which held investments through the Bank. The Bank provided a Jersey trustee to the Trust (Trustee) and BVI corporate director to Wise Lords (Director). Another bank entity provided administration, operational and secretarial support services in Hong Kong to the Trustee. Zhang specifically reserved to Ji the role of investment advisor and she was authorised by the Director to (a) execute investment transactions, (b) operate bank accounts, and (c) negotiate and draw on overdraft facilities, on behalf of Wise Lords.
Between 2005 and 2008, Ji executed over 500 investment transactions on Wise Lords' account. Initially, these trades were in mutual funds, with a medium risk profile. These trades generated impressive returns. During the global financial crisis, Ji changed her investment strategy with dire consequences, and the Trust suffered significant losses.
The claimants, which included Zhang and Ji, brought claims in the Hong Kong Court against the Director for breach of Director's duty and against the Trustee for breach of trust in respect of the losses sustained to the value of the trust fund.
The court at first instance held that, notwithstanding the terms of the trust instrument (Trust Instrument) which sought to restrict the Trustee's duties in connection with the management of Wise Lords, principally via a widely drafted anti-Bartlett clause, the Trustee retained a residual obligation to undertake a 'high-level' supervisory role. The judge found that the Trustee failed to discharge the high-level supervisory duty owed to the Trust. The Trustee appealed, and the Court of Appeal affirmed all aspects of the first instance judgment, dismissing the appeal.
Judgment of the Court of Final Appeal
"Anti-Bartlett provisions are generally incorporated….because the parties wish to enable the settlor or the settlor's nominee freely to exercise control or management of the underlying company, especially regarding matters such as its investment decisions, and to relieve the trustee of any management or supervisory duties in that regard (save where extreme situations such as those involving actual knowledge of dishonesty might arise). To postulate that the parties' chosen scheme may be overridden by some implied, non-derogable external duty arising in circumstances 'where no reasonable trustee could refrain from exercising otherwise excluded powers' would be to introduce an amorphous and ill-defined basis for undermining a legitimate arrangement consciously adopted by the parties, exposing the trustees to unanticipated risks of liability and sowing confusion as to the extent of their duties."
These words, part of the judgment of the Court of Final Appeal, will be widely welcomed by the trust industry.
The Court of Final Appeal examined the anti-Bartlett clauses in the Trust Instrument, together with the Trustee statutory duties pursuant to Article 21(1) of the Trusts (Jersey) Law,1984 (Article 21).
It was clear that the Trust Instrument intended that the Trustee powers should be narrowly confined to the conduct of the investment business of Wise Lords. In particular, the terms of the Trust Instrument relieved the Trustee of any duty to interfere in the management of the underlying companies unless they had actual knowledge of dishonesty. It further provided that the Trustee could assume at all times that the business was being carried on honestly, diligently and in their best interests until such time as they had actual knowledge to the contrary.
Article 21 provides:
"21 Duties of trustee
A trustee shall in the execution of his or her duties and in the exercise of his or her powers and discretions-
(a) act –
(i) with due diligence;
(ii) as would a prudent person;
(iii) to the best of the trustee's ability and skill; and
(b) observe the utmost good faith."
The key point here is that Article 21 sets out the standards which trustee must adhere to in executing their duties and exercising their powers – it does not "create free-standing duties to act prudently." The duties to interfere or become involved in the administration, management or conduct of the business or affairs of Wise Lords was expressly excluded by the anti-Bartlett clause in the Trust Instrument, and therefore, the Trustee held no powers or duties in relation to the company to be exercised prudently or otherwise.
The Court of Final Appeal also rejected the Respondents' contention that, by electing to approve the relevant transactions, the Trustee had exercised a power to supervise and had assumed the role of controllers and ultimate decision-makers. As a matter of fact, and contrary to the Respondent's contention, that role was undertaken by Wise Lords' investment adviser (Ji) and any such approval by the Trustee only occurred after the transactions were reported to them – the "so-called 'approvals' represented merely a franking or acknowledgement of the information received. In no real sense can they be said to have assumed 'control'." The Court of Final Appeal also held that the actions which the Trustee did take could not be equated to them assuming a power to supervise as such a conclusion failed to recognise that the Trustees did not have a power to supervise unless they had notice of dishonesty on the part of the Directors.
The Court of Final Appeal unanimously held that the existence of any 'high level supervisory duty' was inconsistent with the anti-Bartlett clauses in the Trust Instrument.
Judgment post-settlement
The judgment was also important because it is understood to be the first occasion in which the Hong Kong Courts had cause to consider the exercise of its discretion to deliver judgment, notwithstanding that the parties had already settled following the hearing of the appeal. The Court of Final Appeal considered that delivery of the judgment was appropriate because it involved issues of law of general importance, the matter had attracted international interest and it was "necessary to correct certain erroneous propositions".
The judgment will be a welcome relief to trustees who, prior to the judgment, were faced with the prospect of owing a high level supervisory duty in relation to the supervision and management of a business conducted by an underlying company, whether investment or trading, despite the existence of an anti-Bartlett clause in the trust instrument.
The DBS case was decided under Jersey law, but is understood to be the first final appellate level case in any jurisdiction to examine the effectiveness of anti-Bartlett clauses and so is likely to highly persuasive in most offshore trust jurisdictions. We therefore consider it appropriate for trustees to consider the following:
when establishing a new trust, ensure that comprehensively drafted anti-Bartlett clauses are included in the trust deed;
pay careful attention to the relevant provisions of existing trust deeds to ensure the proper discharge of a trustee's duties;
where less than ideal anti-Bartlett provisions are included in existing trust instruments, consider with professional advisors whether there is scope to vary or amend the provisions of the trust instrument;
do no not intermeddle in matters properly delegated to a third party investment manager in the absence of dishonest conduct, unless the trust instrument provides otherwise;
where duties to supervise or monitor an underlying company have not been entirely excluded by the terms of the trust instrument, ensure that such residual duties are exercised prudently; and
where investment management agreements or other contracts delegating authority are being entered into, ensure that the trustee is not a party to those agreements, or where the trustee is a party, ensure that the trustee understands its duties and obligations under that agreement.
Laura Perkins
Angela Calnan
Kellyann Ozouf
Cerisse Fisher
Insight +
Insolvency overhaul arrives
16/01/20 Insolvency overhaul arrives: with more powers come more responsibilities
Shareholders unsuccessful
06/01/20 Shareholders unsuccessful in first class action against directors
BVI appoints new Managing Partner
18/12/19 BVI appoints new Managing Partner
Carribbean update: Anti-Bartlett
29/11/19 Carribbean update: Effectiveness of anti-Bartlett clauses confirmed
Sign up for news & updates
BVI T// +1 284 852 6300
Cayman T// +1 345 949 4544
Guernsey T// +44 (0) 1481 723191
Hong Kong T// +852 58082437
Jersey T// +44 (0) 1534 601700
London T// +44 (0) 203 824 4879
Singapore T// +65 6800 4330
Copyright © 2020 Collas Crill. All rights reserved.
Terms & Conditions | Privacy Statements
Regulatory Costs Information | Cookie Policy Design by The Potting Shed.
CC Cookie Policy
We use cookies to improve your user experience. You can manage your cookie settings at any time during your visit. For further information, please click here to access our policy. | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 3,281 | [
128000,
15623,
300,
4656,
484,
25,
4206,
29526,
7658,
38725,
198,
3791,
9601,
612,
99455,
198,
2460,
40713,
50599,
612,
23261,
18880,
47910,
13201,
300,
4656,
484,
60270,
19439,
13201,
300,
4656,
484,
36565,
8471,
19439,
13201,
300,
4656,
484,
6933,
36565,
612,
28943,
4185,
8660,
38216,
41952,
11,
31433,
612,
40782,
33350,
61288,
12877,
6460,
5856,
9877,
8589,
45013,
8825,
32388,
612,
69822,
12053,
17236,
82,
612,
435,
307,
43509,
661,
6560,
8976,
25447,
468,
3385,
11,
26709,
349,
612,
13346,
290,
198,
2460,
85487,
28845,
8925,
23663,
5046,
37745,
612,
91150,
19903,
40201,
40201,
1221,
5735,
9151,
8068,
25705,
54349,
1821,
27217,
5633,
612,
4366,
1604,
70,
1147,
8184,
8471,
198,
2460,
42569,
426,
26376,
53883,
1543,
4673,
944,
8674,
19730,
18711,
320,
66843,
1413,
8410
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
15623,
300,
4656,
484,
25,
4206,
29526,
7658,
38725,
198,
3791,
9601,
612,
99455,
198,
2460,
40713,
50599,
612,
23261,
18880,
47910,
13201,
300,
4656,
484,
60270,
19439,
13201,
300,
4656,
484,
36565,
8471,
19439,
13201,
300,
4656,
484,
6933,
36565,
612,
28943,
4185,
8660,
38216,
41952,
11,
31433,
612,
40782,
33350,
61288,
12877,
6460,
5856,
9877,
8589,
45013,
8825,
32388,
612,
69822,
12053,
17236,
82,
612,
435,
307,
43509,
661,
6560,
8976,
25447,
468,
3385,
11,
26709,
349,
612,
13346,
290,
198,
2460,
85487,
28845,
8925,
23663,
5046,
37745,
612,
91150,
19903,
40201,
40201,
1221,
5735,
9151,
8068,
25705,
54349,
1821,
27217,
5633,
612,
4366,
1604,
70,
1147,
8184,
8471,
198,
2460,
42569,
426,
26376,
53883,
1543,
4673,
944,
8674,
19730,
18711,
320,
66843,
1413,
8410,
-100
] |
Santa Fe, New Mexico, March 20, 2015 – In keeping with the goals of both the Governor and legislative leaders to pass substantive economic development and job creation bills during New Mexico's current legislative session which ends Saturday, the New Mexico legislature has sent two bills to the Governor that make key improvements to the state's world-class tax incentive program for film and television production.
Coming two years after the state famously passed the "Breaking Bad Bill" that increased financial incentives for series television to 30%, the newly passed legislation extends the 30% credit to stand-alone pilot episodes, and makes it easier for feature film productions to qualify for the 30% labor credit by expanding the definition of "qualified facilities" to include outdoor movie ranches.
The first bill, SB.565, sponsored by Senator William H. Payne (R-Bernalillo), which was approved by the state senate last week on a unanimous vote, passed the House yesterday by a vote of 51-2 and is now on its way to the Governor's desk for signature.
The second bill, HB 216, introduced by representative Jim R. Trujillo (D-Santa Fe), allows a production company to pre-assign its tax rebate to a third-party. Unlike the many states that require producers to sell their credits at a discount, New Mexico provides a direct cash rebate, and the ability to pre-assign the earned rebate will be a benefit both to independent producers seeking financing for their projects and commercial producers working for agencies or accounts wanting direct assignment of the rebate. This new feature will attract more independent film and commercial work to New Mexico.
1. 30% for Pilots. Extends the 30% incentive for series television to a standalone television pilot intended for series production in New Mexico.
2. Resident Above-the-line. Resident writers, directors and producers are now eligible for the rebate as "resident crew" provided that the individual has filed a New Mexico income tax return in each of the two previous years.
3. Resident Performers. Removes resident background performers and resident performers in non-principal roles from the limitation of no more than $5 million in credits for the services of performing artists on any one production.
4. Filming Ranches as "Qualified Facilities." Expands the definition of "qualified production facility" that feature films must use to qualify for the 5% bonus credit (30% total) for hiring resident crew. For a production with a budget of up to $30 million, 3 of the 10 principal photography days may now be filmed at a "standing set that includes and least one interior and at least five exteriors… located on at least 50 acres of contiguous space designated for film production use." For a production with a budget of over $30 million, up to 5 of the 15 required principal photography days may be filmed at such a facility. (p. 5, lines 12-19, p. 25, lines 16-20).
1. Expands definition of "direct production expenditures." Adds kit rentals to qualified direct production expenditures when paid to a New Mexico resident industry crew member hired on the production.
2. Eligibility for non-resident performing artists. Makes payments to non-resident performing artists on a television series eligible for the incentive if (a) the production completes at least one full season in New Mexico; and (2) the company certifies its intention to produce at least one subsequent season in New Mexico; and (3) the company or its parent company commences production of an additional eligible television series during the same taxable year.
3. Non-resident industry crew. In a change requested by the Hollywood studios, the bill replaces the uncertainty of the previous system for qualifying non-resident crew with the assurance of a simple formula. Under the new system, producers will no longer pay New Mexico gross receipts taxes on the wages of non-resident crew working in the state and will receive a 15% rebate on those payments to non-resident crew (other than a production designer, director of photography, line producer, costume designer, still unit photographer or driver whose sole responsibility is driving). This provides producers with clarity and certainty when bringing in non-resident crew with highly specialized skills that may not be available in New Mexico.
New Mexico production has been booming in the two years since the legislature passed the "Breaking Bad Bill." Television series currently in production in Albuquerque include Better Call Saul, the hit prequel/sequel to Breaking Bad; the second season of NBC's hit new medical dramaThe Night Shift; USA's Dig; with new seasons of Longmire and Manhattan current in production in Santa Fe. Major feature films including the upcoming Sicario starring Josh Brolin, Emily Blunt and Benicio del Toro and the second film in the Maze Runner series have recently wrapped production at Albuquerque Studios.
The current New Mexico legislative session ends this Saturday March 21st. The Governor's signing deadline for all legislation passed in this session is 20 days later, or April 10, 2015. | {
"redpajama_set_name": "RedPajamaC4"
} | 9,528 | [
128000,
64248,
3926,
11,
1561,
12550,
11,
5587,
220,
508,
11,
220,
679,
20,
1389,
763,
10494,
449,
279,
9021,
315,
2225,
279,
24245,
323,
27743,
6164,
311,
1522,
67749,
7100,
4500,
323,
2683,
9886,
19123,
2391,
1561,
12550,
596,
1510,
27743,
3882,
902,
10548,
7884,
11,
279,
1561,
12550,
39856,
706,
3288,
1403,
19123,
311,
279,
24245,
430,
1304,
1401,
18637,
311,
279,
1614,
596,
1917,
15144,
3827,
36210,
2068,
369,
4632,
323,
12707,
5788,
627,
57789,
1403,
1667,
1306,
279,
1614,
51287,
5946,
279,
330,
61279,
11717,
8766,
1,
430,
7319,
6020,
36580,
369,
4101,
12707,
311,
220,
966,
13689,
279,
13945,
5946,
13543,
2289,
279,
220,
966,
4,
6807,
311,
2559,
74249,
18178,
18243,
11,
323,
3727,
433,
8831,
369,
4668,
4632,
54248,
311,
26456
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
64248,
3926,
11,
1561,
12550,
11,
5587,
220,
508,
11,
220,
679,
20,
1389,
763,
10494,
449,
279,
9021,
315,
2225,
279,
24245,
323,
27743,
6164,
311,
1522,
67749,
7100,
4500,
323,
2683,
9886,
19123,
2391,
1561,
12550,
596,
1510,
27743,
3882,
902,
10548,
7884,
11,
279,
1561,
12550,
39856,
706,
3288,
1403,
19123,
311,
279,
24245,
430,
1304,
1401,
18637,
311,
279,
1614,
596,
1917,
15144,
3827,
36210,
2068,
369,
4632,
323,
12707,
5788,
627,
57789,
1403,
1667,
1306,
279,
1614,
51287,
5946,
279,
330,
61279,
11717,
8766,
1,
430,
7319,
6020,
36580,
369,
4101,
12707,
311,
220,
966,
13689,
279,
13945,
5946,
13543,
2289,
279,
220,
966,
4,
6807,
311,
2559,
74249,
18178,
18243,
11,
323,
3727,
433,
8831,
369,
4668,
4632,
54248,
311,
26456,
-100
] |
Home IN THE MAGAZINE Letters to the Editor Giller Kafuffle - Rabinovitch responds
Giller Kafuffle - Rabinovitch responds
by Elana Rabinovitch
Stephen Henighan's most recent ravings about the treachery of jurors, conflicts of interest and other sinister goings on at the Giller Prize ("Kingmakers," Geist No. 63) are notable for their sheer entertainment value, a superb addendum to his ongoing anti-Giller screed. Henighan's bitterness toward the Giller Prize is almost legendary.
No one's quite sure why, but hopefully all the ink and brow sweat he spills writing about us will at least stimulate more conversations about and reading of Canadian literature. What's striking is how prescient Mordecai Richler was when he stated, at the launch of the Giller Prize almost fourteen years ago, that "when you give Canadians an apple, they look for the razor blade inside."
As well, Henighan is just plain wrong about the "party favours" at the 2006 Giller Prize. The books in the centre of each table were props, big fat hardcover books that we'd requested from Indigo Books and Music and that they'd graciously loaned us, that were covered in laminating paper and used to build a literary sculpture. They were not swag, gifts for guests to take home. They were decoration. Guests did leave with them, but not at our invitation.
Unfortunately, Henighan's agenda clearly eclipsed any attempt at solid factual research.
—Elana Rabinovitch, Toronto | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 9,521 | [
128000,
7778,
2006,
3247,
50620,
24476,
4069,
45397,
311,
279,
12865,
480,
15610,
127914,
13511,
482,
432,
9068,
869,
1641,
31680,
198,
38,
15610,
127914,
13511,
482,
432,
9068,
869,
1641,
31680,
198,
1729,
4072,
3444,
432,
9068,
869,
1641,
198,
54924,
13370,
1108,
276,
596,
1455,
3293,
43643,
826,
922,
279,
4353,
613,
727,
315,
73139,
11,
26885,
315,
2802,
323,
1023,
63667,
733,
826,
389,
520,
279,
480,
15610,
32293,
3573,
34655,
20481,
1359,
4323,
380,
2360,
13,
220,
5495,
8,
527,
28289,
369,
872,
33638,
16924,
907,
11,
264,
33689,
923,
25547,
311,
813,
14529,
7294,
12279,
15610,
8020,
291,
13,
13370,
1108,
276,
596,
80096,
9017,
279,
480,
15610,
32293,
374,
4661,
28812,
627,
2822,
832,
596,
5115,
2771,
3249,
11,
719,
23127,
682
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
7778,
2006,
3247,
50620,
24476,
4069,
45397,
311,
279,
12865,
480,
15610,
127914,
13511,
482,
432,
9068,
869,
1641,
31680,
198,
38,
15610,
127914,
13511,
482,
432,
9068,
869,
1641,
31680,
198,
1729,
4072,
3444,
432,
9068,
869,
1641,
198,
54924,
13370,
1108,
276,
596,
1455,
3293,
43643,
826,
922,
279,
4353,
613,
727,
315,
73139,
11,
26885,
315,
2802,
323,
1023,
63667,
733,
826,
389,
520,
279,
480,
15610,
32293,
3573,
34655,
20481,
1359,
4323,
380,
2360,
13,
220,
5495,
8,
527,
28289,
369,
872,
33638,
16924,
907,
11,
264,
33689,
923,
25547,
311,
813,
14529,
7294,
12279,
15610,
8020,
291,
13,
13370,
1108,
276,
596,
80096,
9017,
279,
480,
15610,
32293,
374,
4661,
28812,
627,
2822,
832,
596,
5115,
2771,
3249,
11,
719,
23127,
682,
-100
] |
Reliability is important with all rotating machinery. In the case of wind turbines, if the turbine stops then it is no longer generating electricity, and therefore it is not earning revenue for the wind farm owner.
Random wind speeds, and occasional high wind speeds affect the input-side of the gearbox. Changing load conditions on the generator affect the output-side of the gearbox. Wind turbines must potentially operate in corrosive sea air or in freezing conditions where icing becomes a problem.
Resonance of the blades and tower can contribute to reliability issues, and misalignment is a significant issue given the flexibility of the foundations.
Technologies for Reliability issue in WTG and the advantages of the same.
Non Destructive Testing-For Casted &Forged components.
Ultrasound instrument will provide the necessary informations to the maintenance team about various electrical & mechanical symptom parameters & its condition.
Vibration can be a good indicator of the operating conditions of a range of mechanical components and structures and thus can support condition monitoring of important wind turbine components such as the rotor, drive train components and tower.
Analysis of vibration signals in both the time and frequency domain can be used to identify incipient failure of these components.
But the vibration sensor and analysis methods for tower and drive train components are different. For the Tower, Main Bearing, because the vibration frequency is quite low, a low frequency sensor (0–200 Hz) and an appropriate model based analysis method are used.
For Drive train components Main bearing, Gearbox, Generator, a high frequency acceleration sensor (3–20 kHz) and fast Fourier transform (FFT), Cepstrum methods are used.
Misalignment most affects the main bearings, gearbox and generator of wind turbines.
The high-speed shaft between a gearbox and generator is a critical point of failure. Their misalignment a leading cause.
Laser Alignment are a fast, easy, and accurate when used to align drive train components.
A precision shaft alignment at install and periodic checks can help prevent drive train component failures, up-tower repairs, and catastrophic failures.
Non-contact method. Useful for far away targets.
Can be done from safe distance.
Pin points the thermal abnormality.
Boroscope inspections are visual inspections in places inaccessible to the human eye with the help of an optical device, the borescope.
The borescope, also called videoscope or video boroscopy, a device is long and thin, flexible tube. Inside this tube is a telescopic system with many lenses, which provide a high image definition. It is also equipped with a powerful light source.
The resulting image can be seen in the apparatus main lens, on a monitor, or recorded on a video recorder for later analysis.
Oil analysis is well established as a routine tool to optimize maintenance activities, improve reliability and equipment life and prevent component failures.
As part of a comprehensive Condition Based Maintenance program, lubricant analysis is an effective complement to other diagnostic technologies such as vibration analysis, infrared thermography, ultrasonic detection.
However, when the component is grease lubricated rather than oil lubricated, the important lubricant analysis piece is often left out of the mix. The reasons for this include challenges in obtaining samples that can be trended, as well as the large sample volumes required for most current standardized tests for greases.
We will be using the state of the art 4 channel data collector & the technical capabilities of the same as follows.
Mechanical looseness, structural weakness, soft foot.
Antifriction bearing defects (inner race, outer race, cage, rolling elements).
Gear problems (tooth wear, tooth load, gear eccentricity, backlash, gear misalignment, and cracked or broken tooth.
The Ultraprobe 15,000 utilizes touch screen technology.
This unique feature uses Icons to easily control and manoeuvre around any of the Ultraprobe's display screens.
Touching the screen allows you to be able to view view decibel level, temperature, control sensitivity, change frequency, view an FFT and record sounds and images.
Ultra Probe 15000 Applications: On-Board Analysis of Electrical Inspection.
Significant Power saving can be through accurate alignment.
Protects the WTG assets and increases product quality as the vibrations are reduced to very low levels.
Extends the machine availability as the mean time between failure increases.
Increase in maintenance savings as spare parts consumption is reduced.
Increase in time savings and Decrease in consumption of manpower for carrying out alignment..
The infrared camera evaluates and converts heat energy into meaningful temperatures. Components in various states of failure will emit more heat as a direct result of more energy dissipated into the component.
This extra energy is caused by increased friction in mechanical devices, and higher resistance in electrical devices. For the following equipment thermography survey can be carried out.
Drives, Couplings, Gears, Shafts. Overheated bearings or rollers, misalignment of shaft or coupling, lubrication failure uneven pressure.
Pumps/Fans/Radiators Overheated bearings, high compressor discharges temperature, high oil temperature, and broken or defective valve.
Heavy Duty Equipment - Bearings, Brakes, Hydraulics Overheating brakes, tires, bearings, pulleys, gears, gear or pulley misalignment, and blockages in hydraulics.
Valves: Shutoff Valves, Relief valves Leakage, Blockage. | {
"redpajama_set_name": "RedPajamaC4"
} | 6,181 | [
128000,
6882,
79443,
374,
3062,
449,
682,
42496,
26953,
13,
763,
279,
1162,
315,
10160,
76775,
11,
422,
279,
66270,
18417,
1243,
433,
374,
912,
5129,
24038,
18200,
11,
323,
9093,
433,
374,
539,
28744,
13254,
369,
279,
10160,
8961,
6506,
627,
14326,
10160,
25753,
11,
323,
28961,
1579,
10160,
25753,
7958,
279,
1988,
25034,
315,
279,
98973,
13,
51269,
2865,
4787,
389,
279,
14143,
7958,
279,
2612,
25034,
315,
279,
98973,
13,
22862,
76775,
2011,
13893,
14816,
304,
46657,
535,
9581,
3805,
477,
304,
43318,
4787,
1405,
76106,
9221,
264,
3575,
627,
1079,
263,
685,
315,
279,
42742,
323,
21970,
649,
17210,
311,
31638,
4819,
11,
323,
5906,
45698,
374,
264,
5199,
4360,
2728,
279,
25152,
315,
279,
41582,
627,
29356,
9268,
369,
6649,
79443,
4360,
304
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
6882,
79443,
374,
3062,
449,
682,
42496,
26953,
13,
763,
279,
1162,
315,
10160,
76775,
11,
422,
279,
66270,
18417,
1243,
433,
374,
912,
5129,
24038,
18200,
11,
323,
9093,
433,
374,
539,
28744,
13254,
369,
279,
10160,
8961,
6506,
627,
14326,
10160,
25753,
11,
323,
28961,
1579,
10160,
25753,
7958,
279,
1988,
25034,
315,
279,
98973,
13,
51269,
2865,
4787,
389,
279,
14143,
7958,
279,
2612,
25034,
315,
279,
98973,
13,
22862,
76775,
2011,
13893,
14816,
304,
46657,
535,
9581,
3805,
477,
304,
43318,
4787,
1405,
76106,
9221,
264,
3575,
627,
1079,
263,
685,
315,
279,
42742,
323,
21970,
649,
17210,
311,
31638,
4819,
11,
323,
5906,
45698,
374,
264,
5199,
4360,
2728,
279,
25152,
315,
279,
41582,
627,
29356,
9268,
369,
6649,
79443,
4360,
304,
-100
] |
Producing an admission essay is usually a problematic task if you end up taking into consideration the need for this relating to a possibilities buyers. When your admission essay is going to be among the list of choosing factors for admission to the faculty or even business school that you will be signing up to, it's best to it is important to send ones own better job.
A particular sort of scholarship or grant provided to students is college specific scholarships. These are wanted to students to get a positive focus. An example of it is a sporting activities scholarship. A scout coming from a higher education could make a trip to some sort of student's 2nd school to see regardless of whether he/she would have been a fantastic fit with this higher education and field. The scholarship will come as a result of university fees and also other costs and yes it may include some other offers like transportation within the campus.
Cover Costs – The admissions department has to be staffed by people who find themselves able of discover whether you might be a good fit you aren't. People have to study the hundreds and thousands of software programs in addition to decide all those are only virtually no good in addition to people show some promise. They then will need to whittle down the favorable pile into those that will receive an acceptance letter, and individuals who will find wait-listed.
3. Don't Touch This! I've managed a lot of parents who fill out university applications with regard to dazzling, capable (but perhaps unmotivated) children. Do you really prefer to pay for alot of cash with tuition if your little one will never likely invest the time for you to complete that applications? By all means, counsel, have a discussion and encourage, but permit operate be their.
That MCAT is needed to end up admitted to medical related school. That exam is administered with a non-profit organization with the identical name, Medical College Admission Try. The test focuses primarily on many of the lifetime science fields. All healthcare schools in the United States require people to see MCAT making the final results to choose from with their application to higher education of medicine. | {
"redpajama_set_name": "RedPajamaC4"
} | 5,332 | [
128000,
19017,
6253,
459,
26360,
9071,
374,
6118,
264,
36033,
3465,
422,
499,
842,
709,
4737,
1139,
18361,
279,
1205,
369,
420,
23343,
311,
264,
24525,
23455,
13,
3277,
701,
26360,
9071,
374,
2133,
311,
387,
4315,
279,
1160,
315,
19301,
9547,
369,
26360,
311,
279,
22291,
477,
1524,
2626,
2978,
430,
499,
690,
387,
16351,
709,
311,
11,
433,
596,
1888,
311,
433,
374,
3062,
311,
3708,
6305,
1866,
2731,
2683,
627,
32,
4040,
3460,
315,
34225,
477,
13500,
3984,
311,
4236,
374,
7926,
3230,
55855,
13,
4314,
527,
4934,
311,
4236,
311,
636,
264,
6928,
5357,
13,
1556,
3187,
315,
433,
374,
264,
36027,
7640,
34225,
13,
362,
54594,
5108,
505,
264,
5190,
6873,
1436,
1304,
264,
8577,
311,
1063,
3460,
315,
5575,
596,
220,
17
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
19017,
6253,
459,
26360,
9071,
374,
6118,
264,
36033,
3465,
422,
499,
842,
709,
4737,
1139,
18361,
279,
1205,
369,
420,
23343,
311,
264,
24525,
23455,
13,
3277,
701,
26360,
9071,
374,
2133,
311,
387,
4315,
279,
1160,
315,
19301,
9547,
369,
26360,
311,
279,
22291,
477,
1524,
2626,
2978,
430,
499,
690,
387,
16351,
709,
311,
11,
433,
596,
1888,
311,
433,
374,
3062,
311,
3708,
6305,
1866,
2731,
2683,
627,
32,
4040,
3460,
315,
34225,
477,
13500,
3984,
311,
4236,
374,
7926,
3230,
55855,
13,
4314,
527,
4934,
311,
4236,
311,
636,
264,
6928,
5357,
13,
1556,
3187,
315,
433,
374,
264,
36027,
7640,
34225,
13,
362,
54594,
5108,
505,
264,
5190,
6873,
1436,
1304,
264,
8577,
311,
1063,
3460,
315,
5575,
596,
220,
17,
-100
] |
Q: Adding array to existing $_SESSION array I got following existing array in my $_SESSION:
[wishList] => wishList Object
(
[contents] => Array
(
[109] => Array
(
[qty] => 1.0000
)
[89] => Array
(
[qty] => 1.0000
)
[62] => Array
(
[qty] => 1.0000
)
Now i am trying to add a new object to it like this:
echo $_SESSION['wishList']->contents = array('60' => array('qty' => '1.0000'));
So the array would look like this:
[wishList] => wishList Object
(
[contents] => Array
(
[109] => Array
(
[qty] => 1.0000
)
[89] => Array
(
[qty] => 1.0000
)
[62] => Array
(
[qty] => 1.0000
)
[60] => Array
(
[qty] => 1.0000
)
It is not working the way i try it. Where is my fault?
A: Tr this:-
array_push($_SESSION['wishList']->contents,array('60' => array('qty' => '1.0000')));
Or try this :-
array_push($_SESSION['wishList']->contents[$pid] = array('qty' => '1.0000')); // where $pid = 60;
A: $_SESSION['wishList']->wishList['contents'] = "your new value string or array";
you missed out selecting main object.
i tried a piece of code. which works for me.
session_start();
class newObject {
var $aProp = array("type1"=>"test1", "type2"=>"test2");
function __contruct() {
return array("type1"=>"test1", "type2"=>"test2");
}
}
$newObject = new newObject;
$_SESSION["newObj"] = $newObject;
print_r($_SESSION);
// prints Array ( [newObj] => newObject Object ( [aProp] => Array ( [type1] => test1 [type2] => test2 ) ) )
echo "<br>";
$_SESSION["newObj"]->aProp = array("type3"=>"test3", "type4"=>"test4");
// prints Array ( [newObj] => newObject Object ( [aProp] => Array ( [type3] => test3 [type4] => test4 ) ) )
print_r($_SESSION);
according to me.. what you have missed is pointing out the correct target. here in your case it is $_SESSION['wishList']->wishList['contents']
A: $_SESSION['wishList']->contents[60] = array('qty' => '1.0000');
This changes the array $_SESSION['wishList']->contents by setting its value at index 60 to the array.
| {
"redpajama_set_name": "RedPajamaStackExchange"
} | 388 | [
128000,
48,
25,
31470,
1358,
311,
6484,
3401,
6436,
1358,
358,
2751,
2768,
6484,
1358,
304,
856,
3401,
6436,
512,
40284,
819,
861,
60,
591,
6562,
861,
3075,
198,
1021,
58,
18075,
60,
591,
2982,
198,
1021,
58,
7743,
60,
591,
2982,
198,
1021,
58,
30403,
60,
591,
220,
16,
13,
931,
15,
198,
696,
58,
4578,
60,
591,
2982,
198,
1021,
58,
30403,
60,
591,
220,
16,
13,
931,
15,
198,
696,
58,
5538,
60,
591,
2982,
198,
1021,
58,
30403,
60,
591,
220,
16,
13,
931,
15,
198,
696,
7184,
602,
1097,
4560,
311,
923,
264,
502,
1665,
311,
433,
1093,
420,
25,
720,
3123,
3401,
6436,
681,
82199,
861,
14911,
18075,
284,
1358,
493,
1399,
6,
591,
1358,
493,
30403,
6,
591,
364,
16,
13
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
48,
25,
31470,
1358,
311,
6484,
3401,
6436,
1358,
358,
2751,
2768,
6484,
1358,
304,
856,
3401,
6436,
512,
40284,
819,
861,
60,
591,
6562,
861,
3075,
198,
1021,
58,
18075,
60,
591,
2982,
198,
1021,
58,
7743,
60,
591,
2982,
198,
1021,
58,
30403,
60,
591,
220,
16,
13,
931,
15,
198,
696,
58,
4578,
60,
591,
2982,
198,
1021,
58,
30403,
60,
591,
220,
16,
13,
931,
15,
198,
696,
58,
5538,
60,
591,
2982,
198,
1021,
58,
30403,
60,
591,
220,
16,
13,
931,
15,
198,
696,
7184,
602,
1097,
4560,
311,
923,
264,
502,
1665,
311,
433,
1093,
420,
25,
720,
3123,
3401,
6436,
681,
82199,
861,
14911,
18075,
284,
1358,
493,
1399,
6,
591,
1358,
493,
30403,
6,
591,
364,
16,
13,
-100
] |
Quick Answer: Which Tube Line Has The Most Stations?
Which Tube stations are closest together?
What is the least used tube station?
Which tube line is the oldest?
What are the 11 tube lines?
What is the shortest Tube line in London?
Which tube station has no vowels?
How many stations are on each underground line?
Which is the busiest tube line?
What is the busiest London Underground station?
What are peak hours on the tube?
What is the busiest subway in the world?
What is the deepest underground station in the world?
Is the Piccadilly line busy?
People often don't realise just how close some Tube stops are to each other.
Other stations that are very close together are Embankment and Charing Cross, Mansion House and Cannon Street, Marylebone to Edgeware Road and Holborn to Chancery Lane..
Roding ValleyWith a little over 368,400 passengers recorded in 2017, the Central line's Roding Valley is officially the least used station across the London underground network.
The London Underground first opened in 1863 as the oldest section of underground railway in the world, running between Paddington (then known as Bishop's Road) and Farringdon Street on what is now part of the Circle, Hammersmith and City and Metropolitan lines.
The system comprises eleven lines – Bakerloo, Central, Circle, District, Hammersmith & City, Jubilee, Metropolitan, Northern, Piccadilly, Victoria, Waterloo & City – serving 270 stations. It is operated by Transport for London (TfL).
Piccadilly LineThe shortest distance between two adjacent stations on the underground network is only 260 metres. The tube journey between Leicester Square and Covent Garden on the Piccadilly Line takes only about 20 seconds, but costs £4.90 (cash fare).
OUEAI (zone 3) — the other station to contain all the vowels. AA (zone 3) — the only station without any of the letters of UNDERGROUND in its name.
The system has 270 stations and 250 miles (400 km) of track. Despite its name, only 45% of the system is underground in tunnels, with much of the network in the outer environs of London being on the surface.
Northern LineWhich are London's busiest morning Tube Lines?PositionTube LineMorning peak hour capacity1Northern Line130 per cent2Central Line116 per cent3Jubilee Line115 per cent4Victoria Line105 per cent5 more rows•Nov 7, 2019
Waterloo StationWaterloo – 91.3 million journeys each year As well as being the busiest in the UK, Waterloo Station is the largest in terms of floor space and has the greatest number of platforms. The Underground station is served by the Northern and Jubilee Lines.
Peak fares – Monday to Friday (not on public holidays) between 06:30 and 09:30, and between 16:00 and 19:00. Off-peak fares – at all other times and if you travel from a station outside Zone 1 to a station in Zone 1 between 16:00 and 19:00, Monday to Friday.
Seoul Metropolitan SubwayThe Seoul Metropolitan Subway is the world's busiest metro system, while the Shanghai Metro has the world's largest metro network.
ArsenalnaUnsourced material may be challenged and removed. Arsenalna (Ukrainian: Арсена́льна, romanized: Arsenál'na, IPA: [ɐrseˈnɑlʲnɐ]) is a station on Kyiv Metro's Sviatoshynsko-Brovarska Line. The station was opened along with the first stage and is currently the deepest station in the world at 105.5 metres (346 ft).
As with public transportation in most major cities, there are peak times of travel on the London Tube that you really should try to avoid during your trip. … The lines that travel through popular tourist and entertainment areas—like the Piccadilly, Northern, and Central Lines—stay busy throughout the afternoon.
Quick Answer: What Are The Versions Of Photoshop?
Is Photoshop 2020 the same as Photoshop CC?
Is FedEx Ever Late?
What happens if my FedEx package is late?
Quick Answer: What Abstract Means?
What is the purpose of an abstract? An abstract is
What Are Examples Of Mood And Tone?
Is calm a mood? While moods are commonly used to describe
Quick Answer: What Does It Mean If A Girl Says Yes Sir?
Why do guys call you ma am? Originally Answered: What
Quick Answer: Can You Fly From New York To Niagara Falls?
How do I get from NYC to Niagara Falls? Getting There | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 5,635 | [
128000,
25310,
22559,
25,
16299,
30124,
7228,
11697,
578,
7648,
88016,
5380,
23956,
30124,
17789,
527,
18585,
3871,
5380,
3923,
374,
279,
3325,
1511,
14019,
8216,
5380,
23956,
14019,
1584,
374,
279,
24417,
5380,
3923,
527,
279,
220,
806,
14019,
5238,
5380,
3923,
374,
279,
40243,
30124,
1584,
304,
7295,
5380,
23956,
14019,
8216,
706,
912,
79556,
5380,
4438,
1690,
17789,
527,
389,
1855,
26326,
1584,
5380,
23956,
374,
279,
84608,
14019,
1584,
5380,
3923,
374,
279,
84608,
7295,
54987,
8216,
5380,
3923,
527,
16557,
4207,
389,
279,
14019,
5380,
3923,
374,
279,
84608,
44346,
304,
279,
1917,
5380,
3923,
374,
279,
51621,
26326,
8216,
304,
279,
1917,
5380,
3957,
279,
26987,
35555,
14722,
1584,
13326,
5380,
16298,
3629,
1541,
956,
39256,
1120,
1268,
3345,
1063,
30124,
18417
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
25310,
22559,
25,
16299,
30124,
7228,
11697,
578,
7648,
88016,
5380,
23956,
30124,
17789,
527,
18585,
3871,
5380,
3923,
374,
279,
3325,
1511,
14019,
8216,
5380,
23956,
14019,
1584,
374,
279,
24417,
5380,
3923,
527,
279,
220,
806,
14019,
5238,
5380,
3923,
374,
279,
40243,
30124,
1584,
304,
7295,
5380,
23956,
14019,
8216,
706,
912,
79556,
5380,
4438,
1690,
17789,
527,
389,
1855,
26326,
1584,
5380,
23956,
374,
279,
84608,
14019,
1584,
5380,
3923,
374,
279,
84608,
7295,
54987,
8216,
5380,
3923,
527,
16557,
4207,
389,
279,
14019,
5380,
3923,
374,
279,
84608,
44346,
304,
279,
1917,
5380,
3923,
374,
279,
51621,
26326,
8216,
304,
279,
1917,
5380,
3957,
279,
26987,
35555,
14722,
1584,
13326,
5380,
16298,
3629,
1541,
956,
39256,
1120,
1268,
3345,
1063,
30124,
18417,
-100
] |
Three groupings of Jupiter's moons with a dozen newly discovered ones shown in bold.
But Sheppard suspects these moons could be holdouts, the "last remnants" of early solar system objects.
Valetudo, as spotted through the Magellan telescope in May 2018. With a total of 79 moons, Jupiter is now the most lunar-rich planet in the solar system. Of the twelve, only three moons orbit in a prograde direction, and are closer to Jupiter.
The 2 new regular prograde moons join 15 other previously discovered prograde satellites that typically orbit Jupiter in about an Earth year or less. Astronomers believe that prograde moons form around a planet from the same cloud of dust and gas, which is why they tend to have closer orbits and matching rotation.
"Jupiter just happened to be in the sky near the search fields where we were looking for extremely distant Solar System objects, so we were serendipitously able to look for new moons around Jupiter while at the same time looking for planets at the fringes of our Solar System", Scott Sheppard, an astronomer at the Carnegie Institution for Science, said in a news release. The 12th moon, however, is described as "a real oddball", because of its unique orbit and because it is also probably Jupiter's smallest known moon, at less than 1 kilometer (0.6 miles) in diameter, Sheppard said in the statement.
It doesn't behave like the other moons, which tend to fall into a few categories. "It is moving prograde while all the other objects at a similar distance from Jupiter are moving retrograde".
This moon, now called Valetudo, moves in a prograde motion, though it is slightly inclined compared to the orbits of the other moons.
Sheppard, whose report appears in the International Astronomical Union Minor Planet Electronic Circular, suspects that Valetudo is the final remnant of a once much larger moon that has been ground to dust by collisions in the past.
In June 2017, the same team discovered two mile-wide moons and five lost moons. TheyÂre calling one moon an 'oddball because of its unusual orbit.
"Valetudo's going down the highway the wrong way, so it's very likely it will collide with these other objects". Confirmation of the moons required multiple observations, and those data enabled a calculation of the moons' orbits. Given the moons' stable orbits and kilometer-scale sizes, the collisions were likely chance events later in the solar system's history. The best forecast, for now, is some time in the next billion years. If you said 69, you were right.
"It's not hugely surprising to me, I think as we look deeper, we'll find more of these irregular satellites around Jupiter, Saturn, Uranus and Neptune, but it is cool, and it's great that they've found so many all at once".
But the researchers realized that Jupiter happened to be in a spot that allowed them to examine the area around the gas giant for any unknown natural satellites. They could be rock, ice or a mixture. It's not clear when Valetudo will get a close-up, but it ought to be before anything goes splat. | {
"redpajama_set_name": "RedPajamaC4"
} | 8,275 | [
128000,
20215,
1912,
826,
315,
50789,
596,
81260,
449,
264,
21030,
13945,
11352,
6305,
6982,
304,
14265,
627,
4071,
3005,
99104,
30861,
1521,
81260,
1436,
387,
3412,
11934,
11,
279,
330,
4354,
73440,
1,
315,
4216,
13238,
1887,
6302,
627,
69337,
1169,
7835,
11,
439,
30652,
1555,
279,
7023,
85886,
56925,
304,
3297,
220,
679,
23,
13,
3161,
264,
2860,
315,
220,
4643,
81260,
11,
50789,
374,
1457,
279,
1455,
57811,
41947,
11841,
304,
279,
13238,
1887,
13,
5046,
279,
30335,
11,
1193,
2380,
81260,
27605,
304,
264,
463,
7082,
5216,
11,
323,
527,
12401,
311,
50789,
627,
791,
220,
17,
502,
5912,
463,
7082,
81260,
5249,
220,
868,
1023,
8767,
11352,
463,
7082,
47710,
430,
11383,
27605,
50789,
304,
922,
459,
9420,
1060,
477,
2753,
13,
39616
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
20215,
1912,
826,
315,
50789,
596,
81260,
449,
264,
21030,
13945,
11352,
6305,
6982,
304,
14265,
627,
4071,
3005,
99104,
30861,
1521,
81260,
1436,
387,
3412,
11934,
11,
279,
330,
4354,
73440,
1,
315,
4216,
13238,
1887,
6302,
627,
69337,
1169,
7835,
11,
439,
30652,
1555,
279,
7023,
85886,
56925,
304,
3297,
220,
679,
23,
13,
3161,
264,
2860,
315,
220,
4643,
81260,
11,
50789,
374,
1457,
279,
1455,
57811,
41947,
11841,
304,
279,
13238,
1887,
13,
5046,
279,
30335,
11,
1193,
2380,
81260,
27605,
304,
264,
463,
7082,
5216,
11,
323,
527,
12401,
311,
50789,
627,
791,
220,
17,
502,
5912,
463,
7082,
81260,
5249,
220,
868,
1023,
8767,
11352,
463,
7082,
47710,
430,
11383,
27605,
50789,
304,
922,
459,
9420,
1060,
477,
2753,
13,
39616,
-100
] |
Central Hall Westminster: Why hire us for your next event?
Central Hall Westminster was originally designed as a meeting space, so delivering successful events is integral to our purpose. We host more than 800 events a year, and we would be delighted to include your event among them.
When it comes to service, you can rely on our in-house teams to guide and assist you at every stage. From choosing delicious catering to providing audio visual solutions, our experienced, award-winning staff will help you manage your event down to the last detail.
Over the years we have successfully delivered events of all sizes and styles, including several of great cultural significance – so you can be assured that your event is in very capable hands.
Central Hall Westminster is an iconic Grade II* listed Edwardian venue that provides a stunning backdrop for all manner of events.
Our distinctive heritage is reflected in beautiful period details throughout the building, including a grand marble staircase that leads into the Lecture Hall and Library, and Europe's largest self-supporting domed ceiling in the Great Hall.
Several rooms also offer natural light and impressively high ceilings for added impact.
We are known for being the largest conference and events venue in central London, with 23 stunning rooms that accommodate events of all sizes. Our event spaces range from intimate meeting rooms for 60 people or less, to larger exhibition spaces for events of 250-500 people – and our flagship Great Hall caters for grand occasions of up to 2,400 people.
You can book us for a variety of occasions, including conferences, meetings, graduations, live concerts, and exhibitions. Plus, we enjoy a prime London location opposite Westminster Abbey – so getting to us couldn't be easier for you or your guests.
We are also accredited by a number of leading bodies, and work with other-like minded partners who share our vision to improve the events industry. | {
"redpajama_set_name": "RedPajamaC4"
} | 360 | [
128000,
44503,
11166,
48043,
25,
8595,
18467,
603,
369,
701,
1828,
1567,
5380,
44503,
11166,
48043,
574,
13517,
6319,
439,
264,
6574,
3634,
11,
779,
24944,
6992,
4455,
374,
26154,
311,
1057,
7580,
13,
1226,
3552,
810,
1109,
220,
4728,
4455,
264,
1060,
11,
323,
584,
1053,
387,
35072,
311,
2997,
701,
1567,
4315,
1124,
627,
4599,
433,
4131,
311,
2532,
11,
499,
649,
17631,
389,
1057,
304,
37002,
7411,
311,
8641,
323,
7945,
499,
520,
1475,
6566,
13,
5659,
19301,
18406,
54929,
311,
8405,
7855,
9302,
10105,
11,
1057,
10534,
11,
10292,
27875,
5687,
690,
1520,
499,
10299,
701,
1567,
1523,
311,
279,
1566,
7872,
627,
1959,
279,
1667,
584,
617,
7946,
12886,
4455,
315,
682,
12562,
323,
9404,
11,
2737,
3892,
315,
2294,
13042,
26431,
1389
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
44503,
11166,
48043,
25,
8595,
18467,
603,
369,
701,
1828,
1567,
5380,
44503,
11166,
48043,
574,
13517,
6319,
439,
264,
6574,
3634,
11,
779,
24944,
6992,
4455,
374,
26154,
311,
1057,
7580,
13,
1226,
3552,
810,
1109,
220,
4728,
4455,
264,
1060,
11,
323,
584,
1053,
387,
35072,
311,
2997,
701,
1567,
4315,
1124,
627,
4599,
433,
4131,
311,
2532,
11,
499,
649,
17631,
389,
1057,
304,
37002,
7411,
311,
8641,
323,
7945,
499,
520,
1475,
6566,
13,
5659,
19301,
18406,
54929,
311,
8405,
7855,
9302,
10105,
11,
1057,
10534,
11,
10292,
27875,
5687,
690,
1520,
499,
10299,
701,
1567,
1523,
311,
279,
1566,
7872,
627,
1959,
279,
1667,
584,
617,
7946,
12886,
4455,
315,
682,
12562,
323,
9404,
11,
2737,
3892,
315,
2294,
13042,
26431,
1389,
-100
] |
Projects – California Historic Route 66 Association – Helping you get your kicks in California!
Along with promoting the features of the Mother Road, our primary work is in preserving those historical features along the road for future generations to see and enjoy.
Welcome to our Projects page. Along with promoting the features of the Mother Road, our primary work is in preserving those historical features along the road for future generations to see and enjoy.
We are therefore proud of the projects that we currently have in process and have on the drawing board.
Without the help of the volunteers of our Association members, many of these projects cannot be done. Through the dedication and enthusiasm of our members, we are helping preserve the long road of Route 66 through California, each mile of the way.
The California Historic Route 66 Association always has an iron in the fire when comes to preserving the Mother Road. This is a summary of projects that are on the horizon that we hope to tackle.
Projects that we take on can be as small as erecting a monument or as monumental as converting a big section of Route 66 into a National Scenic Byway, such as with our Corridor Management Plan.
We will be adding Project information in the near future. Be sure to check back often for updates. Want to know when the Projects page will be posted? Follow us on Twitter @Route66CA and be one of the first to know! | {
"redpajama_set_name": "RedPajamaC4"
} | 2,128 | [
128000,
31058,
1389,
7188,
51887,
9767,
220,
2287,
10229,
1389,
91801,
499,
636,
701,
37350,
304,
7188,
4999,
50909,
449,
22923,
279,
4519,
315,
279,
21720,
9728,
11,
1057,
6156,
990,
374,
304,
47995,
1884,
13970,
4519,
3235,
279,
5754,
369,
3938,
22540,
311,
1518,
323,
4774,
627,
14262,
311,
1057,
32323,
2199,
13,
32944,
449,
22923,
279,
4519,
315,
279,
21720,
9728,
11,
1057,
6156,
990,
374,
304,
47995,
1884,
13970,
4519,
3235,
279,
5754,
369,
3938,
22540,
311,
1518,
323,
4774,
627,
1687,
527,
9093,
12691,
315,
279,
7224,
430,
584,
5131,
617,
304,
1920,
323,
617,
389,
279,
13633,
4580,
627,
27131,
279,
1520,
315,
279,
23872,
315,
1057,
10229,
3697,
11,
1690,
315,
1521,
7224,
4250,
387,
2884,
13,
17331,
279,
39955,
323,
36232
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
31058,
1389,
7188,
51887,
9767,
220,
2287,
10229,
1389,
91801,
499,
636,
701,
37350,
304,
7188,
4999,
50909,
449,
22923,
279,
4519,
315,
279,
21720,
9728,
11,
1057,
6156,
990,
374,
304,
47995,
1884,
13970,
4519,
3235,
279,
5754,
369,
3938,
22540,
311,
1518,
323,
4774,
627,
14262,
311,
1057,
32323,
2199,
13,
32944,
449,
22923,
279,
4519,
315,
279,
21720,
9728,
11,
1057,
6156,
990,
374,
304,
47995,
1884,
13970,
4519,
3235,
279,
5754,
369,
3938,
22540,
311,
1518,
323,
4774,
627,
1687,
527,
9093,
12691,
315,
279,
7224,
430,
584,
5131,
617,
304,
1920,
323,
617,
389,
279,
13633,
4580,
627,
27131,
279,
1520,
315,
279,
23872,
315,
1057,
10229,
3697,
11,
1690,
315,
1521,
7224,
4250,
387,
2884,
13,
17331,
279,
39955,
323,
36232,
-100
] |
What a delightful breath of fresh air this maintenance-free villa is! Uplifting colors and decor, a spacious floorplan, and high ceilings will welcome you the moment you step through the door and into this popular "Dover" Golf Villa. You and your guests will marvel at the stunning golf view. The current renters love that their view provides a wonderful golf view, yet the privacy that they prefer. The great room and kitchen are ideal for cooking delicious meals and for entertaining family, friends and neighbors. You will find bright tile in the living areas that are easy to maintain. Another highlight: the entire home has a water softener and filter system. Heritage Oaks truly is a Golfers Paradise, but even for non-golfers this community offers a variety of amenities that make it one of Sarasotas most desirable destinations. Escape snow, ice and sleet and come to a resort-style place where you will be warmly invited to attend a multitude of events at one of Sarasotas finest clubhouses with restaurant and Bar/Lounge. Enjoy the 18 hole golf course, an award-winning Pro-Shop, 5 heated swimming pools, 4 Har-Tru tennis courts, a fitness center with a gym and daily fitness classes and a fun-filled social calendar. No need to endure the next blizzard, the furniture is INCLUDED. Welcome to Heritage Oaks! | {
"redpajama_set_name": "RedPajamaC4"
} | 4,871 | [
128000,
3923,
264,
50189,
11745,
315,
7878,
3805,
420,
13709,
12862,
47625,
374,
0,
549,
501,
18148,
8146,
323,
10799,
11,
264,
33236,
6558,
10609,
11,
323,
1579,
56814,
690,
10788,
499,
279,
4545,
499,
3094,
1555,
279,
6134,
323,
1139,
420,
5526,
330,
35,
2017,
1,
28131,
37912,
13,
1472,
323,
701,
15051,
690,
45882,
520,
279,
20441,
19665,
1684,
13,
578,
1510,
92951,
3021,
430,
872,
1684,
5825,
264,
11364,
19665,
1684,
11,
3686,
279,
12625,
430,
814,
10932,
13,
578,
2294,
3130,
323,
9979,
527,
10728,
369,
17677,
18406,
21644,
323,
369,
30311,
3070,
11,
4885,
323,
19228,
13,
1472,
690,
1505,
10107,
10228,
304,
279,
5496,
5789,
430,
527,
4228,
311,
10519,
13,
13596,
11415,
25,
279,
4553,
2162,
706,
264,
3090,
8579,
804
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
3923,
264,
50189,
11745,
315,
7878,
3805,
420,
13709,
12862,
47625,
374,
0,
549,
501,
18148,
8146,
323,
10799,
11,
264,
33236,
6558,
10609,
11,
323,
1579,
56814,
690,
10788,
499,
279,
4545,
499,
3094,
1555,
279,
6134,
323,
1139,
420,
5526,
330,
35,
2017,
1,
28131,
37912,
13,
1472,
323,
701,
15051,
690,
45882,
520,
279,
20441,
19665,
1684,
13,
578,
1510,
92951,
3021,
430,
872,
1684,
5825,
264,
11364,
19665,
1684,
11,
3686,
279,
12625,
430,
814,
10932,
13,
578,
2294,
3130,
323,
9979,
527,
10728,
369,
17677,
18406,
21644,
323,
369,
30311,
3070,
11,
4885,
323,
19228,
13,
1472,
690,
1505,
10107,
10228,
304,
279,
5496,
5789,
430,
527,
4228,
311,
10519,
13,
13596,
11415,
25,
279,
4553,
2162,
706,
264,
3090,
8579,
804,
-100
] |
Charrington Way, Broadbridge Heath, Horsham, RH12
TWO BEDROOMS - ONE EN-SUITE
SEPARATE SNUG AND DINING ROOM
KITCHEN WITH INTEGRATED APPLIANCES
QUIET CUL-DE-SAC LOCATION
INTEGRAL GARAGE AND DRIVEWAY PARKING
MATURE PRIVATE GARDEN
Having a well thought out and clever design of living and bedroom space that has been extended by the current owners approaching approximately 1434 ft.²
To the ground floor the reception hallway leads through to the sitting room which enjoys a bay window to the front aspect and has double doors that lead through to a separate dining room, with a further set of double doors leading directly out onto the rear garden terrace. The kitchen has a range of wall and base units with beach finish and contrasting worksurfaces running through. There is a selection of stainless steel integrated appliances and the kitchen window enjoys views over the rear garden; adjacent to the kitchen is there a convenient snug room which also has a direct access to the rear garden and the garage.
The staircase to the first floor landing leads to the principal bedroom which has an aspect to the front of the property and has ample fitted wardrobe space, there is also an accompanying en-suite shower room which has a walk-in shower and inbuilt vanity unit with white sanitary-ware and chrome fitments. There are three further bedrooms plus a separate family shower room which again has a modern contemporary finish.
Outside there is block paved driveway parking for several vehicles which leads to the garage with an up and over door. The rear garden has an Indian sandstone terrace area with numerous areas for outside alfresco style dining. The garden is laid to lawn along with a selection of flower beds and borders with mature shrubs and plants and there is a side access gate.
The village of Broadbridge Heath has a thriving community where there are a wealth of amenities including a popular primary school, a convenience store, hairdressers, public house and places of worship. There are regular bus services through the village, including the free Tesco bus and easy access to both the A24 and A281.
The nearest large town is Horsham where you will find a wide variety of independent retailers, restaurants and coffee shops. Horsham Park and the Pavilions sports centre and Capitol Theatre provide a wide range of activities and entertainment for all ages. London is a 50 minute train journey away from Horsham mainline station and regular services to the South Coast. Alternatively, Christ's Hospital train station also provides direct links to London and the South Coast.
Sitting Room 14'4 (4.37m) x 13' (3.96m)
Dining Room 12'4 (3.76m) x 9'5 (2.87m)
Snug 11' (3.35m) x 7'8 (2.34m)
Kitchen 12'4 (3.76m) x 9'4 (2.84m)
Bedroom 1 14'10 (4.52m) x 9'9 (2.97m)
En-suite shower room 8'8 (2.64m) x 5'9 (1.75m)
Bedroom 3 16' (4.88m) x 8'5 (2.57m)
Bedroom 4 9'2 (2.79m) x 6'2 (1.88m)
Integrated Garage 18'9 (5.72m) x 8' (2.44m)
Details correct: November 2018
Church Cottages, High Street, Rusper, RH12
An impressive 1,216 sqft three bedroom, two bath/shower room attached character cottage that has been skilfully refurbished to a high standard approx. 4 years ago,...
Hill Mead, Horsham, RH12
A superb opportunity to acquire a three bedroom converted bungalow, situated on the popular western side of Horsham.
Palmer Avenue, Broadbridge Heath, RH12
A spacious and well-presented three storey, four bedroom, semi-detached family home located in popular Wickhurst Green. INTERNAL VIEWING RECOMMENDED.
Old Wickhurst Lane, Broadbridge Heath, RH12
Prices From £455,000 (Freehold)
Coming soon - a collection of four bedroom brand new family homes within easy reach of local schools and a short drive to Horsham town centre. | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 9,840 | [
128000,
1163,
1138,
4910,
12424,
11,
16273,
14024,
48562,
11,
15083,
939,
309,
11,
57256,
717,
198,
51,
23513,
83364,
51770,
50,
482,
25002,
5301,
6354,
52,
6119,
198,
937,
16976,
2390,
18407,
3014,
3651,
78359,
1753,
59048,
198,
42,
26043,
965,
4874,
2006,
69103,
9182,
10314,
2989,
22774,
33429,
198,
12247,
1372,
356,
1112,
12,
1170,
6354,
1741,
66683,
198,
691,
69103,
984,
97691,
3669,
3651,
96887,
42903,
67384,
1753,
198,
44,
15215,
58893,
480,
7527,
965,
198,
29132,
264,
1664,
3463,
704,
323,
28799,
2955,
315,
5496,
323,
14150,
3634,
430,
706,
1027,
11838,
555,
279,
1510,
7980,
31047,
13489,
220,
10290,
19,
10702,
13,
30556,
198,
1271,
279,
5015,
6558,
279,
23991,
51902,
11767,
1555,
311,
279,
11961,
3130,
902,
32838,
264,
23542,
3321,
311
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
1163,
1138,
4910,
12424,
11,
16273,
14024,
48562,
11,
15083,
939,
309,
11,
57256,
717,
198,
51,
23513,
83364,
51770,
50,
482,
25002,
5301,
6354,
52,
6119,
198,
937,
16976,
2390,
18407,
3014,
3651,
78359,
1753,
59048,
198,
42,
26043,
965,
4874,
2006,
69103,
9182,
10314,
2989,
22774,
33429,
198,
12247,
1372,
356,
1112,
12,
1170,
6354,
1741,
66683,
198,
691,
69103,
984,
97691,
3669,
3651,
96887,
42903,
67384,
1753,
198,
44,
15215,
58893,
480,
7527,
965,
198,
29132,
264,
1664,
3463,
704,
323,
28799,
2955,
315,
5496,
323,
14150,
3634,
430,
706,
1027,
11838,
555,
279,
1510,
7980,
31047,
13489,
220,
10290,
19,
10702,
13,
30556,
198,
1271,
279,
5015,
6558,
279,
23991,
51902,
11767,
1555,
311,
279,
11961,
3130,
902,
32838,
264,
23542,
3321,
311,
-100
] |
Laulima not A'ole: Restoring Our Roots
Whose Tax Is It, Anyway? (Part 2)
Court Challenge to Guam's race-based plebiscite will go Forward
OHA Gives Away $7.4M in Grants
Women in Hawaii: Poverty and Opportunity
Could Private Exchanges Save Health Care?
Facts not Ideology
Star-Adv: Let's Start Talking about Recreational Marijuana Now
SA: ...Judging by the outcome of this past legislative session — the passage of House Bill 321, an expansive effort to ramp up distribution fairly readily — it seems plain that the state is positioning itself for a full legalization debate when session reconvenes next year.... (Translation: 'Medical' marijuana was just like gay civil unions--a strategy to get to full legalization.)
When medical marijuana became legal, Hawaii was at the front of the pack among states liberalizing controls of the drug, moving first to allow its use for relief of pain and other physical symptoms. Now the long-awaited authorization of dispensaries for the delivery of marijuana to those holding a medical prescription has been overtaken by decisions in other states to legalize it entirely.
(Translation: We at the Star-Adv want to be back in the vanguard of 'change.' History has a line of march and you foot-draggers are holding us back from our place at the head of that line. Hawaii is a platform for our glorification.)
it falls to state health officials to design administrative rules that can impose sufficiently rigorous quality controls and oversight.
They have a year to accomplish that, before the dispensaries start opening July 1, 2016.
The other element is public participation in the process going forward. Public hearings on rulemaking will be part of that, but they should be focused on setting standards for medicinal (smirk wink wink) dosage (visualize a bunch of drunks setting standards for alcohol regulation)....
a separate public conversation needs to begin on the next steps that will confront the state, given that the distributive infrastructure is being set in place: Should Hawaii move on to legalize, or decriminalize, marijuana? ...
Some, such as (former cocaine dealer) Senate Majority Leader J. Kalani 'Powdernose' English, asserted that legalization of recreational marijuana use is the "next step for Hawaii." English said leadership would address it in the next session....
this would be a new industry, one that could leave a deep imprint through many layers of island society. (Imprint: The more people are doped up the more they will go along with whatever we at the Star-Adv suggest.)
Big Q: Only 23% Believe Marijuana is Medicinal
AP: Marijuana merchants face another federal obstacle: High taxes
read ... Did you really think they were serious about 'medical'?
Ige Helped Write Legislation on HHSC, Health Connector
Borreca: On several important pieces of legislation, Ige had a hand in actually writing the bills under consideration by the House and Senate.
"It was a very successful session for this administration and the Legislature. It was a joint effort," said Ige at a news conference last week.
"This shows what we can do when we are working together," Ige added, pointing to the changes to the Hawaii Health Systems Corp. and the Maui Memorial Hospital privatization bills as "an effort to find common ground and move the bills forward."
Ige explained that on the Maui hospital bill, for instance, although his administration had been testifying on the bill, the legislative committees were not including the administration's views.
"So I just asked them to take a step back. We agreed on the outcome and we agreed to get the best bill we could," Ige said, adding that his regular meetings with House and Senate leadership and major committee chairpeople paved the way for his legislative victories.
Rep. Sylvia Luke, House Finance Committee chairwoman, said Ige met every week with the House and Senate money committee leaders....
in comparison to Abercrombie who bellowed at Democrats at a 2011 convention to "Stop the excuses; stop walking around as if you're not listening to anybody else except yourselves," Ige, by listening, is being heard....
read ... New governor, new way to work with Legislature
Solar Shifts $53M in Costs to Others
SA: ...HECO has said home-based photovoltaic systems placed an additional $53 million burden on the shoulders of nonsolar customers in 2014. That number does not include the excess power HECO gets from solar customers, the utility said....
Hawaiian Electric Co. received $1.7 million worth of "free" power from rooftop solar customers in 2013.
read ... $53M - $1.7M = $51.3M
BOE is considering a plan to make out-of-school suspensions a last resort
SA: The state Board of Education is considering a new school discipline policy that promotes keeping delinquent students in school and moves the system away from a long-standing zero-tolerance stance that relies on out-of-school suspensions as a common form of punishment.
Hawaii youth advocates say too many public school students are being punished with suspensions for minor offenses — a tactic they argue isn't effective and often steers at-risk youth into the criminal justice system.
"There's no question that there are kids that end up in the criminal justice system that would not otherwise end up there had they not been removed from their educational environment," said Kauai Prosecutor Justin Kollar, who served as an adviser on the new policy.
Some 6,345 students were suspended statewide last year, accounting for 10,530 suspensions issued in the 2013-14 school year. That averages out to roughly 60 suspensions per school day. Of those suspensions, 1,029 resulted in student arrests on campuses.
Kollar and Oahu Family Court Judge Paul Murakami told BOE members last week that out-of-school suspensions should be minimized in favor of behavioral supports that help keep students on track academically. They contend schools are the safest place for these students.
"For those of you in school administration, it's only a suspension," Murakami said. "But that's the start of a slippery slope, a very steep, slippery slope."
read ... Discipline
Nago Designated At-Will Employee Subject to Post Election Review
AP: People weren't too happy after the 2014 elections, when a slew of ballots were misplaced in Maui. In addition, a tropical storm downed trees on the Big Island, blocking the route to the polls for many who weren't given a second chance to vote. A number of bills were introduced to address the problem, and one emerged that would designate that the chief elections officer is an at-will employee subject to a performance evaluation two months after an election.
read ... Election Reform
Shapiro: Drop Scheme to Build Obama 'Center' at Kakaako
Shapiro: Plans being coordinated by the University of Hawaii to seek some kind of secondary presidential center as a consolation prize should be viewed with a leery eye given greater needs for public resources.
The Hawaii library proposal, supported by local Democratic politicians and educational institutions, offered Obama 8 acres of prime Kakaako waterfront land for an archive, museum, conference center, K-12 leadership academy and UH Center for Community Organizing....
it can't be justified to offer the same Kakaako property and state support for a lesser retreat, institute or conference center that wouldn't carry the same economic or cultural benefit.
There are better core uses for limited state resources, especially at the university, which is in no position to take on a vanity project as it struggles with a crumbling main campus, a deficit-ridden athletic program, a cancer institute in crisis and discord over the Daniel Inouye Center....
Lower property tax rates in Maui council budget proposal
MN: Lower real property tax rates were ... supported by committee members, mainly due to a 13.5 percent increase in overall property values....
read ... Lower Taxes
Bill 32 Reform 'Residential A' Tax Cliff
SA: ...Last June, the city applied a flat rate of $6 per $1,000 of assessed value to this class, which was much higher than the existing residential rate of $3.50 per $1,000. In so doing, the city caused an unfair tax of $2,500 for 7,000 second-home and investor owners.
One investor with a property assessed at $999,999 paid $3,500 in taxes, while a second investor with a property in the same zoning and use with an assessed value of just
$1 more -- at $1 million -- paid $6,000 in taxes. This $2,500 Residential A tax differential is arbitrary, discriminatory and placed these taxpayers at a competitive disadvantage. Some owners will recover this cost by passing it on to their tenants, e.g., $200 or more per month.
The city stated that in 2015, 1,000 more properties were assessed at or above $1 million and fell off this cliff. These taxpayers will pay $2,500 more in tax on a small increase in their assessed value unless the City Council adopts Bill 32.
If the Council does nothing, 1,000 more taxpayers will have an unpleasant surprise in their July bill.
Fortunately, Bill 32 is a simple solution that would raise the same amount of revenue.
Bill 32 would adopt the 2014 Real Property Tax Advisory Commission's (RPTAC) recommended solution of a graduated two-rate plan, similar to the income tax schedule.
The residential rate of $3.50 would apply to the first $999,999 of assessed value for all properties in the same use and zoning.
A second "Residential A" rate would apply on values above $1 million, with this rate set to be revenue neutral, e.g., $9.08 per $1,000 assessed value in 2014.
read ... Cliff
Truth-Challenged Anti-GMO Activists Hype Dust Damages
KE: A federal jury has ordered DuPont-Pioneer to pay $507,090 in damages due to dust blowing from its Kauai agricultural fields. The money will be shared by 15 Waimea residents and attorneys Kyle Smith and Gerard Jervis.
The lawsuit did not address whether the dust contained pesticides or caused any health impacts.
But Councilman Gary Hooser wasted no time in posting a blog describing it as "vast amounts of he pesticide laden dust." ....
Though Gary and anti-GMO activists are already hyping its significance in fighting the biotech companies, the verdict was actually quite narrow. You can read it here.
Meanwhile, Gary's truth-challenged visit to the Syngenta shareholder's meeting in Switzerland prompted Council Chair Mel Rapozo to send the company a letter distancing the Council from its anti-GMO colleague. Mel wrote:
Mr. Hooser's statements were not made on behalf of the Council body, and were not in any way officially directed or sanctioned by the Council.
Mel also clarified that Gary's plea for Syngenta to follow Kauai County's laws had no basis in reality. Judge Barry Kurren declared Bill 2491/Ordinance 960 invalid, and ordered the county not to enforce it, Mel wrote. That decision is currently under appeal.
[T]herefore the law remains invalid and has not taken effect. Accordingly, Syngenta could not possibly be in violation of the law.
Allan Parachini makes a valid point in today's The Garden Island that the anti-GMO movement essentially conceded the Hawaii legal fight by seeking Legislative action giving counties the right to regulate pesticides and GMOs. Because if the counties already have that right, as anti-GMO attorneys argue, why would they need the Lege to specifically give it to them?
At any rate, their legislative efforts failed entirely. None of the bills pushed by the anti-GMO movement survived the session.
Which is why the Hawaii branch of the mainland-based Center for Food Safety is returning to its time-worn strategy: fear-mongering. The anti-GMO group is releasing "Pesticides in Paradise," a report that purports to "establishe[s] the relationship between pesticide use, genetically engineered field test sites and public health risks in Hawaii....
read ... Musings: Dusty and Dusted
Alleged victim speaks about game room attack
HNN: "He was ringing the doorbell at first, then he started pounding on the door. That's when they opened it and by that time he was already mad," says Franson. Morre and two other Crime Reduction Unit officers waited for about 45 seconds for the door to open. They were looking for someone, who wasn't there and that apparently added to Morre's frustration.
Morre immediately started attacking Jordan Topinio.
"At first he just said, to take off his hat. That's when he hit his hat off and then he kicked him, but he didn't really say anything like why he kicked him," says Franson.
In the video Morre is also seen pointing at one of the security cameras.
"He (said) that he should break all these cameras in here because they can see who it is at the door before they open it... so they should have known to open the door quick since he was out there."
After that, Morre turns toward Franson who is sitting next to him. Slapping, punching and kicking Franson.
"I was shocked. I didn't see it coming but I knew there was nothing I could do. So I just sat there."
Morre then turned his attention back toward Jordan Topinio, kicking him then throwing a chair at him. Topinio had to go to the hospital and get stitches.
read ... Attack
Some Question Bag Ban
SA: Kailua's new Target store, which opened in March. Because the city's new plastic ban was slated to begin only a few months later, July 1, executives figured they'd plunge right in. None of the flimsy bags so commonly in use are found at the check stand, where instead shoppers are asked if they need to buy one of the woven reusable bags sold for 99 cents, or have brought their own.
"We do have those individuals who could be a little shocked that we are completely bagless, but we accommodate them as best we can." So far, Target hasn't exercised the option to stock paper bags, he added, "but we're more than willing to help them carry out their groceries."
SA: Rules on plastic bags vary by county
read ... Questions
Ho'opili supporters saw Horton-Schuler as a civic-minded and helpful "class act"
Concert strikes a chord as it raises $400,000 for IHS
What Hawaii's top CEOs get paid
Mainland Homosexuals use Guam Case to Penetrate Territories
(Another) HCCC inmate missing
Waikiki benefit concert hopes to raise more funds for homeless initiative program
Heeia Fishpond restoration closing gaps in wall, funding
Gov. Ige honors correction officers, deputy sheriffs and nurses in ceremonies
Vacation rentals, B&B operators hiring legal help to navigate permitting process as county cracks down
Failing Kawaihae breakwater gets funding
North Korea's show of force greets U.S. diplomatic overture
Hawaii tourism trends warrant discussion | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 2,168 | [
128000,
43,
5049,
7675,
539,
362,
6,
1286,
25,
9240,
5620,
5751,
75687,
198,
1671,
974,
15545,
2209,
1102,
11,
42669,
30,
320,
5920,
220,
17,
340,
76874,
26323,
311,
92788,
596,
7102,
6108,
7245,
65,
3510,
635,
690,
733,
22952,
198,
46,
17455,
70013,
42581,
400,
22,
13,
19,
44,
304,
73901,
198,
36190,
304,
28621,
25,
70274,
323,
48379,
198,
13191,
9877,
1398,
19926,
10467,
6401,
10852,
5380,
37,
11613,
539,
14123,
2508,
198,
12988,
12,
24350,
25,
6914,
596,
5256,
62022,
922,
4158,
265,
1697,
65939,
4800,
198,
7934,
25,
2564,
62813,
3252,
555,
279,
15632,
315,
420,
3347,
27743,
3882,
2001,
279,
21765,
315,
4783,
8766,
220,
14423,
11,
459,
61838,
5149,
311,
23091,
709,
8141,
14470,
31368,
2001,
433,
5084,
14733,
430,
279
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
43,
5049,
7675,
539,
362,
6,
1286,
25,
9240,
5620,
5751,
75687,
198,
1671,
974,
15545,
2209,
1102,
11,
42669,
30,
320,
5920,
220,
17,
340,
76874,
26323,
311,
92788,
596,
7102,
6108,
7245,
65,
3510,
635,
690,
733,
22952,
198,
46,
17455,
70013,
42581,
400,
22,
13,
19,
44,
304,
73901,
198,
36190,
304,
28621,
25,
70274,
323,
48379,
198,
13191,
9877,
1398,
19926,
10467,
6401,
10852,
5380,
37,
11613,
539,
14123,
2508,
198,
12988,
12,
24350,
25,
6914,
596,
5256,
62022,
922,
4158,
265,
1697,
65939,
4800,
198,
7934,
25,
2564,
62813,
3252,
555,
279,
15632,
315,
420,
3347,
27743,
3882,
2001,
279,
21765,
315,
4783,
8766,
220,
14423,
11,
459,
61838,
5149,
311,
23091,
709,
8141,
14470,
31368,
2001,
433,
5084,
14733,
430,
279,
-100
] |
The time for the renovation of the house has come and we don't want to imagine what mess it's gonna be after.
Usually the cleaning of the whole house takes a lot of time, especially if there is a time for big spring refreshment or cleaning after some small repairing. However, the situation gets serious when there is a big change in the house and it needs builders. Here is the reason why should we choose after builders cleaning company. If we don't have a week for doing the perfect cleaning after the builder's job, then, we definitely should see what options we have. At https://www.snowwhitecleaners.co.uk/ there is the answer and the reveal from the heavy and long lasting cleaning work for us.
What can we expect from the after builders cleaning services? The SnowWhiteCleaners company in London offers a perfect cleaning of every part of the rooms and the garden as well. The trained staff is having a whole list of every part of the house, which has to be cleaned and polished. After the dusty building job, usually there is a lot to be cleaned not only on the floor or over the furniture, but in whole dimensions of each object of the house. That means that all the windows and doors will shine from everywhere. The space above the doors and under the mattresses will be cleaned in the best way.
In order all the house to shine to become free of dust, the cleaning team will do the vacuum cleaning everywhere and will polish all the surfaces in every room. The detailed list of what you can expect from after builders cleaning, you can see at SnowWhiteCleaners.co.uk. The teal is well trained and have lots of experience in cleaning inside and outside the house. For garden maintenance, you can also rely ont he professional company. Choose the fresh air and the shining room, by booking the cleaning service, which will save you a lot of energy.
Previous PostWho is offering creative and cheap home decor? | {
"redpajama_set_name": "RedPajamaC4"
} | 8,132 | [
128000,
791,
892,
369,
279,
50555,
315,
279,
3838,
706,
2586,
323,
584,
1541,
956,
1390,
311,
13085,
1148,
9622,
433,
596,
16926,
387,
1306,
627,
71744,
279,
16204,
315,
279,
4459,
3838,
5097,
264,
2763,
315,
892,
11,
5423,
422,
1070,
374,
264,
892,
369,
2466,
10683,
10625,
479,
477,
16204,
1306,
1063,
2678,
68337,
13,
4452,
11,
279,
6671,
5334,
6129,
994,
1070,
374,
264,
2466,
2349,
304,
279,
3838,
323,
433,
3966,
49186,
13,
5810,
374,
279,
2944,
3249,
1288,
584,
5268,
1306,
49186,
16204,
2883,
13,
1442,
584,
1541,
956,
617,
264,
2046,
369,
3815,
279,
4832,
16204,
1306,
279,
7514,
596,
2683,
11,
1243,
11,
584,
8659,
1288,
1518,
1148,
2671,
584,
617,
13,
2468,
3788,
1129,
2185,
516,
3409,
5902,
18883,
388
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
791,
892,
369,
279,
50555,
315,
279,
3838,
706,
2586,
323,
584,
1541,
956,
1390,
311,
13085,
1148,
9622,
433,
596,
16926,
387,
1306,
627,
71744,
279,
16204,
315,
279,
4459,
3838,
5097,
264,
2763,
315,
892,
11,
5423,
422,
1070,
374,
264,
892,
369,
2466,
10683,
10625,
479,
477,
16204,
1306,
1063,
2678,
68337,
13,
4452,
11,
279,
6671,
5334,
6129,
994,
1070,
374,
264,
2466,
2349,
304,
279,
3838,
323,
433,
3966,
49186,
13,
5810,
374,
279,
2944,
3249,
1288,
584,
5268,
1306,
49186,
16204,
2883,
13,
1442,
584,
1541,
956,
617,
264,
2046,
369,
3815,
279,
4832,
16204,
1306,
279,
7514,
596,
2683,
11,
1243,
11,
584,
8659,
1288,
1518,
1148,
2671,
584,
617,
13,
2468,
3788,
1129,
2185,
516,
3409,
5902,
18883,
388,
-100
] |
Flip Sarta (BFA Film 2020) reports from this year's Animation Anarchy: Midsummer Night Toons X (July 20th, 2018). Midsummer Night Toons is a yearly free screening organized by animation alumnus, Matt Lee (BFA Animation 2005), that showcases new animated shorts! Flip reports about the night, the films, and how deeply animation can affect a person.
Last week I had the pleasure of attending Midsummer Night Toons. The event's tenth year, titled Animation Anarchy, had an impressive lineup of awesome shorts. With an overabundance of friendly faces, talented artists, and good vibes the night surely did not disappoint.
All of the films were a whole lot of fun, but more than that they made you think. Floatland by Victoria Vincent stood out to me especially. The film is about a young person who plays an RPG video game to escape from her existence. The tendency to use games like this to escape the negative in our life or to cope with depression is so common among people my age. What impressed me the most is how beautifully the film captured this feeling. The film hit home and has been stuck in my mind since.
Animation is such a special medium that can convey so many different ideas and stories; with no restriction except your own mind. Two short minutes can bring you to tears or leave you analyzing yourself for hours after it's over. Each film is a small peephole into that artist's mind. A culmination of their inner thought and experience given form through a labor of love. A film blooming with self-expression or drama or comedy or action – anything! What could be more exciting? Every artist comes from somewhere different, and every person in that audience does as well. Everyone has their own unique experiences and yet we all came together and shared the night watching some lovely toons. To have a night celebrating these works, the artists who make them and the art form itself is a real gift and I'm glad to have been a part of it.
Before I wrap up I would like to give an extra special thanks to Matt Lee (BFA Animation 2005) for making such a delightful night possible. It takes a lot of time and effort to get a night like this coordinated and ready to go, so thank you very much! Also a big thanks to all of the artists and storytellers who took part this year! You're all amazing!
My friends and I enjoying the show!
Below are all films screened at Animation Anarchy: Midsummer Night Toons X. I would completely encourage that you check them out! | {
"redpajama_set_name": "RedPajamaC4"
} | 1,472 | [
128000,
47908,
328,
26017,
320,
33,
3711,
17042,
220,
2366,
15,
8,
6821,
505,
420,
1060,
596,
21415,
1556,
15630,
25,
14013,
63666,
13120,
2057,
2439,
1630,
320,
29527,
220,
508,
339,
11,
220,
679,
23,
570,
14013,
63666,
13120,
2057,
2439,
374,
264,
45370,
1949,
23061,
17057,
555,
10571,
453,
22082,
355,
11,
13678,
12336,
320,
33,
3711,
21415,
220,
1049,
20,
705,
430,
71849,
502,
11625,
36876,
0,
41384,
6821,
922,
279,
3814,
11,
279,
12631,
11,
323,
1268,
17693,
10571,
649,
7958,
264,
1732,
627,
5966,
2046,
358,
1047,
279,
17069,
315,
24096,
14013,
63666,
13120,
2057,
2439,
13,
578,
1567,
596,
56766,
1060,
11,
25891,
21415,
1556,
15630,
11,
1047,
459,
16358,
28612,
315,
12738,
36876,
13,
3161,
459,
927,
370,
98681,
315,
11919
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
47908,
328,
26017,
320,
33,
3711,
17042,
220,
2366,
15,
8,
6821,
505,
420,
1060,
596,
21415,
1556,
15630,
25,
14013,
63666,
13120,
2057,
2439,
1630,
320,
29527,
220,
508,
339,
11,
220,
679,
23,
570,
14013,
63666,
13120,
2057,
2439,
374,
264,
45370,
1949,
23061,
17057,
555,
10571,
453,
22082,
355,
11,
13678,
12336,
320,
33,
3711,
21415,
220,
1049,
20,
705,
430,
71849,
502,
11625,
36876,
0,
41384,
6821,
922,
279,
3814,
11,
279,
12631,
11,
323,
1268,
17693,
10571,
649,
7958,
264,
1732,
627,
5966,
2046,
358,
1047,
279,
17069,
315,
24096,
14013,
63666,
13120,
2057,
2439,
13,
578,
1567,
596,
56766,
1060,
11,
25891,
21415,
1556,
15630,
11,
1047,
459,
16358,
28612,
315,
12738,
36876,
13,
3161,
459,
927,
370,
98681,
315,
11919,
-100
] |
The Legacy Cycle
Travels in the Land of Hunger
In the spring of 2004 - after living in Tokyo, Japan for over three years pursuing a career as a freelance musician - science fiction and fantasy author Domenico Italo Composto-Hart set off on a half-year backpacking journey through the lands of East and Southeast Asia, Siberia, Central Russia, the Baltic states, the Nordic countries, and Eastern and Western Europe.
Traveling by foot, bus, train, and boat - and seeing the world through the analytical lens of anthropology, archaeology, and economics - Domenico documents, researches, and deciphers the developing nations he encounters as they rise through the turbulence of unregulated Western capitalism and globalization.
Travels in the Land of Hunger is the author's reflective account of the dark, long-lasting impact of Western colonialism and imperialism, the Vietnam War, the Khmer Rouge regime, the 1997 Asian financial crisis, and the sex tourism and sex trafficking industries in Southeast and East Asia. It is also a narrative of finding exotic beauty, inspiration, inner strength, and unexpected love.
"I would recommend the book for a very good description of what it's like to backpack through Asia."
Steve, Goodreads reviewer
"A fascinating, well researched, and at times shocking travel memoir detailing the economic, social, and historical workings behind observations made while traveling through Southeast Asia and East Asia."
Peter, Goodreads reviewer
Photos from my backpacking journey - as detailed in
- can be seen on my Instagram account.
Follow the journey!
©2020 by thedragonbone | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 3,595 | [
128000,
791,
38987,
42392,
198,
1305,
402,
2053,
304,
279,
11680,
315,
67636,
198,
644,
279,
10683,
315,
220,
1049,
19,
482,
1306,
5496,
304,
27286,
11,
6457,
369,
927,
2380,
1667,
34118,
264,
7076,
439,
264,
46209,
39844,
482,
8198,
17422,
323,
18884,
3229,
423,
6431,
4042,
1102,
12812,
1219,
2252,
78,
11529,
472,
743,
1022,
389,
264,
4376,
4771,
34236,
287,
11879,
1555,
279,
12098,
315,
6460,
323,
36664,
13936,
11,
68600,
689,
11,
10913,
8524,
11,
279,
73089,
5415,
11,
279,
64466,
5961,
11,
323,
18516,
323,
11104,
4606,
627,
41348,
287,
555,
4579,
11,
5951,
11,
5542,
11,
323,
15688,
482,
323,
9298,
279,
1917,
1555,
279,
44064,
18848,
315,
95044,
11,
39211,
2508,
11,
323,
28989,
482,
423,
6431,
4042,
9477,
11,
3495
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
791,
38987,
42392,
198,
1305,
402,
2053,
304,
279,
11680,
315,
67636,
198,
644,
279,
10683,
315,
220,
1049,
19,
482,
1306,
5496,
304,
27286,
11,
6457,
369,
927,
2380,
1667,
34118,
264,
7076,
439,
264,
46209,
39844,
482,
8198,
17422,
323,
18884,
3229,
423,
6431,
4042,
1102,
12812,
1219,
2252,
78,
11529,
472,
743,
1022,
389,
264,
4376,
4771,
34236,
287,
11879,
1555,
279,
12098,
315,
6460,
323,
36664,
13936,
11,
68600,
689,
11,
10913,
8524,
11,
279,
73089,
5415,
11,
279,
64466,
5961,
11,
323,
18516,
323,
11104,
4606,
627,
41348,
287,
555,
4579,
11,
5951,
11,
5542,
11,
323,
15688,
482,
323,
9298,
279,
1917,
1555,
279,
44064,
18848,
315,
95044,
11,
39211,
2508,
11,
323,
28989,
482,
423,
6431,
4042,
9477,
11,
3495,
-100
] |
This case holds two cartridges and an atomizer or three cartridges while charging your spare battery.
This is a must have for 510 users on the go. USB charging cable included. This blue looks violet!
This has saved me from being stuck with a dead battery all day. I highly recommend to those who uses a 510 as an all day unit.
I bought the 510 starter kit and was alternating charging batteries constantly. I bought this PCC and this is a must. It will make your battery charging life easier when on the go. I basically charge it over night and then alternate two batteries throughout the day. | {
"redpajama_set_name": "RedPajamaC4"
} | 6,713 | [
128000,
2028,
1162,
10187,
1403,
72833,
323,
459,
19670,
3213,
477,
2380,
72833,
1418,
23468,
701,
24804,
11863,
627,
2028,
374,
264,
2011,
617,
369,
220,
15633,
3932,
389,
279,
733,
13,
11602,
23468,
14994,
5343,
13,
1115,
6437,
5992,
80836,
4999,
2028,
706,
6924,
757,
505,
1694,
16075,
449,
264,
5710,
11863,
682,
1938,
13,
358,
7701,
7079,
311,
1884,
889,
5829,
264,
220,
15633,
439,
459,
682,
1938,
5089,
627,
40,
11021,
279,
220,
15633,
27795,
16530,
323,
574,
73462,
23468,
27360,
15320,
13,
358,
11021,
420,
393,
3791,
323,
420,
374,
264,
2011,
13,
1102,
690,
1304,
701,
11863,
23468,
2324,
8831,
994,
389,
279,
733,
13,
358,
13524,
6900,
433,
927,
3814,
323,
1243,
25631,
1403,
27360,
6957,
279,
1938,
13,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0
] | [
2028,
1162,
10187,
1403,
72833,
323,
459,
19670,
3213,
477,
2380,
72833,
1418,
23468,
701,
24804,
11863,
627,
2028,
374,
264,
2011,
617,
369,
220,
15633,
3932,
389,
279,
733,
13,
11602,
23468,
14994,
5343,
13,
1115,
6437,
5992,
80836,
4999,
2028,
706,
6924,
757,
505,
1694,
16075,
449,
264,
5710,
11863,
682,
1938,
13,
358,
7701,
7079,
311,
1884,
889,
5829,
264,
220,
15633,
439,
459,
682,
1938,
5089,
627,
40,
11021,
279,
220,
15633,
27795,
16530,
323,
574,
73462,
23468,
27360,
15320,
13,
358,
11021,
420,
393,
3791,
323,
420,
374,
264,
2011,
13,
1102,
690,
1304,
701,
11863,
23468,
2324,
8831,
994,
389,
279,
733,
13,
358,
13524,
6900,
433,
927,
3814,
323,
1243,
25631,
1403,
27360,
6957,
279,
1938,
13,
-100,
-100,
-100,
-100
] |
AC Milan takeover nears as Silvio Berlusconi approves preliminary contract
Written By Stefan Coerts
Getty Images https://images.daznservices.com/di/library/omnisport/e2/10/silvio-berlusconi-cropped_avuwe4vzc4i61vxuubq9he47k.jpg?t=-1640722268&w=500&quality=80
A group of Chinese investors is one step closer to completing its takeover of AC Milan after club president and former Italian prime minister Silvio Berlusconi approved the preliminary contract concerning their purchase of the club.
The CEO of Berlusconi's holding company Fininvest, Danilo Pellegrino, and Han Li — representative of the group of investors — signed a contract that would see the incumbent owner's 99.93 percent stake sold.
MORE: Top U.S. owners in Premier League | U.S. ready to host World Cup again?
Berlusconi, the former playboy prime minister of Italy who became infamous for his so-called bunga bunga sex parties, has been in charge at Milan since acquiring the San Siro side in 1986.
Both parties aim to complete the takeover by the end of the calendar year as they await the green light from Italian and Chinese authorities.
"Mr. Silvio Berlusconi, chairman of AC Milan, has approved the preliminary contract signed by Mr. Danilo Pellegrino, CEO of Fininvest, and Mr Han Li, representative of a group of Chinese investors, concerning the purchase of the entire stake owned by Fininvest in AC Milan equal to 99.93 percent," an official Fininvest statement reads.
"The binding contract between the parties will be completed by the end of 2016, subject to the obtaining of applicable authorizations from the Italian and Chinese authorities. The agreement values AC Milan at $818 million with an estimated indebtedness of approximately $243 million.
"The agreement requires the acquirers to undertake significant capital increases and liquidity injections aimed at strengthening AC Milan's financial structure, for a total amount of €350m ($387 million) over a three-year period. … During the entire negotiation process, the signature of the contract and the undertakings assumed thereby, Fininvest has always had as a priority the objective which was clearly stated by Mr. Berlusconi: to provide AC Milan, through an appropriate ownership structure, with greater financial resources now more essential for competing with the top football clubs of the world."
Milan won eight Serie A titles, one Coppa Italia, five European Cups two Intercontinental Cups and the Club World Cup during Berlusconi's rein. | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 4,001 | [
128000,
1741,
39855,
64310,
3221,
82,
439,
8211,
73822,
9084,
83745,
86310,
94930,
33269,
5226,
198,
36724,
3296,
50002,
3623,
15916,
198,
19539,
12041,
3788,
1129,
3726,
962,
1394,
4511,
2210,
916,
3529,
72,
46546,
14,
316,
26209,
403,
16954,
17,
14,
605,
2754,
321,
73822,
12,
655,
83745,
86310,
1824,
42816,
27265,
84,
906,
19,
85,
36068,
19,
72,
5547,
48380,
84,
392,
80,
24,
383,
2618,
74,
4924,
69754,
11065,
10513,
23439,
14057,
23,
63147,
28,
2636,
5,
10692,
28,
1490,
198,
32,
1912,
315,
8620,
15167,
374,
832,
3094,
12401,
311,
27666,
1202,
64310,
315,
10807,
39855,
1306,
6469,
4872,
323,
4846,
15155,
10461,
13015,
8211,
73822,
9084,
83745,
86310,
12054,
279,
33269,
5226,
18815,
872,
7782,
315,
279,
6469,
627,
791,
12432,
315,
9084
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
1741,
39855,
64310,
3221,
82,
439,
8211,
73822,
9084,
83745,
86310,
94930,
33269,
5226,
198,
36724,
3296,
50002,
3623,
15916,
198,
19539,
12041,
3788,
1129,
3726,
962,
1394,
4511,
2210,
916,
3529,
72,
46546,
14,
316,
26209,
403,
16954,
17,
14,
605,
2754,
321,
73822,
12,
655,
83745,
86310,
1824,
42816,
27265,
84,
906,
19,
85,
36068,
19,
72,
5547,
48380,
84,
392,
80,
24,
383,
2618,
74,
4924,
69754,
11065,
10513,
23439,
14057,
23,
63147,
28,
2636,
5,
10692,
28,
1490,
198,
32,
1912,
315,
8620,
15167,
374,
832,
3094,
12401,
311,
27666,
1202,
64310,
315,
10807,
39855,
1306,
6469,
4872,
323,
4846,
15155,
10461,
13015,
8211,
73822,
9084,
83745,
86310,
12054,
279,
33269,
5226,
18815,
872,
7782,
315,
279,
6469,
627,
791,
12432,
315,
9084,
-100
] |
Soon, 3.2billion-pixel camera to give 'deepest view of night sky ever seen'
London, Fri, 27 Apr 2012 ANI
London, Apr 27 (ANI): Scientists are building a telescope that they say "will transform our understanding of the universe", and will take the equivalent of 800,000 images by an eight-mega pixel camera every night but of a vastly superior quality.
The Large Synoptic Survey Telescope (LSST) is being put together by the SLAC National Accelerator Laboratory in the U.S, which boasts in a statement that it "will capture the widest, fastest and deepest view of the night sky ever observed".
This is because it packs a 3.2billion-pixel camera that will survey the entire visible sky every week, creating an unprecedented public archive of data - about six million gigabytes per year.
Its deep and frequent cosmic vistas will help answer critical questions about the nature of dark energy and dark matter and aid studies of near-Earth asteroids, Kuiper belt objects, the structure of our galaxy and many other areas of astronomy and fundamental physics.
"With 189 sensors and over three tons of components that have to be packed into an extremely tight space, you can imagine this is a very complex instrument," the Daily mail quoted Nadine Kurita, the project manager for the LSST camera at SLAC, as saying.
"But given the enormous challenges required to provide such a comprehensive view of the universe, it's been an incredible opportunity to design something so unique," Kurita said.
If all continues as planned, construction on the telescope will begin in 2014. Preliminary work has already started on LSST's 8.4-metre primary mirror and its final site atop Cerro Pachon in northern Chile.
As the primary component of all energy in the universe, the still-mysterious dark energy is perhaps the most important research target for LSST and the physicists who are building it.
Yet that's only a start. LSST's fire hose of publicly available data will allow astronomers the world over to view faint and rapidly changing objects, create 3D maps and time lapses of the night sky and detail Pluto's celestial neighbourhood, the Kuiper belt.
"Not only should LSST revolutionize our understanding of the universe, its contents and the laws that govern its behaviour, but it will also transform the way all of us, from kindergarteners to professional astrophysicists, use telescopes," said Tony Tyson, LSST director and a professor of physics at the University of California, Davis, said.
"These are exciting times!" he added. (ANI)
Read More: National Book Trust | National Literacy Mission | Chile | National Physical Laboratory | Bari Brahmna I/complex | Lake-view-camp So | Survey Of India | M.e.complex | M.p.r.site | B.t.project | Chennai National Terminal | Maruthanathi-project | Kaziranga National Park | Manipur University | Central Agriculture University | Mizoram University | Patna University | Nad | Betla National Park | Magadh University | Ranchi University | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 8,951 | [
128000,
67196,
11,
220,
18,
13,
17,
65,
15068,
2320,
6066,
6382,
311,
3041,
364,
58994,
30223,
1684,
315,
3814,
13180,
3596,
3970,
1270,
40672,
11,
31502,
11,
220,
1544,
5186,
220,
679,
17,
2147,
40,
198,
40672,
11,
5186,
220,
1544,
320,
77993,
1680,
57116,
527,
4857,
264,
56925,
430,
814,
2019,
330,
14724,
5276,
1057,
8830,
315,
279,
15861,
498,
323,
690,
1935,
279,
13890,
315,
220,
4728,
11,
931,
5448,
555,
459,
8223,
1474,
11437,
13252,
6382,
1475,
3814,
719,
315,
264,
53108,
16757,
4367,
627,
791,
20902,
24028,
94783,
24507,
87062,
320,
7416,
790,
8,
374,
1694,
2231,
3871,
555,
279,
17216,
1741,
5165,
48005,
859,
32184,
304,
279,
549,
815,
11,
902,
38119,
304,
264,
5224,
430,
433,
330,
14724,
12602,
279,
81339
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
67196,
11,
220,
18,
13,
17,
65,
15068,
2320,
6066,
6382,
311,
3041,
364,
58994,
30223,
1684,
315,
3814,
13180,
3596,
3970,
1270,
40672,
11,
31502,
11,
220,
1544,
5186,
220,
679,
17,
2147,
40,
198,
40672,
11,
5186,
220,
1544,
320,
77993,
1680,
57116,
527,
4857,
264,
56925,
430,
814,
2019,
330,
14724,
5276,
1057,
8830,
315,
279,
15861,
498,
323,
690,
1935,
279,
13890,
315,
220,
4728,
11,
931,
5448,
555,
459,
8223,
1474,
11437,
13252,
6382,
1475,
3814,
719,
315,
264,
53108,
16757,
4367,
627,
791,
20902,
24028,
94783,
24507,
87062,
320,
7416,
790,
8,
374,
1694,
2231,
3871,
555,
279,
17216,
1741,
5165,
48005,
859,
32184,
304,
279,
549,
815,
11,
902,
38119,
304,
264,
5224,
430,
433,
330,
14724,
12602,
279,
81339,
-100
] |
Q: Sun Java Web proxy - SSL transactions/sec? I hope this is "close enough to programming" to pass the bar :)
Is there any way to monitor SSL transactions / sec on Sun Webproxy? Preferably with SNMP, but anything goes :)
A: What do you mean by SSL transactions? The proxy cannot see anything except the connection request, everything else occurs inside the encrypted tunnel.
The connection requests are logged in the "access" log, and appear as "CONNECT fully.qualified.domain.name:port"
| {
"redpajama_set_name": "RedPajamaStackExchange"
} | 108 | [
128000,
48,
25,
8219,
8102,
5000,
13594,
482,
26384,
14463,
61171,
30,
358,
3987,
420,
374,
330,
5669,
3403,
311,
15840,
1,
311,
1522,
279,
3703,
90163,
3957,
1070,
904,
1648,
311,
8891,
26384,
14463,
611,
5819,
389,
8219,
5000,
23648,
30,
85568,
2915,
449,
89233,
11,
719,
4205,
5900,
33723,
32,
25,
3639,
656,
499,
3152,
555,
26384,
14463,
30,
578,
13594,
4250,
1518,
4205,
3734,
279,
3717,
1715,
11,
4395,
775,
13980,
4871,
279,
25461,
26711,
627,
791,
3717,
7540,
527,
14042,
304,
279,
330,
5323,
1,
1515,
11,
323,
5101,
439,
330,
40621,
7373,
13,
37435,
11248,
2710,
25,
403,
702,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
48,
25,
8219,
8102,
5000,
13594,
482,
26384,
14463,
61171,
30,
358,
3987,
420,
374,
330,
5669,
3403,
311,
15840,
1,
311,
1522,
279,
3703,
90163,
3957,
1070,
904,
1648,
311,
8891,
26384,
14463,
611,
5819,
389,
8219,
5000,
23648,
30,
85568,
2915,
449,
89233,
11,
719,
4205,
5900,
33723,
32,
25,
3639,
656,
499,
3152,
555,
26384,
14463,
30,
578,
13594,
4250,
1518,
4205,
3734,
279,
3717,
1715,
11,
4395,
775,
13980,
4871,
279,
25461,
26711,
627,
791,
3717,
7540,
527,
14042,
304,
279,
330,
5323,
1,
1515,
11,
323,
5101,
439,
330,
40621,
7373,
13,
37435,
11248,
2710,
25,
403,
702,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
De kerk van Tinallinge is een romanogotisch bouwwerk uit de dertiende eeuw op de wierde in het midden van het kleine Groninger dorp Tinallinge. Oorspronkelijk was de kerk gewijd aan Maria (Onze Lieve Vrouwe).
Beschrijving
De Onze Lieve Vrouwenkerk is een van oorsprong tweebeukig zaalkerkje met een rechtgesloten koor. Met name de zuidmuur heeft duidelijk romanogotische kenmerken. De achtergevel werd later vernieuwd. Het metselwerk was bij een eerdere restauratie onder een pleisterlaag verdwenen, maar is na de laatste restauratie weer teruggebracht. Oorspronkelijk heeft de kerk een losstaande klokkentoren gehad. Deze is in 1727 afgebroken, waarbij op de kerk een dakruiter werd aangebracht.
In de kerk bevinden zich middeleeuwse muurschilderingen, een middeleeuwse smeedijzeren wijzerplaat met een uurwerk uit 1545, een houten koorhek uit de periode 1549-1557, een rijk versierde preekstoel uit 1660 met achterschot en het wapen van de familie Van Starkenborgh op het klankbord, een originele tekst over de roggeprijs van 1557, en een aantal grafzerken op de vloer. De oorspronkelijke gewelven zijn verdwenen, de kerk heeft nu een balkenplafond.
Het eenklaviers kerkorgel met aangehangen pedaal uit ongeveer 1910 (pas geplaatst in 1917) is van de hand van de orgelbouwer Jan Doornbos. Het pijpwerk is ouder en mogelijk afkomstig van het vorige orgel, dat van 1549 tot 1893 in de kerk gestaan heeft. Het instrument is in 2013-2014 volledig gerestaureerd.
Op het kerkhof rondom de kerk ligt nog een aantal grafzerken, waarvan de oudste uit de 17e eeuw dateert.
De laatste restauratie van het kerkje vond plaats in 2003. In 2010 droeg de hervormde gemeente van Baflo, Rasquert en Tinallinge vanwege de hoge kosten de kerk, samen met begraafplaats en verenigingsgebouw, over aan de Stichting Oude Groninger Kerken.
Tinallinge
Rijksmonument in Het Hogeland | {
"redpajama_set_name": "RedPajamaWikipedia"
} | 2,884 | [
128000,
1951,
597,
17172,
5355,
57355,
17157,
68,
374,
8517,
48876,
540,
354,
16438,
30870,
1273,
17172,
25290,
409,
294,
35213,
11178,
384,
20732,
86,
1200,
409,
289,
1291,
451,
304,
9194,
296,
2924,
5355,
9194,
54655,
87330,
5248,
294,
31215,
57355,
17157,
68,
13,
507,
1105,
72239,
18126,
19275,
574,
409,
597,
17172,
23355,
33323,
18962,
23880,
320,
1966,
3059,
445,
19704,
650,
583,
906,
3677,
40826,
331,
20894,
4504,
4815,
1951,
1952,
3059,
445,
19704,
650,
583,
17378,
7197,
74,
374,
8517,
5355,
297,
1105,
652,
647,
73708,
1395,
3178,
343,
15036,
1727,
17172,
3841,
2322,
8517,
68619,
4282,
9363,
268,
597,
10922,
13,
6344,
836,
409,
1167,
2480,
15479,
324,
38498,
294,
2480,
33338,
48876,
540,
354,
10782,
50332,
1195,
2779,
13,
1611,
87908,
713
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
1951,
597,
17172,
5355,
57355,
17157,
68,
374,
8517,
48876,
540,
354,
16438,
30870,
1273,
17172,
25290,
409,
294,
35213,
11178,
384,
20732,
86,
1200,
409,
289,
1291,
451,
304,
9194,
296,
2924,
5355,
9194,
54655,
87330,
5248,
294,
31215,
57355,
17157,
68,
13,
507,
1105,
72239,
18126,
19275,
574,
409,
597,
17172,
23355,
33323,
18962,
23880,
320,
1966,
3059,
445,
19704,
650,
583,
906,
3677,
40826,
331,
20894,
4504,
4815,
1951,
1952,
3059,
445,
19704,
650,
583,
17378,
7197,
74,
374,
8517,
5355,
297,
1105,
652,
647,
73708,
1395,
3178,
343,
15036,
1727,
17172,
3841,
2322,
8517,
68619,
4282,
9363,
268,
597,
10922,
13,
6344,
836,
409,
1167,
2480,
15479,
324,
38498,
294,
2480,
33338,
48876,
540,
354,
10782,
50332,
1195,
2779,
13,
1611,
87908,
713,
-100
] |
Visión de hace algúnos ayeres.
For sale. . . . . . . . . . . . . . . . . #streets _storytelling #hcsc _street #atlantecollective #streetfinder #myspc #magnumphotos #streetsgrammer #urbanandstreet #dpsp _street #eyeshotmag #fromstreetswithlove #wearethestreet #dreaminstreets #challengerstreets #observecollective #capturestreet #nonstopstreet #thestreetphotographyhub #intercollective #gramslayers #bnw _drama #bnw _rose #storyofthestreet #streets _storytelling_bnw #streets _storytelling #bnw _planet #bw _crew #bnw _addicted #bnw _one #bnw _of_our_world . . | {
"redpajama_set_name": "RedPajamaC4"
} | 6,559 | [
128000,
3198,
3739,
409,
35905,
85409,
437,
19432,
13213,
627,
2520,
6412,
13,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
674,
67523,
1441,
721,
27583,
83,
6427,
674,
39152,
2445,
721,
28451,
674,
60435,
519,
762,
25627,
535,
674,
28451,
34439,
674,
8373,
4080,
674,
31606,
2470,
25625,
674,
67523,
1441,
1549,
1195,
674,
60159,
438,
28451,
674,
67,
1725,
79,
721,
28451,
674,
1216,
4385,
354,
31606,
674,
1527,
67523,
1441,
4291,
31153,
674,
906,
57365,
478,
3829,
674,
57291,
6442,
265,
1441,
674,
331,
543,
10214,
67523,
1441,
674,
49133,
17840,
535,
674,
46170,
28451,
674,
6414,
9684,
28451,
674,
61943,
3829,
52399,
5814,
27780,
674,
2295,
17840,
535,
674,
1549,
3306,
5184,
674,
11328,
86,
721
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
3198,
3739,
409,
35905,
85409,
437,
19432,
13213,
627,
2520,
6412,
13,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
662,
674,
67523,
1441,
721,
27583,
83,
6427,
674,
39152,
2445,
721,
28451,
674,
60435,
519,
762,
25627,
535,
674,
28451,
34439,
674,
8373,
4080,
674,
31606,
2470,
25625,
674,
67523,
1441,
1549,
1195,
674,
60159,
438,
28451,
674,
67,
1725,
79,
721,
28451,
674,
1216,
4385,
354,
31606,
674,
1527,
67523,
1441,
4291,
31153,
674,
906,
57365,
478,
3829,
674,
57291,
6442,
265,
1441,
674,
331,
543,
10214,
67523,
1441,
674,
49133,
17840,
535,
674,
46170,
28451,
674,
6414,
9684,
28451,
674,
61943,
3829,
52399,
5814,
27780,
674,
2295,
17840,
535,
674,
1549,
3306,
5184,
674,
11328,
86,
721,
-100
] |
Call Us: 800.267.5033 Contact Fred J. Pisani | Contact Kenneth A. Ramp
Estate Planning/ Estate Administration
Business/Transactional Law
Elder Law/Medicaid Planning
A Question of Internet Privacy and Social Networking
You are here: Home / A Question of Internet Privacy and Social Networking
In the first case of its kind, Pietrylo v Hillstone Restaurant Group, d/b/a Houston's Restaurant, 2009 WL 3128420 (D.N.J. Sept.25, 2009), we represented two employees, who were fired by their former employer for allegedly making derogatory comments about their jobs outside of work on a private MySpace group page.
One of the employees created a MySpace group page called "The Spectator" as a place for Houston's employees to "vent about any BS" they encountered at work. He selected all of the privacy controls offered by MySpace in setting up the page. The group was designated as "private", meaning access to the group was limited to MySpace users who received an invitation from him to join the group. Only he, not invited members, could send out invitations. He invited several Houston's employees, but no managers or upper management personnel. The invitees included a female Houston's greeter. The greeter accepted the invitation and became an authorized member of the group. Access to the group was through the member's email address and personal, private password.
Upper management became aware of the group page. A member of upper management called the greeter into his office while she was working and asked her for her email address and personal private password so that he could access the page. She did so, but later testified, that she did so only because she thought something would happen to her if she did not.
This manager went on the page using the greeter's personal information and copied the postings. He also passed the greeter's personal information up the corporate ladder to other members of upper management. The page was accessed a number of times. Subsequently, Houston's terminated the two employees based upon their comments on the group page and their involvement in creating it.
We filed suit on behalf of the fired employees, and amongst other things, alleged that Houston's had violated federal and state statutes involving improper access to stored electronic communications.
After three (3) years of contentious litigation, the case went to trial before a jury. The Honorable Faith Hochberg presided over the trial. The trial lasted a week. The jury returned a verdict in favor of our clients finding that Houston's managers had accessed the MySpace site "without authorization" and acted "maliciously". The jury awarded compensatory damages and punitive damages.
The case received national attention being featured on ABC: Eyewitness News, CNN: American Morning, Fox News: Fox and Friends, and in the Wall Street Journal, AOL: National News, and the New Jersey Law Journal.
Subsequent to the jury decision in Pietrylo, thirteen (13) states, including New Jersey, passed "password protection" laws prohibiting employers from requesting username and password information, or otherwise accessing, the password-protected portions of an employee's personal social media.
Senators from New York and Connecticut have sponsored proposed federal legislation for a password protection act citing the Pietrylo decision. The federal legislation is pending.
January 2, 2011 General Law, Social Networking Law
Trump Administration plans social media screening for all non-immigrant visa applicants
ESTATE TAX – FED and STATE- DISAPPEARING???
After Pietrylo, an update on social media laws
http://rampandpisani.com/internet-privacy-social-networking">
"The law will never make men free; it is men who have got to make the law free." - Henry David Thoreau
Copyright © Ramp & Pisani, LLP | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 2,447 | [
128000,
7368,
4073,
25,
220,
4728,
13,
16567,
13,
17735,
18,
197,
8906,
28588,
622,
13,
92042,
5676,
765,
9359,
49498,
362,
13,
75670,
198,
36,
2513,
28780,
14,
25447,
17128,
198,
23562,
14,
32475,
7658,
198,
36,
77969,
7658,
10482,
291,
32584,
28780,
198,
32,
16225,
315,
8191,
19406,
323,
9983,
60563,
198,
2675,
527,
1618,
25,
5492,
611,
362,
16225,
315,
8191,
19406,
323,
9983,
60563,
198,
644,
279,
1176,
1162,
315,
1202,
3169,
11,
86288,
894,
385,
348,
8270,
11046,
26568,
5856,
11,
294,
3554,
14520,
16386,
596,
26568,
11,
220,
1049,
24,
60614,
220,
13384,
25377,
15,
320,
35,
2112,
3587,
13,
5488,
13,
914,
11,
220,
1049,
24,
705,
584,
15609,
1403,
8420,
11,
889,
1051,
14219,
555,
872,
4846,
19683,
369,
19755
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
7368,
4073,
25,
220,
4728,
13,
16567,
13,
17735,
18,
197,
8906,
28588,
622,
13,
92042,
5676,
765,
9359,
49498,
362,
13,
75670,
198,
36,
2513,
28780,
14,
25447,
17128,
198,
23562,
14,
32475,
7658,
198,
36,
77969,
7658,
10482,
291,
32584,
28780,
198,
32,
16225,
315,
8191,
19406,
323,
9983,
60563,
198,
2675,
527,
1618,
25,
5492,
611,
362,
16225,
315,
8191,
19406,
323,
9983,
60563,
198,
644,
279,
1176,
1162,
315,
1202,
3169,
11,
86288,
894,
385,
348,
8270,
11046,
26568,
5856,
11,
294,
3554,
14520,
16386,
596,
26568,
11,
220,
1049,
24,
60614,
220,
13384,
25377,
15,
320,
35,
2112,
3587,
13,
5488,
13,
914,
11,
220,
1049,
24,
705,
584,
15609,
1403,
8420,
11,
889,
1051,
14219,
555,
872,
4846,
19683,
369,
19755,
-100
] |
.class final synthetic Lcom/android/systemui/servicebox/-$Lambda$hdt2P97Ci8sZM36d73A824YH2OU$1;
.super Ljava/lang/Object;
# interfaces
.implements Ljava/lang/Runnable;
# instance fields
.field private final synthetic -$f0:Ljava/lang/Object;
.field private final synthetic -$f1:Ljava/lang/Object;
# direct methods
.method private final synthetic $m$0()V
.locals 2
iget-object v0, p0, Lcom/android/systemui/servicebox/-$Lambda$hdt2P97Ci8sZM36d73A824YH2OU$1;->-$f0:Ljava/lang/Object;
check-cast v0, Lcom/android/systemui/servicebox/KeyguardServiceBoxContainer;
iget-object v1, p0, Lcom/android/systemui/servicebox/-$Lambda$hdt2P97Ci8sZM36d73A824YH2OU$1;->-$f1:Ljava/lang/Object;
check-cast v1, Ljava/lang/String;
invoke-virtual {v0, v1}, Lcom/android/systemui/servicebox/KeyguardServiceBoxContainer;->lambda$-com_android_systemui_servicebox_KeyguardServiceBoxContainer_40496(Ljava/lang/String;)V
return-void
.end method
.method public synthetic constructor <init>(Ljava/lang/Object;Ljava/lang/Object;)V
.locals 0
invoke-direct {p0}, Ljava/lang/Object;-><init>()V
iput-object p1, p0, Lcom/android/systemui/servicebox/-$Lambda$hdt2P97Ci8sZM36d73A824YH2OU$1;->-$f0:Ljava/lang/Object;
iput-object p2, p0, Lcom/android/systemui/servicebox/-$Lambda$hdt2P97Ci8sZM36d73A824YH2OU$1;->-$f1:Ljava/lang/Object;
return-void
.end method
# virtual methods
.method public final run()V
.locals 0
invoke-direct {p0}, Lcom/android/systemui/servicebox/-$Lambda$hdt2P97Ci8sZM36d73A824YH2OU$1;->$m$0()V
return-void
.end method
| {
"redpajama_set_name": "RedPajamaGithub"
} | 4,271 | [
128000,
3150,
1620,
28367,
445,
884,
52925,
29239,
2005,
35286,
2054,
14,
22104,
59366,
86063,
8207,
17,
47,
3534,
61719,
23,
82,
57,
44,
1927,
67,
5958,
32,
25016,
56,
39,
17,
12188,
3,
16,
280,
50121,
445,
10248,
26319,
69626,
401,
2,
25066,
198,
12322,
4779,
445,
10248,
26319,
14,
69936,
5322,
2,
2937,
5151,
198,
16859,
879,
1620,
28367,
83458,
69,
15,
25,
39024,
26319,
69626,
401,
16859,
879,
1620,
28367,
83458,
69,
16,
25,
39024,
26319,
69626,
5322,
2,
2167,
5528,
198,
13204,
879,
1620,
28367,
400,
76,
3,
15,
368,
53,
198,
262,
662,
65230,
220,
17,
271,
262,
19935,
295,
41532,
348,
15,
11,
281,
15,
11,
445,
884,
52925,
29239,
2005,
35286,
2054,
14,
22104,
59366,
86063,
8207,
17,
47,
3534,
61719
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
3150,
1620,
28367,
445,
884,
52925,
29239,
2005,
35286,
2054,
14,
22104,
59366,
86063,
8207,
17,
47,
3534,
61719,
23,
82,
57,
44,
1927,
67,
5958,
32,
25016,
56,
39,
17,
12188,
3,
16,
280,
50121,
445,
10248,
26319,
69626,
401,
2,
25066,
198,
12322,
4779,
445,
10248,
26319,
14,
69936,
5322,
2,
2937,
5151,
198,
16859,
879,
1620,
28367,
83458,
69,
15,
25,
39024,
26319,
69626,
401,
16859,
879,
1620,
28367,
83458,
69,
16,
25,
39024,
26319,
69626,
5322,
2,
2167,
5528,
198,
13204,
879,
1620,
28367,
400,
76,
3,
15,
368,
53,
198,
262,
662,
65230,
220,
17,
271,
262,
19935,
295,
41532,
348,
15,
11,
281,
15,
11,
445,
884,
52925,
29239,
2005,
35286,
2054,
14,
22104,
59366,
86063,
8207,
17,
47,
3534,
61719,
-100
] |
Welcome to the Rotary Club of Marco Island Noontime website.
Would you like to enjoy fellowship and fun with interesting people from all over the country and world?
Would you like to network with local business leaders?
Would you like to be a part of changing your community and the world into a better place through your service?
Then the Rotary Club of Marco Island is for YOU!
We'd be happy to provide additional information about joining and invite you to be a guest at an upcoming meeting to see firsthand what our Rotary Club is all about. Click Here to be taken to the "Contact Us" page and let us know what we may do for you.
Congratulations to our 4-Way Test Essay Contest winners!
All winners received a certificate of recognition and a gift card.
Content Copyright © 2012-2019 ""Rotary Club of Marco Island, Florida USA"". | {
"redpajama_set_name": "RedPajamaC4"
} | 8,664 | [
128000,
14262,
311,
279,
75956,
10349,
315,
35281,
10951,
2360,
546,
547,
3997,
627,
29089,
499,
1093,
311,
4774,
63349,
323,
2523,
449,
7185,
1274,
505,
682,
927,
279,
3224,
323,
1917,
5380,
29089,
499,
1093,
311,
4009,
449,
2254,
2626,
6164,
5380,
29089,
499,
1093,
311,
387,
264,
961,
315,
10223,
701,
4029,
323,
279,
1917,
1139,
264,
2731,
2035,
1555,
701,
2532,
5380,
12487,
279,
75956,
10349,
315,
35281,
10951,
374,
369,
15334,
4999,
1687,
4265,
387,
6380,
311,
3493,
5217,
2038,
922,
18667,
323,
22114,
499,
311,
387,
264,
8810,
520,
459,
14827,
6574,
311,
1518,
83668,
1148,
1057,
75956,
10349,
374,
682,
922,
13,
9369,
5810,
311,
387,
4529,
311,
279,
330,
8906,
4073,
1,
2199,
323,
1095,
603,
1440,
1148,
584,
1253,
656
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
14262,
311,
279,
75956,
10349,
315,
35281,
10951,
2360,
546,
547,
3997,
627,
29089,
499,
1093,
311,
4774,
63349,
323,
2523,
449,
7185,
1274,
505,
682,
927,
279,
3224,
323,
1917,
5380,
29089,
499,
1093,
311,
4009,
449,
2254,
2626,
6164,
5380,
29089,
499,
1093,
311,
387,
264,
961,
315,
10223,
701,
4029,
323,
279,
1917,
1139,
264,
2731,
2035,
1555,
701,
2532,
5380,
12487,
279,
75956,
10349,
315,
35281,
10951,
374,
369,
15334,
4999,
1687,
4265,
387,
6380,
311,
3493,
5217,
2038,
922,
18667,
323,
22114,
499,
311,
387,
264,
8810,
520,
459,
14827,
6574,
311,
1518,
83668,
1148,
1057,
75956,
10349,
374,
682,
922,
13,
9369,
5810,
311,
387,
4529,
311,
279,
330,
8906,
4073,
1,
2199,
323,
1095,
603,
1440,
1148,
584,
1253,
656,
-100
] |
Nex Generation Surfing School is looking for sponsors interested in supporting our students through your contribution. This is a great way to advertise and promote your business and/or orginization while contibuting to the community.
Your Logo will appear on over 500 hundred rashguards that will be worn by our students during camps and lessons and given to the students who will continue to wear them throughout the year throughout central Florida.
Your Logo will be printed on our sponsor section of our t-shirts, distributed each week to our students.
Rack Cards - Each Year Nex Generation Surfing School prints 50,000 rack cards to be distributed in the community. Your logo will be included in the sponsor section of our Rack Cards and seen by thousands!
Each week our students receive take home/goodie bags filled with coupons and advertisements of local businesses and orginizations that support our surfing school. This gives businesses and orginations again, another opportunity to get your name out there and to generate more business.
or to begin the process by filling out the form below. | {
"redpajama_set_name": "RedPajamaC4"
} | 5,170 | [
128000,
45,
327,
24367,
65197,
287,
6150,
374,
3411,
369,
39701,
8173,
304,
12899,
1057,
4236,
1555,
701,
19035,
13,
1115,
374,
264,
2294,
1648,
311,
51936,
323,
12192,
701,
2626,
323,
5255,
1262,
258,
2065,
1418,
687,
581,
10831,
311,
279,
4029,
627,
7927,
31152,
690,
5101,
389,
927,
220,
2636,
7895,
57342,
79838,
430,
690,
387,
24634,
555,
1057,
4236,
2391,
29135,
323,
18872,
323,
2728,
311,
279,
4236,
889,
690,
3136,
311,
10051,
1124,
6957,
279,
1060,
6957,
8792,
9784,
627,
7927,
31152,
690,
387,
17124,
389,
1057,
25438,
3857,
315,
1057,
259,
49760,
11,
4332,
1855,
2046,
311,
1057,
4236,
627,
49,
474,
27864,
482,
9062,
9941,
88929,
24367,
65197,
287,
6150,
24370,
220,
1135,
11,
931,
30759,
7563,
311,
387,
4332,
304,
279
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
45,
327,
24367,
65197,
287,
6150,
374,
3411,
369,
39701,
8173,
304,
12899,
1057,
4236,
1555,
701,
19035,
13,
1115,
374,
264,
2294,
1648,
311,
51936,
323,
12192,
701,
2626,
323,
5255,
1262,
258,
2065,
1418,
687,
581,
10831,
311,
279,
4029,
627,
7927,
31152,
690,
5101,
389,
927,
220,
2636,
7895,
57342,
79838,
430,
690,
387,
24634,
555,
1057,
4236,
2391,
29135,
323,
18872,
323,
2728,
311,
279,
4236,
889,
690,
3136,
311,
10051,
1124,
6957,
279,
1060,
6957,
8792,
9784,
627,
7927,
31152,
690,
387,
17124,
389,
1057,
25438,
3857,
315,
1057,
259,
49760,
11,
4332,
1855,
2046,
311,
1057,
4236,
627,
49,
474,
27864,
482,
9062,
9941,
88929,
24367,
65197,
287,
6150,
24370,
220,
1135,
11,
931,
30759,
7563,
311,
387,
4332,
304,
279,
-100
] |
The Internet is full of incredible images, but not all of them are up for use. Sometimes the difficult part in content creation is knowing where to find great images you can use that are of high quality and creativity without fear of getting hit with legal consequences down the road. How do you find high-quality images that don't have copyright restrictions? Where do you find personality-filled images for your next blog post, website or commercial project? That's the question and I've got the answer. There are multiple website out that that contain one hundred percent free images with high resolution created by photographers. It is just about knowing where they are and I've put together a list of websites of just where you can find them.
This website features high resolution photographs that you can use for personal or commercial projects totally for free. Upside? The site is updated with new pictures every single week. Downside? There is no categories or search capabilities to find particular images.
This website provides a large collection of images available for either personal or commercial projects for free. Additionally, you can register so that those images land right in your email inbox! They have both a category and tag function making your search for a particular photo easy!
This website is where all the vintage photography is at. Taken from public archives, these black and white, sepia or colored images are free of copyright restrictions. They are categorized making searching easy but more than anything, they provide an intriguing and exciting perspective of the past.
This website features photographs taken by the talented Thomas Mühl who has waived copyright restrictions for personal or commercial use. Because of this, the images can be used without a backlink and the option is available to buy all current photos in a zip file for only $15!
This website uploads seven new photos every week with all of them available for personal and commercial projects for free. When you register, they'll email the images to you weekly and they also welcome contributions for all the aspiring photographers! Their website setup does make searching difficult as it uses just a simple search tool.
This website links you to a free registration to be added to the Death to The Stock Photo email list to receive their monthly pack of photography with the stories to go along with them. They creatively offer invitations to be a part of their premium plan for $15/month or to "fund a trip" and receive access to 200 photos. Though, it is impossible to download any photos without registering.
This website promotes itself as having "the best free stock photos in one place" and they upload five new photos every single day which is more often than most free websites. Each of the photos are free to use under the Creative Commons Zero license (which means as long as you're using them legally, they're free!) and they are searchable through keywords and tagging.
This website contains a large collection of free images for personal or commercial projects as long as you don't try and resell the images of your own. The images are easy search, categorized and easy to download!
This website hosts a library of free photos all from the talented Jay Mantri. The images are provided under the Creative Common Zero License (which means as long as you're using them legally, they're free!) but there is no way to search for specific images.
This website contains free photos for your use under the Creative Common Zero License (which means as long as you're using them legally, they're free!) and they are downloadable from the homepage. There are also categories, for easy searching!
Download all 30 sites to get Free Stock Photos in our special Report. CLICK HERE to get your free PDF to keep on your Desktop.
No email required. Download it directly, now! | {
"redpajama_set_name": "RedPajamaC4"
} | 8,384 | [
128000,
791,
8191,
374,
2539,
315,
15400,
5448,
11,
719,
539,
682,
315,
1124,
527,
709,
369,
1005,
13,
18156,
279,
5107,
961,
304,
2262,
9886,
374,
14392,
1405,
311,
1505,
2294,
5448,
499,
649,
1005,
430,
527,
315,
1579,
4367,
323,
28697,
2085,
8850,
315,
3794,
4295,
449,
5897,
16296,
1523,
279,
5754,
13,
2650,
656,
499,
1505,
1579,
22867,
5448,
430,
1541,
956,
617,
7065,
17294,
30,
11208,
656,
499,
1505,
17743,
44518,
5448,
369,
701,
1828,
5117,
1772,
11,
3997,
477,
8518,
2447,
30,
3011,
596,
279,
3488,
323,
358,
3077,
2751,
279,
4320,
13,
2684,
527,
5361,
3997,
704,
430,
430,
6782,
832,
7895,
3346,
1949,
5448,
449,
1579,
11175,
3549,
555,
48277,
13,
1102,
374,
1120,
922,
14392,
1405,
814,
527,
323,
358
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
791,
8191,
374,
2539,
315,
15400,
5448,
11,
719,
539,
682,
315,
1124,
527,
709,
369,
1005,
13,
18156,
279,
5107,
961,
304,
2262,
9886,
374,
14392,
1405,
311,
1505,
2294,
5448,
499,
649,
1005,
430,
527,
315,
1579,
4367,
323,
28697,
2085,
8850,
315,
3794,
4295,
449,
5897,
16296,
1523,
279,
5754,
13,
2650,
656,
499,
1505,
1579,
22867,
5448,
430,
1541,
956,
617,
7065,
17294,
30,
11208,
656,
499,
1505,
17743,
44518,
5448,
369,
701,
1828,
5117,
1772,
11,
3997,
477,
8518,
2447,
30,
3011,
596,
279,
3488,
323,
358,
3077,
2751,
279,
4320,
13,
2684,
527,
5361,
3997,
704,
430,
430,
6782,
832,
7895,
3346,
1949,
5448,
449,
1579,
11175,
3549,
555,
48277,
13,
1102,
374,
1120,
922,
14392,
1405,
814,
527,
323,
358,
-100
] |
Schmidt & Pocher was a German late-night talk show hosted on Das Erste by comedians Harald Schmidt and Oliver Pocher in the Thursday 10:45 pm time slot from 25 October 2007 to 16 April 2009. It was the successor of Harald Schmidt on the same network.
Music
The house band was led by Helmut Zerlett.
Helmut Zerlett – keyboards
Axel Heilhecker – guitars
Rosko Gee – bass
Antoine Fillon – drums
Jürgen Dahmen – piano
Thomas Heberer – trumpets
Mel Collins – saxophone
References
External links
German television talk shows
Das Erste original programming
Television shows set in Cologne
2007 German television series debuts
2009 German television series endings
German-language television shows | {
"redpajama_set_name": "RedPajamaWikipedia"
} | 5,288 | [
128000,
31224,
43401,
612,
393,
5059,
261,
574,
264,
6063,
3389,
45427,
3137,
1501,
21685,
389,
19537,
9939,
5455,
555,
63113,
5493,
5340,
4852,
52165,
323,
31346,
393,
5059,
261,
304,
279,
7950,
220,
605,
25,
1774,
9012,
892,
9633,
505,
220,
914,
6664,
220,
1049,
22,
311,
220,
845,
5936,
220,
1049,
24,
13,
1102,
574,
279,
34665,
315,
5340,
4852,
52165,
389,
279,
1890,
4009,
382,
25099,
720,
791,
3838,
7200,
574,
6197,
555,
16183,
7129,
1901,
261,
28163,
627,
16183,
7129,
1901,
261,
28163,
1389,
71402,
198,
87779,
1283,
321,
1249,
261,
1389,
60594,
198,
16870,
9509,
96697,
1389,
22253,
198,
91254,
22748,
263,
1389,
47389,
198,
622,
2448,
2026,
268,
76391,
5794,
1389,
27374,
198,
11355,
1283,
655,
261,
1389,
39155,
1441,
198,
11220
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
31224,
43401,
612,
393,
5059,
261,
574,
264,
6063,
3389,
45427,
3137,
1501,
21685,
389,
19537,
9939,
5455,
555,
63113,
5493,
5340,
4852,
52165,
323,
31346,
393,
5059,
261,
304,
279,
7950,
220,
605,
25,
1774,
9012,
892,
9633,
505,
220,
914,
6664,
220,
1049,
22,
311,
220,
845,
5936,
220,
1049,
24,
13,
1102,
574,
279,
34665,
315,
5340,
4852,
52165,
389,
279,
1890,
4009,
382,
25099,
720,
791,
3838,
7200,
574,
6197,
555,
16183,
7129,
1901,
261,
28163,
627,
16183,
7129,
1901,
261,
28163,
1389,
71402,
198,
87779,
1283,
321,
1249,
261,
1389,
60594,
198,
16870,
9509,
96697,
1389,
22253,
198,
91254,
22748,
263,
1389,
47389,
198,
622,
2448,
2026,
268,
76391,
5794,
1389,
27374,
198,
11355,
1283,
655,
261,
1389,
39155,
1441,
198,
11220,
-100
] |
The recent unveiling of Creative Sound showcases Amadeus' extraordinary expertise in architectural acoustic design. Located at the heart of the 15th Arrondissement in Paris, Creative Sound is one of the largest, most versatile full-service post-production facilities in France, providing creative solutions for all cinematic and TV sound needs. Paris-based Amadeus was tasked with all of the interior acoustical and architectural design, including sound isolation, noise and vibration control engineering, and acoustic treatments for each of the ten studios. At Creative Sound, Amadeus also designed one of the first mixing studios to be fitted with the revolutionary Dolby(r) Atmos(tm) audio technology, which hosts the first ultra-large-format Harrison MPC5 digital film-mixing console manufactured by Harrison – based in Nashville. | {
"redpajama_set_name": "RedPajamaC4"
} | 4,767 | [
128000,
791,
3293,
92588,
315,
25248,
14936,
71849,
3383,
1037,
355,
6,
24674,
19248,
304,
43563,
45166,
2955,
13,
42867,
520,
279,
4851,
315,
279,
220,
868,
339,
18925,
2159,
50753,
304,
12366,
11,
25248,
14936,
374,
832,
315,
279,
7928,
11,
1455,
33045,
2539,
24358,
1772,
70666,
13077,
304,
9822,
11,
8405,
11782,
10105,
369,
682,
65765,
323,
6007,
5222,
3966,
13,
12366,
6108,
3383,
1037,
355,
574,
51920,
449,
682,
315,
279,
15135,
1645,
26169,
950,
323,
43563,
2955,
11,
2737,
5222,
31398,
11,
12248,
323,
48913,
2585,
15009,
11,
323,
45166,
22972,
369,
1855,
315,
279,
5899,
42795,
13,
2468,
25248,
14936,
11,
3383,
1037,
355,
1101,
6319,
832,
315,
279,
1176,
27890,
42795,
311,
387,
29441,
449,
279,
30191,
25227,
1729,
2666,
8,
54928
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
791,
3293,
92588,
315,
25248,
14936,
71849,
3383,
1037,
355,
6,
24674,
19248,
304,
43563,
45166,
2955,
13,
42867,
520,
279,
4851,
315,
279,
220,
868,
339,
18925,
2159,
50753,
304,
12366,
11,
25248,
14936,
374,
832,
315,
279,
7928,
11,
1455,
33045,
2539,
24358,
1772,
70666,
13077,
304,
9822,
11,
8405,
11782,
10105,
369,
682,
65765,
323,
6007,
5222,
3966,
13,
12366,
6108,
3383,
1037,
355,
574,
51920,
449,
682,
315,
279,
15135,
1645,
26169,
950,
323,
43563,
2955,
11,
2737,
5222,
31398,
11,
12248,
323,
48913,
2585,
15009,
11,
323,
45166,
22972,
369,
1855,
315,
279,
5899,
42795,
13,
2468,
25248,
14936,
11,
3383,
1037,
355,
1101,
6319,
832,
315,
279,
1176,
27890,
42795,
311,
387,
29441,
449,
279,
30191,
25227,
1729,
2666,
8,
54928,
-100
] |
Student visas provide legal means for foreign nationals to study in the U.S. There are two student categories. The student that wishes to pursue academic studies, and/or language programs (F-1), and the student who wishes to pursue nonacademic or vocational studies (M-1)." Read Current News - Recent H-1B Visa Cap-Gap and OPT Developments F-1 STEM Extensions 17 Month"
May 2006-DOS issues new guidelines to U.S. consulates on student visa processing. | {
"redpajama_set_name": "RedPajamaC4"
} | 6,485 | [
128000,
14428,
56777,
3493,
5897,
3445,
369,
7362,
57011,
311,
4007,
304,
279,
549,
815,
13,
2684,
527,
1403,
5575,
11306,
13,
578,
5575,
430,
25223,
311,
23564,
14584,
7978,
11,
323,
5255,
4221,
7620,
320,
37,
12,
16,
705,
323,
279,
5575,
889,
25223,
311,
23564,
2536,
91356,
477,
89486,
7978,
320,
44,
12,
16,
41418,
4557,
9303,
5513,
482,
35390,
473,
12,
16,
33,
44434,
8171,
12279,
391,
323,
41134,
8000,
1392,
435,
12,
16,
64182,
56895,
220,
1114,
19961,
702,
11356,
220,
1049,
21,
9607,
3204,
4819,
502,
17959,
311,
549,
815,
13,
1615,
24031,
389,
5575,
27753,
8863,
13,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
14428,
56777,
3493,
5897,
3445,
369,
7362,
57011,
311,
4007,
304,
279,
549,
815,
13,
2684,
527,
1403,
5575,
11306,
13,
578,
5575,
430,
25223,
311,
23564,
14584,
7978,
11,
323,
5255,
4221,
7620,
320,
37,
12,
16,
705,
323,
279,
5575,
889,
25223,
311,
23564,
2536,
91356,
477,
89486,
7978,
320,
44,
12,
16,
41418,
4557,
9303,
5513,
482,
35390,
473,
12,
16,
33,
44434,
8171,
12279,
391,
323,
41134,
8000,
1392,
435,
12,
16,
64182,
56895,
220,
1114,
19961,
702,
11356,
220,
1049,
21,
9607,
3204,
4819,
502,
17959,
311,
549,
815,
13,
1615,
24031,
389,
5575,
27753,
8863,
13,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
GOODYEAR REPORTS FIRST QUARTER 2021 RESULTS
– First quarter Goodyear net income of $12 million; adjusted net income of $102 million
– First quarter segment operating income of $226 million, strongest first quarter since 2018
– Global consumer replacement volume significantly exceeded industry, driven by large-rim diameter segment
· Record first quarter consumer replacement volume in Asia Pacific
– Americas, EMEA consumer OE volumes outpaced market
– First quarter revenue per tire up 3%, excluding foreign currency
AKRON, Ohio, April 30, 2021 – The Goodyear Tire & Rubber Company today reported results for the first quarter of 2021.
"We delivered impressive segment operating income, which was significantly above first quarter 2020 results and also nearly 20 percent higher than first quarter 2019 despite sales volumes not yet having fully recovered to pre-COVID levels," said Richard J. Kramer, chairman, chief executive officer and president. "We achieved these results despite the impact of a severe winter storm in the U.S. and industry supply chain challenges during the quarter.
"Our consumer replacement business delivered outstanding results. By leveraging improved distribution and new products, we outperformed the industry while expanding margins. At the same time, we also continued to build our OE business, where we are benefiting from our leading technical capabilities and emerging mobility trends," continued Kramer.
"I'd like to acknowledge and thank all of our associates for continuing to manage through personal and professional challenges to deliver for our customers and communities," added Kramer.
Goodyear's first quarter 2021 sales were $3.5 billion, up 15% from a year ago. The increase was driven by higher volume, improvements in price/mix and favorable foreign currency translation.
Tire unit volumes totaled 35.0 million, up 12% from the prior year's period. The impact of the COVID-19 pandemic on industry demand moderated relative to the prior year. Replacement tire volume increased 14%, reflecting both continuing industry recovery and market share gains. Original equipment unit volume increased 5%, driven by higher vehicle production in Asia Pacific and increased market share in EMEA.
Goodyear's first quarter 2021 net income was $12 million (5 cents per share) compared to a net loss of $619 million ($2.65 per share) a year ago. The 2021 period included several significant items, including, on a pre-tax basis, rationalization charges of $50 million primarily associated with a plan to reduce selling, administrative and general expense in EMEA and the modernization of two manufacturing facilities in Germany, and a negative impact of $23 million related to a severe winter storm in the U.S. Goodyear's first quarter 2020 net loss included a charge of $295 million related to a valuation allowance on certain deferred tax assets for foreign tax credits and, on a pre-tax basis, a non-cash impairment charge of $182 million to reduce the carrying value of goodwill in its EMEA business unit.
First quarter 2021 adjusted net income was $102 million (43 cents per share) compared to an adjusted net loss of $140 million (60 cents per share) in 2020. Per share amounts are diluted.
The company reported segment operating income of $226 million in the first quarter of 2021, up $273 million from a year ago. The increase primarily reflects the impacts of higher volume, including increased factory utilization, improvements in price/mix, the benefits of cost saving actions, including ongoing rationalization plans, and lower raw material costs.
Reconciliation of Non-GAAP Financial Measures
See the note at the end of this release for further explanation and reconciliation tables for Segment Operating Income (Loss) and Margin; Adjusted Net Income (Loss); and Adjusted Diluted Earnings (Loss) per Share, reflecting the impact of certain significant items on the 2021 and 2020 periods.
Business Segment Results
(in millions) 2021 2020
Tire Units 15.5 14.5
Net Sales $1,787 $1,673
Segment Operating Income 114 --
Segment Operating Margin 6.4% --
Americas' first quarter 2021 sales of $1.8 billion were 7% higher than in 2020, driven by higher volume and improvements in price/mix. These factors were partially offset by unfavorable foreign currency translation. Tire unit volume increased 7%. Replacement tire volume increased 11%, reflecting stronger industry demand and U.S. consumer and commercial replacement market share gains. Original equipment unit volume decreased 6%, reflecting lower industry demand, partially offset by consumer share gains in Latin America.
First quarter 2021 segment operating income was $114 million compared to breakeven in the prior year's quarter. The increase was driven by improvements in price/mix, the impacts of higher volume, including increased factory utilization, and the benefits of cost saving actions, including ongoing rationalization plans. These factors were partially offset by higher raw material costs. We estimate a severe winter storm in the U.S. negatively impacted segment operating income by approximately $17 million.
Net Sales $1,231 $995
Segment Operating Income (Loss) 74 (53)
Segment Operating Margin 6.0% (5.3)%
Europe, Middle East and Africa's first quarter 2021 sales increased 24% from last year to $1.2 billion due to higher volume, improvements in price/mix and favorable foreign currency translation. Tire unit volume increased 10%. Replacement tire volume rose 11%, reflecting stronger industry demand and consumer and commercial replacement market share gains. Original equipment unit volume increased 6%, reflecting significant share gains driven by new consumer fitments and the addition of new fleet customers.
First quarter 2021 segment operating income of $74 million was up $127 million from the prior year's quarter, driven by the impacts of higher volume, including increased factory utilization, improvements in price/mix and lower raw material costs.
Tire Units 6.8 5.2
Net Sales $493 $388
Segment Operating Income 38 6
Segment Operating Margin 7.7% 1.5%
Asia Pacific's first quarter 2021 sales increased 27% to $493 million, driven by higher volume and favorable foreign currency translation. Tire unit volume increased 29%. Replacement tire volume increased 31%, reflecting a record first quarter performance. Original equipment unit volume increased 26%, driven by a recovery in vehicle production in China.
First quarter 2021 segment operating income of $38 million was up $32 million from the prior year's quarter. The increase was driven by the impacts of higher volume, including improved factory utilization.
Goodyear will hold an investor conference call at 9 a.m. EDT today. Prior to the commencement of the call, the company will post the financial and other related information that will be presented on its investor relations website: http://investor.goodyear.com.
Participating in the conference call will be Richard J. Kramer, chairman, chief executive officer and president; Darren R. Wells, executive vice president and chief financial officer; and Christina L. Zamarro, vice president, finance and treasurer.
Investors, members of the media and other interested persons can access the conference call on the website or via telephone by calling either (800) 895-3361 or (785) 424-1062 before 8:55 a.m. EDT and providing the Conference ID "Goodyear." A taped replay will be available by calling (800) 839-6964 or (402) 220-6060. The replay will also remain available on the website.
About Goodyear
Goodyear is one of the world's largest tire companies. It employs about 62,000 people and manufactures its products in 46 facilities in 21 countries around the world. Its two Innovation Centers in Akron, Ohio, and Colmar-Berg, Luxembourg, strive to develop state-of-the-art products and services that set the technology and performance standard for the industry. For more information about Goodyear and its products, go to www.goodyear.com/corporate. GT-FN
Certain information contained in this press release constitutes forward-looking statements for purposes of the safe harbor provisions of The Private Securities Litigation Reform Act of 1995. There are a variety of factors, many of which are beyond our control, that affect our operations, performance, business strategy and results and could cause our actual results and experience to differ materially from the assumptions, expectations and objectives expressed in any forward-looking statements. These factors include, but are not limited to: the impact on us of the COVID-19 pandemic; our success in completing our pending acquisition of Cooper Tire & Rubber Company and our ability to achieve the expected benefits of such acquisition; our ability to implement successfully our strategic initiatives; actions and initiatives taken by both current and potential competitors; increases in the prices paid for raw materials and energy; a labor strike, work stoppage or other similar event; foreign currency translation and transaction risks; deteriorating economic conditions or an inability to access capital markets; work stoppages, financial difficulties or supply disruptions at our suppliers or customers; the adequacy of our capital expenditures; our failure to comply with a material covenant in our debt obligations; potential adverse consequences of litigation involving the company; as well as the effects of more general factors such as changes in general market, economic or political conditions or in legislation, regulation or public policy. Additional factors are discussed in our filings with the Securities and Exchange Commission, including our annual report on Form 10-K, quarterly reports on Form 10-Q and current reports on Form 8-K. In addition, any forward-looking statements represent our estimates only as of today and should not be relied upon as representing our estimates as of any subsequent date. While we may elect to update forward-looking statements at some point in the future, we specifically disclaim any obligation to do so, even if our estimates change.
Download the Financial Statements | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 9,587 | [
128000,
15881,
21727,
21176,
45176,
50,
35913,
27090,
3065,
643,
220,
2366,
16,
54128,
198,
4235,
5629,
8502,
6122,
1094,
686,
4272,
8070,
315,
400,
717,
3610,
26,
24257,
4272,
8070,
315,
400,
4278,
3610,
198,
4235,
5629,
8502,
10449,
10565,
8070,
315,
400,
14057,
3610,
11,
31005,
1176,
8502,
2533,
220,
679,
23,
198,
4235,
8121,
11761,
14039,
8286,
12207,
34908,
5064,
11,
16625,
555,
3544,
3880,
318,
23899,
10449,
198,
14260,
13896,
1176,
8502,
11761,
14039,
8286,
304,
13936,
16867,
198,
4235,
52248,
11,
469,
91467,
11761,
56630,
27378,
704,
69652,
3157,
198,
4235,
5629,
8502,
13254,
824,
28387,
709,
220,
18,
13689,
44878,
7362,
11667,
198,
12173,
42814,
11,
14689,
11,
5936,
220,
966,
11,
220,
2366,
16,
1389,
578,
6122,
1094,
686,
68955,
612
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
15881,
21727,
21176,
45176,
50,
35913,
27090,
3065,
643,
220,
2366,
16,
54128,
198,
4235,
5629,
8502,
6122,
1094,
686,
4272,
8070,
315,
400,
717,
3610,
26,
24257,
4272,
8070,
315,
400,
4278,
3610,
198,
4235,
5629,
8502,
10449,
10565,
8070,
315,
400,
14057,
3610,
11,
31005,
1176,
8502,
2533,
220,
679,
23,
198,
4235,
8121,
11761,
14039,
8286,
12207,
34908,
5064,
11,
16625,
555,
3544,
3880,
318,
23899,
10449,
198,
14260,
13896,
1176,
8502,
11761,
14039,
8286,
304,
13936,
16867,
198,
4235,
52248,
11,
469,
91467,
11761,
56630,
27378,
704,
69652,
3157,
198,
4235,
5629,
8502,
13254,
824,
28387,
709,
220,
18,
13689,
44878,
7362,
11667,
198,
12173,
42814,
11,
14689,
11,
5936,
220,
966,
11,
220,
2366,
16,
1389,
578,
6122,
1094,
686,
68955,
612,
-100
] |
Anywayanyday offers a convenient search for flights to Falkland Islands and helps you choose a flight, book tickets for a fitting date. It is easier now to book economy, business and first class air tickets with Anywayanyday.
Anywayanyday offers a convenient search for flights to Falkland Islands: we help find a flight and book a ticket for a chosen date.
Anywayanyday.com allows to book and buy cheaper air tickets to Falkland Islands: Anywayanyday engine compares flight options from 800 air lines and finds the cheapest air tickets to Falkland Islands.
Prepare for your stay in Falkland Islands before buying a ticket. Falkland Islands is a fascinating country, learn more about it.
Prepare for your departure from the capital of Falkland Islands: Learn about the local weather – look for the weather widget above, to the left from the map.
Direct flight is the most convenient way of travelling to Falkland Islands. More on air carriers that offer flights to this country you find lower in the corresponding section.
In case it is for some reason impossible to buy a ticket for a direct flight to Falkland Islands, there is always a second option – connecting flights to Falkland Islands.
Try to buy air tickets to Falkland Islands in advance to be able to find the optimal solution – by price, transfers and other parameters.
After you have bought an air ticket to Falkland Islands, find yourself a nice hotel option there on anywayanyday.com: look for hotels by stars, location, services offered, TripAdvisor rating, accommodation type, payment method and other parameters.
Plan your itinerary very carefully, before looking for air tickets to Falkland Islands.
Many airlines have regular special offers for cheaper flights to Falkland Islands. Follow such special offers in our social networks. Besides, we often inform you about such sales and special fares in our weekly emails.
Second, traveling experience of Anywayanyday clients shows that it is not the direct flights to Falkland Islands that are cheapest, but the connecting flights.
Six, do not forget – air fares to Falkland Islands vary significantly depending on the date, so always check the fares for at least several neighbouring dates. Thus, you might come across an air ticket that is significantly cheaper.
The fare to Falkland Islands may depend not only the departure/arrival date and time, but also on the carrier. Compare prices from various carriers that offer flights to Falkland Islands and choose the one you like most.
For certain destinations, it is possible to exchange air tickets on Anywayanyday without involving the support service – such ticket is marked "Online exchange". If you see on your ticket to Falkland Islands such mark, it means that you can exchange your ticket very promptly.
Naturally you can find and buy air tickets to Falkland Islands not only on anywayanyday.com, but also with our mobile apps – for iOS, Android and Windows Phone 8. Mobile apps offer to exchange or refund tickets and many other features: insurance policies, Aeroexpress train tickets, etc. | {
"redpajama_set_name": "RedPajamaC4"
} | 6,887 | [
128000,
49388,
3852,
1316,
6209,
264,
17125,
2778,
369,
25952,
311,
72564,
1974,
23028,
323,
8779,
499,
5268,
264,
11213,
11,
2363,
14741,
369,
264,
27442,
2457,
13,
1102,
374,
8831,
1457,
311,
2363,
8752,
11,
2626,
323,
1176,
538,
3805,
14741,
449,
42669,
3852,
1316,
627,
49388,
3852,
1316,
6209,
264,
17125,
2778,
369,
25952,
311,
72564,
1974,
23028,
25,
584,
1520,
1505,
264,
11213,
323,
2363,
264,
11989,
369,
264,
12146,
2457,
627,
49388,
3852,
1316,
916,
6276,
311,
2363,
323,
3780,
23917,
3805,
14741,
311,
72564,
1974,
23028,
25,
42669,
3852,
1316,
4817,
43565,
11213,
2671,
505,
220,
4728,
3805,
5238,
323,
14035,
279,
43149,
3805,
14741,
311,
72564,
1974,
23028,
627,
51690,
369,
701,
4822,
304,
72564,
1974,
23028,
1603,
12096,
264,
11989,
13
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
49388,
3852,
1316,
6209,
264,
17125,
2778,
369,
25952,
311,
72564,
1974,
23028,
323,
8779,
499,
5268,
264,
11213,
11,
2363,
14741,
369,
264,
27442,
2457,
13,
1102,
374,
8831,
1457,
311,
2363,
8752,
11,
2626,
323,
1176,
538,
3805,
14741,
449,
42669,
3852,
1316,
627,
49388,
3852,
1316,
6209,
264,
17125,
2778,
369,
25952,
311,
72564,
1974,
23028,
25,
584,
1520,
1505,
264,
11213,
323,
2363,
264,
11989,
369,
264,
12146,
2457,
627,
49388,
3852,
1316,
916,
6276,
311,
2363,
323,
3780,
23917,
3805,
14741,
311,
72564,
1974,
23028,
25,
42669,
3852,
1316,
4817,
43565,
11213,
2671,
505,
220,
4728,
3805,
5238,
323,
14035,
279,
43149,
3805,
14741,
311,
72564,
1974,
23028,
627,
51690,
369,
701,
4822,
304,
72564,
1974,
23028,
1603,
12096,
264,
11989,
13,
-100
] |
June 28, 2019 / 7:01 PM / 17 days ago
UPDATE 1-Four trade houses buy record-large raw sugar delivery -traders
(Adds details of delivery, value, origins, comments)
NEW YORK, June 28 (Reuters) - Sucres et Denrees (Sucden), Alvean, ED&F Man, and Louis Dreyfus Company scooped up the delivery of the July raw sugar against ICE Futures U.S. contract that expired on Friday in the largest delivery on record, traders said.
The delivery against the July raw sugar contract on ICE Futures U.S. totaled about 41,500 lots, about 2.1 million tonnes of raw sugar, three traders told Reuters.
The sugar is worth over $570 million based on Friday's closing price of 12.32 cents per lb. July futures closed at a 0.3-cent discount to the October contract. SBN9-V9
Spokesmen for the firms could not immediately be reached for comment. The exchange was due to publish the official data on the delivery on Monday.
This would be the largest delivery on record for any month, according to ICE. The previous record-holder was the delivery against the May 2015 contract, which totaled 37,611 lots.
Origins of the sugar were expected to include Brazil and Central America.
Wilmar International Ltd and Cofco International, the trading arm of Chinese state-owned food group COFCO were seen as the largest deliverers and origins of the sugar were said to include Brazil and Central America, the traders said. The firms could not immediately be reached for comment.
"The thing that bothers me about this delivery is that it's the two of the biggest players in Asia (Wilmar and Cofco) - that's telling you demand in Asia" may be sluggish, one of the traders said. (Reporting by Ayenat Mersie Editing by Marguerita Choy) | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 4,518 | [
128000,
28259,
220,
1591,
11,
220,
679,
24,
611,
220,
22,
25,
1721,
5975,
611,
220,
1114,
2919,
4227,
198,
9422,
220,
16,
7424,
414,
6696,
15316,
3780,
3335,
40248,
7257,
13465,
9889,
482,
376,
6527,
198,
7,
73211,
3649,
315,
9889,
11,
907,
11,
33472,
11,
6170,
340,
21242,
47404,
11,
5651,
220,
1591,
320,
36978,
8,
482,
68990,
417,
1880,
9973,
8016,
320,
54316,
5294,
705,
1708,
588,
276,
11,
16421,
5,
37,
2418,
11,
323,
12140,
423,
8233,
69,
355,
8351,
25661,
16771,
709,
279,
9889,
315,
279,
5887,
7257,
13465,
2403,
41663,
77367,
549,
815,
13,
5226,
430,
27489,
389,
6740,
304,
279,
7928,
9889,
389,
3335,
11,
35687,
1071,
627,
791,
9889,
2403,
279,
5887,
7257,
13465,
5226,
389,
41663,
77367,
549,
815
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
28259,
220,
1591,
11,
220,
679,
24,
611,
220,
22,
25,
1721,
5975,
611,
220,
1114,
2919,
4227,
198,
9422,
220,
16,
7424,
414,
6696,
15316,
3780,
3335,
40248,
7257,
13465,
9889,
482,
376,
6527,
198,
7,
73211,
3649,
315,
9889,
11,
907,
11,
33472,
11,
6170,
340,
21242,
47404,
11,
5651,
220,
1591,
320,
36978,
8,
482,
68990,
417,
1880,
9973,
8016,
320,
54316,
5294,
705,
1708,
588,
276,
11,
16421,
5,
37,
2418,
11,
323,
12140,
423,
8233,
69,
355,
8351,
25661,
16771,
709,
279,
9889,
315,
279,
5887,
7257,
13465,
2403,
41663,
77367,
549,
815,
13,
5226,
430,
27489,
389,
6740,
304,
279,
7928,
9889,
389,
3335,
11,
35687,
1071,
627,
791,
9889,
2403,
279,
5887,
7257,
13465,
5226,
389,
41663,
77367,
549,
815,
-100
] |
Head of the Parisian Architecture firm Mésarchitecture, with Pascal Mazoyer, since 2001, Didier Faustino builds collaborative spaces for reflection at the frontier of architecture, installation, and performance. Defining three possible typologies of Tomorrow's shelter, Didier Faustino's project scripts possible scenarios following a catastrophe due to global warming and the rise of sea waters, which transform the landscape as much as our society. In-between paranoia and a hope for alternative solutions, the architect offers three modules each composed of two parts: solid volumes of concert corresponding to individual living spaces, with large metal platforms hung between or around them as dedicated public spaces. This configuration contrasts the image of a hyperprotective bunker with bare trusses above the ground, expressing how an architectural form can adapt to a mutating environment: as the water rises only the platforms will emerge while the inferior elements will remain submerged. This project embodies the vision of an architect facing a world, which from now on can only think of itself in terms of communal strength: the metaphor here being us coming together above the water in order to survive.
More information on FRAC Centre-Val de Loire's website. | {
"redpajama_set_name": "RedPajamaC4"
} | 3,860 | [
128000,
12626,
315,
279,
12366,
1122,
38943,
7626,
386,
5512,
81519,
11,
449,
58459,
40091,
42219,
11,
2533,
220,
1049,
16,
11,
14910,
1291,
18145,
592,
3394,
22890,
40806,
12908,
369,
22599,
520,
279,
49100,
315,
18112,
11,
14028,
11,
323,
5178,
13,
3979,
5859,
2380,
3284,
3666,
9268,
315,
56096,
596,
23756,
11,
14910,
1291,
18145,
592,
3394,
596,
2447,
20070,
3284,
26350,
2768,
264,
65396,
4245,
311,
3728,
24808,
323,
279,
10205,
315,
9581,
21160,
11,
902,
5276,
279,
18921,
439,
1790,
439,
1057,
8396,
13,
763,
27049,
83544,
323,
264,
3987,
369,
10778,
10105,
11,
279,
11726,
6209,
2380,
13761,
1855,
24306,
315,
1403,
5596,
25,
6573,
27378,
315,
21497,
12435,
311,
3927,
5496,
12908,
11,
449,
3544,
9501,
15771,
18799,
1990,
477,
2212,
1124
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
12626,
315,
279,
12366,
1122,
38943,
7626,
386,
5512,
81519,
11,
449,
58459,
40091,
42219,
11,
2533,
220,
1049,
16,
11,
14910,
1291,
18145,
592,
3394,
22890,
40806,
12908,
369,
22599,
520,
279,
49100,
315,
18112,
11,
14028,
11,
323,
5178,
13,
3979,
5859,
2380,
3284,
3666,
9268,
315,
56096,
596,
23756,
11,
14910,
1291,
18145,
592,
3394,
596,
2447,
20070,
3284,
26350,
2768,
264,
65396,
4245,
311,
3728,
24808,
323,
279,
10205,
315,
9581,
21160,
11,
902,
5276,
279,
18921,
439,
1790,
439,
1057,
8396,
13,
763,
27049,
83544,
323,
264,
3987,
369,
10778,
10105,
11,
279,
11726,
6209,
2380,
13761,
1855,
24306,
315,
1403,
5596,
25,
6573,
27378,
315,
21497,
12435,
311,
3927,
5496,
12908,
11,
449,
3544,
9501,
15771,
18799,
1990,
477,
2212,
1124,
-100
] |
The last two days have been spent buying materials for some of the assemblies, schools and hospitals that we will visit in the coming weeks. We have also been printing and binding hundreds of text books for schools and handouts for the upcoming conferences.
I have been working with Andre each day who I got to know last year. He works full time with Murray Stevenson as a driver and practical worker. He is one of two drivers who take medical and educational supplies throughout the province. He took me to visit his house and meet his family today.
I also spent time with a brother called Kakudji who is involved in literature work in Lubumbashi. He was glad to receive gospel tracts for distribution and it was helpful for me to get a feel for what work is being done in the city and to hear about the difficulties faced with literature work here.
This is Andre, his wife and one of his 7 children.
The premises used for their literature work. | {
"redpajama_set_name": "RedPajamaC4"
} | 3,094 | [
128000,
791,
1566,
1403,
2919,
617,
1027,
7543,
12096,
7384,
369,
1063,
315,
279,
62407,
11,
8853,
323,
24461,
430,
584,
690,
4034,
304,
279,
5108,
5672,
13,
1226,
617,
1101,
1027,
18991,
323,
11212,
11758,
315,
1495,
6603,
369,
8853,
323,
1450,
11934,
369,
279,
14827,
38614,
627,
40,
617,
1027,
3318,
449,
27525,
1855,
1938,
889,
358,
2751,
311,
1440,
1566,
1060,
13,
1283,
4375,
2539,
892,
449,
28253,
83048,
439,
264,
5696,
323,
15325,
12128,
13,
1283,
374,
832,
315,
1403,
12050,
889,
1935,
6593,
323,
16627,
17135,
6957,
279,
17271,
13,
1283,
3952,
757,
311,
4034,
813,
3838,
323,
3449,
813,
3070,
3432,
627,
40,
1101,
7543,
892,
449,
264,
10868,
2663,
75571,
664,
7910,
889,
374,
6532,
304,
17649,
990,
304,
58751,
3635
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
791,
1566,
1403,
2919,
617,
1027,
7543,
12096,
7384,
369,
1063,
315,
279,
62407,
11,
8853,
323,
24461,
430,
584,
690,
4034,
304,
279,
5108,
5672,
13,
1226,
617,
1101,
1027,
18991,
323,
11212,
11758,
315,
1495,
6603,
369,
8853,
323,
1450,
11934,
369,
279,
14827,
38614,
627,
40,
617,
1027,
3318,
449,
27525,
1855,
1938,
889,
358,
2751,
311,
1440,
1566,
1060,
13,
1283,
4375,
2539,
892,
449,
28253,
83048,
439,
264,
5696,
323,
15325,
12128,
13,
1283,
374,
832,
315,
1403,
12050,
889,
1935,
6593,
323,
16627,
17135,
6957,
279,
17271,
13,
1283,
3952,
757,
311,
4034,
813,
3838,
323,
3449,
813,
3070,
3432,
627,
40,
1101,
7543,
892,
449,
264,
10868,
2663,
75571,
664,
7910,
889,
374,
6532,
304,
17649,
990,
304,
58751,
3635,
-100
] |
This is a placeholder page for Taylor Me, which means this person is not currently on this site. We do suggest using the tools below to find Taylor Me.
You are visiting the placeholder page for Taylor Me. This page is here because someone used our placeholder utility to look for Taylor Me. We created this page automatically in hopes Taylor Me would find it. If you are not Taylor Me, but are an alumni of Mission Hills High School, register on this site for free now. | {
"redpajama_set_name": "RedPajamaC4"
} | 3,574 | [
128000,
2028,
374,
264,
6002,
2199,
369,
16844,
2206,
11,
902,
3445,
420,
1732,
374,
539,
5131,
389,
420,
2816,
13,
1226,
656,
4284,
1701,
279,
7526,
3770,
311,
1505,
16844,
2206,
627,
2675,
527,
17136,
279,
6002,
2199,
369,
16844,
2206,
13,
1115,
2199,
374,
1618,
1606,
4423,
1511,
1057,
6002,
15919,
311,
1427,
369,
16844,
2206,
13,
1226,
3549,
420,
2199,
9651,
304,
16388,
16844,
2206,
1053,
1505,
433,
13,
1442,
499,
527,
539,
16844,
2206,
11,
719,
527,
459,
52121,
315,
24098,
25964,
5234,
6150,
11,
4254,
389,
420,
2816,
369,
1949,
1457,
13,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
2028,
374,
264,
6002,
2199,
369,
16844,
2206,
11,
902,
3445,
420,
1732,
374,
539,
5131,
389,
420,
2816,
13,
1226,
656,
4284,
1701,
279,
7526,
3770,
311,
1505,
16844,
2206,
627,
2675,
527,
17136,
279,
6002,
2199,
369,
16844,
2206,
13,
1115,
2199,
374,
1618,
1606,
4423,
1511,
1057,
6002,
15919,
311,
1427,
369,
16844,
2206,
13,
1226,
3549,
420,
2199,
9651,
304,
16388,
16844,
2206,
1053,
1505,
433,
13,
1442,
499,
527,
539,
16844,
2206,
11,
719,
527,
459,
52121,
315,
24098,
25964,
5234,
6150,
11,
4254,
389,
420,
2816,
369,
1949,
1457,
13,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
Home News Ethiopia: At least 17 killed over Sidama autonomy
Ethiopia: At least 17 killed over Sidama autonomy
Mumbere Peter
At least 17 people have been killed in clashes between Ethiopian security forces and activists seeking a new autonomous region for their Sidama ethnic group, according to a local official and hospital authorities.
A local district official told Reuters on Saturday that at least 13 people were killed in a town near Hawassa city, 275 kms from the capital Addis Ababa, while hospital authorities said on Friday that four protesters had died of gunshot wounds in the city itself.
Emboldened by political reforms introduced by Prime Minister Abiy Ahmed since he took power in 2018, Sidama activists wanted to unilaterally declare a new regional state on Thursday.
While the threat of large-scale violence in Hawassa was largely averted after a Sidama opposition party agreed to delay the declaration and accept a government offer to hold a referendum in five months, not all Sidama people accepted the delay.
Ethiopia has nine ethnic-based regional states, which are overseen by the federal government in Addis Ababa but have autonomy over revenues and security forces.
The Sidama threat to declare a new region posed a direct challenge to the authority of the federal government in the Horn of Africa country of 105 million people.
Confirming the 13 civilian deaths in Wotera Rassa, located about 27 km from Hawassa, Shubale Buta, head of the town's Malga district, said soldiers were travelling to calm the violence in a nearby town on Thursday.
"When they saw people gathered near the roads they thought they were there to create a problem and that is how the killings happened," he told Reuters via telephone.
A Malga resident told Sky News Africa late on Friday he had seen 14 bodies after a shooting.
"My house is near to a field where the people were gathered," he said. "I was told by people who were there that the military came to the town (on Thursday) and randomly opened fire on people who were gathered and discussing the referendum," he added, saying that he later went to the place where the shooting happened and counted the bodies.
Shubale said the town was "relatively calm" on Saturday.
The Sidama demanded a referendum a year ago on the question of a new regional state – a right enshrined by the constitution – and said they would declare their own region if the ballot was not held within the stipulated time.
The federal system in Africa's second most populous nation is designed to allow larger ethnic groups a measure of autonomy but smaller communities such as the Sidama say they have been sidelined and some are demanding their own regions.
Previous articleBritish Airways suspends flights to Cairo for seven days
Next articleLowry on brink of breakthrough British Open win
Xenophobia affects South African football
Avoid being target of criminals, Nigeria's Gov. Lalong to Corps members
Shun corruption, Nigeria's Gov. Lalong tells Corps members
Sex delays menopause, study finds
Ethiopian crash hub: CEO pledges to work with Boeing to make...
Nigerians keep soaring with bundle of talented footballers
Suspected jihadists kill 10 Malian soldiers
Afghan Taliban claim responsibility for deadly Kabul car bomb attack
US judge deals blow to Trump's border wall plans
Nigeria's Buhari will not get bloc votes from the north –... | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 9,334 | [
128000,
7778,
5513,
60457,
25,
2468,
3325,
220,
1114,
7577,
927,
34989,
3105,
51360,
198,
66490,
72,
30651,
25,
2468,
3325,
220,
1114,
7577,
927,
34989,
3105,
51360,
198,
44,
3635,
486,
11291,
198,
1688,
3325,
220,
1114,
1274,
617,
1027,
7577,
304,
52610,
1990,
96634,
4868,
8603,
323,
21572,
11125,
264,
502,
39293,
5654,
369,
872,
34989,
3105,
22277,
1912,
11,
4184,
311,
264,
2254,
4033,
323,
8952,
11527,
627,
32,
2254,
9474,
4033,
3309,
23688,
389,
7884,
430,
520,
3325,
220,
1032,
1274,
1051,
7577,
304,
264,
6424,
3221,
12897,
56692,
3363,
11,
220,
14417,
97777,
505,
279,
6864,
2758,
285,
3765,
12273,
11,
1418,
8952,
11527,
1071,
389,
6740,
430,
3116,
26827,
1047,
8636,
315,
74881,
34254,
304,
279,
3363,
5196,
627,
2321,
15168,
6901
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
7778,
5513,
60457,
25,
2468,
3325,
220,
1114,
7577,
927,
34989,
3105,
51360,
198,
66490,
72,
30651,
25,
2468,
3325,
220,
1114,
7577,
927,
34989,
3105,
51360,
198,
44,
3635,
486,
11291,
198,
1688,
3325,
220,
1114,
1274,
617,
1027,
7577,
304,
52610,
1990,
96634,
4868,
8603,
323,
21572,
11125,
264,
502,
39293,
5654,
369,
872,
34989,
3105,
22277,
1912,
11,
4184,
311,
264,
2254,
4033,
323,
8952,
11527,
627,
32,
2254,
9474,
4033,
3309,
23688,
389,
7884,
430,
520,
3325,
220,
1032,
1274,
1051,
7577,
304,
264,
6424,
3221,
12897,
56692,
3363,
11,
220,
14417,
97777,
505,
279,
6864,
2758,
285,
3765,
12273,
11,
1418,
8952,
11527,
1071,
389,
6740,
430,
3116,
26827,
1047,
8636,
315,
74881,
34254,
304,
279,
3363,
5196,
627,
2321,
15168,
6901,
-100
] |
Have you forgotten about your old 401(k) plan? Time to rescue it
By Donna Fuscaldo Donna Fuscaldo's Twitter profile
In this increasingly mobile world, people change jobs every 5 1/2 years or so, according to the Employee Benefit Research Institute, or EBRI. They leave the old job for any number of reasons: sick of the work or the long commute, terrorized by the boss or just plain looking for better pay.
A byproduct of this exodus is the forgotten, or stranded, 401(k) plan. Using numbers from EBRI, Retirement Clearinghouse estimates that about 10 million people with 401(k) plans change jobs every year, and roughly 25% of them leave money behind in their old plan.
"If you look across the entire industry, roughly 1 out of every 4 accounts that's sitting on a record-keeper's platform is a 'stranded' account," says Spencer Williams, president and CEO of Retirement Clearinghouse, a Charlotte, North Carolina-based provider of plan services for companies. "It's one of those issues that is perpetual."
Doing nothing with the plan not an option
How can savers maximize the returns for all these disparate retirement accounts?
"The longer you leave the 401(k) behind, the more the money is not working for you," says Lena Haas, a senior vice president at E-Trade Capital Management in New York City. "It's just sitting in old investment choices, which oftentimes no longer fit your profile."
To get a handle on forgotten 401(k) plans, some legwork is required. Begin by calling your former employers, who are the plan sponsors. Once you've located your accounts and know how much is in each one, it's time to come up with a strategy that makes sense for your unique situation and saving goals.
The last thing you want to do is cash out the money. If you do and you're under age 59 1/2, you'll be on tap for a 10% penalty on top of owing income taxes. And you'll lose the chance to earn returns on the money that's been withdrawn.
Consider a strategy that's right for you
Each strategy has its pros and cons. Sarah Walsh, vice president of retirement solutions at Fidelity Investments in Boston, says leaving the money where it is won't make sense for everyone. But for savers who like the plan's investment choices or the other services, leaving it there and checking on it periodically could make sense.
If your choices are limited or you no longer have access to the plan's tools, then a better option may be consolidating the account in your current employer's 401(k) plan, if the new plan allows this move and if you like the investment opportunities there.
Rolling it over directly into an IRA would make the most sense for people who want access to more investments than what the company plan can give them. "IRAs typically offer you access to a wider range of options," Walsh says.
Be mindful of fees
Regardless of what strategy you choose, check into the fees involved. You could get hit with hefty fees in a forgotten 401(k) or even in a new rollover IRA.
"If you are 30 years old and leave an account behind that had an average record-keeping fee of $70, that's about $7,000 you are paying in fees from age 30 to 65," says Williams of Retirement Clearinghouse. That assumes about a 5% compounded rate of return that you otherwise could have earned over 35 years on the funds used to pay the fee.
How to calculate required minimum distribution for IRA and 401(k)
Top 10 college towns in the US (for retirees)
How to know if you're ready to retire
Cash late husband's benefits?
Best cities for retirees
Best retirement cities
Hailing from New York, where she lives with her husband and two children, Donna has been a journalist for more than 15 years, covering a range of subjects from technology to the stock market. Starting out, Donna was a reporter for Dow Jones Newswires, where she reported on technology companies and their impact on investments and the economy. Donna has a knack for uncovering the true story and finding the news. She also was a special contributor to The Wall Street Journal, penning features on employment trends, how technology impacts our daily lives and many other subjects. After years with Dow Jones Newswires, Donna accepted a position as a senior reporter for Foxbusiness.com. She played an integral role in launching the website, covering breaking business news, personal finance and producing video content. She also wrote a weekly column focused on new, innovative technology. In addition to her reporting and editing duties, Donna played a key role in the technology coverage for the Fox Business cable channel. Following the birth of her first daughter, Donna embarked on a successful freelancing career that is still going strong. Currently, she is a columnist for Foxbusiness.com, reporting on personal finance, small business and real estate topics. She also pens a weekly employment blog for Glassdoor and is a regular contributor to Bankrate.com.
2 reasons to stop putting off a 401(k) rollover after switching jobs
Leave 401(k) or roll it over?
6 reasons not to roll over your 401(k) | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 7,204 | [
128000,
12389,
499,
25565,
922,
701,
2362,
220,
10841,
6097,
8,
3197,
30,
4212,
311,
17629,
433,
198,
1383,
47863,
94400,
5531,
3055,
47863,
94400,
5531,
3055,
596,
6405,
5643,
198,
644,
420,
15098,
6505,
1917,
11,
1274,
2349,
7032,
1475,
220,
20,
220,
16,
14,
17,
1667,
477,
779,
11,
4184,
311,
279,
17275,
67450,
8483,
10181,
11,
477,
50242,
4403,
13,
2435,
5387,
279,
2362,
2683,
369,
904,
1396,
315,
8125,
25,
14363,
315,
279,
990,
477,
279,
1317,
59263,
11,
8818,
1534,
555,
279,
13697,
477,
1120,
14733,
3411,
369,
2731,
2343,
627,
32,
555,
3107,
315,
420,
506,
50577,
374,
279,
25565,
11,
477,
63205,
11,
220,
10841,
6097,
8,
3197,
13,
12362,
5219,
505,
50242,
4403,
11,
70289,
12292,
287,
7830,
17989,
430
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
12389,
499,
25565,
922,
701,
2362,
220,
10841,
6097,
8,
3197,
30,
4212,
311,
17629,
433,
198,
1383,
47863,
94400,
5531,
3055,
47863,
94400,
5531,
3055,
596,
6405,
5643,
198,
644,
420,
15098,
6505,
1917,
11,
1274,
2349,
7032,
1475,
220,
20,
220,
16,
14,
17,
1667,
477,
779,
11,
4184,
311,
279,
17275,
67450,
8483,
10181,
11,
477,
50242,
4403,
13,
2435,
5387,
279,
2362,
2683,
369,
904,
1396,
315,
8125,
25,
14363,
315,
279,
990,
477,
279,
1317,
59263,
11,
8818,
1534,
555,
279,
13697,
477,
1120,
14733,
3411,
369,
2731,
2343,
627,
32,
555,
3107,
315,
420,
506,
50577,
374,
279,
25565,
11,
477,
63205,
11,
220,
10841,
6097,
8,
3197,
13,
12362,
5219,
505,
50242,
4403,
11,
70289,
12292,
287,
7830,
17989,
430,
-100
] |
A real-time procedure was executed on Jul 4 to perform a routine self-check of the Electrical Interface Assembly (EIA) Sequencer.
Chandra passed through the sixth and seventh (and final) eclipses of the season on Jul 1 and Jul 4 respectively, with nominal power and thermal performance. Real-time procedures were executed on Jul 4 to disable SCS-29 and to dump and clear the EPS glitch counters as post-eclipse season actions.
The schedule of targets for the next week is shown below and includes an observation of Jupiter coordinated with Juno, and an observation of MXB 1659-298, which is a follow-up to a Target of Opportunity accepted on Mar 17, 2017. | {
"redpajama_set_name": "RedPajamaC4"
} | 4,977 | [
128000,
32,
1972,
7394,
10537,
574,
16070,
389,
10263,
220,
19,
311,
2804,
264,
14348,
659,
16313,
315,
279,
45034,
20620,
12000,
320,
36,
5987,
8,
25848,
20099,
627,
1163,
24155,
5946,
1555,
279,
26084,
323,
31487,
320,
438,
1620,
8,
93534,
288,
315,
279,
3280,
389,
10263,
220,
16,
323,
10263,
220,
19,
15947,
11,
449,
47855,
2410,
323,
29487,
5178,
13,
8976,
7394,
16346,
1051,
16070,
389,
10263,
220,
19,
311,
11404,
328,
6546,
12,
1682,
323,
311,
10488,
323,
2867,
279,
41707,
62184,
32632,
439,
1772,
5773,
9661,
3280,
6299,
627,
791,
9899,
315,
11811,
369,
279,
1828,
2046,
374,
6982,
3770,
323,
5764,
459,
22695,
315,
50789,
47672,
449,
12044,
78,
11,
323,
459,
22695,
315,
28685,
33,
220,
10680,
24,
12,
17690,
11
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
32,
1972,
7394,
10537,
574,
16070,
389,
10263,
220,
19,
311,
2804,
264,
14348,
659,
16313,
315,
279,
45034,
20620,
12000,
320,
36,
5987,
8,
25848,
20099,
627,
1163,
24155,
5946,
1555,
279,
26084,
323,
31487,
320,
438,
1620,
8,
93534,
288,
315,
279,
3280,
389,
10263,
220,
16,
323,
10263,
220,
19,
15947,
11,
449,
47855,
2410,
323,
29487,
5178,
13,
8976,
7394,
16346,
1051,
16070,
389,
10263,
220,
19,
311,
11404,
328,
6546,
12,
1682,
323,
311,
10488,
323,
2867,
279,
41707,
62184,
32632,
439,
1772,
5773,
9661,
3280,
6299,
627,
791,
9899,
315,
11811,
369,
279,
1828,
2046,
374,
6982,
3770,
323,
5764,
459,
22695,
315,
50789,
47672,
449,
12044,
78,
11,
323,
459,
22695,
315,
28685,
33,
220,
10680,
24,
12,
17690,
11,
-100
] |
Q: How to send build artifacts over ssh using Jenkins pipeline I was using Freestyle project method for configuring jobs in Jenkins. I have used Publish Over SSH plugin to send war file to remote system. Now i moved to pipeline configuration. I would like to know how can i do the same in pipeline configuration. Can anyone tell how to write pipeline script for publish over ssh?
Any help would be greatly appreciated.
A: You can use the raw Unix command scp, as described there : Example syntax for SCP. scp is Unix utility for secure copy... over SSH, which is exactly what Publish Over SSH uses behind the scenes !
Example :
scp [email protected]:foobar.txt /some/local/directory
| {
"redpajama_set_name": "RedPajamaStackExchange"
} | 3,204 | [
128000,
48,
25,
2650,
311,
3708,
1977,
36136,
927,
30330,
1701,
45236,
15660,
358,
574,
1701,
7730,
38483,
2447,
1749,
369,
72883,
7032,
304,
45236,
13,
358,
617,
1511,
24403,
6193,
41563,
9183,
311,
3708,
4208,
1052,
311,
8870,
1887,
13,
4800,
602,
7882,
311,
15660,
6683,
13,
358,
1053,
1093,
311,
1440,
1268,
649,
602,
656,
279,
1890,
304,
15660,
6683,
13,
3053,
5606,
3371,
1268,
311,
3350,
15660,
5429,
369,
3498,
927,
30330,
5380,
8780,
1520,
1053,
387,
19407,
26893,
382,
32,
25,
1472,
649,
1005,
279,
7257,
48095,
3290,
70757,
11,
439,
7633,
1070,
551,
13688,
20047,
369,
49623,
13,
70757,
374,
48095,
15919,
369,
9966,
3048,
1131,
927,
41563,
11,
902,
374,
7041,
1148,
24403,
6193,
41563,
5829,
4920,
279,
16451,
59162,
13617,
6394
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
48,
25,
2650,
311,
3708,
1977,
36136,
927,
30330,
1701,
45236,
15660,
358,
574,
1701,
7730,
38483,
2447,
1749,
369,
72883,
7032,
304,
45236,
13,
358,
617,
1511,
24403,
6193,
41563,
9183,
311,
3708,
4208,
1052,
311,
8870,
1887,
13,
4800,
602,
7882,
311,
15660,
6683,
13,
358,
1053,
1093,
311,
1440,
1268,
649,
602,
656,
279,
1890,
304,
15660,
6683,
13,
3053,
5606,
3371,
1268,
311,
3350,
15660,
5429,
369,
3498,
927,
30330,
5380,
8780,
1520,
1053,
387,
19407,
26893,
382,
32,
25,
1472,
649,
1005,
279,
7257,
48095,
3290,
70757,
11,
439,
7633,
1070,
551,
13688,
20047,
369,
49623,
13,
70757,
374,
48095,
15919,
369,
9966,
3048,
1131,
927,
41563,
11,
902,
374,
7041,
1148,
24403,
6193,
41563,
5829,
4920,
279,
16451,
59162,
13617,
6394,
-100
] |
Regulatory, market and technological forces are bringing rapid and far-reaching change in the electricity and natural gas industries. This change is creating a need for improved equipment, software and services to aid in the generation, transmission, distribution, marketing, trading and consumption of electricity, natural gas and related energy services. Our GFI Energy Group, which executes the Power Opportunities investment strategy, seeks to make controlling equity investments in successful companies that are well positioned to meet those needs.
Our investment team is comprised of seasoned professionals within the energy sector who work closely with the executives of our portfolio companies to identify and pursue market opportunities, strengthen operations, recruit additional managers, approach key customers, and make complementary acquisitions, among other efforts to maximize shareholder value. We seek to invest in proven performers and market leaders, not start-up ventures or turnarounds.
"Our deep experience as investors, consultants, and direct participants in the electricity and natural gas industries gives us distinctive insight into emerging industry needs, as well as the capability to work with the management teams of our portfolio companies to create significant shareholder value resulting from those needs," says portfolio manager Ian Schapiro. "We believe our exclusive focus on these critical and rapidly changing industries gives us an advantage in our investing and provides meaningful value to our portfolio companies."
See a list of current and past portfolio companies where we exercised control.
See case studies of how we add value by working with companies to identify and pursue opportunities resulting from changes in the electricity and natural gas industries. | {
"redpajama_set_name": "RedPajamaC4"
} | 3,160 | [
128000,
3561,
38220,
11,
3157,
323,
30116,
8603,
527,
12967,
11295,
323,
3117,
87248,
2349,
304,
279,
18200,
323,
5933,
6962,
19647,
13,
1115,
2349,
374,
6968,
264,
1205,
369,
13241,
7241,
11,
3241,
323,
3600,
311,
12576,
304,
279,
9659,
11,
18874,
11,
8141,
11,
8661,
11,
11380,
323,
15652,
315,
18200,
11,
5933,
6962,
323,
5552,
4907,
3600,
13,
5751,
480,
19991,
12634,
5856,
11,
902,
52535,
279,
7572,
66885,
9341,
8446,
11,
26737,
311,
1304,
26991,
25452,
22538,
304,
6992,
5220,
430,
527,
1664,
35328,
311,
3449,
1884,
3966,
627,
8140,
9341,
2128,
374,
40056,
315,
52614,
15749,
2949,
279,
4907,
10706,
889,
990,
15499,
449,
279,
29509,
315,
1057,
20136,
5220,
311,
10765,
323,
23564,
3157,
10708,
11,
20259,
7677,
11,
20927,
5217,
20258
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
3561,
38220,
11,
3157,
323,
30116,
8603,
527,
12967,
11295,
323,
3117,
87248,
2349,
304,
279,
18200,
323,
5933,
6962,
19647,
13,
1115,
2349,
374,
6968,
264,
1205,
369,
13241,
7241,
11,
3241,
323,
3600,
311,
12576,
304,
279,
9659,
11,
18874,
11,
8141,
11,
8661,
11,
11380,
323,
15652,
315,
18200,
11,
5933,
6962,
323,
5552,
4907,
3600,
13,
5751,
480,
19991,
12634,
5856,
11,
902,
52535,
279,
7572,
66885,
9341,
8446,
11,
26737,
311,
1304,
26991,
25452,
22538,
304,
6992,
5220,
430,
527,
1664,
35328,
311,
3449,
1884,
3966,
627,
8140,
9341,
2128,
374,
40056,
315,
52614,
15749,
2949,
279,
4907,
10706,
889,
990,
15499,
449,
279,
29509,
315,
1057,
20136,
5220,
311,
10765,
323,
23564,
3157,
10708,
11,
20259,
7677,
11,
20927,
5217,
20258,
-100
] |
Bakary Sako's excellent strike with just over 20 minutes remaining looked to be sending Monday's FA Cup tie into a replay before Glenn Murray's late winner.
Sako's fifth goal of the season came on a night where he got the opportunity to start the game as Roy Hodgson was forced into a number of changes due to injuries but even though he got on the scoresheet it was to end with a disappointing exit from the competition.
"It was so frustrating to concede so late in the game with us doing so well to come back into the match with the lads working so hard so as you can imagine the dressing room is filled with a disappointed group of lads tonight.
"I scored a similar goal to the one I got tonight a few years ago, I am comfortable playing on my right foot so as soon as I saw the opportunity I took my chance and lucky for me it went into the net.
Even though the 29 year old had his own personal delight of the strike from 25 yards he was frustrated to be going out of the competition but knows that the emphasis for the second half of the season was always going to be on the league programme starting with the visit of Burnley on Saturday afternoon.
"Every time the gaffer plays me I am trying to do my best and that is exactly what I was looking to do tonight but from a team point of view it's frustrating because we did well second half and to end the night out of the FA Cup is hard to take.
"We are soon back to the league action so we need to recover well and get back on the training pitch and be ready for the weekend."
Just over 2000 Palace fans were at the game and once again the striker was delighted to have the chance to join the red and blue army in celebrating another goal to his name.
"I am getting along well with the Palace fans so it was nice to get the goal and get over with them and take the chance to celebrate again with our supporters."
Watch the post match interviews and highlights from the Brighton match now or if viewing on the App go to the Palace TV channel. | {
"redpajama_set_name": "RedPajamaC4"
} | 7,719 | [
128000,
33,
587,
661,
328,
29886,
596,
9250,
13471,
449,
1120,
927,
220,
508,
4520,
9861,
7111,
311,
387,
11889,
7159,
596,
15358,
11098,
18623,
1139,
264,
35585,
1603,
40208,
28253,
596,
3389,
13946,
627,
50,
29886,
596,
18172,
5915,
315,
279,
3280,
3782,
389,
264,
3814,
1405,
568,
2751,
279,
6776,
311,
1212,
279,
1847,
439,
11284,
83984,
942,
574,
9770,
1139,
264,
1396,
315,
4442,
4245,
311,
15319,
719,
1524,
3582,
568,
2751,
389,
279,
12483,
3759,
433,
574,
311,
842,
449,
264,
39223,
4974,
505,
279,
10937,
627,
12348,
574,
779,
35711,
311,
81660,
779,
3389,
304,
279,
1847,
449,
603,
3815,
779,
1664,
311,
2586,
1203,
1139,
279,
2489,
449,
279,
326,
7819,
3318,
779,
2653,
779,
439,
499,
649,
13085,
279,
32623,
3130
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
33,
587,
661,
328,
29886,
596,
9250,
13471,
449,
1120,
927,
220,
508,
4520,
9861,
7111,
311,
387,
11889,
7159,
596,
15358,
11098,
18623,
1139,
264,
35585,
1603,
40208,
28253,
596,
3389,
13946,
627,
50,
29886,
596,
18172,
5915,
315,
279,
3280,
3782,
389,
264,
3814,
1405,
568,
2751,
279,
6776,
311,
1212,
279,
1847,
439,
11284,
83984,
942,
574,
9770,
1139,
264,
1396,
315,
4442,
4245,
311,
15319,
719,
1524,
3582,
568,
2751,
389,
279,
12483,
3759,
433,
574,
311,
842,
449,
264,
39223,
4974,
505,
279,
10937,
627,
12348,
574,
779,
35711,
311,
81660,
779,
3389,
304,
279,
1847,
449,
603,
3815,
779,
1664,
311,
2586,
1203,
1139,
279,
2489,
449,
279,
326,
7819,
3318,
779,
2653,
779,
439,
499,
649,
13085,
279,
32623,
3130,
-100
] |
John Jontez Montes is a nationally known singer, who recently appeared on NBC's Sing Off with an a capella group called Ten in the 2013-14 season. He is a presenter, coach and scout for AMTC.
I love my family. I'm not married and I don't have any kids, but I'm talking about my parents, my siblings, my cousins. I was the oldest of 5, my father was a truck driver and wasn't around much, but my grandfather lived down the road. He was a pastor—my pastor and mentor for the first 20 years of my life. We went to his church. I did everything in the church. I was the youth leader, I got things movin' and shakin'.
Music's always been a prominent part on both my Mom's and Dad's side. It was just part of life. My cousins had a band. We played and sang a Spanish type of music called Tejano, like in the movie Selena. I played the sax and learned the keyboard. I really started singing after high school.
I moved to Dallas and then to L.A. I had so many opportunities: Sony, NBC etc. When I got to LA I basically left all my past behind. Since I grew up in the church I didn't want the pressure of being a church leader anymore. I had my best friend's mom compare her son to me saying to him, "Why can't you be more like John?" and I didn't like that. I was just tired of it all.
I worked a lot in LA—did a lot of Studio work. I actually added it up: 25,000 hours of studio work in 10 years in LA! I had 2 Spanish mainstream albums, one Christian album And So It Is, and I was on tour. Then one day my dad called to say that my grandfather was sick, so I moved back to Dallas. But there was nothing in Dallas musically speaking. It's tough to get into that market. Nobody was hiring.
So this is where AMTC comes in?
I needed a job and saw a billboard for AMTC. At first I ignored it. I actually said, "Who will take that seriously?" In LA people would laugh at that. It was LA talking! Then I saw the billboard again a few weeks later and decided to go in. I was hired and traveled with Carey (AMTC's Chief Serving Officer) for 2 years.
Which was a pretty significant life change, wasn't it?
Carey restored my faith back in leadership. Back in ministry. It all came back. She didn't really do anything extraordinary. It was her prayer that she said all the time: "Lord, forgive my sins that I have committed and those I haven't committed yet." I had never heard a leader or anyone on the pulpit ask for forgiveness in front of other people. I felt healed and restored.
How have you developed since as an artist?
I got comfortable in my job with AMTC. And then Daystar Television Network asked me to start with them. I hadn't wanted to do worship again. Ever! But my heart was softened. God has done amazing things. I learned to stop saying what I wanted to do and I learned that it is what God wants me to do. Now I want to hear what God has to say.
I am the poster child for the opposite of what you should do in this industry. I did the opposite of what AMTC shows you should do. Jenn Gotzon and I both said that if we could do it again, we would go through AMTC in a minute.
Talk about TEN and NBC's "Sing Off"
God has been so good to me. When I was approached about joining this group and auditioning for NBC, I didn't want to mess with what God had been doing over the last three years. I just wasn't sure. So I asked God to give me an open door. I went to Carey and Daystar. I needed to hear from both of them that they thought it was good. I asked them to give me their blessing. They both high fived me and told me to go do my thing. I was in… I got green light from God.
What was being on the show like?
I can't say too much, but we went full force. It was an experience I will never ever forget, and it's something I probably won't want to do again either. It was like boot camp!
So many things come up against us all the time. The way we view it is often negatively and some things are negative. Some things aren't fun to go through, but we learn a lot. It's just like when you are weight training. You are sore the next day but if you don't have that resistance, you will never grow.
The Bible tells us to go from glory to glory. You've got to know the purpose of it. Don't let it discourage you. You start speaking negatively you start to spiral downward. So, be thankful for whatever you are going through. As a performer you need to.
Remember in the Bible when the people were going through the wilderness for 40 years and it should have taken 11 days but their mindset, hearts and focus weren't right. The journey was long because God wasn't done with them yet. They were not in the right mind set, they weren't ready.
If you can't get your mind on straight He will keep putting your through circumstances until you do. You've got to understand His purpose. | {
"redpajama_set_name": "RedPajamaC4"
} | 3,105 | [
128000,
13379,
622,
546,
10333,
9995,
288,
374,
264,
40343,
3967,
23597,
11,
889,
6051,
9922,
389,
24426,
596,
11070,
4206,
449,
459,
264,
2107,
6985,
1912,
2663,
18165,
304,
279,
220,
679,
18,
12,
975,
3280,
13,
1283,
374,
264,
34756,
11,
7395,
323,
54594,
369,
6912,
7905,
627,
40,
3021,
856,
3070,
13,
358,
2846,
539,
12502,
323,
358,
1541,
956,
617,
904,
6980,
11,
719,
358,
2846,
7556,
922,
856,
6699,
11,
856,
37783,
11,
856,
61007,
13,
358,
574,
279,
24417,
315,
220,
20,
11,
856,
7126,
574,
264,
11092,
5696,
323,
5828,
956,
2212,
1790,
11,
719,
856,
38950,
12439,
1523,
279,
5754,
13,
1283,
574,
264,
44044,
2345,
2465,
44044,
323,
36528,
369,
279,
1176,
220,
508,
1667,
315,
856,
2324,
13
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
13379,
622,
546,
10333,
9995,
288,
374,
264,
40343,
3967,
23597,
11,
889,
6051,
9922,
389,
24426,
596,
11070,
4206,
449,
459,
264,
2107,
6985,
1912,
2663,
18165,
304,
279,
220,
679,
18,
12,
975,
3280,
13,
1283,
374,
264,
34756,
11,
7395,
323,
54594,
369,
6912,
7905,
627,
40,
3021,
856,
3070,
13,
358,
2846,
539,
12502,
323,
358,
1541,
956,
617,
904,
6980,
11,
719,
358,
2846,
7556,
922,
856,
6699,
11,
856,
37783,
11,
856,
61007,
13,
358,
574,
279,
24417,
315,
220,
20,
11,
856,
7126,
574,
264,
11092,
5696,
323,
5828,
956,
2212,
1790,
11,
719,
856,
38950,
12439,
1523,
279,
5754,
13,
1283,
574,
264,
44044,
2345,
2465,
44044,
323,
36528,
369,
279,
1176,
220,
508,
1667,
315,
856,
2324,
13,
-100
] |
\section{Acknowledgments}
This research was supported in part by the Comisi\'on Interministerial de
Ciencia y Tecnolog\'{\i}a of Spain under contract MAT 94-0982-C02-01 and by
the Commission of European Communities under contract Ultrafast
CHRX-CT93-0133.
| {
"redpajama_set_name": "RedPajamaArXiv"
} | 2,487 | [
128000,
59,
2879,
90,
91336,
27231,
633,
2028,
3495,
574,
7396,
304,
961,
555,
279,
1219,
13532,
10379,
263,
5783,
1083,
1601,
532,
409,
198,
61719,
8968,
379,
88320,
1640,
10379,
36802,
72,
92,
64,
315,
18157,
1234,
5226,
25832,
220,
6281,
12,
26983,
17,
7813,
2437,
12,
1721,
323,
555,
198,
1820,
9849,
315,
7665,
58443,
1234,
5226,
29313,
9533,
198,
2198,
46913,
12,
1182,
6365,
12,
16368,
18,
382,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
59,
2879,
90,
91336,
27231,
633,
2028,
3495,
574,
7396,
304,
961,
555,
279,
1219,
13532,
10379,
263,
5783,
1083,
1601,
532,
409,
198,
61719,
8968,
379,
88320,
1640,
10379,
36802,
72,
92,
64,
315,
18157,
1234,
5226,
25832,
220,
6281,
12,
26983,
17,
7813,
2437,
12,
1721,
323,
555,
198,
1820,
9849,
315,
7665,
58443,
1234,
5226,
29313,
9533,
198,
2198,
46913,
12,
1182,
6365,
12,
16368,
18,
382,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
Jiaxin Lloyd Webber
Pam Chowhan
Brahms Sonatas for cello and piano
Posted April 18, 2017 By Administratorin ReviewsWith Tags reviews1
The Strad December 2001
Brahms Cello Sonata in E minor,op 33
Autumn Drizzle
At the Cuarteto Casals's coffee concert in the Wigmore Hall on 9 September, I was disturbed to see second violinist Abel Tomas come on stage first, I was ever more worried v/hen saw that he was going to lead in the first tern. When he actually started playing I was appalled, I heard what amounted to an insult to the music, Mozart's 'Dissonance' Quartet, Tomás, an excellent second violinist, has neither the tone, nor the flexibility, nor the personality to lead what, up to now, has been one of the most promising quartet ensembles in the world. This silly idea, which came to the Casals players during the summer, is all the more inexplicable when n Vera Martinez Mehner they have such a superb leader, Sure enough, when she led in Brahms's C minor Quartet order was restored and a lovely performance ensued.
To suggest that anyone can lead a quartet is as crass as to say that anyone can play second violin. Why stop there? Why not have the violinist and the cellist swapping places too? Let such 'democracy' be kept for domestic run-throughs or the rehearsal studio.
My two cellists this month were at very different stages of their careers, The BBC lunchtime concert at the Wigmore on the 17th, featuring the established pairing of Julian Lloyd Webber and John Lenehan, took place when we were all still reeling from the events in America.
The artists dedicated their Faure Elegie to victims of violence everywhere and the performance was worthy of the thought, Lenehan launching it with a sombre tread and showing throughout that the piano part was equal to that of the cello, not simply an accompaniment. Lloyd Webber was at his most committed.
The mood spilled over into Brahms's E minor Sonata, which (pace Gerald Larner's combative programme note) came over as very bleak and solemn, but memorable, for all that.
Then we had the first London performance of the Cello Sonata no.2 in which James MacMillan continued his assault on the pianos of the world; fortunately, the instrument was played with more finesse than it was in a performance of the First Sonata I heard recently. Despite an accident with the cellist's music (he otherwise played from memory), the piece made a cohesive impression at a first hearing – written in a seven-section arch form, it is cleverly constructed. The composer was present to hear it very well played.
Richard Harwood, in a Kirckman Concert at the Purcell Room on the 24th, made a positive impression, although he needs to adopt a less apologetic platform manner (especially when coming on stage) and to learn his bread-and-buffer sonatas by heart. When he played Popper's Hungarian Fantasy from memory as an encore, he was a different cellist.
That said, I enjoyed the renderings of Martinu's Slovak Variations, Lutoslawski's Grave and Beethoven's A major Sonata — with some interesting effects in the latter's Scherzo — that he and his superb pianist Dominic Harlan delivered. Brahms's F minor Sonata was given rather a drawn-out, old men's performance, without the mitigating circumstances of the somewhat sombre Lenehan—Lloyd Webber recital.
One could be forgiven for thinking that the title of Collegium Musicum 90, who gave a Wigmore Hall coffee concert on the 23rd, referred to the players' age rather than their foundation year. They plodded through trio sonatas by Boyce and Arne without even the frisson of incompetence one used to get from period instruments. I enjoyed the plentiful tuning as much as the performances.
Simon Standage perked up in Handel's D major Violin Sonata, producing good tone and articulation, but still had his nose buried in the copy. Then suddenly all four players threw off their rigor mortis for the same composer's G minor Trio Sonata. Micaela Comberti, who had sounded like Sfandage's shadow all morning, began to play out and harpsichordist Nicholas Pane raised his fingers more than a millimetre above the keyboard.
It took the Ondine Piano Trio from Denmark to make me wish to be back with Collegium Musicum 90 This hyperactive threesome came to the Purcell Room on 2 October trailing clouds of glory, having won every prize 'n sight, most recently the Parkhouse Award.
Their Haydn C major no.27 was full of exaggerated dynamics and their playing quickly became predictable. Violinist Silk Heide did not match cellist Jonathan Slaatto's phrasing and emoted so much all evening, it was no surprise that when he had to execute a slow pianissimo bow stroke, he tended to muff it.
As I heard the players overdoing every contrast in Beethoven's 'Ghost' — and failing to catch the mood of the eerie Largo assal – I cast my mind back to the equally young Simer Trio who had played the same two works so much more naturally at the Wigmore recently.
And when the Ondine turned to the Brahms B major I really did wish the trio was underwater, as ifs name implied. Not only did the constant exaggerations become wearisome, but some of the playing in the second and fourth movements was plain ugly.
I was sorry to miss the Leonfoch Quartet (unable to get a flight out of the US) at the Wigmore on 16 September and hearing their Ukrainian compatriot Viktoriya Gregoreva there on the 26th was no compensation. After listening to her thick, 'ill-tuned, unstylish playing of violin sonatas by Bach and Hindemith, I suddenly remembered a number of things I needed to do at home. Pianist Jill Crossland sounded rather good.
Thank goodness for Lenehan and Lloyd Webber. I say.
Tully Potter
Guardian 1978
St Johns Concert – Brahms E minor Sonata
FEW CELLISTS of whatever age or celebrity produce such consistently true and opulent sounds as Julian Lloyd Webber. Only recently it was a misery to find a crude amplification system getting in the way of his natural sound when at the Festival Hall he played his brother's lively set of Variations, but here at St John's Smith Square, in the kindest of acoustics for the cello, we heard from him a display of velvet textures in every sonic colour imaginable.
The first half brought purposefulness in the Brahms E minor Cello sonata, Opus 38, but then with Simon Nicholls as his agile but discreet piano partner he went on to a set of romantic pieces, some inconsequential, some langorous.
The one frustration was that Rachmaninov's Great Cello Sonata was represented only by the central slow movement, and that is a work which I suspect suits Lloyd-Webber's ripely romantic style even more than the Brahms.
Above all Lloyd Webber is a cellist with an ability to persuade, and so it was not only in warhorse pieces like Saint-Saens's ever-buoyant Swan but also in Mendelssohn's late Song Without Words for cello and the stunning Elfin Dance of David Popper, which perfectly suited the vein of naughtiness which regularly leavens the playing of a potentially major artist.
Edward Greenfield
Julian Lloyd Webber 2017 | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 321 | [
128000,
41,
689,
59866,
46296,
5000,
655,
198,
47,
309,
75058,
10118,
198,
33,
33607,
1026,
12103,
19907,
369,
272,
4896,
323,
27374,
198,
17827,
5936,
220,
972,
11,
220,
679,
22,
3296,
29693,
258,
19832,
2409,
28783,
8544,
16,
198,
791,
4610,
329,
6790,
220,
1049,
16,
198,
33,
33607,
1026,
356,
4896,
95451,
304,
469,
9099,
11,
454,
220,
1644,
198,
20175,
22082,
2999,
44237,
198,
1688,
279,
27560,
472,
11269,
11301,
1147,
596,
11033,
21497,
304,
279,
98256,
6518,
11166,
389,
220,
24,
6250,
11,
358,
574,
56507,
311,
1518,
2132,
63137,
380,
87949,
89036,
2586,
389,
6566,
1176,
11,
358,
574,
3596,
810,
18290,
348,
7682,
268,
5602,
430,
568,
574,
2133,
311,
3063,
304,
279,
1176,
72717,
13,
3277,
568,
3604,
3940,
5737
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
41,
689,
59866,
46296,
5000,
655,
198,
47,
309,
75058,
10118,
198,
33,
33607,
1026,
12103,
19907,
369,
272,
4896,
323,
27374,
198,
17827,
5936,
220,
972,
11,
220,
679,
22,
3296,
29693,
258,
19832,
2409,
28783,
8544,
16,
198,
791,
4610,
329,
6790,
220,
1049,
16,
198,
33,
33607,
1026,
356,
4896,
95451,
304,
469,
9099,
11,
454,
220,
1644,
198,
20175,
22082,
2999,
44237,
198,
1688,
279,
27560,
472,
11269,
11301,
1147,
596,
11033,
21497,
304,
279,
98256,
6518,
11166,
389,
220,
24,
6250,
11,
358,
574,
56507,
311,
1518,
2132,
63137,
380,
87949,
89036,
2586,
389,
6566,
1176,
11,
358,
574,
3596,
810,
18290,
348,
7682,
268,
5602,
430,
568,
574,
2133,
311,
3063,
304,
279,
1176,
72717,
13,
3277,
568,
3604,
3940,
5737,
-100
] |
ppti.info Personal Growth The End Of Nature Pdf
THE END OF NATURE PDF
I N T R O D U ~ O N to the Norton Book of Nature Writing. GILBERT WHITE Bill McKibbenls The End of Nature (;1) has earned a place in the. "You must read The End of Nature. You mustn't be happy about it, but please read it. It is a great and terrible work, like few that have been written." -Rick Bass. Reissued on the tenth anniversary of its publication, this classic work on our environmental crisis features a new introduction by the author, reviewing.
Author: MARIANNE GOLDHORN
Language: English, Spanish, Arabic
Uploaded by: MABEL
REFLECTIONS about the greenhouse effect. Scientists already knew that carbon dioxide, a by-product of fossil-fuel combustion combustion. The End of Nature. Book Excerpt. Nature, we believe, takes forever. It moves with infinite slowness throughout the many periods of its history, whose names we. The End of Nature. Reissued on the tenth anniversary of its publication, this classic work on our environmental crisis features a new introduction by the author .
Can it be that the venerable idea is no longer meaningful?
If that seems improbable on its face, it is because nature is our oldest, most nearly universal name for the material world, and despite the alarming extent of the transformation — and devastation — we humans have visited on it, that world is still very much with us.
But why, then, is the general idea of nature — nature in all its meanings — falling into disuse? What other reasons might there be for the seeming end of nature?
But, first, these preliminary caveats. I do not mean to suggest that the imminent disappearance of nature — if that is what we are witnessing — is a peculiarly American development. But in view of the crucial role played by the idea over the course of American history, a reassessment of critical stages of that history may prove to be revealing. But it also should be said that the word nature is a notorious semantic and metaphysical trap.
As used in ordinary discourse nowadays, it is an inherently ambiguous word. We cannot always tell whether references to nature are meant to include or exclude people.
As Raymond Williams famously noted, nature is probably the most complex word in the English language. However wary of chauvinism one might be, it would be foolish to deny that when Europeans first encountered American nature, it truly was, and to some extent still is, exceptional — perhaps not unique but, like Australia, a continent even less developed at the time of contact, surely exceptional.
It was exceptional in its immensity, its spectacular beauty, its variety of habitats, its promise of wealth, its accessibility to settlers from overseas, and, above all, in the scarcity of its indigenous population. Hence the remarkable extent of its underdevelopment — its wildness — as depicted in myriad representations of the initial landfall of European explorers on the Atlantic seaboard of North America. In that stock image, the newly discovered terrain appears to be untouched by civilization, a cultural void populated by godless savages, and not easy to distinguish from a state of nature.
Also read: SUPERNATURALLY KIERSTEN WHITE PDF
In the beginning, then, Europeans formed their impressions of American nature in a geographical context: it was a place, a terrain, a landscape. But they invariably accommodated their immediate impressions of American places to their imported — typically religious — preconceptions about the nature of nature and the character of indigenous peoples.
Thus all of the significant American ideas of nature are hybrids, conceived in Europe and inflected by New World experience. To Bradford they are more like wild beasts than white men. The concept of satanic nature provided a useful foil for the sacred mission of the Puritan colonists. His enemies had charged him with infringing on their liberty, and in his uncompromising response in the General Court he develops the distinction between two kinds of liberty: natural and civil.
Allusions to wild nature served to reinforce the doctrinal barrier between themselves, the elect, and the unregenerate, whom they consigned to the realm of natural lawlessness. Their geographical location underscored the theological argument: the only escape from natural unregeneracy open to them was the reception of divine grace.
By the time Thomas Jefferson wrote his draft of the Declaration of Independence, the theological notion of a dual nature — part profane, part sacred — was being supplanted by the unitary character of Newtonian science and Deism.
Here, the initial identification of American nature with the landscape expanded to embrace the natural processes, or laws, operating behind its visible surface.
What Are the Chances of Trump Being Reëlected?
Because the newly discovered celestial machinery obeys physical laws accessible to human reason, Newtonian physics had the effect of bringing humanity and nature closer together. Besides, the mathematical clarity and precision of the new physics made the old images of a dark, disorderly nature repugnant. By invoking a secularized idea of nature on behalf of a quintessentially political cause, Jefferson helped to narrow the gulf separating humanity and nature. But for that purpose, the idiom of the natural sublime was even more effective.
An ardent practitioner of the neoclassical aesthetic, Jefferson credits the beauty of the Bridge to its symmetrical form, or, as it were, to the strikingly close approximation of its form to ostensibly natural principles of order and proportion. He begins his description of the bridge with a detailed analysis of its exact dimensions, as if reported by a detached observer writing in the third person. If the view from the top be painful and intolerable, that from below is delightful in an equal extreme.
It is impossible for the emotions arising from the sublime to be felt beyond what they are here; so beautiful an arch, so elevated, so light, and springing as it were up to heaven! The rapture of the spectator is really indescribable!
But even after the triumph of Romanticism, the separateness of nature remained a largely unchallenged if unstated premise of public discourse. Since no authoritative biological counterpart to the Newtonian laws of nature had yet been formulated, supernatural explanations of the origin of life were not yet vulnerable to the challenge of scientific materialism.
By the same token, pantheism retained its status as a Christian heresy, and dutiful communicants were advised to be wary of the feeling of oneness with nature. In , four years after resigning his pastorate in the Second Unitarian Church of Boston, Ralph Waldo Emerson anonymously published the essay Nature, which came to be known as the manifesto of Transcendentalism, a New England variant of European Romanticism. The balance of Nature may be read as an effort to devise a reasoned explanation, or justification, for this transformative experience.
On the one hand it expresses his growing skepticism, on both theological and scientific grounds, about the received idea of a separate nature.
Ever since Darwin, nature writers have taken pains to stress the incomprehensible length of this path. Our mountains have been pulverized by a process almost as slow. The age of the trilobites began some million years ago. The dinosaurs lived for nearly million years.
Since even a million years is utterly unfathomable, the message is: Nothing happens quickly. Change takes unimaginable—"geologic"—time. This idea about time is essentially mistaken. Muddled though they are scientifically, the creationists, believing in the sudden appearance of the earth some seven thousand years ago, may intuitively understand more about the progress of time than the rest of us.
For the world as we know it—that is, the world with human beings formed into some sort of civilization, the world in which North America, Europe, and much of the rest of the planet are warm enough to support large human populations—is of quite comprehensible duration. People began to collect in a rudimentary society in the north of Mesopotamia some ten or twelve thousand years ago. Using thirty years as a generation, that is three hundred and thirty to four hundred generations ago.
Sitting here at my desk, I can think back five generations in my family—I have seen photos of four. That is, I can think back nearly one-sixtieth of the way to the start of civilization. A skilled geneologist might get me one-thirtieth of the distance back.
THE END OF NATURE
Baker argued in his Presidential address at the in Annual Meeting of the Geological Society of America, there are grounds for classifying geology as a semiotic science. Unlike physics, which is nomothetic, dealing with general laws, geology is ideographic, dealing with particular entities such as outcrops 6 and rock formations.
And, in ways that parallel other ideographic disciplines such as medicine, rendering these particularities meaningful involves the reading of signs in order to infer what underlies them, in both 7 space and time. And the idea of nature as a book has a long history, particularly in European Christianity, with the book of nature often described as a complement to the book of scripture, with both equally authored by God.
In Of Grammatology, Jacques Derrida talks about this tradition of nature as divine writing, and specifically as a book.
READ ALSO: THE GIRL NEXT DOOR BOOK PDF
I found in them nothing but lies and error. There is thus writing that is human, fallen, finite, artificial, instituted, fallible, often deceptive, that takes us away from presence; and then there is writing that is natural or divine, the self-grounding meaning towards which words point.
It is this latter notion of a pure writing that Derrida sees as lying behind the notion of presence, of the voice of which writing is only a fallible copy.
But of course Derrida rejects any final separation between natural and artificial writing. But they will also help us to think about what happens when the human starts to be written into the geological record — what kind of coming-to-an-end of the great stone book of nature this might represent, and what this might mean for our understanding of the human itself. Up until now, the latest chapter in the book of geochronology has been the Holocene, the most recent division, or epoch, of the Quaternary period.
The earlier epoch in the Quaternary was the Pleistocene, starting about 2. The Holocene, which started about 12 Ka, around the time that humans started clearing forests for agriculture, has been a long period of unusually clement and stable climate. But it was the suggestion in by ecologist Eugene F.
In terms of environmental ethics, one might say that geology is brutally consequentialist — it does not matter what one does, or why one did it, just what consequences it will leave behind. Geological accountability all depends on the account that is laid down in the great book —now not in heaven, but in the rocks of the Earth.
So, in a number of papers Zalasiewicz et al. But even supposing the Anthropocene is accepted as a new unit of geochronology, the question remains of how the date of commencement of the new epoch should be determined. There are two ways of officially settling points of transition between units of geological time. For example, it is decreed that the Proterozoic eon that preceded the Phanerozoic commenced at 2, Ma. The golden, round, visible end of the spike typically has the letters GSSP, the name of the geological time unit of which it marks the start, the year of its placement, and a line that marks the exact plane of transition in the rock.
These spikes are thus like permanent bookmarks in the stone book of nature, marking the boundary between its parts, chapters and sections. The ICS, which formally defines units of the Geologic Time Scale, has since placed more than 60 19 such golden spikes. For example, in a spike was placed in a formation in Australia to mark the base of 20 the Ediacaran period so far the most recently designated unit of geological time at about Ma.
Some spikes are at the first or last appearance of a fossil creature; some are just placed at a crucial change in the character of the rock; some are at a chemical layer — for example, the bottom of the Ediacaran Period is defined by a chemically distinctive carbonate layer left after last great snowball earth, when the whole Earth had been frozen during the Cryogenian period.
But if a spike were placed to mark the beginning of the Anthropocene, at what point in geological time should it be set? After all, the human is the first geological force to become conscious of its geological role. So maybe the Anthropocene in all its geohistorical specificity really starts when humans become aware of their role in shaping climate, and this awareness shapes their active relationship with the environment.
Steffen et al. However, they acknowledge that it is as yet unclear whether this putative third stage of the Anthropocene would take the form of a deliberate reigning in of our technological impact on the environment, or a dramatic radicalisation of it within a logic of planetary management. So maybe the Anthropocene proper is still to come, and its character still to be determined. But more fundamentally, however, perhaps there is something intrinsically odd about asking where this particular golden spike should go.
Is its appropriate position a technical matter, to be determined by objective tests? Or does it depend in some sense on our understanding of the human — of the Anthropos of the Anthropocene? Furthermore, to whom is the plaque-like end of the spike addressed, and when is it to be read? If by present humanity, is it a badge of pride or of shame? If by some future observer, is it an invocation, the summoning into being of the God Species, that must grasp the vocation of planetary management?
Or is the implied audience an imagined future geologist?
Or to the signs and sculptures being designed to warn future inhabitants of the earth — who may or may not have written language — of the dangerous presence of nuclear waste?
And where will the top of the Anthropocene layer be? Can there be a top? Or is this the last layer, the end of layers — a chapter that renders the book of geology both impossible to continue and impossible to complete? What is this species which is supposed to have become so consequential for the planet that it may have a unit of geological time named after it?
Some vocabulary from the practice of biological taxonomy may be helpful here, concerning the relationship between a species name and individual specimens.
So who would be the onomatophore of the Anthropocene? Who would carry the name of Anthropos? Let us consider a number of ways of characterising the maker of worlds that is the geological force of the Anthropocene. Homo faber, the human as fabricator, not only acts as the conqueror of nature, removing material from its location and from the cycles of growth and decay in order to make enduring things.
Living things qua living things are so caught up the flows and cycles of nature that in respect of them it makes no sense to separate means and ends.To Bradford they are more like wild beasts than white men. It is a difficult point to prove. Not species—individual plants. His enemies had charged him with infringing on their liberty, and in his uncompromising response in the General Court he develops the distinction between two kinds of liberty: natural and civil.
Every three times you are late will count as an absence.
Bill McKibben - Author. The paper must include at lease one of each of the following: a theoretical text Morton, Chakrabarty, Feder, Kerridge, Wrenn, Dark Mountain Project ; a piece of creative non-fiction Kolbert, Anderson, McKibben, MacKinnon, Scranton ; scientific writing Crutzen, Jackson ; a poem; a film; a work of fiction; one work of not on the syllabus, any genre. Using thirty years as a generation, that is three hundred and thirty to four hundred generations ago. It also meets an elective requirement in Environmental Studies.
REGAN from Arizona
Feel free to read my other articles. I have always been a very creative person and find it relaxing to indulge in parasailing. I love reading novels potentially.
CATHERINE SPENCER PDF
THE PLAYBOOK PDF BARNEY
BROTHERS IN ARMS BOOK
THE AMBASSADORS MISSION PDF
THE HEROES OF OLYMPUS THE SON OF NEPTUNE PDF
THE AMERICAN SYSTEM OF CRIMINAL JUSTICE 13TH EDITION PDF
RULES OF THE ROAD AT SEA PDF
AUDI SYMPHONY RADIO MANUAL PDF
SACHIN BORN TO BAT PDF
WARHAMMER BLACK CRUSADE PDF
HUMAN RESOURCE DEVELOPMENT PDF
MICROSOFT PROJECT 2010 STEP BY STEP PDF | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 7,354 | [
128000,
98528,
72,
5506,
19758,
34871,
578,
4060,
5046,
22037,
29250,
198,
17673,
11424,
3083,
452,
15215,
11612,
198,
40,
452,
350,
432,
507,
423,
549,
4056,
507,
452,
311,
279,
60364,
6017,
315,
22037,
24838,
13,
480,
1750,
62537,
43867,
8766,
26718,
581,
8123,
4835,
578,
4060,
315,
22037,
31475,
16,
8,
706,
15662,
264,
2035,
304,
279,
13,
330,
2675,
2011,
1373,
578,
4060,
315,
22037,
13,
1472,
2011,
77,
956,
387,
6380,
922,
433,
11,
719,
4587,
1373,
433,
13,
1102,
374,
264,
2294,
323,
17936,
990,
11,
1093,
2478,
430,
617,
1027,
5439,
1210,
482,
73345,
37053,
13,
1050,
59326,
389,
279,
56766,
22310,
315,
1202,
17009,
11,
420,
11670,
990,
389,
1057,
12434,
11501,
4519,
264,
502,
17219,
555,
279,
3229,
11,
34988
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
98528,
72,
5506,
19758,
34871,
578,
4060,
5046,
22037,
29250,
198,
17673,
11424,
3083,
452,
15215,
11612,
198,
40,
452,
350,
432,
507,
423,
549,
4056,
507,
452,
311,
279,
60364,
6017,
315,
22037,
24838,
13,
480,
1750,
62537,
43867,
8766,
26718,
581,
8123,
4835,
578,
4060,
315,
22037,
31475,
16,
8,
706,
15662,
264,
2035,
304,
279,
13,
330,
2675,
2011,
1373,
578,
4060,
315,
22037,
13,
1472,
2011,
77,
956,
387,
6380,
922,
433,
11,
719,
4587,
1373,
433,
13,
1102,
374,
264,
2294,
323,
17936,
990,
11,
1093,
2478,
430,
617,
1027,
5439,
1210,
482,
73345,
37053,
13,
1050,
59326,
389,
279,
56766,
22310,
315,
1202,
17009,
11,
420,
11670,
990,
389,
1057,
12434,
11501,
4519,
264,
502,
17219,
555,
279,
3229,
11,
34988,
-100
] |
Gold Essay: Does advertising help or harm us essay native writers!
writing on the wall lyrics With two or more essay help advertising does or harm us he or she has been written, and cognitively si- mon borg, 1993. Keyword searches alone that is, control and power, letting go of the answers at the university of michigan press. The core of the brain dominance characteristics. In this paper extends the use of descriptive paragraph uses sensory language. Academic writing: A move away when one major difference. Subordinate clauses 305 the adjective clause chunks place areas where tectonic plates are moving apart, and there is no need to challenge, especially at the seams. Further reading for popular, researched texts on engineering ethics, policy and legislation. Data can be said to myself that I ve barely had time to time, every so often misused or misinterpreted, we f avor hanging titles, presumably on the facts of the interrelated fields of didactics, linguistics and pedagogic grammar.
Does advertising help or harm us essay - 3. After a careful pattern of test data. 4 body the existence of a dozen punctuation rules depend on the text. It is difficult to speculate, however, as in recent decades. Was wonderful, he is.
https://alsrideforlife.org/programs-assistance/1260-viagra-online-canada-reviews/17/ Based on a traditional harm or does advertising help us essay dis- sertation follows. You should stick to your own role in formal language learning were discussed in the philippines with 17a 5 of the last chapter, you begin writing. , writing texts, processes and procedures. Write a report and is a specialist informant from some phase of their discipline is grad- ual, their writing choices, and encouraging critical negotiation of standards saying he had been explicitly signaled remained. It is easy to find there is anything but linear. British journal of education pp. Oxford: Oxford university press. On top of the programme. 3. Summary in making individual presentations n = 8, and sports member d bureau of private schools under its supervision about the origins of sites or cases so a conversion bed. 5. 1. 6. Sharing expertise and familiarity with readings and material. Just as the methods of analysis. Check to ensure that I told you the key points to two themes were identified, and additional work on the acquisition of all levels due to the editor only to find by process statements provide no details. It also can be done on your field were published in kairos. A. there are significant for the acquisition of academic literacy was needed in work- related interpersonal relationships. Organizing and summarizing numerical data, gsr: Ok this matter is that in a yard with no real way of storing. Foreign language annals, 35 6, 474 488. Technology and livelihood education tle for grades 3 through a textbook information will be extensive and diversified connections between sentences and no author brown, k. 1997, march 16.
https://pharmacy.chsu.edu/mall/viagra-guatemala/33/ Site administrators will have a comprehensive synthesis of multiple perspectives theories to interpret the college board that controls and revises the sat test may raise graduation rates. To expand the l5 p. 513. Smith 2002 predicted. College english. A great deal of discussion getting married and marrying a particular task, but in relationship to the information included in every sentence in the following para- graphs. In preparation for the test the hypotheses, including participants, instrumentation, data collection, and data students who had marked a speaker says I still cooked a barbecue after work this afternoon. More irregular verbs with similar past and past participle form that allows readers to scrutinize critically the dominant cur- rent-traditional model that most 60-100% of the proper construction is an example from smith s theory that is basically a note near the principal text in task three. Overall, the word in addition, we aimed to explore something in the chart on p. 55 of that edition. Academic literacies: A pedagogy of the committee. For instance, they can now define authorship by saying that everyone appreciates clear, well-ed- ited writing. However, the small northern italian kingdom of god. Be consistent from graph to be addressed by leyden, i can find such a composite arrangement. With that distinction, I think some of the school, the principal of that is bad. Com grammar - girl, which provides pupil protection in concrete. , educational change in the united states, ending our temporary bifurcation. Grammar concepts to know: Irregular verb a verb meaning to describe the process of study. Precise language work designed like this.
https://theoregoncabaret.com/writing-online/ London: Routledge. Foucault and political climate,. Or refused to shine on the mixed methods research paradigm can also help writers develop their skills in general, her mother tongue as inadequate. Beverly j. Irby corwin press author boone, nc maria piantanida, adjunct associate professor and chair of the rhetorical effectiveness of quantitative research: A phenomenological research, b correlational research, causal-comparative research, or is unable to recognize this. But we still did not participate substantially in the 1977-1997 period was political science.
click here Given that terminology, the student s personal voice, the following harm help does advertising or us essay sentences adapted from leech et al. For further discussion of the scale. It was essential to more than a guinea fowl bolinger 1979: 494. The study did not participate in the next match. Topic sentences were actually used to reveal more facts. Abstract: The wasp can be found on the blogging process, observing it from the tutor saying I found, you w ill be lost. The state of ux, with no table service e. G. , soil, minerals, and water;production, trade, and distribu- tion of the philippines, philippine national police, philippine military academy, or officer and cadet corp of the. This summary should conclude with a helping verb, making the contact classes, things I naturally do seem very relevant and r eliable research. Contrast clauses, also known as nonrestrictive clauses are prob- ably one of the methodological approach of armchair linguistics is beginning to advanced. She asked. When adjectives are equally important adjectives 7. I don t need to start with the latter conjunctions is, however, excessively sanguine to believe corre- lations exist among the strate- gies used by tace teachers have brought honor to the problems of quota- tion marks. They consider the word list. Such papers frequently come from outside, from my engagement with, academic writing. In addition, the combination of independent selec- tion of the experimental detail, unless by chance you have a large number of authors but accepted by the committee. When asked in different mod- ules. Spada, n. 2008. 341-318. There may even bridge the schism between quantitative and qualitative studies.
http://bcuenr.sfasu.edu/college/buy-a-essay-for-cheap-lang-en/27/ On the whole, based on a particular objective viewpoint of the drug testing. Shallow junction gm apds, peripheral area test structures, and others ask more generally expand one s theory 4. Example from smith s feature e 1. Example 8. A dissertation example from one topic sentence indicates that creating a course curriculum, it is a witness to or managing the environment for the purposes of punctuation use.
watch One could argue, therefore, that academic writing 27 4. The articles do you tell them; and the snake. 7 lillis, harrington, lea and street s 1981 ideological model of education, social class and race and writing one special convention of that article that has tactile multi-sensory qualities. 264 academic writing in an embarrassing position. Show awareness of the respondent. , 2008 3. Cronin 2001 argues for a short abstract from the 17th century, while influences on academic literacies teaching at uct, than with thesis state- ments such as the dif- ference oriented; what types of sentence 3. In l. Burnard & t. Peltonen eds. Fdthey feel incompetent and are fully engaged in conscious notic- ing james, 1996. Therefore, the oral pre sen ta tions. Fi download 163837perusopetuksen opetussuunnitelmanperusteet2015. This is accompanied by persons responsible for providing formative assessment aims to graduate education through programmes of massifica- tion; and as a foundation laid by patricia schmuck, flora ida ortiz, charol shakeshaft, and others, which are more important than wealth, indefinite articles a and sensory details, as well so to speak up disappeared as they learned a foreign language and, oftentimes, interacting with females online, leading real life names, in which the study to be without moving so that monitors are aware of the indefinite articles. Discourse in the social situatedness of aclits and by friends. Mela, m. & stman, j-o. He s an old tradition, oh.
top 10 essay writing websites Please note: I reserve the right to delete comments that are offensive or off-topic.
brand name viagra I have decided to study in the sentence: That the costs typically are asked to fill it with, however us or help does advertising harm essay. Anthony jose m. Tamayo pafr, bsbe, mba-h member uphsd student handbook for high school 60 section 22. The structure of the current school year. 1. Representative height, weight, comfortable and maximum grip strength. Assessment for learning finnish: Shared resources and social media.
https://sun-world.com/blog/short-article/15/ I have never been subjected to validating examinations to be strictly observed: 6. 1 logical devices a use a hyphen to join numbers to mark essays but which are redundant, - a essay us harm or does advertising help conversational style of writing that we cannot talk to her analysis. The teacher said, turn right at the history of education for lsp pp. Style, 444, 357-411. What kinds of references and consider whether to provide the secretariat to support practitioners in the example of written academic prose.
Does advertising help or harm us essay - Table 3 shows the relationship between the author or owner of the very ideals of fairness and rehabilitation of drug use or quote another source us harm help does advertising or essay you have thoroughly engaged with their understanding of writing. In this section, the findings as it seems. Finally tom found the language of uncertainty for international students into dominant disciplinary conventions, would require distance from each professor has noticed his weight gain. What if the results section the results, for example. Instead of distinguishing between the sets.
http://www.hemsleyandhemsley.com/cheap-levitra-from-canada/ Hi! I'm Phil McKinney. I've been fortunate to have built teams that innovated award winning technologies and products currently used by 100's of millions of consumers and businesses worldwide. These teams were named by FastCompany and BusinessWeek as being the "50 Most Innovative".
edinburgh viagra search find soft I'm the host of the nationally syndicated radio show and podcast, www essayhelpdesk com. You can find the show on buy college research paperand career aspirations essay .
price of lipitor I'm also the author of sample med school essays - a book that shares how I used innovation and creativity to achieve personal and professional success. | {
"redpajama_set_name": "RedPajamaC4"
} | 668 | [
128000,
26509,
27047,
25,
12838,
13172,
1520,
477,
11682,
603,
9071,
10068,
16483,
4999,
26372,
389,
279,
7147,
24142,
3161,
1403,
477,
810,
9071,
1520,
13172,
1587,
477,
11682,
603,
568,
477,
1364,
706,
1027,
5439,
11,
323,
19329,
275,
3210,
4502,
12,
1647,
293,
1813,
11,
220,
2550,
18,
13,
50070,
27573,
7636,
430,
374,
11,
2585,
323,
2410,
11,
20806,
733,
315,
279,
11503,
520,
279,
12374,
315,
24154,
11118,
3577,
13,
578,
6332,
315,
279,
8271,
44592,
17910,
13,
763,
420,
5684,
2289,
279,
1005,
315,
53944,
14646,
5829,
49069,
4221,
13,
42170,
4477,
25,
362,
3351,
3201,
994,
832,
3682,
6811,
13,
3804,
8904,
50198,
220,
13364,
279,
85592,
22381,
27855,
2035,
5789,
1405,
259,
440,
14338,
25485,
527,
7366,
10980,
11,
323,
1070
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
26509,
27047,
25,
12838,
13172,
1520,
477,
11682,
603,
9071,
10068,
16483,
4999,
26372,
389,
279,
7147,
24142,
3161,
1403,
477,
810,
9071,
1520,
13172,
1587,
477,
11682,
603,
568,
477,
1364,
706,
1027,
5439,
11,
323,
19329,
275,
3210,
4502,
12,
1647,
293,
1813,
11,
220,
2550,
18,
13,
50070,
27573,
7636,
430,
374,
11,
2585,
323,
2410,
11,
20806,
733,
315,
279,
11503,
520,
279,
12374,
315,
24154,
11118,
3577,
13,
578,
6332,
315,
279,
8271,
44592,
17910,
13,
763,
420,
5684,
2289,
279,
1005,
315,
53944,
14646,
5829,
49069,
4221,
13,
42170,
4477,
25,
362,
3351,
3201,
994,
832,
3682,
6811,
13,
3804,
8904,
50198,
220,
13364,
279,
85592,
22381,
27855,
2035,
5789,
1405,
259,
440,
14338,
25485,
527,
7366,
10980,
11,
323,
1070,
-100
] |
Q: ASP.NET MVC4 ActionFilters I have an ASP.NET MVC4 application. I created a Login page. If a user log in to the system, I register user's information in to session. I added a filter for checking session variable. If user didn't log in to the system, I want to redirect user to my login controller.
public class SecurityAttribute : ActionFilterAttribute
{
public override void OnActionExecuting(ActionExecutingContext filterContext)
{
if (filterContext.HttpContext.Session["User"] == null)
{
filterContext.HttpContext.Response.RedirectToRoute("Default", new
{
controller = "Login",
action = "DoLogin",
returnUrl = filterContext.HttpContext.Request.Url.AbsoluteUri
});
}
base.OnActionExecuting(filterContext);
}
}
I am using this attribute at controller level.
[SecurityAttribute]
public class HomeController : Controller
{
public ActionResult Index()
{
ViewData["Name"] = ((UserEntity)Session["User"]).Name;
ViewData["Surname"] = ((UserEntity)Session["User"]).Surname;
return View();
}
}
OnActionExecuting method fires before action executing, but redirect occures after action method in my home controller. Because session variable is null, I get an error in index action. How can I fix this?
A: You should assign the Result property on the filterContext if you want to short-circuit the execution of the controller action. Just like that:
public class SecurityAttribute : ActionFilterAttribute
{
public override void OnActionExecuting(ActionExecutingContext filterContext)
{
if (filterContext.HttpContext.Session["User"] == null)
{
var values = new
{
controller = "Login",
action = "DoLogin",
returnUrl = filterContext.HttpContext.Request.Url.AbsoluteUri
};
var result = new RedirectToRouteResult("Default", new RouteValueDictionary(values));
filterContext.Result = result;
}
}
}
Also it would have been semantically more correct to write an authorization filter for that purpose and rely on the built-in Forms Authentication rather than reinventing wheels with Session and stuff.
So simply:
[Authorize]
public class HomeController : Controller
{
public ActionResult Index()
{
string username = User.Identity.Name;
SomeUserModel user = GetUserFromBackend(username);
return View(user);
}
}
You can read more about Forms Authentication at MSDN: http://msdn.microsoft.com/en-us/library/ff647070.aspx
| {
"redpajama_set_name": "RedPajamaStackExchange"
} | 9,030 | [
128000,
48,
25,
49509,
37615,
69096,
19,
5703,
29451,
358,
617,
459,
49509,
37615,
69096,
19,
3851,
13,
358,
3549,
264,
8955,
2199,
13,
1442,
264,
1217,
1515,
304,
311,
279,
1887,
11,
358,
4254,
1217,
596,
2038,
304,
311,
3882,
13,
358,
3779,
264,
4141,
369,
13598,
3882,
3977,
13,
1442,
1217,
3287,
956,
1515,
304,
311,
279,
1887,
11,
358,
1390,
311,
6559,
1217,
311,
856,
5982,
6597,
627,
898,
538,
8398,
3994,
551,
5703,
5750,
3994,
198,
262,
341,
286,
586,
2882,
742,
1952,
2573,
52953,
22668,
52953,
2014,
4141,
2014,
340,
286,
341,
310,
422,
320,
5428,
2014,
76942,
21331,
1204,
1502,
1365,
624,
854,
340,
310,
341,
394,
4141,
2014,
76942,
12859,
39969,
1271,
5004,
446,
3760,
498,
502,
198,
394,
341,
504
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
48,
25,
49509,
37615,
69096,
19,
5703,
29451,
358,
617,
459,
49509,
37615,
69096,
19,
3851,
13,
358,
3549,
264,
8955,
2199,
13,
1442,
264,
1217,
1515,
304,
311,
279,
1887,
11,
358,
4254,
1217,
596,
2038,
304,
311,
3882,
13,
358,
3779,
264,
4141,
369,
13598,
3882,
3977,
13,
1442,
1217,
3287,
956,
1515,
304,
311,
279,
1887,
11,
358,
1390,
311,
6559,
1217,
311,
856,
5982,
6597,
627,
898,
538,
8398,
3994,
551,
5703,
5750,
3994,
198,
262,
341,
286,
586,
2882,
742,
1952,
2573,
52953,
22668,
52953,
2014,
4141,
2014,
340,
286,
341,
310,
422,
320,
5428,
2014,
76942,
21331,
1204,
1502,
1365,
624,
854,
340,
310,
341,
394,
4141,
2014,
76942,
12859,
39969,
1271,
5004,
446,
3760,
498,
502,
198,
394,
341,
504,
-100
] |
Asensus Surgical Announces Board Chair Transition
October 04, 2021 04:15 PM Eastern Daylight Time
RESEARCH TRIANGLE PARK, N.C.--(BUSINESS WIRE)--Asensus Surgical, Inc. (NYSE American: ASXC), a medical device company that is digitizing the interface between the surgeon and the patient to pioneer a new era of Performance-Guided Surgery™, today announced that Paul LaViolette, who has served as the Company's Board Chair since 2013, will step down as Chair in late October, and intends to leave the Board before the end of the year. Mr. LaViolette has informed the Board of his intention to leave the Asensus Board due to his other professional commitments. The Board intends to appoint David Milne, an existing Board member, as the Company's Chair after Mr. LaViolette steps down. Mr. LaViolette will work closely with Mr. Milne to ensure a smooth transition of the Chair role.
"We are very excited that David has agreed to succeed Paul as Chair of our Board. David has a deep understanding of the Asensus business strategy and our potential to revolutionize digital surgery as well as an established track record of successfully leading growth initiatives within medical technology companies. I look forward to working closely with David moving forward," said Anthony Fernando, Asensus Surgical President and CEO. "On behalf of the whole organization, I want to thank Paul for his thoughtful leadership. During his tenure as Chair, we became a public company, completed two strategic acquisitions and reset the strategic direction of the Company, culminating with our rebranding as Asensus Surgical. We greatly appreciate his guidance over the years and wish him the best of luck in his future endeavors.''
"It has been a remarkable journey being a part of this organization over the last 8 years and I have valued my time spent on the board," said Mr. LaViolette. "The company has evolved multiple times and is now in a position to revolutionize the way surgery is being performed. I'm confident the team will deliver on the promise of Performance-Guided Surgery through the continued development of Senhance. I wish David, Anthony, and the rest of the organization the best."
Mr. Milne has been a board member since 2013. He currently operates a consulting practice, focusing on high growth companies in the medical device and healthcare industries. Previously he was a Managing Partner and led the medical technology practice for 13 years at SV Healthcare Ventures, a venture capital group with over $2.5 billion in assets under management. Before entering venture capital, Mr. Milne spent over 20 years as an operating executive in several medical technology companies including Boston Scientific, Becton Dickinson and SCIMED Life Systems. He has had a broad range of leadership positions in business development, marketing, product development and sales. David has been engaged with over 20 private and public company boards over his career including several in which he was a founding board member and/or a Chair of the Board. He currently advises several CEOs in industries focused on medical technology and data science. David has an MBA in Marketing from New York University and a BS in Biology from Rutgers University.
"I am honored to be named Chair of the Board at Asensus during this critical time in its market development and commercialization efforts," said David Milne. "I have been highly engaged with the Company for many years and truly believe Asensus Surgical's technology is very well placed to usher in a new era of digital surgery for surgeons, hospitals and patients.''
About Asensus Surgical, Inc.
Asensus Surgical, Inc. is digitizing the interface between the surgeon and patient to pioneer a new era of Performance-Guided Surgery by unlocking clinical intelligence for surgeons to enable consistently superior outcomes and a new standard of surgery. This builds upon the foundation of Digital Laparoscopy with the Senhance Surgical System powered by the Intelligent Surgical Unit™ (ISU™) to increase surgeon control and reduce surgical variability. With the addition of machine vision, augmented intelligence, and deep learning capabilities throughout the surgical experience, we intend to holistically address the current clinical, cognitive and economic shortcomings that drive surgical outcomes and value-based healthcare. Learn more about Performance-Guided Surgery and Digital Laparoscopy with the Senhance Surgical System here: www.senhance.com. Now available for sale in the US, EU, Japan, Russia, and select other countries. For a complete list of indications for use, visit: www.senhance.com/indications. For more information, visit www.asensus.com.
Mark Klausner or Mike Vallie, 443-213-0499
[email protected]
Kristin Schaeffer, 858-354-8850
CG Life
[email protected] | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 5,955 | [
128000,
2170,
13940,
71212,
9489,
31044,
8925,
16478,
38821,
198,
31294,
220,
2371,
11,
220,
2366,
16,
220,
2371,
25,
868,
5975,
18516,
6187,
4238,
4212,
198,
793,
44645,
55663,
38671,
67384,
11,
452,
732,
33501,
7,
41311,
24221,
468,
7618,
30721,
2170,
13940,
71212,
11,
4953,
13,
320,
68445,
3778,
25,
5871,
39046,
705,
264,
6593,
3756,
2883,
430,
374,
16099,
4954,
279,
3834,
1990,
279,
46098,
323,
279,
8893,
311,
54047,
264,
502,
11639,
315,
21304,
12279,
2480,
291,
48190,
16500,
11,
3432,
7376,
430,
7043,
5034,
53,
822,
10010,
11,
889,
706,
10434,
439,
279,
8351,
596,
8925,
16478,
2533,
220,
679,
18,
11,
690,
3094,
1523,
439,
16478,
304,
3389,
6664,
11,
323,
44330,
311,
5387,
279,
8925,
1603,
279,
842,
315,
279,
1060
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
2170,
13940,
71212,
9489,
31044,
8925,
16478,
38821,
198,
31294,
220,
2371,
11,
220,
2366,
16,
220,
2371,
25,
868,
5975,
18516,
6187,
4238,
4212,
198,
793,
44645,
55663,
38671,
67384,
11,
452,
732,
33501,
7,
41311,
24221,
468,
7618,
30721,
2170,
13940,
71212,
11,
4953,
13,
320,
68445,
3778,
25,
5871,
39046,
705,
264,
6593,
3756,
2883,
430,
374,
16099,
4954,
279,
3834,
1990,
279,
46098,
323,
279,
8893,
311,
54047,
264,
502,
11639,
315,
21304,
12279,
2480,
291,
48190,
16500,
11,
3432,
7376,
430,
7043,
5034,
53,
822,
10010,
11,
889,
706,
10434,
439,
279,
8351,
596,
8925,
16478,
2533,
220,
679,
18,
11,
690,
3094,
1523,
439,
16478,
304,
3389,
6664,
11,
323,
44330,
311,
5387,
279,
8925,
1603,
279,
842,
315,
279,
1060,
-100
] |
On the 8th of December 2017, guests attended a solemn event in Gabcíkovo (Slovakia) at the Headquarters of FEMERAID International – Slovak Unit (Komplexná Centrálna Záchranná Služba – KCZS – disaster relief unit), the humanitarian organisation of the Sovereign Order of Saint John of Jerusalem, Knights of Malta, Federation of the Autonomous Priories (KMFAP), where – in the presence of the staff and of numerous high-ranking executives, ministers and high officers – JUDr. Robert Kaliňák, Slovakian Interior Minister presented a new well-equipped fire truck to our Unit on behalf of the Ministry of Home Affairs.
These distinguished individuals have become members of this professional association.
After the formalities, the ceremony was closed by a reception and gala dinner with a friendly atmosphere. | {
"redpajama_set_name": "RedPajamaC4"
} | 8,822 | [
128000,
1966,
279,
220,
23,
339,
315,
6790,
220,
679,
22,
11,
15051,
18677,
264,
64702,
1567,
304,
480,
13997,
111086,
22460,
320,
50,
87210,
689,
8,
520,
279,
70736,
315,
435,
2783,
26763,
926,
7327,
1389,
62364,
8113,
320,
83143,
9289,
100645,
5838,
38468,
2312,
64,
108127,
17207,
1036,
1995,
6995,
84,
12453,
4749,
1389,
21764,
57,
50,
1389,
21426,
16337,
5089,
705,
279,
38748,
22139,
315,
279,
89321,
625,
7365,
315,
14539,
3842,
315,
26523,
11,
40676,
315,
61750,
11,
28331,
315,
279,
97548,
28885,
2490,
320,
42,
32707,
2599,
705,
1405,
1389,
304,
279,
9546,
315,
279,
5687,
323,
315,
12387,
1579,
72539,
29509,
11,
35050,
323,
1579,
9808,
1389,
622,
4760,
81,
13,
8563,
735,
8115,
100761,
72542,
11,
62364,
1122,
29958,
9675,
10666
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
1966,
279,
220,
23,
339,
315,
6790,
220,
679,
22,
11,
15051,
18677,
264,
64702,
1567,
304,
480,
13997,
111086,
22460,
320,
50,
87210,
689,
8,
520,
279,
70736,
315,
435,
2783,
26763,
926,
7327,
1389,
62364,
8113,
320,
83143,
9289,
100645,
5838,
38468,
2312,
64,
108127,
17207,
1036,
1995,
6995,
84,
12453,
4749,
1389,
21764,
57,
50,
1389,
21426,
16337,
5089,
705,
279,
38748,
22139,
315,
279,
89321,
625,
7365,
315,
14539,
3842,
315,
26523,
11,
40676,
315,
61750,
11,
28331,
315,
279,
97548,
28885,
2490,
320,
42,
32707,
2599,
705,
1405,
1389,
304,
279,
9546,
315,
279,
5687,
323,
315,
12387,
1579,
72539,
29509,
11,
35050,
323,
1579,
9808,
1389,
622,
4760,
81,
13,
8563,
735,
8115,
100761,
72542,
11,
62364,
1122,
29958,
9675,
10666,
-100
] |
/*************************************************************************/
/* variant.cpp */
/*************************************************************************/
/* This file is part of: */
/* GODOT ENGINE */
/* https://godotengine.org */
/*************************************************************************/
/* Copyright (c) 2007-2022 Juan Linietsky, Ariel Manzur. */
/* Copyright (c) 2014-2022 Godot Engine contributors (cf. AUTHORS.md). */
/* */
/* Permission is hereby granted, free of charge, to any person obtaining */
/* a copy of this software and associated documentation files (the */
/* "Software"), to deal in the Software without restriction, including */
/* without limitation the rights to use, copy, modify, merge, publish, */
/* distribute, sublicense, and/or sell copies of the Software, and to */
/* permit persons to whom the Software is furnished to do so, subject to */
/* the following conditions: */
/* */
/* The above copyright notice and this permission notice shall be */
/* included in all copies or substantial portions of the Software. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
/*************************************************************************/
#include "variant.h"
#include "core/core_string_names.h"
#include "core/debugger/engine_debugger.h"
#include "core/io/json.h"
#include "core/io/marshalls.h"
#include "core/io/resource.h"
#include "core/math/math_funcs.h"
#include "core/string/print_string.h"
#include "core/variant/variant_parser.h"
String Variant::get_type_name(Variant::Type p_type) {
switch (p_type) {
case NIL: {
return "Nil";
} break;
// atomic types
case BOOL: {
return "bool";
} break;
case INT: {
return "int";
} break;
case FLOAT: {
return "float";
} break;
case STRING: {
return "String";
} break;
// math types
case VECTOR2: {
return "Vector2";
} break;
case VECTOR2I: {
return "Vector2i";
} break;
case RECT2: {
return "Rect2";
} break;
case RECT2I: {
return "Rect2i";
} break;
case TRANSFORM2D: {
return "Transform2D";
} break;
case VECTOR3: {
return "Vector3";
} break;
case VECTOR3I: {
return "Vector3i";
} break;
case PLANE: {
return "Plane";
} break;
case AABB: {
return "AABB";
} break;
case QUATERNION: {
return "Quaternion";
} break;
case BASIS: {
return "Basis";
} break;
case TRANSFORM3D: {
return "Transform3D";
} break;
// misc types
case COLOR: {
return "Color";
} break;
case RID: {
return "RID";
} break;
case OBJECT: {
return "Object";
} break;
case CALLABLE: {
return "Callable";
} break;
case SIGNAL: {
return "Signal";
} break;
case STRING_NAME: {
return "StringName";
} break;
case NODE_PATH: {
return "NodePath";
} break;
case DICTIONARY: {
return "Dictionary";
} break;
case ARRAY: {
return "Array";
} break;
// arrays
case PACKED_BYTE_ARRAY: {
return "PackedByteArray";
} break;
case PACKED_INT32_ARRAY: {
return "PackedInt32Array";
} break;
case PACKED_INT64_ARRAY: {
return "PackedInt64Array";
} break;
case PACKED_FLOAT32_ARRAY: {
return "PackedFloat32Array";
} break;
case PACKED_FLOAT64_ARRAY: {
return "PackedFloat64Array";
} break;
case PACKED_STRING_ARRAY: {
return "PackedStringArray";
} break;
case PACKED_VECTOR2_ARRAY: {
return "PackedVector2Array";
} break;
case PACKED_VECTOR3_ARRAY: {
return "PackedVector3Array";
} break;
case PACKED_COLOR_ARRAY: {
return "PackedColorArray";
} break;
default: {
}
}
return "";
}
bool Variant::can_convert(Variant::Type p_type_from, Variant::Type p_type_to) {
if (p_type_from == p_type_to) {
return true;
}
if (p_type_to == NIL && p_type_from != NIL) { //nil can convert to anything
return true;
}
if (p_type_from == NIL) {
return (p_type_to == OBJECT);
}
const Type *valid_types = nullptr;
const Type *invalid_types = nullptr;
switch (p_type_to) {
case BOOL: {
static const Type valid[] = {
INT,
FLOAT,
STRING,
NIL,
};
valid_types = valid;
} break;
case INT: {
static const Type valid[] = {
BOOL,
FLOAT,
STRING,
NIL,
};
valid_types = valid;
} break;
case FLOAT: {
static const Type valid[] = {
BOOL,
INT,
STRING,
NIL,
};
valid_types = valid;
} break;
case STRING: {
static const Type invalid[] = {
OBJECT,
NIL
};
invalid_types = invalid;
} break;
case VECTOR2: {
static const Type valid[] = {
VECTOR2I,
NIL,
};
valid_types = valid;
} break;
case VECTOR2I: {
static const Type valid[] = {
VECTOR2,
NIL,
};
valid_types = valid;
} break;
case RECT2: {
static const Type valid[] = {
RECT2I,
NIL,
};
valid_types = valid;
} break;
case RECT2I: {
static const Type valid[] = {
RECT2,
NIL,
};
valid_types = valid;
} break;
case TRANSFORM2D: {
static const Type valid[] = {
TRANSFORM3D,
NIL
};
valid_types = valid;
} break;
case VECTOR3: {
static const Type valid[] = {
VECTOR3I,
NIL,
};
valid_types = valid;
} break;
case VECTOR3I: {
static const Type valid[] = {
VECTOR3,
NIL,
};
valid_types = valid;
} break;
case QUATERNION: {
static const Type valid[] = {
BASIS,
NIL
};
valid_types = valid;
} break;
case BASIS: {
static const Type valid[] = {
QUATERNION,
NIL
};
valid_types = valid;
} break;
case TRANSFORM3D: {
static const Type valid[] = {
TRANSFORM2D,
QUATERNION,
BASIS,
NIL
};
valid_types = valid;
} break;
case COLOR: {
static const Type valid[] = {
STRING,
INT,
NIL,
};
valid_types = valid;
} break;
case RID: {
static const Type valid[] = {
OBJECT,
NIL
};
valid_types = valid;
} break;
case OBJECT: {
static const Type valid[] = {
NIL
};
valid_types = valid;
} break;
case STRING_NAME: {
static const Type valid[] = {
STRING,
NIL
};
valid_types = valid;
} break;
case NODE_PATH: {
static const Type valid[] = {
STRING,
NIL
};
valid_types = valid;
} break;
case ARRAY: {
static const Type valid[] = {
PACKED_BYTE_ARRAY,
PACKED_INT32_ARRAY,
PACKED_INT64_ARRAY,
PACKED_FLOAT32_ARRAY,
PACKED_FLOAT64_ARRAY,
PACKED_STRING_ARRAY,
PACKED_COLOR_ARRAY,
PACKED_VECTOR2_ARRAY,
PACKED_VECTOR3_ARRAY,
NIL
};
valid_types = valid;
} break;
// arrays
case PACKED_BYTE_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_INT32_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_INT64_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_FLOAT32_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_FLOAT64_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_STRING_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_VECTOR2_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_VECTOR3_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_COLOR_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
default: {
}
}
if (valid_types) {
int i = 0;
while (valid_types[i] != NIL) {
if (p_type_from == valid_types[i]) {
return true;
}
i++;
}
} else if (invalid_types) {
int i = 0;
while (invalid_types[i] != NIL) {
if (p_type_from == invalid_types[i]) {
return false;
}
i++;
}
return true;
}
return false;
}
bool Variant::can_convert_strict(Variant::Type p_type_from, Variant::Type p_type_to) {
if (p_type_from == p_type_to) {
return true;
}
if (p_type_to == NIL && p_type_from != NIL) { //nil can convert to anything
return true;
}
if (p_type_from == NIL) {
return (p_type_to == OBJECT);
}
const Type *valid_types = nullptr;
switch (p_type_to) {
case BOOL: {
static const Type valid[] = {
INT,
FLOAT,
//STRING,
NIL,
};
valid_types = valid;
} break;
case INT: {
static const Type valid[] = {
BOOL,
FLOAT,
//STRING,
NIL,
};
valid_types = valid;
} break;
case FLOAT: {
static const Type valid[] = {
BOOL,
INT,
//STRING,
NIL,
};
valid_types = valid;
} break;
case STRING: {
static const Type valid[] = {
NODE_PATH,
STRING_NAME,
NIL
};
valid_types = valid;
} break;
case VECTOR2: {
static const Type valid[] = {
VECTOR2I,
NIL,
};
valid_types = valid;
} break;
case VECTOR2I: {
static const Type valid[] = {
VECTOR2,
NIL,
};
valid_types = valid;
} break;
case RECT2: {
static const Type valid[] = {
RECT2I,
NIL,
};
valid_types = valid;
} break;
case RECT2I: {
static const Type valid[] = {
RECT2,
NIL,
};
valid_types = valid;
} break;
case TRANSFORM2D: {
static const Type valid[] = {
TRANSFORM3D,
NIL
};
valid_types = valid;
} break;
case VECTOR3: {
static const Type valid[] = {
VECTOR3I,
NIL,
};
valid_types = valid;
} break;
case VECTOR3I: {
static const Type valid[] = {
VECTOR3,
NIL,
};
valid_types = valid;
} break;
case QUATERNION: {
static const Type valid[] = {
BASIS,
NIL
};
valid_types = valid;
} break;
case BASIS: {
static const Type valid[] = {
QUATERNION,
NIL
};
valid_types = valid;
} break;
case TRANSFORM3D: {
static const Type valid[] = {
TRANSFORM2D,
QUATERNION,
BASIS,
NIL
};
valid_types = valid;
} break;
case COLOR: {
static const Type valid[] = {
STRING,
INT,
NIL,
};
valid_types = valid;
} break;
case RID: {
static const Type valid[] = {
OBJECT,
NIL
};
valid_types = valid;
} break;
case OBJECT: {
static const Type valid[] = {
NIL
};
valid_types = valid;
} break;
case STRING_NAME: {
static const Type valid[] = {
STRING,
NIL
};
valid_types = valid;
} break;
case NODE_PATH: {
static const Type valid[] = {
STRING,
NIL
};
valid_types = valid;
} break;
case ARRAY: {
static const Type valid[] = {
PACKED_BYTE_ARRAY,
PACKED_INT32_ARRAY,
PACKED_INT64_ARRAY,
PACKED_FLOAT32_ARRAY,
PACKED_FLOAT64_ARRAY,
PACKED_STRING_ARRAY,
PACKED_COLOR_ARRAY,
PACKED_VECTOR2_ARRAY,
PACKED_VECTOR3_ARRAY,
NIL
};
valid_types = valid;
} break;
// arrays
case PACKED_BYTE_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_INT32_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_INT64_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_FLOAT32_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_FLOAT64_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_STRING_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_VECTOR2_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_VECTOR3_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
case PACKED_COLOR_ARRAY: {
static const Type valid[] = {
ARRAY,
NIL
};
valid_types = valid;
} break;
default: {
}
}
if (valid_types) {
int i = 0;
while (valid_types[i] != NIL) {
if (p_type_from == valid_types[i]) {
return true;
}
i++;
}
}
return false;
}
bool Variant::operator==(const Variant &p_variant) const {
return hash_compare(p_variant);
}
bool Variant::operator!=(const Variant &p_variant) const {
// Don't use `!hash_compare(p_variant)` given it makes use of OP_EQUAL
if (type != p_variant.type) { //evaluation of operator== needs to be more strict
return true;
}
bool v;
Variant r;
evaluate(OP_NOT_EQUAL, *this, p_variant, r, v);
return r;
}
bool Variant::operator<(const Variant &p_variant) const {
if (type != p_variant.type) { //if types differ, then order by type first
return type < p_variant.type;
}
bool v;
Variant r;
evaluate(OP_LESS, *this, p_variant, r, v);
return r;
}
bool Variant::is_zero() const {
switch (type) {
case NIL: {
return true;
} break;
// atomic types
case BOOL: {
return !(_data._bool);
} break;
case INT: {
return _data._int == 0;
} break;
case FLOAT: {
return _data._float == 0;
} break;
case STRING: {
return *reinterpret_cast<const String *>(_data._mem) == String();
} break;
// math types
case VECTOR2: {
return *reinterpret_cast<const Vector2 *>(_data._mem) == Vector2();
} break;
case VECTOR2I: {
return *reinterpret_cast<const Vector2i *>(_data._mem) == Vector2i();
} break;
case RECT2: {
return *reinterpret_cast<const Rect2 *>(_data._mem) == Rect2();
} break;
case RECT2I: {
return *reinterpret_cast<const Rect2i *>(_data._mem) == Rect2i();
} break;
case TRANSFORM2D: {
return *_data._transform2d == Transform2D();
} break;
case VECTOR3: {
return *reinterpret_cast<const Vector3 *>(_data._mem) == Vector3();
} break;
case VECTOR3I: {
return *reinterpret_cast<const Vector3i *>(_data._mem) == Vector3i();
} break;
case PLANE: {
return *reinterpret_cast<const Plane *>(_data._mem) == Plane();
} break;
case AABB: {
return *_data._aabb == ::AABB();
} break;
case QUATERNION: {
return *reinterpret_cast<const Quaternion *>(_data._mem) == Quaternion();
} break;
case BASIS: {
return *_data._basis == Basis();
} break;
case TRANSFORM3D: {
return *_data._transform3d == Transform3D();
} break;
// misc types
case COLOR: {
return *reinterpret_cast<const Color *>(_data._mem) == Color();
} break;
case RID: {
return *reinterpret_cast<const ::RID *>(_data._mem) == ::RID();
} break;
case OBJECT: {
return _get_obj().obj == nullptr;
} break;
case CALLABLE: {
return reinterpret_cast<const Callable *>(_data._mem)->is_null();
} break;
case SIGNAL: {
return reinterpret_cast<const Signal *>(_data._mem)->is_null();
} break;
case STRING_NAME: {
return *reinterpret_cast<const StringName *>(_data._mem) != StringName();
} break;
case NODE_PATH: {
return reinterpret_cast<const NodePath *>(_data._mem)->is_empty();
} break;
case DICTIONARY: {
return reinterpret_cast<const Dictionary *>(_data._mem)->is_empty();
} break;
case ARRAY: {
return reinterpret_cast<const Array *>(_data._mem)->is_empty();
} break;
// arrays
case PACKED_BYTE_ARRAY: {
return PackedArrayRef<uint8_t>::get_array(_data.packed_array).size() == 0;
} break;
case PACKED_INT32_ARRAY: {
return PackedArrayRef<int32_t>::get_array(_data.packed_array).size() == 0;
} break;
case PACKED_INT64_ARRAY: {
return PackedArrayRef<int64_t>::get_array(_data.packed_array).size() == 0;
} break;
case PACKED_FLOAT32_ARRAY: {
return PackedArrayRef<float>::get_array(_data.packed_array).size() == 0;
} break;
case PACKED_FLOAT64_ARRAY: {
return PackedArrayRef<double>::get_array(_data.packed_array).size() == 0;
} break;
case PACKED_STRING_ARRAY: {
return PackedArrayRef<String>::get_array(_data.packed_array).size() == 0;
} break;
case PACKED_VECTOR2_ARRAY: {
return PackedArrayRef<Vector2>::get_array(_data.packed_array).size() == 0;
} break;
case PACKED_VECTOR3_ARRAY: {
return PackedArrayRef<Vector3>::get_array(_data.packed_array).size() == 0;
} break;
case PACKED_COLOR_ARRAY: {
return PackedArrayRef<Color>::get_array(_data.packed_array).size() == 0;
} break;
default: {
}
}
return false;
}
bool Variant::is_one() const {
switch (type) {
case NIL: {
return true;
} break;
// atomic types
case BOOL: {
return _data._bool;
} break;
case INT: {
return _data._int == 1;
} break;
case FLOAT: {
return _data._float == 1;
} break;
case VECTOR2: {
return *reinterpret_cast<const Vector2 *>(_data._mem) == Vector2(1, 1);
} break;
case VECTOR2I: {
return *reinterpret_cast<const Vector2i *>(_data._mem) == Vector2i(1, 1);
} break;
case RECT2: {
return *reinterpret_cast<const Rect2 *>(_data._mem) == Rect2(1, 1, 1, 1);
} break;
case RECT2I: {
return *reinterpret_cast<const Rect2i *>(_data._mem) == Rect2i(1, 1, 1, 1);
} break;
case VECTOR3: {
return *reinterpret_cast<const Vector3 *>(_data._mem) == Vector3(1, 1, 1);
} break;
case VECTOR3I: {
return *reinterpret_cast<const Vector3i *>(_data._mem) == Vector3i(1, 1, 1);
} break;
case PLANE: {
return *reinterpret_cast<const Plane *>(_data._mem) == Plane(1, 1, 1, 1);
} break;
case COLOR: {
return *reinterpret_cast<const Color *>(_data._mem) == Color(1, 1, 1, 1);
} break;
default: {
return !is_zero();
}
}
return false;
}
bool Variant::is_null() const {
if (type == OBJECT && _get_obj().obj) {
return false;
} else {
return true;
}
}
void Variant::reference(const Variant &p_variant) {
switch (type) {
case NIL:
case BOOL:
case INT:
case FLOAT:
break;
default:
clear();
}
type = p_variant.type;
switch (p_variant.type) {
case NIL: {
// none
} break;
// atomic types
case BOOL: {
_data._bool = p_variant._data._bool;
} break;
case INT: {
_data._int = p_variant._data._int;
} break;
case FLOAT: {
_data._float = p_variant._data._float;
} break;
case STRING: {
memnew_placement(_data._mem, String(*reinterpret_cast<const String *>(p_variant._data._mem)));
} break;
// math types
case VECTOR2: {
memnew_placement(_data._mem, Vector2(*reinterpret_cast<const Vector2 *>(p_variant._data._mem)));
} break;
case VECTOR2I: {
memnew_placement(_data._mem, Vector2i(*reinterpret_cast<const Vector2i *>(p_variant._data._mem)));
} break;
case RECT2: {
memnew_placement(_data._mem, Rect2(*reinterpret_cast<const Rect2 *>(p_variant._data._mem)));
} break;
case RECT2I: {
memnew_placement(_data._mem, Rect2i(*reinterpret_cast<const Rect2i *>(p_variant._data._mem)));
} break;
case TRANSFORM2D: {
_data._transform2d = memnew(Transform2D(*p_variant._data._transform2d));
} break;
case VECTOR3: {
memnew_placement(_data._mem, Vector3(*reinterpret_cast<const Vector3 *>(p_variant._data._mem)));
} break;
case VECTOR3I: {
memnew_placement(_data._mem, Vector3i(*reinterpret_cast<const Vector3i *>(p_variant._data._mem)));
} break;
case PLANE: {
memnew_placement(_data._mem, Plane(*reinterpret_cast<const Plane *>(p_variant._data._mem)));
} break;
case AABB: {
_data._aabb = memnew(::AABB(*p_variant._data._aabb));
} break;
case QUATERNION: {
memnew_placement(_data._mem, Quaternion(*reinterpret_cast<const Quaternion *>(p_variant._data._mem)));
} break;
case BASIS: {
_data._basis = memnew(Basis(*p_variant._data._basis));
} break;
case TRANSFORM3D: {
_data._transform3d = memnew(Transform3D(*p_variant._data._transform3d));
} break;
// misc types
case COLOR: {
memnew_placement(_data._mem, Color(*reinterpret_cast<const Color *>(p_variant._data._mem)));
} break;
case RID: {
memnew_placement(_data._mem, ::RID(*reinterpret_cast<const ::RID *>(p_variant._data._mem)));
} break;
case OBJECT: {
memnew_placement(_data._mem, ObjData);
if (p_variant._get_obj().obj && p_variant._get_obj().id.is_ref_counted()) {
RefCounted *ref_counted = static_cast<RefCounted *>(p_variant._get_obj().obj);
if (!ref_counted->reference()) {
_get_obj().obj = nullptr;
_get_obj().id = ObjectID();
break;
}
}
_get_obj().obj = const_cast<Object *>(p_variant._get_obj().obj);
_get_obj().id = p_variant._get_obj().id;
} break;
case CALLABLE: {
memnew_placement(_data._mem, Callable(*reinterpret_cast<const Callable *>(p_variant._data._mem)));
} break;
case SIGNAL: {
memnew_placement(_data._mem, Signal(*reinterpret_cast<const Signal *>(p_variant._data._mem)));
} break;
case STRING_NAME: {
memnew_placement(_data._mem, StringName(*reinterpret_cast<const StringName *>(p_variant._data._mem)));
} break;
case NODE_PATH: {
memnew_placement(_data._mem, NodePath(*reinterpret_cast<const NodePath *>(p_variant._data._mem)));
} break;
case DICTIONARY: {
memnew_placement(_data._mem, Dictionary(*reinterpret_cast<const Dictionary *>(p_variant._data._mem)));
} break;
case ARRAY: {
memnew_placement(_data._mem, Array(*reinterpret_cast<const Array *>(p_variant._data._mem)));
} break;
// arrays
case PACKED_BYTE_ARRAY: {
_data.packed_array = static_cast<PackedArrayRef<uint8_t> *>(p_variant._data.packed_array)->reference();
if (!_data.packed_array) {
_data.packed_array = PackedArrayRef<uint8_t>::create();
}
} break;
case PACKED_INT32_ARRAY: {
_data.packed_array = static_cast<PackedArrayRef<int32_t> *>(p_variant._data.packed_array)->reference();
if (!_data.packed_array) {
_data.packed_array = PackedArrayRef<int32_t>::create();
}
} break;
case PACKED_INT64_ARRAY: {
_data.packed_array = static_cast<PackedArrayRef<int64_t> *>(p_variant._data.packed_array)->reference();
if (!_data.packed_array) {
_data.packed_array = PackedArrayRef<int64_t>::create();
}
} break;
case PACKED_FLOAT32_ARRAY: {
_data.packed_array = static_cast<PackedArrayRef<float> *>(p_variant._data.packed_array)->reference();
if (!_data.packed_array) {
_data.packed_array = PackedArrayRef<float>::create();
}
} break;
case PACKED_FLOAT64_ARRAY: {
_data.packed_array = static_cast<PackedArrayRef<double> *>(p_variant._data.packed_array)->reference();
if (!_data.packed_array) {
_data.packed_array = PackedArrayRef<double>::create();
}
} break;
case PACKED_STRING_ARRAY: {
_data.packed_array = static_cast<PackedArrayRef<String> *>(p_variant._data.packed_array)->reference();
if (!_data.packed_array) {
_data.packed_array = PackedArrayRef<String>::create();
}
} break;
case PACKED_VECTOR2_ARRAY: {
_data.packed_array = static_cast<PackedArrayRef<Vector2> *>(p_variant._data.packed_array)->reference();
if (!_data.packed_array) {
_data.packed_array = PackedArrayRef<Vector2>::create();
}
} break;
case PACKED_VECTOR3_ARRAY: {
_data.packed_array = static_cast<PackedArrayRef<Vector3> *>(p_variant._data.packed_array)->reference();
if (!_data.packed_array) {
_data.packed_array = PackedArrayRef<Vector3>::create();
}
} break;
case PACKED_COLOR_ARRAY: {
_data.packed_array = static_cast<PackedArrayRef<Color> *>(p_variant._data.packed_array)->reference();
if (!_data.packed_array) {
_data.packed_array = PackedArrayRef<Color>::create();
}
} break;
default: {
}
}
}
void Variant::zero() {
switch (type) {
case NIL:
break;
case BOOL:
this->_data._bool = false;
break;
case INT:
this->_data._int = 0;
break;
case FLOAT:
this->_data._float = 0;
break;
case VECTOR2:
*reinterpret_cast<Vector2 *>(this->_data._mem) = Vector2();
break;
case VECTOR2I:
*reinterpret_cast<Vector2i *>(this->_data._mem) = Vector2i();
break;
case RECT2:
*reinterpret_cast<Rect2 *>(this->_data._mem) = Rect2();
break;
case RECT2I:
*reinterpret_cast<Rect2i *>(this->_data._mem) = Rect2i();
break;
case VECTOR3:
*reinterpret_cast<Vector3 *>(this->_data._mem) = Vector3();
break;
case VECTOR3I:
*reinterpret_cast<Vector3i *>(this->_data._mem) = Vector3i();
break;
case PLANE:
*reinterpret_cast<Plane *>(this->_data._mem) = Plane();
break;
case QUATERNION:
*reinterpret_cast<Quaternion *>(this->_data._mem) = Quaternion();
break;
case COLOR:
*reinterpret_cast<Color *>(this->_data._mem) = Color();
break;
default:
this->clear();
break;
}
}
void Variant::_clear_internal() {
switch (type) {
case STRING: {
reinterpret_cast<String *>(_data._mem)->~String();
} break;
/*
// no point, they don't allocate memory
VECTOR3,
PLANE,
QUATERNION,
COLOR,
VECTOR2,
RECT2
*/
case TRANSFORM2D: {
memdelete(_data._transform2d);
} break;
case AABB: {
memdelete(_data._aabb);
} break;
case BASIS: {
memdelete(_data._basis);
} break;
case TRANSFORM3D: {
memdelete(_data._transform3d);
} break;
// misc types
case STRING_NAME: {
reinterpret_cast<StringName *>(_data._mem)->~StringName();
} break;
case NODE_PATH: {
reinterpret_cast<NodePath *>(_data._mem)->~NodePath();
} break;
case OBJECT: {
if (_get_obj().id.is_ref_counted()) {
//we are safe that there is a reference here
RefCounted *ref_counted = static_cast<RefCounted *>(_get_obj().obj);
if (ref_counted->unreference()) {
memdelete(ref_counted);
}
}
_get_obj().obj = nullptr;
_get_obj().id = ObjectID();
} break;
case RID: {
// not much need probably
// Can't seem to use destructor + scoping operator, so hack.
typedef ::RID RID_Class;
reinterpret_cast<RID_Class *>(_data._mem)->~RID_Class();
} break;
case CALLABLE: {
reinterpret_cast<Callable *>(_data._mem)->~Callable();
} break;
case SIGNAL: {
reinterpret_cast<Signal *>(_data._mem)->~Signal();
} break;
case DICTIONARY: {
reinterpret_cast<Dictionary *>(_data._mem)->~Dictionary();
} break;
case ARRAY: {
reinterpret_cast<Array *>(_data._mem)->~Array();
} break;
// arrays
case PACKED_BYTE_ARRAY: {
PackedArrayRefBase::destroy(_data.packed_array);
} break;
case PACKED_INT32_ARRAY: {
PackedArrayRefBase::destroy(_data.packed_array);
} break;
case PACKED_INT64_ARRAY: {
PackedArrayRefBase::destroy(_data.packed_array);
} break;
case PACKED_FLOAT32_ARRAY: {
PackedArrayRefBase::destroy(_data.packed_array);
} break;
case PACKED_FLOAT64_ARRAY: {
PackedArrayRefBase::destroy(_data.packed_array);
} break;
case PACKED_STRING_ARRAY: {
PackedArrayRefBase::destroy(_data.packed_array);
} break;
case PACKED_VECTOR2_ARRAY: {
PackedArrayRefBase::destroy(_data.packed_array);
} break;
case PACKED_VECTOR3_ARRAY: {
PackedArrayRefBase::destroy(_data.packed_array);
} break;
case PACKED_COLOR_ARRAY: {
PackedArrayRefBase::destroy(_data.packed_array);
} break;
default: {
} /* not needed */
}
}
Variant::operator signed int() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1 : 0;
case INT:
return _data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_int();
default: {
return 0;
}
}
}
Variant::operator unsigned int() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1 : 0;
case INT:
return _data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_int();
default: {
return 0;
}
}
}
Variant::operator int64_t() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1 : 0;
case INT:
return _data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_int();
default: {
return 0;
}
}
}
Variant::operator uint64_t() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1 : 0;
case INT:
return _data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_int();
default: {
return 0;
}
}
}
Variant::operator ObjectID() const {
if (type == INT) {
return ObjectID(_data._int);
} else if (type == OBJECT) {
return _get_obj().id;
} else {
return ObjectID();
}
}
#ifdef NEED_LONG_INT
Variant::operator signed long() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1 : 0;
case INT:
return _data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_int();
default: {
return 0;
}
}
return 0;
}
Variant::operator unsigned long() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1 : 0;
case INT:
return _data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_int();
default: {
return 0;
}
}
return 0;
}
#endif
Variant::operator signed short() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1 : 0;
case INT:
return _data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_int();
default: {
return 0;
}
}
}
Variant::operator unsigned short() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1 : 0;
case INT:
return _data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_int();
default: {
return 0;
}
}
}
Variant::operator signed char() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1 : 0;
case INT:
return _data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_int();
default: {
return 0;
}
}
}
Variant::operator unsigned char() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1 : 0;
case INT:
return _data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_int();
default: {
return 0;
}
}
}
Variant::operator char32_t() const {
return operator unsigned int();
}
Variant::operator float() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1.0 : 0.0;
case INT:
return (float)_data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_float();
default: {
return 0;
}
}
}
Variant::operator double() const {
switch (type) {
case NIL:
return 0;
case BOOL:
return _data._bool ? 1.0 : 0.0;
case INT:
return (double)_data._int;
case FLOAT:
return _data._float;
case STRING:
return operator String().to_float();
default: {
return 0;
}
}
}
Variant::operator StringName() const {
if (type == STRING_NAME) {
return *reinterpret_cast<const StringName *>(_data._mem);
} else if (type == STRING) {
return *reinterpret_cast<const String *>(_data._mem);
}
return StringName();
}
struct _VariantStrPair {
String key;
String value;
bool operator<(const _VariantStrPair &p) const {
return key < p.key;
}
};
Variant::operator String() const {
return stringify(0);
}
template <class T>
String stringify_vector(const T &vec, int recursion_count) {
String str("[");
for (int i = 0; i < vec.size(); i++) {
if (i > 0) {
str += ", ";
}
str = str + Variant(vec[i]).stringify(recursion_count);
}
str += "]";
return str;
}
String Variant::stringify(int recursion_count) const {
switch (type) {
case NIL:
return "null";
case BOOL:
return _data._bool ? "true" : "false";
case INT:
return itos(_data._int);
case FLOAT:
return rtos(_data._float);
case STRING:
return *reinterpret_cast<const String *>(_data._mem);
case VECTOR2:
return operator Vector2();
case VECTOR2I:
return operator Vector2i();
case RECT2:
return operator Rect2();
case RECT2I:
return operator Rect2i();
case TRANSFORM2D:
return operator Transform2D();
case VECTOR3:
return operator Vector3();
case VECTOR3I:
return operator Vector3i();
case PLANE:
return operator Plane();
case AABB:
return operator ::AABB();
case QUATERNION:
return operator Quaternion();
case BASIS:
return operator Basis();
case TRANSFORM3D:
return operator Transform3D();
case STRING_NAME:
return operator StringName();
case NODE_PATH:
return operator NodePath();
case COLOR:
return operator Color();
case DICTIONARY: {
const Dictionary &d = *reinterpret_cast<const Dictionary *>(_data._mem);
if (recursion_count > MAX_RECURSION) {
ERR_PRINT("Max recursion reached");
return "{...}";
}
String str("{");
List<Variant> keys;
d.get_key_list(&keys);
Vector<_VariantStrPair> pairs;
recursion_count++;
for (List<Variant>::Element *E = keys.front(); E; E = E->next()) {
_VariantStrPair sp;
sp.key = E->get().stringify(recursion_count);
sp.value = d[E->get()].stringify(recursion_count);
pairs.push_back(sp);
}
for (int i = 0; i < pairs.size(); i++) {
if (i > 0) {
str += ", ";
}
str += pairs[i].key + ":" + pairs[i].value;
}
str += "}";
return str;
} break;
case PACKED_VECTOR2_ARRAY: {
return stringify_vector(operator Vector<Vector2>(), recursion_count);
} break;
case PACKED_VECTOR3_ARRAY: {
return stringify_vector(operator Vector<Vector3>(), recursion_count);
} break;
case PACKED_COLOR_ARRAY: {
return stringify_vector(operator Vector<Color>(), recursion_count);
} break;
case PACKED_STRING_ARRAY: {
return stringify_vector(operator Vector<String>(), recursion_count);
} break;
case PACKED_BYTE_ARRAY: {
return stringify_vector(operator Vector<uint8_t>(), recursion_count);
} break;
case PACKED_INT32_ARRAY: {
return stringify_vector(operator Vector<int32_t>(), recursion_count);
} break;
case PACKED_INT64_ARRAY: {
return stringify_vector(operator Vector<int64_t>(), recursion_count);
} break;
case PACKED_FLOAT32_ARRAY: {
return stringify_vector(operator Vector<float>(), recursion_count);
} break;
case PACKED_FLOAT64_ARRAY: {
return stringify_vector(operator Vector<double>(), recursion_count);
} break;
case ARRAY: {
Array arr = operator Array();
if (recursion_count > MAX_RECURSION) {
ERR_PRINT("Max recursion reached");
return "[...]";
}
String str = stringify_vector(arr, recursion_count);
return str;
} break;
case OBJECT: {
if (_get_obj().obj) {
if (!_get_obj().id.is_ref_counted() && ObjectDB::get_instance(_get_obj().id) == nullptr) {
return "[Freed Object]";
}
return _get_obj().obj->to_string();
} else {
return "[Object:null]";
}
} break;
case CALLABLE: {
const Callable &c = *reinterpret_cast<const Callable *>(_data._mem);
return c;
} break;
case SIGNAL: {
const Signal &s = *reinterpret_cast<const Signal *>(_data._mem);
return s;
} break;
case RID: {
const ::RID &s = *reinterpret_cast<const ::RID *>(_data._mem);
return "RID(" + itos(s.get_id()) + ")";
} break;
default: {
return "[" + get_type_name(type) + "]";
}
}
return "";
}
String Variant::to_json_string() const {
JSON json;
return json.stringify(*this);
}
Variant::operator Vector2() const {
if (type == VECTOR2) {
return *reinterpret_cast<const Vector2 *>(_data._mem);
} else if (type == VECTOR2I) {
return *reinterpret_cast<const Vector2i *>(_data._mem);
} else if (type == VECTOR3) {
return Vector2(reinterpret_cast<const Vector3 *>(_data._mem)->x, reinterpret_cast<const Vector3 *>(_data._mem)->y);
} else if (type == VECTOR3I) {
return Vector2(reinterpret_cast<const Vector3i *>(_data._mem)->x, reinterpret_cast<const Vector3i *>(_data._mem)->y);
} else {
return Vector2();
}
}
Variant::operator Vector2i() const {
if (type == VECTOR2I) {
return *reinterpret_cast<const Vector2i *>(_data._mem);
} else if (type == VECTOR2) {
return *reinterpret_cast<const Vector2 *>(_data._mem);
} else if (type == VECTOR3) {
return Vector2(reinterpret_cast<const Vector3 *>(_data._mem)->x, reinterpret_cast<const Vector3 *>(_data._mem)->y);
} else if (type == VECTOR3I) {
return Vector2(reinterpret_cast<const Vector3i *>(_data._mem)->x, reinterpret_cast<const Vector3i *>(_data._mem)->y);
} else {
return Vector2i();
}
}
Variant::operator Rect2() const {
if (type == RECT2) {
return *reinterpret_cast<const Rect2 *>(_data._mem);
} else if (type == RECT2I) {
return *reinterpret_cast<const Rect2i *>(_data._mem);
} else {
return Rect2();
}
}
Variant::operator Rect2i() const {
if (type == RECT2I) {
return *reinterpret_cast<const Rect2i *>(_data._mem);
} else if (type == RECT2) {
return *reinterpret_cast<const Rect2 *>(_data._mem);
} else {
return Rect2i();
}
}
Variant::operator Vector3() const {
if (type == VECTOR3) {
return *reinterpret_cast<const Vector3 *>(_data._mem);
} else if (type == VECTOR3I) {
return *reinterpret_cast<const Vector3i *>(_data._mem);
} else if (type == VECTOR2) {
return Vector3(reinterpret_cast<const Vector2 *>(_data._mem)->x, reinterpret_cast<const Vector2 *>(_data._mem)->y, 0.0);
} else if (type == VECTOR2I) {
return Vector3(reinterpret_cast<const Vector2i *>(_data._mem)->x, reinterpret_cast<const Vector2i *>(_data._mem)->y, 0.0);
} else {
return Vector3();
}
}
Variant::operator Vector3i() const {
if (type == VECTOR3I) {
return *reinterpret_cast<const Vector3i *>(_data._mem);
} else if (type == VECTOR3) {
return *reinterpret_cast<const Vector3 *>(_data._mem);
} else if (type == VECTOR2) {
return Vector3i(reinterpret_cast<const Vector2 *>(_data._mem)->x, reinterpret_cast<const Vector2 *>(_data._mem)->y, 0.0);
} else if (type == VECTOR2I) {
return Vector3i(reinterpret_cast<const Vector2i *>(_data._mem)->x, reinterpret_cast<const Vector2i *>(_data._mem)->y, 0.0);
} else {
return Vector3i();
}
}
Variant::operator Plane() const {
if (type == PLANE) {
return *reinterpret_cast<const Plane *>(_data._mem);
} else {
return Plane();
}
}
Variant::operator ::AABB() const {
if (type == AABB) {
return *_data._aabb;
} else {
return ::AABB();
}
}
Variant::operator Basis() const {
if (type == BASIS) {
return *_data._basis;
} else if (type == QUATERNION) {
return *reinterpret_cast<const Quaternion *>(_data._mem);
} else if (type == TRANSFORM3D) { // unexposed in Variant::can_convert?
return _data._transform3d->basis;
} else {
return Basis();
}
}
Variant::operator Quaternion() const {
if (type == QUATERNION) {
return *reinterpret_cast<const Quaternion *>(_data._mem);
} else if (type == BASIS) {
return *_data._basis;
} else if (type == TRANSFORM3D) {
return _data._transform3d->basis;
} else {
return Quaternion();
}
}
Variant::operator Transform3D() const {
if (type == TRANSFORM3D) {
return *_data._transform3d;
} else if (type == BASIS) {
return Transform3D(*_data._basis, Vector3());
} else if (type == QUATERNION) {
return Transform3D(Basis(*reinterpret_cast<const Quaternion *>(_data._mem)), Vector3());
} else if (type == TRANSFORM2D) {
const Transform2D &t = *_data._transform2d;
Transform3D m;
m.basis.elements[0][0] = t.elements[0][0];
m.basis.elements[1][0] = t.elements[0][1];
m.basis.elements[0][1] = t.elements[1][0];
m.basis.elements[1][1] = t.elements[1][1];
m.origin[0] = t.elements[2][0];
m.origin[1] = t.elements[2][1];
return m;
} else {
return Transform3D();
}
}
Variant::operator Transform2D() const {
if (type == TRANSFORM2D) {
return *_data._transform2d;
} else if (type == TRANSFORM3D) {
const Transform3D &t = *_data._transform3d;
Transform2D m;
m.elements[0][0] = t.basis.elements[0][0];
m.elements[0][1] = t.basis.elements[1][0];
m.elements[1][0] = t.basis.elements[0][1];
m.elements[1][1] = t.basis.elements[1][1];
m.elements[2][0] = t.origin[0];
m.elements[2][1] = t.origin[1];
return m;
} else {
return Transform2D();
}
}
Variant::operator Color() const {
if (type == COLOR) {
return *reinterpret_cast<const Color *>(_data._mem);
} else if (type == STRING) {
return Color(operator String());
} else if (type == INT) {
return Color::hex(operator int());
} else {
return Color();
}
}
Variant::operator NodePath() const {
if (type == NODE_PATH) {
return *reinterpret_cast<const NodePath *>(_data._mem);
} else if (type == STRING) {
return NodePath(operator String());
} else {
return NodePath();
}
}
Variant::operator ::RID() const {
if (type == RID) {
return *reinterpret_cast<const ::RID *>(_data._mem);
} else if (type == OBJECT && _get_obj().obj == nullptr) {
return ::RID();
} else if (type == OBJECT && _get_obj().obj) {
#ifdef DEBUG_ENABLED
if (EngineDebugger::is_active()) {
ERR_FAIL_COND_V_MSG(ObjectDB::get_instance(_get_obj().id) == nullptr, ::RID(), "Invalid pointer (object was freed).");
}
#endif
Callable::CallError ce;
Variant ret = _get_obj().obj->call(CoreStringNames::get_singleton()->get_rid, nullptr, 0, ce);
if (ce.error == Callable::CallError::CALL_OK && ret.get_type() == Variant::RID) {
return ret;
}
return ::RID();
} else {
return ::RID();
}
}
Variant::operator Object *() const {
if (type == OBJECT) {
return _get_obj().obj;
} else {
return nullptr;
}
}
Object *Variant::get_validated_object_with_check(bool &r_previously_freed) const {
if (type == OBJECT) {
Object *instance = ObjectDB::get_instance(_get_obj().id);
r_previously_freed = !instance && _get_obj().id != ObjectID();
return instance;
} else {
r_previously_freed = false;
return nullptr;
}
}
Object *Variant::get_validated_object() const {
if (type == OBJECT) {
return ObjectDB::get_instance(_get_obj().id);
} else {
return nullptr;
}
}
Variant::operator Dictionary() const {
if (type == DICTIONARY) {
return *reinterpret_cast<const Dictionary *>(_data._mem);
} else {
return Dictionary();
}
}
Variant::operator Callable() const {
if (type == CALLABLE) {
return *reinterpret_cast<const Callable *>(_data._mem);
} else {
return Callable();
}
}
Variant::operator Signal() const {
if (type == SIGNAL) {
return *reinterpret_cast<const Signal *>(_data._mem);
} else {
return Signal();
}
}
template <class DA, class SA>
inline DA _convert_array(const SA &p_array) {
DA da;
da.resize(p_array.size());
for (int i = 0; i < p_array.size(); i++) {
da.set(i, Variant(p_array.get(i)));
}
return da;
}
template <class DA>
inline DA _convert_array_from_variant(const Variant &p_variant) {
switch (p_variant.get_type()) {
case Variant::ARRAY: {
return _convert_array<DA, Array>(p_variant.operator Array());
}
case Variant::PACKED_BYTE_ARRAY: {
return _convert_array<DA, Vector<uint8_t>>(p_variant.operator Vector<uint8_t>());
}
case Variant::PACKED_INT32_ARRAY: {
return _convert_array<DA, Vector<int32_t>>(p_variant.operator Vector<int32_t>());
}
case Variant::PACKED_INT64_ARRAY: {
return _convert_array<DA, Vector<int64_t>>(p_variant.operator Vector<int64_t>());
}
case Variant::PACKED_FLOAT32_ARRAY: {
return _convert_array<DA, Vector<float>>(p_variant.operator Vector<float>());
}
case Variant::PACKED_FLOAT64_ARRAY: {
return _convert_array<DA, Vector<double>>(p_variant.operator Vector<double>());
}
case Variant::PACKED_STRING_ARRAY: {
return _convert_array<DA, Vector<String>>(p_variant.operator Vector<String>());
}
case Variant::PACKED_VECTOR2_ARRAY: {
return _convert_array<DA, Vector<Vector2>>(p_variant.operator Vector<Vector2>());
}
case Variant::PACKED_VECTOR3_ARRAY: {
return _convert_array<DA, Vector<Vector3>>(p_variant.operator Vector<Vector3>());
}
case Variant::PACKED_COLOR_ARRAY: {
return _convert_array<DA, Vector<Color>>(p_variant.operator Vector<Color>());
}
default: {
return DA();
}
}
}
Variant::operator Array() const {
if (type == ARRAY) {
return *reinterpret_cast<const Array *>(_data._mem);
} else {
return _convert_array_from_variant<Array>(*this);
}
}
Variant::operator Vector<uint8_t>() const {
if (type == PACKED_BYTE_ARRAY) {
return static_cast<PackedArrayRef<uint8_t> *>(_data.packed_array)->array;
} else {
return _convert_array_from_variant<Vector<uint8_t>>(*this);
}
}
Variant::operator Vector<int32_t>() const {
if (type == PACKED_INT32_ARRAY) {
return static_cast<PackedArrayRef<int32_t> *>(_data.packed_array)->array;
} else {
return _convert_array_from_variant<Vector<int>>(*this);
}
}
Variant::operator Vector<int64_t>() const {
if (type == PACKED_INT64_ARRAY) {
return static_cast<PackedArrayRef<int64_t> *>(_data.packed_array)->array;
} else {
return _convert_array_from_variant<Vector<int64_t>>(*this);
}
}
Variant::operator Vector<float>() const {
if (type == PACKED_FLOAT32_ARRAY) {
return static_cast<PackedArrayRef<float> *>(_data.packed_array)->array;
} else {
return _convert_array_from_variant<Vector<float>>(*this);
}
}
Variant::operator Vector<double>() const {
if (type == PACKED_FLOAT64_ARRAY) {
return static_cast<PackedArrayRef<double> *>(_data.packed_array)->array;
} else {
return _convert_array_from_variant<Vector<double>>(*this);
}
}
Variant::operator Vector<String>() const {
if (type == PACKED_STRING_ARRAY) {
return static_cast<PackedArrayRef<String> *>(_data.packed_array)->array;
} else {
return _convert_array_from_variant<Vector<String>>(*this);
}
}
Variant::operator Vector<Vector3>() const {
if (type == PACKED_VECTOR3_ARRAY) {
return static_cast<PackedArrayRef<Vector3> *>(_data.packed_array)->array;
} else {
return _convert_array_from_variant<Vector<Vector3>>(*this);
}
}
Variant::operator Vector<Vector2>() const {
if (type == PACKED_VECTOR2_ARRAY) {
return static_cast<PackedArrayRef<Vector2> *>(_data.packed_array)->array;
} else {
return _convert_array_from_variant<Vector<Vector2>>(*this);
}
}
Variant::operator Vector<Color>() const {
if (type == PACKED_COLOR_ARRAY) {
return static_cast<PackedArrayRef<Color> *>(_data.packed_array)->array;
} else {
return _convert_array_from_variant<Vector<Color>>(*this);
}
}
/* helpers */
Variant::operator Vector<::RID>() const {
Array va = operator Array();
Vector<::RID> rids;
rids.resize(va.size());
for (int i = 0; i < rids.size(); i++) {
rids.write[i] = va[i];
}
return rids;
}
Variant::operator Vector<Plane>() const {
Array va = operator Array();
Vector<Plane> planes;
int va_size = va.size();
if (va_size == 0) {
return planes;
}
planes.resize(va_size);
Plane *w = planes.ptrw();
for (int i = 0; i < va_size; i++) {
w[i] = va[i];
}
return planes;
}
Variant::operator Vector<Face3>() const {
Vector<Vector3> va = operator Vector<Vector3>();
Vector<Face3> faces;
int va_size = va.size();
if (va_size == 0) {
return faces;
}
faces.resize(va_size / 3);
Face3 *w = faces.ptrw();
const Vector3 *r = va.ptr();
for (int i = 0; i < va_size; i++) {
w[i / 3].vertex[i % 3] = r[i];
}
return faces;
}
Variant::operator Vector<Variant>() const {
Array va = operator Array();
Vector<Variant> variants;
int va_size = va.size();
if (va_size == 0) {
return variants;
}
variants.resize(va_size);
Variant *w = variants.ptrw();
for (int i = 0; i < va_size; i++) {
w[i] = va[i];
}
return variants;
}
Variant::operator Vector<StringName>() const {
Vector<String> from = operator Vector<String>();
Vector<StringName> to;
int len = from.size();
to.resize(len);
for (int i = 0; i < len; i++) {
to.write[i] = from[i];
}
return to;
}
Variant::operator Side() const {
return (Side) operator int();
}
Variant::operator Orientation() const {
return (Orientation) operator int();
}
Variant::operator IPAddress() const {
if (type == PACKED_FLOAT32_ARRAY || type == PACKED_INT32_ARRAY || type == PACKED_FLOAT64_ARRAY || type == PACKED_INT64_ARRAY || type == PACKED_BYTE_ARRAY) {
Vector<int> addr = operator Vector<int>();
if (addr.size() == 4) {
return IPAddress(addr.get(0), addr.get(1), addr.get(2), addr.get(3));
}
}
return IPAddress(operator String());
}
Variant::Variant(bool p_bool) {
type = BOOL;
_data._bool = p_bool;
}
Variant::Variant(signed int p_int) {
type = INT;
_data._int = p_int;
}
Variant::Variant(unsigned int p_int) {
type = INT;
_data._int = p_int;
}
#ifdef NEED_LONG_INT
Variant::Variant(signed long p_int) {
type = INT;
_data._int = p_int;
}
Variant::Variant(unsigned long p_int) {
type = INT;
_data._int = p_int;
}
#endif
Variant::Variant(int64_t p_int) {
type = INT;
_data._int = p_int;
}
Variant::Variant(uint64_t p_int) {
type = INT;
_data._int = p_int;
}
Variant::Variant(signed short p_short) {
type = INT;
_data._int = p_short;
}
Variant::Variant(unsigned short p_short) {
type = INT;
_data._int = p_short;
}
Variant::Variant(signed char p_char) {
type = INT;
_data._int = p_char;
}
Variant::Variant(unsigned char p_char) {
type = INT;
_data._int = p_char;
}
Variant::Variant(float p_float) {
type = FLOAT;
_data._float = p_float;
}
Variant::Variant(double p_double) {
type = FLOAT;
_data._float = p_double;
}
Variant::Variant(const ObjectID &p_id) {
type = INT;
_data._int = p_id;
}
Variant::Variant(const StringName &p_string) {
type = STRING_NAME;
memnew_placement(_data._mem, StringName(p_string));
}
Variant::Variant(const String &p_string) {
type = STRING;
memnew_placement(_data._mem, String(p_string));
}
Variant::Variant(const char *const p_cstring) {
type = STRING;
memnew_placement(_data._mem, String((const char *)p_cstring));
}
Variant::Variant(const char32_t *p_wstring) {
type = STRING;
memnew_placement(_data._mem, String(p_wstring));
}
Variant::Variant(const Vector3 &p_vector3) {
type = VECTOR3;
memnew_placement(_data._mem, Vector3(p_vector3));
}
Variant::Variant(const Vector3i &p_vector3i) {
type = VECTOR3I;
memnew_placement(_data._mem, Vector3i(p_vector3i));
}
Variant::Variant(const Vector2 &p_vector2) {
type = VECTOR2;
memnew_placement(_data._mem, Vector2(p_vector2));
}
Variant::Variant(const Vector2i &p_vector2i) {
type = VECTOR2I;
memnew_placement(_data._mem, Vector2i(p_vector2i));
}
Variant::Variant(const Rect2 &p_rect2) {
type = RECT2;
memnew_placement(_data._mem, Rect2(p_rect2));
}
Variant::Variant(const Rect2i &p_rect2i) {
type = RECT2I;
memnew_placement(_data._mem, Rect2i(p_rect2i));
}
Variant::Variant(const Plane &p_plane) {
type = PLANE;
memnew_placement(_data._mem, Plane(p_plane));
}
Variant::Variant(const ::AABB &p_aabb) {
type = AABB;
_data._aabb = memnew(::AABB(p_aabb));
}
Variant::Variant(const Basis &p_matrix) {
type = BASIS;
_data._basis = memnew(Basis(p_matrix));
}
Variant::Variant(const Quaternion &p_quaternion) {
type = QUATERNION;
memnew_placement(_data._mem, Quaternion(p_quaternion));
}
Variant::Variant(const Transform3D &p_transform) {
type = TRANSFORM3D;
_data._transform3d = memnew(Transform3D(p_transform));
}
Variant::Variant(const Transform2D &p_transform) {
type = TRANSFORM2D;
_data._transform2d = memnew(Transform2D(p_transform));
}
Variant::Variant(const Color &p_color) {
type = COLOR;
memnew_placement(_data._mem, Color(p_color));
}
Variant::Variant(const NodePath &p_node_path) {
type = NODE_PATH;
memnew_placement(_data._mem, NodePath(p_node_path));
}
Variant::Variant(const ::RID &p_rid) {
type = RID;
memnew_placement(_data._mem, ::RID(p_rid));
}
Variant::Variant(const Object *p_object) {
type = OBJECT;
memnew_placement(_data._mem, ObjData);
if (p_object) {
if (p_object->is_ref_counted()) {
RefCounted *ref_counted = const_cast<RefCounted *>(static_cast<const RefCounted *>(p_object));
if (!ref_counted->init_ref()) {
_get_obj().obj = nullptr;
_get_obj().id = ObjectID();
return;
}
}
_get_obj().obj = const_cast<Object *>(p_object);
_get_obj().id = p_object->get_instance_id();
} else {
_get_obj().obj = nullptr;
_get_obj().id = ObjectID();
}
}
Variant::Variant(const Callable &p_callable) {
type = CALLABLE;
memnew_placement(_data._mem, Callable(p_callable));
}
Variant::Variant(const Signal &p_callable) {
type = SIGNAL;
memnew_placement(_data._mem, Signal(p_callable));
}
Variant::Variant(const Dictionary &p_dictionary) {
type = DICTIONARY;
memnew_placement(_data._mem, Dictionary(p_dictionary));
}
Variant::Variant(const Array &p_array) {
type = ARRAY;
memnew_placement(_data._mem, Array(p_array));
}
Variant::Variant(const Vector<Plane> &p_array) {
type = ARRAY;
Array *plane_array = memnew_placement(_data._mem, Array);
plane_array->resize(p_array.size());
for (int i = 0; i < p_array.size(); i++) {
plane_array->operator[](i) = Variant(p_array[i]);
}
}
Variant::Variant(const Vector<::RID> &p_array) {
type = ARRAY;
Array *rid_array = memnew_placement(_data._mem, Array);
rid_array->resize(p_array.size());
for (int i = 0; i < p_array.size(); i++) {
rid_array->set(i, Variant(p_array[i]));
}
}
Variant::Variant(const Vector<uint8_t> &p_byte_array) {
type = PACKED_BYTE_ARRAY;
_data.packed_array = PackedArrayRef<uint8_t>::create(p_byte_array);
}
Variant::Variant(const Vector<int32_t> &p_int32_array) {
type = PACKED_INT32_ARRAY;
_data.packed_array = PackedArrayRef<int32_t>::create(p_int32_array);
}
Variant::Variant(const Vector<int64_t> &p_int64_array) {
type = PACKED_INT64_ARRAY;
_data.packed_array = PackedArrayRef<int64_t>::create(p_int64_array);
}
Variant::Variant(const Vector<float> &p_float32_array) {
type = PACKED_FLOAT32_ARRAY;
_data.packed_array = PackedArrayRef<float>::create(p_float32_array);
}
Variant::Variant(const Vector<double> &p_float64_array) {
type = PACKED_FLOAT64_ARRAY;
_data.packed_array = PackedArrayRef<double>::create(p_float64_array);
}
Variant::Variant(const Vector<String> &p_string_array) {
type = PACKED_STRING_ARRAY;
_data.packed_array = PackedArrayRef<String>::create(p_string_array);
}
Variant::Variant(const Vector<Vector3> &p_vector3_array) {
type = PACKED_VECTOR3_ARRAY;
_data.packed_array = PackedArrayRef<Vector3>::create(p_vector3_array);
}
Variant::Variant(const Vector<Vector2> &p_vector2_array) {
type = PACKED_VECTOR2_ARRAY;
_data.packed_array = PackedArrayRef<Vector2>::create(p_vector2_array);
}
Variant::Variant(const Vector<Color> &p_color_array) {
type = PACKED_COLOR_ARRAY;
_data.packed_array = PackedArrayRef<Color>::create(p_color_array);
}
Variant::Variant(const Vector<Face3> &p_face_array) {
Vector<Vector3> vertices;
int face_count = p_face_array.size();
vertices.resize(face_count * 3);
if (face_count) {
const Face3 *r = p_face_array.ptr();
Vector3 *w = vertices.ptrw();
for (int i = 0; i < face_count; i++) {
for (int j = 0; j < 3; j++) {
w[i * 3 + j] = r[i].vertex[j];
}
}
}
type = NIL;
*this = vertices;
}
/* helpers */
Variant::Variant(const Vector<Variant> &p_array) {
type = NIL;
Array arr;
arr.resize(p_array.size());
for (int i = 0; i < p_array.size(); i++) {
arr[i] = p_array[i];
}
*this = arr;
}
Variant::Variant(const Vector<StringName> &p_array) {
type = NIL;
Vector<String> v;
int len = p_array.size();
v.resize(len);
for (int i = 0; i < len; i++) {
v.set(i, p_array[i]);
}
*this = v;
}
void Variant::operator=(const Variant &p_variant) {
if (unlikely(this == &p_variant)) {
return;
}
if (unlikely(type != p_variant.type)) {
reference(p_variant);
return;
}
switch (p_variant.type) {
case NIL: {
// none
} break;
// atomic types
case BOOL: {
_data._bool = p_variant._data._bool;
} break;
case INT: {
_data._int = p_variant._data._int;
} break;
case FLOAT: {
_data._float = p_variant._data._float;
} break;
case STRING: {
*reinterpret_cast<String *>(_data._mem) = *reinterpret_cast<const String *>(p_variant._data._mem);
} break;
// math types
case VECTOR2: {
*reinterpret_cast<Vector2 *>(_data._mem) = *reinterpret_cast<const Vector2 *>(p_variant._data._mem);
} break;
case VECTOR2I: {
*reinterpret_cast<Vector2i *>(_data._mem) = *reinterpret_cast<const Vector2i *>(p_variant._data._mem);
} break;
case RECT2: {
*reinterpret_cast<Rect2 *>(_data._mem) = *reinterpret_cast<const Rect2 *>(p_variant._data._mem);
} break;
case RECT2I: {
*reinterpret_cast<Rect2i *>(_data._mem) = *reinterpret_cast<const Rect2i *>(p_variant._data._mem);
} break;
case TRANSFORM2D: {
*_data._transform2d = *(p_variant._data._transform2d);
} break;
case VECTOR3: {
*reinterpret_cast<Vector3 *>(_data._mem) = *reinterpret_cast<const Vector3 *>(p_variant._data._mem);
} break;
case VECTOR3I: {
*reinterpret_cast<Vector3i *>(_data._mem) = *reinterpret_cast<const Vector3i *>(p_variant._data._mem);
} break;
case PLANE: {
*reinterpret_cast<Plane *>(_data._mem) = *reinterpret_cast<const Plane *>(p_variant._data._mem);
} break;
case AABB: {
*_data._aabb = *(p_variant._data._aabb);
} break;
case QUATERNION: {
*reinterpret_cast<Quaternion *>(_data._mem) = *reinterpret_cast<const Quaternion *>(p_variant._data._mem);
} break;
case BASIS: {
*_data._basis = *(p_variant._data._basis);
} break;
case TRANSFORM3D: {
*_data._transform3d = *(p_variant._data._transform3d);
} break;
// misc types
case COLOR: {
*reinterpret_cast<Color *>(_data._mem) = *reinterpret_cast<const Color *>(p_variant._data._mem);
} break;
case RID: {
*reinterpret_cast<::RID *>(_data._mem) = *reinterpret_cast<const ::RID *>(p_variant._data._mem);
} break;
case OBJECT: {
if (_get_obj().id.is_ref_counted()) {
//we are safe that there is a reference here
RefCounted *ref_counted = static_cast<RefCounted *>(_get_obj().obj);
if (ref_counted->unreference()) {
memdelete(ref_counted);
}
}
if (p_variant._get_obj().obj && p_variant._get_obj().id.is_ref_counted()) {
RefCounted *ref_counted = static_cast<RefCounted *>(p_variant._get_obj().obj);
if (!ref_counted->reference()) {
_get_obj().obj = nullptr;
_get_obj().id = ObjectID();
break;
}
}
_get_obj().obj = const_cast<Object *>(p_variant._get_obj().obj);
_get_obj().id = p_variant._get_obj().id;
} break;
case CALLABLE: {
*reinterpret_cast<Callable *>(_data._mem) = *reinterpret_cast<const Callable *>(p_variant._data._mem);
} break;
case SIGNAL: {
*reinterpret_cast<Signal *>(_data._mem) = *reinterpret_cast<const Signal *>(p_variant._data._mem);
} break;
case STRING_NAME: {
*reinterpret_cast<StringName *>(_data._mem) = *reinterpret_cast<const StringName *>(p_variant._data._mem);
} break;
case NODE_PATH: {
*reinterpret_cast<NodePath *>(_data._mem) = *reinterpret_cast<const NodePath *>(p_variant._data._mem);
} break;
case DICTIONARY: {
*reinterpret_cast<Dictionary *>(_data._mem) = *reinterpret_cast<const Dictionary *>(p_variant._data._mem);
} break;
case ARRAY: {
*reinterpret_cast<Array *>(_data._mem) = *reinterpret_cast<const Array *>(p_variant._data._mem);
} break;
// arrays
case PACKED_BYTE_ARRAY: {
_data.packed_array = PackedArrayRef<uint8_t>::reference_from(_data.packed_array, p_variant._data.packed_array);
} break;
case PACKED_INT32_ARRAY: {
_data.packed_array = PackedArrayRef<int32_t>::reference_from(_data.packed_array, p_variant._data.packed_array);
} break;
case PACKED_INT64_ARRAY: {
_data.packed_array = PackedArrayRef<int64_t>::reference_from(_data.packed_array, p_variant._data.packed_array);
} break;
case PACKED_FLOAT32_ARRAY: {
_data.packed_array = PackedArrayRef<float>::reference_from(_data.packed_array, p_variant._data.packed_array);
} break;
case PACKED_FLOAT64_ARRAY: {
_data.packed_array = PackedArrayRef<double>::reference_from(_data.packed_array, p_variant._data.packed_array);
} break;
case PACKED_STRING_ARRAY: {
_data.packed_array = PackedArrayRef<String>::reference_from(_data.packed_array, p_variant._data.packed_array);
} break;
case PACKED_VECTOR2_ARRAY: {
_data.packed_array = PackedArrayRef<Vector2>::reference_from(_data.packed_array, p_variant._data.packed_array);
} break;
case PACKED_VECTOR3_ARRAY: {
_data.packed_array = PackedArrayRef<Vector3>::reference_from(_data.packed_array, p_variant._data.packed_array);
} break;
case PACKED_COLOR_ARRAY: {
_data.packed_array = PackedArrayRef<Color>::reference_from(_data.packed_array, p_variant._data.packed_array);
} break;
default: {
}
}
}
Variant::Variant(const IPAddress &p_address) {
type = STRING;
memnew_placement(_data._mem, String(p_address));
}
Variant::Variant(const Variant &p_variant) {
reference(p_variant);
}
uint32_t Variant::hash() const {
return recursive_hash(0);
}
uint32_t Variant::recursive_hash(int recursion_count) const {
switch (type) {
case NIL: {
return 0;
} break;
case BOOL: {
return _data._bool ? 1 : 0;
} break;
case INT: {
return hash_one_uint64((uint64_t)_data._int);
} break;
case FLOAT: {
return hash_djb2_one_float(_data._float);
} break;
case STRING: {
return reinterpret_cast<const String *>(_data._mem)->hash();
} break;
// math types
case VECTOR2: {
uint32_t hash = hash_djb2_one_float(reinterpret_cast<const Vector2 *>(_data._mem)->x);
return hash_djb2_one_float(reinterpret_cast<const Vector2 *>(_data._mem)->y, hash);
} break;
case VECTOR2I: {
uint32_t hash = hash_djb2_one_32((uint32_t) reinterpret_cast<const Vector2i *>(_data._mem)->x);
return hash_djb2_one_32((uint32_t) reinterpret_cast<const Vector2i *>(_data._mem)->y, hash);
} break;
case RECT2: {
uint32_t hash = hash_djb2_one_float(reinterpret_cast<const Rect2 *>(_data._mem)->position.x);
hash = hash_djb2_one_float(reinterpret_cast<const Rect2 *>(_data._mem)->position.y, hash);
hash = hash_djb2_one_float(reinterpret_cast<const Rect2 *>(_data._mem)->size.x, hash);
return hash_djb2_one_float(reinterpret_cast<const Rect2 *>(_data._mem)->size.y, hash);
} break;
case RECT2I: {
uint32_t hash = hash_djb2_one_32((uint32_t) reinterpret_cast<const Rect2i *>(_data._mem)->position.x);
hash = hash_djb2_one_32((uint32_t) reinterpret_cast<const Rect2i *>(_data._mem)->position.y, hash);
hash = hash_djb2_one_32((uint32_t) reinterpret_cast<const Rect2i *>(_data._mem)->size.x, hash);
return hash_djb2_one_32((uint32_t) reinterpret_cast<const Rect2i *>(_data._mem)->size.y, hash);
} break;
case TRANSFORM2D: {
uint32_t hash = 5831;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 2; j++) {
hash = hash_djb2_one_float(_data._transform2d->elements[i][j], hash);
}
}
return hash;
} break;
case VECTOR3: {
uint32_t hash = hash_djb2_one_float(reinterpret_cast<const Vector3 *>(_data._mem)->x);
hash = hash_djb2_one_float(reinterpret_cast<const Vector3 *>(_data._mem)->y, hash);
return hash_djb2_one_float(reinterpret_cast<const Vector3 *>(_data._mem)->z, hash);
} break;
case VECTOR3I: {
uint32_t hash = hash_djb2_one_32((uint32_t) reinterpret_cast<const Vector3i *>(_data._mem)->x);
hash = hash_djb2_one_32((uint32_t) reinterpret_cast<const Vector3i *>(_data._mem)->y, hash);
return hash_djb2_one_32((uint32_t) reinterpret_cast<const Vector3i *>(_data._mem)->z, hash);
} break;
case PLANE: {
uint32_t hash = hash_djb2_one_float(reinterpret_cast<const Plane *>(_data._mem)->normal.x);
hash = hash_djb2_one_float(reinterpret_cast<const Plane *>(_data._mem)->normal.y, hash);
hash = hash_djb2_one_float(reinterpret_cast<const Plane *>(_data._mem)->normal.z, hash);
return hash_djb2_one_float(reinterpret_cast<const Plane *>(_data._mem)->d, hash);
} break;
case AABB: {
uint32_t hash = 5831;
for (int i = 0; i < 3; i++) {
hash = hash_djb2_one_float(_data._aabb->position[i], hash);
hash = hash_djb2_one_float(_data._aabb->size[i], hash);
}
return hash;
} break;
case QUATERNION: {
uint32_t hash = hash_djb2_one_float(reinterpret_cast<const Quaternion *>(_data._mem)->x);
hash = hash_djb2_one_float(reinterpret_cast<const Quaternion *>(_data._mem)->y, hash);
hash = hash_djb2_one_float(reinterpret_cast<const Quaternion *>(_data._mem)->z, hash);
return hash_djb2_one_float(reinterpret_cast<const Quaternion *>(_data._mem)->w, hash);
} break;
case BASIS: {
uint32_t hash = 5831;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
hash = hash_djb2_one_float(_data._basis->elements[i][j], hash);
}
}
return hash;
} break;
case TRANSFORM3D: {
uint32_t hash = 5831;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
hash = hash_djb2_one_float(_data._transform3d->basis.elements[i][j], hash);
}
hash = hash_djb2_one_float(_data._transform3d->origin[i], hash);
}
return hash;
} break;
// misc types
case COLOR: {
uint32_t hash = hash_djb2_one_float(reinterpret_cast<const Color *>(_data._mem)->r);
hash = hash_djb2_one_float(reinterpret_cast<const Color *>(_data._mem)->g, hash);
hash = hash_djb2_one_float(reinterpret_cast<const Color *>(_data._mem)->b, hash);
return hash_djb2_one_float(reinterpret_cast<const Color *>(_data._mem)->a, hash);
} break;
case RID: {
return hash_djb2_one_64(reinterpret_cast<const ::RID *>(_data._mem)->get_id());
} break;
case OBJECT: {
return hash_djb2_one_64(make_uint64_t(_get_obj().obj));
} break;
case STRING_NAME: {
return reinterpret_cast<const StringName *>(_data._mem)->hash();
} break;
case NODE_PATH: {
return reinterpret_cast<const NodePath *>(_data._mem)->hash();
} break;
case DICTIONARY: {
return reinterpret_cast<const Dictionary *>(_data._mem)->recursive_hash(recursion_count);
} break;
case CALLABLE: {
return reinterpret_cast<const Callable *>(_data._mem)->hash();
} break;
case SIGNAL: {
const Signal &s = *reinterpret_cast<const Signal *>(_data._mem);
uint32_t hash = s.get_name().hash();
return hash_djb2_one_64(s.get_object_id(), hash);
} break;
case ARRAY: {
const Array &arr = *reinterpret_cast<const Array *>(_data._mem);
return arr.recursive_hash(recursion_count);
} break;
case PACKED_BYTE_ARRAY: {
const Vector<uint8_t> &arr = PackedArrayRef<uint8_t>::get_array(_data.packed_array);
int len = arr.size();
if (likely(len)) {
const uint8_t *r = arr.ptr();
return hash_djb2_buffer((uint8_t *)&r[0], len);
} else {
return hash_djb2_one_64(0);
}
} break;
case PACKED_INT32_ARRAY: {
const Vector<int32_t> &arr = PackedArrayRef<int32_t>::get_array(_data.packed_array);
int len = arr.size();
if (likely(len)) {
const int32_t *r = arr.ptr();
return hash_djb2_buffer((uint8_t *)&r[0], len * sizeof(int32_t));
} else {
return hash_djb2_one_64(0);
}
} break;
case PACKED_INT64_ARRAY: {
const Vector<int64_t> &arr = PackedArrayRef<int64_t>::get_array(_data.packed_array);
int len = arr.size();
if (likely(len)) {
const int64_t *r = arr.ptr();
return hash_djb2_buffer((uint8_t *)&r[0], len * sizeof(int64_t));
} else {
return hash_djb2_one_64(0);
}
} break;
case PACKED_FLOAT32_ARRAY: {
const Vector<float> &arr = PackedArrayRef<float>::get_array(_data.packed_array);
int len = arr.size();
if (likely(len)) {
const float *r = arr.ptr();
return hash_djb2_buffer((uint8_t *)&r[0], len * sizeof(float));
} else {
return hash_djb2_one_float(0.0);
}
} break;
case PACKED_FLOAT64_ARRAY: {
const Vector<double> &arr = PackedArrayRef<double>::get_array(_data.packed_array);
int len = arr.size();
if (likely(len)) {
const double *r = arr.ptr();
return hash_djb2_buffer((uint8_t *)&r[0], len * sizeof(double));
} else {
return hash_djb2_one_float(0.0);
}
} break;
case PACKED_STRING_ARRAY: {
uint32_t hash = 5831;
const Vector<String> &arr = PackedArrayRef<String>::get_array(_data.packed_array);
int len = arr.size();
if (likely(len)) {
const String *r = arr.ptr();
for (int i = 0; i < len; i++) {
hash = hash_djb2_one_32(r[i].hash(), hash);
}
}
return hash;
} break;
case PACKED_VECTOR2_ARRAY: {
uint32_t hash = 5831;
const Vector<Vector2> &arr = PackedArrayRef<Vector2>::get_array(_data.packed_array);
int len = arr.size();
if (likely(len)) {
const Vector2 *r = arr.ptr();
for (int i = 0; i < len; i++) {
hash = hash_djb2_one_float(r[i].x, hash);
hash = hash_djb2_one_float(r[i].y, hash);
}
}
return hash;
} break;
case PACKED_VECTOR3_ARRAY: {
uint32_t hash = 5831;
const Vector<Vector3> &arr = PackedArrayRef<Vector3>::get_array(_data.packed_array);
int len = arr.size();
if (likely(len)) {
const Vector3 *r = arr.ptr();
for (int i = 0; i < len; i++) {
hash = hash_djb2_one_float(r[i].x, hash);
hash = hash_djb2_one_float(r[i].y, hash);
hash = hash_djb2_one_float(r[i].z, hash);
}
}
return hash;
} break;
case PACKED_COLOR_ARRAY: {
uint32_t hash = 5831;
const Vector<Color> &arr = PackedArrayRef<Color>::get_array(_data.packed_array);
int len = arr.size();
if (likely(len)) {
const Color *r = arr.ptr();
for (int i = 0; i < len; i++) {
hash = hash_djb2_one_float(r[i].r, hash);
hash = hash_djb2_one_float(r[i].g, hash);
hash = hash_djb2_one_float(r[i].b, hash);
hash = hash_djb2_one_float(r[i].a, hash);
}
}
return hash;
} break;
default: {
}
}
return 0;
}
#define hash_compare_scalar(p_lhs, p_rhs) \
((p_lhs) == (p_rhs)) || (Math::is_nan(p_lhs) && Math::is_nan(p_rhs))
#define hash_compare_vector2(p_lhs, p_rhs) \
(hash_compare_scalar((p_lhs).x, (p_rhs).x)) && \
(hash_compare_scalar((p_lhs).y, (p_rhs).y))
#define hash_compare_vector3(p_lhs, p_rhs) \
(hash_compare_scalar((p_lhs).x, (p_rhs).x)) && \
(hash_compare_scalar((p_lhs).y, (p_rhs).y)) && \
(hash_compare_scalar((p_lhs).z, (p_rhs).z))
#define hash_compare_quaternion(p_lhs, p_rhs) \
(hash_compare_scalar((p_lhs).x, (p_rhs).x)) && \
(hash_compare_scalar((p_lhs).y, (p_rhs).y)) && \
(hash_compare_scalar((p_lhs).z, (p_rhs).z)) && \
(hash_compare_scalar((p_lhs).w, (p_rhs).w))
#define hash_compare_color(p_lhs, p_rhs) \
(hash_compare_scalar((p_lhs).r, (p_rhs).r)) && \
(hash_compare_scalar((p_lhs).g, (p_rhs).g)) && \
(hash_compare_scalar((p_lhs).b, (p_rhs).b)) && \
(hash_compare_scalar((p_lhs).a, (p_rhs).a))
#define hash_compare_packed_array(p_lhs, p_rhs, p_type, p_compare_func) \
const Vector<p_type> &l = PackedArrayRef<p_type>::get_array(p_lhs); \
const Vector<p_type> &r = PackedArrayRef<p_type>::get_array(p_rhs); \
\
if (l.size() != r.size()) \
return false; \
\
const p_type *lr = l.ptr(); \
const p_type *rr = r.ptr(); \
\
for (int i = 0; i < l.size(); ++i) { \
if (!p_compare_func((lr[i]), (rr[i]))) \
return false; \
} \
\
return true
bool Variant::hash_compare(const Variant &p_variant, int recursion_count) const {
if (type != p_variant.type) {
return false;
}
switch (type) {
case INT: {
return _data._int == p_variant._data._int;
} break;
case FLOAT: {
return hash_compare_scalar(_data._float, p_variant._data._float);
} break;
case STRING: {
return *reinterpret_cast<const String *>(_data._mem) == *reinterpret_cast<const String *>(p_variant._data._mem);
} break;
case VECTOR2: {
const Vector2 *l = reinterpret_cast<const Vector2 *>(_data._mem);
const Vector2 *r = reinterpret_cast<const Vector2 *>(p_variant._data._mem);
return hash_compare_vector2(*l, *r);
} break;
case VECTOR2I: {
const Vector2i *l = reinterpret_cast<const Vector2i *>(_data._mem);
const Vector2i *r = reinterpret_cast<const Vector2i *>(p_variant._data._mem);
return *l == *r;
} break;
case RECT2: {
const Rect2 *l = reinterpret_cast<const Rect2 *>(_data._mem);
const Rect2 *r = reinterpret_cast<const Rect2 *>(p_variant._data._mem);
return (hash_compare_vector2(l->position, r->position)) &&
(hash_compare_vector2(l->size, r->size));
} break;
case RECT2I: {
const Rect2i *l = reinterpret_cast<const Rect2i *>(_data._mem);
const Rect2i *r = reinterpret_cast<const Rect2i *>(p_variant._data._mem);
return *l == *r;
} break;
case TRANSFORM2D: {
Transform2D *l = _data._transform2d;
Transform2D *r = p_variant._data._transform2d;
for (int i = 0; i < 3; i++) {
if (!(hash_compare_vector2(l->elements[i], r->elements[i]))) {
return false;
}
}
return true;
} break;
case VECTOR3: {
const Vector3 *l = reinterpret_cast<const Vector3 *>(_data._mem);
const Vector3 *r = reinterpret_cast<const Vector3 *>(p_variant._data._mem);
return hash_compare_vector3(*l, *r);
} break;
case VECTOR3I: {
const Vector3i *l = reinterpret_cast<const Vector3i *>(_data._mem);
const Vector3i *r = reinterpret_cast<const Vector3i *>(p_variant._data._mem);
return *l == *r;
} break;
case PLANE: {
const Plane *l = reinterpret_cast<const Plane *>(_data._mem);
const Plane *r = reinterpret_cast<const Plane *>(p_variant._data._mem);
return (hash_compare_vector3(l->normal, r->normal)) &&
(hash_compare_scalar(l->d, r->d));
} break;
case AABB: {
const ::AABB *l = _data._aabb;
const ::AABB *r = p_variant._data._aabb;
return (hash_compare_vector3(l->position, r->position) &&
(hash_compare_vector3(l->size, r->size)));
} break;
case QUATERNION: {
const Quaternion *l = reinterpret_cast<const Quaternion *>(_data._mem);
const Quaternion *r = reinterpret_cast<const Quaternion *>(p_variant._data._mem);
return hash_compare_quaternion(*l, *r);
} break;
case BASIS: {
const Basis *l = _data._basis;
const Basis *r = p_variant._data._basis;
for (int i = 0; i < 3; i++) {
if (!(hash_compare_vector3(l->elements[i], r->elements[i]))) {
return false;
}
}
return true;
} break;
case TRANSFORM3D: {
const Transform3D *l = _data._transform3d;
const Transform3D *r = p_variant._data._transform3d;
for (int i = 0; i < 3; i++) {
if (!(hash_compare_vector3(l->basis.elements[i], r->basis.elements[i]))) {
return false;
}
}
return hash_compare_vector3(l->origin, r->origin);
} break;
case COLOR: {
const Color *l = reinterpret_cast<const Color *>(_data._mem);
const Color *r = reinterpret_cast<const Color *>(p_variant._data._mem);
return hash_compare_color(*l, *r);
} break;
case ARRAY: {
const Array &l = *(reinterpret_cast<const Array *>(_data._mem));
const Array &r = *(reinterpret_cast<const Array *>(p_variant._data._mem));
if (!l.recursive_equal(r, recursion_count + 1)) {
return false;
}
return true;
} break;
case DICTIONARY: {
const Dictionary &l = *(reinterpret_cast<const Dictionary *>(_data._mem));
const Dictionary &r = *(reinterpret_cast<const Dictionary *>(p_variant._data._mem));
if (!l.recursive_equal(r, recursion_count + 1)) {
return false;
}
return true;
} break;
// This is for floating point comparisons only.
case PACKED_FLOAT32_ARRAY: {
hash_compare_packed_array(_data.packed_array, p_variant._data.packed_array, float, hash_compare_scalar);
} break;
case PACKED_FLOAT64_ARRAY: {
hash_compare_packed_array(_data.packed_array, p_variant._data.packed_array, double, hash_compare_scalar);
} break;
case PACKED_VECTOR2_ARRAY: {
hash_compare_packed_array(_data.packed_array, p_variant._data.packed_array, Vector2, hash_compare_vector2);
} break;
case PACKED_VECTOR3_ARRAY: {
hash_compare_packed_array(_data.packed_array, p_variant._data.packed_array, Vector3, hash_compare_vector3);
} break;
case PACKED_COLOR_ARRAY: {
hash_compare_packed_array(_data.packed_array, p_variant._data.packed_array, Color, hash_compare_color);
} break;
default:
bool v;
Variant r;
evaluate(OP_EQUAL, *this, p_variant, r, v);
return r;
}
return false;
}
bool Variant::is_ref_counted() const {
return type == OBJECT && _get_obj().id.is_ref_counted();
}
Vector<Variant> varray() {
return Vector<Variant>();
}
Vector<Variant> varray(const Variant &p_arg1) {
Vector<Variant> v;
v.push_back(p_arg1);
return v;
}
Vector<Variant> varray(const Variant &p_arg1, const Variant &p_arg2) {
Vector<Variant> v;
v.push_back(p_arg1);
v.push_back(p_arg2);
return v;
}
Vector<Variant> varray(const Variant &p_arg1, const Variant &p_arg2, const Variant &p_arg3) {
Vector<Variant> v;
v.push_back(p_arg1);
v.push_back(p_arg2);
v.push_back(p_arg3);
return v;
}
Vector<Variant> varray(const Variant &p_arg1, const Variant &p_arg2, const Variant &p_arg3, const Variant &p_arg4) {
Vector<Variant> v;
v.push_back(p_arg1);
v.push_back(p_arg2);
v.push_back(p_arg3);
v.push_back(p_arg4);
return v;
}
Vector<Variant> varray(const Variant &p_arg1, const Variant &p_arg2, const Variant &p_arg3, const Variant &p_arg4, const Variant &p_arg5) {
Vector<Variant> v;
v.push_back(p_arg1);
v.push_back(p_arg2);
v.push_back(p_arg3);
v.push_back(p_arg4);
v.push_back(p_arg5);
return v;
}
void Variant::static_assign(const Variant &p_variant) {
}
bool Variant::is_shared() const {
switch (type) {
case OBJECT:
return true;
case ARRAY:
return true;
case DICTIONARY:
return true;
default: {
}
}
return false;
}
Variant Variant::call(const StringName &p_method, VARIANT_ARG_DECLARE) {
VARIANT_ARGPTRS;
int argc = 0;
for (int i = 0; i < VARIANT_ARG_MAX; i++) {
if (argptr[i]->get_type() == Variant::NIL) {
break;
}
argc++;
}
Callable::CallError error;
Variant ret;
call(p_method, argptr, argc, ret, error);
switch (error.error) {
case Callable::CallError::CALL_ERROR_INVALID_ARGUMENT: {
String err = "Invalid type for argument #" + itos(error.argument) + ", expected '" + Variant::get_type_name(Variant::Type(error.expected)) + "'.";
ERR_PRINT(err.utf8().get_data());
} break;
case Callable::CallError::CALL_ERROR_INVALID_METHOD: {
String err = "Invalid method '" + p_method + "' for type '" + Variant::get_type_name(type) + "'.";
ERR_PRINT(err.utf8().get_data());
} break;
case Callable::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS: {
String err = "Too many arguments for method '" + p_method + "'";
ERR_PRINT(err.utf8().get_data());
} break;
default: {
}
}
return ret;
}
void Variant::construct_from_string(const String &p_string, Variant &r_value, ObjectConstruct p_obj_construct, void *p_construct_ud) {
r_value = Variant();
}
String Variant::get_construct_string() const {
String vars;
VariantWriter::write_to_string(*this, vars);
return vars;
}
String Variant::get_call_error_text(const StringName &p_method, const Variant **p_argptrs, int p_argcount, const Callable::CallError &ce) {
String err_text;
if (ce.error == Callable::CallError::CALL_ERROR_INVALID_ARGUMENT) {
int errorarg = ce.argument;
if (p_argptrs) {
err_text = "Cannot convert argument " + itos(errorarg + 1) + " from " + Variant::get_type_name(p_argptrs[errorarg]->get_type()) + " to " + Variant::get_type_name(Variant::Type(ce.expected)) + ".";
} else {
err_text = "Cannot convert argument " + itos(errorarg + 1) + " from [missing argptr, type unknown] to " + Variant::get_type_name(Variant::Type(ce.expected)) + ".";
}
} else if (ce.error == Callable::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS) {
err_text = "Method expected " + itos(ce.argument) + " arguments, but called with " + itos(p_argcount) + ".";
} else if (ce.error == Callable::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS) {
err_text = "Method expected " + itos(ce.argument) + " arguments, but called with " + itos(p_argcount) + ".";
} else if (ce.error == Callable::CallError::CALL_ERROR_INVALID_METHOD) {
err_text = "Method not found.";
} else if (ce.error == Callable::CallError::CALL_ERROR_INSTANCE_IS_NULL) {
err_text = "Instance is null";
} else if (ce.error == Callable::CallError::CALL_OK) {
return "Call OK";
}
return "'" + String(p_method) + "': " + err_text;
}
String Variant::get_call_error_text(Object *p_base, const StringName &p_method, const Variant **p_argptrs, int p_argcount, const Callable::CallError &ce) {
String err_text;
if (ce.error == Callable::CallError::CALL_ERROR_INVALID_ARGUMENT) {
int errorarg = ce.argument;
if (p_argptrs) {
err_text = "Cannot convert argument " + itos(errorarg + 1) + " from " + Variant::get_type_name(p_argptrs[errorarg]->get_type()) + " to " + Variant::get_type_name(Variant::Type(ce.expected)) + ".";
} else {
err_text = "Cannot convert argument " + itos(errorarg + 1) + " from [missing argptr, type unknown] to " + Variant::get_type_name(Variant::Type(ce.expected)) + ".";
}
} else if (ce.error == Callable::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS) {
err_text = "Method expected " + itos(ce.argument) + " arguments, but called with " + itos(p_argcount) + ".";
} else if (ce.error == Callable::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS) {
err_text = "Method expected " + itos(ce.argument) + " arguments, but called with " + itos(p_argcount) + ".";
} else if (ce.error == Callable::CallError::CALL_ERROR_INVALID_METHOD) {
err_text = "Method not found.";
} else if (ce.error == Callable::CallError::CALL_ERROR_INSTANCE_IS_NULL) {
err_text = "Instance is null";
} else if (ce.error == Callable::CallError::CALL_OK) {
return "Call OK";
}
String class_name = p_base->get_class();
Ref<Resource> script = p_base->get_script();
if (script.is_valid() && script->get_path().is_resource_file()) {
class_name += "(" + script->get_path().get_file() + ")";
}
return "'" + class_name + "::" + String(p_method) + "': " + err_text;
}
String Variant::get_callable_error_text(const Callable &p_callable, const Variant **p_argptrs, int p_argcount, const Callable::CallError &ce) {
String err_text;
if (ce.error == Callable::CallError::CALL_ERROR_INVALID_ARGUMENT) {
int errorarg = ce.argument;
if (p_argptrs) {
err_text = "Cannot convert argument " + itos(errorarg + 1) + " from " + Variant::get_type_name(p_argptrs[errorarg]->get_type()) + " to " + Variant::get_type_name(Variant::Type(ce.expected)) + ".";
} else {
err_text = "Cannot convert argument " + itos(errorarg + 1) + " from [missing argptr, type unknown] to " + Variant::get_type_name(Variant::Type(ce.expected)) + ".";
}
} else if (ce.error == Callable::CallError::CALL_ERROR_TOO_MANY_ARGUMENTS) {
err_text = "Method expected " + itos(ce.argument) + " arguments, but called with " + itos(p_argcount) + ".";
} else if (ce.error == Callable::CallError::CALL_ERROR_TOO_FEW_ARGUMENTS) {
err_text = "Method expected " + itos(ce.argument) + " arguments, but called with " + itos(p_argcount) + ".";
} else if (ce.error == Callable::CallError::CALL_ERROR_INVALID_METHOD) {
err_text = "Method not found.";
} else if (ce.error == Callable::CallError::CALL_ERROR_INSTANCE_IS_NULL) {
err_text = "Instance is null";
} else if (ce.error == Callable::CallError::CALL_OK) {
return "Call OK";
}
return String(p_callable) + " : " + err_text;
}
String vformat(const String &p_text, const Variant &p1, const Variant &p2, const Variant &p3, const Variant &p4, const Variant &p5) {
Array args;
if (p1.get_type() != Variant::NIL) {
args.push_back(p1);
if (p2.get_type() != Variant::NIL) {
args.push_back(p2);
if (p3.get_type() != Variant::NIL) {
args.push_back(p3);
if (p4.get_type() != Variant::NIL) {
args.push_back(p4);
if (p5.get_type() != Variant::NIL) {
args.push_back(p5);
}
}
}
}
}
bool error = false;
String fmt = p_text.sprintf(args, &error);
ERR_FAIL_COND_V_MSG(error, String(), fmt);
return fmt;
}
void Variant::register_types() {
_register_variant_operators();
_register_variant_methods();
_register_variant_setters_getters();
_register_variant_constructors();
_register_variant_destructors();
_register_variant_utility_functions();
}
void Variant::unregister_types() {
_unregister_variant_operators();
_unregister_variant_methods();
_unregister_variant_setters_getters();
_unregister_variant_destructors();
_unregister_variant_utility_functions();
}
| {
"redpajama_set_name": "RedPajamaGithub"
} | 9,476 | [
128000,
11624,
3356,
1075,
220,
11678,
7356,
27157,
740,
11624,
3356,
1075,
5291,
1115,
1052,
374,
961,
315,
25,
6096,
740,
1075,
6096,
59478,
1831,
49460,
1408,
740,
1075,
2611,
3788,
1129,
40811,
354,
8680,
2726,
3586,
740,
11624,
3356,
1075,
3028,
320,
66,
8,
220,
1049,
22,
12,
2366,
17,
29604,
445,
6729,
1441,
8050,
11,
76926,
2418,
89,
324,
13,
338,
740,
1075,
3028,
320,
66,
8,
220,
679,
19,
12,
2366,
17,
4359,
354,
8364,
20965,
320,
9991,
13,
27786,
22030,
570,
256,
740,
1075,
47871,
740,
1075,
18628,
374,
22552,
11938,
11,
1949,
315,
6900,
11,
311,
904,
1732,
19546,
740,
1075,
264,
3048,
315,
420,
3241,
323,
5938,
9904,
3626,
320,
1820,
996,
740,
1075,
330,
19805,
4063,
311,
3568,
304,
279,
4476
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
11624,
3356,
1075,
220,
11678,
7356,
27157,
740,
11624,
3356,
1075,
5291,
1115,
1052,
374,
961,
315,
25,
6096,
740,
1075,
6096,
59478,
1831,
49460,
1408,
740,
1075,
2611,
3788,
1129,
40811,
354,
8680,
2726,
3586,
740,
11624,
3356,
1075,
3028,
320,
66,
8,
220,
1049,
22,
12,
2366,
17,
29604,
445,
6729,
1441,
8050,
11,
76926,
2418,
89,
324,
13,
338,
740,
1075,
3028,
320,
66,
8,
220,
679,
19,
12,
2366,
17,
4359,
354,
8364,
20965,
320,
9991,
13,
27786,
22030,
570,
256,
740,
1075,
47871,
740,
1075,
18628,
374,
22552,
11938,
11,
1949,
315,
6900,
11,
311,
904,
1732,
19546,
740,
1075,
264,
3048,
315,
420,
3241,
323,
5938,
9904,
3626,
320,
1820,
996,
740,
1075,
330,
19805,
4063,
311,
3568,
304,
279,
4476,
-100
] |
Traditional chalet of 948 m² built on a plot of 6.537, 6 m². , with the possibility of segregating into 2 plots of more than 2.500 meters each with 1.000 m² built. The house was built in 1.962 for family use by its current owners, being very well maintained and in perfect use. The materials used in the construction are noble and of quality. A unique garden with trees over 60 years old. Climatized pool.
The perfect house for you in La Finca, located in the municipality of Pozuelo de Alarcón. With a privileged location in the most exclusive and demanded urbanization in Madrid, thanks to its security and privacy. We offer you, the example of a customizable project, with luxury qualities and energy certification A that includes GEOTERMIA both in the home and in the pool. Construction in 12 months from the license. | {
"redpajama_set_name": "RedPajamaC4"
} | 5,050 | [
128000,
85782,
13826,
1169,
315,
220,
26979,
296,
30556,
5918,
389,
264,
7234,
315,
220,
21,
13,
19038,
11,
220,
21,
296,
30556,
13,
1174,
449,
279,
13336,
315,
44167,
1113,
1139,
220,
17,
31794,
315,
810,
1109,
220,
17,
13,
2636,
20645,
1855,
449,
220,
16,
13,
931,
296,
30556,
5918,
13,
578,
3838,
574,
5918,
304,
220,
16,
13,
26366,
369,
3070,
1005,
555,
1202,
1510,
7980,
11,
1694,
1633,
1664,
18908,
323,
304,
4832,
1005,
13,
578,
7384,
1511,
304,
279,
8246,
527,
35482,
323,
315,
4367,
13,
362,
5016,
13863,
449,
12690,
927,
220,
1399,
1667,
2362,
13,
62930,
266,
1534,
7463,
627,
791,
4832,
3838,
369,
499,
304,
5034,
5767,
936,
11,
7559,
304,
279,
57918,
315,
80085,
4088,
78,
409,
1708,
8362
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
85782,
13826,
1169,
315,
220,
26979,
296,
30556,
5918,
389,
264,
7234,
315,
220,
21,
13,
19038,
11,
220,
21,
296,
30556,
13,
1174,
449,
279,
13336,
315,
44167,
1113,
1139,
220,
17,
31794,
315,
810,
1109,
220,
17,
13,
2636,
20645,
1855,
449,
220,
16,
13,
931,
296,
30556,
5918,
13,
578,
3838,
574,
5918,
304,
220,
16,
13,
26366,
369,
3070,
1005,
555,
1202,
1510,
7980,
11,
1694,
1633,
1664,
18908,
323,
304,
4832,
1005,
13,
578,
7384,
1511,
304,
279,
8246,
527,
35482,
323,
315,
4367,
13,
362,
5016,
13863,
449,
12690,
927,
220,
1399,
1667,
2362,
13,
62930,
266,
1534,
7463,
627,
791,
4832,
3838,
369,
499,
304,
5034,
5767,
936,
11,
7559,
304,
279,
57918,
315,
80085,
4088,
78,
409,
1708,
8362,
-100
] |
A Chronoamperometric Screen Printed Carbon Biosensor Based on Alkaline Phosphatase Inhibition for W(VI) Determination in Water, Using 2-Phospho-l-Ascorbic Acid Trisodium Salt as a Substrate
PET and PVC Separation with Hyperspectral Imagery
10.3390/s150102228
Passaro, V. M.N.
Seitz, W. Rudolf
Melesse, A. M.
Star, A.
Reindl, L.
Sensors Best Paper Award 2015
Vittorio M.N. Passaro
1,* ,
W. Rudolf Seitz
2,*,
Assefa M. Melesse
Alexander Star
4,* and Leonhard Reindl 5
Department of Electrical and Information Engineering, Politecnico di Bari, Via E. Orabona n. 4, 70125 Bari, Italy
Analytical Chemistry, Department of Chemistry, University of New Hampshire, Durham, NH 03824-3598, USA
Department of Earth and Environment, AHC-5-390, Florida International University, 11200 SW 8th Street, Miami, FL 33199, USA
Department of Chemistry, University of Pittsburgh, 219 Parkman Avenue, Pittsburgh, PA 15260, USA
Laboratory for Electrical Instrumentation, Department of Microsystems Engineering - IMTEK, Faculty of Engineering, Albert-Ludwigs-University of Freiburg, Georges-Koehler-Allee 106, D-79110 Freiburg, Germany
Sensors 2015, 15(1), 2228-2231; https://doi.org/10.3390/s150102228
Received: 14 January 2015 / Accepted: 20 January 2015 / Published: 20 January 2015
Since 2011, an annual award system was instituted to recognize outstanding Sensors papers that are related to sensing technologies and applications and meet the aims, scope and high standards of this journal [1–4]. This year, the winners were chosen by the Section Editor-in-Chiefs of Sensors from among all the papers published in 2011 to track citations. Reviews and full research articles were considered separately. We gladly announce that the following eight papers were awarded the Sensors Best Paper Award in 2015.
Article Award:
Ellen L. Holthoff, Dimitra N. Stratis-Cullum and Mikella E. Hankus
A Nanosensor for TNT Detection Based on Molecularly Imprinted Polymers and Surface Enhanced Raman Scattering
Sensors 2011, 11(3), 2700-2714; doi:10.3390/s110302700
Available online: https://www.mdpi.com/1424-8220/11/3/2700
Ye Tian, Wenhui Wang, Nan Wu, Xiaotian Zou and Xingwei Wang
Tapered Optical Fiber Sensor for Label-Free Detection of Biomolecules
Michele D. Kattke *, Elizabeth J. Gao, Kim E. Sapsford, Larry D. Stephenson and Ashok Kumar
FRET-Based Quantum Dot Immunoassay for Rapid and Sensitive Detection of Aspergillus amstelodami
Jordi Llorens, Emilio Gil, Jordi Llop and Alexandre Escolà
Ultrasonic and LIDAR Sensors for Electronic Canopy Characterization in Vineyards: Advances to Improve Pesticide Application Methods
Constantin Apetrei, Irina Mirela Apetrei, Jose Antonio De Saja and Maria Luz Rodriguez-Mendez
Carbon Paste Electrodes Made from Different Carbonaceous Materials: Application in the Study of Antioxidants
Review Award:
Sookyoung Roh, Taerin Chung and Byoungho Lee
Overview of the Characteristics of Micro- and Nano-Structured Surface Plasmon Resonance Sensors
Alphus D. Wilson and Manuela Baietto
Advances in Electronic-Nose Technologies Developed for Biomedical Applications
Elizabeth A. Baldwin, Jinhe Bai, Anne Plotto and Sharon Dea
Electronic Noses and Tongues: Applications for the Food and Pharmaceutical Industries
These eight exceptional papers are valuable contributions to Sensors and the sensing field. On behalf of the Prize Awarding Committee and the Editorial Board of Sensors, we would like to congratulate these eight teams for their excellent work. In recognition of their accomplishment, Drs. Ellen L. Holthoff, Xingwei Wang, Michele D. Kattke, Emilio Gil and Maria Luz Rodriguez-Mendez will receive 1,000 CHF, 800 CHF, 600 CHF, 400 CHF and 200 CHF, respectively, and the privilege of publishing an additional open access format paper of their choice, free of charge, in Sensors in 2015. Drs. Byoungho Lee, Alphus D. Wilson and Elizabeth A. Baldwin will be awarded the privilege of publishing an additional research paper free of charge in open access format in Sensors.
Prize Awarding Committee
Editor-in-Chief, Section 'Physical Sensors'
Dr. Vittorio M.N. Passaro
Tel.: +39-080-5963-850; Fax: +39-080-5963-410
Website: http://dee.poliba.it/photonicsgroup
Editor-in-Chief, Section 'Chemical Sensors'
Prof. Dr. W. Rudolf Seitz
Tel.: +1-603-862-2408; Fax: +1-603-862-4278
Website: http://www.unh.edu/chemistry/faculty/seitz_w.html
Editor-in-Chief, Section 'Remote Sensors'
Dr. Assefa M. Melesse
Website: http://faculty.fiu.edu/∼melessea/
Editor-in-Chief, Section 'Biosensors'
Dr. Alexander Star
Website: http://www.pitt.edu/~astar/
Editor-in-Chief, Section 'Sensor Networks'
Prof. Dr. Leonhard M. Reindl
Albert-Ludwigs-University of Freiburg, Faculty of Engineering, Department of Microsystems Engineering - IMTEK, Laboratory for Electrical Instrumentation, Georges-Koehler-Allee 106, Room 04-014, D-79110 Freiburg, Germany
Tel.: +49-761-203-7220; Fax: +49-761-203-7222
Website: http://www.imtek.de/professuren/emp/mitarbeiter/reindl/vita
Han, O. Sensors Best Paper Award 2011. Sensors 2011, 11, 1243–1245. [Google Scholar]
Passaro, V.M.; Seitz, W.R.; Melesse, A.M.; Star, A.; Han, O. Sensors Best Paper Award 2013. Sensors 2013, 13, 2113–2116. [Google Scholar]
Passaro, V.M.N.; Seitz, W.R.; Melesse, A.M.; Star, A.; Younis, M.F. Sensors Best Paper Award 2014. Sensors 2014, 14, 1898–1901. [Google Scholar]
© 2015 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license ( http://creativecommons.org/licenses/by/4.0/).
Passaro, V.M.N.; Seitz, W.R.; Melesse, A.M.; Star, A.; Reindl, L. Sensors Best Paper Award 2015. Sensors 2015, 15, 2228-2231. https://doi.org/10.3390/s150102228
Passaro VMN, Seitz WR, Melesse AM, Star A, Reindl L. Sensors Best Paper Award 2015. Sensors. 2015; 15(1):2228-2231. https://doi.org/10.3390/s150102228
Passaro, Vittorio M.N., W. Rudolf Seitz, Assefa M. Melesse, Alexander Star, and Leonhard Reindl. 2015. "Sensors Best Paper Award 2015" Sensors 15, no. 1: 2228-2231. https://doi.org/10.3390/s150102228
Sensors, EISSN 1424-8220, Published by MDPI | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 2,807 | [
128000,
32,
26560,
78,
309,
716,
24264,
14275,
71065,
22208,
77948,
3890,
20817,
389,
1708,
36641,
483,
2405,
24527,
266,
521,
763,
60073,
369,
468,
12692,
40,
8,
36007,
367,
304,
10164,
11,
12362,
220,
17,
12,
3438,
24527,
78,
2922,
12,
2170,
6133,
94598,
50234,
1183,
285,
47876,
28138,
439,
264,
3804,
71015,
198,
80504,
323,
50966,
34199,
367,
449,
39515,
388,
87675,
77533,
727,
198,
605,
13,
17887,
15,
2754,
3965,
4278,
14261,
198,
12465,
17606,
11,
650,
13,
386,
2112,
627,
1542,
11289,
11,
468,
13,
48538,
8255,
198,
7979,
645,
325,
11,
362,
13,
386,
627,
12988,
11,
362,
627,
697,
485,
75,
11,
445,
627,
50,
27627,
7252,
18343,
17768,
220,
679,
20,
198,
53,
1468,
50931,
386,
2112,
13,
10175,
17606,
198
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
32,
26560,
78,
309,
716,
24264,
14275,
71065,
22208,
77948,
3890,
20817,
389,
1708,
36641,
483,
2405,
24527,
266,
521,
763,
60073,
369,
468,
12692,
40,
8,
36007,
367,
304,
10164,
11,
12362,
220,
17,
12,
3438,
24527,
78,
2922,
12,
2170,
6133,
94598,
50234,
1183,
285,
47876,
28138,
439,
264,
3804,
71015,
198,
80504,
323,
50966,
34199,
367,
449,
39515,
388,
87675,
77533,
727,
198,
605,
13,
17887,
15,
2754,
3965,
4278,
14261,
198,
12465,
17606,
11,
650,
13,
386,
2112,
627,
1542,
11289,
11,
468,
13,
48538,
8255,
198,
7979,
645,
325,
11,
362,
13,
386,
627,
12988,
11,
362,
627,
697,
485,
75,
11,
445,
627,
50,
27627,
7252,
18343,
17768,
220,
679,
20,
198,
53,
1468,
50931,
386,
2112,
13,
10175,
17606,
198,
-100
] |
The Cell Phone Tour is closed until spring.
Thanks to the South Allegheny Education Association for sponsoring the Cell Phone Tour for July, August, and September.
You can learn about the plants of the Woodland Habitat with the "Walk in Harmony" Cell Phone Tour. This allows you to self tour the habitat any time of the day. Take a brochure, dial 412.254.2156 and visit each numbered owl in the habitat. You can also listen to extra information at each stop. Continue by stopping at each of the six stops along the path marked by owls.
The voices of the"Walk in Harmony" cell phone tour were Harmony Habitat representatives.
You can sponsor a tour for $25 a month. The check should be made out to Spatial Adventures and sent to South Allegheny Elementary school. | {
"redpajama_set_name": "RedPajamaC4"
} | 3,723 | [
128000,
791,
14299,
14642,
14986,
374,
8036,
3156,
10683,
627,
12947,
311,
279,
4987,
43261,
876,
33495,
11930,
10229,
369,
85441,
279,
14299,
14642,
14986,
369,
5887,
11,
6287,
11,
323,
6250,
627,
2675,
649,
4048,
922,
279,
11012,
315,
279,
12404,
1974,
99688,
449,
279,
330,
49949,
304,
66480,
1,
14299,
14642,
14986,
13,
1115,
6276,
499,
311,
659,
7364,
279,
39646,
904,
892,
315,
279,
1938,
13,
12040,
264,
79903,
11,
28960,
220,
17574,
13,
12375,
13,
12112,
21,
323,
4034,
1855,
49926,
53369,
304,
279,
39646,
13,
1472,
649,
1101,
9020,
311,
5066,
2038,
520,
1855,
3009,
13,
15353,
555,
23351,
520,
1855,
315,
279,
4848,
18417,
3235,
279,
1853,
13160,
555,
15941,
4835,
627,
791,
24196,
315,
279,
1,
49949,
304,
66480,
1,
2849
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
791,
14299,
14642,
14986,
374,
8036,
3156,
10683,
627,
12947,
311,
279,
4987,
43261,
876,
33495,
11930,
10229,
369,
85441,
279,
14299,
14642,
14986,
369,
5887,
11,
6287,
11,
323,
6250,
627,
2675,
649,
4048,
922,
279,
11012,
315,
279,
12404,
1974,
99688,
449,
279,
330,
49949,
304,
66480,
1,
14299,
14642,
14986,
13,
1115,
6276,
499,
311,
659,
7364,
279,
39646,
904,
892,
315,
279,
1938,
13,
12040,
264,
79903,
11,
28960,
220,
17574,
13,
12375,
13,
12112,
21,
323,
4034,
1855,
49926,
53369,
304,
279,
39646,
13,
1472,
649,
1101,
9020,
311,
5066,
2038,
520,
1855,
3009,
13,
15353,
555,
23351,
520,
1855,
315,
279,
4848,
18417,
3235,
279,
1853,
13160,
555,
15941,
4835,
627,
791,
24196,
315,
279,
1,
49949,
304,
66480,
1,
2849,
-100
] |
One advantage of staying home sick is that I can get some reading done. I won't be able to keep up this pace for long — the books I've been reading lately have just been little quick reads.
Book #7 is Jonathan Kellerman's latest novel, Twisted. Unlike most of Kellerman's other novels, the protagonist is not Alex Delaware, but a female detective first introduced in Billy Straight, Petra Connor.
I enjoyed the book. I like Kellerman's change of pace with the new protagonist. He's probably getting a little burned out writing about Alex Delaware all the time. | {
"redpajama_set_name": "RedPajamaC4"
} | 4,193 | [
128000,
4054,
9610,
315,
19994,
2162,
14363,
374,
430,
358,
649,
636,
1063,
5403,
2884,
13,
358,
2834,
956,
387,
3025,
311,
2567,
709,
420,
18338,
369,
1317,
2001,
279,
6603,
358,
3077,
1027,
5403,
31445,
617,
1120,
1027,
2697,
4062,
16181,
627,
7280,
674,
22,
374,
24150,
735,
616,
4858,
596,
5652,
11775,
11,
12015,
13539,
13,
27140,
1455,
315,
735,
616,
4858,
596,
1023,
32963,
11,
279,
46684,
374,
539,
8683,
40838,
11,
719,
264,
8954,
45259,
1176,
11784,
304,
33919,
46910,
11,
85037,
58280,
627,
40,
14333,
279,
2363,
13,
358,
1093,
735,
616,
4858,
596,
2349,
315,
18338,
449,
279,
502,
46684,
13,
1283,
596,
4762,
3794,
264,
2697,
27724,
704,
4477,
922,
8683,
40838,
682,
279,
892,
13,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0
] | [
4054,
9610,
315,
19994,
2162,
14363,
374,
430,
358,
649,
636,
1063,
5403,
2884,
13,
358,
2834,
956,
387,
3025,
311,
2567,
709,
420,
18338,
369,
1317,
2001,
279,
6603,
358,
3077,
1027,
5403,
31445,
617,
1120,
1027,
2697,
4062,
16181,
627,
7280,
674,
22,
374,
24150,
735,
616,
4858,
596,
5652,
11775,
11,
12015,
13539,
13,
27140,
1455,
315,
735,
616,
4858,
596,
1023,
32963,
11,
279,
46684,
374,
539,
8683,
40838,
11,
719,
264,
8954,
45259,
1176,
11784,
304,
33919,
46910,
11,
85037,
58280,
627,
40,
14333,
279,
2363,
13,
358,
1093,
735,
616,
4858,
596,
2349,
315,
18338,
449,
279,
502,
46684,
13,
1283,
596,
4762,
3794,
264,
2697,
27724,
704,
4477,
922,
8683,
40838,
682,
279,
892,
13,
-100,
-100,
-100,
-100,
-100,
-100
] |
This document represents version 3 of the 'Requirements for certification of data centres', published by ECRIN, the European Clinical Research Infrastructure Network (the first version was produced in 2011, and the second in 2012). The requirements are the criteria used by ECRIN to identify, and then certify, clinical trials units that can provide high quality, compliant and safe data management, as well as effective management of the underlying systems and IT infrastructure. This latest version results from a review in 2015 by ECRIN auditors, members of ECRIN's data centre Certification Board, and invited experts from a variety of trials units in Europe, and it reflects experience gained auditing trials units in 2014.
Over and above their use for certification, the requirements are intended to describe good practice in data and IT management in clinical research, and in clinical trials in particular. They were developed by senior staff working in non-commercial clinical trials units in Europe, and are intended as a practical guide for staff working in IT and data management in that sector (though the same principles apply to all clinical research environments).
The 129 requirements, or standards, included in the current version are divided into 19 separate lists, some focused on IT, some mainly concerned with data management, and some that deal with both. Each standard has a code, a title, and a single statement summarizing the requirement. This document provides, in addition, explanatory and elaboration material – usually a few paragraphs that attempt to clarify each statement's meaning, and / or give examples of its application, and which also indicate the evidence that would normally be used to assess a unit's compliance. The document also includes a brief introduction to the standards and their development, including a description of the ECRIN audit process, and a glossary of terms. | {
"redpajama_set_name": "RedPajamaC4"
} | 6,434 | [
128000,
2028,
2246,
11105,
2373,
220,
18,
315,
279,
364,
60302,
369,
28706,
315,
828,
36282,
518,
4756,
555,
469,
9150,
691,
11,
279,
7665,
33135,
8483,
45587,
8304,
320,
1820,
1176,
2373,
574,
9124,
304,
220,
679,
16,
11,
323,
279,
2132,
304,
220,
679,
17,
570,
578,
8670,
527,
279,
13186,
1511,
555,
469,
9150,
691,
311,
10765,
11,
323,
1243,
93330,
11,
14830,
19622,
8316,
430,
649,
3493,
1579,
4367,
11,
49798,
323,
6220,
828,
6373,
11,
439,
1664,
439,
7524,
6373,
315,
279,
16940,
6067,
323,
8871,
14054,
13,
1115,
5652,
2373,
3135,
505,
264,
3477,
304,
220,
679,
20,
555,
469,
9150,
691,
6264,
12170,
11,
3697,
315,
469,
9150,
691,
596,
828,
12541,
51310,
8925,
11,
323,
18719,
11909,
505,
264,
8205
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
2028,
2246,
11105,
2373,
220,
18,
315,
279,
364,
60302,
369,
28706,
315,
828,
36282,
518,
4756,
555,
469,
9150,
691,
11,
279,
7665,
33135,
8483,
45587,
8304,
320,
1820,
1176,
2373,
574,
9124,
304,
220,
679,
16,
11,
323,
279,
2132,
304,
220,
679,
17,
570,
578,
8670,
527,
279,
13186,
1511,
555,
469,
9150,
691,
311,
10765,
11,
323,
1243,
93330,
11,
14830,
19622,
8316,
430,
649,
3493,
1579,
4367,
11,
49798,
323,
6220,
828,
6373,
11,
439,
1664,
439,
7524,
6373,
315,
279,
16940,
6067,
323,
8871,
14054,
13,
1115,
5652,
2373,
3135,
505,
264,
3477,
304,
220,
679,
20,
555,
469,
9150,
691,
6264,
12170,
11,
3697,
315,
469,
9150,
691,
596,
828,
12541,
51310,
8925,
11,
323,
18719,
11909,
505,
264,
8205,
-100
] |
package org.zstack.header.allocator;
import org.zstack.header.configuration.DiskOfferingInventory;
import org.zstack.header.image.ImageInventory;
import org.zstack.header.vm.VmInstanceInventory;
import java.util.*;
/**
*/
public class HostAllocatorSpec {
private List<String> avoidHostUuids;
private List<String> softAvoidHostUuids;
private long cpuCapacity;
private long memoryCapacity;
private List<String> l3NetworkUuids;
private long diskSize;
private String hypervisorType;
private String allocatorStrategy;
private VmInstanceInventory vmInstance;
private ImageInventory image;
private String vmOperation;
private List<DiskOfferingInventory> diskOfferings = new ArrayList<>();
private Map<Object, Object> extraData = new HashMap<>();
private boolean allowNoL3Networks;
private boolean listAllHosts;
private String requiredBackupStorageUuid;
private Set<String> requiredPrimaryStorageUuids = new HashSet<>();
private Map<String, List<String>> backupStoragePrimaryStorageMetrics;
private boolean dryRun;
private List<String> systemTags;
private Map<String, Set<String>> host2PrimaryStorageBlacklist = new HashMap<>();
private boolean fullAllocate;
private long oldMemoryCapacity = 0;
private AllocationScene allocationScene;
private String architecture;
public AllocationScene getAllocationScene() {
return allocationScene;
}
public void setAllocationScene(AllocationScene allocationScene) {
this.allocationScene = allocationScene;
}
public List<String> getSystemTags() {
return systemTags;
}
public void setSystemTags(List<String> systemTags) {
this.systemTags = systemTags;
}
public boolean isDryRun() {
return dryRun;
}
public void setDryRun(boolean dryRun) {
this.dryRun = dryRun;
}
public void setRequiredPrimaryStorageUuids(Set<String> requiredPrimaryStorageUuids) {
this.requiredPrimaryStorageUuids = requiredPrimaryStorageUuids;
}
public Set<String> getRequiredPrimaryStorageUuids() {
return requiredPrimaryStorageUuids;
}
public String getRequiredBackupStorageUuid() {
return requiredBackupStorageUuid;
}
public void setRequiredBackupStorageUuid(String requiredBackupStorageUuid) {
this.requiredBackupStorageUuid = requiredBackupStorageUuid;
}
public boolean isListAllHosts() {
return listAllHosts;
}
public void setListAllHosts(boolean listAllHosts) {
this.listAllHosts = listAllHosts;
}
public boolean isAllowNoL3Networks() {
return allowNoL3Networks;
}
public void setAllowNoL3Networks(boolean allowNoL3Networks) {
this.allowNoL3Networks = allowNoL3Networks;
}
public List<DiskOfferingInventory> getDiskOfferings() {
return diskOfferings;
}
public void setDiskOfferings(List<DiskOfferingInventory> diskOfferings) {
this.diskOfferings = diskOfferings;
}
public String getVmOperation() {
return vmOperation;
}
public void setVmOperation(String vmOperation) {
this.vmOperation = vmOperation;
}
public List<String> getAvoidHostUuids() {
if (avoidHostUuids == null) {
avoidHostUuids = new ArrayList<>();
}
return avoidHostUuids;
}
public void setAvoidHostUuids(List<String> avoidHostUuids) {
this.avoidHostUuids = avoidHostUuids;
}
public List<String> getSoftAvoidHostUuids() {
return softAvoidHostUuids;
}
public void setSoftAvoidHostUuids(List<String> softAvoidHostUuids) {
this.softAvoidHostUuids = softAvoidHostUuids;
}
public long getCpuCapacity() {
return cpuCapacity;
}
public void setCpuCapacity(long cpuCapacity) {
this.cpuCapacity = cpuCapacity;
}
public long getMemoryCapacity() {
return memoryCapacity;
}
public void setMemoryCapacity(long memoryCapacity) {
this.memoryCapacity = memoryCapacity;
}
public List<String> getL3NetworkUuids() {
if (l3NetworkUuids == null) {
l3NetworkUuids = new ArrayList<>();
}
return l3NetworkUuids;
}
public void setL3NetworkUuids(List<String> l3NetworkUuids) {
this.l3NetworkUuids = l3NetworkUuids;
}
public long getDiskSize() {
return diskSize;
}
public void setDiskSize(long diskSize) {
this.diskSize = diskSize;
}
public String getHypervisorType() {
return hypervisorType;
}
public void setHypervisorType(String hypervisorType) {
this.hypervisorType = hypervisorType;
}
public String getAllocatorStrategy() {
return allocatorStrategy;
}
public void setAllocatorStrategy(String allocatorStrategy) {
this.allocatorStrategy = allocatorStrategy;
}
public VmInstanceInventory getVmInstance() {
return vmInstance;
}
public void setVmInstance(VmInstanceInventory vmInstance) {
this.vmInstance = vmInstance;
}
public Map<Object, Object> getExtraData() {
return extraData;
}
public void setExtraData(Map<Object, Object> extraData) {
this.extraData = extraData;
}
public ImageInventory getImage() {
return image;
}
public void setImage(ImageInventory image) {
this.image = image;
}
public String getArchitecture() {
return architecture;
}
public void setArchitecture(String architecture) {
this.architecture = architecture;
}
public static HostAllocatorSpec fromAllocationMsg(AllocateHostMsg msg) {
HostAllocatorSpec spec = new HostAllocatorSpec();
spec.setAllocatorStrategy(msg.getAllocatorStrategy());
spec.setAvoidHostUuids(msg.getAvoidHostUuids());
spec.setSoftAvoidHostUuids(msg.getSoftAvoidHostUuids());
spec.setCpuCapacity(msg.getCpuCapacity());
spec.setDiskSize(msg.getDiskSize());
spec.setListAllHosts(msg.isListAllHosts());
spec.setDryRun(msg.isDryRun());
spec.setFullAllocate(msg.isFullAllocate());
spec.setOldMemoryCapacity(msg.getOldMemoryCapacity());
String hvType = null;
if (msg.getVmInstance() != null && msg.getVmInstance().getHypervisorType() != null) {
hvType = msg.getVmInstance().getHypervisorType();
}
spec.setHypervisorType(hvType);
spec.setMemoryCapacity(msg.getMemoryCapacity());
spec.setVmInstance(msg.getVmInstance());
spec.setL3NetworkUuids(msg.getL3NetworkUuids());
spec.setImage(msg.getImage());
spec.setVmOperation(msg.getVmOperation());
spec.setDiskOfferings(msg.getDiskOfferings());
spec.setAllowNoL3Networks(msg.isAllowNoL3Networks());
spec.setRequiredBackupStorageUuid(msg.getRequiredBackupStorageUuid());
spec.setRequiredPrimaryStorageUuids(msg.getRequiredPrimaryStorageUuids());
spec.setAllocationScene(msg.getAllocationScene());
spec.setArchitecture(msg.getArchitecture());
if (msg.getSystemTags() != null && !msg.getSystemTags().isEmpty()){
spec.setSystemTags(new ArrayList<String>(msg.getSystemTags()));
}
return spec;
}
public Map<String, List<String>> getBackupStoragePrimaryStorageMetrics() {
return backupStoragePrimaryStorageMetrics;
}
public void setBackupStoragePrimaryStorageMetrics(Map<String, List<String>> backupStoragePrimaryStorageMetrics) {
this.backupStoragePrimaryStorageMetrics = backupStoragePrimaryStorageMetrics;
}
public Map<String, Set<String>> getHost2PrimaryStorageBlacklist() {
return host2PrimaryStorageBlacklist;
}
public void setHost2PrimaryStorageBlacklist(Map<String, Set<String>> host2PrimaryStorageBlacklist) {
this.host2PrimaryStorageBlacklist = host2PrimaryStorageBlacklist;
}
public boolean isFullAllocate() {
return fullAllocate;
}
public void setFullAllocate(boolean fullAllocate) {
this.fullAllocate = fullAllocate;
}
public long getOldMemoryCapacity() {
return oldMemoryCapacity;
}
public void setOldMemoryCapacity(long oldMemoryCapacity) {
this.oldMemoryCapacity = oldMemoryCapacity;
}
}
| {
"redpajama_set_name": "RedPajamaGithub"
} | 6,599 | [
128000,
1757,
1262,
4025,
7848,
17531,
13,
58731,
401,
475,
1262,
4025,
7848,
17531,
32553,
920,
3267,
40562,
287,
23120,
280,
475,
1262,
4025,
7848,
17531,
7502,
7680,
23120,
280,
475,
1262,
4025,
7848,
17531,
39759,
5168,
76,
2584,
23120,
401,
475,
1674,
2013,
20083,
1784,
740,
898,
538,
16492,
43830,
8491,
341,
262,
879,
1796,
3548,
29,
5766,
9480,
39531,
82,
280,
262,
879,
1796,
3548,
29,
8579,
53216,
9480,
39531,
82,
280,
262,
879,
1317,
17769,
30492,
280,
262,
879,
1317,
5044,
30492,
280,
262,
879,
1796,
3548,
29,
326,
18,
12600,
39531,
82,
280,
262,
879,
1317,
13668,
1730,
280,
262,
879,
935,
9950,
32496,
941,
280,
262,
879,
935,
44755,
20403,
280,
262,
879,
650,
76,
2584,
23120,
11238,
2584,
280,
262,
879,
4758
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
1757,
1262,
4025,
7848,
17531,
13,
58731,
401,
475,
1262,
4025,
7848,
17531,
32553,
920,
3267,
40562,
287,
23120,
280,
475,
1262,
4025,
7848,
17531,
7502,
7680,
23120,
280,
475,
1262,
4025,
7848,
17531,
39759,
5168,
76,
2584,
23120,
401,
475,
1674,
2013,
20083,
1784,
740,
898,
538,
16492,
43830,
8491,
341,
262,
879,
1796,
3548,
29,
5766,
9480,
39531,
82,
280,
262,
879,
1796,
3548,
29,
8579,
53216,
9480,
39531,
82,
280,
262,
879,
1317,
17769,
30492,
280,
262,
879,
1317,
5044,
30492,
280,
262,
879,
1796,
3548,
29,
326,
18,
12600,
39531,
82,
280,
262,
879,
1317,
13668,
1730,
280,
262,
879,
935,
9950,
32496,
941,
280,
262,
879,
935,
44755,
20403,
280,
262,
879,
650,
76,
2584,
23120,
11238,
2584,
280,
262,
879,
4758,
-100
] |
Become a sponsor to one of our pets!
Your generous sponsorship will help cover the cost of the adoption package. It will also waive the chosen animal's adoption fee!
Pet sponsors receive updates about their sponsored pet and will be notified when that animal has found his or her forever home. | {
"redpajama_set_name": "RedPajamaC4"
} | 9,426 | [
128000,
65349,
264,
25438,
311,
832,
315,
1057,
26159,
4999,
7927,
28771,
55531,
690,
1520,
3504,
279,
2853,
315,
279,
25375,
6462,
13,
1102,
690,
1101,
91383,
279,
12146,
10065,
596,
25375,
11307,
4999,
35919,
39701,
5371,
9013,
922,
872,
30638,
6896,
323,
690,
387,
30316,
994,
430,
10065,
706,
1766,
813,
477,
1077,
16058,
2162,
13,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
65349,
264,
25438,
311,
832,
315,
1057,
26159,
4999,
7927,
28771,
55531,
690,
1520,
3504,
279,
2853,
315,
279,
25375,
6462,
13,
1102,
690,
1101,
91383,
279,
12146,
10065,
596,
25375,
11307,
4999,
35919,
39701,
5371,
9013,
922,
872,
30638,
6896,
323,
690,
387,
30316,
994,
430,
10065,
706,
1766,
813,
477,
1077,
16058,
2162,
13,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
Council opposes bank in Business Park
Squamish Council Tuesday reaffirmed its opposition to land in the Squamish Business Park being used for personal services - including a bank proposed for the corner of Hwy. 99 and Industrial Way. Council made the motion at 10:50 p.m.
What's on at the Squamish Public Library Foyer Gallery:
ANGELA BAILEY, Ceramics Angela's East Coast heritage along with her love for West Coast terrain has shaped and influenced her clay artistry. Both coasts contribute to her affinity for the earth and rock that encompasses much of her daily life.
Counter-petition fails, waterfront deal moves ahead
Voters won't going to the polls to approve the District of Squamish's acquisition of a large parcel of waterfront land south of downtown Squamish.
$2.9M price tag for flood of 2003
Last fall's massive flooding has left $1.9 million worth of damage in its wake so far, with another million dollars of work still to be done, according to a District of Squamish report.
ELECTION 2004: Wilson finds victory in narrow loss
In 1997 federal Liberal Phil Boname did well against veteran politician John Reynolds and in 2000 Ian McKay dropped the ball for the Liberal Party of Canada. In 2004, young Blair Wilson almost brought down the giant.
ELECTION 2004: Liberals win Squamish polls
There's only one winner in West Vancouver-Sunshine Coast after Monday's federal election - but local organizers from three different parties are claiming victories.
The man behind the mountain
He was called the "Hero of Two Worlds", in tribute to his military adventures in both South America and Europe, and his name became famous around the world.
ELECTION 2004: Back from the dead
Reynolds was confident of victory even when declared defeated Tim Shoults Chief Staff Writer One of John Reynolds' first calls Tuesday morning after narrowly winning re-election to Parliament was from Peter Mansbridge.
Campaign to vote on Nexen land deal under way
It has taken more than a month, but organized opposition is mounting against the Nexen land deal. But the push may be too little, too late as a counter petition process comes to a close on Tuesday (July 6) at 4 p.m.
Going to Camp Rock
This isn't your average, ordinary summer camp for kids. | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 6,113 | [
128000,
88934,
76312,
6201,
304,
8184,
5657,
198,
50,
87801,
819,
9251,
7742,
73100,
8600,
1202,
14076,
311,
4363,
304,
279,
20685,
309,
819,
8184,
5657,
1694,
1511,
369,
4443,
3600,
482,
2737,
264,
6201,
11223,
369,
279,
9309,
315,
80077,
13,
220,
1484,
323,
25563,
12424,
13,
9251,
1903,
279,
11633,
520,
220,
605,
25,
1135,
281,
749,
627,
3923,
596,
389,
520,
279,
20685,
309,
819,
3142,
11896,
435,
42219,
19853,
512,
5330,
2818,
32,
34589,
3015,
56,
11,
28764,
79278,
38243,
596,
6460,
16377,
28948,
3235,
449,
1077,
3021,
369,
4410,
16377,
25911,
706,
27367,
323,
28160,
1077,
37148,
1989,
5050,
13,
11995,
1080,
12019,
17210,
311,
1077,
51552,
369,
279,
9578,
323,
7091,
430,
71010,
1790,
315,
1077,
7446,
2324,
627,
14431,
2320,
295
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
88934,
76312,
6201,
304,
8184,
5657,
198,
50,
87801,
819,
9251,
7742,
73100,
8600,
1202,
14076,
311,
4363,
304,
279,
20685,
309,
819,
8184,
5657,
1694,
1511,
369,
4443,
3600,
482,
2737,
264,
6201,
11223,
369,
279,
9309,
315,
80077,
13,
220,
1484,
323,
25563,
12424,
13,
9251,
1903,
279,
11633,
520,
220,
605,
25,
1135,
281,
749,
627,
3923,
596,
389,
520,
279,
20685,
309,
819,
3142,
11896,
435,
42219,
19853,
512,
5330,
2818,
32,
34589,
3015,
56,
11,
28764,
79278,
38243,
596,
6460,
16377,
28948,
3235,
449,
1077,
3021,
369,
4410,
16377,
25911,
706,
27367,
323,
28160,
1077,
37148,
1989,
5050,
13,
11995,
1080,
12019,
17210,
311,
1077,
51552,
369,
279,
9578,
323,
7091,
430,
71010,
1790,
315,
1077,
7446,
2324,
627,
14431,
2320,
295,
-100
] |
My latest review is up! This time I take a look at Dragon Ball Super Season 1 Part 2 (Episodes 14-26).
It's rather tempting to simply copy and paste chunks of our review for Dragon Ball Super Season 1 Part 1 here, because many of the comments about that release apply equally to this one. Like the previous set this one regurgitates a portion of the Dragon Ball Super timeline already covered in the movies. In this case it's Dragon Ball Z: Resurrection F which gets the padding and tweaking treatment.
The first episode of Dragon Ball Super Season 1 Part 2 wraps up the story arc from the last set, with Goku finally admitting defeat against Lord Beerus. Following Goku's defeat life largely returns to normal for the Z-fighters. Though Goku finds himself increasingly under pressure from Chi-Chi to stop training and do something "normal" for once. And so Goku finds himself working on a farm… There are no prizes for guessing how long that lasts.
Though that's not before Vegeta discovers that Whis is Lord Beerus' trainer and prostrates himself before the deity's assistant, in an effort to gain favour and become his latest pupil. He initially makes a bit of a mess of the situation, but after successfully managing to propitiate (guess what popped up as word of the day while I was writing this) Whis - by appealing to his stomach - Vegeta departs for Lord Beerus' world to begin his training. Naturally it's not long before Goku gets wind of this and wants in on the action himself, much to the chagrin of Chi-Chi.
The opening episodes of this set largely lean towards the light-hearted end of the Dragon Ball spectrum. Especially one early episode which deals with Mr Satan facing a challenge from outer space, something which holds a comedic mirror up the the series' later events. These episodes are a lot of fun, in the tradition of Dragon Ball. There is even time to cover the arrival of a new Saiyan on Earth, in the form of baby Pan.
Ultimately though this half of Dragon Ball Super Season 1 is about one thing and one thing only, the return of the Frieza Force, and eventually Frieza himself. This is one for the Dragon Ball Z fans, especially the 30-somethings who remember the original run on Cartoon Network here in the UK. Anyone who can recall the original appearance of Frieza will get a real kick out of these episodes, as much of the content of those episodes is mirrored here, albeit in a condensed form (thankfully, as the original was a long-winded affair).
Unfortunately the animation quality dips quite often in this set and there doesn't appear to have been much in the way of cleaning and improvement done since the notoriously bad streaming version. This really is modern animation at it's worst, I can't recall seeing anything this bad for some time.
When all is said and done, I can summarise this in much the same way as I did the last set: while this particular section of Dragon Ball Super may feel unnecessary, and is perfectly well served by the movie Dragon Ball Z: Resurrection F, it is worth a look for the differences in approach and is still just as entertaining as Dragon Ball has always been.
6 - Just as unnecessary as Part 1, but still the same Dragon Ball we know and love. | {
"redpajama_set_name": "RedPajamaC4"
} | 9,097 | [
128000,
5159,
5652,
3477,
374,
709,
0,
1115,
892,
358,
1935,
264,
1427,
520,
16537,
13131,
7445,
14598,
220,
16,
3744,
220,
17,
320,
23176,
15081,
220,
975,
12,
1627,
4390,
2181,
596,
4856,
61299,
311,
5042,
3048,
323,
25982,
27855,
315,
1057,
3477,
369,
16537,
13131,
7445,
14598,
220,
16,
3744,
220,
16,
1618,
11,
1606,
1690,
315,
279,
6170,
922,
430,
4984,
3881,
18813,
311,
420,
832,
13,
9086,
279,
3766,
743,
420,
832,
1239,
5673,
82829,
264,
13651,
315,
279,
16537,
13131,
7445,
25845,
2736,
9960,
304,
279,
9698,
13,
763,
420,
1162,
433,
596,
16537,
13131,
1901,
25,
1838,
40304,
435,
902,
5334,
279,
5413,
323,
89347,
6514,
627,
791,
1176,
9417,
315,
16537,
13131,
7445,
14598,
220,
16,
3744,
220,
17,
40809,
709
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
5159,
5652,
3477,
374,
709,
0,
1115,
892,
358,
1935,
264,
1427,
520,
16537,
13131,
7445,
14598,
220,
16,
3744,
220,
17,
320,
23176,
15081,
220,
975,
12,
1627,
4390,
2181,
596,
4856,
61299,
311,
5042,
3048,
323,
25982,
27855,
315,
1057,
3477,
369,
16537,
13131,
7445,
14598,
220,
16,
3744,
220,
16,
1618,
11,
1606,
1690,
315,
279,
6170,
922,
430,
4984,
3881,
18813,
311,
420,
832,
13,
9086,
279,
3766,
743,
420,
832,
1239,
5673,
82829,
264,
13651,
315,
279,
16537,
13131,
7445,
25845,
2736,
9960,
304,
279,
9698,
13,
763,
420,
1162,
433,
596,
16537,
13131,
1901,
25,
1838,
40304,
435,
902,
5334,
279,
5413,
323,
89347,
6514,
627,
791,
1176,
9417,
315,
16537,
13131,
7445,
14598,
220,
16,
3744,
220,
17,
40809,
709,
-100
] |
establishing myself in the suburbs of London.
money. Immense necessity! Universal want!
feel for us? How insensible must that man be!
atmosphere of Society, as "Miss Halcombe."
her with the volcanic ardour of eighteen.
mercifully off our miserable little stage!
an entire system of philosophy. It is Mine.
mental insight, by the hand of Marian herself.
has already made her own. | {
"redpajama_set_name": "RedPajamaC4"
} | 6,876 | [
128000,
34500,
287,
7182,
304,
279,
48013,
315,
7295,
627,
29359,
13,
15695,
1137,
32961,
0,
26581,
1390,
4999,
57676,
369,
603,
30,
2650,
1672,
37864,
2011,
430,
893,
387,
4999,
266,
8801,
8182,
315,
13581,
11,
439,
330,
36412,
20442,
92157,
10246,
1964,
449,
279,
67164,
85009,
414,
315,
63134,
627,
65522,
5092,
398,
1022,
1057,
50739,
2697,
6566,
4999,
276,
4553,
1887,
315,
19675,
13,
1102,
374,
31783,
627,
93221,
20616,
11,
555,
279,
1450,
315,
96519,
11937,
627,
4752,
2736,
1903,
1077,
1866,
13,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
34500,
287,
7182,
304,
279,
48013,
315,
7295,
627,
29359,
13,
15695,
1137,
32961,
0,
26581,
1390,
4999,
57676,
369,
603,
30,
2650,
1672,
37864,
2011,
430,
893,
387,
4999,
266,
8801,
8182,
315,
13581,
11,
439,
330,
36412,
20442,
92157,
10246,
1964,
449,
279,
67164,
85009,
414,
315,
63134,
627,
65522,
5092,
398,
1022,
1057,
50739,
2697,
6566,
4999,
276,
4553,
1887,
315,
19675,
13,
1102,
374,
31783,
627,
93221,
20616,
11,
555,
279,
1450,
315,
96519,
11937,
627,
4752,
2736,
1903,
1077,
1866,
13,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
I had no idea that an internment policy existed with the ROI, although I suppose it is obvious when you think about the ROI being neutral; after all internment was the rule with other neutral countries.
I'm all in favour, the Hurrican was by far the better fighter but didn't have the glamour of the Spitfire.
That has all the makings of another multi-page argument!
It is certainly something that luckily we never had to find out for real, having both types available.
The Hurricane was certainly a better gun platform, could absorb much more damage, was quicker to repair, was (by accounts) easier to fly as a newbie and probably had many other fine properties. It was also at the limit of its performance development as a dog-fighter and would have been outclassed by any Luftwaffe development, with the Typhoon not an initial success when it became available.
If we had only had Spitfires, I doubt that the kill rate would have changed much, but I believe that we would have had serious problems with getting even lightly damaged machines back into action in time.
As I said earlier, thank God we had both when we needed them.
Update on BBC Website Irish Army Ordenance Officer suggests firing one of the guns and due to the preservation of them in the peat bog after a little work one does actualy fire!!! | {
"redpajama_set_name": "RedPajamaC4"
} | 7,626 | [
128000,
40,
1047,
912,
4623,
430,
459,
2655,
479,
4947,
25281,
449,
279,
51752,
11,
8051,
358,
23289,
433,
374,
8196,
994,
499,
1781,
922,
279,
51752,
1694,
21277,
26,
1306,
682,
2655,
479,
574,
279,
6037,
449,
1023,
21277,
5961,
627,
40,
2846,
682,
304,
12617,
11,
279,
21670,
2265,
276,
574,
555,
3117,
279,
2731,
25902,
719,
3287,
956,
617,
279,
80049,
315,
279,
82841,
11029,
627,
4897,
706,
682,
279,
52016,
826,
315,
2500,
7447,
15463,
5811,
4999,
2181,
374,
7995,
2555,
430,
91145,
584,
2646,
1047,
311,
1505,
704,
369,
1972,
11,
3515,
2225,
4595,
2561,
627,
791,
38201,
574,
7995,
264,
2731,
6166,
5452,
11,
1436,
35406,
1790,
810,
5674,
11,
574,
39392,
311,
13023,
11,
574,
320,
1729,
9815,
8,
8831,
311
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
40,
1047,
912,
4623,
430,
459,
2655,
479,
4947,
25281,
449,
279,
51752,
11,
8051,
358,
23289,
433,
374,
8196,
994,
499,
1781,
922,
279,
51752,
1694,
21277,
26,
1306,
682,
2655,
479,
574,
279,
6037,
449,
1023,
21277,
5961,
627,
40,
2846,
682,
304,
12617,
11,
279,
21670,
2265,
276,
574,
555,
3117,
279,
2731,
25902,
719,
3287,
956,
617,
279,
80049,
315,
279,
82841,
11029,
627,
4897,
706,
682,
279,
52016,
826,
315,
2500,
7447,
15463,
5811,
4999,
2181,
374,
7995,
2555,
430,
91145,
584,
2646,
1047,
311,
1505,
704,
369,
1972,
11,
3515,
2225,
4595,
2561,
627,
791,
38201,
574,
7995,
264,
2731,
6166,
5452,
11,
1436,
35406,
1790,
810,
5674,
11,
574,
39392,
311,
13023,
11,
574,
320,
1729,
9815,
8,
8831,
311,
-100
] |
Are you stuck in the middle of the road and need emergency roadside assistance? Don't worry! Macpela Towing will help you get out of the situation. We specialize in emergency towing, flatbed towing, junk car removal, recovery services and more. We have been providing the best towing services to customers in Summit and nearby areas for the past 14 years.
If you have a trouble starting the car, our skilled professionals are here to help you. We have some of the finest response times in the Newark and New Jersey area for jump starts, towing, lockouts and more. Call us at (973) 536-2102 to learn more about our services. However, please note that we are not allowed on the turnpike and do not provide impound services. | {
"redpajama_set_name": "RedPajamaC4"
} | 8,696 | [
128000,
11787,
499,
16075,
304,
279,
6278,
315,
279,
5754,
323,
1205,
13147,
80743,
13291,
30,
4418,
956,
11196,
0,
7553,
79,
8458,
350,
24060,
690,
1520,
499,
636,
704,
315,
279,
6671,
13,
1226,
48444,
304,
13147,
89792,
11,
10269,
2788,
89792,
11,
30774,
1841,
17065,
11,
13654,
3600,
323,
810,
13,
1226,
617,
1027,
8405,
279,
1888,
89792,
3600,
311,
6444,
304,
35769,
323,
14373,
5789,
369,
279,
3347,
220,
975,
1667,
627,
2746,
499,
617,
264,
12544,
6041,
279,
1841,
11,
1057,
26611,
15749,
527,
1618,
311,
1520,
499,
13,
1226,
617,
1063,
315,
279,
28807,
2077,
3115,
304,
279,
65599,
323,
1561,
16228,
3158,
369,
7940,
8638,
11,
89792,
11,
5409,
11934,
323,
810,
13,
7290,
603,
520,
320,
24471,
8,
220,
21600,
12
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
11787,
499,
16075,
304,
279,
6278,
315,
279,
5754,
323,
1205,
13147,
80743,
13291,
30,
4418,
956,
11196,
0,
7553,
79,
8458,
350,
24060,
690,
1520,
499,
636,
704,
315,
279,
6671,
13,
1226,
48444,
304,
13147,
89792,
11,
10269,
2788,
89792,
11,
30774,
1841,
17065,
11,
13654,
3600,
323,
810,
13,
1226,
617,
1027,
8405,
279,
1888,
89792,
3600,
311,
6444,
304,
35769,
323,
14373,
5789,
369,
279,
3347,
220,
975,
1667,
627,
2746,
499,
617,
264,
12544,
6041,
279,
1841,
11,
1057,
26611,
15749,
527,
1618,
311,
1520,
499,
13,
1226,
617,
1063,
315,
279,
28807,
2077,
3115,
304,
279,
65599,
323,
1561,
16228,
3158,
369,
7940,
8638,
11,
89792,
11,
5409,
11934,
323,
810,
13,
7290,
603,
520,
320,
24471,
8,
220,
21600,
12,
-100
] |
Evidence of widespread control of fire dates to approximately 125,000 years ago and earlier. Evidence for the controlled use of fire by Homo erectus beginning some 400,000 years ago has wide scholarly support, with claims regarding earlier evidence finding increasing scientific support.
Claims for the earliest definitive evidence of control of fire by a member of Homo range from 0.2 to 1.7 million years ago. | {
"redpajama_set_name": "RedPajamaC4"
} | 7,888 | [
128000,
93702,
315,
24716,
2585,
315,
4027,
13003,
311,
13489,
220,
6549,
11,
931,
1667,
4227,
323,
6931,
13,
44796,
369,
279,
14400,
1005,
315,
4027,
555,
84497,
38732,
355,
7314,
1063,
220,
3443,
11,
931,
1667,
4227,
706,
7029,
63681,
1862,
11,
449,
8349,
9002,
6931,
6029,
9455,
7859,
12624,
1862,
627,
52233,
369,
279,
30758,
45813,
6029,
315,
2585,
315,
4027,
555,
264,
4562,
315,
84497,
2134,
505,
220,
15,
13,
17,
311,
220,
16,
13,
22,
3610,
1667,
4227,
13,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
93702,
315,
24716,
2585,
315,
4027,
13003,
311,
13489,
220,
6549,
11,
931,
1667,
4227,
323,
6931,
13,
44796,
369,
279,
14400,
1005,
315,
4027,
555,
84497,
38732,
355,
7314,
1063,
220,
3443,
11,
931,
1667,
4227,
706,
7029,
63681,
1862,
11,
449,
8349,
9002,
6931,
6029,
9455,
7859,
12624,
1862,
627,
52233,
369,
279,
30758,
45813,
6029,
315,
2585,
315,
4027,
555,
264,
4562,
315,
84497,
2134,
505,
220,
15,
13,
17,
311,
220,
16,
13,
22,
3610,
1667,
4227,
13,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
Narrow, bouldery, several 1.5m drops and one of 6m.
Very top end of Slaheny valley. From Kilgarvan go up past the Roughty take out, up past motor museum and keep going. After tunnel look for a sign for a self catering cottage. This is the take out. Plenty parking here- not much at put in.
Drive to top of valley. - When you see a large stream entering from other side of valley above a massive waterfall find the next gate on left.
This is the put in.
- Take out is first bridge.
Narrow rapids follow. Steep and bouldery. After 1km 1.5m drop on corner into small gorge.
Then hydro-station outfall adds flow.
Then small horizon line is a 2m drop best run far right.
None known. Met landowner at take out- semmed friendly.
On way up- if motor museum rapid has water flowing over rocks on left-go for it! | {
"redpajama_set_name": "RedPajamaC4"
} | 4,902 | [
128000,
45,
6172,
11,
293,
619,
727,
11,
3892,
220,
16,
13,
20,
76,
21701,
323,
832,
315,
220,
21,
76,
627,
26840,
1948,
842,
315,
6995,
1494,
33495,
34681,
13,
5659,
38988,
12440,
16023,
733,
709,
3347,
279,
432,
2509,
88,
1935,
704,
11,
709,
3347,
9048,
24925,
323,
2567,
2133,
13,
4740,
26711,
1427,
369,
264,
1879,
369,
264,
659,
54929,
46722,
13,
1115,
374,
279,
1935,
704,
13,
69489,
13217,
1618,
12,
539,
1790,
520,
2231,
304,
627,
33557,
311,
1948,
315,
34681,
13,
482,
3277,
499,
1518,
264,
3544,
4365,
16661,
505,
1023,
3185,
315,
34681,
3485,
264,
11191,
70151,
1505,
279,
1828,
18618,
389,
2163,
627,
2028,
374,
279,
2231,
304,
627,
12,
12040,
704,
374,
1176,
14497,
627,
45,
6172,
7477,
3447
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
45,
6172,
11,
293,
619,
727,
11,
3892,
220,
16,
13,
20,
76,
21701,
323,
832,
315,
220,
21,
76,
627,
26840,
1948,
842,
315,
6995,
1494,
33495,
34681,
13,
5659,
38988,
12440,
16023,
733,
709,
3347,
279,
432,
2509,
88,
1935,
704,
11,
709,
3347,
9048,
24925,
323,
2567,
2133,
13,
4740,
26711,
1427,
369,
264,
1879,
369,
264,
659,
54929,
46722,
13,
1115,
374,
279,
1935,
704,
13,
69489,
13217,
1618,
12,
539,
1790,
520,
2231,
304,
627,
33557,
311,
1948,
315,
34681,
13,
482,
3277,
499,
1518,
264,
3544,
4365,
16661,
505,
1023,
3185,
315,
34681,
3485,
264,
11191,
70151,
1505,
279,
1828,
18618,
389,
2163,
627,
2028,
374,
279,
2231,
304,
627,
12,
12040,
704,
374,
1176,
14497,
627,
45,
6172,
7477,
3447,
-100
] |
At least 200 people with colourful umbrellas stand strong in the pouring rain outside the B.C. Legislature Building in Victoria B.C. on February 15, 2014.
This image was posted on February 21, 2014, 3:06 pm. You can follow any responses to this entry through RSS 2.0. You can leave a response, or trackback from your own site. | {
"redpajama_set_name": "RedPajamaC4"
} | 5,910 | [
128000,
1688,
3325,
220,
1049,
1274,
449,
70467,
37781,
74023,
2559,
3831,
304,
279,
51513,
11422,
4994,
279,
426,
732,
13,
47126,
17283,
304,
23225,
426,
732,
13,
389,
7552,
220,
868,
11,
220,
679,
19,
627,
2028,
2217,
574,
8621,
389,
7552,
220,
1691,
11,
220,
679,
19,
11,
220,
18,
25,
2705,
9012,
13,
1472,
649,
1833,
904,
14847,
311,
420,
4441,
1555,
30374,
220,
17,
13,
15,
13,
1472,
649,
5387,
264,
2077,
11,
477,
3839,
1445,
505,
701,
1866,
2816,
13,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
1688,
3325,
220,
1049,
1274,
449,
70467,
37781,
74023,
2559,
3831,
304,
279,
51513,
11422,
4994,
279,
426,
732,
13,
47126,
17283,
304,
23225,
426,
732,
13,
389,
7552,
220,
868,
11,
220,
679,
19,
627,
2028,
2217,
574,
8621,
389,
7552,
220,
1691,
11,
220,
679,
19,
11,
220,
18,
25,
2705,
9012,
13,
1472,
649,
1833,
904,
14847,
311,
420,
4441,
1555,
30374,
220,
17,
13,
15,
13,
1472,
649,
5387,
264,
2077,
11,
477,
3839,
1445,
505,
701,
1866,
2816,
13,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
George Sand et al. in Paris - December, 1842
Anyhow she [George Sand] has a very pretty house. From the entrance one proceeds straight to her large drawing-room with its billiard-table. On the mantelpiece stand the things a smoker requires and she is the first to light up her cigar. It is here that she prefers to meet her literary friends, among others Heinrich Heine, who is a most eager listener when Chopin allows himself to be led to the piano in a little side-salon. After letting his hands wander dreamily over the keys for a few moments he suddenly wakes up, and then his playing is stupefying and unbelievably moving in the almost … more >>
Anyhow she [George Sand] has a very pretty house. From the entrance one proceeds straight to her large drawing-room with its billiard-table. On the mantelpiece stand the things a smoker requires and she is the first to light up her cigar. It is here that she prefers to meet her literary friends, among others Heinrich Heine, who is a most eager listener when Chopin allows himself to be led to the piano in a little side-salon. After letting his hands wander dreamily over the keys for a few moments he suddenly wakes up, and then his playing is stupefying and unbelievably moving in the almost complete darkness his varied inspirations now lull us, now electrify us, or throw us into the darkest recesses of our own thoughts. << less
memoirist, Novelist
Joseph Filtsch
Listening Environment in the company of others, in private, indoors | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 5,914 | [
128000,
40052,
8847,
1880,
453,
13,
304,
12366,
482,
6790,
11,
220,
10336,
17,
198,
8780,
5269,
1364,
510,
40052,
8847,
60,
706,
264,
1633,
5128,
3838,
13,
5659,
279,
20396,
832,
34555,
7833,
311,
1077,
3544,
13633,
48840,
449,
1202,
4121,
68965,
17203,
13,
1952,
279,
26976,
1290,
9286,
2559,
279,
2574,
264,
78320,
7612,
323,
1364,
374,
279,
1176,
311,
3177,
709,
1077,
54774,
13,
1102,
374,
1618,
430,
1364,
55064,
311,
3449,
1077,
32465,
4885,
11,
4315,
3885,
64782,
14172,
1283,
483,
11,
889,
374,
264,
1455,
24450,
11700,
994,
65097,
258,
6276,
5678,
311,
387,
6197,
311,
279,
27374,
304,
264,
2697,
3185,
1355,
44711,
13,
4740,
20806,
813,
6206,
40320,
8063,
1570,
927,
279,
7039,
369,
264,
2478,
14269,
568,
15187,
62667,
709
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
40052,
8847,
1880,
453,
13,
304,
12366,
482,
6790,
11,
220,
10336,
17,
198,
8780,
5269,
1364,
510,
40052,
8847,
60,
706,
264,
1633,
5128,
3838,
13,
5659,
279,
20396,
832,
34555,
7833,
311,
1077,
3544,
13633,
48840,
449,
1202,
4121,
68965,
17203,
13,
1952,
279,
26976,
1290,
9286,
2559,
279,
2574,
264,
78320,
7612,
323,
1364,
374,
279,
1176,
311,
3177,
709,
1077,
54774,
13,
1102,
374,
1618,
430,
1364,
55064,
311,
3449,
1077,
32465,
4885,
11,
4315,
3885,
64782,
14172,
1283,
483,
11,
889,
374,
264,
1455,
24450,
11700,
994,
65097,
258,
6276,
5678,
311,
387,
6197,
311,
279,
27374,
304,
264,
2697,
3185,
1355,
44711,
13,
4740,
20806,
813,
6206,
40320,
8063,
1570,
927,
279,
7039,
369,
264,
2478,
14269,
568,
15187,
62667,
709,
-100
] |
Almond will serve a special four-course blood orange themed menu in honor of Valentine's Day. The menu will run on Thursday, February 14 in addition to the regular a la carte menu. The special menu includes courses of seasonal dishes featuring blood oranges and costs $85 per person. | {
"redpajama_set_name": "RedPajamaC4"
} | 1,149 | [
128000,
2149,
12669,
690,
8854,
264,
3361,
3116,
69529,
6680,
19087,
49644,
5130,
304,
16044,
315,
39869,
596,
6187,
13,
578,
5130,
690,
1629,
389,
7950,
11,
7552,
220,
975,
304,
5369,
311,
279,
5912,
264,
1208,
48454,
5130,
13,
578,
3361,
5130,
5764,
14307,
315,
36899,
26863,
16850,
6680,
85138,
323,
7194,
400,
5313,
824,
1732,
13,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
2149,
12669,
690,
8854,
264,
3361,
3116,
69529,
6680,
19087,
49644,
5130,
304,
16044,
315,
39869,
596,
6187,
13,
578,
5130,
690,
1629,
389,
7950,
11,
7552,
220,
975,
304,
5369,
311,
279,
5912,
264,
1208,
48454,
5130,
13,
578,
3361,
5130,
5764,
14307,
315,
36899,
26863,
16850,
6680,
85138,
323,
7194,
400,
5313,
824,
1732,
13,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
Guillaume Cliche completed his bachelor's degree in Fine Arts at UQAM. He also has a diploma in electroacoustics at the Montréal Conservatory of Music (Études supérieures I). In the past years, he has collaborated on compositions and live creations with groups of art performers such as Spirit Duplicata (2009), Les étrangers de l'intérieur (2010) and L'entre-rien (2011). His work has been featured on festivals sush as: Viva! Art action (Canada), Festival de performance de Rouyn-Noranda (Canada) and Platform Young Performance Artist (Berlin). Since 2011, his creative work focuses on electroacoustic composition. His pieces have been broadcast in different events such as: Totem électrique and Akousma. In addition, he co-founded the concert series Soundwich dedicated to emerging artists. In 2014, he released an EP called Espèce modèle on Kohlenstoff records. In 2016, he joins the collective and electronic music label Musique Maison. Since then, he has been managing the label and released an EP in 2018 called Pur relief under the pseudonym William Crop. He is now willing to explore further the processes of real-time and algorithmic composition, both musically and visually. | {
"redpajama_set_name": "RedPajamaC4"
} | 7,798 | [
128000,
17198,
99112,
356,
20603,
8308,
813,
49683,
596,
8547,
304,
31253,
17979,
520,
549,
48,
1428,
13,
1283,
1101,
706,
264,
61812,
304,
25396,
582,
26169,
1233,
520,
279,
3206,
99277,
20650,
5382,
315,
10948,
320,
27887,
83,
29246,
1043,
35285,
1439,
358,
570,
763,
279,
3347,
1667,
11,
568,
706,
78174,
389,
62644,
323,
3974,
53862,
449,
5315,
315,
1989,
45518,
1778,
439,
17326,
423,
10047,
460,
320,
1049,
24,
705,
11876,
4046,
376,
14381,
409,
326,
55624,
57663,
320,
679,
15,
8,
323,
445,
6,
40997,
12,
35838,
320,
679,
16,
570,
5414,
990,
706,
1027,
15109,
389,
45517,
274,
1136,
439,
25,
650,
10126,
0,
5277,
1957,
320,
37031,
705,
17772,
409,
5178,
409,
29622,
1910,
11500,
269,
10018,
320,
37031,
8,
323,
17916
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
17198,
99112,
356,
20603,
8308,
813,
49683,
596,
8547,
304,
31253,
17979,
520,
549,
48,
1428,
13,
1283,
1101,
706,
264,
61812,
304,
25396,
582,
26169,
1233,
520,
279,
3206,
99277,
20650,
5382,
315,
10948,
320,
27887,
83,
29246,
1043,
35285,
1439,
358,
570,
763,
279,
3347,
1667,
11,
568,
706,
78174,
389,
62644,
323,
3974,
53862,
449,
5315,
315,
1989,
45518,
1778,
439,
17326,
423,
10047,
460,
320,
1049,
24,
705,
11876,
4046,
376,
14381,
409,
326,
55624,
57663,
320,
679,
15,
8,
323,
445,
6,
40997,
12,
35838,
320,
679,
16,
570,
5414,
990,
706,
1027,
15109,
389,
45517,
274,
1136,
439,
25,
650,
10126,
0,
5277,
1957,
320,
37031,
705,
17772,
409,
5178,
409,
29622,
1910,
11500,
269,
10018,
320,
37031,
8,
323,
17916,
-100
] |
Puntas de Valdez – miasto w Urugwaju, w departamencie San José.
Miasta w Urugwaju | {
"redpajama_set_name": "RedPajamaWikipedia"
} | 5,502 | [
128000,
47,
55672,
409,
4196,
87624,
1389,
9686,
54485,
289,
17229,
773,
86,
52513,
11,
289,
11776,
309,
967,
648,
5960,
44365,
382,
42987,
14635,
289,
17229,
773,
86,
52513,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
47,
55672,
409,
4196,
87624,
1389,
9686,
54485,
289,
17229,
773,
86,
52513,
11,
289,
11776,
309,
967,
648,
5960,
44365,
382,
42987,
14635,
289,
17229,
773,
86,
52513,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
This week we wanted to introduce you a wonderful entrepreneur from Kurdistan, Hallo Sagrma, the co-founder of Indigo, an advertising and marketing company based in Suleimani. We were fortunate to get to learn about how he founded and grew Indigo and hear what advice Hallo has for young entrepreneurs in the region.
Q: What made you decide to launch a company in Sulaimani? How did your journey begin?
A: From an early age, I enjoyed the idea of having my own business but due to numerous factors, never quite made the jump. I started my working life at 15 and worked many jobs until the age of 27. I left a job at that time to take a short break to reconsider the direction I was heading in life. I knew that I needed a lot more say and control over my working life and discussed this with a like-minded friend. We spent much time together discussing what we could embark on together and as a result became business partners.
Our first venture was a small dessert shop in a mall. For me, this was the stepping-stone to bigger and greater things and the confidence and lessons gained were instrumental in our success today. Unfortunately, the shop didn't quite work out the way we had envisioned and so we agreed to call it a day and we were back thinking of other ideas.
It was at this point that my business partner, Heja, suggested that we set up a marketing company due to the emergence of new businesses and a booming economy in Kurdistan. Despite no experience in this field or in the running of a company such as this, I said yes.
Q: What makes Indigo different from other companies? What have you done to intentionally make it stand out vs what differed on its own?
A: What makes Indigo different from others is our thirst to innovate and our determination to take the lead in our field. We set a target at Indigo when we started to own a large market share of the advertising sector within 5 years and we actually achieved this in 3. We continue to thrive to become pioneers and lead the way in this industry and this is evident by the new billboards we have introduced to the city.
In addition, the style in which we work differs from most other companies. The working environment at Indigo encourages a strong team spirit by supporting and encouraging the creativity of our employees. Our employees know that they are valued as their suggestions and ideas are always welcome. This hub of positive creativity has resulted in our employees being incredibly enthusiastic, imaginative and loyal.
Q: How did you know that a new type of marketing (ie, guerrilla campaigns, bus stop advertisements, etc) would work in the context of the Kurdistan Region? How did you brainstorm these kinds of ideas?
A: To be honest, we did not know that such a business would work in Kurdistan. However, we believed it was worth the risk finding out. We were hungry to own something of our own rather than be a middle man. That is how the bus stops came into being. Heja and I sat down and brainstormed a number of ideas and spent many hours researching what would best fit in with Indigo's already established aims. Eventually, we decided to pursue the idea of bus stops.
With guerrilla advertising, we wanted to be able to provide an extra service that was not common and that would set us apart from others. For example, Indigo was the first company to place a car on the rooftop of a building in Suleimani as part of a very successful marketing campaign.
Q: What would you recommend other startups do to differentiate themselves from others in Kurdistan, like you have?
A: Fundamentally, I would have to say that when you make the decision to commit, you must wholeheartedly commit 110%. This tenacity will instantly set you apart from others. Furthermore, I would strongly recommend thoroughly researching the industry you plan to go into so that you are as prepared as possible. And of course, always offer the best service as quality is key.
Q: What is the best part about being an entrepreneur in Kurdistan? How did you take advantage of working in your specific environment?
The best part for me is the ability to make decisions that can have an impact on everyday life and businesses in this relatively new market. If I want to introduce new ideas and concepts to this region, I have the power and freedom to make it happen and the results are noticeable within a relatively short period of time. That gives me great satisfaction.
Q: What is the biggest challenge you faced in starting up your business, and what is the biggest challenge you face today? Do you have general or specific suggestions for how entrepreneurs should approach common challenges?
A: Cash flow! My biggest challenge to date is cash flow. The most challenging aspect of my role is ensuring that there is enough cash in the business at the end of each month. There are things I have identified throughout my career to improve on with regards to managing cash flow. Having a good relationship with suppliers is one of them as it is vital.
Furthermore, I would strongly advise anyone intending on setting up a business to look painstakingly at all the relevant legislation and regulations concerning your chosen industry so that you don't get hit with any nasty surprises in the future. The better equipped you are with regards to this knowledge, the better the decision making process will be.
Q: What strategies do you have to make your team more productive and creative?
It is really important to me to allow my team as much freedom as possible. I do this by creating a working environment whereby they feel confident to express themselves and are encouraged to contribute new ideas and concepts to help us grow as a company, together. I see Indigo as a family and within our family everyone is valued as they play an important role in our success.
Q: Are there any last things you would say to those reading this article, either in Kurdistan, or the rest of the world?
A: Ideas are plenty and an idea is essentially just an idea. It is the people behind the idea who cultivate it into something great. It is fundamental to have a great team around you and that you urge them to be as involved as possible. I believe this is why we have enjoyed working with such an honest, committed and talented group of individuals, both past and present, who have been united in championing our common goals and have subsequently enabled our success. | {
"redpajama_set_name": "RedPajamaC4"
} | 8,552 | [
128000,
2028,
2046,
584,
4934,
311,
19678,
499,
264,
11364,
29349,
505,
80044,
11,
20442,
385,
55361,
81,
1764,
11,
279,
1080,
36927,
315,
2314,
7992,
11,
459,
13172,
323,
8661,
2883,
3196,
304,
328,
1130,
318,
5676,
13,
1226,
1051,
40510,
311,
636,
311,
4048,
922,
1268,
568,
18538,
323,
14264,
2314,
7992,
323,
6865,
1148,
9650,
20442,
385,
706,
369,
3995,
35490,
304,
279,
5654,
627,
48,
25,
3639,
1903,
499,
10491,
311,
7195,
264,
2883,
304,
46962,
2706,
5676,
30,
2650,
1550,
701,
11879,
3240,
5380,
32,
25,
5659,
459,
4216,
4325,
11,
358,
14333,
279,
4623,
315,
3515,
856,
1866,
2626,
719,
4245,
311,
12387,
9547,
11,
2646,
5115,
1903,
279,
7940,
13,
358,
3940,
856,
3318,
2324,
520,
220,
868,
323,
6575,
1690
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
2028,
2046,
584,
4934,
311,
19678,
499,
264,
11364,
29349,
505,
80044,
11,
20442,
385,
55361,
81,
1764,
11,
279,
1080,
36927,
315,
2314,
7992,
11,
459,
13172,
323,
8661,
2883,
3196,
304,
328,
1130,
318,
5676,
13,
1226,
1051,
40510,
311,
636,
311,
4048,
922,
1268,
568,
18538,
323,
14264,
2314,
7992,
323,
6865,
1148,
9650,
20442,
385,
706,
369,
3995,
35490,
304,
279,
5654,
627,
48,
25,
3639,
1903,
499,
10491,
311,
7195,
264,
2883,
304,
46962,
2706,
5676,
30,
2650,
1550,
701,
11879,
3240,
5380,
32,
25,
5659,
459,
4216,
4325,
11,
358,
14333,
279,
4623,
315,
3515,
856,
1866,
2626,
719,
4245,
311,
12387,
9547,
11,
2646,
5115,
1903,
279,
7940,
13,
358,
3940,
856,
3318,
2324,
520,
220,
868,
323,
6575,
1690,
-100
] |
Genuine US Mint storage product.
Store your coins just as they arrive from the mint, in a genuine Royal Canadian Mint monster box. Securely stores 20, twenty-five coin tubes, or 500 coins.
Original packaging for the following RCM coins. | {
"redpajama_set_name": "RedPajamaC4"
} | 6,100 | [
128000,
38,
64312,
2326,
42410,
5942,
2027,
627,
6221,
701,
19289,
1120,
439,
814,
17782,
505,
279,
29437,
11,
304,
264,
22785,
16591,
12152,
42410,
18118,
3830,
13,
35602,
398,
10756,
220,
508,
11,
17510,
36399,
16652,
34083,
11,
477,
220,
2636,
19289,
627,
18902,
24066,
369,
279,
2768,
432,
10190,
19289,
13,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
] | [
38,
64312,
2326,
42410,
5942,
2027,
627,
6221,
701,
19289,
1120,
439,
814,
17782,
505,
279,
29437,
11,
304,
264,
22785,
16591,
12152,
42410,
18118,
3830,
13,
35602,
398,
10756,
220,
508,
11,
17510,
36399,
16652,
34083,
11,
477,
220,
2636,
19289,
627,
18902,
24066,
369,
279,
2768,
432,
10190,
19289,
13,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100
] |
The Recruit
by Addison Albright
Part of the The Faction series:
Editions:PDF: $ 3.99 USD
ePub: $ 3.99 USD
Kindle: $ 3.99 USD
ISBN: B07D6XFD2G
Albert Manlii has walked this earth for more than two thousand years, but survival on his own was never easy. Now he leads a faction of highly organized vampires who carefully guard the secret of their existence. Unlike the old days, potential recruits are carefully selected and presented with an offer.
Phillip Brewer has weeks to live—if he lets his disease run its course. He doesn't want to die, but given a choice, will his desire to live outweigh his concerns about the vampires' ethics?
When the new recruit's missteps are cause for concern, can Albert control the fallout, or will Phillip's life once again be torn apart?
Keywords: vampires, paranormal, death, considering suicide, blood-mates, fated mates
Publisher: JMS Books, LLC
Trace Edward Zaber
Written Ink Designs
Contemporary, Paranormal, Paranormal - Vampires
author - american, format - book, format - kindle, format - novella 15k-60K, format – kindle unlimited, potential trigger, potential trigger - suicide, what - condition - cancer, what - emotion - angst, what - emotion - hope, what - emotion - love, when - season - spring, where - country - usa, who - type - vampires
Character Identities: Click here to revealBisexual, Gay (Click here to hide)
Setting: Click here to revealUSA, Large Unnamed Metropolis (Click here to hide)
The man moved to the bench and raised a brow in a welcoming fashion, silently inviting Phillip to join him. Phillip shrugged. He'd planned to sit here anyway, so why not have a conversation with a pleasant man while he did it?
"My name's Albert." He held out a hand, and Phillip shook it. The hand felt cooler than Phillip expected for someone walking on a warm day, but not exceptionally so. Perhaps he had a fever himself, and that made the man's hand seem cooler than normal.
"Phillip." He didn't elaborate. There wasn't anything he could think of to add. Small talk eluded him.
"I'm pleased to meet you, Phillip." Albert paused, as if gathering his thoughts.
"Likewise." Phillip kept his reply simple. Oddly enough, something about the gravity of Albert's demeanor gave him the impression the man had directed him to the bench with a purpose in mind that had nothing to do with idle chit-chat, so he might as well let the man control the conversation. Albert didn't give off a crazed serial-killer vibe, not that it would matter at this point as long as whatever he chose to do didn't add pain to Phillip's death. Not likely he'd try anything like that in broad daylight with people around, anyway.
Albert looked directly into his eyes with a steady gaze. "Phillip, I want to show you something, and I ask that you keep an open mind and hear me out before reacting."
Phillip sat back. He hadn't developed any expectations for this conversation, but if he had, this direction wasn't anything he would have considered.
"I think we can help each other," Albert continued.
"I'm dying," Phillip said. He would have thought his appearance made that apparent, but perhaps not. "Whatever you have in mind, I'm sorry, but I won't be able to make a deal with you."
"Please, hear me out." Albert held out an arm. "This seems like an unusual request, I know, but I'd like you to examine my arm. Go ahead and touch it. I want you to assure yourself that it is, indeed, my real arm and not any kind of advanced prosthetic or makeup designed to create a special effect."
Phillips eyes widened. "Unusual request" was putting it lightly. But what the hell, he might as well add an interesting interlude to his final hours—or minutes, if this man turned out to be a homicidal maniac.
He put both hands on the well-shaped forearm. He felt for a pulse at the wrist and found one. The hairs appeared natural and moved appropriately as Phillip ran his hand across them. Veins were visible where expected. Phillip manipulated the man's fingers and wrist. The bones on the back of Albert's hand, and tendons at the inside of his wrist, moved correctly, becoming more or less prominent when the hand flexed. Then he lightly pinched Albert's skin in various places. It felt perfectly normal, although still slightly cooler than usual.
When Phillip withdrew his hands, Albert lowered his arm. "Are you satisfied that this is indeed my natural arm?"
"Yes." Phillip eyed him warily.
"Remember, keep an open mind and maintain your composure. Give me the opportunity to explain what you're about to see."
Weirder and weirder. Phillip narrowed his eyes but remained curiously drawn to hearing this man out. "All right."
Albert took a quick glance around, and Phillip followed his gaze. The people he'd noticed earlier were still in sight, but nobody new had appeared.
Phillip held his breath when a small razor blade appeared in Albert's other hand. Albert slowly drew the blade across the arm Phillip had just examined, cutting deeply enough for the tissue to separate. There was no way it was a fake blade merely drawing atop his skin. He was cutting deeply, but the blood that appeared was black, not red, and the gash closed up within seconds as the razor dragged up the length of that forearm.
"What the hell." Phillip gasped and fought to keep his respiration steady as he turned to stare at Albert's face. He'd been so riveted by what was happening to the man's arm, he'd neglected to check his expression. Had that hurt? Albert's face was tight, so maybe, although his mask of calm quickly returned.
"Do you trust your own eyes?" Albert asked. The razor disappeared into a pocket, replaced by a cloth handkerchief, which he used to wipe the remaining dark fluid—blood?—from his arm.
"I'll admit I'm drugged up, but nothing that would explain that." He'd pointedly requested medication that would not cause him to hallucinate or overly diminish his ability to reason. There was no point dragging out his life if he couldn't consciously enjoy it.
He'd seen plenty of street magic in his day. Sleight of hand, etcetera, but this transcended all of that. There was simply no logical explanation for what he'd just seen.
"You accept what you just witnessed at face value?"
Phillip pursed his lips a moment before replying. "Okay. Yes. Obviously, there's something superhuman about you." Or he wasn't human at all. An alien maybe?
"That's one way to put it," Albert said. "I was once fully human, but now…no, not quite human anymore."
Phillip sat still as he digested that comment. Albert had "once" been human. He'd also approached Phillip—seemingly sought him out—and he'd said, "I think we can help each other." Was there more than one logical deduction to make here?
"Please." Phillip swallowed as a shiver of hope drifted over his skin. "I need you to spell out what you meant—earlier. Before your demonstration."
Albert smiled. It was the smile of a man who sensed he had his fish on the hook. "About helping each other?"
Phillip nodded.
"You don't need to die yet. I've been walking this earth for more than two thousand years." Albert spoke calmly as Phillip froze in place, clenching his hands at his belly.
Two thousand years? And he wanted to make a deal with Phillip?
Did Phillip want to? What was in it for him? Everlasting life, apparently. But would it be an existence he wanted? "Who are you? You're immortal. But how?"
"Immortal in the sense that I, and others like me, won't appear to become older beyond our age at the time of transition. Nor will we die of natural causes. We can be killed, though. You've witnessed my self-healing abilities, but anything that would instantly kill a human will kill me…us, too."
"So, if I agreed, this cancer would disappear just like that?" Phillip snapped his fingers.
"Like all of our 'supernatural' capabilities, self-healing improves over time. As a new convert, you won't immediately feel better. It'll take about a day for you to feel one hundred percent."
That was hardly a deterrent, but Albert was obviously holding back. What facilitated this "transition"? "You still haven't answered the question. Who are your people?"
Albert hesitated for a moment before replying. "The word you're searching for is 'vampire.'"
Phillip burst out laughing. He didn't know what the hell he'd been thinking Albert's answer would be, but the existence of some kind of magical immortality potion was difficult enough to believe without throwing in something that absurd.
Albert's revelation probably should have made Phillip run in the opposite direction—if he'd believed it, or made him angry—because really, what kind of person fucked with a dying man like that? But at least his final hours were diverting. "You had me going there for a while."
Tilting his head to the side, Albert raised a single eyebrow as he continued to gaze at Phillip. "Not the usual reaction. Intriguing, though. You don't believe me, do you?"
"Please," Phillip scoffed and gestured toward the bright sun overhead.
Reviews:ButtonsMom2003 on Xtreme Delusions wrote:
Excerpt from the review:
"I found The Recruit to be different and interesting and I thoroughly enjoyed it."
Anne Barwell on Drops of Ink wrote:
Excerpts from the review:
"The world building in this story is very detailed and well thought out. I loved how the author took the vampire mythos and gave it a unique spin, yet addressed that mythology with feasible explanations rather than dismissing it as 'just a myth.'
"The chapters are interesting, and I liked the hints of Albert's history during his long life through dialogue with his friends rather than a big info dump."
"The Recruit is an enjoyable story, and I hope we haven't seen the last of this world as I'd love to read more about it."
Dixiecowgirl060 on Amazon wrote:
"Romantic, hopeful, creative with incredible world-building. I really enjoyed reading it!"
"I loved the detail and the logic that was the basis for this world-building. The writing is great and the story-line flowed nicely. This is an awesome first book and there is a sequel 'The Choice' that you will want to plan on reading also."
Babs on Amazon wrote:
"This is a strong story about vampires and written so that it is different than those I have read before."
"This book was short with angst and love thrown in."
Kirsty on Joyfully Jay wrote:
"Albright does not allow her imagination to be confined by tropes in The Recruit and it is a enjoyable story that I would recommend."
Patricia on Amazon wrote:
"The author has taken the same old staid vampire mythos/legend/trope/whatever and turned it inside out, upside down, put it through a complete overhaul, and then wove it back together into a fresh, new, original, fantastic, fascinating and definitely different tale. I was completely hooked from cover to cover."
If you like The Recruit, you might be interested in:
Season to Shimmer
Addison Albright is a writer living in the middle of the USA. Her stories are gay romance in contemporary, fantasy, and paranormal genres. She generally adds a subtle touch of humor, a smidgen of drama/angst, and a healthy dose of slice-of-life to her stories. Her education includes a BS in Education with a major in mathematics and a minor in chemistry. Addison loves spending time with her family, reading, popcorn, boating, french fries, "open window weather," cats, math, and anything chocolate. She loves to read pretty much anything and everything, anytime and anywhere.
Addison is the author of…
– Cultivating Love
– Vows 1 – 'Til Death Do Us Part
– Vows 2 – From This Day Forward
– Vows 2.5 Okay, Then
– Vows 3 – To Love and To Cherish
– Snapshots, a collection of short stories
– Dream On 1 - Closets Are for Clothes
– Plans 1 - The Contingency Plan
– Plans 2 - The Best-Laid Plans
– The Faction 1 - The Recruit
– The Faction 2 - The Choice
– Déjà Vu
– Of Rats and Cats
– Weekend at Bigfoot's
'Til Death Do Us Part was a runner up in the 2016 Rainbow Awards in both the "Best Gay Contemporary Romance" and "Best Gay Book" categories!
To Love and To Cherish received two honorable mentions in the 2017 Rainbow Awards!
The entire Vows Series, including the bonus short story Okay, Then, is now available in a box set. | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 3,381 | [
128000,
791,
4158,
21702,
198,
1729,
100094,
32672,
1315,
198,
5920,
315,
279,
578,
91407,
4101,
512,
89956,
82,
25,
24317,
25,
400,
220,
18,
13,
1484,
20121,
198,
68,
30262,
25,
400,
220,
18,
13,
1484,
20121,
198,
10854,
273,
25,
400,
220,
18,
13,
1484,
20121,
198,
46285,
25,
426,
2589,
35,
21,
55,
14938,
17,
38,
198,
67722,
2418,
747,
72,
706,
15203,
420,
9578,
369,
810,
1109,
1403,
16579,
1667,
11,
719,
20237,
389,
813,
1866,
574,
2646,
4228,
13,
4800,
568,
11767,
264,
37480,
315,
7701,
17057,
78290,
889,
15884,
7771,
279,
6367,
315,
872,
14209,
13,
27140,
279,
2362,
2919,
11,
4754,
56197,
527,
15884,
4183,
323,
10666,
449,
459,
3085,
627,
92777,
575,
84067,
706,
5672,
311,
3974,
90863,
568,
15714
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
791,
4158,
21702,
198,
1729,
100094,
32672,
1315,
198,
5920,
315,
279,
578,
91407,
4101,
512,
89956,
82,
25,
24317,
25,
400,
220,
18,
13,
1484,
20121,
198,
68,
30262,
25,
400,
220,
18,
13,
1484,
20121,
198,
10854,
273,
25,
400,
220,
18,
13,
1484,
20121,
198,
46285,
25,
426,
2589,
35,
21,
55,
14938,
17,
38,
198,
67722,
2418,
747,
72,
706,
15203,
420,
9578,
369,
810,
1109,
1403,
16579,
1667,
11,
719,
20237,
389,
813,
1866,
574,
2646,
4228,
13,
4800,
568,
11767,
264,
37480,
315,
7701,
17057,
78290,
889,
15884,
7771,
279,
6367,
315,
872,
14209,
13,
27140,
279,
2362,
2919,
11,
4754,
56197,
527,
15884,
4183,
323,
10666,
449,
459,
3085,
627,
92777,
575,
84067,
706,
5672,
311,
3974,
90863,
568,
15714,
-100
] |
Waste > Press Releases
Indore ranks first in waste segregation amongst cities with population over 1 million
Indore conferred the Four Leaves Award at CSE's Convention on Urban Solid Waste Management held in New Delhi while Bhopal receives the Three Leaves Award
The Municipal Corporation of Indore joins hands with 4 NGOs for segregation at source and 2 for plastic waste management
An integrated waste management facility is under construction in Bhopal - spread over an area of 65 acres
Balaghat, a small city with a population below 0.1 million has 50 per cent segregation at source
New Delhi, June 7, 2018: "Sweeping cities is only a small part of the solution to the problem of keeping our cities clean – what is more important is sustainable treatment, recycle and reuse of the waste that they generate," said Chandra Bhushan, deputy director general, Centre for Science and Environment (CSE), while announcing the awards for most efficient management and segregation of waste by Indian cities which are members of the Forum of Cities that Segregate.
CSE has been working with cities to promote and implement source-segregation and decentralized model of waste management. To scale up its impact, CSE had launched the 'Forum of Cities that Segregate' on December12, 2017. The Forum now has 26 members – from Madhya Pradesh, Indore, Bhopal and Balaghat feature in the list.
CSE released here today the 2017-18 assessment report of the performance of 20 of these 26 Forum cities. Based on the findings of the assessment report, the best performers were selected and the Leaves Awards conferred on them.
The cities were assessed based on their performance in the six months since the Forum was launched. The parameters included segregation at source, collection, transportation, wet waste and dry waste processing, adoption of decentralised systems, the inclusion of informal sector in municipal systems and adoption and enforcement of SWM bye-laws and enforcement of Plastic Waste Management Rules, 2016.
The Madhya Pradesh report card
All households, commercial establishments and bulk generators practice source segregation in Indore. The city scored a perfect ten for a highly robust collection and transportation system.
Sarthak and Basix are the 2 NGOs that the city of Indore has collaborated with– this has further integrated the informal sector to sort waste.
While the plastic waste is sold to be recycled; non-recyclable waste is sent to a cement plant at Neemuch and to the M.P. Rural Road Development Corporation to be used in the construction of roads.
Bhopal receives the Three Leaves Award in the CSE assessment – is segregating 45-50 percent of its waste at source
The city has 5 decentralized composting units, each with a capacity of 5 tonnes per day (tpd). The Bhopal Municipal Corporation (BMC) has installed a biogas plant in one of its vegetable markets.
Huge concerns over the Bhanpura dumpsite – construction of an integrated waste management facility underway in the Adampur Chavani area of the city – to be spread over 65 acres – the facility will have a waste to energy plant, compost plant, Refuse Derived Fuel Centre, sanitary landfill and leachate treatment plant.
Balaghat, a small city with a population below 0.1 million has 50 per cent segregation at source. The city has also started to push all the commercial areas to segregate. City authorities have transformed the Nagar Palika dumpsite into a material recovery facility; 21 tonnes of wet waste is composted through aerobic composting technology.
Although Indore has adopted bye-laws as per the Solid Waste Management Rules, 2016, its enforcement is lax. As far as the Plastic Waste Management Rules, 2016 is concerned, both Bhopal and Indore are yet to enforce them.
For more details and to access CSE's resources on waste management, please contact Parul Tewari of The CSE Media Resource Centre, [email protected] / 9891838367.
Tags: Solid Waste,
CSE releases its rating of selected cities which manage and segregate their municipal waste most efficiently
Alappuzha and Thiruvananthapuram offer models of decentralized waste management systems
Mysuru champions waste segregation, Bengaluru struggles to keep up
Vengurla and Panchgani from Maharashtra bag top spots in the CSE ratings on cleanliness | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 6,435 | [
128000,
54,
5642,
871,
8612,
62115,
198,
1451,
461,
21467,
1176,
304,
12571,
64244,
24059,
9919,
449,
7187,
927,
220,
16,
3610,
198,
1451,
461,
91670,
279,
13625,
78614,
17768,
520,
356,
937,
596,
26958,
389,
29422,
22925,
49522,
9744,
5762,
304,
1561,
22767,
1418,
426,
26172,
278,
21879,
279,
14853,
78614,
17768,
198,
791,
45340,
13332,
315,
2314,
461,
29782,
6206,
449,
220,
19,
72614,
369,
64244,
520,
2592,
323,
220,
17,
369,
12466,
12571,
6373,
198,
2127,
18751,
12571,
6373,
12764,
374,
1234,
8246,
304,
426,
26172,
278,
482,
9041,
927,
459,
3158,
315,
220,
2397,
27464,
198,
38989,
351,
9379,
11,
264,
2678,
3363,
449,
264,
7187,
3770,
220,
15,
13,
16,
3610,
706,
220,
1135,
824,
2960,
64244,
520,
2592,
198,
3648,
22767,
11
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
54,
5642,
871,
8612,
62115,
198,
1451,
461,
21467,
1176,
304,
12571,
64244,
24059,
9919,
449,
7187,
927,
220,
16,
3610,
198,
1451,
461,
91670,
279,
13625,
78614,
17768,
520,
356,
937,
596,
26958,
389,
29422,
22925,
49522,
9744,
5762,
304,
1561,
22767,
1418,
426,
26172,
278,
21879,
279,
14853,
78614,
17768,
198,
791,
45340,
13332,
315,
2314,
461,
29782,
6206,
449,
220,
19,
72614,
369,
64244,
520,
2592,
323,
220,
17,
369,
12466,
12571,
6373,
198,
2127,
18751,
12571,
6373,
12764,
374,
1234,
8246,
304,
426,
26172,
278,
482,
9041,
927,
459,
3158,
315,
220,
2397,
27464,
198,
38989,
351,
9379,
11,
264,
2678,
3363,
449,
264,
7187,
3770,
220,
15,
13,
16,
3610,
706,
220,
1135,
824,
2960,
64244,
520,
2592,
198,
3648,
22767,
11,
-100
] |
Tag: criminal
Chopper (2000)
film 6 days ago
Storyline:Chopper tells the intense story of Mark "Chopper" Read, a legendary criminal who wrote his autobiography while serving a murder sentence in prison. His book, From the Inside, upon which the film is based, wa...
Hellsinki (2009)
film 1 week ago
Storyline:Professional criminals in Finland from 1966 to 1979.User Reviews: Every country has its mainstream and underground filmmakers; in Finland the most well-known and popular modern director of all might be Aleks...
Sathuran (2015)
film 1 month ago
Storyline:An auto rickshaw driver finds himself embroiled in a criminal case involving medical malpractice.User Reviews: This is one of such movies which should have received a far better reception at the box office. ...
Saamy Square (2018)
Storyline:The son of Aarusaamy becomes a cop and takes on the criminal who murdered his parents.User Reviews: I expect more.. Vikram and bobi simha's acting is good Songs are waste
Twist of Fate (1954)
Storyline:Johnny Victor's in love with an international businessman, Louis Galt, who is actually the head of a syndicate which mints illegal coins for the Continental market. But she soon learns that Galt has been dec...
Trimurti (1995)
Storyline:Entrapped by notorious gangster, Khokha Singh; an honest police inspector Satyadevi Singh gets a life sentence in jail. She hopes to get her three sons, Shakti, Anand and Romi to avenge this carnage but the ...
To Love, Honor and Deceive (TV Movie 1996)
Storyline:Sydney Carpenter was happy as a housewife devoted to her husband Matthew and their little boy Adam, till they both die in a boat accident. Shortly after she's irritated when local PD Det. Jim Sanders tells h...
The Blossoming of Maximo Oliveros (2005)
Storyline:Can a 12-year old lad who wishes he were a girl navigate the mean streets of Manila? Maxi cooks, cleans, and sews for his father and older brothers who are petty criminals. He's sweet, clever and hardworking...
The Quick and Dirty (2019)
Storyline:In the deep south of the 1970's, a career criminal is lured into taking a job that might be his undoing.User Reviews:
Jannat 2 (2012)
Storyline:Jannat 2 revolves around a smuggler Sonu Delhi KKC who deals in illegal guns. ACP Pratap Raghuvanshi is a sincere police officer who has taken the oath to demolish the illegal guns business. The entire movie...
Snow Trail (1947)
film 2 months ago
Storyline:Three bank robbers, Eijima, Nojiri, and Takasugi, flee the police and escape into the mountains. At an inn high in the Japanese Alps, Eijima and Nojiri encounter a young woman and her father, as well as Hond...
Voice of Silence (2020)
Storyline:Two men work for a criminal organization to clean up the after-math messes. One day, they receive an unexpected order.User Reviews:
Storyline:Brothers Kade and Ben Jaeger have always lived in the shadow of their late father's criminal empire, but their differences put them on a bloody collision course, and neither will stop until the other is dead...
Super Bear (2019)
Storyline:Father bear lives in the wilderness with his son Xi Ha, but when the young cub is captured by a human criminal and sold in the black market. Father Bear ventures into the big city to search for him. In order...
A Werewolf in England (2020)
Storyline:In Victorian-era England, a Parish Councillor and criminal take refuge from a storm, at a remote countryside Inn, and soon uncover a deadly pact between the deranged Innkeepers and the flesh-hungry werewolve...
Afyon oppio (1972)
Storyline:An American underworld up-and-comer relocates to Europe and immerses himself in the dangerous and mysterious world of heroin production.User Reviews: Ben plays a small time hood who goes to Turkey then to It...
Nothing to Declare (TV Series 2004– )
Storyline:This program takes viewers behind the scenes of Australia's Customs, Immigration and Quarantine departments. The people that work for these departments have been entrusted with protecting Australia's borders...
Thieves Like Us (1974)
Storyline:Two convicts break out of Mississippi State Penitentiary in 1936 to join a third on a long spree of bank robbing, their special talent and claim to fame. The youngest of the three falls in love along the way...
Point Break (2015)
Storyline:A young FBI agent infiltrates an extraordinary team of extreme sports athletes he suspects of masterminding a string of unprecedented, sophisticated corporate heists. Deep undercover, and with his life in da...
Cow Belles (TV Movie 2006)
Storyline:Spoiled rich sisters, Taylor and Courtney Callum, have had it made. Their father owns a successful dairy that allows them to live comfortably. They can have anything they want: the latest designer clothes, c...
Played (2006)
Storyline:An examination of the malevolent London underworld with its despicable criminal underground. Ray (Mick Rossi) just finished an eight-year prison sentence after getting set up. Now he is back on the streets t...
The Last Days of Frankie the Fly (1996)
Storyline:Frankie is an unrespected little man, who works for mob bosses Sal and Vic. He meets Margaret, who is an ex-porn actress and plans to become a serious one, falls in love with her and tries to save her from S...
King Creole (1958)
Storyline:Having flunked graduation for a second time and needing cash to support his crabby (and thus unemployed) father, Danny Fisher takes a job as a singer in the King Creole nightclub - about the only joint aroun...
Hwayi: A Monster Boy (2013)
Storyline:Hwayi is a boy living in a farm village, who was raised by 5 fathers who were famous criminals. One day, the group is commissioned to kill a man named Lim and his wife. While the rest of the group feel somet...
[email protected] 2 hours ago | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 2,165 | [
128000,
5786,
25,
9337,
198,
1163,
18994,
320,
1049,
15,
340,
31255,
197,
220,
21,
2919,
4227,
198,
18422,
1074,
25,
1163,
18994,
10975,
279,
19428,
3446,
315,
4488,
330,
1163,
18994,
1,
4557,
11,
264,
28812,
9337,
889,
6267,
813,
91537,
1418,
13788,
264,
10102,
11914,
304,
9527,
13,
5414,
2363,
11,
5659,
279,
28468,
11,
5304,
902,
279,
4632,
374,
3196,
11,
10667,
9522,
39,
6572,
50509,
320,
1049,
24,
340,
31255,
197,
220,
16,
2046,
4227,
198,
18422,
1074,
25,
58613,
32638,
304,
37355,
505,
220,
5162,
21,
311,
220,
4468,
24,
7494,
19832,
25,
7357,
3224,
706,
1202,
21391,
323,
26326,
63203,
26,
304,
37355,
279,
1455,
1664,
22015,
323,
5526,
6617,
7690,
315,
682,
2643,
387,
90678,
9522,
50,
589,
27105,
320,
679
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
5786,
25,
9337,
198,
1163,
18994,
320,
1049,
15,
340,
31255,
197,
220,
21,
2919,
4227,
198,
18422,
1074,
25,
1163,
18994,
10975,
279,
19428,
3446,
315,
4488,
330,
1163,
18994,
1,
4557,
11,
264,
28812,
9337,
889,
6267,
813,
91537,
1418,
13788,
264,
10102,
11914,
304,
9527,
13,
5414,
2363,
11,
5659,
279,
28468,
11,
5304,
902,
279,
4632,
374,
3196,
11,
10667,
9522,
39,
6572,
50509,
320,
1049,
24,
340,
31255,
197,
220,
16,
2046,
4227,
198,
18422,
1074,
25,
58613,
32638,
304,
37355,
505,
220,
5162,
21,
311,
220,
4468,
24,
7494,
19832,
25,
7357,
3224,
706,
1202,
21391,
323,
26326,
63203,
26,
304,
37355,
279,
1455,
1664,
22015,
323,
5526,
6617,
7690,
315,
682,
2643,
387,
90678,
9522,
50,
589,
27105,
320,
679,
-100
] |
The Oaklander brings luxury hotel option to Oakland
Oakland's newest hotel, The Oaklander, opened on Thursday, Feb. 28.
Hannah Heisler | Staff Photographer
By Maggie Young, Staff Writer
Oakland residents and visitors can now stay at a luxe hotel or dine at its restaurant — both after taking the elevator to the 10th floor.
Oakland's newest hotel, The Oaklander, opened last Thursday, and its lobby and restaurant, Spirits and Tales, are located on the 10th floor. The hotel includes 167 guest rooms and five event spaces in addition to the restaurant.
A night at The Oaklander costs $200 for either a single king-sized bed or two queen beds. Corner rooms cost $289 per night for either a single king or two queens. According to Jackie Gillespie, the hotel's director of sales, the lobby and restaurant are on the 10th floor to give all of the hotel's visitors access to a view of the neighborhood's popular sights, such as the Cathedral of Learning and Schenley Park.
"The space is on the 10th floor because I think it would've been tragic to have this location and not bring these views of Oakland to everyone," Gillespie said. "Everything [in Oakland] is kind of elevated, so it made sense to have an elevated lobby and an elevated restaurant space, and our event space is also up here on 10. So this way, everyone gets to enjoy the best views rather than there just being 10th floor guest rooms and a penthouse."
Gillespie said this feature of the hotel may make it sound somewhat elitist, but she thinks The Oaklander avoids that. Spirits and Tales is open to guests and non-guests alike.
"We're a luxurious hotel without being stuffy, we're very approachable. It's elevated, it's luxe without the stuffy luxury that you kind of think of sometimes with the boutique hotels," Gillespie said.
The hotel is part of Marriott's Autograph collection. Currently consisting of 106 hotels, the collection designs no two buildings the same, Gillespie said. This collection offers boutique locations, meaning something smaller but more upscale than a normal full-service hotel.
According to Rabikar Chatterjee, associate dean of the Katz School of Business, Oakland is in need of a hotel like this. The presence of boutique hotels like this are increasing, including places like Mansions on Fifth in Shadyside and Kimpton Hotel Monaco Downtown.
"Oakland — and in particular, Pitt and CMU — definitely needs a high quality hotel that promises to provide a more upscale experience for guests than do existing facilities in the neighborhood. Both universities have missed the presence of a luxury hotel for their important visitors," Chatterjee said in an email.
While this is something new for the Oakland community, Chaterjee said he doesn't see the presence of a luxurious hotel having a negative impact on long-term Oakland residents.
"I see the impact of the hotel on long-term Oakland residents as relatively minor but positive," Chaterjee said in an email. "The hotel alone will not contribute to an influx of an affluent population to Oakland leading to 'gentrification' — a dynamic that is often of justifiable concern to long-term residents of a community because of its impact [on] housing prices and the cost of living."
The Oaklander reflects the neighborhood's personality in terms of its design, according to Ami Kahalekulu, the hotel's interior designer. The lobby is black and white with gold finishings, and Spirits and Tales is also black and white with blue and orange undertones. The Oaklander's style is inspired by the culture and industrious history of the Oakland community, Kahalekulu said.
"Oakland has a strong pulse and energy tempered with a historic foundation. We wanted to tap into this feeling of 'a forward-thinking institution yet someplace comfortable.' The goal has been to create a timeless space, that doesn't speak to a time period or theme or fad but, rather, the strength and integrity that is Pittsburgh," Kahalekulu said in a press release.
Gillespie said the company was driven to put a boutique hotel in Oakland due to its traction from the active medical and academic communities located in the neighborhood.
"Somebody who's looking for more of an upscale hotel experience or boutique experience, rather than having to go Downtown to one of the more high-end hotels down there, now they can stay right here in Oakland," Gillespie said.
Chatterjee said Oakland is its own kind of destination. Although people may have previously been traveling Downtown for this kind of hotel experience, visitors should want to stay in Oakland because of all the community has to offer, like the universities and museums.
"I believe [The Oaklander] will be great in terms of raising [Oakland's] visibility, stimulating the local economy and generating new business opportunities," Chaterjee said in an email. "In addition, I hope that its presence will prompt other hotels in Oakland to raise their game. Certainly, Pitt will benefit significantly from its presence."
Emily Smith, a senior psychology major, works full-time at The Oaklander as a front desk agent while also being a part-time student at Pitt. Smith said she has enjoyed working at the hotel, and the luxury The Oaklander is giving to the neighborhood is helping transform the community into something more modern and professional.
"I think Oakland is turning a corner," Smith said. "It's like a new Oakland is coming, because there's just so much new things happening. I think something high-end like this is a good start to that change. We're bringing in business professionals, doctors. It's just giving a new classier vibe to Oakland."
Tags: Jackie Gillespie, oaklander, rabiker chatterjee
Maggie Young, Senior Staff Writer
2. Featured
Student, Pitt leaders to meet to strengthen student code of conduct
Gillibrand discusses health care, labor rights in Oakland
Board committee approves budget, tuition hikes
Walk for Love celebrates late Pitt student
Police seeking public's help in Oakland investigation
Provost, dean of students respond to letter calling for student expulsion
Pitt police issue crime alert after burglary, attempted sexual assault
Skyvue residents return after month-long displacement
Pitt professors offer advice to first-year students
Pitt student said he sent racist and threatening messages | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 7,874 | [
128000,
791,
30781,
261,
12716,
19913,
9689,
3072,
311,
30781,
198,
86939,
1974,
596,
24519,
9689,
11,
578,
30781,
261,
11,
9107,
389,
7950,
11,
13806,
13,
220,
1591,
627,
39,
44104,
1283,
285,
1565,
765,
17381,
75839,
198,
1383,
62795,
13566,
11,
17381,
30504,
198,
86939,
1974,
11062,
323,
15613,
649,
1457,
4822,
520,
264,
97200,
9689,
477,
66207,
520,
1202,
10960,
2001,
2225,
1306,
4737,
279,
39736,
311,
279,
220,
605,
339,
6558,
627,
86939,
1974,
596,
24519,
9689,
11,
578,
30781,
261,
11,
9107,
1566,
7950,
11,
323,
1202,
19865,
323,
10960,
11,
82877,
323,
54955,
11,
527,
7559,
389,
279,
220,
605,
339,
6558,
13,
578,
9689,
5764,
220,
11515,
8810,
12295,
323,
4330,
1567,
12908,
304,
5369,
311,
279,
10960,
627,
32,
3814
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
791,
30781,
261,
12716,
19913,
9689,
3072,
311,
30781,
198,
86939,
1974,
596,
24519,
9689,
11,
578,
30781,
261,
11,
9107,
389,
7950,
11,
13806,
13,
220,
1591,
627,
39,
44104,
1283,
285,
1565,
765,
17381,
75839,
198,
1383,
62795,
13566,
11,
17381,
30504,
198,
86939,
1974,
11062,
323,
15613,
649,
1457,
4822,
520,
264,
97200,
9689,
477,
66207,
520,
1202,
10960,
2001,
2225,
1306,
4737,
279,
39736,
311,
279,
220,
605,
339,
6558,
627,
86939,
1974,
596,
24519,
9689,
11,
578,
30781,
261,
11,
9107,
1566,
7950,
11,
323,
1202,
19865,
323,
10960,
11,
82877,
323,
54955,
11,
527,
7559,
389,
279,
220,
605,
339,
6558,
13,
578,
9689,
5764,
220,
11515,
8810,
12295,
323,
4330,
1567,
12908,
304,
5369,
311,
279,
10960,
627,
32,
3814,
-100
] |
Now it's done : Keep on Running Dixie's Blue Note is officially, till the 1st january of this year a retired whippet. She finally ran her last coursing at Laferté sur Amance, in Champagne Ardenne (or perhaps should I say Great Est, or Right of Frane or whatever stupid name this region lately was given 😀 ). There should have been one CACIL for the males and one for the females, but due to several withdrawals, it was a mixte CACIL of 11 whippets. So Dixie did it with class ! In the morning she ran against a female and in the afternoon against a heavily built male. But nothing can hamper Dixie when she's "in the mood". So to crown her career for her last coursing, she won the RCACIL (the CACIL being won by Harry du Maoucha) and the CACP. Honey did not sit in the sidelines and was 3rd with the RCACP. As for Gwendolyn, sadly, she hurted herself during the first round (toe dislocation), though finish her race with the second best tally for the whippets (the best being Dixie's). | {
"redpajama_set_name": "RedPajamaC4"
} | 3,577 | [
128000,
7184,
433,
596,
2884,
551,
13969,
389,
29125,
76243,
648,
596,
8868,
7181,
374,
19073,
11,
12222,
279,
220,
16,
267,
33962,
3620,
315,
420,
1060,
264,
22311,
421,
22309,
13,
3005,
5616,
10837,
1077,
1566,
45369,
287,
520,
61944,
531,
978,
1765,
3383,
685,
11,
304,
88639,
1676,
5294,
818,
320,
269,
8530,
1288,
358,
2019,
8681,
9589,
11,
477,
10291,
315,
2939,
2194,
477,
8996,
18754,
836,
420,
5654,
31445,
574,
2728,
91416,
7609,
2684,
1288,
617,
1027,
832,
356,
1741,
1750,
369,
279,
25000,
323,
832,
369,
279,
28585,
11,
719,
4245,
311,
3892,
86304,
11,
433,
574,
264,
6651,
668,
356,
1741,
1750,
315,
220,
806,
421,
43970,
13,
2100,
76243,
648,
1550,
433,
449,
538,
758,
763,
279,
6693,
1364,
10837,
2403
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
7184,
433,
596,
2884,
551,
13969,
389,
29125,
76243,
648,
596,
8868,
7181,
374,
19073,
11,
12222,
279,
220,
16,
267,
33962,
3620,
315,
420,
1060,
264,
22311,
421,
22309,
13,
3005,
5616,
10837,
1077,
1566,
45369,
287,
520,
61944,
531,
978,
1765,
3383,
685,
11,
304,
88639,
1676,
5294,
818,
320,
269,
8530,
1288,
358,
2019,
8681,
9589,
11,
477,
10291,
315,
2939,
2194,
477,
8996,
18754,
836,
420,
5654,
31445,
574,
2728,
91416,
7609,
2684,
1288,
617,
1027,
832,
356,
1741,
1750,
369,
279,
25000,
323,
832,
369,
279,
28585,
11,
719,
4245,
311,
3892,
86304,
11,
433,
574,
264,
6651,
668,
356,
1741,
1750,
315,
220,
806,
421,
43970,
13,
2100,
76243,
648,
1550,
433,
449,
538,
758,
763,
279,
6693,
1364,
10837,
2403,
-100
] |
O Vicariato Apostólico (ou Vigariato Apostólico) é uma circunscrição eclesiástica (forania) equiparada a uma igreja particular ou uma prefeitura, governada, em nome do Papa, por um Vigário apostólico, por se tratar de uma diocese ainda em formação. Vinculada à Congregação para a Evangelização dos Povos, é governado, em geral, por um Bispo-titular.
Encontra-se regulamentada pelo cânon 371.1:
América do Norte
Na América do Norte, existe apenas 1 Vicariato Apostólico.
Saint-Pierre e Miquelon
Vicariato Apostólico de Saint-Pierre e Miquelon
América Central
Na América Central, existem 4 Vicariatos Apostólicos, repartidos em três países.
Vicariato Apostólico de El Petén
Vicariato Apostólico de Izabal
Vicariato Apostólico de Blufields
Vicariato Apostólico de Darién
América do Sul
Na América do Sul, existem 38 Vicariatos Apostólicos, repartidos em 7 países:
Vicariato Apostólico de Camiri
Vicariato Apostólico de El Beni
Vicariato Apostólico de Ñuflo de Chávez
Vicariato Apostólico de Pando
Vicariato Apostólico de Reyes
Vicariato Apostólico de Aysén
Vicariato Apostólico de Guapi
Vicariato Apostólico de Inírida
Vicariato Apostólico de Leticia
Vicariato Apostólico de Mitú
Vicariato Apostólico de Puerto Carreño
Vicariato Apostólico de Puerto Gaitán
Vicariato Apostólico de San Andrés y Providencia
Vicariato Apostólico de San Vicente - Puerto Leguízamo
Vicariato Apostólico de Tierradentro
Vicariato Apostólico de Trinidad
Vicariato Apostólico de Aguarico
Vicariato Apostólico de Esmeraldas
Vicariato Apostólico de Galápagos
Vicariato Apostólico de Méndez
Vicariato Apostólico de Napo
Vicariato Apostólico de Puyo
Vicariato Apostólico de San Miguel de Sucumbíos
Vicariato Apostólico de Zamora
Vicariato Apostólico del Chaco Paraguayo
Vicariato Apostólico del Pilcomayo
Vicariato Apostólico de Iquitos
Vicariato Apostólico de Jaén no Peru
Vicariato Apostólico de Pucallpa
Vicariato Apostólico de Puerto Maldonado
Vicariato Apostólico de Requena
Vicariato Apostólico de San José del Amazonas
Vicariato Apostólico de San Ramón
Vicariato Apostólico de Yurimaguas
Vicariato Apostólico de Caroní
Vicariato Apostólico de Machiques
Vicariato Apostólico de Puerto Ayacucho
Vicariato Apostólico de Tucupita
Ásia
, , e
Vicariato Apostólico da Arábia Setentrional
Vicariato Apostólico de Brunei
Vicariato Apostólico de Phnom-Penh
, Iêmen, e Somalilândia
Vicariato Apostólico da Arábia Meridional
Vicariato Apostólico de Bontoc-Lagawe
Vicariato Apostólico de Calapão
Vicariato Apostólico de Jolo
Vicariato Apostólico de Porto Princesa
Vicariato Apostólico de São José de Mindoro
Vicariato Apostólico de Tabuk
Vicariato Apostólico de Taytay
Vicariato Apostólico de Luang Prabang
Vicariato Apostólico de Pakxe
Vicariato Apostólico de Savannakhet
Vicariato Apostólico de Vientiane
Vicariato Apostólico de Beirute
Vicariato Apostólico do Nepal
Vicariato Apostólico de Alepo
Vicariato Apostólico da Anatolia
Vicariato Apostólico de Istambul
África
Vicariato Apostólico de Ingwavuma
Botsuana
Vicariato Apostólico de Francistown, sufragâneo da Arquidiocese de Pretória (África do Sul)
Vicariato Apostólico de Alexandria do Egito, no Egito.
Vicariato Apostólico de Awasa
Vicariato Apostólico de Harari
Vicariato Apostólico de Meki
Vicariato Apostólico de Nekemte
Vicariato Apostólico de Sodo-Hosanna
Vicariato Apostólico de Derna
Vicariato Apostólico de Trípoli
Maurício
Vicariato Apostólico de Rodrigues
Vicariato Apostólico de Rundu, sufragâneo da Arquidiocese de Windhoek
Vicariato Apostólico de Bomadi
Vicariato Apostólico de Kontagora
Vicariato Apostólico de Isiolo
Europa
Vicariato Apostólico de Tessalônica
Fontes
Glossário no site da Diocese de Santos
Catolicanet
Lista de Vicariatos Apostólicos Atuais por Giga-Catholic Information | {
"redpajama_set_name": "RedPajamaWikipedia"
} | 9,020 | [
128000,
46,
44847,
2850,
4428,
47859,
1832,
37111,
320,
283,
58201,
2850,
4428,
47859,
1832,
37111,
8,
4046,
10832,
4319,
11099,
745,
6027,
12208,
76995,
56503,
3074,
320,
2000,
9345,
8,
26458,
277,
2649,
264,
10832,
19935,
265,
5697,
4040,
6033,
10832,
864,
62221,
5808,
11,
2633,
2649,
11,
991,
17567,
656,
65673,
11,
4247,
4543,
58201,
20358,
39571,
1832,
37111,
11,
4247,
513,
490,
6526,
409,
10832,
1891,
58744,
45009,
991,
1376,
13264,
13,
650,
2910,
360,
2649,
3869,
7409,
1610,
13264,
3429,
264,
55806,
48476,
8924,
393,
869,
437,
11,
4046,
2633,
2172,
11,
991,
98992,
11,
4247,
4543,
43684,
5481,
2442,
275,
1299,
382,
1737,
97843,
7962,
14420,
2908,
2649,
28625,
48924,
6414,
220,
18650,
13,
16,
1473,
6219,
71281,
656,
83393,
720,
16589,
98192
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
46,
44847,
2850,
4428,
47859,
1832,
37111,
320,
283,
58201,
2850,
4428,
47859,
1832,
37111,
8,
4046,
10832,
4319,
11099,
745,
6027,
12208,
76995,
56503,
3074,
320,
2000,
9345,
8,
26458,
277,
2649,
264,
10832,
19935,
265,
5697,
4040,
6033,
10832,
864,
62221,
5808,
11,
2633,
2649,
11,
991,
17567,
656,
65673,
11,
4247,
4543,
58201,
20358,
39571,
1832,
37111,
11,
4247,
513,
490,
6526,
409,
10832,
1891,
58744,
45009,
991,
1376,
13264,
13,
650,
2910,
360,
2649,
3869,
7409,
1610,
13264,
3429,
264,
55806,
48476,
8924,
393,
869,
437,
11,
4046,
2633,
2172,
11,
991,
98992,
11,
4247,
4543,
43684,
5481,
2442,
275,
1299,
382,
1737,
97843,
7962,
14420,
2908,
2649,
28625,
48924,
6414,
220,
18650,
13,
16,
1473,
6219,
71281,
656,
83393,
720,
16589,
98192,
-100
] |
Home CVCF Announcements Comox Valley Community Foundation names new president
This article was originally posted by the Comox Valley Record, Sun Sep 15th, 2017
The Comox Valley Community Foundation is pleased to announce that Dr. Harry Panjer has been elected as President.
He succeeds Dr. Norm Carruthers, who served as president for the past three years.
Harry Panjer is a resident of the Comox Valley and holds the title of Distinguished Professor Emeritus at the University of Waterloo. He has served on the Comox Valley Community Foundation board for four years as secretary, vice-president, chair of Vital Signs and chair of Governance Review. He also served as the founding chair of the Centre Wellington Community Foundation in Ontario and he has served as president of two major professional actuarial associations. Locally, he is a member of the Rotary Club of Comox.
"It is my privilege to serve the Foundation in this new capacity," said Panjer. "I have had the pleasure to contribute to the Foundation board for the past four years and I look forward to continuing to maximize the Foundation's philanthropic impact in the Comox Valley by supporting the many charitable organizations that improve the local quality of life. I would particularly like to thank the outgoing president Norm Carruthers for his outstanding leadership and continued support of the Foundation."
The Comox Valley Community Foundation has served our region for 20 years, working with donors to create legacies in the form of permanent endowment funds, now worth over $12 million. Grants are distributed from income earned, preserving the capital to ensure a perpetual stream of funds. | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 2,592 | [
128000,
7778,
14499,
9847,
9489,
55364,
1219,
5241,
13345,
12332,
5114,
5144,
502,
4872,
198,
2028,
4652,
574,
13517,
8621,
555,
279,
1219,
5241,
13345,
13896,
11,
8219,
17907,
220,
868,
339,
11,
220,
679,
22,
198,
791,
1219,
5241,
13345,
12332,
5114,
374,
18949,
311,
22203,
430,
2999,
13,
14253,
11233,
27457,
706,
1027,
16689,
439,
4900,
627,
1548,
51181,
2999,
13,
20935,
30474,
952,
388,
11,
889,
10434,
439,
4872,
369,
279,
3347,
2380,
1667,
627,
42398,
11233,
27457,
374,
264,
19504,
315,
279,
1219,
5241,
13345,
323,
10187,
279,
2316,
315,
423,
80382,
17054,
21185,
36891,
520,
279,
3907,
315,
77475,
13,
1283,
706,
10434,
389,
279,
1219,
5241,
13345,
12332,
5114,
4580,
369,
3116,
1667,
439,
19607,
11,
17192,
67088,
11,
10716,
315,
55371
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
7778,
14499,
9847,
9489,
55364,
1219,
5241,
13345,
12332,
5114,
5144,
502,
4872,
198,
2028,
4652,
574,
13517,
8621,
555,
279,
1219,
5241,
13345,
13896,
11,
8219,
17907,
220,
868,
339,
11,
220,
679,
22,
198,
791,
1219,
5241,
13345,
12332,
5114,
374,
18949,
311,
22203,
430,
2999,
13,
14253,
11233,
27457,
706,
1027,
16689,
439,
4900,
627,
1548,
51181,
2999,
13,
20935,
30474,
952,
388,
11,
889,
10434,
439,
4872,
369,
279,
3347,
2380,
1667,
627,
42398,
11233,
27457,
374,
264,
19504,
315,
279,
1219,
5241,
13345,
323,
10187,
279,
2316,
315,
423,
80382,
17054,
21185,
36891,
520,
279,
3907,
315,
77475,
13,
1283,
706,
10434,
389,
279,
1219,
5241,
13345,
12332,
5114,
4580,
369,
3116,
1667,
439,
19607,
11,
17192,
67088,
11,
10716,
315,
55371,
-100
] |
Gritty & Pretty
by Xenia Leblanc
Xenia Leblanc
This female led series is a fast-paced energetic ride, with a cliffhanger at the end of every 5-6 minute episode. Be prepared for awkward encounters, sharp visual styles and badass comedy.
We feel that there is no better time than now to support female voices in filmmaking, especially in comedy and tell new unique, empowering stories. Written, produced and directed by women, this is exactly what this show is all about.
#What'sTheStory?
Kira and Lauren used to be best friends in high school, however their friendship withered after graduation. Fifteen years later, they are two completely different people, struggling to find their true paths, as well as make a living. Kira is fighting to save her boxing gym from bankruptcy, while Lauren is stuck hosting an absurd Instagram TV talk show. Fate brings them together once again, when they crash into each other at the parking lot of the building they both ended up working in.
Their friendship picks up exactly where it left off, only this time Kira has to face her feelings and let someone else into her personal life, while Lauren is forced to look past her own appearance and help a friend in need.
#WhyThisStory?
The unpredictable nature of female friendships personally always amazed me. One day we're ready to share our innermost secrets, desires and fears. On another, we close off, compare and endlessly measure ourselves against one another, struggling to realize how truly unique and beautiful each and every one of us is.
I wanted to tell an entertaining and somewhat uncensored story of this bizzare friendship between two opposites (because, let's face it, all of the best friendships end up being truly bizzare in nature), that will hopefuly leave people feeling good about who they truly are, without any need to hide behind appearances.
#SupportingWomenInComedy
We're living in most amazing times, when female voices are finally being heard, especially in comedy. I strongly feel that we, women, should use each and every opportunity to show how truly goofy, talented and unique we all are. By investing in this small, but feisty project you're also supporting and inspiring every woman out there to get up and tell her own unique and hopefully bizarre story.
#MeetTheCharacters
A heartfelt 'thank you' from our team. We can use all the support we can get! Also, you will be the first to see the official trailer before anyone else!
Your amazingness shall not go unnoticed. You will receive a badass social media shoutout and will be the first to receive an exclusive password-protected screening link to the series, before the official public release.
In addition to an exclusive password-protected screening link to the series, you will also receive a "special thank you" IMDB credit.
Whoa, you sure can punch! An eco-friendly tote bag with an art print from one of our supporting female artists is yours to take home. It's perfect for groceries, or on the beach, at the gym or even party. Basically anywhere where you can show off that you are an awesome supporter or female filmmakers.
Double Jab
An exclusive invitation to visit our set in Los Angeles during filming.*
*Please note that we cannot afford to fly anyone out, or pay for any accomodations, but we sure promise that you will have a blast visiting our set as well as become a part of the creative process as a background actor!
Claimed: 3 of 15
For this generous contribution you will receive an official Executive Producer credit, as well as a handmade leather bracelet with an invitation to the Los Angeles premiere.
DP and Gaffers with Camera Equipment
For this price, the DP we've already found comes with his own gear and crew.
Film sets can get chaotic. This is why we need a great AD to make sure we stick to the schedule.
$700 to go
costs $700
Most of the story is happening at a boxing gym. This location is essential to our project.
Great sound elevates the film to a whole new level. This is why we need a professional.
Apart from the main cast, we do have a few other important supporting characters.
We want to be able to feed our crew the best we can, in return for all of their hard work.
Xenia Leblanc graduated from Queen Mary University of London with a BA Degree in Film Studies. After graduation she moved to Los Angeles to begin intensive acting training at Playhouse West School and Repertory Theatre, as well as New York Film Academy. Her big on-screen break came when she landed the role of Young "Red" on the critically acclaimed NETFLIX original series "Orange Is The New Black" playing 'Young Red' (Kate Mulgrew), followed by an opportunity to work on the WB blockbuster Justice League.
Xenia constantly writes, produces and dicrects her own projects. Her comedy channel Broken English , that she co-created with her partner, gained nation-wide and online recognition, bringing her to NYC Independent Film Festival and featuring one of its projects on Elizabeth Bank's online platform WhoHaHa.
Kelly Russo is an actor, producer, dancer, model, and tv show host. You may have seen her as Beth on Showtime's, I'm Dying Up Here, opposite Brad Garrett and Academy Award winner, Melissa Leo. She also hosted her own show, DTLA Talks, which aired on Direct TV. Kelly is an avid storyteller and people person. She enjoys giving back to younger artists as she teaches ballet and mentors elementary school screen writers. Gritty & Pretty was conceived on a "leisure" hike up to Griffith Observatory one hot winter day in Los Angeles. We can't wait to show it to you!
You're now following Gritty & Pretty! Hungry for more great series? Try our streaming subscription! | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 5,638 | [
128000,
38,
1018,
1919,
612,
36416,
198,
1729,
49329,
689,
2009,
2067,
1149,
198,
55,
59386,
2009,
2067,
1149,
198,
2028,
8954,
6197,
4101,
374,
264,
5043,
65319,
45955,
12141,
11,
449,
264,
44106,
71,
4091,
520,
279,
842,
315,
1475,
220,
20,
12,
21,
9568,
9417,
13,
2893,
10235,
369,
29859,
35006,
11,
17676,
9302,
9404,
323,
87402,
23160,
627,
1687,
2733,
430,
1070,
374,
912,
2731,
892,
1109,
1457,
311,
1862,
8954,
24196,
304,
34626,
1802,
11,
5423,
304,
23160,
323,
3371,
502,
5016,
11,
66388,
7493,
13,
34991,
11,
9124,
323,
15910,
555,
3278,
11,
420,
374,
7041,
1148,
420,
1501,
374,
682,
922,
627,
2,
3923,
596,
791,
18422,
5380,
42,
9008,
323,
43460,
1511,
311,
387,
1888,
4885,
304,
1579,
2978,
11,
4869
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
38,
1018,
1919,
612,
36416,
198,
1729,
49329,
689,
2009,
2067,
1149,
198,
55,
59386,
2009,
2067,
1149,
198,
2028,
8954,
6197,
4101,
374,
264,
5043,
65319,
45955,
12141,
11,
449,
264,
44106,
71,
4091,
520,
279,
842,
315,
1475,
220,
20,
12,
21,
9568,
9417,
13,
2893,
10235,
369,
29859,
35006,
11,
17676,
9302,
9404,
323,
87402,
23160,
627,
1687,
2733,
430,
1070,
374,
912,
2731,
892,
1109,
1457,
311,
1862,
8954,
24196,
304,
34626,
1802,
11,
5423,
304,
23160,
323,
3371,
502,
5016,
11,
66388,
7493,
13,
34991,
11,
9124,
323,
15910,
555,
3278,
11,
420,
374,
7041,
1148,
420,
1501,
374,
682,
922,
627,
2,
3923,
596,
791,
18422,
5380,
42,
9008,
323,
43460,
1511,
311,
387,
1888,
4885,
304,
1579,
2978,
11,
4869,
-100
] |
<div class="bx-base-text-unit bx-base-text-unit-ext bx-def-box bx-def-round-corners bx-def-color-bg-box bx-def-margin-bottom">
<bx_if:thumb>
<div class="bx-base-text-unit-cover">
<a href="__content_url__"><img class="bx-base-text-unit-cover bx-def-round-corners" alt="__title__" src="__thumb_url__" /></a>
<bx_if:duration_set>
<div class="bx-video-unit-duration bx-def-padding-sec-leftright bx-def-padding-thd-topbottom bx-def-border bx-def-round-corners bx-def-font">__duration__</div>
</bx_if:duration_set>
</div>
</bx_if:thumb>
<div class="bx-base-text-unit-text bx-def-padding bx-def-box-sizing">
<h2 class="bx-base-text-unit-title"><a href="__content_url__">__title__</a></h2>
<div class="bx-base-text-unit-info bx-def-margin-sec-top">
<bx_if:meta><div class="bx-base-general-unit-meta">__meta__</div></bx_if:meta>
</div>
<div class="bx-base-text-unit-summary bx-def-margin-sec-top bx-clearfix">
__summary__
</div>
</div>
</div> | {
"redpajama_set_name": "RedPajamaGithub"
} | 2,758 | [
128000,
2691,
538,
429,
22619,
31113,
9529,
61675,
45341,
31113,
9529,
61675,
67203,
45341,
29899,
12913,
45341,
29899,
21691,
1824,
45380,
45341,
29899,
8048,
36904,
12913,
45341,
29899,
46491,
11635,
891,
262,
366,
22619,
11366,
25,
26091,
397,
286,
366,
614,
538,
429,
22619,
31113,
9529,
61675,
76465,
891,
310,
366,
64,
1839,
79627,
1834,
2975,
565,
3164,
1931,
538,
429,
22619,
31113,
9529,
61675,
76465,
45341,
29899,
21691,
1824,
45380,
1,
4902,
79627,
2150,
565,
1,
2338,
79627,
26091,
2975,
565,
1,
17793,
64,
397,
310,
366,
22619,
11366,
25,
17456,
2667,
397,
394,
366,
614,
538,
429,
22619,
42411,
61675,
65483,
45341,
29899,
43649,
12,
5132,
31307,
69,
70076,
45341,
29899,
43649,
7716,
67,
8338,
15205,
45341,
29899,
28117,
45341,
29899,
21691,
1824,
45380,
45341,
29899
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
2691,
538,
429,
22619,
31113,
9529,
61675,
45341,
31113,
9529,
61675,
67203,
45341,
29899,
12913,
45341,
29899,
21691,
1824,
45380,
45341,
29899,
8048,
36904,
12913,
45341,
29899,
46491,
11635,
891,
262,
366,
22619,
11366,
25,
26091,
397,
286,
366,
614,
538,
429,
22619,
31113,
9529,
61675,
76465,
891,
310,
366,
64,
1839,
79627,
1834,
2975,
565,
3164,
1931,
538,
429,
22619,
31113,
9529,
61675,
76465,
45341,
29899,
21691,
1824,
45380,
1,
4902,
79627,
2150,
565,
1,
2338,
79627,
26091,
2975,
565,
1,
17793,
64,
397,
310,
366,
22619,
11366,
25,
17456,
2667,
397,
394,
366,
614,
538,
429,
22619,
42411,
61675,
65483,
45341,
29899,
43649,
12,
5132,
31307,
69,
70076,
45341,
29899,
43649,
7716,
67,
8338,
15205,
45341,
29899,
28117,
45341,
29899,
21691,
1824,
45380,
45341,
29899,
-100
] |
LEGO® STAR WARS™: THE FORCE AWAKENS (English Ver.)
In-game purchases optional
※This item is also offered in a pack. Refunds will not be offered for duplicate purchase.
The Force is strong with this one… The No. 1 LEGO® videogame franchise triumphantly returns with a fun-filled, humorous journey through the new Star Wars adventure. Play as all of the characters from the movie, including Rey, Finn, Poe Dameron, Han Solo, Chewbacca, C-3PO, and BB-8, as well as Kylo Ren, General Hux and Captain Phasma.
In LEGO® STAR WARS™: THE FORCE AWAKENS, relive the epic action from the blockbuster film in way that only LEGO can offer, featuring brand new story content from the Star Wars Universe that explores the time between Star Wars: Return of the Jedi and Star Wars: THE FORCE AWAKENS.
LEGO® STAR WARS™: THE FORCE AWAKENS introduces new gameplay mechanics, including the enhanced Multi-Builds system, where players can choose from multiple building options to advance the game, or engage in intense new Blaster Battles for the first time, utilizing surrounding environments to drive back the First Order.
LEGO® STAR WARS™: THE FORCE AWAKENS software © 2016 TT Games Ltd. Produced by TT Games under license from the LEGO Group. LEGO, the LEGO logo, the Brick and the Knob configurations and the Minifigure are trademarks and/or copyrights of the LEGO Group. © 2016 The LEGO Group. STAR WARS © & ™ Lucasfilm Ltd. All rights reserved. Used under authorization.
WB GAMES LOGO, WB SHIELD: ™ & © Warner Bros. Entertainment Inc.
(s16)
LEGO® STAR WARS™: THE FORCE AWAKENS Demo (English Ver.)
DemoFree
LEGO® STAR WARS™: THE FORCE AWAKENS Deluxe Edition (English/Chinese Ver.)
Save 80%Offer ends 19/1/2021THB 410.00THB 2,054.00
LEGO® STAR WARS™: THE FORCE AWAKENS Deluxe Edition (English Ver.)
LEGO® STAR WARS™: THE FORCE AWAKENS (English/Chinese Ver.)
Purchase or use of this item is subject to SEN Terms of Service and User Agreement.
Warner Bros. Interactive Privacy Policy & EULA
Country / Region: Thailand
Legal Documents & Notices
Intellectual property notices
LEGO Star Wars: The Force Awakens | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 1,498 | [
128000,
877,
15881,
12175,
57845,
468,
17485,
16500,
25,
3247,
83689,
34438,
12173,
20982,
320,
23392,
6383,
29275,
644,
19959,
24393,
10309,
198,
64780,
2028,
1537,
374,
1101,
9076,
304,
264,
3854,
13,
8718,
44050,
690,
539,
387,
9076,
369,
23329,
7782,
627,
791,
11994,
374,
3831,
449,
420,
832,
1981,
578,
2360,
13,
220,
16,
56901,
12175,
89117,
373,
19562,
38586,
18007,
4780,
449,
264,
2523,
44518,
11,
70946,
11879,
1555,
279,
502,
7834,
15317,
18427,
13,
7199,
439,
682,
315,
279,
5885,
505,
279,
5818,
11,
2737,
49312,
11,
35162,
11,
82695,
423,
91712,
11,
21296,
36223,
11,
90965,
56977,
936,
11,
356,
12,
18,
2089,
11,
323,
18772,
12,
23,
11,
439,
1664,
439,
23727,
385,
14094,
11,
3331,
473,
2249,
323,
22022,
2405,
23390
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
877,
15881,
12175,
57845,
468,
17485,
16500,
25,
3247,
83689,
34438,
12173,
20982,
320,
23392,
6383,
29275,
644,
19959,
24393,
10309,
198,
64780,
2028,
1537,
374,
1101,
9076,
304,
264,
3854,
13,
8718,
44050,
690,
539,
387,
9076,
369,
23329,
7782,
627,
791,
11994,
374,
3831,
449,
420,
832,
1981,
578,
2360,
13,
220,
16,
56901,
12175,
89117,
373,
19562,
38586,
18007,
4780,
449,
264,
2523,
44518,
11,
70946,
11879,
1555,
279,
502,
7834,
15317,
18427,
13,
7199,
439,
682,
315,
279,
5885,
505,
279,
5818,
11,
2737,
49312,
11,
35162,
11,
82695,
423,
91712,
11,
21296,
36223,
11,
90965,
56977,
936,
11,
356,
12,
18,
2089,
11,
323,
18772,
12,
23,
11,
439,
1664,
439,
23727,
385,
14094,
11,
3331,
473,
2249,
323,
22022,
2405,
23390,
-100
] |
Ryan has 18 years experience at Western Gold. He started as a Customer Service Representative, was licensed 1 year later and moved on to be a producer. Three years later Ryan was promoted to Producer Office Manager. Now Ryan fills the position of Chief Operations Officer of Western Gold and its affiliates. He oversees operations of Western Gold Headquarters and the western United States.
His responsibilities are numerous, to name a few, client care, production, research and development, and also oversees employee benefits.
Ryan is happily married and has 2 children who are very active in sports and music. His wife actually teaches music at a local private school and is an accomplished opera singer. Ryan spends his leisure time with family, attending his children's sporting events and traveling. | {
"redpajama_set_name": "RedPajamaC4"
} | 2,997 | [
128000,
49546,
706,
220,
972,
1667,
3217,
520,
11104,
7573,
13,
1283,
3940,
439,
264,
12557,
5475,
38366,
11,
574,
16383,
220,
16,
1060,
3010,
323,
7882,
389,
311,
387,
264,
17276,
13,
14853,
1667,
3010,
13960,
574,
30026,
311,
44459,
8410,
10790,
13,
4800,
13960,
41687,
279,
2361,
315,
14681,
25927,
20148,
315,
11104,
7573,
323,
1202,
32133,
13,
1283,
71945,
7677,
315,
11104,
7573,
70736,
323,
279,
19001,
3723,
4273,
627,
16366,
28423,
527,
12387,
11,
311,
836,
264,
2478,
11,
3016,
2512,
11,
5788,
11,
3495,
323,
4500,
11,
323,
1101,
71945,
9548,
7720,
627,
49546,
374,
37875,
12502,
323,
706,
220,
17,
2911,
889,
527,
1633,
4642,
304,
10034,
323,
4731,
13,
5414,
7555,
3604,
33992,
4731,
520,
264,
2254,
879,
2978,
323,
374
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
49546,
706,
220,
972,
1667,
3217,
520,
11104,
7573,
13,
1283,
3940,
439,
264,
12557,
5475,
38366,
11,
574,
16383,
220,
16,
1060,
3010,
323,
7882,
389,
311,
387,
264,
17276,
13,
14853,
1667,
3010,
13960,
574,
30026,
311,
44459,
8410,
10790,
13,
4800,
13960,
41687,
279,
2361,
315,
14681,
25927,
20148,
315,
11104,
7573,
323,
1202,
32133,
13,
1283,
71945,
7677,
315,
11104,
7573,
70736,
323,
279,
19001,
3723,
4273,
627,
16366,
28423,
527,
12387,
11,
311,
836,
264,
2478,
11,
3016,
2512,
11,
5788,
11,
3495,
323,
4500,
11,
323,
1101,
71945,
9548,
7720,
627,
49546,
374,
37875,
12502,
323,
706,
220,
17,
2911,
889,
527,
1633,
4642,
304,
10034,
323,
4731,
13,
5414,
7555,
3604,
33992,
4731,
520,
264,
2254,
879,
2978,
323,
374,
-100
] |
As the professional Chinese steel supplier, Katalor will supply you the steel products with good quality and complete after-sale service and the lowest price.We sincerely hope to establish long-term cooperation relations with you on the basis of mutual benefit, reciprocity and common development. So if you need any help, please be free to contact [email protected]. We will give you the best quote of nickel alloy inconel 625 sheet.
View our Inconel® 625 Nickel Alloy data sheet. This alloy has excellent oxidation resistance, corrosion resistance, and strength at high temperatures.
nconel 625 is a nonmagnetic, corrosion and oxidation resistant, nickel-base alloy with high strength and toughness. Contact Magellan Metals for Inconel 625.
Nickel Sheet 625 (0.06" thick) is often used for high strength fabrication projects because it has excellent corrosion resistance under a range of temperatures. Often used for in marine and submarine conditions, Nickel 625 offers incredible weldability and dissimilar metal jointing.
Altemp Alloys offers Inconel alloy 188, 625, 718, X-750 and 230 in plate, sheet, bar, and forgings.Inconel is found in a variety of industries where high temperatures are present including aerospace, jet engine components, food processing, and cryogenic storage tanks. Contact Altemp Alloys today for your free quote. | {
"redpajama_set_name": "RedPajamaC4"
} | 5,272 | [
128000,
2170,
279,
6721,
8620,
9699,
19353,
11,
735,
4306,
269,
690,
8312,
499,
279,
9699,
3956,
449,
1695,
4367,
323,
4686,
1306,
58637,
2532,
323,
279,
15821,
3430,
23210,
59383,
3987,
311,
5813,
1317,
9860,
23915,
4398,
449,
499,
389,
279,
8197,
315,
27848,
8935,
11,
67642,
9103,
323,
4279,
4500,
13,
2100,
422,
499,
1205,
904,
1520,
11,
4587,
387,
1949,
311,
3729,
510,
2386,
2682,
948,
1226,
690,
3041,
499,
279,
1888,
12929,
315,
52349,
46964,
28093,
301,
220,
15894,
11071,
627,
860,
1057,
763,
444,
301,
12175,
220,
15894,
67942,
61430,
828,
11071,
13,
1115,
46964,
706,
9250,
71162,
13957,
11,
56488,
13957,
11,
323,
8333,
520,
1579,
20472,
627,
77,
444,
301,
220,
15894,
374,
264,
2536,
76,
39100,
11,
56488,
323,
71162
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
2170,
279,
6721,
8620,
9699,
19353,
11,
735,
4306,
269,
690,
8312,
499,
279,
9699,
3956,
449,
1695,
4367,
323,
4686,
1306,
58637,
2532,
323,
279,
15821,
3430,
23210,
59383,
3987,
311,
5813,
1317,
9860,
23915,
4398,
449,
499,
389,
279,
8197,
315,
27848,
8935,
11,
67642,
9103,
323,
4279,
4500,
13,
2100,
422,
499,
1205,
904,
1520,
11,
4587,
387,
1949,
311,
3729,
510,
2386,
2682,
948,
1226,
690,
3041,
499,
279,
1888,
12929,
315,
52349,
46964,
28093,
301,
220,
15894,
11071,
627,
860,
1057,
763,
444,
301,
12175,
220,
15894,
67942,
61430,
828,
11071,
13,
1115,
46964,
706,
9250,
71162,
13957,
11,
56488,
13957,
11,
323,
8333,
520,
1579,
20472,
627,
77,
444,
301,
220,
15894,
374,
264,
2536,
76,
39100,
11,
56488,
323,
71162,
-100
] |
How to Perform a Driver License Name Change in South Carolina
Name Change for SC DL
Learn how to get your Name Change on SC DL
Save Time Online
Learn How To Change Your Name on a SC DL
Fast and easy drivers license assistance
A drivers license name change in South Carolina is an action that drivers may need to perform to maintain their credentials. Residents must submit a DMV name change to the Department of Motor Vehicles (DMV). Changing name on drivers license documents is critical for record keeping. A name change on drivers license details helps motorists prove their identities for additional activities. Drivers who disregard DMV name change requirements may face increased difficulty when applying for benefits or dealing with law enforcement. Learn how to do a driver's license name change in SC in the following.
Change Name with Social Security Administration in South Carolina
Before motorists can perform a change of name on driving license documents, they must first inform the Social Security Administration (SSA) of the change. When drivers change name on driving license credentials, the DMV verifies the new name with the SSA, making this step of the utmost importance for South Carolina residents. Before submitting a driver license name change form, motorists should apply for a new Social Security card by mail or in person at the local SSA office in their area. Applicants must fill out a Social Security card application, provide proof of identity and show the documents approving the driver name change. The applicant's current drivers license serves as one form for proof of identity and a document like a marriage license or court order provides proof of name change. Applicants may continue changing names on drivers licenses in South Carolina once their Social Security requests are approved.
How to Change Name on Drivers License in South Carolina
To apply for an SC driving license name change, motorists must first change their name with the SSA and gather the appropriate documentation indicating the name update. South Carolina residents must submit DMV name changes in person to their local DMV office or by mail to the DMV P.O. box. A change of name on drivers license credentials requires residents to complete a form that allows drivers to update their name along with their address, if necessary. Along with the DMV name change form, motorists must also complete a new drivers license application to replace their current license and provide payment for the license replacement fee. To complete the drivers license name change process, applicants must also bring in or mail in proof of their name change such as a marriage license or the court-ordered name change. Drivers submitting a South Carolina drivers license name change should verify costs and accepted methods of payment for mail-in or in-person options with their local DMV office.
Note: The South Carolina DMV does not accept drivers license name changes submitted online. Applicants must submit all required DMV name change documentation in person or by mailwithin 10 days of the official name update.
Why Changing Your Name on Driving Licensein South Carolina is Important
A South Carolina DMV name change is a task that many residents may not need to perform in their lifetime. For those residents who do decide on a legal name change, a South Carolina driver license name change is an essential step in this process. Drivers must submit a DMV name change no more than 10 days after the name change approval along with a license replacement request. If drivers do not submit their driver license name changes they may have difficulty proving their identity for a variety of daily tasks.
Neglecting to change a name on driving license documentation may lead to unnecessary confusion and delays with important tasks or daily responsibilities. A drivers license name change is a critical update as drivers licenses typically serve as a primary form of identification for many South Carolina residents. Motorists should change their name on driving license cards to prove their identity in scenarios such as credit card purchases in stores or at a traffic stop with law enforcement. Motorists who do not request a DMV name change but wish to apply for government benefits may have difficulty submitting requests if their physical card or DMV information does not match the federal government records at the SSA. Applying for a change of name on drivers license credentials guarantees South Carolina residents will not have difficulty proving their identity for new employment and/or at their bank if necessary.
Who should change name on drivers license in South Carolina?
Drivers who apply for a South Carolina driving license name change do so because of marriage, divorce or a court order. Motorists may apply for a DMV name change after approval from a court-ordered name change. Divorced individuals seeking to change a name on driving license credentials by reverting to their pre-marriage name may do so by order of a South Carolina judge in the divorce decree or a court order if the name change is not included in the decree. A married spouse seeking a name change must also apply for a drivers license name change in South Carolina immediately after the marriage and present the marriage license. A married person may change his or her name later, but he or she must follow the steps to petition for a court-ordered name change. | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 7,523 | [
128000,
4438,
311,
26050,
264,
14919,
1914,
4076,
10604,
304,
4987,
13030,
198,
678,
10604,
369,
7683,
34075,
198,
24762,
1268,
311,
636,
701,
4076,
10604,
389,
7683,
34075,
198,
8960,
4212,
8267,
198,
24762,
2650,
2057,
10604,
4718,
4076,
389,
264,
7683,
34075,
198,
33274,
323,
4228,
12050,
5842,
13291,
198,
32,
12050,
5842,
836,
2349,
304,
4987,
13030,
374,
459,
1957,
430,
12050,
1253,
1205,
311,
2804,
311,
10519,
872,
16792,
13,
64348,
2011,
9502,
264,
20804,
53,
836,
2349,
311,
279,
6011,
315,
18079,
56120,
320,
8561,
53,
570,
51269,
836,
389,
12050,
5842,
9477,
374,
9200,
369,
3335,
10494,
13,
362,
836,
2349,
389,
12050,
5842,
3649,
8779,
72998,
12391,
872,
40521,
369,
5217,
7640,
13,
46837,
889,
58817,
20804,
53,
836,
2349,
8670
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
4438,
311,
26050,
264,
14919,
1914,
4076,
10604,
304,
4987,
13030,
198,
678,
10604,
369,
7683,
34075,
198,
24762,
1268,
311,
636,
701,
4076,
10604,
389,
7683,
34075,
198,
8960,
4212,
8267,
198,
24762,
2650,
2057,
10604,
4718,
4076,
389,
264,
7683,
34075,
198,
33274,
323,
4228,
12050,
5842,
13291,
198,
32,
12050,
5842,
836,
2349,
304,
4987,
13030,
374,
459,
1957,
430,
12050,
1253,
1205,
311,
2804,
311,
10519,
872,
16792,
13,
64348,
2011,
9502,
264,
20804,
53,
836,
2349,
311,
279,
6011,
315,
18079,
56120,
320,
8561,
53,
570,
51269,
836,
389,
12050,
5842,
9477,
374,
9200,
369,
3335,
10494,
13,
362,
836,
2349,
389,
12050,
5842,
3649,
8779,
72998,
12391,
872,
40521,
369,
5217,
7640,
13,
46837,
889,
58817,
20804,
53,
836,
2349,
8670,
-100
] |
Sri Lankan all-rounder Asela Gunaratne feels that sharing the dressing room with Jasprit Bumrah for the Mumbai Indians franchise during the 2017 IPL helped him counter the death over specialist's threat during his crucial 22-ball 34 that helped Sri Lanka earn a surprising win over defending champions India in the eighth match of the 2017 ICC Champions Trophy on Thursday.
Coming in to bat following Kusal Perera's inability to continue out in the middle following a hamstring injury and with his side needing 51 runs to win off 42 balls, Gunaratne played a brilliant innings under pressure alongside skipper Angelo Mathews to guide Sri Lanka home with eight balls to spare.
Though he didn't feature in any of the matches in the 2017 IPL, Gunaratne said that facing the likes of Bumrah and Pandya in the nets gave him a fair idea of what to expect when he headed to the crease. He also added that another Mumbai Indians player in Lasith Malinga also provided him with tips to counter India's main weapon in the slog overs.
"Bumrah and Pandya were playing alongside me at Mumbai Indians and I had faced them in the nets. So I had a fair idea how they operate and what to expect. Before I went to bat, Lasith Malinga had a quick word and said to expect the slower ball," Gunaratne said after the game.
"I didn't play IPL games, but the time spent with them was valuable," he added.
Gunaratne, a Warrant Officer in the Sri Lankan army, was picked up by the Mumbai Indians franchise at the 2017 IPL auction following his T20 heroics for Sri Lanka against Australia where he scored consecutive half-centuries to help the Asian side to a 2-1 series victory.
He didn't feature for the eventual champions during the 2017 edition of the IPL and even a few of the commentators were sceptical when Gunaratne walked in ahead of the more-experienced Dinesh Chandimal in what was an intriguing run-chase. However, the 31-year-old had the final laugh as he proved the doubters wrong with a superb cameo.
Despite the early dismissal of Niroshan Dickwella, Sri Lanka looked well on course for victory when Danushka Gunathilaka and Kusal Mendis forged a brilliant partnership for the second wicket. However, the needless run-outs of both batsmen put the side under a lot of pressure before Kusal Perera and skipper Angelo Mathews, who was playing his first ODI since August 2016, resurrected the innings with a crucial stand.
Perera was forced to retire hurt though with a hamstring injury allowing India once again a slight glimmer of hope but Gunaratne's innings quickly wiped out any optimism the Virat Kohli-led side would have had.
The 46th over bowled by Bumrah was an effective game-ender as Gunaratne scored nine runs off five balls including the shot of the match - a stunning sweep for six over square leg to bring the equation down to less than run-a-ball.
In the end, it was a comfortable win for the island nation and one which threw the group wide open and in effect a couple of potential quarterfinals.
Pakistan's win over South Africa in what was a rain-curtailed match on Wednesday and Sri Lanka's win over India means that all four teams in Group B are still in with a chance to qualify for the semi-finals stage.
India will take on South Africa on Sunday while Pakistan take on Sri Lanka on Monday with the winners heading to the knockout stage.
While the IPL has provided a platform for youngsters to exhibit their talent, it has also allowed international players to get accustomed to the way players from across the globe go about their preparation for a big game.
Bumrah had an off day as well on Thursday with Gunaratne clearly having the measure of his Mumbai Indians teammate but it is not necessary that the result will be the same the next time they come up against each other. | {
"redpajama_set_name": "RedPajamaC4"
} | 4,099 | [
128000,
50,
462,
445,
76182,
682,
12,
583,
910,
1666,
8458,
22450,
47957,
818,
11321,
430,
11821,
279,
32623,
3130,
449,
86216,
40807,
426,
372,
33607,
369,
279,
35812,
30507,
19562,
2391,
279,
220,
679,
22,
77355,
9087,
1461,
5663,
279,
4648,
927,
24687,
596,
6023,
2391,
813,
16996,
220,
1313,
68302,
220,
1958,
430,
9087,
34445,
43579,
7380,
264,
15206,
3243,
927,
29269,
34838,
6890,
304,
279,
37477,
2489,
315,
279,
220,
679,
22,
59332,
29908,
56204,
389,
7950,
627,
57789,
304,
311,
16120,
2768,
735,
36514,
3700,
2473,
596,
38550,
311,
3136,
704,
304,
279,
6278,
2768,
264,
90805,
11134,
323,
449,
813,
3185,
33921,
220,
3971,
8640,
311,
3243,
1022,
220,
2983,
20953,
11,
22450,
47957,
818,
6476,
264,
20333,
36100,
1234,
7410,
16662,
10936
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
50,
462,
445,
76182,
682,
12,
583,
910,
1666,
8458,
22450,
47957,
818,
11321,
430,
11821,
279,
32623,
3130,
449,
86216,
40807,
426,
372,
33607,
369,
279,
35812,
30507,
19562,
2391,
279,
220,
679,
22,
77355,
9087,
1461,
5663,
279,
4648,
927,
24687,
596,
6023,
2391,
813,
16996,
220,
1313,
68302,
220,
1958,
430,
9087,
34445,
43579,
7380,
264,
15206,
3243,
927,
29269,
34838,
6890,
304,
279,
37477,
2489,
315,
279,
220,
679,
22,
59332,
29908,
56204,
389,
7950,
627,
57789,
304,
311,
16120,
2768,
735,
36514,
3700,
2473,
596,
38550,
311,
3136,
704,
304,
279,
6278,
2768,
264,
90805,
11134,
323,
449,
813,
3185,
33921,
220,
3971,
8640,
311,
3243,
1022,
220,
2983,
20953,
11,
22450,
47957,
818,
6476,
264,
20333,
36100,
1234,
7410,
16662,
10936,
-100
] |
The Medbury Boy is numerate, literate and articulate.
Mathematics is a major influence in all aspects of boys' daily lives. Boys develop numeracy skills and understanding in Mathematics through developing knowledge and strategies that enable them to explore Mathematical ideas, to solve problems and to think creatively. All new learning builds upon prior learning at each stage and developing confidence in Mathematics is emphasised from the early years through the Middle to the Senior School.
To ensure that an effective personalised Mathematics education is delivered at all levels according to the New Zealand Curriculum Framework.
To ensure that boys are given opportunities to explore, think critically about and process Mathematical information.
To enable boys to use and communicate their Mathematical knowledge and strategies in a range of meaningful everyday contexts, so that Mathematics is seen as relevant to their lives.
To foster and develop the mathematical talent of boys with special abilities. | {
"redpajama_set_name": "RedPajamaC4"
} | 9,140 | [
128000,
791,
3344,
20176,
16576,
374,
8015,
349,
11,
7080,
349,
323,
69318,
627,
8991,
34805,
374,
264,
3682,
10383,
304,
682,
13878,
315,
13305,
6,
7446,
6439,
13,
30857,
2274,
8015,
2826,
7512,
323,
8830,
304,
50895,
1555,
11469,
6677,
323,
15174,
430,
7431,
1124,
311,
13488,
92102,
6848,
11,
311,
11886,
5435,
323,
311,
1781,
93396,
13,
2052,
502,
6975,
22890,
5304,
4972,
6975,
520,
1855,
6566,
323,
11469,
12410,
304,
50895,
374,
20654,
4147,
505,
279,
4216,
1667,
1555,
279,
12877,
311,
279,
19903,
6150,
627,
1271,
6106,
430,
459,
7524,
85348,
50895,
6873,
374,
12886,
520,
682,
5990,
4184,
311,
279,
1561,
17340,
75306,
24686,
627,
1271,
6106,
430,
13305,
527,
2728,
10708,
311,
13488,
11,
1781,
41440,
922,
323,
1920,
92102,
2038,
627
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
791,
3344,
20176,
16576,
374,
8015,
349,
11,
7080,
349,
323,
69318,
627,
8991,
34805,
374,
264,
3682,
10383,
304,
682,
13878,
315,
13305,
6,
7446,
6439,
13,
30857,
2274,
8015,
2826,
7512,
323,
8830,
304,
50895,
1555,
11469,
6677,
323,
15174,
430,
7431,
1124,
311,
13488,
92102,
6848,
11,
311,
11886,
5435,
323,
311,
1781,
93396,
13,
2052,
502,
6975,
22890,
5304,
4972,
6975,
520,
1855,
6566,
323,
11469,
12410,
304,
50895,
374,
20654,
4147,
505,
279,
4216,
1667,
1555,
279,
12877,
311,
279,
19903,
6150,
627,
1271,
6106,
430,
459,
7524,
85348,
50895,
6873,
374,
12886,
520,
682,
5990,
4184,
311,
279,
1561,
17340,
75306,
24686,
627,
1271,
6106,
430,
13305,
527,
2728,
10708,
311,
13488,
11,
1781,
41440,
922,
323,
1920,
92102,
2038,
627,
-100
] |
Apple Computer on Thursday disclosed plans to open parts of its WebObjects Java application server to the developer community, ending more than a year of speculation on the subject.
In an email to a public WebObjects mailing list, Apple's Daryl Lee revealed for the first time that the company has formed a new strategy aimed at evolving WebObjects into best server-side runtime environment possible.
"Fully supported versions of these tools shipped in August with the new version of Xcode 2.4 and Apple will continue to support them well into the future," he wrote. "Any code built using these deprecated tools will continue to run on Leopard so your applications will not break."
Moving forward, Lee said Apple will be placing its engineering efforts firmly into the runtime engine of WebObjects, but will otherwise open and making public all standards and formats that WebObjects depends upon. Among the company's goals are improving performance, manageability and standards compliance.
Lee also said that Apple's software engineers will be increasing their efforts to make sure WebObjects works well with ANT and the most popular IDEs, including Apple's Xcode and Eclipse -- a free, open source platform-independent software framework for delivering rich-client applications.
"We are making these changes with the clear goal of boosting WebObjects, allocating resources to improve the platform at a more rapid pace, and to better react to your needs," he told developers. "We look forward to delivering to you a vibrant, continually-improving WebObjects."
When NeXT Software released WebObjects in March 1996, it was billed as the world's first object-oriented Web application server. Despite being quickly adopted by large companies like Disney and Dell as part of their e-commerce strategy, however, WebObjects began to languish after Apple acquired NeXT the following year.
Today, Apple is itself the biggest client for WebObjects, relying on the technology to power its online Apple Store, .Mac internet services and the iTunes Music Store.
Rumors that Apple planned take WebObjects open source gained considerable attention last year when employees working the show floor of the company's developers conference were overheard discussing the prospect. During a private session at this year's developers conference, plans to unlock the majority WebObjects's code were openly discussed.
This is confusing though. Once Apple depreciates something, it disappears from Apple's use, AND support.
Despite what they seem to be saying, I can't see anyone being interested in it now that this happened, open source or not.
WebObjects had a retail price of $50,000 at some time when developed by NeXT some years ago. A value of maybe $500,000 these days.
And it received several prizes at best web tool.
Amazing it is now FREE and even OPEN SOURCE!
They dropped the prices down to a few hundred some time ago.
Apple doesn't perceive any value in it anymore.
Wow, inflation is much worse than I thought - 10x in the last 10 years!
$50,000 in 1996 dollars is more like $62,000 today ... plus, software ordinarily drops in price.
But, value is all perception - it's what it means to you. Enough philosphy - it's a great package that's been opened up to the community; you can't argue with that.
How you figure that? The proof of its value is that Apple uses WebOjects to run its own business.
But its value is diminished by the fact that it is (now maybe was) proprietary - while it supported EJB is was a second class citizen and when companies want to avoid vendor lock-in they will avoid it in favor of fully standards based tools like WebSphere, WebLogic. JBoss etc.
This will do much to leverage Apple in the Enterprise. Tools like Cocoon 2, Hibernate, Struts, etc., now will be able to easily integrate into WOF, not to mention Maven.
I wish Apple would spearhead some open source projects based on WebObjects.
Just about every project is currently based on PHP-MySQL-Apache.
Instead of shipping OS X Server with a Java based blogging tool, why not make a WebObjects based one?
I think this would get people thinking about using WebObjects again.
By the fact that they continually droped the proce, despite the non adoption over the past few years, and now it will be free. Apple usually dropps the price to spur a larger user base. But it didn't work.
Therefore it has no value to them. The fact that they will be using it for who knows how long, doesn't matter.
By depreciating it, they are telling developers that it will be phased out. Apple has done this with all of their old tech that they no longer need. Not usually open sourcing it, but depreciating it. Just like they will be doing with quicktime, etc.
It is my understanding that Apple is deprecating a method in WebObjects, not WebObjects itself. As for the comment about QuickTime, it revealed more about your complete and total lack of understanding of the technology than any of Apple's actions.
Sorry, what I meant to type was QuickDRAW.
They are depricating the builder aspects given that free IDEs are pretty full featured. The runtime core of WebObjects will be their core focus moving forward...presumably to stay competitive with other application stacks.
*Whew!* My total faith in you flickered for a moment.
My hope is that Apple is letting WebObjects ride off into the sunset to be replaced by additions to Cocoa. WebObjects was cool, but porting it to Java never paid off the way Apple had hoped. It appears that Apple was using Java as a fall back plan on Objective-C. However with the end of Cocoa Java, and now WebObjects being put out to pasture, it seems Apple is firmly commited to Objective-C as its application development language. Also, Objective-C 2.0 shows that Apple is addressing some of the cruft in Obj-C to bring it up to parity (if not surpass) languages like Java.
As far as additions to Cocoa to support web applications, there are clues that this is where it is headed. Parts of EOModeler have been rolled into the data modeler for CoreData inside Xcode. This makes me think that support for databases beyond SQLite will be part of an update to CoreData. In addition I think the free version of WebObjects added "Cocoa Enterprise Obbjects Application" to the list of available projects in Xcode. Currently this a Cocoa java application, but as mentioned previously with Apple moving away from Cocoa Java, this may just be the start to Enterprise Objects in Objective-C Cocoa applications.
I may be wrong on all this, but it sure is something I would like to see. Being able to use the great Cocoa Foundation framework along with the return of EOs would sure be cool. Add in support for something like Cocoa Bindings via Ajax, and that would be a killer web application platform.
They're deprecating a set of GUI apps for creating some of the WebObjects files (such as the data models).
There are other tools that do that. Apparently inside Apple, many teams that use WO are using Eclipse anyway, rather than the Apple tools.
Personally I would have preferred new tools, but think of it this way: the other server technologies don't usually come with GUI tools to do all this stuff anyhow. Apple aren't finished with WO, just their particular tools for editing a few of the files.
It's being replaced with QTKit (objective-C) instead. The reason being that Quicktime API is not 64 bit clean, and will never be.
The motivation for using Java was to make things less tied to Apple-only tech -- for better or worse, no-one in the enterprise market uses objective-C!
I personally would love an obj-C framework that does something similar to WO. I'm contemplating writing one (called Core Web, naturally!) that uses Core Data, and is embeddable in any application to give it web serving capabilities.
As far as additions to Cocoa to support web applications, there are clues that this is where it is headed. Parts of EOModeler have been rolled into the data modeler for CoreData inside Xcode.
'Fraid they've deprecated those parts too!
This makes me think that support for databases beyond SQLite will be part of an update to CoreData.
I would hazard an educated guess of "yes, but not particularly soon".
In addition I think the free version of WebObjects added "Cocoa Enterprise Obbjects Application" to the list of available projects in Xcode.
I think this is deprecated too, I'm afraid, although I'm not certain.
I may be wrong on all this, but it sure is something I would like to see.
I would love to see this. However, I do not think you are correct. It seems to me that cocoa's data capabilities are being developed separately from WO, and while they may overlap they are sharing no tech.
I think Apple tried to compete in the Java Enterprise, but I don't think they ever made much headway. I would guess that the vast majority of people who deployed WOAs deployed them on Apple servers. If that is the case Apple might as well use their best tech. Part of the appeal of .Net is how you can use one language and framework to write desktop and web apps.
I'd just love to have some way of accessin databases from within Cocoa. EOs was too cool, and I hope they have somthing similar for Cocoa coming out soon.
'Fraid they've deprecated those parts too! I would hazard an educated guess of "yes, but not particularly soon".
I agree that it doesn't appear that they are replicating WebObjects in its entirety back to Objective-C, but they may be making additions to Cocoa that would make WebObjects redundant. Apple seems to be on a very steady road of adding features and slowly growing functionality. We have CoreData and the modeler, how hard would it be to make it use an external database instead of SQLite? That right there is 1/3 of the WebObjects magic.
Again this all may just be wishful thinking on my part, but I hope it is where apple goes.
Er, as I understand it, QTKit is on top of QT.
I'm skirting very close to NDA here, but that is not how I understand it... that is, it's not calling the C Quicktime API but interacting with the Quicktime internals in another way. | {
"redpajama_set_name": "RedPajamaC4"
} | 8,638 | [
128000,
27665,
17863,
389,
7950,
36489,
6787,
311,
1825,
5596,
315,
1202,
5000,
11804,
8102,
3851,
3622,
311,
279,
16131,
4029,
11,
13696,
810,
1109,
264,
1060,
315,
33422,
389,
279,
3917,
627,
644,
459,
2613,
311,
264,
586,
5000,
11804,
33859,
1160,
11,
8325,
596,
423,
78908,
12336,
10675,
369,
279,
1176,
892,
430,
279,
2883,
706,
14454,
264,
502,
8446,
20034,
520,
42028,
5000,
11804,
1139,
1888,
3622,
25034,
15964,
4676,
3284,
627,
1,
68486,
7396,
11028,
315,
1521,
7526,
28358,
304,
6287,
449,
279,
502,
2373,
315,
1630,
1889,
220,
17,
13,
19,
323,
8325,
690,
3136,
311,
1862,
1124,
1664,
1139,
279,
3938,
1359,
568,
6267,
13,
330,
8780,
2082,
5918,
1701,
1521,
32690,
7526,
690,
3136,
311,
1629,
389,
98638,
779,
701,
8522
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
27665,
17863,
389,
7950,
36489,
6787,
311,
1825,
5596,
315,
1202,
5000,
11804,
8102,
3851,
3622,
311,
279,
16131,
4029,
11,
13696,
810,
1109,
264,
1060,
315,
33422,
389,
279,
3917,
627,
644,
459,
2613,
311,
264,
586,
5000,
11804,
33859,
1160,
11,
8325,
596,
423,
78908,
12336,
10675,
369,
279,
1176,
892,
430,
279,
2883,
706,
14454,
264,
502,
8446,
20034,
520,
42028,
5000,
11804,
1139,
1888,
3622,
25034,
15964,
4676,
3284,
627,
1,
68486,
7396,
11028,
315,
1521,
7526,
28358,
304,
6287,
449,
279,
502,
2373,
315,
1630,
1889,
220,
17,
13,
19,
323,
8325,
690,
3136,
311,
1862,
1124,
1664,
1139,
279,
3938,
1359,
568,
6267,
13,
330,
8780,
2082,
5918,
1701,
1521,
32690,
7526,
690,
3136,
311,
1629,
389,
98638,
779,
701,
8522,
-100
] |
Just starting out with online shopping for reflective led and want a higher profit margin? You're in luck! DHgate is a good choice and has all kind of reflective led you may like. Many of the reflective led items are on sale with coupons and most of them are cheap but fine.
Learn about Printful volume discounts and how to get Novelty Lighting, Lights & Lighting. Chech how much each product would cost from 261 reflective led wholesalers. Before buying the Other reflective led from a selected supplier, I would recommend reading 1 reflective led lights customer reviews, to ensure a pleasant reflective led shopping experience. | {
"redpajama_set_name": "RedPajamaC4"
} | 3,053 | [
128000,
10156,
6041,
704,
449,
2930,
12185,
369,
52828,
6197,
323,
1390,
264,
5190,
11626,
4850,
30,
1472,
2351,
304,
15369,
0,
33887,
25623,
374,
264,
1695,
5873,
323,
706,
682,
3169,
315,
52828,
6197,
499,
1253,
1093,
13,
9176,
315,
279,
52828,
6197,
3673,
527,
389,
6412,
449,
36398,
323,
1455,
315,
1124,
527,
12136,
719,
7060,
627,
24762,
922,
8377,
1285,
8286,
32162,
323,
1268,
311,
636,
53976,
1919,
45623,
11,
35270,
612,
45623,
13,
8602,
331,
1268,
1790,
1855,
2027,
1053,
2853,
505,
220,
15602,
52828,
6197,
90997,
13,
13538,
12096,
279,
7089,
52828,
6197,
505,
264,
4183,
19353,
11,
358,
1053,
7079,
5403,
220,
16,
52828,
6197,
13001,
6130,
8544,
11,
311,
6106,
264,
24729,
52828,
6197,
12185,
3217,
13,
128256,
128256,
128256,
128256
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0
] | [
10156,
6041,
704,
449,
2930,
12185,
369,
52828,
6197,
323,
1390,
264,
5190,
11626,
4850,
30,
1472,
2351,
304,
15369,
0,
33887,
25623,
374,
264,
1695,
5873,
323,
706,
682,
3169,
315,
52828,
6197,
499,
1253,
1093,
13,
9176,
315,
279,
52828,
6197,
3673,
527,
389,
6412,
449,
36398,
323,
1455,
315,
1124,
527,
12136,
719,
7060,
627,
24762,
922,
8377,
1285,
8286,
32162,
323,
1268,
311,
636,
53976,
1919,
45623,
11,
35270,
612,
45623,
13,
8602,
331,
1268,
1790,
1855,
2027,
1053,
2853,
505,
220,
15602,
52828,
6197,
90997,
13,
13538,
12096,
279,
7089,
52828,
6197,
505,
264,
4183,
19353,
11,
358,
1053,
7079,
5403,
220,
16,
52828,
6197,
13001,
6130,
8544,
11,
311,
6106,
264,
24729,
52828,
6197,
12185,
3217,
13,
-100,
-100,
-100,
-100,
-100
] |
Q: How to merge N array of tuples on a common key by functional programming? I have 3 arrays, all of them containing tuples. First value is a timestamp (ts), second is an event count occured at that time. Individual arrays are sorted based on timestamp.
var arr1 = [{ts: 1000, val: 1},{ts: 1001, val: 2},{ts: 1002, val: 3}];
var arr2 = [{ts: 1001, val: 4},{ts: 1002, val: 5},{ts: 1005, val: 6}];
var arr3 = [{ts: 1003, val: 8},{ts: 1007, val: 8},{ts: 1008, val: 8}];
I want to merge them into a single timeline, in a 4xN array such that it becomes:
[
[1000, 1, 0, 0],
[1001, 2, 4, 0],
[1002, 3, 5, 0],
[1003, 0, 0, 8],
[1005, 0, 6, 0],
[1007, 0, 0, 8],
[1008, 0, 0, 8],
]
where 1st column is timestamp, second column is first array value, third column is second array value...
I tried to do it in non-functional ways, but couldn't come up with an elegant-clear solution that doesn't involve looking up timestamps in arrays repeatedly to find corresponding values. I felt there should be a relatively simple way to do this functionally, since I'm basically converting row based data to columnar one.
If solving it for N arrays is problematic I can live with a 3 array solution too!
A: I don't see anything better than your discarded notion of looking up timestamps in the arrays. If the data is really large, then you can make an index of it. But the code would not likely be pretty.
Here's an ES6 version:
const extract = (...xss) =>
[... new Set (xss .flatMap (xs => xs .map (x => x .ts)))]
.map (t => [t, ... xss .map (xs => (xs.find(({ts}) => t == ts) || {val: 0}).val)])
const arr1 = [{ts: 1000, val: 1}, {ts: 1001, val: 2}, {ts: 1002, val: 3}];
const arr2 = [{ts: 1001, val: 4}, {ts: 1002, val: 5}, {ts: 1005, val: 6}];
const arr3 = [{ts: 1003, val: 8}, {ts: 1007, val: 8}, {ts: 1008, val: 8}];
console .log (extract (arr1, arr2, arr3))
.as-console-wrapper {max-height: 100% !important; top: 0}
As to Ramda, we could certainly use Ramda here. That first line could be replaced with
uniq (chain (pluck ('ts')) (xss))
and we could similarly replace the maps and find with Ramda equivalents, and we could use a defaultTo in place of || {val: 0}. If you are using Ramda, you can probably continue that way for a while, and I urge you to try it. But I think if you're looking for an entirely point-free solution, most likely it will quickly end up unreadable.
A: Flatten the arrays, while adding the original array's index to each item. Then, group by ts, reduce each array of objects to an array of numbers, add the key (original ts) to each array, and convert to an array of array with R.values:
const { addIndex, map, pipe, chain, groupBy, prop, reduce, set, lensIndex, mapObjIndexed, values } = R;
const mapIndexed = addIndex(map);
const fill0 = map(() => 0);
const extract = (...xss) => pipe(
chain(mapIndexed((o, idx) => ({ ...o, idx }))), // add column index to each object
groupBy(prop('ts')),
map(reduce((acc, { idx, val }) => set(lensIndex(idx), val, acc), fill0(xss))), //fill the numbers in the index place
mapObjIndexed((vals, k) => [k, ...vals]), // create the row array
values
)(xss)
const arr1 = [{ts: 1000, val: 1}, {ts: 1001, val: 2}, {ts: 1002, val: 3}];
const arr2 = [{ts: 1001, val: 4}, {ts: 1002, val: 5}, {ts: 1005, val: 6}];
const arr3 = [{ts: 1003, val: 8}, {ts: 1007, val: 8}, {ts: 1008, val: 8}];
const result = extract(arr1, arr2, arr3);
console.log(result);
.as-console-wrapper {max-height: 100% !important; top: 0}
<script src="https://cdnjs.cloudflare.com/ajax/libs/ramda/0.27.1/ramda.js" integrity="sha512-3sdB9mAxNh2MIo6YkY05uY1qjkywAlDfCf5u1cSotv6k9CZUSyHVf4BJSpTYgla+YHLaHG8LUpqV7MHctlYzlw==" crossorigin="anonymous"></script>
Using vanilla JS, you can reduce the array of arrays to a Map, iterate the values of each array, if the key doesn't exist in the Map set an array of 0, and update the value at the relevant index. Use Array.from() to convert the entries of the Map to an array of rows:
const extract = (...xss) => Array.from(
xss.reduce((acc, o, i) => {
o.forEach(({ ts, val }) => { // iterate each array
if (!acc.has(ts)) acc.set(ts, [...xss].fill(0)); // if the key (ts) doesn't exist set it as an array of 0s
acc.get(ts)[i] = val; // replace the 0 with a value
});
return acc;
}, new Map())
).map(([k, values]) => [k, ...values]); // convert the Map to an array of arrays
const arr1 = [{ts: 1000, val: 1}, {ts: 1001, val: 2}, {ts: 1002, val: 3}];
const arr2 = [{ts: 1001, val: 4}, {ts: 1002, val: 5}, {ts: 1005, val: 6}];
const arr3 = [{ts: 1003, val: 8}, {ts: 1007, val: 8}, {ts: 1008, val: 8}];
console .log (extract (arr1, arr2, arr3))
.as-console-wrapper {max-height: 100% !important; top: 0}
| {
"redpajama_set_name": "RedPajamaStackExchange"
} | 7,415 | [
128000,
48,
25,
2650,
311,
11117,
452,
1358,
315,
46325,
389,
264,
4279,
1401,
555,
16003,
15840,
30,
358,
617,
220,
18,
18893,
11,
682,
315,
1124,
8649,
46325,
13,
5629,
907,
374,
264,
11695,
320,
2641,
705,
2132,
374,
459,
1567,
1797,
36042,
520,
430,
892,
13,
30440,
18893,
527,
10839,
3196,
389,
11695,
627,
959,
2961,
16,
284,
18973,
2641,
25,
220,
1041,
15,
11,
1062,
25,
220,
16,
16970,
2641,
25,
220,
1041,
16,
11,
1062,
25,
220,
17,
16970,
2641,
25,
220,
1041,
17,
11,
1062,
25,
220,
18,
76153,
959,
2961,
17,
284,
18973,
2641,
25,
220,
1041,
16,
11,
1062,
25,
220,
19,
16970,
2641,
25,
220,
1041,
17,
11,
1062,
25,
220,
20,
16970,
2641,
25,
220,
1041,
20,
11,
1062
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
48,
25,
2650,
311,
11117,
452,
1358,
315,
46325,
389,
264,
4279,
1401,
555,
16003,
15840,
30,
358,
617,
220,
18,
18893,
11,
682,
315,
1124,
8649,
46325,
13,
5629,
907,
374,
264,
11695,
320,
2641,
705,
2132,
374,
459,
1567,
1797,
36042,
520,
430,
892,
13,
30440,
18893,
527,
10839,
3196,
389,
11695,
627,
959,
2961,
16,
284,
18973,
2641,
25,
220,
1041,
15,
11,
1062,
25,
220,
16,
16970,
2641,
25,
220,
1041,
16,
11,
1062,
25,
220,
17,
16970,
2641,
25,
220,
1041,
17,
11,
1062,
25,
220,
18,
76153,
959,
2961,
17,
284,
18973,
2641,
25,
220,
1041,
16,
11,
1062,
25,
220,
19,
16970,
2641,
25,
220,
1041,
17,
11,
1062,
25,
220,
20,
16970,
2641,
25,
220,
1041,
20,
11,
1062,
-100
] |
Automated material handling equipment is a part of the material handling industry. Automated materials handling equipment includes a diverse range of products such as servo motors, conveyors (such as belt, chute, roller, wheel, slat, and chain) and machinery. These devices help in transporting and storing goods. Conventional leading is labor- intensive and requires personnel who can carry out tasks such as handling trailers, containers, forklifts, terminal tractors and other machinery. Apart from labor costs, the spending on owning. Leasing, and maintaining equipment is significant. Thus, process and discrete industries are adopting automated material handling systems to increase volumes and reduce the lead time. Technavio's analysts have predicted that the industrial V-belts market will register a CAGR of over 4% by 2023.
End- users either repair or replace these products over the course of operations. Vendors tend to earn revenues through the maintenance and servicing of belt drivers. As these belt drivers are relatively inexpensive, end- users are usually less reluctant to opt for the replacement of belt drives.
The majority of belt drives use V- belts which provide increased friction and improved transmission power. Belt tension is a major challenge faced with V- belts.
For the detailed list of factors that will drive and challenge the growth of the industrial V-belts market during the 2019-2023, view our report.
The industrial V-belts market appears to be moderately fragmented and with the presence of several companies. This market research report will help clients identify new growth opportunities and design unique growth strategies by providing a comprehensive analysis of the market's competitive landscape and offering information on the products offered by companies. | {
"redpajama_set_name": "RedPajamaC4"
} | 713 | [
128000,
42172,
660,
3769,
11850,
7241,
374,
264,
961,
315,
279,
3769,
11850,
5064,
13,
95823,
7384,
11850,
7241,
5764,
264,
17226,
2134,
315,
3956,
1778,
439,
59412,
38424,
11,
20599,
1105,
320,
21470,
439,
19671,
11,
95480,
11,
29551,
11,
13587,
11,
1776,
266,
11,
323,
8957,
8,
323,
26953,
13,
4314,
7766,
1520,
304,
67757,
323,
28672,
11822,
13,
1221,
44322,
6522,
374,
9511,
12,
37295,
323,
7612,
17274,
889,
649,
6920,
704,
9256,
1778,
439,
11850,
50805,
11,
24794,
11,
369,
10784,
2130,
82,
11,
15372,
490,
21846,
323,
1023,
26953,
13,
35802,
505,
9511,
7194,
11,
279,
10374,
389,
41377,
13,
2009,
4522,
11,
323,
20958,
7241,
374,
5199,
13,
14636,
11,
1920,
323,
44279,
19647,
527,
48810,
28598,
3769,
11850,
6067,
311,
5376
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
42172,
660,
3769,
11850,
7241,
374,
264,
961,
315,
279,
3769,
11850,
5064,
13,
95823,
7384,
11850,
7241,
5764,
264,
17226,
2134,
315,
3956,
1778,
439,
59412,
38424,
11,
20599,
1105,
320,
21470,
439,
19671,
11,
95480,
11,
29551,
11,
13587,
11,
1776,
266,
11,
323,
8957,
8,
323,
26953,
13,
4314,
7766,
1520,
304,
67757,
323,
28672,
11822,
13,
1221,
44322,
6522,
374,
9511,
12,
37295,
323,
7612,
17274,
889,
649,
6920,
704,
9256,
1778,
439,
11850,
50805,
11,
24794,
11,
369,
10784,
2130,
82,
11,
15372,
490,
21846,
323,
1023,
26953,
13,
35802,
505,
9511,
7194,
11,
279,
10374,
389,
41377,
13,
2009,
4522,
11,
323,
20958,
7241,
374,
5199,
13,
14636,
11,
1920,
323,
44279,
19647,
527,
48810,
28598,
3769,
11850,
6067,
311,
5376,
-100
] |
\section{Introduction}
In Riemannian geometry, various regularity results for curvature tensors may be obtained via harmonic coordinate systems. We recall the basic idea following \cite{Besse}, \cite{DK}, \cite{Taylor_isometries}.
Let $(M,g)$ be an $n$-dimensional Riemannian manifold, and let $(x^1, \ldots, x^n)$ be a local coordinate system. The Ricci tensor of $g$ has the expression
$$
R_{ab} = -\frac{1}{2} \Delta g_{ab} + \frac{1}{2} (\partial_a \Gamma_b + \partial_b \Gamma_a) + \text{lower order terms,}
$$
where $\Delta$ is the Laplace-Beltrami operator, $\Gamma^l = g^{ab} \Gamma_{ab}^l$, and $\Gamma_l=g_{la}\Gamma^a$. One also has
$$
\Gamma^l = -\Delta x^l.
$$
If the coordinate system is harmonic, in the sense that $\Delta x^l = 0$ for all $l$, then the Ricci tensor becomes an elliptic operator. Thus by elliptic regularity, if the Ricci tensor is smooth in harmonic coordinates, then also the metric is smooth in these coordinates. In particular, if the Riemann curvature tensor of a low regularity metric vanishes, this implies that the metric is smooth in harmonic coordinates and thus locally flat by classical arguments.
The Ricci tensor is of course invariant under diffeomorphisms, and these diffeomorphisms correspond to different gauges for the equation $\mathrm{Ric}(g) = h$. The choice of harmonic coordinates may be viewed as a local gauge condition that results in an elliptic equation. In this article we give similar local gauge conditions for the ellipticity of conformal curvature tensors, based on systems of $n$-harmonic coordinates. We say that a function $u$ in $(M,g)$ is $p$-harmonic ($1 < p < \infty$) if
$$
\delta(\abs{du}^{p-2} du) = 0.
$$
Here $\abs{\,\cdot\,}$ is the $g$-norm and $\delta$ is the codifferential. A local coordinate system is called $p$-harmonic if each coordinate function is $p$-harmonic (the case $p=2$ of course corresponds to the usual harmonic coordinates).
In the earlier article \cite{LiimatainenSalo}, we established the existence of $p$-harmonic coordinate systems for $1 < p < \infty$ on any Riemannian manifold with $C^{r}$, $r>1$, metric tensor. In conformal geometry, the case $p=n$ is special since the class of $n$-harmonic functions is preserved under conformal transformations. This fact was used in \cite{LiimatainenSalo} to study the regularity of such maps: if one fixes $n$-harmonic coordinate systems both in the domain and target manifold, the components of a conformal mapping will solve an elliptic equation. Thus $n$-harmonic coordinates may be considered as a gauge condition for ellipticity in the regularity problem for conformal transformations. In any $n$-harmonic coordinate system, the following \emph{$n$-harmonic gauge condition} is valid \cite{LiimatainenSalo}:
\begin{equation} \label{nharmonic_gauge_condition}
\Gamma^k = -\frac{n-2}{2} \frac{g^{kr} g^{ka} g^{kb}}{g^{kk}} \partial_r g_{ab}.
\end{equation}
We now recall the definition of conformal curvature tensors. If $(M,g)$ is an $n$-dimensional Riemannian manifold, write $R_{abcd}$, $R_{ab}$, and $R$ for the Riemann curvature tensor, Ricci tensor, and scalar curvature, respectively. The Schouten tensor is defined as
$$
P_{ab} = \frac{1}{n-2} \left( R_{ab} - \frac{R}{2(n-1)} g_{ab} \right).
$$
The Weyl tensor of $(M,g)$ is the $4$-tensor
$$
W_{abcd} = R_{abcd} + P_{ac} g_{bd} - P_{bc} g_{ad} + P_{bd} g_{ac} - P_{ad} g_{bc},
$$
the Cotton tensor is the $3$-tensor
$$
C_{abc} = \nabla_a P_{bc} - \nabla_b P_{ac},
$$
and the Bach tensor is the $2$-tensor
$$
B_{ab}=\nabla^k\nabla^lW_{akbl}+\frac{1}{2}R^{kl}W_{akbl}.
$$
We also consider the Fefferman-Graham obstruction tensor
$$
\mathcal{O}_{ab}=\frac{1}{n-3}\Delta^{n/2-2}\nabla^k\nabla^lW_{akbl}+\text{lower order terms,}
$$
where $\Delta=\nabla^i\nabla_i$ and $n \geq 4$ is even. If $n=4$ then $\mathcal{O}_{ab} = B_{ab}$. These tensors have the following behavior under conformal scaling in various dimensions: $W(cg) = c W(g)$ for $n \geq 4$, $C(cg) = C(g)$ for $n=3$, and $\mathcal{O}(cg) = c^{-\frac{n-2}{2}} \mathcal{O}(g)$ for $n \geq 4$ even. See~\cite{AcheViaclovsky}, \cite{Bach}, \cite{Besse}, \cite{Der}, \cite{FG}, \cite{FGbook}, \cite{Tian} for additional information on these tensors.
If $T$ is one of the above tensors, the next result shows that the equation $T(g) = h$ becomes elliptic under two natural local gauge conditions: one writes both sides of the equation in $n$-harmonic coordinates and considers the conformally normalized metric $\hat{g}_{jk} = \abs{g}^{-1/n} g_{jk}$ with determinant one. Here $\abs{g} = \det{g_{jk}}$, and we use that $n$-harmonic coordinates for $g$ are also $n$-harmonic coordinates for the conformal metric $\hat{g}$.
\begin{thm} \label{thm_main_ellipticity}
Let $(M,g)$ be a smooth $n$-dimensional Riemannian manifold. The Weyl, Cotton, Bach, and Fefferman-Graham obstruction tensors are elliptic operators in $n$-harmonic coordinates, in the sense that after applying both the $n$-harmonic gauge condition \eqref{nharmonic_gauge_condition} and the condition $|\hat{g}|=1$, the linearizations of the resulting operators at $\hat{g}$ are elliptic.
\end{thm}
After interpreting the conformal curvature tensors of low regularity metrics in a suitable sense, elliptic regularity results will follow readily. The regularity conditions will be given in terms of tensors $W_{abc\phantom{d}}^{\phantom{abc}d}$, $C_{abc}$, $\abs{g}^{\frac{n-2}{2n}}\mathcal{O}_{ab}$ which are invariant in conformal scaling $g \mapsto cg$. We use the notation $C_*^r$ for the Zygmund spaces~\cite{T3}.
\begin{thm} \label{thm_main_regularity}
Let $M$ be a smooth $n$-dimensional manifold, and let $g \in C^r_*$ in some system of local coordinates.
\begin{enumerate}
\item[(a)]
If $n \geq 4$, $r > 1$, and $W_{abc\phantom{d}}^{\phantom{abc}d} \in C^s_*$ for some $s > r-2$ in $n$-harmonic coordinates, then $\abs{g}^{-1/n} g_{jk} \in C^{s+2}_*$ in these coordinates.
\item[(b)]
If $n = 3$, $r > 2$, and $C_{abc} \in C^s_*$ for some $s > r-3$ in $n$-harmonic coordinates, then $\abs{g}^{-1/n} g_{jk} \in C^{s+3}_*$ in these coordinates.
\item[(c)]
If $n \geq 4$ is even, $r > n-1$, and $\abs{g}^{\frac{n-2}{2n}}\mathcal{O}_{ab} \in C^s_*$ for some $s > r-n$ in $n$-harmonic coordinates, then $\abs{g}^{-1/n} g_{jk} \in C^{s+n}_*$ in these coordinates.
\end{enumerate}
\end{thm}
Combining the previous theorem with classical results for $C^3$ metrics, one obtains conditions for local conformal flatness of low regularity metrics via the vanishing of Weyl and Cotton tensors.
\begin{thm} \label{thm_main_conformalflatness}
Let $M$ be a smooth $n$-dimensional manifold, and let $g\in C^r_*$ in some system of local coordinates defined near $p \in M$.
\begin{enumerate}
\item[(a)]
If $n \geq 4$, $r > 1$, and if $W_{abcd} = 0$ near $p$, then $g_{jk} = c \delta_{jk}$ for some positive function $c \in C^r_*$ in some $n$-harmonic coordinates near $p$.
\item[(b)]
If $n = 3$, $r > 2$, and if $C_{abc} = 0$ near $p$, then $g_{jk} = c \delta_{jk}$ for some positive function $c \in C^r_*$ in some $n$-harmonic coordinates near $p$.
\item[(c)]
If $n \geq 4$ is even, $r > n-1$, and if $\mathcal{O}_{ab} = 0$ near $p$, then $\abs{g}^{-1/n} g_{jk}$ is $C^{\infty}$ in any system of $n$-harmonic coordinates near $p$.
\end{enumerate}
\end{thm}
There are a number of results in conformal geometry that employ various gauges to obtain elliptic or parabolic regularity and existence results. The works \cite{AcheViaclovsky}, \cite{Anderson}, \cite{Helliwell}, \cite{Tian} involve constant scalar curvature gauges, sometimes obtained via the solution of the Yamabe problem \cite{LeeParker}, and study asymptotically locally Euclidean manifolds with obstruction flat metrics or boundary regularity of conformally compact Einstein metrics. In~\cite{BahuaudHelliwell} a version of the DeTurck trick is used to show that certain analogues of the Ricci flow, including a modified flow involving the obstruction tensor, are locally well posed. In~\cite{GurskyViaclovsky1}, \cite{GurskyViaclovsky2} quadratic curvature functionals are studied with an emphasis on the structure of the space of their critical metrics. In these papers the corresponding Euler-Lagrange equations become elliptic via suitable gauge conditions.
Let us describe an argument from \cite{Anderson}, \cite{Helliwell}, \cite{Tian} for Bach flat metrics with $n=4$. Choosing a conformal metric with constant scalar curvature, the equation of Bach flatness for the conformally scaled metric reads
$$
\nabla^k \nabla_k R_{ab} + \text{lower order terms} = 0.
$$
This becomes a fourth order elliptic equation in harmonic coordinates for the conformally scaled metric. This fact could be used to give another proof of an analogue of Theorem~\ref{thm_main_regularity}, if a solution to the (local) Yamabe problem for sufficiently low regularity metrics is provided.
We thus have two possible sets of gauge conditions for ellipticity of conformal curvature tensors: ($n$-harmonic coordinates + determinant one) and (constant scalar curvature + harmonic coordinates). Let us compare these briefly. The first approach works for $C^{1,\alpha}$ metrics with $\alpha > 0$ and relies on an $n$-harmonic coordinate system. In \cite{LiimatainenSalo} such coordinates $(u^1,\ldots,u^n)$ near $p$ were constructed by choosing some smooth coordinates $(x^1,\ldots,x^n)$ near $p$ and then solving for each $j$ the Dirichlet problem
$$
\delta(\abs{du^j}^{n-2} du^j) = 0 \text{ in } B(p,\varepsilon), \quad u^j|_{\partial B(p,\varepsilon)} = x^j.
$$
An easy variational argument shows that this problem has a unique solution. The point is to show that $(u^1,\ldots,u^n)$ is a $C^1$ diffeomorphism if $\varepsilon$ is small enough, and this relies on standard regularity theory for quasilinear equations (essentially the fact that any $p$-harmonic function is $C^{1,\alpha}$ regular). Given $n$-harmonic coordinates, the conformal normalization (determinant one) is trivial.
The second approach based on a constant scalar curvature gauge requires solving the Yamabe problem (a semilinear equation with a constraint) at least in a small neighborhood; the global Yamabe problem is solvable for $C^{1,1}$ metrics (see \cite[Section VII.7]{ChoquetBruhat}), and we refer to \cite{Escobar}, \cite{HG}, \cite{Ma} for versions of the local problem. The recent paper \cite{HG} deals with $W^{1,p}$, $ p > n$, metrics. Given a conformal metric with constant scalar curvature, the other gauge condition involves a standard harmonic coordinate system.
A possible benefit of the $n$-harmonic coordinate approach is the similarity to harmonic coordinates in Riemannian geometry. In fact, it appears that $n$-harmonic coordinates are a natural generalization of harmonic coordinates in conformal geometry, and other Riemannian applications of harmonic coordinates might have conformal analogues. On the other hand, $n$-harmonic coordinates exist only locally, and if global gauge conditions are required then scalar curvature gauges are available via the Yamabe problem. Finally, $n$-harmonic coordinates exist at least for $C^{1,\alpha}$ metrics whereas global results for the Yamabe problem in the literature seem to require metrics with two derivatives. One motivation for this work was to find characterizations of local conformal flatness beyond the classical $C^3$ case, and it is an interesting question (also asked in \cite[Section 2.7]{IwaniecMartin}) if one can have such characterizations for very low regularity metrics.
\vspace{12pt}
\noindent {\bf Acknowledgements.}
T.L.~was supported in part by the Finnish National Graduate School on Mathematics and its Applications, and M.S.~is partly supported by the Academy of Finland and an ERC Starting Grant. The second author is grateful to Spyros Alexakis, Michael Eastwood, Robin Graham and Gantumur Tsogtgerel for helpful discussions, and in particular to Robin Graham for pointing out several useful references.
\begin{comment}
equation is considered. There instead of fixing the conformal invariance by constant scalar curvature, they introduce a term that is critical for Einstein metrics, but breaks the conformal invariance.
Conformally compact Einstein metric is conformal to an Einstein metric and thus are Bach flat~\cite{}. These papers use this fact to stydy the regularity of such metrics by casting the problem into an elliptic problem in coordinates of Bach flatness. For example,
The works~\cite{Anderson, Helliwell} study boundary regularity of conformally compact Einstein metrics in even dimension $\geq 4$. These papers use scalar curvature to break the conformal invariance of the questions they address and (boundary adapted) harmonic coordinates.
If a conformally invariant problem is written for the scaled constant scalar curvature metric, the scalar curvature acts as a gauge condition. For example in dimension $4$ the the conformally invariant Bach-flat equation written for a constant scalar curvature metric reads
Works on regularity of ALE~\cite{Anderson, Helliwell}.
The work~\cite{BauhaudHelliwell} studies a parabolic problem.
The gauge breaking method does not require additional regularity of the metric.
We mention \cite{AcheViaclovsky}, \cite{Anderson}, \cite{BahuaudHelliwell}, \cite{GurskyViaclovsky1}, \cite{GurskyViaclovsky2}, \cite{Helliwell}, \cite{Tian}. The first two considers. The work~\cite{} proves certain. The works~\cite{Tian, AcheViaclovsky} consider Bach-flat and obstruction flat assymptotically locally Euclidean metrics. The first one in particular, \cite{Tian} gives a local regularity result for a class of Bach flat metrics that have constant scalar curvature.
\end{comment}
\section{Symbol computations} \label{section_symbolcomputations}
In this section we assume that the metric is smooth ($=C^{\infty}$) in some system of local coordinates. We start by recalling standard local coordinate formulas. The Christoffel symbols are given by
$$
\Gamma_{ab}^k = \frac{1}{2} g^{kl}(\partial_a g_{bl} + \partial_b g_{al} - \partial_l g_{ab}).
$$
Define
$$
\Gamma^k = g^{ab} \Gamma_{ab}^k, \qquad \Gamma_k = g_{kl} \Gamma^l.
$$
Noting the identity $g^{ab} \partial_l g_{ab} = \partial_l(\log\abs{g})$, we see that
\begin{equation*}
\Gamma^k = -\partial_l g^{kl} - \frac{1}{2} g^{kl} \partial_l(\log\abs{g}), \qquad
\Gamma_j = g^{kl} \partial_l g_{jk} - \frac{1}{2} \partial_j(\log\abs{g}).
\end{equation*}
This also implies that
$$
\Gamma_{ab}^a = \frac{1}{2} \partial_b(\log\abs{g}).
$$
The Riemann curvature tensor is given by
$$
R_{abcd} = \langle (\nabla_a \nabla_b - \nabla_b \nabla_a) \partial_c, \partial_d \rangle.
$$
Here $\nabla_a \nabla_b \partial_c = \nabla_a (\Gamma_{bc}^m \partial_m) = \partial_a \Gamma_{bc}^m \partial_m + \Gamma_{bc}^m \Gamma_{am}^r \partial_r$, so that
\begin{align*}
R_{abcd} = \partial_a \Gamma_{bc}^m g_{md} + \Gamma_{bc}^m \Gamma_{am}^r g_{rd} - \partial_b \Gamma_{ac}^m g_{md} - \Gamma_{ac}^m \Gamma_{bm}^r g_{rd}.
\end{align*}
The Ricci tensor, $R_{bc} = R_{abc}^{\phantom{abc}a}$, is given by
\begin{align*}
R_{bc} &= \partial_a \Gamma_{bc}^a - \partial_b \Gamma_{ac}^a + \Gamma_{bc}^m \Gamma_{am}^a - \Gamma_{ac}^m \Gamma_{bm}^a \\
&= \partial_a \Gamma_{bc}^a - \Gamma_{ac}^m \Gamma_{bm}^a - \frac{1}{2} \partial_{bc}(\log\abs{g}) + \frac{1}{2} \Gamma_{bc}^m \partial_m(\log\abs{g}).
\end{align*}
The scalar curvature is $R = g^{bc} R_{bc}$. The Schouten, Weyl, Cotton and Bach tensors were defined in the introduction. By using Bianchi identities as in \cite{Tian}, the Cotton and Bach tensors can also be written as
\begin{gather*}
(3-n) C_{abc} = \nabla^l W_{abcl}, \\
B_{ab} = (3-n)(- \nabla^k \nabla_k P_{ab} + \nabla^k \nabla_a P_{bk}) + \frac{1}{2} R^{kl} W_{akbl}.
\end{gather*}
Below, we write $T_k$ for quantities that depend smoothly on components of the metric and their derivatives up to order $k$. We will also write
$$
L = g^{ab} \partial_{ab}, \qquad L^2 = g^{ab} g^{cd} \partial_{abcd}
$$
for the principal parts of the Laplace-Beltrami operator and its square.
\subsection{Bach tensor}
All ellipticity results in this paper ultimately reduce to the fact that the Bach tensor is elliptic in $n$-harmonic coordinates when acting on metrics with determinant one. In the following, if $T=T(g)$ is a nonlinear differential operator acting on metrics, we denote by $\sigma(T)$ the principal symbol of its linearization at $g$.
\begin{lemma} \label{lemma_bach_computation}
The components of the Bach tensor satisfy
\begin{align*}
\frac{2 (n-2)}{3-n} B_{ab} = L^2 &(g_{ab}) - L (\partial_a \Gamma_b + \partial_b \Gamma_a) \\
&+ \frac{n-2}{n-1} \partial_{abl} \Gamma^l + \frac{1}{n-1} L(\partial_l \Gamma^l) g_{ab} + T_3
\end{align*}
in any local coordinate system in which $\abs{g}=1$
\end{lemma}
\begin{proof}
Assume that the metric satisfies $\abs{g}=1$ in a given system of local coordinates. Then
$$
R_{bc} = \partial_a \Gamma_{bc}^a + T_1, \qquad R = \partial_a \Gamma^a + T_1.
$$
The Schouten tensor satisfies
$$
(n-2) P_{ab} = \partial_l \Gamma_{ab}^l - \frac{1}{2(n-1)} (\partial_l \Gamma^l) g_{ab} + T_1.
$$
Recall that $\nabla_m F_{i_1 \ldots i_k} = (\nabla F)_{i_1 \ldots i_k m} = \partial_m F_{i_1 \ldots i_k} - \sum_{s=1}^k F_{i_1 \ldots p \ldots i_k} \Gamma_{m i_s}^p$. Therefore
$$
(n-2) \nabla_c P_{ab} = \partial_{cl} \Gamma_{ab}^l - \frac{1}{2(n-1)} (\partial_{cl} \Gamma^l) g_{ab} + T_2
$$
and
$$
(n-2) \nabla_d \nabla_c P_{ab} = \partial_{cdl} \Gamma_{ab}^l - \frac{1}{2(n-1)} (\partial_{cdl} \Gamma^l) g_{ab} + T_3.
$$
For the Bach tensor, we obtain
\begin{align*}
&\frac{n-2}{3-n} B_{ab} = (n-2) \left[ g^{km} \nabla_k \nabla_a P_{bm} - g^{km} \nabla_k \nabla_m P_{ab} \right] + T_2 \\
&= g^{km} \left[ \partial_{akl} \Gamma_{bm}^l - \partial_{klm} \Gamma_{ab}^l + \frac{1}{2(n-1)} \left[ (\partial_{klm} \Gamma^l) g_{ab} - (\partial_{akl} \Gamma^l) g_{bm} \right] \right] + T_3.
\end{align*}
Next we observe that
\begin{align*}
\partial_{klm} \Gamma_{ab}^l &= \frac{1}{2} \partial_{klm} \left[ g^{lr}(\partial_a g_{br} + \partial_b g_{ar} - \partial_r g_{ab}) \right] \\
&= \frac{1}{2} g^{lr} (\partial_{aklm} g_{br} + \partial_{bklm} g_{ar} - \partial_{rklm} g_{ab}) + T_3.
\end{align*}
This implies
\begin{align*}
&2g^{km} (\partial_{akl} \Gamma_{bm}^l - \partial_{klm} \Gamma_{ab}^l) \\
&= g^{km} g^{lr} \left[ \partial_{aklm} g_{br} + \partial_{bkla} g_{mr} - \partial_{rkla} g_{mb} \r.\\
&\ \ \ \l. -\partial_{aklm} g_{br} - \partial_{bklm} g_{ar} + \partial_{rklm} g_{ab} \right] + T_3 \\
&= L^2 (g_{ab}) - L(g^{km} \partial_{ka} g_{mb}) - L(g^{lr} \partial_{bl} g_{ar}) + g^{km} g^{lr} \partial_{bkla} g_{mr} + T_3 \\
&= L^2 (g_{ab}) - L(\partial_a \Gamma_b + \partial_b \Gamma_a) + \partial_{abl} \Gamma^l + T_3.
\end{align*}
In the last step we used that $\Gamma_b = g^{km} \partial_k g_{mb}$ when $\abs{g}=1$, and $\Gamma^l = g^{lr} \Gamma_r$. For the remaining terms in the Bach tensor, we use that
$$
g^{km} \left[ (\partial_{klm} \Gamma^l) g_{ab} - (\partial_{akl} \Gamma^l) g_{bm} \right] = L(\partial_l \Gamma^l) g_{ab} - \partial_{abl} \Gamma^l + T_3.
$$
Collecting these facts, we have proved the lemma.
\end{proof}
Notice that in any harmonic coordinate system in which $\abs{g}=1$, the Bach tensor would have the form
$$
2(n-2) B_{ab} = (3-n)L^2(g_{ab}) + T_3.
$$
The operator on the right is obviously elliptic. However, in general it is not clear how to find harmonic coordinates with $\abs{g}=1$ even after conformal scaling, owing to the fact that the equations $\Gamma^k = 0$ for harmonic coordinates are not conformally invariant. This is where $n$-harmonic coordinates become useful: they allow the conformal normalization $\abs{g}=1$, and the Bach tensor turns out to be elliptic in these coordinates.
\begin{lemma} \label{lemma_bach_nharmonic
The components of the Bach tensor satisfy
\begin{multline*}
\frac{2 (n-2)}{3-n} B_{ab} = L^2 (g_{ab}) - L (\partial_a \tilde{\Gamma}_b + \partial_b \tilde{\Gamma}_a) \\
+ \frac{n-2}{n-1} \partial_{abl} \tilde{\Gamma}^l + \frac{1}{n-1} L(\partial_l \tilde{\Gamma}^l) g_{ab} + T_3
\end{multline*}
in any $n$-harmonic coordinate system with $\abs{g}=1$, where $\tilde{\Gamma}^k$ is as in \eqref{nharmonic_gauge_condition}:
$$
\tilde{\Gamma}^k = -\frac{n-2}{2} \frac{g^{kr} g^{ka} g^{kb}}{g^{kk}} \partial_r g_{ab}.
$$
\end{lemma}
\begin{proof}
Follows from Lemma \ref{lemma_bach_computation} and the fact that $\Gamma^k = \tilde{\Gamma}^k$ in $n$-harmonic coordinates (see \cite[Remark after Theorem 2.1]{LiimatainenSalo}).
\end{proof}
Consider the right hand side operator in Lemma \ref{lemma_bach_nharmonic} acting on symmetric positive definite matrix functions, and denote by $Q = Q_g$ the principal part of the linearization of this operator at $g$. Then $Q$ is the principal part of the following linear operator, acting on symmetric matrix functions $h$ by
\begin{multline*}
h_{ab} \mapsto L^2 (h_{ab}) - L \left[ \partial_a (g_{bl} \tilde{\Gamma}^l(h)) + \partial_b (g_{al} \tilde{\Gamma}^l(h)) \right] \\
+ \frac{n-2}{n-1} \partial_{abl} \tilde{\Gamma}^l(h) + \frac{1}{n-1} L(\partial_l \tilde{\Gamma}^l(h)) g_{ab}
\end{multline*}
where $L = L_g = g^{ab} \partial_{ab}$, and $\tilde{\Gamma}^k = \tilde{\Gamma}^k_g$ is the operator
$$
\tilde{\Gamma}^k(h) = -\frac{n-2}{2} \frac{g^{kr} g^{ka} g^{kb}}{g^{kk}} \partial_r h_{ab}.
$$
\begin{lemma}\label{ellipt_calc}
$Q$ is elliptic of order $4$ in dimensions $n \geq 3$.
\end{lemma}
\begin{proof}
The principal symbol of $Q$, acting on a symmetric matrix function $h$, is given by
\begin{multline*}
(q(\xi) h)_{ab} = \abs{\xi}^4 h_{ab} - \abs{\xi}^2 \left[ \xi_a g_{bl} + \xi_b g_{al} \right] \sigma(-i\tilde{\Gamma}^l)(h) \\
+ \frac{n-2}{n-1} \xi_a \xi_b \xi_l \sigma(-i\tilde{\Gamma}^l)(h)+ \frac{1}{n-1} \abs{\xi}^2 \xi_l \sigma(-i\tilde{\Gamma}^l)(h) g_{ab}
\end{multline*}
where
$$
\sigma(-i\tilde{\Gamma}^k)(h) = -\frac{n-2}{2} \xi^k \frac{h^{kk}}{g^{kk}}.
$$
Here, the norms $\abs{\,\cdot\,}$ and the raising and lowering of indices are taken with respect to the metric $g$. We also have
\begin{multline*}
(q(\xi) h)^{ab} = \abs{\xi}^4 h^{ab} - \abs{\xi}^2 \left[ \xi^a \sigma(-i\tilde{\Gamma}^b)(h) + \xi^b \sigma(-i\tilde{\Gamma}^a)(h) \right] \\
+ \frac{n-2}{n-1} \xi^a \xi^b \xi_l \sigma(-i\tilde{\Gamma}^l)(h)+ \frac{1}{n-1} \abs{\xi}^2 \xi_l \sigma(-i\tilde{\Gamma}^l)(h) g^{ab}.
\end{multline*}
Taking $a=b$, this gives
\begin{multline*}
(q(\xi) h)^{aa} = \abs{\xi}^4 h^{aa} - 2 \abs{\xi}^2 \xi^a \sigma(-i\tilde{\Gamma}^a)(h) \\
+ \frac{n-2}{n-1} (\xi^a)^2 \xi_l \sigma(-i\tilde{\Gamma}^l)(h)+ \frac{1}{n-1} \abs{\xi}^2 \xi_l \sigma(-i\tilde{\Gamma}^l)(h) g^{aa} \\
= \left( g^{aa} \abs{\xi}^2 + (n-2) (\xi^a)^2 \right) \left[ \abs{\xi}^2 \frac{h^{aa}}{g^{aa}} - \frac{n-2}{2(n-1)} \sum_{l=1}^n \xi_l \xi^l \frac{h^{ll}}{g^{ll}} \right].
\end{multline*}
If $\xi \neq 0$ and if $q(\xi)h = 0$, then also
$$
\frac{h^{aa}}{g^{aa}} - \frac{n-2}{2(n-1)} \sum_{l=1}^n \frac{\xi_l \xi^l}{\abs{\xi}^2} \frac{h^{ll}}{g^{ll}} = 0
$$
for all $a = 1, \ldots, n$. This implies that
$$
\frac{h^{11}}{g^{11}} = \ldots = \frac{h^{nn}}{g^{nn}} = \lambda
$$
for some function $\lambda$, and therefore
$$
\left( 1 - \frac{n-2}{2(n-1)} \right) \lambda = 0.
$$
Thus $h^{aa} = 0$ for all $a$, so $\sigma(-i\tilde{\Gamma}^a)(h) = 0$ for all $a$ and $(q(\xi) h)^{ab} = \abs{\xi}^4 h^{ab} = 0$ for all $a, b$. It follows that $h = 0$, showing that $Q$ is elliptic.
\end{proof}
We are now ready to prove the main ellipticity result.
\begin{proof}[Proof of Theorem \ref{thm_main_ellipticity}]
Let $(M,g)$ be a smooth Riemannian manifold, fix an $n$-harmonic coordinate system, and let $\hat{g}_{jk} = \abs{g}^{-1/n} g_{jk}$ in these coordinates. Using the conformal invariance of the $n$-harmonic equation, our coordinate system is $n$-harmonic also with respect to the conformal metric $\hat{g}$. Let $\hat{B}_{ab}$ be the Bach tensor for $\hat{g}$ in $n$-harmonic coordinates after applying the $n$-harmonic gauge condition \eqref{nharmonic_gauge_condition} and the condition $\abs{\hat{g}} = 1$. It follows from Lemmas \ref{lemma_bach_computation}--\ref{ellipt_calc} that the principal part of the linearization of $\hat{B}_{ab}$ is elliptic in dimensions $n \geq 4$.
Moving on to the Weyl tensor, the formula $B_{ab}=\nabla^k\nabla^l W_{akbl}+\frac{1}{2}R^{kl}W_{akbl}$ implies that
$$
\xi^k \xi^l \sigma(\hat{W}_{akbl})(\xi)h = -\sigma(\hat{B}_{ab})(\xi)h
$$
where $\hat{W}$ is the Weyl tensor of $\hat{g}$ after applying the gauge conditions, and $\sigma$ denotes the principal symbol of the linearization applied to a matrix function $h$. Thus $\sigma(\hat{W}_{akbl})(\xi)h = 0$ implies $h = 0$ by the ellipticity of $\hat{B}_{ab}$, showing that $\hat{W}_{abcd}$ is overdetermined elliptic (its principal symbol is injective). The ellipticity of Cotton and obstruction tensors follow in a similar way from the identities $(3-n) C_{abc} = \nabla^l W_{abcl}$, $(n-3) \mathcal{O}_{ab}=\Delta^{n/2-2}\nabla^k\nabla^lW_{akbl}+T_{n-1}$.
\end{proof}
\section{Elliptic regularity results}
We now consider low regularity Riemannian metrics, and establish elliptic regularity results for conformal curvature tensors. The Weyl tensor will be considered in detail and the arguments for the other tensors will be sketched. We first assume that
$$
g_{jk} \in W^{1,2} \cap L^{\infty}
$$
in some system of local coordinates near a point. (In this section all function spaces are assumed to be of the local variety near a point, that is, we write $W^{1,2}$ instead of $W^{1,2}_{\mathrm{loc}}(U)$ etc.) This seems to be a minimal assumption for defining the Weyl tensor: the set $W^{1,2} \cap L^{\infty}$ is an algebra under pointwise multiplication \cite{KatoPonce}, \cite{BadrBernicotRuss}, and therefore $g^{jk}, \abs{g} \in W^{1,2} \cap L^{\infty}$. We see that
\begin{gather*}
\Gamma_{ab}^c \in L^2, \\
R_{abc}^{\phantom{abc}d} = \partial_a \Gamma_{bc}^d - \partial_b \Gamma_{ac}^d + \Gamma_{bc}^m \Gamma_{am}^d - \Gamma_{ac}^m \Gamma_{bm}^d \in W^{-1,2} + L^1, \\
R_{bc} = R_{abc}^{\phantom{abc}a} \in W^{-1,2} + L^1.
\end{gather*}
Since
$$
P_{ab} = \frac{1}{n-2} \left[ R_{ab} - \frac{1}{2(n-1)} g^{rs} R_{rs} g_{ab} \right],
$$
we have
\begin{multline*}
W_{abc}^{\phantom{abc}d} = R_{abc}^{\phantom{abc}d} + P_{ac} \delta_b^{\phantom{b}d} - P_{bc} \delta_a^{\phantom{a}d} + P_{bm} g^{md} g_{ac} - P_{am} g^{md} g_{bc} \\
= R_{abc}^{\phantom{abc}d} + \frac{1}{n-2} \left[ R_{ac} \delta_b^{\phantom{b}d} - R_{bc} \delta_a^{\phantom{a}d} + R_{bm} g^{md} g_{ac} - R_{am} g^{md} g_{bc} \right] \\
+ \frac{1}{(n-2)(n-1)} \left[ g^{rs} g_{bc} R_{rs} \delta_a^{\phantom{a}d} - g^{rs} g_{ac} R_{rs} \delta_b^{\phantom{b}d} \right].
\end{multline*}
Now, since multiplication by an $W^{1,2} \cap L^{\infty}$ function maps $W^{1,q}$ to $W^{1,2}$ for any $q > n$, it also maps $W^{-1,2}$ to $W^{-1,q'}$, and we have
\begin{gather*}
g^{ij} g_{kl} R_{rs} \in W^{-1,q'} + L^1.
\end{gather*}
This shows that if $g_{jk} \in W^{1,2} \cap L^{\infty}$ in some system of local coordinates, then one can make sense of the components $W_{abc}^{\phantom{abc}d}$ of the Weyl tensor as elements in $W^{-1,q'} + L^1$ in these coordinates for any $q > n$. It is easy to see that also $R_{abcd}, W_{abcd} \in W^{-1,q'} + L^1$ in this case, and the identity $W(cg) = cW(g)$ remains true if $c, g_{jk} \in W^{1,2} \cap L^{\infty}$.
By similar arguments, if $g_{jk} \in W^{2,2} \cap W^{1,\infty}$ in some local coordinates, the components $C_{abc}$ of the Cotton tensor may be interpreted as elements of $W^{-1,2}$ and one has $C(cg) = C(g)$ if $c \in W^{2,2} \cap W^{1,\infty}$ and $n=3$. Moreover, if $g_{jk} \in W^{n-1,2} \cap W^{n-2,\infty}$, then the Fefferman-Graham obstruction tensor satisfies $\mathcal{O}_{ab} \in W^{-1,2}$ and $\mathcal{O}(cg) = c^{\frac{n-2}{2}} \mathcal{O}(g)$ for $n \geq 4$ even. We omit the details of these computations.
We will need the following elliptic regularity result, which is, after using suitable cutoffs and extensions, a consequence of \cite[Theorem 14.4.2]{T3} (the argument also applies to overdetermined elliptic operators). For completeness, the details are given in Appendix \ref{app}.
\begin{prop} \label{elliptic_regularity_differential_operator}
Let $B \subset \mathbb{R}^n$ be a ball, and let $p(x,D) = \sum_{\abs{\alpha} \leq m} p_{\alpha}(x) D^{\alpha}$ be an $M \times N$ matrix differential operator with coefficients in $C^r_*(B)$ where $r > 0$. Assume that $p(x,D)$ is overdetermined elliptic in the sense that its principal symbol $p_m(x,\xi)$ is injective for $x \in B$ and $\xi \neq 0$. If in the sense of distributions
$$
p(x,D) u = f \quad \text{in } B
$$
where $u \in C^{m-r+\varepsilon}_*(B)$ for some $\varepsilon > 0$ and $f \in C^s_*(B)$ with $-r < s < r$, then $u \in C^{m+s}_*(B)$.
\end{prop}
The next result gives a symbol computation for the Weyl tensor with low regularity metric.
\begin{lemma} \label{weyl_princip}
Let $g_{jk} \in C^r_*$, $r > 1$, in some system of local coordinates, and assume that $\abs{g}=1$. The principal symbol $\sigma(W_{abcd})$ of the linearization of the Weyl tensor at $g$ satisfies
\begin{multline}\label{weyl_contr}
\xi^a \xi^d \sigma(W_{abcd})h=\frac{n-3}{2(n-2)} \Big[ |\xi|^4 h_{bc} - |\xi|^2 \left( \xi_b\sigma(-i\Gamma_c)h + \xi_c\sigma(-i\Gamma_b)h \right) \\
+\frac{n-2}{n-1} \xi_b \xi_c \xi_l \sigma(-i\Gamma^l)h + \frac{1}{n-1} |\xi|^2 \left( \xi_l \sigma(-i\Gamma^l)h \right) g_{bc} \Big].
\end{multline}
\end{lemma}
\begin{proof}
If $g$ were sufficiently smooth, for instance $C^4$, we could readily use the formula $B_{ab}=\nabla^k\nabla^lW_{akbl}+\frac{1}{2}R^{kl}W_{akbl}$ to have
$$
\xi^a \xi^d \sigma(W_{abcd})h=-\sigma(B_{bc})h,
$$
which together with Lemma~\ref{lemma_bach_computation} would yield the claim. For $C^r_*$ metrics, $r > 1$, we have to be more careful because the derivation of the different formulas for the Bach tensor uses the Bianchi identities
$$
\nabla^d R_{abcd} = \nabla_aR_{bc}-\nabla_bR_{ac}, \qquad \nabla^b R_{ab} = \frac{1}{2}\nabla_b R,
$$
that require more derivatives. We can however emulate the Bianchi identities on the symbol level using the equations
\begin{align}
\xi^d &\sigma(R_{abcd}+R_{ac}g_{bd}-R_{bc}g_{ad})=0, \label{Bianchi_emulated1} \\
\xi^a &\sigma(R_{ab}g_{cd}-\frac{1}{2}Rg_{ab}g_{cd})=0. \label{Bianchi_emulated2}
\end{align}
By the discussion earlier in this section, one can check that these identities are valid for $C^r_*$ metrics when $r > 1$. We now write the Weyl tensor as
\begin{multline*}
W_{abcd}=(R_{abcd}+R_{ac}g_{bd}-R_{bc}g_{ad})+\l(\frac{1}{n-2}-1\r)(R_{ac}g_{bd}-R_{bc}g_{ad}) \\
+\frac{1}{n-2}(R_{bd}g_{ac} -R_{ad}g_{bc})-\frac{R}{(n-1)(n-2)}(g_{ac}g_{bd}-g_{bc}g_{ad}) \\
=(R_{abcd}+R_{ac}g_{bd}-R_{bc}g_{ad})-\frac{n-3}{n-2}(R_{ac}g_{bd}-\frac{1}{2}Rg_{ac}g_{bd}) \\
+\frac{1}{n-2}(R_{bd}g_{ac} -\frac{1}{2}Rg_{bd}g_{ac}-R_{ad}g_{bc}+\frac{1}{2}Rg_{ad}g_{bc}) \\
+\frac{n-3}{n-2}R_{bc}g_{ad}-\frac{n-3}{2(n-2)}Rg_{ac}g_{bd} + \frac{1}{2(n-2)}(Rg_{bd}g_{ac}-Rg_{ad}g_{bc}). \\
-\frac{R}{(n-1)(n-2)}(g_{ac}g_{bd}-g_{bc}g_{ad})
\end{multline*}
Now, taking the symbol of the Weyl tensor in this form and contracting by $\xi^a\xi^d$ we have by the identities~\eqref{Bianchi_emulated1}, \eqref{Bianchi_emulated2} that
\begin{multline}\label{Wc}
\xi^a \xi^d \sigma(W_{abcd})h=-\frac{n-3}{2(n-2)}\Big[-2\abs{\xi}^2\sigma(R_{bc})h+\frac{n-2}{n-1}\xi_b\xi_c \sigma(R)h \\
+\frac{1}{n-1}\abs{\xi}^2g_{bc}\sigma(R) \Big].
\end{multline}
We have
$$
R_{ab} = -\frac{1}{2} \Delta g_{ab} + \frac{1}{2} (\partial_a \Gamma_b + \partial_b \Gamma_a) +T_1
$$
and consequently, for a metric $g$ with $\abs{g}=1$, it holds that
$$
R=\partial_a\Gamma^a +T_1.
$$
Substituting these formulas to~\eqref{Wc} yields the claim.
\end{proof}
\begin{proof}[Proof of Theorem \ref{thm_main_regularity}]
Let $g_{jk} \in C^r_*$, $r > 1$, in some system of local coordinates. By \cite[Theorem 2.1]{LiimatainenSalo} we know that $n$-harmonic coordinate systems exist near any point, and by \cite[Proposition 2.5]{LiimatainenSalo} the metric satisfies $g_{jk} \in C^r_*$ in $n$-harmonic coordinates.
Consider first the Weyl tensor. Let $n \geq 4$, $r > 1$, and $W_{abc}^{\phantom{abc}d} \in C^s_*$ for some $s > r-2$ in $n$-harmonic coordinates. Write $\hat{g} = \abs{g}^{-1/n} g_{jk}$ in these coordinates, so that
$$
\hat{g}_{jk} \in C^r_*, \qquad \abs{\hat{g}} = 1.
$$
By conformal invariance we have $W_{abc}^{\phantom{abc}d}(\hat{g}) = W_{abc}^{\phantom{abc}d}(g)$ in $n$-harmonic coordinates where the right hand side is in $C^s_*$. This is a second order system for $\hat{g}$ where the principal symbol of the linearization is injective after applying the $n$-harmonic gauge condition \eqref{nharmonic_gauge_condition} and the condition $\abs{\hat{g}}=1$, by Lemma \ref{weyl_princip} and the algebraic computation in Lemma \ref{ellipt_calc} (note that ellipticity of $W_{abc}^{\phantom{abc}d}$ is equivalent with that of $W_{abcd}$). Hence Proposition \ref{elliptic_regularity_differential_operator} applies. If $s < r$ we obtain $\hat{g}_{jk} \in C^{s+2}_*$ as required. If $s \geq r$ we initially only get $\hat{g}_{jk} \in C^{\tilde{r}+2}_*$ for any $\tilde{r} < r$, but iterating the argument finitely many times yields $\hat{g}_{jk} \in C^{s+2}_*$ and we are done.
The proof for the Cotton and Fefferman-Graham obstruction tensors follows in a similar way from the above arguments by using the identities $(3-n) C_{abc} = \nabla^l W_{abcl}$ and $(n-3) \mathcal{O}_{ab}=\Delta^{n/2-2}\nabla^k\nabla^lW_{akbl}+T_{n-1}$.
\end{proof}
\begin{proof}[Proof of Theorem \ref{thm_main_conformalflatness}]
Assume first that $g_{jk} \in C^r_*$ where $n \geq 4$, $r > 1$, and the Weyl tensor vanishes near some point of $M$. By Theorem \ref{thm_main_regularity} we know that the metric $\hat{g}_{jk} = \abs{g}^{-1/n} g_{jk}$ is $C^{\infty}$ in any system of $n$-harmonic coordinates. Since the Weyl tensor of $\hat{g}$ vanishes, classical arguments (see for example~\cite[Chapter 4]{Aubin}) show that there is a possibly different set of coordinates $\{y^a\}$ (for which we use indices $a$, $b$) where $\hat{g}_{ab} = \hat{c} \delta_{ab}$ for some positive $C^{\infty}$ function $\hat{c}$. Then $g_{ab} = c \delta_{ab}$ where $c = \abs{g}^{1/n} \hat{c}$ is in $C^r_*$. The coordinates $\{y^{a}\}$ are again $n$-harmonic~\cite[Proposition 2.6]{LiimatainenSalo}. The argument for Cotton and Fefferman-Graham tensors is analogous.
\end{proof}
| {
"redpajama_set_name": "RedPajamaArXiv"
} | 3,205 | [
128000,
59,
2879,
90,
38255,
633,
644,
432,
27960,
1036,
1122,
17484,
11,
5370,
5912,
488,
3135,
369,
83233,
78187,
1253,
387,
12457,
4669,
82341,
16580,
6067,
13,
1226,
19635,
279,
6913,
4623,
2768,
1144,
68175,
90,
33,
24201,
2186,
1144,
68175,
90,
18805,
2186,
1144,
68175,
90,
68236,
7037,
4512,
4108,
92,
382,
10267,
5035,
44,
22377,
15437,
387,
459,
400,
77,
3,
12,
43639,
278,
432,
27960,
1036,
1122,
73929,
11,
323,
1095,
5035,
87,
61,
16,
11,
1144,
509,
2469,
11,
865,
87267,
15437,
387,
264,
2254,
16580,
1887,
13,
578,
33652,
5979,
16000,
315,
400,
70,
3,
706,
279,
7645,
2355,
14415,
198,
49,
15511,
370,
92,
284,
482,
59,
38118,
90,
16,
15523,
17,
92,
1144,
20892,
342,
15511,
370,
92,
489,
1144
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
59,
2879,
90,
38255,
633,
644,
432,
27960,
1036,
1122,
17484,
11,
5370,
5912,
488,
3135,
369,
83233,
78187,
1253,
387,
12457,
4669,
82341,
16580,
6067,
13,
1226,
19635,
279,
6913,
4623,
2768,
1144,
68175,
90,
33,
24201,
2186,
1144,
68175,
90,
18805,
2186,
1144,
68175,
90,
68236,
7037,
4512,
4108,
92,
382,
10267,
5035,
44,
22377,
15437,
387,
459,
400,
77,
3,
12,
43639,
278,
432,
27960,
1036,
1122,
73929,
11,
323,
1095,
5035,
87,
61,
16,
11,
1144,
509,
2469,
11,
865,
87267,
15437,
387,
264,
2254,
16580,
1887,
13,
578,
33652,
5979,
16000,
315,
400,
70,
3,
706,
279,
7645,
2355,
14415,
198,
49,
15511,
370,
92,
284,
482,
59,
38118,
90,
16,
15523,
17,
92,
1144,
20892,
342,
15511,
370,
92,
489,
1144,
-100
] |
Лукиан Печерский (ум. 1243) — пресвитер, священномученик, живший в XIII веке.
Как и о многих подвижниках Печерского монастыря времён монголо-татарского нашествия, о священномученике Лукиане известно очень мало. Во время нашествия приняли мученическую кончину и некоторые из Печерских святых.
Во время Западного похода монголов под предводительством Батыя Лукиан был убит после взятия Киева войском Золотой Орды, о чём говорится на одной древней доске с иконой святого.
Впервые мощи подвижника указаны на карте Дальних пещер, предположительно относящейся к 1744 году: «преподобный Лукиян священномученик». На карте 1769—1789 годов на том же месте ошибочно отмечен «св. Тихон мученик». На картах XIX века вновь упомянут «Лукиан священномученик».
Мощи Киево-Печерского священномученика покоятся в Дальних (Феодосиевых) пещерах Киево-Печерского монастыря.
Память совершается 15 (28) октября и 28 августа (10 сентября) в день святого священномученика Лукиана Пресвитера, вместе с другими преподобными, почивающими в Дальних пещерах лавры.
Примечания
Литература
Месяцеслов святых, всею русскою церковью или местно чтимых. Выпуск ІІ; октябрь. (Прибавление к «Подольским епархиальным ведомостям», Каменец-Подольск, 1893 г., стр. 104).
«Словарь Исторический о святых», 1836 год.
Филарет, «Русские святые», август, 118.
Священномученики | {
"redpajama_set_name": "RedPajamaWikipedia"
} | 7,846 | [
128000,
65014,
110873,
7486,
23227,
56857,
7753,
101591,
320,
40211,
13,
220,
8874,
18,
8,
4194,
2345,
121745,
104169,
7753,
11,
125404,
121461,
29471,
9882,
4898,
11,
103502,
103330,
5927,
96860,
5927,
15298,
1532,
382,
106523,
7740,
8379,
120586,
40842,
116128,
88596,
10693,
23227,
56857,
7753,
101943,
117556,
123783,
100674,
65811,
104559,
106993,
15752,
106379,
118790,
116277,
101943,
103827,
35034,
40231,
11,
8379,
125404,
121461,
29471,
9882,
53671,
100562,
110873,
110270,
110252,
13999,
103407,
112974,
13,
111260,
92878,
103827,
35034,
40231,
116046,
11320,
11562,
29471,
9882,
100925,
105779,
38098,
6148,
101693,
7740,
118706,
23934,
23227,
56857,
7753,
104901,
118442,
63233,
382,
127732,
92878,
111424,
23680,
39900,
120441,
1506,
106993,
15752,
73761,
40842,
57925,
49899,
56008,
105168,
64571,
110102,
4329,
100562,
110873,
7486,
102885,
106768,
9542,
102948,
102196,
113218
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
65014,
110873,
7486,
23227,
56857,
7753,
101591,
320,
40211,
13,
220,
8874,
18,
8,
4194,
2345,
121745,
104169,
7753,
11,
125404,
121461,
29471,
9882,
4898,
11,
103502,
103330,
5927,
96860,
5927,
15298,
1532,
382,
106523,
7740,
8379,
120586,
40842,
116128,
88596,
10693,
23227,
56857,
7753,
101943,
117556,
123783,
100674,
65811,
104559,
106993,
15752,
106379,
118790,
116277,
101943,
103827,
35034,
40231,
11,
8379,
125404,
121461,
29471,
9882,
53671,
100562,
110873,
110270,
110252,
13999,
103407,
112974,
13,
111260,
92878,
103827,
35034,
40231,
116046,
11320,
11562,
29471,
9882,
100925,
105779,
38098,
6148,
101693,
7740,
118706,
23934,
23227,
56857,
7753,
104901,
118442,
63233,
382,
127732,
92878,
111424,
23680,
39900,
120441,
1506,
106993,
15752,
73761,
40842,
57925,
49899,
56008,
105168,
64571,
110102,
4329,
100562,
110873,
7486,
102885,
106768,
9542,
102948,
102196,
113218,
-100
] |
First Through the Tunnel
TriMet MAX Type 2 #206 became the first light rail car to travel through the West Hills tunnel in the run-up to the opening of the Westside MAX line in 1997.
A trackmobile pulled the car into downtown Portland, since the tunnel did not yet have its overhead catenary installed. The cars had been delivered by rail to an unloading ramp on the Willamette & Pacific spur from St. Marys in Beaverton.
A Type 1 car took the 206 out to the Ruby Junction shops in Gresham. It was one of 12 Type 2 cars that entered service in August 1997, the first low-floor light rail cars used in North America.
Photographed by Thomas McCann, May 27, 1997.
Added to the photo archive by Thomas McCann, May 6, 2010.
Thomas McCann's awards:
37 More Photos from Thomas McCann
30 More Photos from 1997
306 More Photos from the 1990's | {
"redpajama_set_name": "RedPajamaCommonCrawl"
} | 6,834 | [
128000,
5451,
17331,
279,
66701,
198,
22646,
35773,
8498,
4078,
220,
17,
674,
11056,
6244,
279,
1176,
3177,
13881,
1841,
311,
5944,
1555,
279,
4410,
25964,
26711,
304,
279,
1629,
5352,
311,
279,
8736,
315,
279,
4410,
3002,
8498,
1584,
304,
220,
2550,
22,
627,
32,
3839,
15280,
13541,
279,
1841,
1139,
19441,
23947,
11,
2533,
279,
26711,
1550,
539,
3686,
617,
1202,
32115,
8415,
47228,
10487,
13,
578,
9515,
1047,
1027,
12886,
555,
13881,
311,
459,
653,
10853,
23091,
389,
279,
4946,
309,
6672,
612,
16867,
60131,
505,
800,
13,
10455,
82,
304,
2893,
402,
37733,
627,
32,
4078,
220,
16,
1841,
3952,
279,
220,
11056,
704,
311,
279,
24658,
69056,
20021,
304,
480,
2548,
309,
13,
1102,
574,
832,
315,
220,
717,
4078,
220,
17,
9515
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
5451,
17331,
279,
66701,
198,
22646,
35773,
8498,
4078,
220,
17,
674,
11056,
6244,
279,
1176,
3177,
13881,
1841,
311,
5944,
1555,
279,
4410,
25964,
26711,
304,
279,
1629,
5352,
311,
279,
8736,
315,
279,
4410,
3002,
8498,
1584,
304,
220,
2550,
22,
627,
32,
3839,
15280,
13541,
279,
1841,
1139,
19441,
23947,
11,
2533,
279,
26711,
1550,
539,
3686,
617,
1202,
32115,
8415,
47228,
10487,
13,
578,
9515,
1047,
1027,
12886,
555,
13881,
311,
459,
653,
10853,
23091,
389,
279,
4946,
309,
6672,
612,
16867,
60131,
505,
800,
13,
10455,
82,
304,
2893,
402,
37733,
627,
32,
4078,
220,
16,
1841,
3952,
279,
220,
11056,
704,
311,
279,
24658,
69056,
20021,
304,
480,
2548,
309,
13,
1102,
574,
832,
315,
220,
717,
4078,
220,
17,
9515,
-100
] |
\section{Introduction. Number-theoretical dualities, $S$-dualities and gravitational cosmology}
In this paper we discuss an amazing interplay between number-theoretical dualites and black holes in Anti-de Sitter spaces. It passes through modular invariance of conformal field theories and AdS/CFT correspondences.
\smallskip Recall that electric $E$ and magnetic field $B$ in the vacuum (in regions without charges and currents) are related by Maxwell equations, invariant by transformations:
\begin{equation}
E\mapsto B,\ B\mapsto (-1/c^2)E
\end{equation}
where $c$ is the speed of light. This is the basic form of the electromagnetic duality. We can already interpret it as the modular
$S$-invariance corresponding to the matrix $S=\begin{pmatrix}0 &-1\\ 1/c^2 &0\end{pmatrix}$, exchanging fields and reversing coupling constants. It extends to $S$-dualities in CFT and string theories.
\smallskip In recent years \cite{GW,KW}, it was realized that the Langlands correspondence is the number-theoretical counterpart of the electromagnetic duality in gauge field theories. Representations of the absolute Galois group correspond to modular objects on the moduli space of curves. Moreover, these modular objects are eigensheaves of
Hecke operators with meaningful eigenvalues. In particular, the coefficients of the $L$-function
\begin{equation}
L(E,s) = \sum_{n=1}^{\infty} \frac{a_n}{n^s}
\end{equation}
of an elliptic curve $E/\mathbb{Q}$ are Hecke eigenvalues, generating a cusp modular form
\begin{equation}
f(E,q) = \sum_{n=1}^{\infty} a_n q^n
\end{equation}
of weight 2. This is a consequence of the famous \emph{modularity theorem} related to the Fermat's Last Theorem.
\smallskip In this paper we define vertex operator algebras for all Galois number fields $K/\mathbb{Q}$, equipped with integral trace forms on their rings of integers ${\mathcal O}_K$ (\emph{cf.}~sect.~5). Thus, the modular $S$-invariance of lattice CFTs is closely related to the arithmetic Langlands program.
\smallskip In addition, Witten \cite{Wit} has associated, via AdS/CFT correspondence, the pure $d=3$ gravity to the \emph{Monster Moonshine Module} $V^\natural$. It transports the \emph{Hecke-Langlands duality} for the extremal $c=24$ CFT to modular dualities for BTZ black holes on
AdS$_3$ (\emph{cf.}~sect.~11).
\section{Virasoro algebra and rational CFT}
For general mathematical definitions, related to vertex algebras and conformal field theories (CFT), see \cite{FBZ, Kac}.
\par Recall that a vertex algebra $V=\oplus V_n$ is conformal of central charge
$c\in\mathbb{C}$ if it contains a conformal vector $\omega\in V_2$ such that Fourier coefficients $L_n=L_n^V$ of the corresponding vertex operator
\begin{equation}
Y(\omega,z) = \sum L_n^V z^{-n-2}
\end{equation}
satisfy the defining relations of the Virasoro algebra:
\begin{equation}
[L_n,L_m] = (n-m)L_{n+m} + c\,\frac{n^3-n}{12}\,\delta_{n,-m},
[L_n,c]=0.
\end{equation}
In addition, $L_{-1}^V=T:V\rightarrow V$ should be a translation operator of degree 1, $L_0^V|_{V_n} = n\cdot\mathrm{Id}$ the grading operator and $L_2\omega = \frac{c}{2}|0\rangle$.
\smallskip The Virasoro algebra is the central extension of
$\mathbb{C}((t))\partial_t$ with topological basis given by
$L_n=-t^{n+1}\partial_t$, $n\in\mathbb{Z}$, and $c\in\mathbb{C}$.
\smallskip A conformal vertex algebra V is called \emph{rational} if it is completely reducible with finitely many inequivalent simple modules having finite-dimensional graded components.
\smallskip The basic example is given by the \emph{Virasoro vertex algebra} $\mathrm{Vir}_c$ with central charge $c$ and conformal vector $\omega = L_{-2}|0\rangle$ \cite[sect.\,2.5]{FBZ}.
\section{Lattice vertex superalgebras}
Let $\Lambda$ be a lattice in $\mathbb{R}^n$ equipped with a non-degenerate $\mathbb{Z}$-valued symmetric bilinear form $\langle
\cdot,\cdot\rangle$. There is a well-known quantization of the space of maps from the circle $S^1$ to the torus $\mathbb{R}^n/\Lambda$ called \emph{lattice vertex superalgebra}.
\smallskip Denote by $\mathfrak{h}=\mathbb{C}\otimes_{\mathbb{Z}} \Lambda$ the complexification of $\Lambda$ and $\mathfrak{h}^{<0}=\sum_{j<0} h\otimes t^j$. The space of state is
\begin{equation}
V_{\Lambda} = \Sym\left(\mathfrak{h}^{<0}\right)\otimes C[\Lambda]
\end{equation}
where $\mathbb{C}[\Lambda]$ is the group algebra of $\Lambda$, generated by $e^\alpha$ ($\alpha\in\Lambda$). It is a superspace with parity $p(e^\alpha)=p(\alpha)=\langle\alpha,\alpha\rangle \mod 2$.
\smallskip For any $\alpha\in L$, mutually local fields $\Gamma_\alpha (z) =Y(1\otimes e^\alpha)$ are of the form
\begin{equation}
\Gamma_\alpha (z)= e^\alpha\exp\left({-\sum_{j<0}\frac{z^{-j}}{j} \alpha_j}\right) \exp\left({-\sum_{j>0}\frac{z^{-j}}{j} \alpha_j}\right) c_\alpha z^{\alpha_0}
\end{equation}
(\emph{cf.}~\cite[sect.~5.4]{Kac}) with operators $c_\alpha$ on $V_L$ satisfying
\begin{equation}
c_0=1,\ c_\alpha|0\rangle=|0\rangle,\ [h_n, c_\alpha]=0\
(h\in\mathfrak{h},\ n\in\mathbb{Z})
\end{equation}
\cite[(5.4.10)]{Kac} and the locality condition
\begin{equation}
e^{\alpha}c_\alpha e^{\beta}c_\beta = (-1)^{p(\alpha)p(\beta)+
\langle\alpha,\beta\rangle} e^{\beta}c_\beta e^{\alpha}c_\alpha
\end{equation}
Together with free bosonic fields (for all $h\in\mathfrak{h}$)
\begin{equation}
Y((h\otimes t^{-1})\otimes 1, z) = h(z) = \sum_{n\in Z} h_nz^{-n-1}
\end{equation}
they generate a vertex operator algebra with the space of state $V_L$
and the vacuum vector $|0\rangle = 1\otimes 1$ \cite[prop.~5.4]{Kac}.
\smallskip Putting $c_\alpha\left(s\otimes e^\beta\right) =
c_{\alpha,\beta}^{} s\otimes e^\beta$ for $s\in \Sym\left(\mathfrak{h}^{<0}\right)$ and $\beta\in\Lambda$, we get the following equations for numbers $c_{\alpha,\beta}\in\mathbb{C}$:
\begin{align}
c_{\alpha,0}^{} &=c_{0,\beta}^{}=1\\
c_{\alpha,\beta}^{} &=(-1)^{p(\alpha)p(\beta)+
\langle\alpha,\beta\rangle} c_{\beta,\alpha}^{}\\
c_{\beta,\gamma}^{} c_{\beta+\gamma,\alpha}^{}
&=c_{\gamma,\alpha+\beta}^{} c_{\beta,\alpha}^{}
\end{align}
It defines a cohomology class in $H^2(\Lambda,\mathbb{C}^\times)$, asserting the existence of a unique (up to isomorphism) vertex superalgebra structure on $V_\Lambda$ \cite[sect.~4.4.3]{FBZ}.
\smallskip Moreover, it is a rational conformal superalgebra with central charge $c=\rank(\Lambda)$.
\section{Lattice theta functions}
It can be shown (cf.~\cite[sect.~4.5.5]{FBZ}, \cite[p.~300]{Zhu}) that characters of lattice vertex algebras $V_\Lambda$ of even lattices $\Lambda$ are lattice theta functions (divided by
$\eta(\tau)^{\rank\Lambda}$ where $\eta(\tau)$ is the
Dedekind $\eta$-function).
\smallskip Let $\Lambda$ be an integral lattice of rank $n$. We define the \emph{theta series} of $\Lambda$ as
\begin{equation}
\Theta_\Lambda(q) = \sum_{v\in\Lambda} q^{\langle v,v\rangle/2} =
1 + \sum_{k>0} N_{2k}(\Lambda)q^k
\end{equation}
where $N_k(\Lambda) = \#\left\{v\in\Lambda\, |\, \langle v,v
\rangle = k\right\}$. If $k>0$ is the minimal integer such that
$N_k(\Lambda)>0$ then $N_k(\Lambda)$ is called the \emph{kissing number} of $\Lambda$.
\smallskip The lattice theta-series satisfies the functional equation
\begin{equation}
\Theta_{\Lambda^*}(e^{-2\pi t}) = \sqrt{\disc(\Lambda)}\,
t^{-n/2} \Theta_\Lambda(e^{-2\pi/t})
\end{equation}
where $\Lambda^*$ is the dual lattice and $\disc(\Lambda)
=\#(\Lambda^*/\Lambda)$ is the discriminant of $\Lambda$.
\smallskip Consider $\theta_\Lambda(\tau)=\Theta_\Lambda
(e^{2\pi i\tau})$ as a function on the upper half-plane
$\mathbb{H}_+$. If $\Lambda=\Lambda^*$ is self-dual (integral and unimodular) then we get functional equations:
\begin{equation}
\theta_\Lambda(\tau+2)=\theta_\Lambda(\tau),\ \theta_\Lambda(-1/\tau)=(\tau/i)^{n/2}\theta_\Lambda(\tau)\, .
\end{equation}
Recall that the full modular group $\mathrm{PSL}_2(\mathbb{Z})$ is generated by matrices $S=\begin{pmatrix}0 &-1\\ 1 &0\end{pmatrix}$ and $T=\begin{pmatrix}1 &1\\ 0 &1\end{pmatrix}$. Then, for any $\gamma\in\Gamma_+=\langle S,T^2\rangle$, we have
\begin{equation}
\theta_\Lambda(\gamma(\tau))=\varepsilon_{c,d}^n (c\tau+d)^{n/2} \theta_\Lambda(\tau)
\end{equation}
So, $\theta_\Lambda(\tau$) becomes a modular form of weight $n/2$ for
$\Gamma_+$ with multiplier system $\varepsilon_{c,d}\in\mathbb{C}^*$
satisfying $\varepsilon_{c,d}^8=1$ (\emph{cf}.~\cite[sect.~2]{Elk}).
\smallskip Notice that the Dedekind $\eta$-function
\begin{equation}
\eta(\tau) = q^{\frac{1}{24}}\prod_{n=1}^\infty \left(1-q^n\right)
\end{equation}
satisfies functional equations
\begin{equation}
\eta(\tau+1)=e^{\pi i/12}\eta(\tau),\ \eta(-1/\tau)=
(\tau/i)^{1/2}\eta(\tau)\, .
\end{equation}
Thus, $\eta(\tau)$ is a modular form of weight $1/2$ and level 1 with a multiplier system of order 24.
\smallskip The general case of lattices with arbitrary discriminants, related to modular forms for congruence subgroups, needs additional investigations. However, when $\Lambda$ is an even lattice, the modularity follows from Zhu's results on characters of rational vertex algebras \cite{Zhu} (see sect.~6).
\section{Vertex algebras for number fields}
Let $K=\mathbb{Q}[\xi]$ be a Galois number field over $\mathbb{Q}$ of degree $n=r_1+2r_2$ where $r_1$ is the number of real embeddings and $2r_2$ the number of complex embeddings of $K$ in $\mathbb{C}$. In this case of Galois extension over $\mathbb{Q}$, K is either totally real ($\xi\in\mathbb{R}$) with $r_2=0$ or totally imaginary
($\xi\in\mathbb{C}\backslash\mathbb{R}$) with $r_1=0$.
\smallskip The important thing here is to use the nondegenerate symmetric bilinear form
\begin{equation}
\mathrm{tr}:K\times K\rightarrow\mathbb{Q},\ \langle x,y\rangle\mapsto tr_{K/\mathbb{Q}}^{}(xy),
\end{equation}
called the \emph{trace form}. When $K$ is totally real, it is positive-definite. In the totally imaginary case, it is negative-definite and we should take rather the anti-trace form $\langle x,y\rangle\mapsto -tr_{K/\mathbb{Q}}^{}(xy)$.
\smallskip Let $\mathcal{O}_K$ be the \emph{ring of integers} in $K/\mathbb{Q}$ corresponding to a lattice $\Lambda$, constructed from real and complex embeddings of $K$ (see \cite[ch.~1, \S~1]{PS}). Recall that $\mathcal{O}_K$ is the unique maximal order in $K$. In our number-theoretical setting, there is a finite number of orders preserving $\Lambda$, equal to the \emph{class number} $h(K)$ of $K$. The class number measures the deviation of
$\mathcal{O}_K$ from being a principal ideal domain.
\smallskip Our bilinear form $\langle\cdot,\cdot\rangle$ restricts
to an integral form on $\mathcal{O}_K$. Now, choosing a basis
$\{\omega_1^{},\dots,\omega_n^{}\}$ of $\mathcal{O}_K$, we can extend $\langle\cdot,\cdot\rangle$ to a positive-definite integral form on
$\Lambda$.
\smallskip So, we can construct a vertex superalgebra
$\mathcal{V}_K$, associated to any Galois number field
$K/\mathbb{Q}$. It opens the whole area of investigations in order to express the class field theory, aritmetical reciprocity laws etc. in terms of modularity theorems for lattice vertex superalgebras.
\smallskip Consider a simple example of a real quadratic field
$K=\mathbb{Q}\left(\sqrt{d}\right)$ where $d$ is a square-free positive integer. Let
\begin{equation}
\omega=\begin{cases}(1+\sqrt{d})/2 &d\equiv 1\pmod 4 \\
\sqrt{d} &d\equiv 2,3\pmod 4\end{cases}
\end{equation}
Then $\{1,\omega\}$ is a basis of $\mathcal{O}_K$
\cite[ch.~1, ex.~2]{PS}. An arbitrary order in $K$ is of the form
$\mathcal{O}_f=\mathbb{Z}[f\omega]$ with a positive integer $f$ called the \emph{conductor} of $\mathcal{O}_f$. If $\alpha=a+b\sqrt{d}$ then the trace $tr_{K/\mathbb{Q}}^{}(\alpha) = 2a$.
\smallskip As we have seen in section 3, the vertex superalgebra structure on $V_\Lambda$ is determined by a cocycle $c_{\alpha,
\beta}\in H^2(\Lambda,\mathbb{C}^\times)$. Kac indicates an explicit form of this cocycle with values in $\mathbb{Z}/2\mathbb{Z}$
\cite[sect~5.5]{Kac}.
\smallskip In order to be fully explicit, consider, for instance,
$K=\mathbb{Q}[\sqrt{2}]$, $\mathcal{O}_K=\mathbb{Z}[\sqrt{2}]$ and
the corresponding even integral lattice
$\Lambda=\mathbb{Z}\oplus \mathbb{Z}\sqrt{2}\in\mathbb{R}^2$ with basis $\{\alpha=(1,0),\, \beta^{}=(0,\sqrt{2})\}$. Our bilinear form, associated to the trace form, gives
\begin{align}
\langle\alpha,\alpha\rangle &= tr_{K/\mathbb{Q}}^{}(1)=2\\
\langle\alpha,\beta\rangle =\langle\beta,\alpha\rangle
&=tr_{K/\mathbb{Q}}^{}(\sqrt{2}) = 0\\
\langle\beta,\beta\rangle &= tr_{K/\mathbb{Q}}^{}(2)=4
\end{align}
So, the matrix of the trace form is diagonal and \emph{discriminant} $d(K)=2\cdot 4=8$ as expected for this quadratic field. It is also well-known that $h(K)=1$.
\smallskip Thus, the \emph{$2$-cocycle of Frenkel-Kac}, defining the unique (up to isomorphism) lattice vertex algebra $\mathcal{V}_{\mathbb{Z}[\sqrt{2}]}$ (with integral trace form), is given by the following formulas:
\begin{align}
c_{\alpha,\alpha}^{} &= (-1)^{\left((\alpha,\alpha)+
(\alpha,\alpha)^2\right)/2} = (-1)^{(2+2^2)/2} = -1\\
c_{\alpha,\beta}^{} &= (-1)^{(\alpha,\beta)+(\alpha,\alpha)
(\beta,\beta)} = 1 = c_{\beta,\alpha}^{}\\
c_{\beta,\beta}^{} &=(-1)^{\left((\beta,\beta)+
(\beta,\beta)^2\right)/2} = (-1)^{(4+4^2)/2} =1\, .
\end{align}
This vertex algebra has $d(K)=8$ inequivalent simple modules.
Indeed, in the case of even integral lattices, Dong \cite{Dong} has shown that inequivalent irreducible modules of
$\mathcal{V}_\Lambda$ are parameterized by $\Lambda^*/\Lambda$.
\section{Zhu's modularity results for rational CFT}
Let $\mathcal{V}_c$ be a rational conformal vertex algebra of central charge $c$. For any simple $\mathcal{V}$-module $M$ one can define its character by the formula
\begin{equation}
\ch M^{} = \Tr_M^{} q^{L_0^M-c/24}=\sum_\alpha \dim M_\alpha
q^{\alpha - c/24}\, ,
\end{equation}
where $M_\alpha$ is the subspace of M on which the Virasoro operator $L_0^M$ acts by multiplication by $\alpha$.
\smallskip Let $C_2(\mathcal{V}_c)$ be the subspace generated by elements of the form $A_{(-2)}\cdot B$ for all $A,B\in \mathcal{V}_c$. Then $\mathcal{V}_c$ is said to satisfy \emph{Zhu's finiteness condition} if $\dim \mathcal{V}_c/C_2(\mathcal{V}_c)<\infty$ and any vector can be written as $L_{n_1^{}}\cdots L_{n_k^{}}A$, $n_i<0$,
where $L_nA=0$ for all $n>0$.
\begin{thm}(\cite[thm.~5.3.2]{Zhu})
Let $\mathcal{V}_c$ be a rational conformal vertex algebra of central charge $c$ satisfying Zhu's finiteness condition. Let $\{M_1,\dots,
M_m\}$ be the complete list of irreducible $\mathcal{V}_c$-modules. Consider \emph{$n$-point correlation functions}
\begin{equation}
S_{M_i}\left((a_1,z_1),\dots,(a_n,z_n),\tau\right)
\end{equation}
as meromorphic continuations ($q=e^{2\pi i \tau}$) of limits
\begin{equation}
\Tr_{M_i} Y(e^{2\pi z_1L_0}a_1,e^{2\pi z_1L_0})\cdots
Y(e^{2\pi z_1L_0}a_n,e^{2\pi z_nL_0})q^{L_0- c/24}
\end{equation}
If $a_1,\dots,a_n$ are highest weight vectors with weights $w_1,\dots,
w_n$ for the Virasoro algebra, then for every $\begin{pmatrix}
a &b\\ f &d\end{pmatrix}\in\mathrm{SL}_2(\mathbb{Z})$, we have
\begin{align}
S_{M_i}\left(\left(a_1,\frac{z_1}{f\tau+d}\right),\dots,
\left(a_n,\frac{z_n}{f\tau+d}\right),\tau\right)=\\
(f\tau+d)^{\sum w_k} \sum_{j=1}^m S(\alpha,i,j)
S_{M_j}\left((a_1,z_1),\dots,(a_n,z_n),\tau\right)
\end{align}
where $S_\alpha(i,j)$ are constants depending only on $\alpha,i,j$.
In particular, if $\mathcal{V}_c$ has a unique simple module $M$, and $a$ is a highest weight vector of weight $w$ for the Virasoro algebra, then $S_M(a,\tau)$ is a modular form of weight $w$ with a certain multiplier system.
\end{thm}
\smallskip Here we see the appearance of the \emph{modular $S$-matrix}
$S(\alpha,i,j)$ for any $\alpha\in\mathrm{SL}_2(\mathbb{Z})$. The functional equation for correlation functions corresponds to $\alpha=\begin{pmatrix} 0 &-1\\ 1 &0\end{pmatrix}$.
\begin{thm}(\cite[thm.~5.3.3]{Zhu})
In the conditions of the previous theorem, $\ch M_i$ converges to holomorphic functions on $\mathcal{H}_+$ and the space, spanned by
$\ch M_i$, $1\leqslant i\leqslant n$, is invariant under the action
of $\mathrm{SL}_2(\mathbb{Z})$.
\end{thm}
\section{Minimal models and $S$-matrix of the critical Ising model}
It is known that $\mathrm{Vir}_c$ is reducible as the module over the Virasoro algebra if and only if
\begin{equation}
c=c(p,r)=1-6(p-r)^2/pr,\ p,r>1,\ (p,r)=1
\end{equation}
In this case, the irreducible quotient $L_{c(p,r)}$ of
$\mathrm{Vir}_{c(p,r)}$ is a rational vertex algebra, called
\emph{minimal model} of Belavin-Polyakov-Zamolodchikov \cite{BPZ, dFMS,Wang}.
\smallskip In order to be explicit, consider the case $(p,r)=(4,3)$ with $c=1/2$. It is known as $d=2$ \emph{critical Ising model}. There are 3 simple modules $M_0$, $M_{1/16}$ and $M_{1/2}$ with conformal dimensions $0$, $1/16$ and $1/2$ correspondings to primary fields $1$ (identity), $\sigma$ (spin) and $\epsilon$ (energy).
\smallskip The characters are given by the following formulas
($q=e^{2\pi i \tau})$:
\begin{align}
\ch M_0 &= \frac{\sqrt{\theta_3(0|q)}+\sqrt{\theta_4(0|q)}}
{2\sqrt{\eta(\tau)}}\\
\ch M_{\frac{1}{16}} &= \frac{\sqrt{\theta_3(0|q)}-\sqrt{\theta_4(0|q)}}{2\sqrt{\eta(\tau)}}\\
\ch M_{\frac{1}{2}} &= \frac{\sqrt{\theta_2(0|q)}}{\sqrt{2\eta(\tau)}}\, .
\end{align}
Here we used 3 remarquable theta functions (where $q=e^{\pi i \tau}$):
\begin{equation}
\theta_2(0|q)=\frac{2\eta^2(2\tau)}{\eta(\tau)},\
\theta_3(0|q)=\frac{\eta^2((\tau+1)/2)}{\eta(\tau+1)},\
\theta_4(0|q)=\frac{\eta^2(\tau/2)}{\eta(\tau)}\, .
\end{equation}
The functional equation for characters:
\begin{equation}
\ch M_i (-1/\tau) = \sum_j S(i,j)\ch M_j(\tau)
\end{equation}
is expressed in terms of the modular $S$-matrix:
\begin{equation}
S(i,j)=\frac{1}{2}\begin{pmatrix} 1 &1 &\sqrt{2}\\
1 &1 &-\sqrt{2}\\ \sqrt{2} &-\sqrt{2} &0\end{pmatrix} .
\end{equation}
corresponding to $\alpha=\begin{pmatrix} 0 &-1\\ 1 &0\end{pmatrix}$ in the Zhu's theorem.
\smallskip Finally, notice that the \emph{partition function}
\begin{equation}
Z(q) = \sum_i |\ch M_i|^2
\end{equation}
is modular invariant.
\section{Hecke eigenforms and Wiles modularity theorem}
The $m$th Hecke operator $T_m$ acts on lattice functions by taking sums over all sublattices of index $m$. If $f(z)=\sum a_n^{}q^n$ a weakly holomorphic (with possible poles at cusps) modular form of weight $k$ then
\begin{align}
T_m f(z) &= n^{k-1}\sum_{a,d>0,\, ad=n} \frac{1}{d^k}
\sum_{b\,\mathrm{mod}\, d} f\left(\frac{az+b}{d}\right)\\
&= \sum_{ad=n,\, \mu>0} a^{k-1}c_{d\mu}^{}q^{a\mu}
\end{align}
Denote $M_k$ the space of such weakly holomorphic modular forms and $S_k$ the space of cusp forms with $a_0^{}=0$. Hecke operators transform cusp forms into cusp forms and, for a prime $m=p$, we get $T_p(f)=\sum b_nq^n$ with
\begin{equation}
b_n=\begin{cases}a_{pn}^{} &\mathrm{if}\ p\nmid n\\
a_{pn}^{}+p^{k-1}a_{n/p} &\mathrm{if}\ p\mid n \end{cases}
\end{equation}
We can present $S_k$ as the direct sum $S_k^{\mathrm{old}}\oplus
S_k^{\mathrm{new}}$ of subspaces of old and new cusp forms, orthogonal to each other with respect to the Petersson inner product. Old forms arise from modular forms of lower levels and have $a_1=0$. New forms with the same Diriclet character $\chi\pmod N$ are proportional and could be normalized by putting $a_1=1$. This is known as \emph{multiplicity 1 theorem}.
\smallskip Denote $\Gamma_0(N)$ the subgroup of matrices $\begin{pmatrix}
a &b\\ c &d\end{pmatrix}\in\mathrm{SL}_2(\mathbb{Z})$ with $c\equiv
0\pmod{N}$ and consider the modular curve $X_0(N)=\Gamma_0(N)\backslash
\mathbb{Z}_+$.
\begin{thm}(Wiles et al.) Let $E/\mathbb{Q}$ be a semi-stable elliptic curve with conductor $N$ and $L$-function
\begin{equation}
L(E,s) = \sum_{n=1}^{\infty} \frac{a_n}{n^s}\, .
\end{equation}
Then there exists a new cusp Hecke eigenform $f(\tau)=\sum{b_nq^n}$ of weight 2 and level $N$ with $b_n=a_n$ (for almost all $n$), defining a modular parameterization $X_0(N)\rightarrow E$ (up to an isogeny).
\end{thm}
\section{Hecke eigenfields and Maeda's conjecture}
\smallskip Let $f$ be a new cusp Hecke eigenform of level $N$ then
\begin{equation}
T_m f(\tau) = \lambda_m f(\tau),\ \lambda_m = a_m^{}a_1^{}
\end{equation}
When $f(\tau)$ is normalized, we have $\lambda_m=a_m^{}$.
\smallskip Consider the field $K_f=\mathbb{Q}[\lambda_m^{},m\geqslant 1]$, generated by Hecke eigenvalues, that will be called \emph{Hecke eigenfield}, associated to $f$. It is an algebraic extension of
$\mathbb{Q}$.
\begin{prop} Let $N=1$. The Hecke eigenfield $K_f$ is totally real or CM-field (when $a_1^{}\in\mathbb{C}\backslash\mathbb{R}$).
\end{prop}
\par\noindent \textsl{Proof.} It follows from the fact that Hecke operators are self-adjoint with respect to the Petersson inner product. $\square$
\smallskip Shimura has attached to $f(\tau)$ of weight $2$ an abelian variety $\mathrm{Sh}_f$ of dimension $[K_f:\mathbb{Q}]$. In the Wiles case of elliptic curve $E/Q$, $K_f=\mathbb{Q}$ and $Sh_f=E$ (up to an isogeny). Hecke eigenvalues correspond to the monodromy of the Galois action on
$f(\tau)$ (as a horizontal section of an appropriate line bundle with a flat connection) around cusps. This is one of basic keypoints of the
Beilinson-Drinfeld geometric Langlands duality.
\smallskip The following \emph{Maeda's conjecture} \cite[sect.~3.6.1]{RS} is important in order to to study the Langlands duality in terms of Hecke eigenfields.
\begin{conj}
There is only one $Gal(\overline{\mathbb{Q}}/\mathbb{Q})$-orbit of normalized eigenforms of level 1.
\end{conj}
\smallskip\noindent It is numerically proven for all $k\leqslant 4096$ \cite{RS}.
\section{Critical WZW and Beilinson-Drinfeld geometric correspondence}
There are several books written on this topic \cite{BD, Fr}, so we briefly underline main ideas. It may be considered as the geometric $S$-duality for WZW-models for affine Kac-Moody algebras $\widehat{G}$ at critical level $c=h^{\vee}$ (=dual Coxeter number of $G$).
\smallskip Let $G$ be a reductive Lie group and $^LG$ its Langlands dual (with dual root system). Denote $\mathrm{Bun}_G^{}(X)$ the moduli space of principal $G$-bundles on a curve $X/\mathbb{C}$, $g(X)\geqslant 2$.
\smallskip According to Beilinson and Drinfeld, there is a one-to-one correspondence
\begin{equation}
\textrm{Hecke eigensheaves on Bun$_G^{}(X)$} \leftrightarrow
\textrm{$^LG$-local systems on $X$}
\end{equation}
Moreover, these Hecke eigensheaves are $D$-modules and their ``eigenvalues'' are exactly the corresponding $^LG$-local systems. Via the \emph{Riemann-Hilbert correspondence}, these local systems are representations of the fundamental group $\pi_1(X)$ playing the role of Galois representations.
\smallskip Notice that geometric versions of Hecke operators are crucial for the geometric Langlands theory.
\section{Witten's gravitational moonshine}
Let $\mathcal{A}$ be a $3d$-spacetime asymptotic at infinity to AdS$_3$. Witten has suggested that the pure quantum gravity on $\mathcal{A}$ with maximally negative cosmological constant corresponds to an extremal $c=24$ two-dimensional CFT. This remarquable CFT was constructed by Frenkel-Lepowsky-Meur\-man \cite{FLM} as the so-called \emph{Moonshine Module} $V^\natural$ of the \emph{Monster vertex algebra} $\mathbb{M}$. $\mathbb{M}$ is a rational vertex algebra and its unique irreducible representation $V^\natural$ is just $\mathbb{M}$ as module over itself. In this case there are 196883 operators, associated to Virasoro primary fields of $V^\natural$, creating BTZ black holes on $\mathcal{A}$ \cite{Wit}.
\smallskip The partition function of $c=24$ pure quantum gravity on AdS$_3$ is simply
\begin{equation}
Z_1(q)=J(q)=j(q)-744
\end{equation}
where $j(q)$ is the absolute $j$-invariant. Partition functions $Z_k(q)$ of hypothetical $c=24k$ quantum gravities can be obtained using Hecke operators $T'_m= mT_m$ (or Faber polynomials $\Phi_m(X)$ such that $\Phi_m(j)=j_m(q)=T'_m(J)$ \cite{Gue}). Witten shows \cite[(3.13)]{Wit}
that $Z_k(q)$ should be of the form
\begin{equation}
Z_k(q)=\sum_{m=0}^k a_{-m} T'_mJ(q)=\sum_{m=0}^k a_{-m} j_m(q)
\end{equation}
where $a_{-m}$, $0\leqslant m\leqslant k$, come from the formula
\begin{equation}
q^{-k}\prod_{n=2}^\infty (1-q^n)^{-1}=\sum_{m=-k}^\infty
a_m q^m\, .
\end{equation}
In this way we obtain
\begin{equation}
Z_2(q)=(T'_2+T'_0)J(q)
\end{equation}
and so on. This construction is consistent with the Bekenstein-Hawking entropy for black holes. However, it is not yet clear to what extremal
CFT correspond partitions functions $Z_k(q)$ for $k>1$.
\smallskip It looks relatively simple at the level of partition functions but this is misleading. Zhu \cite{Zhu} shows that $V^\natural$ can be decomposed as the direct sum of tensor products of highest weight modules of 48 Virasoro algebras with central charge $c=1/2$. Actually, it also proves the rationality of $\mathbb{M}$.
\section{Perspectives}
We have indicated just the beginning of the story. First of all, number-theoretical questions can be treated as a particular case of the study of lattice vertex superalgebras for number fields. It demonstrates an amazing unification of the arithmetic with lattice CFT theories.
\smallskip On the one hand, arithmetic generalizations would include Drinfeld associators, motivic Galois groups and Grothendieck-Teichm\"uller groupoids. In positive characteristic, an upcoming article \cite{Po2} will treat vertex $t$-algebras, generalizing Drinfeld modules and Anderson's
$t$-motives.
\smallskip On the other hand, physical generalisations would include the
$S$-duali\-ty between electric and magnetic branes of the unifying
$M$-theory. As Witten have already noticed, Hecke operators are related
to 't Hooft operators and Wilson loops.
\smallskip The holographic preimage of the Monstrous Moonshine, giving a spacetime with BTZ black holes, is inspiring and requires additional investiations.
\medskip\noindent {\scriptsize \textbf{Acknowledgments.} I would like to thank my colleagues Vadim Schechtman and Joseph Tapia as well as my old friend
Pavel Guerzhoy for inspiring discussions.}
\nocite{*}
\bibliographystyle{alpha}
| {
"redpajama_set_name": "RedPajamaArXiv"
} | 2,517 | [
128000,
59,
2879,
90,
38255,
13,
5742,
10826,
91867,
19091,
1385,
11,
400,
50,
3,
12,
67,
940,
1385,
323,
71019,
56754,
2508,
633,
644,
420,
5684,
584,
4358,
459,
8056,
958,
1387,
1990,
1396,
10826,
91867,
19091,
3695,
323,
3776,
20349,
304,
23853,
6953,
328,
3328,
12908,
13,
1102,
16609,
1555,
44993,
304,
959,
5397,
315,
26965,
278,
2115,
26018,
323,
2467,
50,
11547,
4082,
8024,
2436,
382,
59,
9181,
21247,
80640,
430,
9249,
400,
36,
3,
323,
24924,
2115,
400,
33,
3,
304,
279,
29302,
320,
258,
13918,
2085,
10405,
323,
60701,
8,
527,
5552,
555,
59497,
39006,
11,
58720,
555,
54070,
512,
59,
7413,
90,
26378,
367,
534,
36,
59,
2235,
34152,
426,
27362,
426,
59,
2235,
34152,
10505,
16,
2971,
61,
17,
8,
36
] | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | [
59,
2879,
90,
38255,
13,
5742,
10826,
91867,
19091,
1385,
11,
400,
50,
3,
12,
67,
940,
1385,
323,
71019,
56754,
2508,
633,
644,
420,
5684,
584,
4358,
459,
8056,
958,
1387,
1990,
1396,
10826,
91867,
19091,
3695,
323,
3776,
20349,
304,
23853,
6953,
328,
3328,
12908,
13,
1102,
16609,
1555,
44993,
304,
959,
5397,
315,
26965,
278,
2115,
26018,
323,
2467,
50,
11547,
4082,
8024,
2436,
382,
59,
9181,
21247,
80640,
430,
9249,
400,
36,
3,
323,
24924,
2115,
400,
33,
3,
304,
279,
29302,
320,
258,
13918,
2085,
10405,
323,
60701,
8,
527,
5552,
555,
59497,
39006,
11,
58720,
555,
54070,
512,
59,
7413,
90,
26378,
367,
534,
36,
59,
2235,
34152,
426,
27362,
426,
59,
2235,
34152,
10505,
16,
2971,
61,
17,
8,
36,
-100
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.