The Nashua Chamber Orchestra (NCO) seeks to fill an important niche between the full symphony and the chamber ensemble, focusing on lighter works written for small orchestra. The NCO provides a supportive environment for talented amateurs to perform classical music of high caliber before an appreciative audience.
For over three decades the NCO has been part of Nashua's music scene. We feature works by composer written for a small orchestra spanning all musical eras from Baroque to Contemporary. We also like to spotlight up and coming local composers in the greater Boston area by giving them the opportunity to have their works performed in front of an appreciative audience, often for the first time. We are also very proud to feature exceptionally talented youth soloists. In 2014, we featured a 14 year old cellist, Zlatomir Fung who went on to win the Silver Medal at the International Tchaikovsky Competition and First Prize at the Klein Competition. In 2015, we featured a 17 year old violinist, Yuki Beppu, who is now studying at Julliard and has performed at Lincoln Center as well as for President Obama. We run promotions every season for young students, seniors, and veterans to attend our concerts. Additionally, we have a free family concert at the Nashua Public Library featuring the instruments of the orchestra, hands on demonstrations, and guest youth conductors.
Under our Musical Director, David Feltner, we expect to continue to grow musically and to move in exciting new directions. Please join and support us as we expand our horizons!


Thursday February 26- 1931 I worked on Mrs Gays rug most of the day She took me to the church at 5.30 The Whetstones had been out of town all day. Ott came to the church and brought me home. sent paper to Mrs [Clute?] Friday February 27- 1930 I worked on the rug till 3.30. Then gave the rooms a good cleaning and made apple preserves to take to Elder Daughters party tomorrow. Letter from Ida I read in evening. William better tonight. Wrote Laura Saturday February 28- 1931 I got the morning work done and finished reading a book. Hattie & Cora came to take me out to Mrs Kelleys. We had a fine meeting. Hattie and I called on Mrs Walker and Ida Andersons. Came down to The Library by Bus. Hattie called at Mrs Webb and then came here. Mary & Buddy here for a few moments. Sunday March 1st 1931 I rested well last night. Ott took me to church I went home with Hattie for dinner. Rob brought me back at 5 - oclock. Wrote Winnie Later wrote Ida. To bed early. Monday March 2- 1931 I did some washing. Ott here for dinner. A letter from LeGrand tells he goes to San Francisco soon I had letter from Mrs Falk and Blanche Black She told me about Gerta Fletchers death. I wrote Mattie at St Anthony Rob & Cora took me for my treatment I came home by Bus. Mrs Gay up to talk & I read some later.


I've spent a couple of days redesigning my blog and didn't follow through in order to file this entry. I've been quailing at Ma' Rosa for weeks now but missed the chance of watching Jaclyn Jose take home her Best Actress trophy from the 2016 Cannes Film Festival on Youtube. There's no doubt that Ma' Rosa's hard-edged impromptu style social realist narrative could flush out the Philippine k-pop-culture-obsessed mainstream media in a jiffy. Independent filmmakers and thespians alike have been craving for keen attention from local moviegoers for a long time now but to no avail. It's high time. Directed by Brillante Mendoza and initially released in May, the film premiers in the Philippines on July 6.
And that, comrades, is how THE social media work.
So as I mentioned earlier, I'm going to weigh in on the Harambe tragedy because, like the rest of the internet, I can. But I will not be slinging deadly stuff on the Cincinnati Zoo and its visitors here. They've been beaten up by the interwebs over the past weeks already.
I would simply throw in some insights and leave a picture of Harambe here to remind us all what we as humans have diligently evolved into, arms akimbo.
Harambe, a 440 lb male silverback gorilla, was held captive at the Cincinnati Zoo. Photography by Robert Streithorst.
Indeed, one must reflect upon what we have learnt from visiting zoos. Even though, none of these lessons include lifting a finger to assist in habitat conservation for critically-endangered species. But it's alright to be upset and pour out our contempt over a post or a status update. After all, we have gotten used to expressing all our deep-seated, searchable angst over our newsfeeds, including thoughts that give us nightmares, like whether the dress is blue or gold.
So, now is the time to convert all of these emotions into action, something social media have been urging us to do ever since.


text:
var builder = {};

builder.F = builder.Function = function () {};
builder.A = builder.Array = [];
builder.R = builder.RegExp = / /;
builder.O = builder.Object = {};
builder.N = builder.Number = 0;
builder.S = builder.String = '';
builder.B = builder.Boolean = false;
builder.U = builder.Undefined = undefined;
builder.L = builder.Null = null;
builder.D = builder.Date = new Date();

builder.createInterface = function () {
	var intf = {}, ret = {};

	function addKey(name, keyType) {
		intf[name] = keyType;
		return ret;
	}

	ret.addFunction = function (name) {
		return addKey(name, builder.F);
	};

	ret.addArray = function (name) {
		return addKey(name, builder.A);
	};

	ret.addRegExp = function (name) {
		return addKey(name, builder.R);
	};

	ret.addObject = function (name, objSpec) {
		return addKey(name, objSpec || builder.O);
	};

	ret.addNumber = function (name) {
		return addKey(name, builder.N);
	};

	ret.addString = function (name) {
		return addKey(name, builder.S);
	};

	ret.addBoolean = function (name) {
		return addKey(name, builder.B);
	};

	ret.addUndefined = function (name) {
		return addKey(name, builder.U);
	};

	ret.addNull = function (name) {
		return addKey(name, builder.L);
	};

	ret.addDate = function (name) {
		return addKey(name, builder.D);
	};

	ret.getInterface = function () {
		return intf;
	};

	return ret;
};

module.exports = builder;

redpajama_set_name: RedPajamaGithub


You were created to be uniquely you. There is no one else like you on earth. Your soul is precious and rare. So rare in fact, you are the one and only YOU. And I love you. This delicate and dainty, little ring is hand-crafted in solid 10k yellow gold and perfect for stacking. The birthstones of your choice is hand set inside a gold bezel. Layer one on for each of your loves. Starting price is for one ring. Please note, genuine stones can vary slightly in color. Perfect.


