Split (3)

train · 1M rows

text stringlengths 8 5.77M
[The "sarcoidosis-lymphoma syndrome"--a lymphocyte dysregulation?]. Sarcoidosis and malignant lymphoma can occur in the same patient; sarcoidosis appears first, the malignant lymphoma follows later. The case histories of three patients illustrate what Brinker first coined as the "sarcoidosis-lymphoma syndrome". In two patients a pulmonary sarcoidosis stage I was diagnosed over 30 years respectively 4 years prior to the histological diagnosis of highly malignant Non-Hodgkin lymphoma. The third patient suffered from generalized sarcoidosis with splenomegaly, , granulomatous hepatitis and interstitial lung disease, in addition to which a lymphoproliferative syndrome was diagnosed. Comparing the pathogenesis of malignant lymphoma and sarcoidosis, parallels such as T-cell dysfunction, which probably facilitates malignant transformation of B-cells, become apparent. In both diseases the transforming gene could be the Ebstein-Barr virus.
July 05, 2011 BURNT OFFERINGS (1976) - if THE SHINING was a TV movie Hard to say whether this chiller will work for you, but it sent chills up and down my spine when I first saw it. Particularly when Oliver Reed's past comes back to haunt him... I dusted the DVD off to remind myself of Robert Cobert's soundtrack, which has just debuted on CD (buy it here, from Screen Archives). The composer worked on many other of producer/director Dan Curtis' projects, including The Night Stalker and The Norliss Tapes TV movies. Curtis managed scary miracles on TV budgets, but I think this is his best work. A family rent a house and grounds for the summer. It looks like it'll cost more than they can afford, but the owners offer it to them cheap on a single condition, that they look after an old relative in the attic. Sounds simple enough. What could possibly go wrong? The father (Oliver Reed) is once again troubled by nightmares from his childhood. His young son gets scared by his father's behaviour. Grandma starts wasting away and mother can't stay away from the old lady upstairs. Living there affects each of the occupants in different ways... After Burgess Meredith and Dub Taylor have left the stage with their comic overacting, the story settles down to some serious, unsettling scares. A simple day by the swimming pool becomes a living nightmare. Another nightmare seems to take reality... But is it a haunting, is it the house itself, or something living inside? It's impossible to watch without thinking of The Shining. There's confusion between past and present, a thematic preoccupation with photographs and an almost identical premise. The Shining (1980) is of course in a different league as a film. But as a story, Stephen King hasn't looked very far back for inspiration. Robert Marasco's book was published in 1973. King's book was published in 1977, a year after Burnt Offerings was out in US cinemas. There's even a tantalising shot of Oliver Reed unable to face his typewriter and a sheaf of blank paper. Ahem. It can't hope to compete with Jack Nicholson's performance and Stanley Kubrick's visuals or his budget. It makes Burnt Offerings look more like a TV movie, even though it wasn't. Many other lower budget movies of the 1970s were almost indistiguishable from the TV 'look'. But Oliver Reed didn't do TV (except disastrous chat shows), and you didn't get this amount of blood on the TV... This scary house film also predates The Amityville Horror (1979) and for my money, was and is far scarier. I also recently watched Let's Scare Jessica To Death recently, expecting scares. But while it had an eerie visual quality that Burnt Offerings lacks, I didn't find it nearly as creepy as many reviews had suggested. Oliver Reed is suitably restrained here, great at being scared and effortless at being threatening. Karen Black is director Dan Curtis' lucky charm here, after appearing in three different roles in the memorable Trilogy of Terror, back when TV horror movies could terrify. Black more recently appeared in the less restrained House of 1,000 Corpses. Lee Montgomery, as the son, is that rare talent, an unannoying child actor, also the lynchpin of rat horror epic Ben (1972). Bette Davis (Whatever Happened To Baby Jane?, The Nanny, The Anniversary) is shockingly good in a transformation from sprightly to unsightly - allowing herself to gradually be shown wearing less and less make-up. Extremely brave considering what she finally looks like... The house and grounds used for filming can be visited just south of San Francisco as The Dunsmuir House in Oakland. The same site used as the mortuary in the Phantasm movies. Again, Burnt Offerings got there first. Having enjoyed this in the cinema and on TV, I was disappointed by the region 1 DVD released by MGM in 2003. It's 16:9 anamorphic widescreen, but the framing is too tight and the compression really poor, distractingly laggy in the darker scenes, the transfer darker than the NTSC VHS. The DVD does however offer a commentary track with Dan Curtis, co-writer William F. Nolan (Logan's Run), and Karen Black. After all these years, I've no idea why it's called Burnt Offerings, it might as well be called House... 6 comments: I've been meaning to watch for a while now, Oliver Reed's always a plus on any horror film! He was great in Hammers Curse of the Werewolf. Your review made me want to watch it, and you say it's scarier then Amytiville Horror, which is pretty freaky horror film in my book. I'll be checking it out soon. I just watched this today. I actually thought it was pretty good for 1976. It reminded me of a mix between Stephen King's The Shining and Rose Red. I know the Shining was 1980 and this was 1976, but they were both based on books so I don't know which came fist.
An 18-year-old male student and a juvenile transgender male are in custody. Two injured students remain in the hospital. HIGHLANDS RANCH, Colo. — The 18-year-old student killed at STEM School Highlands Ranch was just set to graduate from the school later this month. Kendrick Castillo was shot and killed inside the school on Tuesday when two classmates opened fired, according to the Douglas County Sheriff's Office. The last day for seniors was supposed to be Friday and a graduation ceremony is scheduled for May 20. Eight others were shot after two shooters walked into the campus’ high school at South Ridgeline Boulevard and Plaza Drive at around 1:50 p.m. Tuesday and opened fire on their classmates in “two separate locations,” Douglas County Sheriff Tony Spurlock said. On Wednesday the sheriff's office said it was seeking information from the public about the shooting and the suspects. They directed people with information to call their major crimes tip line at 303-660-7579. The school does not have metal detectors and it was not assigned a school resource officer, according to the sheriff's office. The suspects were armed with at least two handguns, Spurlock said on Wednesday. Under Colorado law, neither of the suspects is old enough to purchase a handgun. In wake of the shooting, hundreds of parents flooded a nearby recreation center to reunite with their children, who were led out of the school and loaded into buses. Some of them were as young as kindergarten age. "This is a terrible event," Spurlock said. "This is something that no one wants to have happen in their community ... and we will get to the bottom of it to figure out how and what has occurred." Shooting reported at STEM School Highlands Ranch 1/43 2/43 3/43 4/43 5/43 6/43 7/43 8/43 9/43 10/43 11/43 12/43 13/43 14/43 15/43 16/43 17/43 18/43 19/43 20/43 21/43 22/43 23/43 24/43 25/43 26/43 27/43 28/43 29/43 30/43 31/43 32/43 33/43 34/43 35/43 36/43 37/43 38/43 39/43 40/43 41/43 42/43 43/43 1 / 43 The victims Castillo was shot when classmates said he lunged at one of the gunmen, which gave other students time to get underneath their desks or run away to safety. In an interview with NBC on Wednesday, Castillo’s parents, John and Maria Castillo, said they were very proud their only son did what he had to do to protect other students when one of two gunmen walked into a 9th period class and started firing. The Douglas County Sheriff’s Office said the youngest victim in the shooting is 15 years old. All eight of the patients who were hospitalized are students at the school, Spurlock said. Littleton Adventist Hospital confirmed that it received five patients. One of them remained at the hospital as of Friday morning. Three were discharged Tuesday, according to spokesperson Wendy Forbes. One was discharged Friday morning. Children’s Hospital Colorado said it received a victim at its South Campus location who was treated and released, a hospital spokesperson told 9NEWS. Sky Ridge Medical Center said it treated two juvenile patients. Both have since been discharged. The identities of the surviving victims have not yet been released. The shooting and the suspects Spurlock said as soon as gunfire rang out in the suburban Denver school, administrators called the dispatch center. Deputies arrived amid continuing shooting two minutes later and found the two suspects, one of whom was armed with a handgun. Deputies took both suspects into custody separately. Sheriff Spurlock said Wednesday morning that no gunfire was exchanged between deputies and the suspects. No members of law enforcement were injured. "I have to believe that the quick response of the officers that got inside that school helped save lives," he said. One of the suspects, 16-year-old Maya McKinney, is a transgender male who goes by Alec. He appeared in juvenile court alongside his mother on Wednesday afternoon, and will be held without bond until his second appearance at 1:30 p.m. on Friday, when the prosecution will determine whether to try him as an adult. The other is 18-year-old Devon Erickson, according to the Douglas County Sheriff's Office, who does not have a criminal history outside of a Feb. 13, 2018 ticket in Douglas County for careless driving. Erickson is being on suspicion of 30 counts, according to court documents. They include: One count of first-degree murder after deliberation 29 counts of attempted first-degree murder after deliberation. He appeared in court on Wednesday. Investigators were expected to search a black Honda Civic in the school parking lot and a home in the 1900 block of Mountain Maple Avenue on Tuesday evening. According to Douglas County property records, this home is owned by James and Stephanie Erickson. It was cordoned off on Tuesday night with yellow crime scene tape and had a large police presence outside. In a news conference, Spurlock declined to go into detail about the suspects, citing the ongoing criminal investigation. He said he doesn’t have any evidence that the suspects were already on the radar of law enforcement. The school STEM School Highlands Ranch is a K-12 charter academy focused on science, technology, engineering and math education in the Douglas County School District. It was founded in 2011 and has grown to more than 1,850 students, according to the school’s website. Spurlock said the campus does not have a dedicated school resource officer, and instead contracted out its security. Class will be canceled at the campus throughout the end of the week. All other Douglas County schools will be open with heightened security. A Crisis Support Center will be available at St. Andrew United Methodist Church starting at 8 a.m. Wednesday. STEM School Highlands Ranch is located at 8773 S. Ridgeline Blvd. in Highlands Ranch.
Characterization of glucokinase mutations associated with maturity-onset diabetes of the young type 2 (MODY-2): different glucokinase defects lead to a common phenotype. Glucokinase (GK) is expressed in the pancreatic beta-cells and liver, and plays a key role in the regulation of glucose homeostasis. The enzymatic activity and thermal stability of wild-type (WT) GK and several mutant forms associated with maturity-onset diabetes of the young type 2 (MODY-2) were determined by a steady-state kinetic analysis of the purified expressed proteins. The eight MODY-2 mutations studied were Ala53Ser, Val367Met, Gly80Ala, Thr168Pro, Arg36Trp, Thr209Met, Cys213Arg, and Val226Met. These missense mutations were shown to have variable effects on GK kinetic activity. The Gly80Ala and Thr168Pro mutations resulted in a large decrease in Vmax and a complete loss of the cooperative behavior associated with glucose binding. In addition, the Gly80Ala mutation resulted in a sixfold increase in the half-saturating substrate concentration (S0.5) for ATP, and Thr168Pro resulted in eight- and sixfold increases in the S0.5 values for ATP and glucose, respectively. The Thr209Met and Val226Met mutations exhibited three- and fivefold increases, respectively, in the S0.5 for ATP, whereas the Cys213Arg mutation resulted in a fivefold increase in the S0.5 for glucose. These mutations also led to a small yet significant reduction in Vmax. Of all the mutations studied, only the Cys213Arg mutation had reduced enzymatic activity and decreased thermal stability. Two mutants, Ala53Ser and Val367Met, showed kinetic and thermal stability properties similar to those of WT. These mutants had increased sensitivities to the known negative effectors of GK activity, palmitoyl-CoA, and GK regulatory protein. Taken together, these results illustrate that the MODY-2 phenotype may be linked not only to kinetic alterations but also to the regulation of GK activity.
Dwarf - TDI Knife Sheath Regular price$ 39.95 Quantity The Dwarf is our take on the TDI knife sheath. Fully ambidextrous and capable of utilizing our hard belt loops, soft belt loops or even a belt clip as attachments in various positions. A versatile sheath for your TDI 1480.
package com.wuxiaosu.wechathelper.api; /** * Created by su on 2019/8/27. */ public class Api703 extends Api { public static final String SUPPORT_VERSION_NAME = "7.0.3"; Api703() { this.storage_MsgInfoStorage_class = "com.tencent.mm.storage.bj"; this.storage_MsgInfoStorage_insert_method = "c"; this.storage_MsgInfo_class = "com.tencent.mm.storage.bi"; } @Override public String getSupportVersionName() { return SUPPORT_VERSION_NAME; } }
Introduction {#Sec1} ============ Non-alcoholic steatohepatitis (NASH) is a chronic and progressive liver disease characterized by the accumulation of fat in the liver (steatosis), as well inflammation \[[@CR1], [@CR2]\]. NASH is a progression of non-alcoholic fatty liver disease (NAFLD), an umbrella term to describe excess fat in the liver of patients who drink little to no alcohol \[[@CR1]\]. The exact cause of NAFLD to NASH progression is unknown and is likely due to a complex interplay of environmental and genetic factors; however, certain health conditions, such as obesity, high blood pressure and diabetes, increase the risk of it developing \[[@CR3], [@CR4]\]. Numerous genetic, epigenetic and environmental contributors have recently been proposed as the cause of NAFLD and NASH, including smoking and altered copper bioavailability \[[@CR5]--[@CR7]\]. NASH is often inaccurately described as an asymptomatic disease \[[@CR8]\]---it presents with non-specific symptoms, such as tiredness or developing pain in the upper right side of the abdomen, therefore the disease can progress undetected \[[@CR3]\]. This makes the exact burden difficult to establish. However, NASH burden is increasing, parallelled by the rise of obesity and NAFLD, with an estimated one-third of NAFLD patients progressing into NASH \[[@CR1]\]. In the UK alone, this represents approximately 5% of the population \[[@CR9], [@CR10]\]. NASH can lead to liver fibrosis, with approximately 20% of all NASH patients suffering from advanced fibrosis---namely bridging fibrosis (F3) or cirrhosis (F4) \[[@CR1], [@CR11]\]. Advanced fibrosis increases the disease burden in NASH significantly, leading to end-stage liver disease, hepatocellular cancer (HCC), liver transplantation and death \[[@CR12]\]. The underlying fibrosis stage is key in determining clinical outcomes and mortality, with advanced fibrosis being an independent predictor of overall and disease-specific mortality \[[@CR13]\]. Despite its growing burden, there is a lack of effective non-invasive diagnosis tests for NASH \[[@CR14]\]. Liver biopsy is often considered the current gold standard for diagnosis in spite of challenges associated with its accuracy, patient acceptance, safety and cost. In addition to its complex nature and difficulties in diagnosing, there are currently no approved therapies for NASH \[[@CR14]--[@CR16]\]. Understanding the epidemiology and burden of NASH is vital in establishing clear guidelines for early detection and effective therapies \[[@CR17]\]. The current evidence base for the epidemiology and burden of disease (BoD) of NASH is very limited, with few systematic literature reviews (SLRs) available and NASH frequently reported as part of the wider NAFLD burden. To understand the unmet need in NASH, this structured literature review aimed to examine the current knowledge on NASH epidemiology and BoD, focusing on the prevalence, comorbidities, disease progression, mortality, quality of life (QoL) and economic burden. The primary objective was to understand the NASH epidemiology landscape, encompassing the broad overarching societal and economic impacts on both the individual and the healthcare system, and to identify key gaps in current knowledge to inform future research. Methodology {#Sec2} =========== A structured literature review was performed according to an agreed search protocol following the systematic principles of the Cochrane handbook for systematic reviews \[[@CR18]\]. The following electronic databases were searched utilizing the Ovid search engine: Embase, Medline, PsycINFO and EconLit. Two independent literature searches were conducted to identify publications relating to the epidemiology and BoD of NASH. The search terms used in the search strategy utilized a combination of free-text searching and 'subject headings' to ensure that the most relevant literature was identified for review. The full search strategy is presented in Appendix A. Searches were limited to English language publications between January 2007 and September 2017. Publications were included in the full-text review if they reported on disease burden, disease progression, epidemiology, humanistic burden, healthcare utilization or economic burden in adults with NASH only. As a result of the breadth of our overarching objectives to critique and understand epidemiological and BoD aspects of NASH, the specific detail of individual therapy and management options was not a consideration for inclusion criteria and evaluation in this review. In addition to NASH-focused publications, data from NAFLD-focused publications were included in this review if the reported patient population was stratified into discrete NASH and NAFLD populations, and results were reported in sufficient detail that the NASH results could be inferred or calculated. An internet-based search using a combination of keywords was also conducted to ensure that the latest relevant abstracts and publications were captured. The search included both non-peer-reviewed publicly available information and peer-reviewed publications that may not yet be indexed in databases such as PUBMED or Embase, because of their recent publication date, or because they were published in journals that are not indexed within these databases. A grey literature search was also carried out, reviewing conference proceedings from International Society for Pharmacoeconomics and Outcomes Research (ISPOR), American Association for the Study of Liver Diseases (AASLD), European Association for the Study of Diabetes (EASD), European Association for the Study of the Liver (EASL), Paris Hepatology Conference (PHC) and 3rd Paris NASH Symposium. This article is based on previously conducted studies and does not contain any studies with human participants or animals performed by any of the authors. Results {#Sec3} ======= During the title and abstract screening, 1229 of the 1273 retrieved abstracts were excluded on the basis of defined inclusion criteria presented in the preceding section. The full text of 44 potentially relevant records was assessed and six records were excluded. The grey literature search identified 15 conference abstracts/posters and guidelines, which were deemed relevant for inclusion. In total, 53 publications (38 full-text and 15 grey literature sources) were included into the evidence base used to develop this review. A full Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) diagram is presented in Fig. [1](#Fig1){ref-type="fig"}. The publications were categorized on the basis of the type of BoD data reported as follows: NASH prevalence and incidenceComorbidities associated with NASHDisease progression and mortality in NASH patientsNASH QoLNASH economic burdenFig. 1PRISMA diagram of included and excluded publications The majority of the 53 included publications were small cohort studies and narrative reviews. Several SLRs and economic models and evaluations were also reported (Fig. [2](#Fig2){ref-type="fig"}). The full list of captured publications is presented in Appendix B.Fig. 2Publications captured in the literature review by study type.PRO patient-reported outcomes,RCT randomized controlled trial,SLR systematic literature review NASH Prevalence and Incidence {#Sec4} ----------------------------- The overall NASH prevalence was reported in 13 publications \[[@CR19]--[@CR31]\]. NASH was estimated to affect between 3% and 5% of the global population, with minor variation at the country-specific level; prevalence data were captured for the Chinese, Japanese, UK and USA populations (Fig. [3](#Fig3){ref-type="fig"}).Fig. 3Overall NASH prevalence in the general population.NASH non-alcoholic steatohepatitis,UK United Kingdom,USA United States. ^a^Values rounded to 1 decimal point Over half of the publications primarily focused on the NAFLD population and employed a narrative review approach. The research focus varied across publications and different methodologies were used to determine NASH epidemiology; therefore, direct comparison of prevalence data was difficult. Of note, only four of the 13 prevalence publications specified the exact methodology. One population-based study used a validated histological 'NASH' score to estimate the NASH prevalence. The remaining three publications used data from annual health checks, national health surveys and autopsy results to estimate the prevalence of NASH \[[@CR24], [@CR26], [@CR28], [@CR29]\]. The epidemiology of NASH was reported in an SLR and meta-analysis which collated data from the USA, UK, France, Germany and Italy \[[@CR19]\]. By computing the incidence, mortality and disease transition probability parameters in a series of interlinked Markov chains, it reported that the majority of NASH patients exhibit NASH without fibrosis (approximately 67%), while up to 25% and 11% had fibrosis and cirrhosis, respectively \[[@CR19]\]. These were also most common in the 65+ age group, highlighting the progressive increase in disease burden in NASH \[[@CR19]\]. Although NASH prevalence was reported frequently in the captured publications, no incidence data for NASH were found, highlighting a data gap. ### The NAFLD/NASH Continuum {#Sec5} While several NAFLD-focused publications reported NASH prevalence in the general population, one publication reported on NAFLD-specific NASH prevalence \[[@CR19]\]. In this SLR and meta-analysis, approximately 60% of biopsied NAFLD patients (95% confidence interval (CI) 47.55--69.73) progressed to NASH \[[@CR19]\]. However, the authors acknowledged there may be a selection and ascertainment bias in this estimate since indication for biopsy is typically conducted in NAFLD patients with a high risk of progressing to NASH. Further stratification of NASH prevalence was available for NAFLD patients with and without an indication for biopsy across Asia, Europe (EU) and North America. Although NASH prevalence was similar across regions (ranging from 63% to 69%), NASH was over four times more prevalent in NAFLD patients without indication for biopsy in North America (29.85%; 95% CI 22.72--38.12) compared to Asia (6.67%; 95% CI 2.17--18.73) \[[@CR19]\]. Comorbidities Associated with NASH {#Sec6} ---------------------------------- Comorbidity data were the most frequently reported, with 18 publications describing obesity, diabetes and cardiovascular comorbidities in NASH patients (Table [1](#Tab1){ref-type="table"}) \[[@CR19], [@CR21], [@CR22], [@CR24], [@CR28]--[@CR30], [@CR32]--[@CR42]\].Table 1NASH and comorbidities prevalenceReferencesTypeCountryTotal study size (n)Adult populationPrevalence (%)NASH prevalenceLall et al. \[[@CR28]\]Narrative reviewUSANot reportedNASH in obese patients15--30Mummadi et al. \[[@CR33]\]Meta-analysisUSA766NASH in obese patients18.5NASH in morbidly obese patients33Estep et al. \[[@CR43]\]Cohort study abstractNot reported44NASH in obese bariatric surgery patients75Hyysalo et al. \[[@CR24]\]Population-based prevalence studyFinland676NASH in obese bariatric surgery patients aged 45--7414.5NASH in diabetic bariatric surgery patients aged 45--7417Athyros et al. \[[@CR21]\]Narrative reviewGlobalNot reportedNASH in morbidly obese patients37Losekann et al. \[[@CR32]\]Retrospective cohort studyBrazil250NASH in morbidly obese patients70.4Sanyal et al. \[[@CR30]\]SLR abstractGlobalNot reportedNASH in obese bariatric surgery patients34--94Sayiner et al. \[[@CR29]\]Narrative reviewGlobalNot reportedNASH in obese bariatric surgery patients33.6--37Joshi et al. \[[@CR41]\]Retrospective study abstractUSA1920NASH in type 2 diabetic patients38Institute for Clinical and Economic Review \[[@CR42]\]Evidence review and comparative clinical effectiveness analysisUSANot reportedNASH in type 2 diabetic patients63--87Obesity prevalenceYounossi et al. \[[@CR19]\]SLR and meta-analysisGlobal8,515,431Obesity in NASH patients81.8^a^EUObesity in NASH patients89.2^a^OceaniaObesity in NASH patients95.2^a^South AmericaObesity in NASH patients45.5^a^North AmericaObesity in NASH patients without indication for biopsy80Sanyal et al. \[[@CR30]\]SLR abstractGlobalNot reportedObesity in NASH patients31--89Type 2 diabetes prevalencePromrat et al. \[[@CR40]\]RCTUSA31Type 2 diabetes in NASH48Simons et al. \[[@CR39]\]Cohort study abstractUSA324Type 2 diabetes in NASH LT patients77VanWagner et al. \[[@CR38]\]Cohort study abstractUSA6932Type 2 diabetes in NASH LT patients46.2Estep et al. \[[@CR43]\]Cohort study abstractNot reported44Type 2 diabetes in obese NASH bariatric surgery patients20.3^b^McPherson et al. \[[@CR35]\]Cohort studyUK448Type 2 diabetes in NASH56VanWagner et al. \[[@CR37]\]Database analysisUSA5057Type 2 diabetes in NASH LT patients57.1Losekann et al. \[[@CR32]\]Retrospective cohort studyBrazil250Type 2 diabetes in morbidly obese diabetic NASH patients9^c^Younossi et al. \[[@CR19]\]SLR and meta-analysisGlobal8,515,431Type 2 diabetes in NASH43.6^a^Mantry et al. \[[@CR36]\]Retrospective study abstractUSA650Type 2 diabetes in NASH45Sanyal et al. \[[@CR30]\]SLR abstractUSANot reportedType 2 diabetes in NASH5.3--73.1CVD prevalenceVilar-Gomez et al. \[[@CR34]\]Prospective cohort studyCubaNot reportedCVD in NASH patients2Barritt et al. \[[@CR44]\]Observational studyUSA1441CVD in NASH patients9.4^d^Hyperlipidaemia prevalenceEstep et al. \[[@CR43]\]Cohort study abstractNot reported44Hyperlipidaemia in obese NASH bariatric surgery patients23.3^e^Vilar-Gomez et al. \[[@CR34]\]Prospective cohort studyCubaNot reportedHyperlipidaemia in NASH patients52Younossi et al. \[[@CR19]\]SLR and meta-analysisGlobal8,515,431Hyperlipidaemia in NASH patients72.1^a^Sanyal et al. \[[@CR30]\]SLR abstractUSANot reportedHyperlipidaemia in NASH patients16.9--86.2Hypertension prevalenceEstep et al. \[[@CR43]\]Cohort study abstractNot reported44Hypertension in obese NASH bariatric surgery patients28.5^f^VanWagner et al. \[[@CR37]\]Database analysisUSA5057Hypertension in NASH LT patients35.7Younossi et al. \[[@CR19]\]SLR and meta-analysisGlobal8,515,431Hypertension in NASH patients68^a^Sanyal et al. \[[@CR30]\]SLR abstractUSANot reportedHypertension in NASH patients20.2--85.7Metabolic syndrome prevalenceHyysalo et al. \[[@CR24]\]Population-based prevalence studyFinland676Metabolic syndrome in NASH bariatric surgery patients aged 45--743.4^g^Merola et al. \[[@CR22]\]Clinical reviewUSANot reportedMetabolic syndrome in NASH LT patients40--60Younossi et al. \[[@CR19]\]SLR and meta-analysisGlobal8,515,431Metabolic syndrome in NASH patients70.7^a^Sanyal et al. \[[@CR30]\]SLR abstractUSANot reportedMetabolic syndrome in NASH patients7.5--92.7Hypercholesterolaemia prevalenceSanyal et al. \[[@CR30]\]SLR abstractUSANot reportedHypercholesterolaemia in NASH patients90.2Hypertriglyceridaemia prevalenceYounossi et al. \[[@CR19]\]SLR and meta-analysisGlobal8,515,431Hypercholesterolaemia in NASH patients40.7^a^CVD cardiovascular disease, EU Europe, LT liver transplant, NASH non-alcoholic steatohepatitis, RCT randomized controlled trial, SLR systematic literature review, UK United Kingdom, USA United States^a^Values rounded to 1 decimal point^b^Calculated 27 × 0.75 = 20.3%, based on 75% of the population being NASH obese patients with bariatric surgery^c^Calculated 12.8 × 0.704 = 9%, based on 70.4% of the population being NASH morbidly obese patients^d^Calculated 20 × 0.47 = 9.4%, based on 47% of the population being diagnosed with NASH^e^Calculated 31 × 0.75 = 23.3%, based on 75% of the population being NASH obese patients with bariatric surgery^f^Calculated 38 × 0.75 = 28.5%, based on 75% of the population being NASH obese patients with bariatric surgery^g^Calculated 57 × 0.06 = 3.4, based on 6% of the population being diagnosed with NASH Overall, the prevalence of comorbidities associated with NASH was high, indicating a high disease burden and the burden of clinical management \[[@CR19]\]. There was huge variability in the focus of the publications: some publications described the overall NASH population, whilst others focused on specific sub-populations, such as obese, diabetic, liver transplant (LT) and bariatric surgery patients. Consequently, findings were described as either a comorbidity prevalence in NASH or NASH prevalence in the comorbid sub-populations and, as such, a broad range of prevalence was reported. Variations in study methodologies meant that it was not possible to establish the correlation between these two types of prevalence reported; therefore, both are presented here (Table [1](#Tab1){ref-type="table"}). Risk factors for developing NASH were also reported, with female gender, over 50 years of age, diabetes, obesity, hyperlipidaemia/dyslipidaemia, hypertriglyceridaemia, metabolic syndrome and hypertension being reported as specific factors increasing the risk of NASH \[[@CR19], [@CR22], [@CR26], [@CR29], [@CR35]\]. ### Obesity {#Sec7} The obesity prevalence in the NASH population was reported in two publications, ranging from 31% to 95% (Table [1](#Tab1){ref-type="table"}) \[[@CR19], [@CR30]\]. An SLR with a meta-analysis estimated that 82% of NASH patients suffer from obesity, with another SLR in broad agreement (estimated prevalence was between 31% and 89%); however, the authors cautioned that this range is likely influenced by the variable case definitions and methods used in individual studies examined in this review \[[@CR19], [@CR30]\]. Obesity prevalence in NASH was also reported in different geographical regions, with obesity being twice as prevalent in NASH patients in the EU (89.19%, 95% CI 74.51--95.88) and Oceania (95.24%, 95% CI 82.86--98.81) compared to South America (45.45%, 95% CI 26.47--65.86) \[[@CR19]\]. NASH prevalence in the obese population was reported in seven publications and was more fragmented compared to obesity prevalence in NASH, largely due to the different populations of focus in the relevant publications (such as morbidly obese, obese, or bariatric surgery patients) \[[@CR21], [@CR24], [@CR28]--[@CR30], [@CR32], [@CR33]\]. NASH prevalence ranged from 15% to 94%, depending on the population examined (Table [1](#Tab1){ref-type="table"}), with prevalence in obese and morbidly obese patients reported as 15--30% and 33--70%, respectively \[[@CR21], [@CR28], [@CR33]\]. NASH prevalence in the obese population with bariatric surgery was between 34% and 94% \[[@CR29], [@CR30]\]. Obese prevalence data were frequently reported for the global or USA populations, with one publication each focusing on Finnish and Brazilian NASH populations \[[@CR24], [@CR32]\]. ### Type 2 Diabetes {#Sec8} Type 2 diabetes prevalence in NASH was reported in ten publications \[[@CR19], [@CR30], [@CR32], [@CR35]--[@CR40], [@CR43]\]. An SLR and meta-analysis estimated the global diabetes prevalence among NASH patients to be 43.6% (Table [1](#Tab1){ref-type="table"}) \[[@CR19]\]. Similar results were presented in cohort studies (ranging between 33% and 56%) \[[@CR34]--[@CR36]\]. Another SLR reported a broader estimate of between 5% and 73%; however, similarly to the obese population, the authors cautioned that the variable methods used in the captured studies have likely influenced these results \[[@CR30]\]. The prevalence of diabetes was also reported in NASH LT patients and ranged between 46% and 77%, suggesting an increased burden of diabetes LT patients \[[@CR37]--[@CR39]\]. NASH prevalence in the diabetic population was reported in three publications, ranging from 18% to 87% \[[@CR24], [@CR41], [@CR42]\]. Although the NASH prevalence was higher in diabetics alone compared to diabetic bariatric surgery patients, the research focus of the captured publications varied substantially in terms of the geography, with two publications focusing on the USA and one on Finland, and the type of population, such as NASH diabetic and NASH diabetic bariatric surgery patients, therefore making further meaningful comparisons impossible. ### Cardiovascular Disease {#Sec9} Eight publications reported the prevalence of cardiovascular comorbidities in NASH patients, specifically focusing on hypercholesterolaemia, hyperlipidaemia, hypertension and metabolic syndrome (Table [1](#Tab1){ref-type="table"}) \[[@CR19], [@CR22], [@CR24], [@CR30], [@CR34], [@CR37], [@CR43], [@CR44]\]. Only two publications reported the overall cardiovascular disease (CVD) prevalence among NASH patients, which ranged from 2% to 20% \[[@CR34], [@CR44]\]. A large SLR and meta-analysis reported the overall pooled prevalence for cardiovascular comorbidities among NASH patients as 72% for hyperlipidaemia/dyslipidaemia, 41% for hypertriglyceridaemia, 68% for hypertension and 71% for metabolic syndrome \[[@CR19]\]. This was in broad agreement with the wide range of prevalence (from 7.5% to 92.7%) reported in another SLR \[[@CR30]\]. Other publications reported a range of prevalence estimates, in line with the varying methodologies and population focus of the publications \[[@CR22], [@CR24], [@CR34], [@CR37], [@CR43]\]. Small cohort studies and narrative reviews reported lower prevalence, specifically in sub-populations, such as NASH LT patients and NASH bariatric surgery patients \[[@CR22], [@CR24], [@CR34], [@CR37], [@CR43]\]. As a result of fragmentation of the data and the less robust methodologies employed by these studies, no further conclusions could reliably be drawn. Disease Progression and Mortality in NASH Patients {#Sec10} -------------------------------------------------- Disease progression and mortality was reported in 24 publications; fibrosis data were the most frequently reported, followed by cirrhosis and HCC \[[@CR19]--[@CR23], [@CR26]--[@CR28], [@CR35], [@CR37], [@CR45]--[@CR58]\]. Half of the publications were narrative reviews, while the other half ranged from small cohort studies to SLRs, highlighting a substantial range in the robustness of the data reported. ### Disease Progression in NASH {#Sec11} As a result of a lack of effective diagnostic tools and nonspecific symptoms, NASH progression was difficult to establish. The majority of the publications did not specify the methodologies used to confirm disease progression; only a few utilized liver biopsies \[[@CR19], [@CR28], [@CR46], [@CR47]\]. The captured literature reported that up to 44% of patients with steatosis progress to NASH \[[@CR23], [@CR35]\]. While early stages of NASH can be bidirectional (i.e. progression and regression can occur), the majority of patients (93%) did not regress back to earlier stages of fibrosis (Fig. [4](#Fig4){ref-type="fig"}) \[[@CR35]\].Fig. 4NASH disease progression. F0/4 fibrosis stage 0/4, HCC hepatocellular carcinoma, NASH non-alcoholic steatohepatitis.Data adapted from Traussnigg et al. \[[@CR45]\] #### Fibrosis Progression in NASH {#Sec12} Several studies examining liver biopsy reported that approximately 40% of NASH patients progress to fibrosis globally \[[@CR19], [@CR28], [@CR46], [@CR47]\]. Global average annual progression of NASH to fibrosis was twice as fast as non-alcoholic fatty liver (NAFL) progression, corresponding to an average progression by one stage over 7.1 years versus 14.3 years, and highlighting the increase in the patient burden of NASH compared to NAFLD \[[@CR23], [@CR47]\]. An SLR of risk factors for fibrosis progression highlighted that the rate of progression increases in fibrosis patients compared to the overall NASH cohort, from 0.03 stages/year to 0.41 stages/year, respectively \[[@CR46]\]. Inflammation on initial biopsy had a strongly significant predictive value for development of advanced fibrosis (p \< 0.0001), with median time to progression to advanced fibrosis in patients with inflammation being 4.2 years versus 13.4 years in patients without inflammation \[[@CR46]\]. In long-term follow-up over 5.3 years, most patients experienced no change in NASH severity; however, of the patients who did progress, approximately 70% advanced one stage and approximately 32% progressed two or more stages \[[@CR46]\]. The authors concluded that between 5% and 10% of patients with NASH diagnosed on their initial biopsy will present with clinically significant fibrosis at this initial biopsy, and an additional 15--20% will progress to advanced fibrosis in less than a decade, emphasizing the progressive burden of NASH advanced fibrosis \[[@CR46]\]. Progression between NASH fibrosis stages was also described in the evidence base. Progression between any fibrosis stages was reported in 16--71% of NASH patients, progression from F1/F2 onwards in 9--13%, and from F3 onwards in 9--25% of patients (Table [2](#Tab2){ref-type="table"}) \[[@CR19], [@CR23], [@CR46], [@CR49], [@CR53], [@CR54]\]. It is important to highlight that the publications reporting fibrosis stage progression utilized different stage terminology, e.g. F0--F4, stage 1/4, progressive fibrosis, advanced fibrosis, severe fibrosis, etc. The definitions for these stages were not always clarified; therefore, the comparability of these results was limited.Table 2NASH progression to fibrosisReferencesTypeCountryTotal study size (n)NASH stageProgression (%)Progression from NASH to fibrosisArgo et al. \[[@CR46]\]SLRUSA221All NASH patients to stage 3/4 fibrosis15.8% over 3.7 years (mean interval)NASH fibrosis patients who progressed to stage 3/4 fibrosis42.1% over 3.7 years (mean interval)Musso et al. \[[@CR49]\]Meta-analysisNot reportedNot reportedNASH to progressive fibrosis25--30% over 4 years50% over 6 yearsSporea et al. \[[@CR54]\]Retrospective cohort studyRomania478NASH to severe fibrosis18.5%^a^NASH to no severe fibrosis70.8%^a^Satapathy et al. \[[@CR23]\]Narrative reviewUSANot reportedNASH to fibrosis37%^a^NASH to F3 fibrosis22%^a^NASH to progressive fibrosis34.5%^a^Younossi et al. \[[@CR19]\]SLRUSA8,515,431NASH to fibrosis41%^a^Shouhed et al. \[[@CR53]\]Narrative reviewUSANot reportedNASH to fibrosis26--57%^a^Progression from F1/F2 fibrosis onwardsMusso et al. \[[@CR49]\]Meta-analysisSwedenNot reportedF1/2 fibrosis to cirrhosis13%^a^Progression from F3 fibrosis onwardsMusso et al. \[[@CR49]\]Meta-analysisSwedenNot reportedF3 fibrosis to cirrhosis and end stage liver disease25%^a^Shouhed et al. \[[@CR53]\]Narrative reviewUSANot reportedFibrosis to cirrhosis9--17%^a^F1/2/3/4 fibrosis stage 1/2/3/4, NASH non-alcoholic steatohepatitis, SLR systematic literature review, USA United States^a^Time frame not reported #### Cirrhosis and HCC Progression in NASH {#Sec13} Cirrhosis and HCC progression were reported in ten publications \[[@CR19], [@CR20], [@CR22], [@CR23], [@CR26], [@CR27], [@CR45], [@CR50], [@CR51], [@CR55]\]. In the captured publications, up to 25% of NASH patients progressed to liver cirrhosis and HCC \[[@CR20], [@CR22], [@CR27], [@CR45]\]. The prevalence of cirrhosis progression was reported as significantly higher in NASH patients compared to NAFL patients (10.8% versus 0.7%, respectively) \[[@CR50]\]. A model of simulated NASH patient life course examined the average time of progression to decompensated cirrhosis and HCC for every NASH fibrosis stage, and the simulated average time to progress from early stage fibrosis (F1/F2) was longer (approximately 16 years) than the time to progress from advanced fibrosis (approximately 10 years) \[[@CR55]\]. This highlighted the long-term clinical outcomes and increased mortality risk related to NASH progression \[[@CR55]\]. HCC incidence was reported in three publications; however, this was reported as three distinct types of incidence: global cumulative incidence (2.4% over 7 years and 12.8% over 3 years), global annual incidence \[5.29 per 1000 patient years (95% CI 0.75--37.56)\] and incidence in Japan (between 5% and 25% during approximately 7 years) \[[@CR23], [@CR26]\]. As the incidence type varied between publications, no robust comparisons could be made across these data. An increased burden of NASH progression was acknowledged, highlighting that the rate of HCC progression is expected to increase faster than other hepatic diseases, such as hepatitis B or C. Consequently there are important implications for resource utilization, given that HCC has emerged as the sixth most common cancer and second leading etiology of cancer-related deaths worldwide \[[@CR19]\]. A healthcare utilization model was in accord with this, predicting a disproportionate increase in NASH by 2030: the prevalences of compensated and decompensated cirrhosis cases were projected to increase 180% and 200% from 2015 to 2030, respectively \[[@CR51]\]. The number of NASH-related HCC cases was also projected to reach 12,220 cases in 2030, an increase of approximately 140% compared to 2015 \[[@CR51]\]. ### Mortality in NASH {#Sec14} Fifteen publications reported mortality outcomes in NASH patients \[[@CR20]--[@CR23], [@CR26], [@CR28], [@CR37], [@CR46], [@CR48]--[@CR50], [@CR55]--[@CR58]\]. Several publications outlined an increased risk of death in NASH compared to the general population and patients with NAFL, and decreased survival compared to NAFLD patients \[[@CR20], [@CR28], [@CR48], [@CR49]\]. The overall mortality rate in NASH was 25.56 per 1000 patient years, with the liver-specific mortality rate reported as 11.77 per 1000 patient years \[[@CR20]\]. An SLR and meta-analysis reported liver disease as the main cause of death in NASH, with a liver-related mortality rate of 11--17.5% compared to 1.7--2.7% of NAFLD (pooled odds ratio (OR) 5.71; 95% CI 2.31--14.13; p = 0.0002) \[[@CR49]\]. However, this was disputed in several narrative reviews, which reported CVD and malignancies as the main cause of death in NASH patients \[[@CR20], [@CR23], [@CR57]\]. These publications reported the cause of death using several different measurements and across different populations; therefore, a selection bias may have been present. #### NASH Fibrosis Mortality {#Sec15} There was a significant worsening of mortality outcomes reported with advanced fibrosis (F3/F4) in NASH. Fibrosis progression was linked to a 70% increase in total mortality, compared with patients without fibrosis \[[@CR21]\]. NASH patients with moderate-to-severe fibrosis at baseline also showed a worse survival rate compared to patients with mild fibrosis or no fibrosis (adjusted hazard ratio (HR) 2.09, p = 0.01) \[[@CR21]\]. In addition, a model on the life course of NASH patients predicted that the long-term liver-related mortality and survival in NASH is worsened with fibrosis progression over 15 years \[[@CR55]\]. This aligned with a previously conducted SLR and meta-analysis, which showed that advanced fibrosis increases liver-related mortality almost fivefold compared to mild fibrosis \[[@CR49]\]. #### NASH Cirrhosis and HCC Mortality {#Sec16} An increased mortality burden was also reported with NASH cirrhosis. NASH cirrhosis patient life expectancy was lower than non-cirrhotic NASH patients, with cirrhotic patients' survival ranging from 59% to 84% of the life expectancy of those without cirrhosis \[[@CR26], [@CR46], [@CR50]\]. Median survival in NASH cirrhosis patients was approximately 6 years; they had a similar liver-related mortality compared to viral cirrhosis and a higher CVD-related mortality was observed \[[@CR49]\]. Annual mortality rates for patients with compensated cirrhosis and decompensated cirrhosis specifically were 2% and 13%, respectively, demonstrating a higher mortality burden with progressive worsening of cirrhosis \[[@CR58]\]. There was a paucity of HCC mortality data, reported in only two publications \[[@CR26], [@CR50]\]. The 5-year survival of NASH HCC was reported as 44.8%, with HCC being one of the leading causes of death in NASH patients (47% of deaths), representing an independent risk factor for liver-related mortality (HR 7.96) \[[@CR26], [@CR50]\]. NASH QoL {#Sec17} -------- There was a paucity of data reporting on QoL, specifically on patient-reported outcomes (PRO), with only three publications identified \[[@CR59]--[@CR61]\]. The following experiences were captured in the search: only one generic PRO instrument, the Short Form-36 (SF-36) health survey and one liver-specific questionnaire, the Chronic Liver Disease Questionnaire (CLDQ) reported BoD data \[[@CR59]--[@CR61]\]. Two publications reported on NASH patients experiencing poorer physical and mental health compared to non-NASH patients according to the SF-36 scale, with significantly poorer scores in NASH patients compared to non-NASH patients in mental health, physical functioning, role limitations due to emotional health and social function (p \< 0.05 for all) \[[@CR59], [@CR60]\]. These findings were confirmed via the CLDQ instrument, which revealed additional impairments in all domains (abdominal symptoms, fatigue, systemic symptoms, activity, emotional function, worry) associated with a reduced overall CLDQ score (p \< 0.0001 for all) \[[@CR60], [@CR62]\]. The presence of diabetes \[p = 0.04 for Physical Component Score (PCS)\] was the only demographic/clinical variable reported that was associated with impaired health-related quality of life (HRQoL) amongst NASH patients \[[@CR60]\]. The authors concluded that CLDQ was a reliable and valid measurement tool of disease-specific HRQoL in adults with NASH. NASH Economic Burden {#Sec18} -------------------- NASH economic burden was reported in 12 publications \[[@CR30], [@CR42], [@CR58], [@CR63]--[@CR70]\]. The majority of the publications were health economic evaluations, with the cost-effectiveness of NASH screening methods and treatments the most reported-on economic outcome. However, there was a paucity of data on the societal costs or the healthcare burden of NASH with only one meta-analysis reporting on the direct costs of NASH \[[@CR63]\]. Advanced fibrosis progression was associated with significant increases in costs \[[@CR63]\]. In all stages of NASH, direct medical costs were reported to be high using prevalence-based simulation modelling techniques: in 2016 the total burden was estimated to be \$103 billion per year in the USA versus €27.7 billion in France, Germany and Italy together and £5.24 billion in the UK \[[@CR63]\]. NASH patients with compensated cirrhosis presented the highest direct cost burden compared to patients in other stages of NASH, highlighting the cost burden of advanced NASH progression. Direct medical costs were also examined per age group, with total costs highest in patients aged 45--65, mirroring the disease prevalence \[[@CR63]\]. However, per patient costs were reported as highest in the 65+ age group, reflecting the higher proportion of patients in advanced fibrosis and HCC, and the increased burden of comorbidities \[[@CR63]\]. A USA SLR and model confirmed the high economic burden of NASH, reporting that the total cost of NASH-related care in North America will amount to \$593 billion between 2013 and 2033 \[[@CR30]\]. Lastly, a USA database analysis reported on high costs of NASH hospitalizations, with hospitalizations related to CVD incurring a longer stay and higher associated financial cost compared to NAFLD hospitalizations unrelated to CVD (length of stay was 6.5 versus 5.3 days, p \< 0.001; hospitalization cost was \$57,534 versus \$44,007, p \< 0.001) \[[@CR52], [@CR70]\]. Discussion {#Sec19} ========== To the authors' knowledge, this structured literature review is the first broad-ranging examination of the NASH epidemiology, BoD literature, QoL and economic burden literature. In total, 53 publications were included in this review, with a significant paucity of data observed across all aspects of NASH epidemiology. The publications presented varying study designs and methodologies; the majority of the publications were small cohort studies (sample sizes of less than or equal to 100) and narrative reviews with undefined methodologies, while only a few publications employed a robust systematic approach. As a result, comparison of the results was difficult. Eight SLRs were captured in this review; however, only two examined the BoD in NASH \[[@CR19], [@CR25], [@CR30], [@CR31], [@CR33], [@CR46], [@CR47], [@CR49]\]. The high impact BoD SLR and meta-analysis study by Younossi et al. was underpinned by a model forecasting NASH prevalence and incidence \[[@CR19]\]. The other BoD SLR by Sanyal et al. presented limited information on NASH prevalence, comorbidities and economic burden as the study was only available in abstract form \[[@CR30]\]. Compared to the available literature identified, the current structured literature review provides a robust methodology and a more recent examination of data, with a broader scope, including NASH QoL and disease progression. NASH was estimated to account for 3--5% of the global population, and approximately 60% of biopsied NAFLD patients \[[@CR19]--[@CR29]\]. Prevalence data are essential in understanding the size of current and future NASH populations; however, the captured publications presented a range of prevalence data, likely due to the varying publication focus and robustness of the methodologies used. Over half of the captured publications employed a narrative review approach and most did not specify the methodology used, reflecting the poor quality of these publications. As a result of the unreliability of liver biopsy in diagnosing NASH and its association with high costs and invasive nature, especially in the general population, NASH prevalence data cannot be retrieved accurately and were frequently estimated \[[@CR14]\]. Validated 'histological' NASH score, data from annual health checks, national health surveys, and autopsy results were used in the identified publications to estimate the prevalence of NASH; however, these data can be fragmented and subject to selection bias, specifically in higher burden population, who likely also have one or more comorbid conditions, e.g. advanced fibrosis patients will likely have a higher instance of obesity and CVD compared to mild fibrosis patients. To ensure that accurate prevalence data are obtained not only from patients but also from the general public, an accurate, non-invasive and cost-effective screening tool is needed. For instance, ultrasound screening has emerged as a promising screening technique that is non-invasive, accurate and widely available \[[@CR31], [@CR67]--[@CR69], [@CR71]\]. Blood-based biomarkers have also emerged as a promising diagnostic alternative in NASH as they are non-invasive, have rapid turnaround times and pose limited risks to patients \[[@CR72]\]. More research on biomarkers in NASH is needed to determine if these markers accurately reflect disease progression in NASH and can be implemented in clinical practice \[[@CR72]\]. The global burden of NASH is high, with clinical consequences extending beyond the liver. Approximately 80% of NASH patients suffer from at least one comorbidity, with obesity, diabetes and CVD being the most common \[[@CR19]\]. While it is unclear to what extent NASH development is linked to these conditions, it is clear that NASH association with these comorbidities increases both the patient and healthcare burden \[[@CR19], [@CR21], [@CR22], [@CR24], [@CR28]--[@CR30], [@CR32]--[@CR42]\]. Despite this, the specific prevalence of comorbidities in NASH remains unclear with substantial discrepancies in the literature, specifically in sub-populations, such as in obese, morbidly obese, or bariatric surgery patients. For instance, NASH prevalence in a diabetic population was 14.5% in one study, and between 63% and 87% in a different study on the diabetic population \[[@CR41], [@CR42]\]. This can be due to several reasons, e.g. different baseline populations, or different definitions of how NASH is estimated/measured. Specifically, the varied focus of the publications was a key factor in the discrepancies noted, and a selection bias could have affected these results. This was further compounded by the robustness of the methodologies used, as the majority of the publications consisted of small cohort or observational studies. On the basis of the current evidence base, it is unclear whether the BoD in NASH stems primarily from comorbidities or from NASH directly. For example, when comparing the QoL in patients with NASH, of which 27% have diabetes and 28% had bridging fibrosis or cirrhosis, to diabetic patients alone, the SF-36 PCS scores of patients with NASH and diabetes (mean 44.5) are lower than those with diabetes (mean 49.8), suggesting that the disease severity is worse in NASH and that comorbidities add to the overall burden of disease \[[@CR59], [@CR73]\]. However, when comparing the QoL in patients with NASH, of which 19% had diabetes and 37% had hypertension, to heart failure patients alone, the SF-36 PCS scores (mean 44.2) are higher than for those with heart failure (mean 36.5), suggesting that the burden of NASH is mostly dependent on the comorbidities \[[@CR60], [@CR74]\]. As a result of the limited QoL data in NASH patients and the different patient populations described, the true role of comorbidities in NASH BoD remains unclear. Further research is required to clarify the relationship between NASH and its comorbidities before firm conclusions can be drawn. Despite the limited conclusions gathered from the literature on comorbidities in NASH, data on NASH progression were numerous \[[@CR19]--[@CR23], [@CR26]--[@CR28], [@CR35], [@CR37], [@CR45]--[@CR58]\]. The results clearly showed that NASH with advanced fibrosis significantly increases the likelihood of further progression to cirrhosis and HCC, with one in five NASH patients developing cirrhosis and/or HCC. While mild fibrosis (F1/F2) frequently presents with nonspecific symptoms and low disease burden, advanced fibrosis (F3/F4) exponentially reduces survival and increases liver-related mortality, with an approximately sevenfold increase in mortality rate in NASH compared to NAFLD \[[@CR50], [@CR55]\]. NASH, specifically NASH with advancing fibrosis, therefore presents itself as a clear target for future pharmacological therapies aiming at reducing the burden of NAFLD and its complications. Despite this, not all published literature is in agreement that NASH should be the main target of NAFLD therapy: a recent retrospective study of 60 NAFLD patient biopsies by Hagström et al. reported that baseline steatohepatitis was not associated with an increased risk for fibrosis progression in NAFLD and that fibrosis progression can occur in NAFLD patients without steatohepatitis \[[@CR75]\]. In contrast, a multinational prospective study of 458 NAFLD patients by Vilar-Gomez et al. reported that steatosis is significantly associated with a higher risk of death and liver-related complications, which aligns with the findings of this review, showcasing that NASH is associated with a significant burden and poor long-term prognosis \[[@CR76]\]. It is important to note that because the exact cause of NAFLD and NASH is not yet understood, it is difficult to accurately assess the underlying factors for progression \[[@CR5]--[@CR7]\]. Therefore, further research into the cause of this disease is recommended to improve our understanding of disease progression and the key factors at play. Understanding of disease progression in NASH was impeded by the lack of consistency in fibrosis and cirrhosis stage terminology reported. Several terminologies were used in NASH staging, which were frequently unexplained in the publications and some appeared subjective, e.g. advanced cirrhosis, severe fibrosis and progressive fibrosis. Therefore, to ensure that the progression of NASH to a highly burdensome advanced fibrosis stage is clearly understood, a consensus on staging terminology is required. Correct terminology will allow for a clear quantification of the true disease burden of each step of this progressive disease and supports the development of effective therapies, specifically in advancing fibrosis, which has presented itself as a key determinant of disease progression and mortality \[[@CR46]\]. There was a significant lack of NASH QoL data, with only three publications reporting on PROs in NASH \[[@CR59]--[@CR61]\]. NASH patients reported significantly poorer physical and mental health, impacting the quality of their daily lives \[[@CR59], [@CR60]\]. Only the SF-36 health survey and CLDQ were reported, with standardized liver disease PROs, such as CLDQ, considered most appropriate. In order to truly understand the burden of this disease, however, patient-relevant outcomes, as well as clinical outcomes, must be further researched. NASH-specific economic burden data, and especially in relation to direct costs of NASH, were lacking in the literature \[[@CR30], [@CR63], [@CR70]\]. The most prevalent economic data described NASH screening and treatment strategies, indicating an interest in new diagnostic tools and appropriate therapies, but a lack of research into their exact costs. The publications that investigated direct costs of NASH reported that, despite presenting with little or no symptoms, NASH association with comorbidities and its progressive nature significantly impacts healthcare systems in terms of costs. One meta-analysis reported that disease progression to cirrhosis and beyond was associated with significant increases in costs \[[@CR63]\]. Additionally, NASH cirrhosis patients exhibited significantly higher rates of hospitalizations compared with other cirrhosis etiologies. While several publications briefly reported on the economic burden of NASH specifically, few reported explicit costs. When costs were reported, they were not defined, e.g. "direct costs" were used but no clarification of what these costs included was provided. This is likely because there are little patient-level data available and cost databases frequently do not report NASH diagnosis, rather reporting liver disease or NAFLD with fibrosis or cirrhosis. This makes any information on NASH costs difficult to establish or compare; thus, the exact economic burden of NASH remains unclear. Therapy options in NASH were not a focus of this review, and very few papers specifically looking at the economic impact of management options were retrieved. This is likely a reflection of no licensed drugs currently being available for NASH. At present, NASH management is varied and many off-label treatment options are being utilised in routine practice \[[@CR77]--[@CR81]\]. Current treatment focuses primarily on lifestyle modification and disease management, including weight loss, dietary modifications, exercise and managing comorbidities \[[@CR79]--[@CR81]\]. Many investigational treatments are being researched with more than 150 interventional studies currently ongoing (as described by clinicaltrials.gov) \[[@CR82]\]. Although advanced fibrosis is associated with the highest morbidity and mortality burden in NASH, there is a lack of treatments targeting NASH patients with advanced fibrosis with only two current therapies showing improvements in this population \[[@CR81]\]. Further investigational therapies are needed for NASH with advanced fibrosis, given that the majority of the available and upcoming NASH therapies are primarily focused on patients with mild-to-moderate fibrosis \[[@CR81]\]. Limitations {#Sec20} ----------- A number of limitations were noted during the course of this structured literature review. The focus of this review was the NASH population, and as such the NAFLD population was not explicitly included in the search strategy. As NASH is the progressive phenotype of NAFLD, it is likely that some NAFLD publications with NASH information were excluded on the basis of this criterion. However, as publications reporting on NASH by name (even as part of the larger NAFLD population) were included, excluded publications would have likely not focused on NASH and may not have presented any discrete results other than for the overall NAFLD population. Another limitation was the restriction of this structured review to English language publications. Despite a third of the included publications reporting data on non-English speaking countries, it is possible that some eligible publications were not captured because of this exclusion. Additionally, a sparse evidence base was found across all stages of NASH, with several limitations identified in the captured literature. The publications consisted of generally poor-quality small studies, with short follow-up times, lack of consistency in describing NASH staging, variations in individual study aims, highly selective populations or differing geographies. As NASH is frequently reported as part of the wider NAFLD burden and is often not clearly distinguished from NAFLD, this may explain the small amount of studies focusing on NASH specifically and the poor quality of the literature identified in this review. Conclusion {#Sec21} ========== This first broad-ranging structured examination of the NASH literature revealed a paucity of evidence, which likely reflects the absence of approved therapies. As a result of its nonspecific symptoms and progressive nature, NASH remains underdiagnosed and poorly understood despite its high patient burden. Fibrosis is the key prognostic factor in NASH, with a worse prognosis observed in advanced fibrosis. The overwhelming impact of advanced fibrosis on patients and healthcare systems is evident. There is a clear need for early detection in NASH, particularly among symptomatic patients, along with the need for lifestyle modifications alongside new therapies. Important knowledge gaps remain in the literature, including a clear understanding of NASH progression and its association with comorbidities, NASH patient QoL and NASH-specific economic burden. Further robust quality evidence, specifically real-world and clinical trial data, is needed to improve our understanding of NASH, especially as fibrosis stages advance and NASH burden increases. This will inform the development of effective therapies in NASH and improve the management of this highly burdensome disease. Electronic supplementary material ================================= {#Sec90} Below is the link to the electronic supplementary material. Supplementary material 1 (DOCX 34 kb) Enhanced Digital Features To view enhanced digital features for this article go to 10.6084/m9.figshare.7992944. Funding {#FPar1} ======= This study was funded by Gilead Science Inc and was conducted by Adelphi Values Limited. All authors were involved in drafting the article and revising it critically for important intellectual content, and all authors approved the final version to be published. The sponsor also funded the article processing charges and Open Access fee for this article. Authorship {#FPar2} ========== All named authors meet the International Committee of Medical Journal Editors (ICMJE) criteria for authorship for this article, take responsibility for the integrity of the work as a whole, and have given their approval for this version to be published. Disclosures {#FPar3} =========== Juliana Bottomley is a consultant to Gilead Sciences Inc and received consultancy payment for her contract. Adelphi Values Limited received budgetary compensation for involvement in the conduct of the literature review and manuscript development. Richard Perry is an employee of Adelphi Values Limited. Manca Povsic is an employee of Adelphi Values Limited. On Yee Wong is an employee of Adelphi Values Limited. Compliance with Ethics Guidelines {#FPar4} ================================= This article is based on previously conducted studies and does not contain any studies with human participants or animals performed by any of the authors. Data Availability {#FPar5} ================= Data sharing is not applicable to this article as no databases were generated or analysed during the current study.
eu-careers.info This page is available in 3 languages Conference Interpreters A meaningful career in multiple languages. Are you searching for a meaningful career where you can apply your skills in multiple languages? We are looking for talented, motivated conference interpreters to work for the EU Institutions for the following languages: English, French, Romanian or Slovenian. A multilingual organisation like the EU needs professional linguists to keep it running smoothly. As one of our interpreters you will ensure that the discussions held at various meetings are correctly interpreted. Being an interpreter for the EU is anything but a routine job. You could find yourself in a variety of different places talking about a wide range of different things, with people from all over Europe. Our selection procedures for interpreters are intended for candidates who have a perfect command, both written and spoken, of the language of the competition (mother tongue or equivalent knowledge), backed by a thorough knowledge of at least two other EU languages, one of which is English, French or German. If you are not up to this standard, we would strongly advise you not to apply. You must be trained or experienced as a conference interpreter. Experience as a court interpreter, liaison interpreter, company interpreter, or an interpreter for social or other public services will not be considered experience as a conference interpreter. To apply, please click on the relevant language where you will find further information and a link to the online application form.
Friday, April 9, 2010 Las Vegas - City Of The Damned Or Just Morally Maladjusted? Sorry, dear readers, for the delay in getting you a new review or bit of wisdom, but as is the norm, real life keeps getting in the way of pursuing one’s passion. I had to travel for work, and when I do this I generally have almost no free time due to my rather strange work ethic of doing everything I can to squeeze every drop of productivity from every dollar I spend of my company’s treasure. So, for this trip I had to visit Sin City itself, Las Vegas, and I say “had to” because I truly despise the city, and up until Wednesday I thought it was a city completely beyond salvation. I’m not saying that I want it to be hit by a one-kilometer meteorite and completely annihilated down to the subatomic particle level, but I sure wish they’d let up on the “sin city” theme a bit. It’s not the people that I hate, it’s the entire fact that there’s a place that almost every possible form of putrescence, debauchery, or vice can be found and abused. If you’ve never been, the first time on the “Vegas Strip” is like being hit in the face with a brick that’s been wrapped with dirty thong panties, used condoms, and gin-soaked olives. Now, I am not one to judge, nor have I ever held anyone else to my standard; if you want to head there to get drunk, high, and laid all in one fell swoop, go with God. That’s your bag, and more power to you. Me, I’m a family guy. I have a wife, kids, and some semblance of a “bushido” code that requires that I am faithful and humble in all my endeavors. I have two daughters, and the notion that women that have their images plastered all over the place in various states of undress makes me wonder what the hell their fathers think about their chosen career path. This place is simply too surreal for my simple mind to accept, and my synapses falter and recoil in horror at the sheer insanity of the place. For example, where else on the planet can you drive for 20 minutes and during that time witness: • A Rick James impersonator with a jacket proclaiming “I’m Rick James, Bitch” • Mexican guys handing out cards bearing photos of naked chicks with phone numbers and dollar amounts to couples pushing strollers • Mobile billboards mounted on trucks with larger-than-life photos of naked (but censored) lesbians making out • News-stands on every corner with titles in huge fonts offering “Gay News” and “Hot Ass Chicks” • And my personal favorites, huge replicas of the Eiffel tower and the Statue of Liberty It’s simply fucking madness. It’s a collision of worlds spinning out of control leaving mayhem and madness dripping almost tangibly from the towering structures that define the skyline. All that being said, you can imagine that there’s a hell of a lot to do, and if you’re the kind of person who’d get bored in Vegas, chances are you’re that same guy who jerks off and has your hand fall asleep on you. It is the ultimate dichotomy; thousands of things to do, architecture unparalleled almost anywhere on the planet, yet an abhorrent culture of sex, drugs, and debauchery that embraces you as a brother, noting that whatever you do in their city of wonder is fair game and that nobody will snitch you out when you get home. It’s almost a secret society devoted to causing you to abandon all your morality, social beliefs, and to send you home with almost no recollection of what you did. My trip out to the Big V was for business, as there was a huge convention of people in the industry that I work in, and I’ve been doing things so long that I cannot walk anywhere for more than 3 minutes without running into someone I know and probably like. I stayed at the Luxor again, which is a towering, ebony pyramid with a full-size Sphinx posted up outside, luring onlookers in with the myriad tools of marketing and the hope of hitting it big. It’s truly a marvel of engineering, to say the least, but in all its splendor, it’s still rife with perversion. Everywhere around the place are giant billboards with half-naked chicks and the bells and lights of all manner of games of chance. The sad reality is that these are all simply an illusion, and that with little exception gamblers’ hopes and dreams are being dashed upon the rocks of the reality that if casinos lost, they’d be out of business, not to mention the fact that if these girls weren’t being paid, you wouldn’t have a hope in hell of seeing them naked. The residents of Vegas, though, appear to be good, honest folks just trying to make a living. That their sustenance is derived from people coming from all over to world to toss their money into the abyss of the casino bosses’ coffers says nothing of the fact that although the place is set with the sole intent of separating people’s money from their pockets, this does not preclude the inhabitants of this modern day Babylon from being good, honest people. I only realized this during this trip, where I left the “strip” to explore the surrounding area and check out the “real” Las Vegas. On my first day into the city I headed directly to the Mandalay Bay Convention Center, which is a beautiful structure in and of itself, to meet up with my salespeople and form new alliances with companies that might see benefit in working with me. The convention hall itself is mammoth, having enough room to hold at least 80,000 souls as well as a cornucopia of products, displays and sundry items. As I walked the aisles, I noted that what I saw had not differed from the last five or six years, and that the electronics assembly market has essentially remained stagnant and unchanged for a very long time. There were very few new companies, little in the way of new technologies, and if anything, far fewer people and entities in attendance than the previous few years. I keep hearing “positive economic indicators” on the local and national news channels, but if this show is an indicator, we’re still in deep, deep shit, collectively. As the day’s business wound down, I left with a business acquaintance to adventure into the labyrinthine halls and corridors toward the hotel and casino proper to talk some shop and work out a deal. We settled on getting some dinner at one of his favorite haunts, the Red Brick Pizza parlor, which is north of the Strip by a good 15 miles. This was the first time I had been off-strip, and it was an eye opener. The place looks like almost every Southern California city I’ve ever been to; palm trees, stucco, Latinos and graffiti abound. When you get outside the casino section, it might as well be Los Angeles. We ate at the pizza place, which was not only cheap, but excellent, and we headed back to the den of evil for some more conversation and a cocktail, ending the night on a good note with a Tanqueray Tonic and a firm handshake. As I sat in my overpriced and underwhelming room, I pondered the duality of what I had experienced; an area with all the possible depravity you can imagine surrounded by a city that is not unlike some of my favorite places. It was then that I decided more exploration would have to occur after work the following day. The next day started with a meeting with my largest rep group, where I read them the riot act and noted that their performance “sat somewhere in between craptastic and fucking pathetic, leaning more toward the latter.” I, of course, ended on a positive note that they were good men that had simply lost their way and that I had faith that this meeting would begin our relationship anew, with a much better result than had previously been evidenced. I ended up spending a few more hours talking individually with some of the reps before my next meeting, sharing some tips on how to get new business, starting with the original sales idiom, “You’ll never get the business if they don’t know what you sell.” After a few more meetings and some positive results that will likely bear fruit, I went with a new potential partner to another hotel on the Strip, Planet Hollywood, a gleaming bastion of steel and glass that is truly a sight to behold. We ate at Koi, a Japanese fusion restaurant that my Director took me to last time I was in town, which has the best sushi and sashimi dishes outside of Sapporo in Japan. We dined and discussed our potential partnership while listening to remixed versions of classic songs like Pink Floyd’s “Breathe”. The food was wonderful, as expected, and by the end of the meeting I had decided that this gentleman might be exactly what I am looking for in his respective territory, ending the encounter with promises of follow-up and an ensuing contract. I hopped a cab back to my hotel, where I met a friend in the business to vet some of the reps I talked to during the day, and who knows the area very well, at which point he told me of the “Fremont Street Experience” just a few miles away. I was immediately made a believer, and we adventured onward toward our destination. We arrived 20 minutes later, because while it is truly only a few miles away from the strip, the traffic on the Vegas Strip is ridiculously bad for such a small area. It’s as if some mystic force descends upon every person who owns a car there and causes them to lose 50-100 IQ points. Anyhow, we stepped out of the cab and into a place that is truly a mix of modern-age cutting edge technology and old-school mobster casinos. This place has not only the older casinos, but a pantheon of amazing things to see and do, such as landscape painters who use only aerosol cans, live music on several stages, and street performers such as the killer sax player outside of Binion’s. It’s simply an overdose of light, sound, and aroma, with the pinnacle being the largest television on the planet which spans a few hundred feet across and two full blocks long, at least. Every half hour there is a show played with accompanying music, and it is truly the only place in Vegas I have witnessed truth in advertising; it is an experience, indeed. After walking the area for two hours, we cruised back in a cab and had a final round of drinks at the bar closest to the elevator, ending the night with good conversation and hopes of a renewed and invigorated electronics assembly industry, as well as an ever-better economic climate. Maybe it was the drinks or the walking, but by the end of the show I was convinced that even with Congress spending money faster than it can be printed, the end of the recession is near and business will pick up. Anyhow, I'll be back to writing reviews today and next week, as well as on Jury Duty for the Commonwealth. I've just gotten Prophecy, Runebound:Midnight, and I still have about 70 more games to review, so keep coming back for more!!!
// Copyright (c) 2017-2020 The Merit Foundation // Copyright (c) 2009-2014 The Bitcoin Core developers // Distributed under the MIT software license, see the accompanying // file COPYING or http://www.opensource.org/licenses/mit-license.php. #include "uritests.h" #include "guiutil.h" #include "walletmodel.h" #include <QUrl> void URITests::uriTests() { SendCoinsRecipient rv; QUrl uri; uri.setUrl(QString("merit:175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W?req-dontexist=")); QVERIFY(!GUIUtil::parseMeritURI(uri, &rv)); uri.setUrl(QString("merit:175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W?dontexist=")); QVERIFY(GUIUtil::parseMeritURI(uri, &rv)); QVERIFY(rv.address == QString("175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W")); QVERIFY(rv.label == QString()); QVERIFY(rv.amount == 0); uri.setUrl(QString("merit:175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W?label=Wikipedia Example Address")); QVERIFY(GUIUtil::parseMeritURI(uri, &rv)); QVERIFY(rv.address == QString("175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W")); QVERIFY(rv.label == QString("Wikipedia Example Address")); QVERIFY(rv.amount == 0); uri.setUrl(QString("merit:175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W?amount=0.001")); QVERIFY(GUIUtil::parseMeritURI(uri, &rv)); QVERIFY(rv.address == QString("175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W")); QVERIFY(rv.label == QString()); QVERIFY(rv.amount == 100000); uri.setUrl(QString("merit:175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W?amount=1.001")); QVERIFY(GUIUtil::parseMeritURI(uri, &rv)); QVERIFY(rv.address == QString("175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W")); QVERIFY(rv.label == QString()); QVERIFY(rv.amount == 100100000); uri.setUrl(QString("merit:175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W?amount=100&label=Wikipedia Example")); QVERIFY(GUIUtil::parseMeritURI(uri, &rv)); QVERIFY(rv.address == QString("175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W")); QVERIFY(rv.amount == 10000000000LL); QVERIFY(rv.label == QString("Wikipedia Example")); uri.setUrl(QString("merit:175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W?message=Wikipedia Example Address")); QVERIFY(GUIUtil::parseMeritURI(uri, &rv)); QVERIFY(rv.address == QString("175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W")); QVERIFY(rv.label == QString()); QVERIFY(GUIUtil::parseMeritURI("merit://175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W?message=Wikipedia Example Address", &rv)); QVERIFY(rv.address == QString("175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W")); QVERIFY(rv.label == QString()); uri.setUrl(QString("merit:175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W?req-message=Wikipedia Example Address")); QVERIFY(GUIUtil::parseMeritURI(uri, &rv)); uri.setUrl(QString("merit:175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W?amount=1,000&label=Wikipedia Example")); QVERIFY(!GUIUtil::parseMeritURI(uri, &rv)); uri.setUrl(QString("merit:175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W?amount=1,000.0&label=Wikipedia Example")); QVERIFY(!GUIUtil::parseMeritURI(uri, &rv)); }
MPs urged the Department for Education (DfE) to audit local authorities’ home education performance and review the guidance they are given. [The House of Commons Education] Committee chair Graham Stuart said: “We support the right of parents to educate their children at home and accept that home educating families should bear the costs of that provision. “We don’t think it reasonable, however, that it should be so difficult to access an exam centre nor that families should pay exam costs on top of everything else. Everyone else gets to take GCSEs and home-educated children should do so as well.” It is “not reasonable” that some home-educated young people have poor access to public examinations, warns the House of Commons Education Committee today in a report calling on the Government to ensure fair access and to meet the associated costs. The report published today concludes a short inquiry that examined the support available for home educators and their families. Members of the Committee met home educators, national and local support groups, and a number of local authority officers from across the country. There wasn’t any direct feedback from home educators in the Huffington Post article, so I went to our friend and author, Mike Fortune Wood, who lives and learns ‘across the pond’. He runs the UK Home-Education.org site and also started up World Guide to Home Education. Mike offered a more detailed explanation about the situation related in this report. Unusually, while the HE community are normally reluctant to involve politicians, this report appears to have been broadly welcomed. The committee is not part of the government but is a cross party committee of members of parliament who’s roll it is to monitor and comment on government policy in the area of education. It recognises that there are long standing difficulties over examinations. GCSEs are the exams that school children take at age 16. Good passes in these exams are required to go on to take advanced GCEs which are required for entry to University, although many home educators have creatively found alternative routs. The costs of these exams can vary enormously depending upon subject and location. While some parents can pay around £60 ($90) per exam others can pay £200 ($300) for them. For conventional entry to university a child will need perhaps 5 GCSEs (English, Maths, a modern language and perhaps two or three others in and around the chosen subject of study at university) and a further 3 advanced GCEs (normally taken at around 18 years of age.) In addition to the costs it can be very difficult to locate an examination centre willing to accept external candidates. Schools, where these exams are taken, often make it difficult for home educated children to access the exams and there is no duty placed upon the local authorities (like school boards) to help, although some do assist in finding places. It is hoped that this report may lead to positive action forcing, or at least encouraging, local authorities to assist HE parents gain access to examination centres and to reduce the costs to more manageable levels and not see home educators as a ‘cash cow’ to aid schools budget deficits. The report also speaks about varying levels of support/harassment home educators experience in different parts of England as well as the difficulties parents of children with special needs face with respect to necessary support and even medical assistance. For example a study of approximately 150 local authority websites all but 30 contained statements requiring home educators to jump through hurdles not required by law. The report also recognised that while home educators generally remain for the most part, independent minded, it is generally recognised that families of children with special needs require support and they hope that this report will end the ‘post code’ lottery that has been a feature of home education since it first became a movement in the UKsome 30 years ago. Good wishes to the home educators for useful resolutions of testing and special needs problems.
ATP activates dnaA protein in initiating replication of plasmids bearing the origin of the E. coli chromosome. ATP is bound to dnaA protein with high affinity (KD = 0.03 microM) and hydrolyzed slowly to ADP in the presence of DNA. ADP is also bound tightly to dnaA protein and exchanges with ATP very slowly. The ATP form is active in replication; the ADP form is not. A unique conformation of oriC, formed in an early initiation stage, depends on dnaA protein being in the ATP form. The subsequent entry of dnaB protein to form a prepriming complex also requires ATP binding and is blocked by bound ADP. Inasmuch as hydrolysis of ATP is far slower than these initiation reactions and since the poorly hydrolyzable analogue ATP gamma S can replace ATP, the ATP function appears to be allosteric. The extraordinary affinity of ATP for dnaA protein, its slow hydrolysis to ADP, the profound inhibition of dnaA functions by ADP, and the very slow exchange of ADP all point to a possible regulatory role for these nucleotides in the cell cycle.
Pi Theorem Rocks Glass Pi Theorem Rocks Glass View Images Pi Theorem Rocks Glass Take a sip from a mathematical constant. The Pi Theorem Rocks Glass has the world famous sequence etched around its circumference. Raise a toast to the mother of all mathematical constants with the Pi Theorem Rocks Glass – the perfect gift for any mathematician, science geek, general knowledge buff and fan of early Aronofsky. Etched around the circumference of this geeky drinking glass is the number π in all its glory. Well, part of it, anyway. We’d need a much bigger glass and a lot more whiskey to really start exploring this famous sequence. And we suspect we wouldn’t get very far. ‘It’s an irrational number? You’re an irrational number…’ Falls off bar stool. Worldwide Shipping Economy Shipping is sent via an untracked service. If you wish to track your order, please select the Registered Shipping service. Import Duties All orders are shipped from our headquarters in the UK. You will therefore be responsible for any import duties which may be applied to orders shipped outside the EU. What is the Fowndry Welcome, traveller. We hope you’ve enjoyed your visit to Earth. Before making the jump to hyperspace, please enjoy a browse through the latest, most remarkable products this planet has to offer. Take home the perfect gift for your husband, wife, hive mind or robot overlord. From cutting edge gadgets to retro furnishings, cool toys to novelty gifts, our team has spent a lifetime scouring Earth’s trade fairs, toy shops, man-caves and troll markets for the very best. Just imagine Han Solo (the original, unedited one who shoots first) crossed with the Man from Del Monte. That’s us. Take a look around. If you have any questions please shoot red sparks from your wand, combine rings, raise a vestigial limb or drop us an email. Our friendly staff are fluent in over seven million different languages and would be happy to help. Connect With Us https://www.thefowndry.com/products/pi-theorem-rocks-glass367027205Pi Theorem Rocks Glass//cdn.shopify.com/s/files/1/0207/4676/products/Screen-1_b4fec5de-2aa6-4948-b603-ccb89b5bd903_large.jpg?v=14938170470.00GBPOutOfStockA Bit Of What You FancyABITOFWHATYOUFANCYDEER-WE-GOFOWNDRYCOMP10HAPPYDAZE05OBI-WAN-10OBI-WAN-5SHOWMETHEHONEYSUMMER25 Take a sip from a mathematical constant. The Pi Theorem Rocks Glass has the world famous sequence etched around its circumference. Raise a toast to the mother of all mathematical constants with the Pi Theorem Rocks Glass – the perfect gift for any mathematician, science geek, general knowledge buff and fan of early Aronofsky. Etched around the circumference of this geeky drinking glass is the number π in all its glory. Well, part of it, anyway. We’d need a much bigger glass and a lot more whiskey to really start exploring this famous sequence. And we suspect we wouldn’t get very far. ‘It’s an irrational number? You’re an irrational number…’ Falls off bar stool.
UAE to tax e-smoking products, sweetened drinks starting 2020 1 Min Read CAIRO (Reuters) - The United Arab Emirates said on Wednesday it would impose a 100% “selective” tax on electronic smoking products and a 50% tax on sweetened drinks starting from January 1, 2020, state news agency WAM reported. The decision is in line with the UAE’s commitment to implement the unified tax agreement of the Gulf Cooperation Council, WAM said.
21 Minutes SEASON ONE: EPISODE 01 "THE ALIBI" It's Baltimore, 1999. Hae Min Lee, a popular high-school senior, disappears after school one day. Six weeks later detectives arrest her classmate and ex-boyfriend, Adnan Syed, for her murder. He says he's innocent - though he can't exactly remember what he was doing on that January afternoon. But someone can. A classmate at Woodlawn High School says she knows where Adnan was. The trouble is, she’s nowhere to be found. http://goo.gl/vUC5Zk #FullPodcastAvailable #Podcasts
Wildkat Photography Your vision in pictures Photography has had a strong pull on me ever since I was a young boy. I started with a Brownie Hawkeye and graduated to a Pentax K1000 before taking a long break to be a husband and dad. A few years ago I got the itch again. This is the result. We are a small shop - just one photographer - so you will always get individual attention.
Jessica Rivera Jessica Rivera (born 1974) is an American soprano of Peruvian-American ancestry. Life and career Rivera is a 1996 graduate of Pepperdine University, and earned her Master of Music degree in 1998 from the University of Southern California's Flora L. Thornton School of Music. In the summer of 2001 she attended the Music Academy of the West summer conservatory program. Rivera's early work included singing in the chorus of Los Angeles Opera (LA Opera). Rivera has become particularly known for her performances of the music of contemporary composers, such as John Adams and Osvaldo Golijov. At LA Opera, she sang the role of Anastasia in the 2003 world premiere of Deborah Drattell's opera Nicholas and Alexandra. Her Santa Fe Opera debut in 2005 was as Nuria in the revised edition of Golijov's Ainadamar. She sang on the subsequent Deutsche Grammophon recording of the opera. Rivera has sung the European premiere of Kitty Oppenheimer in Doctor Atomic after Adams had rewritten and expanded the role from mezzo-soprano to soprano voice. She continued the role at Lyric Opera of Chicago, in 2007 and was the understudy for the 2008 production at the Metropolitan Opera. She has sung several parts and roles in John Adams' works, including the soprano part in El Niño, and the role of Kumudha in A Flowering Tree in the Peter Sellars production at the New Crowned Hope Festival in Vienna. In 2012 Rivera has sung the solo role in the world premiere of Gabriela Lena Frank's Holy Sisters with the San Francisco Girls Chorus and the Berkeley Symphony under the baton of Edwin Outwater. References External links Official Jessica Rivera website Pepperdine University article on Jessica Rivera Santa Monica Symphony Program Notes, March 26, 2006 IMG Artists agency biography of Jessica Rivera Walt Disney Concert Hall/Hollywood Bowl biography of Jessica Rivera Category:1974 births Category:American sopranos Category:Living people Category:Pepperdine University alumni Category:Thornton School of Music alumni Category:Grammy Award winners Category:21st-century American singers Category:21st-century American women singers Category:Music Academy of the West alumni
Rapidly progressive glomerulonephritis: analysis of prevalence and clinical course. Over a period of 68 months we observed 33 patients with biopsy-confirmed severe crescentic glomerulonephritis (GN) and another 5 patients who fulfilled the clinical criteria of rapidly progressive glomerulonephritis (RPGN; no biopsy confirmation) in a region comprising approximately 930,000 inhabitants. Additional 7 patients with Wegener's granulomatosis (WG)/microscopic polyarteritis (MP) from the same region were not seen by nephrologists. The calculated annual incidence of crescentic GN/RPGN is 0.7/100,000. Of the 38 patients 13 had classical WG, 7 MP, 3 systemic lupus erythematosus, 5 Schönlein-Henoch purpura, 3 Goodpasture's syndrome, 2 IgA glomerulonephritis. Of note is the high prevalence of WG/MP and the relative frequency of Schönlein-Henoch purpura. At the last follow-up, 3 patients were dead (8%), 7 patients were on dialysis (18%), 7 patients had elevated serum creatinine (18%) and 21 patients had normal serum creatinine (55%). We conclude that: (i) RPGN is more frequent than reported; (ii) WG and MP account for more than 50% of cases of RPGN; (iii) renal functional prognosis is good in WG/MP, but less favorable in RPGN of other causes; (iv) severe hypertension is not a feature of RPGN; (v) WG/MP, and not Goodpasture's syndrome, is the most common cause of pulmonary hemorrhage in association with RPGN; (vi) death from infection or malignoma is uncommon (not observed in this series); (vii) de novo IgA GN may occur in patients in remission from WG (2 observations).
Q: Wrong frame after adding transformed view to UIWindow or UIView The following code will break the frame (which will be enormous), as seen in iOS 8.1.3. someView.layer.transform = CGAffineTransformMakeScale(0.001f, 0.001f); [[[[UIApplication sharedApplication] keyWindow].subviews lastObject] addSubview:someView]; [UIView animateWithDuration:0.3f animations:^{ someView.transform = CATransform3DIdentity; }]; Removing the transformation and replacing it with a simple frame movement animation works well. Why? A: After some investigation and reasoning I came to the conclusion that it might be a good idea to apply the transformation of someView after it has been added to a view. And this turned out to be the solution. So we write: [[[[UIApplication sharedApplication] keyWindow].subviews lastObject] addSubview:someView]; someView.layer.transform = CGAffineTransformMakeScale(0.001f, 0.001f); [UIView animateWithDuration:0.3f animations:^{ someView.transform = CGAffineTransformIdentity; }]; Which works as expected.
Price Methods in Enzymology, Volume 411 Modern DNA microarray technologies have evolved over the past 25 years to the point where it is now possible to take many million measurements from a single experiment. These two volumes, Parts A & B in the Methods in Enzymology series provide methods that will shepard any molecular biologist through the process of planning, performing, and publishing microarray results. Part A starts with an overview of a number of microarray platforms, both commercial and academically produced and includes wet bench protocols for performing traditional expression analysis and derivative techniques such as detection of transcription factor occupancy and chromatin status. Wet-bench protocols and troubleshooting techniques continue into Part B. These techniques are well rooted in traditional molecular biology and while they require traditional care, a researcher that can reproducibly generate beautiful Northern or Southern blots should have no difficulty generating beautiful array hybridizations. Data management is a more recent problem for most biologists. The bulk of Part B provides a range of techniques for data handling. This includes critical issues, from normalization within and between arrays, to uploading your results to the public repositories for array data, and how to integrate data from multiple sources. There are chapters in Part B for both the debutant and the expert bioinformatician. Publisher: Elsevier Science Publishing Co Inc Publication date: Aug. 28, 2006 Number of pages: 512 ISBN: 9780121828165 Hardback Modern DNA microarray technologies have evolved over the past 25 years to the point where it is now possible to take many million measurements from a single experiment. These two volumes, Parts A & B in the Methods in Enzymology series provide methods that will shepard any molecular biologist through the process of planning, performing, and publishing microarray results. Part A starts with an overview of a number of microarray platforms, both commercial and academically produced and includes wet bench protocols for performing traditional expression analysis and derivative techniques such as detection of transcription factor occupancy and chromatin status. Wet-bench protocols and troubleshooting techniques continue into Part B. These techniques are well rooted in traditional molecular biology and while they require traditional care, a researcher that can reproducibly generate beautiful Northern or Southern blots should have no difficulty generating beautiful array hybridizations. Data management is a more recent problem for most biologists. The bulk of Part B provides a range of techniques for data handling. This includes critical issues, from normalization within and between arrays, to uploading your results to the public repositories for array data, and how to integrate data from multiple sources. There are chapters in Part B for both the debutant and the expert bioinformatician. Get informed Exclusive offers, news, updates. Reviews from GoodReads.com When will my order arrive? Dispatch times may vary for each item even if they are ordered at the same time. You will receive an email when your item has been dispatched with estimated delivery date, we regret we can't guarantee or provide tracking for items. Once your order has been dispatched from Magrudy's warehouse, we offer the following times for delivery in business days (Mon-Fri): United Kingdom: 2-5 business days Ireland: 4-6 business days Europe: 4-8 business days UAE: 7-10 business days All other countries: 7-10 business days You can check your order status at anytime by visiting your Account here Order Status. If your order is still processing, that means that we are searching the world for your items! If your order shows as dispatched and hasn't arrived in the expected time, please check with your local delivery office before contacting us with the details.
Definitive dose thoracic radiation therapy in oligometastatic non-small cell lung cancer: A hypothesis-generating study. A subset of patients with minimal extrathoracic disease may benefit from aggressive primary tumor treatment. We report comparative outcomes in oligometastatic non-small cell lung cancer (NSCLC) treated with and without definitive, conventionally fractionated thoracic radiation therapy. We identified consecutive patients with stage IV NSCLC who had an Eastern Cooperative Oncology Group performance status ≤2 and ≤4 total sites of metastatic disease and who had been prescribed ≥50 Gy of thoracic radiation. Twenty-nine patients with oligometastatic NSCLC were identified between January 2004 and August 2010. Median survival was 22 months from diagnosis. Four patients (14%) experienced pneumonitis greater than or equal to grade 3; 6 (21%) had esophagitis greater than or equal to grade 3. Local control was associated with improved survival (P = .02). In matched subset analysis, median survival was 9 months (P < .01) in patients who received chemotherapy alone. Median time to local failure was 18 versus 6 months (P = .01). On multivariable analysis, radiation (P < .01; odds ratio [OR], 0.33), fewer metastases (P < .01; OR, 2.14), and female sex (P < .01; OR, 0.41) were associated with improved survival. Definitive dose radiation therapy may improve survival in a select subset of patients with minimal extrathoracic disease in whom local progression is of primary concern. Prospective trials are needed to further evaluate the role of local control in oligometastatic NSCLC.
AuthorTopic: ProPhotoRGB (Read 33080 times) NO image could contain that color. Even if it could, we could see a tiny fraction of those colors (we can’t even see anything close to 16 million color simultaneously). This is all math being used to define a possible but unfortunately impossible human experience. Don’t forget, there’s math that says a bumblebee can’t fly. I wouldn't argue with that. I suspect many of our images have no more than a few thousand discrete colors. But whether an image has 50 colors or 1,000, I don't believe the number of colors increases by moving to a larger color space. There is nothing to debate here. It’s a closed question. The J. Daalder article is air tight. To whit:“..if your original capture does not contain tones out of the gamut of AdobeRGB, then there is no point whatsoever (and quite a few negatives) in using ProPhoto as your color space unless you plan to artificially manipulate the saturation of your image to a considerable degree.” I’ll go one step further, and I know nothing about color management. You don’t have to be a color scientist to understand this: If you are working in a color space you can’t print, you are doing a blind edit. That’s a fact on it’s face. The rest is a matter of degree. Working in ProPhoto it's a large degree. What’s amusing are those who say they are preserving colors by working in ProPhoto even though they know they can’t print the colors they are “preserving.” This from the folks who say calibrate your monitor and work in a color managed environment so what you see is what you get. Well if you’re working in a color space that’s five times the size of your print space, then what you see is what you see. And any relationship between what you see and your print is good fortune. It boggles. But if it makes you feel good, I say, enjoy! Life is too short. Where's Didger when you need him? I miss him. There is nothing said thus far to refute the premise of Jeremy Daalder's article. This is not about opinion. It’s about numbers. Predictable, deterministic math. It all boils down to a squirt of ink determined by a number. It’s as simple as that. I’m not saying don’t use PhoPhoto. Use it. Have a ball. I am saying that when your working space is far greater than your printer/paper space you are knowingly introducing an unnecessary unknown. Which adds mystery to the output but nothing else of value. If some one can explain how a color outside the print space is of some value during editing, I’ll read it. But at the moment, it’s mere religion. Which squirt of ink and when? The reason the working space is so much wider than the output space in many areas is it has to be. Read what Bruce wrote so clearly. There are NO perfect working space or we’d only have one. Trying to make a perfect fit of working space to output space (even if you only defined one printer) would be nearly impossible. Working spaces are based on synthetic color spaces that mimic displays more or less. Output devices have vastly different shaped gamuts. So for those that want to fit as much if not all the output space in the working space, you need a pretty big honking working space. So some colors WILL fall outside output gamut. That’s just a fact of life. You’re trying to fit a round peg in a square hole. The square hole has to be big enough to fit the round peg and yes, there are areas as a result that fall way outside the round peg. And that’s a problem why? Of all the well known and designed wide gamut RGB working spaces, ProPhoto RGB has proven over the years to handle the task of a wide gamut working space. You either want to contain all the colors you capture (and maybe, hopefully reproduce them) or you don’t. It’s pretty darn easy to see if, when you’re in ACR, the scene falls within or outside of a working space like Adobe RGB (1998). IF you care about those colors, you’re far better off using a big honking space like ProPhoto RGB or you decide you don’t care about those colors. Use sRGB, use ColorMatch RGB, use whatever. There’s far less problems gathering the color you captured in high bit in a big space than tossing the colors for a smaller space for lots of users (who care about getting all the colors they could capture). Again, you either care or you don’t. If you care, your only real option is to use a big honking color space. There is no unnecessary unknown. There IS a big unnecessary unknown when you clip colors, namely what colors did I just throw away and what device (and when) could I have used them. Once gone, they are gone forever. I don’t see that as being a compelling reason to use a smaller working space but maybe you do. The Color Range tool offers an option to select “Out Of Gamut” colors. Which target profile does it refer to? It seems that the selection differs considerably from the SoftProof / out-of-gamut marks. The Out of Gamut warnings and Color Range selections refer to whatever is the current soft proof set up. If there is no soft proof set up on, then it's the "default" set up which, unless changed, is your current CMYK profile. You can change the default by, with no image open, changing your soft proof setup to something else, such as your main Epson profile, a different CMYK, etc. Quote After you’ve processed a file through Camera Raw (ProPhotoRGB, 16 bit), do you instantly enable the SoftProof to the printer/media profile, or is there an editing step in-between based on “normal” presentation on screen? Depends-if I'm planing of taking the image directly to print, then I turn on softproofing first thing. All of my post Camera Raw tone & color corrections need to be done in "light" of the final print output. I usually turn off softproofing when just retouching. However, if the plan is to have my converted raw file opened as a PP RGB and my plan is to just produce a master file for later use in either print, web ot whatever, then I just work along with softproofing off. Later, if I need to make a print, I turn softproofing on for checking before print. Also, and this may surprise some, I'll also use softproofing when trying to determine optimal image sharpening-since the nature of the reduced dynamic range of the final print can have an effect on the required sharpening. Note: PhotoKit Sharpener already takes the final output into consideration when you use the Output Sharpening. That's a "product feature" we built in. But I will use softproofing to view the image for the purpose of creative sharpening. Softproofing is _NOT_ just "all about color" it's all about what the image will look like when ink hits paper...the more you can do to prepare the image for the appearence of the image on paper, the less time you'll spend tweaking print setting, pritning a test and further tweaking. Ink and paper are expensive enough that you can save both considerable time and money by accurate predictive image eval prior to printing. There really shouldn't be a lot of surprises when the print comes out of the printer, regardless of the working space you choose. ".......It maps white in the source to white in the destination, so that white on output is the white of the paper rather than the white of the source space. It then reproduces all the in-gamut colors exactly and clips out-of-gamut colors to the closest reproducible hue. ........" Now, if that is what it does, it is by no means obvious to me how variations in the extent of out-of-gamut colors being remapped (as you move from ARGB98 to Prophoto, e.g.) could have a differential visible impact on posterization of actual photographs. The Granger Rainbow is certainly brighter and more colourful when assigned a ProPhoto profile (as opposed to sRGB and ARGB) both before and after proof setup for Premium Glossy, RelCol, simulate paper white and sat reduction to tame gamut. I'm not at my printer at present, but I have no doubt which would look the best if I printed all three images on my 7600. One thing that puzzles me, however. To bring these 3 images within the gamut of the Premium Gloss profile requires a greater reduction of saturation (with the hue/sat tool) for the ARGB and sRGB images than for the ProPhoto image. (ARGB -71; sRGB -68; PP -62.) Does this seem right? I just can't understand that statement. I have an sRGB 24 bit 50MB image that contains every combination of the 255 levels of red, green and blue; ie 16.7 million colours, each pixel representing a different colour. (Give or take a few hundred or thousand, Jani ). I convert the image to the bigger ProPhoto color space. I've still got 16.7 million colors. If I were to get more, the file size would have to increase. I've never noticed that happen, have you? If I say the colors have changed in character; that some of them are more saturated than they were in the sRGB space, then that is a different statement to saying I have more colors. Let's try to be logical here. More colors does not mean more color, if English is your first language. If you think it does, then thats the source of the confusion. By 'more colors', I mean 'a greater number of discrete shades of color'. The scale is totally different. R255 in sRGB isn’t the same color as R255 in ProPhoto RGB. The R255R in ProPhoto is much more saturated. It’s not the same color but has the same number. Now if you want to debate that the max red in one color space which is more saturated than another isn’t really “more colors”, OK. It’s pretty simple. You have a capture device and scene gamut that falls outside of Adobe RGB (1998). You have output devices who’s gamuts fall outside Adobe RGB (1998) such as my Epson 2400. Your goal is to capture and reproduce all the colors you can. Adobe RGB (1998) is fine but not up to that task, ProPhoto RGB is. As I’ve said so many times, there is no such thing as a prefect RGB working space. But you could substitute working space in that sentence with just about anything we work with in Photography and imaging. Correct me if I'm wrong, and I think that this is what Paul has been saying all along. If my prints are made on a Fuji Frontier which prints to the sRGB colour space, then does it not make more sense to work in that colour space from the beginning of my workflow so that I am not assuming certain saturated colours are contained in ACR using prophoto and then converting to the print colour space of sRGB just before sending to print, losing the saturated detail and having to start again.Isn't the point of WYSIWYG to be just that? What's the point in working with a wider gamut throughout the workflow if you aren't going to use it for print, you will just be getting yourself in trouble.Of course this is an extreme example of a printer with a limited colour space. However even though prophoto may give an advantage for certain colours on certain printers, would it not be better to work with a colour space throughout the workflow that is completely contained within the printers ability, such as Adobe '98, so at least you know exactly how the colours are going to come out in print from start to finish? I’m not saying don’t use PhoPhoto. Use it. Have a ball. I am saying that when your working space is far greater than your printer/paper space you are knowingly introducing an unnecessary unknown. Which adds mystery to the output but nothing else of value. If some one can explain how a color outside the print space is of some value during editing, I’ll read it. But at the moment, it’s mere religion. It's neither a religion nor an unknown-even if _YOU_ don't yet know how to do it. Look, you have a capture space, a working space and a printer space. To take a capture space and by virtue of converting to a working space, clip or throw away color, you've forever limited the usability of such color and lessened the value of the image for the future. Going from ProPhoto RGB, which contains not just "most" of the colors cameras can capture, but _ALL_ colors a camera can capture, to your output profile allows _YOU_ to decide how the color transforms will be handled. It's _NOT_ religion that today's inkjet printers can use a meaningful amount of color outside of even Adobe RGB, and it ain't just Canary yellow but in the case of the new K3 inks a LOT of dark deep saturated colors that fall outside of Adobe RGB, but within ProPhoto RGB _AND_ the K3 ink gamut. Color outside the print gamut itself can be useful in that YOU can control how those colors are remapped. How? Photoshop Soft Proofing-if you know how to use it. The Absolute Colormetric use of Soft Proofing (using ink black and paper white) can show you exactly how to adjust what are out of gamut color into the gamut of the output device. You can alter the relationships of the colors and actual produce results by virtue of those out of gamut colors. Yes, they won't "print" but they will absolutely impact how the final output looks. Yes, today's displays can't show you "everything" but using Soft Proofing correctly, you can be about 90% accurate in your visual predictions on-screen to print. If you don't have the data, you can't do anything with the data...hense the reason for working with data outside of the color space of the output and if you know what you are doing, working with data outside the color space of your monitor. Personally, with the recent rate of progress in cameras, output devices and displays, if you _DON'T_ work now with an eye to the future, you are being incredibly short sighted. Michael's review of the 4800 not withstanding, the total volume of color capable of being reproduced by the 4800 vs the 4000 is seriously larger-even if he didn't do the volume mapping to prove it to himself. We'll have computer displays very shortly that will have at least if not larger color gamuts than Adobe RGB and luminance output that is bright enough to work in normal room light. To be honest, even ProPhoto RGB is actually too small a color space to work in when limited by 16 bit. With the deployment of even limited HDR space in Photoshop CS2, we're looking well beyond the current limitation of 16 bit integer to 32 bit floating point and new color spaces that will extend even beyond what ProPhoto RGB can contain. Will we see cameras that can capture or printers that can print it? Not for a while yet, but remember, image processing is also an advancing art and still limited to the current algorithms in use-which keep getting better. But even if you can't capture or print the colors, you CAN archive them in your files for a time in the future when you may be able to. Also, understand that image processing is just really elaborate math-and the more data you have, the more refined and accurate the results of your processing algorithms. Which translates to better results even in smaller gamut output. There are a lot of people out there with a little bit of knowledge and often the "nearly blind" will end up leading the "blind". The "unknown" won't stay that way long, and there's little value in "religion" as you term it...but there is science, if you are inclined to learn it. You realize that when a photo file color doesn’t map into your print space the rendering process does it for you. In other words, what you see is NOT what you get. You get whatever the rendering process gives you. That’s why in 2005 we still hover over the printer with a fair bit of apprehension to see what it will hatch. We don’t do that with text printers any more because technology has taken the mystery out of it. Back in the DOS days of 6 pin dot-matrix printers it wasn’t so deterministic. Some day fine art printing will be as deterministic as laser jet text is today. But it won’t be tomorrow. Andrew's response to Ray to-day is very sensible, but it deals with varying impacts of different rendering intents, whereas the issue at stake in this discussion thread is whether there is a differentially worse impact from the use of whatever rendering intent when the working space is Prophoto rather than ARGB98. Actually if you’re referring to the use of a Granger Rainbow to see the effects of a conversion, the source profile used is going to be part of the evaluation. That is, Assign sRGB, Adobe RGB (1998) and ProPhoto to the same numbers and convert using the same output profile and rendering intent. You’ll see some very interesting results! Brighter (more saturated, or perhaps more intense is the right word) on screen immediately after assigning the 3 profiles, but also after applying proof setup/simulater paper white etc and reducing gamut for all 3. The sRGB and ARGB rainbows are dowdy by comparison. If the numbers are the same, it would seem the reason why the ProPhoto image did not require the same degree of desaturation as the ARGB image (to bring them both within gamut) is a result of the Premium Glossy paper's capacity to handle at least some of the greater saturation of ProPhoto. Does that make sense? The surprise is, the sRGB image required less desaturation to bring it within gamut than did ARGB. It would make more sense if this was the other way round. Logged PeterLange I do not see any contradiction, unless you seriously suggest to map an out-of-gamut color onto an in-gamut color. With RelCol, out-of-gamut colors are simply clipped to the nearest color in CIE Lab. In detail, an out-of-gamut color is moved along a line of constant Lab hue angle – until it reaches the border of the target space. At page 71 of your book it is explained that such moves are not perfectly in line with the perceived hue. There are two options for viewing out of gamut colors under the View menu. One is to setup a soft proof using the output profile, rendering intent and options like Simulate paper/ink. This IS the way to be evaluating the soft proof/out of gamut colors. The second, older and quite useless way is to pick “Gamut Warning” which places a gray (by default) mask over out of gamut colors based on what you’ve set in Proof Setup. The idea is to desaturate those areas so they fall into output gamut. This is a old, useless, time consuming and not very accurate way to be handling this process.
LEINENKUGEL’S HONEY WEISS Rustic swill water opening and stale bread mouthfeel never gain authentic German weiss character. Honey tones are unnoticeable and wheat essence is completely lost in a congested mesh. Soft; watery; inconsequential. Serve with lemon.
Saturday, May 7, 2016 Clinton, Sanders and the post-Indiana campaign I KNOW that the Clinton campaign thinks this campaign is over. They’re wrong,” Vermont Sen. Bernie Sanders told The Associated Press on Tuesday by phone from New Albany, Indiana. “Maybe it’s over for the insiders and the party establishment, but the voters today in Indiana had a different idea.” Sanders can be forgiven for indulging in a moment fit for Mark Twain or Jon Snow. Like the great American humorist after hearing the news of his own demise, like the major warrior of HBO’s “Game of Thrones” come back to life, reports of Sanders’ end as a presidential candidate have been greatly exaggerated. The death notice for his campaign may just be early but for now, the Lazarus of the 2016 presidential campaign is very much with us, celebrating an upset victory over challenger Hillary Clinton in the Indiana Democratic primary. Sanders predicted he’d have “more victories in the weeks to come” in West Virginia, Kentucky, Oregon and California. Admitting he faced an “uphill climb” to the nomination, Sanders said that, regardless, he was “in this campaign to win and we are going to fight until the last vote is cast.” Tuesday’s win makes that more than an idle boast. ◊ ◊ ◊ We’d thought it was just about over when Hillary Clinton won the April 26 five-state Acela/I-95 primary; the smart money figured she’d effectively shut the door on Sanders’ spectacularly refreshing maverick campaign. That seemed to be pretty much confirmed on Wednesday, when Sanders campaign manager Jeff Weaver told CNN more than 200 workers would be getting pink slips. Sanders told The New York Times the same thing, in an interview. “It will be hundreds of staff members,” he said. The delegate count makes clear how “uphill” that climb for Sanders still is. Sanders may be doing this to extract leverage in helping to write the Democratic platform at or just before the convention in Philadelphia. But Sanders has been fighting the good fight, raising tens of millions in small-donor contributions, and dragging the Democratic party, kicking and screaming when necessary, further to the inclusive, panoramic left. Not bad for a septuagenarian first-timer on the campaign trail. ◊ ◊ ◊ WHAT HAPPENS next is open for debate. With nine state primaries left, Clinton still has a commanding delegate lead. But there are scenarios emerging in which Sanders could make this sprint to the end of the primary season more of a photo finish than Hillary Clinton, or anyone else, imagined. Abramson suggests that with the Indiana victory of billionaire attention addict and GOP frontrunner Donald Trump essentially securing him the nomination, there’s no strategic reason for Republican voters to vote for Trump anymore — and that, with open primaries to come, independent voters or Republican voters might cross over and vote for Sanders. ◊ ◊ ◊ Abramson writes: “Sanders will pick up a huge number of what would otherwise be Trump votes in states where voters are still able to register for upcoming Democratic primaries, or are able to cross over and vote in the Democratic primary due to being a registered independent. “Sanders’ vote share in nearly every upcoming primary and caucus just increased, though we don’t know by how much. In some instances, it could be a substantial bump, given that there’s no strategic reason to cast a vote for Donald Trump anymore — now that the Republican National Committee has officially declared him the presumptive nominee.” On its face that doesn’t make much sense. OK, independent voters might vote for Sanders; that much isn’t just possible, it’s flat-out logical they’d go all in for an independent senator from very independent Vermont. But this scenario also assumes that the Republican voters Abramson speaks of — “what would otherwise be Trump votes” — would find enough common cause with Sanders to vote for him. That’s nuts. There’s no more of a reason, strategic or otherwise, for Republican voters to vote for Sanders then there is reason for Sanders voters to cross over and vote for Trump. Either way, you’re talking about voters casting their lot with someone who’s their philosophical opposite. What’s the rationale for doing that? ◊ ◊ ◊ ABRAMSON AGAIN: “Sanders now has a greatly increased chance of winning all of the remaining Democratic primaries and caucuses. “Sanders was already looking strong in Oregon, West Virginia, Montana, South Dakota, Kentucky, North Dakota and California, but given that he’s within single digits in New Jersey (where Trump is very popular) and performed incredibly well with nonwhite voters in Indiana (meaning New Mexico could be in play), it’s not unthinkable that Hillary Clinton could lose all of the remaining primaries and caucuses and therefore as many as thirteen or fourteen contests in a row to finish the Democratic primary season.” This could happen, but a straight Sanders sweep of all the remaining contests would be a real stretch. It almost presumes that Clinton walks off the field of battle completely, vacating her familiar biography and a formidable ground game in the heartland she’s drawn strength from. She’s way too invested, too deeply entrenched there for that to happen. ◊ ◊ ◊ And anyway, the math still works against Sanders, even if he ran the table from here on in. He’s too far back mathematically to get that much closer to Clinton. And never mind Sanders’ challenge to superdelegates: In The Washington Post, Jonathan Capehart takes Sanders to task for his “insistence that superdelegates choose him over Clinton. As reporters at The Post, NPR and Vox have pointed out, even if superdelegates in states that Sanders won switched from her to him he’d still lose the nomination. And those folks don’t really have any incentive to do so. With Tuesday’s results from the Indiana primary factored in, Clinton now has 3.1 million more raw votes than Sanders. So the superdelegates are already backing a winning candidate.” The one item Abramson may have gotten dead on is the last one, and in some ways the most possibly disturbing: ◊ ◊ ◊ THE DEMOCRATS will have a contested convention, and the Republicans won’t,” Abramson says. “Few saw this coming, but assuming Bernie Sanders maintains his pledge to contest the Democratic convention unless Clinton can get 2,383 pledged delegates by June 14th — which she can’t, barring a miracle — only one of the two major parties will go to their convention divided, and with (not for nothing) the sort of logistical hurdles that come with that. For instance, when does Clinton roll out a Vice Presidential candidate? Before a convention she knows will be contested?” Abramson advances a Chicken Little scenario here, one in which the sky (and everything else) falls in July for the Democrats. And it’s true, if Sanders sticks absolutely to his guns, it’s not just possible, it’s almost a certainty. But this campaign mockup assumes that Sanders himself doesn’t eventually recognize the fragmenting dangers of a contested Democratic convention, and how blowing up the convention in Philadelphia does damage to the drive to keep the White House in Democratic hands. Bernie Sanders has his ideological side, we sure as hell know that by now. But by extension, there’s also a pragmatism about Sanders, a recognition of the difference between that which is navigable, and that which is non-negotiable. It’s a grasp of realpolitik that strongly suggests that when the chips are down, with the White House at stake and the existence of a Trump administration in the balance, he won’t let the perfect be the enemy of the good. One suspects that voters won't, either. ◊ ◊ ◊ With Clinton close-but-not-close-enough to the needed 2,383 delegates between now and the time of the delegate-rich motherlode primary in California, in June, the time’s come to heal the wounds created by four or five months of furious infighting. After four months of constant intraparty bickering going on, Clinton and Sanders both face the serious challenge of Making Nice: not just cosmetic nice but the kind of nice that heals wounds and unifies the divided factions of the party, and sets the Democrats on (hopefully) a course of action that returns them to the White House in November. ◊ ◊ ◊ HEALING THOSE breaches makes a lot of sense, and the sooner the better. During the primary season, Clinton and Sanders could afford to ignore that which is pretty obvious: They haven’t exercised the ability to heal each other in the broken places of their respective campaigns. Reporting on Clinton wins in late April, for example, David Fahrenholt of The Washington Post reported on what for Sanders has been a nagging problem: “For Clinton, Tuesday’s victories in large, urban states reinforced her case against Sanders: that he has not broadened his coalition much beyond white liberals, and that he struggles to win urban areas and populous states.” Goldie Taylor, writing in The Daily Beast back in February, observed much the same thing: “Sanders, the self-professed anti-establishment candidate, has run on a platform that attacks income inequality, as well as promises to expand access to health care and college education. His message has attracted support from mostly white progressives who are convinced that Sanders is the best candidate to carry the Democratic banner in the fall campaign. For them, Clinton represents all that is wrong in Washington. “The problem for Sanders is that he has nowhere to grow. Black voters, who will dominate many of the coming primaries, have not responded to his message. Even black millennials, thought to be good prospects, are breaking in favor of Clinton.” ◊ ◊ ◊ That was in February, and not all that much has changed since then. Sanders has been steadily moving forward in contest after contest after contest; we don’t know how much of his current success might be due to those black millennials coming around. So far, Sanders has found a way to succeed, despite being weak with African Americans, that important constituency of whom black millennials are a vibrant subset. But now it’s crunch time; despite a stream of donations, message and energy, time is the thing Sanders has just about run out of. For black millennials, and the wider African American voter base (a bloc he’d have absolutely needed to win in November), Sanders’ message isn’t penetrating like it has for young white millennials. Clinton is similarly damaged goods to the hordes of voters who’ve been praising Sanders to the skies all year long. To them, Clinton is the ultimate insider pol, someone whose connections to the Washington establishment, deep-pocketed donors with ties to Wall Street and the major banks – to say nothing of her natural ties to the deeply-moneyed Clinton Foundation, founded by husband Bill — estrange her from the lives and predicaments of most of the American people whose favor she’s seeking today. ◊ ◊ ◊ BUT CLINTON has the numbers and much of the momentum towards the nomination. And this isn’t her first rodeo with the velocity of presidential politics; in the end, campaign-trail experience and the benefit of the best brand in Democratic politics give Clinton an edge that Bernie Sanders can’t undercut or exploit. But here’s the rub: Now may be the very worst time for Sanders to close up shop, whether he’s being pushed to do so or not. With nine state primaries and a number of caucuses still to be held — including one in California, the nation’s most populous state —millions of American voters in the politically crucial Western half of the United States would be effectively disenfranchised if Sanders withdraws now. Fewer things would push disaffected Democrats and independent voters away from the Clinton campaign like the feeling, right or wrong, that Sanders was pressured out of the race (which probably explains Clinton’s relative absence of comments about Sanders after his Indiana win [to be expected since she skipped campaigning in the Hoosier State, sending Indiana Democrats a no-show signal that could come back to bite her in the general]). ◊ ◊ ◊ And ironically, for Sanders to pull the plug on his campaign, especially in the wake of an effervescent victory in Indiana, would be to short-circuit its very essence. It would undercut the meme and the meaning of Sanders’ whole campaign — neatly distilled in his post-Indiana intention to “fight until the last vote is cast.” He’s already reckoned with the competition, the consternation over his continuing to run, and with the outcome that’s all but written already. With Sanders, it’s something he can live with. In for a penny, in for a pounding. And why not? Like it or not, in ways that further what democracy is and what democracy means, the Sanders campaign has earned the right to run its course, for better or worse. No Alliser Thorne gets to intervene. In this game for a throne, this year’s Jon Snow must exit by his own hand. Image credits: Sanders as Jon Snow (detail of photo illustration by Emil Lendof/The Daily Beast). Super Bernie: Creator unknown. Clinton-Sanders photo illustration: via salon.com. Clinton lower: CNN. Shameless Self-Promotion II America from 2004 to 2009 – its new ironies and old habits, its capacity for change – is topic A in this collection of essays and blog posts on popular culture, the Iraq war, Hurricane Katrina, a transformative election, and the first 100 days of the Obama administration. \| Now available at Authorhouse shameless self-promotion One nation subject to change: A collection of topical essays exploring television, hip-hop, patriotism, the use of language under Bush II, and the author's own reckoning with mortality. \| Available at Authorhouse A veteran journalist, producer and blogger, Michael Eric Ross is a frequent contributor to the content channels of Jerrick Media, and a periodic contributor to TheWrap, a major online source of entertainment news and analysis. He writes from Los Angeles on the arts, politics, race and ethnicity, and pop culture. A graduate of the University of Colorado, he's worked as a reporter, editor and critic at several newspapers and websites, including The New York Times, the San Francisco Chronicle, the San Jose Mercury News, MSN, Current and NBCNews.com. He was formerly an adjunct professor at the Columbia University Graduate School of Journalism. His writing has appeared in The New York Times Book Review, Wired, Entertainment Weekly, PopMatters, Salon, The Root, seattlepi.com, NPR.com, theGrio, BuzzFeed, Medium and other publications. Author of the novel Flagpole Days (2003); and essay collections Interesting Times (2004) and American Bandwidth (2009), he contributed to the anthologies MultiAmerica (edited by Ishmael Reed, 1997) and Soul Food (2000).
"History prefers legends to men." "It prefers nobility to brutality." "Soaring speeches to quiet deeds." "History remembers the battle and forgets the blood." "Whatever history remembers of me, if it remembers anything at all... it shall only be a fraction of the truth." "For whatever else I am, a husband, a lawyer... a president..." "I shall always think of myself as a man who struggled against darkness." "I leave in your trusted hands, my dear friend Henry... this record that begins when I was just a boy." "Get on down there." "Hurry it up!" "Please, sir, no." "There's been some kind of mistake." "I ain't no slave." "Let them go!" "Aaron!" "Go back inside!" "Let them go!" "Will!" "Quiet!" "He's my friend!" "Look away, Abraham." "It's not our place." "Look away." "Abraham!" "Thomas, help them!" "Leave him alone!" "Are you all right?" "Did you strike my friend here?" "He was beating my son!" "Did you strike him, Lincoln?" "They're not slaves, and you know it." "I suggest you get back to your work before you find yourself led away in chains." "Until every man is free, we are all slaves." "Very well, then." "Since you're all so concerned with freedom... you may consider yourself free from the burden of my employ." "And the debt you've been working off..." "I'd like it paid in full with interest." "Now, please." "If you get one more penny from me, Mr. Barts... it will come with a fist wrapped around it." "All right, Mr. Lincoln." "There are other ways to collect a debt." "No!" "What's happening to her, Father?" "Please help her!" "Please, I beg of you." "You've got to do something, Father." "Easy, child." "Look away, Abraham." "I've never seen anything like this." "Strange." "You promise me." "Let's step outside." "I'm sorry, I don't know what ails her." "Abraham." "Come and lie next to me." "I've been writing, Mama." ""Days are swift as an Indian arrow..." ""flying like a shooting star." ""The present day is here..." ""and then slides away in haste..." ""that we can never say is ours..." ""but only say..." ""is passed."" "Mother?" "Mother?" "Mama once told me that I hadn't cried when I was born." "That I'd simply opened my eyes... looked at her smiling face..." "and smiled back." "My light was gone." "I don't know how he did it" "Abraham... you promise me..." "You promise me you won't go and do anything foolish." "Nine years later, my father joined her in death." "No longer bound by my promise..." "I tried to fortify the nerve to pursue my vengeance." "Haven't you had enough?" "A boy only gets this drunk when he wants to kiss a girl... or kill a man." "Adam, let me explain." "Last one, Barts." "I'm not coming up here to clean up your messes anymore." "Yes, sir." "I promise." "Every so often, I think about what it would be like to be in the South." "So, where's Henry?" "Yes, sir." "We've been looking all over, sir." "Searching high and low." "Low is more likely." "Just find him, Barts." "Oh, and send a fresh crop south." "We have a lot of mouths to feed." "Yes, sir." ""Yes, sir, no, sir." "High, sir, low, sir."" "For my mother." "That was unlucky." "Might have put me out of my misery." "Where the hell are you running to?" "Don't much like chasing chickens." "Little boy, all grown up." "Come to avenge his dear momma." "There are two kinds of men, Mr. Lincoln." "Those that have the guts to pull the trigger... and those who do not." "Powder, patch, ball." "Don't mess it up." "You weren't asleep that night." "Were you?" "You dropped the ball, Mr. Lincoln." "Your mama's blood was sickening sweet." "I hope yours tastes better!" "Might I suggest that we begin by... closing the door?" "Yeah, I'm sorry." "I didn't see anything!" "Should we dive right in?" "Or are you finding Gabrielle's egress too distracting?" "I'm sorry, sir, but who are you?" "Who I am is Henry Sturges." "And where you are is my home." "And what happened..." "I saved your life... during your rather pathetic attempt at taking another's." "What were you doing there, and... how did you know I would try to kill Barts?" "How?" "I watched this boy carry out his first long-awaited mission." "Drunk, might I add." "And I think, "You have wasted your time watching this one, Henry." ""He's not a promising recruit." ""He is just a selfish boy with his heart set on vengeance."" "And I realized, "This boy is a goddamned idiot!"" ""I doubt he even knew his target was a vampire."" "A vampire?" "Yes." "Immortal, blood-sucking demons." "Fortunately for you, Mr. Lincoln... hunting them is something of a hobby." "But vampires are just myths." "Myths don't beat you senseless after you've put a bullet in their brain." "Thank you." "No, Mr. Lincoln, vampires are real." "They exist in every city and every state... in the Union." "If what you say is true, you could help me kill him." "I could pay you to kill him!" "My services are not for sale." "And the word you are looking for is "destroy."" "It is quite a feat to kill that which is already dead." "But you don't understand." "My mother was murdered." "And if I teach you how to murder her murderer... so what?" "How will that honor her memory?" "How will that benefit the next boy whose mother is taken?" "If vengeance is all you seek... seek it elsewhere." "Teach me to fight as you do." "Please, I'll do anything you say." "You promise to cast aside all notions of vengeance... and commit to the life of a hunter?" "You will have no friends... no family." "I told him what he wanted to hear... but all I cared about was killing the monster that took my mother." "I'm in." "Scottish Highland pistol." "And if one barrel isn't enough... seven should do you." "The blunderbuss." "And if you lose your ball... you can always stuff your pocket watch down the end of it." "So, Abe... which one takes your fancy?" "Actually, I haven't had the best of luck with shooting irons." "But..." "I was a rail splitter." "I would like you to chop this tree down with a single swing." "That tree?" "It's got to be more than a foot across." "That's impossible." "But it isn't a tree." "It's what you hate most in the world." "So, tell me, Mr. Lincoln... what do you hate?" "I hate Jack Barts." "Then strike him down." "Well, clearly you don't hate him that much." "Tell me what you hate." "I hate that my mother was taken away." "Inadequate." "I hate that we were afraid." "And?" "That my mother and father, everyone that we knew... lived in fear." "Pathetic." "I hate that I was too small." "Too weak." "Yes." "And that you failed..." "Yes!" "...to protect her." "Yes!" "And that you let her die." "Power, Lincoln... real power... comes not from hate, but from truth." "Before you protect others from darkness... you must first be able to protect yourself." "Your enemies have the power to render themselves invisible." "You must have the ability to fight blind." "To see, without seeing." "Again." "In the weeks that followed..." "Henry endeavored to impart a lifetime of vampire-hunting secrets." "Their ability to adapt to sunlight." "Their power to render themselves invisible." "But most of all, he taught me how to destroy them." "When Judas betrayed Jesus... his reward was 30 pieces of silver." "At that moment, those pieces became a symbol of betraying God." "Of evil." "And silver became a curse... upon the cursed." "You will never see a vampire with silver on his person." "Nor see them reflected in mirrors." "The one thing God placed beyond the reach of a vampire." "The one thing he can never possess." "Barts..." "And the only thing that renders him powerless." "Henry, Jack Barts!" "I give you the targets." "That was our deal." "This is not only about Jack Barts." "Vadoma, a ruthless enforcer." "And her brother." "I've seen him before." "I saw him with Jack Barts." "They call him Adam." "He, from whom all others are made." "Vampires have been in the New World for centuries." "Slaughtering native tribes and early settlers." "But when the Europeans arrived with their slaves... the dead saw a sinister opportunity." "They built an empire in the South." "But, in recent years, they pressed north... leaving death in their wake." "It falls to us, Abraham... the hunters, to keep the balance." "To ensure that this remains a nation of men... and not monsters." "What we do, we do not for one man... but for the good of all mankind." "Henry sent me off into the world with a reminder." "No attachments." "No distractions." "No friends or family." "Besides, who could I trust?" "Anyone in this well-mannered city might very well be one of them." "Son of a bitch!" "I ever see you here again, I will have your balls as a coin purse!" "Good afternoon, sir." "Joshua Speed at your service." "Abraham..." "Lincoln." "I need a bit of help." "All right." "Well, a friend in need, is a friend of Speed." "What can I get for you?" "I don't suppose you know of any rooms for rent, Mr. Speed?" "What sort of room are you looking for, Mr. Lincoln?" "Well, a cheap one... as I have spent all of my money on law books and have none to spare at the moment." "Now, as you say you have none, am I to take your meaning as "cheap"... or "free of charge"?" "Well, on credit." "I don't think you'll find such a room in Springfield." "People here are strangely accustomed to being compensated." "Good day." "There is one room, Mr. Lincoln." "I was recently forced to part ways with a thieving prick of an associate... and am, therefore, in need of a replacement." "There's a room upstairs." "It isn't much, but I suppose it could be had on credit... if the tenant were willing to work here in return." "Dear Henry... life in Springfield is less than desirous." "Fear not." "My pittance of a salary doesn't allow me to deviate from your rules..." "No friends, no family." "And certainly, no woman would find me, and my existence, enticing." "Excuse me." "Excuse me, I'll be needing these." "Just one second, ma'am." "Well, you needn't call me ma'am, as if I'm some haggard spinster..." "I'm sorry, ma'am." "Madam..." "I mean, miss." "I'm Abraham..." "Lincoln." "Mary Todd." "Darling." "There you are." "You mustn't flit from store to store so quickly." "Well, perhaps if you didn't stop to jaw with every gentleman in Springfield..." "I could say the same for you." "Stephen Douglas." "How do you do?" "Abraham..." "Lincoln." "Are you a voting man, Mr. Lincoln?" "I..." "How do you feel about keeping slavery out of Illinois?" "I'm running for the legislature." "I'm sure he'd love to hear your campaign speech... but Mr. Lincoln was just about to attend to my list." "We were talking, dear." "Slavery, it's a complicated issue." "I couldn't disagree with you more, Mr. Douglas." "Mr. Douglas, Miss Todd." "You have met my new associate, Abraham." "A letter came for you." "Dear Abe." "Your prescription awaits you at the local pharmacy." "Ask for Aaron Stibel, Junior." "Mr. Lincoln?" "I'm so sorry." "Good day of work, Abraham." "Thank you." "But don't forget... always have a contingency plan." "Aaron Stibel Junior?" "Yes?" "That's it." "Oh, that's tight." "Don't worry." "It will only hurt for a second or two." "Did you eat today?" "I had killed a monster." "And I would kill again." "But no amount of death could make me forget." "Merciful Christ, Lincoln, what happened to your face?" "Don't worry, I'll still be able to work." "Work?" "To hell with work." "We got invited to a ball." "It could be your chance to save Mary Todd from a life of boredom." "This suit makes me look ridiculous." "Nonsense." "But that hat makes you look ridiculous." "Come on." "Come on, come on." "Look, there she is." "Mr. Douglas, Joshua Speed." "Pleasure to see you." "Mary, you look lovely." "He's still missing." "Who's that?" "Aaron Stibel." "Junior or Senior?" "Junior." "Who is that man?" "I don't know." "Mr. Douglas, you know Senator Nolan, of course." "Yes, Stephen." "Good to see you." "Have you heard this news?" "Yes, we're looking into it." "Rest assured, this kind of lawlessness... won't stand in the noble state of Illinois." "It's called a dance." "If we were meant to sit alone, they would've called it something else." "Yes, I suppose they would have." "Come, Mr. Lincoln." "You'll ruin the upholstery if you sit there any longer." "I'm sure you're a very nice man, Mr. Lincoln... but you're a..." "A shopkeeper, in a borrowed suit." "No, it's not a matter of means." "Really, no." "I came to Springfield looking for someone different." "Someone whose life was a bit more adventurous, and well..." "My apologies, I'm never this" "Honest?" "Rude." "Miss Todd, may I speak candidly?" "I, too, came here to better myself." "That's why I've taken an interest in the law... and why, if I may be so bold, I have taken an interest in you." "And as for the adventure that you seek..." "I suspect that few men could ever hope to provide that for you." "Least of all your fiancГ©, Stephen Douglas." "Mr. Lincoln, you are full of surprises." "Miss Todd, you have no idea." "Dear Abraham." "I've made a deposit at the local bank." "Be careful, it can quickly disappear." "Henry, there are more than I ever thought possible." "Pharmacists, innkeepers, pastors." "It's more than a man can bear." "Well, I see I'm such interesting company." "I'm sorry." "I've been working nights." "Really?" "Is that true?" "Do you really want to know the truth, Mary?" "Each and every night..." "I go out... hunting vampires." "Well, how do you hunt these vampires?" "With an axe." "A special silver axe, of course." "Of course." "And how many would you reckon you've killed?" "Five." "No... six." "I have killed six vampires." "My goodness!" "Abe!" "Here I thought you were an honest man." "Really!" "Well, I had a wonderful day, Abe." "As did I, Mary." "Miss Todd, you are a woman of ravishing resourcefulness." "Mr. Lincoln, you have no idea." "You will have no friends, no family." "I... should be going." "It's late." "How could I bring her into this world?" "A world of demons, of danger." "Good night, then, Lincoln." "Good night, Mary." "Happy hunting." "If I truly cared for her... the kindest thing I could do... was walk away." "This hunter is another of Henry's disciples?" "They say he's a madman." "I can't wait to meet him." "A stock boy, reading a law book." "What?" "You studying to be a lawyer?" "As a matter of fact, I am." "All right, what about a little test?" "What's the law for free slaves in the North?" "According to the Fugitive Slave Act of 1793... enforcing Article four, section two, of the United States Constitution..." ""All runaway slaves must be returned to their owners."" "However, personal liberty laws state that..." ""Anyone who is born free..." ""cannot be taken under this act."" "I heard a good woman once say..." ""Until all men are free..." ""we're all slaves."" "Will?" "Will Johnson!" "How did you...?" "I was back home... and heard you moved here." "Studying to be a lawyer." "That's good." "I'm in need of a good lawyer." "What, are you in some kind of trouble?" "I was freeing slaves down South on the railroad... hoping to find my brother down there." "Some bounty hunters got after me." "Said I was a runaway." "I need a writ, Abe... saying I was born free." "You know, Will..." "Come on." "Hey." "Speed, this is Will Johnson." "Will Johnson, my oldest friend in the world." "The store isn't going to run itself, Abe." "I'll have him back as soon as possible, Mr. Speed." "I promise." "You're getting tall, Abe." "Look like you still don't eat much, either." "You still afraid of the dark, too?" "Not so much anymore." "That's him, Abe." "That's the guy that's been chasing me." "Gentlemen, gentlemen, gentlemen..." "I'm sure we can work this out." "Now I suggest you walk away, son." "No, sir, I suggest you do." "I've sent word to Senator Nolan." "He'll have you out soon." "You're far too kind, Miss Todd." "And he's far too ugly to have a woman like you." "I think common-looking people are the best in the world." "That's why the Lord makes so many of them." "I just thank God he was there." "But I won't always be there." "Mary... what if something was going on, something terrible... and you knew that there was no way on earth that one man could stop it?" "What would you do?" "Well..." "I wouldn't back away from what's right just because it's hard." "My father used to say, "Plant your feet and stand firm." ""The only question is where to put your feet."" "We may fail in this fight." "We may only shatter the tranquil veil of oppression... but we must not be deterred!" "For ours is a just and noble cause." "The cause of freedom." "The very cause upon which our founding fathers built... this great nation!" "A voice like that is too strong to be stuck keeping shop." "I'm actually studying to be a lawyer." "Well, Mr. Lincoln, maybe it's time you thought about politics." "I can connect you with the right people." "Thank you, Senator Nolan." "A pleasure young man." "The same." "You're on your way, Mr. Lincoln." "I sent you to Springfield to hunt vampires... not to chase votes." "Lesson one, always have a contingency plan." "If vampire hunting doesn't pan out..." "I need a career to fall back on." "I'm being serious." "So am I, Henry." "I have done everything you've asked of me." "Every letter, every name... but never the letter I wait for, and never the name I want most." "When do I get to kill Jack Barts?" "Barts knows about Mary." "It's time." "Abraham..." "Be careful." "Abraham-fucking-Linc" "Missed again!" "I hope you're better with an axe than you were with a gun." "Come on, Lincoln!" "Catch me before I get to Mary." "Catch me if you can, boy!" "There's thousands of us here." "He won't stop until this whole country is ours." "And they be coming for you now." "Ask your friend, Henry." "You shut your mouth, you stupid whore." "Give me what I need, or I'll knock your teeth out." "You lying son of a bitch." "God damn it!" "No, Abe, stop!" "You weren't ready to know." "What, that you are a vampire?" "You are not the only one... who has lost everything to vampires." "Just because the carriage stops... doesn't mean we have to." "Get in the carriage." "Take this." "Run." "Just run." "Henry!" "Her soul was pure." "But yours, Henry..." "It's one of God's little tricks." "Vampires cannot kill their own kind." "Only the living can kill the dead." "Welcome to the family." "You can't save the world, and the ones you love, Lincoln." "You need to make a choice." "I'm sorry... but goodbye." "Abe!" "Mary!" "What on earth are you doing?" "Come on in." "What are you hiding?" "Nothing." "Abe?" "It's nothing." "Abe, I know when you're lying." "What are you hiding from me?" "All right." "I didn't want to tell you this way." "This is not the way that I planned it." "But if you really must know..." "Mary Todd... will you make me the happiest of men?" "And do you, Abraham... promise to love her, comfort her... be honorable and honest with her in all things... in sickness and health... till death do you part?" "I do." "Then by the power vested in me by almighty God... in the great state of Illinois..." "I now pronounce you... man and wife." "You may kiss the bride." "Your mother would be so proud." "Thank you, Will." "I'm happy you could be here." "You're the only family I have." "Except for this one." "Congratulations." "May I introduce Mr. Henry Sturges." "My wife, Mary." "And my dear friend, Will Johnson." "Heavens, Mr. Sturges, you're as chilly as the winter wind." "Henry, please." "I'm afraid that's a hazard of carrying one's own bottle." "Well, you know what they say, "Cold hands, warm heart."" "Yes, but I highly doubt that." "Mr. Sturges is a business associate." "Yes, I thought we could talk a little business." "Of course." "If you'll excuse me." "What the hell are you doing here?" "Be cautious, Abraham." "One forgets how easily we can lose the most precious things." "They don't even know who I am." "Go upriver." "Invite this Mr. Lincoln to join us at the plantation." "We're going to throw a ball in his honor." "What makes you think he'll accept?" "I think we can find a way to tempt him." "It's a good book." "It's good." "Get him!" "Abe." "We've got a problem." "They took Will." "What are you going to do?" "I'm going to accept his invitation." "Speed deserved to know the truth of what we were about to face." "I told him everything." "Not knowing if he would believe me or think me mad." "Not knowing if he would have the courage to face the monsters... that I had come to know." "You and me, Abraham, together we can accomplish anything." "There are no slaves." "Where are they?" "I was just wondering that." "Something isn't right about this, Abe." "Yeah." "I don't know how to dance." "Don't worry, I'll teach you." "Wait here." "Ladies and gentlemen... dinner is served." "Bravo, Mr. Lincoln." "Bravo." "You're even better than I'd heard." "A shame to sacrifice so many of my best men... but I needed to know if you're up to the task." "What do you want with me?" "To see you liberated." "To see you rise up and destroy your oppressor." "That's interesting advice, coming from a slave owner." "Men have enslaved each other... since they invented gods to forgive them for doing it." "I've seen Jews build Egypt's glory." "Seen Christians... thrown to lions with my own eyes." "And I've seen Africans sell their own kind to Europeans." "May I share one of the revelations of my 5,000 years?" "We're all slaves to something." "I, to eternity." "You, to your convictions." "Others, to the color of their skin." "All I ever wanted... was to see my kind granted their rightful place." "But there are those of us, those like your friend Henry... who enjoy living in the dark." "And as you're doubtless aware..." "I cannot personally destroy him, nor he I." "You, Mr. Lincoln... you could eliminate those last pockets of resistance... beginning with Henry Sturges himself." "All I ask... is for you to break your chains." "Kill your master." "Be free." "And if I refuse?" "Then you go on your merry way." "After I make you one of us, and... spoon-feed you your friend." "Now, a simple "yes" or "no" will suffice." "Kill Henry... save your friend." "Feel free to take your time to decide." "Five... four... three... two... one." "Come on!" "This way." "Miss Tubman, Miss Tubman." "We've been waiting for you." "Come quickly." "People getting killed every day." "Slaves disappearing." "Some people talk about monsters and demons." "Good morning." "Good morning." "How can I assist you on this beautiful day?" "We're looking for three men." "You know, I did see someone run down that way." "You're welcome to come in if you like." "Our service is about to begin." "Right, let's keep going." "I take it y'all came from up North?" "Yes, ma'am." "Well, I suggest you get back there as fast as you can." "There's a war coming." "A war for the soul of the country." "Going to be all colors of blood spilled." "Our nation was built on the backs of slaves." "Their labor, their blood." "More blood than you could possibly imagine." "I have seen this horror of the South firsthand." "I say the need for peace outweighs the needs of the Blacks." "I say that if the people of this great nation want slavery... then let them have it." "The demon of slavery is tearing our country apart." "We must stand up." "We must stand strong and fight." "Fight for the very soul of our nation." "Until every man is free, we are all slaves!" "You cannot take on slavery, Abraham." "You cannot take on the whole South!" "Why, because of Adam?" "No." "Are you afraid of him?" "Because it is the only thing that has kept them sated for all these years... and you take that away, then no one is safe." "So you get to choose who lives and who dies." "A great man once said..." ""What we do, we do not for ourselves..." ""not for one man, but for the good of all mankind!"" "Not all mankind, Abraham." "Abe?" "May I have my husband back?" "He's all yours, Mrs. Lincoln." "Henry only saw the struggle his way." "But I began at last to see it another." "To see and to feel the even greater issues at stake." "So, he and I would go our separate ways." "As the Bible says... the time had come for me to put aside childish things." "I would fight not with an ax... but with words and ideals." "For a time... they proved a stronger weapon." "Lincoln!" "Lincoln!" "Lincoln!" "I appear before you to take, in your presence... the oath prescribed by the Constitution of the United States... to be taken by the president... before he enters on the execution of this office." "The question of slavery is better settled with a pen than with a sword." "Fire!" "Through twists of fate..." "I found myself at 50 years of age... the father of a nation that was tearing itself apart... while trying to be the father to a boy... not much older than I was when I lost my mother." "3,000 more dead." "When's the last time you had something to eat?" "I'm not hungry, thank you." "You have got to eat, Abe." "You're only human." "Come along, Willie." "Willie." "Willie." "If you do this, there is no turning back, Abe." "I know." "I'm trying to protect the freedom of a nation." "If this war is truly a stand against evil... then let it stand for something." "If it is a war for the freedom of man... why not give all men a reason to fight it?" ""All persons held as slaves..." ""within any state or designated part of a state..." ""the people whereof shall be in rebellion" ""against the United States shall be then..."" ""...and henceforward shall be free."" "Good morning." "Precious little one... what's your name?" "Willie." "And your father?" "What's his?" "Abraham." "What a beautiful silver sword." "How is our little soldier faring?" "I've never seen anything like it." "I'm sorry." "I don't know what ails your boy." "Abe." "Mary's calling for you." "I'm so sorry, Abraham." "Why didn't they take me?" "Because they know... it is a fate much worse than death." "Mary... is inconsolable." "She says she doesn't want to go on without him." "There is a way, Abraham." "You know that I can restore the dead." "Do it." "Do it." "Mary..." "Do it!" "Your journal... the one you always kept in your coat pocket..." "I know I shouldn't have, Abe, but I needed to know what you were hiding." "If what you say is true..." "I beg you... give us our little boy back." "Mary, he wouldn't be our little boy." "He would be something else, something terrible." "Trust me, you don't want that." "You're asking me to trust you?" "After you lied to me for all these years." "I did it to protect you, to protect our family." "And how did that work out?" "You did this, Abe!" "You did this!" "You brought this on him!" "You brought this on our boy!" "Let me go to them." "Make a truce with Adam." "We must stop this war." "Willie's death is just the beginning." "Don't you dare say his name." "I warned you." "You didn't heed me." "How many more boys will have to die before you listen to me?" "These boys are dying in vain." "We should pull the troops back." "Abraham, this war has cost us countless lives... not to mention millions of dollars." "I thought we were going to make this country great... not tear it apart." "This is the only way we can save the country now, Speed." "Send in troops." "Union troops are flooding onto the field." "We are now outnumbered... and ill-equipped compared to the North." "We will support you... but you will need to support us." "No, thank you." "Rest assured, Mr. Davis... you'll have as many of my kind as you need." "Fire!" "Fire!" "Ready!" "Aim!" "Here they come!" "Fire!" "Why did they drop their rifles?" "Fire!" "It's the first day of Gettysburg." "It's been a disaster." "I don't think the army can survive another." "If the rebels break through, they'll be here... in days." "The generals think we should evacuate Washington." "Run the war from New York or..." "Boston, if need be." "You have to win this war." "If you don't, then all of it..." "Then our son's death will have been for nothing." "How can I win a war... when I can't even protect my own family?" "Our men have no way of defending themselves against this enemy." "When our bullets are useless, our bayonets are powerless as this fork!" "This..." "Will!" "Speed!" "This." "This is what we need." "A fork." "Silver." "Okay, okay." "How much do we need?" "All of it." "And why tell me this, Mr. Speed?" "Why betray your friend?" "He is my friend, but I love this country even more." "And he, more than anyone, is responsible for tearing this nation apart." "You've done the right thing." "I know." "32, 33, 34, 35..." "That is a lot of silver, Abe." "Now, how are we going to get all this there?" "I'm sorry, Mary." "I'm sorry I've kept you in the dark all these years." "I need you, Mary." "I've waited a long time to hear you say those words." "I want you to leave Washington, Mary." "Miss Tubman, please have some tea." "I very much appreciate you coming to speak with me today." "Oh, yes." "Things have not been easy, what with my..." "The death of my son and the war." "I need to get out of Washington." "And I need a lot of help." "This war ends tonight." "And with it... our millennia of darkness." "We have to do this on our own." "No one can know what's on that train." "If we don't get those weapons to those boys at Gettysburg... the war is over." "It's time we had a nation of our own." "Come... we have a train to catch." "It's 80 miles from here to Gettysburg." "Eighty miles will decide whether this nation belongs to the living... or the dead." "Is everything all right, Speed?" "I just can't believe you're still writing in that book." "It's all in here, Speed." "The good with the bad." "What's this?" "They're fleeing the nest." "Leaving Washington free for us." "Look at me." "I said look at me." "Leave her." "Don't want to miss this train." "Let's go." "Henry, what the hell are you doing here?" "I just wanted to see how far your foolishness would take you." "I don't have time to argue!" "I didn't come here to argue with you." "I came here to tell you that your dear friend Speed back there... is a traitor." "He betrayed you, Abe." "Speed is leading you" "You have no idea what you're talking about." "That's all according to plan." "You must get off this train." "No, you must get off this train." "This is not your war, Henry." "They're here, Abe." "A whole heap of them." "We can't let them stop this train." "You go through there and you're dead." "Get out now, it's your last chance." "Did you load that thing?" "We've got to keep them away from the locomotive." "Why don't you let him go, Lincoln?" "Emancipate yourselves." "I will never follow you." "You don't have to follow me, Abe." "I have the train." "I have the silver." "Soon I'll have the whole country." "I'm going to destroy the myth of Abraham Lincoln... so that history will forever know you not as a man... but as a monster!" "Lincoln set us up." "We've been tricked, Adam." "There is no silver on this train." "Abe!" "Abe!" "Abe!" "Hello, Speed." "Where is the silver?" "Silver?" "Should be here." "Why did you lie to me?" "To get you all in one place... to finish you." "Speed?" "No!" "Mr. President!" "There is nowhere left to run, Lincoln." "Where is it?" "Where is the silver?" "Right here!" "Thank you, Henry." "I suppose some vampires can be trusted." "As can some men, Abraham." "If the train was a decoy... where is the silver?" "This isn't the only railroad." "A wise man once taught me... always have a contingency plan." "Get me more!" "Bayonets." "Bayonets for Springfield muskets." "Springfield muskets!" "Five-pounders and grenades are in the second wagon in the back." "Go now, go now." "Fire!" "Four score and seven years ago... our fathers brought forth on this continent... a new nation conceived in liberty... and dedicated to the proposition... that all men are created equal." "Now we are engaged in a great civil war... testing whether that nation or any nation... so conceived and so dedicated... can long endure." "It is for us, the living, rather... to be dedicated here... to the unfinished work which they who fought here... have thus far so nobly advanced." "It is rather for us to be here dedicated... to the great task remaining before us... that from these honored dead we take increased devotion to that cause... for which they gave the last full measure of devotion... that we here highly resolve that these dead... shall not have died in vain... and that this nation, under God... shall have a new birth of freedom... and that government... of the people, by the people, for the people... shall not perish from the earth." "Our enemies have made their exodus." "Some back to Europe... some to South America and the Orient." "They've seen that America shall forever be a nation of living men... a nation of free men." "We make rather a good team, you and I." "One can't help but think of all the good we could do if we had more time." "Limitless time." "Lincoln!" "Yes, well, time waits for no man." "We're going to be late for the theatre." "Hold onto this for me, Henry." "Mary, darling... have you seen my hat?" "It's on your desk in the office." "Have you seen my hat?" "Abraham, let me make you immortal." "Let us fight through the ages, side by side." "Vampires are not the only things that live forever." "History prefers legends to men." "It prefers nobility to brutality." "Soaring speeches to quiet deeds." "History remembers the battle... and forgets the blood." "However history remembers me, if it does at all... it shall only remember a fraction of the truth." "One more." "A guy only gets that drunk when he wants to kiss a girl or kill a man." "So, which is it?"
You can forgive the Florida Panthers for feeling a tad gloaty this week. After all, they hadn't won a Division title in 18 years (i.e., ever), and they hadn't earned a playoff spot in 12. More than that, there were few who thought they were going to do either of those things this year, and then they went out and did them both. Monday, the Panthers devoted this video to the experts who said they would finish last in the Southeast. I can't hear this song without imagining the cast of Freaks and Geeks on photo day. For what it's worth, the unattributed quotes all come from George Richards of the Miami Herald and Harvey Fialkov of the Sun-Sentinel, the Panthers' two beat writers. Take that, only people kind enough to cover us! You can see why Richards and Fialkov might have been skeptical, even now. The Panthers' Division title bid was helped by the fact that the two teams projected to compete for the Southeast title completely crapped the bed. And it definitely doesn't reflect well that Florida's minus-24 goal differential is three times worse than the only other playoff team on the wrong side of the statistic: their divisional rivals in Washington. Furthermore, despite contending most of the year, the Panthers backed into the playoffs, with only one regulation win in their last 10 games. But still, let this be a lesson to you. Believe red, or the Panthers' marketing team will make you bleed it (emotionally). s/t Kukla's Korner.
<div class="main-body-div" id="main-box"> <div class="container-fluid"> <div class="row"> <div class="col-lg-12 col-xs-12"> <!-- Main Body Content --> <h2 class="page-title bg-primary">DevOps: Summary</h2> <!-- inner body --> <div class="inner-body panel"> <h4 class="sub-heading">Summary</h4> <p>In this lesson you learned -</p> <ul class="edited-ul"> <li>the basic components and tools of a deployment pipeline</li> <li>how to describe DevOps - in terms of applying organizational, culture, tooling, and process changes to increase feedback loops</li> <li>the patterns of effective DevOps culture through Westrum's organizational models and behaviors</li> <li>how teams that embrace DevOps organize to reduce silos and increase feedback</li> <li>one of the primary <em>methods</em> for embracing DevOps: Continuous Delivery, and how to you can implement an assemnbly line for regualrly delivering software to users to increase feedback</li> </ul> </div> </div>
Q: Mongoose Trying to open unclosed connection This is a simplified version of the problem, but basically I'm trying to open 2 mongodb connections with mongoose and it's giving me "Trying to open unclosed connection." error. Code sample: var db1 = require('mongoose'); db1.connect('my.db.ip.address', 'my-db'); var db2 = require('mongoose'); db2.connect('my.db.ip.address', 'my-db'); db2.connection.close(); db1.connection.close(); Any idea how to make it work? A: connect() opens the default connection to the db. Since you want two different connections, use createConnection(). API link: http://mongoosejs.com/docs/api.html#index_Mongoose-createConnection
Mount Jo Mount Jo is a 2876-foot (877 m) mountain in the heart of the Adirondack Mountains of New York. It is located in North Elba, New York on land owned by the Adirondack Mountain Club. The Adirondack Loj and Heart Lake are located at the foot of Mount Jo. There are two trails that lead to its summit. A steep but short and relatively easy hike compared to other mountains in the area, the Mountain offers great views of the High Peaks region, including Cascade Mountain, Mount Marcy, Algonquin Peak, Mount Colden and Indian Pass. It is located near Heart Lake in North Elba. The climb offers one of the best views for the effort (a 710-foot (216 m) vertical ascent from the Loj - actual trail distance is approx. 2.6 miles roundtrip), with a sweeping vista of the Great Range of the Adirondacks. It is seven miles (11 km) south of Lake Placid. The mountain was named in 1877 by Henry Van Hovenberg, who built the original Adirondack Loj, for his fiancée Josephine Schofield, who died shortly before they were to have been married. References External links Summit Post Category:Mountains of Essex County, New York Category:Tourist attractions in Essex County, New York Category:Mountains of New York (state)
In the United States Court of Federal Claims OFFICE OF SPECIAL MASTERS No. 15-944V Filed: October 26, 2016 * * * * * * * * * * * ** UNPUBLISHED KELLY LEDFORD, * * Petitioner, * Special Master Gowen * v. * Joint Stipulation on Damages; * Influenza (“Flu”) Vaccine; SECRETARY OF HEALTH * Transverse Myelitis AND HUMAN SERVICES, * * Respondent. * * * * * * * * * * * * * * * Paul R. Brazil, Muller Brazil, LLP, Dresher, PA, for petitioner. Camille M. Collett, United States Department of Justice, Washington, DC, for respondent. DECISION ON JOINT STIPULATION1 On August 28, 2015, Kelly Ledford (“petitioner”) filed a petition pursuant to the National Vaccine Injury Compensation Program.2 42 U.S.C. §§ 300aa-1 to 34 (2012). Petitioner alleged that as a result of receiving an influenza (“flu”) vaccine on October 14, 2014, he developed transverse myelitis. Stipulation at ¶¶ 2, 4. On October 25, 2016, the parties filed a stipulation in which they state that a decision should be entered awarding compensation. Respondent denies that the influenza immunization is the cause of petitioner’s alleged transverse myelitis or any other injury or condition. Stipulation at ¶ 6. Nevertheless, the parties agree to the joint stipulation, attached hereto as 1 Because this decision contains a reasoned explanation for the undersigned’s action in this case, the undersigned intends to post this ruling on the website of the United States Court of Federal Claims, in accordance with the E-Government Act of 2002, 44 U.S.C. § 3501 note (2012) (Federal Management and Promotion of Electronic Government Services). As provided by Vaccine Rule 18(b), each party has 14 days within which to request redaction “of any information furnished by that party: (1) that is a trade secret or commercial or financial in substance and is privileged or confidential; or (2) that includes medical files or similar files, the disclosure of which would constitute a clearly unwarranted invasion of privacy.” Vaccine Rule 18(b). 2 The National Vaccine Injury Compensation Program is set forth in Part 2 of the National Childhood Vaccine Injury Act of 1986, Pub. L. No. 99-660, 100 Stat. 3755, codified as amended, 42 U.S.C. §§ 300aa-1 to -34 (2012) (Vaccine Act or the Act). All citations in this decision to individual sections of the Vaccine Act are to 42 U.S.C.A. § 300aa. 1 Appendix A. The undersigned finds the stipulation reasonable and adopts it as the decision of the Court in awarding damages, on the terms set forth therein. The parties stipulate that petitioner shall receive the following in compensation: a. A lump sum of $85,000.00 in the form of a check payable to petitioner. This amount represents compensation for all damages that would be available under 42 U.S.C. § 300aa-15(a). Id. at ¶ 8. The undersigned approves the requested amount for petitioner’s compensation. Accordingly, the clerk of the court SHALL ENTER JUDGMENT in accordance with the terms of the parties’ stipulation.3 IT IS SO ORDERED. s/Thomas L. Gowen Thomas L. Gowen Special Master 3 Pursuant to Vaccine Rule 11(a), entry of judgment is expedited by the parties’ joint filing of notice renouncing the right to seek review. 2
2015 - The Blue Jay in My Tree Found this Blue Jay nest in my back yard when I was standing a few feet from it and the Momma bird squawked so loud, I jumped and ran. Crept back and found the nest about 10 feet from the back of my house not too high up in a Yaupon bush. Eventually discovered 3 babies in the nest. They left one day and never came back.
Integrating molecular and ecological approaches to identify potential polymicrobial pathogens over a shrimp disease progression. It is now recognized that some gut diseases attribute to polymicrobial pathogens infections. Thus, traditional isolation of single pathogen from disease subjects could bias the identification of causal agents. To fill this gap, using Illumina sequencing of the bacterial 16S rRNA gene, we explored the dynamics of gut bacterial communities over a shrimp disease progression. The results showed significant differences in the gut bacterial communities between healthy and diseased shrimp. Potential pathogens were inferred by a local pathogens database, of which two OTUs (affiliated with Vibrio tubiashii and Vibrio harveyi) exhibited significantly higher abundances in diseased shrimp as compared to healthy subjects. The two OTUs cumulatively contributed 64.5% dissimilarity in the gut microbiotas between shrimp health status. Notably, the random Forest model depicted that profiles of the two OTUs contributed 78.5% predicted accuracy of shrimp health status. Removal of the two OTUs from co-occurrence networks led to network fragmentation, suggesting their gatekeeper features. For these evidences, the two OTUs were inferred as candidate pathogens. Three virulence genes (bca, tlpA, and fdeC) that were coded by the two candidate pathogens were inferred by a virulence factor database, which were enriched significantly (P < 0.05 in the three cases, as validated by qPCR) in diseased shrimp as compared to healthy ones. The two candidate pathogens were repressed by Flavobacteriaceae, Garvieae, and Photobacrerium species in healthy shrimp, while these interactions shifted into synergy in disease cohorts. Collectively, our findings offer a frame to identify potential polymicrobial pathogen infections from an ecological perspective.
I had this understanding that the DDL statements are autocommit statements and if any DDL statement is written in any TRANSACTION then as the DDl statement executes all the DML before it got commit.I tried below script -
When the term dietary fibre was first coined, over sixty years ago, it only referred to plant cell walls in the diet. Since then, the definition of dietary fibre has changed considerably, and the term now encompasses a wide range of different components, including resistant starches and non-digestible oligosaccharides. As a consequence, a huge "library" of publications on dietary fibres is currently available (e.g., Stephen et al. \[[@B1-ijms-19-03556]\]). These publications include reviews, meta-analyses, epidemiological studies, intervention studies involving humans and animals, as well as experimental studies with in vitro systems. In the current decade, most attention is being given to the key role of dietary fibres in modulating the human gut microbiome and to the study of the related effects on metabolic and mental health, which is an area of immense complexity. Contemporary research indicates that the risk of developing various non-communicable diseases is partly mediated by the structure of the gut microbiota maintained by our dietary habits. Ancestral diets, rich in plant-based foods, and dietary fibres appear to favour ecological diversity, with a richer, more complex microbiome resulting in beneficial effects for metabolic and mental health. This field is very much at its beginning stages, and many well-designed studies involving advanced analysis of the complex data generated will be required before an overall picture can emerge. This Special Issue contributes to this major goal, both with review articles and with articles describing new research. The review by Barbara Williams et al. \[[@B2-ijms-19-03556]\] provides strong indications that the more complex and varied the diet is (and its ingredients), the more complex and varied the gut microbiota is likely to be, and concludes that the intake of a complex mix of plant-based foods is to be preferred over the consumption of purified dietary fibres. This conclusion is supported by the results of the study of Samsu U. Nurdin et al. \[[@B3-ijms-19-03556]\]. Here, epigallocatechin-3-gallate (EGCG), the main anti-oxidant of green cincau, combined with its main dietary fibre, pectin, inhibited the ability of pectin to stimulate short-chain fatty acid production in digesta and increased cell proliferation in the distal colon. However, leaves and extracts of green cincau containing these compounds, together with many others, did not show any negative effects. As outlined in the review by O'Keefe (2016) \[[@B4-ijms-19-03556]\], a dietary fibre intake of at least 50 g/day, as consumed in ancestral and non-western diets, contributes to a beneficial gut microbiome and is recommended for a substantial reduction in the risk of colorectal cancer. Suggesting effective dietary fibres as part of a diet may contribute to more detailed dietary recommendations for reducing this risk. The paper by Tahir Rasool Qamar et al. \[[@B5-ijms-19-03556]\] concludes that galacto-oligosaccharides with β-1,6 and β-1,3 glycosidic linkages have dose-dependent protective effects on various biomarkers of colorectal cancer and are more protective in higher doses. This indicates that the addition of these partially synthesized, prebiotic dietary fibres can provide protective effects. The review by Li Pan et al. \[[@B6-ijms-19-03556]\] indicates that a range of prebiotic dietary fibres can protect against a range of negative effects produced by the lectin soybean agglutinin, including effects on the intestinal structure, intestinal permeability, mucosal immune system, and intestinal flora. The authors indicate that functional, prebiotic oligosaccharides can bind to soybean agglutinin, thereby mitigating the negative effects of agglutinin in soybean-containing diets for monogastric animals. The review of Abdallah Ghonimy et al. \[[@B7-ijms-19-03556]\] addresses the important role of carnitine as a factor involved in the production of short-chain fatty acids by bacteria and the interactions between carnitine and dietary fibres, especially those with iron-binding properties, such as lignin and uronic acid-containing polysaccharides. A low dietary fibre intake can stimulate the breakdown of carnitine resulting in the production of compounds that increase the risk of atherosclerosis and cardiovascular disease. Further investigation is required to evaluate the effects of different anti-nutritional factors on carnitine bioactivity. In their study, Sophie Fehlbaum et al. \[[@B8-ijms-19-03556]\] used an in vitro fermentation screening platform (i-screen) inoculated with adult fecal microbiota and exposed it to a range of different dietary fibres. They indicated that the concept of prebiotics has now been considerably broadened beyond the initial concept of non-digestible oligosaccharides and their impact on bifidobacteria and lactobacilli. Their findings support the potential for α-galactooligosaccharides, xyloologosaccharides, and oat β-glucan acting as novel prebiotics, because they caused positive shifts in microbiome composition and short-chain fatty acid production that point to potential health benefits. Finally, another elegant in vitro study was described by Susanne Naumann et al. \[[@B9-ijms-19-03556]\]. They investigated the interaction of dietary fibres with bile acids using simulated in vitro conditions. They compared a commonly used centrifugation method and a modified dialysis method using dietary fibre-rich materials from different sources and concluded that the dialysis method could be used to understand the influence of viscosity on bile acid release from dietary fibres. This may be due to entrapment of bile acids in the viscous chyme matrix in the in vitro conditions used. Further studies on dietary fibre structure and the mechanisms responsible for the viscous effects are required to understand the formation of entangled networks responsible for the entrapment of the bile acids.
"You are innocent until proven guilty. It is a very simple principle," criminology expert Anthony Doob says. "But in the provincial and territorial prisons today, we have more people held awaiting trial than are being punished." Handcuffs photo via Shutterstock. A woman in dire financial straights starts stealing the things she needs but can't afford. The police catch her shoplifting and charge her with the crime for the first time in her life. During the wait for her court date, she leaves Vancouver several times to visit her boyfriend. Those visits result in 16 separate administration-of-justice offences. That's 16 separate offences on top of a shoplifting charge that hasn't even seen its day in court. Ask a lawyer in B.C. about administration-of-justice offences, and it's likely you'll hear a story like this. These are cases where a person accused of a crime gets into legal trouble for failing to follow the conditions of bail or a probation order. Marginalized citizens -- people already facing a host of intersecting social, educational and economic barriers related to poverty, mental health and disability -- are often at the centre of such offences. These offences are technical violations that lead to criminal penalties. While these conditions can keep people safe and encourage people to change problematic behaviours, they can also lead to a spiraling of charges, often for conduct that wasn't criminal to begin with. A growing chorus of legal professionals, provincial justice reform initiatives and academics are concerned that some conditions of bail and probation can unfairly set up the young, the vulnerable and the mentally ill to fail in the criminal justice system. The most common failures Failure to comply with a court order and breach of probation are the two most common criminal offences in Canada. They make up 20 per cent of all criminal matters in the country. In B.C, these crimes are even more common. Administration of justice offences (primarily breaches of bail and probation) represented almost half -- over 40 per cent -- of all B.C.'s criminal court case matters in 2012, according to a report from the B.C. Justice Reform Initiative. This number is growing despite a drop in overall crime rates. Police charges for bail violations increased 127 per cent between 2000 and 2012. And yet the overall charging rate decreased by 1.4 per cent, according to Statistics Canada. Many experts, judges and legal professionals deem it necessary to reconsider what counts as a reasonable condition of release. They call for more restraint in the use of abstinence conditions, curfews, area restrictions and other restrictive conditions. Others emphasize the success of the community court model, which seeks to address the root causes of crime. Community courts provide essential links to services like housing, health interventions and addictions counselling. In so doing, they can help people stay out of the prison system. Dropping crime rates, swelling provincial investments Inside a pretrial centre in Port Coquitlam, B.C. The crime rate in B.C. is at its lowest point in four decades. But that hasn't stopped the provincial government from increasing our correctional capacity. A new 216-cell wing of the expanded, redesigned Surrey Pretrial Services Centre opened its doors in February, marking the final phase of a $185-million project. The Surrey Pretrial Centre, now B.C.'s largest correctional facility, is intended to house prisoners being held in remand, or temporary detention awaiting trial. Remand is a temporary form of imprisonment for people accused of a crime. Accused are held in remand when judges believe they pose too great a risk to both society and themselves to be released. While remand is intended to be a temporary measure, the average length of stay in remand was 38 days -- over a month -- in 2011 and 2012, according to data from the B.C Justice Reform Initiative. Research literature has firmly established that a stay in remand can lead to a loss of employment and housing. Remand prisoners re-entering the community are prone to relapsing into drug and alcohol addiction, so they are often in need of temporary assistance. Abstinence orders often present additional obstacles and stress. A representative from the Ministry of Justice told Megaphone that B.C. Corrections provides people in remand with information on accessing community supports like drug and alcohol services and mental health services, in addition to services provided through the Ministry of Social Development and Housing. Every person entering remand is subject to a medical and mental health assessment, and remand centres staff drug and alcohol counsellors, a mental health coordinator, a psychologist and a psychiatrist. However, the Ministry of Justice representative also noted that it's tough to plan services for discharged offenders. "Since the decision to release a remanded offender is an independent decision made by the judiciary," the representative said, "correctional officers are not provided with these discharge dates in advance, making it challenging to comprehensively plan for the discharge of remanded offenders." Studies by Statistics Canada and the B.C. Justice Reform Initiative show administration-of-justice offences, particularly breaches of bail and probation, are the top contributors to growth in the number of people being preventatively detained in facilities like Surrey's -- not big-ticket criminal events, like surges in gang activity. The number of preventative detainees in B.C.'s prison system has jumped from one-third of the province's prison population in 2000/2001 to more than half in 2011/2012. Anthony Doob says the growth in this population is expensive and also preventable. The University of Toronto criminology professor was part of a research project investigating causes behind the growing numbers of people held in remand across Canada. "Studies have shown that there are no good reasons for this increase in remand," Doob told Megaphone. "Unfortunately it's something that is happening in a lot of provinces." Crime has been falling in urban areas throughout North America since the 1990s. In the U.S., prison populations have recently started to decline, but in Canada the rising numbers of people in remand has kept the overall prison population stable. For Doob and many others, the growth in remand is a troubling moment that signals a problem with how Canada's justice system operates. "You are innocent until proven guilty. It is a very simple principle," Doob says. "But in the provincial and territorial prisons today, we have more people held awaiting trial than are being punished." Conditions for release fail people on the margins While B.C. has seen some of the steepest drops in crime of any Canadian province over the last 20 years, the number of people in remand has grown significantly. Some people held in remand will eventually have their charges dropped or be found not guilty. This means many people accused of a crime will spend time in prison without ever being found guilty or afforded the protections that come with a trial. Doob points out that even in cases where an accused is found guilty, time spent in remand can be out of proportion to the severity of the offence. The good news, according to Doob, is that many provinces are beginning to realize that growing remand numbers are a problem, and are starting to do something about it. Many of these inquiries have looked to the use of conditions of release as an area for reform. Judicial decisions to release someone pending trial, also known as bail decisions, "are very often the most critical decision the court is going to make," says David Griffiths, a veteran of the Canadian defence bar and current manager of B.C's Legal Services Society. From the defence perspective, Griffiths says, "If your client is detained while you wait for the trial, you've already lost the case." The decision to detain someone is often the result of a record of a person failing to comply with the conditions of their release, or reoffending. But for some, especially those for whom mental health, addictions or socio-economic life circumstances could stand in the way, a record of violating conditions of release does not necessarily reflect a pattern of serious reoffending. Understanding court documents and keeping appointments are much harder for those with unstable housing, unmet mental health concerns and concurring addictions issues. Imposing restrictive conditions of release without addressing these underlying problems can be counter productive. A 'compounding cycle' It's easy to see how a minor offence can lead to a series of administrative offences. It's what Griffiths calls a "compounding cycle." A defence attorney, Griffiths says, can be instrumental in helping a vulnerable client navigate the system. Many defence attorneys work with the court to arrive at bail terms and sentences that will help their clients, sometimes through rehabilitation, and in other cases, through more restrictive conditions of release. Bob Bellows is a defence attorney who has been practicing for 40 years in Vancouver. He says many people going through bail court do not have telephone numbers, fixed addresses and other things that make it easy to keep appointments and stay in touch with their defence council. Even though legal aid funding recently increased by $2 million in B.C., Bellows would like to see more invested. Chronic underfunding has led to a lack of legal aid representation in civil and family law as well as representation for "low risk" criminal charges that would not lead to a jail sentence. Research suggests unrepresented people are more likely to agree to onerous conditions of release and plead guilty to crimes they did not commit. Self-represented accused are more likely to set themselves up for breach. 'We can no longer do this automatically' Adequate funding for legal aid is only one part of the puzzle. In addition, Bellows says there needs to be more collaboration between legal actors and more housing. In a precedent-setting 2013 ruling, Rosborough rejected the conditions of bail imposed on two people with a record of alcohol abuse that they abstain from alcohol. For Rosborough, "ordering an alcoholic not to drink is tantamount to ordering the clinically depressed to 'just cheer up.' In his ruling Rosborough points out that without other supports, abstinence conditions are counterproductive. He urges lawyers to rethink the unrealistic practice of imposing drinking bans to those struggling with alcohol addictions while they wait for their court dates. In an article on the landmark ruling in the Edmonton Journal, Greg Lepp, associate minister of justice, was quoted as saying that the Alberta government now plans on using Rosborough's decision as a teaching tool. Lepp says that courts used to apply drinking bans as a matter of routine, but "we can no longer do this automatically." Outreach and support needed Therapeutic approaches at work in Vancouver's Downtown Community Court have helped reduce reoffending by addressing root causes of crime and providing judges with necessary contextualizing information about the accused. In settings like Vancouver's Downtown Community Court, full-time defence council work closely with probation officers, Crown Council, service providers and health care professionals to craft conditions of bail tailored to the needs of the accused. The community court also helps connect people with housing. A recently published peer-reviewed evaluation of Vancouver's Downtown Community Court found that its outreach and support programs reduced reoffending significantly, and specifically reduced the likelihood of breach almost by half. Other criminal justice institutions could do well to model their approaches after the ones at work in the community court. Both failure to comply with a court order and breach of probation are rooted in the socio-economic circumstances facing the accused, which the Downtown Community Court aims to address explicitly by providing access to housing and other supports. As it stands, however, the community court's holistic approach to its clients is rare in Canada's larger legal landscape. But there is much to learn from its workers' acknowledgement of the intersecting roles that housing, mental health and addictions services and other social supports can play in predicting outcomes for people navigating the criminal justice system. "I see the objectives of the Downtown Community Court as being really worthwhile," says Bellows. "It is really clear that as soon as individuals are able to be housed in a decent environment, their lives change significantly for the better. That's where it starts." Get The Tyee in your inbox Your privacy is important to us. When subscribing to a newsletter edition you'll also get early notice on Tyee events, news, promotions, partner messages and special initiatives. Further to the provision of the Personal Information Protection Act, personal information is kept confidential by TheTyee.ca and will not be sold, traded, released, shared or distributed to any other individuals, organizations or agencies without prior consent or notification. Measures have been enacted to ensure the integrity of personal information and to protect it from misuse, loss or alteration. All information submitted to The Tyee is only available to employees or sub-contractors who are bound by agreement with The Tyee to keep the information private. E-mail addresses are only used for the purposes of Tyee-related correspondence or comment moderation. If you have concerns related to your privacy please contact us at info@thetyee.ca
/* * Licensed to Luca Cavanna (the "Author") under one * or more contributor license agreements. See the NOTICE file * distributed with this work for additional information * regarding copyright ownership. Elastic Search licenses this * file to you under the Apache License, Version 2.0 (the * "License"); you may not use this file except in compliance * with the License. You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, * software distributed under the License is distributed on an * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY * KIND, either express or implied. See the License for the * specific language governing permissions and limitations * under the License. / package org.elasticsearch.shell.console.completer; import org.elasticsearch.action.index.IndexRequest; import org.elasticsearch.client.Requests; import org.elasticsearch.common.inject.Guice; import org.elasticsearch.common.inject.Injector; import org.elasticsearch.shell.JLineModule; import org.elasticsearch.shell.RhinoShellModule; import org.elasticsearch.shell.ShellModule; import org.mozilla.javascript.; import org.testng.Assert; import org.testng.annotations.AfterClass; import org.testng.annotations.BeforeClass; import org.testng.annotations.Test; import java.util.ArrayList; import java.util.List; /** * @author Luca Cavanna */ public class JLineRhinoCompleterTest { JLineRhinoCompleter completer; @BeforeClass public void init() { Injector injector = Guice.createInjector(new ShellModule(), new JLineModule(), new RhinoShellModule()); Context context = Context.enter(); context.setWrapFactory(new RhinoCustomWrapFactory()); completer = injector.getInstance(JLineRhinoCompleter.class); } @AfterClass public void destroy() { Context.exit(); } @Test public void testComplete_EmptyInput() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = ""; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), completer.getScope().get().getAllIds().length); Assert.assertEquals(output, 0); } @Test public void testCompleteNativeJavaClass_Name() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requ"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "Requests"); Assert.assertEquals(output, 0); } @Test public void testCompleteNativeJavaClass_WholeName() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "Requests"); Assert.assertEquals(output, 0); } @Test public void testComplete_Nothing() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests1"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 0); Assert.assertEquals(output, 0); } @Test public void testCompleteNativeJavaClass_AllMethods() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests."; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 36); Assert.assertEquals(output, 9); } @Test public void testCompleteNativeJavaClass_FilteredMethods() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.index"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertTrue(candidates.contains("indexAliasesRequest()")); Assert.assertTrue(candidates.contains("indexRequest()")); Assert.assertEquals(output, 9); } @Test public void testCompleteImportCommand() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "impo"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertTrue(candidates.contains("importClass()")); Assert.assertTrue(candidates.contains("importPackage()")); Assert.assertEquals(output, 0); } @Test public void testCompleteNativeJavaClass_MethodNotFound() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.doesntExist()."; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 0); Assert.assertEquals(output, 23); } @Test public void testCompleteNativeJavaClass_MethodNotFound2() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.doesntExist('abcd')."; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 0); Assert.assertEquals(output, 29); } @Test public void testCompleteNativeJavaClass_MethodNotFound3() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.doesntExist().test"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 0); Assert.assertEquals(output, 23); } @Test public void testCompleteNativeJavaClass_MethodNotFound4() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.doesntExist('abcd').test"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 0); Assert.assertEquals(output, 29); } @Test public void testCompleteNativeJavaMethod_1MethodReflection() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.indexRequest()."; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 34); Assert.assertEquals(output, 24); } @Test public void testCompleteNativeJavaMethod_1MethodReflectionWithArguments() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.indexRequest(QueryBuilders.try(ddd))."; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 34); Assert.assertEquals(output, 46); } @Test public void testCompleteNativeJavaMethod_1MethodReflection2() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.indexRequest('index_name').ty"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "type()"); Assert.assertEquals(output, 36); } @Test public void testCompleteNativeJavaMethod_2MethodsReflection() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.indexRequest('index_name').type('index_name').id"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "id()"); Assert.assertEquals(output, 55); } @Test public void testCompleteNativeJavaMethod_3MethodsReflection() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.indexRequest('index_name').type(\"type_name\").id('id').so"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertTrue(candidates.contains("source()")); Assert.assertTrue(candidates.contains("sourceAsMap()")); Assert.assertEquals(output, 63); } @Test public void testCompleteNativeJavaMethod_MethodNotFound() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.indexRequest('index_name').notFound(\"type_name\").id('id').so"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 0); Assert.assertEquals(output, 67); } @Test public void testCompleteNativeJavaClassNotImported() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "java.util.Collections.so"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertTrue(candidates.contains("sort()")); Assert.assertEquals(output, 22); } @Test public void testCompleteNativeJavaClassNotImported2() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "java.util.Collections.emptyList(blablabla).add"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertTrue(candidates.contains("add()")); Assert.assertTrue(candidates.contains("addAll()")); Assert.assertEquals(output, 43); } @Test public void testCompleteNativeJavaClassNotImported3() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "java.util.Collections.emptyList(blablabla).get(0)."; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 3); Assert.assertTrue(candidates.contains("equals()")); Assert.assertTrue(candidates.contains("getClass()")); Assert.assertTrue(candidates.contains("toString()")); Assert.assertEquals(output, 50); } @Test public void testCompleteNativeJavaClassNotImported_Void() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "java.util.Collections.sort(sdfsdf)."; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 0); Assert.assertEquals(output, 35); } @Test public void testCompleteNativeJavaClass_MultipleReturnTypes() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "Requests.indexRequest().index()."; int output = completer.complete(input, input.length(), candidates); //merge between String return type and ShardReplicationOperationRequest Assert.assertEquals(candidates.size(), 56); Assert.assertTrue(candidates.contains("substring()")); Assert.assertTrue(candidates.contains("replicationType()")); Assert.assertEquals(output, 32); } @Test public void testCompleteNativeJavaObject() { completer.getScope().registerJavaObject("ir", Context.javaToJS(Requests.indexRequest("index_name"), completer.getScope().get())); List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "ir.ty"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "type()"); Assert.assertEquals(output, 3); candidates.clear(); input = "ir.type('type_name').id"; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "id()"); Assert.assertEquals(output, 21); candidates.clear(); input = "ir.type('type_name').id(\"id\").so"; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertTrue(candidates.contains("source()")); Assert.assertTrue(candidates.contains("sourceAsMap()")); Assert.assertEquals(output, 30); } @Test public void testCompleteNestedNativeJavaObject() { NativeJavaObject nativeJavaObject = new RhinoCustomNativeJavaObject(completer.getScope().get(), Requests.indexRequest("index_name"), IndexRequest.class); nativeJavaObject.setPrototype(Context.getCurrentContext().newObject(completer.getScope().get())); NativeJavaObject nestedDativeJavaObject = new RhinoCustomNativeJavaObject(completer.getScope().get(), Requests.indexRequest("index_name"), IndexRequest.class); nestedDativeJavaObject.setPrototype(Context.getCurrentContext().newObject(completer.getScope().get())); ScriptableObject.putProperty(nativeJavaObject, "typeNested", nestedDativeJavaObject); completer.getScope().registerJavaObject("ir", nativeJavaObject); List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "ir.ty"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertTrue(candidates.contains("type()")); Assert.assertTrue(candidates.contains("typeNested")); Assert.assertEquals(output, 3); candidates.clear(); input = "ir.type('type_name').id"; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "id()"); Assert.assertEquals(output, 21); candidates.clear(); input = "ir.type('type_name').id(\"id\").so"; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertTrue(candidates.contains("source()")); Assert.assertTrue(candidates.contains("sourceAsMap()")); Assert.assertEquals(output, 30); candidates.clear(); input = "ir.typeNested.ty"; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "type()"); Assert.assertEquals(output, 14); candidates.clear(); input = "ir.typeNested.type('type_name').id"; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "id()"); Assert.assertEquals(output, 32); candidates.clear(); input = "ir.typeNested.type('type_name').id(\"id\").so"; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertTrue(candidates.contains("source()")); Assert.assertTrue(candidates.contains("sourceAsMap()")); Assert.assertEquals(output, 41); } @Test public void testCompleteNestedNativeJavaObjectNonJavaIdentifier() { NativeJavaObject nativeJavaObject = new RhinoCustomNativeJavaObject(completer.getScope().get(), Requests.indexRequest("index_name"), IndexRequest.class); nativeJavaObject.setPrototype(Context.getCurrentContext().newObject(completer.getScope().get())); NativeJavaObject nestedDativeJavaObject = new RhinoCustomNativeJavaObject(completer.getScope().get(), Requests.indexRequest("index_name"), IndexRequest.class); nestedDativeJavaObject.setPrototype(Context.getCurrentContext().newObject(completer.getScope().get())); ScriptableObject.putProperty(nativeJavaObject, "type-name", nestedDativeJavaObject); completer.getScope().registerJavaObject("ir", nativeJavaObject); List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "ir.ty"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertTrue(candidates.contains("type()")); Assert.assertTrue(candidates.contains("type-name")); Assert.assertEquals(output, 3); candidates.clear(); input = "ir.type('type_name').id"; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "id()"); Assert.assertEquals(output, 21); candidates.clear(); input = "ir.type('type_name').id(\"id\").so"; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertTrue(candidates.contains("source()")); Assert.assertTrue(candidates.contains("sourceAsMap()")); Assert.assertEquals(output, 30); candidates.clear(); input = "ir['type-name'].ty"; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "type()"); Assert.assertEquals(output, 16); candidates.clear(); input = "ir['type-name'].type('type_name').id(\"id\").so"; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertTrue(candidates.contains("source()")); Assert.assertTrue(candidates.contains("sourceAsMap()")); Assert.assertEquals(output, 43); } @Test public void testCompletePackages() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "ja"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 2); Assert.assertEquals(candidates.get(0), "java"); Assert.assertEquals(candidates.get(1), "javax"); Assert.assertEquals(output, 0); candidates.clear(); input = "java."; output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 7); Assert.assertTrue(candidates.contains("applet")); Assert.assertTrue(candidates.contains("lang")); Assert.assertTrue(candidates.contains("math")); Assert.assertTrue(candidates.contains("io")); Assert.assertTrue(candidates.contains("net")); Assert.assertTrue(candidates.contains("text")); Assert.assertTrue(candidates.contains("util")); Assert.assertEquals(output, 5); //TODO Would be nice to give back the classes that belong to that package instead of only the packages (e.g. zip) } @Test public void testCompleteConstructor_StartBuffer() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "new AliasAction()."; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 15); //contains both static and instance methods Assert.assertTrue(candidates.contains("filter()")); Assert.assertTrue(candidates.contains("routing()")); Assert.assertTrue(candidates.contains("newAddAliasAction()")); Assert.assertEquals(output, 18); } @Test public void testCompleteConstructor_StartBufferWithLastPart() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "new AliasAction().fil"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "filter()"); Assert.assertEquals(output, 18); } @Test public void testCompleteConstructor_StartBufferMultipleMethods() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "new AliasAction().filter('args').rou"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "routing()"); Assert.assertEquals(output, 33); } @Test public void testCompleteConstructor_StartBufferQualifiedPackage() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "new java.util.Date()."; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 27); Assert.assertTrue(candidates.contains("after()")); Assert.assertTrue(candidates.contains("before()")); Assert.assertTrue(candidates.contains("getDay()")); Assert.assertEquals(output, 21); } @Test public void testCompleteConstructor_StartBufferQualifiedPackageWithLastPart() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "new java.util.Date().af"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "after()"); Assert.assertEquals(output, 21); } @Test public void testCompleteConstructor_StartBufferQualifiedPackageMultipleMethods() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "new org.elasticsearch.action.index.IndexRequest().id('blablabla').ty"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "type()"); Assert.assertEquals(output, 66); } @Test public void testCompleteConstructor_FunctionArg() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "function(new AliasAction()."; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 15); //contains both static and instance methods Assert.assertTrue(candidates.contains("filter()")); Assert.assertTrue(candidates.contains("routing()")); Assert.assertTrue(candidates.contains("newAddAliasAction()")); Assert.assertEquals(output, 27); } @Test public void testCompleteConstructor_FunctionArgWithLastPart() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "function(new AliasAction().fil"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "filter()"); Assert.assertEquals(output, 27); } @Test public void testCompleteConstructor_FunctionArgMultipleMethods() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "function(new AliasAction().filter('args').rou"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "routing()"); Assert.assertEquals(output, 42); } @Test public void testCompleteConstructor_FunctionArgQualifiedPackageWithLastPart() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "function(new java.util.Date().af"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "after()"); Assert.assertEquals(output, 30); } @Test public void testCompleteConstructor_FunctionArgQualifiedPackageMultipleMethods() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "function(new org.elasticsearch.action.index.IndexRequest().id('blablabla').ty"; int output = completer.complete(input, input.length(), candidates); Assert.assertEquals(candidates.size(), 1); Assert.assertEquals(candidates.get(0), "type()"); Assert.assertEquals(output, 75); } @Test public void test() { List<CharSequence> candidates = new ArrayList<CharSequence>(); String input = "FilterBuilders.queryFilter(QueryBuilders.)"; String inputLength = "FilterBuilders.queryFilter(QueryBuilders."; int output = completer.complete(input, inputLength.length(), candidates); Assert.assertEquals(candidates.size(), 49); Assert.assertTrue(candidates.contains("matchAllQuery()")); Assert.assertTrue(candidates.contains("termQuery()")); Assert.assertEquals(output, inputLength.length()); } }
Q: Killing tensor in the Kerr metric It was famously shown by Carter that the Kerr metric possesses a 4th non-obvious constant of the motion, derived from the separability of the Hamiltonian. This constant is related to a Killing tensor. My question is, is it possible to show apriori the existence and value of this Killing tensor from the Kerr metric, before considering the separability of the Hamiltonian? A: The Killing tensor is defined as a symmetric tensor $K_{\alpha \beta}$ whose total symmetrization of the covariant gradient vanishes $$K_{(\alpha \beta;\gamma)} = K_{\alpha \beta;\gamma} + K_{ \beta\gamma;\alpha}+ K_{\gamma \alpha;\beta}= 0$$ This can be seen as a higher-order generalization of the Killing vector $\xi_\mu$ and the Killing equation which says that the symmetrization of its covariant gradient vanishes $$\xi_{(\mu;\nu)} = \frac{1}{2}(\xi_{\mu;\nu} + \xi_{\nu;\mu})=0$$ In special coordinates where $\xi_\mu$ is tangent to the lines of some coordinate $X$, we can show that the Killing equation is equivalent to the requirement that the metric is independent of $X$. The equations fulfilled by a Killing vector or a Killing tensor are "just" homogeneous linear partial differential equations with non-constant coefficients. I.e., we can solve them directly by brute force. Consider Minkowski space-time in Cartesian coordinates. There we have the covariant gradient equal simply to the coordinate gradient and a trivial example fulfilling the Killing equation is a constant vector $\xi_\mu$. Similarly, a trivial example of a Killing tensor in Minkowski is any constant symmetric tensor $K_{\mu \nu}$. I.e., we do not need to generally consider the separability of the Hamilton-Jacobi equation to obtain the Killing tensor. On the other hand, in the case of a generally curved space-time (including Kerr), it is virtually impossible to find analytical solutions to the Killing-tensor equation by brute force. You have to use special algebraic techniques such as the spinor techniques used by Walker and Penrose in 1970 to derive (or guess) the Killing tensor without reference to the separability of equations of motion. In the light of these procedures, it does not seem as such a stretch to use the Hamilton-Jacobi equation to indirectly look for a Killing tensor. Nevertheless, looking just at the separability of the Hamilton-Jacobi equation of a geodesic is not a surefire way to see whether the space-time has a Killing tensor or not. It has been shown that the Hamilton-Jacobi equation separates if and only if you are in a special set of adapted coordinates (Boyer-Lindquist and similar in Kerr, I like the way this is reviewed by Chervonyii and Lunin). If you are in a generic set of coordinates, your Hamilton-Jacobi equation does not separate even though you have a Killing tensor. Furthermore, another important object often called the ``square root" of the Killing tensor, the Killing-Yano tensor, cannot be found by the Hamilton-Jacobi method. The Killing-Yano tensor of rank two is an antisymmetric tensor $Y_{\alpha \beta}$ whose covariant gradient is also antisymmetric $$Y_{\alpha (\beta;\gamma)} = 0$$ You can then show that $K_{\alpha \beta} = Y_{\alpha \gamma} Y^\gamma_{\;\; \beta}$ is a Killing tensor. The existence of the Killing-Yano tensor implies separability of the Dirac equation on the curved background. This means that in principle you can circumvent the Hamilton-Jacobi equation by instead looking for the Killing-Yano tensor from the separability of the Dirac equation, and squaring it to obtain the Killing tensor. However, the construction of the Dirac equation on curved background is not trivial. Thus, it still seems to me that looking for the separation constant of the Hamilton-Jacobi equation for a geodesic is the easiest trick in trying to find the Killing tensor. If you are looking more for a pragmatic way to simply read of the Killing tensor from the Kerr metric and any metric with a Killing tensor, the recipe goes as follows. You have to be in coordinates $\xi, \eta$ (plus the ones corresponding to Killing-vector directions) where the inverse metric components acquire the form $$g^{\mu \nu} = \frac{1}{f_\xi(\xi) - f_\eta(\eta)} (X^{\mu \nu}(\xi) + Y^{\mu\nu}(\eta))\,,$$ where $X^{\eta \nu} = Y^{\xi \nu}=0$. You can see that the Kerr metric in Boyer-Lindquist coordinates $r,\vartheta$ has exactly this property. Your Killing tensor then is $$K^{\mu\nu} = -\frac{f_\xi Y^{\mu \nu} + f_\eta X^{\mu \nu}}{f_\xi - f_\eta}$$ This can be verified by brute-force calculation. However, the derivation of this formula would be once again easiest by considering the Hamilton-Jacobi equation because these $\xi$ and $\eta$ are once again coordinates in which the HJ equation separates.
// Copyright (C) 2014 Open Data ("Open Data" refers to // one or more of the following companies: Open Data Partners LLC, // Open Data Research LLC, or Open Data Capital LLC.) // // This file is part of Hadrian. // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. package test.scala.speed import scala.collection.JavaConversions._ import scala.collection.mutable import org.junit.runner.RunWith import org.scalatest.FlatSpec import org.scalatest.junit.JUnitRunner import org.scalatest.Matchers import com.opendatagroup.hadrian.ast._ import com.opendatagroup.hadrian.data._ import com.opendatagroup.hadrian.errors._ import com.opendatagroup.hadrian.jvmcompiler._ import com.opendatagroup.hadrian.reader._ import com.opendatagroup.hadrian.yaml._ import test.scala._ @RunWith(classOf[JUnitRunner]) class SpeedSuite extends FlatSpec with Matchers { "tree test" must "run a lot of data through a tree" taggedAs(Speed) in { val engine = PFAEngine.fromJson(getClass.getResourceAsStream("/resources/hipparcos_numerical_10.pfa")).head val dataset = (for (line <- new java.util.Scanner(getClass.getResourceAsStream("/resources/hipparcos_numerical.csv")).useDelimiter("\\n")) yield { val words = line.split(",") engine.jsonInput(s"""{ "ra": ${words(0)}, "dec": ${words(1)}, "dist": ${words(2)}, "mag": ${words(3)}, "absmag": ${words(4)}, "x": ${words(5)}, "y": ${words(6)}, "z": ${words(7)}, "vx": ${words(8)}, "vy": ${words(9)}, "vz": ${words(10)}, "spectrum": "${words(11)}" }""") }).toList val datasetSize = dataset.size dataset.foreach(engine.action(_)) dataset.foreach(engine.action(_)) dataset.foreach(engine.action(_)) var cumulative = 0.0 for (iteration <- 0 until 50) { val before = System.currentTimeMillis dataset.foreach(engine.action(_)) val after = System.currentTimeMillis cumulative += after - before println(s"""${cumulative / 1000.0}, ${(iteration + 1) * datasetSize}""") } } "tree test" must "run a lot of data through a forest" taggedAs(Speed) in { println("loading engine") val before = System.currentTimeMillis val engine = PFAEngine.fromJson(new java.util.zip.GZIPInputStream(getClass.getResourceAsStream("/resources/hipparcos_segmented_10.pfa.gz"))).head val after = System.currentTimeMillis println("done", (after - before)) val dataset = (for (line <- new java.util.Scanner(getClass.getResourceAsStream("/resources/hipparcos_numerical.csv")).useDelimiter("\\n")) yield { val words = line.split(",") engine.jsonInput(s"""{ "ra": ${words(0)}, "dec": ${words(1)}, "dist": ${words(2)}, "mag": ${words(3)}, "absmag": ${words(4)}, "x": ${words(5)}, "y": ${words(6)}, "z": ${words(7)}, "vx": ${words(8)}, "vy": ${words(9)}, "vz": ${words(10)}, "spectrum": "${words(11)}" }""") }).toList println("loaded dataset") val datasetSize = dataset.size dataset.foreach(engine.action(_)) println("first foreach") dataset.foreach(engine.action(_)) dataset.foreach(engine.action(_)) var cumulative = 0.0 for (iteration <- 0 until 50) { val before = System.currentTimeMillis dataset.foreach(engine.action(_)) val after = System.currentTimeMillis cumulative += after - before println(s"""${cumulative / 1000.0}, ${(iteration + 1) * datasetSize}""") } } }
--- abstract: \| We study the topology of orbits of dynamical systems defined by finite-dimensional representations of nilpotent Lie groups. Thus, the following dichotomy is established: either the interior of the set of regular points is dense in the representation space, or the complement of the set of regular points is dense, and then the interior of that complement is either empty or dense in the representation space. The regular points are by definition the points whose orbits are locally compact in their relative topology. We thus generalize some results from the recent literature on linear actions of abelian Lie groups. As an application, we determine the generalized $ax+b$-groups whose $C^$-algebras are antiliminary, that is, no closed 2-sided ideal is type I.\ 2010 MSC:* Primary 22E27 Secondary 22E25, 22D25, 17B30\ Keywords: semidirect product; group action; locally closed subset address: 'Institute of Mathematics “Simion Stoilow” of the Romanian Academy, P.O. Box 1-764, Bucharest, Romania' author: - Ingrid Beltiţă and Daniel Beltiţă title: Linear dynamical systems of nilpotent Lie groups --- addtoreset[figure]{}[section]{} @figure[h,t]{} addtoreset[table]{}[bsection]{} @table[h, t]{} addtoreset[equation]{}[section]{} \[theorem\][Acknowledgment]{} \[theorem\][Corollary]{} \[theorem\][Definition]{} \[theorem\][Example]{} \[theorem\][Lemma]{} \[theorem\][Notation]{} \[theorem\][Problem]{} \[theorem\][Proposition]{} \[theorem\][Question]{} \[theorem\][Remark]{} \[theorem\][Setting]{} Introduction ============ One of the main results of the present paper is that if $\pi\colon G\to{{\rm End}}({{\mathcal V}})$ is a finite-dimensional representation of a nilpotent Lie group and $\Gamma$ is the set of all regular points $v\in{{\mathcal V}}$ (i.e., the corresponding orbit $\pi(G)v$ is locally compact in its relative topology), then either the interior of $\Gamma$ is dense in ${{\mathcal V}}$ or the complement ${{\mathcal V}}\setminus \Gamma$ is a dense subset of ${{\mathcal V}}$ whose interior is either empty or is dense in ${{\mathcal V}}$. (See Corollary \[main\_reg\].) When $G$ is an abelian Lie group, that dichotomy was essentially established in [@ArCuOu16] and, as shown in Remark \[main\_reg\_ab\] , it is closely related to a result of this type that had been obtained in [@Pu71 Ch. IV, Prop. 8.2] for the coadjoint representation of any connected, simply connected, solvable Lie group $S$, and that result had been used for proving that almost all factors of the von Neumann algebra of $S$ are either type I or type II. In fact, one of the main motivations of the present paper was to try to complete this picture by obtaining some information on the size of the set of unitary equivalence classes of the remaining, type III, factor representations. (See Remark \[III\] and Example \[Mautner\].) Besides representation theory, the study of regular points of dynamical systems holds an important role in several research areas, including for instance admissibility in continuous wavelet theory [@ArCuDaOu13], [@BrCFM15], [@ArCuOu16], or $C^$-dynamical systems [@Wi07], [@BB18]. To obtain our results we use some techniques from linear algebra, namely rationality properties of oblique projections and Moore-Penrose inverses, which allow us to improve the methods of investigation of the paper [@ArCuOu16] mentioned above. From this perspective, this paper is a sequel to our earlier study from [@BB17]. In Section \[Sect\_prel\] we establish some auxiliary results of two types: reduction theory for regular orbits of locally compact group actions, and weight space decompositions with respect to nilpotent Lie groups. In Section \[Sect\_dichot\] we develop the linear algebra tools we need for the investigation of regular points. In Section \[Sect\_reg\] we establish the dichotomies for the sets of regular points in linear dynamical systems of general nilpotent Lie groups (Theorem \[15March2019\] and Corollary \[main\_reg\]). Finally, in Section \[Sect\_ax+b\] we give an application to representation theory of some solvable Lie groups that may not be type I. Specifically, we give a precise characterization of the so-called generalized $ax+b$-groups whose $C^$-algebra is antiliminary (Theorem \[post-anti\]). General notation and terminology {#general-notation-and-terminology .unnumbered} -------------------------------- We denote Lie groups by upper case Roman letters and their Lie algebras by the corresponding lower case Gothic letters. By a nilpotent Lie group we always understand a connected simply connected nilpotent Lie group. For any subset of a real linear vector space $S\subset {{\mathcal W}}$, we denote by $\langle S \rangle$ the additive subgroup of $({{\mathcal W}}, +)$ generated by $S$. For any finite-dimensional real vector space ${{\mathfrak U}}$, the Grassmann manifold of ${{\mathfrak U}}$ is the set ${{\rm Gr}}({{\mathfrak U}})$ of all linear subspaces of ${{\mathfrak U}}$. When ${{\mathfrak U}}_0\subseteq{{\mathfrak U}}$ is linear subspace, we denote ${{\rm Gr}}_{{{\mathfrak U}}_0}({{\mathfrak U}}):=\{{{\mathfrak W}}\in{{\rm Gr}}({{\mathfrak U}})\mid {{\mathfrak U}}_0\dotplus{{\mathfrak W}}={{\mathfrak U}}\}$. (See [@BB17] and [@ACM13].) For any complex Hilbert space ${{\mathcal H}}$ we denote by ${{\mathcal B}}({{\mathcal H}})$ the von Neumann algebra of all bounded linear operators on ${{\mathcal H}}$, and by ${{\mathcal K}}({{\mathcal H}})$ the set of all compact operators on ${{\mathcal H}}$. A separable $C^$-algebra ${{\mathcal A}}$ is said to be type I or postliminary if for every irreducible $$-representation $\pi\colon {{\mathcal A}}\to{{\mathcal B}}({{\mathcal H}})$ one has ${{\mathcal K}}({{\mathcal H}})\subseteq\pi({{\mathcal A}})$. The $C^$-algebra ${{\mathcal A}}$ is called antiliminary if it has no postliminary closed 2-sided ideal different from $\{0\}$. See [@Di69]. Preliminaries {#Sect_prel} ============= Reduction theory for regular orbits of locally compact group actions {#reduction-theory-for-regular-orbits-of-locally-compact-group-actions .unnumbered} -------------------------------------------------------------------- For any continuous action $G\times X\to X$, $(g,x)\mapsto g.x$ of a locally compact group $G$ on a topological space $X$, a point $x_0\in X$ is called a regular point* if its corresponding orbit $G.x_0$ is locally compact, and then $G.x_0$ is called a regular orbit. Here and everywhere in this paper, the orbits are endowed with their relative topology, that is, we regard the orbits as topological subspaces of the ambient space $X$. The notion of regular orbit/point is introduced with respect to a fixed group action. When we work in a framework in which there are several groups around (as for instance in Lemma \[ACDO3.1\_gen\]) we prefer to avoid this terminology for the sake of clarity. The following lemma is a generalization of [@ArCuDaOu13 Cor. 2.3] from Lie group actions to locally compact group actions. \[ACDO2.3\_new\] Let $G\times X\to X$, $(g,x)\mapsto g.x$, be a continuous action of a second countable, locally compact group on a Hausdorff topological space. For any $x_0\in X$ with its orbit ${{\mathcal O}}:=G.x_0$, then the following assertions are equivalent: 1. \[ACDO2.3\_new\_item1\] The orbit ${{\mathcal O}}$ is regular. 2. \[ACDO2.3\_new\_item2\] For every compact neighborhood $K$ of ${{\bf 1}}\in G$ there exists a neighborhood $V$ of $x_0\in X$ with $V\cap {{\mathcal O}}\subseteq K.x_0$. 3. \[ACDO2.3\_new\_item3\] There exist a compact neighborhood $K$ of ${{\bf 1}}\in G$ and a neighborhood $V$ of $x_0\in X$ with $V\cap {{\mathcal O}}\subseteq K.x_0$. If the space $X$ is first countable, the group $G$ is noncompact and countable at infinity, and the mapping $G\to X$, $g\mapsto g.x_0$, is injective, then the above assertions are equivalent to the following one: 1. \[ACDO2.3\_new\_item4\] There is no sequence $\{g_n\}_{n\in{\mathbb N}}$ in $G$ satisfying $\lim\limits_{n\in{\mathbb N}}g_n=\infty$ and $\lim\limits_{n\in{\mathbb N}}g_n.x_0=x_0$. If $X$ is locally compact and both $G$ and $X$ are noncompact, then $\Rightarrow$, where, 1. \[ACDO2.3\_new\_item5\] One has $\lim\limits_{g\to\infty}g.x_0=\infty$ in $X$. $\Rightarrow$ Let $L$ be any compact neighborhood of ${{\bf 1}}\in G$ with $L^{-1}L\subseteq K$. One has $G=\bigcup\limits_{g\in G}gL$ hence, since $G$ is second countable, it has a subset $C\subseteq G$ that is at most countable and satisfies $G=\bigcup\limits_{c\in C}cL$. Since ${{\mathcal O}}=G.x_0$, we then obtain ${{\mathcal O}}=\bigcup\limits_{c\in C}cL.x_0$. This is a countable union of compact subsets of ${{\mathcal O}}$. Since ${{\mathcal O}}$ is locally compact by hypothesis, it then follows by Baire’s theorem that there exists $c\in C$ for which the set $cL.x_0\subseteq {{\mathcal O}}$ has nonempty interior. Using the homeomorphism ${{\mathcal O}}\to{{\mathcal O}}$, $x\mapsto c^{-1}.x$, we then obtain that the interior of $L.x_0$ is nonempty, hence there exists $g\in L$ for which $g.x_0$ belongs to the interior of $L.x_0$. Then $x_0$ belongs to the interior of $g^{-1}L.x_0$. On the other hand $g^{-1}L.x_0\subseteq L^{-1}L.x_0\subseteq K.x_0$, hence $x_0$ belongs to the interior of $K.x_0$, which is equivalent to Assertion . $\Rightarrow$ Obvious. $\Rightarrow$ It follows by that $K.x_0$ is a compact neighborhood of $x_0\in {{\mathcal O}}$. Since the group $G$ acts transitively on ${{\mathcal O}}$ by homeomorphisms, it then follows that every point of ${{\mathcal O}}$ has a compact neighborhood, hence ${{\mathcal O}}$ is locally compact. Now assume that $G$ is noncompact and countable at infinity, hence it has a sequence of compact subsets $K_1\subseteq K_2\subseteq\cdots\subseteq G$ with $\bigcup\limits_{n\ge 1}K_n=G$. We also assume that $X$ is first countable and the mapping $G\to X$, $g\mapsto g.x_0$, is injective. $\Rightarrow$ Let $\{g_n\}_{n\in{\mathbb N}}$ be a sequence in $G$ with $\lim\limits_{n\in{\mathbb N}}g_n=\infty$ and $\lim\limits_{n\in{\mathbb N}}g_n.x_0=x_0$. Using the notation of , there exists $n_V\in{\mathbb N}$ with $g_n.x_0\in V\cap{{\mathcal O}}\subseteq K.x_0$ for every $n\ge n_V$. Since the mapping $G\to X$, $g\mapsto g.x_0$ is injective, we then obtain $g_n\in K$ for every $n\ge n_V$. Since the group $G$ is noncompact, this contradicts the assumption $\lim\limits_{n\in{\mathbb N}}g_n=\infty$. $\Rightarrow$ Reasoning by contradiction, we assume that there exists a compact neighborhood $K$ of ${{\bf 1}}\in G$ such that for every neighborhood $V$ of $x_0\in X$ one has $V\cap {{\mathcal O}}\not\subseteq K.x_0$. Since $X$ is first countable, there exists a countable base of neighborhoods $\{V_n\}_{n\in{\mathbb N}}$ of $x_0\in X$. Then for every $n\in{\mathbb N}$ one has by assumption $V_n\cap {{\mathcal O}}\not\subseteq K.x_0$, hence there exists $y_n\in V_n\cap{{\mathcal O}}$ with $y_n\not\in K.x_0$. Since $y_n\in{{\mathcal O}}$ and the mapping $G\to X$, $g\mapsto g.x_0$, is injective, there exists a unique element $g_n\in G$ with $y_n=g_n.x_0$. Moreover, since $y_n\in V_n$ for all $n\in{\mathbb N}$, we obtain $\lim\limits_{n\in{\mathbb N}}g_n.x_0=x_0$. It then follows by the hypothesis that one does not have $\lim\limits_{n\in{\mathbb N}}g_n=\infty$. Then, selecting a suitable subsequence, one may assume that there exists $h\in G$ with $\lim\limits_{n\in{\mathbb N}}g_n=h$, hence $h.x_0=\lim\limits_{n\in{\mathbb N}}g_n.x_0=x_0$ Since the mapping $G\to X$, $g\mapsto g.x_0$, is injective, it then follows that $h={{\bf 1}}\in G$, hence $\lim\limits_{n\in{\mathbb N}}g_n={{\bf 1}}$. On the other hand $g_n.x_0=y_n\not\in K.x_0$ hence, by the injectivity of the mapping $g\mapsto g.x_0$ again, we obtain $g_n\not\in K$ for all $n\in{\mathbb N}$. Since $K$ is a neighborhood of ${{\bf 1}}\in G$, we thus obtain a contradiction. We now assume that the space $X$ is locally compact and noncompact. $\Rightarrow$ Denote by $\widehat{G}=G\sqcup\{\infty_G\}$ and $\widehat{X}=X\sqcup\{\infty_X\}$ the one-point compactifications of $G$ and $X$, respectively, and define $\psi\colon G\to X$, $\psi(g):=g.x_0$. It follows by the hypothesis that the continuous mapping $\psi$ extends by continuity to a continuous mapping $\widehat{\psi}\colon\widehat{G}\to\widehat{X}$ with $\widehat{\psi}(\infty_G)=\infty_X$. Since $\widehat{G}$ is compact, it follows that $\widehat{\psi}(\widehat{G})$ is a compact subset of $\widehat{X}$. Then $\widehat{\psi}(\widehat{G})\setminus\{\infty_X\}$ is a locally closed subset of $\widehat{X}$. Since $\widehat{\psi}(\widehat{G})\setminus\{\infty_X\}\subseteq X$ and $X$ is an open subset of $\widehat{X}$, it also follows that $\widehat{\psi}(\widehat{G})\setminus\{\infty_X\}$ is a locally closed subset of $X$. Since $\widehat{\psi}(\widehat{G})\setminus\{\infty_X\}=\psi(G)=G.x_0={{\mathcal O}}$, we thus see that ${{\mathcal O}}$ is a locally cosed subset of $X$, and we are done. The following lemma is a generalization of [@ArCuDaOu13 Prop. 3.1] from Lie group actions to locally compact group actions. \[ACDO3.1\_gen\] Let $G\times X\to X$ and $G\times W\to W$ be continuous actions of a second countable, locally compact group on Hausdorff topological spaces and assume that $q\colon X\to W$ is a continuous surjective mapping which is $G$-equivariant. For any $x_0\in X$ we denote $w_0:=q(x_0)$, ${{\mathcal O}}:=G.x_0$, ${{\mathcal O}}_0:=G(w_0).x_0$, and ${{\mathcal O}}_{w_0}:=G.w_0$. Then the following assertions hold: 1. \[ACDO3.1\_gen\_item1\] One has ${{\mathcal O}}\cap q^{-1}(w_0)={{\mathcal O}}_0$ and $q({{\mathcal O}})={{\mathcal O}}_{w_0}$. 2. \[ACDO3.1\_gen\_item2\] If ${{\mathcal O}}$ is a locally compact subset of $X$, then ${{\mathcal O}}_0$ is a locally compact subset of $X$. 3. \[ACDO3.1\_gen\_item3\] If ${{\mathcal O}}_0$ is a locally compact subset of $X$ and ${{\mathcal O}}_{w_0}$ is a locally compact subset of $W$, then ${{\mathcal O}}$ is a locally compact subset of $X$. 4. \[ACDO3.1\_gen\_item4\] If ${{\mathcal O}}_{w_0}$ is a locally compact subset of $W$, then one has $${{\mathcal O}}\text{ locally compact }\subseteq X\iff {{\mathcal O}}_0\text{ locally compact }\subseteq X.$$ This is straightforward. This follows by Assertion since the intersection of a compact set with a closed set is compact. Let $K$ be an arbitrary compact neighborhood of ${{\bf 1}}\in G$, and select any compact neighborhood $K_1$ of ${{\bf 1}}\in G$ with $K_1$ contained in the interior of $K$. It follows by the hypothesis that ${{\mathcal O}}_{w_0}$ is locally compact along with Lemma \[ACDO2.3\_new\] and Assertion that there exist a neighborhood $V_1$ of $x_0\in X$ satisfying $$V_1\cap {{\mathcal O}}\cap q^{-1}(w_0)\subseteq K_1.x_0.$$ Using the continuity of the group action $G\times X\to X$ at $({{\bf 1}},x_0)\in G\times X$ we now select a compact neighborhood $K_0$ of ${{\bf 1}}\in G$ and a neighborhood $V_2$ of $x_0\in X$ with $$K_0^{-1}.V_2\subseteq V_1.$$ Since $K_1$ is a compact contained in the interior of $K$ we may shrink $K_0$ in order to have $$K_0K_1\subseteq K.$$ Using the hypothesis that ${{\mathcal O}}_{w_0}$ is locally compact in $W$, we obtain by Lemma \[ACDO2.3\_new\] again a neighborhood $V_{w_0}$ of $w_0\in W$ with $$V_{w_0}\cap {{\mathcal O}}_{w_0}\subseteq K_0.w_0.$$ We now prove that $V:=V_2\cap q^{-1}(V_{w_0})$ is a neighborhood of $x\in X$ satisfying $$V\cap{{\mathcal O}}\subseteq K.x_0$$ and then ${{\mathcal O}}$ is locally closed by Lemma \[ACDO2.3\_new\]. It is easily seen that $V$ is a neighborhood of $x\in X$. To prove the above inclusion, let $x\in V\cap{{\mathcal O}}$ arbitrary. Then one has $q(x)\in q(q^{-1}(V_{w_0}))=V_{w_0}$ since $q$ is surjective, and on the other hand $q(x)\in q({{\mathcal O}})={{\mathcal O}}_{w_0}$ by Assertion , hence $q(x)\in V_{w_0}\cap {{\mathcal O}}_{w_0}\subseteq K_0.w_0$. Thus there exists $k_0\in K_0$ with $q(x)=k_0.w_0$, and then $k_0^{-1}.x\in q^{-1}(w_0)$. Since $x\in{{\mathcal O}}$, we also obtain $k_0^{-1}.x\in{{\mathcal O}}$. Moreover, since $x\in V\subseteq V_2$, we obtain at last $$k_0^{-1}.x\in q^{-1}(w_0)\cap {{\mathcal O}}\cap K_0^{-1}.V_2 \subseteq q^{-1}(w_0)\cap {{\mathcal O}}\cap V_1\subseteq K_1.x_0$$ hence $x\in K_0K_1.x_0\subseteq K.x_0$. This directly follows by Assertions –. Weight space decompositions with respect to nilpotent Lie algebras {#weight-space-decompositions-with-respect-to-nilpotent-lie-algebras .unnumbered} ------------------------------------------------------------------ We now introduce some notation to be used in the following, unless otherwise specified. - ${{\mathcal V}}$ is a finite-dimensional real vector space with $m:=\dim{{\mathcal V}}$; - ${{\mathfrak g}}$ is a nilpotent Lie algebra with its corresponding Lie group $G=({{\mathfrak g}},\ast)$; - ${{\mathfrak g}}_{{\mathbb C}}:={{\mathbb C}}\otimes_{{\mathbb R}}{{\mathfrak g}}={{\mathfrak g}}\dotplus{{\rm i}}{{\mathfrak g}}$ is the complexification of ${{\mathfrak g}}$, with its involutive antilinear map ${{\mathfrak g}}_{{\mathbb C}}\to{{\mathfrak g}}_{{\mathbb C}}$, $x\mapsto\bar x$ satisfying $\bar x=x$ for all $x\in{{\mathfrak g}}$; - the linear dual space of the complex Lie algebra ${{\mathfrak g}}_{{\mathbb C}}$ is denoted by ${{\mathfrak g}}_{{\mathbb C}}^$, with its involutive antilinear map ${{\mathfrak g}}_{{\mathbb C}}^\to{{\mathfrak g}}_{{\mathbb C}}^$, $\lambda\mapsto\bar\lambda$, where $\bar\lambda(x):=\overline{\lambda(\bar x)}$ for all $x\in{{\mathfrak g}}_{{\mathbb C}}$ and $\lambda\in{{\mathfrak g}}_{{\mathbb C}}^$; - $\rho\colon{{\mathfrak g}}\to{{\rm End}}({{\mathcal V}})$ is a Lie algebra representation, with its corresponding extension to a morphism of complex Lie algebras $\rho\colon{{\mathfrak g}}_{{\mathbb C}}\to{{\rm End}}_{{\mathbb C}}({{\mathcal V}}_{{\mathbb C}})$; - $C\colon{{\mathcal V}}_{{\mathbb C}}\to{{\mathcal V}}_{{\mathbb C}}$ is the involutive antilinear map satisfying $Cv=v$ for all $v\in{{\mathcal V}}$; \[act1\] For every $\lambda\in{{\mathfrak g}}_{{\mathbb C}}^$, the set $${{\mathcal V}}_{{\mathbb C}}^\lambda:= \bigcap\limits_{x\in{{\mathfrak g}}_{{\mathbb C}}}{{\rm Ker}\,}(\rho(x)-\lambda(x){{\rm id}})^m\subseteq{{\mathcal V}}_{{\mathbb C}}$$ is an invariant subspace for the representation $\rho\colon{{\mathfrak g}}_{{\mathbb C}}\to{{\rm End}}_{{\mathbb C}}({{\mathcal V}}_{{\mathbb C}})$, and one has $${{\mathcal V}}_{{\mathbb C}}=\bigoplus\limits_{\lambda\in\Lambda}{{\mathcal V}}_{{\mathbb C}}^\lambda$$ where the set $\Lambda:=\{\lambda\in{{\mathfrak g}}_{{\mathbb C}}^\mid {{\mathcal V}}_{{\mathbb C}}^\lambda\ne\{0\} \}$ is finite and for every $\lambda\in\Lambda$ one has $[{{\mathfrak g}}_{{\mathbb C}},{{\mathfrak g}}_{{\mathbb C}}]\subseteq{{\rm Ker}\,}\lambda$. Since ${{\mathfrak g}}_{{\mathbb C}}$ is a complex nilpotent Lie algebra, the assertions follow for instance by [@Ca05 Th. 2.9]. \[act2\] For all $\lambda\in{{\mathfrak g}}_{{\mathbb C}}^$ one has $C({{\mathcal V}}_{{\mathbb C}}^\lambda)={{\mathcal V}}_{{\mathbb C}}^{\bar\lambda}$. For every $v\in{{\mathcal V}}_{{\mathbb C}}^\lambda$ and $x\in{{\mathfrak g}}_{{\mathbb C}}$ one has $(\rho(x)-\lambda(x){{\rm id}})^mv=0$ hence, since $C^2={{\rm id}}$, $$0=C(\rho(x)-\lambda(x){{\rm id}})^mv=(C(\rho(x)-\lambda(x){{\rm id}})C)^mCv =(C\rho(x)C-\overline{\lambda(x)}{{\rm id}})^mCv$$ Let $x_1,x_2\in{{\mathfrak g}}$ with $x=x_1+{{\rm i}}x_2$. Then $C\rho(x)C=C(\rho(x_1)+{{\rm i}}\rho(x_2))C=\rho(x_1)-{{\rm i}}\rho(x_2)=\rho(\bar x)$ and thus the above equality implies $$(\forall x\in{{\mathfrak g}}_{{\mathbb C}})\quad (\rho(\bar x)-\overline{\lambda(x)}{{\rm id}})^mCv=0$$ hence $$(\forall x\in{{\mathfrak g}}_{{\mathbb C}})\quad (\rho(x)-\overline{\lambda(\bar x)}{{\rm id}})^mCv=0$$ Therefore $Cv\in {{\mathcal V}}_{{\mathbb C}}^{\bar\lambda}$. Thus $C({{\mathcal V}}_{{\mathbb C}}^\lambda)\subseteq {{\mathcal V}}_{{\mathbb C}}^{\bar\lambda}$, and the converse inclusion follows by symmetry, since $C^2={{\rm id}}$. This completes the proof. \[act3\] For any subset $\Phi\subseteq\Lambda$ we denote ${{\mathcal V}}_{{\mathbb C}}^\Phi:=\bigoplus\limits_{\lambda\in\Phi}{{\mathcal V}}_{{\mathbb C}}^\lambda$ and we define the idempotent mapping $P_\Phi\in{{\rm End}}_{{\mathbb C}}({{\mathcal V}})$ with ${{\rm Ran}\,}P_\Phi={{\mathcal V}}_{{\mathbb C}}^\Phi$ and ${{\rm Ker}\,}P_\Phi={{\mathcal V}}_{{\mathbb C}}^{\Lambda\setminus\Phi}$, using Lemma \[act1\]. If one has $\Phi=\{\lambda\}$ for some $\lambda\in\Lambda$, then we define $P_\lambda:=P_\Phi=P_{\{\lambda\}}$. We denote $\Lambda':=\{\lambda\in\Lambda\mid\bar{\lambda}=\lambda\}$ and, using Lemma \[act2\], we fix a subset $\Lambda''\subseteq\Lambda\setminus\Lambda'$ satisfying $\Lambda\setminus\Lambda'=\Lambda''\sqcup\overline{\Lambda''}$, where $\overline{\Lambda''}:=\{\bar{\lambda}\mid\lambda\in\Lambda''\}$. We then obtain the partition $\Lambda=\Lambda'\sqcup\Lambda''\sqcup\overline{\Lambda''}$. This leads to the direct sum decomposition $$\label{act3_eq1} {{\mathcal V}}_{{\mathbb C}}= {{\mathcal V}}_{{\mathbb C}}^{\Lambda'}\dotplus{{\mathcal V}}_{{\mathbb C}}^{\Lambda''} \dotplus{{\mathcal V}}_{{\mathbb C}}^{\overline{\Lambda''}}$$ via Lemma \[act1\] again. \[act4\] The mapping $$\iota\colon {{\mathcal V}}\to({{\mathcal V}}\cap {{\mathcal V}}_{{\mathbb C}}^{\Lambda'})\dotplus{{\mathcal V}}_{{\mathbb C}}^{\Lambda''},\quad \iota(v):=P_{\Lambda'}v+P_{\Lambda''}v$$ is an ${{\mathbb R}}$-linear isomorphism. One can easily check that $\dim_{{\mathbb R}}{{\mathcal V}}=\dim_{{\mathbb R}}(({{\mathcal V}}\cap {{\mathcal V}}_{{\mathbb C}}^{\Lambda'})\dotplus{{\mathcal V}}_{{\mathbb C}}^{\Lambda''})$ and ${{\rm Ker}\,}\iota=\{0\}$, using Lemmas \[act2\] and \[act1\]. We define the real vector space $$\widetilde{{{\mathcal V}}}:=({{\mathcal V}}\cap {{\mathcal V}}_{{\mathbb C}}^{\Lambda'})\dotplus{{\mathcal V}}_{{\mathbb C}}^{\Lambda''}$$ and the Lie algebra representation $$\widetilde{\rho}\colon{{\mathfrak g}}\to{{\rm End}}(\widetilde{{{\mathcal V}}}),\quad \widetilde{\rho}(x):=\iota\circ\rho(x)\circ\iota^{-1},$$ using Lemma \[act4\]. Dichotomies for rational functions {#Sect_dichot} ================================== The main theme of this subsection is that we wish to obtain a version of the following well-known results, concerning finite families of rational ${{\mathcal Y}}$-valued functions rather than vectors of the finite-dimensional real vector space ${{\mathcal Y}}$. \[dic\_finite\] Let $F\subseteq {{\mathcal Y}}$ be a finite subset of a finite-dimensional real vector space. Then the countable subgroup $\langle F\rangle=\sum\limits_{f\in F}{\mathbb Z}f$ of $({{\mathcal Y}},+)$ generated by $F$ is locally closed if and only if $\langle F\rangle$ is closed if and only if $\langle F\rangle$ is discrete. In fact, every locally closed subgroup of a topological group is closed. Furthermore, if $\langle F\rangle$ is closed in ${{\mathcal Y}}$ and $\langle F\rangle$ is not discrete, then by [@Bo74 Ch. 5, §1, no. 1, Cor.] there exists $y\in{{\mathcal Y}}$ with ${{\mathbb R}}y\subseteq\langle F\rangle$. This implies that $\langle F\rangle$ is not countable, which is a contradiction. \[dic0\] Let ${{\mathcal Y}}$ be a finite-dimensional real vector space and $y_1,\dots,y_k\in{{\mathcal Y}}$ be linearly independent vectors. For any positive integer $r\ge 1$ and any real numbers $a_{ij}$ for $1\le i\le r$ and $1\le j\le k$ define $z_i:=\sum\limits_{j=1}^ka_{ij}y_j\in{{\mathcal Y}}$. Then the subgroup ${\mathbb Z}y_1+\cdots+{\mathbb Z}y_k+{\mathbb Z}z_1+\cdots+{\mathbb Z}z_r$ of $({{\mathcal Y}},+)$ generated by $y_1,\dots,y_k,z_1,\dots,z_r$ is discrete/closed/locally closed if and only if for all $1\le i\le r$ and $1\le j\le k$ one has $a_{ij}\in{\mathbb Q}$. Using Remark \[dic\_finite\], the case $r=1$ follows by [@Bo74 Ch. 5, §1, no. 1, Cor.]. The general case can then be proved by induction on $r\ge 1$. \[dic\_def\] For any finite-dimensional real vector space ${{\mathcal X}}$ and any subset $D\subseteq{{\mathcal X}}$ we say that a function $f\colon D\to{{\mathbb R}}$ is rational* if there exist polynomial functions $P,Q\colon{{\mathcal X}}\to{{\mathbb R}}$ satisfying $Q(x)\ne0$ and $f(x)=P(x)/Q(x)$ for all $x\in D$. If ${{\mathcal Y}}$ is another finite-dimensional real vector space, then a vector function $\phi\colon D\to{{\mathcal Y}}$ is rational if for every linear functional $\xi\colon{{\mathcal Y}}\to{{\mathbb R}}$ the scalar function $\xi\circ\varphi\colon D\to{{\mathbb R}}$ is rational in the above sense. \[dic1\] Let ${{\mathcal X}}$ and ${{\mathcal Y}}$ be finite-dimensional real vector spaces, and fix any countable subset $S\subseteq{{\mathcal Y}}$. If $D\subseteq {{\mathcal X}}$ is an open subset and $f\colon D\to{{\mathcal Y}}$ is a rational function, then one of the following assertions holds: 1. \[1\] There exists $s\in S$ with $f(D)=\{s\}$. 2. \[2\] The subset $f^{-1}({{\mathcal Y}}\setminus S)\subseteq D$ is dense and, if moreover ${{\mathcal Y}}\setminus S$ is totally disconnected, then either ${{\rm Int}\,}f^{-1}({{\mathcal Y}}\setminus S)=\emptyset$ or there exists $y\in{{\mathcal Y}}\setminus S$ with $f(D)=\{y\}$. The assertions and cannot hold true simultaneously. Therefore it suffices to prove that if fails, then is true. For every $s\in S$ the set $f^{-1}(s)$ is closed and, since $f$ is rational, either ${{\rm Int}\,}f^{-1}(s)=\emptyset$ or $f^{-1}(s)=D$. If the first assertion in the statement fails to be true, it then follows that for every $s\in S$ the subset $f^{-1}(s)\subseteq D$ is closed and has empty interior. Then, by Baire’s category theorem the set $\bigcup\limits_{s\in S}f^{-1}(s)$ has empty interior in $D$, that is, its complement is dense in $D$. One has $D\setminus\bigcup\limits_{s\in S}f^{-1}(s)=f^{-1}({{\mathcal Y}}\setminus S)$, hence $f^{-1}({{\mathcal Y}}\setminus S)$ is a dense subset of $D$. Now assume that moreover ${{\mathcal Y}}\setminus S$ is totally disconnected and ${{\rm Int}\,}f^{-1}({{\mathcal Y}}\setminus S)\ne\emptyset$. Then there exists an open connected nonempty subset $B\subseteq D$ with $f(B)\subseteq {{\mathcal Y}}\setminus S$. Since $B$ is connected and the function $f$ is continuous, the set $f(B)$ is in turn connected. The hypothesis that ${{\mathcal Y}}\setminus S$ is totally disconnected then implies that there exists $y_0\in{{\mathcal Y}}\setminus S$ with $f(B)=\{y_0\}$. Since the set $B$ is open and nonempty, and the function $f$ is rational, it then follows that $f$ is constant, hence $f(D)=\{y_0\}$. This completes the proof. \[dic2\] Let ${{\mathcal X}}$ be a finite-dimensional real vector space and $D\subseteq{{\mathcal X}}$ be an open subset. Let $1\le k\le m$ be any positive integers and assume that $y_j\colon D\to{{\mathbb R}}^m$ and $z_i\colon D\to{{\mathbb R}}^m$ are rational functions for $j=1,\dots,k$ and $i=1,\dots,r$, satisfying the conditions $$y_1(x_0),\dots,y_k(x_0)\in{{\mathbb R}}^m\text{ are linearly independent at some point }x_0\in D$$ and $$z_1(x),\dots,z_r(x)\in{{\rm span}}_{{{\mathbb R}}}\{y_1(x),\dots,y_k(x)\}\text{ for all }x\in D.$$ If we denote $$A:=\{x\in D\mid z_1(x),\dots,z_r(x)\in{{\rm span}}_{{\mathbb Q}}\{y_1(x),\dots,y_k(x)\}\}$$ then there exists a dense open subset $D_0\subseteq D$ for which exactly one of the following assertions holds: 1. One has $D_0\subseteq A$ and there exist $a_{ij}\in{\mathbb Q}$ for $1\le i\le r$ and $1\le j\le k$ with $z_i(x)=\sum\limits_{j=1}^ka_{ij}y_j(x)$ for $i=1,\dots,r$ and all $x\in D_0$. 2. The set $D\setminus A$ is dense in $D$, and either ${{\rm Int}\,}(D\setminus A)=\emptyset$ or there exist $a_{ij}\in{{\mathbb R}}$ for $1\le i\le r$ and $1\le j\le k$ with $z_i(x)=\sum\limits_{j=1}^ka_{ij}y_j(x)$ for $i=1,\dots,r$ and all $x\in D_0$. Assume $D\ne\emptyset$ and write $$y_j=(y_{j1},\dots,y_{jm})\colon D\to{{\mathbb R}}^m \text{ and }z_i=(z_{i1},\dots,z_{im})\colon D\to{{\mathbb R}}^m$$ for $j=1,\dots, k$ and $i=1,\dots,r$. Since the vectors $y_1(x_0),\dots,y_k(x_0)\in{{\mathbb R}}^m$ are linearly independent at some point $x_0\in D$, there exists a set $J=\{t_1,\dots,t_k\}\subseteq\{1,\dots,m\}$ with $1\le t_1<\cdots<t_k\le m$ and $x_0\in D_J$, where $D_J:=\{x\in D\mid \delta_J(x)\ne0\}$ and $$\delta_J\colon D\to{{\mathbb R}},\quad \delta_J(x):=\det(y_{s,t_j}(x))_{1\le s,j\le k}.$$ It is clear that $\delta_J\colon D\to{{\mathbb R}}$ is a rational function hence the set $D_J$ is a dense open subset of $D$. Moreover, the vectors $y_1(x),\dots,y_k(x)\in{{\mathbb R}}^m$ are linearly independent for every $x\in D_J$. It then follows by the hypothesis that for $i=1,\dots,r$ and every $x\in D_J$ there exist uniquely determined $a_{i1}(x),\dots,a_{ik}(x)\in{{\mathbb R}}$ with $z_i(x)=\sum\limits_{j=1}^ka_{ij}(x)y_j(x)$, that is, $$\begin{cases} z_{i1}(x)=a_{i1}(x)y_{11}(x)+a_{i2}(x)y_{21}(x)+\cdots+a_{ik}(x)y_{k1}(x), \\ \makebox[4em]{\dotfill} \\ z_{im}(x)=a_{i1}(x)y_{1m}(x)+a_{i2}(x)y_{2m}(x)+\cdots+a_{ik}(x)y_{km}(x). \end{cases}$$ If $B_J(x):=(y_{s,t_j}(x))_{1\le s,j\le k}\in M_k({{\mathbb R}})$, then $\det B_J(x)=\delta_J(x)\ne 0$ for all $x\in D_J$, hence the above overdetermined linear system can be solved for $a_{i1}(x),\dots,a_{ik}(x)$ by $$\underbrace{(z_{i,t_1}(x)\ \dots\ z_{i,t_k}(x))}_{\in M_{1,k}({{\mathbb R}})} \underbrace{B_J(x)^{-1}}_{\in M_k({{\mathbb R}})} =\underbrace{(a_{i1}(x) \ \dots\ a_{ik}(x))}_{\in M_{1,k}({{\mathbb R}})}.$$ This shows that $a_{i1},\dots,a_{ik}$ are rational functions on $D_J$ for $i=1,\dots,r$. Then the function $f:=(a_{ij}\vert_{D_J})_{1\le 1\le r,1\le j\le k}\colon D_J\to M_{rk}({{\mathbb R}})$ is rational and, for $S:=M_{rk}({\mathbb Q})\subseteq M_{rk}({{\mathbb R}})$, one has $A\cap D_J=f^{-1}(S)$ and moreover $M_{rk}({{\mathbb R}})\setminus S$ is totally disconnected. Thus, by Lemma \[dic1\], exactly one of the following cases can occur: - There exists $s\in S$ with $f(x)=s$ for all $x\in D_J$ (in particular $D_J\subseteq A$). - The set $f^{-1}(M_{rk}({{\mathbb R}})\setminus S)$ is dense in $D_J$, and either ${{\rm Int}\,}f^{-1}(M_{rk}({{\mathbb R}})\setminus S)=\emptyset$ or there exists $F_0\in M_{rk}({{\mathbb R}})\setminus S$ with $f(D_J)=\{F_0\}$. Since $D_J$ is a dense subset of $D$ and $f^{-1}(M_{rk}({{\mathbb R}})\setminus S)= D_J\setminus A$, one may set $D_0:=D_J$ to complete the proof. \[dic3\] Let ${{\mathcal X}}$ and ${{\mathcal Y}}$ a finite-dimensional real vector spaces and $D\subseteq{{\mathcal X}}$ be an open subset. Let $f_1,\dots,f_q\colon D\to{{\mathcal Y}}$ be rational functions and define $$A:=\{x\in D\mid \langle f_1(x),\dots,f_q(x)\rangle\text{ is closed in }{{\mathcal Y}}\}.$$ Then exactly one of the following assertions holds: 1. The set ${{\rm Int}\,}A$ is a dense open subset of $D$. 2. The set $D\setminus A$ is dense in $D$, and either ${{\rm Int}\,}(D\setminus A)=\emptyset$ or ${{\rm Int}\,}(D\setminus A)$ is dense in $D$. For every $x\in D$ we define ${{\mathcal E}}_x:={{\rm span}}_{{{\mathbb R}}}\{f_j(x)\mid 1\le j\le q\}$, and we fix a point $x_0\in D$ with $\dim {{\mathcal E}}_x\le \dim{{\mathcal E}}_{x_0}$ for all $x\in D$. We denote $k:=\dim{{\mathcal E}}_{x_0}$, $r:=q-k$, and we label $f_1,\dots,f_q$ as $y_1,\dots,y_k,z_1,\dots,z_r$, with $y_1(x_0),\dots,y_k(x_0)$ being a basis of ${{\mathcal E}}_{x_0}$. Since $y_1,\dots,y_k\colon D\to {{\mathcal Y}}$ are rational functions and $y_1(x_0),\dots,y_k(x_0)$ are linearly independent, it is straightforward to obtain a Zariski open subset $D_0\subseteq D$ with $x_0\in D_0$, for which $y_1(x),\dots,y_k(x)$ are linearly independent for all $x\in D_0$, as in the proof of Lemma \[dic2\]. Since $\dim{{\mathcal E}}_x\le k$ for all $x\in D$, it then follows that $y_1(x),\dots,y_k(x)$ is a basis of ${{\mathcal E}}_x$ for all $x\in D_0$. In particular, for every $x\in D_0$ one has $$\label{dic3_proof_eq1} z_1(x),\dots,z_r(x)\in{{\mathcal E}}_x={{\rm span}}_{{{\mathbb R}}}\{y_1(x),\dots,y_k(x)\}\text{ for all }x\in D_0.$$ On the other hand, denoting $$A_0:=\{x\in D_0\mid z_1(x),\dots,z_r(x)\in{{\rm span}}_{{\mathbb Q}}\{y_1(x),\dots,y_k(x)\}\}$$ we obtain $A_0=A\cap D_0$ by Lemma \[dic0\]. Moreover, it follows by along with Lemma \[dic2\] that there exists a dense open subset $D_{00}\subseteq D_0$ for which exactly one of the following cases occurs: - One has $D_{00}\subseteq A_0$. - The set $D_0\setminus A_0$ is dense in $D_0$, and either ${{\rm Int}\,}(D_0\setminus A_0)=\emptyset$ or ${{\rm Int}\,}(D_0\setminus A_0)$ is dense in $D_0$. Since $D_0$ is a dense open subset of $D$, this concludes the proof. An application of Moore-Penrose inverses {#an-application-of-moore-penrose-inverses .unnumbered} ---------------------------------------- For any fixed integer $n\ge 1$ we define the polynomial functions $\gamma_0,\gamma_1,\dots,\gamma_m\colon {{\mathcal B}}({{\mathbb R}}^n,{{\mathbb R}}^m)\to{{\mathbb R}}$ by the equation $$(\forall t\in{{\mathbb R}})(\forall A\in {{\mathcal B}}({{\mathbb R}}^n,{{\mathbb R}}^m))\quad \det({{\bf 1}}+tAA^\top)=\sum_{k=0}^m\gamma_k(A)t^k.$$ It is easily seen that $\gamma_0(A)=1$ and $\gamma_m(A)=\det(AA^\top)$ for all $A\in {{\mathcal B}}({{\mathbb R}}^n,{{\mathbb R}}^m)$. The functions $\gamma_0,\gamma_1,\dots,\gamma_m$ are called the Gram coefficients; cf. [@DGL05 Def. 1.2]. \[MP\] For any integers $m,n\ge 1$ and $A\in {{\mathcal B}}({{\mathbb R}}^n,{{\mathbb R}}^m)$ the following assertions hold: 1. If $r\in\{1,\dots,n\}$, one has $\dim({{\rm Ker}\,}A)=n-r$ if and only if $\gamma_r(A)\ne0$ and $$(\forall t\in{{\mathbb R}})\quad \det({{\bf 1}}+tAA^\top)=\sum_{k=0}^r\gamma_k(A)t^k.$$ 2. If $\dim({{\rm Ker}\,}A)=n-r$, then the orthogonal projection onto ${{\rm Ker}\,}A$ is given by $$P_{{{\rm Ker}\,}A}={{\bf 1}}-\frac{1}{\gamma_r(A)}\sum_{k=0}^{r-1} (-1)^{r-1-k}\gamma_k(A)(A^\top A)^{r-k}.$$ 3. If $\dim({{\rm Ker}\,}A)=n-r$, then the Moore-Penrose inverse of $A$ is given by $$A^\dagger=\frac{1}{\gamma_r(A)}\Bigl(\sum_{k=0}^{r-1} (-1)^{r-1-k}\gamma_k(A)(A^\top A)^{r-1-k})\Bigr)A^\top\in{{\mathcal B}}({{\mathbb R}}^m,{{\mathbb R}}^n).$$ See [@DGL05 Lemmas 1.3–1.4 and Prop. 1.6]. \[norm0\] Let ${{\mathfrak U}}$, ${{\mathcal X}}$, and ${{\mathcal Y}}$ be finite-dimensional real vector spaces. If $D\subseteq{{\mathcal X}}$, ${{\mathfrak U}}_0\in{{\rm Gr}}({{\mathfrak U}})$, and $T\colon D\to {{\mathcal B}}({{\mathfrak U}},{{\mathcal Y}})$ is a rational mapping with ${{\rm Ker}\,}T(x)\in{{\rm Gr}}_{{{\mathfrak U}}_0}({{\mathfrak U}})$ for all $x\in D$, then the mapping $\theta\colon D\to {{\mathcal B}}({{\mathfrak U}},{{\mathfrak U}}_0)$, $\theta(x):=E_{{{\mathfrak U}}_0}({{\rm Ker}\,}T(x))$ is rational. Fix a scalar product on ${{\mathfrak U}}$, so that ${{\mathfrak U}}$ becomes a real Hilbert space. It follows by [@BB17 Lemma 2.3] that $$(\forall x\in D)\quad \theta(x)=P_{{{\rm Ker}\,}T(x)}(({{\bf 1}}-P_{{{\mathfrak U}}_0})P_{{{\rm Ker}\,}T(x)})^\dagger ({{\bf 1}}-P_{{{\mathfrak U}}_0}).$$ On the other hand, denoting $r:=\dim{{\mathfrak U}}_0$, for all $x\in D$ one has by hypothesis ${{\rm Ker}\,}T(x)\in{{\rm Gr}}_{{{\mathfrak U}}_0}({{\mathfrak U}})$ hence $\dim({{\rm Ker}\,}T(x))=\dim{{\mathfrak U}}-r$. It is also easily checked that $$(\forall x\in D)\quad {{\rm Ker}\,}(({{\bf 1}}-P_{{{\rm Ker}\,}T(x)})P_{{{\mathfrak U}}_0})={{\mathfrak U}}_0^\perp.$$ It then follows by Lemma \[MP\] along with the above fomula that $\theta$ is a composition of rational mappings, hence $\theta$ is in turn rational a rational function. \[strat\] Let ${{\mathfrak g}}$ be a nilpotent Lie algebra with $m:=\dim{{\mathfrak g}}$ and its corresponding group $G=({{\mathfrak g}},\cdot)$, ${{\mathcal V}}$ be a finite-dimensional real vector space with $n:=\dim{{\mathcal V}}$, and $\rho\colon G\to{{\rm End}}({{\mathcal V}})$ be a unipotent representation, that is, $({{\bf 1}}-\rho(x))^n=0$ for all $x\in G$. The contragredient representation $\rho^\colon G\to{{\rm End}}({{\mathcal V}}^)$, $\rho^(x):=\rho(-x)^$, is unipotent as well. Using any Jordan-Hölder sequence of ideals of ${{\mathfrak g}}$, $${{\mathfrak F}}_\bullet:\quad\{0\}={{\mathfrak F}}_0\subseteq{{\mathfrak F}}_1\subseteq\cdots\subseteq{{\mathfrak F}}_m={{\mathfrak g}}$$ and any sequence of linear subspaces $${{\mathcal Y}}_\bullet:\quad \{0\}={{\mathcal Y}}_0\subseteq{{\mathcal Y}}_1\subseteq\cdots\subseteq{{\mathcal Y}}_n={{\mathcal V}}^$$ with $\dim{{\mathcal Y}}_j=j$ and ${{\rm d}}\rho^({{\mathfrak g}}){{\mathcal Y}}_j\subseteq{{\mathcal Y}}_{j-1}$ for $j=1,\dots,n$, we obtain by the construction of [@Pe94 §1.4] a stratification of $({{\mathcal V}}^)^={{\mathcal V}}$ according to the representation $\rho^$. That is, we obtain a partition $${{\mathcal V}}=\bigsqcup\limits_{\varepsilon\in{\boldsymbol{{\mathcal E}}}} \Omega_\varepsilon$$ where the set ${\boldsymbol{{\mathcal E}}}$ is finite and is endowed with a total ordering $\prec$ satisfying the following conditions: 1. \[strat\_item1\] For every $\varepsilon\in{\boldsymbol{{\mathcal E}}}$ the set $\Omega_\varepsilon$ is $\rho(G)$-invariant and there exists a subset $e(\varepsilon)\subseteq\{1,\dots,m\}$ with ${{\rm jump}}_{{{\mathfrak F}}_\bullet}({{\mathfrak g}}(v))=e(\varepsilon)$ for all $v\in\Omega_\varepsilon$. 2. \[strat\_item2\] There exists a family of polynomial functions $\{Q_\varepsilon\colon{{\mathcal V}}\to{{\mathbb R}}\mid \varepsilon\in{\boldsymbol{{\mathcal E}}}\}$ with $\Omega_\varepsilon=\{v\in{{\mathcal V}}\mid Q_\varepsilon(v)\ne0=Q_{\varepsilon'}\text{ if }\varepsilon'\prec\varepsilon\}$. (See [@Pe94 Prop. 1.3.2].) In particular, if $\varepsilon_0=\min{\boldsymbol{{\mathcal E}}}$, then $\Omega_{\varepsilon_0}$ is a dense open subset of ${{\mathcal V}}$. In above we used the notation $${{\rm jump}}_{{{\mathfrak F}}_\bullet}({{\mathfrak h}}):=\{j\in\{1,\dots,m\}\mid {{\mathfrak F}}_{j-1}+{{\mathfrak h}}\subsetneqq{{\mathfrak F}}_j+{{\mathfrak h}}\}$$ for any linear subspace ${{\mathfrak h}}\subseteq{{\mathfrak g}}$. In this setting we also recall for later use that for any selection $x_j\in{{\mathfrak g}}_j\setminus{{\mathfrak g}}_{j-1}$ for $j=1,\dots,m$, $$\label{strat_eq1} \text{if $e:={{\rm jump}}_{{{\mathfrak F}}_\bullet}({{\mathfrak h}})$ and ${{\mathfrak g}}_e:={{\rm span}}\{x_j\mid j\in e\}$, then ${{\mathfrak h}}\in{{\rm Gr}}_{{{\mathfrak g}}_e}({{\mathfrak g}})$,}$$ that is, one has the direct sum decomposition ${{\mathfrak g}}={{\mathfrak h}}\dotplus{{\mathfrak g}}_e$. (See [@BB17 Prop. 3.4(x)].) We also note for later use that actually $$\label{strat_eq2} {{\mathfrak F}}_j=({{\mathfrak h}}\cap{{\mathfrak F}}_j)\dotplus({{\mathfrak g}}_e\cap{{\mathfrak F}}_j)\text{ for }j=1,\dots,m.$$ To see that, let $q:=E_{{{\mathfrak h}},{{\mathfrak g}}}({{\mathfrak g}}_e)\colon {{\mathfrak g}}\to{{\mathfrak g}}$ be the oblique projection onto ${{\mathfrak h}}$ along ${{\mathfrak g}}_e$ given by the direct sum decomposition ${{\mathfrak g}}={{\mathfrak h}}\dotplus{{\mathfrak g}}_e$. It suffices to show that $q({{\mathfrak F}}_j)\subseteq{{\mathfrak F}}_j$ for $j=1,\dots,n$. If $j=1$, then one has either $1\in e$ and then $q(x_1)=0\in{{\mathfrak F}}_1$, or $1\not\in e={{\rm jump}}_{{{\mathfrak F}}_\bullet}({{\mathfrak h}})$ and then ${{\mathfrak F}}_1\subseteq{{\mathfrak h}}$ hence $q(x_1)=x_1\in{{\mathfrak F}}_1$. In any of these cases we obtain $q({{\mathfrak F}}_1)={{\mathbb R}}q(x_1)\subseteq{{\mathfrak F}}_1$. Now let $2\le j\le m$ and assume that $q({{\mathfrak F}}_{j-1})\subseteq{{\mathfrak F}}_{j-1}$. If $j\in e$, then $x_j\in{{\mathfrak g}}_e={{\rm Ker}\,}q$, hence $q(x_j)=0\in{{\mathfrak F}}_j$. If $j\not\in e$, then $x_j\in{{\mathfrak F}}_{j-1}+{{\mathfrak h}}$, hence by ${{\mathfrak F}}_{j-1}\subseteq{{\mathfrak F}}$ we directly obtain $x_j\in{{\mathfrak F}}_{j-1}+({{\mathfrak h}}\cap{{\mathfrak F}}_j)$. Therefore $q(x_j)\in q({{\mathfrak F}}_{j-1})+{{\mathfrak h}}\cap{{\mathfrak F}}_j\subseteq {{\mathfrak F}}_{j-1}+{{\mathfrak F}}_j={{\mathfrak F}}_j$. Using again the induction hypothesis $q({{\mathfrak F}}_{j-1})\subseteq{{\mathfrak F}}_{j-1}$ we then obtain $q({{\mathfrak F}}_j)\subseteq{{\mathfrak F}}_j$, and we are done. Main results on regular orbits {#Sect_reg} ============================== \[sett\_decomp\] Throughout this section we keep the following hypothesis and notation. - $G$ is a nilpotent Lie group; - $\pi\colon G\to{{\rm End}}_{{{\mathbb R}}}({{\mathcal V}})$ is a continuous representation on the finite-dimensional real vector space ${{\mathcal V}}$; - ${{\mathcal V}}={{\mathcal V}}_1\dotplus\cdots\dotplus{{\mathcal V}}_m$ is a direct sum decomposition into $\pi(G)$-invariant subspaces satisfying the condition that for every $j=1,\dots,m$ there exists a field ${\mathbb K}_j\in\{{{\mathbb R}},{{\mathbb C}}\}$ and a ${\mathbb K}_j$-vector space structure of ${{\mathcal V}}_j$ that agrees with its structure of a real vector subspace of ${{\mathcal V}}$ and there exists a function $\chi_j\colon G\to{\mathbb K}_j^\times$ for which $\pi(g)\vert_{{{\mathcal V}}_j}\in{{\rm End}}_{{\mathbb K}_j}({{\mathcal V}}_j)$ and $(\pi(g)\vert_{{{\mathcal V}}_j}-\chi_j(g){{\rm id}}_{{{\mathcal V}}_j})^{m_j}=0$ for all $g\in G$, where $m_j:=\dim_{{\mathbb K}_j}({{\mathcal V}}_j)$. - For every $v\in{{\mathcal V}}\setminus\{0\}$ we denote by ${{\rm supp}}\,v$ the set $J\subseteq\{1,\dots,m\}$ for which there exist $v_j\in{{\mathcal V}}_j\setminus\{0\}$ for all $j\in J$ with $v=\sum\limits_{j\in J}v_j$. The restriction of $\pi$ to its invariant subspace ${{\mathcal V}}_j$ has a joint eigenvector by the classical theorem of S. Lie [@BaRa86 Ch. 8, §1, Th. 1 and Cor. 2], and it then directly follows that the function $\chi_j\colon G\to{\mathbb K}_j^\times$ is a continuous morphism. It then further follows that there exist and are uniquely determined the linear functionals $\alpha_j,\beta_j\colon{{\mathfrak g}}\to{{\mathbb R}}$ satisfying $[{{\mathfrak g}},{{\mathfrak g}}]\subseteq({{\rm Ker}\,}\alpha_j)\cap({{\rm Ker}\,}\beta_j)$ and $$(\forall x\in{{\mathfrak g}})\quad \chi_j(\exp_G x)={{\rm e}}^{\alpha_j(x)+{{\rm i}}\beta_j(x)}.$$ \[sett\_decomp\_def\] We define the abelian Lie group $Z:={\mathbb K}_1^\times \times\cdots\times{\mathbb K}_m^\times$ and the mappings $$\begin{aligned} E &\colon G\to{{\rm End}}_{{{\mathbb R}}}({{\mathcal V}}),\quad E(g):=\chi_1(g){{\rm id}}_{{{\mathcal V}}_1}\dotplus\cdots+\chi_m(g){{\rm id}}_{{{\mathcal V}}_m}, \nonumber\\ E_0 &\colon G\to Z,\qquad\qquad E_0(g):=(\chi_1(g),\dots,\chi_m(g)), \nonumber\\ \nu &\colon G\to{{\rm End}}_{{{\mathbb R}}}({{\mathcal V}}),\quad \nu(g):=E(g)^{-1}\pi(g). \nonumber\end{aligned}$$ For every $v\in{{\mathcal V}}$ we also define $G_\nu(v):=\{g\in G\mid \nu(g)v=v\}$. \[enupi\] We note the following properties of the objects introduced above: 1. \[enupi\_item1\] Both $E$ and $\nu$ are continuous representations with $[E(G),\nu(G)\cup\pi(G)]=\{0\}$ and $\pi(\cdot)=E(\cdot)\nu(\cdot)$. 2. \[enupi\_item2\] For every $g\in G$ one has $(\nu(g)-{{\rm id}}_{{{\mathcal V}}})^N=0$, where $N=\dim {{\mathcal V}}$, and this further implies that the closed subgroup $G_\nu(v)$ of $G$ is connected for all $v\in{{\mathcal V}}$. (See [@CG90 Lemma 3.1.1].) We now state the following generalization of [@ArCuOu16 Th. 3.6] from abelian to general nilpotent Lie groups. \[ArCuOu16\_Th3.6\] The following assertions are equivalent for every $v\in {{\mathcal V}}\setminus\{0\}$: 1. \[ArCuOu16\_Th3.6\_item1\] The subset $\pi(G)v\subseteq {{\mathcal V}}$ is locally compact. 2. \[ArCuOu16\_Th3.6\_item2\] The subgroup $E_0(G)\subseteq Z$ is closed. 3. \[ArCuOu16\_Th3.6\_item3\] The additive subgroup $\langle\{\beta_j\vert_{{{\mathfrak g}}_\nu(v)}\mid j\in{{\rm supp}}\, v\}\rangle\subseteq{{\mathfrak g}}_\nu(v)^$ is discrete. The proof requires some preparation. \[not\_X\] We denote $$\begin{aligned} X:= & \{v\in{{\mathcal V}}\setminus\{0\}\mid{{\rm supp}}\,v=\{{{\bf 1}},\dots,m\}\} \\ = &\{v_1+\cdots+v_m\mid v_j\in{{\mathcal V}}_j\setminus\{0\}\text{ for }j=1,\dots,m\}. \end{aligned}$$ For $j=1,\dots,m$ and $v\in{{\mathcal V}}_j\setminus\{0\}$ we also denote $[v]:={\mathbb K}_j v\subseteq{{\mathcal V}}$. We also define the projective space ${{\mathbb P}}({{\mathcal V}}_j):=\{[v]\mid v\in{{\mathcal V}}_j\setminus\{0\}\}$, endowed with its usual topology of a compact space for which the mapping ${{\mathcal V}}_j\setminus\{0\}\to{{\mathbb P}}({{\mathcal V}}_j)$, $v\mapsto[v]$, is a quotient mapping. We denote $W:={{\mathbb P}}({{\mathcal V}}_1)\times\cdots\times{{\mathbb P}}({{\mathcal V}}_m)$ and we define $$q\colon X\to W,\quad q(v_1+\cdots+v_m):=([v_1],\dots,[v_m]).$$ We also define the group action $$\widetilde{\nu}\colon G\times W\to W,\quad \widetilde{\nu}(g,w):=g.w$$ where $g.([v_1],\dots,[v_m]):=([\nu(g)v_1],\dots,[\nu(g)v_m])$ for all $w=([v_1],\dots,[v_m])\in W$ and $g\in G$. We note for later reference that $$\label{nupi} (\forall j\in\{1,\dots,m\})(\forall v_j\in{{\mathcal V}}_j\setminus\{0\})(\forall g\in G)\quad [\pi(g)v_j]=[\nu(g)v_j] \in{{\mathbb P}}({{\mathcal V}}_j).$$ \[18March2019\] One has the commutative diagram $$\xymatrix {G\times X \ar[r]^{\pi} \ar[d]_{{{\rm id}}_G\times q} & X \ar[d]^{q} \\ G\times W \ar[r]^{\widetilde{\nu}} & W }$$ and for every $v\in X$ the mapping $q\vert_{\nu(G)v}\colon \nu(G)v\to G.q(v)=\widetilde{\nu}(G\times\{q(v)\})$ is a $G$-equivariant homeomorphism. Commutativity of this diagram follows by . Now let $v=v_1+\cdots+v_m\in X$ arbitrary, where $v_j\in{{\mathcal V}}_j\setminus\{0\}$ for $j=1,\dots,m$. It is easily seen that the mapping $q\vert_{\nu(G)v}\colon \nu(G)v\to G.q(v)$ is continuous, surjective, and $G$-equivariant. To show that it is also injective, let $g_1,g_2\in G$ arbitrary with $q(\nu(g_1)v)=q(\nu(g_2)v)$. Then, for $j=1,\dots,m$, there exists $t_j\in{\mathbb K}_j^\times$ with $\nu(g_1)v_j=t_j\nu(g_2)v_j$, hence $\nu(g_2^{-1}g_1)v_j=t_jv_j$. Now $t_j=1$ by Remark \[enupi\], and then $\nu(g_1)v=\nu(g_2)v$, which shows that $q\vert_{\nu(G)v}$ is injective. It remains to check that the inverse of $q\vert_{\nu(G)v}\colon \nu(G)v\to G.q(v)$ is continuous. To this end it suffices to prove that for every sequence $\{g_n\}_{n\in{\mathbb N}}$ in $G$ with $\lim\limits_{n\to\infty}\widetilde{\nu}(g_n,q(v))=q(v)$, one has $\lim\limits_{n\to\infty}\nu(g_n)v=v$. In fact, for $j=1,\dots,n$ one has $\lim\limits_{n\to\infty}[\nu(g_n)v_j]=[v_j]$ in ${{\mathbb P}}({{\mathcal V}}_j)$, hence there exists a sequence $\{t_n\}_{n\in{\mathbb N}}$ in ${\mathbb K}_j$ with $$\label{18March2019_proof_eq1} \lim\limits_{n\to\infty}t_n\nu(g_n)v_j=v_j$$ in ${{\mathcal V}}_j\setminus\{0\}$. On the other hand, by S. Lie’s theorem for the unipotent representation $G\to{{\rm End}}({{\mathcal V}}_j)$, $g\mapsto\nu(g)\vert_{{{\mathcal V}}_j}$, there exists a basis in the ${\mathbb K}_j$-vector space ${{\mathcal V}}_j$ with respect to which one has a lower-triangular matrix representation $$\nu(\cdot)\vert_{{{\mathcal V}}_j}= \begin{pmatrix} 1 & & 0 \\ &\ddots & \\ \ast & & 1 \end{pmatrix}$$ and it then easily follows by that $\lim\limits_{n\to\infty}t_n=1$ in ${\mathbb K}_j^\times$, hence one obtains by again that $\lim\limits_{n\to\infty}\nu(g_n)v_j=v_j$. This further implies $\lim\limits_{n\to\infty}\nu(g_n)v=v$, which completes the proof of the fact that the inverse of $q\vert_{\nu(G)v}\colon \nu(G)v\to G.q(v)$ is continuous, and we are done. \[lattices\] For any connected closed subgroup $H\subseteq G$ with its Lie algebra ${{\mathfrak h}}\subseteq {{\mathfrak g}}$ define $B_H:=\{\beta_j\vert_{{\mathfrak h}}\mid j=1,\dots,m\}\subseteq{{\mathfrak h}}^$. The following conditions are equivalent: 1. \[lattices\_item1\] The subgroup $E_0(H)\subseteq Z$ is closed. 2. \[lattices\_item2\] One has $\dim_{{{\mathbb R}}}({{\rm span}}_{{{\mathbb R}}}(B_H))=\dim_{{\mathbb Q}}({{\rm span}}_{{\mathbb Q}}(B_H))$. 3. \[lattices\_item3\] The additive subgroup $\langle B_H\rangle\subseteq{{\mathfrak h}}^$ is discrete. It is easily seen that Assertions – are equivalent by Lemma \[dic0\]. Let $(H,H)$ denote the subgroup of $H$ generated by its subset $\{hgh^{-1}g^{-1}\mid h,g\in H\}$. Since $H$ is a nilpotent Lie group, it is well-known that $(H,H)$ is the closed connected subgroup of $H$ whose Lie algebra is $[{{\mathfrak h}},{{\mathfrak h}}]$. (See [@Ho65 Ch. XII, Th. 3.1].) Moreover, $[{{\mathfrak h}},{{\mathfrak h}}]\subseteq{{\rm Ker}\,}\beta_j$ for $j=1,\dots,m$, and on the other hand $(H,H)\subseteq {{\rm Ker}\,}E_0$ since $E_0\colon G\to Z$ and the group $Z$ is abelian. Now define the abelian Lie group $\widetilde{H}:=H/(H,H)$ with its Lie algebra $\widetilde{{{\mathfrak h}}}:={{\mathfrak h}}/[{{\mathfrak h}},{{\mathfrak h}}]$, and denote by $Q\colon H\to\widetilde{H}$ and $q\colon{{\mathfrak h}}\to\widetilde{{{\mathfrak h}}}$ their corresponding quotient maps. It follows by the above observations that there exist and are uniquely determined the continuous group morphisms $\widetilde{\chi}_j\colon\widetilde{H}\to {\mathbb K}_j^\times$ and linear functionals $\widetilde{\beta}_j\colon\widetilde{{{\mathfrak h}}}\to{{\mathbb R}}$ satisfying $\widetilde{\chi}_j\circ Q=\chi_j\vert_H$ and $\widetilde{\beta}_j\circ q=\beta_j\vert_{{{\mathfrak h}}}$ for $j=1,\dots,m$. Defining $\widetilde{E}_0:=(\widetilde{\chi}_1,\dots,\widetilde{\chi}_m)\colon \widetilde{H}\to Z$, one also has $\widetilde{E}_0\circ Q=E$. If we also denote $$\widetilde{B_H}:=\{\widetilde{\beta}_j\mid j=1,\dots,m\}\subseteq\widetilde{{{\mathfrak h}}}^$$ then it is easily seen that Assertions , , and from the statement are respectively equivalent to the following assertions: 1. \[lattices\_proof\_item1\] The subgroup $\widetilde{E}_0(\widetilde{H})\subseteq Z$ is closed. 2. \[lattices\_proof\_item2\] One has $\dim_{{{\mathbb R}}}({{\rm span}}_{{{\mathbb R}}}(\widetilde{B_H}))=\dim_{{\mathbb Q}}({{\rm span}}_{{\mathbb Q}}(\widetilde{B_H}))$. 3. \[lattices\_proof\_item3\] The additive subgroup $\langle \widetilde{B_H}\rangle={\mathbb Z}\widetilde{\beta}_1+\cdots+{\mathbb Z}\widetilde{\beta}_m\subseteq\widetilde{{{\mathfrak h}}}^$ is discrete. Here $\widetilde{H}$ is an abelian (simply connected) Lie group, hence one easily obtains that Assertions – are equivalent by [@Bo74 Ch. VII, §1, no. 5]. Moreover, as we already noted at the beginning of the present proof, Assertions – are equivalent by Lemma \[dic0\]. Therefore Assertions – are equivalent, and we are done. Let $v\in\setminus\{0\}$. Restricting the representation $\pi\colon G\to{{\rm End}}_{{{\mathbb R}}}({{\mathcal V}})$ to its invariant subspace $\bigoplus\limits_{j\in{{\rm supp}}\,v}{{\mathcal V}}_j$, we may assume $v\in X$, hence $v=v_1+\cdots+v_m\in X$ with $v_j\in{{\mathcal V}}_j\setminus\{0\}$ for $j=1,\dots,m$. Denote $w:=q(v)\in W$ and its corresponding isotropy group $G_{\widetilde{\nu}}(w):=\{g\in G\mid \widetilde{\nu}(g,w)=w\}$, which actually satisfies $$\label{ArCuOu16_Th3.6_proof_eq1} G_{\widetilde{\nu}}(w)=G_\nu(v).$$ In fact, for arbitrary $g\in G$, $$\nu(g)v=v\iff q(\nu(g)v)=q(v)\iff \widetilde{\nu}(g,q(v))=q(v) \iff g\in G_{\widetilde{\nu}}(w)$$ since the mapping $q\vert_{\nu(G)v}$ is injective by Lemma \[18March2019\] and that the diagram from that lemma is commutative. Recall from Remark \[enupi\] that $\nu\colon G\to{{\rm End}}({{\mathcal V}})$ is a unipotent representation, hence $\nu(G)v$ is a locally compact subset of ${{\mathcal V}}$. (See for instance [@CG90 Th. 3.1.4].) This implies by Lemma \[18March2019\] that the subset $G.w\subseteq W$ is locally compact. Using and the commutative diagram from Lemma \[18March2019\], it then follows by Lemma \[ACDO3.1\_gen\] that one has $$\pi(G)v\text{ locally compact }\subseteq {{\mathcal V}}\iff \pi(G_\nu(v))v\text{ locally compact }\subseteq{{\mathcal V}}.$$ Thus, to complete the proof that Assertions – are equivalent, it suffices to show the following: $$\label{ArCuOu16_Th3.6_proof_eq2} \pi(G_\nu(v))v\text{ locally compact }\subseteq{{\mathcal V}}\iff E_0(G)\text{ closed }\subseteq Z.$$ To this end we recall that $$G_\nu(v)=\{g\in G\mid\nu(g)v=v\}=\{g\in G\mid\nu(g)v_j=v_j\text{ for }j=1,\dots,m\}$$ hence $$(\forall g\in G_\nu(v))\quad \pi(g)v=E(g)\nu(g)v =\sum_{j=1}^m E(g)\nu(g)v_j =\sum_{j=1}^m E(g)v_j =\sum_{j=1}^m \chi_j(g)v_j.$$ This easily implies that the mapping $$\pi(G_\nu(v))v\to E_0(G_\nu(v)),\quad \pi(g)v\mapsto (\chi_1(g),\dots,\chi_m(g))=E_0(g)$$ is a homeomorphism, and then $\pi(G_\nu(v))v$ is a locally compact subset of ${{\mathcal V}}$ if and only if $E_0(G_\nu(v))$ is a locally compact subset of $Z$. This is further equivalent to the condition that $E_0(G_\nu(v))$ be a locally closed subset of $Z$ by [@Wi07 Lemma 1.26]. Since $E_0(G_\nu(v))$ is actually a subgroup of $Z$, and any subgroup of a topological group is locally closed if and only if it is closed (by [@Ho65 Ch. I, Prop. 2.1]), the proof of is complete. Assertions – are equivalent by Lemma \[lattices\], and this completes the proof. Theorem \[15March2019\] below is a generalization of [@ArCuOu16 Cor. 5.6] from abelian to general nilpotent Lie groups. We use the following notation. \[pre\_15March2019\] Let $k_0:=\min\limits_{v\in{{\mathcal V}}}\dim{{\mathfrak g}}_\nu(v)$, ${{\mathcal V}}_{{\rm gen}}:=\{v\in{{\mathcal V}}\mid\dim{{\mathfrak g}}_\nu(v)=k_0\}$, and $$\Gamma:=\{v\in{{\mathcal V}}\mid \pi(G)v\text{ locally compact }\subseteq{{\mathcal V}}\}.$$ Then the set ${{\mathcal V}}_{{\rm gen}}$ is an open dense $\pi(G)$-invariant subset of ${{\mathcal V}}$ and one has ${{\mathcal V}}_{{\rm gen}}\subseteq X$. \[15March2019\] Let $G$ be a nilpotent Lie group and $\pi\colon G\to{{\rm End}}_{{{\mathbb R}}}({{\mathcal V}})$ a continuous representation on the finite-dimensional real vector space ${{\mathcal V}}$. If ${{\mathfrak m}}\subseteq{{\mathfrak g}}$ is a linear subspace for which the set $$\label{15March2019_eq1} {{\mathcal V}}_{{\mathfrak m}}:=\{v\in{{\mathcal V}}\mid{{\mathfrak g}}_\nu(v)\dotplus{{\mathfrak m}}={{\mathfrak g}}\}$$ is a dense open subset of ${{\mathcal V}}_{{\rm gen}}$ then exactly one of the following cases occurs: 1. \[15March2019\_item1\] The set ${{\rm Int}\,}({{\mathcal V}}_{{\mathfrak m}}\cap\Gamma)$ is a dense open subset of ${{\mathcal V}}_{{\mathfrak m}}$. 2. \[15March2019\_item2\] The set ${{\mathcal V}}_{{\mathfrak m}}\setminus\Gamma$ is dense in ${{\mathcal V}}_{{\mathfrak m}}$, and either ${{\rm Int}\,}({{\mathcal V}}_{{\mathfrak m}}\setminus\Gamma)=\emptyset$ or ${{\rm Int}\,}({{\mathcal V}}_{{\mathfrak m}}\setminus\Gamma)$ is dense in ${{\mathcal V}}_{{\mathfrak m}}$. If ${{\mathcal V}}_{{\mathfrak m}}\cap\Gamma=\emptyset$, then clearly holds true. Now let us assume ${{\mathcal V}}_{{\mathfrak m}}\cap\Gamma\ne\emptyset$ and select $v_0\in{{\mathcal V}}_{{\mathfrak m}}\cap\Gamma$. The proof proceeds in several steps. Recall that for every linear subspace ${{\mathfrak h}}\in{{\rm Gr}}_{{\mathfrak m}}({{\mathfrak g}})$ we denote by $E_{{\mathfrak m}}({{\mathfrak h}})\colon {{\mathfrak g}}\to{{\mathfrak g}}$ its corresponding oblique projection onto ${{\mathfrak h}}$, corresponding to the direct sum decomposition ${{\mathfrak g}}={{\mathfrak h}}\dotplus{{\mathfrak m}}$. Step 1. The function $\Psi\colon{{\mathcal V}}_{{\mathfrak m}}\to{{\mathcal B}}({{\mathfrak g}})$, $\Psi(v):=E_{{\mathfrak m}}({{\mathfrak g}}_\nu(v))$ is rational. This follows by Proposition \[norm0\], for $T\colon {{\mathcal V}}_{{\mathfrak m}}\to{{\mathcal B}}({{\mathfrak g}},{{\mathcal V}})$, $T(v):={{\rm d}}\nu(\cdot)v$, which satisfies ${{\rm Ker}\,}T(v)={{\mathfrak g}}_\nu(v)\in{{\rm Gr}}_{{\mathfrak m}}({{\mathfrak g}})$ for all $v\in{{\mathcal V}}_{{\mathfrak m}}$. Step 2. For every $j=1,\dots,m$ the function $$f_j\colon {{\mathcal V}}_{{\mathfrak m}}\to{{\mathfrak g}}_\nu(v_0)^,\quad f_j(v):=\beta_j\circ \Psi(v)\vert_{{{\mathfrak g}}_\nu(v_0)}$$ is rational and one has $$\label{15March2019_proof_eq1} {{\mathcal V}}_{{\mathfrak m}}\cap\Gamma=\{v\in{{\mathcal V}}_{{\mathfrak m}}\mid \langle f_1(v),\dots,f_m(v)\rangle \text{ discrete }\subseteq{{\mathfrak g}}_\nu(v_0)^\}.$$ In fact, it directly follows by Step 1 that the functions $f_1,\dots,f_m\colon {{\mathcal V}}_{{\mathfrak m}}\to{{\mathfrak g}}_\nu(v_0)^$ are rational. Moreover, for arbitrary $v\in{{\mathcal V}}_{{\rm gen}}$ one has ${{\mathfrak m}}\cap {{\mathfrak g}}_\nu(v_0)=\{0\}$. It is then straightforward to check that the linear operator $$\Psi(v)\vert_{{{\mathfrak g}}_\nu(v_0)}\colon{{\mathfrak g}}_\nu(v_0)\to{{\mathfrak g}}_\nu(v)$$ is injective hence invertible since $\dim{{\mathfrak g}}_\nu(v)=\dim{{\mathfrak g}}_\nu(v_0)$. One then obtains for arbitrary $v\in{{\mathcal V}}_{{\mathfrak m}}$ $$\begin{aligned} \langle \beta_1\vert_{{{\mathfrak g}}_\nu(v)},\dots, & \beta_m\vert_{{{\mathfrak g}}_\nu(v)}\rangle\text{ discrete }\subseteq{{\mathfrak g}}_\nu(v)^ \nonumber \\ & \iff \langle \beta_1\circ \Psi(v)\vert_{{{\mathfrak g}}_\nu(v_0)},\dots,\beta_m\circ \Psi(v)\vert_{{{\mathfrak g}}_\nu(v_0)}\rangle\text{ discrete }\subseteq{{\mathfrak g}}_\nu(v_0)^* \nonumber \\ & \iff \langle f_1(v),\dots,f_m(v)\rangle\text{ discrete }\subseteq{{\mathfrak g}}_\nu(v_0)^* \nonumber \end{aligned}$$ and now follows by Theorem \[ArCuOu16\_Th3.6\] since ${{\mathcal V}}_{{\mathfrak m}}\subseteq{{\mathcal V}}_{{\rm gen}}\subseteq X$. (See Notation \[pre\_15March2019\] and \[not\_X\].) Step 3. The above Step 2 shows that Lemma \[dic3\] is applicable with $A={{\mathcal V}}_{{\mathfrak m}}\cap\Gamma$, and we then obtain that either ${{\mathcal V}}_{{\mathfrak m}}\cap\Gamma$ is an open dense subset of ${{\mathcal V}}_{{\mathfrak m}}$, or ${{\mathcal V}}_{{\mathfrak m}}\setminus\Gamma$ ($={{\mathcal V}}_{{\mathfrak m}}\setminus A$) is a dense subset of ${{\mathcal V}}_{{\mathfrak m}}$. This completes the proof. \[main\_reg\] In the conditions and notation of Theorem \[15March2019\], exactly one of the following cases can occur: 1. The set ${{\rm Int}\,}\Gamma$ is dense in ${{\mathcal V}}$. 2. The set ${{\mathcal V}}\setminus \Gamma$ is dense in ${{\mathcal V}}$, and either ${{\rm Int}\,}({{\mathcal V}}\setminus\Gamma)=\emptyset$ or ${{\rm Int}\,}({{\mathcal V}}\setminus\Gamma)$ is dense in ${{\mathcal V}}$. It follows by Example \[strat\] and that there exists a linear subspace ${{\mathfrak m}}\subseteq{{\mathfrak g}}$ with $\dim({{\mathfrak g}}/{{\mathfrak m}})=k_0$ for which the set ${{\mathcal V}}_{{\mathfrak m}}$ defined in is a dense open subset of ${{\mathcal V}}_{{\rm gen}}$. Theorem \[15March2019\] is then applicable, and one directly obtains the assertion, since ${{\mathcal V}}_{{\rm gen}}$ is in turn a dense open subset of ${{\mathcal V}}$. \[correm\] The above corollary implies that ${{\rm Int}\,}\Gamma$ is not dense in ${{\mathcal V}}$ if and only if ${{\rm Int}\,}\Gamma=\emptyset$. \[27August2019\] If the group $G$ is abelian, then exactly one of the following cases can occur: 1. The set ${{\rm Int}\,}\Gamma$ is dense in ${{\mathcal V}}$. 2. The transformation-group $C^$-algebra $G\ltimes {{\mathcal C}}_0({{\mathcal V}})$ is antiliminary. The transformation-group $C^$-algebra $G\ltimes {{\mathcal C}}_0({{\mathcal V}})$ is not antiliminary if and only if it has at least one nonzero postliminary ideal, that is, if and only if its largest postliminary ideal is nonzero. Since the group $G$ is abelian, the largest postliminary ideal of $G\ltimes {{\mathcal C}}_0({{\mathcal V}})$ is $G\ltimes {{\mathcal C}}_0({{\rm Int}\,}\Gamma)$ by [@aHWi02 Th. 3.16 and Rem. 3.17]. Therefore $G\ltimes {{\mathcal C}}_0({{\mathcal V}})$ is not antiliminary if and only if $G\ltimes {{\mathcal C}}_0({{\rm Int}\,}\Gamma)\ne\{0\}$, which is further equivalent to ${{\rm Int}\,}\Gamma\ne\emptyset$. Finally, by Corollary \[main\_reg\], one has ${{\rm Int}\,}\Gamma\ne\emptyset$ if and only if ${{\rm Int}\,}\Gamma$ is dense in ${{\mathcal V}}$. It would be interesting to see whether Corollary \[27August2019\] holds true for nonabelian nilpotent Lie groups $G$ as well. \[main\_reg\_ab\] As in Setting \[sett\_decomp\], let $G$ be a nilpotent Lie group with a continuous finite-dimensional representation $\pi\colon G\to{{\rm End}}_{{{\mathbb R}}}({{\mathcal V}})$. One can then form the semidirect product of Lie groups $S:={{\mathcal V}}\rtimes_\pi G$, which is a solvable Lie group with its Lie algebra ${{\mathfrak s}}:={{\mathcal V}}\rtimes_{{{\rm d}}\pi}{{\mathfrak g}}$ obtained as a semidirect product of Lie algebras, however the relation between the coadjoint orbits of $S$ and the $G$-orbits in ${{\mathcal V}}$ is rather involved especially if the group $G$ is nonabelian, as discussed in [@Ra75] and [@Ba98]. Specifically, the dual of the Lie algebra of $S$ is ${{\mathfrak s}}^={{\mathcal V}}^\times{{\mathfrak g}}^$, and the coadjoint action ${{\rm Ad}}_S^\colon S\times{{\mathfrak s}}^\to{{\mathfrak s}}^$ is given by the formula $$\label{main_reg_ab_eq1} ({{\rm Ad}}_S^(v,g))(p,\xi)=(\pi(g)^p,{{\rm Ad}}_G^(g)\xi-\theta_p(v))$$ for all $v\in {{\mathcal V}}$, $g\in G$, $p\in{{\mathcal V}}^$, and $\xi\in{{\mathfrak g}}^$, where $\theta_p\colon {{\mathcal V}}\to{{\mathfrak g}}^$, $v\mapsto \langle{{\rm d}}\pi(\cdot)^p,v\rangle$ and $\langle\cdot,\cdot\rangle\colon{{\mathcal V}}^\times{{\mathcal V}}\to{{\mathbb R}}$ is the natural duality pairing. Using these remarks, a version of Corollary \[main\_reg\] in the special case when $G$ is abelian studied in [@ArCuDaOu13] and [@ArCuOu16] can be alternatively obtained as follows. Namely, if $G$ is abelian, then ${{\rm Ad}}_G^(g)\xi=\xi$ for all $g\in G$ and $\xi\in{{\mathfrak g}}^$, hence, by , $$\label{main_reg_ab_eq2} ({{\rm Ad}}_S^(S))(p,\xi)=\pi(G)^p\times (\xi+\theta_p({{\mathcal V}}))\subseteq{{\mathcal V}}^\times{{\mathfrak g}}^ \text{ for all }p\in{{\mathcal V}}^,\ \xi\in{{\mathfrak g}}^.$$ Here $\xi+\theta_p({{\mathcal V}})$ is an affine subspace, hence a closed subset of ${{\mathfrak g}}^$. On the other hand, it is straightforward to check that for any topological spaces $X$ and $Y$, a subset $A\subseteq X$ is locally closed if and only if $A\times Y\subseteq X\times Y$ is locally closed. Therefore implies that, for any $p\in{{\mathcal V}}^$ and $\xi\in{{\mathfrak g}}^$, the $G$-orbit $\pi(G)^p\subseteq {{\mathcal V}}^$ is locally closed if and only if the coadjoint $S$-orbit $({{\rm Ad}}_S^(S))(p,\xi)\subseteq{{\mathfrak s}}^$ is locally closed. On the other hand, since $S$ is a connected solvable Lie group, it follows by [@Pu71 Ch. IV, Prop. 8.2] that, denoting by $E_c$ the set of all points of ${{\mathfrak s}}^$ whose coadjoint orbits are locally closed, then either $E_c$ or its complement ${{\mathfrak s}}^\setminus E_c$ have Lebesgue measure zero. Therefore, by the above remarks, either the set $\Gamma^$ of points in ${{\mathcal V}}^$ whose $G$-orbits are locally closed, or its complement ${{\mathcal V}}^\setminus\Gamma^$, have Lebesgue measure zero. This is the aforementioned version of Corollary \[main\_reg\] for the representation $\pi^\colon G\to{{\rm End}}({{\mathcal V}})^$, $g\mapsto\pi(g^{-1})^$ when $G$ is abelian. Moreover, by again, all $G$-orbits in ${{\mathcal V}}^$ are locally closed if and only if all coadjoint $S$-orbits are locally closed. If this is the case, then one also has: 1. The set $\widehat{S}\setminus\widehat{G}$ is a dense open subset of the unitary dual space $\widehat{G}$ by [@ArKS12 Lemma 4.15]. (We note that $G\simeq S/{{\mathcal V}}$, hence $\widehat{G}$ is always a closed subset of $\widehat{S}$.) 2. The solvable Lie group $S$ is type I by [@AuKo71 Th. V.3.4], since the coadjoint $S$-orbit symplectic forms are exact, for instance by [@Ba98 Prop. 4.4(1.)]. Compare [@ArCuDa12 Prop. 4.3] and Theorem \[post-anti\] below. Application to generalized $ax+b$-groups {#Sect_ax+b} ======================================== A generalized $ax+b$-group is a connected simply connected solvable Lie group having a 1-codimensional abelian ideal. See also Definition \[def\_ax+b\] for an alternative description of these groups. We study the type I ideals of the $C^$-algebra of such a group, and our main result (Theorem \[post-anti\]) is a precise characterization of the generalized $ax+b$-groups whose $C^$-algebra is antiliminary, that is, no closed 2-sided ideal is type I. We also discuss the representation theoretic significance of this property (Remark \[III\]). In what follows in this section, unless otherwise mentioned, ${{\mathcal V}}$ is a finite-dimensional real vector space and $D\in {{\rm End}}({{\mathcal V}})$. \[def\_ax+b\] We define the Lie algebra ${{\mathfrak g}}_D:={{\mathcal V}}\rtimes_D{{\mathbb R}}$ with its Lie bracket $$[(v_1,t_1),(v_2,t_2)]:=(t_1Dv_2-t_2Dv_1,0)$$ and the Lie group $G_D:={{\mathcal V}}\rtimes_D{{\mathbb R}}$ with its product given by $$(v_1,t_1)\cdot(v_2,t_2)=(v_1+{{\rm e}}^{t_1D}v_2, t_1+t_2).$$ Then ${{\mathfrak g}}_D$ is the Lie algebra of $G_D$. We make the following lemma for the sake of completeness. \[Diophant\] For any set $S\subseteq{{\mathbb R}}$ the subgroup of $({{\mathbb R}},+)$ generated by $S$ is closed if and only if there exists $\theta\in{{\mathbb R}}\setminus\{0\}$ with $S\subseteq\{r\theta\mid r\in{\mathbb Q}\}$, which is further equivalent to $\dim_{{\mathbb Q}}({{\rm span}}_{{\mathbb Q}}(S))=1$. This follows from the well-known fact that for any $\theta_1,\theta_2\in{{\mathbb R}}\setminus\{0\}$ the set $\{m_1\theta_1+m_2\theta_2\mid m_1,m_2\in{\mathbb Z}\}$ is dense in ${{\mathbb R}}$ if and only if $\theta_1/\theta_2\in{{\mathbb R}}\setminus{\mathbb Q}$. \[elliptic\] Let ${{\mathcal V}}$ be a finite-dimensional real vector space, $D\in {{\rm End}}({{\mathcal V}})$, and consider the following conditions: 1. \[elliptic\_item1\] For each $v\in{{\mathcal V}}$ the image of the map $\gamma_v\colon {{\mathbb R}}\to{{\mathcal V}}$, $t\mapsto{{\rm e}}^{tD}v$, is a locally closed subset of ${{\mathcal V}}$. 2. \[elliptic\_item2\] There exists $\theta\in{{\mathbb R}}\setminus\{0\}$ with $\sigma(D)\cap{{\rm i}}{{\mathbb R}}\subseteq\{{{\rm i}}r\theta\mid r\in{\mathbb Q}\}$. Then one has $\Rightarrow$. If moreover $D$ is semisimple and $\sigma(D)\subseteq{{\rm i}}{{\mathbb R}}$, then one also has $\Rightarrow$. $\Rightarrow$ It suffices to prove that for any $\theta_1,\theta_2\in{{\mathbb R}}\setminus\{0\}$ with ${{\rm i}}\theta_1,{{\rm i}}\theta_2\in\sigma(D)\cap{{\rm i}}{{\mathbb R}}$ one has $\theta_1/\theta_2\in{\mathbb Q}$. We will prove this by contradiction, so let us assume $\theta_1/\theta_2\in{{\mathbb R}}\setminus{\mathbb Q}$. We select $x_j,y_j\in{{\mathcal V}}\setminus\{0\}$ with $D(x_j+{{\rm i}}y_j)={{\rm i}}\theta_j(x_j+{{\rm i}}y_j) \in{{\mathcal V}}_{{{\mathbb C}}}={{\mathbb C}}\otimes_{{{\mathbb R}}}{{\mathcal V}}$ for $j=1,2$, and let us define $v:=x_1+y_1+x_2+y_2$. We also denote ${{\mathcal V}}_2:={{\rm span}}_{{{\mathbb R}}}\{x_1,x_2,y_1,y_2\}$ and we define the ${{\mathbb R}}$-linear isomorphism $B\colon{{\mathcal V}}_2\to{{\mathbb C}}^2$ with $B(x_1+y_1)=(1,0)$ and $B(x_2+y_2)=(0,1)$. Then the point $w:=(1,1)\in{{\mathbb C}}^2$ satisfies $w=Bv$ and, defining $\gamma(t):=B{{\rm e}}^{tD}B^{-1}$, one has $$\gamma(t)=\begin{pmatrix} {{\rm e}}^{{{\rm i}}t\theta_1} & 0 \\ 0 & {{\rm e}}^{{{\rm i}}t\theta_2} \end{pmatrix}.$$ Since $\theta_1/\theta_2\in{{\mathbb R}}\setminus{\mathbb Q}$, it is easily checked that the map $\gamma(\cdot)w$ is injective and on the other hand, it is well known that its image is dense in the torus ${{\mathbb T}}^2$. Therefore, if $\gamma({{\mathbb R}})w$ were a locally closed subset of ${{\mathbb C}}$, then $\gamma({{\mathbb R}})w$ would be an open subset of the torus ${{\mathbb T}}^2$, which is not the case since $\gamma({{\mathbb R}})$ is a subgroup of ${{\mathbb T}}^2$ and $\gamma({{\mathbb R}})\subsetneqq{{\mathbb T}}^2$. It then follows that neither $B^{-1}\gamma({{\mathbb R}})w$ is a locally closed subset of ${{\mathcal V}}_2$, that is, the image of the map $\gamma_v$ fails to be a locally closed subset of ${{\mathcal V}}$, which is a contradiction with . Assume now that $D$ is semisimple and $\sigma(D)\subseteq{{\rm i}}{{\mathbb R}}$. $\Rightarrow$ Specializing Setting \[sett\_decomp\] for $G=({{\mathbb R}},+)$ and $\pi(t):={{\rm e}}^{tD}$ for all $t\in {{\mathbb R}}$, we may assume that ${{\mathcal V}}={{\mathbb C}}^n$ and $D$ is a diagonal matrix having purely imaginary diagonal entries, say $$D=\begin{pmatrix} {{\rm i}}\theta_1 & & 0 \\ &\ddots & \\ 0 & & {{\rm i}}\theta_n \end{pmatrix}$$ By the hypothesis , there exist $\theta\in{{\mathbb R}}\setminus\{0\}$ and $p_1,\dots,p_n\in{\mathbb Z}$, $q_1,\dots,q_n\in{\mathbb N}$ with $\theta_j=\theta p_j/q_j$ for $j=1,\dots,n$. Then, the group morphism $\gamma\colon{{\mathbb R}}\to U(n)$ ($\subseteq M_n({{\mathbb C}})$), $\gamma(t):={{\rm e}}^{tD}$, satisfies $\gamma(2\pi q_1\cdots q_n/\theta)={{\bf 1}}$. Therefore $\gamma({{\mathbb R}})$ is a homeomorphic image of the compact group ${{\mathbb R}}/{{\rm Ker}\,}\gamma\simeq{{\mathbb R}}/{\mathbb Z}$, that is, $\gamma({{\mathbb R}})$ is compact. This directly implies that for every $v\in{{\mathbb C}}^n$ its orbit ${{\rm e}}^{{{\mathbb R}}D}v=\gamma({{\mathbb R}})v$ is a compact subset of ${{\mathcal V}}$, and in particular is locally closed. \[Will\] One has a $$-isomorphism $C^(G_D)\simeq {{\mathcal C}}_0({{\mathcal V}}^)\rtimes_{\alpha^{D^}}{{\mathbb R}}$ by [@Wi07 Ex. 3.16], where $\alpha^{D^}\colon{{\mathbb R}}\times{{\mathcal C}}_0({{\mathcal V}}^)\to{{\mathcal C}}_0({{\mathcal V}}^)$, $\alpha^{D^}(t,f):=f\circ{{\rm e}}^{tD^}$. In the next theorem we use the following notation. \[sett\_post-anti\] For any $D\in{{\rm End}}({{\mathcal V}})$, we denote by $S_D:=\langle{{\rm i}}\sigma(D)\cap{{\mathbb R}}\rangle$ the subgroup of $({{\mathbb R}},+)$ generated by the imaginary parts of the purely imaginary eigenvalues of $D$. \[dyn\] For arbitrary $D\in{{\rm End}}({{\mathcal V}})$, the following assertions holds: 1. \[dyn\_item1\] The set $S_D$ is closed in ${{\mathbb R}}$ if and only if $\Gamma={{\mathcal V}}$. 2. \[dyn\_item2\] If the set $S_D$ is not closed in ${{\mathbb R}}$, then ${{\rm Int}\,}\Gamma$ is not dense in ${{\mathcal V}}$ if and only if $D_0\in{{\rm End}}({{\mathcal V}}_0)$ is semisimple and $n_-n_+=0$. We can see directly that if $\Gamma={{\mathcal V}}$ then $S_D$ is closed in ${{\mathbb R}}$ by Lemmas \[elliptic\] and \[Diophant\]. Also, by Corollary \[main\_reg\] or Remark \[correm\], we have that if ${{\rm Int}\,}\Gamma$ is not dense in ${{\mathcal V}}$ then ${{\rm Int}\,}\Gamma=\emptyset$. We use the notation of [@BB18 Sect. 2]. By [@BB18 Lemma 2.1 and proof of Th. 2.2] we may assume without loss of generality $$\label{dyn_proof_eq1} D= \begin{pmatrix} -{{\rm id}}_{{{\mathcal V}}_{-}} & 0 & 0 \\ 0 & D_0 & 0 \\ 0 & 0 & {{\rm id}}_{{{\mathcal V}}_{+}} \end{pmatrix}$$ with respect to the direct sum decomposition ${{\mathcal V}}={{\mathcal V}}_{-}\oplus{{\mathcal V}}_0\oplus{{\mathcal V}}_{+}$. For every $v\in{{\mathcal V}}$ we denote by $v=v_-+v_0+v_+$ its decomposition with $v_0\in{{\mathcal V}}_0$ and $v_\pm\in{{\mathcal V}}_\pm$. For the remanining implication in , as well as for we discuss separately the three cases that can occur. Case 1: $D_0$ is not semisimple. Let $D_0=S_0+N_0$ be the Jordan decomposition with $S_0,N_0\in{{\rm End}}({{\mathcal V}}_0)$, where $S_0$ is semisimple, $N_0$ is nilpotent, and $S_0N_0=N_0S_0$. The assumption that $D_0$ is not semisimple is equvalent to $N_0\ne 0$. For every $v\in{{\mathcal V}}_0\setminus{{\rm Ker}\,}N_0$ one has $\lim\limits_{t\to\pm\infty}\Vert {{\rm e}}^{tD_0}v\Vert=\infty$ (see for instance [@BB18 Step 2 in the proof of Lemma 2.13]). This implies that for every $v\in{{\mathcal V}}$ with $v_0\in{{\mathcal V}}_0\setminus{{\rm Ker}\,}N_0$ one has $\lim\limits_{t\to\pm\infty}\Vert {{\rm e}}^{tD}v\Vert=\infty$, hence the orbit ${{\rm e}}^{{{\mathbb R}}D}v$ is locally closed by Lemma \[ACDO2.3\_new\]($\Rightarrow$). Thus ${{\rm Int}\,}\Gamma$ is dense in ${{\mathcal V}}$. If moreover $S_D$ is closed in ${{\mathbb R}}$ then, using Lemma \[elliptic\] for $D_0\vert_{{{\rm Ker}\,}N}$, we obtain that the orbit ${{\rm e}}^{{{\mathbb R}}D}v$ is locally closed even for $v\in{{\rm Ker}\,}N$, hence actually ${{\mathcal V}}_0\subseteq\Gamma$. In addition, if $v\in{{\mathcal V}}\setminus{{\mathcal V}}_0$, then either $v_-\ne0$ or $v_+\ne0$, hence by the mapping ${{\mathbb R}}\to{{\mathcal V}}$, $t\mapsto {{\rm e}}^{tD}v$, is injective and then Lemma \[ACDO2.3\_new\] implies that the orbit ${{\rm e}}^{{{\mathbb R}}D}v$ is locally closed in ${{\mathcal V}}$. Indeed, if for instance $v_-\ne0$, $\lim\limits_{n\in{\mathbb N}}\vert t_n\vert=\infty$, and $\lim\limits_{n\in{\mathbb N}}{{\rm e}}^{t_n D}v=v$, then one has $v_-=\lim\limits_{n\in{\mathbb N}}{{\rm e}}^{t_n D}v_- =\lim\limits_{n\in{\mathbb N}}{{\rm e}}^{t_n}v_-$. Since $v_-\ne0$, this is impossible since $\lim\limits_{n\in{\mathbb N}}\vert t_n\vert=\infty$ and at least one of the sets $\{n\in{\mathbb N}\mid t_n>0\}$ and $\{n\in{\mathbb N}\mid t_n<0\}$ is infinite. Case 2: $D_0$ is semisimple and $n_-\ne0\ne n_+$. For every $v\in{{\mathcal V}}$ with $v_-\ne0$ and $v_+\ne0$ one has $\lim\limits_{t\to\pm\infty}\Vert {{\rm e}}^{tD}v\Vert=\infty$ by and then, as above, the orbit ${{\rm e}}^{{{\mathbb R}}D}v$ is locally closed by Lemma \[ACDO2.3\_new\]($\Rightarrow$). Therefore ${{\rm Int}\,}\Gamma$ is dense in ${{\mathcal V}}$. If moreover $S_D$ is closed in ${{\mathbb R}}$ then, using Lemma \[elliptic\] for $D_0$, we obtain that the orbit ${{\rm e}}^{{{\mathbb R}}D}v$ is locally closed even for $v\in{{\mathcal V}}_0$, hence actually ${{\mathcal V}}_0\subseteq\Gamma$ and then also ${{\mathcal V}}\setminus{{\mathcal V}}_0\subseteq\Gamma$ just as in Case 1 above. Case 3: $D_0$ is semisimple and one has either $n_-=0$ or $n_+=0$. Let us assume for instance $n_+=0$. If moreover $S_D$ is closed in ${{\mathbb R}}$ then ${{\mathcal V}}_0\subseteq\Gamma$ and ${{\mathcal V}}\setminus{{\mathcal V}}_0\subseteq\Gamma$ as in Case 2 above. To complete the proof it remains to show that if $S_D$ is not closed in ${{\mathbb R}}$ then ${{\rm Int}\,}\Gamma=\emptyset$. In this case, specializing Setting \[sett\_decomp\] for $G=({{\mathbb R}},+)$ and $\pi(t):={{\rm e}}^{tD_0}$ for all $t\in G$, we may assume that ${{\mathcal V}}_0={{\mathbb C}}^n$ and $D_0$ is a diagonal matrix having purely imaginary diagonal entries. In the notation of Definition \[sett\_decomp\_def\], for every $v_0\in{{\mathcal V}}_0$ one then has $G_\nu(v_0)=G={{\mathbb R}}$ hence ${{\mathfrak g}}_\nu(v_0)={{\mathbb R}}$. Then Theorem \[ArCuOu16\_Th3.6\] along with the hypothesis that $S_D$ is not closed in ${{\mathbb R}}$ imply that the orbit ${{\rm e}}^{{{\mathbb R}}D_0}v_0$ is not locally compact in ${{\mathcal V}}_0$ for every $v_0\in({{\mathbb C}}^\times)^n$. This shows that ${{\rm Int}\,}\Gamma=\emptyset$ if $n_-=0$. If $n_-\ne0$, then we show that for arbitrary $v\in{{\mathcal V}}$ with $v_0\in({{\mathbb C}}^\times)^n$ the orbit ${{\rm e}}^{{{\mathbb R}}D}v$ is not locally compact, hence $v\not\in\Gamma$, which entails ${{\rm Int}\,}\Gamma=\emptyset$. In fact, using the hypothesis that $S_D={\mathbb Z}\theta_1+\cdots+{\mathbb Z}\theta_n$ is not closed in ${{\mathbb R}}$, it is straightforward to check that the mapping ${{\mathbb R}}\to{{\mathcal V}}_0$, $t\mapsto{{\rm e}}^{tD_0}v_0$, is injective. Then, by Lemma \[ACDO2.3\_new\], there exists a sequence $\{t_n\}_{n\in{\mathbb N}}$ in ${{\mathbb R}}$ satisfying $\lim\limits_{n\to\infty}\vert t_n\vert=\infty$ and $\lim\limits_{n\to\infty}{{\rm e}}^{t_nD_0}v_0=v_0$. Selecting a suitable subsequence and then perhaps replacing $t_n$ by $-t_n$ and using $\Vert {{\rm e}}^{t_n D_0}\Vert=1$, we may assume $t_n>0$ for every $n\in{\mathbb N}$. Then, since $n_-\ne0$, it follows by that $\lim\limits_{n\to\infty}{{\rm e}}^{t_nD}v_-=v_-$. Therefore $\lim\limits_{n\to\infty}{{\rm e}}^{t_nD}v=v$ hence, byzz Lemma \[ACDO2.3\_new\] again, the orbit ${{\rm e}}^{{{\mathbb R}}D}v$ is not locally compact. \[anHuefWilliams\] Let $\alpha\colon H\times X\to X$ be a continuous action of a locally compact group on a locally compact space, and assume that both $H$ and $X$ are second countable and $H$ is amenable. If $H$ is abelian, then the largest type I ideal of $H\ltimes {{\mathcal C}}_\infty(X)$ is $H\ltimes {{\mathcal C}}_\infty(X_0)$, where $X_0$ is the set of all points $x\in X$ having a neighborhood $U_x$ for which the orbit of every point in $U_x$ is locally closed in $X$. Since both $H$ and $X$ are second countable and $H$ is amenable, it follows that $H\ltimes {{\mathcal C}}_\infty(X)$ is EH-regular, as noted in [@aHWi02 page 537]. Then the assertion follows by [@aHWi02 Th. 3.16 and Rem. 3.17]. Assertion in the following theorem is well known and we give it a very short proof for the sake of completeness. \[post-anti\] For arbitrary $D\in{{\rm End}}({{\mathcal V}})$, the following assertions holds: 1. \[post-anti\_item1\] The set $S_D$ is closed in ${{\mathbb R}}$ if and only if $C^(G_D)$ is type I. 2. \[post-anti\_item2\] If $S_D$ is not closed in ${{\mathbb R}}$, then $D_0\in{{\rm End}}({{\mathcal V}}_0)$ is semisimple and $n_-n_+=0$ if and only if $C^(G_D)$ is antiliminary. Let $\Gamma^$ be the set of all $\xi\in{{\mathcal V}}^$ whose orbit ${{\rm e}}^{{{\mathbb R}}D^}\xi$ is locally closed in ${{\mathcal V}}^$, and recall that $\sigma(D^)=\sigma(D)$. Then, by Lemma \[dyn\] applied for $D^$ instead of $D$, the set $S_D$ is closed in ${{\mathbb R}}$ if and only if $\Gamma^={{\mathcal V}}^$. On the other hand, since $C^(G_D)\simeq{{\mathcal C}}_0({{\mathcal V}}^)\rtimes_{\alpha_{D^}}{{\mathbb R}}$ (see Remark \[Will\]), it follows either by [@Go73 Th. 3.3] or by Theorem \[anHuefWilliams\] that $\Gamma^={{\mathcal V}}^$ if and only if $C^(G_D)$ is type I. As above, by Lemma \[dyn\] applied for $D^$ instead of $D$, if $S_D$ is not closed in ${{\mathbb R}}$ then the conditions $D_0\in{{\rm End}}({{\mathcal V}}_0)$ is semisimple and $n_-n_+=0$ are satisfied if and only if ${{\rm Int}\,}\Gamma^=\emptyset$. By Theorem \[anHuefWilliams\], this is the case if and only if the largest postliminary ideal of ${{\mathcal C}}_0({{\mathcal V}}^)\rtimes_{\alpha_{D^}}{{\mathbb R}}$ is equal to $\{0\}$, that is, if and only if $C^(G_D)$ is antiliminary. \[III\] For any $C^$-algebra ${{\mathcal A}}$ let us denote by $F({{\mathcal A}})$ its set of factorial states, that is, the states $\varphi\in{{\mathcal A}}^$ whose corresponding GNS representation $\pi_\varphi\colon {{\mathcal A}}\to{{\mathcal B}}({{\mathcal H}}_\varphi)$ satisfies $\pi_\varphi({{\mathcal A}})'\cap\pi_\varphi({{\mathcal A}})''={{\mathbb C}}{{\bf 1}}$. We also denote by $F_{\rm III}({{\mathcal A}})$ the set of all $\varphi\in F({{\mathcal A}})$ for which the factor $\pi_\varphi({{\mathcal A}})''$ is type III. We endow $F({{\mathcal A}})$ with its weak$^$-topology inherited as a subset of the dual space ${{\mathcal A}}^$. Then the $C^$-algebra ${{\mathcal A}}$ is antiliminary if and only if $F_{\rm III}({{\mathcal A}})$ is dense in $F({{\mathcal A}})$, by [@ArBa86 Th. 2.1]. (The analogous result for type II also holds if ${{\mathcal A}}$ is separable.) Let $G$ be a locally compact group. It follows from the aforementioned result along with [@Di69 18.1.4] that $C^(G)$ is antiliminary if and only if every factor representation of $G$ is weakly contained in the type III factor representations of $G$, in the sense that every coefficient of any factor representation of $G$ can be uniformly approximated on compacts by coefficients of type III factor representations of $G$. On the other hand, if $G$ is a connected, simply connected, solvable Lie group, and its quasi-dual $\overline{G}$ is endowed with the equivalence class of measures arising from the factor disintegrations of left regular representation as in [@Di69 8.4.3], then the subset $\overline{G}_{\rm III}$ of $\overline{G}$ corresponding to the type III factor representations is negligible by [@Pu71 Ch. IV, Cor. 7.2]. Nevertheless, $\overline{G}_{\rm III}$ may not be negligible from a topological point of view. Specifically, it follows by the above remarks that Theorem \[post-anti\] provides specific examples illustrating both cases that can occur: either $\overline{G}$ is weakly contained in (hence weakly equivalent to) $\overline{G}_{\rm III}$ or not, depending on whether $C^(G)$ is antiliminary or not. \[Mautner\] Recalling the Mautner group $G_\theta:=G_{D_\theta}={{\mathbb C}}^2\rtimes_{\alpha_{D_\theta}}{{\mathbb R}}$ defined by $$D_\theta=\begin{pmatrix} {{\rm i}}& 0 \\ 0 & {{\rm i}}\theta \end{pmatrix}\in M_2({{\mathbb C}})$$ for $\theta\in{{\mathbb R}}\setminus{\mathbb Q}$, it follows by Theorem \[post-anti\] that $C^(G_\theta)$ is antiliminary. Also, $C^(G_\theta)$ is not a simple $C^$-algebra, in the sense that it has nontrivial closed 2-sided ideals. For instance, using the short exact sequence of groups $$0\to {{\mathbb C}}^2\hookrightarrow G_\theta\to {{\mathbb R}}\to 0$$ one obtains the short exact sequence $$0\to{{\mathcal J}}\hookrightarrow C^(G_\theta)\to {{\mathcal C}}_0({{\mathbb R}})\to 0$$ for a suitable nontrivial ideal ${{\mathcal J}}$. The ideal ${{\mathcal J}}$ is antiliminary since $C^(G_\theta)$ is antiliminary. On the other hand, every primitive ideal of $C^(G_\theta)$ is maximal, for instance by [@Pu73 Th. 2]. Equivalently, for every irreducible $$-representation $\pi\colon C^(G_\theta)\to{{\mathcal B}}({{\mathcal H}}_\pi)$ its corresponding primitive quotient $C^(G_\theta)/{{\rm Ker}\,}\pi\simeq \pi(C^(G_\theta))$ is a simple $C^$-algebra. It would be interesting to establish whether or not all the simple $C^$-algebras that arise in this way are quasidiagonal, that is, whether or not $C^(G_\theta)$ is strongly quasidiagonal. It is already known that the $C^$-algebra $C^(G_\theta)$ is quasidiagonal, as noted in [@BB18 end of Sect. 2]. [100000000]{} <span style="font-variant:small-caps;">E. Andruchow, G. Corach, M. Mbekhta</span>, A geometry for the set of split operators. Integral Equations Operator Theory* 77 (2013), no. 4, 559–579. , Ideals in transformation-group $C^\ast$-algebras. [J. Operator Theory]{} [48]{} (2002), no. 3, suppl., 535–548. , On factorial states of operator algebras. III. [J. Operator Theory]{} [15]{} (1986), no. 1, 53–81. , Norms of inner derivations for multiplier algebras of $C^$-algebras and group $C^$-algebras. [J. Funct. Anal.]{} [262]{} (2012), no. 5, 2050–2073. , Norms of inner derivations for multiplier algebras of $C^$-algebras and group $C^$-algebras, II. [Adv. Math.]{} [280]{} (2015), 225–255. , Canonical coordinates for a class of solvable groups. [Monatsh. Math.]{} [166]{} (2012), no. 1, 19–55. , Regularity of abelian linear actions. In: A. Mayeli, A. Iosevich, P.E.T. Jorgensen, G. Ólafsson (eds.), [Commutative and noncommutative harmonic analysis and applications]{}, Contemp. Math., 603, Amer. Math. Soc., Providence, RI, 2013, pp. 89–109. , Characterization of regularity for a connected Abelian action. [Monatsh. Math.]{} [180]{} (2016), no. 1, 1–37. , Polarization and unitary representations of solvable Lie groups. [Invent. Math.]{} [14]{} (1971), 255–354. , Semidirect products and the Pukanszky condition. [J. Geom. Phys.]{} [25]{} (1998), no. 3–4, 245–270. , [Theory of group representations and applications]{}. Second edition. World Scientific Publishing Co., Singapore, 1986. , Nonlinear oblique projections. [Linear Algebra Appl.]{} [533]{} (2017), 451–467. , Quasidiagonality of $C^$-algebras of solvable Lie groups. [Integral Equations Operator Theory]{} [90]{} (2018), no. 1, Art. 5, 21 pp. , [Topologie générale]{}. Chap. 5 à 10. Nouvelle édition. Hermann, Paris, 1974. , Characterizing abelian admissible groups. J. Geom. Anal. [25]{} (2015), no. 2, 1045–1074. , Lie algebras of finite and affine type. Cambridge Studies in Advanced Mathematics, 96. Cambridge University Press, Cambridge, 2005. <span style="font-variant:small-caps;">L.J. Corwin, F.P. Greenleaf</span>, Representations of nilpotent Lie groups and their applications. Cambridge Studies in Advanced Mathematics, 18. Cambridge University Press, Cambridge, 1990. , [Les $C^{\ast}$-algèbres et leurs représentations]{}. Deuxième édition. Cahiers Scientifiques, Fasc. XXIX. Gauthier-Villars Éditeur, Paris, 1969 <span style="font-variant:small-caps;">G.M. Diaz-Toca, L. Gonzalez-Vega, H. Lombardi</span>, Generalizing Cramer’s rule: solving uniformly linear systems of equations. [SIAM J. Matrix Anal. Appl.]{} [27]{} (2005), no. 3, 621–637. , The type of some $C^$- and $W^$-algebras associated with transformation groups. [Pacific J. Math.]{} [48]{} (1973), 93–106. , [The structure of Lie groups]{}. Holden-Day, Inc., San Francisco-London-Amsterdam, 1965. , Orbits and primitive ideals of solvable Lie algebras. [Math. Ann.]{} [298]{} (1994), no. 2, 275–326. , Unitary representations of solvable Lie groups. [Ann. Sci. École Norm. Sup. (4)]{} [4]{} (1971), 457–608. , The primitive ideal space of solvable Lie groups. [Invent. Math.]{} [22]{} (1973), 75–118. , Representations of a semi-direct product by quantization. [Math. Proc. Cambridge Philos. Soc.]{} [78]{} (1975), no. 2, 345–350. , [Crossed products of $C^$-algebras]{}. Mathematical Surveys and Monographs, 134. American Mathematical Society, Providence, RI, 2007.
A promising camptothecin derivative: Semisynthesis, antitumor activity and intestinal permeability. Oral administration of camptothecin (CPT) derivatives and other antitumoral agents is being actively developed in order to improve the quality of life of patients with cancer. Though several lipophilic derivatives of CPT have shown interesting oral bioavailability in preclinical and clinical studies, only Topotecan has been approved for this route of administration. Semisynthesis, antitumor activity, biological inhibition mechanism, and in situ intestinal permeability of 9, 10-[1,3]-Dioxinocamptothecin (CDiox), an unexplored CPT derivative, have been studied in this paper. The hexacyclic analog was as effective as Topotecan and CPT in different tumor cell lines, showing an expected similar apoptosis cell mechanism and high ability to inhibit DNA synthesis in HeLa, Caco-2, A375 and MDA-MB-231 cell lines. Furthermore, in vitro and in situ pharmacokinetics transport values obtained for CDiox displayed more favorable absorption profile than CPT and Topotecan.
I didn’t cry at my wedding. I couldn’t feel anything in the moment. It’s a blur even now. (I get why people have videos of that day to look back on it and laugh. I don’t have one, but oh what a video it would be.) I hadn’t cried at a single wedding before my wedding either. I didn’t get how big of a deal it is. I cry at every single wedding since then. I cry during fake weddings on TV. I could probably make myself cry just thinking about a wedding. It’s absolutely out of control. It’s because I get it now. I get the weight of it. I get the importance of it. I get that kind of love. I get the overwhelmingly beauty of God’s love for us in it. I get all of it. When, I think about people I know getting to that point in their lives when they want to make that kind of covenant, I am so overjoyed for them and so nostalgic of my own wedding that I just can’t help but cry.
Q: Bash: Confused by expanding asterisk I have a very simple scripts called test.sh. #!/bin/bash echo $(cat './data') while read line do data=$data' '$line done < './data' echo $data And the data file: 1 * 1 = 1 But actually bash(4.3.11)/dash(sh 0.5.7) expands asterisk itself. It prints out 1 test.sh data 1 = 1 1 test.sh data 1 = 1 Zsh(5.0.2) won't act like this. I don't know why. How can I print out using bash 1 * 1 = 1 Thanks. A: Rule #1, quote your variables! echo "$(cat data)" and data="$data $line" and echo "$data" Although as gniourf_gniourf pointed out in the comments below (since removed), the second of the three changes is actually unnecessary, as glob expansion does not occur during variable assignment. That said, if you just want to print the contents of the file, there's no need to use a command substitution or read loop at all. Why not just use cat data? Alternatively, to store the contents of the file to a variable, just use data="$(cat data)" (the quotes are important here), or as suggested in the comments above by gniourf_gniourf, data="$(< data)".
The impact of venovenous extracorporeal membrane oxygenation on cytokine levels in patients with severe acute respiratory distress syndrome: a prospective, observational study. The immunoinflammatory response is central to the pathogenesis of acute respiratory distress syndrome (ARDS). However, little is known how this is affected by venovenous (VV) extracorporeal membrane oxygenation (ECMO). Our objective was to investigate the factors that influence the inflammatory response of patients with ARDS undergoing VV ECMO, and to analyse the impact of this response on hospital mortality. A prospective observational study of all consecutive patients with severe ARDS who had VV ECMO at a tertiary German ECMO centre from 2009 to 2015. Patients without complete datasets were excluded. Cytokines (interleukin [IL]6, IL8 and tissue necrosis factor [TNF]α) and inflammatory markers (white cell count and C-reactive protein) were assessed before ECMO initiation and on Days 1, 5 and 10, before explantation and at explantation. A total of 262 adult patients undergoing VV ECMO were analysed. Their median Sequential Organ Failure Assessment score was 12, PaO2/FiO2 ratio was 64 mmHg, and overall in-hospital mortality was 34%. Cytokine levels fell quickly within 24 hours and fell further over the first 5 days. Extra-pulmonary ARDS was associated with higher IL6 and IL8 levels compared with pulmonary ARDS. Mechanical ventilation with positive end-expiratory pressure ≥ 15 cmH2O before ECMO was associated with higher IL6, IL8 and TNFα levels. Driving pressures ≥ 19 cmH2O before ECMO were associated with higher IL8 levels. Non-survivors had higher IL6 and IL8 levels for the duration of ECMO. Cytokine levels, on average, fall rapidly after initiation of VV ECMO, which may be related to the reduction of invasiveness of mechanical ventilation. Higher cytokine levels are associated with extrapulmonary causes of ARDS, more aggressive mechanical ventilation before VV ECMO, and mortality.
{ "Result": { "id": 325643717, "number": 83609, "state": "closed", "locked": false, "title": "Remove e2e/common package usage in volumemode testsuite", "body": "\u003c!-- Thanks for sending a pull request! Here are some tips for you:\r\n\r\n1. If this is your first time, please read our contributor guidelines: https://git.k8s.io/community/contributors/guide#your-first-contribution and developer guide https://git.k8s.io/community/contributors/devel/development.md#development-guide\r\n2. Please label this pull request according to what type of issue you are addressing, especially if this is a release targeted pull request. For reference on required PR/issue labels, read here:\r\nhttps://git.k8s.io/community/contributors/devel/sig-release/release.md#issuepr-kind-label\r\n3. Ensure you have added or ran the appropriate tests for your PR: https://git.k8s.io/community/contributors/devel/sig-testing/testing.md\r\n4. If you want faster PR reviews, read how: https://git.k8s.io/community/contributors/guide/pull-requests.md#best-practices-for-faster-reviews\r\n5. If the PR is unfinished, see how to mark it: https://git.k8s.io/community/contributors/guide/pull-requests.md#marking-unfinished-pull-requests\r\n--\u003e\r\n\r\nWhat type of PR is this?\r\n/kind cleanup\r\n/kind failing-test\r\n\r\n\r\nWhat this PR does / why we need it:\r\nChange 04300826fd0d719bb166905bb6c8a3286a171465 has introduced\r\n\"e2e/common\" package dependency on volumemode testusuite. This results in\r\npulling all tests defined in common package while running storage e2e tests,\r\nwhich are not necessary.\r\n\r\nThe only interesting part from common package is the WaitTimeoutForEvent(), which we can implement inside the same source as no other testsuites are currently depend on this method.\r\n\r\n\u003c!-- Which issue(s) this PR fixes: --\u003e\r\n\u003c!--\r\nAutomatically closes linked issue when PR is merged.\r\nUsage: `Fixes #\u003cissue number\u003e`, or `Fixes (paste link of issue)`.\r\n_If PR is about `failing-tests or flakes`, please post the related issues/tests in a comment and do not use `Fixes`_\r\n--\u003e\r\n\u003c!-- Fixes # --\u003e\r\n\r\n\u003c!-- Special notes for your reviewer: --\u003e\r\n\r\nDoes this PR introduce a user-facing change?:\r\n\u003c!--\r\nIf no, just write \"NONE\" in the release-note block below.\r\nIf yes, a release note is required:\r\nEnter your extended release note in the block below. If the PR requires additional action from users switching to the new release, include the string \"action required\".\r\n\r\nFor more information on release notes see: https://git.k8s.io/community/contributors/guide/release-notes.md\r\n--\u003e\r\n```release-note\r\nNone\r\n```\r\n/area e2e-test-framework\r\n/sig testing\r\n\r\n\u003c!--\r\nThis section can be blank if this pull request does not require a release note.\r\n\r\nWhen adding links which point to resources within git repositories, like\r\nKEPs or supporting documentation, please reference a specific commit and avoid\r\nlinking directly to the master branch. This ensures that links reference a\r\nspecific point in time, rather than a document that may change over time.\r\n\r\nSee here for guidance on getting permanent links to files: https://help.github.com/en/articles/getting-permanent-links-to-files\r\n\r\nPlease use the following format for linking documentation:\r\n- [KEP]: \u003clink\u003e\r\n- [Usage]: \u003clink\u003e\r\n- [Other doc]: \u003clink\u003e\r\n--\u003e\r\n", "created_at": "2019-10-08T07:47:26Z", "updated_at": "2019-10-10T20:41:55Z", "closed_at": "2019-10-10T20:41:54Z", "merged_at": "2019-10-10T20:41:54Z", "labels": [ { "id": 414883982, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/approved", "name": "approved", "color": "0ffa16", "description": "Indicates a PR has been approved by an approver from all required OWNERS files.", "default": false, "node_id": "MDU6TGFiZWw0MTQ4ODM5ODI=" }, { "id": 1285569325, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/area/e2e-test-framework", "name": "area/e2e-test-framework", "color": "0052cc", "description": "Issues or PRs related to refactoring the kubernetes e2e test framework", "default": false, "node_id": "MDU6TGFiZWwxMjg1NTY5MzI1" }, { "id": 105152717, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/area/test", "name": "area/test", "color": "0052cc", "default": false, "node_id": "MDU6TGFiZWwxMDUxNTI3MTc=" }, { "id": 477397086, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/cncf-cla:%20yes", "name": "cncf-cla: yes", "color": "bfe5bf", "description": "Indicates the PR's author has signed the CNCF CLA.", "default": false, "node_id": "MDU6TGFiZWw0NzczOTcwODY=" }, { "id": 122775691, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/kind/cleanup", "name": "kind/cleanup", "color": "c7def8", "description": "Categorizes issue or PR as related to cleaning up code, process, or technical debt.", "default": false, "node_id": "MDU6TGFiZWwxMjI3NzU2OTE=" }, { "id": 496752468, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/kind/failing-test", "name": "kind/failing-test", "color": "e11d21", "description": "Categorizes issue or PR as related to a consistently or frequently failing test.", "default": false, "node_id": "MDU6TGFiZWw0OTY3NTI0Njg=" }, { "id": 148225179, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/lgtm", "name": "lgtm", "color": "15dd18", "description": "Indicates that a PR is ready to be merged.", "default": false, "node_id": "MDU6TGFiZWwxNDgyMjUxNzk=" }, { "id": 1086787260, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/ok-to-test", "name": "ok-to-test", "color": "15dd18", "description": "Indicates a non-member PR verified by an org member that is safe to test.", "default": false, "node_id": "MDU6TGFiZWwxMDg2Nzg3MjYw" }, { "id": 114528273, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/priority/backlog", "name": "priority/backlog", "color": "fbca04", "description": "Higher priority than priority/awaiting-more-evidence.", "default": false, "node_id": "MDU6TGFiZWwxMTQ1MjgyNzM=" }, { "id": 349530249, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/release-note-none", "name": "release-note-none", "color": "c2e0c6", "description": "Denotes a PR that doesn't merit a release note.", "default": false, "node_id": "MDU6TGFiZWwzNDk1MzAyNDk=" }, { "id": 483069764, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/sig/testing", "name": "sig/testing", "color": "d2b48c", "description": "Categorizes an issue or PR as relevant to sig-testing.", "default": false, "node_id": "MDU6TGFiZWw0ODMwNjk3NjQ=" }, { "id": 253450934, "url": "https://api.github.com/repos/kubernetes/kubernetes/labels/size/M", "name": "size/M", "color": "eebb00", "description": "Denotes a PR that changes 30-99 lines, ignoring generated files.", "default": false, "node_id": "MDU6TGFiZWwyNTM0NTA5MzQ=" } ], "user": { "login": "avalluri", "id": 995984, "node_id": "MDQ6VXNlcjk5NTk4NA==", "avatar_url": "https://avatars0.githubusercontent.com/u/995984?v=4", "html_url": "https://github.com/avalluri", "gravatar_id": "", "type": "User", "site_admin": false, "url": "https://api.github.com/users/avalluri", "events_url": "https://api.github.com/users/avalluri/events{/privacy}", "following_url": "https://api.github.com/users/avalluri/following{/other_user}", "followers_url": "https://api.github.com/users/avalluri/followers", "gists_url": "https://api.github.com/users/avalluri/gists{/gist_id}", "organizations_url": "https://api.github.com/users/avalluri/orgs", "received_events_url": "https://api.github.com/users/avalluri/received_events", "repos_url": "https://api.github.com/users/avalluri/repos", "starred_url": "https://api.github.com/users/avalluri/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/avalluri/subscriptions" }, "draft": false, "merged": true, "mergeable_state": "unknown", "merged_by": { "login": "k8s-ci-robot", "id": 20407524, "node_id": "MDQ6VXNlcjIwNDA3NTI0", "avatar_url": "https://avatars0.githubusercontent.com/u/20407524?v=4", "html_url": "https://github.com/k8s-ci-robot", "gravatar_id": "", "type": "User", "site_admin": false, "url": "https://api.github.com/users/k8s-ci-robot", "events_url": "https://api.github.com/users/k8s-ci-robot/events{/privacy}", "following_url": "https://api.github.com/users/k8s-ci-robot/following{/other_user}", "followers_url": "https://api.github.com/users/k8s-ci-robot/followers", "gists_url": "https://api.github.com/users/k8s-ci-robot/gists{/gist_id}", "organizations_url": "https://api.github.com/users/k8s-ci-robot/orgs", "received_events_url": "https://api.github.com/users/k8s-ci-robot/received_events", "repos_url": "https://api.github.com/users/k8s-ci-robot/repos", "starred_url": "https://api.github.com/users/k8s-ci-robot/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/k8s-ci-robot/subscriptions" }, "merge_commit_sha": "1bb7835f0aef486c9037cd83d0e59f7ee48c5551", "comments": 10, "commits": 1, "additions": 34, "deletions": 5, "changed_files": 2, "url": "https://api.github.com/repos/kubernetes/kubernetes/pulls/83609", "html_url": "https://github.com/kubernetes/kubernetes/pull/83609", "issue_url": "https://api.github.com/repos/kubernetes/kubernetes/issues/83609", "statuses_url": "https://api.github.com/repos/kubernetes/kubernetes/statuses/33338067344e6a92400e5ace093c9260e49ffa29", "diff_url": "https://github.com/kubernetes/kubernetes/pull/83609.diff", "patch_url": "https://github.com/kubernetes/kubernetes/pull/83609.patch", "commits_url": "https://api.github.com/repos/kubernetes/kubernetes/pulls/83609/commits", "comments_url": "https://api.github.com/repos/kubernetes/kubernetes/issues/83609/comments", "review_comments_url": "https://api.github.com/repos/kubernetes/kubernetes/pulls/83609/comments", "review_comment_url": "https://api.github.com/repos/kubernetes/kubernetes/pulls/comments{/number}", "review_comments": 5, "assignee": { "login": "oomichi", "id": 1287154, "node_id": "MDQ6VXNlcjEyODcxNTQ=", "avatar_url": "https://avatars0.githubusercontent.com/u/1287154?v=4", "html_url": "https://github.com/oomichi", "gravatar_id": "", "type": "User", "site_admin": false, "url": "https://api.github.com/users/oomichi", "events_url": "https://api.github.com/users/oomichi/events{/privacy}", "following_url": "https://api.github.com/users/oomichi/following{/other_user}", "followers_url": "https://api.github.com/users/oomichi/followers", "gists_url": "https://api.github.com/users/oomichi/gists{/gist_id}", "organizations_url": "https://api.github.com/users/oomichi/orgs", "received_events_url": "https://api.github.com/users/oomichi/received_events", "repos_url": "https://api.github.com/users/oomichi/repos", "starred_url": "https://api.github.com/users/oomichi/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/oomichi/subscriptions" }, "assignees": [ { "login": "neolit123", "id": 331852, "node_id": "MDQ6VXNlcjMzMTg1Mg==", "avatar_url": "https://avatars3.githubusercontent.com/u/331852?v=4", "html_url": "https://github.com/neolit123", "gravatar_id": "", "type": "User", "site_admin": false, "url": "https://api.github.com/users/neolit123", "events_url": "https://api.github.com/users/neolit123/events{/privacy}", "following_url": "https://api.github.com/users/neolit123/following{/other_user}", "followers_url": "https://api.github.com/users/neolit123/followers", "gists_url": "https://api.github.com/users/neolit123/gists{/gist_id}", "organizations_url": "https://api.github.com/users/neolit123/orgs", "received_events_url": "https://api.github.com/users/neolit123/received_events", "repos_url": "https://api.github.com/users/neolit123/repos", "starred_url": "https://api.github.com/users/neolit123/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/neolit123/subscriptions" }, { "login": "oomichi", "id": 1287154, "node_id": "MDQ6VXNlcjEyODcxNTQ=", "avatar_url": "https://avatars0.githubusercontent.com/u/1287154?v=4", "html_url": "https://github.com/oomichi", "gravatar_id": "", "type": "User", "site_admin": false, "url": "https://api.github.com/users/oomichi", "events_url": "https://api.github.com/users/oomichi/events{/privacy}", "following_url": "https://api.github.com/users/oomichi/following{/other_user}", "followers_url": "https://api.github.com/users/oomichi/followers", "gists_url": "https://api.github.com/users/oomichi/gists{/gist_id}", "organizations_url": "https://api.github.com/users/oomichi/orgs", "received_events_url": "https://api.github.com/users/oomichi/received_events", "repos_url": "https://api.github.com/users/oomichi/repos", "starred_url": "https://api.github.com/users/oomichi/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/oomichi/subscriptions" } ], "milestone": { "url": "https://api.github.com/repos/kubernetes/kubernetes/milestones/43", "html_url": "https://github.com/kubernetes/kubernetes/milestone/43", "labels_url": "https://api.github.com/repos/kubernetes/kubernetes/milestones/43/labels", "id": 3990944, "number": 43, "state": "open", "title": "v1.17", "creator": { "login": "liggitt", "id": 980082, "node_id": "MDQ6VXNlcjk4MDA4Mg==", "avatar_url": "https://avatars0.githubusercontent.com/u/980082?v=4", "html_url": "https://github.com/liggitt", "gravatar_id": "", "type": "User", "site_admin": false, "url": "https://api.github.com/users/liggitt", "events_url": "https://api.github.com/users/liggitt/events{/privacy}", "following_url": "https://api.github.com/users/liggitt/following{/other_user}", "followers_url": "https://api.github.com/users/liggitt/followers", "gists_url": "https://api.github.com/users/liggitt/gists{/gist_id}", "organizations_url": "https://api.github.com/users/liggitt/orgs", "received_events_url": "https://api.github.com/users/liggitt/received_events", "repos_url": "https://api.github.com/users/liggitt/repos", "starred_url": "https://api.github.com/users/liggitt/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/liggitt/subscriptions" }, "open_issues": 14, "closed_issues": 1450, "created_at": "2019-01-21T20:12:05Z", "updated_at": "2020-01-30T01:52:39Z", "node_id": "MDk6TWlsZXN0b25lMzk5MDk0NA==" }, "maintainer_can_modify": false, "author_association": "CONTRIBUTOR", "node_id": "MDExOlB1bGxSZXF1ZXN0MzI1NjQzNzE3", "requested_reviewers": [ { "login": "gnufied", "id": 278, "node_id": "MDQ6VXNlcjI3OA==", "avatar_url": "https://avatars0.githubusercontent.com/u/278?v=4", "html_url": "https://github.com/gnufied", "gravatar_id": "", "type": "User", "site_admin": false, "url": "https://api.github.com/users/gnufied", "events_url": "https://api.github.com/users/gnufied/events{/privacy}", "following_url": "https://api.github.com/users/gnufied/following{/other_user}", "followers_url": "https://api.github.com/users/gnufied/followers", "gists_url": "https://api.github.com/users/gnufied/gists{/gist_id}", "organizations_url": "https://api.github.com/users/gnufied/orgs", "received_events_url": "https://api.github.com/users/gnufied/received_events", "repos_url": "https://api.github.com/users/gnufied/repos", "starred_url": "https://api.github.com/users/gnufied/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/gnufied/subscriptions" }, { "login": "pohly", "id": 22076, "node_id": "MDQ6VXNlcjIyMDc2", "avatar_url": "https://avatars1.githubusercontent.com/u/22076?v=4", "html_url": "https://github.com/pohly", "gravatar_id": "", "type": "User", "site_admin": false, "url": "https://api.github.com/users/pohly", "events_url": "https://api.github.com/users/pohly/events{/privacy}", "following_url": "https://api.github.com/users/pohly/following{/other_user}", "followers_url": "https://api.github.com/users/pohly/followers", "gists_url": "https://api.github.com/users/pohly/gists{/gist_id}", "organizations_url": "https://api.github.com/users/pohly/orgs", "received_events_url": "https://api.github.com/users/pohly/received_events", "repos_url": "https://api.github.com/users/pohly/repos", "starred_url": "https://api.github.com/users/pohly/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/pohly/subscriptions" }, { "login": "saad-ali", "id": 10052848, "node_id": "MDQ6VXNlcjEwMDUyODQ4", "avatar_url": "https://avatars1.githubusercontent.com/u/10052848?v=4", "html_url": "https://github.com/saad-ali", "gravatar_id": "", "type": "User", "site_admin": false, "url": "https://api.github.com/users/saad-ali", "events_url": "https://api.github.com/users/saad-ali/events{/privacy}", "following_url": "https://api.github.com/users/saad-ali/following{/other_user}", "followers_url": "https://api.github.com/users/saad-ali/followers", "gists_url": "https://api.github.com/users/saad-ali/gists{/gist_id}", "organizations_url": "https://api.github.com/users/saad-ali/orgs", "received_events_url": "https://api.github.com/users/saad-ali/received_events", "repos_url": "https://api.github.com/users/saad-ali/repos", "starred_url": "https://api.github.com/users/saad-ali/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/saad-ali/subscriptions" } ], "_links": { "self": { "href": "https://api.github.com/repos/kubernetes/kubernetes/pulls/83609" }, "html": { "href": "https://github.com/kubernetes/kubernetes/pull/83609" }, "issue": { "href": "https://api.github.com/repos/kubernetes/kubernetes/issues/83609" }, "comments": { "href": "https://api.github.com/repos/kubernetes/kubernetes/issues/83609/comments" }, "review_comments": { "href": "https://api.github.com/repos/kubernetes/kubernetes/pulls/83609/comments" }, "review_comment": { "href": "https://api.github.com/repos/kubernetes/kubernetes/pulls/comments{/number}" }, "commits": { "href": "https://api.github.com/repos/kubernetes/kubernetes/pulls/83609/commits" }, "statuses": { "href": "https://api.github.com/repos/kubernetes/kubernetes/statuses/33338067344e6a92400e5ace093c9260e49ffa29" } }, "head": { "label": "avalluri:fix-storage-e2e-tests", "ref": "fix-storage-e2e-tests", "sha": "33338067344e6a92400e5ace093c9260e49ffa29", "repo": { "id": 118094253, "node_id": "MDEwOlJlcG9zaXRvcnkxMTgwOTQyNTM=", "owner": { "login": "avalluri", "id": 995984, "node_id": "MDQ6VXNlcjk5NTk4NA==", "avatar_url": "https://avatars0.githubusercontent.com/u/995984?v=4", "html_url": "https://github.com/avalluri", "gravatar_id": "", "type": "User", "site_admin": false, "url": "https://api.github.com/users/avalluri", "events_url": "https://api.github.com/users/avalluri/events{/privacy}", "following_url": "https://api.github.com/users/avalluri/following{/other_user}", "followers_url": "https://api.github.com/users/avalluri/followers", "gists_url": "https://api.github.com/users/avalluri/gists{/gist_id}", "organizations_url": "https://api.github.com/users/avalluri/orgs", "received_events_url": "https://api.github.com/users/avalluri/received_events", "repos_url": "https://api.github.com/users/avalluri/repos", "starred_url": "https://api.github.com/users/avalluri/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/avalluri/subscriptions" }, "name": "kubernetes", "full_name": "avalluri/kubernetes", "description": "Production-Grade Container Scheduling and Management", "homepage": "http://kubernetes.io", "default_branch": "master", "created_at": "2018-01-19T07:47:09Z", "pushed_at": "2019-10-11T12:30:52Z", "updated_at": "2019-10-11T07:31:17Z", "html_url": "https://github.com/avalluri/kubernetes", "clone_url": "https://github.com/avalluri/kubernetes.git", "git_url": "git://github.com/avalluri/kubernetes.git", "ssh_url": "git@github.com:avalluri/kubernetes.git", "svn_url": "https://github.com/avalluri/kubernetes", "language": "Go", "fork": true, "forks_count": 0, "open_issues_count": 0, "stargazers_count": 0, "watchers_count": 0, "size": 672641, "archived": false, "disabled": false, "license": { "key": "apache-2.0", "name": "Apache License 2.0", "url": "https://api.github.com/licenses/apache-2.0", "spdx_id": "Apache-2.0" }, "private": false, "has_issues": false, "has_wiki": false, "has_pages": false, "has_projects": true, "has_downloads": true, "url": "https://api.github.com/repos/avalluri/kubernetes", "archive_url": "https://api.github.com/repos/avalluri/kubernetes/{archive_format}{/ref}", "assignees_url": "https://api.github.com/repos/avalluri/kubernetes/assignees{/user}", "blobs_url": "https://api.github.com/repos/avalluri/kubernetes/git/blobs{/sha}", "branches_url": "https://api.github.com/repos/avalluri/kubernetes/branches{/branch}", "collaborators_url": "https://api.github.com/repos/avalluri/kubernetes/collaborators{/collaborator}", "comments_url": "https://api.github.com/repos/avalluri/kubernetes/comments{/number}", "commits_url": "https://api.github.com/repos/avalluri/kubernetes/commits{/sha}", "compare_url": "https://api.github.com/repos/avalluri/kubernetes/compare/{base}...{head}", "contents_url": "https://api.github.com/repos/avalluri/kubernetes/contents/{+path}", "contributors_url": "https://api.github.com/repos/avalluri/kubernetes/contributors", "deployments_url": "https://api.github.com/repos/avalluri/kubernetes/deployments", "downloads_url": "https://api.github.com/repos/avalluri/kubernetes/downloads", "events_url": "https://api.github.com/repos/avalluri/kubernetes/events", "forks_url": "https://api.github.com/repos/avalluri/kubernetes/forks", "git_commits_url": "https://api.github.com/repos/avalluri/kubernetes/git/commits{/sha}", "git_refs_url": "https://api.github.com/repos/avalluri/kubernetes/git/refs{/sha}", "git_tags_url": "https://api.github.com/repos/avalluri/kubernetes/git/tags{/sha}", "hooks_url": "https://api.github.com/repos/avalluri/kubernetes/hooks", "issue_comment_url": "https://api.github.com/repos/avalluri/kubernetes/issues/comments{/number}", "issue_events_url": "https://api.github.com/repos/avalluri/kubernetes/issues/events{/number}", "issues_url": "https://api.github.com/repos/avalluri/kubernetes/issues{/number}", "keys_url": "https://api.github.com/repos/avalluri/kubernetes/keys{/key_id}", "labels_url": "https://api.github.com/repos/avalluri/kubernetes/labels{/name}", "languages_url": "https://api.github.com/repos/avalluri/kubernetes/languages", "merges_url": "https://api.github.com/repos/avalluri/kubernetes/merges", "milestones_url": "https://api.github.com/repos/avalluri/kubernetes/milestones{/number}", "notifications_url": "https://api.github.com/repos/avalluri/kubernetes/notifications{?since,all,participating}", "pulls_url": "https://api.github.com/repos/avalluri/kubernetes/pulls{/number}", "releases_url": "https://api.github.com/repos/avalluri/kubernetes/releases{/id}", "stargazers_url": "https://api.github.com/repos/avalluri/kubernetes/stargazers", "statuses_url": "https://api.github.com/repos/avalluri/kubernetes/statuses/{sha}", "subscribers_url": "https://api.github.com/repos/avalluri/kubernetes/subscribers", "subscription_url": "https://api.github.com/repos/avalluri/kubernetes/subscription", "tags_url": "https://api.github.com/repos/avalluri/kubernetes/tags", "trees_url": "https://api.github.com/repos/avalluri/kubernetes/git/trees{/sha}", "teams_url": "https://api.github.com/repos/avalluri/kubernetes/teams" }, "user": { "login": "avalluri", "id": 995984, "node_id": "MDQ6VXNlcjk5NTk4NA==", "avatar_url": "https://avatars0.githubusercontent.com/u/995984?v=4", "html_url": "https://github.com/avalluri", "gravatar_id": "", "type": "User", "site_admin": false, "url": "https://api.github.com/users/avalluri", "events_url": "https://api.github.com/users/avalluri/events{/privacy}", "following_url": "https://api.github.com/users/avalluri/following{/other_user}", "followers_url": "https://api.github.com/users/avalluri/followers", "gists_url": "https://api.github.com/users/avalluri/gists{/gist_id}", "organizations_url": "https://api.github.com/users/avalluri/orgs", "received_events_url": "https://api.github.com/users/avalluri/received_events", "repos_url": "https://api.github.com/users/avalluri/repos", "starred_url": "https://api.github.com/users/avalluri/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/avalluri/subscriptions" } }, "base": { "label": "kubernetes:master", "ref": "master", "sha": "ebb7b17f4dfb5ab705da1c7abedf12f03641b444", "repo": { "id": 20580498, "node_id": "MDEwOlJlcG9zaXRvcnkyMDU4MDQ5OA==", "owner": { "login": "kubernetes", "id": 13629408, "node_id": "MDEyOk9yZ2FuaXphdGlvbjEzNjI5NDA4", "avatar_url": "https://avatars2.githubusercontent.com/u/13629408?v=4", "html_url": "https://github.com/kubernetes", "gravatar_id": "", "type": "Organization", "site_admin": false, "url": "https://api.github.com/users/kubernetes", "events_url": "https://api.github.com/users/kubernetes/events{/privacy}", "following_url": "https://api.github.com/users/kubernetes/following{/other_user}", "followers_url": "https://api.github.com/users/kubernetes/followers", "gists_url": "https://api.github.com/users/kubernetes/gists{/gist_id}", "organizations_url": "https://api.github.com/users/kubernetes/orgs", "received_events_url": "https://api.github.com/users/kubernetes/received_events", "repos_url": "https://api.github.com/users/kubernetes/repos", "starred_url": "https://api.github.com/users/kubernetes/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/kubernetes/subscriptions" }, "name": "kubernetes", "full_name": "kubernetes/kubernetes", "description": "Production-Grade Container Scheduling and Management", "homepage": "https://kubernetes.io", "default_branch": "master", "created_at": "2014-06-06T22:56:04Z", "pushed_at": "2020-01-30T14:48:36Z", "updated_at": "2020-01-30T14:50:52Z", "html_url": "https://github.com/kubernetes/kubernetes", "clone_url": "https://github.com/kubernetes/kubernetes.git", "git_url": "git://github.com/kubernetes/kubernetes.git", "ssh_url": "git@github.com:kubernetes/kubernetes.git", "svn_url": "https://github.com/kubernetes/kubernetes", "language": "Go", "fork": false, "forks_count": 22235, "open_issues_count": 3161, "stargazers_count": 62766, "watchers_count": 62766, "size": 893593, "archived": false, "disabled": false, "license": { "key": "apache-2.0", "name": "Apache License 2.0", "url": "https://api.github.com/licenses/apache-2.0", "spdx_id": "Apache-2.0" }, "private": false, "has_issues": true, "has_wiki": false, "has_pages": false, "has_projects": true, "has_downloads": true, "url": "https://api.github.com/repos/kubernetes/kubernetes", "archive_url": "https://api.github.com/repos/kubernetes/kubernetes/{archive_format}{/ref}", "assignees_url": "https://api.github.com/repos/kubernetes/kubernetes/assignees{/user}", "blobs_url": "https://api.github.com/repos/kubernetes/kubernetes/git/blobs{/sha}", "branches_url": "https://api.github.com/repos/kubernetes/kubernetes/branches{/branch}", "collaborators_url": "https://api.github.com/repos/kubernetes/kubernetes/collaborators{/collaborator}", "comments_url": "https://api.github.com/repos/kubernetes/kubernetes/comments{/number}", "commits_url": "https://api.github.com/repos/kubernetes/kubernetes/commits{/sha}", "compare_url": "https://api.github.com/repos/kubernetes/kubernetes/compare/{base}...{head}", "contents_url": "https://api.github.com/repos/kubernetes/kubernetes/contents/{+path}", "contributors_url": "https://api.github.com/repos/kubernetes/kubernetes/contributors", "deployments_url": "https://api.github.com/repos/kubernetes/kubernetes/deployments", "downloads_url": "https://api.github.com/repos/kubernetes/kubernetes/downloads", "events_url": "https://api.github.com/repos/kubernetes/kubernetes/events", "forks_url": "https://api.github.com/repos/kubernetes/kubernetes/forks", "git_commits_url": "https://api.github.com/repos/kubernetes/kubernetes/git/commits{/sha}", "git_refs_url": "https://api.github.com/repos/kubernetes/kubernetes/git/refs{/sha}", "git_tags_url": "https://api.github.com/repos/kubernetes/kubernetes/git/tags{/sha}", "hooks_url": "https://api.github.com/repos/kubernetes/kubernetes/hooks", "issue_comment_url": "https://api.github.com/repos/kubernetes/kubernetes/issues/comments{/number}", "issue_events_url": "https://api.github.com/repos/kubernetes/kubernetes/issues/events{/number}", "issues_url": "https://api.github.com/repos/kubernetes/kubernetes/issues{/number}", "keys_url": "https://api.github.com/repos/kubernetes/kubernetes/keys{/key_id}", "labels_url": "https://api.github.com/repos/kubernetes/kubernetes/labels{/name}", "languages_url": "https://api.github.com/repos/kubernetes/kubernetes/languages", "merges_url": "https://api.github.com/repos/kubernetes/kubernetes/merges", "milestones_url": "https://api.github.com/repos/kubernetes/kubernetes/milestones{/number}", "notifications_url": "https://api.github.com/repos/kubernetes/kubernetes/notifications{?since,all,participating}", "pulls_url": "https://api.github.com/repos/kubernetes/kubernetes/pulls{/number}", "releases_url": "https://api.github.com/repos/kubernetes/kubernetes/releases{/id}", "stargazers_url": "https://api.github.com/repos/kubernetes/kubernetes/stargazers", "statuses_url": "https://api.github.com/repos/kubernetes/kubernetes/statuses/{sha}", "subscribers_url": "https://api.github.com/repos/kubernetes/kubernetes/subscribers", "subscription_url": "https://api.github.com/repos/kubernetes/kubernetes/subscription", "tags_url": "https://api.github.com/repos/kubernetes/kubernetes/tags", "trees_url": "https://api.github.com/repos/kubernetes/kubernetes/git/trees{/sha}", "teams_url": "https://api.github.com/repos/kubernetes/kubernetes/teams" }, "user": { "login": "kubernetes", "id": 13629408, "node_id": "MDEyOk9yZ2FuaXphdGlvbjEzNjI5NDA4", "avatar_url": "https://avatars2.githubusercontent.com/u/13629408?v=4", "html_url": "https://github.com/kubernetes", "gravatar_id": "", "type": "Organization", "site_admin": false, "url": "https://api.github.com/users/kubernetes", "events_url": "https://api.github.com/users/kubernetes/events{/privacy}", "following_url": "https://api.github.com/users/kubernetes/following{/other_user}", "followers_url": "https://api.github.com/users/kubernetes/followers", "gists_url": "https://api.github.com/users/kubernetes/gists{/gist_id}", "organizations_url": "https://api.github.com/users/kubernetes/orgs", "received_events_url": "https://api.github.com/users/kubernetes/received_events", "repos_url": "https://api.github.com/users/kubernetes/repos", "starred_url": "https://api.github.com/users/kubernetes/starred{/owner}{/repo}", "subscriptions_url": "https://api.github.com/users/kubernetes/subscriptions" } } }, "LastPage": 0 }
Honoring Jennifer Rae Beck On August 8, 2015, our beloved Jennifer—mother, wife, actress and entrepreneur—lost her battle with breast cancer at the much too young age of 44. We invite you to join us—Jennifer's family, friends and the Broadway community—in remembering her exactly as she would have wanted: by providing hope to others faced with a breast cancer diagnosis. All gifts will advance breast cancer research under the direction of Dr. Dennis Slamon at UCLA's Jonsson Comprehensive Cancer Center. Internationally renowned, Slamon is dedicated to improving the therapies available to patients everywhere with the goal that, one day soon, no other families will ever have to experience a tragic loss like ours.
Eddie Van Halen on the set of AIMEE Eddie and Janie Van Halen were on the set of AIMEE Saturday, Dec 17th. Janie’s client, director Lee Whittaker, thanked everyone from the bottom of their hearts helping to support and spread the word about a serious issue that takes place right here in our backyards. The AIMEE Movie is a Proof of Concept short film about the child sex trafficking epidemic happening in the United States.
Motor sports enthusiasts and participants in motor racing often have interest in knowing the power output of an engine that operates the motor vehicle. To achieve higher performance, modifications to the motor vehicle and particularly to engines can be made. These modifications include using high performance spark plugs, spark plug wires, superchargers, and with computerized engines replacement computer modules that are “tuned” to enhance performance or that allow “tuning” to the operating characteristics of the particular engine of interest. There are various mechanisms for determining power output of an engine. A chassis dynameter involves a static test of the motor vehicle. The motor vehicle is secured with ties to restrain the motor vehicle from moving and the drive wheels are positioned on rollers. As the engine operates across its RPM (revolutions per minute) range, monitoring equipment measures the loading on the rollers and determines the power output of the engine. This type of test provides a reasonable estimate of the power output under loading. Another test device requires removal of the engine from the motor vehicle and mounting to a test frame. The engine is operated and measurements taken to evaluate performance across the RPM range. While these tests provide a basis for evaluating engine performance and particularly for evaluating the effect of changes to the engine on performance, there are limitations for these tests. Particularly, the tests are static—that is, the motor vehicle is not experiencing real time operating stresses and loads incurred during a road race or vehicle movement. Other mechanical components of the motor vehicle affect engine performance. For example, tire conditions, such as tread, temperature, and air pressure, can affect engine performance. Monitoring the performance of an engine can provide an indication of tire slippage during racing and thus an indication of need to pit and change tires. However, apparatus for the real-time testing of engine performance during motor vehicle moving operation has not been satisfactory for other than professional or serious enthusiasts due to costs and installation needs. Accordingly, there is a need in the art for an improved apparatus and method for real-time measuring and reporting of torque and power of motor vehicles. It is to such that the present invention is directed.
A London man whose foundation gives gifts to sick and dying kids at London's Children's Hospital is flabbergasted to learn that a new hospital policy has effectively banned him from the property. For more than 30 years, Leo Larizza has responded to requests from parents of sick children in care at Children's Hospital, which is part of the Victoria Hospital campus operated by London Health Sciences Centre (LHSC). Many of the children whose parents contact Larizza are facing terminal diagnoses. He began delivering gifts to kids in their hospital rooms back in 1985. When his mother died just before Christmas in 1998, he renamed the charity the Teresina Larizza Charities (TLC) Foundation after her. Larizza gathers gift requests from kids and delivers the gifts to their hospital beds. In each case, Larizza says he only delivers a gift with the parents' consent and if they put his name on the hospital's visitors list. So why is he being banned now? CBC News has called LHSC for comment. No one was available to comment early Wednesday evening but the hospital said they would make a spokesperson available Thursday for an interview. Larizza says the hospital explained to him that they've changed their access policy and now want all donated gifts to go through the hospital's own foundation, which is called the Children's Health Foundation. 'They're trying to control everything' Larizza says he's made every effort to work with the hospital and would never do anything that would compromise patients' care. "What they're trying to do is control everything that happens at that hospital," he said. "The families are reaching out to me," he said. "They have already given me permission to enter the room, they've already put me on their visitors list. So I'm not coming in and saying 'I just want to visit some random child.' "I do not go room to room asking parents what they want. It's by invite only." Larizza says the hospital has been trying to stop him from giving out gifts at the hospital "for five years, and I've always fought them." But he says while he may be barred from the hospital property, it won't stop him from getting gifts to kids in need. "I just have to figure out another way of getting gifts to the kids on Christmas Eve ... nobody will ever stop the TLC Foundation from giving gifts to kids. It's not gonna happen." Since the new policy began being strictly enforced last week, Larizza has still managed to give out gifts. But to do it, he's had to meet parents off the property, or in the hospital parking lots. "Today a mother came out in the cold and met me on the sidewalk to get a gift for her child," he said. "I'll do whatever it takes." Over the years, Larizza has visited hundreds of sick kids at the hospital. In the saddest cases, he's been with the families at the funerals for their children. He says it's particularly painful the hospital's new policy means he will no longer be able to form a personal bond with the sick children and their families. "The worst part of this is that we will not be able to give a child a hug and tell them everything is going to be OK, or make them laugh and forget about where they are, if only for a little while," Larizza said in a post on TLC's Facebook page. The post went up just after 4 p.m. Wednesday and has received more than 200 comments, many of them critical of LHSC and its policy. Many of the commenters can't believe that the hospital would enact a policy that prevents him from visiting sick children to give them gifts inside a public hospital, even in cases when the parents consent to the visits. "What a bunch of Grinches," said one comment. "For some of these children it could be their last Christmas and they are taking away what might be the only happiness they will have."
1. Field Some embodiments relate to a polymer compound and an organic light-emitting device including the same. 2. Description of the Related Technology Organic electroluminescent devices may be made light-weight and thin, realize various colors, have a fast switching speed, and achieve high brightness at a low driving voltage. As a result, outstanding achievements have been accomplished in a short period of time with regard to the performances of such devices such as balanced charge injection by a multi-layered structure, improvements in color adjustment through doping and quantum efficiency, and development of new electrode materials using alloys. Light is emitted when electricity is applied to poly(1,4-phenylenevinylene (PPV)) an example of π-conjugated polymer. The π-conjugated polymer has a chemical structure in which single bonds (or σ-bond) or double bonds (or π-bond) alternately exist and thus has π-electrons that are not lateralized and may freely move along bond chains. According to such a characteristic of a semiconductor, the π-conjugated polymers may be applied to an emission layer of an organic electroluminescent device, and light in the entire visible light area that corresponds to HOMO-LUMO band-gap may be easily obtained by a molecular design. Also, a thin film may be simply formed by spin coating or printing so that a process of manufacturing the devices is simple and cost thereof is low. Also, the π-conjugated polymers have high glass transition temperature, and thus, a thin film having excellent mechanical properties may be provided. However, in organic electroluminescent devices including polymers, problems such as deterioration of color purity, high driving voltage, and low efficiency may occur, and studies to overcome such problems have been widely conducted. For example, improvements in the electroluminescent properties by copolymerizing polymers containing fluorine or blending polymers containing fluorine have been proposed. However, the degree of improvement is still insufficient. Therefore, the development of polymer materials having excellent properties is required. The present embodiments overcome the above problems as well as provide additional advantages.
BioShock Easter Egg Discovered More Than 10 Years After the Game’s Release BioShock was released back in 2007 and earned critical acclaim for its intense gameplay, engaging story and characters, and dystopian underwater setting in the fictional city of Rapture. The game spawned several successful sequels and is considered to be a must-play game from the PS3/Xbox 360 era. After more than ten years, you would think that all of Rapture’s secrets would’ve been uncovered. It seems there was at least one mystery was waiting to be discovered all these years, however. The revelation comes by way of Twitter user Nick Monroe and an unnamed 4chan user who had claimed to work on a port for the original Bioshock. Naturally other people were skeptical, but the user backed up his claims with evidence. He wrote, “In BioShock 1, go to the second half of Hephaestus where you first encounter Ryan in person. Use Incinerate to get you down to 1 HP, then use it again on the area where the cutscene triggers and walk into it. You’ll die right when the scene starts, but wind up in a Vita Chamber outside the map. Turn on Art Captions and you’ll see a developer message about Paul Hellquist not doing his job. No one has found this bug yet publicly, it’s in all versions. Cheers.” As you can see from the above picture, the Easter Egg is indeed real. It makes us wonder how many other Easter Eggs are out there just waiting to be found.
WASHINGTON — The total number of coronavirus cases in the United States exceeded one million. The American death toll surpassed that of the Vietnam War. And the economy was reported to have shrunk by nearly 5 percent. But the White House on Wednesday declared its response to the crisis “a great success story.” As states begin to lift quarantines, President Trump is trying to recast the story of the pandemic from that of an administration slow to see and address the threat to one that responded with decisive action that saved lives. Recognizing that the crisis jeopardizes his chances of re-election, he and his allies want to convince his supporters that the cascade of criticism is unwarranted. “We think we really have crossed a big boundary and much better days are ahead,” Mr. Trump said on Wednesday at a televised meeting at the White House with business leaders. The session was intended to highlight what the president hopes will be the resumption of a healthier economy only hours after the release of the most cataclysmic economic numbers of the past decade. “I often say I see the light at the end of the tunnel very strongly,” Mr. Trump said. The president waxed at length about restoring life to the United States as if the crisis were nearly over. He disclosed that he plans to fly to Arizona next week and soon after that to Ohio, his first trips out of the White House since early March other than a short visit to Norfolk, Va., to see off a Navy hospital ship dispatched to hard-hit New York. He talked wistfully of going to football games and resuming his campaign rallies. “I’d like to get out,” he said.
New Cubs manager Dale Sveum, left, and GM Jed Hoyer at Harry Caray's in River North on Thursday night. (Photo courtesy of Harry Caray's Restaurant Group) Dale Sveum celebrated his first night as the Cubs' manager by having dinner Thursday at Harry Caray's Italian Steakhouse in River North. Sveum -- who will be introduced to the Chicago media Friday morning -- was joined by Cubs president of baseball operations Theo Epstein, Cubs chairman Tom Ricketts and general manager Jed Hoyer, among others. The group ordered prime steaks and lobsters. Dutchie Carey, widow of late Cubs broadcaster Harry Caray, was on hand at the restaurant and welcomed Sveum to Chicago. Sveum and Epstein both posed for photos with the Harry Caray statue by the restaurant's entrance after dinner. Heads up: You won't have to wait long to see Regis Philbin again after he signs off from "Live! with Regis & Kelly" Friday. Philbin is signing copies of his book, “How I Got This Way,” at Wentz Concert Hall in Naperville December 1. … The Bears’ Robbie Gould will host a “Monday Night Football” watch party for the Seattle Seahawks-St. Louis Rams game at Jbar in The James Hotel December 12. A portion of the proceeds will benefit The Goulden Touch foundation. … Jeff Pearlman will sign copies of his controversial Walter Payton book, “Sweetness,” at Anderson’s Bookshop in Naperville November 28. … The Naked and Famous will perform at The Vic Theatre April 15. Click here to read my interview with The Naked and Famous' Thom Powers. Crime pays: There is no “Real Housewives of Chicago” show -- at least not yet -- but there will be a “Mob Wives Chicago” starting next year. The 10-episode “Mob Wives” spin-off is scheduled to premiere on VH1 in the spring. “This is the perfect city to be the first spinoff for the franchise,” “Mob Wives” executive producer Jimmy Fox told Variety. “What Chicago has meant to mob history makes for a great setting.” On the record: "I didn't want to be an actor (growing up), but I did always watch the Oscars, and of course, it's the end-all, be-all. At least at this stage of my life I think it is. Maybe people who have won Oscars will tell me differently, but it seems like that's getting tenure, right? I don't know. It would be cool, I'm not gonna lie." – “The Descendants” actress and Depaul alum Judy Greer discusses her Oscar aspirations in an interview with the Tribune. Sightings: Actress Jenny McCarthy had a three-hour lunch at Market after appearing on “The Rosie Show” Wednesday. She was there with the bachelor she chose on the show’s “Dating Game”-like segment. … “Shameless” actor Justin Chatwin had a late dinner at Hub 51 Wednesday. Cubs president of baseball operations Theo Epstein and Cubs owners Tom and Todd Ricketts watched Game 6 of the World Series at The Fifty/50 in Ukrainian Village Thursday. Coincidentally, I was there as well and got to see Theo-madness first hand. Ronit Bezalel has seen just about everything on Chicago bike paths, but on her Monday morning commute she saw something that shocked even her: A silver Buick, almost unscathed, in the middle of the bike path. A day after Trevor Noah was declared the new host of "The Daily Show," complete with the blessing of the exiting Jon Stewart, graphic tweets targeting women, Jews and Middle America are causing a social media backlash.
1. Introduction =============== Reconstructive free flap surgery involves the transfer of free pedicle muscle flaps using a microsurgical technique. Success of surgical free flap transfer depends on achieving and maintaining adequate perfusion across the microvascular anastomosis.^\[[@R1],[@R2]\]^ Besides meticulous surgical technique, the mainstays for preventing vascular occlusion include the maintenance of normothermia, mild hypervolemia, and reduced blood viscosity. Maintaining of optimal blood flow through the vascular anastomoses is crucial for the success of such procedure. Thus, perioperative fluid and hemodynamic management by the anesthesiologist is crucial in preventing hypoperfusion of the transferred tissue and graft failure.^\[[@R2]\]^ The use of perioperative systemically administered vasoactive agent is generally avoided due to the fear that those vasoactive agents might hinder the blood flow and compromise the viability of the flap. However, several authors have been advocated that dobutamine, unlike other ionotropic, may increase free flap perfusion.^\[[@R3]--[@R5]\]^ In a swine model, Corderio et al proposed that dobutamine increases both cardiac output and blood flow to island musculocutaneous flaps. They further stated that dopamine does not affect and that phenylephrine adversely affects flap blood flow.^\[[@R3]\]^ Similarly, Suominen et al^\[[@R4]\]^ documented that a dobutamine infusion of 8 μg·kg^−1^·min^−1^ resulted in increased flap blood flow as the result of higher cardiac output and decreased systemic vascular resistance; whereas a dopamine infusion of 8 μg·kg^−1^·min^−1^ had no effect on flap blood flow because of increase in systemic vascular resistance. In addition, Scholz et al^\[[@R5]\]^ also demonstrated that blood flow to the flap significantly increased above baseline values with dobutamine infusion of 4 and 6 μg·kg^−1^·min^−1^. Despite the beneficial effect of dobutamine on flap perfusion, the optimal infusion rate for maximizing blood flow to the flap while minimizing the adverse effects is still unclear. Therefore, we undertook this study to evaluate the appropriate dose of dobutamine to improve free flap blood flow in patients undergoing low extremity reconstruction surgery under general anesthesia (GA). 2. Methods ========== Twenty-one patients were included in the study after institutional review board approval and written informed consent. The subjects were planned to undergo lower extremity reconstructive surgery using an anterolateral thigh free flap under GA. Patients were aged 21--59 years and were of ASA physical status I. Exclusion criteria included diabetes, hypertension, ischemic heart disease, cardiac arrhythmia, prior deep vein thrombosis, and peripheral vascular disease. All subjects fasted at least 6 h before surgery, and no premedication was given. Upon arrival to the operating room, routine monitoring was initiated, comprising of non-invasive blood pressure, electrocardiography, and pulse oximetry. All patients were anesthetized by the same anesthesiologist and received intravenous fluid 10 mL·kg^−1^ Ringer\'s lactate solution prior to induction. GA was induced with standard doses of pentothal sodium, vecuronium, and fentanyl. The trachea was intubated, and mechanically controlled ventilation with 2--3 vol% sevoflurane in 50% oxygen-air was used to maintain the end-tidal carbon dioxide at 4.5--5.0 kPa. Throughout the entire study period, the core body temperature was continuously monitored in order to maintain normothermia with forced heating blankets. At the end of surgery, we checked the patients' hematocrit and tried to maintain between 30% and 35%, and packed red cells were given, if necessary. Duplex sonography was taken at baseline (prior to the induction of anesthesia), before dobutamine infusion, and 15 min after dobutamine infusion. The investigator who monitored the patients' hemodynamics and flap blood flow parameters was blinded to the rate of dobutamine infusion. Duplex investigation was performed using an EUB 7500 HV (Hitachi Medical Corporation, Tokyo, Japan) with a high resolution (10 MHz) linear-array transducer. The probe position and 60° of angle were scrupulously maintained using a protractor and marks in every examination. Investigation of anastomosed donor arterial hemodynamics included time velocity integral, cross-sectional area, and volume flow. All data were measured three times during each examination by a single blinded investigator, and averaged values were used. The reproducibility of the duplex measurements had presented in our previous publication.^\[[@R6]\]^ The infusion of dobutamine was started before the flap anastomosis, and rate of dobutamine was determined by the response of the previously tested patient according to the Dixon\'s up-and-down method (using 1.0 μg·kg^−1^·min^−1^ as a step size). The first patient received 6.0 μg·kg^−1^·min^−1^ of dobutamine. To allow steady state conditions to be achieved, a pre-determined dose of dobutamine was continuously infused for 15 min. In the implementation of Dixon\'s up-down dose-finding method, augmentation of blood flow within ±5% of baseline was defined as a positive response. If the patient had a positive response, the dose of dobutamine was reduced for the successive subjects. On the contrary, a negative response was defined when the blood flow after 15 min of dobutamine infusion fell short of ±5% of baseline, which resulted in an increased dose for the next subject. To minimize the influence of surgical stimulation, all study-related measurements and procedures were performed during a natural break in the operation. If clinically significant hypertension (systolic blood pressure \>180 mm Hg) or tachycardia (heart rate \>120 bpm) occurred during the protocol, the patient was managed appropriately and excluded. Statistical analyses were performed using SPSS 20.0 (SPSS Inc., Chicago, IL). Data were collected from patients using Dixon\'s method to provide seven pairs of data where an increase in dobutamine dose changed a negative response to a positive response in successive patients. The dose of dobutamine with a 50% probability of sufficient improvement of blood flow was defined as the 50% effective dose (ED~50~), and was determined by calculating the mean of the midpoint dose of the seven pairs of data described above. The ED~50~ and 95% effective dose (ED~95~) were also determined using probit analysis. Repeated measures analysis of variance was used for the analysis of hemodynamic data, with post hoc testing by the Tukey method. A P value \< .05 is considered a statistically significant difference. 3. Results ========== Twenty-one patients were enrolled in this study, of whom 12 were male and 9 were female. Patients' details are presented in Table [1](#T1){ref-type="table"}. ###### Patient characteristics and intraoperative variables, median \[IQR\] (range). ![](medi-98-e15358-g001) Figure [1](#F1){ref-type="fig"} plots the improvement of blood flow for each consecutive patient along with the Dixon\'s up-and-down sequence. The results of the calculations for the seven crossover pairs indicated that the ED~50~ of dobutamine for sufficient improvement of free flap blood flow during GA was 3.50 ± 0.57 μg·kg^−1^·min^−1^. Probit analysis showed that the ED~50~ and ED~95~ of dobutamine were 3.58 μg·kg^−1^·min^−1^ (95% CI: 2.94--4.09 μg·kg^−1^·min^−1^) and 4.46 μg·kg^−1^·min^−1^ (95% CI: 3.99--7.00 μg·kg^−1^·min^−1^), respectively (Fig. [2](#F2){ref-type="fig"}). ![The response of 21 consecutive patients and the dose of dobutamine. The arrow indicates the midpoint dose for the cross-over to a positive response. The dose of dobutamine for improvement in free flap blood flow in 50% of patients was 3.50 ± 0.57 μg·kg^−1^·min^−1^.](medi-98-e15358-g002){#F1} ![Dose--response curve from the probit analyses of individual dobutamine doses and the response to the infusion in the subjects. The doses of dobutamine at which there was a 50% and 95% probability of improving blood flow were 3.58 and 4.46 μg·kg^−1^·min^−1^, respectively.](medi-98-e15358-g003){#F2} Patient hemodynamic data are shown in Table [2](#T2){ref-type="table"}. Blood pressure prior to dobutamine infusion was significantly lower than at baseline (P \< .05). After dobutamine infusion, SBP returned to baseline levels, whereas the diastolic pressure did not. After the completion of sonographic measurements and study protocol, one patient receiving 6 μg·kg^−1^·min^−1^ and one patient receiving 5 μg·kg^−1^·min^−1^ experienced clinically significant hypertension. For these patients the infusion of dobutamine was ceased immediately. ###### Changes of blood flow to free flap, cardiovascular and systemic variables, median \[IQR\] (range). ![](medi-98-e15358-g004) 4. Discussion ============= The results of our study demonstrated that the ED~50~ and ED~95~ of dobutamine for improvement of blood flow to the anastomosed free flap were 3.58 and 4.46 μg·kg^−1^·min^−1^, respectively. To our knowledge, this is the first report to determine the optimal dose of dobutamine for enhancing blood flow to the free flap during GA, and our results suggest that there is a significant augment of blood flow at relatively smaller doses of dobutamine compared with those previously suggested. Anesthetic management for free flap surgery aims to optimize blood flow to the flap tissue across the anastomosis by increasing circulating blood flow and preventing peripheral vasoconstriction.^\[[@R7],[@R8]\]^ Although the effects of inhalational anesthetic agents on the regional blood flow in the free flap are not yet well known, most volatile anesthetics decrease blood pressure by decreasing total peripheral resistance and depressing myocardial contractility.^\[[@R9]\]^ Importantly, it has been demonstrated that implementation of epidural anesthesia generated a significant enhancement of the arterial leg inflow contrasting the blood flow attenuation sustained with GA.^\[[@R10]--[@R13]\]^ During prolonged operations under GA, patients may also become hypothermic and hypovolemic, which predisposes them to generalized vasoconstriction and diminished blood flow to the lower limb^\[[@R14],[@R15]\]^ and the transferred flap tissue.^\[[@R8],[@R9]\]^ Although overall blood flow in a free microvascular flap is complex, any cause of flow attenuation sustained with GA is believed to be harmful to the flap perfusion, such as profound hypotension, hypovolemia, anesthesia-induced decreases of myocardial contractility, and low cardiac output.^\[[@R4],[@R8]\]^ Theoretically, dobutamine has advantages as a potent β~1~- and β~2~-agonist, which provides direct inotropic action coupled with systemic vasodilatation and afterload reduction. An adequate arterial blood pressure with vasodilatation ensures good tissue perfusion by providing sufficient regional blood flow, improving patency of the microvasculature, and maintaining the fluidity of the blood in the microcirculation.^\[[@R7]\]^ In this respect, several authors have recently begun to advocate its use for improving flap blood flow, and in a swine model it was shown that flap blood flow is increased with dobutamine rates of 3, 6, and 12 μg·kg^−1^·min^−1^.^\[[@R3]\]^ In humans, there have also been a small number of reports that dobutamine may increase free flap perfusion^\[[@R4],[@R5]\]^; however, the recommended doses of dobutamine are varied, ranging from 4 to 8 μg·kg^−1^·min^−1^. In our study, the ED~50~ and ED~95~ of dobutamine for improving blood flow to the anastomosed flap above that of baseline were 3.58 and 4.46 μg·kg^−1^·min^−1^, respectively. These results imply that most patients could achieve sufficient enhancement of blood flow to the flap at dobutamine rates of even less than 5 μg·kg^−1^·min^−1^. As the use of dobutamine is not fully harmless without side effects, a low-dose infusion of dobutamine would minimize potential adverse effects, while still rendering beneficial effects on flap perfusion. Blood flow in free vascularized flap tissue is different from normal tissue in several respects. For instance, free vascularized tissue is subjected to complete denervation, and although the arteries in free flaps have no neurogenic response, they still respond to pharmacologic agents. Lorenzetti^\[[@R16]\]^ demonstrated that blood flow through the free flap does not dependent on recipient artery flow, and that the flow in the free flap rises to the level of donor artery flow after the completion of the anastomosis. Furthermore, Suominen et al^\[[@R4]\]^ showed that 8 μg·kg^−1^·min^−1^ of dobutamine infusion increases blood flow in both donor and recipient arteries simultaneously, and it is known that inodilators cause systemic vasodilation, which includes the vessels of the transplanted tissue.^\[[@R2]\]^ These results support that measuring the blood flow to the flap tissue at the donor artery, as a surrogate measure of recipient artery flow, may be valid in evaluating the flap blood flow. In addition, air in the graft may cause erratic flow pattern and vessel spasm in the graft or native artery. Thus, low or zero mean flow value could be shown without pulsation. In our study the surgeons did not have any problems in applying the Doppler probe, and it was not difficult to interpret the achieved data. There are several limitations to our study. First, we did not evaluate whether intraoperative infusion of dobutamine decrease postoperative flap failure rate. Most flap failures is known to occur during the first 3 days after surgery.^\[[@R2]\]^ Virtually no experimental or clinical study has been carried out on the effects of intraoperative inotropic agents on outcomes of free flap procedures. Further studies are warranted, particularly as non-invasive monitoring techniques are now available that allow continuous monitoring of blood flow in transferred tissue after surgery. Second, although the Doppler ultrasound method is non-invasive, it has not gained much popularity with clinicians because flow measurements by this technique are dependent on vessel diameter, vessel shape, probe angle, and motion artifacts. Despite this limitation, Doppler ultrasound has been suggested as useful in monitoring arterial blood flow in skin flaps, and reliability of the technique might be improved when the probe is placed around the supplying vessels.^\[[@R9]\]^ Lastly, we did not checked actual changes in cardiac output or systemic vascular resistance during dobutamine infusion. We hope to see that in the next study, which may give us more insights in what is happening. In conclusion, the optimal infusion rate of dobutamine for improving blood flow to the free tissue flap in 95% of patients undergoing lower limb reconstructive surgery is 4.46 μg·kg^−1^·min^−1^. The results obtained here suggest that if Doppler ultrasound or surrogate parameters for titration are unavailable during free flap surgery, \<5 μg·kg^−1^·min^−1^ of dobutamine would provide a significant improvement of blood flow to the free transferred flap, while minimizing cardiovascular side effects. Acknowledgments =============== Thank you to the following: Dr. Ashish Bangaari (MIOT Hospitals, Chennai, Tami Nadu, India) for his linguistic revision of this manuscript. Author contributions ==================== Conceptualization: Sung-Hoon Kim, Jae-Won Kim, Jeong-Yeon Hong, Wook-Jong Kim, Jai-Hyun Hwang. Data curation: Sung-Hoon Kim, Young-Jin Moon, Jae-Won Kim, Jeong-Yeon Hong, Wook-Jong Kim. Formal analysis: Sung-Hoon Kim. Investigation: Wook-Jong Kim. Methodology: Young-Jin Moon. Supervision: Sung-Hoon Kim, Jai-Hyun Hwang. Validation: Sung-Hoon Kim, Young-Jin Moon, Wook-Jong Kim. Writing -- original draft: Sung-Hoon Kim, Wook-Jong Kim. Writing -- review & editing: Sung-Hoon Kim, Young-Jin Moon, Jeong-Yeon Hong, Wook-Jong Kim. Wook-Jong Kim orcid: 0000-0001-9178-3044. Abbreviations: ED = effective dose, GA = general anesthesia. S-HK and Y-JM contributed equally to this work. This research received no specific grant from any funding agency in the public, commercial, or not-for-profit sectors. The authors have no conflicts of interest to disclose.
BCCI says fans' safety priority, ready for 'closed door games' Speaking to IANS, a BCCI official said that it was obvious that the safety of the fans would be a priority whenever live sporting action returns in the country and cricket will be no different. He went on to add that gate money wouldn't be the primary focus at this point in time and revenue generated from broadcasting the games should work fine. "In these extraordinary times gate money is the least of anyone's concerns. Fan safety obviously takes priority. When cricket happens, the broadcast revenue is the first chunk of revenue necessary for the BCCI and the state associations' subsistence. Same is the case for the IPL. "Nobody is going to say no to gate revenue, but no one in their right minds is going to give gate money preference over fan safety. Those who have organised matches, understand this basic tenet. Moreover, the Sports Minister has given a statement and he represents the government with regard to the sporting ecosystem in the country and one must take note of the same and understand the gravity of the situation," the official said. Rijiju on his part has made it clear that while sporting events will resume slowly as athletes have already been given the permission to start individual training, a call on the IPL would be taken by the government with an eye on the coronavirus pandemic. He also made it clear that sportspersons should be ready to play behind closed doors. "In India, the government has to take a call and it will take a call depending on the situation. We cannot put health at risk just because we want to have a sporting event. Our focus is fighting COVID-19 and at the same time we will have to work a mechanism to get back to normalcy. It is difficult to confirm dates but I am sure we will have some kind of sporting events this year," he told India Today. "We have been advising that health and safety are top priorities and besides that we have to keep in mind guidelines issued by the home ministry and the guidelines issued by the local authorities. We have been planning to resume the events but before that we need to resume the practice and training. We cannot resume tournaments immediately."
Brown: LI knows best what it needs post-Sandy This marsh house on an island north of Jones Beach was damaged during superstorm Sandy. The marsh houses, once the homes of bay fishermen, are scattered on the marsh islands from East Rockaway to east of the Wantagh Causeway in the Great South Bay. (Nov. 14, 2012) Photo Credit: Doug Kuntz The nearly $194 million in federal funding to help local communities decide how to protect themselves from future storms is a huge opportunity for Long Island. Local communities and individual property owners hard hit by superstorm Sandy will have to change, and this money offers the opportunity for significant input into future storm protection plans. Gov. Andrew M. Cuomo's idea of giving locals a voice is modeled after the Federal Emergency Management Agency's effort after Hurricane Katrina, and he's right to pursue it. Nassau and Suffolk leaders are expected to hear more about Cuomo's plan to distribute federal money to local communities during a conference Thursday in Albany. The conference will focus on redesigning and strengthening vulnerable communities -- in other words, building smarter before the next big storm. The effort to involve communities and residents comes at a good time for Long Island -- which birthed a new generation of activist neighbors and neighborhoods post-Sandy. Some of the most effective local outreach, recovery and rebuilding efforts sprang spontaneously from Long Islanders who decided to help other local residents. There are many communities in Nassau and Suffolk where residents have a font of hard-earned, newfound expertise that should be tapped in developing plans to make communities more resilient. Under Cuomo's plan, monies from the U.S. Housing and Urban Development grants would be funneled through the state -- via Community Development Block Grants -- to communities most devastated by Sandy and earlier storms. State officials say it could take eight months to develop plans. While that might not seem like much, for communities such as Long Beach -- which suffered heavy damage in the Oct. 29 storm and have had a strong, organized approach to rebuilding and recovery -- it could be too long. In considering the governor's plan, the state should be able to make allowances for municipalities that already are far along on rebuilding plans. It would be unfair, maybe even counterproductive, to make areas such as Long Beach wait. There are other communities, however, that could benefit from eight months of bottom-to-top planning. Kevin Law, co-vice chairman of the Long Island Regional Economic Development Council, which distributes state business aid, has challenged Long Islanders to think big. He's right on that. For the first time in a long time, there will be monies available not just to rebuild damaged communities but to improve them. And grants to help communities cull ideas for the region's future can only help the process. But even as the region recovers, there are many Long Islanders who are still waiting for help after the storm. Yes, the region needs to think and work long term. But we have to help our neighbors regain firmer footing, too. Long Islanders are resilient and determined. The region can -- and should -- get what it needs to fortify itself now for storms to come.
// Copyright © 2018 Camunda Services GmbH (info@camunda.com) // // Licensed under the Apache License, Version 2.0 (the "License"); // you may not use this file except in compliance with the License. // You may obtain a copy of the License at // // http://www.apache.org/licenses/LICENSE-2.0 // // Unless required by applicable law or agreed to in writing, software // distributed under the License is distributed on an "AS IS" BASIS, // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. // See the License for the specific language governing permissions and // limitations under the License. package utils import ( "fmt" "reflect" "strings" "unicode" ) var stringerInterface = reflect.TypeOf((*fmt.Stringer)(nil)).Elem() func MapMarshal(iface interface{}, tag string, omitempty, omitminus bool) map[string]interface{} { value := innerValue(reflect.ValueOf(iface)) switch value.Kind() { case reflect.Struct: return MapStructMarshal(value, tag, omitempty, omitminus) case reflect.Map: return MapMapMarshal(value, tag, omitempty, omitminus) default: return nil } } func MapStructMarshal(value reflect.Value, tag string, omitempty, omitminus bool) map[string]interface{} { m := make(map[string]interface{}) if !value.IsValid() { return m } typeof := value.Type() for i := 0; i < typeof.NumField(); i++ { fieldType := typeof.Field(i) if unicode.IsLower([]rune(fieldType.Name)[0]) { continue } tagvalue := fieldType.Tag.Get(tag) dostrconv := false omit := false name := "" if tagvalue != "" { omit = omitempty && strings.Contains(tagvalue, ",omitempty") commaidx := strings.IndexRune(tagvalue, ',') if commaidx < 0 { commaidx = len(tagvalue) } name = tagvalue[:commaidx] dostrconv = strings.Contains(tagvalue, ",string") } if name == "-" { if omitminus { continue } else { name = "" } } if name == "" && fieldType.Anonymous && innerType(fieldType.Type).Kind() == reflect.Struct && !dostrconv { imap := MapValueMarshal(value.Field(i), tag, omitempty, omitminus, false).(map[string]interface{}) if len(imap) == 0 && omit { continue } for k, v := range imap { m[k] = v } } else { if name == "" { name = fieldType.Name } v := MapValueMarshal(value.Field(i), tag, omitempty, omitminus, dostrconv) if isEmptyValue(reflect.ValueOf(v)) && omit { continue } m[name] = v } } return m } func MapMapMarshal(value reflect.Value, tag string, omitempty, omitminus bool) map[string]interface{} { m := make(map[string]interface{}) for _, k := range value.MapKeys() { name := toString(k) m[name] = MapValueMarshal(value.MapIndex(k), tag, omitempty, omitminus, false) } return m } func MapValueMarshal(value reflect.Value, tag string, omitempty, omitminus, dostrconv bool) (iface interface{}) { switch innerType(value.Type()).Kind() { case reflect.Struct: iface = MapStructMarshal(innerValue(value), tag, omitempty, omitminus) case reflect.Map: iface = MapMapMarshal(innerValue(value), tag, omitempty, omitminus) default: iface = value.Interface() } if dostrconv { iface = fmt.Sprint(innerValue(reflect.ValueOf(iface)).Interface()) } return } func innerValue(value reflect.Value) reflect.Value { for value.Kind() == reflect.Ptr \|\| value.Kind() == reflect.Interface { value = value.Elem() } return value } func innerType(value reflect.Type) reflect.Type { for value.Kind() == reflect.Ptr { value = value.Elem() } return value } func isEmptyValue(v reflect.Value) bool { switch v.Kind() { case reflect.Array, reflect.Map, reflect.Slice, reflect.String: return v.Len() == 0 case reflect.Bool: return !v.Bool() case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64: return v.Int() == 0 case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr: return v.Uint() == 0 case reflect.Float32, reflect.Float64: return v.Float() == 0 case reflect.Interface, reflect.Ptr: return v.IsNil() } return false } func toString(value reflect.Value) (str string) { for { if value.Type().Implements(stringerInterface) { return value.Interface().(fmt.Stringer).String() } switch value.Kind() { case reflect.String: return value.String() case reflect.Array, reflect.Slice: elt := value.Type().Elem() var runes []rune switch elt.Kind() { case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64: for i := 0; i < value.Len(); i++ { r := rune(value.Index(i).Int()) runes = append(runes, r) } case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64: for i := 0; i < value.Len(); i++ { r := rune(value.Index(i).Uint()) runes = append(runes, r) } } return string(runes) case reflect.Ptr, reflect.Interface: value = value.Elem() case reflect.Struct: return "" case reflect.Bool, reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64, reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr, reflect.Float32, reflect.Float64, reflect.Complex64, reflect.Complex128, reflect.UnsafePointer: return fmt.Sprint(value.Interface()) } } }
Learn Library Mashups Learn Systems Librarianship Learn Open Source My Sites LISRadio I was playing with StumbleUpon and it dropped me onto the LIS Webcasting page from the University of Missouri – Columbia. Welcome to LISRadio. This is a new and exciting series of interactive webcasts brought to you by the School of Information Science and Learning Technologies at the University of Missouri-Columbia. Our aim with these webcasts is to help in “…creating and exploring the intersection of information and learning.” We hope to present interesting and stimulating conversations with movers, shakers, and the odd gadfly or two in libraryland. How neat is that? Have other people already talked about this? If so – I’m sorry – I’m way behind on reading my news and blogs.
Electrochemical biosensor with pH regulation of CNTs/HRP multilayer for phenols. An amperometric horseradish peroxidase (HRP) biosensor based on multilayer films containing carbon nanotubes (CNTs) and HRP was developed. With the pH regulation of the dispersion solution of CNTs, the sensitivity of the HRP multilayer film biosensor is tunable by the control of the dissociation of CNTs. The successful formation of multilayers was confirmed by UV-visible spectroscopy. The features of multilayers were characterized by SEM and electrochemical impedance spectrum (EIS). The performance of the HRP biosensor is reported for the amperometric detection of phenols. The biosensor presented a linear response for catechol from 9.1 × 10(-8) - 6.45 × 10(-5) mol/L, with a sensitivity of 0.00554 A · L/mol and a detection limit of 8.5 × 10(-8) mol/L. The study can provide a feasible simple approach for developing a new sensitivity tunable method for CNTs-based biosensors.
<?php namespace SMW\Query\ProfileAnnotator; use SMW\DIProperty; use SMW\Query\Language\Description; use SMWDIBlob as DIBlob; use SMWDINumber as DINumber; /** * @license GNU GPL v2+ * @since 1.9 * * @author mwjames / class DescriptionProfileAnnotator extends ProfileAnnotatorDecorator { /* * @var Description / private $description; /* * @since 1.9 * * @param ProfileAnnotator $profileAnnotator * @param Description $description / public function __construct( ProfileAnnotator $profileAnnotator, Description $description ) { parent::__construct( $profileAnnotator ); $this->description = $description; } /* * ProfileAnnotatorDecorator::addPropertyValues */ protected function addPropertyValues() { $this->addQueryString( $this->description->getQueryString() ); $this->addQuerySize( $this->description->getSize() ); $this->addQueryDepth( $this->description->getDepth() ); } private function addQueryString( $queryString ) { $this->getSemanticData()->addPropertyObjectValue( new DIProperty( '_ASKST' ), new DIBlob( $queryString ) ); } private function addQuerySize( $size ) { $this->getSemanticData()->addPropertyObjectValue( new DIProperty( '_ASKSI' ), new DINumber( $size ) ); } private function addQueryDepth( $depth ) { $this->getSemanticData()->addPropertyObjectValue( new DIProperty( '_ASKDE' ), new DINumber( $depth ) ); } }
Mind-to-market tales are all the rage at innovation show When he used to pull a rickshaw in the Kauria Pul area in old Delhi in the late 1980s, Dharamvir Singh could have never imagined - even in his wildest dreams - that one day he would be face to face with the country's President. Not only could Singh meet President Pratibha Devisingh Patil this week, but products innovated by him are creating ripples across the developing world - from Cameron to Kenya. Singh, an innovator-turned-entrepreneur, is a perfect example of how need-based innovative ideas can be turned into marketable products profitably. Dharamvir Singh has developed a multi-purpose processing unit capable of pulverizing steaming and extracting essence or juice out of vegetables, fruits and herbs on an industrial scale. The machine can process about 200 kgs of any raw material in an hour Singh has developed a multipurpose processing unit capable of pulverizing, steaming and extracting essence or juice out of fruits, vegetables and herbs on an industrial scale. The machine, based on a specially designed pressure cooking chamber, can process about 200 kgs of any raw material ranging from amla and aloe vera to mango and tomato per hour. 'The best thing is it can be used for a variety of fruits and herbs. Abhishek Bhagat has developed an automatic food maker ¿ an electrically operated machine in which all one has to do is load ingredients in different containers and insert a recipe card Farmers can process their own produce or run small-scale food processing units', Singh, a resident of Damla village in Haryana, said while speaking to Mail Today at the grassroots innovation exhibition currently on at the sports ground in the President's Estate. Singh's innovation has been received well in the market. Over 220 units of the Rs 1.35- lakh processor have already been sold in Haryana and neighbouring states. The Ahmedabad-based National Innovation Fund (NIF) helped Singh in taking his prototype to the production stage by providing seed money from its micro venture innovation fund. One unit has been sent to Kenya on a pilot basis for application feasibility study there, while enquiries have been received from several other African countries. Over the past two decades, the Honeybee Network and NIF, founded by Anil Gupta, a professor at the Indian Institute of Management Ahmedabad, has built a database of 1.6 lakh grassroots innovations from all over the country. Harinarayan Prajapat, a car mechanic from Jaipur has developed a kit that can improve mileage of two-wheelers The best ideas are awarded every year, interesting innovations and prototypes are improvised through professional, technical and design help and innovators are helped to take their products to market. 'It is a long and tedious process but we now have a proven model of 'bottoms-up approach'. We scout innovations in informal sector, from common people, farmers, tribals, students and so on and then take them all the way up to the market,' Gupta said. So far, over 500 patents have been filed and about 10 per cent of them have been granted. A number of ideas have been converted into products by innovators themselves and by small and medium scale enterprises.
Bassam Abdel Majeed Bassam Abdel Majeed ( ) (born 1950) is a Syrian military officer, politician and diplomat. Early life and education Majeed is of Circassian origin, and was born into a Sunni Muslim family in 1950 in Beer Ajam, a village in the Quneitra Governorate in southwestern Syria. He attended Syria's Air Force Academy, graduating in 1970. Career Majeed held several military and security posts. He was director of the military police from 2003 to 2006. He was appointed the interior minister of Syria on 11 February 2006, succeeding Ghazi Kanaan. When he was in office, Hezbollah commander Imad Mugniyeh was killed in Damascus in February 2008. Majeed described the attack as "terrorist act". Majeed's term lasted until 23 April 2009 and he was replaced by Said Mohammad Sammour. In October 2009, Majeed was appointed Syria's ambassador to Kuwait. Personal life Majeed is married, and has two daughters and one son. References Category:1950 births Category:Living people Category:People from Quneitra District Category:Syrian people of Circassian descent Category:Syrian Sunni Muslims Category:Arab Socialist Ba'ath Party – Syria Region politicians Category:Syrian ministers of interior Category:Ambassadors of Syria to Kuwait
342 F.Supp.2d 1350 (2004) In re NEURONTIN MARKETING AND SALES PRACTICES LITIGATION No. 1629. Judicial Panel on Multidistrict Litigation. October 26, 2004. 1351 Before WM. TERRELL HODGES, Chairman, JOHN F. KEENAN, D. LOWELL JENSEN, J. FREDERICK MOTZ, ROBERT L. MILLER, Jr., KATHRYN H. VRATIL and DAVID R. HANSEN, Judges of the Panel. TRANSFER ORDER WM. TERRELL HODGES, Chairman. Now before the Panel are three separate motions encompassing a total of 27 actions that are listed on the attached Schedule A and are pending in sixteen districts as follows: six actions in the Eastern District of Louisiana; four actions in the District of Massachusetts; two actions each in the Eastern District of Arkansas, the Northern District of Florida, and the District of New Jersey; and one action each in the Southern District of Alabama, the Northern District of Georgia, the Southern District of Illinois, the Southern District of Indiana, the Western District of Louisiana, the District of Minnesota, the Southern District of Mississippi, the Southern District of New York, the Northern District of Ohio, the Western District of Tennessee, and the Northern District of Texas.[1] Pursuant to 28 U.S.C. § 1407, i) plaintiffs in one District of New Jersey action that originally moved for centralization in the District of New Jersey now move for centralization in the District of Massachusetts; ii) plaintiffs in two Eastern District of Louisiana actions move for centralization in their Louisiana district; and iii) common defendants Pfizer, Inc., Warner-Lambert Co., and Parke-Davis move for centralization in the Southern District of New York. No responding party opposes centralization, though respondents continue and expand upon the disagreement among movants regarding the appropriate choice for transferee district. Thus, some respondents support one of the forums suggested in the three Section 1407 motions, while other respondents have expressed support for one of four other potential transferee districts: the Northern District of Illinois, the Southern District of Illinois, the District of New Jersey, and the Northern District of Ohio. On the basis of the papers filed and hearing session held, the Panel finds that the actions in this litigation involve common questions of fact, and that centralization under Section 1407 in the District of Massachusetts will serve the convenience of the parties and witnesses and promote the just and efficient conduct of the litigation. All actions are purported class actions involving allegations that common defendants have engaged in the illegal promotion and sale of the drug Neurontin for "off-label" use. Centralization under Section 1407 is necessary in order to eliminate duplicative discovery, prevent inconsistent pretrial rulings (especially with respect to class certification matters), and conserve the resources of the parties, their counsel and the judiciary. In concluding that the District of Massachusetts is an appropriate forum for this docket, we note that i) the district is where a False Claims Act qui tarn action predicated on the same facts as those at issue in the MDL-1629 actions had been pending for eight years and had proceeded 1352 to a very advanced stage before being settled; and ii) the judge assigned to the constituent MDL-1629 Massachusetts actions is the same judge who presided over the quitarn action and is thus already thoroughly familiar with the issues of fact and law raised in the MDL-1629 actions. IT IS THEREFORE ORDERED that, pursuant to 28 U.S.C. § 1407, the actions listed on Schedule A and pending outside the District of Massachusetts are transferred to that district and, with the consent of that court, assigned to the Honorable Patti B. Saris for coordinated or consolidated pretrial proceedings with the actions pending there and listed on Schedule A. SCHEDULE A MDL-1629In re Neurontin Marketing and Sales Practices Litigation Southern District of Alabama Gulf Distributing Holdings, LLC v. Pfizer, Inc., C.A. No. 1:04-403 Eastern District of Arkansas Claudia Lang v. Pfizer, Inc., et al, C.A. No. 5:04-234 James Hope v. Pfizer, Inc., et al, C.A. No. 5:04-248 Northern District of Florida Sylvia G. Hyman v. Pfizer, Inc., et al, C.A. No. 3:04-215 Clifford Eckenrode v. Pfizer, Inc., et al, C.A. No. 3:04-240 Northern District of Georgia Johnny Ray Meeks, et al. v. Pfizer, Inc., et al, C.A. No. 1:04-1781 Southern District of Illinois Brenda Straddeck v. Pfizer, Inc., et al, C.A. No. 4:04-4106 SCHEDULE AContinued Southern District of Indiana Gerald Smith v. Pfizer, Inc., et al, C.A. No. 1:04-1052 Eastern District of Louisiana Emma B. Christina v. Pfizer, Inc., et al, C.A. No. 2:04-1450 Debra Mull etc. v. Pfizer, Inc., et al, C.A. No. 2:04-1489 Maggie Dorty, et al. v. Pfizer, Inc., et al, C.A. No. 2:04-1547 Dianne Irene Hood v. Pfizer, Inc., et al, C.A. No. 2:04-1575 Joyce B. Duhe v. Pfizer, Inc., et al, C.A. No. 2:04-1591 Patricia Ann White v. Pfizer, Inc., C.A. No. 2:04-1712 Western District of Louisiana Annie D. Blevins v. Pfizer, Inc., C.A. No. 6:04-1162 District of Massachusetts The Guardian Life Insurance Co. of America v. Pfizer, Inc., et al, C.A. No. 1:04-10739 Aetna, Inc. v. Pfizer, Inc., et al, C.A. No. 1:04-10958 Harden Manufacturing Corp. v. Pfizer, Inc., et al, C.A. No. 1:04-10981 Teamsters Health & Welfare Fund of Philadelphia & Vicinity v. Pfizer Inc., et al, C.A. No. 1:04-10984 District of Minnesota John Lerch v. Pfizer, Inc., et al, C.A. No. 0:04-3021 Southern District of Mississippi Mary Jane Gordon, et al. v. Pfizer, Inc., et al, C.A. No. 1:04-552 District of New Jersey ASEA/AFSCME Local 52 Health Benefits Trust, et al. v. Pfizer, Inc., et al, C.A. No. 2:04-2577 *1353 SCHEDULE A-Continued Julie K. Bakle v. Pfizer, Inc., et al, C.A. No. 2:04-2935 Southern District of New York Lorraine Kopa v. Pfizer, Inc., et al, C.A. No. 1:04-4593 Northern District of Ohio Mary Lou Lienerth v. Pfizer, Inc., et al, C.A. No. 1:04-1161 Western District of Tennessee James Doyle v. Pfizer, Inc., et al, C.A. No. 2:04-2509 Northern District of Texas Tammylee Willoz v. Pfizer, Inc., et al, C.A. No. 3:04-1234 NOTES [1] The Panel has been notified of additional related actions recently filed in the Middle and Southern Districts of Alabama, the Southern District of Florida, the Northern and Southern Districts of Illinois, the Eastern District of Louisiana, the Eastern District of Missouri, the District of New Jersey, and the Eastern District of Texas. In light of the Panel's disposition of this docket, these actions will be treated as potential tag-along actions. See Rules 7.4 and 7.5, R.P.J.P.M.L., 199 F.R.D. 425, 435-36 (2001).
7B00: 7B01: 7B02: 7B03: Ideograph, CJK ที่แท้จริง, จริงใจ, จริงใจ : duk1 : dǔ 7B04: กิ๊บอุดมคติ เด็กหญิงอายุสิบห้าปี CJK : gai1 : จิ 7B05: 7B06: รั้วไผ่ CJK : Baa1 : บริติชแอร์เวย์ 7B07: 7B08: กล่องไม้ไผ่อัดแข็งใช้แล้วพกหนังสือ CJK : kap1 : จิ 7B09: 7B0A: กระบวยตักดิน Ideograph, พายไม้ไผ่ CJK : zaau3 : Zhao 7B0B: หน่อไม้ไอเดียกราฟิค CJK : seon2 : sǔn 7B0C: 7B0D: 7B0E: 7B0F: แท็บเล็ต Ideograph ที่จัดขึ้นโดยใครบางคนที่มีอำนาจ CJK : FAT1 : Hu 7B10: ไขว้กันในกรอบไม้ซึ่งอาจเก็บเมล็ดพืชไว้ในภูมิอากาศชื้น CJK : hong4 : แขวน 7B11: รอยยิ้มบนแผนที่ไอเดียหัวเราะหัวเราะคิกคัก CJK หัวเราะในใจ : siu3 : เสี่ยว 7B12: 7B13: การออกแบบเพื่อหวี หวี CJK แบบฟัน : bei6 pai4 pei4 : BI 7B14: แปรงเขียนตัวอักษร เขียน; จังหวะ CJK : bat1 : bǐ 7B15: ท่อน้ำไม้ไผ่ Ideograph CJK : gan2 : jiǎn 7B16: 7B17: 7B18: 7B19: CJK เครื่องดนตรีรูปทรงน้ำเต้าขนาดเล็ก : saang1 sang1 : shēng 7B1A: 7B1B: ขลุ่ยไม้ไผ่ ผิวปาก CJK : dek6 : dí 7B1C: 7B1D: 7B1E: แท่งไขว้ที่ใช้ในการตี CJK : ci1 : จิ 7B1F: 7B20: หมวกไม้ไผ่ ไม้ไผ่คลุม CJK : lap1 : lì 7B21: 7B22: 7B23: 7B24: นึกถึงไม้กวาด CJK ที่เป็นไม้กวาด : tiu4 : Tiao 7B25: พิมพ์ตะกร้าขัดขวาง CJK : zi6 : sì 7B26: ไอดีโอ แท็ก, เครื่องหมาย, สัญลักษณ์, เสน่ห์ CJK : fu4 : fú 7B27: อุดมการณ์เพื่อยึดครอง ตรวจสอบ (ปัจจุบัน) ด้วยฝาย CJK : caak3 : CE 7B28: อุดมการณ์โง่เขลาโง่เขลา CJK อย่างเชื่องช้า : ban6 : Bèn 7B29: 7B2A: Ideograph เป็นแผ่นหยาบของ rushes หรือไม้ไผ่ CJK : daat3 : dá 7B2B: แผ่นกระดานพิมพ์ตัวอักษร, เสื่อนอน CJK : ได 6 zi2 : zǐ 7B2C: ลำดับตัวเลขตามอุดมคติ เกรด, CJK ระดับ : dai6 : dì 7B2D: หน้าจอไม้ไผ่ Ideograph CJK : ling4 ling6 : ปลาทะเลชนิดหนึ่ง 7B2E: บอร์ด Ideograph ที่รองรับกระเบื้องบนหลังคา CJK : zaak3 zaak6 zok6 : Zé 7B2F: Ideograph CJK กรงนก : nou4 : nU 7B30: ม่าน Ideograph CJK : FAT1 : fú 7B31: Ideograph วางกับดักตะกร้าสำหรับปลาวางในช่องเปิดของ CJK ฝาย : gau2 : gǒu 7B32: ตะกร้านึกคิด CJK : faan4 : แฟน 7B33: Ideograph CJK เป่านกหวีดใบไม้ : gaa1 : เจี่ย 7B34: พิมพ์กราฟแท่งลูกศร CJK : Go2 : gǎn 7B35: การออกแบบรูปทรงไม้ไผ่ โมเดล CJK : faan6 : แฟน 7B36: 7B37: 7B38: ตะกร้าใส่ตะกร้าแบบแบนเรียบ : PO2 : pǒ 7B39: ไผ่ CJK : sai3 : Ti 7B3A: โน้ตย่อ, บันทึกย่อ; เขียน; ความเห็น CJK : zin1 : Jiān 7B3B: 7B3C: กรง Ideograph ตะกร้าใส่กรงเหมือน CJK : lung4 lung5 : ยาว 7B3D: 7B3E: ภาชนะไม้ไผ่สำหรับอาหาร CJK : bin1 : เปี่ยน 7B3F: 7B40: 7B41: พิมพ์กรอบไม้ไผ่ที่ Silkworms หมุนรังไหม CJK : Qū 7B42: 7B43: 7B44: 7B45: แปรงไ ง้าว CJK : sin2 : xiǎn 7B46: แปรงเขียนตัวอักษร เขียน; จังหวะ CJK : bat1 : bǐ 7B47: ชื่อพิมพ์เขียวไม้ไผ่; เจ้าหน้าที่ไผ่ CJK : kung4 : Qiong 7B48: ลูกศรสิ้นสุด Ideo CJK : kut3 : Kuo 7B49: ยศอุดมการณ์เกรด รอ; เท่ากัน; 'ฯลฯ' CJK : dang2 : เติ้ง 7B4A: เชือกไม้ไผ่ วัตถุไม้ไผ่ที่ใช้ CJK : gaau2 : เสี่ยว 7B4B: กล้ามเนื้อ เอ็นกล้ามเนื้อ CJK : gan1 : Jīn 7B4C: เครื่องดักปลาไม้ไผ่ Ideograph CJK : cyun4 : Quán 7B4D: หน่อไม้ ร่วมกัน เอ็น CJK : seon2 : sǔn 7B4E: 7B4F: Ideograph แพ CJK : fat6 : ฟะ 7B50: ตะกร้าไม้ไผ่หรือแผ่นชีท CJK : hong1 kwaang1 kwaang2 : กวง 7B51: พิณแบบโบราณ สร้าง CJK : zuk1 : จู้ 7B52: แผ่นไม้ไผ่ ท่อ CJK : tung2 tung4 : tǒng 7B53: Ideograph เป็นกิ๊บติดผมที่ด้านหลังศีรษะ อายุ 15 ปี CJK : จิ 7B54: คำตอบที่ดีเลิศ, ตอบกลับ; กลับ; ยอมรับกับ CJK : daap3 : dá 7B55: 7B56: โครงการแผนที่ความคิด เพื่อแส้; กระตุ้น CJK : caak3 : CE 7B57: 7B58: 7B59: 7B5A: เครื่องจักสานไม้ไผ่ CJK : bat1 : BI 7B5B: ตะแกรงกรอง, กรอง, หน้าจอ; ร่อน CJK : sai1 : Shai 7B5C: ไผ่ CJK : dong1 : แดง 7B5D: เครื่องสาย ว่าว CJK : zaang1 zang1 : เจิ้งเหอ 7B5E: 7B5F: 7B60: ผิวไ Bamboo CJK : gwan1 wan4 : Yun 7B61: 7B62: Rake กราฟิค CJK : paa4 : Pá 7B63: 7B64: ไผ่ CJK : long4 : lang 7B65: ตะกร้าไม้ไผ่ทรงกลมสำหรับเก็บข้าว CJK : geoi2 : jǔ 7B66: ออกแบบปุ่มกด รับผิดชอบ ท่อ CJK : gun2 : guǎn 7B67: ท่อน้ำไม้ไผ่ Ideograph CJK : gaan2 gan2 : jiǎn 7B68: 7B69: ท่อไม้ไผ่ เบ็ดตกปลา CJK : tung2 tung4 : คีบ 7B6A: 7B6B: 7B6C: การเขียนแบบอักษรของ CJK ทอ : sing4 : เฉิง 7B6D: Ideograph เป็นอุปกรณ์โบราณสำหรับการทำงานกับตัวเลข นับคำนวณรูปที่ CJK : syun3 : สวน 7B6E: การทำนายอุดมการณ์ด้วยก้านของพืช divining rod CJK : sai6 : shì 7B6F: ตะเกียบ Ideograph, แหนบ CJK : zyu6 : จู้ 7B70: สายเคเบิลตัวอักษร CJK : zok6 : Zuo 7B71: ไผ่แคระ จิ๋วในชื่อบุคคล CJK : siu2 siu6 : xiǎo 7B72: ตะกร้าภาพพิมพ์, ถัง CJK : saau1 : Shao 7B73: CJK ฉลองการทำภาพพิมพ์ 7B74: ประเภทของหญ้าที่ใช้ในการทำนาย เพื่อพระเจ้า; ก้ามปู CJK : caak3 gaap3 : CE 7B75: CJK ฉลองการทำภาพพิมพ์ : jin4 : Yan 7B76: 7B77: ตะเกียบ Ideograph CJK : faai3 : Kuai 7B78: ชื่อสถานที่ใน Idean CJK : gon2 : กาน 7B79: ชิป Ideograph, เครื่องหมาย, โทเค็น; หาเงินกับ CJK : cau4 : chou 7B7A: ตะกร้าไม้ไผ่หรือแผ่นชีท CJK : กวง 7B7B: ชื่อสถานที่ที่มีการพิมพ์ตัวอักษรในมณฑลหูหนานของ CJK : gaang3 : แก๊ง 7B7C: ไผ่ CJK : WAN4 : Yun 7B7D: 7B7E: ป้ายสัญลักษณ์, การรับรอง; สลิปกระดาษ CJK : cim1 : Qian 7B7F: 7B80: อักษรตัวย่อเรียบง่ายสั้นรัดกุม CJK : gaan2 : jiǎn 7B81: 7B82: 7B83: 7B84: 7B85: 7B86: หวีเรียบ หวีผม CJK : BI 7B87: ชิ้นส่วนตัวเลขที่พิมพ์ด้วย Ideograph CJK เดียว : go3 : gè 7B88: 7B89: 7B8A: 7B8B: โน้ตย่อ, บันทึกย่อ; เขียน; ความเห็น CJK : zin1 : Jiān 7B8C: 7B8D: ห่วงพิมพ์เขียว ผูกล้อม CJK : fu1 ku1 : gū 7B8E: เครื่องตีเส้นลมเครื่องดนตรีโบราณ CJK : CI4 : chí 7B8F: เครื่องสาย ว่าว CJK : zaang1 zang1 : เจิ้งเหอ 7B90: การวาดภาพด้วยการวาดธนูไม้ไผ่หรือหน้าไม้ CJK : zing1 : ชิง 7B91: แฟน ๆ Ideograph CJK : saap3 zit6 : SHA 7B92: ไม้กวาด Ideograph CJK : zau2 : zhǒu 7B93: หนังสือแนวความคิด CJK : luk6 : lù 7B94: หน้าจอกกความคิด กรอบสำหรับการปลูกไหมหนอน CJK : bok6 : Bó 7B95: ตะแกรง Ideograph ถุงเก็บฝุ่น CJK : gei1 : จิ 7B96: 7B97: การนับการออกแบบกราฟฟิค วางแผน CJK : syun3 : สวน 7B98: ไผ่ CJK : ขวัญ 1 ขวัญ 3 : Jun 7B99: สั่นสะท้าน CJK : fuk6 : fú 7B9A: โน้ตสั้น ๆ ของ Ideograph CJK แถลงการณ์อย่างเป็นทางการ : Zha 7B9B: แตรเดี่ยว CJK : gu1 : gū 7B9C: เครื่องสายสตริงเครื่องดนตรีโบราณ CJK : hung1 : ฮ่องกง 7B9D: แหนบ Ideograph, คีม, แหนบ, ก้ามปู CJK : kim4 : qián 7B9E: 7B9F: 7BA0: การตีม้า โบย CJK : ceoi4 : Chui 7BA1: ท่อไอดีโอกราฟ, ท่อ, ท่อ; เพลงเป่าลมไม้ CJK : gun2 : guǎn 7BA2: 7BA3: 7BA4: 7BA5: 7BA6: แผ่นรองพื้นแบบ Ideograph เสื่อ CJK : zaak3 : Zé 7BA7: กล่องใส่กระเป๋าหรือกระเป๋าเดินทาง CJK : haap6 : Qie 7BA8: ปลอกไม้ไผ่ : tok3 : tuo 7BA9: ตะกร้าไม้ไผ่ Ideograph CJK : lo4 : Luo 7BAA: ตะกร้าไม้ไผ่ขนาดเล็กสำหรับการถือ CJK : daan1 : แดน 7BAB: ขลุ่ยไผ่ CJK : siu1 : xiāo 7BAC: พิมพ์ภาพไม้ไผ่ที่มีใบกว้างออกมา CJJ : joek6 : ruo 7BAD: ลูกศรออกแบบ ประเภทของ CJK ไผ่ : zin3 : jiàn 7BAE: 7BAF: แท่นพิมพ์ไม้ไผ่ : bin1 : เปี่ยน 7BB0: 7BB1: เคส, กล่อง, หีบ, CJK ลำตัว : soeng1 : Xiang 7BB2: 7BB3: เสื่อไม้ไผ่ Ideograph ใช้เพื่อป้องกันผู้โดยสารขนส่งจากฝุ่น (ฟอร์มหยาบคาย) CJK : ปิง 7BB4: เข็ม, หัววัด admon CJK : zam1 : Zhen 7BB5: 7BB6: 7BB7: 7BB8: ตะเกียบ Ideograph CJK : zyu3 zyu6 : จู้ 7BB9: 7BBA: 7BBB: 7BBC: 7BBD: 7BBE: เครื่องดนตรี Ideograph เช่นกระทะแพน, ขลุ่ยไม้ไผ่ CJK : siu6 sok3 : Shuo 7BBF: 7BC0: ปมการออกแบบฉลากโหนดข้อต่อ; ส่วน CJK : zit3 : jié 7BC1: ป่าไผ่กราฟิค Bamboo CJK : wong4 : Huáng 7BC2: 7BC3: 7BC4: รูปแบบการพิมพ์ตัวแบบ, กฎ, กฎหมาย CJK : faan6 : แฟน 7BC5: 7BC6: สคริปต์ประทับตรา Ideograph ตราประทับ, ตราประทับอย่างเป็นทางการ CJK : syun6 : Zhuan 7BC7: บทที่มีการเขียนแผนที่แนวส่วนบทความเรียงความ : PIN1 : Pian 7BC8: 7BC9: สร้างอุดมการณ์สร้าง อาคาร CJK : zuk1 : จู้ 7BCA: 7BCB: กล่องกราฟิค, กระเป๋าเดินทางหรือกล่อง CJK : haap6 : Qie 7BCC: เครื่องดนตรีโบราณ พิณ CJK : hau4 : Hou 7BCD: 7BCE: 7BCF: การฝังตัวอักษรพิมพ์ใหญ่ตั้งใน; ตกลงไป; CJK ที่ทนทาน : ham3 : Qian 7BD0: 7BD1: พิมพ์ตะกร้าไม้ไผ่สำหรับถือแผ่นดิน CJK : gwai6 : กุย 7BD2: 7BD3: ตะกร้าไม้ไผ่ Ideograph CJK : lau5 : lǒu 7BD4: ไผ่ CJK : WAN4 : Yun 7BD5: 7BD6: 7BD7: 7BD8: เครื่องมือที่ใช้ในการกรองไวน์ ตัวกรอง CJK : cau1 : chou 7BD9: Ideograph ใช้เสาถ่อเรือ CJK : gou1 : Gao 7BDA: ตะกร้าทรงกลมหรือทรงรีพร้อมขาสั้น CJK : fei2 : Fei 7BDB: Idek cuticle ของต้นไผ่ CJK : joek6 : ruo 7BDC: 7BDD: ตะกร้าไม้ไผ่ โครงไม้ไผ่ CJK : gau1 : Gou 7BDE: 7BDF: 7BE0: ไผ่แคระ จิ๋วในชื่อบุคคล CJK : siu2 : xiǎo 7BE1: Ideograph แย่งชิง CJK : saan3 : Cuan 7BE2: พิมพ์ชื่อหมวกไม้ไผ่ CJK : lung5 : lǒng 7BE3: 7BE4: Ideograph, CJK ที่แท้จริง, จริงใจ, จริงใจ : duk1 : dǔ 7BE5: Ideograph แตรเดี่ยว horn 篥bìlìตาตาร์ (ทาร์ทาร์) แตร CJK : leot6 : lì 7BE6: หวีเรียบ หวีผม CJK : bei1 bei6 : BI 7BE7: 7BE8: เสื่อไม้ไผ่ CJK น่าเกลียด : ceoi4 : บุญชู 7BE9: ตะแกรงกรอง, กรอง, หน้าจอ; ร่อน CJK : sai1 : Shai 7BEA: พิมพ์ตัวอักษรขลุ่ยไม้ไผ่ที่มีเจ็ดหลุม CJK : CI4 : chí 7BEB: 7BEC: 7BED: กรง Ideograph ตะกร้าใส่กรงเหมือน CJK : ยาว 7BEE: ตะกร้านึกคิด CJK : laam4 : แลน 7BEF: 7BF0: พิมพ์ตะกร้าไม้ไผ่ CJK : bou6 : bù 7BF1: ไม้ไผ่หรือรั้วไม้ ป้องกันความเสี่ยง CJK : lei4 : ลี้ 7BF2: ด้ามจับไม้กวาด Ideograph CJK : seoi6 wai6 : ฮุย 7BF3: เครื่องจักสานไม้ไผ่ CJK : bat1 : BI 7BF4: ขลุ่ยไม้ไผ่ ผิวปาก CJK : dek6 dik6 : dí 7BF5: 7BF6: 7BF7: กันสาดแบบ แล่นเรือ; เรือ CJK : pung4 : Peng 7BF8: พิมพ์ตะกร้า, ฮอด, วิ่งหนี ทรงผม CJK : caam2 cam1 zaam1 : cǎn 7BF9: อุดมการณ์เพื่อรวบรวม; แก้ไข; ตะกร้าไม้ไผ่ CJK : syun2 zaan6 : Zhuan 7BFA: 7BFB: 7BFC: เก้าอี้ซีดานภูเขา (คัน) ภาชนะง่าย ๆ ที่ไม่มีฝาครอบ CJK : dau1 : Dou 7BFD: 7BFE: แผ่นไม้ไผ่หรือแผ่นชีท CJK : mit6 : มิเอะ 7BFF:
of v and d. 1 Let f = -2 - -30. Calculate the greatest common factor of 112 and f. 28 Suppose o = 2u, -3o + 2o = 5u. Let i = -12 - -18. Suppose o = -3p + i. What is the greatest common divisor of p and 10? 2 Suppose -3h + 4h - 5 = 0. Suppose -hi = -i - 864. Suppose 0 = 3a - 2u - 216, 0 = -3a - 5u + 3u + i. What is the greatest common factor of 8 and a? 8 Let s(m) = 6m*2 - 5m + 4. Let j be s(2). What is the highest common factor of 81 and j? 9 Let b be 3 - ((-568)/1)/2. Suppose -6o + 3v = -o - 689, 5v + b = 2o. Calculate the greatest common factor of o and 17. 17 Suppose -16 - 4 = -4h. What is the highest common divisor of 20 and h? 5 Let y(f) = 3f + 1. Let c(i) = 5i3 - i + 1. Let j be c(1). Let h be y(j). What is the highest common factor of h and 144? 16 Let p(y) = y + 1. Let h be (-2)/((-3)/(-54)-4). Let f be p(h). What is the highest common factor of 25 and f? 5 Let i(j) = -j*3 - 11j*2 + j + 2. Let g be i(-11). Let x be (-1)/(-9) + (-539)/g. What is the highest common divisor of x and 12? 12 Suppose 0 = 5y + 2o + 2o - 133, -5y - 5o + 130 = 0. What is the greatest common divisor of y and 29? 29 Let h(q) = -q*3 - 2q*2 + 4q + 1. Let n be h(-3). Let d(k) = 4k2 + k - 2. Let c be d(n). Calculate the greatest common factor of 8 and c. 4 Suppose 0 = -2i - i + 45. Let p = i + -9. Let j be 1(-1 + 4)4. Calculate the greatest common divisor of p and j. 6 Let c(p) = p*2 + 8p + 8. Let y be c(-7). Let f(w) = w*2 - 6w*2 + 3 - 4w - w*3 - y. Let k be f(-4). What is the highest common factor of 22 and k? 2 Let r = 45 - -15. Calculate the greatest common divisor of r and 90. 30 Let k = 46 - -23. What is the greatest common divisor of 23 and k? 23 Let y = -29 - -159. What is the highest common divisor of y and 10? 10 Suppose 3h = -4a - 39, -2a + h - 30 = -h. Let u = a - -30. Calculate the greatest common factor of 6 and u. 6 Let z(k) = -17k - 1. Let u(d) = d3 + 5d*2 + 4d + 5. Let t be u(-4). Let w = t + -8. Let n be z(w). What is the highest common divisor of n and 10? 10 Let n be 3/(-27) + 1226/18. What is the highest common divisor of n and 4? 4 Let o = -41 + 49. What is the highest common factor of 20 and o? 4 Let b(l) be the second derivative of 29l4/12 + l3/3 - 3l*2/2 + 5l. Let x be b(2). What is the highest common divisor of 13 and x? 13 Suppose 5w = -i - 77, -w - i - 2 = 15. Let v be 2/5 + (-69)/w. Let z = -85 - -125. Calculate the greatest common factor of z and v. 5 Suppose -11y + y + 4400 = 0. What is the highest common divisor of 40 and y? 40 Suppose 3 = 2l + 9, -5x + 2l - 34 = 0. Let b(q) = q2 - 7q - 8. Let m be b(x). What is the greatest common divisor of m and 16? 16 Let i(y) = 2y2 + 10y + 8. Let h be i(-7). Let l(k) = 8k3 + k2 - k + 1. Let u be l(1). What is the greatest common factor of h and u? 9 Let m = 2 - 5. Suppose -4u - 108 = -8u. Let t be 1 + (-3 - m) + u. Calculate the greatest common divisor of 4 and t. 4 Suppose s - 10 - 4 = 0. Let n = 2 + -7. Let y = s + n. What is the highest common divisor of y and 81? 9 Suppose -3h - 5o + 6 = -0h, 2h = -5o + 4. Suppose -31 = hm - 3. Let a be -3 - m - -11. What is the greatest common divisor of 60 and a? 12 Let w = 251 + -167. What is the greatest common factor of w and 12? 12 Let u(h) = -h*3 + 7h*2 + 4h - 13. Let z be u(7). What is the greatest common factor of z and 45? 15 Let y = 34 - -2. Suppose -y = -0b + 4b. Let u = b + 10. Calculate the greatest common factor of 9 and u. 1 Suppose -m = -3m - 792. Let t be (-16)/6m/8. Calculate the greatest common factor of t and 12. 12 Suppose -6x + x - o = -524, -205 = -2x - 5o. Suppose f - 50 = 6f. Let b(m) = m*2 + 9m + 5. Let c be b(f). What is the greatest common factor of x and c? 15 Let h = 43 + -25. Calculate the highest common divisor of h and 2. 2 Let v be (-2)/(3 + 2/(-2)). Let k = 4 - v. Calculate the highest common divisor of 1 and k. 1 Let k = -13 - -18. Let u be (28/5)/(2/k). What is the highest common divisor of u and 154? 14 Let d(t) = t*3 - 7t*2 - 8t + 9. Let s be d(8). Suppose v + s = z, -4v + 0z - z = 41. Let i = v + 25. Calculate the greatest common factor of i and 135. 15 Let h be (-58)/(0 - 0 - 2). Let l be (4/5)/(2/10). Let z = h + l. Calculate the highest common factor of z and 11. 11 Let b(m) = 20m + 1. Let x be b(1). Let w = 1 + x. Let t = w + -16. Calculate the greatest common factor of 42 and t. 6 Let j(p) = 3p - 3. Let z = -5 + 9. Let u be j(z). Calculate the highest common factor of u and 6. 3 Let l(h) = -h*2 + 6h - 2. Let x be l(5). Let n be ((-9)/(-2))/16. What is the greatest common divisor of n and x? 3 Let r(y) = 106y + 4. Let v be r(4). Suppose -4l - i = -v, -2l + i + 2i + 228 = 0. Let c be (6-4)/(8/(-4)). Calculate the highest common factor of c and l. 12 Suppose -51 = -3k + 12. Suppose -h = -t + 2h - 10, 0 = -5h + 25. Suppose ti = 454 + 386. What is the greatest common factor of i and k? 21 Let o(p) = p*2 - 15p + 2. Let a be o(15). What is the highest common factor of a and 8? 2 Let y(x) = 2x3 - 2x*2 - 2x. Let v be y(2). Suppose 4k + 3d - 73 = 75, 5k - 184 = -vd. What is the greatest common factor of k and 8? 8 Let n be -2 + (16/6 - 3/(-9)). What is the greatest common factor of 2 and n? 1 Let k be ((-4)/(-10))/((-8)/(-120)). Let x be (k/(-12))/((-1)/2). Calculate the greatest common divisor of 9 and x. 1 Suppose -3u + 4u = 0. Let d be -1(0 + 5)-1. Suppose -2b + 0b - 101 = -3s, -ds - b + 164 = u. Calculate the highest common factor of 3 and s. 3 Suppose 3i - 3l = -l + 23, 5i - 2l - 41 = 0. What is the greatest common factor of i and 99? 9 Suppose 6 = -2b + 5j + 2, 3j - 3 = b. Suppose bp = -i + 4i - 132, -3i + 171 = -4p. Let o = p + 69. Calculate the highest common divisor of 45 and o. 15 Let j be (-5)/3 + (-3)/9. Let n be 20/(-15)3/j. Let w(t) = -5t + 2. Let p be w(-4). What is the highest common factor of n and p? 2 Let k be (-8 - -9) + (1 - -9). Suppose 2a = -v + 6a + 85, 146 = 2v + 4a. What is the greatest common divisor of v and k? 11 Let r(a) = -3a - 3. Let p be r(3). Let k = 10 - p. Let b = -12 + k. What is the greatest common divisor of b and 90? 10 Suppose 0 = -4m + 111 - 15. What is the greatest common factor of 56 and m? 8 Let a = 2 - 0. Suppose aw - 5 = -1. Suppose -10 = -3o + w. What is the greatest common factor of o and 16? 4 Let b(v) = -8v - 2. Let h be b(-2). Suppose 4s - 2s = 4. What is the highest common divisor of s and h? 2 Let f be ((-10)/20)/(2/(-48)). Suppose f = -5l + 42. Calculate the greatest common divisor of l and 6. 6 Let r be 4/318/(-4). Let m be ((-8)/(-10))/(r/45). Let d be (-37)/(-1) + (m - -5). What is the greatest common divisor of 24 and d? 12 Let l = 13 - 8. Suppose -68 = -5s - 4t + 24, -lt + 70 = 4s. Calculate the highest common factor of s and 20. 20 Suppose -26 = -2q - q + 4h, h = -4q + 22. Calculate the greatest common divisor of 30 and q. 6 Suppose 960 = 12a - 1536. What is the greatest common factor of 26 and a? 26 Let s = 20 + -12. What is the greatest common factor of s and 16? 8 Suppose 0 = -5c + 9c - 8. Calculate the highest common divisor of 14 and c. 2 Let y(x) = x*3 - 6x*2 - 3x - 10. Let k be y(7). What is the greatest common divisor of k and 6? 6 Let b be 4/3 - (-4)/6. Suppose -40 = -bk + 26. Calculate the greatest common factor of k and 22. 11 Let h be (-2)/(-8) - 54/(-8). Calculate the greatest common factor of 14 and h. 7 Let m = 2 - 1. Let h = 17 + -8. What is the greatest common divisor of m and h? 1 Let k(a) = -a - 6. Let q be k(6). Let c be ((-45)/q)/(1/8). What is the greatest common divisor of 10 and c? 10 Let h = 65 + -41. Calculate the greatest common factor of 3 and h. 3 Suppose 4u = 9u - 525. What is the highest common factor of 21 and u? 21 Let a = -17 - -12. Let h(l) = -l + 6. Let b be h(a). Let g = 178 - 123. Calculate the highest common divisor of g and b. 11 Suppose 5q - 50 - 5 = 0. Let r(k) = k*2 - 3k + 1. Let d be r(5). Calculate the greatest common divisor of d and q. 11 Suppose -124a - 42 = -127a. Let u = 32 - 11. What is the highest common factor of a and u? 7 Suppose -7 = -2c + 5. Let v be 0-3(-1)/c. Suppose -3n + 267 - 57 = v. What is the highes
Q: How to convert milliseconds to date in mongodb aggregation? I have a collection in MongoDB and documents like this - [ { "campaignId": 1, "operatorId": 1, "txnType": "DR", "amount": 2, "balance": 0, "txnTime": 1428907779206, "txnSrc": "Dial_In", "msisdn": "9789877667", "circle": "Delhi", "smsContent": "Hello Mr Arif" }, { "campaignId": 1, "operatorId": 1, "txnType": "DR", "circle": "Delhi", "amount": 2, "balance": 0, "txnTime": 1430111514796, "txnSrc": "Dial_In", "msisdn": "9189877667", "smsContent": "Hello Mr Arif" }, { "campaignId": 1, "operatorId": 1, "txnType": "DR", "circle": "Delhi", "amount": 2, "balance": 0, "txnTime": 1430111514796, "txnSrc": "Dial_In", "msisdn": "9189877000", "smsContent": "Hello Mr Arif" }, { "campaignId": 8, "operatorId": 1, "txnType": "DR", "circle": "Delhi", "amount": 2, "balance": 0, "txnTime": 1430111514796, "txnSrc": "Dial_In", "msisdn": "9189877010", "smsContent": "Hello Mr Arif" }, { "campaignId": 8, "operatorId": 1, "txnType": "DR", "circle": "Mumbai", "amount": 2, "balance": 0, "txnTime": 1430111514796, "txnSrc": "Dial_In", "msisdn": "9180877010", "smsContent": "Hello Mr Arif" }, { "campaignId": 1, "operatorId": 1, "txnType": "DR", "circle": "Mumbai", "amount": 2, "balance": 0, "txnTime": 1430111514796, "txnSrc": "Dial_In", "msisdn": "9180877010", "smsContent": "Hello Mr Arif" }, { "campaignId": 1, "operatorId": 1, "txnType": "DR", "circle": "Mumbai", "amount": 2, "balance": 0, "txnTime": 1429986600000, "txnSrc": "Dial_In", "msisdn": "91808770101", "smsContent": "Hello Mr Arif" }, { "campaignId": 1, "operatorId": 1, "txnType": "DR", "circle": "Delhi", "amount": 2, "balance": 0, "txnTime": 1429986600000, "txnSrc": "Dial_In", "msisdn": "91808070101", "smsContent": "Hello Mr Arif" }, { "campaignId": 1, "operatorId": 1, "txnType": "DR", "circle": "Delhi", "amount": 2, "balance": 0, "txnTime": 1429986600000, "txnSrc": "Dial_In", "msisdn": "91808070101", "smsContent": "Hello Mr Arif" }, { "campaignId": 8, "operatorId": 1, "txnType": "DR", "circle": "Jaipur", "amount": 2, "balance": 0, "txnTime": 1430111514796, "txnSrc": "Dial_In", "msisdn": "9180877010", "smsContent": "Hello Mr Arif" }, { "campaignId": 8, "operatorId": 1, "txnType": "DR", "circle": "UP-West", "amount": 2, "balance": 0, "txnTime": 1430111514796, "txnSrc": "Dial_In", "msisdn": "9180877010", "smsContent": "Hello Mr Arif" }, { "campaignId": 1, "operatorId": 1, "txnType": "DR", "circle": "Delhi", "amount": 2, "balance": 0, "txnTime": 1429986601111, "txnSrc": "Dial_In", "msisdn": "91808070101", "smsContent": "Hello Mr Arif" } ] I made a aggregation query for group by for this collection on the basis of unique msisdn for a date, which is - db.campaign_wallet.aggregate({ "$match": { "campaignId": 1, "txnTime": { "$gte": 1429554600000, "$lte": 1430159400000 } } }, { "$group": { "_id": { "txnTime": "$txnTime", "msisdn": "$msisdn" }, "msisdnCount": { "$sum": 1 } } }, { "$group": { "_id": "$_id.txnTime", "msisdns": { "$push": { "txnTime": "$_id.txnTime", "count": "$msisdnCount" }, }, "count": { "$sum": "$msisdnCount" } } }); This is giving right result on the basis of time in milliseconds and msisdns - I have to convert time(milliseconds) in date in my query so that it will filter data on the basis of date not on exact time in milliseconds. What is the solution? A: You could try adding the milliseconds time to a zero-milliseconds Date() object in the $project operator using the $add arithmetic operator, so an aggregation pipeline like the following will give you the timestamp field converted to Date: db.campaign_wallet.aggregate([ { "$match": { "campaignId" : 1 , "txnTime" : { "$gte" : 1429554600000 , "$lte" : 1430159400000 } } }, { "$group" : { "_id" : { "txnTime" : "$txnTime", "msisdn":"$msisdn" }, "msisdnCount" : { "$sum" : 1} } }, { "$group" : { "_id" : "$_id.txnTime", "msisdns" : { "$push" :{ "txnTime" : "$_id.txnTime", "count" : "$msisdnCount" }, }, "count" : { "$sum" : "$msisdnCount" } } }, { "$unwind": "$msisdns" }, { "$project": { "msisdns": { "txnTime" : { "$add": [ new Date(0), "$msisdns.txnTime" ] } }, "msisdns.count": 1, "count": 1 } } ]); Output: /* 0 */ { "result" : [ { "_id" : 1430111514796, "msisdns" : { "txnTime" : ISODate("2015-04-27T05:11:54.796Z"), "count" : 1 }, "count" : 1 }, { "_id" : 1430111514900, "msisdns" : { "txnTime" : ISODate("2015-04-27T05:11:54.900Z"), "count" : 1 }, "count" : 1 } ], "ok" : 1 }
Q: How it adjust the max width of a textbox in a TreeViewItem to the edges of the container The text box in the follow TreeViewItem, constructed by a data template, is not horizontal adjustable to the edges of the tree view. <DataTemplate x:Key="PageTemplate" x:DataType="local:OnenoteEntity"> <TreeViewItem AutomationProperties.Name="{x:Bind Page.Title}" HorizontalContentAlignment="Stretch"> <StackPanel MaxWidth="{Binding ActualWidth, ElementName=UiOnenoteTreeView}" HorizontalAlignment="Stretch" VerticalAlignment="Top" Orientation="Horizontal"> <Image Height="{Binding ActualHeight, ElementName=UiNameOnenoteEntity, Mode=OneWay}" Margin="0,0,10,0" VerticalAlignment="Center" Source="Resources/Page.png" /> <TextBlock x:Name="UiNameOnenoteEntity" HorizontalAlignment="Left" VerticalAlignment="Center" Style="{ThemeResource BodyTextBlockStyle}" Text="{x:Bind Page.Title}" TextWrapping="WrapWholeWords" /> </StackPanel> </TreeViewItem> </DataTemplate> The text in the box dont wrapp at the edge of the container in the tree view. The text box has the width size of the actual text, according to the following picture: Picture What can i do, to wrap the text? Thanks for answering A: As @2zemec said, you need to change the TextWrapping property of TetxBlock to Wrap. In addition, since you set the Orientation of StackPanel as Horizontal, the StackPanel will give the full width to each child control, and then put them out horizontally. It will not limit the width of TextBlock, so the TextBlock won't wrap. In this case, you can also set a MaxWidth for TextBlock to limit it or use Grid to replace the StackPanel. For example: <Grid MaxWidth="300"> <Grid.ColumnDefinitions> <ColumnDefinition Width="Auto"/> <ColumnDefinition Width="*"/> </Grid.ColumnDefinitions> <Image Height="{Binding ActualHeight, ElementName=UiNameOnenoteEntity, Mode=OneWay}" Margin="0,0,10,0" VerticalAlignment="Center" Source="Assets/StoreLogo.png" /> <TextBlock Grid.Column="1" x:Name="UiNameOnenoteEntity" HorizontalAlignment="Left" VerticalAlignment="Center" Text="{x:Bind Title}" TextWrapping="Wrap"/> </Grid>
Sonocatalytic degradation of ciprofloxacin using synthesized TiO2 nanoparticles on montmorillonite. TiO2/Montmorillonite (TiO2/MMT) nanocomposite as sonocatalyst was produced by immobilizing synthesized TiO2 on the surface of montmorillonite. The characteristics of produced nanocomposite were investigated using XRD, XRF, FTIR, TEM, SEM, EDX, UV-vis DRS and nitrogen adsorption-desorption analyses. The synthesized TiO2 and TiO2/MMT samples were applied as catalysts for sonocatalytic degradation of ciprofloxacin (CIP). The performance of the TiO2/MMT was greater than pure TiO2 sample in treatment of CIP solution. The degradation efficiency of the CIP by sonocatalytic process was affected by solution pH, catalyst dosage, initial CIP concentrations and ultrasonic power. Degradation efficiency of 65.01% was obtained at the pH of 6, catalyst dosage of 0.2gL-1, initial CIP concentration of 10mgL-1 and ultrasonic power of 650WL-1. It was observed that the presence of inorganic and organic scavengers suppressed the performance of sonocatalytic process. The stability of the nanocomposite was studied in several successive experiments, and the degradation efficiency declined only 61.48% after 4 repeated experiments. The main degradation by-products were recognized by GC-MS method to propose the possible sonocatalytic mechanism for the degradation of CIP.
The Department of Justice is seen in Washington on February 20, 2011. UPI/Roger L. Wollenberg \| License Photo Feb. 16 (UPI) -- The Justice Department on Friday announced it has reached an agreement with Honolulu after filling a lawsuit accusing the city and county of towing and selling vehicles of active-duty service members without court orders. The complaint, filed Thursday in U.S. District Court, accuses Honolulu and its contracted towing company, All Island Automotive Towing, of violating the Servicemembers Civil Relief Act, a law that provides protections for military members while in active duty. Under the agreement, Honolulu must adopt new procedures compliant with the act and pay three service members a total of $55,857 to compensate for their vehicles being auctioned off while they were at sea aboard Navy ships. The agreement also requires Honolulu to establish a $150,000 settlement fund for other servicemembers whose SCRA rights may have been violated. A Justice Department investigation found between 2011 and 2016, Honolulu auctioned 1,440 cars that were registered as service members during the motor vehicle registration process. Honolulu's new procedures will ensure active-duty service members receive notice about their car being towed and requires the city and county to obtain a court order before selling the car at action. "The Justice Department is committed to working tirelessly to protect the rights of the servicemembers who make great personal sacrifices in service to our country," said Acting Assistant Attorney General John Gore of the Civil Rights Division. U.S. Attorney Kenji M. Price of the District of Hawaii said his office will continue to work with the Civil Rights Division "to ensure that servicemembers who dedicate their lives to preserving our security and freedom do not forfeit their rights in doing so."
Divine & CECAQ-11 For over 15 years, Divine has contributed a percentage of its gross revenue each year into a Producer Support and Development Fund, with which it works with Kuapa Kokoo as well as other Farmer Associations. Divine are now supporting new cocoa origins, one of which is São Tomé and Príncipe. CECAQ-11 will supply organic cocoa for Divine’s first organic range of cocoa bars. The new high cocoa (85%+) range will have five distinct flavours and the following certifications (Fairtrade, organic, vegan and certified non-GMO). Divine will initially purchase organic cocoa through GEPA The Fairtrade Company, who are already buying from CECAQ-11. Divine’s aim is to develop a long-term partnership with the cooperative and invest in the producer organisation to support its continued growth. Background Production has been increasing over the last few years however the cooperative has not been yet reaching projected volumes and therefore hasn’t been able to return more value back to their farmers. The farmers’ yields are still low (250kg per hectare as opposed to a potential yield of 500kg according to cooperative management) and they believe they can do more. Hortencia Pina, an inspiring female leader, helped to inform the development of the gender section of the project. Hortencia learned to farm the land from an early age and now grows cocoa and pepper and has been proactive in CECAQ-11 since she joined in 2009. Today she also works for the co-op, managing logistics. Hortencia has lobbied to ensure women get their own titles to land and is keen to encourage them to get more involved in the coop. Project overview: Twin, with the support of Divine, will support the cooperative in two key areas: Sustainable agriculture: CECAQ-11 has requested support for 105 farmers who have not yet received technical assistance to improve production processes and plot productivity. This would include inputs and material for grafting, pruning and shade management, training on soil nutrition and erosion control, and exchange visits for producers, to support the sustainability of the production system. Gender programme: the project will focus on land titles and access to resources, including support for alcohol abuse, which was an issue highlighted in the scoping phase. A gender and youth inclusive policy will be developed in participation with the cooperative, and training on this provided.
Long-term outcome of cemented total hip arthroplasty with the Charnley-type femoral stem made of titanium alloy. Total hip arthroplasty is a successful treatment for hip diseases including osteoarthritis, osteonecrosis of the femoral head, and rheumatoid arthritis. Various designs of cemented femoral stems made of stainless steel and titanium alloy have been used. Among them, Charnley-type femoral stems made of stainless steel have often been reported to have good long-term outcome. However, the long-term outcome of the Charnley-type femoral stem made of Ti alloy is yet to be reported. We conducted a retrospective study to assess the long-term outcome of cemented primary total hip arthroplasty with the Charnley-type femoral stem made of Ti alloy. Between October 1988 and February 1997, 341 cemented primary total hip arthroplasties with the Charnley-type femoral stem made of Ti alloy were consecutively performed in our hospital. Among these, 164 patients (211 hips) who underwent this procedure were followed up for more than 12 years, and the surgical hips were analysed clinically and radiologically. The mean follow-up period was 20.6 years. Kaplan-Meier survival analyses were performed to assess femoral component survival. Factors affecting stem revision for aseptic loosening were also investigated using log-rank tests. In the functional assessment, the preoperative Japanese Orthopaedic Association score significantly improved from 47.2 points preoperatively to 79.0 points at the final follow-up. Eventually, 33 femoral stems were revised, of which 12 were revised for aseptic loosening. In the Kaplan-Meier survival analysis, the 20-year survival rates with stem revision for aseptic loosening and radiological stem loosening at the end points were 95.9% and 97.1%, respectively. Original diagnosis (non-osteoarthritis) was the only significant factor for aseptic loosening of the femoral stem. Cemented primary total hip arthroplasty with the Charnley-type femoral stem made of Ti alloy showed excellent outcomes for more than 20 years.
Q: Is there a reputation league based on softwares badges? I would like to know if there is a reputation league based on "software badges" (ex. [python],[java]) and possibly how to get there. Thanks. A: Click on any tag, then click "top users". For example, C#. There is no general rep leagues for sets of tags, since that would require explicitly categorizing all tags. And it wouldn't work anyways since questions are mis-tagged and something like C# could used on a question about the language, or a question about a program in C#, or a question about the compiler, and so on. Of course, in a broad sense all of Stack Overflow is about software, so you can just look at the general all-time rep league if you're interested.
Q: TypeError: firebase.storage is not a function Following this example, I keep getting the error: TypeError: firebase.storage is not a function From this line in my code: var storageRef = firebase.storage().ref(); (And when I simply try to initialize storage from the storage guide, linked from firebase's npm site, I get the same error.) In my Node.js project, I'm including the following libraries: const firebase = require('firebase'); var admin = require('firebase-admin'); const fs = require('fs'); Up to this point, I've successfully been able to read from and write to the firebase database, creating a reference to the database with var db = admin.database(), then var ref = db.ref("/")... So I know I've configured Firebase and firebase-database correctly. But I'm stuck on storage, and have tried both admin.storage().ref() and firebase.storage().ref(), and firebase.storage().ref("/") with the same error message. I've also tried: var storage = firbase.storage(); var storageRef = storage.ref(); and const app = firebase.initializeApp(config); var storage = app.storage(); and with ref()'s void argument () and with "/"... but have the same message, yet to no avail. I'm using: "firebase": "^3.6.4" "firebase-admin": "^4.0.4" Node.js : v6.9.1 What must I do to successfully create a reference to storage? A: I faced the same problem. In my case, I needed to include storage module besides Firebase core. import firebase from 'firebase'; import 'firebase/storage'; // <---- firebase.initializeApp({ ... }); const storageRef = firebase.storage().ref(); (npm firebase v5.0.4) A: DEPRECATED, see below: According to this answer, instead of firebase storage, in Node.js, google-cloud package storage should be used, and it seems that this answer should confirm it. Code example: npm i --save google-cloud Then: const gcloud = require('google-cloud') const storage = gcloud.storage({ projectId: '<projectID>', keyFilename: 'service-account-credentials.json', }); const bucket = storage.bucket('<projectID>.appspot.com') As of 2018, this is the correct answer: Or using only the storage part of the package: npm install --save @google-cloud/storage And then: var storage = require('@google-cloud/storage') Also check the docs for more. A: Deprecated: please see the accepted answer. Some details to note: Firebase Storage is no longer used with Node.js, so all documentation there is useless for Node.js. Instead, use google-cloud. The references and guides for Firebase and Google Cloud do not reflect this as of today. Unlike Firebase, google-cloud costs money, even for small projects. In my case, I'm using the firebase-admin SDK so I don't have to mess with user authentication at the moment. Purpose To create a single Node.js project which uses Firebase and Google Cloud. Why? Firebase has a useful database, among other features, and Google Cloud allows cloud file storage and retrieval. Directions Step 1: Project Creation Create Firebase and Google Cloud (Storage) projects. Step 2: Install Packages Using npm, install firebase-admin and google-cloud in Node.js project. Note 1: I used the admin SDK, so after creating the Firebase project, you'll need to go to: Settings(the gear) > Project Settings > Service Accounts > Firebase Admin SDK Then you: Select Node.js > [Copy/paste the generated code into your project] > [click "Generate New Private Key"] > [download the generated json to preferred location] > [replace "path/to...AccountKey.json" with the path to the key you just generated] Note 2: the generated key can be reused in firebase or google-cloud credentials. Step 3: Firebase Setup Once your project is created, import the firebase-admin sdk: The code should look like this, but filled with your info: var admin = require("firebase-admin"); admin.initializeApp({ credential: admin.credential.cert("/path/to/generated/json/here.json"), databaseURL: "database-url-from-firebase" }); To find the databaseURL, go to 'Storage' in Firebase, and note the URL starting with gs: and copy/paste it the the value field of databaseURL. Next, get a reference to the database you can use: var db = admin.database(); var ref = db.ref("/"); console.log('DB ref: ' + ref); //just to debug, if undefined, there's a problem. To learn more about reading/writing to the database, follow Firebase's own documentation. Step 4: Google-Cloud Billing Setup After creating a project on Google Cloud, add billing information; buckets cannot be used without billing info. Step 5: Google-Cloud Storage Setup Scrolling through the menu (the horizontal 3-bars), click "Storage", then "Enable Billing". Yes, you added billing info, now you need to enable it for that project's buckets. You should see that a bucket should already exists from your Firebase project. Click on menu again(3-bar icon), then > IAM & Admin > Settings At settings, you'll see "Project ID" which should look like "projectName-00000" or "projectName-Some#", copy that project ID Step 6: Google Cloud in Node.js In your index.js: var gcloud = require('google-cloud'); var gcs = gcloud.storage({ projectId: 'paste-that-project-id-here', keyFilename: 'paste-that-path-to-the-previously-downloaded-json-from-firebase-here' }); Now you can send a file to your storage by: var bucket = gcs.bucket('bucket_name'); var remoteFile = bucket.file('somefile-inThisCaseASong.mp3'); var localFilename = '/Users/you/Music/somefile-inThisCaseASong.mp3'; bucket.upload(localFilename, function(err, file) { if (!err) { console.log('somefile-inThisCaseASong.mp3 is now in your bucket.'); } else { console.log('Error uploading file: ' + err); } }); Step 7: Verify If the file is visible in Firebase Storage and Google Cloud Storage, you're done!
(CNN) It wasn't a pledge or a promise, but Kamala Harris on Friday heartily embraced the idea of choosing a female vice president to create an all-woman ticket in her quest for the White House. "Wouldn't that be fabulous?" the California Democratic senator told the Rev. Mark Thompson on SiriusXM's Make It Plain with Mark Thompson. When asked whether America is ready for that, Harris demurred. "We'll see if it happens," she replied. Just a few years ago, when Hillary Clinton made history as the first female presidential nominee of a major party, the idea of two women on the ticket seemed unthinkable. During her long and arduous campaign, Clinton most often confronted the question of whether America was ready for a female president. The six women running in this crowded field -- Harris, Sens. Elizabeth Warren of Massachusetts, Amy Klobuchar of Minnesota, Kirsten Gillibrand of New York, Rep. Tulsi Gabbard of Hawaii and spiritual author Marianne Williamson -- still face that question. But in this historic moment -- fueled by the #MeToo movement and a growing culture of female empowerment -- the notion doesn't seem quite so far-fetched. Read More
Paris Judge Rejects Attempt to Halt Auction of Hopi Sacred Objects Robert Redford amongst many who had asked for auction to be scrapped PARIS, FRANCE - A Paris judge today threw out a bid by Survival International to block a controversial auction of sacred objects of Arizona’s Hopi tribe. The judge ruled that ‘in spite of their sacredness to the Hopi these masks are not a representation of any creature, alive or dead.’ The auction house Neret-Minet Tessier & Sarrou had turned down repeated requests by the tribe to postpone the sale, which will now take place in Paris today. The Hopi tribe is ‘vehemently opposed’ to the auction of the Katsinam (“friends”), which are of spiritual significance to the tribe, and had requested that the objects be returned to them immediately. Lawyers for Survival International had asked the judge to stop the sale until the lawfulness of the collection could be established, but there is now no legal obstacle to the auction taking place. Actor Robert Redford earlier pleaded for the auction to be scrapped. ‘To auction these would be, in my opinion, a sacrilege – a criminal gesture that contains grave moral repercussions. I would hope that these sacred items can be returned to the Hopi tribe where they belong. They are not for auction’, he said in a statement. Lawyer Pierre Servan-Schreiber of the firm Skadden, Arps said today, ‘This is a very unfortunate outcome, as these objects will now be sold and dispersed, and the likelihood that they will eventually return to their true home amongst the Hopi is severely reduced. It also probably means that French institutions are still not fully aware of the devastating consequences that such mercantile fate for truly sacred objects may have on tribes who have already suffered so much.’ Stephen Corry, Director of Survival International, said today, ‘Potential buyers of these objects should be aware that the Hopi are profoundly distressed at their sale, and regard them as the rightful property of the Hopi people. French law appears to offer the Hopi little comfort, but we still hope that justice will prevail, and that these objects can still be returned to their proper owners.’ ### The movement for tribal peoples. Survival is the only organization working for tribal peoples’ rights worldwide. We work with hundreds of tribal communities and organizations. We are funded almost entirely by concerned members of the public and some foundations. We will not take national government money, because governments are the main violators of tribal peoples’ rights, nor will we take money from companies which might be abusing tribal peoples. Further Surrounded by a massive police presence, the country's top law enforcement official told a group of carefully screened students at Georgetown's Law School that, "In this great land, the government does not tell you what to think or what to say." In his speech, only announced the day before, Sessions went on to denounce uppity knee-taking football players and defend his boss' call, hours before, for them to be fired. We may need to upgrade the ole Irony Alert buzzer. It can't keep up.
Kurwai (Vidhan Sabha constituency) Kurwai (SC) Vidhan Sabha constituency (Hindi:कुरवाई विधान सभा निर्वाचन क्षेत्र)यहाँ के लोग बहुत अच्छे है और चुनावी माहौल भी अच्छा है is one of the 230 Vidhan Sabha (Legislative Assembly) constituencies of Madhya Pradesh state in central India. This constituency came into existence in 1957, as one of the Vidhan Sabha constituencies of Madhya Pradesh state. This constituency is reserved for the candidates belonging to the Scheduled castes since 1977, following the delimitation of the Legislative Assembly constituencies. Overview Kurwai (constituency number 146) is one of the 5 Vidhan Sabha constituencies located in Vidisha district. This constituency presently covers the entire Kurwai tehsil of the district with 224 villages, Sironj tehsil's 116 villages and Basoda tehsil's 94 villages. It has total 264 polling booth. Total Voters in the constituency are 1,98,965. Kurwai is part of Sagar Lok Sabha constituency along with seven other Vidhan Sabha segments namely Sironj and Shamshabad in Vidisha district and Bina, Khurai, Surkhi, Naryoli and Sagar in Sagar district. Members of Legislative Assembly. 1957: Takhatmal, Indian National Congress 1962: Takhtamal Lunkaram, Indian National Congress 1967: K. Kumar, Bharatiya Jana Sangh 1972: Awadh Narayan, Bharatiya Jana Sangh 1977: Ram Charan Lal, JNP 1980: Panbai, Indian National Congress (I) 1985: Shyamlal Shankarlal, Bharatiya Janata Party 1990: Shyam Lal, Bharatiya Janata Party 1993: Chironjilal Sonkar, Bharatiya Janata Party 1998: Raghuveer Singh, Indian National Congress (I) 2003: Shyamlal Panthi, Bharatiya Janata Party 2008: Hari Singh Sapre, Bharatiya Janata Party 2013: Veer Singh Panwar, Bharatiya Janata Party 2018: Hari Singh Sapre, Bharatiya Janata Party See also Vidisha district References Category:Sagar district Category:Assembly constituencies of Madhya Pradesh
Pages Friday, September 24, 2010 Sugar and Spice and Everything Nice I recently became a member of The Cake Slice Baker's. Once each month I will be baking along with the group as we tackle the chosen cake. Then I will be posting about it on my blog. There will also be links to other members blogs so you can check out how everyone's cake turned out. I just know it is going to be fun to be a part of a wonderful group of baker's and blogger's, and I can't wait to get started. In the meantime I decided to bake the Fresh Apple Cake with Brown Sugar Glazethat they all baked last month. This recipe is by Nancie McDermott from her book, Southern Cakes. My daughter is having a bake sale at school tomorrow and I thought there should be something to offer besides neon colored cupcakes, which seem to be all the rage at her school. At least I know the teachers will be happy with what I made. At first I was going to use some left over Fuji apples. Then I remembered that I had some Ginger Gold apples, which I had never tried before, so I used them instead. After doing some research on these apples at the Produce Oasis, I found out that it is one of the first apples available in the fall and it does not store well. There is a slight taste of spice and it has a crisp white flesh that does not go brown too quickly after it has been cut, which worked out really well when I was prepping the ingredients. It also holds its shape well during cooking. An interesting trivia fact about apples - "in ancient Greece, tossing an apple to a girl was a traditional proposal of marriage; catching it was acceptance". I did make some minor changes to the recipe after reading some of the reviews. There seemed to be a few people mentioning the amount of oil so I cut it down to one cup and replaced the other half a cup with apple sauce. I also cut the sugar back to one cup of white sugar and half a cup of brown sugar. The last change I made was adding a teaspoon of Baking Spice from Penzeys because I needed to use it before it gets stale and I like the taste of it in baked goods. I try very hard not to let anything from Penzeys go stale because we don't have one here so it is hard to replenish my stock (shipping is a killer). The smell of the cake cooking was incredible - apples, pecans, and baking spice = yum. Once it was out of the oven, and I poured the glaze over the top, it took all my my willpower not to grab a fork and dig in. After it had cooled on the counter for a while I hid it in the refrigerator so it wouldn't tempt me. Once it was cool I cut it into squares and packaged it for the bake sale. I did try some of the crumbs and they were delicious. There were a few smaller pieces so I decided to keep those to enjoy tonight with our coffee. This recipe is definitely a keeper and I can't wait to bake another one. Heat the oven to 350F. Grease a 13 by 9 inch pan or two 8-9 inch cake pans.In a medium bowl combine the flour, sugar, baking soda and salt. Stir with a fork to mix everything together well. In a large bowl, beat the eggs with a wooden spoon or a mixer at low speed until pale yellow and foamy. Add the oil and vanilla and beat well. Stir in the flour mixture with a wooden spoon and continue stirring the batter just until the flour disappears. Add the apples and nuts, stir to mix them into the batter until fairly uniform. Scrape the batter into the prepared pans. Bake for 45-50 minutes (start checking at 25 minutes if making a 1/3 recipe loaf) or until the cake is golden brown, springs back when touched lightly near the center and is beginning to pull away from the sides of the pan. Place the cake (still in the pans) on a wire rack and spoon over the glaze while still hot. Brown Sugar Glaze Combine all the ingredients in a medium saucepan. Cook over medium heat, stirring often, until the mixture comes to a gentle boil. Then cook for 3-5 minutes. To Finish Spoon the hot glaze all over the hot-from-the-oven cake. Let the glazed cake cool completely before serving straight from the pan. Makes one 13x9 inch sheet cake or two 8-9inch round cakes (1/3 of a recipe makes one loaf pan)
Spending per child in Washington, D.C. public schools: $15,414 D.C.'s ranking for per student spending: #1, more than any state Average spending per student, nationally: $8,899 Percent of D.C. 8th grade students not proficient in reading: 88% Percent of D.C. 8th grade students not proficient in math: 93% D.C.'s ranking for reading and math proficiency: #51 Bottom Line: Washington, D.C. spends the most money per student, and gets the worst results. So much for the idea that spending more money on public schools will improve academic performance.
Dakota Dress Introducing an adorable orange and green plaid little girls handmade dress just perfect for the FALL season events. Enjoy this lovely classic style dress, adorned with the softest lace and small bows that give it a vintage feel. It's the perfect dress for Thanksgiving.
Lotteries have been adopted by many state governments as a means of generating additional tax revenue for projects such as highway construction, new schools, and public works programs. As state lotteries have proliferated, lotteries have employed a series of pull tab games that closely resemble casino style gaming machines in their play. Commonly, lotteries issue instant win game tickets containing characters indicating whether a prize has been won. The Characters are obscured so that they are not readily visible to persons prior to their purchase of the ticket. The characters may be obscured paper “pull tabs” secured by perforated edges which must be torn or burst. The purchaser “plays” the lottery ticket by purchasing it, and removing the covering to reveal the characters showing whether the card is a winner. If the card contains a winning combination of characters, the player may redeem it for the prize designated. Pull tab instant tickets are also utilized in charitable games, promotional sweepstakes, bingo parlors, and bars where allowed by law. From a competitive standpoint, the pull tab ticket suffers from a number of drawbacks. These drawbacks can be appreciated by comparing instant win tickets to their main legal competition, regional casino facilities. Casinos offer similar games, but in a much easier to use system. Either an attendant or machine tells the player how to play and whether they have won. The player is not required to read fine print and figure out rules. Additionally, casino games allow a more fast-paced game play than instant pull tab tickets. Moreover, casino machines include lights, computer graphics, and sound to stimulate player interest, something not possible with a pull tab ticket. A number of vending machines for selling instant pull tab tickets have been patented. Most of these machines operate similarly to existing non-gambling vending machines, as their primary two functions are to collect money and to dispense a purchased item, which in the case of a pull tab ticket machine is a pull tab ticket. Typically, the purchaser inserts money and pushes buttons on the machine to indicate the type of ticket and number of tickets desired. The machine then vends the tickets, and the purchaser receives whatever change is appropriate. Patents disclosing this type of vending machine include U.S. Pat. Nos. 5,222,624, and 6,886,728. Patents have also been issued for devices to remove the waxy material from scratch-off tickets. Such patents include U.S. Pat. Nos. 4,765,842, 5,253,383, 5,355,543, 5,402,549, 5,907,882. These devices are adequate as an alternative to manual removal of the scratch-off material, but are not believed to be fast enough or thorough enough to allow the high-speed scanning and vending of tickets required for operation in connection with the device of the present invention. Additionally, patents have also been issued for devices that simulate slot machine play from information supplied by a central computer server (see, for example, U.S. Pat. Nos. 6,733,385, 6,991,541, 7,192,348). These machines are usually considered class III gambling devices, requiring expensive and onerous state licenses, or adoption by the state lottery commission in the jurisdictions where they are implemented. Patents have also been issued for devices that use a proprietary ticket design to reveal a computer barcode printed on a ticket (see. e.g. U.S. Pat. No. 5,980,385). The ticket design utilized by these machines is proprietary and non-standard, and is not widely accepted or legal outside of certain Native American gaming establishments in the United States. Many patents have been issued for scanning devices and optical character recognition programs that convert barcode or printed text into a computer graphic display. See, for example, U.S. Pat. Nos. 7,203,663, 7,203,383, and 7,203,361 for recent patents in this area. Applicant has been issued U.S. Pat. Nos. 8,210,921 and 8,192,268 which describe two possible methods for removing the covering pull tabs from a pull tab instant ticket, passing the ticket through an optical scanning device, reading the characters contained thereon, vending the ticket, and displaying the results by means of computer generated audiovisual display. The present application expands on U.S. Pat. Nos. 8,210,921 and 8,192,268, as well as describing a new apparatus, encompassing two methods of utilizing pull tab instant tickets in conjunction with a optical scanner and computer display to simulate a slot machine. In the preferred embodiment of the apparatus these two methods are combined in one machine, but could be produced and marketed in separate machines. The first method of utilizing pull tab tickets the apparatus accepts payment, mechanically opens the pull tab ticket inside the vending machine, optically scans the ticket, displays the ticket results in a computer graphics display, and vends the ticket. When performing the method of utilizing pull tab tickets the apparatus passes a previously opened pull tab ticket through an optical scanner and utilizes a printing device or specialized preprinted ink to reveal the results of the pull tab ticket on the ticket in human readable characters. The ticket ejects once the optically scanned results are displayed on a computer graphics display. It is the hope that the present invention will bridge the gap between paper-based gambling methods such as pull tab tickets, and computer based video gaming devices. It is believed that the device would have the benefit of adding the excitement of an actual video game machine to the sale and distribution of instant tickets.
Denitrification of nitrate to nitrogen gas by washed cells ofRhizobium japonicum and by bacteroids fromGlycine max. Nitrate, nitrite and nitrous oxide were denitrified to N2 gas by washed cells ofRhizobium japonicum CC706 as well as by bacteroids prepared from root nodules ofGlycine max (L.) Merr. (CV. Clark 63). Radiolabelled N2 was produced from either K(15)NO3 or Na(15)NO2 by washed cells ofRh. japonicum CC705 grown with either nitrate only (5 mM) or nitrate (5 mM) plus glutamate (10 mM). Nitrogen gas was also produced from N2O. Similar results were obtained with bacteroids ofG. max. The stoichiometry for the utilization of(15)NO 3 (-) or(15)NO 2 (-) and the produciton of(15)N2 was 2:1 and for N2O utilization and N2 production it was 1:1. Some of the(15)N2 gas produced by denitrification of(15)NO 3 (-) in bacteroids was recycled via nitrogenase into cell nitrogen.
Many Firefly Music Festival goers experienced severe traffic getting into the Woodlands. Gary Camp with the Dover International Speedway offers a glimpse at numbers from this year versus Firefly’s inaugural year.
-- SET NAMES utf8mb4 COLLATE utf8mb4_bin; -- DROP PROCEDURE accountDevices_15; -- DROP PROCEDURE device_2; -- DROP PROCEDURE deviceFromTokenVerificationId_6; -- DROP PROCEDURE sessionWithDevice_15; -- DROP PROCEDURE sessions_11; -- UPDATE dbMetadata SET value = '84' WHERE name = 'schema-patch-level';
This application claims the priority of German patent document 100 16 185.5, filed Mar. 31, 2000, the disclosure of which is expressly incorporated by reference herein. The invention relates to a fuel cell system having an air supply for providing fuel to a fuel cell unit, and to a method of operating such a fuel cell system. In methanol-fuelled fuel cell driven vehicles in particular, cold starting of the system requires a relatively large amount of energy, which generally must be provided by the vehicle battery. In the cold-start phase, a large electrical output is required particularly by the electricity supply of the gas generation system for providing the hydrogen gas for the fuel cell. A fuel cell system of this type is disclosed, for example, in German patent document DE-C2 43 22 767. It is an object of the invention to provide a fuel cell system and a method of operating it, which reduces energy consumption in the event of a cold start. This and other objects and advantages are achieved by the fuel cell system and method according to the invention in which a compressor having a variable internal compression ratio is used to supply the cathode side of a fuel cell with air. This arrangement allows compressor operation to be tailored to the different requirements during cold start and normal operation, so that energy consumption is improved and annoying noise emissions can be avoided.
Kelvin probe microscopy and electronic transport measurements in reduced graphene oxide chemical sensors. Reduced graphene oxide (RGO) is an electronically hybrid material that displays remarkable chemical sensing properties. Here, we present a quantitative analysis of the chemical gating effects in RGO-based chemical sensors. The gas sensing devices are patterned in a field-effect transistor geometry, by dielectrophoretic assembly of RGO platelets between gold electrodes deposited on SiO2/Si substrates. We show that these sensors display highly selective and reversible responses to the measured analytes, as well as fast response and recovery times (tens of seconds). We use combined electronic transport/Kelvin probe microscopy measurements to quantify the amount of charge transferred to RGO due to chemical doping when the device is exposed to electron-acceptor (acetone) and electron-donor (ammonia) analytes. We demonstrate that this method allows us to obtain high-resolution maps of the surface potential and local charge distribution both before and after chemical doping, to identify local gate-susceptible areas on the RGO surface, and to directly extract the contact resistance between the RGO and the metallic electrodes. The method presented is general, suggesting that these results have important implications for building graphene and other nanomaterial-based chemical sensors.
--- layout: post title: "Man must explore, and this is exploration at its greatest" subtitle: "Problems look mighty small from 150 miles up" date: 2020-01-31 10:45:13 -0400 background: '/img/posts/06.jpg' --- <p>Never in all their history have men been able truly to conceive of the world as one: a single sphere, a globe, having the qualities of a globe, a round earth in which all the directions eventually meet, in which there is no center because every point, or none, is center — an equal earth which all men occupy as equals. The airman's earth, if free men make it, will be truly round: a globe in practice, not in theory.</p> <p>Science cuts two ways, of course; its products can be used for both good and evil. But there's no turning back from science. The early warnings about technological dangers also come from science.</p> <p>What was most significant about the lunar voyage was not that man set foot on the Moon but that they set eye on the earth.</p> <p>A Chinese tale tells of some men sent to harm a young girl who, upon seeing her beauty, become her protectors rather than her violators. That's how I felt seeing the Earth for the first time. I could not help but love and cherish her.</p> <p>For those who have seen the Earth from space, and for the hundreds and perhaps thousands more who will, the experience most certainly changes your perspective. The things that we share in our world are far more valuable than those which divide us.</p> <h2 class="section-heading">The Final Frontier</h2> <p>There can be no thought of finishing for ‘aiming for the stars.’ Both figuratively and literally, it is a task to occupy the generations. And no matter how much progress one makes, there is always the thrill of just beginning.</p> <p>There can be no thought of finishing for ‘aiming for the stars.’ Both figuratively and literally, it is a task to occupy the generations. And no matter how much progress one makes, there is always the thrill of just beginning.</p> <blockquote class="blockquote">The dreams of yesterday are the hopes of today and the reality of tomorrow. Science has not yet mastered prophecy. We predict too much for the next year and yet far too little for the next ten.</blockquote> <p>Spaceflights cannot be stopped. This is not the work of any one man or even a group of men. It is a historical process which mankind is carrying out in accordance with the natural laws of human development.</p> <h2 class="section-heading">Reaching for the Stars</h2> <p>As we got further and further away, it [the Earth] diminished in size. Finally it shrank to the size of a marble, the most beautiful you can imagine. That beautiful, warm, living object looked so fragile, so delicate, that if you touched it with a finger it would crumble and fall apart. Seeing this has to change a man.</p> <img class="img-fluid" src="https://source.unsplash.com/Mn9Fa_wQH-M/800x450" alt="Demo Image"> <span class="caption text-muted">To go places and do things that have never been done before – that’s what living is all about.</span> <p>Space, the final frontier. These are the voyages of the Starship Enterprise. Its five-year mission: to explore strange new worlds, to seek out new life and new civilizations, to boldly go where no man has gone before.</p> <p>As I stand out here in the wonders of the unknown at Hadley, I sort of realize there’s a fundamental truth to our nature, Man must explore, and this is exploration at its greatest.</p> <p>Placeholder text by <a href="http://spaceipsum.com/">Space Ipsum</a>. Photographs by <a href="https://unsplash.com/">Unsplash</a>.</p>
Saintonge War The Saintonge War was a feudal dynastic encounter that occurred in 1242 and 1243 between forces of Alphonse, Count of Poitiers, supported by Louis IX of France, and those of Hugh X of Lusignan and Raymond VII of Toulouse, backed by Henry III of England, who hoped to regain the Angevin possessions lost three decades prior. Saintonge is the region around Saintes in the centre-west of France in which most of the war occurred. The conflict arose because vassals of Louis in Poitou were displeased with the accession of his brother, Alphonse, as Count of Poitou. The French decisively defeated the English and rebel forces at the Battle of Taillebourg and concluded the struggle at the Siege of Saintes. Louis further repressed the Toulousians into surrendering. He restored Guyenne to Henry as a noble gesture and to seek for further peace so that he could go on a crusade. The battle was the last major conflict between the English and French until the Anglo-French war of 1294-1303. The war announced the end of Henry's hopes of restoring the Angevin Empire lost under King John I of England and further planted the seeds for the Second Barons' war in England, due to the waste of funds and to the growing resentment among the barons towards the king, for his tyrannical ways (by ignoring the Magna Carta) and for his incompetence in war. A feudal revolt The origin of this episode of the predecessor to the Hundred Years War, fought between France and England, was in the revolt of a Poitevin baron, Hugh X, lord of Lusignan. The source of this conflict originated from the confiscation by king Philip Augustus of lands held by king John in France, specifically in Poitiers. Although Richard Earl of Cornwall, John's second oldest son and brother to Henry III, was count of Poitiers after John's death, this was only nominal. King Louis VIII, of France, son of Philip Augustus, had instead transferred the title to his second oldest son, Alphonse de Poitiers. Alphonse was not allowed to take possession of his fiefdom until the age of 18 years, which he did in 1240. In June 1241, king Louis IX of France, son of Louis VIII, held a plenary court at Saumur in Anjou and announced that his brother, Alphonse, having come of age, was ready to come into possession of the title. On that occasion, Alphonse received the homage of the lords of the province, given even by the most powerful of them, Hugh X of Lusignan. Hugh possessed several lands in Poitou, including his family stronghold in Lusignan, the castle of Montreuil-Bonnin and, above all, the County of Marche. Lusignan had a long tradition of autonomy in the heart of Aquitaine, far from the successive capitals of the kingdoms of France and England. Therefore, the Lusignans were not receptive to Capetian authority in the region. Isabelle of Angoulême, mother to Henry and Richard, and now spouse of Hugh, was particularly frustrated that her son had not officially received the title that he had nominally held. Along with a number of other Poitevin lords, Hugh could not accept the loss of autonomy to the increasingly growing demesne of the Capetian royal family, and thus the Poitevin nobility formed a confederacy against the House of Capet. The starting point for the conflict was at Christmas time in 1241, when Hugh X of Lusignan, no doubt at the instigation of Isabelle, insulted the new Count of Poitiers in his own palace, by refusing allegiance. Raymond VII of Toulouse, Count of Toulouse, sought redress for the Treaty of Paris of 1229 (which ended the Albigensian Crusade), under the terms of which he had lost most of his lands, and thus joined the revolting barons as well, but would not participate in the fighting for a while. The Capetian reaction Immediately, the Capetian family reacted. On 5 January 1242, Count Alphonse of Poitiers called together the Poitevin nobles at Chinon for Easter. The faithful lords, and others less loyal but nonetheless enemies of Lusignan, responded to the appeal. Although his mother Blanche of Castile had coped with baronial uprisings before and carried on the royal affairs since 1226, with the title "baillistre" (protector of the heir in feudal law), Louis IX decided to go to the assistance of his brother and forcibly take control of the County of La Marche. In April 1242, Louis assembled a force at Chinon that some contemporaries estimated at around 50,000. On 9 May, he marched against the castle of Montreuil-Bonnin, the fortress of Lusignan. After having seizing a multitude of rebel castles, he steered towards Saintes. On 20 May 1242, Henry and Richard departed from Portsmouth for Royan and joined the rebelling French nobles, forming an army that may have numbered about 30,000. The two kings exchanged letters, but these resolved nothing. Henry had intentions to regain the past Angevin Empire of his predecessors on the basis that the title of Count of Poitou still belonged to his brother, Richard. This was not the first war that Henry had waged in France either as he had earlier lead an expedition to France in 1230, however, Henry was convinced that Hugh would provide the necessary support to reverse the lacklustre results of the last war. While completing his conquest of lower Poitou, he declared war on Saint Louis on 16 July. On 20 July, the French army arrived at Taillebourg where the inevitable clash took place. Battle of Taillebourg Henry advanced to Tonnay-Charente by mid-July and Louis moved to Saint-Jean-d'Angély, just north of Taillebourg, the armies intending to reach the bridge across the Charente River, located in the commune of Taillebourg. Henry and Hugh positioned their army near the village of Saint-James on the west bank of the river and camped in the neighbouring field, while Louis was welcomed to the fortified chateau of Geoffroy de Rancon, the Lord of Taillebourg. Henry decided to send an advance guard to protect the left bank of the Taillebourg bridge, a move that led to a sharp encounter with some French troops on either 21 or 22 July. Louis decided to follow up this engagement and launched a full offensive with the entire French army. The aggressive French assaults carried the day and the English king fled south to the town of Saintes, along with the revolting barons. A prolonged melee fight ensued north of Saintes, however the English were defeated in a definitive fashion. Louis lost comparatively fewer men than the English army but had to face with an epidemic of dysentery that ravaged his army. This forced Louis and his men to return to Paris by August. Siege of Saintes On 22 or 23 July the French army laid siege to the city of Saintes. Henry realized that Hugh did not have as much support as he may have earlier claimed and withdrew to Bordeaux. Shortly afterwards, the citizens handed over the keys to the city to Louis. The resolution of the revolt in France Recognizing that he was in a hopeless position after the siege of Saintes, Hugh surrendered to Louis on 24 July. The settlement of the feudal revolt was devastating for Hugh. His Poitevin castles were confiscated, rearmed, and sold by Alphonse of Poitiers. He further humiliated himself by coming to Louis crying and kneeling before him with his wife and three sons and asked for forgiveness. His daughter Isabel of Lusignan was married to his enemy Geoffrey of Rancon in 1250, who rebuilt his castle with the dowry. It is only during the retreat of the English and rebel forces that Raymond of Toulouse began his campaign against the king. He was able to capture the cities of Narbonne and Albi within August. Unfortunately for Raymond, Roger IV, Count of Foix and vassal to Raymond, stubbornly resisted his war efforts by making his own war with Raymond and submitting only to the king. This gave Louis time to organize an army and split it into two to retake the captured cities. By 30 November, the war with the king came to an end. The war with Roger would persist until January 1243 and would end in yet another defeat for Raymond. Under subjugation, Raymond was forced to give up the two cities that he took and made a promise to fight the Cathar heresy in return for a pardon from the king in Montargis. Blockade of La Rochelle In a final desperate attempt to prevent a complete takeover of his lands in Aquitaine and Gascony, Henry organized a blockade on the port city of La Rochelle by sea to distract French forces from marching further south. The blockade was largely unsuccessful as the outcome of the war had already been mostly determined. Henry looked further for new allies. In January 1243, Henry sent a letter to Frederick II, Holy Roman Emperor, to whom he had made a request for an alliance earlier, announcing the end of his hopes for retaking his possessions in France. On 12 March, Henry was forced to ask Louis for a five-year truce. France and England make peace A truce was signed at Pons on 1 August. A more lasting peace was concluded at Paris on 4 December 1259 amidst the threat of a second Baron's war in England. Initially, Henry refused to give up the rights the territory of his ancestors in France, however, Louis restored Guyenne to Henry, thinking that this noble gesture would assure him an extended time of peace with England because he was mostly concerned with going on the Seventh Crusade in 1248 and wanted to rally support for the cause within his own realm. By signing the treaty, Louis and Henry put an end to the century-old conflict between Capetians and Plantagenets concerning the lands inherited by Henry II of England conquered by Philip Augustus of France. By this text, Henry III renounced his claims concerning Normandy, Anjou, Touraine, Maine, and Poitou; in return Louis IX gave him the necessary sum to maintain 500 knights for two years, plus the revenues of the Agenais, and his domains in the dioceses of Limoges, Cahors and Périgueux. On February 10, 1259, the treaty was first ratified by Richard of Cornwall. On February 17, it was ratified in Westminster by prosecutors in the name of the king, and, by December 4, Simon V de Montfort and Eleanor of England also ratified the treaty. Finally, Henry arrived in France on December 4, 1259 to pay homage to Louis, thus symbolically ending the rivalry. Afterwards, an unexpected and lively friendship arose between the two kings to the point that, sometime later, Louis offered Henry an elephant which had been given to him by the Sultan of Egypt: He also, as Henry's feudal overlord, ratified a papal bull that annulled the Provisions of Oxford, and declared himself as a firm supporter of the Royal prerogative in England. Historical background note In English history, the ‘Hundred Years’ War’ refers to the 116-year period between 1337 – 1453. In some French accounts, that period of conflict is referred to as the ‘Second Hundred Years’ War’, the first embracing the period of upheaval following the change in the balance of power between the French and English thrones from 1159 to 1259 after Henry II of England married Eleanor of Aquitaine gaining many French territories in the process and achieving territorial superiority over the French Kingdom, until the Treaty of Paris (1259), in which the opposite became true. This period saw many conflicts and battles between the two kingdoms such as the Anglo-French War (1202–1214) or the Battle of Bouvines. Notes References Bataille de Taillebourg Bibliography Category:Wars involving France Category:Wars involving England Category:1242 in Europe Category:1243 in Europe Category:1240s in France Category:Conflicts in 1242 Category:Conflicts in 1243 Category:History of Poitou-Charentes Category:Henry III of England
Towards neuro-memory-chip: imprinting multiple memories in cultured neural networks. We show that using local chemical stimulations it is possible to imprint persisting (days) multiple memories (collective modes of neuron firing) in the activity of cultured neural networks. Microdroplets of inhibitory antagonist are injected at a location selected based on real-time analysis of the recorded activity. The neurons at the stimulated locations turn into a focus for initiating synchronized bursting events (the collective modes) each with its own specific spatiotemporal pattern of neuron firing.
Q: Is the following approach mathematically correct? (While solving questions) For example, consider this question (I know the question below is nonsense. But it isn't important here, so I will go on) : ' For any $\triangle ABC$, it is known that when a point $G$ inside $\triangle ABC$ is set to satisfy $ \overline {AB} : \overline {GA} = \overline {BC} : \overline {GC} = 3:1$, the ratio $\overline{GB} : \overline {CA}$ is constant. Then, what is the ratio? ' Then I think 'Any $\triangle ABC$ is said to satisfy the given condition. Then, whether I set $\triangle ABC$ as an equilateral one or not doesn't affect anything. So I will set $\triangle ABC$ as an equilateral triangle and go on. ' I have made many correct answers with this approach in quite a lot of tests, but it this approach mathematically correct? I think my solve doesn't lose generality because the question already states the condition is satisfied for general triangles. But if(and maybe) this approach is not correct, why? A: If it specifically tells you that the ratio is constant, then you're allowed to do this. But otherwise, you can't and you'd need to prove it for every triangle. In this case, however, you can assume that the triangle is equilateral by taking a suitable affine transformation and noting that ratios of lengths are unaffected. $G$ in the problem happens to be the centroid.
What Is The Average Settlement For A Hernia Mesh Lawsuit? There have been thousands of hernia mesh lawsuits filed. The plaintiffs and their hernia mesh lawyers allege that the medical device caused chronic pain, serious infection, a bowel obstruction, perforated the lining of the abdomen or other internal organs, and caused adhesions to develop. Several plaintiffs required revision surgery. The most common defendants named in the lawsuits are Ethicon, C.R. Bard, and Atrium. However, that is not an all-inclusive list of named defendants. Plaintiffs allege that the defendants created a defective product that caused them injury and that they do not feel that they were properly warned about the risks of using hernia mesh. Hernia Mesh Did Not Undergo Traditional FDA Testing Because there are similar products on the market that already had the approval of the FDA, hernia mesh manufacturers were not required to follow the traditional FDA testing models for approval. There have been several recalls for hernia mesh, including Ethicon’s Physiomesh. Ethicon is owned by Johnson & Johnson. Physiomesh was supposed to be a revolutionary hernia mesh using a type of plastic covered by thick synthetic film. The purpose of the film was to help stop the development of adhesions. However, while the body absorbed the film coating over weeks, the tissue that grew in the mesh would then often adhere to other organs. Hernia Mesh Lawsuits May Be Settled Like most personal injury-style cases, not all hernia mesh lawsuits go to trial. Many are settled before the trial date. Others may settle during the litigation process. Here’s a look at several of the settlement amounts over the last several years: In August of 2015, C.R. paid out another $200 million to settle another 3,000 cases. Each plaintiff who was part of the settlement received approximately $67,000. In 2016, Johnson & Johnson settled close to 42,000 lawsuits filed against them for $120 million dollars. In 2014, Boston Scientific settled two claims for $34.5 million. It was eventually discovered that the company smuggled in materials from China to make hernia mesh devices. In 2013, Endo International settled around 7,700 lawsuits for $54.4 million. In 2014, Endo International settled 20,000 lawsuits for $830 million. Endo International paid out the second settlement to 10,000 plaintiffs in the amount of $400 million. Each patient received approximately $48,000. If you do the math, you’ll see that totals almost $2 billion in settlements won by hernia mesh lawyers on behalf of their clients. Based on the information that we have on previous settlements, plaintiffs who settle receive anywhere between just under $3,000 up to $1 million. The average settlement is between $40,000 and $60,000. Determining What Your Claim May Be Worth One of the best ways to determine what your claim may be worth, you should make an appointment to talk with a hernia mesh lawyer with Goldwater Law. While you’ll learn about the factors that affect your settlement in this post, it’s important for you to understand that every hernia mesh case is different and the settlement amount you may be offered will depend on how various factors affected you. A hernia mesh lawyer cannot guarantee that your claim will be settled for a certain amount. A settlement may include money for compensation for your actual hospital and medical expenses (including future expenses), lost income, and lost future income; pain and suffering from the operation; loss of consortium; and punitive damages. Common considerations for settlement include: What sort of hernia mesh was used? This includes whether the device was recalled by the FDA or pulled from the market by the manufacturer. How badly you were injured by the device. This includes how your quality of life was hurt. How much you’ve spent on medical costs for doctors, diagnostic tests, hospital stays, medications, further surgeries, and the need for additional medical devices. The severity that your life was affected by your injuries. This includes how your daily life is affected and whether you’re able to work. Whether you’ve lost wages or will not be able to work in the future. Free Case Review If you believe you may have a claim, schedule a free case review with the hernia mesh lawyers at Goldwater Law. You’ll learn whether you have a valid hernia mesh claim. If you do, we’ll help you understand your legal options.
1. Field of the Invention The present invention relates to meat tenderizers and more particularly pertains to a new adjustable meat tenderizer for tenderizing pieces of meat of varying thickness. 2. Description of the Prior Art The use of meat tenderizers is known in the prior art. More specifically, meat tenderizers heretofore devised and utilized are known to consist basically of familiar, expected and obvious structural configurations, notwithstanding the myriad of designs encompassed by the crowded prior art which have been developed for the fulfillment of countless objectives and requirements. Known prior art meat tenderizers include U. S. Pat. No. 5,340,354; U.S. Pat. No. 5,085,482; U.S. Pat. No. 116,166; U.S. Pat. No. 4,672,716; U.S. Pat. No. 3,230,578; and Foreign Patents EP 0 451 025 A1 and WO 94/18842. In these respects, the adjustable meat tenderizer according to the present invention substantially departs from the conventional concepts and designs of the prior art, and in so doing provides an apparatus primarily developed for the purpose of tenderizing pieces of meat of varying thickness.
Taonga pūoro Taonga pūoro are the traditional musical instruments of the Māori people of New Zealand. The instruments previously fulfilled many functions within Māori society including a call to arms, dawning of the new day, communications with the gods and the planting of crops. They are significant in sacred ritual and also fulfill a story-telling role. Many of the sounds of the instruments and tunes are imitations of the sounds of nature, including the wind, the seas and the natural world of birds and insects. Knowledge of taonga pūoro has been revived over the past thirty years by Hirini Melbourne, Richard Nunns and Brian Flintoff. Cultural placement Classifications Taonga pūoro and their uses and classifications are intimately connected with Māori culture and religious practice. The instruments are all part of the families of the gods, and their classifications are directly related to the gods and the creation story where "The Gods sang the Universe into Existence". The universal building blocks of music, melody (Rangi) and rhythm (Papa) are named for the Sky Father and Earth Mother (Ranginui and Papatuanuku, or Rangi and Papa) from the Māori creation story. Further classifications are derived from their children. The god of the winds is Tawhiri, and from him come the wind instruments. The shell instruments are from Tangaroa, god of the sea, and Tane and his daughters Hine Pu te Hue and Hine Raukatauri govern the other instruments derived from forest and earth materials. Today, sometimes substitute materials are used in the making of the instruments and several instruments fall into more than one family being a combination of materials. Traditional usage The use of these instruments, as part of the toolkit of the tohunga (Maori priests), seemed to be exclusively used as an oral flux between Ira Tangata (man) to Ira Atua (the Divine/Gods) or the temporal and the spiritual, which is why Māori regarded them with awe and respect; they were regarded as tapu (sacred/taboo) items of use from the tohunga. When used for entertainment and for recreation, it was a hidden and private practice. Many of these musical traditions had been lost over time because of spiritual reservations Māori people held towards the instruments, but sensitive researchers and enthusiasts such as Richard Nunns, Hirini Melbourne and Brian Flintoff have done considerable restorative work and provided a wealth of knowledge and information around the sounds, history and stories of these taonga (treasures). Today, taonga pūoro are used more frequently at Māori ceremonies and by New Zealand composers. Instruments Wind instruments Flutes Kōauau The kōauau is a small, ductless and notchless flute, long, open at both ends and having from three to six fingerholes placed along the pipe. Kōauau resemble flutes the world over in tone quality and in the range of sounds that can be produced by directing the breath across the sharp edge of the upper aperture. Māori kōauau players were renowned for the power it gave them over the affections of women (notably illustrated by the story of Tūtānekai, who, by playing his kōauau to cause Hinemoa to swim to him across Lake Rotorua). Kōauau are made of wood or bone. Formerly the bone was of bird bone such as albatross or moa; some instruments were also of human bone and were associated with chiefly status and with the traditional practice of utu. Demonstration of the koauau Nguru The nguru is a small vessel flute in the Helmholtz oscillator class, like an ocarina or xun. It is made of wood, soapstone or bone and shaped like a whale's tooth. Sometimes it is made from a whale's tooth. It is from in length, wide at the blowing end and tapering to the lower where it is slightly turned up. It has two or three fingerholes and an extra hole bored on the underside, near the curved end, through which a cord could be passed so that it could hang round the owner's neck. It is played in the same way as a kōauau and produces a similar pure flute-like sound. The nguru is sometimes classified as a nose flute perhaps because the word nguru means to sigh, moan, or snore. This is unlikely because the large end is too wide for a nostril and, if the curved end were placed in that same position, the flute would lie at an impossible angle for the player to reach the fingerholes. Demonstration of melody on Nguru, following, the Pūrerehua Rehu A long flute with a closed top and a transverse blowing hole and finger holes like a pōrutu. Pūmotomoto A long flute with a notched open top which is the blowing edge and a single finger hole near the end - the instrument was chanted through and was traditionally played over the fontanelle of an infant to implant songs and tribal information into the child's subconscious. Pūtōrino The pūtōrino is known for its wide range of voices including a male voice (trumpet) and a female voice (flute). The pūtōrino varies in length from and has an uneven bore, swelling out to the centre and diminishing evenly towards the lower end, where the pipe is narrow, and has either a very small opening or none at all. The outer shape is carved from a solid piece of wood, split in half lengthwise, hollowed out like two small waka and then lashed together again with flax cord or similar substitute for binding. At the widest part of the pipe there is an opening shaped like a grotesque mouth. The finest specimens are decorated at both ends with carved figures, and the open mouth is part of a head which is outlined on the flat surface of the pipe. It can be played with bugle technique, with closed lips which are set in vibration by the rapid withdrawal of the tongue. Small variations of pitch can be produced by moving the forefinger over the centre opening. Demonstration of Pūtōrino Pōrutu The pōrutu is a long version of the kōauau, usually measuring from long. The playing quality differs depending on the material it is made from. New Zealand native hardwoods such as mānuka, mataī, or black maire are suitable for a clean resonating effects. Like the pūtorino, it has 2 voices, the male (trumpet) and female (flute). The female voice can produce up to five harmonics depending on the bore. Trumpets Pūkaea The Pūkaea is a traditional Maori trumpet made of wood. There are several differing designs and lengths within the Pūkaea genre. Pūkaea were used to announce relay signals at times of conflict and were also used to announce the rituals associated with the planting of kumara (sweet potato) and other crops. The function of this instrument is to herald spiritual pathways. As a war trumpet they were used in announcing an oncoming war-party and were dedicated to Tumatauenga (god of war). In the announcement of harvest they were dedicated to Rongomatane (God of agriculture, arts and peace). Today they can be heard heralding the visitors onto the marae or at the opening and closing of important ceremonies. Pūtātara The pūtātara is a traditional Maori conch shell trumpet, which had a variety of roles from signaling to ceremonial and ritual use. Demonstration of the Pūtātara Percussion instruments Pahū Pounamu This Maori musical instrument is made of wood and a jade / greenstone gong and was used in the whare purakau (house of learning). Part of it is made of the jaw bone of the upokohue (pilot whale) and the striker is made from akeake, a native hardwood. Whirled instruments Pūrerehua The Pūrerehua can be made of bone, wood or stone, they are blade-like and swing on a long cord producing a loud, deep whirling that can be heard from a distance. A rapid spinning motion will start the music of the Purerehua'a song as it rotates and flutters. Uses vary from luring lizards, summoning rain, communicating and attracting a soul mate. Demonstration of the Pūrerehua Poi awhiowhio This Maori musical instrument was used as a bird lure. It was made by hollowing a gourd, drilling holes on either side and attaching a cord by which it could be swung around the head creating a whistling, chattering voice that attracted birds. Modern usage Taonga pūoro are currently used for their traditional purposes, but also in many genres of music from classical, orchestral, chamber music, through to pop, alternative and in film music. They were used in the musical sound tracks of films such as Once Were Warriors and Whale Rider, and are becoming more widely used in television and film music to produce authentic natural sounds rather than artificially generated sounds. New Zealand composers such as Gillian Whitehead and Martin Lodge have used taonga pūoro extensively in the genre of art music combining the traditional Maori instruments with western instruments. These composers were noted for this work in March 2013 by UK publication, Gramophone. In 2010, British film and orchestral composer, Paul Lewis collaborated with master taonga pūoro composer and performer, Horomona Horo, to produce, Legends of Rotorua, a fifty-minute composition for a wide variety of taonga pūoro, string quartet, harp, flute, storyteller and soprano. Horomona Horo, the protege of the late Dr Hirini Melbourne and Richard Nunns, was the winner of the inaugural Dynasty Heritage Concerto Competition in 2001, using an array of taonga pūoro. He has collaborated with numerous artists such as Moana and the Moahunters (later Moana and the Tribe), the New Zealand String Quartet, Canto Maori, and Irish group, Green Fire Islands, incorporating taonga pūoro into hip-hop, chamber music, pop, and opera. Salmonella Dub, Tiki Taane and Fat Freddy's Drop have all used taonga pūoro on their albums. The University of Waikato Conservatorium of Music has established a programme to study the instruments in a formal academic capacity under composer and director of The New Zealand Music Research Group, Martin Lodge. Richard Nunns was granted an honorary doctorate by the university in recognition of his contribution to New Zealand Music and the revival of taonga pūoro. He is also a research associate at the University of Waikato. References External links Taonga Puoro Instruments and demonstrations of their sounds Museum of New Zealand: Te Papa Tongarewa Video of Te Hekenga-a-Rangi (Excerpt 1). YouTube Video of Te Hekenga-a-Rangi (Excerpt 2). YouTube Song with images of the pūtōrino. YouTube Video about traditional Pūoro part of the Cook Forster collection with Richard Nunns. YouTube Category:Māori musical instruments Category:New Zealand music Category:Sacred musical instruments
Q: List of lattice points inside $d$-dimensional sphere I have a series of functions $f_d$ in $d$ variables and would like compute the sum of each one evaluated at each lattice point within the $d$-sphere of radius $R$; that is, at each point $(x_1,x_2 \dots x_d) \in \mathbb{Z}^d:\sqrt{x_1^2+x_2^2 \dots +x_d^2} \leq R$. I have no problem evaluating the functions $f_d$ at these points; I think the best way would be to use Part within Sum on the list of lattice points. What I am unsure of is how to generate $P_R$, the list of lattice points not outside the $d$-sphere of radius $R$. A: Method 1: select after building the grid The cubic lattice with side size $2r$ in $d$-dimensions symmetric wrt origin can be defined as: latt[r_,d_]:=Tuples[Range[-r,r],d] Then your points are selected as: pts[r_,d_]:=Select[latt[r,d],Norm[#]<=r&] Example for 3-sphere: Graphics3D[{Point[pts[10,3]],{Opacity[.2],Sphere[{0,0,0},10]}}] Method 2: filter during building the grid Another way of doing this is to check points not after grid is build, but during the process: sphrPTS[r_,d_]:= Flatten[Array[If[Norm[{##}]<=r,{##},Nothing]&,1+2Table[r,d],-r],d-1] To test let's see now $2$-sphere: Graphics[Point[sphrPTS[30, 2]]]
# # LDIF Novell eDirectory schema to load dynamic clients from LDAP # # copyright 2013 Olivier Beytrison <olivier@heliosnet.org> # # 1.3.6.1.4.1.11344.4.1.1 is the toplevel OID for this work # .1 = objectclasses # .2 = attributs dn: cn=schema changetype: modify add: attributetypes attributetypes: ( 1.3.6.1.4.1.11344.4.1.1.2.1 NAME 'radiusClientIdentifier' DESC 'Client Identifier' EQUALITY caseIgnoreMatch SUBSTR caseIgnoreSubstringsMatch SYNTAX '1.3.6.1.4.1.1466.115.121.1.15' SINGLE-VALUE ) attributetypes: ( 1.3.6.1.4.1.11344.4.1.1.2.2 NAME 'radiusClientSecret' DESC 'Client Secret' EQUALITY caseIgnoreMatch SUBSTR caseIgnoreSubstringsMatch SYNTAX '1.3.6.1.4.1.1466.115.121.1.15' SINGLE-VALUE ) attributetypes: ( 1.3.6.1.4.1.11344.4.1.1.2.3 NAME 'radiusClientShortname' DESC 'Client Shortname' EQUALITY caseIgnoreMatch SUBSTR caseIgnoreSubstringsMatch SYNTAX '1.3.6.1.4.1.1466.115.121.1.15' SINGLE-VALUE ) attributetypes: ( 1.3.6.1.4.1.11344.4.1.1.2.4 NAME 'radiusClientVirtualServer' DESC 'VirtualServer' EQUALITY caseIgnoreMatch SUBSTR caseIgnoreSubstringsMatch SYNTAX '1.3.6.1.4.1.1466.115.121.1.15' SINGLE-VALUE ) attributetypes: ( 1.3.6.1.4.1.11344.4.1.1.2.5 NAME 'radiusClientType' DESC 'Client Type' EQUALITY caseIgnoreMatch SUBSTR caseIgnoreSubstringsMatch SYNTAX '1.3.6.1.4.1.1466.115.121.1.15' SINGLE-VALUE ) attributetypes: ( 1.3.6.1.4.1.11344.4.1.1.2.6 NAME 'radiusClientRequireMa' DESC 'Require Message Authenticator' EQUALITY booleanMatch SYNTAX '1.3.6.1.4.1.1466.115.121.1.7' SINGLE-VALUE ) attributetypes: ( 1.3.6.1.4.1.11344.4.1.1.2.7 NAME 'radiusClientComment' DESC 'Client comment' EQUALITY caseIgnoreMatch SYNTAX '1.3.6.1.4.1.1466.115.121.1.15' SINGLE-VALUE ) dn: cn=schema changetype: modify add: objectclasses objectclasses: ( 1.3.6.1.4.1.11344.4.1.1.1.1 NAME 'radiusClient' DESC 'radiusClient object class' SUP top STRUCTURAL MUST ( radiusClientIdentifier $ radiusClientSecret ) MAY ( radiusClientShortname $ radiusClientVirtualServer $ radiusClientType $ radiusClientRequireMa $radiusClientcomment ))
I recently finished a MASSIVE collection room reorganization and wanted to share it with other collectors on the web. And, most importantly, to get some feedback on what you guys think. So, please, do comment! Admittedly I'm not entirely familiar with Marvel's present comic continuity; I don't read comics (aside from a few of the more recent major events, of course). Which is why I decided to display in a more simplified manner (Avengers with Avengers, Hulk with Hulk, Spidey with Spidey, etc.). Any help with regards to proper figure placement would be cool... It's taken me roughly a year to situate everything in its current arrangement. I've did my best to arrange things so as to keep all the figures as visible as possible. With all that being said, lets get down to it! Here's a few quick overview shots of the room: Dragon Ball: The Dragon Balls are solid crystal and are actually quite heavy (comparable in weight of a pool ball). The stars are actually engraved on the inside. The cool thing are those little grey bases; they have orange LED's installed in the the center of them. When the lights are off and the bases are switched on, they illumate in the familar orange Dragon Ball glow: DB figures: Transformers: Superhero Showdown Vs. Fin Fang Foom: I plan to supplement the SHS with some of the new Marvel Universe 3 3/4 inchers. That is, if I ever find them. Hey, thanks fellas. Your comments are much appreciated. You know, It's nice being able to share this crazy hobby with others who can appreciate it. Thanks. And Bunger43, believe it or not but I managed to secure the majority of those Sentinel's through various trades; only purchasing 3 or 4 of them myself. Actually, I'd say atleast 50% of my collection (save for DCU/DCSH stuff) is the result of trades. I did, however, liquidate a vintage transformers collection as well as a large Dragon Ball Z Manga/DVD collection to finance chunks of my present collection, too. But, yea, I've burned holes in my wallet in the pursuit of this hobby; the wifey gets on my case sometimes about it, too. Not only is that an impressive collection but it's really well organized and displayed. Great pieces in there but I"m more jealous of the space that you have to display them in. I'd say at only one point maybe 2% of my collection is actually on display. Your collection is unreal. One of the best I've ever seen, for sure. I really like the way you have everything organized, from the groupings to the shelving units themselves. Also, love that Marvel Legends mural. I hope to one day have my collection displayed in a similar fashion. Your collection is unreal. One of the best I've ever seen, for sure. I really like the way you have everything organized, from the groupings to the shelving units themselves. Also, love that Marvel Legends mural. I hope to one day have my collection displayed in a similar fashion. Thanks for the feedback, DK. It's kinda cool knowng other collectors dig my set-up. My little sis was kind enough to hook me up with both of those murals. They did wonders to those bland, boring white walls. I love em... Great Collection!! I have 2 inquiries, Who are (the figure to the right of Capt. America & also to the right of Spiderwoman) and were they ever at retail? My bad, 20silence. I completely missed this post. Those are actually both customs. The first being Modern Luke Cage. He was frankensteined/customized entirely from scratch. He's the result of a bunch of different figures; I'm not entirely sure of the recipe. I never cared for Toybiz's classic, yellow costumed first appearance Luke Cage and opted for a Modern look instead: The other figure of interest is Patriot of the Young Avengers. He was one of four figures included with the Marvel Legends Young Avengers box set that came out several years back: He under went a head swap (Marvel Legend Professor Xavier head, alittle paint, and scuplted mask) to better capture his modern appearance. The rest of you guys, You sure know how to make a dude blush! smiles Thanks for all the feedback and comments. Got a question, shoot! I'll answer it best I can.
CHURCH LEADERS CALL FOR A SPIRIT OF HOPE AND CONTINUED PEACE-BUILDING IN NORTHERN IRELAND WHEN TALKS RESUME A statement from Irish Church leaders: Archbishop Richard Clarke (Church of Ireland); Archbishop Eamon Martin (Catholic Church); the Revd Bill Mullally (President of the Methodist Church in Ireland) and the Very Revd Dr Frank Sellar (former Moderator of the Presbyterian Church in Ireland), who have attended centenary commemorations for the Battle of Messines today (7th June): ‘First World War commemorations took place in Belgium today when representatives from the Irish Churches were among those present who marked the tragedy and futility of war and the searing pain and loss which Irish people from all walks of life encountered one hundred years ago at the Battle of Messines. The battle was the first time that soldiers from both traditions in Ireland, unionist and nationalist, fought side-by-side during the conflict. ‘At this time, in 2017, when talks among the political parties in Northern Ireland have been postponed until after the UK General Election tomorrow, it seems like an appropriate moment to draw on the words of the Peace Pledge at the Island of Ireland Peace Park at Messines. It states: “…We appeal to all people in Ireland to help build a peaceful and tolerant society. Let us remember the solidarity and trust that developed between Protestant and Catholic soldiers when they served together in these trenches … we affirm that a fitting tribute to the principles for which men and women from the Island of Ireland died in both World Wars would be permanent peace.” ‘It is our hope and prayer that the elected representatives of the people of Northern Ireland will all do their utmost to build bridges, overcome differences and find constructive ways forward to build on the peace which has been established at home and to continue through the devolved Assembly to provide leadership for the good of all the people of Northern Ireland, irrespective of political or religious background, in the days, months and years ahead.’
Q: MaxConnectionsPerHost vs MaxRequestsPerConnection Cassandra driver I'm working with huge query set for C. I already throttle async query executor with Semaphore maxInFlight = new Semaphore(MAX_REQUEST_PER_CON_REMOTE); ... maxInFlight.acquireUninterruptibly(); ResultSetFuture future = executeAsync(...); Futures.addCallback(future, new FutureCallback<ResultSet>() { @Override public void onSuccess(ResultSet rs) { ... maxInFlight.release(); } @Override public void onFailure(Throwable t) { ... maxInFlight.release(); }, executor); where MAX_REQUEST_PER_CON_REMOTE is MaxRequestsPerConnection parameter. MaxConnectionsPerHos equals 1 by default and I didn't change it. With increasing the number of nodes or increasing replication factor, i believe, that I could increase MaxConnectionsPerHos or MaxRequestsPerConnection to increase productivity. Is there any advantages increasing one or another? Also then I want change dependency of Semaphore permits, but don't actually know how. The idea is to add listener and updating maxInFlight when Host was added or deleted. A: If you're not using Whitelist or Blacklist policy, then driver will connect to the every host separately (depending of course on configuration, if you're using DC Aware policy). So when you add the new node, then driver will add a new connection to that node, and load will be redistributed (if your queries don't have "hot" partitions). If you increase replication factor, then it also doesn't matter much, because sending requests to replicas will be done not by driver, but by the "coordinator" node... So when you have N nodes in local DC, then you theoretically can send up to the N MaxInFlighConnections requests (but this depends on the distribution of data in your requests). Also, I see that you're using MAX_REQUEST_PER_CON_REMOTE - it's better to send requests only to nodes to local DC. Also you can configure up to 32k requests per connection, and in the most cases this is more than enough for one client doing the requests. You can find more information in Driver's documentation. P.S. I have a separate class that uses the same approach with Semaphore, but adds listener automatically - feel free to grab it.
Papillary muscles contribute significantly more to left ventricular work in dilated hearts. Left ventricular (LV) dilatation results in increased sphericity and affects position and orientation of papillary muscles (PMs), which may influence their performed work. The aim of this study was to assess the contribution of PM to LV function and its changes with dilatation. Fifteen sheep were investigated. Ten animals were subjected to 8 weeks of rapid (180 bpm) pacing, inducing LV dilatation. Five animals served as controls. High-resolution gated computed tomography was performed to assess LV volumes, left ventricular ejection fraction (LVEF), global longitudinal strain (GLS), sphericity index, and PM angle, width and fractional shortening. 18F-fluorodeoxyglucose positron emission tomography (PET) was used to measure glucose metabolism as surrogate of regional myocardial work. Spatial resolution of PET images was maximized by electrocardiogram- and respiratory-gating. 18F-fluorodeoxyglucose uptake was measured in PM and compared with remaining left ventricular myocardium (MYO) to obtain a PM/MYO ratio. Animals with dilated heart had a more spherical left ventricle, with reduced LVEF (P < 0.0001) and GLS (P < 0.0001). In dilated hearts, PET analysis revealed a higher contribution of both PM to LV myocardial work (P < 0.0001); and PM angle towards LV wall correlated with PM work, together with PM width and the LV sphericity index. Sphericity index and posterior PM angle were strongest determinants of posterior PM/MYO ratio (R2 = 0.754; P < 0.0001), while anterior PM/MYO was mostly determined by sphericity index and the PM width (R2 = 0.805; P < 0.0001). In dilated hearts, PM contribute relatively more to LV myocardial work. We hypothesize that this is caused by the more cross-sectional orientation of the subvalvular apparatus, which leads to a higher stress on the PM compared with the spherical LV walls. The reduced cross-sectional area of the PM may further explain their increased stress.
Coach Legacy Logo Signature Medium Coffee Crossbody BagsDZT Details Crafted in our iconic signature jacquard and beautifully trimmed with rich, glove-tanned leather, the new is a scaled-down version of our modern bag with a hands-free crossbody strap for added versatility.
[Study on effect of Astragalus membranaceus injection on hematopoiesis in anemic mice with myelosuppression]. To investigate the effect of AMI on hematopoiesis in anemic mice and explore the possible mechanisms. Anemic mice model resulted from myelosuppression by irradiation and cytotoxic chemotherapeutic compounds were randomly divided into three groups: treated group I, treated group II and anemic control group. Intraperitoneal doses of AMI(500 mg/kg, 1000 mg/kg) were given to the treated group, and equal doses of physiological saline were given to the anemic control group. On 7 days after treatment, the count of whole blood cells and bone marrow cells were determined by blood auto-analyzer. The numbers of CFU-GM (granulocyte and macrophage colony forming unit), CFU-E (colony forming unit-erythroid), BFU-E (burst forming unit-erythroid), CFU-Meg(colony forming unit-megakaryocyte) were determined by using technique of hematopoietic progenitor cells culture in vitro. Expression of anti-apoptosis protein BcL-XL and BcL-2 in BMC were determined by immunohistochemistry. RBC, HB, PLT (P < 0.05) and BMC (P < 0.01) in treated group I were significantly higher than that of anemic control. The number of CFU-E, BFU-E and CFU-Meg as well as expression of anti-apoptosis protein BcL-XL of BMC in treated group I also were significantly higher than that of anemic control (P <0. 05 or P <0. 01), while numbers of CFU-E as well as expression of anti-apoptosis protenin BcL-XL of BMC in treated group II were higher than that of anemic control (P < 0.05). AMI can lesson apoptosis of bone marrow cells and promote hematopoietic progenitor cells to differentiate along the erythroid and megakaryocytoid line by up-regulating expression of antiapoptosis protein BcL-XL of BMC.
There are lots of beautiful things around us. It's just a matter of how we see it and whether we're able to realize it. In life, of course there are always some ups and downs. However, I believe, that even in the most difficult situation, there's always a beautiful thing.. As wise people say, "Everything happens for a reason". Enjoy your Life today because yesterday had gone and today may never come. remember that what you believe will depend very much on what you are..... Tuesday, March 25, 2014 Dear Readers, Oops I want to send some adore out there today to all of you. Today I want to share a receptive subject. And it has been brought up due to some very loving readers who I am definite have my best concern in mind.Since I started the blog, there have been some readers writing in comments or emails about my twin nature. All right, dear ones I too focus this theme today. Perpetually I have wondered how these two actually strong, actually contrasting, personalities I have live together in my one body. I am totally in one way, someone who gets lost in movies and music and Internet, who needs to be making something to be relaxed. I am an introvert who never wants to leave my house or close up my story. Big but: I am also super radical idealist. i love Politics, Philosophy, rational dispute with real people, methodological writing and research papers, studying, and yes, obsessively clean-up and organizing. I desire, and have tried, to be satisfied with only using one side of me. For a short time, my job was to stay at home and knit and take pictures and write from my heart and do Painting and face booking. I loved it! I hated it! To satisfy my other individuality, I am not doing anything at this time. I love it! I hate it! To be honest I miss my previous life. I have been getting sincerely worried that I’m just a person for whom the grass is never green enough. And based on my experiences in life right now, I have been concerned that my Future life will be shady. Last week I had a soothing epiphany. As we were discussing political Lines based on sociological theories in a colloquium, I realized, this effort requires incredible imagination. however to suggest solutions for social problems, to intelligently and non-divisively defend positions that are not popular, to research and write about the human experience, to discover the right remedy to heal an injured soul, to work on minimizing social program vanity and maximizing human efficiency... these activities all require serious innovative juice. So ya, right now is weird without stability. But someday, when twenty page papers aren't due incessantly, it will be so dissimilar. I will go off to collective work imaginatively and sociably for some hours each day. Then I will come home and, and craft innovatively and live as an introvert for some hours each day. I just need to make it through this out of balance rough patch. Then I’ll reap the rewards of my hard work and will be one unified person. Happy in the green, green grass. Can you relate? I guess the trick is to hub on the quickness of each trying phase of our lives and look for the great in it... the parts that may never come again and actually teach us what we're made of. What’s that saying? The grass is greener where you water it. As of now and I’ve been on a roller coaster of sentiments, but I’m settling down now. I love the windows wide open, curtains blowing, and all around me .this is all for today With Love Sincerely Yours SJ Dr Sindhu Joy Social Activist/TV Anchor/Columnist/Blogger/PhD Holder/Reality Show 1st Runner-Up/Former National Vice President & State President of SFI/Contested to Parliament & Assembly Elections(Born to Late George Joseph Chakkungal (Joy) - Proprietor of Royal Builders and Late Mrs.Laila Joseph Veeramana) Total Pageviews Followers About My Blog Hi there,Welcome.I am Dr.Sindhu Joy.this blog is about my life and I believe that Life; a mixture of obsession, memories & Understanding....Some hold it with thoughts..Some with appreciation..Some with delight and togetherness..Some in lonesomeness...I lay down those tiny odds and ends from life in lines of rhythm, & of assonance...This platform of thoughts is a means of expression, of estimation & of insight... my blog, stow all my valuable moments of life, spill out it with the imagination that boils within me......

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.