text:
New York Life Insurance Company

New York Life Insurance Company (NYLIC) is the third-largest life insurance company and the largest mutual life insurance company in the United States, and is ranked #71 on the 2023 Fortune 500 list of the largest U.S. corporations by total revenue. In 2023, NYLIC achieved the best possible ratings by the four independent rating companies (Standard & Poor's, AM Best, Moody's and Fitch Ratings). Other New York Life affiliates provide an array of securities products and services, as well as institutional and retail mutual funds.

Early history

New York Life Insurance Company first opened in Manhattan's Financial District as Nautilus Mutual Life in 1841, 10 years after the first life insurance charter was granted in the United States. Originally chartered in 1841, the company also sold fire and marine insurance. The company's first president, James De Peyster Ogden, was appointed in 1845. Nautilus renamed itself New York Life Insurance Company in 1845 to concentrate on its life insurance business.

In its early years (1846–1848) the company, along with other insurance companies of the day including Aetna and US Life, insured the lives of slaves for their owners. By 1847 these accounted for onethird of New York Life's policies. The board of trustees voted to end the sale of insurance policies on slaves in 1848. The company also sold policies to soldiers and civilians involved in combat during the American Civil War and paid claims under a flag of truce during that time. In the late 1800s, the company began employing female agents.

New York Life continued to grow throughout its first 100 years as the national population and the market for life insurance increased. New York Life's growth was in part fueled by its introduction of a system by which the company used agents to find new business. In 1892, company President John A. McCall introduced the branch office system: offices that served as liaisons between New York and field agents.

In 1894, the company became the first US-based insurance provider to offer life insurance to women at the same cost as men; social reformer Susan B. Anthony was one of the company's first female policyholders. In 1896, New York Life became the first company to insure people with disabilities or in hazardous occupations.

20th century
The New York Life Building at 51 Madison Avenue in Manhattan, designed by American architect Cass Gilbert, opened in December 1928. The company moved into the 34-story skyscraper in 1929. Later that year, New York Life's assets survived the stock market crash; state regulation and company investing policy had led New York Life to invest in government bonds and real estate, not common stocks.

Following World War II, New York Life further diversified; it invested in real estate development in the late 1940s and launched a mortgage-loan program for veterans in 1946. In 1957, New York Life hired one of the industry's first black agents, Cirilo McSween. In the 1970s, New York Life began selling annuities and mutual funds. In the late 1990s and early 2000s, as other mutual life insurance companies became publicly traded corporations, New York Life remained a mutual company. New York Life entered the Mexican market in 1999 when it acquired Seguros Monterrey from Aetna.

Recent history
New York Life, along with other insurance companies, relaxed the claims process for missing persons in the wake of the September 11 attacks. Fearful of the stability of the market during the two years prior to the financial crisis of 2007–2008, New York Life moved its cash into other investments such as treasury bonds. In the ensuing financial crisis, New York Life Insurance Company rejected assistance from the U.S. Treasury Department.

Following the 2013 acquisition of Dexia Asset Management, later renamed Candriam Investors Group, New York Life Investments became one of the largest asset managers worldwide, with access to markets in Europe, Asia and Australia, in addition to the United States.

In November 2021, the company announced that company president Craig DeSanto was replacing CEO Ted Mathas. The transition was finalized in April 2022, and Mathas stayed with the company as a non-executive chairman.

Operations
As of 2016, New York Life Insurance Company was the country's third-largest life insurance company. A mutual insurance company, New York Life is owned by its policyholders and has no outside shareholders. As a mutual, New York Life distributes a portion of its earnings to eligible policyholders as annual dividends. As of 2016, the company has paid a dividend every year since 1854. Through Seguros Monterrey New York Life, the company offers insurance in Mexico.

New York Life's core product is whole life insurance, a type of life insurance offering lifelong protection that builds cash value over time. New York Life also sells term life insurance, universal life insurance, variable universal life insurance, long-term care insurance, annuities and disability insurance. The company operates New York Life Direct, selling direct-to-consumer policies, and is the exclusive life insurance partner of the AARP.

Asset management businesses
New York Life Investments is a subsidiary global asset management business which serves both institutional and retail clients. It ranks No. 26 by total worldwide institutional assets under management, according to Pensions & Investments' Largest Money Managers Survey 2017.

The group manages money through independent investment boutiques. These boutiques include:
 * Ausbil, an Australian investment boutique specializing in equities
 * Candriam Investors Group, which focuses on high yield, absolute return, emerging debt, sustainable investments and asset allocation strategies
 * Credit Value Partners, which specializes in opportunistic, distressed debt and high-yield corporate credit
 * GoldPoint Partners, a private equity firm
 * IndexIQ, which specializes in exchange-traded funds and alternative investment strategies
 * MacKay Shields, an asset management firm that focuses on income generation and offers capital growth through mutual and hedge funds
 * Madison Capital Funding, which provides financing to private equity firms
 * Private Advisors, an asset manager specializing in hedge funds and private equity funds

Charitable efforts
New York Life Foundation is the insurance company's philanthropic arm. Its areas of focus include childhood bereavement. New York Life Foundation first became involved in childhood bereavement programs when it supported the Comfort Zone Camp in 2007. Its partners and programs include the National Alliance of Grieving Children, Grief Reach, Coalition to Support Grieving Students, Camp Erin/Moyer Foundation, Tragedy Assistance Program for Survivors and Boys and Girls Clubs of America. It sponsored the HBO documentary One Last Hug.

The company also emphasizes giving to various cultural communities, including the African-American community. The company also funded a $10 million endowment to the Colin Powell Center for Policy Studies at the City College of New York called the New York Life Endowment for Emerging African-American Issues in 2006.

Ratings and rankings
In 2017 Fortune  named New York Life among its Most Admired Companies in the life insurance industry. Forbes ranked New York Life #364 among America's Best Employers for 2017. As of 2023, New York Life ranks No. 71 on the Fortune 500.

By the end of 2023, New York Life had earned the highest financial strength ratings from major four rating agencies: A++ from A.M.Best, AAA from Fitch Ratings, Aaa from Moody and AA+ from Standard & Poor's.

title: New York Life Insurance Company


text:
User talk:Rewan

Highland Park
My wife and I have lived in northern Highland Park for two years now and have been noticing a recent trend of gang activities which has been steadly increasing over the last few months. When we first moved here we saw few taggins mostly non gang related and notified the city to have them removed which they did promptly. We have now seen a steady upturn in gang tags ( HLP) and a steady increase in crime i.e gun shuts fired. Two months ago there was a series of shootings over a two week period which resulted in a number of deaths. Although the deaths were all gang on gang killings it makes us both a little nervous especially now that we have a young child, 8 months old. We are not naive and we know of the history of gang violence in this area in the 80;s and 90's but we where reassured that these type of incedints was decreasing and not much of a problem anymore. We of course took it with a grain of salt we saw an upswing of young couples buying and fixing up places plus the increase of properties in the area gave us a false sense of security. Our area had been spared some of the ugly sides of what we know still occurs, I am a transplant from Baltimore which has some very violent and rough areas which i know of first hand. I am well aware of living in a tough neighborhood and seen other ares turn around by means of gentrification I had held out hope that this to was happening to Highland Park and in many respects it is otherwise we would not of purchased a home here. But with the rash of gang activities the constent blairing of sirens, helocopters and now this diturbing LA Weekly article I came across "Avenues of Death How Highland Park’s Latino gang targets African-Americans" http://www.laweekly.com/ink/05/34/features-pelisek.php I find it sad and troubling that there is not more coverage or information on this subject. When my wife and I searched to find out information on crime stats and other research on the area before we purchased two years ago there was no info to be found on this subect we even talked to the northeast police division on the area and they didn't share or disclose this matter. We are amazed by the lack of concern and the complete silence from the media at large and the community. I no longer feel secure or safe here maybe its because we now have a young child to think about but I am really upset by the silence and lack of concern for what the LA Weekly article on latino gangs targeting blacks in Highland Park doesn't get a mention in the local neighborhood press, The Highland Park Neighborhood council, the mayor and other government officials as well as other news organizations.

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: User talk:Rewan


text:
New York City Civil Court

The Civil Court of the City of New York is a civil court of the New York State Unified Court System in New York City that decides lawsuits involving claims for damages up to $25,000 and includes a small claims part (small claims court) for cases involving amounts up to $10,000 as well as a housing part (housing court) for landlord-tenant matters, and also handles other civil matters referred by the New York Supreme Court. The court has divisions by county (borough), but it is a single citywide court.