text:
Home Articles The Sun Details of broadband progress in northern Warren County to be revealed
Details of broadband progress in northern Warren County to be revealed
by Thom Randall
State Assemblyman Dan Stec (R-Queensbury) listens as a resident of northern Warren County questions telecommunications providers at an initial broadband meeting held in February 2018 at the Tannery Pond Community Center in North Creek. A follow-up public meeting is to be held at 6:30 p.m. Friday, March 15, at the center to explain progress underway toward providing broadband access to households and businesses throughout Johnsburg, Thurman, Stony Creek and Warrensburg. The meeting is intended to answer questions about the features and price of the service, as well as when people can get connected.
NORTH CREEK | Lack of internet connectivity has a huge impact on the lives of area residents, Laurie Arnheiter said this week as she announced an upcoming public broadband informational meeting scheduled for 6:30 p.m. Wednesday, March 15, in North Creek's Tannery Pond Community Center.
The meeting is to explain progress on extending broadband through northern Warren County.
"I've heard that you can go to the Johnsburg library, and there are cars idling in the parking lot so parents can keep their children warm in their pajamas — and the kids are connecting to the library's Wi-Fi to do their homework on their laptops," she said.
This lack of internet connectivity, a contentious issue in this rural region, may soon be history for most all area households.
Several broadband providers are now installing broadband infrastructure in the towns of Johnsburg, Thurman, Stony Creek and Warrensburg — and local residents are wondering when they'll be able to connect, how much the new service will cost, and whether it will be adequate to meet their needs, Arnheiter said.
"We hope to have these questions answered at the broadband symposium," she said.
Representatives of Slic Network Solutions, HughesNet and Frontier Communications have been invited to the meeting to describe the firms' progress in expanding their network in those communities, and they will be answering residents' questions, she said.
This ongoing expansion of digital connectivity is an outgrowth of Gov. Andrew Cuomo's promise to soon provide high speed broadband to "100 percent" of the state's homes and businesses.
Johnsburg has 944 locations to be connected in this initiative — and the primary provider is Slic, awarded about $3.2 million by the state to bring fiber optic service to 908 addresses. HughesNet is to provide satellite-based service to the 36 remaining homes in town.
In Thurman, more than 500 locations are to be served by Slic, and about 250 have been assigned to HughesNet, according to reports. Stony Creek is listed to have 273 locations targeted to receive new broadband service, and Warrensburg, 106 households.
Arnheiter is a member of both the Johnsburg Town Board and the Johnsburg Community Development Corporation, which are jointly hosting the upcoming broadband symposium.
The meeting will also include representatives of U.S. Rep. Elise Stefanik, state Sen. Betty Little and state Assemblyman Dan Stec, as well as the supervisors of the three towns where broadband buildout is occurring, Arnheiter added.
"We've seen the trucks and workers installing cable and broadcast boxes, but we all want to know when we can get hooked up and what the service will be like," she said, hinting that Frontier and Slic may have good news to report.
Arnheiter noted that lack of broadband in Johnsburg and elsewhere in the Adirondacks has hampered economic development and discouraged home ownership. She said that in her own North Creek business — Hudson River Trading Co. — credit card transactions sometimes can't be completed because her Frontier DSL service is either too slow to accomplish digital tasks, or it drops data transmission.
"Fast, dependable broadband is necessary in today's world to effectively run a business," she said.
Arnheiter also cited that she knew of business executives ready to sell their second homes because of lack of broadband service.
"Executives need to stay connected," she said. "Corporate America has no patience for downtime."
Also, area tourism officials have warned that vacationers avoid communities that don't offer broadband connectivity.
"We're the center of active recreation here in Johnsburg and people are here to experience nature — but broadband is a challenge for our community, and we must move forward," Arnheiter continued.
Providing high speed, dependable broadband to the town's health center and nursing home are also vitally important, she said, as medical images, virtual conferences and data are increasingly transmitted between health-care providers to meet patients' medical needs.
"Our new state-of-the-art health center and our nursing home need adequate broadband — they're responsible for people's lives," she said.
QUESTIONS REMAIN ON COVERAGE IN THURMAN
Rose Slemp, co-founder of the Thurman Broadband Initiative Committee, agreed with Arnheiter that a lot of questions need to be answered — particularly whether Slic, which is installing a high-speed optic fiber network, will voluntarily extend their broadband past the boundaries they contracted for with the state's broadband office.
With the intention of getting as many Thurman households as possible connected to high-speed optic fiber, Slemp has been lobbying for such an expansion by Slic.
The optic cable that Slic is installing has a potential of delivering data transmission speeds of 100 or 200 mbps. According to reports, 36 mbps will be Slic's initial speed — while HughesNet has promised the state's minimum contracted speed of 25 megabits per second. Some Thurman residents have said they doubt that HughesNet will be meeting that minimum, as they have complained that their existing service from HughesNet is far slower than 25 mbps during daytime hours, and is routinely throttled, capped or interrupted.
Listed to receive Slic optic fiber service in Thurman will be households on Drexel Road, Bear Pond Road, Mountain Road, Bowen Hill Road, Johnsburg Road, Athol Road, High Street, Mud Street, Smith Street, portions of Valley Road, and a few additional venues, said Slemp, who has helped about 300 people find out what broadband provider they've been assigned to.
Although the internet service providers were allocated specific areas of Thurman, Slemp said at least one-third of those households assigned to HughesNet could conceivably be served by SLIC.
Slemp said her household is served by Verizon DSL, which is merely 1.8 mbps, and is so slow during the day due to many subscribers online, that images routinely must be transmitted late at night. She's among the 500-plus households assigned to Slic by the state broadband office.
Although Verizon's 1.8 mbps sounds incredibly slow, dial-up is slower — and Slic's planned build-out may allow households with dial-up within Verizon's small service footprint to upgrade to DSL, she said.
Arnheiter said many of these questions about potential extensions and transmission speeds are likely to be revealed at the March 15 broadband symposium.
"There's still work to do and issues to be solved regarding broadband, but progress is being made," she said. "This upcoming meeting offers an opportunity for broadband providers to talk directly to potential customers and let them know what's going on."
North Creek Gov. Andrew Cuomo New York Elise Stefanik fiber-optics Dan Stec Broadband Committee internet speed Betty Little Rose Slemp Slic Network Solutions Warren County Johnsburg Community Development Corporation Laurie Prescott Arnheiter broadband high speed internet Tannery Pond Community Center Warrensburg HughesNet Headline Story Thurman Johnsburg Sun Community News white space The Adirondack Journal Sun The Sun Internet Stony Creek Hudson River Trading Company Broadband operations Verizon News
Article on Meeting?
I have been unable to located any meeting minutes, updates or articles regarding the details of the meeting that occurred. Anyone know where to find this information? Thanks!
Ed 290 days ago
Sun Blog

redpajama_set_name: RedPajamaCommonCrawl


Loingseoireacht Saor in Aisce do gach ordú ar feadh níos mó ná $ 150.
Faisnéis Láithreáin ag Alexa.com Trusted-Tabs.com.
Cuirtear an seoladh IP, na freastalaithe ainm Trusted-Tabs.com ar fáil.
Tá eolas faoi Iontaobhas fearainn -Tabs.com le haghaidh faisnéise ginearálta amháin. Má tá aon cheist agat, téigh i dteagmháil le cógaslann ar líne de chuid Trusted-Tabs go díreach trí láithreán gréasáin http://trusted-tabs.com .
Tabs iontaobhaithe ©, 2013 proarmaturu.ru.


Brandefy rates store brands (i.e. CVS) against their name brand counterparts (i.e. Neutrogena) to tell you whether or not the generic is as good as the name brand, and to warn you when it is not. We compare the product by doing an ingredient analysis and consumer sensory testing.
The CVS's spray radius is wider and it smells more like alcohol. But, it is still a pretty good dupe!
In this case, we gave the CVS copycat an 88% similarity score. While it's ingredients are nearly identical, the CVS bottle's spray radius is larger, and it smells slightly more like alcohol. The consumer panel rated it a 4 out of 5 in overall similarity.
If you're super sensitive to smell, go with Neutrogena, but if you're not, switch to CVS to save.
Information featured on this website is strictly the opinion of Brandefy. See TERMS OF SERVICE.


text:
"Not Even Lord Ram Could Assure 100% Security": UP Minister On Rapes
HomeAll India"Not Even Lord Ram Could Assure 100% Security": UP Minister On Rapes
Ranvendra Pratap Singh's comment came in response to a question on women's safety amid nationwide outrage.
All IndiaReported by Alok Pandey, Edited by Divyanshu Dutta RoyUpdated: December 05, 2019 19:13 IST
Ranvendra Pratap Singh is the food and civil supplies minister in Uttar Pradesh.
Lucknow:
Amid nationwide outrage over crimes against women, a minister in the Uttar Pradesh government has said that "not even Lord Ram" could assure complete security to people.
"When there is a society, then to say 100 per cent there will be no crime - this assurance I do not think even lord Ram could give. So a 100 per cent surety is not there but this much is sure if there is a crime, then the accused will go to jail and he will be punished," Ranvendra Pratap Singh, the food and civil supplies minister, said.
Mr Singh's comment came in response to a question on women's safety on a day a 23-year-old woman from Uttar Pradesh's Unnao district, who had filed a rape case against two men from her village in March, was set on fire this morning when she was headed to a local court for hearing in the rape case. She remains in critical condition.
"As per victim's statement five people were involved in setting her on fire, including the one who was accused in the rape case," Vikrant Vir, a police superintendent in Unnao, said. All five men have been detained, Uttar Pradesh police said in a tweet.
The woman had filed a complaint with Unnao police in March alleging that she had been raped at gun-point on December 12, 2018. Having been subsequently jailed, the alleged rapist was released last week after securing bail.
During the past week, thousands protested in several cities following the rape and murder of a 26-year-old vet near Hyderabad.
Protesters and parliamentarians are pressing for courts to fast-track rape cases and demanding tougher penalties.
Uttar Pradesh is the country's most populous state and has become notorious for its poor record regarding crimes against women, with more than 4,200 cases of rape reported there in 2017 - the highest in the country.
The Uttar Pradesh state government came under fire in July from the opposition which accused it of protecting a lawmaker accused of rape.
Ranvendra Pratap SinghUttar PradeshRape
Rishabh Pant Trolled On Twitter After KL Rahul Pulls Off Smart Stumping
Ananya's Anniversary Wish For Chunky And Bhavana Panday Is Pure Love
JEE Main Result Announced @ Jeemain.nta.nic.in; Direct Link Here


Experience Portugal's rich culture on an evening tour combining Fado music with Portuguese cuisine. You will also receive a guided tour of Alfama, Lisbon's old medieval quarter famous for its narrow streets and love for Fado music.
The golf course of the Island of Terceira is a mandatory stop. It's one of the most beautiful and exclusive places in the island and has an amazing view of the Azores. The best option for a different day in the Azores.
We'll pass by historical neighborhoods such as Bairro Alto, Alfama and Mouraria, so you can get a feel of the city like a true local, a 'Lisboeta'! Along the 3.5 hours we will try a variety of food samples and wines and get to see real live performances from 'fadistas' alongside traditional sound of the Portuguese guitar.


