text:
package org.springframework.cloud.aws.autoconfigure.context;

import com.amazonaws.services.cloudformation.AmazonCloudFormation;
import com.amazonaws.services.cloudformation.model.DescribeStackResourcesRequest;
import com.amazonaws.services.cloudformation.model.DescribeStackResourcesResult;
import com.amazonaws.services.cloudformation.model.ListStackResourcesRequest;
import com.amazonaws.services.cloudformation.model.ListStackResourcesResult;
import com.amazonaws.services.cloudformation.model.StackResource;
import com.amazonaws.services.cloudformation.model.StackResourceSummary;
import com.sun.net.httpserver.HttpContext;
import com.sun.net.httpserver.HttpServer;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;
import org.mockito.Mockito;
import org.springframework.boot.test.EnvironmentTestUtils;
import org.springframework.cloud.aws.context.annotation.OnAwsCloudEnvironmentCondition;
import org.springframework.cloud.aws.core.env.ResourceIdResolver;
import org.springframework.cloud.aws.core.env.stack.StackResourceRegistry;
import org.springframework.context.annotation.AnnotationConfigApplicationContext;
import org.springframework.context.annotation.Bean;
import org.springframework.context.annotation.Configuration;
import org.springframework.util.ReflectionUtils;

import java.lang.reflect.Field;
import java.util.Collections;

import static org.junit.Assert.assertNotNull;
import static org.junit.Assert.assertTrue;

public class ContextStackAutoConfigurationTest {

	private AnnotationConfigApplicationContext context;

	@Before
	public void restContextInstanceDataCondition() throws IllegalAccessException {
		Field field = ReflectionUtils.findField(OnAwsCloudEnvironmentCondition.class, "isCloudEnvironment");
		assertNotNull(field);
		ReflectionUtils.makeAccessible(field);
		field.set(null, null);
	}

	@After
	public void tearDown() throws Exception {
		if (this.context != null) {
			this.context.close();
		}
	}

	@Test
	public void stackRegistry_autoConfigurationEnabled_returnsAutoConfiguredStackRegistry() throws Exception {
		//Arrange
		this.context = new AnnotationConfigApplicationContext();
		this.context.register(AutoConfigurationStackRegistryTestConfiguration.class);
		this.context.register(ContextStackAutoConfiguration.class);
		HttpServer httpServer = MetaDataServer.setupHttpServer();
		HttpContext httpContext = httpServer.createContext("/latest/meta-data/instance-id", new MetaDataServer.HttpResponseWriterHandler("test"));

		//Act
		this.context.refresh();

		//Assert
		assertNotNull(this.context.getBean(StackResourceRegistry.class));

		httpServer.removeContext(httpContext);
		MetaDataServer.shutdownHttpServer();
	}

	@Test
	public void stackRegistry_manualConfigurationEnabled_returnsAutoConfiguredStackRegistry() throws Exception {
		//Arrange
		this.context = new AnnotationConfigApplicationContext();
		this.context.register(ManualConfigurationStackRegistryTestConfiguration.class);
		this.context.register(ContextStackAutoConfiguration.class);
		EnvironmentTestUtils.addEnvironment(this.context, "cloud.aws.stack.name:manualStackName");

		//Act
		this.context.refresh();

		//Assert
		assertNotNull(this.context.getBean(StackResourceRegistry.class));
	}

	@Test
	public void resourceIdResolver_withoutAnyStackConfiguration_availableAsConfiguredBean() throws Exception {
		//Arrange
		this.context = new AnnotationConfigApplicationContext();
		this.context.register(ContextStackAutoConfiguration.class);
		EnvironmentTestUtils.addEnvironment(this.context, "cloud.aws.stack.auto:false");
		//Act
		this.context.refresh();

		//Assert
		assertNotNull(this.context.getBean(ResourceIdResolver.class));
		assertTrue(this.context.getBeansOfType(StackResourceRegistry.class).isEmpty());
	}

	@Configuration
	static class AutoConfigurationStackRegistryTestConfiguration {

		@Bean
		public AmazonCloudFormation amazonCloudFormation() {
			AmazonCloudFormation amazonCloudFormation = Mockito.mock(AmazonCloudFormation.class);
			Mockito.when(amazonCloudFormation.describeStackResources(new DescribeStackResourcesRequest().withPhysicalResourceId("test"))).
					thenReturn(new DescribeStackResourcesResult().withStackResources(new StackResource().withStackName("testStack")));
			Mockito.when(amazonCloudFormation.listStackResources(new ListStackResourcesRequest().withStackName("testStack"))).
					thenReturn(new ListStackResourcesResult().withStackResourceSummaries(Collections.<StackResourceSummary>emptyList()));
			return amazonCloudFormation;
		}
	}

	@Configuration
	static class ManualConfigurationStackRegistryTestConfiguration {

		@Bean
		public AmazonCloudFormation amazonCloudFormation() {
			AmazonCloudFormation amazonCloudFormation = Mockito.mock(AmazonCloudFormation.class);
			Mockito.when(amazonCloudFormation.listStackResources(new ListStackResourcesRequest().withStackName("manualStackName"))).
					thenReturn(new ListStackResourcesResult().withStackResourceSummaries(Collections.<StackResourceSummary>emptyList()));
			return amazonCloudFormation;
		}
	}
}


text:
Toni & Guy Hairdressing Academy-Plano
2016 Student Loan
Default Rate
2017 Enrolled Students
100% Full-Time
Toni & Guy Hairdressing Academy-Plano is a higher education institution located in Collin County, TX. In 2016, the most popular Bachelor's Degree concentrations at Toni & Guy Hairdressing Academy-Plano were .
In 2017, 127 degrees were awarded across all undergraduate and graduate programs at Toni & Guy Hairdressing Academy-Plano. 90.6% of these degrees were awarded to women, and 9.45% awarded men. The majority of degree recipients were white (82 degrees), 2.48 times more than then the next closest race/ethnicity group, hispanic or latino (33 degrees).
The median undergraduate tuition at Toni & Guy Hairdressing Academy-Plano is $0, which is $-11,737 less than the national average for ($11,738).
1 Year Growth
In 2017 Toni & Guy Hairdressing Academy-Plano had an average net price — the price paid after factoring in grants and loans — of $16,365. Between 2016 and 2017, the average net price of Toni & Guy Hairdressing Academy-Plano grew by 3.7%.
This chart compares the average net price of Toni & Guy Hairdressing Academy-Plano (in red) with that of other similar universities.
62% of undergraduate students at Toni & Guy Hairdressing Academy-Plano received grants or loans in 2017. This represents a decline of 4.62% with respect to 2016, when 65% of undergraduate students received financial aid.
This chart compares the average award discount at Toni & Guy Hairdressing Academy-Plano (in red) with that of other similar universities.
In 2016 the default rate for borrower's at Toni & Guy Hairdressing Academy-Plano was 6.92%, which represents 9 out of the 130 total borrowers.
Toni & Guy Hairdressing Academy-Plano has a total enrollment of 226 students. The full-time enrollment at Toni & Guy Hairdressing Academy-Plano is 226 students and the part-time enrollment is 0. This means that 100% of students enrolled at Toni & Guy Hairdressing Academy-Plano are enrolled full-time.
The enrolled student population at Toni & Guy Hairdressing Academy-Plano, both undergraduate and graduate, is 70.4% White, 13.3% Hispanic or Latino, 6.64% Black or African American, 5.31% Asian, 1.77% American Indian or Alaska Native, 0% Native Hawaiian or Other Pacific Islanders, and 0% Two or More Races.
Students enrolled at Toni & Guy Hairdressing Academy-Plano in full-time Undergraduate programs are majority White Female (65%), followed by Hispanic or Latino Female (11.5%) and Black or African American Female (6.64%). Students enrolled in full-time Graduate programs are majority N/A, followed by N/A and N/A.
The total enrollment at Toni & Guy Hairdressing Academy-Plano, both undergraduate and graduate, is 226 students. The full-time enrollment at Toni & Guy Hairdressing Academy-Plano is 226 and the part-time enrollment is 0. This means that 100% of students enrolled at Toni & Guy Hairdressing Academy-Plano are enrolled full-time compared with 74.1% at similar .
This chart shows the full-time vs part-time enrollment status at Toni & Guy Hairdressing Academy-Plano (in red) compares to similar universities.
2017 Retention Rate
Retention rate measures the number of first-time students who began their studies the previous fall and returned to school the following fall. The retention rate for full-time undergraduates at Toni & Guy Hairdressing Academy-Plano was 72%. Compared with the full-time retention rate at similar (77%), Toni & Guy Hairdressing Academy-Plano had a retention rate lower than its peers.
This chart shows the retention rate over time at Toni & Guy Hairdressing Academy-Plano (highlighted in red) compares to similar universities.
The enrolled student population at Toni & Guy Hairdressing Academy-Plano is 70.4% White, 13.3% Hispanic or Latino, 6.64% Black or African American, 5.31% Asian, 1.77% American Indian or Alaska Native, 0% Native Hawaiian or Other Pacific Islanders, and 0% Two or More Races. This includes both full-time and part-time students as well as graduate and undergraduates. By comparison, enrollment for all is 41.5% White, 26.6% Hispanic or Latino, and 19.2% Black or African American.
In 2017, 103 more women than men received degrees from Toni & Guy Hairdressing Academy-Plano. The majority of degree recipients at Toni & Guy Hairdressing Academy-Plano are white (82 degrees awarded). There were 2.48 times more white graduates than the next closest race/ethnicity group, hispanic or latino (33 degrees).
The most common Bachelor's Degree concentration at Toni & Guy Hairdressing Academy-Plano is N/A, followed by N/A and N/A.
The most specialized majors across all degree types at Toni & Guy Hairdressing Academy-Plano, meaning they have significantly more degrees awarded in that concentration than the national average across all institutions, are Personal & Culinary Services (127 degrees awarded).
Chefs & head cooks
The most common jobs for people who hold a degree in one of the 5 most specialized majors at Toni & Guy Hairdressing Academy-Plano are Chefs & head cooks (10,332 people), Cooks (4,377 people), Food service managers (3,496 people), Morticians, undertakers, & funeral directors (2,741 people), and Food preparation workers (1,729 people).
The most specialized majors at Toni & Guy Hairdressing Academy-Plano are Personal & Culinary Services (127 degrees awarded).
Firstline supervisors of food preparation & serving workers
The highest paying jobs for people who hold a degree in one of the 5 most specialized majors at Toni & Guy Hairdressing Academy-Plano are Firstline supervisors of food preparation & serving workers, General & operations managers, Morticians, undertakers, & funeral directors, Postsecondary teachers, and Driver/sales workers & truck drivers
Restaurants & Food Services
The most common industries for people who hold a degree in one of the 5 most specialized majors at Toni & Guy Hairdressing Academy-Plano are Restaurants & Food Services (15,268 people), Funeral homes, & cemeteries & crematories (3,037 people), Amusement & Recreation (2,421 people), Traveler accommodation (2,349 people), and Elementary & secondary schools (1,678 people).
IPEDS uses the Classification of Instructional Programs (CIP) standard, so the categories may not match the exact concentrations offered by Toni & Guy Hairdressing Academy-Plano.
In false, the most common bachelors degree concentration at Toni & Guy Hairdressing Academy-Plano was N/A with N/A degree-majorss awarded.
This visualization illustrates the percentage of degree-majors recipients from bachelors degree programs at Toni & Guy Hairdressing Academy-Plano according to their major.
In 2017, 12 degrees were awarded to men at Toni & Guy Hairdressing Academy-Plano, which is 0.104 times less than the number of degrees awarded to females (115).
This chart displays the gender disparity between the top 5 majors at Toni & Guy Hairdressing Academy-Plano by degrees awarded.
In false, 12 degrees were awarded to men at Toni & Guy Hairdressing Academy-Plano in General Cosmetology, which is 0.104 times less than the 115 female recipients with that same degree.
In false, 115 degrees were awarded to women at Toni & Guy Hairdressing Academy-Plano in General Cosmetology, which is 9.58 times more than the 12 male recipients with that same degree.
100% Completion Time
In 2017, 13% of students graduating from Toni & Guy Hairdressing Academy-Plano completed their program within 100% "normal time" (i.e. 4 years for a 4-year degree). Comparatively, 68% completed their degrees within 150% of the normal time, and 68% within 200%.
The following chart shows these completion rates over time compared to the average for the Carnegie Classification group.
Graduation rate is defined as the percentage of full-time, first-time students who received a degree or award within a specific percentage of "normal time" to completion for their program.
The student demographic with the highest graduation rate at Toni & Guy Hairdressing Academy-Plano is N/A and N/A (N/A% graduation rate). Across all , Asian Female students have the highest graduation rate (68.1%).
The most common race/ethnicity at Toni & Guy Hairdressing Academy-Plano is white (82 degrees awarded). There were 2.48 times more white recipients than the next closest race/ethnicity group, hispanic or latino (33 degrees).
0.787% of degree recipients (1 students) did not report their race.
The most common race/ethnicity and gender grouping at Toni & Guy Hairdressing Academy-Plano is white female (78 degrees awarded). There were 3 times more white female recipients than the next closest race/ethnicity group, hispanic or latino female (26 degrees).
Toni & Guy Hairdressing Academy-Plano has an endowment valued at nearly $N/A, as of the end of the 2017 fiscal year. The return on its endowment was of $200 (NaNN%), compared to the 0.0457% average return ($6.76k on $14.8M) across all .
In 2017, Toni & Guy Hairdressing Academy-Plano had a total salary expenditure of $N/A. Toni & Guy Hairdressing Academy-Plano employs 0 N/A, 0 N/A, and 0 N/A. Most academics at Toni & Guy Hairdressing Academy-Plano are N/A (0), N/A(0), and N/A (0).
The most common positions for non-instructional staff at Toni & Guy Hairdressing Academy-Plano are: N/A, with N/A employees, N/A, with N/A employees, and N/A with N/A employees.
2017 Endowment
growth from 2016
Toni & Guy Hairdressing Academy-Plano has an endowment valued at about $N/A, as of the end of the 2017 fiscal year. The endowment of Toni & Guy Hairdressing Academy-Plano stayed 0% from the previous year. The value of their endowment was $NaNM approximately the same as than the median endowment of according to the Carnegie Classification grouping.
This line chart shows how the endowment at Toni & Guy Hairdressing Academy-Plano (in red) compares to that of some similar universities.
The small bar chart below shows the endowment quintiles for all universities in the Not applicable, not in Carnegie universe (not accredited or nondegree-granting) Carnegie Classification grouping.
Government Grants and Contracts
$0 - Federal
$0 - State
$0 - Local
As of 2017, Toni & Guy Hairdressing Academy-Plano received $0 in grants and contracts from the federal government, $0 from state grants and contracts, and $0 from local grants and contracts.
Salary Expenditure
2017 Salaries
In 2017, Toni & Guy Hairdressing Academy-Plano paid a median of $1.15M in salaries, which represents NaNM% of their overall expenditure ($N/A) and a 10.4% growth from the previous year. This is compared to a 5.45% decline from 2015 and a 14% decline from 2014.
The median for similar is 574k (13.1% of overall expenditures).
Instructional Salaries
In N/A, Toni & Guy Hairdressing Academy-Plano paid a total of $N/A to 0 employees working as instructors, which represents N/A% of all salaries paid.
This is compared to a median of $296k (51.6%) for similar Unknown.
Occupations by Share
Most Common Instructor
false Employees
Most Common Non-Instructional Employee
N/A Employees
In false, the most common positions for instructional staff at Toni & Guy Hairdressing Academy-Plano were false with 0 employees; false with 0 employees; and false with 0 employees.
In false, the most common positions for non-instructional staff at Toni & Guy Hairdressing Academy-Plano were N/A with N/A employees; N/A with N/A employees; and N/A with N/A employees.
Instructors by Academic Rank and Gender
Most Common Demographic
In false, the most common demographic for instructional staff at Toni & Guy Hairdressing Academy-Plano was false with 0 employees, false with 0 employees, and false with 0 employees.
This chart shows the gender split between each academic rank present at Toni & Guy Hairdressing Academy-Plano.
Paul Mitchell the School-Overland Park
Xenon International Academy-Denver
Vogue College of Cosmetology
Houston Training School-Main Campus
Neilson Beauty College