It handles about 25% of all the New York state and local courts' total filings. The court consists of 3 parts: Housing, Small Claims, and General Civil. The court's jurisdiction includes ejectment actions, replevin of personal property within monetary limits, equity jurisdiction limited to real property actions, real property actions such as partitions, foreclosures within monetary limits, and actions to rescind or reform a contract.

Housing Court
Housing Court is devoted to the enforcement of state and local housing standards laws. The housing part's (HP) fundamental purpose is to ensure that landlords provide safe and habitable housing. The majority of cases are eviction proceedings over unpaid rent.

The city's right-to-counsel law guarantees free legal services to all tenants facing eviction. People with gross household incomes at or below 200% of the federal poverty level can receive full legal representation, whereas everyone can receive brief legal assistance, regardless of immigration status and provided no later than their first scheduled appearance.

Its enforcement and remedial powers include injunctions, restraining orders, and other orders to correct and prevent housing-code violations and to compensate aggrieved parties. Under Article 7A, one-third of tenants of a multiple dwelling may get a judgment directing the deposit of rents into court for remedying conditions dangerous to life, health or safety. 7A supplements which provides that in proceedings for non-payment of rent, the tenant may be permitted to deposit the rent into court pending cure of the violations if they can prove of the existence of dangerous conditions. Other state and local housing standards laws include the Multiple Dwelling Law of the Consolidated Laws, and the housing maintenance code, building code and health code of the New York City Administrative Code.

Small Claims Court
The Small Claims Part, commonly referred to as Small Claims Court, is the division of the court dedicated to resolving monetary disputes involving claims up to $5,000. Designed with simpler and more informal procedures compared to other parts of the court system, Small Claims Court encourages individuals to represent themselves, aiming to offer an accessible and efficient legal resolution path for the public.

The cases typically dealt with in this court involve personal or property damages, contract disputes, or disagreements over services rendered. The small filing fees and streamlined processes make it cost-effective for individuals or businesses involved in monetary disputes. Cases are heard by either judges or volunteer lawyer arbitrators, with arbitration often providing a faster resolution. In certain situations, disputes may be referred to mediation where a neutral third party facilitates an agreement between the disputing parties.

Administration
The court's divisions are by each county (borough). In each division there are a number of court parts established by the Chief Administrative Judge. The "Housing Part" (HP) refers to the part of the Housing Court devoted exclusively to code enforcement.

Other parts include:

 * Calendar part, for the maintaining and calling of a calendar of cases, and for the hearing and disposition of all motions and applications, including orders to show cause and applications for adjournments, in civil actions that have been placed on a reserve or ready calendar but not yet assigned to a trial part.
 * Trial part, for the trial of civil actions and for the hearing and determination of all motions and applications, including orders to show cause, made after an action is assigned to a trial part.
 * Motion part, for the hearing and determination of motions and applications that are not otherwise required to be made in a calendar part, trial part or conference part.
 * Conference part, for the precalendar or pretrial conference of actions.
 * Multipurpose part, for the performance of the functions of a calendar part, a trial part, a motion part, a conference part, as well as other special parts of court.

Judges
There are approximately 120 Civil Court judges in the New York City Civil Court. Civil Court judges may be assigned by the Chief Administrative Judge of New York to the Criminal Court, Family Court, or Supreme Court. At any given time, about 50 Civil Court judges are assigned to the Civil Court, with the rest assigned to the Criminal, Family or Supreme Courts.

Civil Court judges are elected countywide or from districts to 10-year terms, with vacancies filled by the mayor and with their service continuing until the last day of December after next election. The Legislature has consistently opted to fill judgeships using the preexisting mixed pattern of countywide and Municipal Court districts—

 * 1) seats formerly held by City Court justices, elected on a countywide basis;
 * 2) seats formerly held by Municipal Court justices, elected from districts located within counties; and
 * 3) seats created by successive acts of the Legislature, elected on a countywide basis.

A candidate needs to file petitions to be considered a candidate for a political party's nomination in the general election; petitions containing 4,000 signatures are needed for a county-wide seat, and petitions containing 1,500 signatures are necessary for a district seat. Party leaders frequently designate candidates for the Civil Court judgeships, who then face an open primary against others who qualify for the ballot. The party machine usually manages to elect most of its judicial candidates.

Legal aid
The New York City Office of Civil Justice (OCJ) is responsible for implementing the city's right-to-counsel law.

Housing judges
There are approximately 50 Housing Court judges in the New York City Civil Court. In housing court, referees known as "housing judges" preside over most proceedings. Housing Court judges handle the housing parts of the New York City Civil Court, but are not judges provided for under Article VI of the New York Constitution. Housing judges are appointed by the Chief Administrative Judge to five-year terms from a list of qualified applicants screened and selected by the Housing Court Advisory Council. All 50 Housing Court judges serve in the Civil Court and cannot be assigned to other courts.

Arbitrators
With the consent of the parties, a volunteer arbitrator hears and decides disputes in small claims parts. Over 2800 arbitrators preside over 95% of the cases heard in small claims parts. They are appointed by the administrative judge of the court.

Analysis and criticism
Landlords in New York City may use a blacklist of persons who have appeared in housing court as a plaintiff or defendant. Known among housing advocates and lawyers as the tenant blacklist, it is compiled by tenant-screening database companies from housing court records.

The appointment of housing judges has been criticized because the advisory council through which appointments are processed is composed largely of members of real estate interests and is not representative of the population.

History
In 1759, so-called justices' courts held by the mayor, recorder or an alderman could try cases in controversy of not more than £5. In 1781, they were replaced by assistant justices' courts held by associate justices appointed by the governor. In 1787, these were replaced by assistant justices with the power of justices of the peace in other counties. In 1797, these were replaced with justices of the peace for the city and county of New York and were constituted as one court.

In 1807-1808 these were replaced by justices' courts and assistants justices' courts. In 1819, the justices' courts were renamed as the marine court of the city of New York, and in 1883 was renamed as the City Court of the City of New York. In 1848–1849 the assistants justices' courts were replaced with newly created justices' courts elected within six districts, and in 1852 these justices' courts were renamed as district courts, by 1857 divided into seven districts and by 1882 into ten districts,  and by the city charter of 1897 the district courts of New York City and justices' courts of Brooklyn and Long Island City were consolidated into the Municipal Court of the City of New York. Small claims parts were added to the Municipal Court in 1934.

On September 1, 1962, the City Court and the Municipal Court were merged to form the current Civil Court. The New York City Civil Court Act was primarily based upon the New York City Municipal Court Code, and to some extent the New York City Court Act and the practice of the County Courts outside NYC. Francis E. Rivers on the City Court legislative committee criticized the new court act, calling it "outdated" and "radically limited by practice provisions adapted to conditions existing more than a half century ago" given that it used Municipal Court Code legal procedure instead of the newer Civil Practice Act.

In 1820, a landlord-drafted act removed the common law six-month waiting period for ejectments, allowing summary eviction and removal of tenants for nonpayment. The Tenement House Act of 1901 was enacted by Progressive reformers to ban the construction of poor-quality apartment buildings. The Housing Stability and Tenant Protection Act of 2019 introduced major changes to landlord-tenant law.

The housing part and its housing judges were created on April 1, 1973. In Glass v Thompson the Appellate Division held the appointment of "hearing officers" to preside over non-jury trials in the housing part was constitutional, suggesting that although they were able to preside over housing matters and exercise judicial functions, their office was distinct from that of a judge of the Civil Court because they are essentially referees: nonjudicial officers of the court appointed to assist it in the performance of its judicial functions. In 1978 they were renamed as "housing judges" with the intent to improve their stature, though they "are still nonjudicial officers of the court".

General and cited references

 * Chapter 693, enacted 24 April 1962, effective 1 September 1962.
 * Chapter 279, enacted 14 April 1915, effective 1 September 1915.

title: New York City Civil Court


text:
Rory Lamont

Rory Lamont (born 10 October 1982 in Perth) is a former rugby union player who played as full-back and on the wing for Glasgow Warriors and Scotland. He prides himself on his versatility. Rory is the younger brother of Sean Lamont.

Club career
Lamont played for Northampton Saints, and also for Northampton Old Scouts RFC after leaving Northampton Saints.

In February 2009 it was announced that he was to join RC Toulon in France's Top 14.