text:
Is Increasing Life Expectancy Leading To More Complexity?
H Johnson1, A O'Farrell, 1 D McKeown1, G Sayers1, C Hayes2, D Beaton1.
1Health Intelligence Unit, Health and Wellbeing Directorate, HSE, Dublin 8.
2Discipline of Public Health and Primary Care Institute of Population Health, TCD, Russell Building, Tallaght Cross, Dublin 24.
Life expectancy is increasing in Ireland, but whether this has resulted in healthier life years among the elderly and its impact (if any) on hospital services is unknown. The purpose of the study was to use routinely available data to explore the relationship of age and indicators of clinical complexity in acute hospitals over ten years. The study included all in-patients aged 65+ years from the Hospital In-Patient Enquiry (HIPE) discharged between 2005 and 2014. Indicators of complexity included the Charlson index, overall length of stay (LOS), intensive care unit LOS and deaths in hospital, analysed by the major clinical classification software (CCS). Over the period, the number and rate of admissions increased, especially among those aged 85+. Indicators of patient complexity increased and LOS decreased. In-hospital mortality decreased from 5.9% to 4.7%. Hospitals appear to be managing the emergency care of the older and more complex patient more efficiently and with better outcomes.
Life expectancy at birth in Ireland has increased significantly for both men and women since the first official life table was compiled in 1926. Over the 85 year period to 2011, male life expectancy increased by 21.0 years (36.6%) to 78.4 years, while female life expectancy increased by 24.9 years (43.0%) to 82.6 years1. There has been considerable debate about whether the increased life expectancy results in improved health or higher levels of disability. It has been suggested that due to the increase in life expectancy, morbidity among elderly hospital patients has become more complex whereby the older patient is "made complex" by having multiple co-occurring medical conditions2. Patient complexity may affect process and outcomes of care and therefore measuring patient complexity is important to ensure best care for the patient. Furthermore, according to the Central Statistics Office (CSO), the older population (i.e. those aged 65 years and over) is projected to increase significantly from 532,000 in 2011 to 1.4 million in 2046 (163%)3. The very old population (i.e. those aged 80 years and over) is set to rise even more dramatically, increasing from 128,000 in 2011 to 484,000 in 2046 (278%)3. Thus, measurement of patient complexity, particularly in the elderly has important implications on how care is organised and how resources are allocated4. In Ireland, there have been no published studies measuring patient complexity. Thus the aim of this study is to use routinely collected hospital in-patient data to explore patient complexity and clinical outcomes in elderly patients over a 10 year study period.
All emergency in-patient hospital admissions for elderly patients (i.e. those aged 65 years and over) to acute hospitals in Ireland between 2005 and 2014 were extracted from the Hospital In-patient Enquiry (HIPE) system via the Health Atlas Ireland system. HIPE is a computer-based health information system that collects data on discharges from acute public hospitals in Ireland.5 The HIPE database contains information on patient age, gender, area of residence, date of admission and discharge, together with their principal admitting diagnosis and up to 20 other diagnoses, coded using the International Classification of Diseases Tenth Revision (ICD-10-AM). Therefore, this study is based on in-patient emergency admissions with a hospital discharge record.
Patient complexity was measured using demographic variables, clinical profile and Charlson Index. The demographic profile included (mean age, age groups ( <85 years, ≥ 85 years) and gender). Clinical profile measures used included mean length of stay (LOS), percentage needing Intensive Care Unit (ICU) care; mean ICU LOS; the percentage who died in hospital; the Clinical Classification (CCS) group (which is a method whereby patient diagnoses and procedures are categorised into a manageable number of clinically meaningful categories and is based on ICD-10-AM6 and the Charlson Index which is method of categorizing co-morbidities of patients based on the International Classification of Diseases (ICD) diagnosis codes7. A score of zero is categorised as low complexity and a score of 10 or more is categorised as high complexity8.
The data were analysed using JMP statistical package9 and SPSS10. T-tests were used to compare means. Logistic regression was carried out on high/low Charlson index scores. Pearson's χ2-test was used to compare proportions in groups of categorical data, χ2-test for trend was used to identify linear trend in Statsdirect11.
As shown in Table 1, there were 1,672,552 emergency in-patient hospital discharges for elderly patients (65 years and over) from acute hospitals over the ten year study period, increasing by 34,527 (22.3%) from 2005 to 2014, Cuzick trend analysis, Z= 2.95, p=0.003.
Age and gender
The mean age of the patients increased significantly from 76.7 (S.D. 7.3) years in 2005 to 77.0 (S.D 7.4) years in 2014 (2 sided T-test, F- statistic 82.9, p<0.001). The proportion of patients aged 85 years or over was 17.6% over the study period increasing from 15.2% in 2005 to 18.8% in 2014, Cuzick trend, Z=2.9, p<0.003. The proportion of patients who were female was 49.1% increasing significantly from 48.3% in 2005 to 49.0% in 2016, p<0.01.
Charlson Index
The proportion of patients with a Charlson index of 0 (i.e. with no co-morbidities) decreased from 66.5% in 2005 to 63.1% in 2014, p<0.05) and there was a concomitant rise in the number of patients with a Charlson index score of 10 or more (18.2% in 2005 vs. 21.8% in 2014, p<0.05). The highest proportion with a high Charlson score recorded was in 2010 (23.4%). Those with a high Charlson index score were 1.6 times more likely to be in the older (85+yrs) age group (OR 1.6, 95% CI 1.5- 1.7) ; 1.4 times more likely to have an ICU stay (OR 1.4, 95% CI 1.3-1.5) and were 3.3 times more likely to die in hospital (OR 3.3, 95% CI 3.2-3.4) and twice as likely to have a respiratory diagnosis (OR 2.1, 95% CI 2.12- 2.18) than those with a lower Charlson index score.
As shown in Figure 1, the highest rates per 1,000 population were in the older age groups (aged 80 years and over). The rates also increased in the older age groups only (aged 80 years and over).
Trends in CCS groups by year
As shown in Figure 2, the most common CCS group continued to be cardiovascular throughout the 10 year study period. However, there was a statistically significant upward linear trend in the respiratory CCS group increasing significantly from 14.2% in 2005 to 17.1% in 2014, Cuzick trend Z = 2.85 p = 0.004.
The mean length of stay (LOS) in 2005 was 11.5 days reducing to 9.7 days in 2014, representing a significant downward linear trend over the study period, Cuzick trend analysis, Z = -2.9, p=0.003.
ICU Length of stay
Almost one in 10 (9%) of patients had a stay in intensive care. There was no linear trend present in the proportion of patients with a stay ICU LOS, Cuzick trend analysis, Z = -0.33, p=0.74. The average ICU LOS for patients who had an ICU stay was five days.
Discharge status
The majority of the patients were discharged home increasing from 74.7% in 2005 to 75.6% in 2014, representing a non-significant upward linear trend, Cuzick trend, Z = 1.83, p=0.066. A total of 90,588 (5.4%) patients died in hospital decreasing from 5.9% in 2005 to 4.7% in 2014, representing a significant downward linear trend, Cuzick trend, Z-2.96, p=0.03.
This study has shown that the number and rate of in-patient hospital admissions for the elderly increased over time with a significant increase in the proportion of patients in the older (aged 85+years) age group. There was also a significant increase in the proportion of patients with a Charlson index score of 10 or more which is indicative of complexity. The study also found that patients with a high Charlson index score were significantly more likely to have a respiratory diagnosis, be older and to require an ICU stay than those with a lower Charlson index score. However, despite this apparent increase in complexity, length of stay decreased significantly over time as did the overall proportion of patients having an ICU length of stay and the proportion of patients dying in hospital. This would suggest that although the elderly patients admitted to hospital are older and more complex, the acute hospital has become more efficient at managing these patients as evidenced by the reduced length of stay, the increase in the proportion of patients going home and the reduction in patients dying in hospital.
It is likely that the advent of the clinical programmes in recent years, particularly with regard to the management of acute coronary syndrome and stroke, together with the reorganisation of acute services, and indeed changes in primary care, have contributed to this finding. The picture of increasing complexity in hospitals is likely to continue in light of increased demographic pressures, and those with less severe morbidity being managed in primary care. This is a welcome finding. However, we must not be complacent given that we have an increasingly ageing population which is likely to lead to an increase in the proportion of complex patients. Furthermore, it has been suggested that the demand placed on health services by increasing numbers of older persons with multi-morbidities and thus increasing levels of complexity is being compounded by an accompanying increase in sedentary lifestyles and poor diet12 .
A recent study13 on chronic disease burden among the elderly in Ireland found that two out of five hospitalisations in 2011 occurred due to chronic diseases with 12.5% of the total health sector budget spent on acute hospital care for these patients who are "made complex" by having these chronic diseases. Reducing the modifiable risk factors associated with chronic diseases must be made a priority in Ireland if we want to minimise the impact of chronic diseases on the complexity of patients in the health system. Economic and cost-effective evaluation of public health and health promotion interventions that reduce the burden of chronic disease in the elderly population are urgently needed to inform resource allocation policy to remediate the burden of the complex patient13.
There is no conflict of interest with regard to this paper for any of the authors.
Dr. Anne O'Farrell, Health Intelligence Unit, HSE, Palmerstown, Dublin 20.
1. Central Statistics Office (CSO) 2015. Life expectancy in Ireland. http://www.cso.ie/en/releasesandpublications/er/ilt/irishlifetablesno162010-2012/.
2. Safford MM, Allison JJ and Kiefe CI. (2007). Patient complexity: More than Comorbidity. The Vector Model of Compelxity. J. Gen. Intern. Med., 22 (Suppl.3). :382-390.
3. Central Statistics Office (2015). Population and Labour Force Projections 2016-2046. http://www.cso.ie/en/media/csoie/releasespublications/documents/population/2013/poplabfor2016_2046.pdf
4. Tinetti ME, Bogardus ST and Agostini JV (2004). Potential pitfalls of disease –specific guidelines for patients with multiple conditions. N. Engl. J. Med., 351: 2870-2874.
5. Health Pricing Office. 2016. HIPE database. Activity in Acute Public Hospitals in Ireland. http://www.hpo.ie/latest_hipe_nprs_reports/
6. International Statistical Classification of Diseases and Related Health Problems, Tenth Revision, Australian Modification (ICD-AM). https://www.accd.net.au/Icd10.aspx. Accessed June 2016
7. Charlson ME, Pompei P, Ales KL, MacKenzie CR. A new method of classifying prognostic comorbidity in longitudinal studies: development and validation. J Chronic Dis 1987;40(5):373-383.
8. Dr. Foster Intelligence (2014). Understanding HSMRs. A toolkit on Hospital Standardised Mortality Ratios. London, UK.
9. JMP statistical package (program) (2010). 9.0 version. Cary NC, USA.
10. Statiscal Package for Social Scientists SPSS. (2016) IBM SPSS Statistics for Windows, Version 23.0 Armonk, NY: IBM Corp.
11. StatsDirect statistical programme. (2003) 2.8.0 version, Cheshire UK.
12. McPhail S. (2016). Multimorbidity in chronic disease: impact on health care resources and costs. Risk Management and Healthcare Policy, 9: 143-156.
13. Jennings S. (2014). Preventing Chronic Disease: Defining the problem. Report from the Prevention of Chronic Disease Programme. Health Service Executive. ISBN:978-1-908972-05-7.