redpajama_set_name: RedPajamaCommonCrawl


Robert Frost was born on March 26, 1874. During his lifetime he had a ton of failed jobs, dropped out of Harvard and suffered through the deaths of his children and wife. In 1912, Frost published his first book of poetry, which was reviewed favorably other famous poets, Ezra Pound and Edward Thomas. Frost credits Thomas as inspiration for his most famous poem "The Road Not Taken" (seen below). Over the course of his life, he earned more than 40 honorary degrees and won the Pulitzer Prize for his books New Hampshire, Collected Poems, A Further Range and A Witness Tree.
At Kennedy's inauguration not wanting to slip, trip and fall, he decided to recite a poem he committed to memory, rather than attempt to read the original that he had written. He died on January 29, 1963, from complications related to prostate surgery. His ashes were interred in a family plot in Bennington, Vermont.


Credit and debit cards are not the only way to pay online. There are over 400 alternative payment methods, all suited to different consumer preferences and demographics.
Our real time fraud prevention solutions are constructed around your specific payment journeys and transaction types. Revenues are kept safe, growth is supported and customer experience and trust is placed front and centre of your business. With instant decision making available, you are in total control.
Access historic data via our simple and intuitive business intelligence portal. Track individual transactions or assess your fraud detection, prevention and payment activities using the latest up-to-the minute data. Create more effective fraud prevention strategies by seeing what's working every time, all the time.
With automatic chargeback handling technology, our risk management system reduces the amount of time you have to allocate to manual reviews. Optimise your risk profiles using historic data and statistical modelling to streamline your customer acceptance process.
Securely accept payments with Centus. Work with Centus.


I only bought it for Major Tom. Thanks for finally putting it on iTunes. But itd be nice to not buy the whole thing. I was just desperate.
Wanted english version of Peter Schilling Coming Home. Looked for years, but finally gave in as the single is not available. If you love this song from the 80s this is the one.
This show uses music from top performers as a backdrop for its key emotional or action packed sequences. The best use of songs to compliment a show I have ever experienced. This could easily have been a double CD as many great songs had to be left off.


The Maud, the ship built for Roald Amundsen for his attempt to reach the North Pole, has been finally freed from her icy prison after eighty –six years.
She had a tough existence. In 1917 Amundsen planned a further scientific expedition. He was inspired by Fridtjof Nansen's 1890s expedition on the Fram, and aimed to sail through the Northeast Passage (via the Baring Strait between Russia and Alaska and into the icy labyrinths of north Canada), allowing the Maud to be frozen in pack ice north of the Baring Strait.
The pack ice formed early in 1918 and within three months Maud was frozen in for the winter. The expedition eventually proceeded eastward in August 1819, only to be caught again for a second winter in September 1919.
After six years the Maud ended up in Nome, Alaska, and was sold to the Hudson Bay Company. In the winter of 1926 she was frozen in, in Cambridge Bay. She sank there in 1930.
In 1990 Maud was sold by the Hudson Bay Co. to Asker, a municipality near Oslo, with the hope that she would be returned to the town, but the plans proved too expensive could not be acted on.
Now she as been salvaged! Jan Wanggaard, who builds Viking longships has worked for six long years between July and September (when the ice melts and the temperature is above zero), to place airbags under the Maud and lift her slowly onto a barge. She is to be transport to Oslo and is in remarkable condition considering her decades in the sea – the sea is so cold that the timbers have been protected from microbial attacks; her hulk is in one piece.
In Oslo she will be displayed in a purpose built museum. Here she can be admired and revered.


text:
Menu Hudson Institute International Relations
Sub-Topics
South Asia East Asia & the Pacific Europe Foreign Aid
Foreign Policy Latin America & the Caribbean Middle East & North Africa Security Alliances
North America Russia & Central Asia International Organizations Sub-Saharan Africa
View Sub-Topics
All Russia & Central Asia
Maritime Irregular Warfare: Preparing to Meet Hybrid Maritime Threats
26 June 26, 2019 Hudson Institute, Washington, D.C. Headquarters
Listen Read Watch
New Perspectives on Shared Security: NATO's Next 70 Years
The Arms Control Landscape Featuring DIA Lt. Gen. Robert P. Ashley, Jr. on Russian and Chinese nuclear weapons.
29 May 29, 2019 Hudson Institute, Washington, D.C. Headquarters
President to Powerbroker: The Future of Nursultan Nazarbayev's Kazakhstan
03 April 3, 2019 Hudson Institute, Washington, D.C. Headquarters
The Ambassadors Series: The Romanian Presidency and the European Union
19 March 19, 2019 Hudson Institute, Washington, D.C. Headquarters
America's Fight Against Russian Dark Money
Poland, NATO, and the Future of Eastern European Security June 26 Event
Dismantling Russian Transnational Crime Organizations: A Conversation with José Grinda Gonzalez May 25 Event
Countering Russian Kleptocracy April 17 Event
17 April 17, 2018 Hudson Institute, Washington, D.C. Headquarters
Reuniting Ukraine through International Cooperation: Options in Donbas March 2 Event
02 March 2, 2018 Hudson Institute, Washington, D.C. Headquarters
The Oligarchs Strike Back? The Challenge of Anti-Corruption Reform in Ukraine December 7th Event
07 December 7, 2017 Hudson Institute, Washington, D.C. Headquarters
Maintaining Transatlantic Unity on Ukraine October 26th Event
26 October 26, 2017 Hudson Institute, Washington, D.C. Headquarters
How Non-State Actors Export Kleptocratic Norms to the West October 11th Event
Russian Interference: Past, Present, and Future July 6th Event
06 July 6, 2017 Hudson Institute, Washington, D.C. Headquarters
Weaponizing Kleptocracy: Putin's Hybrid Warfare June 14th Event
Emerging Tensions in the Black Sea and the Region's Importance to the West May 18th Event
Chinese Repression and Uyghur Militancy at Eurasia's Crossroads April 25th Event
ISIS, Russia, and China: Can America Win a Three-Front Information War? April 18th Event
U.S. Options in Afghanistan and Pakistan April 13th Event
U.S. Sanctions on Russia: Evaluating Impacts and Costs March 30th Event
Kleptocracy and Democracy: A Discussion with Ben Judah
29 March 29, 2017 Rome Auditorium, SAIS, Johns Hopkins University
The Threat of Kleptocracy: States Bordering the Russian Federation October 19th Event
Consolidation and Control: Power Shifts in Putin's Kremlin October 14th Event
The Less You Know, the Better You Sleep: Russia's Road to Terror and Dictatorship under Yeltsin and Putin May 20th Event
"Who Is Mr. Putin?" U.S. and English-Language Film Premiere
U.S. Premiere of "From Russia with Cash" Newseum Event
15 December 15, 2015 Knight Conference Center, Newseum
Fighting Kleptocracy December 14th Event
14 December 14, 2015 Hudson Institute, Washington, D.C. Headquarters
Crime, Kleptocracy, and Politics: Developments in Modern Russia October 13th Event
Does Putin's Move on Syria Make Russia the New Middle East Power Broker? September 29th event
29 September 29, 2015 Hudson Institute, Washington, D.C. Headquarters
Journalism in the Shadow of the Kremlin April 15th Event
Putin's Kleptocracy: Who Owns Russia? December 10th Event
Strategic Deterrence Forces: Ready & Relevant for the 21st Century New York Discussion Series
09 October 9, 2014 Harvard Club, Biddle Room
Vladimir Putin and Russia's Increasingly Aggressive Nuclear Threat October 1st Event
01 October 1, 2014 Hudson Institute, Washington, D.C. Headquarters
Lessons from the Putin Wars in Crimea & Georgia: An Evening with President Mikheil Saakashvili
16 June 16, 2014 The Residences at Mandarin Oriental
Ukraine: Crisis for Central Europe and the Transatlantic Alliance
Rise of Radical Islamism in the South Caucasus: The Threat and the Response
10-10 October 10-10, 2013 Hudson Institute, Washington, D.C. Headquarters
U.S.- Russia Relations: The Future of the Reset
Russia's Presidential Elections: Putinism 2.0 or Better?
Russia: Haunted by Its Communist Past
The Political Situation in Kyrgyzstan: Implications for the United States
After the Domodedovo Attack: The State of Russian Democracy
03 February 3, 2011 Hudson Institute, Washington, D.C. Headquarters
The New START: Its Impact, Its Future
22 November 22, 2010 Hudson Institute, Washington, D.C. Headquarters
Russia and the Rule of Law
Russia's Peacetime Demographic Crisis: Dimensions, Causes, Implications
12 August 12, 2010 Hudson Institute, Washington, D.C. Headquarters
Iran and the Russian Reset
Doolittle Award Dinner in honor of General David Petraeus: Afghanistan and U.S. Strategy
24-24 June 24-24, 2009