On 27 November he terminated his contract himself as he felt he was not getting enough playing time, risking him losing his place in the Scottish side. He was linked with a return to Northampton Saints as a winger but also to Harlequins and Saracens. He joined Glasgow Warriors in December 2011.

International career
Lamont made a memorable try-scoring debut for Scotland in the 2005 Six Nations Championship match against Wales at Murrayfield. He also played for Scotland A against Australia A in the experimental position of inside centre at national coach Frank Hadden's request.

He played in the 2007 Rugby World Cup at full-back, arguably being Scotland's best back in the tournament. While playing for Scotland against England on 8 March 2008, he sustained a facial fracture.

He returned for the 2011 World Cup, but only played one game, against Georgia. During the match against France in the 2012 Six Nations Championship, Lamont broke his leg. He never managed to regain full fitness after this injury.

Retirement
Lamont announced his retirement from professional rugby on 26 April 2013, citing as a deciding factor his inability to recover fully from the broken leg he had suffered against France the previous year.

title: Rory Lamont


text:
Extended-release morphine

Extended-release (or slow-release) formulations of morphine are those whose effect last substantially longer than bare morphine, availing for, e.g., one administration per day. Conversion between extended-release and immediate-release (or "regular") morphine is easier than conversion to or from an equianalgesic dose of another opioid with different half-life, with less risk of altered pharmacodynamics.

Brand names
Brand names for this formulation of morphine include Avinza, Kadian, MS Contin, MST Continus,  Morphagesic, Zomorph, Filnarine, MXL, Malfin, Contalgin, and Dolcontin. MS Contin is a trademark of Purdue Pharma, and is available in the United States and Australia. In the UK, MS Contin is marketed by NAPP Pharmaceuticals as MST Continus. MS Contin is a DEA Schedule II substance in the United States, a Schedule 8 (controlled) drug in Australia and a Schedule 2 CD (Controlled Drug) in the UK.

Avinza is made by King Pharmaceuticals and Kadian is made by Actavis Pharmaceuticals. Unlike the MS Contin brand and its generic versions, Kadian and Avinza are designed to be 12- to 24-hour release, not 8- to 12-hour. So instead of 2–3 times a day dosing, it can be 1–2 times.

MST Continus  and MXL are registered copyright and trademark of Napp Pharmaceuticals and are available in the UK. MXL is a 24-hour release formula designed to be taken once daily. It is available in doses between 30 mg and 200 mg in 30 mg intervals (equating to between 1.25 mg/hour and 8.33 mg/hour). MST Continus is a 12-hour release formula, therefore it is given 2 times per day. It is available in the following doses: 5 mg, 10 mg, 15 mg, 30 mg, 60 mg, 100 mg and 200 mg tablets (equating to between 0.416 mg/hour and 16.67 mg/hour).

Dosage comparison
For constant pain, the relieving effect of extended-release morphine given once (for Kadian ) or twice (for MS Contin ) every 24 hours is roughly the same as multiple administrations of immediate release (or "regular") morphine. Morphine sulfate pentahydrade (trade names including Dolcontin) has a higher molecular mass than morphine base, and therefore 10 mg morphine sulfate pentahydrate contains approximatively 7.5 mg of morphine free base. Extended-release morphine can be administered together with "rescue doses" of immediate-release morphine pro re nata in case of breakthrough pain, each generally consisting of 5% to 15% of the 24-hour extended-release dosage.

Structure
Some brands may have a pellet (spheroid) formulations (made by extrusion and spheronization) can be used for controlled release of the drug in the body whereas powder filled pellets generally cannot. The plastic spheres containing powder have micropores that open at varying pH levels, to maintain a mostly constant release during transit through the digestive tract. The spheres themselves, the outer shells, pass undigested in most patients. Other brands are thought to use ethylcellulose coatings to control drug release from pellets. Another use these style medications have is that they can be given via NG tube, the pellets being very small. This makes them one of the few extended release oral medications that can be given by feeding tube.

Opioid replacement therapy
According to a Cochrane review in 2013, extended-release morphine as an opioid replacement therapy for people with heroin addiction or dependence confers a possible reduction of opioid use and with fewer depressive symptoms but overall more adverse effects when compared to other forms of long-acting opioids. The length of time in treatment was not found to be significantly different.

title: Extended-release morphine


text:
Woman Chief

Bíawacheeitchish, in English Woman Chief (c. 1806 – 1858), was a bacheeítche (chief) and warrior of the Crow people. Interested in traditionally male pursuits from an early age, she became one of the Crows' most significant leaders, joining the Council of Chiefs as the third ranking member. She attracted substantial attention from Western visitors; she may be the same person as "Pine Leaf" described by James Beckwourth, though the accuracy of this account is challenged.

Biography
The woman eventually known as Woman Chief was born to the Gros Ventre people; her birth name is unknown. At the age of about 10 she was taken prisoner by a raiding party of Crows, and was adopted by a Crow warrior who raised her among his people. She showed a disposition to assume traditionally male activities, and her foster father evidently encouraged her pursuits, as he had lost his sons to death or capture. She earned acclaim for her horse riding, marksmanship, and ability to field-dress a buffalo. However, unlike other Two-Spirits, she wore typical female clothing rather than adopting men's garments. When her father died, she assumed leadership of his lodge.

She gained renown as a warrior during a raid by the Blackfoot on a fort sheltering Crow and white families. She reportedly fought off multiple attackers and was instrumental in turning back the raid. She subsequently raised her own band of warriors and raided Blackfoot settlements, taking off many horses and scalps. For her deeds she was accepted to represent her lodge as bacheeítche (chief) in the Council of Chiefs and was given the name Bíawacheeitchish, or Woman Chief. She eventually rose to the rank of third among the council's 160 lodges. She married four wives, which increased the wealth and prestige of her lodge. She became involved in peace negotiations with other Upper Missouri tribes following the 1851 Treaty of Fort Laramie, and successfully negotiated peace with the Gros Ventres, the tribe of her birth. After several years of peace, Woman Chief was ambushed and killed by a Gros Ventres party.

Western visitors who met Woman Chief, including Edwin Denig and Rudolph Kurz, were fascinated with her. Typically, they considered her an exotic figure among the patriarchal Crow and likened her to the Amazons of European myth. Their accounts are now considered biased, though they provide valuable details about Woman Chief's life. James Beckwourth wrote about a Crow warrior named Bar-chee-am-pe, or Pine Leaf, who may be identified with Woman Chief. Some details of Pine Leaf's life match what is known of Woman Chief, though Beckwourth's account appears to be greatly exaggerated, if not entirely fictional. Beckwourth claimed to have met Pine Leaf while living with the Crow in the 1820s. He wrote that she was a formidable warrior who vowed to kill one hundred enemies before she would marry. He further claimed to have had a romantic relationship with her and to have proposed marriage. Among those challenging Beckwourth's account was Bernard DeVoto, who wrote that Beckwourth is reliable save for three areas: numbers, romance, and his own importance.

Beside Woman Chief there were other known warrior women of the Crow Nation, including Akkeekaahuush (Comes Toward The Near Bank, c. 1810 – 1880) and Biliíche Héeleelash (Among The Willows, c. 1837 – 1912), the latter a prominent war leader (pipe carrier).

title: Woman Chief


text:
User:Nibaq

 * My Flickr Photo Page
 * My Blog Savior Machine

title: User:Nibaq


text:
Fort Defiance (Ohio)

Fort Defiance was built by General "Mad" Anthony Wayne in the second week of August 1794 at the confluence of the Auglaize and Maumee rivers. It was one of a line of defenses constructed by American forces in the campaign leading to the Northwest Indian War's Battle of Fallen Timbers on August 20, 1794.

Work began on August 9, 1794, and was completed by August 17. The name was derived from a declaration by Charles Scott, who was leading a band of Kentucky militiamen in support of Wayne, that: "I defy the English, Indians, and all the devils of hell to take it." The post was considered one of the strongest fortifications built in that period.

Before and during the Battle of Fallen Timbers, Wayne ordered the destruction of all Native American villages and their crops within a 50 mi radius of the fort. The land which originally belonged to Native Americans was ceded to the United States by the British after the American Revolutionary War. The British would later supply and influence local tribes to take up arms.. Under terms of the Treaty of Greenville, signed on August 3, 1795, the native nations ceded six square miles around the fort and allowed the Americans to maintain a trading post there, even though it was within the area of land defined by the "Greenville Treaty Line", beyond which Americans had agreed not to settle. Wayne promised the land of "Indiana", the remaining land to the west, to remain Indian forever. During the treaty meeting, Wayne brought with him food supplies for the natives and made sure crops were planted again. The fort was abandoned in 1796.