Set of 2 self-adhesive laminated door murals for double doors.
Antique medieval castle, fort decole, film, cover, wrap, poster.
Size: 30x80 inches (each door). If you need custom size, please, contact us.
Registered shipping from Eastern Europe with a tracking number. Shipping takes 10-20 days. Comes in a tube.


It was hard to find woods in the farmlands of Lima, Ohio but the small Cabal had managed to do so. Their home lay down a winding dirt road. Eventually a car could go no further and the last half mile would need to be made on foot. The home itself was rather large for a log cabin in the middle of the woods. There was a very obvious core part to the place. It was old, something that must have been built when the land was just being settled. Off of that were newer additions each of them with their own sort of style suggesting that every person who came before had to build their own living space.
Just beyond the house the trees thinned and there were multiple fields that were tilled and cultivated. At this stage in the summer they were already green with multiple different types of edible vegetables. There was little in the way of decorative plants in this area. Blueberry bushes grew in a patch near to the house and one could identify multiple different types of fruit bearing trees. Walnut, plum, and apples were plentiful in this area. There was even a pumpkin patch though it wasn't quite at the bearing fruit portion of its life.
Inside almost everything looked crafted in some way. There were a few things such as pots and pans that had been picked up at a store but the furniture, carpets, decorations, and even a lot of the tableware was all crafted. Some of it looked well made, some of it functional only. The one major exception being an overstuffed armchair that could easily hold two people.
Once the party had drawn to a close, the two knew possible members had been lead to this homestead or given directions if they wanted to come by later. Those that stayed were given blankets and bedding, though the most obvious place to sleep was on the floor. The bedding was more than comfortable. There was a shower in the back that worked with the concept of gravity. The water stores stayed heated through solar energy so at night it was a bit chilly, still it was offered as well as clean clothes to sleep the night in.
Morning came swiftly and Hannah was up well before first light. By the time the rest of the house stirred she was fully dressed and curled up in the overstuffed chair reading a biology text book. It looked like she'd already put in quite a bit of work judging by the dirt under her nails and on her clothing.
You didn't see places like this anymore. Even most farms had their share of noisy machinery and profit-making technology to keep up with mega corporations. Out here, however, the land smelled of sweat, fresh earth, hand-wrought works of wood and metal. It smelled...pure. Nearly as pure as the sort of place he was no longer welcome in.
It was already dark by the time the group made it back to the winding road and their home beyond, but Dylan tagged along. He wasn't particularly chatty, though he had a quick word and wry humor at the ready for anyone who engaged him. When they finished their half-mile march to the estate itself, he breathed in deep, sighed and nodded, then let himself be lead to wherever he was meant to spend the night. There were no complaints from the older man about the sleeping accommodations -- he seemed perfectly content to sleep among the stars if that's what was offered.
Come the next morning, the detective washed up. The shower wasn't the best at cleaning the human body, but Dylan stepped out completely free of dirt, grime, or odor -- likely, he used a little magic to help freshen up. After a cursory investigation of his surroundings now that morning light was available, he returned to what was likely the main sitting room, nodding in greeting to the woman already there. "Nice place."
The hometown hero slept like the dead, like a baby who would never know another day of sorrow. One of the rooms in the structure was a starkly austere room, much like a Shinto temple might appear. The walls, floor and ceiling were all made of the same smooth wood that the rest of the house claimed, except the floor in here was polished with layers and layers of walnut oil until it shone.
Once voices could be heard outside? He'd roll off of that storable futon mattress and fold it in half, making to tuck it into a cabinet that also stored a number of things that might be considered to be "of use" to his magical mindset. Not that he had much of one of those. A bucket came out of that cabinet and a mixture of water and vinegar was poured into it. A cloth dropped into the bucket and then was used to wipe clean the floor in long and smooth strokes. It was calming and meditative, and it was a habit that he'd had for a very long time.
Twenty minutes later, the young man would dry his hands and rub his face before coming out into the main room. He wore drawstring pajama pants and a brown wife-beater. A towel hung over his shoulder.
"Morning, you guys. Anyone get into the smokehouse yet, or should I go bring home that bacon?"
Josiah had gone ahead to check on the patches and let out the stock. He hollered before he came in. "Han! I think those deer have been at the hemp patch again!" Once at the door of the house, he saw Hannah, Brent, and Dylan in the front room. "Hey, there," said he, to the Orphan and the Akashic. Bacon sounded pretty fine, right about now, but breakfast would have to wait until he'd solved the deer problem. He stood in the doorway without taking off his boots and did not walk in any further. "Han, do we keep the wire in the house?"
She heard the hunter's voice calling out to the other woman who lived in Barrowspring, and the timid Dreamspeaker edged out of her wing of the house. This early in the morning, she wore a massively over-sized gray T-shirt declaring the wearer to be a book-worm, complete with a green and bespectacled wiggly creature sitting on several thick volumes and holding another one open with a rapturous look upon its line-drawn face. The shirt fell nearly to her knees and almost covered the pair of black bicycle shorts she wore beneath it. She was barefoot as she came into the living room, holding a hand-made cloth bag in one hand and clutching a leatherbound folder with work documents with the other.
"I can... I can speak to the Forest King," she offered to Josiah, flashing a shy smile before lowering her eyes. "If you like. I won't do anything big... just talk. There's -- " Something occurred to her in that moment, and a look of mortification crossed her face just before she scrunched it up. "I'll.. I'll move the shrine," she squeaked. "I'm sorry!" The woman darted out of the house, embarrassed, and began to make preparations for relocating her shrine to the King of the Forest a little farther away from the aforementioned hemp patch.
Hannah looked up from her book as Dylan walked in and commented on their home. In the light of day it was easy to see the hominess of the place. The Verbena smiled warmly at their new housemate. "I'm glad you like it. I hope you slept well enough?" Though she'd been quite aggressive the night before, this morning she seemed much more calm and welcoming. In short order her housemates entered the scene and she looked to all of them answering in the order that the questions have been asked.
First to Brent, "I've gathered eggs and vegetables but no meat." Then to Josiah, "I put it away in the shed the last time we had to use it." Hannah smiled at Emma as the girl ran out and failing the ability to answer her she turned her eyes to Dylan. "Which chore would you prefer? Cooking breakfast or fixing the garden to keep the deer out?"
"Like a log," came the reply. As the day gained traction, the paths of the cabal members began to intersect, and Dylan quietly attempted to fade into the background, observing the behaviors, relationships and mannerisms of his potential new family. Hannah's question about his preference for work brought him back into the fold, and he nodded his head towards Josiah. "I haven't mastered the art of making toast. Think I'll be more helpful outside. I'd like a chance to see the garden anyway."
Brent stifled a snerk at the profession of guilt regarding the old hemp patch. While Josiah was ready to prevent, Emma was ready to cure. Now there was a good combination. Tucking his hands into the pockets of his pajama pants, he'd nod and start out along the way as well. "I'll go brave the terrible outdoors and bring in some protein that isn't eggs. When this is all done, though? We're gonna have to sit down and start sussin' out chores. Kitchen's mine!" he proclaimed and aimed a finger at the scrubbed detective. That same finger was aimed at the veterinary doctor, to boot, before he would head outside toward the smokehouse.
Josiah widened his eyes as Emma ran out. "Well, OK." When she had passed he shook his head and grinned.
To Brent he said, "You got options. There's some bacon and a little summer sausage in the smoke house. And there's still that hog shoulder in the shed fridge, which reminds me. I saw more hog sign down by the bent aspen. Bill Pence and me might get over there next couple of days. Think about coming out."
He turned to face Dylan. "You ever string wire for deer?"
"That's good to hear," Hannah smiled in response to Dylan. Brent's finger was given a look but after only a moment she smiled and nodded. "The kitchen likes you better than me anyway. Tomatoes, scallions, and peppers have been washed and are sitting on the sill drying. Feel free to use them in whatever concoction you've decided to come up with. I've also made flour from some of the gathered cattail pollen. Milk is in the icebox." Brent and Josiah would know that all of these things were likely done before others had woken this morning. Milking the cows always worked best before sunrise. Apis and Bat were particularly picky about such things.
Turning to Josiah she stepped forward and placed her arm around his shoulders in a welcoming way. "It looks like Brent has just taken over my morning plans. Why don't I follow you guys and we'll get the job done swiftly." Hannah moved from Dylan to Josiah encouraging the Orphan along as she did. "Besides, I'd bet you breakfast that you won't be able to find the fencing without my assistance." With a playful smile she leaned up and kissed Josiah softly on the lips.
The detective made a face as he was asked the question, as though scrunching up his features could help him remember. "Maybe once...over a decade ago? If you show me how it's done, I'll try to be a quick study." As Emma made a hasty exit, the Orphan appeared thoughtful. He wasn't one-hundred percent on who the Forest King might be, but he had some guesses. Strange world this was, with its many connections.
"Mmm," said he. When the kiss had finished, he replied, "I don't gamble when breakfast is on the line. Give me a sure thing any day."
Josiah turned and exited, heading for the 'shed,' a low building that seemed to be dug into the side of a hillock.