Grigory Karasin, a Deputy Foreign Minister of Russia, has warned the Georgian authorities about the "unpleasant surprises" that could be caused by Georgia-NATO cooperation. Georgian politicians have treated this statement as a hidden threat. However, the official Tbilisi abandoned any harsh retaliatory rhetoric.
On February 28 in Prague, the above Grigory Karasin had a meeting with Zurab Abashidze, the Special Representative of the Georgian Premier at negotiations with Russia.
"Despite the accumulated positive, the Georgia's military cooperation with the NATO remains a major irritant in bilateral relations," the Russian Ministry of Foreign Affairs (MFA) has stated following the Karasin's meeting with Abashidze.
On the eve of the meeting, Mr Karasin, speaking on air of the "Echo of the Caucasus", warned Tbilisi against "unpleasant surprises." "We should strive to develop relations in all spheres and warn our Georgian partners against unpleasant surprises, because these surprises will be unpleasant for both of us," said the diplomat.
It is about the Georgia's relations with the NATO, the "Kommersant" explains Mr Karasin's words.
Mr Abashidze has noted, in his comments to Karasin's statement, that at the meeting Karasin did not voice out the warning "in this form."
In their comments on the Karasin's statement, Georgian politicians have noticed that Russia fails to amend its policy and continues threatening Georgia.
"Unfortunately, we have no mechanisms to respond to these threats," said Sergi Kapanadze, the Vice-Speaker of the Georgian Parliament from the oppositional "European Georgia" Party, stated to the "Caucasian Knot" correspondent.
He has criticized Abashidze's response to Karasin's words. Mr Kapanadze considers the wrong position of Abashidze's not paying attention to public statements of the Russian diplomat containing threats, while focusing only on the fact that Karasin did not express such threats during the negotiations.
This article was originally published on the Russian page of 24/7 Internet agency 'Caucasian Knot' on March 2, 2019 at 08:28 am MSK. To access the full text of the article, click here.
NDI poll indicates growth of pro-Western sentiments in Georgia, Georgian political analysts see signal to Russia in Angela Merkel's visit, Political analysts associate Russia's statements about NATO with loss of influence on Georgia.


text:
// Qt includes
#include <QAtomicInt>
#include <QCoreApplication>
#include <QThread>
#include <QVariant>

// CTK includes
#include "ctkErrorLogContext.h"
#include "ctkErrorLogQtMessageHandler.h"
#include <ctkUtils.h>

// STD includes
#include <iostream>

// Handling log messages may generate log messages, which would cause infinite loop.
// We stop handling log messages if the maximum recursion depth is reached.
static QAtomicInt ctkErrorLogQtMessageHandler_CurrentRecursionDepth;

//------------------------------------------------------------------------------
QString ctkErrorLogQtMessageHandler::HandlerName = QLatin1String("Qt");

//------------------------------------------------------------------------------
//Q_DECLARE_METATYPE(QPointer<ctkErrorLogQtMessageHandler>)
Q_DECLARE_METATYPE(ctkErrorLogQtMessageHandler*)

// --------------------------------------------------------------------------
ctkErrorLogQtMessageHandler::ctkErrorLogQtMessageHandler() : Superclass()
{
  this->SavedQtMessageHandler = 0;

  QCoreApplication * coreApp = QCoreApplication::instance();

  // Keep track of all instantiated ctkErrorLogModel
  QList<QVariant> handlers = coreApp->property("ctkErrorLogQtMessageHandlers").toList();
  handlers << QVariant::fromValue(this);
  //handlers << QVariant::fromValue(QPointer<ctkErrorLogQtMessageHandler>(this));
  coreApp->setProperty("ctkErrorLogQtMessageHandlers", handlers);
}

namespace
{
//------------------------------------------------------------------------------
#if QT_VERSION >= QT_VERSION_CHECK(5,0,0)
void ctkErrorLogModelQtMessageOutput(QtMsgType type, const QMessageLogContext& context,
                                     const QString& msg)
{
  ctkErrorLogQtMessageHandler_CurrentRecursionDepth.ref();
  // Allow a couple of recursion levels to get a hint about where and why recursion occurs,
  // so we stop processing the message if recursion depth is over 10.
#if QT_VERSION >= QT_VERSION_CHECK(5,14,0)
  if (ctkErrorLogQtMessageHandler_CurrentRecursionDepth.loadRelaxed() > 10)
#else
  if (ctkErrorLogQtMessageHandler_CurrentRecursionDepth.load() > 10)
#endif
    {
    ctkErrorLogQtMessageHandler_CurrentRecursionDepth.deref();
    return;
    }

  //TODO: use context in the log message
  Q_UNUSED(context)
  // Warning: To avoid infinite loop, do not use Q_ASSERT in this function.
  if (msg.isEmpty())
    {
    ctkErrorLogQtMessageHandler_CurrentRecursionDepth.deref();
    return;
    }
  ctkErrorLogLevel::LogLevel level = ctkErrorLogLevel::Unknown;
  if (type == QtDebugMsg)
    {
    level = ctkErrorLogLevel::Debug;
    }
#if QT_VERSION >= QT_VERSION_CHECK(5,5,0)
  else if (type == QtInfoMsg)
    {
    level = ctkErrorLogLevel::Info;
    }
#endif
  else if (type == QtWarningMsg)
    {
    level = ctkErrorLogLevel::Warning;
    }
  else if (type == QtCriticalMsg)
    {
    level = ctkErrorLogLevel::Critical;
    }
  else if (type == QtFatalMsg)
    {
    level = ctkErrorLogLevel::Fatal;
    }

  QCoreApplication * coreApp = QCoreApplication::instance();
  QList<QVariant> handlers = coreApp->property("ctkErrorLogQtMessageHandlers").toList();
  foreach(QVariant v, handlers)
    {
    ctkErrorLogQtMessageHandler* handler = v.value<ctkErrorLogQtMessageHandler*>();
    Q_ASSERT(handler);
//    //QPointer<ctkErrorLogQtMessageHandler> handler = v.value<QPointer<ctkErrorLogQtMessageHandler> >();
//    //if(handler.isNull())
//    //  {
//    //  continue;
//    //  }
    handler->handleMessage(
          ctk::qtHandleToString(QThread::currentThreadId()),
          level, handler->handlerPrettyName(), ctkErrorLogContext(msg), msg);
    }
  ctkErrorLogQtMessageHandler_CurrentRecursionDepth.deref();
}
#else
void ctkErrorLogModelQtMessageOutput(QtMsgType type, const char *msg)
{
  ctkErrorLogQtMessageHandler_CurrentRecursionDepth.ref();
  // Allow a couple of recursion levels to get a hint about where and why recursion occurs,
  // so we stop processing the message if recursion depth is over 10.
  if (ctkErrorLogQtMessageHandler_CurrentRecursionDepth > 10)
    {
    ctkErrorLogQtMessageHandler_CurrentRecursionDepth.deref();
    return;
    }

  // Warning: To avoid infinite loop, do not use Q_ASSERT in this function.
  if (QString(msg).isEmpty())
    {
    ctkErrorLogQtMessageHandler_CurrentRecursionDepth.deref();
    return;
    }
  ctkErrorLogLevel::LogLevel level = ctkErrorLogLevel::Unknown;
  if (type == QtDebugMsg)
    {
    level = ctkErrorLogLevel::Debug;
    }
  else if (type == QtWarningMsg)
    {
    level = ctkErrorLogLevel::Warning;
    }
  else if (type == QtCriticalMsg)
    {
    level = ctkErrorLogLevel::Critical;
    }
  else if (type == QtFatalMsg)
    {
    level = ctkErrorLogLevel::Fatal;
    }

  QCoreApplication * coreApp = QCoreApplication::instance();
  QList<QVariant> handlers = coreApp->property("ctkErrorLogQtMessageHandlers").toList();
  foreach(QVariant v, handlers)
    {
    ctkErrorLogQtMessageHandler* handler = v.value<ctkErrorLogQtMessageHandler*>();
    Q_ASSERT(handler);
//    //QPointer<ctkErrorLogQtMessageHandler> handler = v.value<QPointer<ctkErrorLogQtMessageHandler> >();
//    //if(handler.isNull())
//    //  {
//    //  continue;
//    //  }
    handler->handleMessage(
          ctk::qtHandleToString(QThread::currentThreadId()),
          level, handler->handlerPrettyName(), ctkErrorLogContext(msg), msg);
    }
  ctkErrorLogQtMessageHandler_CurrentRecursionDepth.deref();
}
#endif
}

// --------------------------------------------------------------------------
QString ctkErrorLogQtMessageHandler::handlerName()const
{
  return ctkErrorLogQtMessageHandler::HandlerName;
}

// --------------------------------------------------------------------------
void ctkErrorLogQtMessageHandler::setEnabledInternal(bool value)
{
  if (value)
    {
#if QT_VERSION >= QT_VERSION_CHECK(5,0,0)
    this->SavedQtMessageHandler = qInstallMessageHandler(ctkErrorLogModelQtMessageOutput);
#else
    this->SavedQtMessageHandler = qInstallMsgHandler(ctkErrorLogModelQtMessageOutput);
#endif
    }
  else
    {
#if QT_VERSION >= QT_VERSION_CHECK(5,0,0)
    qInstallMessageHandler(this->SavedQtMessageHandler);
#else
    qInstallMsgHandler(this->SavedQtMessageHandler);
#endif
    }
}

redpajama_set_name: RedPajamaGithub


To be able to use the samples you must install novaPDF SDK as samples work only with it. Download it here: nova PDF SDK.
If you encounter problems or have questions on using j-Interop, visit their FAQ page. Also, to avoid the "Logon failure: unknown user name or bad password" error, configure DCOM for remote access (detailed here) and make sure your firewall is not turned on.
Basic "Hello World" java console application that generates a PDF file.


text:
Bishops' Pro-Life Flop
News: Video Reports
by Kristine Christlieb • ChurchMilitant.com • March 24, 2022
USCCB pushing social justice under guise of pro-life action
Catholics have been at the forefront of the war against abortion for almost 50 years. But the bishops have been largely ineffectual. Church Militant's Kristine Christlieb tells us about a new pro-life statement that really just promotes "social justice."
The United States Conference of Catholic Bishops is claiming, in a statement released Tuesday, to "stand with moms in need." But it's little more than a continuation of the bishops' effort to emphasize leftist social justice issues instead of ending abortion.
The letter pledges bishops will "join together in prayer and expectant hope that states will again be able to protect women and children from the injustice of abortion." It makes only one passing mention of advocating for "laws that ensure the right to life for unborn children," but it goes on to call for laws ensuring "no mother or family lacks the basic resources needed to care for their children, regardless of race, age, immigration status or any other factor."
Molly Smith, president, Cleveland Right to Life: "They don't get involved with anything that we do that is meaningful; they don't get involved with true pro-life efforts. We have efforts here that we say, 'Pro-life begins at conception.' If we put that kind of language in and we ask for support from the diocese, many times we don't get it."
At the USCCB's 2019 fall meeting, leftists Cdl. Blase Cupich and Bp. Robert McElroy opposed efforts to declare abortion a preeminent issue for Catholic voters.
Smith: "When we move away from focusing on the full pro-life message, then we get the breakdown of the messaging — the breakdown of the impact the diocese has."
In nearly 50 years, it has largely been the laity who have done the heavy lifting in promoting pro-life legislation. Many bishops, however, have been busy cozying up to abortion activists.
The Supreme Court is expected to render around June its decision in Dobbs v. Jackson Women's Health. That case, involving a state pro-life law in Mississippi, could be the key to overturning Roe v. Wade.
The Real Pro-Lifers
Bishops' Voting Video Downplays Abortion
By David Nussman • 0
Bringing America Back to Life
By Rodney Pelletier • 0
5: The Pope Defied
Four Books
But only one really matters.


text:
\section{Introduction}