Fort Winchester was constructed on a nearby site in 1812 by Gen. William Henry Harrison.

The city of Defiance, Ohio, was founded at the fort's location in 1822. In 1904, the site of the fort was chosen for the Defiance Public Library.

Fort Defiance served as a reference point for defining the boundary line of land cession in the Treaty of Detroit in 1807. This north–south line would be used again as the Michigan Meridian in the survey of lands in Michigan.

Today, a park occupies the site of the fort, which was added to the National Register of Historic Places in 1980.

title: Fort Defiance (Ohio)


text:
Ventricular remodeling

In cardiology, ventricular remodeling (or cardiac remodeling) refers to changes in the size, shape, structure, and function of the heart. This can happen as a result of exercise (physiological remodeling) or after injury to the heart muscle (pathological remodeling). The injury is typically due to acute myocardial infarction (usually transmural or ST segment elevation infarction), but may be from a number of causes that result in increased pressure or volume, causing pressure overload or volume overload (forms of strain) on the heart. Chronic hypertension, congenital heart disease with intracardiac shunting, and valvular heart disease may also lead to remodeling. After the insult occurs, a series of histopathological and structural changes occur in the left ventricular myocardium that lead to progressive decline in left ventricular performance. Ultimately, ventricular remodeling may result in diminished contractile (systolic) function and reduced stroke volume.

Physiological remodeling is reversible while pathological remodeling is mostly irreversible. Remodeling of the ventricles under left/right pressure demand make mismatches inevitable. Pathologic pressure mismatches between the pulmonary and systemic circulation guide compensatory remodeling of the left and right ventricles. The term "reverse remodeling" in cardiology implies an improvement in ventricular mechanics and function following a remote injury or pathological process.

Ventricular remodeling may include ventricular hypertrophy, ventricular dilation, cardiomegaly, and other changes. It is an aspect of cardiomyopathy, of which there are many types. Concentric hypertrophy is due to pressure overload, while eccentric hypertrophy is due to volume overload.

Pathophysiology
The cardiac myocyte is the major cell involved in remodeling. Fibroblasts, collagen, the interstitium, and the coronary vessels to a lesser extent, also play a role. A common scenario for remodeling is after myocardial infarction. There is myocardial necrosis (cell death) and disproportionate thinning of the heart. This thin, weakened area is unable to withstand the pressure and volume load on the heart in the same manner as the other healthy tissue. As a result, there is dilatation of the chamber arising from the infarct region. The initial remodeling phase after a myocardial infarction results in repair of the necrotic area and myocardial scarring that may, to some extent, be considered beneficial since there is an improvement in or maintenance of LV function and cardiac output. Over time, however, as the heart undergoes ongoing remodeling, it becomes less elliptical and more spherical. Ventricular mass and volume increase, which together adversely affect cardiac function. Eventually, diastolic function, or the heart's ability to relax between contractions may become impaired, further causing decline.

After a myocardial infarction (MI), cardiac myocyte death can be triggered by necrosis, apoptosis, or autophagy, leading to thinning of the cardiac wall. The surviving cardiac myocytes either arrange in parallel or in series to each other, contributing to ventricular dilatation or ventricular hypertrophy, depending on the loading stress on the ventricular wall. Besides, reduced expression of V1 myosin and L-type calcium channels on cardiac myocytes are also thought to cause cardiac remodeling. Under normal body conditions, fatty acid accounts for 60 to 90% of the energy supply of the heart. Post MI, as fatty acid oxidation decreases, it leads to reduced energy supply for the cardiac myocytes, accumulation of fatty acids to toxic levels, and dysfunction of mitochondria. These consequences also led to the increase in oxidative stress on the heart, causing the proliferation of fibroblasts, activation of metalloproteinases, and induction of apoptosis, which would be explained below. Besides, inflammatory immune response after MI also contributes to the above changes.

Besides, the cardiac interstitium which consisted of largely Type I and Type III collagen fibres are also involved in cardiac remodeling. Cardiac collagen is synthesized by fibroblasts and degraded by metalloproteinases. Fibroblasts are activated post MI, leading to increased collagen synthesis and fibrosis of the heart. Increase expression of MMP1 and MMP9 led to degradation of collagen fibres, and subsequently dilatation of the heart. Several signal pathways such as Angiotensin II, Transforming growth factor beta (TGF-beta), and Endothelin 1 are known to trigger synthesis and degradation of collagen fibres in the heart.

Other factors such as high blood pressure, activation of sympathetic system which releases norepinephrine, activation of renin–angiotensin system which releases renin and anti-diuretic hormones are important contributors of cardiac remodelling. However, atrial natriuretic peptide is thought to be cardio-protective.

Evaluation
Remodeling of the heart is evaluated by performing an echocardiogram. The size and function of the atria and ventricles can be characterized using this test.

Treatment
Many factors influence the time course and extent of remodeling, including the severity of the injury, secondary events (recurrent ischemia or infarction), neurohormonal activation, genetic factors and gene expression, and treatment. Medications may attenuate remodeling. Angiotensin-converting enzyme (ACE) inhibitors have been consistently shown to decrease remodeling in animal models or transmural infarction and chronic pressure overload. Clinical trials have shown that ACE inhibitor therapy after myocardial infarction leads to improved myocardial performance, improved ejection fraction, and decreased mortality compared to patients treated with placebo. Likewise, inhibition of aldosterone, either directly or indirectly, leads to improvement in remodeling. Carvedilol, a 3rd generation beta blocker, may actually reverse the remodeling process by reducing left ventricular volumes and improving systolic function. Cardiac resynchronization therapy (CRT) has shown the ability to reverse left ventricular remodeling in some patients. Early correction of congenital heart defects, if appropriate, may prevent remodeling, as will treatment of chronic hypertension or valvular heart disease. Often, reverse remodeling, or improvement in left ventricular function, will also be seen.

title: Ventricular remodeling


text:
User:Tristessa de St Ange/godmode-light.js

// - // God-like Monobook skin // (c) 2005 Sam Hocevar  // $Id: godmode-light.js 907 2005-06-28 12:57:06Z sam $ // -

// - // Language support, taken from phase3/languages/* // - var rollbacklink = 'rollback'; var cantrollback = 'Cannot revert edit; last contributor is only author of this page.'; var alreadyrolled = 'Cannot rollback last edit of $1 by $2 (Talk); someone else has edited or rolled back the page already. Last edit was by $3 (Talk). '; var revertpage = 'Reverted edits by $2 to last version by $1'; switch (document.getElementsByTagName('html')[0].lang) { case 'fr': rollbacklink = 'rÃ©voquer'; cantrollback = 'Impossible de rÃ©voquer: dernier auteur est le seul Ã avoir modifiÃ© cet article'; alreadyrolled = 'Impossible de rÃ©voquer la derniÃ¨re modification de $1 par $2 (Talk); quelqu\'un d\'autre Ã  dÃ©jÃ  modifer ou rÃ©voquer l\'article. La derniÃ¨re modificaion Ã©tait de $3 (Talk). '; // lol @ pathetic grammar revertpage = "RÃ©vocation des modifications de $2 et restauration d'une prÃ©cÃ©dente version de $1"; break; case 'de': rollbacklink = 'ZurÃ¼cksetzen'; cantrollback = 'Die Ã„nderung kann nicht zurÃ¼ckgenommen werden; der letzte Autor ist der einzige.'; alreadyrolled = 'Die ZurÃ¼cknahme des Artikels $1 von $2 (Diskussion) ist nicht mÃ¶glich, da eine andere Ã„nderung oder RÃ¼cknahme erfolgt ist. Die letzte Ã„nderung ist von $3 (Diskussion)'; revertpage = 'Ã„nderungen von Benutzer:$2 rÃ¼ckgÃ¤ngig gemacht und letzte Version von Benutzer:$1 wiederhergestellt'; break; case 'es': rollbacklink = 'Revertir'; cantrollback = 'No se pueden revertir las ediciones; el Ãºltimo colaborador es el Ãºnico autor de este artÃculo.'; alreadyrolled = 'No se puede revertir la Ãºltima ediciÃ³n de $1 por $2 (DiscusiÃ³n); alguien mÃ¡s ya ha editado o revertido esa pÃ¡gina. La Ãºltima ediciÃ³n fue hecha por $3 (DiscusiÃ³n). ';   revertpage = 'Revertida a la Ãºltima ediciÃ³n de $1'; break; case 'it': rollbacklink = 'rollback'; cantrollback = 'Impossibile tornare ad una versione precedente: l\'ultima modifica Ã¨ stata apportata dall\'unico utente che abbia lavorato a questo articolo.'; //alreadyrolled = ''; revertpage = 'Riportata alla revisione precedente da $1'; break; case 'pt': rollbacklink = 'voltar'; cantrollback = 'NÃ£o foi possÃvel reverter a ediÃ§Ã£o; o Ãºltimo contribuidor Ã© o Ãºnico autor deste artigo.'; alreadyrolled = 'NÃ£o foi possÃvel reverter as ediÃ§Ãµes de $1 por $2 (Talk); alguÃ©m o editou ou jÃ¡ o reverteu. A Ãºltima ediÃ§Ã£o foi de $3 (Conversar com ele). ';   revertpage = 'Revertidas ediÃ§Ãµes por $2, para a Ãºltima versÃ£o por $1'; break; }