Our offering includes a full suite of services from R&D, analytical, and intellectual property to market intelligence and go-to-market strategy. Together, these help us support our customers all the way from product identification & development to commercialisation and eventually, life cycle management. We continuously invest in improving and strengthening each of these areas so that our clients can leverage the best of our organisation to compete effectively and maximise value in a challenging environment.
Glenmark Life Sciences understands the difference between supplying commodities and engineering scientific solutions by harnessing the power of complex chemistry. Our chemistry capabilities include synthetic organic chemistry such as heterocyclic chemistry, chiral chemistry, peptides, polymers, carbohydrate chemistry and steroids. Our team of experienced scientists is continuously engaged in finding innovative ways to develop challenging products which have a relatively high barrier to entry.
We combine technology, infrastructure and human resources to consistently develop new products and create patentable innovation.
A team of experienced and committed scientists understands the regulatory requirements of various geographies and can navigate the minefield of intellectual property around specific products.
We have a catalogue of over 260 inventions on which we have different levels of patent protection. 6-8 new products are developed each year.
We devote 18,000 training manhours to quality each year. Our products undergo multiple quality checks and our factories are regularly audited both internally and by external parties. Our Quality Management System (QMS) ensures compliance with Good Manufacturing Practices (cGMPs). Over 300 SOPs are built into our processes.
Our plants are compliant with the requirements of over 35 international health regulatory authorities.
Our people put customers at the centre of everything that they do. To understand, even preempt, customer needs is the hallmark of the Glenmark employee.
Our customers are our partners; we own their concerns. From tailoring product development according to the client's requirement to timely delivery and end-to-end life cycle management, we work closely with our customers to deliver win-win outcomes.
We understand that the global regulatory landscape of generics is a continuously evolving one.
We employ experts with a nuanced and current understanding of regulatory affairs in key geographies.
Customers are assured of our knowledge, experience and support to meet the requirements of the world's most demanding regulators successfully.


text:
Home > Harpur Palate > Vol. 10 > Iss. 1 (2010)
Harpur Palate: a Literary Journal
How Not to Always Talk about The Same Things
Nick Lantz
Lantz, Nick (2010) "How Not to Always Talk about The Same Things," Harpur Palate: a Literary Journal: Vol. 10: Iss. 1, Article 38.
Available at: https://orb.binghamton.edu/harpurpalate/vol10/iss1/38
All Issues Vol. 10, Iss. 1 Vol. 9, Iss. 2 Vol. 9, Iss. 1 Vol. 8, Iss. 2 Vol. 8, Iss. 1 Vol. 7, Iss. 2 Vol. 7, Iss. 1 Vol. 6, Iss. 2 Vol. 6, Iss. 1 Vol. 5, Iss. 2 Vol. 5, Iss. 1 Vol. 4, Iss. 2 Vol. 4, Iss. 1 Vol. 3, Iss. 2 Vol. 3, Iss. 1 Vol. 2, Iss. 2 Vol. 2, Iss. 1 Vol. 1, Iss. 2 Vol. 1, Iss. 1


text:
You searched for "hrithik roshan"
Bollywood NewsHrithik Roshan, Tiger Shroff hunt each other in War teaser
Yash Raj Films has released the teaser of upcoming movie War, presenting Hrithik Roshan and Tiger Shroff as the main leads. As expected, the two actors can be seen fighting full throttle in the snow, in the fields and in the air.
Bollywood NewsHrithik Roshan's Super 30 full movie leaked online by Tamilrockers
Hrithik Roshan's latest release 'Super 30' has been leaked online by a piracy website Tamilrockers. The leak will negatively impact the business of the movie on Box Office.
HealthHrithik Roshan booked for cheating via Cult.Fit
One of the fit actors in Bollywood Hrithik Roshan has been booked for allegedly cheating with an endorsement of a gym brand.
Bollywood News'Super 30' trailer: Hrithik Roshan slams rich people, fights to put the poor on top
The much-awaited trailer for Hrithik Roshan's 'Super 30' has been released by the makers. The film directed by Vikas Bahl will be releasing in theatres on July 12.
Bollywood NewsSuper 30: Hrithik Roshan unveils new poster, announces trailer release date
Hrithik Roshan on Monday shared a new poster on social media with highlighting the new release date of his upcoming movie Super 30. The makers of the movie had preponed release date of the movie from July 26 to July 12.
Bollywood NewsHrithik Roshan delays 'Super 30' to avoid 'personal trauma, mental violence'
Bollywood actor Hrithik Roshan has requested 'Super 30' producers to delay its release to avoid a clash with Kangana Ranaut's 'Mental Hai Kya', to save himself from 'the personal trauma and toxic mental violence this would cause'.
Bollywood NewsTamannaah Bhatia breaks 'no-kissing' policy for this Bollywood actor
Gorgeous Tamannaah Bhatia reveals that there is a 'no-kissing' policy in her contract, but she would love to break the rule for Bollywood actor Hrithik Roshan.
Bollywood NewsTiger Shroff speaks out fear of working opposite Hrithik Roshan
Actor Tiger Shroff is all set to work opposite Hrithik Roshan in an upcoming movie. Recently, he shared his biggest fear of working opposite the man he had been admiring for years.
Bollywood NewsAnurag Kashyap roped in for Hrithik Roshan's 'Super 30' post-production
Director Anurag Kashyap has agreed to take care of the post-production work of Hrithik Roshan's upcoming movie 'Super 30'. The film's work had come to a halt after its director Vikas Bahl stepped out following the Me Too allegations against him.


text:
Neocalosoter pulchripennis is een vliesvleugelig insect uit de familie Pteromalidae. De wetenschappelijke naam is voor het eerst geldig gepubliceerd in 1915 door Girault.

Pteromalidae

redpajama_set_name: RedPajamaWikipedia


text:
package org.jutility.math.common;

//@formatter:off

//@formatter:on

import org.junit.Assert;
import org.junit.BeforeClass;
import org.junit.Test;
import org.jutility.common.datatype.range.Interval;
import org.jutility.common.datatype.util.NumberConstants;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

/**
 * The {@code IntervalTest} class provides unit tests for the {@link Interval}
 * class.
 *
 * @author Peter J. Radics
 * @version 0.1.2
 * @since 0.1.0
 */
@SuppressWarnings({"ObjectEqualsNull", "EqualsWithItself"})
public class IntervalTest {

    private static final Logger LOG = LoggerFactory.getLogger(IntervalTest.class);

    private final Integer intMin = 0;
    private final Integer intMax = 2;
    private final Integer intWithin = 1;
    private final Integer intSmaller = -1;
    private final Integer intLarger = 3;

    private final Double doubleMin = 0.000000000001;
    private final Double doubleMax = 0.00000000001;
    private final Double doubleWithin = 0.000000000009;
    private final Double doubleSmaller = 0.0000000000001;
    private final Double doubleLarger = 0.00000000002;

    @BeforeClass
    public static void setUpClass() {

        NumberConstants.setDeltaD(0.00000000000001);
    }

    /**
     * Test of the constructor of class Interval.
     */
    @Test
    public void testConstructor() {

        IntervalTest.LOG.info("Constructor");

        this.testConstructor(this.intMin, this.intMax);
        this.testConstructor(this.doubleMin, this.doubleMax);

        IntervalTest.LOG.info("\tSuccess.");
    }

    private <T extends Number & Comparable<T>> void testConstructor(
            final T min, final T max) {

        final Interval<T> a = new Interval<>(min, min);

        T lowerBound = a.getLowerBound();
        Assert.assertEquals(lowerBound, min);

        T upperBound = a.getUpperBound();
        Assert.assertEquals(upperBound, min);

        Boolean containsLowerBound = a.containsLowerBound();
        Assert.assertEquals(containsLowerBound, true);

        Boolean containsUpperBound = a.containsUpperBound();
        Assert.assertEquals(containsUpperBound, true);

        final Interval<T> b = new Interval<>(max, min, false, false);

        lowerBound = b.getLowerBound();
        Assert.assertEquals(lowerBound, min);

        upperBound = b.getUpperBound();
        Assert.assertEquals(upperBound, max);

        containsLowerBound = b.containsLowerBound();
        Assert.assertEquals(containsLowerBound, false);

        containsUpperBound = b.containsUpperBound();
        Assert.assertEquals(containsUpperBound, false);
    }

    /**
     * Test of containsLowerBound method, of class Interval.
     */
    @Test
    public void testGetContainsLowerBound() {

        IntervalTest.LOG.info("containsLowerBound");

        this.testGetContainsLowerBound(this.intMin, this.intMax);
        this.testGetContainsLowerBound(this.doubleMin, this.doubleMax);

        IntervalTest.LOG.info("\tSuccess.");
    }