In this article, we shall study the numerical approximation to the following problem: Given a fixed $T>0$ and a bounded set $\O\subset\R^m$,  find
$u_i:\O\times(0,T)\to\R$ such that, for $i=1,2$,
\begin{align}
& \pt u_i-\Div J_i(u_1,u_2)=f_i(u_1,u_2) && \qtext{in }Q_T=\O\times(0,T),
  \label{eq:pde}\\
& J_i(u_1,u_2)\cdot n =0 && \qtext{on }\Gamma_T=\partial\O\times(0,T),
\label{eq:bc}\\
& u_{i}(\cdot,0)=u_{i0} && \qtext{in }\O,	\label{eq:id}
\end{align}
with flow and competitive Lotka-Volterra functions given by
\begin{align}
 & J_i(u_1,u_2) = u_i\big(a_{i1}\grad u_1 +a_{i2}\grad u_2 +b_i q \big) +
 c_i\grad u_i ,  \label{def:flow}\\
& f_i(u_1,u_2) = u_i \big(\alpha_{i}-\beta_{i1} u_1 - \beta_{i2} u_2 \big) ,
\label{def:reaction}
\end{align}
where, for  $i,j=1,2$, the coefficients $a_{ij},~c_i,~\alpha_i,~\beta_{ij}$ are non-negative constants, $b_i$ is a real constant, $q:\O\times(0,T)\to\R^m$, and $u_{i0}$ are
non-negative functions.

Problem \fer{eq:pde}-\fer{def:reaction} is a generalization of the cross-diffusion model introduced by Busenberg and Travis \cite{busenberg83} and Gurtin and Pipkin \cite{gurtin84} to take into account the effect
of over-crowding repulsion on the population dynamics, see \cite{gs13} for the modelling
details.

Under the main condition
\begin{equation}\label{H:def_pos}
4 a_{11} a_{22} - (a_{12}+a_{21})^2 > a_0 \qtext{a.e. in } Q_T .
\end{equation}
for some positive constant $a_0$, it was proven in  \cite{gs13}  the existence of weak solutions
for rather general conditions on the data problem.
Notice that \fer{H:def_pos} implies the following ellipticity condition on the matrix $A=(a_{ij})_{i,j=1}^2$:
\begin{equation*}\label{cond:ellipticity}
\xi^T A~\xi \geq a_0 \nor{\xi}^2  \qtext{for all } \xi\in\R^2.
\end{equation*}
This condition allows us to, through a procedure of approximation, justify the use of
$\ln u_i$ as a test function in the weak formulation of \fer{eq:pde}-\fer{eq:id}.
Then we get, for the entropy functional
\begin{equation*}
E(t)= \sum_{i=1}^2\int _{\Omega} F(u_i(\cdot,t)) \geq 0, \qtext{with }F(s)=s (\ln s-1)+1,
\end{equation*}
the identity
\begin{align*}
E(t)+ \int_{Q_t } \Big( \sum_{i=1}^2 ( a_{ii} |\grad u_i|^2 + 2c_i\abs{\grad
\sqrt{u_i}}^2 )+ (a_{12}+a_{21}) \grad u_1\cdot \grad u_2 \Big) \\
  = E(0)+
 \int_{Q_t } \sum_{i=1}^2  \Big( -b_i \, q \cdot \grad u_i +
 f_i(u_1,u_2) \ln u_i \Big) .
\end{align*}
From  \fer{H:def_pos} and other minor assumptions one then obtains the entropy inequality
\begin{align*}
E(t)+ a_0 \int _{Q_t} ( |\grad u_{ 1}|^2 + |\grad u_{ 2}|^2)\leq (E(0)+C_1) \, \mathrm{e} ^{C_2 t} ,
\end{align*}
providing the key  $L^2(0, T;H^1(\O))$ estimate of $u_1$ and $u_2$ which allows to prove the existence of weak
solutions.

However, it was also proven in \cite{gs13} that condition \fer{H:def_pos} is just a sufficient condition, and that
solutions may exist for the case of semi-definite positive matrix $A$.

A particular important case captured by problem \fer{eq:pde}-\fer{def:reaction} is the \emph{contact inhibition problem}, arising in tumor modeling, see for instance Chaplain et al. \cite{chaplain06}. In this case, matrix $A$ is semi-definite positive, and the initial data, describing the spatial distribution of normal and
tumor tissue,  satisfy
$\{u_{10}>0\}\cap \{u_{20}>0\} =\emptyset$.

This free boundary problem was
mathematically analyzed by Bertsch et al.
for one \cite{bertsch85} and several spatial dimensions \cite{bertsch12} by using regular Lagrangian flow techniques. In \cite{gs13}, a different approach based on viscosity perturbations was used to prove the existence of solutions. In \cite{gsv13}, the Lagrangian techniques of \cite{bertsch12} were  generalized showing, in particular, the non-uniqueness in the construction of solutions by this method.

In \cite{gs13}, a conforming Finite Element Method was used both for proving the existence of solutions
of the viscosity approximations (or for the case of $A$ satisfying \fer{H:def_pos}), and for
the numerical simulation of solutions. Since in the case of positive semi-definite
 matrix $A$ solutions may develope discontinuities in finite time, the FEM approximations
 exhibit instabilities in the neighborhood of these points. In this article we use
 a deterministic particle method to give an alternative for the numerical simulation of solutions.

In our context, deterministic particle methods were introduced, for the scalar linear diffusion equation, by Degond and Mustieles in \cite{degond1989,degond1990}.
Lions and Mas-Gallic, in \cite{lions01}, gave a rigorous justification of the
method with a generalization to nonlinear diffusion. Gambino et al. \cite{gambino09} studied a particle approximation to a cross-diffusion problem closely related to ours.

Let us finally remark that cross-diffusion parabolic systems have been used
to model a variety of phenomena since the seminal work of Shigesada, Kawaski
and Teramoto \cite{shigesada79}. These models
ranges from ecology \cite{gilad07,tian10,gv11,galiano12,sherrat00},
to semiconductor theory \cite{chen07} or granular materials \cite{aranson02,gjv03}, among others.
Global existence and regularity results for the evolution problem
\cite{kim84,deuring87,yagi93,ggj01,ggj03,chen04,bendahmane10,galiano12},
and for the steady state \cite{lou-ni_96a,lou-ni_96b} have been provided.
Other interesting properties, such as pattern formation, has been
studied in \cite{gambino12,ruiz12,gambino13}. Finally, the numerical discretization has received
much attention, and several schemes have been proposed \cite{ggj01,ggj03,barret04,gambino09,andreianov11,berres11}.

\section{The particle method}