// - // XMLHttpRequest support // - if (document.implementation.createDocument) { var xmlparser = new DOMParser; }

function XMLParse(string) { if (document.implementation.createDocument) { return xmlparser.parseFromString(string, "text/xml"); } else if (window.ActiveXObject) { var xmldoc = new ActiveXObject("Microsoft.XMLDOM"); xmldoc.async = "false"; ret = xmldoc.loadXML(string); if (!ret) return null; return xmldoc.documentElement; } return null; }

var xmlhttp;

function HTTPClient { var http; if(window.XMLHttpRequest) { http = new XMLHttpRequest; } else if (window.ActiveXObject) { try { http = new ActiveXObject("Msxml2.XMLHTTP"); } catch (e) { try { http = new ActiveXObject("Microsoft.XMLHTTP"); } catch (E) { http = false; }   }  }  return http; }

// - // MD5 hash calculator // - // Version 2.1 Copyright (C) Paul Johnston 1999 - 2002. // Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet // Distributed under the BSD License // See http://pajhome.org.uk/crypt/md5 for more info. // - var hexcase = 0; var b64pad = ""; var chrsz  = 8;

function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}

function core_md5(x, len) { x[len >> 5] |= 0x80 << ((len) % 32); x[(((len + 64) >>> 9) << 4) + 14] = len;

var a = 1732584193; var b = -271733879; var c = -1732584194; var d = 271733878;

for(var i = 0; i < x.length; i += 16) {   var olda = a;    var oldb = b;    var oldc = c;    var oldd = d;

a = md5_ff(a, b, c, d, x[i+ 0], 7, -680876936); d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586); c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819); b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330); a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897); d = md5_ff(d, a, b, c, x[i+ 5], 12,  1200080426); c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341); b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983); a = md5_ff(a, b, c, d, x[i+ 8], 7 ,  1770035416); d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417); c = md5_ff(c, d, a, b, x[i+10], 17, -42063); b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162); a = md5_ff(a, b, c, d, x[i+12], 7 ,  1804603682); d = md5_ff(d, a, b, c, x[i+13], 12, -40341101); c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290); b = md5_ff(b, c, d, a, x[i+15], 22,  1236535329);

a = md5_gg(a, b, c, d, x[i+ 1], 5, -165796510); d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632); c = md5_gg(c, d, a, b, x[i+11], 14, 643717713); b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302); a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691); d = md5_gg(d, a, b, c, x[i+10], 9 ,  38016083); c = md5_gg(c, d, a, b, x[i+15], 14, -660478335); b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848); a = md5_gg(a, b, c, d, x[i+ 9], 5 ,  568446438); d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690); c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961); b = md5_gg(b, c, d, a, x[i+ 8], 20,  1163531501); a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467); d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784); c = md5_gg(c, d, a, b, x[i+ 7], 14,  1735328473); b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);

a = md5_hh(a, b, c, d, x[i+ 5], 4, -378558); d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463); c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562); b = md5_hh(b, c, d, a, x[i+14], 23, -35309556); a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060); d = md5_hh(d, a, b, c, x[i+ 4], 11,  1272893353); c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632); b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640); a = md5_hh(a, b, c, d, x[i+13], 4 ,  681279174); d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222); c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979); b = md5_hh(b, c, d, a, x[i+ 6], 23,  76029189); a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487); d = md5_hh(d, a, b, c, x[i+12], 11, -421815835); c = md5_hh(c, d, a, b, x[i+15], 16,  530742520); b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);

a = md5_ii(a, b, c, d, x[i+ 0], 6, -198630844); d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415); c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905); b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055); a = md5_ii(a, b, c, d, x[i+12], 6 ,  1700485571); d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606); c = md5_ii(c, d, a, b, x[i+10], 15, -1051523); b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799); a = md5_ii(a, b, c, d, x[i+ 8], 6 ,  1873313359); d = md5_ii(d, a, b, c, x[i+15], 10, -30611744); c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380); b = md5_ii(b, c, d, a, x[i+13], 21,  1309151649); a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070); d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379); c = md5_ii(c, d, a, b, x[i+ 2], 15,  718787259); b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);

a = safe_add(a, olda); b = safe_add(b, oldb); c = safe_add(c, oldc); d = safe_add(d, oldd); } return Array(a, b, c, d);

}

function md5_cmn(q, a, b, x, s, t) { return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b); } function md5_ff(a, b, c, d, x, s, t) { return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t); } function md5_gg(a, b, c, d, x, s, t) { return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t); } function md5_hh(a, b, c, d, x, s, t) { return md5_cmn(b ^ c ^ d, a, b, x, s, t); } function md5_ii(a, b, c, d, x, s, t) { return md5_cmn(c ^ (b | (~d)), a, b, x, s, t); }

function safe_add(x, y) { var lsw = (x & 0xFFFF) + (y & 0xFFFF); var msw = (x >> 16) + (y >> 16) + (lsw >> 16); return (msw << 16) | (lsw & 0xFFFF); }

function bit_rol(num, cnt) { return (num << cnt) | (num >>> (32 - cnt)); }

function str2binl(str) { var bin = Array; var mask = (1 << chrsz) - 1; for(var i = 0; i < str.length * chrsz; i += chrsz) bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32); return bin; }

function binl2hex(binarray) { var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; var str = ""; for(var i = 0; i < binarray.length * 4; i++) {   str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) + hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF); } return str; }

// - // Our nice Revert functions // - var gml_vandal, gml_editor, gml_url;

function PerformRevert { var l, token = '', revert = false; // Look for '&fakeaction=rollback' in URL gml_url = location.pathname; l = location.search.substring(1).split('&'); for (i = 0; i < l.length; i++) { var n = l[i].indexOf('='); var name = l[i].substring(0, n); if (name == 'fakeaction') { if (l[i].substring(n + 1) == 'rollback') revert = true; } else if (name == 'vandal') { gml_vandal = unescape(l[i].substring(n + 1)); } else if (name == 'token') { token = unescape(l[i].substring(n + 1)); } else if (name == 'title') { gml_url += '?' + l[i]; } }  if (!revert) return; document.getElementById('bodyContent').innerHTML = 'Please wait, reverting edits by ' + gml_vandal + '...'; // Avoid XSS kiddies by using a special token if (token == '' || token != hex_md5(gml_url + gml_vandal + document.cookie)) { document.getElementById('bodyContent').innerHTML += ' Bad authentication token!'; return; }

xmlhttp = HTTPClient; if (!xmlhttp) return; document.getElementById('bodyContent').innerHTML += ' Getting article history...'; xmlhttp.open("GET", gml_url + '&action=history&limit=50', true); xmlhttp.onreadystatechange = RevertStepTwo; xmlhttp.send(null); }

function RevertStepTwo { if (xmlhttp.readyState != 4) return var l; var oldid; // Get the vandal and new editor names gml_editor = ''; doc = XMLParse(xmlhttp.responseText); l = doc.getElementById('pagehistory').getElementsByTagName('li'); //l = doc.selectSingleNode('//*[@id="pagehistory"]').getElementsByTagName('li'); for (i = 0; i < l.length; i++) { var name = l[i].getElementsByTagName('span')[0].getElementsByTagName('a')[0].innerHTML; if (i == 0 && name != gml_vandal) { document.getElementById('bodyContent').innerHTML += ' Error: ' + gml_vandal + ' is not the last editor!'; return; } else if (i > 0 && name != gml_vandal) { oldid = l[i].getElementsByTagName('input')[0].value; gml_editor = name; break; } }  if (gml_editor == '') { document.getElementById('bodyContent').innerHTML += ' Error: ' + gml_vandal + ' is the only editor!'; return; }

xmlhttp = HTTPClient; if (!xmlhttp) return; document.getElementById('bodyContent').innerHTML += ' Getting article edit form...'; xmlhttp.open("GET", gml_url + '&action=edit&oldid=' + oldid, true); xmlhttp.onreadystatechange = RevertStepThree; xmlhttp.send(null); }