    private <T extends Number & Comparable<T>> void testGetContainsLowerBound(
            final T min, final T max) {

        Interval<T> instance = new Interval<>(min, max);
        Boolean result = instance.containsLowerBound();

        Assert.assertEquals(result, true);

        instance = new Interval<>(min, max, false, true);

        result = instance.containsLowerBound();

        Assert.assertEquals(result, false);
    }

    /**
     * Test of containsUpperBound method, of class Interval.
     */
    @Test
    public void testGetContainsUpperBound() {

        IntervalTest.LOG.info("containsUpperBound");

        this.testGetContainsUpperBound(this.intMin, this.intMax);
        this.testGetContainsUpperBound(this.doubleMin, this.doubleMax);

        IntervalTest.LOG.info("\tSuccess.");
    }

    private <T extends Number & Comparable<T>> void testGetContainsUpperBound(
            final T min, final T max) {

        Interval<T> instance = new Interval<>(min, max);
        Boolean result = instance.containsUpperBound();

        Assert.assertEquals(result, true);

        instance = new Interval<>(min, max, true, false);

        result = instance.containsUpperBound();

        Assert.assertEquals(result, false);
    }

    /**
     * Test of getLowerBound method, of class Interval.
     */
    @Test
    public void testGetLowerBound() {

        IntervalTest.LOG.info("getLowerBound");

        this.testGetLowerBound(this.intMin, this.intMax);
        this.testGetLowerBound(this.doubleMin, this.doubleMax);

        IntervalTest.LOG.info("\tSuccess.");
    }

    private <T extends Number & Comparable<T>> void testGetLowerBound(
            final T min, final T max) {

        Interval<T> b = new Interval<>(min, max);
        Assert.assertEquals(b.getLowerBound(), min);

        b = new Interval<>(max, max);
        Assert.assertEquals(b.getLowerBound(), max);

    }

    /**
     * Test of getUpperBound method, of class Interval.
     */
    @Test
    public void testGetUpperBound() {

        IntervalTest.LOG.info("getUpperBound");

        this.testGetUpperBound(this.intMin, this.intMax);
        this.testGetUpperBound(this.doubleMin, this.doubleMax);

        IntervalTest.LOG.info("\tSuccess.");
    }

    private <T extends Number & Comparable<T>> void testGetUpperBound(
            final T min, final T max) {

        Interval<T> b = new Interval<>(min, max);

        Assert.assertEquals(b.getUpperBound(), max);

        b = new Interval<>(min, min);
        Assert.assertEquals(b.getUpperBound(), min);

    }

    /**
     * Test of contains method, of class Interval.
     */
    @Test
    public void testContainsGenericType() {

        IntervalTest.LOG.info("contains (Generic Type)");

        this.testContainsGenericType(this.intMin, this.intMax, this.intWithin, this.intSmaller, this.intLarger);
        this.testContainsGenericType(this.doubleMin, this.doubleMax, this.doubleWithin, this.doubleSmaller,
                this.doubleLarger);

        IntervalTest.LOG.info("\tSuccess.");
    }

    private <T extends Number & Comparable<T>> void testContainsGenericType(
            final T min, final T max, final T within, final T smaller, final T larger) {

        // [min]
        final Interval<T> a = new Interval<>(min, min);
        Assert.assertEquals(a.toString() + " should contain " + min, Boolean.TRUE, a.contains(min));
        Assert.assertEquals(a.toString() + " should not contain " + max, Boolean.FALSE, a.contains(max));
        Assert.assertEquals(a.toString() + " should not contain " + within, Boolean.FALSE, a.contains(within));
        Assert.assertEquals(a.toString() + " should not contain " + smaller, Boolean.FALSE, a.contains(smaller));
        Assert.assertEquals(a.toString() + " should not contain " + larger, Boolean.FALSE, a.contains(larger));

        // [max]
        final Interval<T> b = new Interval<>(max, max);
        Assert.assertEquals(b.toString() + " should not contain " + min, Boolean.FALSE, b.contains(min));
        Assert.assertEquals(b.toString() + " should contain " + max, Boolean.TRUE, b.contains(max));
        Assert.assertEquals(b.toString() + " should not contain " + within, Boolean.FALSE, b.contains(within));
        Assert.assertEquals(b.toString() + " should not contain " + smaller, Boolean.FALSE, b.contains(smaller));
        Assert.assertEquals(b.toString() + " should not contain " + larger, Boolean.FALSE, b.contains(larger));

        // [min, max]
        final Interval<T> c = new Interval<>(min, max);
        Assert.assertEquals(c.toString() + " should contain " + min, Boolean.TRUE, c.contains(min));
        Assert.assertEquals(c.toString() + " should contain " + max, Boolean.TRUE, c.contains(max));
        Assert.assertEquals(c.toString() + " should contain " + within, Boolean.TRUE, c.contains(within));
        Assert.assertEquals(c.toString() + " should not contain " + smaller, Boolean.FALSE, c.contains(smaller));
        Assert.assertEquals(c.toString() + " should not contain " + larger, Boolean.FALSE, c.contains(larger));

        // (min, max]
        final Interval<T> d = new Interval<>(min, max, false, true);
        Assert.assertEquals(d.toString() + " should not contain " + min, Boolean.FALSE, d.contains(min));
        Assert.assertEquals(d.toString() + " should contain " + max, Boolean.TRUE, d.contains(max));
        Assert.assertEquals(d.toString() + " should contain " + within, Boolean.TRUE, d.contains(within));
        Assert.assertEquals(d.toString() + " should not contain " + smaller, Boolean.FALSE, d.contains(smaller));
        Assert.assertEquals(d.toString() + " should not contain " + larger, Boolean.FALSE, d.contains(larger));

        // [min, max)
        final Interval<T> e = new Interval<>(min, max, true, false);
        Assert.assertEquals(e.toString() + " should contain " + min, Boolean.TRUE, e.contains(min));
        Assert.assertEquals(e.toString() + " should not contain " + max, Boolean.FALSE, e.contains(max));
        Assert.assertEquals(e.toString() + " should contain " + within, Boolean.TRUE, e.contains(within));
        Assert.assertEquals(e.toString() + " should not contain " + smaller, Boolean.FALSE, e.contains(smaller));
        Assert.assertEquals(e.toString() + " should not contain " + larger, Boolean.FALSE, e.contains(larger));

        // (min, max)
        final Interval<T> f = new Interval<>(min, max, false, false);
        Assert.assertEquals(a.toString() + " should not contain " + min, Boolean.FALSE, f.contains(min));
        Assert.assertEquals(a.toString() + " should not contain " + max, Boolean.FALSE, f.contains(max));
        Assert.assertEquals(a.toString() + " should contain " + within, Boolean.TRUE, f.contains(within));
        Assert.assertEquals(a.toString() + " should not contain " + smaller, Boolean.FALSE, f.contains(smaller));
        Assert.assertEquals(a.toString() + " should not contain " + larger, Boolean.FALSE, f.contains(larger));

    }

    /**
     * Test of contains method, of class Interval.
     */
    @Test
    public void testContainsInterval() {

        IntervalTest.LOG.info("contains (Interval)");

        this.testContainsInterval(this.intMin, this.intMax, this.intWithin,
                this.intSmaller, this.intLarger);
        this.testContainsInterval(this.doubleMin, this.doubleMax, this.doubleWithin, this.doubleSmaller,
                this.doubleLarger);

        IntervalTest.LOG.info("\tSuccess.");
    }