Consider a system of $2N$ particles described by ther masses, $w_k^i>0$, and their
trajectories, $x_k^i:[0,T]\to\O\subset\R^m$, for $k=1,\ldots,N$ (particle labels) and $i=1,2$ (populations).
On one hand, the individual  particles state may be modeled by Dirac delta measures
\begin{equation*}
 \epsilon_{x^i_j(t)}(B)=\left\{
\begin{array}{ll}
 1 & \text{if }x^i_k(t)\in B\\
0 &  \text{if }x^i_k(t)\notin B
\end{array}
\right. \qtext{for all } B\in \B(\R^m ),
\end{equation*}
where $\B(\R^m )$ denotes the Borel $\sigma-$algebra generated by open sets in $\R^m$. On the other hand,
the collective behavior of the discrete system may be given in
terms of the spatial distribution of particles at time $t$,
expressed through the \emph{empirical measures}
\begin{equation*}
 u^N_{i}(t)=\sum_{j=1}^{N} w_k^i \epsilon_{x^i_{k}(t)} ,
\end{equation*}
which give the spatial relative frequency of particles of the $i$-th population, at time $t$.

Using the weak formulation of \fer{eq:pde}-\fer{eq:id} and assuming, for the moment, $f_i=0$, we find that $x_k^i$ satisfy, formally
\begin{equation}
\label{ode.1}
 \frac{d}{dt} x_k^i(t)=\frac{1}{u_i^N(x_k^i(t))}J_i(u_1^N(x_k^i(t)),u_2^N(x_k^i(t))).
\end{equation}
We may then initialize this system of ODE's with a suitable particle approximation of the initial data $u_{i0}$ to find an approximation to the solution of problem \fer{eq:pde}-\fer{eq:id}.

Since the Dirac delta measure is difficult to handle, one usually introduces a regularizing non-negative
symmetric kernel $\xi_\eps$ such that $\xi_\eps(x)=\eps^{-m}\xi(x/\eps)$,
with $\int_{\R^m} \xi =1$ and $\xi_\eps\to \delta$ as $\eps\to 0$, where $\delta$ denotes the Dirac delta distribution. The Gaussian kernel is a common choice.

Then, we look for functions
\begin{equation}
\label{def:ueps}
 u_i^{N,\eps}(x,t)=\sum_{k=1}^N w_k^i\xi_\eps(x-x^i_k(t))
\end{equation}
such that \fer{ode.1} is satisfied with $u_i^N$ replaced by  $u_i^{N,\eps}$, i.e.
\begin{equation}
 \label{ode.2}
 \left\{
 \begin{array}{ll}
 \dfrac{d}{dt} x_k^i(t)= -\Big(a_{i1}\grad u_1^{N,\eps}(x_k^i(t)) +a_{i2}\grad u_2^{N,\eps}(x_k^i(t))+ c_i\dfrac{\grad u_i^{N,\eps}(x_k^i(t))}{u_i^{N,\eps}(x_k^i(t))} +b_i q  \Big), \\
 x_k^i(0)=x_{0k}^i,
 \end{array}
 \right.
 \end{equation}
for $i=1,2$, and with $x_{0k}^i$ such that $u_i^{N,\eps}(x,0)$ is a suitable approximation to the initial data $u_{i0}(x)$ . In the formula above, the gradients are computed as
\begin{equation*}
 \grad u_i^{N,\eps}(x,t)=\sum_{k=1}^N w_k^i\grad \xi_\eps(x-x^i_k(t)).
\end{equation*}

Observe that he existence and uniqueness of solution to problem \fer{ode.2} is guaranteed by the Lipschitz
continuity of the right hand side term.

\subsection{Implementation}

For the implementation details, we consider the one-dimensional spatial case, i.e. $m=1$. Let us introduce some notation.

Let $\O=(a,b)$. Problem \fer{ode.2} may be rewritten as:
For $i=1,2$, find $\mathbf{x}^i(t):=(x^i_k(t))_{k=1}^N:[0,T]\to\O^N$ and $\mathbf{w}^i:= (w^i_k)_{k=1}^N$ with $w^i_k>0$,  satisfying
\begin{equation}
\label{systemODEs}
 \left\{
 \begin{array}{l}
 \dfrac{d\,}{dt} \mathbf{x}^i (t) = \mathbf{g}^i(t,\mathbf{x}^1(t),\mathbf{w}^1,\mathbf{x}^2(t),\mathbf{w}^2) \quad \text{for } t\in (0,T)\, ,\\[1ex]
 \mathbf{x}^i(0) = \mathbf{x}^i_0 ,
 \end{array}
 \right.
\end{equation}
where
\begin{equation*}
\begin{array}{ll}
g^i_k(s,\mathbf{y}^1,\mathbf{v}^1,\mathbf{y}^2,\mathbf{v}^2):= &
-\Big(a_{i1}\grad u^{N,\eps}(y_k^i;\mathbf{y}^1,\mathbf{v}^1) +a_{i2}\grad u^{N,\eps}(y_k^i;\mathbf{y}^2,\mathbf{v}^2)\Big.\\
& \qquad \Big. + c_i\frac{\grad u^{N,\eps}(y_k^i;\mathbf{y}^i, \mathbf{v}^i)}{u^{N,\eps}(y_k^i;\mathbf{y}^i, \mathbf{v}^i)} +b_i q(y^i_k,s)  \Big),
\end{array}
\end{equation*}
for any $\mathbf{y}^1,\mathbf{v}^1,\mathbf{y}^2,\mathbf{v}^2\in\mathbb{R}^N$ and $s\in (0,T)$, and
we introduced the following generalized counterpart of (\ref{def:ueps}):
\begin{equation*}
 u^{N,\eps}(x;\mathbf{y},\mathbf{v})=\sum_{k=1}^N v_k \, \xi_\eps(x-y_k) \quad \forall \mathbf{y},\mathbf{v}\in\mathbb{R}^N,\, x\in\mathbb{R}\,.
\end{equation*}
 Notice that, so defined, function $\mathbf{g}^i$
 may lead to numerical instabilities when  $u^{N,\eps}(y_k^i;\mathbf{y}^i, \mathbf{v}^i)$ cancels; thus, to avoid divisions by zero, we introduce a parameter $\tilde{\eps}>0$ small enough and approximate $g^i_k(s,\mathbf{y}^1,\mathbf{v}^1,\mathbf{y}^2,\mathbf{v}^2)$ by
\begin{equation*}
\begin{array}{ll}
\tilde{g}^{i}_k(s,\mathbf{y}^1,\mathbf{v}^1,\mathbf{y}^2,\mathbf{v}^2):= &
-\Big(a_{i1}\grad u^{N,\eps}(y_k^i;\mathbf{y}^1,\mathbf{v}^1) +a_{i2}\grad u^{N,\eps}(y_k^i;\mathbf{y}^2,\mathbf{v}^2)\Big.\\
& \qquad \Big. + c_i\frac{ u^{N,\eps}(y_k^i;\mathbf{y}^i, \mathbf{v}^i) \, \grad u^{N,\eps}(y_k^i;\mathbf{y}^i, \mathbf{v}^i)}{(u^{N,\eps}(y_k^i;\mathbf{y}^i, \mathbf{v}^i)) ^2 + \tilde{\eps}^2} +b_i q(y^i_k,s)  \Big).
\end{array}
\end{equation*}

In order to approximate system (\ref{systemODEs}), we apply a time discretization
based on an \emph{implicit midpoint formula}. More precisely, we fix a constant time  step $\Delta t=T/M$ ($M\in\mathbb{N}$) and, given ${u}^{i,n}\approx {u}^i(t_n)$ a particle approximation with the associated positions $\mathbf{x}^{i,n}\approx \mathbf{x}^i(t_n)$ ($i=1,2$) and weights $\mathbf{w}^i $, we approximate $u^{i,n+1}\approx u^i(t_{n+1})$ as follows:
\begin{enumerate}
 \item[1.] Approximate  the position of the associated particles at time $t_{n+1/2}$, $\mathbf{x}^{i,n+1/2}\approx \mathbf{x}^i(t_{n+1/2})$, using  an implicit Euler rule:
\begin{equation}\label{nonlinear-algeq}
\mathbf{x}^{i,n+1/2}=\mathbf{x}^{i,n}+\frac{\Delta t}{2}\, \tilde{\mathbf{g}}^i (t_{n+1/2},\mathbf{x}^{1,n+1/2}, \mathbf{w}^1,\mathbf{x}^{2,n+1/2},\mathbf{w}^2) \, .
\end{equation}
 \item[2.] Approximate  the position of the associated particles at time $t_{n+1}$, $\mathbf{x}^{i,n+1}\approx \mathbf{x}^i(t_{n+1})$, using  an explicit Euler rule:
$$
\mathbf{x}^{i,n+1}=\mathbf{x}^{i,n+1/2}+\frac{\Delta t}{2} \, \tilde{\mathbf{g}}^i(t_{n+1/2},\mathbf{x}^{1,n+1/2},\mathbf{w}^1,\mathbf{x}^{2,n+1/2},\mathbf{w}^2)\, .
$$
\item[3.] Approximate $u^{i,n+1}\approx u^i(t_{n+1})$ taking advantage of the approximate position of the associated particles $\mathbf{x}^{i,n+1}$:
$$
u^{i,n+1}:=u^{N,\eps}(\cdot ;\mathbf{x}^{i,n+1},\mathbf{w}^i)\, .
$$
\end{enumerate}
Notice that the first step above requires the determination of the solution of the  nonlinear algebraic equation (\ref{nonlinear-algeq}). We compute an approximation to such solution by applying a fixed point algorithm.
It consists of the following steps:
\begin{enumerate}
 \item[1.1.] Initialize $\mathbf{x}^{i,n+1/2,1}:=\mathbf{x}^{i,n}$.
 \item[1.2.] For $j=1,2,\ldots $, given $\mathbf{x}^{i,n+1/2,j}$,
  $$
\mathbf{x}^{i,n+1/2,j+1}=\mathbf{x}^{i,n}+\frac{\Delta t}{2} \, \tilde{\mathbf{g}}^i(t_{n+1/2},\mathbf{x}^{1,n+1/2,j},\mathbf{w}^1,\mathbf{x}^{2,n+1/2,j},\mathbf{w}^2) \quad (i=1,2) \, .
$$
 \item[1.3.] Check the stopping criteria,
 $$
 \max_{i=1,2}\max_{x\in C_N } | u_i^{N,\eps}(x;\mathbf{x}^{i,n+1/2,j+1},\mathbf{w}^i) - u_i^{N,\eps}(x;\mathbf{x}^{i,n+1/2,j},\mathbf{w}^i) |    \leq tol \cdot \Delta t \, .
 $$
\end{enumerate}
Here, $tol>0$ is a tolerance parameter and $C_N$ is a finite set of points. In our experiments, we take $tol=4\cdot 10^{-6}$, and $C_N$ given by a uniform grid of points of $\Omega$,
$$
C_N :=\{x_k:=a+(k-1)\Delta x;\quad k=1,2, \ldots , N \} \,
$$
with $\Delta x=\frac{b-a}{N-1}$.

Notice that the initial condition in (\ref{systemODEs}) is given in terms of the initial location of the particles, whereas that of the original problem, (\ref{eq:id}), provides a value of their spatial distribution. In this sense, given an initial condition $u^i(\cdot ,0)=u_{i0}$ in $\O$, we must study how to initialize $\mathbf{x}^i_0$ and $\mathbf{w}^i$ in such a way that
\begin{equation}\label{icond_aprox}
 u^{N,\eps}(\cdot ;\mathbf{x}^i_0,\mathbf{w}^i)\approx u_{i0}\quad\text{in }\O\, .
\end{equation}
On the one hand, to initialize the  positions, we used a uniform grid of $\O$, that is, we simply took  the set of points $C_N$:
$$
\mathbf{x}^i_0:=(x_k)_{k=1}^N \, .
$$
On the other hand, to initialize the weights, one is temted to impose (\ref{icond_aprox}) exactly on the points of $C_N$. However, in doing so, negative weights arise, spoiling the convergence of the method. In consequence, we compared two different strategies:
\begin{itemize}
\item define $w^i_k:=\Delta x\, u_{i0}(x_k)$;
\item solve the following constrained linear least-squares problem:
$$
\text{find $\mathbf{w}^i\in\mathbb{R}_+^N$ that minimizes $||A\mathbf{W}-\mathbf{u}_{i0}||_2^2$ for $\mathbf{W}\in\mathbb{R}_+^N$ }\, ,
$$
where $A_{k,l}:= \xi_\eps(x_k-x_l)$ and $\mathbf{u}_{i0}:= (u_{i0}(x_k))_{k=1}^N$.
\end{itemize}
Although the first approach is faster, it introduces too much diffussion, whereas the second provides a more accurate approximation while preserving stability.

A similar strategy applies to the particle redistribution  after several time steps. Indeed, let us recall that particle redistribution is tipically needed in particle simulations to avoid that particles get concentrated in some parts of the domain: if so, too big gaps between particles will arise in other parts, producing numerical instabilities. We refer to \cite{barbaetal2005} for a review on this issue and some alternative strategies that apply.

Finally, the boundary conditions (\ref{eq:bc}) are taken into account by means of a specular reflection whenever a particle location is changed. Although this is the most common approach to non-flow boundary conditions,
border effects are noticiable in simple discretization schemes.

\section{Numerical experiments}

\subsection{The Finite Element Method discretization}

For comparison purpouses, we use the Finite Element approximation of
\fer{eq:pde}-\fer{eq:id} introduced in \cite{gs13}, eventually using the regularization
of the flows \fer{def:flow} given by
\begin{equation}
\label{reg:flow}
J_i^{(\delta)}(u_1,u_2)= J_i(u_1,u_2) +\frac{\delta}{2} \Delta(u_iu),
\end{equation}
for $\delta\ge0$. The approximation is obtained by using a
semi-implicit Euler scheme in time and a $\mathbb{P}_1$ continuous finite element
approximation in space, see
\cite{gs13} for the details where, in particular, the convergence of the fully discrete approximation to the
continuous solution is proved.

We now sketch the FEM scheme. Let   $\Delta t>0$ be the time step of the discretization. For $t=t_0=0$, set $u_{\epsilon
i}^0=u_i^0$. Then, for $n\geq 1$ the problem is to find $u_{\epsilon
i}^{n}\in S_h$, the finite element space of piecewise $\mathbb{P}_1$-elements, such that for,  $i=1,2$,
\begin{equation}\label{eq:pde_discr.s4}
\begin{array}{l}
\frac{1}{\Delta t}\big( u^n_{\epsilon i}-u^{n-1}_{\epsilon i} , \chi )^h + \big(
J^{(\delta)}_i(\Lambda _{\epsilon } (u^n_{\epsilon 1}),\Lambda _{\epsilon } (u^n_{\epsilon
2}),\nabla u^n_{\epsilon 1},\nabla u^n_{\epsilon 2}  ) ,\nabla\chi \big)^h =\\ [2ex]
\hspace*{1cm} = \big(\alpha_{i} u^n_{\epsilon i} - \lambda _{\epsilon } (u^n_{\epsilon i}) (
\beta_{i1} \lambda _{\epsilon } (u^{n-1}_{\epsilon 1}) + \beta_{i2} \lambda
_{\epsilon } (u^{n-1}_{\epsilon 2}) ) , \chi \big)^h ,
\end{array}
\end{equation}
for every $ \chi\in S^h$.
Here, $(\cdot,\cdot)^h$ stands for a discrete semi-inner product on
$\mathcal{C}(\overline{\Omega} )$. The parameter $\epsilon>0$ makes reference to the
regularization introduced by some functions $\lambda_\epsilon$ and $\Lambda_\epsilon$, which
converge to the identity as $\epsilon\to0$, see \cite{gs13}.

Since \eqref{eq:pde_discr.s4} is a nonlinear algebraic problem, we use a fixed point
argument to approximate its solution,  $(u_{\epsilon 1}^n,u_{\epsilon 2}^n)$, at each time
slice $t=t_n$, from the previous approximation $u_{\epsilon i}^{n-1}$.  Let $u_{\epsilon
i}^{n,0}=u_{\epsilon i}^{n-1}$. Then, for $k\geq 1$ the problem is to find $u_{\epsilon
i}^{n,k}$ such that for $i=1,2$, and for all $\chi \in S^h$
\begin{equation*
\begin{array}{l}
 \frac{1}{\Delta t}\big( u^{n,k}_{\epsilon i}-u^{n-1}_{\epsilon i} , \chi )^h
+ \big( J^{(\delta)}_i(\Lambda _{\epsilon } (u^{n,k-1}_{\epsilon 1}),\Lambda _{\epsilon }
(u^{n,k-1}_{\epsilon 2}),\nabla u^{n,k}_{\epsilon 1},\nabla u^{n,k}_{\epsilon 2}  )
,\nabla\chi \big)^h =\\ [2ex] \hspace*{1cm} = \big(\alpha_{i} u^{n,k}_{\epsilon i} - \lambda
_{\epsilon } (u^{n,k-1}_{\epsilon i}) ( \beta_{i1} \lambda _{\epsilon } (u^{n-1}_{\epsilon
1}) + \beta_{i2} \lambda
_{\epsilon } (u^{n-1}_{\epsilon 2}) ) , \chi \big)^h .
\end{array}
\end{equation*}
We use the stopping criteria $\max _{i=1,2}
\|u_{\epsilon,i}^{n,k}-u_{\epsilon,i}^{n,k-1}\|_\infty <\text{tol}$, for empirically chosen
values of $\text{tol}$, and set $u_i^n=u_i^{n,k}$.

\subsection{Experiments}

\no\emph{Experiment 1.}
We consider a particular situation of the contact-inhibition problem in which an explicit
solution of \eqref{eq:pde}  may be computed in terms of a suitable combination of the
Barenblatt explicit solution of the porous medium equation, the Heavyside function and the
trajectory of the contact-inhibition point. To be precise, we construct a solution to the
problem
\begin{align}

& \partial_t u_{i} - (u_i (u_1+u_2)_x)_x =0&& \text{in }(-R,R)\times(0,T)=Q_T,&\label{eq:s1}\\
&u_i (u_1+u_2)_x = 0 &&\text{on } \{-R,R\}\times(0,T),& \label{eq:s2}
\end{align}
with
\begin{equation}
\label{def:us}
 u_{10}(x)=H(x-x_0)B(x,0), \quad u_{20}(x)=H(x_0-x)B(x,0).
\end{equation}
Here, $H$ is the Heavyside function and $B$ is the Barenblatt solution of the porous medium
equation corresponding to the initial datum $B(x,-t^*)=\delta_0$, i.e.

\begin{equation}
\notag \label{barenblatt}
 B(x,t)= 2 (t+t^*)^ {-1/3} \big[1-\frac{1}{12}x^ 2(t+t^*)^ {-2/3}\big]_+.
\end{equation}
For simplicity, we consider problem \eqref{eq:s1}-\eqref{def:us} for $T>0$ such that
$r(T)<R^ 2$, with $r(t)=\sqrt{12}(t+t^*)^ {1/3}$, so that $B(R,t)=0$ for all $t\in[0,T]$.
The point $x_0$ is the initial contact-inhibition point, for which we assume $|x_0|<r(0)$,
i.e. it belongs to the interior of the support of $B(\cdot,0)$, implying that the initial
mass of both populations is positive. Observe that $u_1+u_2$ satisfies the porous medium
equation, implying regularity properties for this sum, among others, the differentiability
in the interior of its support.

It can be shown \cite{gsv13} that
the functions
\begin{equation}
\notag
 u_1(x,t)=H(x-\eta(t))B(x,t),\quad u_2(x,t)=H(\eta(t)-x)B(x,t),
\end{equation}
with $\eta(t)=x_0(t/t^*)^{1/3}$, are a weak solution of problem \eqref{eq:s1}-\eqref{def:us}.

We use the FEM scheme and the particle method scheme to produce approximate solutions to
problem \fer{eq:s1}-\fer{def:us} for $R=1$ and a resolution of $N=1000$ (nodes or particles). In this experiment,
the FEM scheme behaves well without the addition of the regularizing term in \fer{reg:flow}, i.e. we
take $\delta=0$. The initial data
is given by \fer{def:us} with $t_*=0.01$.

We run the experiments till the final time $T=0.01$ is reached. We use a small
time resolution in order to capture the discontinuity of the exact solution. As suggested in \cite{degond1990}
the restriction $\Delta t = C\eps^2$ must be impossed in order to get stability. We chose
\begin{equation*}
 \Delta t = 0.1 \eps^2,\qtext{with }\eps=0.15 dx^{0.75},
\end{equation*}
and $dx=1/N$. This high time resolution implies that the fixed point algorithms to solve the nonlinearities
is scarcely used. Particle spatial redistribution is neither needed in this experiment.

Although both algorithms produce similar results, i.e. a good approximation outside a small
neighborhood of the discontinuity $x=0$, they behave in a different way. On one hand, the particle method needs
 fewer particles to cover the discontinuity, see Figs.~\ref{exp1_1.fig} and \ref{exp1_2.fig}. On the other hand, the particle method creates oscillating instabilities in a large region of the positive part of the solution, effect which is not observed in the case of the FEM. In any case, the global errors are similar. In particular, the mean relative square error is of  order $10^{-2}$.

\bigskip

\no\emph{Experiment 2.}
Another instances of the contact-inhibition problem are investigated. In Fig.~\ref{exp2_1.fig}, we show approximate
transient solutions obtained by the Particle method (continuous line) and Finite Element method (dotted line)
of two problems given in the form
\begin{align*}

& \partial_t u_{i} - (u_i (a_{i1}u_{1x}+a_{i2}u_{2x} +b_iq) )_x =0&& \text{in }(0,1)\times(0,T),&\\
&u_i (a_{i1}u_{1x}+a_{i2}u_{2x} +b_iq) = 0 &&\text{on } \{0,1\}\times(0,T),&
\end{align*}
with
\begin{equation*}
 u_{i0}(x)=\text{e}^{ - (\frac{x-x_i}{0.001})^2},\qtext{for } x_1=0.4,\quad x_2=0.6,
\end{equation*}
and $q(x)=-3(x-0.5)$.

For the first problem (left panel of Fig.~\ref{exp2_1.fig}) we choose
\begin{equation*}
 A=(a_{ij})=\left(\begin{array}{cc} 3 & 3 \\ 1 & 1\end{array}\right),\quad b_1=b_2=0,
\end{equation*}
and for the second problem (right panel of Fig.~\ref{exp2_1.fig}) we choose
\begin{equation*}
 A=(a_{ij})=\left(\begin{array}{cc} 1 & 1 \\ 1 & 1\end{array}\right),\quad b_1=1,~ b_2=10,
\end{equation*}
implying that matrix $A$ is positive semi-definite in both cases. Differently than in Experiment 1,
the sum $u_1+u_2$  does not satisfy more than a continuity regularity property for these problems. Indeed, a jump of the derivative
may be observed at the contact inhibition point. This effect is explained by the differences in the flows on
the left and on the right of the contact inhibition point.

As it can be seen in the figures, Particle and Finite Element methods provide a similar approximation.
Only at the contact inhibition point some differences may be observed. The $L^2$ relative error is, as in the Experiment~1,  of  order $10^{-2}$.

The discretization parameters
are
\begin{equation*}
 \Delta t = 0.5 \eps^2,\qtext{with }\eps=0.5 dx^{0.75},
\end{equation*}
and $dx=1/N$, with $N=1000$. The regularized flow \fer{reg:flow} is used in the FEM scheme with $\delta=10^{-3}$. The experiments are run till the final time $T=0.01$ (left panel) and $T=0.02$ (right panel).

\section{Conclusions}

The contact inhibition problem, i.e. Equations \fer{eq:pde}-\fer{def:reaction} completed with
initial data with disjoint supports, is an interesting problem from the mathematical point of
view due mainly to the possibility of their solutions developing discontinuities in finite time.

Although there has been some recent progress in the analytical understanding of the problem \cite{bertsch12,gs13,gsv13}, the numerical analysis is still an open problem. In this paper we have presented
in some extension a Particle method to produce approximations to the solutions of the problem. We have
compared these solutions to exact solutions and to approximate solutions built through the Finite Element Method.

In general terms, the Particle Method is more computer time demanding, and somehow unstable with respect to the resolution parameters when we compare to FEM. However, if the resolution is high enough, it can better capture the discontinuities arising in the solution. Although we performed our experiments in a one dimensional setting,
Particle Methods are specially useful for higher dimensions, due to the easiness of their implementation and parallelization. In future work we shall investigate these extensions.

redpajama_set_name: RedPajamaArXiv


Quick note with some awesome news.
I'm really stoked to announce that I've accepted a position as Associate Creative Director, Copy, at PARTNERS+simons, a boutique ad agency in Boston specializing in the healthcare and financial services space. I couldn't be more excited.


text:
All posts tagged "have"
LHP Prospect Biddle to have Tommy John surgery
The Phillies announced on Sunday that lefty pitching prospect Jesse Biddle will require Tommy John surgery after suffering damage to the ulnar...
Multiple Teams Have Exchanged Proposals With Phillies For Utley
In the last 24 hours, there has been a flurry of Chase Utley news related to the possibility of the All-Star second...
Prediction: Ryan Howard Will Have 30+ Home Runs and 100+ RBIs.
It is no secret that Ryan Howard in recent years has been a shell of what he was from 2006-2011, where he...
Phillies Have Major Questions Heading into Spring Training
Spring Training is about to begin; this is normally the time we wax poetic about the grass being green, a new slate,...
Hamels to St. Louis? Cards Have the Right Prospects
MLB.com columnist, Richard Justice, wrote a piece yesterday discussing the possibility of Cole Hamels being traded to the Cardinals. "They're one of...
Rumor: Padres Have Explored Trade for Hamels
I apologize for this Hot Stove item in advance as it doesn't seem there are a whole lot of legs to it right...
Report: Phils Have "Serious Discussions" With Seattle About Byrd
According to Seattle Mariners' beat writer Ryan Davish, Marlon Byrd has indicated he is willing to waive his no trade clause to...
Report: Pettibone to Have Exploratory Shoulder Surgery
As reported by multiple outlets, RHP Jonathan Pettibone will have "exploratory right shoulder surgery" tomorrow. The 23-year old from Anaheim, CA was...
How many wins will the Phillies have at the All-Star Break?
After 55 games this season, the Phillies have mustered 24 wins. There are 40 games remaining before the All-Star game – mostly...
Greene to have surgery, will miss two months
Following up with more exclusive details on news that was broken here last week, outfield prospect Larry Greene Jr. is expected to...
Sandberg, Franco, Bell and What Could Have Been
As discussed yesterday, Pat and I have been preparing lists and things for the site. One of the lists we have been...
Hey Phillies Fan, Have Some Optimism!
Negadelphian. Philadelphians are known for being overly negative, having a doomsday complex when it comes to our sports teams. And no team...
Tanaka Would Have Looked Nice in Phillies Pinstripes
Forget about it now, there's no point. There's really no reason for the Phillies to even waste their time pursuing Japanese pitching...


Overview: Chris Boscolo, CEO of lifeID, discusses the benefits of Blockchain Technology Security and how it relates to identity privacy in the business world.
Blockchain is a technology that serves as a secure point of coordination that allows a network of computers to come to an agreement on information and share that information with other computers without owning or controlling that process.
LifeID provides a single identity to the user to interact securely with the world. It's an app that identifies the user to any chosen technology without using any usernames and passwords because lifeID uses your smartphone's biometrics to identify you. Prior to founding lifeID, Chris Boscolo was Vice President of Development for Optimum Energy, a company that builds and markets cloud-based software solutions that optimize some of the world's largest HVAC systems.
Neal Howard: Hello and welcome to Talkers.FM Business Radio. I'm your host Neal Howard, thank you for taking the time today. Our guest is Mr. Chris Boscolo with lifeID and he's joining us on the program today to talk about blockchain technology and how that technology relates to identity, privacy and things of that nature in business. Welcome to the program Chris.
Chris Boscolo: Thank you very much Neal, glad to be on it.
Neal: Thanks. Well we're talking about blockchain technology, what is blockchain?
Chris: So blockchain is a technology that allows for a network of computers to come to agreement on information and share that information with other computers without any one computer owning, or controlling or managing that process. It's a shared process that all the computers agree to follow a certain set of rules and by following those rules, they all get to participate in this network.
Neal: Now you're with lifeID. Give us a bit of background about yourself and talk about starting lifeID.
Chris: Sounds good. So first of all, my background is I come from internet security background. I worked many years in building firewall and VPN technology which used significant amount of cryptography and the various protocols that run and drive our internet. lifeID is a new way for users to login to websites and share information about themselves in such a way where they get to preserve and choose what parts of their personal information they're going to share with the other parties and it uses the blockchain as a secure point of coordination for the identifiers that they're going to use to share with other people. And so for example, let's imagine a scenario where you're going to log into a website that you're going to rent an apartment from. So in today's world, you'd give them a username and a password and then once you're logged in, you would share all of this information about your current employer, how much money you make and you would send all this information to that website. They would then turn around and look it up in centralized databases like Equifax and these places that are storing our central data about our privacy information. With lifeID, it flips the problem around. Instead of logging in with a username and password, you use a cryptographic identifier that you choose and you possess and you use the blockchain to coordinate what that identifier is with that website. And then in addition to that, instead of sending all of this information about yourself, you send these cryptographically signed claims that for example from your employer might say, "Yes, Chris is employed at this company. He's been here since 1999 or 2014 or whatever and he earns above this amount of money." And by sending that over to the rental website, the rental site can then confirm that that employer did indeed sign it cryptographically so they can prove that the information is correct and the blockchain is a very secure platform for securing that information. And then that information that I sent them is only a small portion of what they need to know in order to carry out their business like for example, I am employed at that particular place of employment or I earn above some income without actually specifying what my income was.
Neal: So if I'm understanding correctly, rather than a "shotgun effect" when you give personal information, you get to pinpoint which information you give that is pertinent only to that recipient and then that recipient doesn't have the opportunity or the ability to share information with others that they might need that has nothing to do with your particular transaction, is that correct?
Chris: That is exactly correct.
Neal: So this technology, it sounds extremely uncomplicated. Having a background in internet security, what are the chances of some unscrupulous characters working around the security?
Chris: Well that's a great question. And if you've been following what's going on with cryptocurrency and Bitcoin and all of those things, let's take Bitcoin as an example. The Bitcoin network is worth oh my goodness, worth of 100 billion right now, right? That creates a very, very large financial target for people to try to circumvent the security if you will. So the benefit to the rest of us for using blockchain is because there's such a big prize on that network financially for trying to break the cryptography or figure out ways to get around it, it means there's a lot of people doing it which means that after Bitcoin spent now and that's in existence since 2009 and has had no successful attacks against, it gives us really good confidence that the security layer is rock-solid. And so, that's something that as we use this technology for other applications, we have the confidence of knowing the security layer is pretty rock-solid and it's unlikely that somebody is going to be able to circumvent the security measures.
Neal: What about just mentioning Bitcoin, the mining. Is all of the security based on the electronics, based on these servers and their cooperation with each other, how much human interfacing is done to make this transaction secure?
Chris: So there's two parts to this answer. The mining part has to do with arriving at consensus on updates to the shared information and then there's cryptography that's involved with actually securing the data. There's a lot of research and there's a lot of ongoing developments on the cryptography side and we feel pretty comfortable with the key sizes we're using today that the measure of the secure nature of the cryptography itself. So the information that we share using the cryptography, there's a high degree of certainty that that's not going to be vulnerable for many, many, many, many, many years. The mining part of it though has to do with as I said with the consensus on all of us agreeing that the update that I presented with my identifier is the one that everybody should use. That part of the network protocol if you will is definitely vulnerable for mining attacks if you want to look at those. But there again, Bitcoin is one example of a blockchain based network that has survived as I said of nearly ten years of people trying to attack it and thus far has been resilient.
Neal: Let's talk about the financial benefits. Obviously from a security standpoint, saving money by not having to resolve security issues, or legally or otherwise, how is a company going to benefit greatly financially as far as efficiency is concerned?
Chris: So there are the efficiency gains. The one thing that lifeID strives to do is make the user experience so much better than the password model that we're using today that users actually enjoy the experience and its adoption for example for signing up new users will be higher. But there's another aspect that's coming into play which is nations and even in the United States are pushing regulations of the form of for example in Europe, there's GDPR which are regulations that are intended to preserve the privacy of the individual and requiring that companies follow certain privacy first designs and regulations about what can be disclosed and how their information can be shared. And so, the fines for not following these regulations are going to be quite high for companies. And so, an approach for identity that is this privacy first approach that the lifeID architecture embraces is going to help companies navigate these regulations that are coming in the next one to five years. So there'll be a large efficiency from just the user experience being more efficient but then there's also this ability to satisfy the regulatory side of what's going to be coming in the next five years and in a way that's going to preserve the privacy of the individuals.
Neal: We'd like to learn some more about lifeID, where can we go online and do that?
Neal: Great. Chris Boscolo, CEO of lifeID. Thank you so much for joining us here on the program today, it's been a pleasure.
Chris: Thank you very much Neal.
Neal: You've been listening to Talkers Business Radio. I'm your host Neal Howard. Transcripts and the audio of this program are available at Talkers.FM.


We use a detailed bottoms-up approach examining 50+ regional producing areas in the U.S. to deliver a daily and monthly production forecast. The forecast incorporates state well-level data from major oil producing areas, a price-adjusting rig forecast, and our first-hand monitoring of pipeline flow and rail movements to produce the most detailed and accurate production forecast on the market. Data is reported on an aggregated basis by basin (Permian, Bakken, Utica, Eagle Ford, and Niobrara, etc) and by crude quality (heavy, intermediate, light, and condensate).
Market Experts: Our forecast team is at your disposal and ready to answer questions about our forecasts, assumptions, and our views on market dynamics.
Timely: Collecting raw data is straightforward, however identifying data that is pertinent and likely to change the analytical framework and trends is paramount to producing an accurate, highly repeatable forecast product.
Accurate Forecasts: This is the only dynamic forecast proven to improve overall accuracy and extend the degree of insight further into the future. Real-time production estimates reduce reliance on state data and help to identify production outages in real-time, such as freeze off and hurricanes impacts.
Make efficient, smart decisions with data compiled and analyzed on the growing U.S. crude oil market.
Our accurate production forecasts provide primary insight into supply and demand balances and resulting market prices.


Stanmore is a suburban residential district of Northwest London in the London Borough of Harrow. It is characterised by numerous small restaurants and cafes. Stanmore's extensive residential areas are leafy and predominantly affluent, with many residents commuting daily to jobs in central London including the City.
Average Price for property in Stanmore is around £623,891 which varies based on type of property you are interested in and ranges from £1,184,629 for detached house to around £516,803 for semi-detached. Similarly terraced house is around £511,072 and a flat is worth £426,843. Values have been changing and have risen £2,143 in last 3 months alone. Similar historical trend can be observed in price changes e.g. prices changed £13,110 in last 6 months, £67,554 in last 1 year, £115,014 in last 2 years, £124,438 in last 3 years, £112,127 in last 4 years and £137,489 in last 5 years.
Currently average asking price of a property in Stanmore is around £967,075 based on approximately 404 properties for sale. Same is the case with rental options based on 113 properties up for rent, average asking rent is around £1,934 per month.
Buyers are willing to pay high dollar prices to grab these properties because of the recent trend in real estate investment especially in Stanmore area. In last 1 year alone average price buyer paid is around £598,769 based on approximately 404 sales in Stanmore area alone. If you compare it to last 3 years sales of 1,213 properties where buyers paid around £500,697. It has been same for some time now for e.g. if you take an average of amount paid in last 5 years, it comes to around £457,910 for 1,956 and average amount paid for purchase of approx. 2,514 properties sold in last 7 years comes to about £444,160 per sale.
Breakdown of asking prices for homes of different sizes show that price varies clearly based on no of bedrooms and type of house. Asking price for a house with 2 bedroom is around £476,658, £693,736 for a 3 bedroom house, £905,224 for a 4 bedroom house and £1,603,898 for a 5 bedroom house. For a flat similarly the prices varies from £249,369 for a single bedroom to £510,840 for a 2 bedroom Flat. Same is the case with 3 bedroom flat £762,819, £1,750,000 for a 4 bedroom flat and £2,350,000 for a 5 bedroom flat. To sum up the asking prices for properties in Stanmore it comes to around average £249,369 for 1 bedroom property, £506,738 for 2 bedroom, £714,107 for 3 bedroom, £926,344 for 4 bedroom and £1,638,601 for a 5 bedroom property.
Rent per calendar month varies similarly based on type and size of the house. If you look at the rents per month for houses alone it can vary from £607 for 1 bedroom to £1,476 for 2 bedrooms, £1,679 for 3 bedrooms, £2,462 for 4 bedrooms and £3,324 for 5 bedrooms house. But if you are interested in renting a 1 bedroom flat then rent per month can be around £1,008. As the no. of bedroom increase so will the rent e.g. for a 2 bedroom flat it will be around £1,749, £1,665 for 3 bedroom, £1,699 for 4 bedroom and around £4,000 for 5 bedroom flat. You should be generally be expecting around average £890 rent per month for single bedroom property, £1,725 for 2 bedroom, £1,671 for 3 bedroom, £2,418 for 4 bedroom and approximately £3,355 for a 5 bedroom property in Stanmore area.


Our Goal is to provide presence, prayer and administer Communion to parishioners who are home-bound or residents of local nursing homes. As our parish community grows, so grows our need for compassionate and faithful people to fulfill this very rewarding ministry.
The Sacrament of Healing, which can only administered by a Priest, is given periodically to all shut-ins.


text:
Manga: Sex isn't Enough
One of my new manga series is Demon Love Spell by Mayu Shinjo. The story follows a powerful demon named Kagura, who is an incubus – a type of demon that preys on women by arousing them and gathering energy from their sexual feelings. But after priestess-in-training Miko accidentally seals his powers, he ends up staying with her – and falling in love. What's more, she (eventually) returns his affections! It takes most of the series for her to come to terms with her feelings for a demon, but they do finally make love and make a life together.
What stood out to me about this series was not the plot but the overall concept behind it. The story itself was pretty straightforward without very many twists or surprises – even the ending, short as it was, simply indicated that they were married and had a child. But the idea behind the story was what caught my eye. Kagura, as an incubus, needs to seduce women in order to survive. Sex is literally a matter of life and death for his kind. And yet he chose a love relationship (with a priestess, of all people – someone devoted to purifying demons) over endless sex. To me, that says something about what's really important, albeit in a roundabout way :-).
I still wasn't terribly impressed with the rest of the story; there were a few holes in the plot I felt should have been addressed, details that were mentioned but never bore fruit, etc. The "happy ending" itself was almost too quick to really make up for all the trust issues they struggled with throughout the rest of the series. (Plus, this manga is rated for "older teens," so there's a bit more fan service than I generally prefer.) But that nugget of truth – that love is more important than sex – gave the story its redeeming quality. And it's little things like that, those nuggets of truth and wisdom, that I like to work into my own books. Some are general ideas: love, loyalty, friendship, etc. Others are more specific – the truth of God, the hope of eternal salvation found in Christ, and so on. Look for them, and discover the lessons I've learned for yourself. After all, the tidbits I include have meaning for me, and I weave them in with the goal of reminding us all what's truly important ;-).
http://www.lynnwallaceauthor.com/blog-on-books-and-writing/manga-sex-isnt-enough


text:
Q: Convert simple postgreSQL function to Mysql I was wondering if I could get some help. I have the following function in Postgresql which is designed to give me a "solrid" value without having to store it each time in the database, and basically works by putting an "A" at the start of the value.
-- Setup Solrid Function
CREATE OR REPLACE FUNCTION solrid(IN local_id INTEGER, OUT result TEXT) AS $$
DECLARE
    database_id TEXT := 'A';
BEGIN
    result := database_id || local_id::TEXT;
END;
 $$ LANGUAGE PLPGSQL;

I now have to move my database to MySql and I was wondering if anyone could tell me how I can convert this function to work with MySQL.

A: Here is the same function in MySQL:
DELIMITER //

DROP FUNCTION IF EXISTS solrid //

CREATE FUNCTION solrid(local_id INTEGER) RETURNS TEXT
BEGIN
  DECLARE database_id TEXT;
  SET database_id = 'A';
  RETURN CONCAT(database_id, CAST(local_id AS CHAR));
END //

DELIMITER ;

redpajama_set_name: RedPajamaStackExchange


Westerly Bridgwater can be found on the A38 Taunton Road, just under a mile away from Junction 24 of the M5. The simple-to-reach location makes our showroom and servicing centre within a short drive of towns such as Glastonbury, Somerton and Burnham-on-Sea. Bridgwater itself has a railway station which is little more than a mile away, so we are also easily accessible to visitors travelling on public transport.
Our sales, servicing and parts departments are open during the hours listed below. Should you require any assistance, our friendly staff will be more than willing to help.


text:
Q: How to get locale in nextjs in document component? I want to set locale in script google map like this:
<script defer src={`https://maps.googleapis.com/maps/api/js?key=key&libraries=places&language=${locale}`}/>

but how can i get to locale in Document nextJS?
useRouter doesnot work in Document component.
export default function Document() {
  return (
    <Html>
      <Head>
        <link rel="preconnect" href="https://fonts.googleapis.com" />

<script defer src={`https://maps.googleapis.com/maps/api/js?key=key&libraries=places&language=${locale}`}/>
      </Head>

      <body>
        <Main />
        <NextScript />
      </body>
    </Html>
  );
}

A: You can access locale in this.props.locale.
In my project this locale uses in this case:
 <Html lang={this.props.locale}>
/....

I use class component in _document.
In your variant you can access locale just in props.
import { Html, Head, Main, NextScript } from "next/document";

export default function Document(props: DocumentProps) {
  return (
    <Html lang={props.locale}>
      <Head />
      <body>
        <Main />
        <NextScript />
      </body>
    </Html>
  );
}

It works if you already add i18n config, and inject it to next config.
https://codesandbox.io/p/sandbox/musing-noether-7loye1?file=%2Fpages%2F_document.tsx&selection=%5B%7B%22endColumn%22%3A9%2C%22endLineNumber%22%3A11%2C%22startColumn%22%3A9%2C%22startLineNumber%22%3A11%7D%5D


You want to see the real Joe Diffie right here at New England Ribfest in Bangor on Saturday, Sept. 8, right? How would you like to meet Joe before the show? Of course you do. We're going to make that happen for one lucky listener.
All you have to do now is fill out the info below. You have until 8 a.m. Friday, Sept. 7, to enter. We'll announce our winner on Friday morning, so be sure you're listening.
Please fill out this form, and we will announce our winner on Friday's Q106.5 Morning Show!


text:
Q: extern throwing "both extern and initializer" error In this code i has been defined (and it has been initialized despite being extern). Now the book I am reading says:

An extern declaration may be defined only if it appears to be
  outside a function.

and it offers no reason behind it.
#include<iostream>

using namespace std;

int main()
{
    extern int i=898;
    cout<<i<<endl;
    return 0;
}

I have gone through the question (similar to this one on Stack Overflow) but the explanation doesn't appear to be clear. The question is:
How are these two definitions different at function scope:

*

*int i=898;

*extern int i=898;
In both the cases a single unit of int size memory is being allocated. Is it due to linking error? Please answer clearly as (IMO) it hasn't been satisfactorily in older version whose reference has been used to mark this as duplicate.

A: The extern keyword keeps the compiler from allocating memory for the variable indicating that memory for the variable will be resolved at link time in global scope.  Your link to the other answer was not available so I answered.


text:
Retired GC Public Affairs & Religious Liberty Director, Bert B. Beach, Passes at 94
Bert B. Beach passed to his rest in Silver Spring, Maryland, United States, on December 14. He was 94. He will be remembered as a statesman on behalf of the Seventh-day Adventist Church. For many years he served as the director of the Public Affairs and Religious Liberty Department of the General Conference.
In 1962 Beach was Education and Sabbath School director of the Northern Europe-West Africa Division (later Trans-European Division), based in St. Albans, United Kingdom. That year, F. D. Nichol, then editor of Adventist Review, asked him to go to Rome to observe the proceedings of the Second Vatican Council. The council met for two to three months every autumn between 1962 and 1965.
Bert Beach had just turned 34 when he took on the assignment, and in his own words, "knew next to nothing about Catholics." In November 1962, the Adventist Review printed the first article Beach wrote about the Vatican council.
Beach became secretary of the Trans-European Division, and former General Conference president Jan Paulsen succeeded him in 1980. Paulsen expressed his appreciation for the life and service of Beach. "Bert Beach, more than any other leader from of our church, pioneered for us the importance of communicating with people whose religions convictions and values differed from ours — important for us to understand them and for us to be understood."
Reinder Bruinsma, a retired Adventist leader who, among other positions, was also secretary of the Trans-European Division, also commented on Beach's passing. "[Beach] was a great leader and was known inside and outside the church for his leadership qualities, his erudition, and the way he represented the Adventist Church worldwide in all sorts of forums," Bruinsma said. "I've gained more respect for him over the years, and our relationship developed into a warm friendship. Our joint assignments for the church, … especially in the Balkans, Hungary, and the Baltic States were fascinating and fruitful events.… Beach leaves an empty spot."
The family is tentatively planning a late January memorial service and will share further details when they become available. A more detailed obituary will also follow.
The original version of this story was posted in the Adventist Review.
Do Angels Have Wings? ¿Los ángeles tienen alas?


text:
LinkedIn Pushes Ad Tools
Originally published January 26, 2011
By Ian Sherr
LinkedIn Corp. is beefing up its advertising technologies, offering marketers more ways to target ads to the social network's users and making it easier for big advertisers to connect to its website.
The business-oriented network, which has more than 90 million members, plans to roll out updates for its marketing tools that let advertisers zero in on people based upon job titles, seniority, age and location, people familiar with the matter said.
LinkedIn, which declined to comment, will be wading into an already competitive market where social-networking rival Facebook Inc. is rapidly gaining ground. Last month, more than a quarter of all online display ads in the U.S. appeared on Facebook, according to comScore Inc. By comparison, LinkedIn represented less than 1%.
The moves come as the Mountain View, Calif., company prepares to file paperwork for an initial public offering. Advertising represents roughly a third of the closely held company's revenue, with the rest coming from subscription services and recruiting tools.
While the company has recruited a few big advertisers such as American Express Co. and Hewlett-Packard Co., it remains to be seen whether more will follow suit.
"LinkedIn has a large and growing audience," said David Karnstedt, chief executive of Efficient Frontier, an online marketing firm that helps advertisers place their ads on the Internet.
(Published Jan. 26, 2011, in The Wall Street Journal.)
Meet Ello, the social network that wants to be the anti-Facebook
Microsoft and Its Allies Prepare Windows 8 Marketing Blitz
Tags advertising, internet, scoops, the wall street journal
3-D TVs Get Cheaper, as Makers Hope to Spur Buyers
Apple to Sell Tech Support for Small Businesses


LEELU Fashion Magazine is a modern and professional quality and easy to use magazine template. Featuring minimal design, excellent use of white space and strong font use, this template is packed full of great page layouts suitable for a wide variety of projects.
This is 26 pages stylish InDesign magazine template that is fashionable, trendy, clean, elegant, professional and importantly multipurposes. You can use this template for any kind of industries such as fashion, design, photography, art, social, humanity and businesses.
Layouts can easily be mix and matched, simply use elements from the supply designs to create your own unique layouts. We offers two different types of cover design.
This template also fully editable. Any elements used in the template such as text, graphic elements, images, layout are easy to customize.
Graphic designer which evokes the symmetria of Vituvius, the dynamic symmetry of Hambidge, the asymmetry of Mondrian; which is a good gestalt, generated by intuition or by computer, by invention or by a system of coordinates.


text:
Sarasota florida
John Ringling, of circus fame, built a mansion called Cà d'Zan in Sarasota, Florida, and filled it with European art treasures. Here participants enjoy a reception outside the Ringling Museum of Art.
Native Americans lived in what is now Sarasota, Florida, (population 55,644) for thousands of years before gold-seeking Spanish explorers first visited the area in the 1500s. The city's location on the western coast of Florida, along the Gulf of Mexico, was an ideal spot for fishing, and by the mid-1700s colonial American and Cuban fishermen had seasonal fishing camps in the area.
European settlers first arrived in significant numbers in the late 1840s. In 1885 the Florida Mortgage and Investment Co., based in Edinburgh, Scotland, sold Scottish settlers plots of land in a place described as a tropical paradise called Sarasota. Once the settlers arrived, they found that the recently platted town lacked streets, roads, and stores. Most left, but some stayed on, and development began. The city of Sarasota was incorporated in 1913.
The early 20th century brought wealth and the circus to Sarasota. In 1914, Bertha Palmer, a wealthy widow from Chicago, began spending winters in Sarasota. Greatly enjoying the city, which she compared to Naples, Italy, she went on to build a resort and eventually became the largest landholder in the city, using her vast tracts of land primarily for agriculture. Sarasota became a very fashionable place for the wealthy to winter, and brought businessmen such as John Ringling, who came to Sarasota in 1919. Ringling built a mansion called Cà d'Zan (House of John) and filled it with a large European art collection. In 1927 Ringling made Sarasota his circus' winter headquarters. Other circuses followed, and Sarasota became known as the Circus City.
A real estate crash in the late 1920s brought a period of decline to Sarasota, but after World War II the city began to boom again. Tourism once again is the largest sector in the local economy, as visitors flock to relax at the beaches, play golf, and visit the city's numerous cultural and historic sites.
Sarasota has worked hard to protect and celebrate its cultural heritage. Designated a Certified Local Government in 1986, Sarasota has a Historic Preservation Board and Historic Preservation Plan working to protect the more than 3,500 historic structures within city limits. The Sarasota Alliance for Historic Preservation has an annual historic home tour and the Historical Society of Sarasota County conducts trolley and waterfront tours of the city.
Recently, the city of Sarasota and the Historical Society of Sarasota County worked together to save a historic property, the Luke Wood House. The building is believed to be the oldest standing residential structure in Sarasota and dates to 1882. The house had been moved from its original site once before and was located next to the historic Crocker Church, built in 1901. In 2005 both buildings on the site were threatened by new development. The historical society made a deal with the developer for both properties, and with help from the city, moved the buildings into Pioneer Park. Plans are underway to renovate the buildings into offices for the historical society, a community museum, and community meeting space. The move has sparked other renovation projects in the area, and the neighborhood was recently designated a National Historic District.
Designated a Preserve America Community in March 2008.
City of Sarasota - Historic Preservation
Newtown Conservation History District - Preserving African American Heritage
Sarasota Convention and Visitors Bureau


We don't expect the euro to get much of a boost from the ECB meeting this week. The general message should remain cautious (see ECB preview: Trying not to get lost in transition for details) with the ECB attempting to avoid unintentional tightening of monetary conditions. Here a potential hint at further LTLROs should reinforce such a message.
With the ECB remaining cautious and the rate differential between the USD and EUR intact (if anything, it should widen again as markets start pricing in a 3Q19 Fed hike, cementing the dollar's status of one of the high yielders in the G10 FX space), the upside to EUR/USD looks very limited in coming months. We reiterate our forecast for EUR/USD 1.12 for 1- and 3-month time horizons.
Indeed, the lack of catalysts for a more meaningful reversal in the dovish ECB stance (as per Fig 2, the market is assigning a fairly low probability to any meaningful ECB tightening in coming quarters) as well as the non-negligible costs of shorting USD vs EUR have been some of the factors behind why the speculative community has been reducing EUR longs or increasing EUR shorts over recent weeks (Fig 3).
While we see a lack of near-term catalysts for EUR/USD upside, we also think the downside to the cross is limited, particularly if EZ data improves (as per Eurozone PMI: early signs of an economy pulling through, the EZ Feb PMIs showed the first tentative signs of EZ data bottoming).
I am the Chief Economist at ING Germany. I have a broad international background in economics and finance, combining public and private sector experience in economic analysis and policy-making. Main focus: Europe, Eurozone, Germany and ECB.
My career started in the public sector at the Ministry of Finance of the Netherlands and the European Commission. In 2008, I joined ING and immediately had to put my experience on Europe, the Euro and policy-making into practice. By now, I have built up excellent skills and experience in analyzing macroeconomic and political developments in Europe, the Eurozone and Germany, including ECB watching. With Europe being the main theme of my professional life, obviously something to say on the euro crisis. I am frequently quoted in international media.


text:
// Copyright Dirk Lemstra https://github.com/dlemstra/Magick.NET.
// Licensed under the Apache License, Version 2.0.

using ImageMagick;
using Xunit;

namespace Magick.NET.Tests
{
    public partial class MagickImageTests
    {
        public class TheOpaqueMethod
        {
            [Fact]
            public void ShouldChangePixelsThatMatchesTarget()
            {
                using (var image = new MagickImage(MagickColors.Red, 1, 1))
                {
                    image.Opaque(MagickColors.Red, MagickColors.Yellow);
                    ColorAssert.Equal(MagickColors.Yellow, image, 0, 0);
                }
            }

            [Fact]
            public void ShouldNotChangePixelsThatDoNotMatchesTarget()
            {
                using (var image = new MagickImage(MagickColors.Red, 1, 1))
                {
                    image.Opaque(MagickColors.Yellow, MagickColors.Red);
                    ColorAssert.Equal(MagickColors.Red, image, 0, 0);
                }
            }
        }
    }
}


Creating a particle system in may sound difficult, but as Seb Lee-Delisle shows you, it's not rocket science!
You may think that simulating physics in code is complicated and hugely demanding in terms of computer resources. Sure, if you want to model real-life physics for engineering projects or NASA missions, then you have to be pretty damn accurate. But to just produce some cool effects, there are techniques for approximating physical phenomena such as gravity and drag that are so simple that the code will run at lightning speed.
You can produce a wide range of different effects with only minor adjustments. I've used Flash particle systems to produce electrical sparks, swarms of bats, fireworks, dripping goo, fire and sweat! With a little imagination you can have a lot of fun. This tutorial is a great way of getting into programming simple physics and movement. More importantly, it shows that you can produce some beautiful particle effects with straightforward ActionScript.