function RevertStepThree { if (xmlhttp.readyState != 4) return var l; // Insert the downloaded form in our current page, using // only hidden form inputs. var oldform = XMLParse(xmlhttp.responseText).getElementById('editform'); var newform = document.createElement('form'); l = oldform.getElementsByTagName('textarea'); for (i = l.length; i--; ) { var t = document.createElement('input'); t.type = 'hidden'; t.name = l[i].name; t.value = l[i].innerHTML; newform.appendChild(t); } l = oldform.getElementsByTagName('input'); for (i = l.length; i--; ) { if (l[i].name == 'wpSummary') { l[i].value = revertpage.replace(/\$1/g, gml_editor).replace(/\$2/g, gml_vandal); } else if (l[i].name == 'wpMinoredit') { l[i].value = '1'; } else if (l[i].name == 'wpWatchthis') { if (!l[i].checked) continue; // Donâ€™t touch the "watch" status l[i].value = "on"; } else if (l[i].name == 'wpPreview') { continue; } else if (l[i].name == 'wpDiff') { continue; }   l[i].type = 'hidden'; newform.appendChild(l[i]); } newform.name = oldform.name; newform.method = oldform.method; newform.id = oldform.id; newform.action = oldform.action; document.getElementById('bodyContent').innerHTML += ' Submitting form...'; document.getElementById('bodyContent').appendChild(newform); // Submit the form newform.submit; }

// - // Add revert buttons to the page // - function AddRevertButtons { var l, article = '', vandal; // Add 'revert' links to a diff page l = document.getElementById('bodyContent').getElementsByTagName('td'); for (i = 0; i < l.length; i++) { if (l[i].className == 'diff-otitle') { article = l[i].getElementsByTagName('a')[0].href.split('&')[0].replace(/[^\/]*\/\/[^\/]*/, ''); } else if (l[i].className == 'diff-ntitle') { var toplink = l[i].getElementsByTagName('a')[0].href; vandal = l[i].getElementsByTagName('a')[1].title.split(':')[1]; var t = l[i].innerHTML n = t.indexOf(') ) = 0 && article != '' && toplink.indexOf('oldid=') == -1) { l[i].innerHTML = t.substring(0, n + 5) + '   [' + rollbacklink + '] ' + t.substring(n + 5, t.length); }   }  }  // Add 'revert' links to a contributions page if (location.href.indexOf(':Contributions') != -1) { var c = document.getElementById('contentSub'); var a = c.getElementsByTagName('a'); if (a.length == 2) { vandal = a[0].innerHTML; } else { vandal = c.innerHTML.replace(/ \(.*/, ).replace(/.* /, );   }    l = document.getElementById('bodyContent').getElementsByTagName('li');    for (i = 0; i < l.length; i++) {      var t = l[i].innerHTML      // If we are already a sysop on this wiki, abort      if (t.indexOf('>' + rollbacklink + ']') != -1)          break;      //if (t.indexOf('&diff=0') != -1) {      if (t.indexOf(' (') != -1) { article = l[i].getElementsByTagName('a')[0].href.split('&')[0].replace(/[^\/]*\/\/[^\/]*/, ''); l[i].innerHTML += ' [' + rollbacklink + ']'; }   }  } }

// - // Modify the page once it is loaded // - if (window.addEventListener) { window.addEventListener("load", PerformRevert, false); window.addEventListener("load", AddRevertButtons, false); } else if (window.attachEvent) { window.attachEvent("onload", PerformRevert); window.attachEvent("onload", AddRevertButtons); }


text:
Michigan meridian

The Michigan meridian is the principal meridian (or north–south line) used as a reference in the Michigan Survey, the survey of the U.S. state of Michigan in the early 19th century. It is located at 84 degrees, 21 minutes and 53 seconds west longitude at its northern terminus at Sault Ste. Marie, and varies very little from that line down the length of the state.

History
The meridian was surveyed by Benjamin Hough in April 1815. The meridian was selected because it formed one of the principal boundary lines defined in the Treaty of Detroit in 1807, which was the first large cession of land by Native American peoples to the United States in the Michigan Territory. In that treaty, the boundary line was described as running due north from the mouth of the Auglaize River on the Maumee River, which was the site of Fort Defiance (now Defiance, Ohio).

Michigan's baseline, which today forms the northern border of Wayne, Washtenaw and other counties, was surveyed at the same time by Alexander Holmes, and intended to be exactly 78 mi north of Fort Defiance. Although regulations governing the U.S. Public Land Survey System would later specify that the baseline should be a true parallel of latitude, this was not the case in earlier surveys, including the Michigan survey. Some roadways were laid out for both survey lines, but there was no intersecting of roadways coinciding with the intersecting of survey lines. Several segments of the Michigan Meridian correspond with a road bearing its namesake Meridian Road. A section of Meridian Road exists in Meridian Township and runs through most of Ingham and Clinton counties, but is not fully continuous due to marshy areas (formerly the Chandler Marsh, since developed and managed) and the Looking Glass River.

Geography
The Michigan meridian forms the boundary between several counties in Michigan: Lenawee and Hillsdale; Shiawassee and Clinton; Saginaw and Gratiot; Ogemaw and Roscommon; Oscoda and Crawford; Montmorency and Otsego; and a portion of the boundary between Chippewa and Mackinac. U.S. Highway 127 approximately follows the meridian from the Ohio border into Jackson. In Okemos, there is a historical village of Meridian located on the line. Both it and Okemos are within Meridian Township, State highways M-30 in Midland and Gladwin counties, and M-129 in Chippewa and Mackinac counties are known as Meridian Road as well.

In the area of Ohio known as the Toledo Strip, the townships are numbered from the Michigan meridian and Michigan baseline because at the time they were surveyed, the area was considered to be a part of the Michigan Territory.

A 10 mi strip of land was given to Indiana when it became a state in 1816. Since this land had not been surveyed, the Indiana portion was surveyed with the rest of Indiana. However, in Michigan, the southernmost tier of townships are truncated. The townships were surveyed and sections numbered as if they were in whole townships, except that the southernmost survey townships were only 6 x instead of the usual 6 x square (36 sqmi). Sections 19–24 in each township were chopped approximately in half, while sections 25–36 simply do not exist for these survey townships. To compensate for the smaller size, some of the civil townships formed from these survey townships were given additional sections of land from adjacent townships, as for example, White Pigeon Township in St. Joseph County and Three Oaks Township and New Buffalo Township in Berrien County. Some others of these smaller townships were merged into adjoining townships, as in Porter Township in Cass County. Similarly, many of the civil townships in Michigan along the Ohio border have somewhat more or less than the standard 36 square miles.

title: Michigan meridian


text:
Heinz Roemheld

Heinz Roemheld (May 1, 1901 – February 11, 1985) was an American composer.

Early life and career
Born Heinz Eric Roemheld in Milwaukee, Wisconsin, he was one of four children of German immigrant Heinrich Roemheld and his wife Fanny Rauterberg Roemheld. Heinrich was a pharmacist, but all the members of the family were musical. His brother Edgar Roemheld (1898-1964) became a conductor. His sister Irmgard Roemheld (1904-1995) became a well-known Milwaukee music teacher and radio broadcaster.

Roemheld was a child prodigy who began playing the piano at four. He graduated from the Milwaukee College of Music at 19 and performed in theaters to earn money to study piano in Europe. In 1920, he went to Berlin, where he studied with Hugo Kaun, Ferruccio Busoni, and Egon Petri. While there, he appeared in concert with the Berlin Philharmonic.

When he returned to America, Roemheld became involved in music for silent movies, both as a pianist and conductor. In 1925, he was sent back to Berlin as head of Universal Pictures theaters there but had to leave in 1929 due to the rise of Nazism.

Back in America, Roemheld moved to Los Angeles and became a prominent cinema composer. He scored some scenes in Gone with the Wind, including the burning of Atlanta, although he was not credited on-screen. In 1942, he won the Academy Award for Best Original Music Score for Yankee Doodle Dandy. Among the more than 400 other films for which he composed music were Gentleman Jim, The Lady From Shanghai, The Invisible Man, and Shine On, Harvest Moon.

After World War II, Roemheld returned to Germany to become Chief of the Film, Theatre, and Music Section of the Information Central Division of The American Armies in Europe. He continued writing for several major film studios until the late 1950s and, after briefly working in television, he retired in 1964 to concentrate on classical composition. He is best known for the song "Ruby" from the movie Ruby Gentry (1952), which has become a standard.

Personal life
He married a former Miss Milwaukee, Emeline Defnet (1901-1980), from whom he was later divorced. They had two daughters, Mary Lou Roemheld, who was married for years to game show host Jack Narz, and Ann Roemheld, who married game show host Bill Cullen.

Death
Roemheld died on February 11, 1985, at a convalescent home in Huntington Beach after contracting pneumonia three weeks earlier.

Partial filmography

 * ''The White Hell of Pitz Palu (1929)
 * All Quiet on the Western Front (1930)
 * The Czar of Broadway (1930)
 * See America Thirst (1930)
 * The Hunchback of Notre Dame (1931 reissue)
 * Murders in the Rue Morgue (1932) (stock music, uncredited)
 * Golden Harvest (1933)
 * The Invisible Man (1933) (uncredited)
 * Fashion Follies of 1934 (1934)
 * One Exciting Adventure (1934)
 * Housewife (1934)
 * Bombay Mail (1934)
 * The Man Who Reclaimed His Head (1934)
 * Imitation of Life (1934)
 * The Black Cat (1934)
 * Midnight Alibi (1934)
 * Merry Wives of Reno (1934) (uncredited)
 * Ruggles of Red Gap (1935)
 * Storm Over the Andes (1935)
 * Mary Burns, Fugitive (1935)
 * Werewolf of London (1935) (uncredited)
 * The Girl from 10th Avenue (1935)
 * Front Page Woman (1935)
 * Dracula's Daughter (1936)
 * Her Master's Voice (1936)
 * Flash Gordon (serial, 1936)
 * Three Smart Kids (1936)
 * The Girl on the Front Page (1936)
 * Stage Struck (1936)
 * Times Square Playboy (1936)
 * China Clipper (1936)
 * It's Love I'm After (1937)
 * Stand-In (1937)
 * The Perfect Specimen (1937)
 * I Met My Love Again (1938)
 * Four's a Crowd (1938)
 * Comet Over Broadway (1938)
 * Nancy Drew, Reporter (1939)
 * Gone with the Wind (1939) (uncredited)
 * You Can't Get Away with Murder (1939)
 * Invisible Stripes (1939)
 * A Child is Born (1940)
 * Brother Orchid (1940)
 * No Time for Comedy (1940)
 * The Man Who Talked Too Much (1940)
 * Brother Rat and a Baby (1940)
 * British Intelligence (1940)
 * My Love Came Back (1940)
 * Lady with Red Hair (1940)
 * Four Mothers (1941)
 * Strawberry Blonde (1941)
 * Flight from Destiny (1941)
 * Blues in the Night (1941)
 * The Wagons Roll at Night (1941)
 * Affectionately Yours (1941)
 * Honeymoon for Three (1941)
 * Always in My Heart (1942)
 * The Male Animal (1942)
 * Wild Bill Hickok Rides (1942) (uncredited)
 * Yankee Doodle Dandy (1942)
 * Gentleman Jim (1942)
 * The Hard Way (1943)
 * The Desert Song (1943)
 * Make Your Own Bed (1944)
 * Janie (1944)
 * Shine On, Harvest Moon (1944)
 * Too Young to Know (1945)
 * O.S.S. (1946)
 * Mr. Ace (1946)
 * The Fabulous Joe (1947)
 * Heaven Only Knows (1947)
 * It Had to Be You (1947)
 * Down to Earth (1947)
 * Christmas Eve (1947)
 * Curley (1947)
 * The Flame (1947)
 * The Lady from Shanghai (1947)
 * On Our Merry Way (1948)
 * Here Comes Trouble (1948)
 * I, Jane Doe (1948)
 * Station West (1948)
 * Who Killed Doc Robbin (1948)
 * The Girl from Manhattan (1948)
 * The Fuller Brush Man (1948)
 * My Dear Secretary (1948)
 * Mr. Soft Touch (1949)
 * Lucky Stiff (1949)
 * Miss Grant Takes Richmond (1949)
 * The Good Humor Man (1950)
 * Kill the Umpire (1950)
 * Rogues of Sherwood Forest (1950)
 * The Fuller Brush Girl (1950)
 * Valentino (1951)
 * Chicago Calling (1952)
 * The Big Trees (1952)
 * Jack and the Beanstalk (1952)
 * Loan Shark (1952)
 * Three for Bedroom C (1952)
 * Ruby Gentry (1952)
 * The Moonlighter (1953)
 * The Square Jungle (1955)
 * Hell's Horizon (1955)
 * There's Always Tomorrow (1956)
 * The Tall T (1957)
 * The Monster That Challenged the World (1957)
 * Decision at Sundown (1957)
 * Ride Lonesome (1959)
 * Lad, A Dog (1962)

title: Heinz Roemheld


text: File:TenYearsHarmonyCover.jpg

title: File:TenYearsHarmonyCover.jpg


text: Portal:Society/box-header

title: Portal:Society/box-header


text:
Örebro SK (disambiguation)

Örebro SK is the football section of the Swedish sport club of the same name.

Örebro SK may also refer to:

 * Örebro SK Bandy, bandy section
 * Örebro SK Handboll, handball section
 * Örebro SK Ungdom, youth section

title: Örebro SK (disambiguation)


text:
No-three-in-line problem

The no-three-in-line problem in discrete geometry asks how many points can be placed in the $$n\times n$$ grid so that no three points lie on the same line. The problem concerns lines of all slopes, not only those aligned with the grid. It was introduced by Henry Dudeney in 1900. Brass, Moser, and Pach call it "one of the oldest and most extensively studied geometric questions concerning lattice points".

At most $$2n$$ points can be placed, because $$2n+1$$ points in a grid would include a row of three or more points, by the pigeonhole principle. Although the problem can be solved with $$2n$$ points for every $$n$$ up to $46$, it is conjectured that fewer than $$2n$$ points can be placed in grids of large size. Known methods can place linearly many points in grids of arbitrary size, but the best of these methods place slightly fewer than $$3n/2$$ points, not $2n$.

Several related problems of finding points with no three in line, among other sets of points than grids, have also been studied. Although originating in recreational mathematics, the no-three-in-line problem has applications in graph drawing and to the Heilbronn triangle problem.

Small instances
The problem was first posed by Henry Dudeney in 1900, as a puzzle in recreational mathematics, phrased in terms of placing the 16 pawns of a chessboard onto the board so that no three are in a line. This is exactly the no-three-in-line problem, for the case $n=8$. In a later version of the puzzle, Dudeney modified the problem, making its solution unique, by asking for a solution in which two of the pawns are on squares d4 and e5, attacking each other in the center of the board.

Many authors have published solutions to this problem for small values of $n$, and by 1998 it was known that $$2n$$ points could be placed on an $$n\times n$$ grid with no three in a line for all $$n$$ up to 46, and some larger values. The numbers of solutions with $$2n$$ points for small values of $$n$$, starting from $n=2$, are

The numbers of equivalence classes of solutions with $$2n$$ points under reflections and rotations are

Upper and lower bounds
The exact number of points that can be placed, as a function of $n$, is not known. However, both proven and conjectured bounds limit this number to within a range proportional to $n$.

General placement methods
A solution of Paul Erdős, published by, is based on the observation that when $$n$$ is a prime number, the set of $$n$$ grid points $(i,i^2$ mod $n)$, for $0\le i < n$, contains no three collinear points. When $$n$$ is not prime, one can perform this construction for a $$p\times p$$ grid contained in the $$n\times n$$ grid, where $$p$$ is the largest prime that is at most $n$. Because the gap between consecutive primes is much smaller than the primes themselves, $$p$$ will always be close to $n$, so this method can be used to place $$n-o(n)$$ points in the $$n\times n$$ grid with no three points collinear.

Erdős' bound has been improved subsequently: show that, when $$n/2$$ is prime, one can obtain a solution with $$3(n-2)/2$$ points, by placing points in multiple copies of the hyperbola $$xy=k$$ (mod $n/2$), where $$k$$ may be chosen arbitrarily as long as it is nonzero mod $n/2$. Again, for arbitrary $$n$$ one can perform this construction for a prime near $$n/2$$ to obtain a solution with $\tfrac32n-o(n)$ points.

Upper bound
At most $$2n$$ points may be placed in a grid of any size $n$. For, if more points are placed, then by the pigeonhole principle some three of them would all lie on the same horizontal line of the grid. For $$n\leq 46$$, this trivial bound is known to be tight.

Conjectured bounds
Although exactly $$2n$$ points can be placed on small grids, conjectured that for large grids, there is a significantly smaller upper bound on the number of points that can be placed. More precisely, they conjectured that the number of points that can be placed is at most a sublinear amount larger than $cn$, with $$c = \sqrt[3]{\frac{2\pi^2}{3}} \approx 1.874.$$ After an error in the heuristic reasoning leading to this conjecture was uncovered, Guy corrected the error and made the stronger conjecture that one cannot do more than sublinearly better than $$cn$$ with $$c = \frac{\pi}{\sqrt 3} \approx 1.814.$$

Applications
Solutions to the no-three-in-line problem can be used to avoid certain kinds of degeneracies in graph drawing. The problem they apply to involves placing the vertices of a given graph at integer coordinates in the plane, and drawing the edges of the graph as straight line segments. For certain graphs, such as the utility graph, crossings between pairs of edges are unavoidable, but one should still avoid placements that cause a vertex to lie on an edge through two other vertices. When the vertices are placed with no three in line, this kind of problematic placement cannot occur, because the entire line through any two vertices, and not just the line segment, is free of other vertices. The fact that the no-three-in-line problem has a solution with linearly many points can be translated into graph drawing terms as meaning that every graph, even a complete graph, can be drawn without unwanted vertex-edge incidences using a grid whose area is quadratic in the number of vertices, and that for complete graphs no such drawing with less than quadratic area is possible. The complete graphs also require a linear number of colors in any graph coloring, but other graphs that can be colored with fewer colors can also be drawn on smaller grids: if a graph has $$n$$ vertices and a graph coloring with $$k$$ colors, it can be drawn in a grid with area proportional to $nk$. The no-three-in-line drawing of a complete graph is a special case of this result with $k=n$.

The no-three-in-line problem also has applications to another problem in discrete geometry, the Heilbronn triangle problem. In this problem, one must place $$n$$ points, anywhere in a unit square, not restricted to a grid. The goal of the placement is to avoid small-area triangles, and more specifically to maximize the area of the smallest triangle formed by three of the points. For instance, a placement with three points in line would be very bad by this criterion, because these three points would form a degenerate triangle with area zero. On the other hand, if the points can be placed on a grid of side length $$\varepsilon$$ within the unit square, with no three in a line, then by Pick's theorem every triangle would have area at least $\varepsilon^2/2$, half of a grid square. Therefore, solving an instance of the no-three-in-line problem and then scaling down the integer grid to fit within a unit square produces solutions to the Heilbronn triangle problem where the smallest triangle has area $\Omega(1/n^2)$. This application was the motivation for Paul Erdős to find his solution for the no-three-in-line problem. It remained the best area lower bound known for the Heilbronn triangle problem from 1951 until 1982, when it was improved by a logarithmic factor using a construction that was not based on the no-three-in-line problem.

General-position subsets
In computational geometry, finite sets of points with no three in line are said to be in general position. In this terminology, the no-three-in-line problem seeks the largest subset of a grid that is in general position, but researchers have also considered the problem of finding the largest general position subset of other non-grid sets of points. It is NP-hard to find this subset, for certain input sets, and hard to approximate its size to within a constant factor; this hardness of approximation result is summarized by saying that the problem is APX-hard. If the largest subset has size $k$, a solution with the non-constant approximation ratio $$O(\sqrt k)$$ can be obtained by a greedy algorithm that simply chooses points one at a time until all remaining points lie on lines through pairs of chosen points.

One can get a finer-grained understanding of the running time of algorithms for finding the exact optimal solution by using parameterized complexity, in which algorithms are analyzed not only in terms of the input size, but in terms of other parameters of the input. In this case, for inputs whose largest general position subset has size $k$, it can be found in an amount of time that is an exponential function of $$k$$ multiplied by a polynomial in the input size $n$, with the exponent of the polynomial not depending on $k$. Problems with this kind of time bound are called fixed-parameter tractable.

For point sets $$S$$ having at most $\ell$ points per line, with $\ell=O(\sqrt{ there exist general-position subsets of size nearly proportional to $\ell=O(\sqrt{ The example of the grid shows that this bound cannot be significantly improved. The proof of existence of these large general-position subsets can be converted into a polynomial-time algorithm for finding a general-position subset of $S$, of size matching the existence bound, using an algorithmic technique known as entropy compression.

Greedy placement
Repeating a suggestion of, Martin Gardner asked for the smallest subset of an $$n\times n$$ grid that cannot be extended: it has no three points in a line, but every proper superset has three in a line. Equivalently, this is the smallest set that could be produced by a greedy algorithm that tries to solve the no-three-in-line problem by placing points one at a time until it gets stuck. If only axis-parallel and diagonal lines are considered, then every such set has at least $$n-1$$ points. However, less is known about the version of the problem where all lines are considered: every greedy placement includes at least $$\Omega(n^{2/3})$$ points before getting stuck, but nothing better than the trivial $$2n$$ upper bound is known.

Higher dimensions
Non-collinear sets of points in the three-dimensional grid were considered by. They proved that the maximum number of points in the $$n\times n\times n$$ grid with no three points collinear is $\Theta(n^2)$. Similarly to Erdős's 2D construction, this can be accomplished by using points $(x,y,x^2+y^2$ mod $p)$, where $$p$$ is a prime congruent to 3 mod 4. Just as the original no-three-in-line problem can be used for two-dimensional graph drawing, one can use this three-dimensional solution to draw graphs in the three-dimensional grid. Here the non-collinearity condition means that a vertex should not lie on a non-adjacent edge, but it is normal to work with the stronger requirement that no two edges cross.

In much higher dimensions, sets of grid points with no three in line, obtained by choosing points near a hypersphere, have been used for finding large Salem–Spencer sets, sets of integers with no three forming an arithmetic progression. However, it does not work well to use this same idea of choosing points near a circle in two dimensions: this method finds points forming convex polygons, which satisfy the requirement of having no three in line, but are too small. The largest convex polygons with vertices in an $$n\times n$$ grid have only $$O(n^{2/3})$$ vertices. The cap set problem concerns a similar problem to the no-three-in-line problem in spaces that are both high-dimensional, and based as vector spaces over finite fields rather than over the integers.

Another generalization to higher dimensions is to find as many points as possible in a three dimensional $$N \times N \times N$$ grid such that no four of them are in the same plane. This sequence begins 5, 8, 10, 13, 16, ... for $N = 2, 3, 4$, etc.

Torus
Another variation on the problem involves converting the grid into a discrete torus by using periodic boundary conditions in which the left side of the torus is connected to the right side, and the top side is connected to the bottom side. This has the effect, on slanted lines through the grid, of connecting them up into longer lines through more points, and therefore making it more difficult to select points with at most two from each line. These extended lines can also be interpreted as normal lines through an infinite grid in the Euclidean plane, taken modulo the dimensions of the torus. For a torus based on an $$m\times n$$ grid, the maximum number of points that can be chosen with no three in line is at most $2\gcd(m,n)$. When both dimensions are equal, and prime, it is not possible to place exactly one point in each row and column without forming a linear number of collinear triples. Higher-dimensional torus versions of the problem have also been studied.

title: No-three-in-line problem


text:
Hohmann (surname)

Hohmann is a surname. Notable people with the surname include:

 * Angela Hohmann (born 1963), German politician
 * Arthur C. Hohmann (1895–1985), served as Los Angeles Police Department Chief of Police
 * Christian Heinrich Hohmann (1811–1861), German composer, music teacher
 * Karl Hohmann (1908–1974), German footballer
 * Martin Hohmann (born 1948), German lawyer and politician
 * Peter Hohmann, Edler of Hohenthal (1663–1732), German merchant
 * Ruth Hohmann (born 1931), German jazz singer
 * Thorsten Hohmann (born 1979), German professional pool player
 * Ulf Hohmann (born 1963), German ethologist
 * Walter Hohmann (1880–1945), German engineer

title: Hohmann (surname)