    private <T extends Number & Comparable<T>> void testContainsInterval(final T min, final T max, final T within,
            final T smaller, final T larger) {

        // [smaller]
        final Interval<T> smallerI = new Interval<>(smaller, smaller);
        // [min]
        final Interval<T> minI = new Interval<>(min, min);
        // [within]
        final Interval<T> withinI = new Interval<>(within, within);
        // [max]
        final Interval<T> maxI = new Interval<>(max, max);
        // [larger]
        final Interval<T> largerI = new Interval<>(larger, larger);

        this.simpleContainmentTest(smallerI, minI, false, false);
        this.simpleContainmentTest(smallerI, withinI, false, false);
        this.simpleContainmentTest(smallerI, maxI, false, false);
        this.simpleContainmentTest(smallerI, largerI, false, false);

        this.simpleContainmentTest(minI, withinI, false, false);
        this.simpleContainmentTest(minI, maxI, false, false);
        this.simpleContainmentTest(minI, largerI, false, false);

        this.simpleContainmentTest(withinI, maxI, false, false);
        this.simpleContainmentTest(withinI, largerI, false, false);

        this.simpleContainmentTest(maxI, largerI, false, false);

        this.simpleContainmentTest(minI, withinI, false, false);

        this.simpleContainmentTest(smallerI, smallerI, true, true);
        this.simpleContainmentTest(minI, minI, true, true);
        this.simpleContainmentTest(withinI, withinI, true, true);
        this.simpleContainmentTest(maxI, maxI, true, true);
        this.simpleContainmentTest(largerI, largerI, true, true);

        // [smaller, min]
        final Interval<T> smallerMin = new Interval<>(smaller, min);
        // [smaller, within]
        final Interval<T> smallerWithin = new Interval<>(smaller, within);
        // [smaller, max]
        final Interval<T> smallerMax = new Interval<>(smaller, max);
        // [smaller, larger]
        final Interval<T> smallerLarger = new Interval<>(smaller, larger);
        // [min, within]
        final Interval<T> minWithin = new Interval<>(min, within);
        // [min, max]
        final Interval<T> minMax = new Interval<>(min, max);
        // [min, max]
        final Interval<T> minMaxClone = new Interval<>(min, max);
        // [min, larger]
        final Interval<T> minLarger = new Interval<>(min, larger);
        // [within, max]
        final Interval<T> withinMax = new Interval<>(within, max);
        // [within, larger]
        final Interval<T> withinLarger = new Interval<>(within, larger);
        // [max, larger]
        final Interval<T> maxLarger = new Interval<>(max, larger);

        this.complexContainmentTest(minMax, smallerI, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);
        this.complexContainmentTest(minMax, minI, true, true, true, true,
                false, false, false, false, true, true, true, true, false,
                false, false, false);
        this.complexContainmentTest(minMax, withinI, true, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true);
        this.complexContainmentTest(minMax, maxI, true, true, true, true, true,
                true, true, true, false, false, false, false, false, false,
                false, false);
        this.complexContainmentTest(minMax, largerI, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);

        this.complexContainmentTest(smallerMin, minMax, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);
        this.complexContainmentTest(minMax, smallerMin, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);

        this.complexContainmentTest(smallerWithin, minMax, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);
        this.complexContainmentTest(minMax, smallerWithin, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);

        this.complexContainmentTest(smallerMax, minMax, true, true, true, true,
                true, true, true, true, false, false, true, true, false, false,
                true, true);
        this.complexContainmentTest(minMax, smallerMax, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);

        this.complexContainmentTest(smallerLarger, minMax, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true, true);
        this.complexContainmentTest(minMax, smallerLarger, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);

        this.complexContainmentTest(minWithin, minMax, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);
        this.complexContainmentTest(minMax, minWithin, true, true, true, true,
                false, true, false, true, true, true, true, true, false, true,
                false, true);

        this.complexContainmentTest(minMaxClone, minMax, true, true, true,
                true, false, true, false, true, false, false, true, true,
                false, false, false, true);
        this.complexContainmentTest(minMax, minMaxClone, true, true, true,
                true, false, true, false, true, false, false, true, true,
                false, false, false, true);

        this.complexContainmentTest(minLarger, minMax, true, true, true, true,
                false, true, false, true, true, true, true, true, false, true,
                false, true);
        this.complexContainmentTest(minMax, minLarger, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);

        this.complexContainmentTest(withinMax, minMax, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);
        this.complexContainmentTest(minMax, withinMax, true, true, true, true,
                true, true, true, true, false, false, true, true, false, false,
                true, true);

        this.complexContainmentTest(withinLarger, minMax, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);
        this.complexContainmentTest(minMax, withinLarger, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);

        this.complexContainmentTest(maxLarger, minMax, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);
        this.complexContainmentTest(minMax, maxLarger, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);

    }

    private <T extends Number & Comparable<T>> void simpleContainmentTest(final Interval<T> left,
            final Interval<T> right, final Boolean leftContainsRight, final Boolean rightContainsLeft) {

        Assert.assertEquals(leftContainsRight, left.contains(right));
        Assert.assertEquals(rightContainsLeft, right.contains(left));
    }

    private <T extends Number & Comparable<T>> void complexContainmentTest(
            final Interval<T> left, final Interval<T> right,
            final Boolean leftULrightUL, final Boolean leftULrightU,
            final Boolean leftULrightL, final Boolean leftULright,
            final Boolean leftUrightUL, final Boolean leftUrightU,
            final Boolean leftUrightL, final Boolean leftUright,
            final Boolean leftLrightUL, final Boolean leftLrightU,
            final Boolean leftLrightL, final Boolean leftLright,
            final Boolean leftrightUL, final Boolean leftrightU,
            final Boolean leftrightL, final Boolean leftright) {

        final Boolean leftContainsLowerBound = left.containsLowerBound();
        final Boolean leftContainsUpperBound = left.containsUpperBound();
        final Boolean rightContainsLowerBound = right.containsLowerBound();
        final Boolean rightContainsUpperBound = right.containsUpperBound();

        Interval<T> leftCopy = new Interval<>(left.getLowerBound(),
                left.getUpperBound(), leftContainsLowerBound,
                leftContainsUpperBound);
        Interval<T> rightCopy = new Interval<>(right.getLowerBound(),
                right.getUpperBound(), rightContainsLowerBound,
                rightContainsUpperBound);

        leftCopy = new Interval<>(leftCopy.getLowerBound(),
                leftCopy.getUpperBound(), true, true);
        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, true);

        Assert.assertEquals(leftCopy.contains(rightCopy), leftULrightUL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, true);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftULrightU);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, false);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftULrightL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, false);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftULright);

        leftCopy = new Interval<>(leftCopy.getLowerBound(),
                leftCopy.getUpperBound(), false, true);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, true);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftUrightUL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, true);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftUrightU);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, false);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftUrightL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, false);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftUright);

        leftCopy = new Interval<>(leftCopy.getLowerBound(),
                leftCopy.getUpperBound(), true, false);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, true);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftLrightUL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, true);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftLrightU);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, false);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftLrightL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, false);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftLright);

        leftCopy = new Interval<>(leftCopy.getLowerBound(),
                leftCopy.getUpperBound(), false, false);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, true);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftrightUL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, true);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftrightU);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, false);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftrightL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, false);
        Assert.assertEquals(leftCopy.contains(rightCopy), leftright);
    }

    /**
     * Test of intersects method, of class Interval.
     */
    @Test
    public void testIntersects() {

        IntervalTest.LOG.info("intersects");

        this.testIntersects(this.intMin, this.intMax, this.intWithin,
                this.intSmaller, this.intLarger);
        this.testIntersects(this.doubleMin, this.doubleMax, this.doubleWithin,
                this.doubleSmaller, this.doubleLarger);

        IntervalTest.LOG.info("\tSuccess.");
    }

    private <T extends Number & Comparable<T>> void testIntersects(final T min,
            final T max, final T within, final T smaller, final T larger) {

        // [smaller]
        final Interval<T> smallerI = new Interval<>(smaller, smaller);
        // [min]
        final Interval<T> minI = new Interval<>(min, min);
        // [within]
        final Interval<T> withinI = new Interval<>(within, within);
        // [max]
        final Interval<T> maxI = new Interval<>(max, max);
        // [larger]
        final Interval<T> largerI = new Interval<>(larger, larger);

        this.simpleIntersectionTest(smallerI, minI, false);
        this.simpleIntersectionTest(smallerI, withinI, false);
        this.simpleIntersectionTest(smallerI, maxI, false);
        this.simpleIntersectionTest(smallerI, largerI, false);

        this.simpleIntersectionTest(minI, withinI, false);
        this.simpleIntersectionTest(minI, maxI, false);
        this.simpleIntersectionTest(minI, largerI, false);

        this.simpleIntersectionTest(withinI, maxI, false);
        this.simpleIntersectionTest(withinI, largerI, false);

        this.simpleIntersectionTest(maxI, largerI, false);

        this.simpleIntersectionTest(minI, withinI, false);

        this.simpleIntersectionTest(smallerI, smallerI, true);
        this.simpleIntersectionTest(minI, minI, true);
        this.simpleIntersectionTest(withinI, withinI, true);
        this.simpleIntersectionTest(maxI, maxI, true);
        this.simpleIntersectionTest(largerI, largerI, true);

        // [smaller, min]
        final Interval<T> smallerMin = new Interval<>(smaller, min);
        // [smaller, within]
        final Interval<T> smallerWithin = new Interval<>(smaller, within);
        // [smaller, max]
        final Interval<T> smallerMax = new Interval<>(smaller, max);
        // [smaller, larger]
        final Interval<T> smallerLarger = new Interval<>(smaller, larger);
        // [min, within]
        final Interval<T> minWithin = new Interval<>(min, within);
        // [min, max]
        final Interval<T> minMax = new Interval<>(min, max);
        // [min, max]
        final Interval<T> minMaxClone = new Interval<>(min, max);
        // [min, larger]
        final Interval<T> minLarger = new Interval<>(min, larger);
        // [within, max]
        final Interval<T> withinMax = new Interval<>(within, max);
        // [within, larger]
        final Interval<T> withinLarger = new Interval<>(within, larger);
        // [max, larger]
        final Interval<T> maxLarger = new Interval<>(max, larger);

        this.complexIntersectionTest(minMax, smallerI, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);
        this.complexIntersectionTest(minMax, minI, true, true, true, true,
                false, false, false, false, true, true, true, true, false,
                false, false, false);
        this.complexIntersectionTest(minMax, withinI, true, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true);
        this.complexIntersectionTest(minMax, maxI, true, true, true, true,
                true, true, true, true, false, false, false, false, false,
                false, false, false);
        this.complexIntersectionTest(minMax, largerI, false, false, false,
                false, false, false, false, false, false, false, false, false,
                false, false, false, false);

        this.complexIntersectionTest(smallerMin, minMax, true, false, true,
                false, true, false, true, false, false, false, false, false,
                false, false, false, false);
        this.complexIntersectionTest(minMax, smallerMin, true, true, false,
                false, false, false, false, false, true, true, false, false,
                false, false, false, false);

        this.complexIntersectionTest(smallerWithin, minMax, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true, true);
        this.complexIntersectionTest(minMax, smallerWithin, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true, true);

        this.complexIntersectionTest(smallerMax, minMax, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true, true);
        this.complexIntersectionTest(minMax, smallerMax, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true, true);

        this.complexIntersectionTest(smallerLarger, minMax, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true, true);
        this.complexIntersectionTest(minMax, smallerLarger, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true, true);

        this.complexIntersectionTest(minWithin, minMax, true, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true);
        this.complexIntersectionTest(minMax, minWithin, true, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true);

        this.complexIntersectionTest(minMaxClone, minMax, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true, true);
        this.complexIntersectionTest(minMax, minMaxClone, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true, true);

        this.complexIntersectionTest(minLarger, minMax, true, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true);
        this.complexIntersectionTest(minMax, minLarger, true, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true);

        this.complexIntersectionTest(withinMax, minMax, true, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true);
        this.complexIntersectionTest(minMax, withinMax, true, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true);

        this.complexIntersectionTest(withinLarger, minMax, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true, true);
        this.complexIntersectionTest(minMax, withinLarger, true, true, true,
                true, true, true, true, true, true, true, true, true, true,
                true, true, true);

        this.complexIntersectionTest(maxLarger, minMax, true, true, false,
                false, false, false, false, false, true, true, false, false,
                false, false, false, false);
        this.complexIntersectionTest(minMax, maxLarger, true, false, true,
                false, true, false, true, false, false, false, false, false,
                false, false, false, false);
    }

    private <T extends Number & Comparable<T>> void simpleIntersectionTest(
            final Interval<T> left, final Interval<T> right,
            final Boolean intersects) {

        Assert.assertEquals(left.intersects(right), intersects);
        Assert.assertEquals(right.intersects(left), intersects);
    }

    private <T extends Number & Comparable<T>> void complexIntersectionTest(
            final Interval<T> left, final Interval<T> right,
            final Boolean leftULrightUL, final Boolean leftULrightU,
            final Boolean leftULrightL, final Boolean leftULright,
            final Boolean leftUrightUL, final Boolean leftUrightU,
            final Boolean leftUrightL, final Boolean leftUright,
            final Boolean leftLrightUL, final Boolean leftLrightU,
            final Boolean leftLrightL, final Boolean leftLright,
            final Boolean leftrightUL, final Boolean leftrightU,
            final Boolean leftrightL, final Boolean leftright) {

        Interval<T> leftCopy = new Interval<>(left.getLowerBound(),
                left.getUpperBound(), true, true);

        Interval<T> rightCopy = new Interval<>(right.getLowerBound(),
                right.getUpperBound(), true, true);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftULrightUL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, true);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftULrightU);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, false);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftULrightL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, false);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftULright);

        leftCopy = new Interval<>(leftCopy.getLowerBound(),
                leftCopy.getUpperBound(), false, true);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, true);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftUrightUL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, true);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftUrightU);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, false);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftUrightL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, false);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftUright);

        leftCopy = new Interval<>(leftCopy.getLowerBound(),
                leftCopy.getUpperBound(), true, false);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, true);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftLrightUL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, true);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftLrightU);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, false);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftLrightL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, false);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftLright);

        leftCopy = new Interval<>(leftCopy.getLowerBound(),
                leftCopy.getUpperBound(), false, false);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, true);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftrightUL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, true);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftrightU);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), true, false);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftrightL);

        rightCopy = new Interval<>(rightCopy.getLowerBound(),
                rightCopy.getUpperBound(), false, false);
        Assert.assertEquals(leftCopy.intersects(rightCopy), leftright);
    }

    /**
     * Test of isContainedIn method, of class Interval.
     */
    @Test
    public void testIsContainedIn() {

        IntervalTest.LOG.info("isContainedIn");

        this.testIsContainedIn(this.intMin, this.intMax, this.intWithin,
                this.intSmaller, this.intLarger);
        this.testIsContainedIn(this.doubleMin, this.doubleMax,
                this.doubleWithin, this.doubleSmaller, this.doubleLarger);

        IntervalTest.LOG.info("\tSuccess.");
    }

    private <T extends Number & Comparable<T>> void testIsContainedIn(
            final T min, final T max, final T within, final T smaller,
            final T larger) {

        final Interval<T> minMax = new Interval<>(min, max);
        final Interval<T> smallerLarger = new Interval<>(smaller, larger);
        final Interval<T> withinWithin = new Interval<>(within, within);

        Assert.assertEquals(minMax.contains(smallerLarger),
                smallerLarger.isContainedIn(minMax));
        Assert.assertEquals(minMax.contains(withinWithin),
                withinWithin.isContainedIn(minMax));
        Assert.assertEquals(smallerLarger.contains(minMax),
                minMax.isContainedIn(smallerLarger));

        Assert.assertEquals(minMax.isContainedIn(null), false);

    }

    /**
     * Test of equals method, of class Interval.
     */
    @Test
    public void testEquals() {

        IntervalTest.LOG.info("equals");

        this.testEquals(this.intMin, this.intMax, this.intWithin,
                this.intSmaller, this.intLarger);
        this.testEquals(this.doubleMin, this.doubleMax, this.doubleWithin,
                this.doubleSmaller, this.doubleLarger);

        IntervalTest.LOG.info("\tSuccess.");
    }

    @SuppressWarnings({"EqualsBetweenInconvertibleTypes", "EqualsWithItself"})
    private <T extends Number & Comparable<T>> void testEquals(final T min,
            final T max, final T within, final T smaller, final T larger) {

        final Interval<T> interval = new Interval<>(min, max);

        final Interval<T> equalInterval = new Interval<>(min, max);
        final Interval<T> intervalWithoutLowerBound = new Interval<>(min, max,
                false, true);
        final Interval<T> intervalWithoutUpperBound = new Interval<>(min, max,
                true, false);
        final Interval<T> intervalWithoutBounds = new Interval<>(min, max,
                false, false);

        final Interval<T> smallerMax = new Interval<>(smaller, max);
        final Interval<T> minLarger = new Interval<>(within, larger);
        final Interval<T> withinI = new Interval<>(within, within);

        Assert.assertNotEquals(null, interval);
        //noinspection EqualsBetweenInconvertibleTypes
        Assert.assertNotEquals(interval, max);

        Assert.assertEquals(interval, interval);
        Assert.assertEquals(interval, equalInterval);
        Assert.assertNotEquals(interval, intervalWithoutLowerBound);
        Assert.assertNotEquals(interval, intervalWithoutUpperBound);
        Assert.assertNotEquals(interval, intervalWithoutBounds);

        Assert.assertNotEquals(interval, smallerMax);
        Assert.assertNotEquals(interval, minLarger);
        Assert.assertNotEquals(interval, withinI);
    }

    /**
     * Test of hashCode method, of class Interval.
     */
    @Test
    public void testHashCode() {

        IntervalTest.LOG.info("hashCode");

        this.testHashCode(this.intMin, this.intMax);
        this.testHashCode(this.doubleMin, this.doubleMax);

        IntervalTest.LOG.info("\tSuccess.");
    }

    private <T extends Number & Comparable<T>> void testHashCode(final T min,
            final T max) {

        final Interval<T> interval = new Interval<>(min, max);
        final Interval<T> equalInterval = new Interval<>(min, max);

        Assert.assertEquals(interval, equalInterval);
        Assert.assertEquals(interval.hashCode(), equalInterval.hashCode());

    }

    /**
     * Test of toString method, of class Interval.
     */
    @Test
    public void testToString() {

        IntervalTest.LOG.info("toString");

        this.testToString(this.intMin, this.intMax);
        this.testToString(this.doubleMin, this.doubleMax);

        IntervalTest.LOG.info("\tSuccess.");
    }

    private <T extends Number & Comparable<T>> void testToString(final T min,
            final T max) {

        final String squareBracketOpen = "[";
        final String squareBracketClose = "]";
        final String parenthesisOpen = "(";
        final String parenthesisClose = ")";
        final String separator = ", ";

        final Interval<T> a = new Interval<>(min, min);
        final String zeroInterval = squareBracketOpen + min.toString()
                + squareBracketClose;
        Assert.assertEquals(zeroInterval, a.toString());

        Interval<T> b = new Interval<>(min, max);
        String zeroOneInterval = squareBracketOpen + min.toString() + separator
                + max.toString() + squareBracketClose;
        Assert.assertEquals(zeroOneInterval, b.toString());

        b = new Interval<>(b.getLowerBound(), b.getUpperBound(), false,
                b.containsUpperBound());
        zeroOneInterval = parenthesisOpen + min.toString() + separator
                + max.toString() + squareBracketClose;
        Assert.assertEquals(zeroOneInterval, b.toString());

        b = new Interval<>(b.getLowerBound(), b.getUpperBound(),
                b.containsLowerBound(), false);
        zeroOneInterval = parenthesisOpen + min.toString() + separator
                + max.toString() + parenthesisClose;
        Assert.assertEquals(zeroOneInterval, b.toString());

        b = new Interval<>(b.getLowerBound(), b.getUpperBound(), true,
                b.containsUpperBound());
        zeroOneInterval = squareBracketOpen + min.toString() + separator
                + max.toString() + parenthesisClose;
        Assert.assertEquals(zeroOneInterval, b.toString());
    }
}