text stringlengths 12 4.76M | timestamp stringlengths 26 26 | url stringlengths 32 32 |
|---|---|---|
Thursday, March 26, 2015
Culture in Conflict: Where can ISIS get $1 Million?
With the rise of the Islamic State in Iraq and Syria (ISIS), the world rightfully asked how a militant faction too extreme for Al-Qaeda transformed itself into “the world’s richest terror group ever.” ISIS boasts an annual budget worth $2 billion and a war chest of $250 million, which if true surpasses the Taliban’s (and that of many states). Still more troubling, it is now financially self sufficient, and no longer dependent on foreign donors.
How? Like organized criminal enterprises before it: extortion, ransom, robbery, and smuggling. It perhaps comes as no shock that it has been trafficking arms, drugs, and even oil. However, the public reacted with surprise to reports in June 2014 that ISIS jihadists had earned “millions” by looting the region’s archaeological sites, and then selling its ancient treasures to the highest bidder.
It shouldn’t have. Archaeologists, criminologists, law enforcement agents, and military officials have long warned that the illicit antiquities trade is funding crime and conflict around the world. However, under ISIS’ black flag, this looting and trafficking is not just a side enterprise, but a massive illegal industry.
The United Nations recently confirmed the connection between cultural racketeering and terrorist financing. On February 12, 2015, in a binding and unanimous resolution, the Security Council recognized that ISIS, the Al-Nusrah Front, and other groups associated with Al-Qaida are indeed funding themselves through “the looting and smuggling of cultural heritage items from archaeological sites, museums, libraries, archives, and other sites.” These earnings are “being used to support their recruitment efforts and strengthen their operational capability to organize and carry out terrorist attacks.” Resolution 2199 put this cultural racketeering on par with profits raised from oil and ransoms, and further ordered all Member States to “take appropriate steps to prevent” the illicit trade immediately.
That same week, the Wall Street Journal reported that looters were hawking Bronze Age busts from ISIS-controlled territory for $30,000 USD, a price since confirmed to us by archaeologists monitoring the black market for such artifacts. Then the very next week, an undercover investigation by the BBC warned that a single masterpiece from war-torn Iraq or Syria could fetch a whopping $1 million on the international market. That figure came out of extensive interviews with proclaimed smugglers, “go-betweens,” and dealers involved in the blood antiquities trade.
No one knows just how much money ISIS is making on antiquities looting and trafficking — except, perhaps, ISIS — but even the most conservative estimates have grave implications for security in the region. And thus around the world. Current weapons costs for Iraq and Syria, as provided by the Terror Asymmetrics Project (TAPSTRI), demonstrate that $1 million would fund either 11,667 AK-47s with 2.5 million bullets or 1,250 rocket launchers with 5,000 mortars.
Put another way, if ISIS were to reap the profits from just one of the sales reported by the BBC, it could literally arm an army. With these numbers, it is no wonder the United Nations has prioritized cutting off this critical source of terrorist financing, as should we all. The stakes are high. If we fail, the sites and objects that tell the very story of civilization may well be converted into weapons and troops, which seize cities, slaughter soldiers, and behead civilians.
About The Antiquities Coalition
The Antiquities Coalition unites professionals from a diverse background joined in the fight against cultural racketeering – a global problem.
A diverse group of archaeologists, technology experts, writers and scholars came together around our common interest in protecting cultural heritage. The International Coalition to Protect Egyptian Antiquities (ICPEA) – an initiative of the Antiquities Coalition – was launched. Invited by the Egyptian government to discuss ways to best support them, the ICPEA and the Egyptian Ministry of Antiquities developed a public private partnership. The Partnership covers three main categories – training, education, and social entrepreneurship.
Our mission is to safeguard global heritage while inspiring people to appreciate our shared culture and empower local communities to steward and protect it. | 2024-04-25T01:26:29.851802 | https://example.com/article/3530 |
Single intramural leiomyoma with normal hysteroscopic findings does not affect ICSI-embryo transfer outcome.
Where there is no distortion of the endo-myometrial junction, the effect of an intramural leiomyoma on reproductive performance is controversial. The current study compared the performance of patients having a single leiomyoma and intact endometrium confirmed by hysteroscopy (study group) with that of controls having intact endometrium alone in intracytoplasmic sperm injection (ICSI) cycles. A total of 61 consecutive infertile patients were retrospectively enrolled into the study group from a computerized IVF database. The control group consisted of 444 age-matched patients undergoing ICSI-embryo transfer without any endocervical or intrauterine pathology confirmed by both transvaginal ultrasonography and office hysteroscopy. The baseline characteristics, performance of ovarian stimulation and embryological data were similar between the two groups. The clinical pregnancy per embryo transfer (36 versus 38%) and implantation rate (20 versus 19%) were also comparable. Although the miscarriage rate tended to be higher in the leiomyoma group (27 versus 19%), the difference did not reach statistical significance. In conclusion, in the presence of intact endometrium, a single intramural leiomyoma does not seem to have a deleterious effect on ICSI cycles. Before ICSI is attempted, hysteroscopy may be useful for ruling out distortion of the endometrium due to leiomyoma in selected cases. | 2024-04-02T01:26:29.851802 | https://example.com/article/1237 |
Gallo's departure from East Haven Police Department seen as a 'good first step' (with video, Maturo, Einhorn statements)
A sign looking for the resignation of Republican East Haven Mayor Joseph Maturo Jr. sits at the corner of Kimberly Avenue and Forbes Place in East Haven. The sign is on property owned by former Town Attorney Patricia Cofrancesco, who served with Maturo's predecessor, Democrat April Capone.
Arnold Gold/Register
The East Haven Police Department held a public open house in December 2011. Police Chief Leonard Gallo, left, stopped to chat briefly with Mayor Joseph Maturo Jr.
Mara Lavitt/Register
EAST HAVEN -- Though not everyone's on the same page regarding Police Chief Leonard Gallo's announced retirement, many interviewed Monday agree the decision is necessary to take the Police Department in a new direction.
Gallo officially indicated his intent to retire from the Police Department Monday in the face of a federal criminal investigation that last week resulted in the arrests of four police officers, Mayor Joseph Maturo Jr. said.
His last day on the job will be Friday.
Maturo told a Town Hall press conference packed with local, regional and national media that the decision, which Gallo informed him of on Friday, was "a selfless act designed to assist in the healing process" with the Latino community, some of whom police are accused of mistreating.
Advertisement
Gallo's retirement provides "an opportunity for the town to move forward with the healing that is necessary given recent events, and most importantly an opportunity for the entire East Haven community to move forward as a unified group to embrace the changes that will follow," Maturo said.
He said the search for a new chief "will begin immediately," and that Deputy Chief John Mannion will serve as chief until a new one is chosen.
"The new chief must possess the ability to effectively restructure the department; implement suggested reforms; and reach out to and work closely with members of all segments of the East Haven community to build trust between the community and the department," Maturo said.
He offered kind parting words for Gallo.
"Chief Gallo has always been an unwavering supporter of the town of East Haven," Maturo said. "He has been a devoted public servant and performed admirably in both his personal and professional life.
Dixon Jimenez, an Ecuadorean-American who lives in New Haven, said it was a good start. Jimenez is friends with some of the people who have had problems with East Haven police and works with Junta For Progressive Action.
Latrina Kelly, interim executive director of Junta, also called it "a good first step." The Junta is an affiliate of Reform Immigration for America, the organization that sent hundreds of tacos to East Haven Friday to protest Maturo's "taco" remark and has since collected 15,000 signatures calling on Gallo to resign.
Now, "we need a more diverse police department, and we need the mayor ... to step forward and to say that he's opening a dialogue with the entire community," Kelly said.
Gallo's lawyer, Jonathan J. Einhorn, said it was a tough decision for Gallo, who was not at the press conference because it was too emotional for him.
"Chief Gallo has served in law enforcement for 42 years and as chief in East Haven for 14 years," Einhorn said. "He is retiring from this position for one reason alone: that is his desire not to be a distracting element in East Haven's efforts to rehabilitate its image both upon its citizens and the general public.
"As you know, there is a civil lawsuit pending against him in United States District Court, and the potential for criminal charges by the United States Justice Department in a case now pending against four officers, in which he is named as a co-conspirator," Einhorn said.
"Chief Gallo will be vindicated in the civil case against him, and should he be charged in the federal criminal case, we will successfully defend against any such charges," Einhorn said. "He is not guilty of any wrongdoing in either the civil action or potentially in any criminal action."
Two outgoing members of the Board of Police Commissioners, Chairman Fred Brow and member James Krebs -- both appointees of Democratic former Mayor April Capone -- attended the press conference and said Gallo should not be allowed to retire, and should be fired instead.
Brow arrived at Town Hall a few minutes before 9 a.m. and filed a meeting notice for a special meeting tonight -- Brow's last day before his term ends -- to consider three resolutions.
One will recommend that Maturo terminate Gallo, and one will recommend that Maturo disband the new Law Enforcement Advisory Resource Network committee, or LEARN, Brow said.
The third resolution concerns the filing of a complaint against Maturo with the state Commission on Human Rights and Opportunities "arising out of his comments surrounding the racial profiling allegations, the Justice Department investigation and the indictments of four ... East Haven police officers," according to the agenda.
Brow said the board wants Maturo "to fire Gallo" and "save the town the $150,000" that would be involved in a retirement settlement "because of his terrible behavior as chief," he said.
He said that LEARN should be disbanded because three members, Gallo, Maturo and former Town Attorney Lawrence Sgrignari, "are part of the problem," and because it duplicates work that the police board already is doing.
The FBI arrested the four police officers last week on allegations that they waged a campaign of harassment against Latino residents and businesses, including assaulting people who were handcuffed and intimidating people who tried to report misconduct claims.
All four officers -- Sgt. John Miller and officers Dennis Spaulding, Jason Zullo and David Cari, have pleaded not guilty.
Federal authorities are targeting additional suspects, and state officials are preparing for possible widespread arrests that could cripple the Police Department.
Mario Rodriguez, nephew of the owner of Los Amigos store on Main Street, said that a new leader is a critical component of department improvements.
"Someone new should come in. The other (new) guy has got to understand our position, and we can talk," Mario Rodriguez said as he visited store owner Luis Rodriguez Monday. "When he (Gallo) leaves, that's not the solution. The solution is to keep going and to fix this kind of problem because it can't happen anymore."
When a new chief arrives, it will be a good time to conduct new training for officers, according to Luis Rodriguez.
"Police should talk with everyone in the community. It doesn't matter the ethnic race. We are open-minded for whatever we talk about with them," said Luis Rodriguez, who wants the Police Department and Maturo to participate in a community meeting about the recent town turmoil.
Jeffrey Matchett, executive director of AFSCME Council 15, the Connecticut Council of Police, also supports the retirement choice, viewing the move as putting the town and department before Gallo's own needs.
"Last week was a tough week for East Haven police officers, and for police throughout Connecticut. This week is a time to start heading in a new direction, where the focus can return to public safety and a healing of wounds," Matchett said in a prepared statement.
"Despite the work and dedication of Chief Gallo, his continued presence would have only served as a distraction to turning the department around. We applaud Chief Gallo's decision to put the department and the town ahead of his personal interests and to move the department in a positive direction."
The retirement was no surprise to a few locals on Main Street Monday afternoon.
"If you have a clear conscience, you shouldn't have to (resign)," said resident Sandra Negron. "I figured something like this would happen."
It seemed like only a matter of time, resident Dennis Schoendorf said, adding, "As a boss, you need to take responsibility."
Though Schoendorf acknowledged that Gallo's retirement will give the department "a new start" and give the town a chance to move past all of the recent controversy, he said he's still not sure if he feels Gallo should have retired because there's more information that hasn't yet been released.
Like Schoendorf, Robert Hande feels that he can't give a clear opinion on Gallo's announcement because more information will eventually be revealed and investigators have only showed one side of the story so far.
But he was surprised that Gallo is leaving now, wondering why he didn't make the decision instead when he spent more than a year on administrative leave. Gallo had been placed on leave by Capone in April 2010 before being reinstated by Maturo.
In Luis Cartagena's view, Gallo should be fired, adding, "Someone should take his place who knows how to deal with people and won't judge by race or color."
Pedro Gutierriez, owner of Guti's Bakery on Main Street, also has high hopes for a new chief and feels the retirement is a good thing.
"I hope the next person who is going to get the position of chief has the ability to work with the whole community and keep everyone safe," Gutierriez said. "We want to have confidence in our police department, and any problems we have in any way, we want to call them and feel safe."
Some involved in a civil lawsuit against Gallo and the Police Department on Monday applauded the retirement in a publicly released statement.
"The power structure that perpetuated a toxic culture within the East Haven Police Department is finally crumbling," said Christopher Lapinig, a student in the Worker and Immigrant Rights Advocacy Clinic at Yale Law School, which represents the plaintiffs in the civil rights case.
Attorney David Rosen, who is also representing plaintiffs in the civil rights suit, said Gallo had no other option but to leave.
"We continue to learn the extent to which the Police Department's law enforcement efforts were contaminated by the racism and police abuse that Gallo helped cultivate," he said.
The National Immigration Forum also weighed in, with Executive Director Ali Noorani saying in a statement that Gallo's retirement takes the town "a step closer to restoring justice and fairness."
But Noorani is against the Department of Homeland Security including the Police Department in the Secure Communities program, which allows fingerprints of people arrested in participating towns to be sent to U.S. Immigration and Customs Enforcement for analysis.
"Given the Justice Department's findings, we urge the Department of Homeland Security to not include East Haven in the problematic Secure Communities program. The events in East Haven are a clear reminder that DHS should proceed with caution when engaging local police as partners in immigration enforcement," Noorani said. | 2024-04-05T01:26:29.851802 | https://example.com/article/3677 |
A gang of venture capital firms and startup funds has asked the Trump administration to save an immigration rule that allows foreign startup founders to come to the US in order to build their companies.
Exactly 60 companies and organizations on Thursday signed a letter [PDF] asking the President to scrap plans to rescind the …
A new multi-million dollar fund is planning to invest in promising Israeli tech startups.
YL Ventures, based in both Silicon Valley and Tel Aviv, has put together a $75m war chest to invest in seed stage Israeli companies in high-growth sectors including cybersecurity, enterprise software, autonomous vehicles, drone …
Silicon Valley is very big on virtual reality right now. But imagine a VR “game” where you can control a company remotely, but without any of the fiduciary duty that the law places on a company executive, or an investor?
You don’t need nerd goggles to play this game. For it’s very similar to the relationship that’s emerged …
Comment
We just didn’t know it at the time, but Pebble’s fate was sealed in May 2013 when it surrendered control to outsiders who saddled it with debt.
Yesterday Pebble’s new owner Fitbit lost no time in closing down the operation, not merely snuffing out any prospect of new products, but warning Pebble owners that they’re not going …
A group of venture capitalists are asking US President-elect Donald Trump to implement a series of tax cuts and policies they say will bring more funding for startups.
In a letter (PDF) to the real-estate mogul turned-politician, the National Venture Capital Association (NVCA) asks for tax breaks for ventural capital companies …
While venture capitalists have been tightening their belts over the past year, there’s still a lot of love and funding for security startups – especially if you’re working in the right areas.
During a panel discussion at the Structure Security conference in San Francisco today, a trio of top VCs identified three key areas …
Radbot
In which Damon Hart-Davis talks about life as a tech entrepreneur and tells us about his product.
I toiled in banking for circa 20 years, amongst other gigs, including at the much-loved Lehman Brothers (motto: “Where Vision Gets Bilked” or whatever) and RBS, and a previous fintech start-up of mine, though I’m also an …
A pair of newly passed bills in the US Congress will increase the amount of money tech startups can raise to cover their early expenses.
The Fix Crowdfunding Act (HR 4855) and the Supporting America's Investors Act (HR 4854) will raise the limits on money that companies can gather through crowdsourcing and venture capital …
Venture capitalists have poured $131m of fresh funding into a Slack-like collaboration startup, Domo.
Domo, founded in 2010, secured the money in a top-up to an existing Series D funding round from a tranche of its existing backers plus newbie Credit Suisse. That existing round was for $200m and took place in April 2015. …
ICGS
Fears of another technology startup bubble bursting are "legitimate," says the outgoing head of Intel's venture capital arm.
As a result, the chip biz is playing it safe in "overheated sectors" of the market, and looking overseas for the next big thing.
It's not widely known but Intel Capital is one of the largest venture …
GitHub has received a $250m infusion of venture-capital cash that values the code-sharing website at $2bn.
That means it's worth more than ZenDesk ($1.78bn), slightly less than the New York Times ($2.17bn), and more than stricken Yelp ($1.87bn).
The San Francisco-based upstart said its Series-B funding round was led by VC …
Worstall on Wednesday
A internal presentation from Andreessen Horowitz aimed at its limited partners, that has to be taken with the appropriate shovelful of salt, has emerged – and the insights it reveals into the “tech bubble” are absolutely fascinating.
U.S. Technology Funding -- What's Going On? from a16z
Take it with a shovelful of salt …
Online hat-passer GoFundMe has sold off a controlling stake of its business to investors who value it at roughly $600m.
The Wall Street Journal cited sources familiar with the matter in reporting the donations broker had completed a round of venture capital funding that culminated with investors taking over the majority …
Code-sharing website GitHub is pursuing a new round of venture capital based on a US$2bn (£1.26bn) valuation.
Bloomberg cited sources familiar with the matter in reporting that GitHub is in the middle of a series-b funding push to raise US$200m in capital.
That dosh would give investors a 10 per cent stake in the company …
Twitter has quietly extended its venture-capital appendage for the first time to invest in Cyanogen, a start-up challenging Google's Android.
The creatively named "Twitter Ventures" was announced as party to Cyanogen's recent $80m pass around of the collection plate, and is listed alongside Rupert Murdoch, Vivi Nevo and a …
Bosses at selfie-swapping upstart Snapchat spent the weekend in Saudi Arabia seeking investment from the Warren Buffett of the Middle East: Prince Al-Waleed bin Talal.
The self-destructing-photo app biz is looking for about $500m, and hopes the prince – a member of Saudi Arabia's ruling royal family – can chip in a few million …
Startup-land Australia likes nothing more than to whinge about how hard it is for tech companies to find their first investors in Australia. The sector is considered scarcely capable of spelling HTML, never mind capable of understanding its importance enough to invest in someone that wields it.
Complaints about how hard it is …
You ever have one of those weeks where nothing seems to go right?
Maybe the train runs late in the rain. Or the lace on your boot breaks as you're walking out the door. Or maybe four major cities across the planet line up to sue you.
Yeah, Uber just had a week like that – just days after it was injected with $1.2bn of funding … | 2023-08-26T01:26:29.851802 | https://example.com/article/1964 |
How to Get Rich by Buying and Flipping Real Estate Riverhead NY
Let's face it; there are so many get-rich-quick schemes out there that it makes your head spin. This is a practical way to achieve millionaire status and stay rich forever--the same way that countless others have gotten rich. The time frame will probably take at least 36 months. But it could be shorter if you have the time and dedication to work this plan full time.
Real estate investing is the involvement of management, purchase, rental, sale, or ownership of a real estate that can be used as profit. Real estate development is the improvement of a specific realty property as part of the strategy in the investment of real estate. | 2023-12-07T01:26:29.851802 | https://example.com/article/1622 |
Polyketones derived from diphenyl ether and terephthaloyl and isophthaloyl chlorides by Friedel-Crafts synthesis are known from, for example, U.S. Pat. Nos. 3,065,205; 3,441,538; 3,442,857; 3,516,966; 3,637,592; 3,666,612; 3,767,620. These polyketones possess desirable and useful chemical and physical properties. In this regard, U.S. Pat. No. 3,767,620 states the following in column 1, lines 23 to 28:
"Their good electrical properties, coupled with resistance to thermal oxidative and hydrolytic degradation, made them good candidates for electrical insulation, but these polymers tend to degrade and undergo decomposition during attempts to extrude them." PA1 "However, I have now discovered that when the terminal group on either or both ends of each polymer chain is a phenoxy (or other nucleophilic) moiety having a para position available for reaction then, in highly acid media such as hydrogen fluoride/boron fluoride mixtures, a preferred polymerization reaction media, another heretofore unknown branching reaction occurs. It is believed that such branching results from the reaction of the phenoxy (or other nucleophilic) groups (presumably activated, i.e., protonated by the acid media) with carbonyl groups in the polymer itself leading, I believe, to the formation of trisaryl carbonium salts. In addition to the deleterious effect of branching per se on processability, such salts are thermally very unstable and lead to degradation and discoloration in the polymer when molten". PA1 z is halogen, alkyl or alkoxy PA1 4--nitrodiphenyl ether PA1 4--phenoxybenzophenone PA1 4--phenoxydiphenyl sulfone PA1 anisole PA1 fluorobenzene PA1 chlorobenzene PA1 biphenyl PA1 toluene. PA1 benzoyl chloride PA1 p-fluorobenzoyl chloride PA1 p-chlorobenzoyl chloride PA1 p-methoxybenzoyl chloride PA1 benzene sulfonyl chloride PA1 p-chlorobenzene sulfonyl chloride PA1 p-methylbenzene sulfonyl chloride PA1 4-benzoyl-benzoyl chloride PA1 (i) at least one electrophilic aromatic diacyl halide of the formula EQU YOC--Ar--COY PA1 where --Ar-- is a divalent aromatic radical such as phenylene, diphenylether-4,4'-diyl, diphenyl-4,4'-diyl, naphthalene, and the like, Y is halogen such as chlorine, bromine or iodine with chlorine being preferred, and COY is an aromatically bound acyl halide group, which diacyl halide is polymerizable with at least one aromatic compound of (a)(ii), and PA1 (ii) at least one aromatic nucleophilic compound of the formula EQU H--Ar'--H PA1 where --Ar'-- is divalent aromatic radical such as diphenylether-4,4'-diyl, 2,7-dibenzofurandiyl, diphenyl-4,4'-diyl, diphenylmethane-4,4'-diyl, and the like, and H is an aromatically bound hydrogen atom, which compound is polymerizable with at least one diacyl halide of (a)(i), and PA1 where --Ar"-- is a divalent aromatic radical such as diphenylether-4,4'-diyl, 2,7-dibenzofurandiyl, diphenyl-4,4'-diyl, diphenylmethane-4,4'-diyl, and the like and H is an aromatically bound hydrogen atom, Y is as defined above, and COY is an aromatically bound acyl halide group, which monoacyl halide is self-polymerizable, and
U.S. Pat. No. 3,767,620 attributes the melt instability of the polyketones produced by Friedel-Crafts polymerization to a high percentage of 9-phenylenexanthydrol end groups. The chemical reduction of 9-phenylenexanthydrol end groups to the corresponding 9-phenylenexanthene groups is stated in the patent to provide a polyketone with improved thermal stability after the reduction.
U.S. Pat. No. 4,247,682 describes polyarylketones and polyaryl sulfones having good melt stability. These polymers are prepared by a Friedel-Crafts condensation polymerization. The polymerization is carried out in solution and is homogenous. The patent states the following in column 1, lines 48 to 64:
The polymers in U.S. Pat. No. 4,247,682 are capped at each end by a nucleophilic or electrophilic capping agent. The nucleophilic capping agents are described as having the general formula: ##STR1## where X is preferably --O-- or a covalent bond and Y is CN and NO.sub.2. The electrophilic capping agents are described as having the general formula Ar"COZ or AR"SO.sub.2 Z with Z being OH, halogen or OR where R is alkyl, and Ar" being phenyl, etc., either unsubstituted or substituted with one or more electron withdrawing substituents such as halogen, nitro or cyano.
However, the polymerization in U.S. Pat. No. 4,247,682 is carried out in anhydrous hydrogen fluoride with boron trifluoride as the catalyst and is thus a homogeneous process. Further, the double end capping is carried out in hydrogen fluoride solution. | 2024-02-22T01:26:29.851802 | https://example.com/article/6489 |
What Do People With Schizophrenia Do All Day? Ecological Momentary Assessment of Real-World Functioning in Schizophrenia.
Schizophrenia is a major cause of disability worldwide. As new treatments for functioning are tested, the need grows to demonstrate real-world functioning gains. Ecological momentary assessment (EMA) may provide a more ecologically valid measure of functioning. In this study, smartphone-based EMA was used to signal participants with schizophrenia (N = 100) and controls (N = 71) 7 times a day for 7 days to respond to brief questionnaires about social interactions and functioning behaviors. Excellent adherence was found, with both groups completing an average of 85% of surveys and only 3% of participants with schizophrenia excluded for poor adherence. Four-week test-retest reliability was high (r = .83 for total productive behaviors). Relative to controls, participants with schizophrenia reported significantly less total productive activity (d = 1.2), fewer social interactions (d = 0.3), more nonproductive behaviors (d = 1.0; watching TV, resting), and more time at home (d = 0.8). Within the schizophrenia group, participants living independently showed better functioning on EMA relative to participants in supported housing (d = 0.8) and participants engaged in vocational activities showed better functioning than individuals not engaged in vocational activities (d = 0.55). Modest correlations were found between EMA and an in-lab self-report measure of functioning activities performed in the community, but not between EMA and measures of functional capacity or potential. This study demonstrated the feasibility, sensitivity reliability, and validity of EMA methods to assess functioning in schizophrenia. EMA provides a much-needed measure of what individuals with schizophrenia are actually doing in real-world contexts. These results also suggest that there may be important disjunctions between indices of abilities and actual real-world functioning. | 2024-03-16T01:26:29.851802 | https://example.com/article/5497 |
I read these stories because they confirm what we have written dozens and dozens and dozens of times in this space: the action in the area of curing or ameliorating diseases is not in harvesting stem cells from helpless unborn children but drawing on cells from a patient’s own body.
There is a lot in the story by Marilynn Marchione, AP’s Chief Medical writer, that is novel, including that the source that was used to treat 50-year-old Richard Grady is not a stem cell, embryonic or otherwise, but another kind of cell from the patient’s own body.
Here’s her lead about what is called CAR-T cell therapy:
A man with deadly brain cancer that had spread to his spine saw his tumors shrink and, for a time, completely vanish after a novel treatment to help his immune system attack his disease – another first in this promising field.
The type of immunotherapy that 50-year-old Richard Grady received already has helped some people with blood cancers such as leukemia. But the way he was given it is new, and may allow its use not just for brain tumors but also other cancers that can spread, such as breast and lung.
Grady was the first person to get the treatment dripped through a tube into a space in the brain where spinal fluid is made, sending it down the path the cancer traveled to his spine.
As always when dealing with this subject area, I turn to Dr. David Prentice, Research Director, Charlotte Lozier Institute, to explain in layman’s terms what is going on. He told NRL News Today
These early clinical results are quite heartening, and highlight another life-saving cell-based research possibility. Like life-saving adult stem cells (and quite unlike life-destroying, and unsuccessful, embryonic stem cells), the CAR-T cell therapy technique uses the patient’s own cells to effect these cancer remissions.
But note these are not stem cells; they are workhorse immune cells from the patient’s body. The cells are removed from the body and genetically modified in the laboratory. The CAR (Chimeric Antigen Receptor) which is added to the cells, targets the modified immune cells to specifically attack the tumor, and also increases the cells’ activity in attacking the cancer.
I asked Dr. Prentice if he could come up with comparison.
Think of it as giving the cells a tumor-targeting homing mechanism, and then juicing them up on caffeine. Their sole, excited purpose is to kill the cancer. And the results point toward more of these cancer therapies on the horizon.
According to Marchione, Grady was one of the 20,000 people who’ve been diagnosed in the U.S. with glioblastoma, a particularly aggressive brain tumor. The customary treatments, which Grady underwent, are radiation and chemotherapy which did not prevent the cancer from coming back.
He enrolled in a clinical trial at City of Hope and had some of his own blood cells, called T cells, removed and genetically modified in the lab to turn them into specialized soldiers to seek and destroy cancer.
After Grady had more surgery to remove three of his largest tumors, Marchione writes,
He got six weekly infusions of the cells through a tube into his brain, where the biggest one had been. No cancer recurred there, but the remaining tumors continued to grow, new ones appeared, and cancer spread to his spine.
Doctors decided on a bold step: placing a second tube in his brain, into a cavity where spinal fluid is made, and putting the cells there.
“The idea was to have the flow of the spinal fluid carry the T cells to different locations,” along the route the cancer had taken, [Dr. Benjamin] Badie said.
After three treatments, all tumors had shrunk dramatically. After the 10th treatment, “we saw all the tumors disappear,” and Grady was able to cut back on other medicines and return to work, Badie said.
As always, the caveat is this is experimental therapy, moreover tumors have appeared elsewhere for which Grady is getting radiation. But, as Marchione notes,
his response to immunotherapy lasted more than seven months, and “for him to live more than a year and half” after starting it is amazing for a situation where survival often is measured in weeks, Badie said.
Badie, who is neurosurgery chief at City of Hope, a cancer center in Duarte, California, where Grady was treated, added that Grady had “a remarkable response” that opens the door to wider testing. | 2023-11-03T01:26:29.851802 | https://example.com/article/7883 |
Meta
Tag: Atmospheric Pressure
Assume that there exists a species similar to Man, but on a hypothetical Earth, with an atmospheric pressure of 150 PSI – i.e. with 10x the actual atmospheric pressure. The atmosphere should still contain free oxygen, so that early, primitive tools and fire remain possible. But my Civ seems to have a very late-onset Industrial Revolution.
The reason for this seems to be, that internal combustion engines just wouldn’t work. An actual gasoline engine needs to achieve pressure-ratios of 1:8 or better, to be efficient, and should not need to be made from super-alloy. An actual diesel might seem prohibitively expensive already, just because it uses a pressure-ratio of 1:12 or so. You see, the fact that a simple, cheap solution already exists, can prevent our actual civilization from developing solutions that could ultimately be better. We still don’t see a lot of electric cars on the road, just because the internal combustion engines are so much more-affordable.
Flying-machines already exist, that use the infernal-combustion engines, so why try to invent (presumably more-expensive) flying machines that would be electromagnetic?
But on the hypothetical Earth, electric motors that spin propellers would work just fine. In fact, electric motors should work just as well, at 100x actual atmospheric pressure. So the obvious question should be, where would our counterpart-Civ derive its electricity, if not again, from an internal-combustion engine?
And so one observation which might be useful to me, is that drones such as our electric drones should work well for this hypothetical Civ. But then, that would also seem to be the earliest-possible onset of their version, of heavier-than-air flight. By that analogy, flight would have to wait, until they have invented a lightweight source of electricity, comparable in performance to our Lithium-Ion batteries.
But I don’t have my full answer yet. Our actual drones today are still not powerful enough, to lift a Man into the air and fly way with him. Apparently, Lithium-Ion Batteries are not lightweight and/or high-energy enough yet. Our Civ has gotten unmanned drones to fly, but no manned flight yet. | 2023-08-23T01:26:29.851802 | https://example.com/article/5763 |
Q:
Save Log Information in Database with log4net and NHibernate
I followed this tutorial and was able to get both of the projects working with my instance of sql server 2012:
However, when I included HLogger project within my solution (instead of using it together with the sample project above), it did work.
The following is a code snippet that worked for me when running it from the provided sample project; however, when I added this library to my own solution, it did not work.
ILog log = log4net.LogManager.GetLogger("NHibernateLogging");
log.Error("Error!", new Exception("Exception123"));
log.Warn("Warning");
Nothing happened. Nothing was thrown. The database was not populated. I am using the same hibernate.cfg.xml file as the one provided (and worked in conjuncture with the "sample project"):
<?xml version="1.0" encoding="utf-8" ?>
<hibernate-configuration xmlns="urn:nhibernate-configuration-2.2">
<session-factory>
<property name="connection.provider">
NHibernate.Connection.DriverConnectionProvider
</property>
<property name="connection.driver_class">
NHibernate.Driver.SqlClientDriver
</property>
<property name="connection.connection_string">
Server=------.net;database=mydb;user id=myuser;password=sdofjosidfjoijsf;persist security info=true;
</property>
<property name="dialect">
NHibernate.Dialect.MsSql2000Dialect
</property>
<property name="show_sql">
true
</property>
<property name='proxyfactory.factory_class'>NHibernate.ByteCode.Castle.ProxyFactoryFactory, NHibernate.ByteCode.Castle</property>
</session-factory>
</hibernate-configuration>
The only change was to the app.config file. It used to be:
<section name="log4net"
type="log4net.Config.Log4NetConfigurationSectionHandler,log4net-net-1.0" />
and now it is:
<section name="log4net" type="log4net.Config.Log4NetConfigurationSectionHandler, log4net" />
The reason for this is that I cannot have multiple versions of log4net in the same solution, and I do not have a choice on my current log4net version due to its capabilities with being able to log the version 2 of masstransit with msmq.
The projects in the codeproject site were created for .NET 3.5, whereas my solution is .net 4.5.
How do I diagnose the reason for not being able to log anything with log4net in a database?
A:
You could start with,
See if the issue is with Log4Net, try adding a FileAppender for the same configuration and see if works
If log4net works then next one is to check the Appender configuration, specially Double check namesapaces of classes / assembly names
| 2024-03-23T01:26:29.851802 | https://example.com/article/7023 |
Contents
La Gazzetta dello Sport was founded by Eliso Rivera and Eugenio Camillo Costamagna.[2] The first issue was published on 3 April 1896, on time to cover the first modern Olympic Games held in Athens. The paper is based in Milan.[3] Its role extends beyond news reporting and features, to direct involvement in major events, including (since 1909) the organization of the Giro d'Italia (Tour of Italy) cycling stage race.
La Gazzetta dello Sport is part of the RCS media group.[4] The paper was published in broadsheet format[5] until 2008 when its format was switched to tabloid.[4] The newspaper, published on pink paper, sells over 400,000 copies daily (more on Mondays when readers want to catch up on the weekend's events), and can claim a readership in excess of three million.
A coffee and a Gazzetta newspaper.
Although a wide range of sports are covered in the newspaper, football is given by far most of the coverage. With some 24-28 pages out of 40 devoted to the sport on a daily basis, much of the journalism is speculative and sensationalist rather than the pure reporting of matches. The paper has a good record for campaigning journalism, and played a significant part in exposing the 2006 Serie A scandal that rocked Italian football and led to the relegation of Juventus and points penalties for other leading clubs.
On 3 April 2016, it celebrated its 120th anniversary by printing the newspaper in green, as it was originally.[6]
In 1990 the circulation of La Gazzetta dello Sport was 809,000 copies.[7] It was the third best-selling Italian newspaper with a circulation of 401,000 copies in 1997.[8]
The paper had a circulation of 445,000 copies in 2001, making it the twentieth best-selling European newspaper.[5] In 2008 the paper had a circulation of 368,848 copies.[9] The online version of the paper was the eighteenth most visited website in the country in 2011.[10]
Corriere della Sera
The Corriere della Sera is an Italian daily newspaper published in Milan with an average daily circulation of 410,242 copies in December 2015.
Daniele De Rossi
Daniele De Rossi is an Italian professional footballer who plays as a defensive midfielder for Roma and formerly the Italy national team. De Rossi inherited the captaincy of Roma at the start of the 2017–18 season following the retirement of Francesco Totti.
La Stampa
La Stampa is an Italian daily newspaper published in Turin, Italy. It is distributed in Italy and other European nations. It is one of the oldest newspapers in Italy.
Matteo Brighi
Matteo Brighi is an Italian professional footballer who plays for Empoli as a midfielder.
Les Échos (newspaper)
Les Échos is the first daily French financial newspaper, founded in 1908 by the brothers Robert and Émile Servan-Schreiber. It is the main competitor of La Tribune, a rival financial paper.
Tuttosport
Avvenire
Avvenire is an Italian daily newspaper which is affiliated with the Roman Catholic Church and is based in Milan.
1909 Giro d'Italia
The 1909 Giro d'Italia was the inaugural running of the Giro d'Italia, a cycling race organized and sponsored by the newspaper La Gazzetta dello Sport. The event began in Milan on 13 May with a 397 km (247 mi) first stage to Bologna, finishing back in Milan on 30 May after a final stage of 206 km (128 mi) and a total distance covered of 2,447.9 km (1,521 mi). The race was won by the Italian rider Luigi Ganna of the Atala team, with fellow Italians Carlo Galetti and Giovanni Rossignoli coming in second and third respectively.
Corriere dello Sport – Stadio
Corriere dello Sport – Stadio is an Italian national sports newspaper based in Rome, Italy. It is one of three major Italian sports daily newspapers and has the largest readership in central and southern Italy, the fourth most read throughout the country.
Il Giorno (newspaper)
Il Giorno is an Italian-language national daily newspaper, based in Milan, Italy; it has numerous local editions in Lombardy.
La Gazzetta del Mezzogiorno
La Gazzetta del Mezzogiorno is an Italian daily newspaper, founded in 1887 in Bari, Italy. It is one of the most important newspapers published in Southern Italy with most of its readers living in Apulia and Basilicata.
List of Giro d'Italia general classification winners
The Giro d'Italia is an annual road bicycle race held in May. Established in 1909 by newspaper La Gazzetta dello Sport, the Giro is one of cycling's three "Grand Tours"; along with the Tour de France and the Vuelta a España. The race usually covers approximately 3,500 kilometres (2,200 mi), passing through Italy and neighbouring countries such as France. The race is broken into day-long segments, called stages. Individual finishing times for each stage are totalled to determine the overall winner at the end of the race. The course changes every year, but has traditionally finished in Milan.
Gianluigi Donnarumma
Gianluigi Donnarumma is an Italian professional footballer who plays as a goalkeeper for Serie A club Milan and the Italy national team. | 2023-12-11T01:26:29.851802 | https://example.com/article/9954 |
Available Options
A leather jacket from Acne Studios is a piece coveted by stylish women around the world, and the iconic Velocite design has topped our wish list. Crafted from soft brown leather with a vintage-effect treatment, it is shaped with classic biker jacket detailing, from the notched collar with its snap buttons to the belted waist and silver-hued zippers. The cozy collar bridges the gap between textural and tough-luxe. | 2024-01-19T01:26:29.851802 | https://example.com/article/5408 |
With the economy still in recovery mode, and consumers trying to get their finances back on track, having a budget that actually works is more important than ever.
But how do you plan a budget that you'll actually stick to? The key is to understand the different budget strategies and figure out which one is the best fit. It's also vital to realize that this process won't always be easy, but you can't give up.
1. Base Your Income and Expenses on Reality
Start by listing everything you spent money on in the past 3 months. This might take a little bit of extra time, but only writing down expenses and income from one month ago, won't give you the entire picture. You may forget transactions that only happen on a quarterly basis, like getting your car's oil changed, or income bonuses at work.
Be honest with yourself so you don't leave anything out. You want your budget plan to be as accurate as possible, to ensure you actually stick to your monthly spending goals. To do this, you need to base your budget on reality using the correct figures.
2. Chose a Customized Plan
There are multiple types of budgets and spending plans out there, so choosing the right one is important. You may have to test them out for a couple of months to see which type works best for your family. Here are some of the most popular ones:
+ The 50/30/20 rule. This rule breaks down spending habits into 3 categories with certain percentages. Based on your income, essential expenses (like utilities, food and rent) make up 50% of your spending. Unnecessary expenses (cable, internet, cell phone) make up 30% of the budget, and future goals (debt payments, savings, retirement fund) make up the rest, or 20%.
+ Fixed and variable expenses budget. This method divides your budget into two categories, fixed versus variable expenses. You can only lower the payment of fixed expenses, like car insurance, or mortgage payment, so much, but eating out expenses and entertainment fall under discretionary spending, which can be cut back if needed.
+ Bare bones budget. This is a budget based on your lowest possible monthly income. If you're self-employed, or work at a commission-based job, this type of plan will work best for you. Create a plan based on absolute necessities that you need to survive, with any other money seen as gravy.
3. Find a Method to Track Your Budget
Now that you've calculated how much you spend, what your income is, and divided out into a budget plan that works for your specific situation, it's time decide on how you'll track everything each month.
Are you tech-savvy and prefer to track your daily spending on a mobile app? Or do you prefer to carry around a small notepad and pen to quickly jot down transactions? Some of the best options are:
+ Mint.com's completely free web-based service and mobile app.
+ You Need a Budget's desktop software.
+Microsoft's free monthly budget templates you can easily download.
Again, you may have to test out a few different online tools, or spreadsheet templates, but once you find the one that works, stick with it.
How to Plan a Budget that Works
You're trying to figure how to plan a budget, so be in it for the long-term and don't get discouraged if it doesn't work very well for the first several months. It takes time to create new spending habits, and level out as your income fluctuates.
Also, don't be afraid to experiment and try out a few different methods, tools, and resources to plan a budget. As your situation changes and your life evolves, you may find that one style doesn't work anymore, and it's time to try something new.
PHOTO GALLERY Top 8 Benefits of Financial Education | 2023-12-28T01:26:29.851802 | https://example.com/article/8534 |
Q:
Define the multiplicity of an association by an attribute
In the example I made every object of the type "Folder" have an array of type "File" with the name "content" a size of "n" as a private attribute (just saying my understanding of it to make sure that I am not already wrong there). That's how I see it in most examples but I never understand what "n" now is. Is it another attribute of the "Folder" object or is it something that we specify in another part of an UML diagram or something else completely?
What I am trying to achieve is that every object of the type "Folder" has an additional attribute that specifies the size of the "content" array.
A:
Of course, you can not only write 0..*, but use any concrete number, too. If that number has some external definition, you can use there n, as you have it.
The external definition means "not defined by class diagram elements, except notes". Everything that you need to be said on a class diagram page, but can't because of the UML limitations, should be put in a note.
So, n can be defined in appropriate note on the page or in some different document or both.
As @Kilian had mentioned, in the case of some more complicated dependencies of such variables you can use constraints. This way seems to me the most powerful.
But if n has no objective definition or dependency, but is a simple variable that can have any meaning, then it will be correct to use a rule, such as 0..*, or 1..*, or maybe 3..5, according to the reality you are working with.
| 2024-06-24T01:26:29.851802 | https://example.com/article/2206 |
Want to be a baker but feel like you can't because of your diabetes?
Do you ever feel like you can't reach your full potential as a baker because you don't want to have all of those sweets laying around? I have always loved to bake but stopped for many years because I had a really hard time not eating what I made. I recently decided to not let my diabetes stand in my way of doing something I love. So now I do it anyway :)
I would love to hear thoughts from any of you on what you do when you want to bake something but know that you can't let it sit around the house?
Here is an article I wrote recently here on Diabetic Connect with a few options to make it easier on you as a diabetic baker but to still release the baker within.
18 replies
I don't bake like I used to either. My Husband can eat just about anything ,but my Stepson who lives with us is extremely overweight with high blood pressure and was told last year no sodium/low sodium. He was also told not to drink too many soft drinks or eat too many sweets. He does not have diabetes yet but his mom and her family have it.My Stepson also has Spinal Stenosis which is crippling him and he does nothing but sit in bed all day. I prepare meals for him and so does his mother,but he continually gripes about the food not having salt in it or in the case of the ham we buy for sandwiches not tasting right because he claims it should not taste sweet. We buy honey ham or brown sugar ham by Sara Lee which is approved by the American Heart Assoc. I told my husband that with Thanksgiving coming I wanted to cook a Turkey Breast and have found some recipes for cranberry sauce that diabetics can eat. I am also going to try making some other things that not only I can eat but everyone else in the family will enjoy.
I would live in my kitchen if I could- I LOVE to cook and bake! So, I bake it and send it to work with my husband or to school with my kids or deliver to friends and family. Everyone loves homemade treats, especially ones they didn't have to make. It's a win-win for everyone and is a tasty way to show love to my favorite people.
I also love to bake and experiment. Since June, I have made quite a few cakes, but they have been for occasions and so it was easy enough to bake it and take it and leave it behind for others to enjoy. I only bring if requested, and with certain people I know nothing is going to be left so no left over cake for anyone. Last Christmas I managed to make dozens of cookies and not taste one,that was hard I admit it, but I was proud of myself for trusting they were good enough without me testing them for quality assurance, LOL!
Great article. I have stopped baking all together since being diagnosed, much to my husband's disappointment. I can't have it in the kitchen without eating it. I've tried some recipes that use alternate ingredients, but they haven't been satisfactory. Maybe I should try harder.
It does take a lot of experimenting. Coconut flour sucks up any kind of moisture and can make things dry. Almond flour can make things too moist and crumbly. So it takes a while to find a good mix. I also in some, just replace half the flour with other flours and let the wheat flour do it's thing. I baked all day today, it was fun.
I used to bake a lot and also made candy. Not so much any more as it is too much of a temptation. But I do make these items for special occasions and try to reduce the overall carbs by substituting the sugar with Splenda or the flour with almond meal. I've fashioned some reasonable peanut butter truffles and trifles…puddings and custards and cheescakes seem to be the easiest desserts to reduce the carbs in without sacrificing quality.
Same here I have a cabinet full of deserts waiting to be made, cake mixes, but I do bake every once in a while, but I only eat a small piece about every other day and I have to sacrifice other carbs, like a couple of peanut butter crackers, potato's, and other things.
Having your cake and eating it too is a challenge, but it can be done. (good article)
I am like you. I was known for the wonders that came out of my kitchen. Breads, sweets and savories. I did it all, and people loved it. I would always be the one to make a huge tray for work or pass out to neighbors, but of course, I had to test my product.
After I was diagnosed, I also put the beaks on it after the first year. I tried and failed at baking for others without trying what I made. I can't help it. I want to make sure it's good going out. Cutting sugar doesn't really cut the carbs. It made me sad to feel that part of me was over.
So here is my solution. I have been experimenting with using alternate flours and even cooking without flour. The calories are still there, but the carbs are so much less. Coconut and almond flour have become my best friends and once you get the hang of using them, you get a whole new world of yummies.
It's so funny that this should come up this morning, as I have just filled my counter with all the ingredients to make some serious cookies today. The new thing I am going to try is freezing some dough. I usually freeze my cookies and only put out a few at a time for the family or guests. But I am going to freeze them raw and see how that works. Then I can just pop a dozen in the oven and make hubby happy. (he's been hinting it's been a long time) And to my amazement, the alternate flours he doesn't seem to mind at all.
This time of the year is when I used to spend hours upon hours in the kitchen baking all kinds of things. I have cut that back a lot, as I no longer have a work place to share them with and most of my neighbors don't have children and don't want the calories hanging around. I still have a few haunts to share with, and I still get my fix of baking and decorating for others.
To me, there is nothings like the feeling of making someone happy with the food that is shared from my heart. And now...it's even healthier for everyone.
I don't agree. As long as you don't eat what you bake all in one sitting, I dont see why you can't bake anything you want. People with Diabetes can eat things with sugar in them, in moderation, and as long as they take into account the carbs in the baking, and trade them for carbs in something else, for example, if you want to eat a small piece of cake you would not have a potato with dinner. I see no point in depriving yourself when simple trades can be made. No Diabetic body is like another Diabetic body, how one person reacts is not how another might.
Hi Grsnniesophie,I agree to a certain degree with you Grannie. However, you know sugar is not good for us. To have a sliver of cake once in awhile is okay. Like for special occasions, but to participate with the family to eat a piece of cake daily is not a good idea as can lead to real problems in the future. I suggest that you can make diabetic recipes and you and the family enjoy. Yoi will know the number of carbs and not have to guess at a regular recipe.
Since I also have Celiac dies ease, and a host of other issues, I search out recipes that I can easily substitute something for something else. I seldom bake anything but my own bread, having actually lost the cravings for most sweet stuff! My comment was in general, not for anything specific! And I don't replace most gluten containing items for gluten free ones, I just don't have most of them!
Hi again Granniesophie,I did disagree with you but in general as well. From your past posts I knew that you took care of yourself. But, I do thinkeven if we write in general we must keep in mind the many new diabetics that this will effect. That is the main reason I opposed you. Hope you understand and hold no ill feelings. Hugs, VL | 2024-03-13T01:26:29.851802 | https://example.com/article/6356 |
ESL One Cologne 2018 Highlights – NaVi Wins, S1mple Takes MVP
ESL One Cologne 2018 played out last week and it is safe to say that the entire event was a rollercoaster ride. Tournament favorites and top team Astralis lost out, BIG had a surprisingly successful run up to the grand finals and NaVi may have just reached their final form with S1mple at the helm once again.
Here is a look at the main ESL ONE Cologne 2018 highlights
BIG Surprised the World
Let’s start with what was easily the biggest surprise of the event – BIG’s performance. During the group stage, BIG performed as expected to begin with. BIG pulled out a hard-fought 16-7 win before losing 2-0 to Fnatic.
They then fell to the lower bracket. It was here where something must have happened because the BIG that entered the tournament certainly wasn’t the BIG that left it.
BIG first took a very close 2-1 win against Renegades, with two games getting close to the 30 round limit and the final being an overtime 19-17 win to BIG.
BIG then faced MIBR, who had looked like they had finally found their footing after fumbling slightly in the group stage and falling into the lower bracket. Once again, games went to the line, but BIG closed it with an overtime game on inferno. This win sent BIG to the playoffs.
BIG had played well, but at this point it was down to some very close overtime games that lead them to victory. They performed well, but everybody thought this would be where BIG would be sent home.
Surprisingly, BIG took an incredible win against G2 in the quarterfinals. The first game was as expected. It went to overtime and BIG won it 19-17. Then, somehow in the next game, BIG won 16-1 on Dust 2 as G2 just fell to pieces.
This must have given BIG the confidence to take the win against FaZe next in the semifinals. The first game was overtime again, but BIG lost it. After that, BIG took one 16-13 win and closed it with a 16-6 win on Inferno.
Finally, BIG lost in the grand finals to NaVi, only taking 1 win out of the potential 5 games.
NaVi Are Finally in Great Strength as a Collective
I’ve said time and time again that as soon as NaVi get their stuff together as far as team cohesion goes, they’ll be on top of the world. That time has finally come.
NaVi’s coordination throughout ESL One Cologne was incredible and even though S1mple unsurprisingly took the MVP for yet another event, the team pulled through together as a unit.
Part of that was due to Zeus’ role as an IGL to calm the nerves of NaVi and be the man responsible for calls. Zeus made sure everybody was in check and nobody, S1mple included, fell into the trap of making dangerous plays out of desperation.
Zeus has clearly worked hard alongside the other team members to build better communication throughout the group, and this has helped all players to shine where they do best.
Astralis may have held the crown for a short while, but I feel NaVi is close to taking it from them and they may just close out 2018 as the best team in the world.
What are your thoughts on ESL One Cologne 2018? Did you watch the event? Which matchups did you enjoy the most? | 2024-02-20T01:26:29.851802 | https://example.com/article/1533 |
NEW YORK – A few blocks from where a giant rally in support of Israel would soon gather outside the United Nations, several dozen protesters, most of them young adults dressed in black, stood outside the midtown Manhattan office building that houses the Conference of Presidents of Major American Jewish Organizations, chanting the mourners’ Kaddish and reading aloud the names of the hundreds of Palestinians, and the Israeli soldiers, who have died since July 24th during the Gaza operation.
The effort was organized by “If Not Now, When?,” an ad hoc group of anti-occupation Jewish protesters.
Their demonstration was dwarfed by the “New York Stands With Israel” community-wide rally held outside the UN two hours later. That gathering, co-sponsored by UJA-Federation of New York, the Jewish Community Relations Council and Conference of Presidents, along with the Reform, Conservative and mainstream Orthodox movements, was attended by 10,000 people, said Shira Dicker, who has a public relations firm but was speaking as a rally participant. Being at the rally is “exhilarating,” she said.
The anti-Gaza war rally, tiny in comparison, was held because “we think this war is unjust, the occupation is unjust, and the cycle of violence is not good for the Jewish people,” said Yonah Lieberman, one of the rally’s facilitators, who is 22 and works as a tenant organizer. “We are protesting the implicit support American Jewish leaders gave to the Israeli offensive in Gaza.”
Simone Zimmerman, 23, who said she has cousins currently serving in the Israeli army and a sister volunteering in bomb shelters, said that she doesn’t think that the current crisis began with the rockets Hamas has been firing into Israel. “We think it’s important to understand the context of occupation,” she told Haaretz. “It is terrifying to me that I don’t see [Israeli] leaders presenting a clear strategy besides violence,” she said. “We feel a shared sense of urgency that members of the Jewish community need to publicly oppose the operation in Gaza. “
Passers-by were not impressed. One middle-aged woman, who was walking toward the UN with a man wearing a black kippah said, when asked what she thought of the anti-war protesters, “they make me nauseous. I want to vomit on them.”
After lighting yartzeit candles and placing stones in the center of their semi-circle, nine of the protestors entered the office building and sat down in the lobby in an effort, organizers said, to get Malcolm Hoenlein, executive vice-chairman of the Presidents’ Conference, to come speak with them, though he was likely not even in the building at the time. Within a few minutes, about a dozen police officers arrested the protesters, putting them in plastic zip-tie handcuffs and leading them into waiting police vans.
Keep updated: Sign up to our newsletter
Email*
Please enter a valid email address
Please wait…
Thank you for signing up.
Oops. Something went wrong.
Thank you,
Rabbi Joel and Rochelle Oseran passed by as the anti-war demonstration wound down, on their way to a meeting at the Union for Reform Judaism, which is housed in the same office building. The couple, who live in Jerusalem and have three sons serving in the intelligence section of the Israeli Defense Forces, began asking Zimmerman what their rally was about.
“We’re protesting the actions of the Israeli army,” said Zimmerman, who works as a community organizer in New York City.
“You’re not against Hamas?” said Rochelle Oseran, who is a Lamaze teacher trainer in Jerusalem. “We feel awful for the Gazans. But Hamas is to blame.”
“You can criticize Israel but you can’t stop there,” said her husband. They were in New York to officiate at a wedding. “Otherwise we never would have left now,” said Joel, vice president for development of the World Union for Progressive Judaism. After sharing with them that she has close relatives and friends in Israel, Zimmerman walked away. “I felt like that having that heated disagreement with them wouldn’t be productive,” she said later, “so I shared my feelings and I left.”
Joel Oseran, who greeted another of the anti-war rally participants, the son of one of his rabbinical colleagues, said that their demonstration against Israel’s Gaza operation “is just so naïve. They have good intentions but are really off base.”
Meanwhile, on East 42nd Street, people were streaming toward the UN and the larger crowds that had begun to amass there. One man walking east wore a t-shirt bearing the logo of the IDF.
Anti-Gaza war protest in New York City, July 28, 2014.Debra Nussbaum Cohen
Haaretz.com, the online edition of Haaretz Newspaper in Israel, and analysis from Israel and the Middle East. Haaretz.com provides extensive and in-depth coverage of Israel, the Jewish World and the Middle East, including defense, diplomacy, the Arab-Israeli conflict, the peace process, Israeli politics, Jerusalem affairs, international relations, Iran, Iraq, Syria, Lebanon, the Palestinian Authority, the West Bank and the Gaza Strip, the Israeli business world and Jewish life in Israel and the Diaspora. | 2024-05-15T01:26:29.851802 | https://example.com/article/2516 |
Security will be beefed up at the embassies of France, Great Britain, and Italy, while the same will apply to all French, Italian, and British interest companies in Greece.
Meanwhile Greek Police are in contact with the French authorities in order to exchange data and see if jihadists in France have connections with other jihadists in Greece. So far, suspects of terrorism activities have been investigated by Greek authorities but no information has been given to the press.
Likewise, EYP are in constant contact with their counterparts in France, Italy, and Great Britain, along with other European intelligence services. Also the Counter-Terrorism Unit will investigate the online and telephone communications of refugees originating from Syria.
No Greek citizens among victims of deadly attack
There are no Greek citizens among the victims of the Paris ISIS attack, according to a statement by the Greek foreign ministry and the Greek Embassy in Paris.
No deaths or injuries of Greeks were reported at the Greek Embassy in the French capital. However the embassy has put in effect an emergency telephone line for Greek nationals in France.
Uncertainty over the financial future of Greek football giants Panathinaikos Athens continues, after Dimitris Giannakopoulos, the major shareholder and owner of the basketball team of Panathinaikos informed…
Uncertainty over the financial future of Greek football giants Panathinaikos Athens continues, after Dimitris Giannakopoulos, the major shareholder and owner of the basketball team of Panathinaikos informed… | 2024-06-11T01:26:29.851802 | https://example.com/article/5122 |
What happened to mass adoption of virtual and augmented reality? Watch Now
Virtual reality (VR) is moving from games to work, but on the Linux desktop it's had a hard row to hoe. While many VR peripherals and head-mounted display (HMD) support Linux, some "supported" games have trouble running on Linux. VR gaming on Linux is getting better. But if you wanted to use a Linux desktop via VR, you were out of luck. Your luck may be turning now with the xrdesktop.
Xrdesktop is an open-source project. It's designed to let you work with traditional desktop environments, such as GNOME and KDE, in VR. It does this by making window managers aware of VR. It then uses VR runtimes to render desktop windows in 3D space. Once there, you'll be able to work on the desktop using VR controllers in place of a mouse and keyboard.
This program is being created with the backing of Valve, a game company, which has long supported Linux with its Steam gaming platform. Valve -- I'm sure you won't be surprised to learn -- is heavily involved with VR and shepherds OpenVR, an open VR application programming interface (API).
Xrdesktop isn't the only project seeking to bridge the gap between VR and the desktop. For example, Safespaces is a 3D/VR desktop environment for the Arcan display server. But, as even Safespaces developers admit, it can strain your eyes and you should "Keep a vomit-bucket nearby."
Of course, xredesktop is also a work in progress. To get it to work seamlessly with existing X11/Wayland compositor/window manager you need a specific graphics driver and some tuning with both GNOME and KDE.
Still, this is a step towards making VR work and play well with the traditional Linux desktop. Thus, you won't need to run a dedicated VR compositor. According to Lubosz Sarnecki, a xendesktop developer, "This integration of xrdesktop into the window managers enables mirroring existing windows into XR [extended reality] and to synthesize desktop input through XR actions. xrdesktop can be run as a dedicated scene application, but it also features an overlay mode, where desktop windows are overlaid over any other running VR application."
Want to give it a whirl? You can find installation instructions on xrdesktop Wiki. The program is available in packages for Arch Linux and Ubuntu Linux. You can also install it on other distributions, but you'll need to install xrdesktop from source.
Related Stories: | 2024-01-20T01:26:29.851802 | https://example.com/article/2318 |
Taknyó Valley
Takanyó Valley is a valley between Hosszúhetény and Komló (Zobákpuszta) at the Northern part of Hármashegy, in the Eastern Mecsek. Mecsek, Hungary.
Spring of Stream Völgység, main watercourse of the Eastern Mecsek is just above the valley.
Springs
Spring Csengő
Spring Takanyó
Fauna
there are some highly protected bird species which hatch their nests here.
Sources
External links
Fotó
Category:Landforms of Hungary
Category:Valleys of Europe | 2023-11-16T01:26:29.851802 | https://example.com/article/6288 |
Laboratory heterogeneity of the lupus anticoagulant: a multicentre study using different clotting assays on a panel of 78 samples. Hemostasis Committee of the "Société Française de Biologie Clinique".
The laboratory heterogeneity of the lupus anticoagulant (LA) was investigated in a multicentre study using a panel of 78 plasma samples diagnosed as containing a LA. Consecutive samples were collected by 12 participants using various screening tests, and sent to 7 laboratories which performed one or more clotting assays among the following: activated partial thromboplastin time (APTT), dilute Russell viper venom time, kaolin clotting time (KCT), dilute tissue thromboplastin time (dTTI) and a platelet neutralization test. For APTT and dTTI, 10 versions of these tests including standard and mixing procedures were carried out. They varied by reagents, phospholipid concentration or methodology. Cut-off times were determined for each test by comparing the results of the panel to those of a control population. When the data of all clotting assays were pooled, 70 of the 78 selected plasmas were considered to contain LA, 15 of them having a low-titer inhibitor. Sensitivity, defined as the proportion of positive results among LA-containing plasmas, varied from 62 to 100% and was positively related to responsiveness (defined as the mean ratio of clotting time to cut-off time). Laboratory heterogeneity of LA-containing plasma was illustrated by a star symbol plot analysis. Different populations of samples, with LA preferentially recognized by one assay (or group of assays) irrespective of the overall sensitivity of this assay, were identified. Multiple component analysis demonstrated the heterogeneity of low-titer inhibitors, which complicates their recognition in routine laboratory investigation. | 2024-04-27T01:26:29.851802 | https://example.com/article/4139 |
Cash for Textbooks
Browse related Subjects
Why do smart people make irrational decisions every day? The answers will surprise you. Predictably Irrational is an intriguing, witty and utterly original look at why we all make illogical decisions. Why can a 50p aspirin do what a 5p aspirin can't? If an item is "free" it must be a bargain, right? Why is everything relative, even when it shouldn't be? How do our expectations influence our actual opinions and decisions? In this astounding book, behavioural economist Dan Ariely cuts to the heart of our ...
Read More
Why do smart people make irrational decisions every day? The answers will surprise you. Predictably Irrational is an intriguing, witty and utterly original look at why we all make illogical decisions. Why can a 50p aspirin do what a 5p aspirin can't? If an item is "free" it must be a bargain, right? Why is everything relative, even when it shouldn't be? How do our expectations influence our actual opinions and decisions? In this astounding book, behavioural economist Dan Ariely cuts to the heart of our strange behaviour, demonstrating how irrationality often supplants rational thought and that the reason for this is embedded in the very structure of our minds. Predicatably Irrational brilliantly blends everyday experiences with a series of illuminating and often surprising experiments, that will change your understanding of human behaviour. And, by recognising these patterns, Ariely shows that we can make better decisions in business, in matters of collective welfare, and in our everyday lives from drinking coffee to losing weight, buying a car to choosing a romantic partner.
Read Less
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972. Used books may not include companion materials, some shelf wear, may contain highlighting/notes, may not include cd-om or access codes. Customer service is our top priority!
Customer Reviews
Great book
Great book at a good price. Very good. Real good. Yes, yes, yes, yes, yes
Cosma Alexandru
Aug 16, 2012
Love it!
I loved riding this book. Easy to read and easy to understand and to get an insight in a complicate issue of making decision.
WayneBNorris
Feb 10, 2011
Excellent recap of human frailties
I want to know how Ariely got his job!!! I want one just like it.
The book is a light skim over the very serious subject of Behavioral Economics, and as such, has stuff of great value to anyone in sales, marketing, or the human race. It is the deeper aspects he did NOT address that I find profound, and surprising for his not having mentioned them.
For example, he shows how humans routinely make miscalculations about economic value, using endearingly simple experiments. Not stated are how such experiments could have been done decades, or even centuries earlier, and how they would have changed the modern [dare we call it] science of economics in profound ways. Also, we are not treated to cross-cultural experimental results - a significant shortcoming, notably since both Dan and at least half his co-researchers are not American by background.
This book should be read along with [at minimum] Fooled By Randomness and The Black Swan by Nassim Taleb and Blink and Tipping Point by Malcolm Gladwell. Dan is on to something here, and needs to flesh out this work with another book.
JFB19012
Sep 27, 2008
Monumental Impact
Behavioral psychology and, specifically, behavioral economics (the subject of this book) clearly have much to offer us all in understanding our business and personal relationships and for developing better ways to collaborate and be effective as individuals, organizations, and as a nation. Dr. Ariely has presented what is obviously a mountain of research and experimentation in a way that is easy to understand, easy to take in and assimilate with your existing knowledge, and easy to see how it will play into other areas of your life. The recording was excellent, although the reader's British accent was a bit strong at times. Overall, this was an exciting and stimulating book to hear and I'll be buying the book for reference again.
kingkong
Sep 25, 2008
For business marketing and psychology
This book is written by a economy professor whose interest is in economical behavior. It is easy to read; it's like novel. It tells stories and it's like giving lecture on the book. It's suitable for business in terms of marketing, and psychology in terms of decision making.
Alibris, the Alibris logo, and Alibris.com are registered trademarks of Alibris, Inc.
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited, Baker & Taylor, Inc., or by their respective licensors, or by the publishers, or by their respective licensors. For personal use only. All rights reserved. All rights in images of books or other publications are reserved by the original copyright holders. | 2024-02-20T01:26:29.851802 | https://example.com/article/2622 |
1897–98 Southampton F.C. season
The 1897–98 season was the 13th since the foundation of Southampton F.C. and their fourth in league football, as members of the Southern League.
The club improved on their performance in the previous successful season, retaining the Southern League title and reaching the Semi-final of the FA Cup for the first time, where they went out in controversial circumstances. They started the season as tenants of Hampshire County Cricket Club, but by the end of the season, the club had found a new permanent home, where they were to remain for over 100 years.
By the end of a "phenomenally successful", Southampton were lifted out of relative obscurity into national prominence. In their report to the shareholders for the Annual General Meeting held on 30 June 1898, the directors commented: "The team's performance in the English Cup and their retention of the Southern League Championship entitled the club to rank among the best in the country".
Pre-season
Following the incorporation of the limited company in July 1897, the club had dropped "St. Mary's" from their name and henceforth would be known simply as "Southampton Football Club". One local reporter lamented:No longer will football enthusiasts be able to call out "Buck up Saints!" No longer will reporters with a flowery style be able to write of the "Saintly ones". For the Football Association has acceded to the request of the powers, and the club will in future be known as Southampton Football Club.
The Saints are dead. Long live Southampton!
Despite this, the press and club supporters continued to refer to the club as "the Saints", as they have done ever since.
Once again, the board recruited several players from Football League clubs, most prominent of whom was Arthur Chadwick who was to remain with the club as a player for three years, returning in 1925 as manager.
League season
The 1897–98 season was the Saints' fourth in the Southern League, having finished as champions in the previous season.
The season started badly, with a defeat at Tottenham Hotspur, but Southampton won the next three matches, all away from home. The first home match of the season came on 23 October, when Southampton gained their revenge against the Spurs, with a 4–1 victory. The next five matches were also victories before a poor defeat at Bristol City on 22 January. After a draw at Chatham, a run of eight victories gave the Saints the title, despite a home defeat to Chatham Town on the last day of the season; this was Southampton's first home league defeat for three years.
In the draw at Chatham on 5 February, a small piece of history was made as the former Ireland and England international, Jack Reynolds made his first appearance for Southampton, thus becoming the first international player to appear for the side. He only made one further appearance before dropping down to lower league football.
Despite the success on the pitch, there was considerable disharmony in the dressing room, especially regarding the behaviour of Jack Farrell; he had been ordered out of a board meeting and suspended for two matches early in the season having used "abusive language" during a discussion of his grievances. Other players in trouble included new signings Tom Nicol, who was obliged to apologise to the board for his behaviour, and Bob Petrie, who was reprimanded over his drinking. In November, Watty Keay asked to be relieved of the captaincy, which was being rotated among the players on a monthly basis; he advised the board that he "was not comfortable in that position, there being so much dissension amongst the players."
League results
Legend
Top of league table
Played = Matches played; Won = Matches won; Drawn = Matches drawn; Lost = Matches lost; F = Goals for; A = Goals against; GA = Goal average; Points = Points scored
1 Teams tied on points were separated by use of goal average.
2 The points system: 2 points for a win, 1 point for a draw and 0 points for a defeat.
FA Cup
Southampton entered the 1897–98 FA Cup tournament at the Third Qualifying Round, where they met their Southern League rivals, Bristol City. Robert Buchanan scored after only ten seconds from when the Saints were in complete control with Yates adding a second goal to complete a 2–0 victory. The next match, at Swindon, was won by half-time while Eastville Rovers were comprehensively defeated 8–1 in the final qualifying round, with Yates, Buchanan, Keay and Turner each scoring twice.
In the First Round proper, Southampton entertained Leicester Fosse, then lying seventh in the Football League Second Division. In preparation for the match, the entire team were sent to Shawford for a week for additional training under the supervision of Bill Dawson. Saints achieved a "fine win" with Meston and Buchanan scoring in a 2–1 victory; this was the first time that a Southern League club had ever defeated opposition from the Football League.
The reward was another home tie against another team from the Second Division, Newcastle United. As a result of a dispute with the landlady of the Shawford lodgings, the directors decided to take the players out each evening to sample the entertainments on offer in Southampton, which included an evening at the Philharmonic Hall and visits to the Empire Music Hall and the Prince of Wales theatre. These evenings helped maintain the team's morale resulting in a 1–0 victory over their league opponents.
By this time, the local press were speculating that Southampton could reach at least the semi-final stage of the competition, with one commentator expressing the opinion: "if the present rate of progress is maintained we shall yet see our champions in the final at the Palace." The draw for Round Three was against Bolton Wanderers of the Football League First Division, away. The national press predicted an easy home victory, with Bolton expected to put paid to "the parrot cries concerning the great improvement in the game south of the Thames." In preparation for the match, the board sent the players together with Dawson to Matlock Bath to stay at the Chesterfield House Hydro for a week of special training. Each player was on an £8 bonus for a win and £5 for a draw.
At Burnden Park, they were greeted by at least 300 Southampton supporters who had arrived in a special train run by the Didcot, Newbury and Southampton Railway Company. The journey took eight hours each way, with the round trip lasting 28 hours, at a cost of 10s. The supporters were rewarded with a goalless draw, described by The Daily Telegraph as "the biggest surprise of the day".
The replay took place at the County Ground on the following Wednesday afternoon in front of a crowd estimated at between 12,000 and 15,000, netting gate receipts of £532. To the surprise of the national press, Southampton put on "an outstanding display" to win 4–0. At one stage in the match, the hugely partisan crowd spilled onto the pitch, with the match having to be halted temporarily. The Daily Mail was duly impressed:Southampton's success against Bolton Wanderers marks the dawning of a new era for professional football in the South, and it is now becoming more and more evident that absolutely first-class football is not to be for ever monopolised by the Northern organisations. While lamenting methods by which this condition of things has been brought about – that is to say, the hiring of aliens – one cannot escape a feeling of gratification that the South is at last holding its own once more.
This victory set up a semi-final tie with another First Division club, Nottingham Forest, which would turn out to be one of the most controversial in the history of the FA Cup to date.
The semi-final
When the draw for the semi-finals was made, The Football Association decided that the Derby County vs. Everton tie should be at Villa Park while Southampton and Forest would go to Sheffield United's Bramall Lane. This prompted the Southampton board to formally request that the FA switch the venues, to reduce the travelling for supporters of all four clubs. The FA's response was minuted in the Southampton board meeting held on 11 March: "Letter from F.J. Wall (secretary of the FA) saying Association could not see their way to change the grounds in the English Cup semi-finals".
Once again, the players were sent to Matlock Bath for a week of special training. In the match at Bramall Lane, Forest took the lead after only five minutes with a goal from Len Benbow. Following a collision with the Forest goalkeeper, Southampton's centre-forward Jack Farrell was reduced to a passenger for the remainder of the match; despite this, Southampton equalised through Harry Haynes to earn a replay at Crystal Palace.
The replay on 23 March was played in a blizzard. After a scoreless first half (in which Joe Turner missed a penalty for Southampton), in the second half Saints were on top when, with ten minutes left to play, referee John Lewis stopped the match for a time and the players left the pitch. When the match restarted, according to one report: "hardly had the players taken up their positions again when the snow recommenced with redoubled fury, and the Forest, assisted by the blizzard, put on a couple of goals in the last minutes". Another account claimed that the Saints' goalkeeper, George Clawley had his eyes "choked with snow" when he conceded the two goals. All reports of the match confirm that the storm was worse when the two goals were scored than when the players were taken from the pitch. Forest's goals came from Tom McInnes and Charlie Richards, as Forest went on to defeat Derby County in the final.
The Southampton board immediately lodged a protest with the Football Association, and there were numerous letters of complaint to both the national and local press. Despite the protests, the F.A. decided that the result should stand – this was perhaps not surprising as Lewis was an eminent member of the F.A. board. Some spectators objected to Southampton's protests, including one who wrote to the Morning Leader : The demoralising effect of an imported team of mercenaries was evident in the behaviour of the southern partisans at the Crystal Place on Thursday. Anything more unsportsmanlike it would be difficult to conceive.
FA Cup results
New stadium
Since 1896, Southampton had been tenants of Hampshire County Cricket Club at the County Ground, having vacated the Antelope Ground in the summer of 1896. The rent payable to the cricket club (£200 p.a.) was putting a strain on the football club's finances and, in an attempt to reduce this burden, the club had considered a merger with the Freemantle club and a move to their ground in Shirley. The merger proposals had fallen down, but at the Extraordinary general meeting in June 1897, the members were informed that "the committee had a ground in view".
At a shareholders' meeting on 11 November 1897, the chairman stated:. . . that all being well, by next season the company would be in possession of its own ground which was at the present time in the hands of George Thomas Esq. who was devoting his time to its early completion. Although the minutes do not record the location of the new ground, it was common knowledge within the town that the new ground was situated. . . in the dell that is not far from the County Ground, and nearer West Station and the town, and at the present time it is a narrow valley with a stone culvert running along the bottom. It will not be a large ground, but the natural banks on all sides will be a great help in arranging for the convenience of the spectators.
The site on which the ground was built was described in Philip Brannon's Picture of Southampton, published in 1850, as "a lovely dell with a gurgling stream and lofty aspens"; the stream is the Rollsbrook which flows out of Southampton Common, running parallel to Hill Lane before now disappearing under Commercial Road and the Central Station, from where it is conduited under Southampton Docks into Southampton Water. The land had been purchased in the 1880s by the Didcot, Newbury and Southampton Railway to enable them to continue the line from Shawford via Otterbourne and Bassett into Shirley (it is often incorrectly supposed that a station was to be situated in what is now St. James' Park, opposite St. James' Church). From here the line would have travelled south across Hill Lane to run through the dell and then on an embankment and viaduct over Commercial Road and the London and South Western line before terminating on the Western Esplanade at the foot of Arundel Tower. The dell was stripped of vegetation and the stream channelled into a conduit with work started on the embankment and viaduct, before the project was abandoned and the D.N.S.R. obtained running rights over the L.S.W.R. from Winchester into Southampton.
Construction
George Thomas, a fish merchant who had been appointed as a director of the limited company when it was formed in the summer of 1896, who lived in Shirley, saw the potential of the cleared site and purchased the land from the D.N.S.R. By the beginning of the 1898–99 season, Thomas had incurred expenditure of between £7,500 and £9,000 on acquiring and clearing the site, and erecting the new stands and had agreed an initial three-year lease to the football club at a rental of £250 p.a. The dell had been drained with 13,000 ft of pipe being laid, all draining into the central culvert formed from the Rollsbrook stream. The playing field had to be levelled and the ground made up and turfed ready for the opening of the new season. On completion, the stadium was described in the Southampton Observer:. . . the rising staging on the north side of the ground will hold 5,500 spectators, who have of course to stand up; the covered east and west stands will seat 4,000 spectators comfortably, and the staging and sloping bank on the south side will hold 15,000 spectators. This totals up to 24,500.
At this stage, the new ground did not have an official name, with various names suggested including "the Fitzhugh Dell", "The Archer's Ground" and "Milton Park" but gradually the ground became known by default as "The Dell".
Player statistics
Key
GK — Goalkeeper
FB — Full back
HB — Half back
FW — Forward
Transfers
In
Departures
References
Bibliography
External links
Southampton football club match record: 1898
All Southampton football club players: 1898
Category:Southampton F.C. seasons
Southampton | 2023-09-27T01:26:29.851802 | https://example.com/article/5246 |
Cornelius P. Cotter
Cornelius (Neil) Philip Cotter (March 18, 1924 – July 12, 1999) was an American professor of political science. His research focused on civil rights and American political parties.
Early life and education
Cotter was born in New York City to family involved in local politics. (His parents were reform Democrats; Cotter would later join the Republican Party.) He did not finish high school, but worked on the docks during World War II. After an injury, he spent a year in the hospital before enlisting in the Navy in 1943. Cotter served in the Marshall Islands, assigned to managing records of military trials.
Taking advantage of the G.I. Bill, Cotter received a A.B. degree from Stanford University in 1949. He went on to earn a Masters of Public Administration (1951) and Ph.D. (1953) in Public Administration from Harvard University. While he attended school, he supported himself and his family as the business manager of a New Jersey summer theater company. He completed further studies at the London School of Economics as a Sheldon Traveling Fellow in 1951-1952.
Career
Academia
In 1952-1953, Cotter taught as an instructor at Columbia University. In 1953, he joined the faculty of Stanford University, where he became an associate professor in 1956. In 1963, he joined the faculty of Wichita State University as a department chair. He moved to the University of Wisconsin–Milwaukee in 1967, where he was department chair from 1969-1972 and associate dean for graduate research from 1973-1975. He retired in 1989.
He conducted research about American political parties and institutional change, including work (with John F. Bibby) on a National Science Foundation grant, "Party Transformation in the United States and the Institutional Party" (1978-1981). The research from this grant was written up in many articles and in a book, Party Organizations in American Politics (1984).
In 1968, he published Jet Tanker Crash: Urban Response to Military Disaster, about the 1965 USAF KC-135 Wichita crash, which he witnessed. He followed up on the disaster by documenting the accident report and ensuing lawsuits.
Political work
Cotter is noted as the executive director of the Republican Committee on Program and Progress. The committee was established in 1959 by Meade Alcorn, then the Republican National Chairman. President Dwight D. Eisenhower and other party leaders were concerned that the GOP would be defeated at the polls in 1958 unless they could articulate their policy positions. The committee, which consisted of 44 Republicans from various backgrounds, was chaired by Charles H. Percy, president of Bell and Howell.
Cotter was named a Republican National Committee Faculty Fellow in 1959. In 1960, he was also an assistant to Meade Alcorn, then the chairman of the Republican National Committee, and his successor, Senator Thruston Ballard Morton.
President Eisenhower appointed Cotter to the staff of the U.S. Civil Rights Commission in 1960. He worked with the commission on research and hearings, particularly in the South, until 1963. He continued to work with the Civil Rights Commission after moving to Wisconsin, serving on the state advisory committee.
Personal life
Cotter married to Beverly Blair Cook in 1966. She was also a notable professor of political science at the University of Wisconsin–Milwaukee. They raised 8 children and step-children.
He died in 1999 after sustaining injuries in a car crash.
Bibliography
Cotter's works include:
Party Organizations in American Politics (Praeger, 1984), co-authored with James L. Gibson, John F. Bibby, and Robert J. Huckshorn
"The Black student in the Wisconsin State universities system" (1971), United States Commission on Civil Rights, Wisconsin State Committee
Practical Politics in the United States (Allyn and Bacon, 1969), co-authored with Herbert E. Alexander
Jet Tanker Crash: Urban Response to Military Disaster (University Press of Kansas, 1968)
Politics Without Power: The National Party Committees (first published by Atherton Press, 1964), co-authored with Bernard C. Hennessy
"Civil Rights '63" (1963), primary author
"Freedom to the Free" (1963), primary author
"50 States Report" (1961), primary author
Issues of the Sixties (Wadsworth, 1961), co-authored with Leonard Freedman
Government and Private Enterprise (1960)
Powers of the President During Crises (Da Capo Press, 1960), co-authored with John Malcolm Smith
References
External links
Papers of Cornelius P. Cotter, 1959-1961, Dwight D. Eisenhower Presidential Library (contains records pertaining to the Republican Committee on Program and Progress)
Cornelius P. Cotter papers, 1949-1958, New York Public Library Archives (contains records of summer stock theater company productions)
Typical correspondence issued by Cotter as the Executive Director of the Republican Committee on Program and Progress
Category:Stanford University Department of Political Science faculty
Category:American political scientists
Category:1934 births
Category:1999 deaths
Category:John F. Kennedy School of Government alumni
Category:Stanford University alumni
Category:University of Wisconsin–Milwaukee faculty | 2024-02-27T01:26:29.851802 | https://example.com/article/2137 |
Photo
Women chant slogans, give the victory sign and display photographs of detained persons during a rally calling for the release of Palestinian prisoners jailed in Israel, in the West Bank city of Nablus, Monday, Feb. 18, 2013. Israel is holding some 4,500 Palestinians for charges ranging from throwing stones to undertaking deadly militant attacks. Their incarceration is a sensitive issue for Palestinians, who see them as heroes of the Palestinian liberation struggle. (AP Photo/Nasser Ishtayeh)
/ AP | 2024-02-06T01:26:29.851802 | https://example.com/article/4626 |
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<title>Namespace::PrivateBase class | My Project</title>
<link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Source+Sans+Pro:400,400i,600,600i%7CSource+Code+Pro:400,400i,600" />
<link rel="stylesheet" href="m-dark+documentation.compiled.css" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
</head>
<body>
<header><nav id="navigation">
<div class="m-container">
<div class="m-row">
<a href="index.html" id="m-navbar-brand" class="m-col-t-8 m-col-m-none m-left-m">My Project</a>
</div>
</div>
</nav></header>
<main><article>
<div class="m-container m-container-inflatable">
<div class="m-row">
<div class="m-col-l-10 m-push-l-1">
<h1>
<span class="m-breadcrumb"><a href="namespaceNamespace.html">Namespace</a>::<wbr/></span>PrivateBase <span class="m-thin">class</span>
</h1>
<p>Private base class, should not list any derived.</p>
</div>
</div>
</div>
</article></main>
</body>
</html>
| 2024-01-06T01:26:29.851802 | https://example.com/article/9017 |
<!DOCTYPE HTML>
<html>
<head>
<script src="http://code.jquery.com/jquery-latest.min.js"></script>
<script src="build/jaydata.js"></script>
<script>
$(function() {
$data.Entity.extend("My.Entity", {
id: { type: "int", key: true, computed: true },
name: { type: "string" }
});
$data.EntityContext.extend("My.Context", {
Entities: { type: $data.EntitySet, elementType: My.Entity }
});
var c = new My.Context({name: "sqLite", databaseName: "new items"});
c.onReady( function() {
c.Entities.add(new My.Entity({name: Math.random()}));
c.saveChanges(function() {
$('#output').append($('<div>new item saved</div>'));
c.Entities.forEach( function(e) {
$('#output').append($('<div></div>').text('Id:' + e.id + ',name:' + e.name));
})
})
});
});
</script>
<title></title>
</head>
<body>
<div id="output">
</div>
</body>
</html> | 2023-09-17T01:26:29.851802 | https://example.com/article/3898 |
// Copyright (c) .NET Foundation and contributors. All rights reserved. Licensed under the Microsoft Reciprocal License. See LICENSE.TXT file in the project root for full license information.
using WixToolset.Simplified.Test.Utility;
using Xunit;
namespace WixToolset.Simplified.Test
{
public class AppxTests
{
[Fact]
public void BackgroundTask()
{
AppxVerifier verifier = new AppxVerifier().Load("Data\\appx\\backgroundtask");
verifier.Verify("backgroundtask");
}
[Fact]
public void Charms()
{
AppxVerifier verifier = new AppxVerifier().Load("Data\\appx\\charms");
verifier.Verify("charms");
}
[Fact]
public void VersionWithInsignificantZeros()
{
AppxVerifier verifier = new AppxVerifier().Load("Data\\appx\\version_with_insignificant_zeros");
verifier.Verify("version_with_insignificant_zeros");
}
[Fact]
public void Wwa()
{
AppxVerifier verifier = new AppxVerifier().Load("Data\\appx\\wwa");
verifier.Verify("wwa");
}
}
}
| 2024-07-08T01:26:29.851802 | https://example.com/article/6207 |
vti_encoding:SR|utf8-nl
vti_timelastmodified:TR|02 Apr 2003 20:58:08 -0000
vti_extenderversion:SR|4.0.2.4426
vti_backlinkinfo:VX|hapi/conf/compiler_manual/faq.htm
| 2023-11-15T01:26:29.851802 | https://example.com/article/3829 |
Finance Related SDGS
13.a Implement the commitment undertaken by developed-country parties to the United Nations Framework Convention on Climate Change to a goal of mobilizing jointly $100 billion annually by 2020 from all sources to address the needs of developing countries in the context of meaningful mitigation actions and transparency on implementation and fully operationalize the Green Climate Fund through its capitalization as soon as possible.
17.1 Strengthen domestic resource mobilization, including through international support to developing countries, to improve domestic capacity for tax and other revenue collection
17.2 Developed countries to implement fully their official development assistance commitments, including the commitment by many developed countries to achieve the target of 0.7 per cent of gross national income for official development assistance (ODA/GNI) to developing countries and 0.15 to 0.20 per cent of ODA/GNI to least developed countries; ODA providers are encouraged to consider setting a target to provide at least 0.20 per cent of ODA/GNI to least developed countries
CONTRIBUTIONS FROM AROUND THE WORLD
This space for discussion ends tonight. As one of the Moderators, I want to thank all of you for your interest and for sharing your viewpoints on Water, which is at the core of the sustainable development. Kind regards
In my opinion the clean energy is the most important environment development for the next decades in the cities. Because the pollution in the urban centers have made diseases in the people.The growth of the cars in the cities, the growth of the industries, the demograph groth, the growth of pollution in cities will make the people to change their habits for the environment.
In my opinion the clean energy is the most important environment development for the next decades in the cities. Because the pollution in the urban centers have made diseases in the people.The growth of the cars in the cities, the growth of the industries, the demograph groth, the growth of pollution in cities will make the people to change their habits for the environment.
In my oppinion the Oportunities will are the Education for this new sustentable development and the news technologies, inovation and criative solutions.
The Challenge? Who, What, Whose, When, Where will finance these new solutions and these news inovations.
The Oportunities: Dissemination water legislation for all, creating and participating in river basin commitees, at meetings, increasing social participation in planning of the watersheds.
The Challenge? Who, What, When, Which, Where will born new technologies and new methods of educations and participation for the people in the watersheds and the New Midias (TVs programs, others technologies), the system of monitoring the quality and amount of rivers in watersheds, the plans of watersheds and the actions and projects of recuperation of rivers and Ecosystems (the Ecosystems of the watersheds), will made new Biofuels and new Biodigesters. The human resources for researchs in the planet would be create for digital work (on line) for various projects in many Universities in the countries. The multidisciplinary work and the interdisciplinary work will be very important for the researchs climate change in next years. Reuse of water in homes and building, use of rainwater too. This depends of Legislation and technical standarts for this reuse. One Challenger too: the planning of the buildings of the cities. The industries too, the reuse and use of rainwater in the production line. Planning.
Satisfaction to be able to talk with everyone, about the topics that were raised during the discussions and presentations by all participants of the His Voz Portal.
I would like to ask all the Moderators and those responsible for the Your Voices Portal of the 8th World Water Forum to keep the portal open during the presentations, discussions and after the presentations of the proposals by the participants in the Portal, the presentation of the contributions to the President of the World Water Forum and all representatives of the participating countries.
I believe that these actions will serve to change the reality of several countries, including Brassil and the Federal District, that cross water and social crises, taking from the vulnerability, populations that need not only the governmental and international financial resources, to reverse the calamity (floods - deaths that could be avoided), as well as to give people and society the opportunity to accompany the governments and the actions taken at the 8th World Water Forum - to be held in Brasília - Federal District, so that we necessary resources, voice and time to accompany and have greater social control over governmental resources - permanent projects and programs aimed at guaranteeing quality water for all the families of the planet, thus raising human dignity, with studies, use of new technologies, the presenvation of the springs, water courses, areas of permanent preservation.
Therefore, believing in the condition of ensuring that the Seu Voz Portal is maintained after the 8th World Water Forum, I place the entire disposition of those responsible for forming a working group of organized civil society, socio-environmental entities, members of the Academies, Government , Entrepreneur, to follow the results of the deliberations in each country participating in the 8th Forum, to guarantee financial resources, development of projects and programs for water resources.
Certain of being contemplated in my requests, I put the whole disposition with my Students of the Center of High School Taguatinga North - Brasília - Federal District.
Report on the participation of the Students of the Taguatinga Norte High School - Brasília / Federal District, during the 5th National Conference on the Youth and Environment of the Federal District, coordinated by the Education Department of the Federal District , where they had the great opportunity to participate in the event, enriching the knowledge, which had as its theme: Let's take care of Brazil, taking care of the waters.
Taguatinga North High School
Professor Coordinator: Davi Silva Fagundes
I Report of the participation of the Students of the Taguatinga Norte High School in the Fifth National Conference of the Children and Youth of the Environment of the Federal District
Location: EAPE - School of Improvement of Education Professionals of the Federal District
Date: 2/27/2018 Shift: Daytime
Both in the programming of the thematic workshops and in the lectures given by the organs present on the first day of the V CNIJMA - National Youth Children's Conference of the Federal District, we could see not only the presentation and discussion of the theme of this year "Let's take care of the Brazil taking care of the waters, "but we could also have contact with projects already carried out in schools in the Federal District and others that are still in this process, and this we saw through those responsible for the event and also through the contact with other DF institutions present, some of the principles presented by the Youth Collective of the Federal District: "Youth educates young people" and "one generation learns from the other".
On that first day, we could also see in a very comprehensive way, not only for the theme, but also for being a major problem today our protagonist "the water".
We became aware of problems that result in water scarcity, such as population increase, irregular systems for water capitation, poor use of water by the population, being in a larger domestic area, but also having great relevance in the industrial and agricultural areas.
Soon after the presentation of these problems, some solutions have been put in place, some of which are already being implemented and others that unfortunately are far from being considered by our current government. And being our preparation as one of the objectives of this conference, during the whole process in that first instant we were instructed to the future stages (new conferences), by the question "how to elaborate a project?". Question that was answered in four steps.
Finally, in the thematic workshops, being the red color used by the CEMTN Students (a way that the organizers of the event used to separate groups of young people in these thematic workshops), I could be more aware of the true situation that we are living today in the scarcity of water resources, that from the mistaken thoughts of years ago today we live this reality that water is finite and that every day we are closer to your lack and further away from taking action to avoid this.
And beyond this awareness in workshops, we were able to put projects in practice, such as composting, we understand better about recycling and its importance and how it affects the lives of many waste pickers.
As a result of this first day, we could see that the environment directly affects our society in everything from quality of life to economic and social development, among others.
I'm a medical doctor in France but I'm Also very concern by the huge problem in Africa. The drinkable water distribution model is based on plastic in many cities. A lot of people drink water in plastic bottle or, worse, in little plastic waterbags That Provide an enormous pollution by contaminating the rivers and the oceans. They poison the human directly too, because some of them are filled in an artisanal way and because all of them transmit endocrine disruptors.
I'm managing a crew of Associates, French and African people, who want to change that. We are creating a company in West Africa to produce reusable water in gallons that we will be able to be delivered in each home without a waste.
We are now looking for financial investements to Achieve the building of our first factory. If somebody in the water forum is interessed, just contact me.
In Ecuador, the Water Secretariat and national government start a program named "Water and Sanitation for all" and will invest 2 billion dollars that will be focused on rural zones.
I think there is 2 challenges, the first one mentioned above, corruption in the water sector of Ecuador involves a lot of corruption cases (Odebrecht and more). The second, the national capabilities for supervision and control of adequate use of the money resources at local level. We have a lot of examples of investment in infrastructure that have never worked.
In fact, there is a very important subject that I hope will be taken into account and discussed in detail during the 8th World Water Forum in Brazil. This subject is the use of the water infrastructure as a tool for war. This is what has happened in countries that have suffered from terrorism and still need international and regional support for the rehabilitation of their water infrastructure. My country Iraq is one of these countries, we still suffer from the inability to rehabilitate our dams and barrages because we spent our financial source to fight the terrorist organization (Daesh).
At the central level, Hon.Prime Minister, Mr. Modi has already taken two dramatically important steps: he has streamlined energy decision-making, and also environmental decision-making. India’s Ministry of Environment and Forests is now the Ministry of Environment, Forests and Climate Change...Read more
At the central level, Hon.Prime Minister, Mr. Modi has already taken two dramatically important steps: he has streamlined energy decision-making, and also environmental decision-making. India’s Ministry of Environment and Forests is now the Ministry of Environment, Forests and Climate Change. Domestically, he has put the experienced and effective Suresh Prabhu as the head of a high-level panel on reorganizing the various energy ministries — an “Advisory Group for Integrated Development of Power, Coal and Renewable Energy.” The new consolidated energy ministries offer the promise of an integrated approach to clean energy.
Internationally, the challenge for Modi will be the upcoming UN Special Summit on Climate Change – and India’s negotiating stance in the next Paris meeting of the UN climate negotiation in 2015.
Historically, India has held fast to “equity” – that is, an emphasis on the industrial world’s historic role as the greatest greenhouse gas polluter and contributor to global warming, and India’s still relatively low per-capita emissions. And as Jairam Ramesh pointed out, some Indians are suspicious of a “covert political agenda” among climate scientists. Indians have, as a result, been reluctant to lay down any national goals for greenhouse gas emissions that would sacrifice the nation’s international sovereignty in a legal sense, and that would inhibit its economic growth.
India can still be mindful of those objectives. Yet it now faces growing domestic attention to climate change impacts, as well as a more complex international picture. The United States has signaled that it will implement ambitious greenhouse gas regulations, and China appears to be doing the same.
If Modi wants to project an image of an India “that actively engages with the world” and which wants to lead, as he said in his inaugural address, he may be willing to go beyond old-line climate change talking points. The new environment minister Prakash Javadekar still uses the language of “common but differentiated responsibilities” – still a relevant concept when India’s level of economic development and per-capita emissions are well below the United States or Europe. Yet how those responsibilities are taken within India remains an issue of both Indian and global importance.
Internationally, Prime Minister Modi has an opportunity for India to step forward to lead a new low-carbon approach to development – and in the process to demonstrate that India can be a global environmental leader without sacrificing economic growth.
As climate change unleashes coastal flooding, erratic rainfall, heat waves and increased glacier melting in the Himalayas, the need for India’s corporate sector to play a greater and more proactive role in mitigating and adapting has never been more critical.
Experts say that aggressive measures by businesses will remain the pivot for sustained action on climate change. The India Greenhouse Gas (GHG) Programme is one such initiative which provides businesses a standardized method to measure and manage their GHG emissions.
n response, the Indian government launched the National Action Plan on Climate Change (NAPCC) in 2008. The initiative identifies eight core “national missions”, which deal with mitigation of greenhouse gas emissions that are causing climate change as well as adaptation to climate change effects. In 2009, India also committed to reducing the country’s emissions intensity by 20-25% by 2020 from a 2005 baseline. By itself, Indian industry had already reduced its emissions intensity by an estimated 17.6% between 1990 and 2005 as it became more productive.
To curb expected increases in GHG emissions, Indian industry needs focused efforts to increase the efficiency with which it uses resources, he adds. It should reduce consumption by adopting more recycling and reuse of existing resources, and accelerate the adoption of clean technologies with an objective to optimize life cycle cost.
Geothermal energy is not new to India. As early as 1973, the Indian government submitted a report on geothermal hotspots of the country. This happened after the Geological Survey of India (GSI) performed shallow drilling exploration, which showed the potential hot springs and geothermal locations. It is estimated that India has the potential to generate 10 GW of geothermal power.
Deep inside the earth’s crust, heat radiates from a sea of molten rocks. Sometimes, they erupt as volcanoes or flow out as hot springs. The idea is to tap at least a fraction of this massive amount of heat energy, and convert it into electricity.
First, scientists locate geothermal hotspots; then, they identify fractured rock surfaces through which heat can be released. Next, wells are dug to release heat energy in the form of steam and hot water, and are used to drive turbines, which, in turn, produce electricity.
Geothermal energy
Geothermal energy is considered renewable because the heat emanating from the earth’s interior is essentially limitless and is expected to remain so for billions of years. Further, unlike solar and wind, it is available 24 hours a day and 365 days a year. It emits around 80% fewer greenhouse gases compared to coal and oil. A geothermal plant works non-stop, unlike wind and solar.Puga Valley in the Ladakh region of Jammu & Kashmir was one of the areas which showed significant potential for geothermal energy. Puga lies in the south-eastern part of Ladakh and forms a part of the Himalayan geothermal belt. This zone shows evidence of geothermal activity in the form of hot springs, mud pools, sulphur and borax deposits.
Carbon savings
For every one unit of electricity saved, 600 grams of carbon emission is saved. , “Where a normal fan runs for 13 hours and consumes one unit of electricity, Superfan runs for 29 hours, consuming the same one unit of power.” For every Superfan purchased, coal consumption is reduced by 73 kg, and carbon emission is reduced by 90 kg every year.
“Currently, the energy efficiency of Superfan is 56%, and we want to push it by an additional 18%”, The Indian company is working on technologies to achieve this efficiency.
Modal Title
Realization and Support
GOLD SPONSORSHIP
PATROCÍNIO OURO
SILVER SPONSORSHIP
BRONZE SPONSORSHIP
SPECIAL SUPPORT
APOIO ESPECIAL
PARTNER
APOIO
MEDIA PARTNER
PARCEIRO DE MÍDIA
ORGANIZATION
SUPPORT
About
The World Water Forum is the world’s biggest water-related event and is organized by the World Water Council (WWC), an international organization that brings together all those interested in the theme of water. | 2024-03-15T01:26:29.851802 | https://example.com/article/6415 |
{
"action": {
"error": {
"notes": " [through Web]",
"variety": [
"Publishing error"
],
"vector": [
"Unknown"
]
}
},
"actor": {
"internal": {
"motive": [
"NA"
],
"variety": [
"Unknown"
]
}
},
"asset": {
"assets": [
{
"variety": "S - File"
}
],
"cloud": [
"Unknown"
]
},
"attribute": {
"confidentiality": {
"data": [
{
"amount": 1577,
"variety": "Personal"
}
],
"data_disclosure": "Yes",
"data_total": 1577,
"data_victim": [
"Customer"
],
"state": [
"Unknown"
]
}
},
"discovery_method": {
"unknown": true
},
"impact": {
"overall_rating": "Unknown"
},
"incident_id": "75828758-24C6-49F5-8E33-86B77802457A",
"plus": {
"analysis_status": "First pass",
"analyst": "swidup",
"asset": {
"total": "No"
},
"attribute": {
"confidentiality": {
"credit_monitoring": "Unknown",
"data_abuse": "Unknown"
}
},
"created": "2013-02-13T18:08:38Z",
"master_id": "75828758-24C6-49F5-8E33-86B77802457A",
"modified": "2014-05-10T00:58:19Z",
"timeline": {
"notification": {
"day": 12,
"month": 1,
"year": 2012
}
}
},
"reference": "http://www.infosecurity-magazine.com/view/23194/vermont-tax-agency-posts-social-security-numbers-federal-tax-ids-online/",
"schema_version": "1.3.4",
"security_incident": "Confirmed",
"source_id": "vcdb",
"summary": " The Vermont Department of Taxes admitted this week that the social security numbers of 1,332 Vermont tax payers and federal ID numbers of 245 businesses were inadvertently posted online. The personal data were contained in a weekly batch of property transfer tax returns, according to a report by the Burlington Free Press citing a Vermont Department of Taxes statement. The information was available for viewing for two hours on a vendor portion of the tax department's website, the statement said.",
"timeline": {
"incident": {
"year": 2012
}
},
"victim": {
"country": [
"US"
],
"employee_count": "101 to 1000",
"industry": "92113",
"region": [
"019021"
],
"state": "VT",
"victim_id": "Vermont Department of Taxes"
}
} | 2024-06-20T01:26:29.851802 | https://example.com/article/9906 |
For sale: Pipeline, Elba shares
Subheadline:
BiS Connect
Kinder Morgan is looking to sell off interest in two proposed Georgia projects, the Palmetto Pipeline and the expansion of the Elba Island LNG facility on the Savannah River.
The Houston-based energy infrastructure giant shared the information at an investor conference Wednesday.
Documents posted on the company website indicate Kinder Morgan expects to keep less than a 50 percent share of the $1.1 billion Palmetto Pipeline, listing its own cost going forward as $524.7 million.
A similar breakdown was not provided for Elba Island, where the company is planning a $2 billion expansion to allow natural gas to be liquefied there for export.
Chief Financial Officer Kim Dang said the company is already in talks with private equity groups but did not name them.
Savannah Riverkeeper Tonya Bonitatibus, who has organized opposition to the pipeline, said the company’s move pointed to the weakness of that project.
“If it’s really that strong an investment, they wouldn’t be trying to divest,” she said in a telephone interview Thursday.
Kinder Morgan spokespeople Melissa Ruiz and Richard Wheatley did not respond to multiple requests for comment.
The company has struggled over the last year, its stock price plummeting from more than $40 a share this time last year to about $15 a share Thursday. In November it slashed its dividend 75 percent. It’s cutting its spending as its cost of capital increases, Dang said.
She said the move to sell off stakes in the pipeline and Elba Island was needed for the company to fund its five-year $18.2 billion backlog of projects with internally generated cash.
“That’s where the most firepower is today in terms of ability to participate in these projects,” Dang said. “We don’t need that.”
The Palmetto Pipeline would move gasoline, diesel and ethanol from the northern part of South Carolina through Georgia and into Jacksonville. About 210 miles of the pipeline would run through the Peach State, with a proposed terminal in Richmond Hill.
The project hit a regulatory snag in May when the state denied it a certificate of public convenience and necessity required for the company to condemn property along the hundreds of parcels on the original route.
The company appealed, and a decision is pending from Fulton Superior Court Judge Kimberly Adams.
Kinder Morgan pushed back the pipeline’s expected in-service date to January 2018, but it indicates construction will begin this spring.
“We don’t need that in order to build the project, but we do need it in order to have eminent domain, which is the ability to ultimately condemn a property, land, a parcel of land for fair compensation,” he said at the investor conference. “It’s a power that we rarely use but it’s a point of finality in getting something resolved.”
In the meantime the company has been trying to obtain rights of way on a consensual basis. | 2023-09-14T01:26:29.851802 | https://example.com/article/6007 |
r) + 5*q(r). Let l be d(1). Solve -2*w = -o - l, 0 = 4*w - 8*w - o + 17 for w.
5
Let p = -12288 + 12291. Solve 5*i - 85*w - 15 = -90*w, -3*w = -p for i.
2
Let h(q) = q**3 - 10*q**2 + 12*q - 6. Let v be h(6). Let n = -65 - v. Suppose n*z = 4*z + 27. Solve -z*u - 2 = 2*u - 2*w, -3*u + w = 2 for u.
-2
Suppose 356*d + 4 = 19*d + 4. Solve 2*p = d, -282*v - 2 = -280*v + p for v.
-1
Let n be 80*(-70)/350*(1 + 3/(-2)). Suppose -b + 5*l = 0, -l + 4 = 3*l. Solve -5*y = -2*r - b - 8, -3*y = -r - n for y.
3
Let k be (41/((-2460)/8))/(3/(-45)). Solve k*v = -5*n + 5 + 20, -2*v = -10 for n.
3
Let q(h) = 26*h**2 - 180*h - 4. Let k be q(7). Solve -4*y - 2 = -0*y - 2*s, -2*y + 4*s - k = 0 for y.
1
Suppose 19*m = -m + 100. Suppose 0 = m*i - 815 + 795. Solve -4*z + 0 = i*c - 12, -25 = -5*z for c.
-2
Let k(s) = 7*s + 4. Let w be k(0). Let y(v) = v - 2. Let g be y(w). Suppose 0 = 3*p + 2*f - 7, -11 = 3*f + 1. Solve g*l - l - 2*u = -p, 3*l - 5*u = -14 for l.
-3
Suppose 0 = 3*v + 6, -7*c = -9*c - 5*v - 52. Let i be (-56)/c*6/4. Solve -3*h + 4 - 1 = i*q, 0 = h - 4*q - 1 for h.
1
Suppose -2*v = -4*m + 20, -v + 8 = 4222*m - 4218*m. Solve 5*l - 5*j - 8 - 7 = 0, m*l + 4*j = -12 for l.
0
Suppose -2*a - 2*a = -12. Suppose 4*v - 63 = v. Suppose 3*l + 1 - v = 4*w, 3*w = -15. Solve 2*z = -a*c - 2 - 10, -2*c - 4*z - 16 = l for c.
-2
Suppose 5*u - 5*l - 85 = 0, -u = -2*u + 2*l + 20. Let k = -432 - -474. Let d be -1 - (-7)/(k/30). Solve -d = -n - 5*b + 2, -b - u = 4*n for n.
-4
Suppose 8*r = r - 6*r. Suppose -f + 4 = r, 16 = 5*b + 3*f - 11. Solve 3*z = -a + b, 5*a - 8 = -2*z + 7 for z.
0
Suppose -55*l = -50*l + 1000. Let h = l + 206. Solve 0 = -3*w - 3*c + 6, -c + h*c = -10 for w.
4
Let j = -954 + 956. Suppose -2*o - 8 = -5*k + 11, 0 = 2*o - 6. Solve 0 = -j*t + k*h + 12 + 10, 17 = t - 4*h for t.
1
Let s = 752 - 739. Solve 0 = -4*r - 20, 17*h + 23 = s*h - 3*r for h.
-2
Let j(c) = 3*c**2 - 5*c - 33. Let d be j(-8). Let s = d - 177. Solve o = -5*v + 4*v + 3, -v = -4*o + s for o.
5
Suppose -25 = -5*r - 5. Suppose -r*d + 14 - 3 = -3*c, 4*c = d + 7. Solve 3*i = k + 14, -2*k + c*k = -3*i + 10 for i.
4
Let q(d) = 218*d - 6971. Let m be q(32). Solve -15*i + 10*i - 30 = m*r, -4*i - 2*r - 14 = 0 for i.
-1
Let i(a) = -a**2 + 13*a - 22. Let f be i(10). Suppose -19*u - f = -23*u. Suppose 0 = -3*l + u*l + 4*b, 2*b = 5*l. Solve 1 = y - 2*o - l, -3*o - 9 = -3*y for y.
5
Suppose -3*p + 33 = -2*p + 5*k, -5*p - k + 69 = 0. Suppose p*m - 12 = 9*m. Solve a = -5*g - 15, -2 + m = -a + 2*g for a.
-5
Let r be (-2)/(-7) + (-180)/(-105). Suppose -7*q + r*q = 0, 0 = -2*v - 4*q + 4. Solve 4*o + 2*b = 16, -7*b - 5 = -5*o - v*b for o.
3
Let w(n) = -n**2 + 32*n - 10. Let y be w(32). Let v(r) = -r**2 - 10*r + 4. Let s be v(y). Solve 0 = 3*g - 5*x, 5*g + 0*x + s*x = 0 for g.
0
Suppose 0 = 5*h + 38*w - 41*w - 21, 0 = 2*h + w - 4. Solve -35*x + 36*x = 4*t + 23, -24 = 3*t - h*x for t.
-5
Let c = -10 + 15. Let j(s) = 9*s**3 - s**2 + 3*s - 3. Let r be j(1). Suppose -15*u + 14 = -r*u. Solve -11 = -2*k + c*q, -q + 8 = u*k - 5*q for k.
-2
Let w(l) = l + 14. Let d(j) = -1. Let m(r) = 6*d(r) + w(r). Let t be m(-3). Solve f + 9 = -5*n, -t - 1 = f + 2*n for f.
-4
Suppose g = -m - 6, -3*m + 4 = 10. Let x be ((-50)/g)/((-4)/8). Let h be 5 - (x + 4 - -5). Solve -8 = -2*s - 2*c, 0*s + 5*c = -4*s + h for s.
-1
Let l = -97 - -97. Let v be -7 + (l - -9 - 2). Solve 2*r - 2*y = -6, v = 5*r + 4*y - 30 - 0 for r.
2
Suppose 6*f - w - 24 = f, -4*w - 16 = 0. Solve -5*i = 11*p - 13*p + 8, -3*i + 16 = f*p for p.
4
Let v = 667 + -627. Solve v = -4*b + 8*s, -4*b + 3*s - 4 = -8*b for b.
-2
Let q be ((0 + 0)/((-24)/(-12)))/((-1)/1). Solve -5*l + 3*l - g + 10 = q, -5*g = 0 for l.
5
Let x be (-198)/36 - (-3)/6. Let q be 208/80 + (-2)/x. Solve 0 = 5*i - q*d - 14, -3*d - 5 = 2*i + 2 for i.
1
Let p be (-76)/(-114)*(-1 + -1)*3. Let l be p/8*-3 - 3/(-6). Suppose -4*d - 3 = f, 4*f - 14 = -5*d + l*d. Solve 0*v = -n + 2*v + 3, f*n + 45 = -5*v for n.
-5
Suppose 5*y + 0 - 32 = -3*l, 2*l = 8. Solve 12 - 11 = -3*g + y*k, -4*k = 5*g - 41 for g.
5
Suppose -3*q + 119*y = 118*y - 28, -4*q - 5*y = -12. Suppose -q = 5*h - 7*h. Solve 2 = v - 4*g + h, 4*v + 2*g = -8 for v.
-2
Let x be 1*((-24)/(-2) - 2). Suppose j - 176 = -x*j. Let c be 1*0*4/j. Solve -4*b = -2*g - 9 - 3, 4*g + 2*b - 6 = c for g.
0
Let w be (1 + 34/(-26))*(-156)/24. Solve -19*d + m = -14*d + 2, -w*m = 3*d + 9 for d.
-1
Suppose -4*g + 109 = -3*x, 4*x = -5*g - 6 + 119. Suppose 4*r - g + 21 = 0. Let b = 57 + -57. Solve -5*q - 3*f - 6 - 19 = b, 2*q - r = f for q.
-2
Suppose 27*g = 20*g + 35. Let p(k) = -2*k + 5*k - g*k. Let y be p(0). Solve 38 = 5*d + i + 13, y = -i + 5 for d.
4
Let h = -7983 - -7987. Solve 0 = a - h*x - 1, -20*x + 3 = 3*a - 18*x for a.
1
Suppose 396 = 3*a - 6*a + 3*m, 0 = 2*a + 3*m + 254. Let n = 132 + a. Solve 2*f + 20 = 5*q + 1, 31 = 5*q + n*f for q.
5
Let n(i) = i**3 - 38*i**2 - 69*i - 440. Let z be n(40). Solve z = -g - g + 5*t + 27, 0 = -3*g + t + 8 for g.
1
Suppose -3*v + 63 = 5*h + 62, 0 = -5*h + 4*v + 22. Solve 0 = 5*u + 2*t + 2*t - 8, t = -h*u + 2 for u.
0
Let z(i) = i + 4. Let q be z(-4). Suppose q*d + d - 3*d = 0. Solve d = -3*c - 3, n - 3 = 4*c - 0 for n.
-1
Suppose -16 = -i + 2*u, 10*u - 13*u = 18. Solve -14*k + 12*k = -s + 1, 0 = -s + 3*k + i for s.
-5
Suppose -56*o - 101 + 325 = 0. Solve 2 + 4 = 2*k + 2*u, 0 = -o*k - 3*u + 7 for k.
-2
Suppose 0 = -55*x + 49*x + 108. Suppose -w + 2*n = -8, n - 5 + x = 5*w. Solve 0 = i - 5*f - 7, -2*i - w = f - 5 for i.
2
Let q be (-4)/(-6)*(15/6 + -1). Let j be q/(2/122) + (-17 - -19). Let r = j - 60. Solve -r*y + 4*s = 16, 0 = 2*y + s - 0*s - 4 for y.
0
Let x = -7 - -11. Let p be (10/(-4))/((-6)/(-96)). Let z = p + 43. Solve -x*h = z*g, -5*h = g + 2*g + 3 for h.
-3
Let c = 585 + -399. Let o be c/(-54) - -3 - (-49)/9. Solve 5*b = o*f - 30, f = -2*b + 2*f - 9 for b.
-3
Let y be (-2)/(-6) + (-3)/9. Suppose 6*p = -y + 30. Suppose 0*d - 10 = -5*d. Solve -2*i = w + 12, p*i + d*w + 36 = -2*w for i.
-4
Let a = -175 + 307. Suppose -5*t + 2*u = 3*u - a, -6 = -3*u. Solve 0 = -p + 3, p - t = -5*b + 2 for b.
5
Suppose -2*b - 4 = -r - b, 2*r - 8 = -5*b. Let d be 13 + 2 + -1 + -5. Let z be 4/12 + 0 - 10/(-6). Solve -m - 3 + d = r*f, 4*f - z = -3*m for m.
-2
Suppose -2*a + 10 = 3*a. Let c(z) = 7*z. Let b be c(a). Let w be 6*((-88)/(-33))/8. Solve 5*l + 4*d = 33, w*l - d + 3*d - b = 0 for l.
5
Let a = -25 - -58. Suppose -10*g = -a*g. Solve -3*r + 20 = -r - 5*v, g = -4*r + v + 22 for r.
5
Let h be 1*19/7 + 4/14. Let r(v) = -9*v + 61. Let m be r(6). Solve 2*t - 11 = h*w, m = 5*w + 3*t - 0*t for w.
-1
Suppose 256 = 12*y - 11*y. Let h = y + -253. Solve o + 2*r - 7 = 0, -h*r + 10 = 1 for o.
1
Suppose 5*g + 3 = 5*s + 13, 5*g + 4*s - 19 = 0. Solve 4*w = -o - 4 + 18, 5*o + 22 = g*w for w.
4
Let g(m) = -m**2 + 13*m + 2031. Let p be g(52). Solve -2*w + 4 = -6*r + 9*r, 4*r = p*w - 23 for w.
5
Suppose 0 = 4*o - 4, -3*o - 3 = 1266*r - 1268*r. Solve -3*h - 10 = r*k - 1, 0 = -k for h.
-3
Suppose 10*h + 84 = 38*h. Suppose -6 = -0*t - 5*t - 4*f, h*t + 4*f = 2. Solve 0 = r + 5*q + 4, -1 = -5*r - 2*q + t for r.
1
Let x(m) = -2*m - 46. Let q be x(37). Let z be -8*5/q*0. Solve 0 = 3*h - 3*d + 8*d + 30, z = h - 5*d - 10 for h.
-5
Let j(w) = w**3 + 11*w**2 + w + 21. Let x be j(0). Suppose 437*o - 430*o = x. Solve -2*p + d = -d - 12, o*p + 3*d - 12 = 0 for p.
5
Suppose 423 = -23*s + 285. Let v be 6*s/(-18) + 3. Solve -v*b + 5*k - 5 = 0, 4*k - 3 = 3*b + 2*k for b.
-1
Let i = 382 - 381. Suppose 2*v - 4*c - 3 = -i, 5*v = 4*c + 35. Solve -4*k - 8 = z, -5*z = -k - v - 12 for k.
-3
Let s be (6 + -6)/(-6 + 3). Solve 3*f - 5*z + 11 = -15, s = -4*f + 4*z - 24 for f.
-2
Let k be 15 - 7 - (3 - (-5 + 3)). Solve -2*t = 4*u, 0 = -4*t + 5 + k for u.
-1
Suppose m = 1 + 1. Suppose 7*v + 90*v = -57 + 251. Solve v*f = u + 5, 3*u - u = -2*f + m for f.
2
Let j be 81/(-18) - 1*(-3)/6. Let i be (-2)/j + (-189)/(-42) + -1. Solve i*a + l - 10 = 2*a, 0 = -5*a - 2*l + 23 for a.
3
Suppose 4*b - 170 = 2*o, -5*b + b - 5*o + 205 = 0. Solve t + 48 - b = -2*q, 3*t + 2*q + 9 = 0 for t.
-3
Let o be -2 + (-16 - (-2)/(3 - 4)). Let r be o/(-16) - (-22)/(-24)*-3. Solve 12 = 3*c + c + 5*j, -j = -r for c.
-2
Suppose s - 7 + 2 = f, -5*s = -f - 29. Suppose s*v = -23*v + 145. Solve 5*k + 5 = p + 33, -v*p - 10 = k for | 2024-07-30T01:26:29.851802 | https://example.com/article/4600 |
Search
Trailer For “The Accountant”, Starring Ben Affleck
After the somewhat lackluster success of Batman v Superman: Dawn of Justice, Ben Affleck is more than likely seeking a surefire hit with his next starring role. Enter: The Accountant. Directed by Gavin O’Connor, who helmed the massively underrated Warrior, the film follows the exploits of an accountant doubling as an assassin. The “double life” trope has been explored countless times in films. But with direction from O’Connor and the star power of Affleck, The Accountant could prove to be an awards contender.
About The Author
Richard Atta Amoako is a clinical youth social worker residing in the greatest neighborhood in the world: West Philly. He is also the founder of The Nerd Convocation. You can follow him on Twitter: @Attamantium. | 2023-12-19T01:26:29.851802 | https://example.com/article/7536 |
Glen Ridge Public Schools
The Glen Ridge Public Schools is a comprehensive public school district serving students in kindergarten through twelfth grade in Glen Ridge, in Essex County, New Jersey, United States.
As of the 2014-15 school year, the district and its four schools had an enrollment of 1,853 students and 141.0 classroom teachers (on an FTE basis), for a student–teacher ratio of 13.1:1.
The district is classified by the New Jersey Department of Education as being in District Factor Group "I", the second-highest of eight groupings. District Factor Groups organize districts statewide to allow comparison by common socioeconomic characteristics of the local districts. From lowest socioeconomic status to highest, the categories are A, B, CD, DE, FG, GH, I and J.
Schools
Schools in the district (with 2014-15 enrollment data from the National Center for Education Statistics) are:
Forest Avenue School (217 students in grades K-2)
Matthew Murphy, Principal
Linden Avenue School (226; K-2)
Joseph Caravela, Principal
Ridgewood Avenue School (585; 3-6)
Michael Donovan, Principal
Jonathan Heitmann, Assistant Principal
Glen Ridge High School (824; 7-12). The high school gained national attention as the school of the athletes involved in the Glen Ridge Rape.
Louis A. Melchor, Principal
Dr. Keisha L. Harris, Assistant Principal
Administration
Core members of the district's administration are:
Dirk Phillips, Superintendent
Peter R. Caprio, Business Administrator / Board Secretary
References
External links
Glen Ridge Schools Website
School Data for the Glen Ridge Public Schools, National Center for Education Statistics
Public Schools
Category:New Jersey District Factor Group I
Category:School districts in Essex County, New Jersey | 2024-07-29T01:26:29.851802 | https://example.com/article/5797 |
I got a letter from Lou Alexander asking me to sign something regarding
distribution of Mon's IRA. Do you know anything about that? I thought
Liz moved everything to Legg Mason. | 2024-03-14T01:26:29.851802 | https://example.com/article/4873 |
Various immunoglobulin preparations for intravenous use.
In recent years, a number of intravenous immunoglobulin (IVIG) preparations have become available, primarily in Europe. Since these preparations differ in their physical, chemical and biologic properties, the physician is frequently presented with difficulties in selecting an appropriate product. Until now, in vitro studies have been the only reliable source of evaluating these preparations. This paper describes the commercially available IVIG preparations and assesses the properties of each. | 2023-09-21T01:26:29.851802 | https://example.com/article/4445 |
Opposition leader Isaac Herzog (Labor) called on Prime Minister Benjamin Netanyahu to resign, saying at a Knesset plenum discussion that "only a prime minister lacking self-confidence needs a Jewish state bill.""You talk more and more and more about nationality in order to avoid addressing the inability of the public to afford buying a house."Herzog said that Netanyahu had failed in his efforts to prevent Iran's nuclear progress and had proven wanting in his promises to weaken Hamas. | 2023-11-21T01:26:29.851802 | https://example.com/article/6220 |
‘Come here’
Simple word laced with meaning. Meaning that cuts through to his core like a knife.
When she speaks in that way, he knows. Her tone brooks no compromise.
Naked from the shower she insists upon on returning home, he walks to her, feeling instantly small and vulnerable before her piercing gaze.
Presenting himself, he feels the weight of her judgement upon him.
“Kneel, my darling’
His heart speeds, his stomach jitters.
‘Why do it, sweetheart?’….her tone so cool, so shaming. There was no reason to ask what she meant. He knew…she had made the rules clear, the rules by which he must live. The rules he followed, out of love and devotion, out of need for her control and approval. Rules that made him happy and now in the breaking of them, very sad indeed.
‘Cake’….the word hung like the accusation it was.
He hadn’t intended to break the ‘no cake’ rule. At the social, he was talking, distracted and before he knew it, the preferred piece of coffee and walnut cake had been consumed. Just a small piece, a bite size morsel really, just finger food brought round and accidentally eaten.
Still….’Cake’ she repeated more firmly.
His mouth felt dry, her disapproval rendering him miserably adrift.
If he hadn’t broken it a while ago, she might have been more forgiving but as it was. He sighed and tried a ‘Sorry’
She shook her head, gently smiling at her wayward boy.
She moved to the bed, sat in the middle propped by pillows and said ‘Here’, patting her soft ample thighs.
A spanking was inevitable…it always had been, from the moment he broke that rule and let her down.
A wash of feeling…contrition, sadness, dismay and shame…
Laying across her lap felt like coming home. She would make him feel he deserved to be hers again but only after the humbling experience of having his bottom smacked like a naughty boy.
She liked him to part his legs, so she could see his balls and his anus. Happy to make him feel he must go through whatever she ordained to reach the nirvana of her affection once more.
To feel even partially exiled from her love was agony. The slow rhythmic spanking, checked only by loving strokes of her hand on his thighs and balls or a finger grazing his anus, left him melting . He was lost in her touch. This was necessary and he trusted her, always calm, always good and so he submitted, the growing soreness soothed by her words of caring encouragement. It would do him good, she knew, he had been bad but this would make things better.
The experience could render him quite close to tears, emotional, desperate to please. The longer it went on, the more he yielded to her, soft, passive and obedient…she was doing with him what she needed…what he needed…under her loving control once more. The pain was never just that, always something better.
His cock was hard, pressing her flesh, each spank, sending sparks of pleasure as he rubbed against her softness.
This was also to be his punishment, a smacked rear was always paired with a couple of extra days of denial..always fondly explained, gently insisted upon. It was the most wonderful way to pay the price for his error, to see her happy and content in his extra suffering. His desperation to orgasm fueling her pleasures, pleasures he would be part of, whilst denied his own.
Her absolute strength of will on this matter always left him defeated and helpless and wanting only to please her more.
Last Updated on 2 years by pseudonymous | 2024-05-05T01:26:29.851802 | https://example.com/article/8027 |
2016 gold prices
Featured Story
There's extreme value in being an investor who's willing to "zig" when the rest of the masses are "zagging."
No one proves that point better than the legendary investor I'm going to tell you about today.
His strategy and approach are so effective, in fact, that our Chief Investment Strategist, Keith Fitz-Gerald, is using it right now on three stocks that should prove to be among the smartest Contrarian investing moves of this year - and beyond.
Your email address will not be published. Required fields are marked *
Comment
Some HTML is OK
Sign me up for the Money Morning newsletter
Name *
Email *
Website
5 − = two
There's extreme value in being an investor who's willing to "zig" when the rest of the masses are "zagging."
No one proves that point better than the legendary investor I'm going to tell you about today.
His strategy and approach are so effective, in fact, that our Chief Investment Strategist, Keith Fitz-Gerald, is using it right now on three stocks that should prove to be among the smartest Contrarian investing moves of this year - and beyond.
Your email address will not be published. Required fields are marked *
Comment
Some HTML is OK
Sign me up for the Money Morning newsletter
Name *
Email *
Website
4 − = 1
Gold prices today (Thursday) were mostly flat, meaning gold prices are now on pace to log their third consecutive annual loss.
In early morning trading of the last session of 2015, spot gold prices today were trading higher by $1.10, or 0.1%, to $1,062.10 an ounce. That followed an $8.20, or 0.8%, decline to $1,060.10 an ounce Wednesday.
By submitting your email address you will receive a free subscription to Money Morning and receive Money Morning Profit Alerts. You will also receive occasional special offers from Money Map Press and our affiliates. You can unsubscribe at anytime and we encourage you to read more about our privacy policy.
By submitting your email address you will receive a free subscription to Money Morning and receive Money Morning Profit Alerts. You will also receive occasional special offers from Money Map Press and our affiliates. You can unsubscribe at anytime and we encourage you to read more about our privacy policy. | 2023-09-19T01:26:29.851802 | https://example.com/article/7382 |
A genome-wide screen reveals functional gene clusters in the cancer genome and identifies EphA2 as a mitogen in glioblastoma.
A novel genome-wide screen that combines patient outcome analysis with array comparative genomic hybridization and mRNA expression profiling was developed to identify genes with copy number alterations, aberrant mRNA expression, and relevance to survival in glioblastoma. The method led to the discovery of physical gene clusters within the cancer genome with boundaries defined by physical proximity, correlated mRNA expression patterns, and survival relatedness. These boundaries delineate a novel genomic interval called the functional common region (FCR). Many FCRs contained genes of high biological relevance to cancer and were used to pinpoint functionally significant DNA alterations that were too small or infrequent to be reliably identified using standard algorithms. One such FCR contained the EphA2 receptor tyrosine kinase. Validation experiments showed that EphA2 mRNA overexpression correlated inversely with patient survival in a panel of 21 glioblastomas, and ligand-mediated EphA2 receptor activation increased glioblastoma proliferation and tumor growth via a mitogen-activated protein kinase-dependent pathway. This novel genome-wide approach greatly expanded the list of target genes in glioblastoma and represents a powerful new strategy to identify the upstream determinants of tumor phenotype in a range of human cancers. | 2024-01-10T01:26:29.851802 | https://example.com/article/3663 |
The Sergeant's Daughter
The Sergeant's Daughter () is a 1952 West German war romance film directed by George Hurdalek and starring Johanna Matz, Jan Hendriks and Friedrich Domin. It was based on a 1903 novel by Franz Adam Beyerlein which portrayed life in the army of William II.
It was made at the Bavaria Studios in Munich and on location at historic barracks at Ingolstadt. The film's sets were designed by Robert Herlth and Kurt Herlth.
Synopsis
Before the outbreak of the First World War, the daughter of a sergeant in the cavalry falls in love with a junior officer, despite already being engaged to another soldier.
Cast
Johanna Matz as Kläre Volkhardt
Jan Hendriks as Leutnant Christian von Lauffen
Friedrich Domin as Wachtmeister Volkhardt
Paul Hartmann as Freiherr von Lauffen
O.E. Hasse as Rittmeister Graf Ledenburg
Maria Wimmer as Madeleine, Baronin Hügener
Harry Meyen as Leutnant Robert Kroldt
Rudolf Fernau as Baron Hügener, Rittergutsbesitzer
Max Eckard as Unteroffizier Fritz Helbig
Herbert Hübner as Major Paeschke, Kriegsgerichtsrat
Franz Muxeneder as Ulan Graboviak, Bursche
Wolfgang Büttner as Vizewachtmeister Queiss
Annette Carell as Bettina von Laufen
Otto Friebel
Ellen Hille
Bert Brandt
Helmut Oeser
Charles Regnier
See also
Curfew (1925)
References
Bibliography
Hans-Michael Bock and Tim Bergfelder. The Concise Cinegraph: An Encyclopedia of German Cinema. Berghahn Books, 2009.
External links
Category:1952 films
Category:1950s war films
Category:German war films
Category:West German films
Category:German-language films
Category:Films directed by George Hurdalek
Category:Films set in the 1910s
Category:German film remakes | 2024-01-24T01:26:29.851802 | https://example.com/article/5782 |
Q:
Adding an xsd file value to an XmlAttribute
How I am creating an xml string of proper xml with the code below..
string myInputXmlString = @"<ApplicationData>
<something>else</something>
</ApplicationData>";
var doc = new XmlDocument();
doc.LoadXml(myInputXmlString);
XmlAttribute newAttr = doc.CreateAttribute(
"xsi",
"noNamespaceSchemaLocation",
"http://www.w3.org/2001/XMLSchema-instance");
doc.DocumentElement.Attributes.Append(newAttr);
var ms = new MemoryStream();
XmlWriterSettings ws = new XmlWriterSettings
{
OmitXmlDeclaration = false,
ConformanceLevel = ConformanceLevel.Document,
Encoding = UTF8Encoding.UTF8
};
var tx = XmlWriter.Create(ms, ws);
doc.Save(tx);
tx.Flush();
var xmlString = UTF8Encoding.UTF8.GetString(ms.ToArray());
Console.WriteLine(xmlString);
How do I add the xsd information to this so the xml looks like this (with "FullModeDataset.xsd" includded?
<ApplicationData
xsi:noNamespaceSchemaLocation="FullModeDataset.xsd"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" />
Instead of this which the current code is outputing
<ApplicationData
xsi:noNamespaceSchemaLocation=""
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" />
A:
Does this work by chance?
doc.DocumentElement.SetAttribute("noNamespaceSchemaLocation",
"http://www.w3.org/2001/XMLSchema-instance",
"FullModeDataset.xsd");
| 2023-09-01T01:26:29.851802 | https://example.com/article/8705 |
STATE ex rel. OKLAHOMA BAR ASSOCIATION v. TRIPP
Skip to Main Content
Accessibility Statement
Help
Contact Us
e-payments
Careers
Home
Courts
Decisions
Programs
News
Legal Research
Court Records
Quick Links
OSCN Found Document:STATE ex rel. OKLAHOMA BAR ASSOCIATION v. TRIPP
Previous Case
Top Of Index
This Point in Index
Citationize
Next Case
Print Only
STATE ex rel. OKLAHOMA BAR ASSOCIATION v. TRIPP2019 OK 56Case Number: SCBD-6815Decided: 09/10/2019THE SUPREME COURT OF THE STATE OF OKLAHOMA
Cite as: 2019 OK 56, __ P.3d __
STATE OF OKLAHOMA ex rel. OKLAHOMA BAR ASSOCIATION, Complainant,
v.
DOUGLAS STEPHEN TRIPP, Respondent.
¶0 ORDER APPROVING RESIGNATION PENDING DISCIPLINARY PROCEEDINGS
¶1 Complainant, Oklahoma Bar Association (Bar Association), has applied pursuant to Rule 8.1 of the Rules Governing Disciplinary Proceedings, (RGDP), 5 O.S.2011 Ch. 1, App. 1-A (as amended by order of the Supreme Court, 2017 OK 1, eff. January 9, 2017) for an order approving the resignation of the respondent, Douglas Stephen Tripp, pending disciplinary proceedings. The Bar's application and the respondent's affidavit of resignation reveal the following.
¶2 On June 26, 2019, the respondent filed with this Court his executed affidavit of resignation from membership in the Bar Association pending disciplinary proceedings.
¶3 The respondent's affidavit of resignation reflects that: (a) it was freely and voluntarily rendered; (b) he was not subject to coercion or duress; and (c) he was fully aware of the consequences of submitting the resignation.
¶4 The affidavit of resignation states respondent's awareness of an investigation by the Bar Association, regarding the following allegations in the disciplinary Complaint which suffice as a basis for discipline:
(a) The Unauthorized Practice of Law: The allegations are that from October 2006 until approximately November 2018, respondent established a continuous presence in this jurisdiction for the practice of law and that he engaged in the unauthorized practice of law during the applicable time period by representing clients on issues pertaining to Oklahoma law. Furthermore, the Complaint alleged that respondent held himself out to the public, the legal community, his law firm and the firm's clients as an attorney licensed to practice in Oklahoma.
(b) Engaged in Conduct Involving Dishonesty, Deceit, and Misrepresentations: The allegations are that respondent knew that he did not possess a license to practice law in Oklahoma when he accepted employment with the law firm in 2006. It is alleged that he continuously, systematically, and knowingly represented to his law firm and his legal clients from 2006 through 2018 that he was licensed to practice law in Oklahoma and that said representations were dishonest, deceitful, and misrepresented his licensure status.
¶5 The resignation states the respondent is aware the allegations against him, if proven, would constitute violations of Rules 5.5 (b)(1), 5.5 (b)(2), and 8.4 (c) of the Oklahoma Rules of Professional Conduct (ORPC), 5 O.S. 2011, ch. 1, app. 3-A, and Rule 1.3 RGDP, and his oath as an attorney.
¶6 The respondent states he is aware the burden of proof regarding the allegations against him rests upon the Oklahoma Bar Association, and he waives any and all rights to contest the allegations.
¶7 The respondent states his awareness of the requirements of Rule 9.1, of the Rules Governing Disciplinary Proceedings, and he states he shall comply with that Rule within twenty (20) days following the date of his resignation.
¶ 8 The respondent states his intent that his resignation be effective from the date and time of its execution and that he will conduct his affairs accordingly. The Bar Association requests the Court make the resignation effective retroactive to the date of its execution by respondent. We note the resignation was executed by respondent, on June 21, 2019, and filed in this Court three business days later, on June 26, 2019. See State ex rel. Oklahoma Bar Ass'n v. Claborn, 2019 OK 14, ¶ 10 (the Court may determine an effective date for the resignation to be the date it was submitted to the Bar Association when the resignation is contemporaneously filed with this Court and the attorney is treating the date of submission as an effective date for all of the attorney's professional obligations. The two days between March 6th and March 8th was found to be sufficiently contemporaneous.) With regard to respondent's execution of his resignation, the three business days between June 21st and June 26th is sufficiently contemporaneous for treating the resignation as effective from the date of execution on June 21, 2019. We determine the effective date of resignation to be June 21, 2019.
¶9 The respondent states his awareness that a Rule 8.2 resignation pending disciplinary proceedings may be either approved or disapproved by the Oklahoma Supreme Court.
¶10 The respondent states he is aware he may make no application for reinstatement prior to the expiration of five years from the effective date of the order approving his resignation, and that reinstatement requires compliance with Rule 11 of the Rules Governing Disciplinary Proceedings. See 5 O.S.2011 Ch. 1, App. 1-A, Rule 8.2, Rules Governing Disciplinary Proceedings; State ex rel. Oklahoma Bar Association v. Bourland, 2001 OK 12, 19 P.3d 289; In re Reinstatement of Hird, 2001 OK 28, 21 P.3d 1043.
¶11 The respondent states he is aware the Client's Security Fund may receive claims from his former clients, and he shall pay to the Oklahoma Bar Association, prior to reinstatement, those funds, including principal and interest, expended by the Client's Security Fund for claims against him. See 5 O.S.2011 Ch. 1, App. 1-A, Rule 11.1(b), Rules Governing Disciplinary Proceedings; State ex rel. Oklahoma Bar Association v. Heinen, 2003 OK 36, ¶ 9, 84 P.3d 708, 709.
¶12 The respondent states that he searched diligently and he could not locate his Oklahoma Bar Association membership card. If he locates his membership card, he agrees to immediately forward same to the Office of General Counsel of the Oklahoma Bar Association.
¶13 The respondent states that he has not held himself out as a member of the Oklahoma Bar Association or as a lawyer licensed to practice law in Oklahoma since November 8, 2018. Since that date, he states he has not established an office for the practice of law in Oklahoma or otherwise held himself out as an attorney licensed in Oklahoma, nor has he provided legal advice or otherwise counseled any party on issues or matters pertaining to Oklahoma law, and has informed all interested parties that he is not licensed in Oklahoma.
¶14 The application for approval of respondent's resignation filed by the Bar Association states that costs were incurred in the amount of $99.61 in the investigation of respondent.
¶15 The official roster name and address of the respondent is Douglas Stephen Tripp, O.B.A. No. 11552, 3020 Carriage Park Lane, Edmond, Oklahoma 73003.
¶16 IT IS THEREFORE ORDERED that the application by the Bar Association for an order approving Douglas Stephen Tripp's resignation be approved, and the resignation is deemed effective on the date of execution by respondent, June 21, 2019.
¶17 IT IS FURTHER ORDERED that respondent's name be stricken from the Roll of Attorneys and that he make no application for reinstatement to membership in the Oklahoma Bar Association prior to five years from the effective date of his resignation.
¶18 IT IS FURTHER ORDERED that costs are awarded in the amount of $99.61 to the Oklahoma Bar Association as requested in the Application to Assess Costs filed by the Oklahoma Bar Association.
¶19 IT IS FURTHER ORDERED that if any funds of the Client's Security Fund of the Oklahoma Bar Association are expended on behalf of respondent, he must show the amount paid and that the same has been repaid, with interest, to the Oklahoma Bar Association to reimburse such Fund prior to reinstatement.
¶20 DONE BY ORDER OF THE SUPREME COURT IN CONFERENCE THIS 9th DAY OF SEPTEMBER, 2019.
/S/CHIEF JUSTICE
¶21 GURICH, C.J., DARBY, V.C.J., KAUGER, WINCHESTER, EDMONDSON, COLBERT, COMBS, JJ, concur.
Citationizer© Summary of Documents Citing This Document
Cite
Name
Level
None Found.
Citationizer: Table of Authority
Cite
Name
Level
Oklahoma Supreme Court Cases
CiteNameLevel
2001 OK 12, 19 P.3d 289, 72 OBJ 553, STATE ex. rel. OKLAHOMA BAR ASSN. v. BOURLANDDiscussed
2001 OK 28, 21 P.3d 1043, 72 OBJ 845, IN THE MATTER OF THE REINSTATEMENT OF HIRDDiscussed
2003 OK 36, 84 P.3d 708, STATE ex rel. OKLAHOMA BAR ASSOCIATION v. HEINENDiscussed
2017 OK 1, AMENDMENT TO RULES GOVERNING DISCIPLINARY PROCEEDINGSCited
2019 OK 14, 440 P.3d 660, STATE ex rel. OKLAHOMA BAR ASSOCIATION v. CLABORNCited
oscn
EMAIL: webmaster@oscn.net
Oklahoma Judicial Center
2100 N Lincoln Blvd.
Oklahoma City, OK 73105
courts
Supreme Court of Oklahoma
Court of Criminal Appeals
Court of Civil Appeals
District Courts
decisions
New Decisions
Supreme Court of Oklahoma
Court of Criminal Appeals
Court of Civil Appeals
programs
The Sovereignty Symposium
Alternative Dispute Resolution
Early Settlement Mediation
Children's Court Improvement Program (CIP)
Judicial Nominating Commission
Certified Courtroom Interpreters
Certified Shorthand Reporters
Accessibility ADA
Contact Us
Careers
Accessibility ADA
| 2023-11-21T01:26:29.851802 | https://example.com/article/9738 |
/*
* cros_ec_lpc_mec - LPC variant I/O for Microchip EC
*
* Copyright (C) 2016 Google, Inc
*
* This software is licensed under the terms of the GNU General Public
* License version 2, as published by the Free Software Foundation, and
* may be copied, distributed, and modified under those terms.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* This driver uses the Chrome OS EC byte-level message-based protocol for
* communicating the keyboard state (which keys are pressed) from a keyboard EC
* to the AP over some bus (such as i2c, lpc, spi). The EC does debouncing,
* but everything else (including deghosting) is done here. The main
* motivation for this is to keep the EC firmware as simple as possible, since
* it cannot be easily upgraded and EC flash/IRAM space is relatively
* expensive.
*/
#include <linux/delay.h>
#include <linux/io.h>
#include <linux/mfd/cros_ec_commands.h>
#include <linux/mfd/cros_ec_lpc_mec.h>
#include <linux/mutex.h>
#include <linux/types.h>
/*
* This mutex must be held while accessing the EMI unit. We can't rely on the
* EC mutex because memmap data may be accessed without it being held.
*/
static struct mutex io_mutex;
/*
* cros_ec_lpc_mec_emi_write_address
*
* Initialize EMI read / write at a given address.
*
* @addr: Starting read / write address
* @access_type: Type of access, typically 32-bit auto-increment
*/
static void cros_ec_lpc_mec_emi_write_address(u16 addr,
enum cros_ec_lpc_mec_emi_access_mode access_type)
{
/* Address relative to start of EMI range */
addr -= MEC_EMI_RANGE_START;
outb((addr & 0xfc) | access_type, MEC_EMI_EC_ADDRESS_B0);
outb((addr >> 8) & 0x7f, MEC_EMI_EC_ADDRESS_B1);
}
/*
* cros_ec_lpc_io_bytes_mec - Read / write bytes to MEC EMI port
*
* @io_type: MEC_IO_READ or MEC_IO_WRITE, depending on request
* @offset: Base read / write address
* @length: Number of bytes to read / write
* @buf: Destination / source buffer
*
* @return 8-bit checksum of all bytes read / written
*/
u8 cros_ec_lpc_io_bytes_mec(enum cros_ec_lpc_mec_io_type io_type,
unsigned int offset, unsigned int length,
u8 *buf)
{
int i = 0;
int io_addr;
u8 sum = 0;
enum cros_ec_lpc_mec_emi_access_mode access, new_access;
/*
* Long access cannot be used on misaligned data since reading B0 loads
* the data register and writing B3 flushes.
*/
if (offset & 0x3 || length < 4)
access = ACCESS_TYPE_BYTE;
else
access = ACCESS_TYPE_LONG_AUTO_INCREMENT;
mutex_lock(&io_mutex);
/* Initialize I/O at desired address */
cros_ec_lpc_mec_emi_write_address(offset, access);
/* Skip bytes in case of misaligned offset */
io_addr = MEC_EMI_EC_DATA_B0 + (offset & 0x3);
while (i < length) {
while (io_addr <= MEC_EMI_EC_DATA_B3) {
if (io_type == MEC_IO_READ)
buf[i] = inb(io_addr++);
else
outb(buf[i], io_addr++);
sum += buf[i++];
offset++;
/* Extra bounds check in case of misaligned length */
if (i == length)
goto done;
}
/*
* Use long auto-increment access except for misaligned write,
* since writing B3 triggers the flush.
*/
if (length - i < 4 && io_type == MEC_IO_WRITE)
new_access = ACCESS_TYPE_BYTE;
else
new_access = ACCESS_TYPE_LONG_AUTO_INCREMENT;
if (new_access != access ||
access != ACCESS_TYPE_LONG_AUTO_INCREMENT) {
access = new_access;
cros_ec_lpc_mec_emi_write_address(offset, access);
}
/* Access [B0, B3] on each loop pass */
io_addr = MEC_EMI_EC_DATA_B0;
}
done:
mutex_unlock(&io_mutex);
return sum;
}
EXPORT_SYMBOL(cros_ec_lpc_io_bytes_mec);
void cros_ec_lpc_mec_init(void)
{
mutex_init(&io_mutex);
}
EXPORT_SYMBOL(cros_ec_lpc_mec_init);
void cros_ec_lpc_mec_destroy(void)
{
mutex_destroy(&io_mutex);
}
EXPORT_SYMBOL(cros_ec_lpc_mec_destroy);
| 2024-04-26T01:26:29.851802 | https://example.com/article/9504 |
Q:
How to get reference to jQuery selector's returning list?
I have some jQuery function:
rfx.jQuery(function(){
rfx.jQuery(".form-row.errors").blur(some_function(this))
});
But 'this' is HTMLDocument and not a list of selector return values. How can I get reference to list of elements?
A:
The result of the selection itself ie rfx.jQuery(".form-row.errors") will be an array of the returned elements.
However in your blur event...
rfx.jQuery(".form-row.errors").blur(function(){
//`this` is the element reference...
});
See this JS fiddle Example and tab between the input boxes.
You can't access the full selection from within the blur without either:
a) Selecting again within the blur() function...
rfx.jQuery(function(){
rfx.jQuery(".form-row.errors").blur(function(){
// `this` is the element which is blurring
var formRowErrors = rfx.jQuery(".form-row.errors") //select again within the blur function
});
});
b) Using a closure, such as...
rfx.jQuery(function(){
var formRowErrors = rfx.jQuery(".form-row.errors");
rfx.jQuery(".form-row.errors").blur(function(){
// `this` is the element which is blurring
// formRowErrors is the jQuery selection of all form-row.errors
});
});
However, in this second method, the var formRowErrors will only contain the selection at the time you bind ie it is not "live"
| 2024-01-22T01:26:29.851802 | https://example.com/article/3948 |
Ureteral rhabdomyosarcoma.
Rhabdomyosarcoma is a malignant tumor well known to urologists. These tumors arise from the genitourinary system in 20% to 25% of cases, most commonly from the bladder, prostate, vagina, and paratesticular region. This is the first reported case of a rhabdomyosarcoma arising from the ureter. The radiographic findings and ureteroscopic appearance of this tumor suggested a benign fibroepithelial polyp; however, a ureteroscopic biopsy and subsequent nephroureterectomy revealed an embryonal rhabdomyosarcoma. | 2024-01-07T01:26:29.851802 | https://example.com/article/8603 |
The June 30 fact-finding committee criticised the Human Rights Watch (HRW) Rabaa report, adding that it “disregarded” violence against Christians and attacks on churches and on police installations, in a statement released on Wednesday. | 2023-08-15T01:26:29.851802 | https://example.com/article/4107 |
---
abstract: 'We study $t$-channel single top quark production at future LHC runs at 14 TeV with 300 fb$^{-1}$ and 3000 fb$^{-1}$ as well as at a future 33 TeV proton-proton collider in the context of the Snowmass 2013 study. The single top final state has a lepton and neutrino from the top quark decay plus two jets, one of which is required to be $b$-tagged. We show that it is possible to isolate large samples of single top events and that the cross-section can be measured with a precision of 5% or better.'
author:
- Brad Schoenrock
- Elizabeth Drueke
- Barbara Alvarez Gonzalez
- Reinhard Schwienhorst
bibliography:
- 'tchan.bib'
title: 'Single top quark production in the $t$-channel at 14 TeV and 33 TeV'
---
Introduction {#sec:intro}
============
The Large Hadron Collider (LHC) is the highest-energy particle accelerator ever built, probing physics at the TeV scale. The Higgs boson discovery [@Aad:2012tfa; @Chatrchyan:2012ufa] was the first, but more discoveries are likely at the LHC which covers the energy range where new physics is anticipated.
Single top quarks are produced in the Standard Model (SM) through three different mechanisms: the $t$-channel exchange of a $W$ boson, the corresponding Feynman diagram is shown in Fig. \[fig:tchan\_feynman\], the associated production of an on-shell $W$ boson and a top-quark, and the $s$-channel production and decay of a virtual $W$ boson.
![Leading order Feynman diagram for single top quark production in the $t$-channel.[]{data-label="fig:tchan_feynman"}](figs/singletop_t-ch_2to2.eps){width="35.00000%"}
The single top quark discovery has been reported by the Tevatron experiments [@Group:2009qk; @Aaltonen:2009jj; @Abazov:2009ii], based on a combination of $t$-channel and $s$-channel processes in 2009. The $t$-channel process has been observed at the Tevatron [@CDF-SGTOP-7.5; @Abazov:2011rz] and at the 7 TeV LHC by ATLAS [@Aad:2012ux] and CMS [@CMS:2012ep; @CMS:2013tch]. The current precision of the $t$-channel cross-section measurements at 8 TeV performed by ATLAS [@ATLAS8TeVtchan] and CMS [@CMS8TeVtchan] is about 15$\%$. Work is in progress to update these results with the full 2012 8 TeV dataset.
In this paper we explore the precision with which it will be possible to measure the single top quark production cross-section in the $t$-channel for three different scenarios: 300 fb$^{-1}$ of 14 TeV data with an average pileup of 50 events, also known as the Phase-1 running of the LHC upgrade; 3000 fb$^{-1}$ of 14 TeV data with an average pileup of 140 events, also known as Phase-2 running or the high-luminosity LHC (HL-LHC); and 3000 fb$^{-1}$ of 33 TeV data with an average pileup of 140 events, also known as the high-energy LHC (HE-LHC). For each scenario we use the appropriate Snowmass detector model. The analysis is performed using a simple cut-based approach to extract the $t$-channel signal. It is tuned to get at least a signal to background ratio of five in order to obtain a clean sample of $t$-channel single-top events.
This paper is organized as follows: Section \[sec:models\] describes the Monte Carlo samples that are used for this analysis. Section \[sec:analysis\] explains the event selection and the analysis strategy. Section \[sec:selection\] shows the final event selection and Section \[sec:conclusions\] gives our conclusions.
Signal and Background modeling {#sec:models}
==============================
The signal $t$-channel events are generated with Madgraph5 [@Alwall:2011uj; @MadAnalysis], with Pythia8 [@pythia; @pythiapgs] for parton showering and Delphes [@delphes3] for modeling of the Snowmass LHC detector [@Snowmasstwiki]. We consider inclusive $t$-channel events $\overline{b}~t$ and $b~\overline{t}$ and no attempt is made to separate top from antitop.
Background samples for W/$\gamma$/Z+Jets, diboson, $t\bar{t}$, and $Wt$ single top are used from the official Snowmass webpage [@Snowmasstwiki]. These samples are generated in bins of $H_T$, each with its own cross-section. Normalizations are made according to the cross-sections provided by the Snowmass site for the background samples and according to the leading order cross-sections provided by MadGraph for the signal samples. The total cross-section for the signal and backgrounds at 14 TeV and 33 TeV are listed in Table \[tab:xsecs\] and \[tab:xsecs33TeV\], respectively.
Sample Cross-Section \[pb\]
------------ ----------------------
t-channel 30.2
$W$+jets 238400
$t\bar{t}$ 578.5
Diboson 289.8
$Wt$ 72.1
: cross-sections for each background sample at 14 TeV.[]{data-label="tab:xsecs"}
Sample Cross-Section \[pb\]
------------ ----------------------
t-channel 493.5
$W$+jets 674860.6
$t\bar{t}$ 4014.8
Diboson 894.0
$Wt$ 492.6
: cross-sections for each background sample at 33 TeV.[]{data-label="tab:xsecs33TeV"}
Analysis {#sec:analysis}
========
For this analysis a cut-and-count method is used. To account for differences in generation, select the relevant event signature, and to provide object definitions the following basic event selection is applied, on which subsequent steps are based: $$\begin{aligned}
\textrm{One lepton (electron or muon) with }& \qquad p_{T}^{\ell}&\geq 40\,{\rm GeV}, \qquad
\left|\eta_{\ell}\right|\leq 2.5, \nonumber \\
\textrm{Two jets with }& \qquad p_T^j&\geq 70\,{\rm GeV}, \qquad
\left|\eta_{j}\right|\leq 4.5, \nonumber \\
\textrm{One b-jet with }& \qquad p_T^j&\geq 70\,{\rm GeV}, \qquad
\left|\eta_{j}\right|\leq 2.5, \nonumber \\
\textrm{Missing energy }& \qquad ~\etmiss &\geq 30~{\rm GeV} \nonumber \\
\label{eq:basiccut}\end{aligned}$$ where $p_{T}^{\ell}$ and $\eta_{\ell}$ correspond to the transverse momentum and pseudorapidity of the lepton, respectively, and $p_T^j$ and $\eta_{j}$ are the transverse momentum and pseudorapidity of each jet. For 33 TeV $p_{T}^{\ell}\geq$ 50 GeV and $p_T^j \geq$ 75 GeV are used.
The first line in tables \[tab:yields50\], \[tab:yields140\] and \[tab:yields33\] give the expected event yields for the signal and backgrounds with basic event selection for the different scenarios. At this stage the ratio of the signal contribution over the total background is about 0.13, with $t\bar{t}$ being the dominant background contribution.
Figure \[fig:prekinematics\] shows some kinematic distributions after the preselection cuts are applied. The contributions are broken into the $t$-channel single top signal events, other top events that correspond with $Wt$ and $t\bar{t}$, and other backgrounds that come from $W$+jets and diboson events (labeled as Boson on the plots). The expected events are normalized using the 14 TeV reference cross-sections and the integrated luminosity of 300 fb$^{-1}$. The distributions for 33 TeV are shown in Figure \[fig:prekinematics33\].
Event selection {#sec:selection}
===============
To improve signal to background ratio events are required to pass the following selection cuts for 300 fb$^{-1}$ at 50 pile up: $$\begin{aligned}
\textrm{Leading non-$b$-jet $\eta$}& \qquad \left|\eta_{\ell}\right|&\geq 3.0, \nonumber \\
\textrm{Top Mass}& \qquad 160\,{\rm GeV} \leq M_{top} &\leq 180\,{\rm GeV}, \nonumber \\
\textrm{Top P$_{\rm T}$}& \qquad T_{pt}&\geq 70\,{\rm GeV}\, \nonumber \\
\textrm{Top Polarization Optimal Basis}& \qquad T_{pol}&\geq 0\, \nonumber \\
\textrm{Scalar $H_T$}& \qquad H_T&\leq 300\,{\rm GeV}\, \nonumber \\
\label{eq:basiccut}\end{aligned}$$
For the 3000 fb$^{-1}$ scenario at 14 TeV, the same selection cuts are used except the $H_T$ cut, which is loosened to $H_T \leq 360\,{\rm GeV}$.
In the case of 33 TeV, the preselection is slightly modified increasing the lepton $p_T$ cut from 40 to 50 GeV and increasing the jet $p_T$ cut from 70 to 75 GeV. Moreover the final selection includes modifications of the same cuts as well as the addition of leading non-$b$-jet $p_T \geq 100$ GeV. The $H_T$ cut has been loosened to 550 GeV, the top polarization cut is tightened to 0.2, and the top $p_T$ cut has been tightened to 100 GeV. These differences select a kinematic region with the highest signal to background ratio while maintaining sensable cuts based on expected $t$-channel kinematics.
Figures \[fig:kinematics\] and \[fig:kinematics2\] show the effect of the cuts for the 300 fb$^{-1}$ 14 TeV sample. For each histogram, all cuts are applied except on the variable shown. Figures \[fig:kinematics33\] and \[fig:kinematics33\_2\] show the same for 33 TeV.
AT 14 TeV it is clearly visible that the most powerful variables to cut on are the leading non-$b$-jet $\eta$ and $H_T$, whereas the top mass, $p_T$ and polarization only add some additional discrimination. At 33 TeV, the distributions are broader and the available statistics are lower, but the leading non-$b$-jet $\eta$ and $p_T$ are powerful variables again, whereas now the separation power of $H_T$ is limited.
Tables \[tab:yields50\], \[tab:yields140\] and \[tab:yields33\] show the number of events passing each cut for 50 pile up at 14 TeV, 140 pile up at 14 TeV, and 140 pile up at 33 TeV respectively. The signal contribution over the total background after all cuts is about 7.3 for 50 pile up at 14 TeV, 8.2 for 140 pile up at 14 TeV, and 5.9 for 140 pile up at 33 TeV. The number of expected $t$-channel signal events is 6000, 9000, and 14000, respectively. These are large, clean event samples suitable for further single top studies.
Event Yield Signal $Wt$ $t\bar{t}$ diboson $W+\rm{jets}$ Total Background
-------------------------------- ---------- ---------- ------------ ---------- --------------- ------------------
no cuts 1.81e+07 2.10e+07 2.14e+08 1.09e+08 3.62e+07 3.80e+08
$+$ preselection 746000 439000 5.01e+06 122000 102000 5.67e+06
$+$ Leading non-$b$-jet $\eta$ 159000 13900 187000 3850 20200 226000
$+$ Top mas window 33600 1460 25700 105 1060 28300
$+$ Top $p_T$ 29300 1270 22100 97.8 964 24400
$+$ Top Polarization 22100 700 10600 74.3 769 12100
$+$ $H_T$ 6120 57.4 570 12.5 197 836
: Cutflow of signal and background yields in 300 fb$^{-1}$ at 14 TeV.[]{data-label="tab:yields50"}
Event Yield Signal $Wt$ $t\bar{t}$ diboson $W+\rm{jets}$ Total Background
-------------------------------- ---------- ---------- ------------ ---------- --------------- ------------------
no cuts 1.81e+08 2.10e+08 2.13e+09 1.09e+09 3.62e+08 3.79e+09
$+$ preselection 7.46e+06 4.23e+06 4.96e+07 1.22e+06 1.04e+06 5.61e+07
$+$ Leading non-$b$-jet $\eta$ 1.68e+06 189000 2.57e+06 52800 201000 3.01e+06
$+$ Top mas window 306000 17400 274000 2580 9970 304000
$+$ Top $p_T$ 263000 14300 229000 2530 8870 255000
$+$ Top Polarization 189000 8180 125000 481 6980 140000
$+$ $H_T$ 9380 115 672 0.0 345 1130
: Cutflow of signal and background yields in 3000 fb$^{-1}$ at 14 TeV.[]{data-label="tab:yields140"}
Event Yield Signal $Wt$ $t\bar{t}$ diboson $W+\rm{jets}$ Total Background
-------------------------------- ---------- ---------- ------------ ---------- --------------- ------------------
no cuts 2.52e+09 9.88e+08 1.13e+10 2.70e+09 8.28e+08 1.59e+10
$+$ preselection 1.66e+07 1.25e+07 1.60e+08 4.30e+06 2.04e+06 1.79e+08
$+$ Leading non-$b$-jet $\eta$ 5.25e+06 1.51e+06 1.98e+07 458000 585000 2.23e+07
$+$ Leading non-$b$-jet $p_T$ 3.74e+06 557000 8.13e+06 190000 426000 9.30e+06
$+$ top mas window 666000 47000 1.00e+06 10000 16800 1.07e+06
$+$ top Pt 595000 33000 842000 9200 14300 898000
$+$ Top Polarization 184000 8700 237000 2250 7970 256000
$+$ $H_T$ 14200 0.0 1710 54.0 650 2410
: Cutflow of signal and background yields in 3000 fb$^{-1}$ at 33 TeV.[]{data-label="tab:yields33"}
A $t$-channel cross-section measurement can be extracted in a simple analysis by assuming that the background is estimated with a large systematic uncertainty of 30% that accounts for both detector modeling (including jet energy scale and pileup and $b$-tagging) and theory uncertainties. No systematic uncertainty is assigned to the signal. The resulting signal uncertainty is then added in quadrature with the statistical uncertainty to give the total expected uncertainty shown in Table \[tab:xsprec\].
----------------------- ------------------- ------------------- -------------------
Collider statistical systematic total
uncertainty \[%\] uncertainty \[%\] uncertainty \[%\]
300fb$^{-1}$, 14 TeV 1.4 4.1 4.3
3000fb$^{-1}$, 14 TeV 1.1 3.6 3.8
3000fb$^{-1}$, 33 TeV 0.9 5.1 5.2
----------------------- ------------------- ------------------- -------------------
: Estimated $t$-channel cross section precision assuming a 30% background systematic uncertainty.[]{data-label="tab:xsprec"}
Even though the relative background uncertainty is large, the signal cross-section can still be measured with high precision because the selected sample consist almost entirely of $t$-channel signal events. The signal precision improves at the high-luminosity LHC due to the larger event sample.
Figures \[fig:afterkinematics\] and \[fig:afterkinematics33\] show kinematic distributions after all cuts for 300 fb$^{-1}$ at 14 TeV and 3000 fb$^{-1}$ 33 TeV, respectively.
Conclusions {#sec:conclusions}
===========
We have presented the $t$-channel single top quark production cross-section measurement for three scenarios, studied within the context of the Snowmass energy frontier group: 300 fb$^{-1}$ of 14 TeV $pp$ data with an average pileup of 50 events, 3000 fb$^{-1}$ of 14 TeV $pp$ data with an average pileup of 140 events, and 3000 fb$^{-1}$ of 33 TeV $pp$ data. For each the appropriate Snowmass detector models are used. The $t$-channel events are selected in the lepton+jets top quark decay mode. The background consists mainly of $W$+jets and top quark pair events. The $t$-channel signal is isolated through a series of cuts, resulting in large, pure event samples. The expected $t$-channel cross-section precision is about 5% or better.
We acknowledge the support of the entire Snowmass effort, in particular the samples provided by the energy frontier. This work was supported in part by the U.S. National Science Foundation under Grants No. PHY-0952729 and PHY-1068318.
| 2024-06-13T01:26:29.851802 | https://example.com/article/7926 |
Q:
Creating & running Windows virtual machines?
What's the recommended way to run virtualised Windows environment on top of Ubuntu nowadays?
I need to create new Windows virtual machines too, not only use existing ones, so, to my understanding, VMware Player would not be enough.
I've used VMware Server earlier, but I'm having too many problems getting its latest version to work on latest Ubuntu (11.04)... Probably related to this:
VMware has declared VMware Server End
Of Availability on January 2010 with
the actual support ending on June
30th, 2011. [...] Furthermore, VMware Server is
not officially supported on Ubuntu
releases greater than 8.04.
So, are there any good alternatives to VMware Server?
A:
VirtualBox
Originally a commercial product VirtualBox is now open source. The open source version lacks only few features. Having said that VirtualBox is still a great virtualization tool and future versions look very promising. Like all other virtualization software VirtualBox allows you to run a guest operating systems on your PC, in this case either Windows or Linux based. The guest operating system support covers most Windows (including Vista) and Linux versions as well as OS/2 Warp, OpenBSD and FreeBSD.
VirtualBox is a stable tool with performance similar to it's commercial counter pieces. A product well worth trying out
Xen
Xen is state-of-the-art virtualization on the PC - and it is even open source. With a high performance mainly due to it's architecture with the hypervisor and it's support for hardware virtualization - Xen sets a new standard for virtualization software. Already used in many data centers Xen has shown that it is stable and a product you can rely upon. It matches almost any feature you get from commercial virtualization software - but includes the most advanced such as virtual machine relocation and per virtual machine resource guarantees.
OpenVZ
OpenVZ is a great alternative to standard virtualization offerings on the market, that unlike most other products only offers operating system level virtualization - and only on Linux. However, this is also it's strength - but no providing a complete virtual pc to run any operating system, OpenVZ's shared operating system provides better utilization of your server hardware.
Every virtual server running under OpenVZ has full root access, but OpenVZ makes sure that there are no conflicts between the different virtual server. Thus, each server has it's own IP addresses, dedicated memory, application, libraries and so on.
OpenVZ is backed by SWsoft and could be considered an open source edition of the Virtuozzo product.
Cooperative Linux
coLinux is an extremely interesting new approach to virtualization allowing you to run Linux parallel to your Windows platform. coLinux approaches the experimenting Linux novice - who does not actually want to install the operating system on a fresh machine. Another target group is the Linux enthusiast, in that coLinux also makes it possible for him to run Linux on his Windows machine without using a standard virtualization product with large requirements to system resources.
coLinux seems to be a promising ongoing project - and a worthy competitor to other virtualization products on the market. It might not be completely fool proof for beginners, but it may become more so as it matures.
Source
A:
My preferred preference is VirtualBox. The latest version from Oracle has full USB support if you install the VirtualBox Guest Additions.
Follow the downloads link here to install the correct version for your architecture - i386 for 32bit and AMD64 for 64bit.
| 2024-01-29T01:26:29.851802 | https://example.com/article/5393 |
BALKANS TRAGEDY
Nura Alispahic is a Srebrenica commuter. Twice a month she and her grown daughter Magbula take a bus from their home in Tuzla, three hours away, to the mining town in the Bosnian mountains, scene of Europe's worst massacre since the Nazi death camps. On July 11, 1995, Serb troops led by Gen. Ratko Mladic took prisoner and slaughtered at least 7,800 Muslim men and boys in Srebrenica. There are so many women like them--widows, fatherless daughters, brotherless sisters--that the town of only 3,500 residents is served by four daily buses from Tuzla and Sarajevo, two hours away. Nura and her daughter stop at the cemetery in the village of Potocari, where the 1,400 victims recovered so far--including Nura's son Azmir--are buried. Then they visit their empty and half-ruined house, and by evening they're on the bus back. "I couldn't spend a night there," says Magbula. "When I enter the town, I feel the creeps, like watching someone entering a town in a horror movie."
Back in Tuzla, where they live in modest refugee housing, Nura and Magbula have recently been watching another real-life horror movie, a homemade videotape released by the war-crimes tribunal at The Hague on June 1 showing a Serb paramilitary unit, the Scorpions, joyfully executing six Srebrenica captives. Nura remembers the first time she saw the clip, which was aired repeatedly all last month on Bosnian TV networks. "The announcer said, 'Now a mother will see her son and a sister will see her brother,' " Nura says, and that is indeed what happened. Nura immediately recognized Azmir, a 16-year-old who wanted to be a doctor, and watched the last 10 minutes of his life. "My son, they killed you!" she cried the first time she saw a Serb soldier shoot him twice in the back. One of the killers has been identified by Serbian police as Branislav Medic, a car mechanic from Stejanovici in Serbia, the father of four girls. "My child turned back as if looking for help and they killed him twice," she says. (Azmir was still alive after the first shots, so his killer shot him three more times.) "They were chewing gum. It was fun to them," she says. Azmir was barefoot, she couldn't help but noticing with maternal outrage.
Nearly a decade after the Dayton peace accords brought to an end the Bosnian civil war, the wounds of that conflict are still smarting. "This war was finished without a victorious side or a defeated side, so everyone won and everyone lost. There was no accepted version of what happened," says Zdravko Grebo, a prominent law professor at the University of Sarajevo. (He calls Dayton "that Frankenstein document.") While the accords ended the fighting, they also enshrined the country's internal divisions by creating two "entities"--the Republika Srpska and the Muslim-Croat federation, each with its own police and army and bureaucracy--alongside a central government with a three-member presidency, representing Croats, Muslims and Serbs. The result is a country with five presidents, two prime ministers--and a host of international agencies that really run things. In villages and towns across Bosnia, people live more apart than even during the war. There is scarcely a single Serb-owned shop now in Sarajevo, a once proudly multi-ethnic city. Children go to separate schools, live in separate communities, look to ethnically based police forces to protect them. Those in the Serb entity consider themselves part of neighboring Serbia, rather than as Bosnians. Croatians in Herzegovina, the other half of Bosnia and Herzegovina, consider themselves Croats marooned in the wrong nation-state.
The mix is inherently combustible. Paddy Ashdown, the high representative of the international community--and essentially the benevolent dictator of Bosnia--holds the place together largely by fiat. He has sweeping powers to remove officials and enact laws by decree. Two presidents have been forced out by him, and to compel the Serbs to own up to the Srebrenica massacre at long last, he first had to cashier 50 officials. Finally last year, the Bosnian Serb president, Dragan Cavic, conceded that in Srebrenica "several thousand Bosniaks were liquidated in a way that is in severe violation of international humanitarian law," a circumlocution that managed to avoid using words like massacre or genocide. A report released only this March by the Bosnian Serb entity--which encompasses Srebrenica--at last listed the names of many of the 800 perpetrators of the massacres.
Such documents may be too little, too late to promote grass-roots healing. Srebrenica today looks if anything even worse than my last visit there, in 1996 just after the Dayton accords were signed. Many of the buildings have been rebuilt, including the mosque, which had been so thoroughly destroyed that only a single stone remained--now enshrined with a plaque in the wall of the new building funded by Malaysia. But the town still resembles a war zone, dirty and poorly maintained, scarred by bullet holes and weighed down by an air of resignation. In 1996 Srebrenica was crowded with Serbs--both original residents and Serb refugees fleeing parts of Bosnia handed over by Dayton to the Muslim-Croat federation. Now many of those Serbs have been evicted by the original Muslim owners, people like the Alispahics. The Muslims may have reclaimed their homes on paper, but in practice most don't want to live there again. The town is strikingly empty as a result.
Mujo Sirucic was the first Bosnian Muslim to return to Srebrenica, in 1999, and at the time he was escorted everywhere by police, with a police car parked in front of his home, burned down by the Serbs and rebuilt by Catholic Relief Services. "The process of return is already ended or close to the end, but the leaving is not over. Now there are a lot of Serbs who want to leave the town," he says. He and his wife are among the few Muslims of working age, with children in the school--a Serb-dominated school, with crosses and icons in every classroom. On his old street there were once 400 residents; now there are 15. "Sometimes I ask myself, Where am I? What can my children do here? We don't lack anything here, we have everything but people."
Serbs were about a fourth of the population before the war, Muslims most of the rest. Now only 17 percent of the town's 3,500 residents are Muslims; in the surrounding district, 40 percent of 10,000 returnees are Muslim. "This is a ghost town, a town without life, not a drop of blood in it," says Radomir Pavlovic, a medical doctor and one of the Serbs on the municipal council. Pavlovic blames everyone from the Republika Srpska government, which he says ignores the enclave now despite its Serb population, to the Bosnian-Croat federation, which hasn't helped Muslims or Serbs who want to rebuild, to the international community "who have just forgotten about Srebrenica." But he also blames his fellow Serbs. "Many don't believe what happened here, but if we cannot admit the truth about the past, we cannot go into the future."
Srebrenica is in that sense a powerful if extreme symbol for Bosnia as a whole. Efforts to build national institutions have foundered. A unified army exists now on paper, but when Serb recruits were asked to take an oath to it in May, they refused; the head of EUFOR, the European force of 6,000 troops garrisoning the country, ordered the Serb Army chief sacked. Croat recruits took the oath, but only while playing the Croatian national anthem, rather than the Bosnian one.
The divisions keep the threat of violence alive, if subdued. In a recent poll conducted by the United Nations Development Program, a fourth of Bosnians said they thought the war would resume if foreign forces left the country, and nearly two-thirds said they thought the country's situation was worsening. Ashdown disagrees: "I don't accept the argument if troops left today they'd be back to fighting tomorrow." "I think there is no appetite for a resumption of hostilities," says Maj. Gen. David Leakey, the British commander of EUFOR. "People are exhausted, physically and mentally. Ordinary people want no more war." He asked his own interpreter, a Bosnian, what he thought would happen if foreign troops left. The man gave the country 10 days before degenerating into violence again.
While Ashdown says he's looking forward to transferring more of his powers to the Bosnian government this year, he still expects a new high representative to replace him when he leaves at the year-end. Perceptions that the mission is dragging on longer than it should, Ashdown says, are "the fault of politicians. We actually said we'd be in for a year--complete nonsense. It's not about mending the buildings, it's what goes on in people's heads. You're a fool if you believe it can be done in a year or two years and it's about time politicians told the truth about it." But he still insists things are going well. "The miracle in Bosnia is how much has been done in 10 years. A sixteenth of the population was killed, more than in France after World War II, half the population made homeless, 90 percent of the buildings destroyed. We have lost touch with how long it takes; healing is always measured in decades."
To be sure, Bosnia can boast several victories in the last decade. Not a single international peacekeeper has lost his life in hostile actions. No serious fighting has resumed between the ethnic communities. Elections took place peacefully. The first steps have been taken on applying to join the European Union, one of the few things all sides agree on in Bosnia. Yet when the Srebrenica anniversary arrives, it will be a commemoration of failure. Carla del Ponte, the prosecutor for the U.N.'s war-crimes tribunal at The Hague, announced that she would not even attend unless Mladic and Radovan Karadzic, the former Bosnian Serb president, have been arrested by then. Del Ponte has criticized NATO and EUFOR, as well as Bosnian authorities, for not trying hard enough to catch them; the last ten war-criminal arrests were negotiated surrenders, and while there are rumors that such negotiations are going on for Mladic, no one expects Karadzic to come in anytime soon. "As long as the two persons primarily responsible for the Srebrenica genocide are at large, I cannot participate. I cannot face the victims," Del Ponte declared last month.
And even as the unresolved Bosnian conflict claims one set of victims, its animosities are creating another. The Scorpions videotape had been available for months at a video-rental store in the Serbian border town of Sid before someone last year turned a copy over to The Hague. While Nura watched her son killed by the man identified as Medic, the accused killer sat in Serbia watching his past unfold before him, with his own daughters sitting at his side. "The police will come," he told his family. "I might not be back." He fled but was arrested a few days later. His teenage daughter, shocked into silence, has been unable to speak since. | 2024-03-22T01:26:29.851802 | https://example.com/article/4258 |
Q:
Virtual inheritance / Polymorphism
So I'm looking at some weird cases of Polymorhpism and
ambiguity. And there's one case which I cannot understand. I don't understand why the last line of the code below act this way.
#include <stdio.h>
#include <iostream>
class Article
{
public :
virtual bool compare(Article *a) { std::cout << "ACA" << std::endl;}; // ACA
};
class Clothe : public Article
{
public :
bool compare (Clothe *c) { std::cout << "CCC" << std::endl;}; // CCC
bool compare (Article *a) { std::cout << "CCA" << std::endl;}; // CCA
};
int main()
{
Article *pta1 = new Article;
Article *pta2 = new Clothe;
Clothe *ptv1 = new Clothe;
pta1->compare(pta2); // print ACA
pta2->compare(pta1); // print CCA
pta2->compare(pta2); // print CCA because compiler needs to explore pta2 to determine which compare to use.
// pta2 is instanced as a Clothe, so one of Clothe's compare will be called.
// And judging by its declaration pta2 is an Article (even thought it's instanced as a Clothe),
// so it will Call Clothe::Compare(Article*). I'm OK with this
pta2->compare(ptv1); // print CCA ??? WHY , pta2 is explored, thus it's type is determined to be of type Clothe.
// And ptv1 is declared as a Clothe, so it should call Clothe::compare(Clothe* c)
// should print CCC, shouldn't it ?
}
I'm lost. I don't understand how g++ resolve the ambiguity that way.
Any help / explanation would be nice. Thanks for reading, and even more thanks to those who answer.
PS : I know compare should return bool, but it's not really important here.
EDIT : typo slided during my on-the-fly translation of variable names, names were originally in french sorry for that. It's fixed now
A:
This line
pta2->compare(ptv1);
prints CCA because there is only a virtual function bool compare(Article *a) in the base class.
Your assumption about pta2 is wrong.
pta2 is explored, thus it's type is determined to be of type Clothe.
Which is not the case. The type of pta2 is Article * and nothing else. It only points to a Clothe object and it is therefore possible to call functions of Clothe through it, if (and only if) they are present and virtual and the base class and overrided (with the same Signature!) in the derived class.
Simply speaking:
The compiler can only "find" overloads in the derived class which are present and virtual in the base class if the call is performed via base class pointer.
What is happening here:
pta2 is a pointer to Article. Thus, when calling compare, the different possibilities of compare functions in Article are considered.
The only match is bool Article::compare (Article *a).
Now the compiler finds compare in Article to be virtual and uses some internal mechanism to make a virtual call through the 'vtable' of the object.
As Clothe overrides bool compare (Article *a), the overrided function is called.
The Base class knows nothing about bool compare (Clothe *c) since it does not know anything about Clothe and therefore the output is not CCV.
| 2024-02-28T01:26:29.851802 | https://example.com/article/3519 |
Q:
Webpack bundle ENOENT: no such file or directory fs.readdirSync
We would like to create micro apps that run on AWS Lambda. We are investigating webpack 2 for this. However, we have legacy code that uses fs.readdirSync to get a list of file/module names to generate a module list. When executing the bundle we get an error Error: ENOENT: no such file or directory, scandir '/innerLib' because webpack does not know to execute fs.readdirSync(path.resolve(__dirname, 'innerLib')); in file lib/lib.js and resolve an array of file names during bundle time.
What approaches can we take with wepback without making major changes to the legacy code. I have included a simple example below and on github
webpack.config.js
var path = require( 'path' );
var webpack = require( 'webpack' );
module.exports = {
context: __dirname,
entry: ['./index.js'],
output: {
filename: 'bundle.js',
},
target: 'node',
}
index.js
const lib = require('./lib/lib.js');
lib.getModuleList((err, modules) => console.log(modules));
lib/lib.js
const fs = require('fs');
const path = require('path');
let moduleList = [];
let list = fs.readdirSync(path.resolve(__dirname, 'innerLib'));
exports.getModuleList = getModuleList;
function getModuleList(callback) {
return callback(null, moduleList);
}
list.forEach(filename => {
moduleList.push({
name: filename
});
});
lib/innerLib/a.js
console.log('a lib loaded');
lib/innerLib/b.js
console.log('b lib loaded');
A:
Your problem is that __dirname is resolving to /. To get it to work with webpack, set:
node: {
__dirname: true
}
in your webpack.config.js. After adding that, your bundle executes fine for me.
| 2024-02-08T01:26:29.851802 | https://example.com/article/8970 |
2018 Tax Changes for Families and Homes
During the holiday season, new tax legislation passed by Congress and President Trump made the headlines. The Tax Cuts and Jobs Act of 2017, signed by President Trump on December 22, 2017, is the first major tax overhaul in 30 years. While the new bill will be analyzed, debated, and clarified further throughout the year, you will find that it might affect many areas of your financial life, such as some of your employee benefits or your charitable giving. Your withholding may change beginning in February.
Your family
The marriage penalty is mostly gone. The married filing jointly income thresholds are now double the single thresholds for all but the two highest tax brackets—previously, the thresholds were not aligned so precisely. So for most filers, the penalty is gone. The exception now is the two top brackets, in which combined income is greater than $400,000.
THINGS TO KNOW
While the standard deductions have nearly doubled, the personal exemptions are gone.
Starting in 2019, the individual mandate of the Affordable Care Act is repealed.
The personal exemption is now gone. This exemption—which would have been $4,150 in 2018—was an additional amount that could be deducted for oneself and, in certain cases, additional times based on the number of a taxpayer’s dependents.
Alimony deduction is no longer deductible by the payer.Alimony will no longer be deductible by the payer, nor will it be includible in the recipient’s income, for divorces and separations signed after December 31, 2018.
The family tax credits increase. The child tax credit doubles from $1,000 to $2,000; $1,400 of this amount is refundable. There is a new $500 credit for other dependents; this credit did not exist previously.
The child and dependent care credits stay put. This credit remains as is—$1,050 for one child under 13 or $2,100 for two children. Dependent care flexible spending accounts can still exempt up to $5,000 of income.
The “kiddie tax" changes a little. Before the new law, a child’s unearned income (such as that from investmentportfolios) that was less than $2,100 was taxed at the child’s tax rate, and anything over that was taxed at the parents’ tax rates. Under the new law, the child’s unearned income will be taxed using the brackets used by trusts and estates. However, tax rates on earned income (such as that from a job) do not change.
Your home
Casualty loss deduction is now limited. Casualty losses (such as those from fire, flood, burglary, etc.) will be deductible only in a disaster that is declared by the president.
Mortgage interest deduction is reduced. The deduction for newly bought homes and second homes is lowered from $1 million to $750,000. Interest on home equityloans is no longer deductible beginning in 2018 unless the loan money is used for home improvement purposes.
State, local, sales, and property tax deduction is now capped. The new 2018 law caps this deduction at $10,000; previously, it was unlimited.
The interest deduction for home equity loans. This popular deduction, which was previously limited to home equity loans up to $100,000 ($50,000 if you are married and file separately), was removed by the recent tax law, beginning in 2018.
And a few more
The individual mandate and healthcare deductions. Starting in 2019, the individual mandate of the Affordable Care Act (aka Obamacare) is repealed, meaning that there will no longer be a penalty for not having a health insurance plan. That also means the penalty will still be in force throughout 2018, as planned. The out-of-pocket medical expense deduction (which is one of the itemized deductions) drops from 10% to 7.5%, but only for 2017 (retroactively) and 2018, after which it reverts to 10%.
Charitable contribution deduction changes a little. The charitable contribution is a favorite of many taxpayers because it allows them to donate money or items and get a tax deduction for them. Given the near doubling of the standard deductions, however, the tax effects of donating might be moot for you.
The deduction has the following two changes: one, taxpayers can deduct donations of up to 60% of their income instead of last year’s 50%; and donations you make to a college in exchange for the right to buy athletic tickets are no longer deductible.
About Financial Fitness Group
Financial Fitness Group (FFG) is an enterprise software company that developed a financial e-learning platform and actionable ecosystem designed to teach individuals the language of money. FFG is the leading provider of interactive financial education for the financial services industry and fortune 500 companies across the nation. Our cloud-based, independent and unbiased financial education and engagement platform, assesses and benchmarks participants overall financial fitness. | 2024-06-13T01:26:29.851802 | https://example.com/article/6647 |
Gold medal award-winning IPA has bold-yet-balanced blend of hops with citrusy, earthy hop aromas, complemented by bready maltiness and caramel flavours
VANKLEEK HILL – (Mar. 23, 2015) Beau’s Brewery has brought back their award-winning spring seasonal IPA for a 2015 engagement. Beaver River is an assertive yet-very-drinkable India Pale Ale that marries the typical flavour profiles of the British and American interpretations of this hoppy beer style. Beaver River will be available for sale this week at most LCBOs in Southern and Eastern Ontario, and will also become available in Québec later this spring.
Beaver River won Gold at the Canadian Brewing Awards in both 2011 and 2013. The 5.6% alc./vol. IPA is unfiltered to allow a full spectrum of bready malt and caramel flavours to come through, and it is dry-hopped to further amplify the bold-yet-balanced citrusy and earthy hop aromas. Weighing in at 60 IBUs (International Bitterness Units), this year’s hop blend showcases Cascade, Pacific Gem and Magnum varieties. First brewed by Beau’s in 2008, Beaver River was named in honour of the “Rivière Castor” in Eastern Ontario, which connects Ottawa to many small Ontario communities to the east of the city.
Beaver River is packaged in Beau’s signature 600 ml bottles, and retails for $4.55 in Ontario. It is available this spring in LCBOs (www.lcbo.com), at the brewery retail shop in Vankleek Hill, and for home delivery in the City of Ottawa through home delivery service BYBO (www.bybo.ca). It will also be available on tap at a selection of bars and restaurants throughout Ontario – a list of places to find Beau’s beer on tap is available at www.beaus.ca. Details about Québec availability will follow in a release later this month.
Beau’s All Natural is a local, family-run, award-winning, certified organic, and totally DIY craft brewery. Founded in 2006, Beau’s brews interesting, tasty beers, including its flagship Lug Tread Lagered Ale, using best-quality certified organic ingredients & local spring water. In addition to Lug Tread,Beau’s offers a growing collection of Year-Round Beers and a rotating Seasonal program, as well as the “Wild Oats” and “Pro-Am” Series. Beau’s has been a recipient of more than 70 awards for brewing, packaging design and business practices, including 2 Gold medals at Mondial de la Bière (Strasbourg, France, and Montréal, Québec); 6 Gold medals at the Canadian Brewing Awards, 7-times “Best Craft Brewery in Ontario” (2007-2013) and 6-times “Best Craft Beer in Ontario” (2007-2011; 2014) at the Golden Tap Awards. As a Certified B-Corporation, Beau’s meets higher standards of social and environmental performance, transparency, and accountability. Beau’s beer is available in Ontario, Québec, and New York State. Oh yeah!
Website: www.beaus.ca
Twitter & Instagram: @beausallnatural
Facebook www.facebook.com/beausbrewery
Full Audio Of This News Piece | 2024-02-01T01:26:29.851802 | https://example.com/article/2370 |
Ron Johnson uses altered data to blame opioid crisis on Medicaid
GOP Senator used incomplete data to produce a report and justify his hearing.
Sen. Ron Johnson (R-WI) omitted key facts at a hearing Wednesday in his attempt to highlight Medicaid’s role in fueling the opioid crisis. The Homeland Security and Governmental Affairs Committee, which he chairs, released a report the same day, drawing connections between the public insurance program and opioid epidemic.
Johnson asked his staffers to investigate the relationship and draft a report after he read an anecdote from journalist Sam Quinones’ 2015 book “Dreamland: The True Tale of America’s Opiate Epidemic.” Quinones wrote, “For a three-dollar Medicaid co-pay … addicts got pills priced at thousands of dollars, with the difference paid for by U.S. and state taxpayers. A user could turn around and sell those pills, obtained for that three-dollar co-pay, for as much as ten thousand dollars on the street.”
Advertisement
The report found about 1,000 instances between 2014 and 2017 in which Medicaid insurance was improperly used to obtain prescription pills and, in some cases, was illegally resold. This was, according to Johnson, more pronounced in states that expanded Medicaid eligibility through the Affordable Care Act (ACA).
The report fails to include how Medicaid fairs with other insurance types. It mentions preliminary research into opioid-related Medicare fraud but makes no mention of private insurance.
Moreover, the report draws connections between Medicaid and the opioid epidemic in an insular way and negates how various players in the health care system — doctors, pharmaceutical companies, etc. — contribute to this evolving crisis, which accounted for 64,000 overdose deaths in 2016 and helped shorten life expectancy for a second consecutive year.
“I do not believe that Medicaid should be singled out in this regard,” said Andrew Kolodny, co-director at the Opioid Policy Research at Heller School in Brandeis University, during the hearing.
Advertisement
But Johnson did just that, stressing his point through a misleading chart during a Q&A with Kolodny. He asked Kolodny to react to data from his report, which Johnson likened to Kolodny’s own chart presented moments before.
“We actually developed this off the hard numbers,” Johnson said. His chart, below, shows opioid-related hospital use by the expected insurance provider:
But this is the complete chart, which Johnson cites but alters in his report, provided by Healthcare Cost and Utilization Project:
“It’s misleading to only select Medicaid and private insurance,” Rebecca Haffajee, assistant professor at the University of Michigan’s School of Public Health, told ThinkProgress. “All four rates are increasing for all four populations.”
Advertisement
While the public tends to look at the rising mortality rate as an effect of the opioid crisis, it’s important to also look at hospital stays. “For every death there is a thousand hospitalizations — hospital stays,” said Haffajee. Johnson’s skewed chart doesn’t present a convincing case for the “deluge of victims” (Johnson’s words, not Haffajee’s) on Medicaid insurance, she added.
When speaking of hospitalizations for opioids — heroin included — in a recent Health Affairs report, Kolodny said, “What we saw in that chart was a very significant rise for all payer types including self-pay. And what we saw in the Health Affairs paper — we saw a substantial increase for Medicaid, but an even greater increase for Medicare.”
Johnson took Kolodny’s point and added, “all we did was just take [federal data] and put it to number per hundred thousand just to make it more a little bit relatable.” But that’s not all he and his staff did; he used incomplete data to produce a report and justify his hearing.
“Opioid overdoses have been increasing in people with all types of insurance and in people from all economic groups, from rich to poor,” said Kolodny earlier in the hearing. While it’s important to understand how insurance companies play into the nonprescription of opioids, it’s also important to point out the role of insurance in covering addiction treatment.
Haffajee said Medicaid is fairly generous, and the plans cover at least one of three types of medication-assisted treatments — the gold standard of care — in all 50 states. “Sometimes [we] might see adverse outcomes, not because insurance causes this, but [it] has to do with life conditions,” she said. | 2023-09-26T01:26:29.851802 | https://example.com/article/1603 |
Q:
$\int_0^1 x^{\alpha-1} (1-x)^{\beta-1} (x-A)^{\gamma-1} \mathrm{d} x$, where $\alpha,\beta,\gamma \ge 1$, and $A < 0$.
Is there an analytical expression for this integral?
$$\int_0^1 x^{\alpha-1} (1-x)^{\beta-1} (x-A)^{\gamma-1} \mathrm{d} x$$
where $\alpha,\beta,\gamma \ge 1$, and $A < 0$.
P.S.: By analytical expression, I mean, pragmatically, an expression in terms of functions usually found in numeric computation libraries.
A:
What is amazing is that the antiderivative can be analytically expressed on the basis of Appell hypergeometric functions of two variables. For the integral, similar to what O.L. answered, I (a CAS did it !) obtained
$$\int_0^1 x^{\alpha-1} (1-x)^{\beta-1} (x-A)^{\gamma-1} \mathrm{d} x= (-A)^{\gamma-1}\Gamma (\alpha) \Gamma (\beta) \, _2\tilde{F}_1\left(\alpha,1-\gamma;\alpha+\beta;\frac{1}{A}\right)$$ where appears the regularized hypergeometric function which can be expressed using, from definition, the classical hypergeometric function
A:
The integral can be expressed on a closed form, thanks to the Hypergeometric2F1 function :
| 2024-02-18T01:26:29.851802 | https://example.com/article/9383 |
Q:
Are permissions on individual reports in SSRS overridden when redeployed?
Is it possible to set permissions on a report individually in the native SSRS portal?
If so, when re-publishing the reports, is the security on the individual report lost? Is there a way to avoid this in that case?
https://technet.microsoft.com/en-us/library/aa337494(v=sql.105).aspx
A:
Yes, you can break inheritance on the security to manage each item individually.
No, the report designer tools have no concept or knowledge of the security on the report server website
| 2024-05-11T01:26:29.851802 | https://example.com/article/8076 |
Larry David Criticized for 'SNL' Monologue on Jewish Sexual Predators and Holocaust
"Just when you thought Larry David's 'SNL' monologue couldn't get worse, he joked about seducing women in concentration camps. Wow."
Larry David made his return to NBC's Saturday Night Live this weekend to talk about sexual harassment, Jewish people and concentration camps, which immediately drew some criticism on social media.
In response to the sexual abuse scandal plaguing Hollywood — in which several of the town's biggest names including Harvey Weinstein, Dustin Hoffman, Brett Ratner and Kevin Spacey have been accused of sexual harassment and, in some cases, assault and rape — David joked in his opening monologue, "A lot of sexual harassment stuff in the news, and I couldn't help but notice a very disturbing pattern emerging, which is that many of the predators, not all, but many of them are Jews."
He continued, "I don't like when Jews are in the headlines for notorious reasons. I want 'Einstein Discovers the Theory of Relativity,' 'Salk Cures Polio.' What I don't want? 'Weinstein Took It Out.'
"I know I consistently strive to be a good Jewish representative," David added, before saying that he sometimes wonders if, had he been alive during Hitler's time, he would have been compelled to date women while in a concentration camp. He then imagined how such a scene would play out.
"The problem is there are no good opening lines in a concentration camp. 'How's it going?' 'They treating you OK?' 'If we ever get out of here, I'd love to take you out for some latkes,'" David quipped.
Several viewers took issue with his jokes. One tweeted, "Just when you thought Larry David's #SNL monologue couldn't get worse, he joked about seducing women in concentration camps. Wow. #HeBombed."
Someone else wrote, "Larry David bombing in opening monologue. Who the hell at SNL thought this was going to be funny."
Still another said, "Larry David is making jokes about Hitler and harassment of women! God this is awful and awkward!"
The Seinfeld co-creator and creator-star of HBO's Curb Your Enthusiasm also talked about his dating life during the bit. "I used to keep a condom in my wallet; now I just have a little booklet listing which fish had the highest mercury content. Really cool guy, you wanna seal the deal, whip out that booklet at dinner," he joked.
David previously wrote for SNL. He also famously impersonated Sen. Bernie Sanders during then-presidential candidate Donald Trump's controversial hosting gig in November 2015 (where he also heckled Trump from the audience during his opening monologue), and Sanders himself made a cameo during David's first hosting gig in February of last year. | 2024-06-08T01:26:29.851802 | https://example.com/article/7605 |
Q:
How to horizontally align items with equations in multicols package
I am using the multicols package in combination with enumerate environment, with equations in each item. Each item is aligned horizontally with its equation, and I like that. Whay I dont like is that items are not aligned horizontally between them. There a solution for align items horizontally between them, with this package, or another one?
This is a MWE:
\documentclass[12pt]{article}
\usepackage{multicol}
\begin{document}
\begin{multicols}{4}
\begin{enumerate}
\item $\displaystyle \frac{1}{1+\frac{1}{x}}$
\item $\displaystyle \frac{1}{1+\frac{1}{x}}$
\item $\displaystyle 1+x$
\item $\displaystyle 1+x$
\end{enumerate}
\end{multicols}
\end{document}
A:
This numbers horizontally rather than in columns, but doesn't need any packages:
\documentclass[12pt]{article}
\newcommand\z[1]{%
\baselineskip3\normalbaselineskip
\makebox[.25\textwidth][l]{%
\refstepcounter{enumi}%
\makebox[2em][l]{\theenumi.}%
$\displaystyle#1$}\linebreak[0]\hfill\ignorespaces}
\begin{document}
\begin{center}
\z{\frac{1}{1+\frac{1}{x}}}
\z{\frac{1}{1+\frac{1}{x}}}
\z{1+x}
\z{1+x}
\z{\frac{19}{1+\frac{1}{xkkk}}}
\z{\frac{1}{1+\frac{1}{x}}}
\z{\frac{1+x}{2}}
\z{z+x}
\end{center}
\end{document}
A:
May be you are safe with tasks
\documentclass{article}
\usepackage[more]{tasks}
\begin{document}
\begin{tasks}[style=enumerate](4)
\task $\displaystyle \frac{1}{1+\frac{1}{x}}$
\task $\displaystyle \frac{1}{1+\frac{1}{x}}$
\task $\displaystyle 1+x$
\task $\displaystyle 1+x$
\end{tasks}
\end{document}
Or with enumitem
\documentclass[12pt]{article}
\usepackage[inline]{enumitem}
\begin{document}
\begin{enumerate*}[itemjoin=\hfill]
\item $\displaystyle \frac{1}{1+\frac{1}{x}}$
\item $\displaystyle \frac{1}{1+\frac{1}{x}}$
\item $\displaystyle 1+x$
\item $\displaystyle 1+x$
\end{enumerate*}
\end{document}
| 2023-08-21T01:26:29.851802 | https://example.com/article/1783 |
Q:
Palatino text with CMR math in beamer?
I've tried so many combinations, but I can't get it to work. I'd appreciate any suggestions.
A:
Use the serif option to set the default family to roman, then set \rmdefault and \mathfamilydefault as you please:
\documentclass[serif]{beamer}
\renewcommand\rmdefault{pplx}
\renewcommand\mathfamilydefault{cmr}
\begin{document}
\begin{frame}{Frametitle}
Some text\\
$E=mc^2$
\end{frame}
\end{document}
Note: Next time, please post a minimal working example (MWE) outlining at least one of the 'many combinations' you tried ;-)
| 2023-12-19T01:26:29.851802 | https://example.com/article/6168 |
An aggressive race of aliens took over Planet Earth and humanity"s at its end, living in giant bunkers below ground. Young Military rookie S.U.M.1 (Iwan Rheon) is sent to the surface to save a group of unprotected survivors.
An aggressive race of aliens took over Planet Earth and humanity's at its end, living in giant bunkers below ground. Young Military rookie S.U.M.1 (Iwan Rheon) is sent to the surface to save a group of unprotected survivors. | 2024-05-15T01:26:29.851802 | https://example.com/article/1814 |
Q:
cfupdate error: how to see more debug information
I'm having a problem with a recent database crash. After recovering the data, I now get some odd parse errors, but it isn't clear if it is in the data, or if it something else. See the attached image, but it is from a form submit that cfupdate is storing data to table.
There is an input button called "next" in the form and that content gets saved to the DB.
So I have the following question:
Is there a way to see what the SQL Query is and where that error occurred?
Any clues or hints to why I'm getting this error?
Any way to see more information that might help? Debug mode?
This is running on ColdFusion MX7 with MS Access Database.
The error:
Error Executing Database Query.
Syntax error: Stopped parse at NEXT
The error occurred in \\******\scholardetails2_en.cfm: line 19
17 : <!--- if coming from page1, save data to database and renew session.txtEmail --->
18 : <cfif IsDefined("Form.txtFirstName")>
19 : <cfupdate dataSource="****" tableName="tblApplications">
20 : <!--- <cfset Session.txtEmail=Form.txtEmail> --->
21 : <!--- <cfset Session.language=Form.language> --->
SQL update tblApplications set TXTDOB= (param 1)
,TXTPFIRSTNAME= (param 2) ,TXTPOB= (param 3)
,TXTFLYNAME= (param 4) ,TXTOFFNAME= (param 5)
,TXTOFFCITY= (param 6) ,TXTFIRSTNAME= (param 7)
,TXTPROVINCE= (param 8) ,TXTOFFPCODE= (param 9)
,TXTGRANTS= (param 10) ,TXTEMPID= (param 11)
,RDOGENDER= (param 12) ,CBOCOUNTRY= (param 13)
,TXTSTADR2= (param 14) ,TXTPFLYNAME= (param 15)
,TXTTELNO= (param 16) ,LANGUAGE= (param 17)
,TXTOFFSTREET2= (param 18) ,TXTOFFSTREET3= (param 19)
,TXTPOSITION= (param 20) ,TXTCITY= (param 21)
,CBOOFFCOUNTRY= (param 22) ,TXTSTADR1= (param 23)
,TXTPMIDNAME= (param 24) ,NEXT= (param 25)
,TXTDEPT= (param 26) ,TXTPCODE= (param 27)
,TXTPPHONE= (param 28) ,TXTMIDNAME= (param 29)
,TXTOFFSTREET1= (param 30) ,CBOCOC= (param 31) ,TXTOFFPROVINCE= (param 32)
,TXTSTADR3= (param 33) ,TXTPEMAIL= (param 34)
where txtEmail= (param 35)
DATASOURCE ****
VENDORERRORCODE 172032
SQLSTATE 2A000
A:
My personal recommendation would be to replace that cfupdate statement with comparable cfquery. Any error information you get is going to be shrouded by the architecture of the cfupdate tag.
If you really feel married to the original code, you could add a formfields attribute to the cfupdate tag and omit the "next" field from the list of columns to update.
<cfupdate datasource="***" tableName="tblApplications"
formFields="txtpfirstname,txtpmidname,txtplastname,txtdob,txtpob,..." />
My first guess would be that the content of the "next" form field is too long for that table column, but if you remove it from the list of updated columns, that will tell you where the error is actually occurring. If after removing the "next" column, you get an error on "txtdept" then you'll know that the error is actually occurring on "txtpmidname" (and my guess would still be the value is too long).
Dan is correct that you can find information about the server (version number, etc) in the server scope. A Railo or BlueDragon server will have an extra structure, but like Dan mentioned, that won't tell you anything about the database drivers. That information is in the ColdFusion Administrator if it's anywhere, but imo it's unlikely that seeing the driver versions will shed any light on the problem. All of this brings me back to my original suggestion: replace the cfupdate tag with a cfquery - that's the fastest, simplest solution.
| 2024-01-09T01:26:29.851802 | https://example.com/article/6587 |
Global and China Wall Socket Sales Market Report to 2020
This report studies Wall Socket in Global and China market, focuses on top manufacturers in global and China market, involving Wall Socket price of each type, production, revenue and market share for each manufacturer. This report also displays the production, revenue and market share of Wall Socket in USA, EU, China, Japan, India and Southeast Asia, forecast to 2020, from 2011.
Split by product types, with production, revenue, market share and price of each type, as well as the types and price of each type price for each manufacturer in 2015 and 2016, through interviewing the key manufacturers, covering
Two hole sockets
Three hole sockets
Type 3
Split by manufacturers, this report focuses on the production, price of each type, average price of Wall Socket, revenue and market share, for each manufacturer in 2015 and 2016. Top players, covering
Legrand
Schneider
Simon
Siemens
Leviton
Tramontina
B-Lux
interNEED
Estevez
Rema Comercial
Split by applications, this report focuses on consumption and growth rate of Wall Socket in each application, can be divided into
Home application
Industrial Use
Commercial application
Split by regions, this report focuses on the production, revenue, consumption and market share of Wall Socket in these regions, from 2011 to 2020 (forecast), covering
China
USA
EU
Japan
India
Southeast Asia
Global automotive relay market is anticipated to reach USD 12 billion by 2020, as per a new research report by Radiant Insights, Inc. Rising need for high-frequency signals in automotive industry is expected to drive demand. These relays enhance driv
Global FPGA market is anticipated to be valued at USD 9,882.5 million by 2020, as per a new research report by Radiant Insights, Inc. Increasing demand for customized IC’s is expected to drive the demand. Customized IC’s helps manufacturers to mo
U.S hairbrush market is estimated to exceed USD 1.2 billion by 2022, as per a new research report by Radiant Insights, Inc. Rising population along with ascending disposable income is expected to drive industry demand. Significant rise in disposable
Global geotextile market size is likely to be valued at USD 8.24 billion by 2020; as per a new research report by Radiant Insights, Inc. Increasing use in soil reinforcement activity coupled with growing application scope in road & railway developmen
North America air conditioner market size is expected to be valued at USD 52,560.7 million by 2020, as per a new research report by Radiant Insights, Inc. Increasing usage of energy efficient air conditioners owing to declining energy consumption rat | 2024-07-24T01:26:29.851802 | https://example.com/article/3098 |
Q:
Best practice for making a multi step form to post adds
I am working on a post your free adds page.
Its a mobile website I am using JQM for the UI design.
My question is what would be the best practice for making this UI design one link which I got after researching in google LINK
explains most of it but it would be really great to have more inputs from any of you who has experience in UI design .
I am including an image which I have designed for the UI to give you a better explanation of my question
Thanks in advance .
A:
You can simply create several sections and navigate between them. I have created this for you, using JQuery, CSS and jQM's built-in transitions.
The idea is simply hide/show sections by swiping left and right. You can add validation before showing next section if you want. (1)
First of all, you need to create a "progress bar" on top of sections. I have used CSS3 flex since it is responsive and doesn't require too much code. It is straight-forward.
Progress bar
HTML
<div class="ui-content" role="main">
<div class="progress">
<p>1</p>
<div class="line"></div>
<p>2</p>
<div class="line"></div>
<p>3</p>
<div class="line"></div>
<p>4</p>
<div class="line"></div>
<p>5</p>
</div>
<!-- sections here -->
</div>
CSS
.ui-content .progress {
display: flex;
display: -webkit-flex;
flex-flow: row nowrap;
-webkit-flex-flow: row nowrap;
justify-content: space-around;
-webkit-justify-content: space-around;
width: 100%;
background: skyblue;
align-items: center;
padding: .5em;
}
.ui-content .progress * {
margin: 0;
}
.ui-content .progress p {
background: lightblue;
height: 22px;
width: 22px;
border-radius: 22px;
text-align: center;
}
.ui-content .progress .line {
border-top: 1px solid black;
flex-grow: 1;
-webkit-align-self: center; /* center line on mobile browsers */
-ms-flex-item-align: center;
align-self: center;
}
Sections and their wrapper
HTML
<div class="steps"> <!-- wrapper -->
<div class="step">
<!-- contents 1 -->
</div>
<div class="step">
<!-- contents 2 -->
</div>
...etc
</div>
CSS
.ui-content .steps {
padding: 1em;
width: 100%;
height: 100%;
overflow: hidden;
}
General CSS
.ui-page .ui-content {
padding:0;
}
.ui-content * {
-webkit-box-sizing: border-box;
-moz-box-sizing: border-box;
box-sizing: border-box;
}
/* active step - progress bar */
.progress .currentStep {
background: tomato !important;
font-weight: bold;
}
jQuery
$(document).on("pagecreate", "#wizard", function () {
$(".step").not(":eq(0)").addClass("ui-screen-hidden");
$(".step:eq(0)").addClass("active");
$(".progress p:eq(0)").addClass("currentStep");
$(".ui-content").on("swipeleft swiperight", function (e) {
var swipe = e.type,
nextStep = $(".steps").find(".active").next(".step"),
prevStep = $(".steps").find(".active").prev(".step");
switch (true) {
case (swipe == "swipeleft" && nextStep.length > 0):
$(".step.active")
.toggleClass("slide out");
break;
case (swipe == "swiperight" && prevStep.length > 0):
$(".step.active")
.toggleClass("slide out reverse");
break;
}
});
}).on("webkitAnimationEnd mozAnimationEnd MSAnimationEnd oanimationend animationend", ".step", function (e) {
var elm = $(e.target);
switch (true) {
case (elm.hasClass("out") && !elm.hasClass("reverse")):
$(elm).toggleClass("slide out ui-screen-hidden active");
$(elm).next(".step").toggleClass("slide in active ui-screen-hidden");
break;
case (elm.hasClass("out") && elm.hasClass("reverse")):
$(elm).toggleClass("slide out ui-screen-hidden reverse active");
$(elm).prev(".step").toggleClass("slide in active reverse ui-screen-hidden");
break;
case (elm.hasClass("in") && !elm.hasClass("reverse")):
elm.toggleClass("slide in");
break;
case (elm.hasClass("in") && elm.hasClass("reverse")):
elm.toggleClass("slide in reverse");
break;
}
var dot = $(".active").index();
/* highlight all previous numbers */
$("p:eq(" + dot + ")").prevAll("p").addBack().addClass("currentStep");
$("p:eq(" + dot + ")").nextAll("p").removeClass("currentStep");
});
Explanation
On pagecreate, all sections will be hidden except for first one by adding ui-screen-hidden which is a built-in class in jQM display: none;. Also, .currentStep class will be added to first element "p" in progress bar.
On swipeleft or swiperight, the code checks if active section has any sibling section before or after it. If true, it moves to that section, otherwise false.
Navigating between sections uses jQM built-in transition, the same ones used for page transition. In this demo .slide is used, however, you can use any of jQM transitions. .in, .out and .reverse are also built-in transition classes, .out is added to active section, .in is added to next/prev section and .reverse combines both aforementioned classes in case you navigate to previous section.
Listening Animation End event(s) animationend is used to remove .in, .out and .reverse, in addition to giving active section a .active class.
Last block of code is used to update progress bar with the number of active section. Updated
Demo (2) - Code
(1) This example can be used also as a simple gallery carousel without the need to use plugins.
(2) Tested on iPhone 5 - Safari & Chrome
| 2023-10-05T01:26:29.851802 | https://example.com/article/8682 |
Bill Murray created a small sensation in the Scottish town of St. Andrews, joining Scandinavian students at a late-night party and even helping to wash the dishes, a newspaper reported Sunday.
In the movie “Lost in Translation,” Murray plays a lonely middle-aged actor in Japan who befriends a young American woman and goes partying with her.
And in what The Sunday Telegraph said was life imitating art, the 56-year-old Murray joined up with 22-year-old Norwegian student Lykke Stavnef, who took him to a house where a student party was in full swing.
“Nobody could believe it when I arrived at the party with Bill Murray,” Stavnef, a social anthropology student, was quoted as saying. “He was just like the character in ’Lost in Translation.”’
Trending stories,celebrity news and all the best of TODAY. This site is protected by recaptcha
The newspaper reported that Murray met Stavnef at a bar where he was drinking with fellow golfers after playing in the Oct. 5-8 Alfred Dunhill Links Championship in St. Andrews with other actors.
To Stavnef’s surprise, Murray accepted her invitation to a party and accompanied her and her friend to a party, the newspaper said.
She said she was first concerned when the apartment had no clean glasses left, but that Murray was happy to drink vodka from a coffee cup and also helped wash dishes in the cramped kitchen.
The Sunday Telegraph article was accompanied by a photograph that appears to show Murray, dressed in a checkered shirt and a brown vest, washing a metal pot at the sink.
As news spread around the city that Murray had turned up at the student party, the house became crowded with people wanting to meet the star of “Ghostbusters,” the article said.
“He was joking with me about reheating some leftover pasta and how drunk everyone was,” said partygoer Agnes Huitfeldt, 22.
Tom Wright, 22, another college student, said “the party was overflowing with stunning Scandinavian blondes.”
“He seemed to be in his element, cracking lots of jokes,” Wright said. “It was the talk of the town the next day.”
Shortly after doing the dishes, Murray left the party, the students said. | 2024-07-10T01:26:29.851802 | https://example.com/article/9130 |
Q:
Composer could not find the config file: C:\Users\Username\AppData\Roaming\Composer\vendor\bin
I cannot seem to install Laravel using the following command: composer create-project laravel/laravel laravel-testing --prefer-dist as it keeps throwing the following error:
[InvalidArgumentException]
Composer could not find the config file: C:\Users\Kieran\AppData\Roaming\Co
mposer\vendor\bin
To initialize a project, please create a composer.json file as described in
the http://getcomposer.org/ "Getting Started" section
The vendor and bin folders did not exist in the below path, so I created the folders vendor and then bin inside that but still no luck:
C:\Users\Kieran\AppData\Roaming\Composer\vendor\bin
What am I doing wrong?
A:
I managed to fix this problem. I had to delete the composerenvironment variable. Which can be found here: Control Panel>System>Edit the system environment variables>Environment variables>composer>delete
After I deleted this I could run the command I wanted with out any errors and it worked as expected: composer create-project laravel/laravel laravel-testing --prefer-dist
| 2024-06-22T01:26:29.851802 | https://example.com/article/5730 |
Q:
SQL request dont work as expected
i have a PHP REST API, i did this function to get services with a certain idpro or idclient
function getServices($request) {
require_once 'db.php';
$emp = json_decode($request->getBody());
$id = $request->getAttribute("id");
$sql = "select * FROM service WHERE idpro=:idpro OR idclient= :idclient ORDER BY date_debut DESC";
try {
$db = getConnection();
$stmt = $db->prepare($sql);
$stmt->bindParam("idpro", $id);
$stmt->bindParam("idclient", $id);
$stmt->execute();
$wines = $stmt->fetchAll(PDO::FETCH_OBJ);
$db = null;
return json_encode( $wines);
} catch(PDOException $e) {
echo '{"error":{"text":'. $e->getMessage() .'}}';
}
}
I have in my database a row with idpro=40 and idclient=30 when i execute this function with id=40 in get the disered result but when i execute it with id=30 i dont get anything, i tried to execute this line in PHPMYADMIN: select * FROM service WHERE idpro=30 OR idclient= 30 and it worked as expected
A:
$sql = "select * FROM service WHERE idpro=:idpro OR idclient=:idclient ORDER BY date_debut DESC";
You mentioned that it worked with idpro and it has no space between the parameter and value so try and remove the space between idclient= :idclient to see if thats the issue. Since it works when you execute the line I assume that its how it is syntactically called.
OR
Try using one parameter for the value. Change like this:
function getServices($request) {
require_once 'db.php';
$emp = json_decode($request->getBody());
$id = $request->getAttribute("id");
$sql = "select * FROM service WHERE idpro=:myID OR idclient= :myID ORDER BY date_debut DESC";
try {
$db = getConnection();
$stmt = $db->prepare($sql);
$stmt->bindParam("myID", $id);
$stmt->execute();
$wines = $stmt->fetchAll(PDO::FETCH_OBJ);
$db = null;
return json_encode( $wines);
} catch(PDOException $e) {
echo '{"error":{"text":'. $e->getMessage() .'}}';
}
}
| 2024-01-05T01:26:29.851802 | https://example.com/article/4269 |
Rhinitis as a risk factor for depressive mood in pre-adolescents: a new approach to this relationship.
Respiratory allergic symptoms impact on social life and school activities, influencing the patient's mood states. We evaluated the relationships between allergic respiratory diseases and depressive/anxious mood in a large sample of Italian middle school students, using the partial directed acyclic graph (P-DAG). We studied 1283 subjects aged 10-13. A health respiratory questionnaire including questions relevant to socioeconomic status (HCI) and a test for depression and anxiety were administered. All subjects performed spirometry and skin prick tests. A causal role of rhinitis on depression was found: the likelihood of being depressed increased from 11.2 to 17.7%, when rhinitis was present. Moreover, a direct effect of low HCI on depressive mood was shown (p < 0.0001) as well as the correlation between anxiety and depression (p < 0.0001). Gender was not a direct causal factor for depressive mood, but their relation was mediated through anxious mood. Anxiety appeared to have a stronger association with depression than gender. Allergic sensitization was significantly related to both asthma and rhinitis (p < 0.0001, respectively). Asthma and rhinitis were also directly associated (p < 0.0001). Conversely, asthma was not directly associated with depressive mood, but their relation was mediated through rhinitis. Body mass index (BMI) and impaired lung function (IPF) were not associated with the other variables. The use of this novel approach to analyzing the dynamic relationships allowed us to find a causal role of rhinitis on depressive state. Moreover, anxious condition and low socioeconomic status contributed to induce depressive mood. | 2023-09-29T01:26:29.851802 | https://example.com/article/7726 |
Former Columbus Police Chief Joseph St. John has resigned from the Columbus-Lowndes E911 board.
Lowndes E911 Director Sheri Fancher confirmed that St. John resigned Sunday via email.Former Columbus Police Chief Joseph St. John has resigned from the Columbus-Lowndes E911 board.
Lowndes E911 Director Sheri Fancher confirmed that St. John resigned Sunday via email.
Over the past year, about 20 people have been indicted on felony charges for not paying court-ordered child children. "We go after the worst of the worst and try to create a deterrent," Attorney General Jim Hood told The Clarion-Ledger.
A not-so-friendly side of "The Friendly City" has reared its ugly head recently, and residents are taking precautions to preserve their safety. On the heels of the recent violent crimes in Columbus, local security and alarm system businesses and pawn shops report an increase in calls about personal protection. | 2024-06-21T01:26:29.851802 | https://example.com/article/6108 |
{
"$schema": "https://github.com/Microsoft/Application-Insights-Workbooks/blob/master/schema/settings.json",
"name": "SAP HANA",
"description": "Displays HANA infrastructure metrics",
"author": "Microsoft",
"galleries": [{ "type": "workbook", "resourceType": "Microsoft.HanaOnAzure/sapMonitors", "order": 100 }]
}
| 2023-11-19T01:26:29.851802 | https://example.com/article/5112 |
Rachel Maddow reports that Donald Trump son-in-law and adviser Jared Kushner has hired a famed defense lawyer Abbe Lowell, who has represented a litany of clients through high profile political scandals and prosecutions. | 2024-03-06T01:26:29.851802 | https://example.com/article/7641 |
Q:
Rails 5.2 API ActiveStorage how to get URL paths for multi image?
I am migrating from paperclip to Rails 5.2 and active storage. I am using rails as API-only.
How to get URL paths for has_many_attached :images
This is the code for the single file that works:
class UserSerializer < ActiveModel::Serializer
include Rails.application.routes.url_helpers
attributes %i[email name username]
....
attribute :verification_url do
if object.verification_file.attachment
URI.join(ActionController::Base.asset_host, rails_blob_path(object.verification_file))
end
end
....
end
And when I try to do something similar for multi-images I am just getting those images, not their URL.
include Rails.application.routes.url_helpers
attributes :id, :name, :description, :images
def images
if object.images.attachments
object.images.each do |image|
URI.join(ActionController::Base.asset_host, rails_blob_path(image))
end
end
end
A:
Here is the solution:
def images
return unless object.images.attachments
image_urls = object.images.map do |image|
URI.join(
ActionController::Base.asset_host,
rails_blob_path(image))
end
image_urls
end
| 2023-10-01T01:26:29.851802 | https://example.com/article/5243 |
Generally, a silver halide photographic light-sensitive material comprises an electrical insulating support and photographic component layers; therefore, it is liable to charge with electricity when rubbed with or peeled from the surface of the same or different kinds of material during a manufacturing process or while put in use. If a static charge accumulated before development is discharged and thereby a light-sensitive layer is exposed, so-called static marks such as dot spots or dendritic or plumous markings appear upon development of an affected photographic film. This seriously impairs the value of the photographic film. For example, a static mark that occurred on an X-ray film for medical or industrial uses is likely to lead to a very dangerous misjudgement. Since such an affection can be found only when the film is developed, it poses a difficult problem. The static mark has come to occur more frequently in the recent trends of a light-sensitive material toward a much higher sensitivity, coating speed, photographing speed and automatic processing speed. That is, contact-rubbing occurs frequently between a high-sensitive material and various rollers or machines, or between light-sensitive materials themselves, in the manufacturing processes such as coating, drying and packaging; moreover, in the steps of film loading, photographing, and automatic development processing.
There have been proposed a variety of methods to improve surface conductivity of the support and coating layer of a light-sensitive material, and the use of various hygroscopic materials, water soluble inorganic salts, and some surfactants and polymers has been attempted.
However, not a few conventional antistatic agents are liable to decrease in effect or adversely affect photographic characteristics depending on the kind of a support or a photographic composition. In some cases, the antistatic property is entirely lost in the course of development.
Taking notice of these conditions, attempts were made to enhance conductivity of a light-sensitive material for the purpose of imparting antistatic property as described in, for example, Japanese Patent Publication Open to Public Inspection (hereinafter referred to as Japanese Patent O.P.I. Publication) No. 84658/1980. This technique could impart some antistatic property, but it turned out to cause peeling of a wet emulsion layer from a support while a light-sensitive material is subjected to development, which may lead to a serious accident.
As speedup in conveying and processing a film has come to the main trend of the industry, stability of an emulsion layer during photographic processes is getting more and more important, and improvement in adhesion of a wet emulsion layer, not to mention dry adhesion, is strongly desired. | 2024-02-06T01:26:29.851802 | https://example.com/article/4739 |
The article “Development of an Adaptive Workload Management System Using the Queuing Network-Model Human Processor (QN-MHP),” C. Wu et al, IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, VOL. 9, No. 3, September 2008 describes a queuing network-model human processor for an adaptive workload management system (AWMSs) is known. The risk of vehicle collisions significantly increases when drivers are overloaded with information from in-vehicle systems. Increasingly more in-vehicle information and entertainment systems, e.g. navigation aids, mobile phones, e-mail, web browsers, vehicle-to-vehicle communication systems, and traffic information displays are being used in vehicles. One of the solutions to this problem is developing AWMSs to dynamically control the rate of messages from these in-vehicle systems. The driver's workload is estimated in several driving situations. A message controller determines the optimal delay times between messages and dynamically controls the rate of messages presented to the driver. The rate of messages is adapted to the driving conditions, e.g. speed and curvatures, and driver characteristics, e.g., age. AWMSs collect current driving information, such as steering wheel angle and lane position, and then use computational algorithms to directly estimate the current workload of the driver. To reduce the driver's workload, messages from in-vehicle systems are suppressed or messages are redirected into a voice mailbox when the driver's estimated mental workload is high. Multitasking information in driving is typically presented in a multimodal format: either through the visual (e.g., looking at a map or a display of a navigation system) or the auditory modality (e.g., listening to messages from cellular phones or warning systems). Drivers read directions for and the distance to the next turn (maneuver point) from the display (perceptual processing), perform mental calculations to decide whether and when to switch to a different lane (cognitive processing), and possibly engage the turning signal and turn the steering wheel (motor processing). The level of driver workload and performance can be estimated based on road situations, drivers' age, message properties from the in-vehicle systems change in terms of modalities, message difficulty, and motor execution time. Absolute and differential thresholds of the simulated workload can be set to determine the optimal design of the messages and whether the proposed design can produce a workload that is higher than the “redline”. Global Positioning Systems (GPS) can also be used to measure road curvatures and speed on the next road section so that the AWMS can estimate the driver workload a few seconds in advance. The focus of AWMS is to reduce driver workload. It is suitable for non-urgent messages of in-vehicle systems when delaying messages for a few seconds is allowable, e.g., messages from e-mail systems and messages related to traffic congestion. For urgent messages that require immediate driver response, e.g. forward collision warning messages, no extra delays are allowed. Algorithms can manage messages with different priorities, including the order and length of these messages. Further driving conditions, such as traffic density, intersections, road curvature in the next few seconds, route planning and selections, and weather conditions may be added.
The object of the invention is to improve a system for a vehicle.
Said object is attained by a system with the features of independent claim 1. Advantageous refinements are the subject of dependent claims and included in the description.
Therefore, a system for a vehicle is provided. The system has a head-up display and a circuit, whereby the circuit is connected to the head-up display.
The head-up display is configured to project an image onto the vehicle's front windshield or onto a separate combiner.
The circuit is configured to output image data to the head-up display in order to generate the image. The image data have a set of objects which include messages for the user.
The circuit is configured to determine the user's workload level based on a set of driving conditions.
The circuit is configured, based on the level, to switch between at least one first workload mode and a second workload mode. The level assigned to the second workload mode is higher than the level assigned to the first workload mode.
The circuit is configured in the second workload mode to reduce at least one object of the set, which is output in the first workload mode.
Tests by the applicant have shown that a plurality of information can be displayed simultaneously to the driver in high resolution by the head-up display, without the driver having to look away from the traffic ahead to perceive the information. The driver's workload could be significantly reduced by a specific configuration of an adaptive workload management system by the intelligent reduction of the objects.
The invention further has the object of providing an improved method for controlling a head-up display.
Said object is attained by the method with the features of independent claim 7. Advantageous refinements are included in the description.
Therefore, a method for controlling a head-up display for a vehicle is provided. The method has the steps:
Projecting an image onto a front windshield of the vehicle or onto a separate combiner by means of the head-up display.
Outputting image data from a circuit to the head-up display to generate the image, whereby the image data have a set of objects that include messages for the user. The circuit may be connected to the head-up display.
Determining the user's workload level based on a set of driving conditions by means of the circuit.
Switching between at least one first workload mode and a second workload mode, based on the level, whereby the second workload mode is assigned a higher workload level than the first workload mode.
Reducing at least one object of the set in the second workload mode, wherein said at least one object of the set is output in the first workload mode.
The refinements described hereinafter relate to both, the system and the control method.
According to one embodiment, to reduce the at least one object the circuit may be configured to fade out the object and/or to make the object in the image smaller and/or to increase the transparency of the object and/or to move the object within the image away from a central position into a predetermined area. The object may be moved from a position in the main viewing direction of the driver towards a boundary, so that the object is not disturbing the driver while viewing the traffic in front. An uncritical area, the object may be moved to, is a lower edge of the image area, so that the drivers may see the object virtually before the engine bonnet of the vehicle.
According to one embodiment, the circuit may be configured during or after the reduction to output the message associated with the object by means of another object in another display different from the front windshield.
According to one embodiment, the circuit may be configured to identify an input by the user. The circuit may be configured, based on the input, to start an application program, whereby the object is associated with the application program.
According to one embodiment, the circuit may be configured to prioritize the objects. The circuit may be configured to reduce first the object with the lowest priority in the second workload mode.
According to one embodiment, the circuit may be configured to switch to a warning mode. The circuit may be configured to reduce at least one of the objects of the set in the warning mode and to output at least one warning object at least temporarily in the image data.
The previously described embodiment variants are especially advantageous both individually and in combination. In this regard, all embodiment variants can be combined with one another. Some possible combinations are explained in the description of the exemplary embodiments shown in the figures. These possible combinations of the embodiment variants, depicted therein, are not definitive, however. | 2023-10-17T01:26:29.851802 | https://example.com/article/8526 |
require('./angular-locale_et');
module.exports = 'ngLocale';
| 2024-01-18T01:26:29.851802 | https://example.com/article/7971 |
India Puts US Climate Policy to Shame
While US policymakers — particularly Republicans and those in coal states — are busy complaining about developing countries not capping their carbon emissions, New Delhi is busy actually doing something about climate change.
Two weeks ago, India instituted a tax on coal, instituting a form of carbon tax that talented advocates (such as the good folks at the Carbon Tax Center) have been pushing for a while, and have been unable to get through Congress. The tax is not huge — one rupee (about $1) per metric ton, but it’s a start, and it’s way more than the US has done. You can find the new India coal rules here.
Meanwhile, the Government of India also recently decontrolled prices of petroleum and diesel fuel, thus again using a market-based mechanism to handle energy demand. This, of course, is more than environmental policy: it is policy designed to make India’s energy use more efficient. And here, to the extent that you support these kinds of policies, the United States is “ahead” of India: Jimmy Carter bravely decontrolled oil prices in 1979, only to suffer the electoral consequences, and be castigated by Republicans for demonstrating insufficient fealty to the Gods of the Market.
Indian Prime Minister Manmohan Singh is a quiet type, but he has led effectively and courageously on this issue. It helps, of course, that India is a parliamentary system, a far more effective form of democracy than American-style Presidentialism.
This once again goes to demonstrate the argument that many of use have been making for a while: focusing on the big international climate negotiations is really missing the point, and not seeing the real action. But of course it would be nice if the United States actually had some action to report instead of just more Republican obstruction. | 2023-11-20T01:26:29.851802 | https://example.com/article/1236 |
USA Freedom Act: What’s in, what’s out
The USA Freedom Act, passed by Congress and signed by the president Tuesday night, reauthorizes parts of the USA Patriot Act but dissolves its notorious bulk data collection of Americans’ phone records and Internet metadata.
The bill bans the bulk collection of data of Americans’ telephone records and Internet metadata.
It limits the government’s data collection to the “greatest extent reasonably practical”—which means the government can’t collect all data pertaining to a particular service provider or broad geographic region, such as a city or area code.
What’s in
Instead of bulk data collection, the bill authorizes the government to collect from phone companies up to “two hops” of call records related to a suspect, if the government can prove it has “reasonable” suspicion that the suspect is linked to a terrorist organization.
It provides the government with new reporting requirements to FISA authorities.
It gives private companies more opportunities to publicly report information about the number of FISA orders they receive.
It declassifies FISA Court opinions that contain significant legal interpretations, or, if declassification is not possible, requires that a summary is provided.
It requires the FISA Court to designate a panel of “amicus curiae,” or advocates, to represent the public’s interest in cases that involve novel or significant legal issues.
It increases the maximum penalty for material support to terrorism from 15 years to 20 years.
It extends the expiration of three Patriot Act provisions—Section 215, roving wiretaps and the lone wolf surveillance authority—to December 2019. | 2024-01-21T01:26:29.851802 | https://example.com/article/4954 |
Tag Archives: Trade
WASHINGTON, Feb. 3, 2016 /PRNewswire-USNewswire/ — As the United States and 11 other countries prepare to sign the Trans-Pacific Partnership (TPP) trade agreement later today, 35 leading public health and medical groups today urged Congress to support a TPP provision that protects life-saving tobacco control measures from tobacco industry legal attacks under the agreement. Read on>
Making Priorities into our Reality This year has been one filled with milestones for the public health and tobacco control communities. The Sustainable Development Goals (SDGs), that will replace the Millennium Development Goals (MDGs), call on governments to strengthen the implementation of the WHO Framework Convention on Tobacco Control (FCTC). Reducing tobacco deaths is now… Read the full article >
And it’s only going to get worse for them. I was asked two weeks ago to blog about my end-of-year thoughts. Something told me to procrastinate, and I am glad I did. Within 24 hours before putting fingers to keyboard, good news came from afar. First, after several years of litigation, Australia has emerged victorious… Read the full article >
Last week, after many years of painful negotiation, the final text for the Trans-Pacific Partnership (TPP) Agreement was released. This is the text that the U.S. Congress and Parliaments from 11 other countries will consider. At the moment, it is far from a slam dunk that it will pass into international law. ASH and the… Read the full article >
FOR IMMEDIATE RELEASE Contact: Megan Arendt Office: 202-659-4310 Email: arendtm@ash.org Tobacco Carve-Out in TPP, Major Victory for Public Health Removes New Weapon for Tobacco Industry WASHINGTON, DC – Monday, October 5, 2015 – In a major victory for public health, negotiations for the Trans-Pacific Partnership (TPP) Agreement concluded this morning with built-in protections to prevent… Read the full article >
No final consensus has been reached on whether any exclusion would target only tobacco companies or shield a wider range of government regulations from legal action, but Australia’s Andrew Robb is optimistic about his country’s push for a broad carve-out for both health and environmental regulations. “I think we’re on track, but there’s not a… Read the full article >
By Chris Bostic, for Health and Trade Network As the role of tobacco companies in trade agreements on both sides of the Atlantic has been highlighted by a series of controversial events in recent weeks, this HaT paper is presented as a summary of the current key issues in the TPP and the TTIP, with implications… Read the full article >
But tobacco farmers are not part of the game Mitch McConnell and other pro-tobacco politicians have become very vocal over the past two weeks in their opposition to a potential partial tobacco exemption in the Trans-Pacific Partnership (TPP) Agreement. And just as in so many other political debates, they are citing the plight of the… Read the full article >
Big Tobacco is pushing back against a strict anti-smoking provision in the massive Trans-Pacific Partnership trade deal and has enlisted the support of the most powerful Republican in the Senate to help quash it. The ire of Senate Majority Leader Mitch McConnell and other tobacco-state lawmakers could throw a wrench into the delicate negotiations to… Read the full article >
Senate Majority Leader Mitch McConnell (R-Ky.) is warning U.S. officials negotiating a massive trans-Pacific trade agreement for President Obama not to target tobacco growers in a final deal. McConnell said singling out the tobacco industry would set a dangerous precedent for future trade deals, in a letter to Obama’s top trade representative. The missive from… Read the full article >
Australia’s legal bill for defending its cigarette plain packaging legislation is set to hit $50 million as it battles to contain a case brought by tobacco giant Philip Morris before a tribunal in Singapore. And that is just for the first stage. If in September the three-person extraterritorial tribunal decides Australia has a case to answer, the hearing… Read the full article >
In 2012, Australia implemented tough anti-tobacco regulations, requiring that all cigarettes be sold in plain, logo-free brown packages dominated by health warnings. Philip Morris Asia filed suit, claiming that this violated its intellectual-property rights and would damage its investments. The company sued Australia in domestic court and lost. But it had another card to play. In… Read the full article >
(Reuters) – Ukraine has suspended a case it was pursuing through the World Trade Organization aimed at overturning Australia’s strict tobacco packaging laws, a WTO panel of adjudicators said in a statement published on Wednesday. Ukraine asked the panel to suspend the proceedings on May 28 and said it will try to find a mutually… Read the full article >
WASHINGTON — An ambitious 12-nation trade accord pushed by President Obama would allow foreign corporations to sue the United States government for actions that undermine their investment “expectations” and hurt their business, according to a classified document. Read more>
This week, several representatives of Action on Smoking and Health (ASH) will be attending the World Conference on Tobacco or Health in Abu Dhabi. WCTOH is a five-day scientific conference where presenters highlight the latest developments in tobacco control and the efforts around the world to reduce tobacco use. This year, the conference theme is “Tobacco… Read the full article >
By Senator Elizabeth Warren The United States is in the final stages of negotiating the Trans-Pacific Partnership (TPP), a massive free-trade agreement with Mexico, Canada, Japan, Singapore and seven other countries. Who will benefit from the TPP? American workers? Consumers? Small businesses? Taxpayers? Or the biggest multinational corporations in the world? One strong hint is… Read the full article >
Remarks by the President at Meeting of the Export Council December 11, 2014 The big bugaboo that’s lifted up there is tobacco companies suing poorer countries to make sure that anti-smoking legislation is banned, or at least tying them up with so much litigation that ultimately smaller countries cave. Those are issues that I think… Read the full article >
Australian expertise in tobacco control is helping save lives around the world, but that work could be undone. Every day, 5500 children in India start using tobacco. If they continue the habit, as many do, the illnesses brought about by tobacco addiction will kill about half of them. In the meantime, Big Tobacco is allowed… Read the full article >
An ISDS carve-out in the TPPA would be good for tobacco control, but not good enough. There has been some scuttlebutt in trade circles over the past weeks about a possible US proposal in the ongoing Trans-Pacific Partnership (TPP) negotiations to exempt tobacco measures from the investment chapter. The effect would be to deny the… Read the full article >
WTO members meeting as the Trade-Related Aspects of Intellectual Property Rights (TRIPS) Council on 28–29 October 2014 responded to the latest developments on plain packaging for tobacco products, exchanged views on innovation, and heard about plans to make it easier to make sense of the huge amount of information they have shared with each other… Read the full article >
Almost 200 countries signed the World Health Organisation’s Tobacco Control Convention and are obliged to take measures to curb tobacco use. But the industry has hit back. A big tobacco company, Philip Morris, has taken Uruguay and Australia to tribunals under bilateral investment treaties, claiming billions of dollars in compensation for the two countries’ measures… Read the full article >
By Krista Hughes WASHINGTON, Oct 21 (Reuters) – The United States has floated excluding tobacco products from a key section of a 12-nation Pacific trade deal and signaled it may present a formal proposal to trading partners at talks in Australia, sources briefed on the negotiations said. Dropping tobacco from the investor-state dispute settlement, or ISDS, section… Read the full article >
Senate GOP Leader Mitch McConnell (R-Ky.) is pressing the Obama administration to protect his state’s tobacco industry in a trade deal. McConnell is pressuring U.S. negotiators to ensure that tobacco companies can take part in the dispute settlement portion of the trade deal, with talks scheduled next week on the Trans-Pacific Partnership (TPP) trade pact… Read the full article > | 2024-03-12T01:26:29.851802 | https://example.com/article/6426 |
Missing plane may have turned back
KUALA LUMPUR - The Malaysia Airlines plane missing in the South China Sea for a day may have turned back before losing contact, an official said on Sunday.
Published: 09/03/2014 at 02:51 PM
Writer: dpa
There were indications that the Boeing 777-200 passenger jet bound for Beijing turned around shortly before disappearing near the border between Malaysian and Vietnamese airspace, Malaysian armed forces chief Zulkifeli Zin told reporters.
The area for search and rescue operations had been expanded to allow for the possibile change of course, he said.
Chinese family makes contact with missing passenger's phone
The family of a Chinese passenger missing on flight MH370 have made contact with his mobile phone and Malaysian authorities are trying to use the signal to locate the plane, Chinese state television reported on Sunday.
Beijing Television said it also called the man's mobile phone and appeared to connect with it before the call was cut off.
The plane disappeared early Saturday as it was carrying 227 passengers, most of them Chinese, and 12 crew to Beijing from Kuala Lumpur. | 2023-11-17T01:26:29.851802 | https://example.com/article/3234 |
Q:
Selecting name with 5 or more characters from table
I need to select a random name from a table, but I need the name's length to be more than 5 character. How do I say that in SQL?
SELECT name FROM tableName WHERE rand() AND (name longer than 5 characters)
A:
You may use LENGTH in where clause, see example below:
SELECT name FROM tableName WHERE rand() AND length(name) > 5
Additionally, you may add LIMIT to get number of records you needed (and that much existed in your table).
| 2024-05-12T01:26:29.851802 | https://example.com/article/5792 |
The Simpsons isn't as good now. It's something we all know, and yet people still feel the need to bring it up. There have been some Lady Gaga-sized trainwrecks since the Golden Age, including one episode that just seemed to be an advertisement for how great Elon Musk is.
If you love talking about The Simpsons online, you'll know that all too often someone will derail any conversation by moaning about the slump.
But whatever side of the argument you're on, this is the list for you. If you're sick of people moaning about how the quality has declined, point them towards these diamonds in the rough. And if you're one of those grumps who misses the monorail so much, these can show the last five seasons in a better light.
Since Season 30 has only just begun, Seasons 25-29 will be looked at here. They took some risks, as might be expected considering the show's long run. As a result, some episodes felt stale, some flopped, some got lost in the shuffle but some really shone, and these are the pick of the bunch. | 2023-10-08T01:26:29.851802 | https://example.com/article/3855 |
(Image: Jarred Sumner/GitHub)
If Comcast thinks you're downloading copyrighted material, you can be sure it'll let you know. But how it does it has raised questions over user privacy.
The cable and media giant has been accused of tapping into unencrypted browser sessions and displaying warnings that accuse the user of infringing copyrighted material -- such as sharing movies or downloading from a file-sharing site.
That could put users at risk, says the developer who discovered it.
Jarred Sumner, a San Francisco, Calif.-based developer who published the alert banner's code on his GitHub page, told ZDNet in an email that this could cause major privacy problems.
Sumner explained that Comcast injects the code into a user's browser as they are browsing the web, performing a so-called "man-in-the-middle" attack. (Comcast has been known to alert users when they have surpassed their data caps.) This means Comcast intercepts the traffic between a user's computer and their servers, instead of installing software on the user's computer.
But that opens up a whole host of problems, such as allowing Comcast to modify what is displayed on the user's page.
"This probably means that Comcast is using [deep packet inspection] on subscriber's internet and/or proxying subscriber internet when they want to send messages to subscribers," he said. "That would let Comcast modify unencrypted traffic in both directions."
That would mean Comcast could, if it wanted to, trick users into thinking they are on one site when they're on another instead.
"There are scarier scenarios where this could be used as a tool for censorship, surveillance, [or] selling personal information," said Sumner.
Sumner confirmed he used Comcast at home. "It started appearing on every single non-HTTPS website on every device on my home's network," he said.
It's almost impossible for websites that are encrypted, which display "HTTPS" in the address bar, to be affected. Not only does an SSL security certificate prevent anyone from knowing what's going on during the browsing session, it also adds a layer of integrity to the site, meaning it hasn't been modified by a third-party while it was being displayed.
"This is highly dubious behavior from Comcast. The last thing anyone wants is unapproved third-party JavaScript libraries being injected onto their pages. This could have serious performance and security implications," said one user in the comments.
Others in the comments section said they also saw this, adding that it was first seen back in June.
This is not the first time Comcast has been accused of controversial tactics.
Most recently, Comcast was accused of exploiting a loophole in the net neutrality rules, allowing its users to stream an unlimited amount of video -- despite its data caps, because the company said it was being provided over its cable network rather than the internet. That falls foul of the rules because its competitors, like Netflix, would count against the data limits, according to the Washington Post.
A Comcast spokesperson said in an email on Monday that this is "not new," adding that engineers "transparently posted an Internet Engineering Task Force (IETF) white paper about it" as early as 2011, which can be found here.
The spokesperson did not, however, address of the apparent privacy concerns. | 2023-12-25T01:26:29.851802 | https://example.com/article/5240 |
Although an understanding of the neural systems involved in opioid dependence has progressed significantly in recent years, little is yet known about the basic changes in brain function produced by opioids and, consequently, how opioid dependence-producing effects might be prevented therapeutically. Our broad objective is to utilize the hibernating brain, which we have shown to display a unique natural suppression of morphine dependence, to study the neural basis of opioid physical dependence (and, ultimately, its prevention). Thus, this proposal will: 1) determine if the hibernation state is one in which the rate and/or magnitude of development of morphine dependence is attenuated or if it is virtually absent; 2) determine if tolerance to morphine actions in the bran is retarded during the hibernation state; and 3) examine if the hibernation-related change in brain dopamine metabolism is a primary mechanism responsible for the reduction of morphine dependence during the hibernation state; and 3) examine if the hibernation-related change in brain dopamine metabolism is a primary mechanism responsible for the reduction of morphine dependence during hibernation. The specific aims are measure and compare the hibernation state versus the nonhibernation state characteristics in ground squirrels of: 1) dependence produced by a wide range of morphine doses and durations of intracerebral (ic) administration; 2) dependence produced by mu receptor opioid agonists possessing greater lipid solubility than morphine; 3) tolerance to morphine analgesic and nonanalgesic actions; 4) morphine effects on caudate nucleus dopamine (DA) metabolism. The methods will include: chronic ic cannulation, for opioid microinjection and microinfusion in freely moving animals; measurement of naloxone-precipitated abstinence; recording of body temperature and skin twitch responses to assess tolerance to morphine actions; high performance liquid chromatography/electrochemical detection and in vivo push-pull perfusion to determine morphine effects on caudate DA metabolism. | 2023-12-24T01:26:29.851802 | https://example.com/article/4032 |
Shop Golden State Warriors Apparel
Flex your Golden State Warriors fandom by sporting the newest team gear from CBSsports.com. Here you’ll find the hottest Warriors jerseys, T-shirts, and accessories. CBSsports.com is stocked with all the best Golden State Warriors apparel for men, women, and youth. Support your favorite players by sporting their official jersey, or rock a Warriors hat to let your allegiances be known.
Warriors Jerseys, T-shirts, Hats
Have your fashion match your fandom and shop at CBSsports.com for all your officially licensed Warriors team apparel. Pick up a stylish replica jersey to represent your favorite Warriors players past and present. CBSsports.com offers an array of official team jerseys, from current Swingman styles to Hardwood Classics featuring the greatest Golden State Warriors players. In addition to Golden State Warriors Jerseys and Tees, find Warriors Shorts, Hoodies and more at CBS Sports Shop. | 2024-06-28T01:26:29.851802 | https://example.com/article/9807 |
Q:
In the same matrix, how do you re-organize the order of numbers of the first column?
I have a matrix:
a =
[26 709,107666000000
41 2839,29345700000
56 5572,19531300000
70 8802,29882800000
84 12283,4667970000
98 15999,8603520000
38 1715,02050800000
49 4174,55908200000
63 7141,78564500000
79 10481,1035160000
91 14136,5742190000
105 17840,5800780000
]
I need to reorganize the matrix in ascending order assuming the first column as order.
Thanks for your help!
A:
Using SortRows:
sorting_column=1;
a=sortrows(a,sorting_column);
| 2023-11-13T01:26:29.851802 | https://example.com/article/7296 |
Walmart, American Express team up to offer prepaid card
LOS ANGELES — Retail giant Walmart Stores Inc. and American Express Co. are teaming up to offer low-income shoppers a prepaid card, touting it as a more affordable alternative to debit cards.
Comment
By Los Angeles Times
MailTribune.com
By Los Angeles Times
Posted Oct. 9, 2012 at 2:00 AM
By Los Angeles Times
Posted Oct. 9, 2012 at 2:00 AM
» Social News
LOS ANGELES — Retail giant Walmart Stores Inc. and American Express Co. are teaming up to offer low-income shoppers a prepaid card, touting it as a more affordable alternative to debit cards.
Called Bluebird, the card is aimed at "customers who are disillusioned or excluded by the rising cost of banking services," the two companies said in a Monday statement. The card, which has been tested since March, will be available next week online and in Walmart stores.
Bluebird, which functions somewhat like a checking account, can be used anywhere that accepts American Express cards. It's one of many prepaid cards that recently have flooded the marketplace and try to woo customers increasingly fed up with debit card fees.
Money can be loaded onto the card at Walmart cash registers, through direct deposit, via a bank account, or by using a mobile application to deposit a check remotely. With Bluebird, American Express will be able to reach more financially cash-strapped customers who may not have bank accounts.
Bluebird does not require a minimum balance and will have no monthly, annual or overdraft fees. Fees associated with the card include a $2 charge for using out-of-network ATMs to withdraw cash and a $2 fee to add money from a debit card.
Walmart and American Express said Bluebird was partly inspired by shoppers who complained about the rising costs related to checking accounts and more traditional banking services.
"Our customers tell us that they are tired of navigating a complex maze of do's and don'ts to avoid the ever-growing list of fees found on checking products," Daniel Eckhert, vice president of financial services for Walmart U.S., said in a statement. | 2024-05-26T01:26:29.851802 | https://example.com/article/6914 |
Optimization and evaluation of a modified enrichment procedure combined with immunomagnetic separation for detection of E. coli O157:H7 from artificially contaminated alfalfa sprouts.
Escherichia coli O157:H7 has been linked to foodborne disease outbreaks with alfalfa sprouts. Detection of the organism in sprouts by standard cultural methods can be difficult due to the high background microflora. The objective of this study was to develop and optimize an enrichment protocol with and without post-enrichment immunomagnetic separation (IMS) for the rapid detection by real-time PCR (RTiPCR) and cultural recovery of E. coli O157:H7 from artificially contaminated alfalfa sprouts. Initially we found that the FDA BAM procedure, enriching samples in modified buffered peptone water with pyruvate and at 37°C for 5h, followed by the addition of acriflavin, cefsulodin and vancomycin (mBPWp+ACV) and static incubation at 42°C gave poor results for both PCR detection and isolation for alfalfa sprouts artificially contaminated at 0.2cfu/g. The addition of post-enrichment IMS improved detection but not isolation. This procedure was modified and optimized by changing to mBPWp with cefsulodin and vancomycin at 42°C and shaking for 24h with and without IMS prior to PCR detection and cultural isolation. Using the resulting protocol we were able to detect E. coli O157:H7 in 100% of samples of alfalfa sprouts contaminated at 0.2cfu/g. This was validated for five strains of E. coli O157:H7. Isolation was 84% without added post-enrichment IMS and 100% with IMS. The optimized procedure was effective for detection and isolation of E. coli O157:H7 from this difficult food matrix. | 2023-12-16T01:26:29.851802 | https://example.com/article/5201 |
Q:
How does one pull a value from within a tuple of tuples?
I have a tuple of tuples in my code called "translations" that contains conversions of letters to numbers e.g. ("A", "1") is one of the tuples. From this tuple of tuples I need to call a value based on what the user inputs (e.g. if they enter A,B,C the code replies with 1,2,3 from the tuple).
messageToConvert = str(input('Enter letters to convert: '))
for numbers in messageToConvert:
characters_to_decode = messageToConvert.split(',')
coded_text = []
for i in characters_to_decode:
coded_text.append(translations[i])
When i try to run it I keep getting the error "TypeError: tuple indices must be integers or slices, not str " because of the [i] after translations being a variable. I want to program to check all of the characters entered that are separated by commas, convert them to numbers, and then output them as a string.
A:
The appropriate data structure to use if you want to use one value to look up another is a dictionary. Conveniently, you can create a dictionary using a list of tuples:
>>> tuples = [("A", 1), ("B", 2), ("C", 3)]
>>> dictionary = dict(tuples)
>>> dictionary["B"]
2
You only need to build the dictionary once, even if you will need to do many lookups.
| 2024-03-06T01:26:29.851802 | https://example.com/article/9222 |
1. Introduction {#s1}
===============
Myocontrol---open-loop high-level control based upon muscle activity---is the primary way to allow upper-limb amputees to control a self-powered prosthesis (Jiang et al., [@B19]), at least in the academic community. Such control is usually enforced using (residual) muscle activity of the user\'s body, gathered via surface electromyography (sEMG, Merletti et al., [@B21]), or more advanced techniques (Castellini et al., [@B3]). It is intended and desired, that coordinated muscle activation patterns correspond to desired actions of the rehabilitation device; a suitable system must then be put in place to correctly interpret such patterns, *exactly for the duration of an action*---this is the essence of *reliability* in myocontrol.
Instability in myocontrol is here outlined as the manifested consequence of low robustness of the human-machine interface (HMI) control system, with respect to changes in the sEMG input signals (for a same given users intent), producing control outputs inconsistent with respect to the user\'s will. Consequently, we define a myocontrol *failure* as an event in which the prosthetic hand starts a behavior that does not coincide with the one expected by the user, i.e., it is in contrast with the users intent (note that in the following of the manuscript the terms myocontrol instability and myocontrol failure can be used interchangeably). In the extreme case a failure can be catastrophic: picture for instance a prosthetic hand suddenly failing to turn the steering wheel of a car when required.
Still, after 30 years and more of academic research, reliability of myocontrol is an open issue. Indeed, myocontrol suffers from the quintessential problems related to human-machine interaction: the inconstancy of signals gathered from human beings; the need to determine what the user wants the device to do (at best, a blurry target); the fact that, by definition, assistive/rehabilitation devices are to be controlled by disabled and impaired persons such as e.g., stroke patients, amputees, elderly subjects, etc., whose signals are, from the point of view of the engineer, even worse.
A spectacular example of the general unreliability of myocontrol can be found in the outcome of the ARM competition of the 2016 Cybathlon (ETH, [@B9]). Instability led to so many failures by users of myocontrolled arm/hand prosthetic systems that both categories were won by teams using body-powered one-DoF prosthetic arms, and they were competing against some of the most advanced academic solutions in the world[^1^](#fn0001){ref-type="fn"}. A very recent, fascinating survey about current pitfalls and practical requirements of myocontrol is Schweitzer et al. ([@B31]); see also, for instance, ETH ([@B9]) and the video clips in Schweitzer ([@B30]).
The reasons why the scientific community has so far been unable to provide a safe solution to this problem lie both in the unstable nature of the above-mentioned signals (Micera et al., [@B22]; Peerdeman et al., [@B27]; Fougner et al., [@B13]; Ison and Artemiadis, [@B18]) and we claim (Castellini et al., [@B4]; Nowak et al., [@B23], [@B24]), in the bad design of testing protocols, and the lack of an appropriate framework to induce co-adaptation in the user. Interestingly, these remarks obviously also apply to "standard" human-machine interaction, e.g., teleoperation. Our way toward the solution of the problem is incremental learning, allowing for on-demand model updates in real time, leading to an *interactive myocontrol* paradigm: a natural, simultaneous and proportional (s/p) control scheme which can be taught new information (Gijsberts et al., [@B14]; Strazzulla et al., [@B32]), and where the possibility of updating should desirably be achieved in an autonomous and real-time fashion. Therefore, an "automatic *oracle*" able to detect myocontrol instability is the first step toward such an approach, that otherwise would require the presence of the subjective judgement of a "human oracle" (i.e., the experimenter or the subject), introducing a significant weakness in the whole paradigm (Nowak et al., [@B24]). Following up our own preliminary work (Nowak et al., [@B25]), we hereby propose a further advancement toward the automated detection of failures in myocontrol, especially by involving multiple subjects in a more appropriate experimental protocol and using a completely new feature extraction and labeling approach for the classification along with an extended analysis and discussion. Other past studies also attempted fault-tolerant approaches to myocontrol (e.g., Hargrove et al., [@B17]; Scheme et al., [@B29]; Amsuss et al., [@B2]); however, they were concerned with classification of myoelectric patterns, therefore not considering s/p myocontrol as it has been made in the present work.
In order to minimize the complexity of the problem, we made the assumption that if we engage a human subject in a simple, well-defined task with a clear aim, the subject\'s intent will adhere to the actions required by the task. If we can time the intervals during which a specific action is required, we can then claim that the subject\'s intent *is* the sequence of actions scripted in the task. Accordingly, we designed an extremely simplified, well-structured but still realistic grasp-carry-release experimental task, to evaluate automatic detection of the myocontrol instability. Namely, we engaged six subjects, five able-bodied persons and one trans-radial amputee. All subjects were expert users of the state-of-the-art s/p myocontrol system used in this study (see section 2.1). By means of *a posteriori* analysis of video recordings of the experiment, we were able to obtain the starting and ending times of the grasp actions and to determine the myocontrol failure occurrence instants, i.e., when the hand would grasp during the no-grasp intervals and vice-versa (false positives and false negatives). Additionally, each user had a wireless button available to signal his/her feeling on when the myocontrol system would be failing. Using these pieces of information, we could exactly label the task execution. Lastly, a standard classifier was used to try and associate features---extracted from the myocontrol-predicted motor currents and the status feedback signals from the prosthetic hands---to failures (both false positives and negatives).
The article is organized as follows: in section 2 the experimental setup and protocol, and the classification system are presented, whereas section 3 reports per-subject and global analyses results, and finally section 4 is dedicated to the discussion of several emerging aspects and conclusions.
2. Methods {#s2}
==========
[Figure 1](#F1){ref-type="fig"} depicts a conceptual representation of the HMI organization and informational flow related to the setup used in this work. The idea of an automatic oracle for myocontrol failure detection is also outlined. In this relation, the oracle acts as a *supervising agent* having access to all information available within the HMI system for a hand prosthesis. The oracle should be able to gather significant data, manipulate and interpret it and, finally, provide a response on the occurrence of a myocontrol failure (as output of a classification system) whenever consulted. This behavior should be available online during the control of the prosthesis, also providing informational feedback to the user and/or demanding for an interaction if useful, and supplying specific buffered data to allow the s/p myocontrol update its model in the face of new detected instabilities, carrying out an interactive learning paradigm. Relying on such architecture, in this work we focussed on evaluating the possibility to detect myocontrol failures by extracting features that are based on the myocontroller prediction outputs (belonging to the *prosthetic-hand independent* informational zone, see [Figure 1](#F1){ref-type="fig"}) and on a minimal set of the prosthetic hand feedback signals (belonging to the *human-machine interface* informational zone, see [Figure 1](#F1){ref-type="fig"}).
{#F1}
2.1. Experimental Setup and Control
-----------------------------------
The experimental setup for the intact subjects as well as for the amputated subject is visible in [Figure 2](#F2){ref-type="fig"}. For the intact subject, it consisted of a commercial orthotic splint that was fitted with a custom-design mounting for the *i-LIMB Revolution* multi-fingered prosthetic hand manufactured by Touch Bionics / Össur (Touchbionics, [@B34]) (in the academic variant called *Robo-limb*) and a single *Myo* bracelet by Thalmic Labs (Thalmic-Labs, [@B33]). The i-LIMB is a commercially available electric-powered prosthetic hand presenting 6-DoF, including the flexion of 5 motorized fingers plus the abduction of the thumb. The Myo has eight sEMG sensors covering the full circumference of the users proximal forearm, and allows to acquire sEMG data at a sampling rate of 200 Hz. The Robo-limb has six step motors, each one of which can directly be controlled in current via a simple serial port protocol. This prosthetic hand provides, for each motor, feedback signals about the current reading and a "digit status" flag; in particular, this digit status feedback consists of a signal with discrete values, each of them identifying univocally one of the following digit statuses: "opening," "open," "closing," "closed," and "stalled". For the amputed subject, the setup consisted of a specifically designed orthotic socket, with the *Robo-limb* attached to its end-point by means of a standard connection interface. In particular, the prosthetic socket was a bespoke carbon fiber socket with 8 sEMG sensors embedded, and a standard pin/lock connection, manufactured by Pohlig GmbH (GmbH, [@B15]). The socket therefore allowed to acquire sEMG signals from the residual forearm\'s muscles. The experimental setups were completely wearable thanks to portable power supplies (lithium batteries) and wireless data communication with a nearby computer (bluetooth). All subjects were provided with a wireless button to signal whenever the myocontrol failed in interpreting their intent (more details in section 2.2).
{#F2}
S/p myocontrol was enforced using four parallel instances of Ridge Regression with Random Fourier Features (RR-RFF), a method already tested and used for myocontrol; the description of this particular Machine-Learning(ML)-based myocontroller lies outside of the article aims---for details refer to Gijsberts et al. ([@B14]), Strazzulla et al. ([@B32]), and Patel et al. ([@B26]). Rectified sEMG data, pre-processed with a 1st-order Butterworth low-pass filter with cut-off at 1 Hz, was taken as the input space of the myocontroller. On the other hand, the output of the myocontroller was given by the outputs of the four RR-RFF instances, and it was directly fed as (proportionally scaled) current commands to the six motors of the prosthetic hand. Note that, in order to build the RR-RFF instances, the algorithm was trained by gathering sEMG data while the users performed specific actions in accordance with explicative visual stimuli administered by the i-LIMB itself: i.e., the user followed the actions showed by the robotic hand (i.e., the ground truth) while, automatically, the sEMG data was acquired in order to train the algorithm (for details see again Gijsberts et al., [@B14]; Patel et al., [@B26], and refer to section 2.2 for information on the experimental procedure and specific actions). The reason why only four myocontrol prediction signals are used for the six DoFs of the prosthetic hand is that, for the grasp actions required in this study, the flexion of the middle, ring and little fingers are fully coupled (see section 2.2). Finally, it is worth to note that the output of the RR-RFF algorithm is a real number, which we limit to values between 0 and 1. In this relation, the mapping of this value to the prosthetic hand motor currents was based on a threshold (empirically set to 0.3) in order to let the users voluntarily trigger the prosthetic hand action. This means that the proportional control was between 0.3 and 1, whereas below 0.3 the robo-limb was set to a "home configuration" with all fingers fully open (see also the robo-limb actions description in section 2.2.3). Finally, please note that the use of the activation threshold and the "home configuration" are not arbitrary assumptions of the present study, but they were already included in the implementation of the RR-RFF-based s/p myocontrol developed and presented in our past works (Gijsberts et al., [@B14]; Patel et al., [@B26]; Strazzulla et al., [@B32]).
2.2. Experimental Protocol
--------------------------
### 2.2.1. Participants
The experiment was performed in accordance with the Declaration of Helsinki and was approved by the Work Council of the German Aerospace Center. All participants were thoroughly informed about the experimental protocol and were asked to sign an informed consent form. The participants were five able-bodied subjects and one trans-radial amputee, in the age between 28 and 45 years old among which there were five men and one woman. All subjects were experts in the usage of the state-of-the-art s/p myocontrol used in this study. "Experts" means that they knew what myocontrol is and they already used the same setup of this work at least two times in the last 2 months. This was necessary since we wanted to detect failures rather than observing the quality of the control. Additionally, please note that the myocontroller used in this study allows incremental learning, therefore enabling continuous co-adaptation during the online prosthesis usage by triggering new model updates; this further justifies the engagement of expert users, since in this case the failure detection is very useful also when a certain learning (and co-adaptation) framework was already established.
### 2.2.2. The Carrying Task
The central part of the experiment is composed by the repetitions of a specifically designed carrying task. In detail, a mug was supposed to be grasped at a low height using a power grasp (see also section 2.2.3), carried to a different location and released at an elevated height (Δ*d* ≈ 1*m*). For each task the subject started in a seated position, then stood up, performed the task and ended the repetition by sitting down again. After moving the mug to the elevated position the following iteration of the task was performed in the opposite direction, i.e., moving the mug from the elevated to the low position. This was repeated ten times, i.e., five tasks low to elevated position and five tasks elevated to low position. Note that the very simple structure of this task was desirable in order to hold our assumption that a human subject involved in a well-defined task with a clear aim will adhere to the actions required by the task. However, bisedes its simple structure, the specific design of this experimental task included walking, standing up, sitting down and body posture rise/lower---in addition to the main idea of object grasping/releasing---because we wanted to introduce mental effort/concentration and body posture demanding elements in the execution of the task, since they are known as stress factors for myocontrol instability (see section 2.2.5). In case a "catastrophic" failure prevented the completion of the task (i.e., the mug was dropped, impossibility to grasp or release the mug, etc.), the subject was asked to return to the seated position. The mug was returned to the original location and the attempted task was repeated. In this relation, please note that a failure during the transportation phase of the grasped object not necessarily coincided with a mug falling; as a single explicatory example, consider that just the index erroneously opened during the object transportation: this would not generate a "catastrophic" failure. After the ten task repetitions were completed, the subject took a break of no less than 10 min, and then executed a second session in the same way as the one just described. In [Figure 3](#F3){ref-type="fig"} we see an overview of the experimental protocol execution. Therefore, in total, two sessions per subject were performed, each of which was composed of a myocontroller training phase and the ten iterations of the mug-carrying task. In particular, during the training phase the user followed a stimulus while sEMG data were gathered to train the ML algorithm.
{#F3}
### 2.2.3. Myocontroller Training and Update Procedure
As already mentioned, the mug is supposed to be grasped using a power grasp. However, the ML algorithm was trained with the "power grasp," "index pointing," "thumbs-up," and "rest." In this application, the "rest" action implicates the opening of the artificial hand, i.e., the artificial hand fully open is intended as a "home configuration" that was reached when the user didn\'t contract the forearm muscles (i.e., the "rest" action). Each of these actions was provided for the training only with one repetition demonstrated by the user. Note that this is done to make the carrying task "more tricky" from a myocontrol point of view. By adding more grasp types there is an higher probability of misinterpretation by the ML algorithm. The reason of this lies on the fact that, by training only on one repetition, the ML algorithm lacks information about signal variations along different muscle contractions and body postures. Indeed, the ML algorithm training was performed in a seated position with the elbow located on an arm rest, whereas the carrying tasks were performed in bent and stretched body positions (see [Figure 3](#F3){ref-type="fig"}).
Once the training is completed, the user started the carrying task session. However, an update of the ML algorithm could be possible in case of a "catastrophic" failure, i.e., a failure that prevented the completion of the task. As mentioned before, after this happened the subject was asked to return to a seated position and retry the task. Here, if the subject "catastrophically" failed for a second time, the ML algorithm was updated. Since RR-RFF can be used incrementally, we added more information about the failed attempt to the data base of the algorithm. For example, after the second failed attempt on release the mug in the elevated position, another repetition of the "rest" action would be trained to improve the control in this specific situation. Among all sessions, there were thirteen repeated attempts and updates were required only in two cases.
### 2.2.4. Failure Occurrences Determination
Time instants of myocontrol failure occurrences were annotated exploiting two sources of information, the video recording of the full task and the button pressing of the subject. Whenever the user would realize that the prosthetic hand is not acting according to her intent, she should indicate this by a short press of the wireless button. By doing so we combined understanding of the participant about what was intended to happen with the details of video analysis. Detailed information on how exactly the two sources of information (user input and video annotations) were reconciled are provided in section 2.4.
### 2.2.5. Instability Stress Factors
It is worth to highlight that the specific design of the experimental protocol was chosen in order to insert instability stress factors within the execution of the tasks. Indeed, sources of myocontrol instability during Activities of Daily Living (ADL) can be principally due to: mental effort and lack of concentration of the user during the execution of simultaneous duties (i.e., controlling the prosthesis with muscle contraction while walking, sitting, etc.); usage of small data sets for the training of the ML-based myocontrol algorithm; user tiredness; and variations of the body posture (with a particular consideration for the posture of the arm from where the sEMG data is acquired) (Fougner et al., [@B12]; Wolf et al., [@B39]; Khushaba et al., [@B20]). Therefore, the experimental task and protocol were designed in order to contain the following specific instability stress factors: increased possibility of misinterpretations of the ML myocontrol algorithm by training on multiple grasp types with only one repetition; training of the ML algorithm in a totally different body posture (in a sitting position with the elbow resting on the armrest) with respect to the one used during the task executions; variations of the body (and arm) posture in order to accomplish the task (standing, sitting, stretching in order to grasp and release in lower/higher locations, walk); and, finally, several task repetitions, which likely introduced non-negligible physical and mental efforts.
2.3. Feature Extraction
-----------------------
The feature types for the classifier were selected on the basis of the observation that an instability of the myocontrol is reflected as an oscillatory behavior on the prediction outputs of the related ML algorithm. Furthermore, according to the control mapping between the prediction signals and the motor currents for the control of the prosthetic hand (see section 2.1), in order to actually make a failure happen the prediction signal has to necessarily show an oscillation, for at least one of its four components. Therefore, this has to be reflected, to a certain extent, in the opening/closing motions of the fingers of the prosthetic hand (i.e., in a delayed and electromechanically smoothed form).
Accordingly, two different features were considered. One was the counting of the number of myocontrol prediction signal crossings of the threshold value of the prediction-to-motor currents mapping function (see section 2.1), or, for simplicity, *threshold crossings* (TC). It can be noted that such a feature, embedding the oscillating behavior aforementioned, does not directly depend on the prosthetic device, being computed just a step before the artificial hand subsystem is involved (see [Figure 1](#F1){ref-type="fig"}). For the second feature types, the "digit status" feedback available from the i-LIMB (see section 2.1) was considered, which includes the behavior of the prosthetic hand in the feature space representation. In particular, the i-LIMB feedback was filtered to obtain a new signal, named "filtered digit status," with only two possible values: "flexing" (replacing the closed/closing digit statuses) and "extending" (replacing the open/opening digit statuses). Specifically, the "extending" status was associated to the value 0, whereas the "flexing" status to the value 1. This way, the counting of the variations of the filtered digit status value---or simply *status changes* (SC)---was used as a feature. Both TC and SC features are computed by means of a running window; the operation performed over the window was simply the direct crossings and the status changes. Incidentally, note that the difference between TC and SC lies in the fact that the latter embeds information from the physical system of the prosthesis. Indeed, it is not possible in general to compute SC from TC: multiple consecutive prediction signal crossings of the threshold (incorporated by TC) will not be visible in SC if they are faster than the electromechanical response time of the artificial hand; additionally, when the prosthesis fingers are stalled due to external forces, crossings of the threshold will not be appreciable in SC, since SC varies only in relation to fingers physical motions.
Thereafter, from such features, we derived three different feature sets: one composed by the TC feature, another by the SC feature and, lastly, one by the combination of the two previous ones (denoted TC+SC). It follows that the related feature vectors are
f
T
C
∈
ℕ
4
,
f
S
C
∈
ℕ
4
,
f
T
C
\+
S
C
∈
ℕ
8
,
where *f*~*TC*~, *f*~*SC*~, and *f*~*TC*+*SC*~ are the TC, SC, and TC+SC (in the following also indicated as TCSC) feature vectors, respectively. In addition, three different window lengths were tested for the computation of the feature vectors, both without overlap and with an overlap of half the window length for each of them. In this way it was possible to evaluate the performance of the instability detection also in relation to the delays that the different feature extraction methods would introduce in an online implementation. Therefore, resuming for the sake of clarity, the whole evaluation was tested on three different feature *types*, computed with three different window length-window overlap couples, providing in total 18 feature *sets* for each of the subjects involved in the experiment.
2.4. Labeling and Classification
--------------------------------
Firstly, for the sake of clarity, note that the automatic oracle was trained on a training set labeled thanks to the exploitation of the experimental task design and the video analysis, and thereafter was tested on new data (that was not part of the training set). In this testing, even if the experimental task phases were carefully designed, when a certain action of the prosthesis was performed (closing, opening or any other) the algorithm would not be able to predict a myocontrol failure, for example, with a simple congruency-check, because it doesn\'t know when and why such action was performed---a machine learning algorithm is required for this purpose. In particular, the labeling of the features, computed as described in the previous subsection, was performed by going through three steps: first, the beginning and end instants of time were obtained for each task; afterwards, a user\'s *intent ground truth* was determined in relation to the execution of the grasp or the rest action (see section 2.2); finally, the instants of time of failures were identified, allowing us to define the myocontrol behavior as stable or unstable.
The starting and ending time of a task, namely *t*~*START*~ and *t*~*END*~, respectively, were input by the experimenter by pressing a key on the computer keyboard, while vocally indicating them to the subject. On the other hand, the user\'s intent ground truth is obtained by manually inspecting the video recording of each experiment (a timer was seen in the video, synchronized with the data recording, [Figure 3](#F3){ref-type="fig"}) determining the times of the grasping and releasing of the mug, here indicated as *t*~*GRASP*~ and *t*~*RELEASE*~, respectively. In this way, considering that the subject is instructed---within every single task---to (i) rest from *t*~*START*~ until grasping the mug, (ii) grasp from *t*~*GRASP*~ until releasing it, and (iii) rest, again, from *t*~*RELEASE*~ till the end of the task *t*~*END*~, therefore it was possible to individuate the temporal evolution of the users\' intent with a reasonable degree of reliability, and use it for the myocontrol performance labeling. A qualitative graph of the task and user intent timing is depicted in [Figure 4](#F4){ref-type="fig"}. Thereafter, the instants of time in which a failure occurred where identified using the video analysis; more in detail, it was done by carefully looking at the behavior of the prosthetic hand and, once a behavior of the prosthetic hand in contrast with the user intent was identified, then the exact instant of time was determined by individuating the initial video frame of such behavior, and taking note of the time displayed in the timer present in the video. Exploiting the information given by the intent ground truth, the occurrence of motions of the prosthetic hand that were in disagreement with the user\'s intent was considered as "myocontrol failure" event, whereas every motion in accordance to the intent was considered as "myocontrol success." It is worth to highlight that the determination of failure/success behaviors is based on *a posteriori* judgement based on video inspections which is, however, further supported by the information of the user\'s opinion provided by pressing the wireless button. In this way, the experiment scene was analyzed (e.g., slow-motion replay, frame by frame inspection, etc.) without neglecting the users feeling on the occurrence of a failure: this means that particular attention was devoted to identify failure time instants around the pressing of the wireless button by the user; however, at the same time, the entire video was carefully inspected for failures, and therefore, in case an unwanted behavior of the prosthesis occurred when not signaled by the user, or differently, there was no failure even if signaled by the user, the decision based on the mere video analysis was considered trustworthy. Indeed the online judgement of the user provided by pressing the wireless button cannot be considered absolutely reliable; in particular within the present study we were able to identify specific recurring unreliable behaviors (refer also to [Figure 4](#F4){ref-type="fig"}):
a. once a subject presses the button, she will not signal again for additional failures following the first instance (i.e., while and just after the button pressing);
b. there is a "structural" delay between the occurrence of a myocontrol failure and the pressing of the button by the user---this is due to a cognitive process in identifying the failure, and the delay can be remarkable (of the order of seconds);
c. during the delay mentioned in (2), if other failures occur then they are not reliably reported by the user;
d. finally, even if the subject is asked to constantly focus on identifying unwanted behaviors of the prosthetic hand, some failures are not even noticed/perceived by the subject, and therefore they are simply not reported.
{#F4}
Therefore the video analysis allowed us to determine the existence and time instants of myocontrol failure occurrences bypassing the online-only judgement problems just listed above, which also formed the most relevant criticisms of our previous preliminar study on automated instability detection (Nowak et al., [@B25]). Finally, note that the failures were discrete events (see [Figure 4](#F4){ref-type="fig"}) because, in the study, the interest was related to the initial instant in which an unwanted behavior of the prosthetic hand manifested. The fact that a failure could persist after its initial occurrence were not considered as relevant, because the detection of a failure implies---in an online usage scenario---the stop of the action executed by the user and the performing of a model update.
At the end of the procedure just described, the outcome is a set of time instants of the myocontrol failures. This information was thereafter used to label the features extracted from the user-machine data flow (as described in section 2.3). In particular, since every feature vector corresponded to a certain data window, in accordance to the specific length and overlap used, if within the window a failure was present, then the label associated to such related feature vector was set to "failure" (associated to the value 1); in the opposite case, as "success" (associated to the value 0). The labeled features were used as input to a classifier in order to evaluate the automatic detection of an instability in the myocontrol.
A Support Vector Machine (SVM) classifier was used to perform the classification of the feature sets. The implementation was realized in MATLAB by means of the LIBSVM library (Chang and Lin, [@B5]). The procedure for the validation of the myocontrol failures detection was realized for each single subject by means of a nested cross-validation (CV) applied to the whole dataset, composed by the features extracted from the data of all the tasks executed during the experiment (i.e., 20 tasks, see section 2.2). Note that training dataset imbalances have been taken into consideration when training the classifier (especially in relation to the usage of different window lengths) using a class-weighted SVM (wSVM) (Akbani et al., [@B1]). The wSVM differs from the non-weighted variant because it uses two regularization parameters *C*~0~, for the class "failure" (value: 0), and *C*~1~, for the class "success" (value: 1), instead of using a single regularization parameter *C* (for details refer also to Veropoulos et al., [@B36]). Specifically, in order to tackle the skewness of class portions in the datasets, the regularization parameters of the wSVM were set as *C*~0~ = 1 and *C*~1~ = *n*~0~/*n*~1~, where *n*~0~ and *n*~1~ are the number of "success" and "failure" classes in the training dataset, respectively. Thus, in detail, the CV was composed by two nested loops. The inner loop consisted of a 10-fold CV, where a grid-search was conducted for the selection of the best wSVM classifier hyperparameter combination. The outer loop, a 10-fold CV as well, evaluates the performance of the wSVM model that won in the inner loop, tested on a separated external fold.
3. Results {#s3}
==========
3.1. Metrics and Statistical Analysis
-------------------------------------
First, an analysis of the myocontrol failure occurrences along the individual task executions is reported. Such analysis provides for an overview of the temporal distribution of the failures and, according to the structure of the experimental protocol, permits to retrieve preliminary considerations on the nature and distribution of the failures themselves.
Subsequently, a global evaluation of the classification performance was carried out considering all the six subjects involved in the experiment. Specifically, in order to provide an overview of the experimental results, we used the Receiver Operating Characteristics (ROC) (Fawcett, [@B11]), and computed the balanced error rates (BER) over the different combinations of window lengths and overlaps for the extraction of the features. Furthermore, the data gathered from the subjects was also evaluated statistically. Here, we performed a three-way ANOVA with the factors *feature type, window length*, and *window overlap*, in order to determine the set of parameters which provides the best performances. Finally, due to the modest number of subjects involved in the present "first step" study on automatic myocontrol failure detection, we conducted a statistical power analysis related to our experimental design.
3.2. Per-Subject Failure Occurrence Analysis
--------------------------------------------
In this section a per-subject analysis of the failure occurrences is provided, intended to launch the global analysis on the classification performance of the following subsection, which otherwise could result incomplete since decoupled from a view of the number and temporal distribution of the myocontrol failures. In the following, the subjects involved in the experiments will be indicated as S1, S2, S3, S4, and S5 for the able-bodied ones, and SA for the amputee.
Fist of all, an example of the temporal plot of the myocontrol failures along with the wireless button pressings is provided in [Figure 5](#F5){ref-type="fig"}, in particular for one task of the subjects S4 and SA. Such graphs are the equivalent realistic case of the qualitative graph of [Figure 4](#F4){ref-type="fig"}. For the sake of compactness, the temporal plots of the failures for all the tasks and subjects are not reported, instead the number and temporal distribution of the failures were analyzed in an aggregate form along the different task executions, considering each subject individually.
{#F5}
[Figure 6A](#F6){ref-type="fig"} shows the mean number of failures per task related to each subject. In particular, we can see that the highest mean number of failures was given by the subject S4, while the highest standard deviation can be observed in relation to the subject S1. From this preliminary analysis (together with the example provided in [Figure 5](#F5){ref-type="fig"}), it is already possible to notice that the general behavior of the myocontrol failures for the amputee subject SA was comparable with the ones presented by the able-bodied subjects. This allows a global analysis of the failure detection performance including all subjects (see next subsection). Then, for a finer analysis, in [Figure 6B](#F6){ref-type="fig"} the mean number of failures per subject is reported for the different zones of the task executions, that are: *Pre-Grasp* (between *t*~*START*~ and *t*~*GRASP*~), *Grasp* (between *t*~*GRASP*~ and *t*~*RELEASE*~) and *Post-Grasp* (between *t*~*RELEASE*~ and *t*~*END*~)---see section 2.4. From such figure it is possible to observe that the mean number of failures appreciably increased for all the subjects during the last part of the task execution (i.e., the Post-Grasp zone). This could be due to the combination of two aspects: the first was the lack of concentration due to the negative effect of mental and/or physical efforts in executing the task; the second was related to the duration of the Post-Grasp zone, which was found to be longer than the other zones for all subjects.
{#F6}
In order to further analyse the possible presence of patterns of failure occurrences within the task zones themselves, in [Figure 6C](#F6){ref-type="fig"} a map of the temporal trend of the mean number of failures is provided. Specifically, such a map was computed according to a task-zones-wise normalized time, in order to make the various task durations uniform. Looking at the figure, first of all it is possible to better see that, on average, the myocontrol failures were mostly concentrated in the Post-Grasp zone of the task execution, and particularly in its central part. Furthermore, it is visible that at the beginning of the task, specifically in the first part of the Pre-Grasp zone, the mean number of failures was particularly limited (in several zones, zero). Differently, an increasing of failures was present as the normalized *t*~*GRASP*~ time was approached (i.e., the *reaching to grasp* phase), in which the motions of the arm and of the whole body of the subjects were particularly stressed (see frame 2 in [Figure 3](#F3){ref-type="fig"}). Lastly, we can highlight that, in the Grasp zone, the mean number of failures was comparable with the values observable in the Pre-Grasp zone; in particular, those subjects that presented a higher average number of failures while holding the object, showed such behavior more in proximity of the starting and ending parts of the object grasp action. We are able to observe a certain degree of consistency among the Pre-Grasp and the Grasp zones, characterized by a clearly lower average number of failures with respect to the Post-Grasp zone.
3.3. Global Evaluation
----------------------
### 3.3.1. Classification Performance
The ROC curves plot the true positive rate vs. the false positive rate obtained by modifying the decision criterion of the wSVM class membership probabilities output, and were computed for every feature set, for each subject, in accordance with the convention illustrated in the following. A "myocontrol success" (or "success," S) was considered the *positive condition* (P), whereas a "myocontrol failure" (or "failure," F) was considered as the *negative condition* (N). In accordance with this, it was possible to define the relative *true positive* (TP), *false positive* (FP), *false negative* (FN) and *true negative* (TN) occurrences, that can be arranged in a confusion matrix *M*~*conf*~ of the form
M
c
o
n
f
=
\[
N
T
P
N
F
P
N
F
N
N
T
N
\]
,
where *N*~*TP*~, *N*~*FP*~, *N*~*FN*~, *N*~*TN*~ are the total number of TP, FP, FN, and TN occurrences based on the wSVM classifier prediction outputs, obtained during a single validation of the outer loop 10-fold CV (see Labeling and Classification subsection) for a given feature set. In this relation, the matrix of occurrence rates *M*~*rate*~ is given for each couple of subject and feature set as
M
r
a
t
e
=
\[
T
P
R
F
P
R
F
N
R
T
N
R
\]
=
\[
N
T
P
N
T
P
\+
N
F
N
N
F
P
N
F
P
\+
N
T
N
N
F
N
N
T
P
\+
N
F
N
N
T
N
N
F
P
\+
N
T
N
\]
,
where *TPR*, *FPR*, *FNR*, and *TNR* are the TP, FP, FN, and TN rates, respectively. [Figure 7](#F7){ref-type="fig"} therefore reports the mean ROC curve---over the five intact subjects and for the amputee---of the ROC curves obtained from the *TPR* and *FPR* of the matrices computed as in (1). Furthermore, [Table 1](#T1){ref-type="table"} reports the Area Under Curve (AUC) of the mean ROCs of [Figure 7](#F7){ref-type="fig"}: indeed the AUC provides an aggregate measure of the quality of the classifier model\'s predictions across all possible classification thresholds applied to the decision values; for further details about ROC and wSVM decision values see Fawcett ([@B11]) and Chang and Lin ([@B5]).
{#F7}
######
The AUC values with respect to the ROC curves illustrated in [Figure 7](#F7){ref-type="fig"}, reported for the different type of feature and combinations of window length/overlap, for the intact subjects (S1--5) and the amputee (SA).
**AUC**
---------- ------------ --------- -------- -------- -------- ------------ ------------
**TC** No overlap 0.7955 0.7172 0.8286 0.8108 0.8895 0.9031
Overlap 0.7986 0.7656 0.8274 0.8731 0.9075 0.953
**TCSC** No overlap 0.86 0.9196 0.9159 0.9662 0.9526 0.9722
Overlap 0.8514 0.9345 0.9017 0.9523 0.942 0.9815
**SC** No overlap 0.897 0.9195 0.9075 0.9808 **0.9606** **0.9927**
Overlap 0.9003 0.9304 0.9044 0.9755 0.9425 0.9915
*Numbers in bold highlight the higher AUC values for S1--5 and SA*.
In relation to these figure and table, let us firstly observe the results given by the TC feature type. Window lengths of 0.5 s report for lower AUC values, under the threshold of 0.8 (both for intact subjects and amputee), highlighting the presence of a relatively consistent number of missed or wrong failure detections. Instead, with window lengths of 1 s and 3 s we can see AUC values grater than 0.8, with the highest one equal to 0.9075 and 0.953 for the intact subjects and the amputee, respectively, for a 3 s overlapped window. Differently, looking now at [Figure 7](#F7){ref-type="fig"} and [Table 1](#T1){ref-type="table"} for the TCSC and SC feature types, it is possible to observe better classification performance, i.e., AUC values always greater than 0.8, and greater than 0.9 if only the window lengths of 1 s and 3 s are considered. In particular, for the 3*s* window length, we can see that the minimum AUC value is equal to 0.942. Here, we can observe the preferable classifier model\'s performance for the case of a 3 s non-overlapped window: an AUC of 0.9606 for the intact subjects and 0.9927 for the amputee. Therefore, better classification performance are reported for the same combination of selected features for both intact subjects and amputee, also showing similar trend of performance along all the features/windowings. The overall best score was reported by the amputed subjects with an AUC of 0.9927.
In order to further evaluate the failure detection performance and statistically assess their distribution among the subjects, the BER was computed for the different feature types and window length/overlap combinations. The BER is given as
B
E
R
=
100
2
(
N
F
N
N
T
P
\+
N
F
N
\+
N
F
P
N
F
P
\+
N
T
N
)
,
where the multiplication by 100 is present to obtain a percentage value. The goal of the statistical analysis was to use the BER outcome metrics to compare different features and windowing characteristics. In order to do that, we first carried out a comparison between the intact subjects and the amputee. This has been done in two directions: (i) looking at the temporal distribution of the failures in the tasks and (ii) looking at the BER outcome. In relation to the distribution of the failures along the task, the temporal trend of the failures---as already illustrated in [Figure 6C](#F6){ref-type="fig"}---was considered. Indeed, in [Figure 8A](#F8){ref-type="fig"} such temporal trend is illustrated among all the subjects in a least square sense, highlighting the cases related to the amputee (red circles) and the cases related to the intact subjects (blue crosses). Then, the influence of each single case contributing to the least square trend was assessed computing the related Cook\'s distances---a commonly used estimate of the influence of data points in least-squares regression analyses (Cook, [@B7])---which values are reported in [Figure 8B](#F8){ref-type="fig"}. In particular, within this latter figure, it is also depicted an aggregated range-plot that highlights how the Cook\'s distances related to the amputee (marked with red circles in the range-plot) are not exceeding the middle point of the range of all distances, therefore meaning that the influence of the amputee on the temporal trend of the failure was limited with respect to the entire group of subjects. On the other hand, from the point of view of the BER metrics, the presence of a significant difference between amputee and intact subjects was verified, computing the BERs for all the combination of feature and windows, grouping then the data as "amputee" and "intact". To do this, firstly the normality of these data was assessed using the Shapiro-Wilk test, which reported that the distribution of the group "amputee" significantly differed from a normal distribution (*p* = 0.042; significance level set to 0.05). Consequently, we performed the non-parametric Wilcoxon rank-sum test, which results reported that the BERs of the "amputee" group did not differ significantly from the "intact" group, *W* = 1021, *p* = 0.0826. Therefore, given the limited influence of the amputee on the overall temporal trend of failures during the tasks and the non-significant difference between the BERs of the intact subjects and the amputee, for the main statistical analysis related to the comparison of the different features and windowing combinations we pooled the data of the intact subjects and the amputee together for a global evaluation of the classification performance.
{ref-type="fig"} and section 3.2). Points regarding the amputee subjects are reported with red circles, wheares blue crosses represent the points related to intact subjects. **(B)** Cook\'s distances of each single point (or *case*) related to the Lest Square trend of **(A)**. In the top-left part, it is present an aggregated range-plot of the Cook\'s distances, highlighting the location of the amputee-related values with red circles within the whole interval of distance values.](fnbot-13-00068-g0008){#F8}
Therefore, in this relation, we investigated three different factors with the BER outcome, namely *feature type* (TC, TC+SC or SC), *window size* (0.5s, 1.0s or 3.0s) and *window overlap* (no overlap or half overlap). Taking these factors into account we performed a three-way ANOVA using the statistical tools provided in *R* (R Core Team, [@B28]). Normality of data distribution was verified using the Shapiro-Wilk test, and a Levene\'s test to check the homogeneity of variance was performed; both tests revealed that the assumptions of the ANOVA were not violated. Statistical significance was set to *p* \< 0.05. We obtained the following results: for the factor *feature type F*(2, 90) = 17.493, *p* \< 10^−3^, for the factor *window size F*(2, 90) = 2.809, *p* = 0.066 and for *window overlap F*(1, 90) = 1.866, *p* = 0.175. Since *window size, window overlap* and all interaction terms as well have no significant influence, as usual in the case of nonsignificant factors we pooled together the related data, reducing the model to the only factor *feature type*, and performed a one-way ANOVA. The results are *F*(2, 105) = 18.09, *p* \< 10^−3^. A boxplot of the different groups can be found in [Figure 9](#F9){ref-type="fig"}. The one-way ANOVA was then followed up by a Tukey-test to perform pairwise comparisons. It followed that both SC and TC+SC perform significantly better than TC with *p* \< 10^−3^ in both cases. However, the difference between SC and TC+SC is not significant with *p* = 0.569. The Tukey-test therefore revealed that better classification performance are obtained with the SC and TC+SC feature types.
{#F9}
Finally, we report in [Figure 10](#F10){ref-type="fig"} the mean BER per each subject over the single BERs obtained with both the TC+SC and SC feature types (since we have seen that there is no statistically significant difference between TC+SC and SC). Looking at the figure, the resulting mean BER over all the subjects is equal to 18.86%. This classification performance provides positive outcomes on the actual possibility to automatically detect instability with the mid-term prospect of improving myocontrol reliability.
{#F10}
### 3.3.2. Statistical Power and Results Generalizability
In order to analyse the power of our experimental design in detecting statistical effects, we conducted a *post hoc power analysis* with the program *G^\*^Power* (Faul et al., [@B10]; for a full description see Erdfelder et al., [@B8]), with relation to key main effects taken into account with the ANOVA of the previous subsection. Let us first consider the significantly better performance of the features SC and TCSC with respect to TC resulting from the one-way ANOVA. We have a total sample size of 108 and a number of groups equal to 3. The related observed effect size calculated on the basis of the sum of squares was equal to *f* = 0.587 \[that is a large effect size (Cohen, [@B6])\]; the power (1 − β) to detect an effect of this size was determined to be 0.9889 (for a significance set at α = 0.001), which was clearly greater than the (conventionally) recommended threshold of 0.8 (Cohen, [@B6]). On the other hand, considering now the effect of the factors statistically analyzed by the three-way ANOVA in the previous subsection (total sample size of 108; number of groups equal to 18), we calculated on the basis of the sum of squares that the effect size of the factor *feature type* was 0.6235, and the related power of the experiment was 0.9955 (for a significance set at α = 0.001), clearly greater than the conventional threshold of 0.8. Differently, the effect size of the factor *window length* was calculated to be equal to 0.2496 with a related power of the experiment (1 − β) = 0.1458 (for a significance at α = 0.001) and (1 − β) = 0.6215 (for a significance at α = 0.05). The effect size of the factor *window overlap* resulted to be equal to 0.1436 with a related power of the experiment (1 − β) = 0.0327 (for a significance at α = 0.001) and (1 − β) = 0.3147 (for a significance at α = 0.05). Therefore, we cannot completely rule out that there was an effect of the factors *window length* and *window overlap* as resulting by the three-way ANOVA, because it exists the possibility that the limited statistical power have played a role in limiting the significance of such specific factors. Indeed, to obtain a power of at least (1 − β) = 0.8, a total sample size of 834 (with significance at α = 0.001) or 383 (with significance at α = 0.05) would be needed for the *window overlap* factor, and a total sample size of 323 (with significance at α = 0.001) or 158 (with significance at α = 0.05) would be required for the *window length* factor. However, what we can say is that the experiment had enough statistical power to detect a significant better classification performance given by the usage of the SC and TCSC feature.
In addition, there are also some considerations that must be outlined about possible limits in the generalizability of the presented results. First of all, as already mentioned in section 3.1, notwithstanding the importance that we think this first study on Interactive Myocontrol has, it is necessary to take into account that the number of six subjects involved in the experiment was relatively modest. In this regard, pooling together the intact subjects and the amputee for the ANOVA reported in section 3.3.1 has to be handled with care, even if motivated by an analysis of the influence of the amputed subject on the overall temporal distribution of the failures and, more directly, on a Wilcoxon rank sum test (see section 3.3.1). Indeed, there exists the risk that the number of intact subjects *N*~*I*~ = 5 and the number of amputees *N*~*A*~ = 1 could limit the validity of such results to only the specific subjects involved in this study, therefore affecting its generalizability. In fact, it is necessary to take into account that in real daily life applications amputees could show remarkable levels of heterogeneity with respect to able-bodied subjects and to other amputees. However, if such differences affect also the sphere of automatic failure detection for Interactive Myocontrol still needs to be verified, and further studies have to be carried out also in this direction, as outlined in the following section 4. In this study, for a separated analysis and comparison of the failure detection performance between the intact subjects and the amputee, it is possible to refer to [Figure 7](#F7){ref-type="fig"} and [Table 1](#T1){ref-type="table"} and related explanations in section 3.3.1.
4. Discussion and Conclusions {#s4}
=============================
4.1. Interactive Myocontrol and Co-adaptation
---------------------------------------------
The study presented in this article took its inspiration from the *interactive myocontrol* paradigm as a way to face the problem of instability in myocontrol, so far unresolved. In interactive myocontrol, the s/p control scheme can be updated with new information, once necessary in the face of a *myocontrol failure* occurrence---as a particularization of the incremental learning concept. Within the whole framework of human-machine interaction in prosthesis control, it is desirable to have such incremental updates in an autonomous and real time fashion, and therefore we introduced an *automatic oracle* agent as a counterpart of a "human oracle," whose presence we want to avoid because it represents a source of bias of the whole paradigm. The role of the automatic oracle is to detect when a myocontrol failure occurs, defined as a behavior of the prosthetic device that does not coincide with the user intent. Indeed, please note that the goal of the myocontrol model was exactly to translate the muscle output signals into the user intent: therefore, if during the prosthesis usage the muscle output became flawed for any reason, then the model should understand that such specific output was still related to a certain intent. It follows that failure detection is needed to let the model gather more data and understand that new muscle signals have to be considered in order to continue understanding the right intent of the user. Finally, theoretically the action of the automatic oracle should be as much transparent and imperceptible as possible for the user, i.e., the user should not notice its presence even during the update of the s/p myocontrol.
On the other hand, we are aware that total transparency is very difficult to achieve---if not impossible---and indeed, interactive myocontrol also aims to *co-adapt* with the user. Picture putting the automatic oracle together with the subject\'s judgement: once a failure is detected, the system would ask to the user to repeat the action while she is communicating her intent, in order to let the oracle gather new data in view of the incremental learning. Thereafter the myocontroller model update will occur automatically with basically no additional burden to the user; in other specific cases the subject could voluntarily "teach the prosthesis" for new data to preventively improve myocontrol stability, or even to learn completely novel actions.
In the light of these concepts, the authors firmly think that the topic of automated instability detection is quintessential to fully exploit interactive myocontrol. We are therefore confident that the work here presented, focusing on the possibility of classifying myocontrol instability, represents an essential preliminary step toward a truly interactive prosthetic myocontrol.
4.2. Informational Set for Automated Failure Detection
------------------------------------------------------
[Figure 9](#F9){ref-type="fig"} shows that statistically significantly better classification performances were obtained using the TC+SC and SC feature types, whereas there was no significant difference between TC+SC and SC (refer to the ANOVA results in the section 3.3). This result tells that the usage of the information coming from the prosthetic device significantly improved the classification performance, highlighting the importance of the terminal part of the user-device interface chain, i.e., the informational zone that is the outcome of the influences of all the previous steps (the *human-machine interface informational zone*---refer to [Figure 1](#F1){ref-type="fig"}). In light of the obtained results, this can be likely due to the fact that part of the information embedded in the TC feature was not corresponding to any behavior visible to a human eye (for details see section 2.3)---even in a meticulous video analysis---and therefore was simply not corresponding to a myocontrol failure, determining poorer classification performance with the TC feature only, in accordance to the importance of the information given directly by the prosthetic device.
Additionally, the dimension of the informational set needed for the automatic oracle is worth to be discussed. In principle the inclusion of all possible data from the HMI environment is absolutely welcome ([Figure 1](#F1){ref-type="fig"}): just think about an automatic oracle that can get as much knowledge as possible from the prosthetic system in order to better understand myocontrol failure occurrences and be potentially very reactive to unknown situation---the more information available, the better the performance. Nevertheless, the experimental results presented in section 3.3 shows that a failure classification performance with mean BER of 18.86% (refer to [Figure 10](#F10){ref-type="fig"}) can be obtained with a very small subset of the available HMI information, i.e., only using the prosthetic hand feedback about the extending/flexing status of the fingers (SC feature). This specific aspect deserves a careful consideration, because it shows the possibility to improve the reliability of myocontrol with a very limited set of information and, therefore, with few hardware requirements (e.g., sensors). This means lower costs without negatively affect the user\'s degree of acceptance of the prosthetic system (which is strongly influenced by weight, heat production, hardware faults, etc.).
4.3. Can the Automated Detection Go Online?
-------------------------------------------
One of the fundamental aspects to detect myocontrol failures online (and possibly update the myocontroller model on-the-fly) is the window length used to extract the features for the classifier, because of the delay that it consequently introduces. The results show that the classification performance were independent of the selected window length and related overlap (refer to [Figures 7](#F7){ref-type="fig"}, [9](#F9){ref-type="fig"}) and that there was a statistically significant improvement in the performance as the TC+SC or SC feature types are used (refer to section 3.3, Tukey-Test results). This means that acceptable classification performance can be obtained introducing only a relatively contained delay of 0.25 s on top of the 0.5 s window length. Indeed, in order to enhance the immediacy of the failure detection, it is preferable to have shorter time windows, approaching lengths of 100---200 ms (that are close to the delay perception limit for humans). On the other hand, notice that a fast response to a failure occurrence is not a founding specification for the interactive myocontrol framework. Indeed, before a failure is detected, some data has to necessarily be logged in order to allow the incremental update of the myocontroller model (a query to the user to know which would have been the correct action could be necessary, if not only the "power grasp" is supposed to be used for grasping). Therefore, in this view, a certain delay would be unavoidable---even desirable: the data could continuously be logged by means of the window for the features extraction itself, and then automatically provided for the update when a failure is detected. Even a delay of few seconds could turn into a desirable feature. For these reasons, we think that the possibility to classify myocontrol instability emerging from the results nicely fits the interactive myocontrol framework, providing remarkable prospectives in the right direction for further studies toward an online implementation of the application.
Another important aspect to make the automatic failure detection go online is the determination of the user intent "ground truth" necessary to label the training data for the automatic oracle. In the present work, the definition and timing of the user intent was possible by the combination of *a priori* (design of the experimental task) and *a posteriori* (video analysis) actions, which are difficult to be applicable for real world applications. However, note that our study focused on verifying the actual possibility to build a classifier able to detect myocontrol instabilities. Being this work a novel approach and direction of research in this field, for the moment we didn\'t want to respond to the question "how to determine user intent ground truths in real world applications for the automatic oracle trainings," instead our experimental goal was to find "how to have a reliable user intent ground truth for the data labeling of the automatic oracle, in order to verify if myocontrol failure detection is actually possible." Aspects relating the determination of reliable user intent ground truths in real world applications will be object of future studies.
4.4. A Wider Perspective: Myocontrol and Radical Constructivism
---------------------------------------------------------------
In Nowak et al. ([@B24]) we speculated that myocontrol, as instantiated by ML, could benefit from a *Radical Constructivist* (RC, standing also for Radical Constructivism) approach. RC is a branch of constructivist psychology positing that learning, as a generic process in humans as well as in machines (i.e., the *agents*), is an attempt to optimally organize the agent\'s perceptive field, i.e., its own sensory and experiential inner world, according to some specific fitting criterion (von Glasersfeld, [@B37], [@B38]). Once it becomes incremental and interactive (Gijsberts et al., [@B14]; Strazzulla et al., [@B32]), myocontrol fits quite well in this picture: it is the attempt of a ML algorithm to fit as best as possible the bio-signal patterns received from a disabled human subject. One of the crucial aspects of RC-framed myocontrol is then the necessity of having a reliable "oracle" allowing qualitative feedback be sent back to itself: whenever something goes wrong (i.e., a myocontrol failure), based on this knowledge the ML model must take action to correct its own perceptive landscape; as well, a good fit can be reinforced.
So far, the feedback oracle has been the user herself. Thanks to interactive learning, she has been able to ask for further data gathering and model updating whenever required. In RC terms, we view the quest for an *automated* oracle---that we have introduced in this paper---as an attempt to enlarge the perceptive universe of the machine (Nowak et al., [@B24]).
Conclusions
-----------
In this article we presented the results of a study for the improvement of the myocontrol of prosthetic hands with respect to the well-known issue of reliability. We outlined the concept of "automatic oracle," i.e., a supervising agent that is able to classify when a myocontrol failure occurs, and to carry out an incremental learning paradigm to deal with myocontrol instability. Relying on such general framework, in this work we focussed on the possibility of classifying the myocontrol instability testing a set of features extracted from the user-device interface\'s informational chain. To this purpose, we engaged six expert myocontrol users (five able-bodied persons and one trans-radial amputee) in a simplified and carefully designed experiment. It consisted of 20 grasping tasks for each subject, in which we were able to identify the exact timing of myocontrol failure occurrences thanks to the information provided by the users and to an offline analysis of the experiment video recordings, as detailed in section 2.3. In this way, exploiting reasonable assumptions on the subjects\' intent based on the structure of our experimental protocol, it was possible to label the features as "myocontrol success" or "myocontrol failure," in order to train and test a wSVM classifier for the automated detection of myocontrol instability.
We are confident that the work presented in this article represents a further step toward a truly interactive prosthetic myocontrol, in which the overall HMI system will be capable of online detecting myocontrol instability, allowing for proper model updates and virtuous user-device interactions where necessary. About forthcoming future work, the focus will firstly go on improving the failure classification accuracy by investigating the usage of different and/or more advanced feature typologies. We also want to work on a generalization of the failure definition and detection, for example considering the teleoperation of ideal and "fully programmable" artificial hands, as it is possible in presence of virtual reality scenarios. Thereafter, future efforts will be devoted to the implementation of the real online application. Such kind of studies are fascinating also in relation to the possible applications in non-prosthetic or -rehabilitation systems, i.e., in general teleoperation in the field of human-robot interaction.
Ethics Statement {#s5}
================
This study was carried out in accordance with the recommendations of the local ethics committee (Ethical Committee of DLR) with written informed consent from all subjects. All subjects gave written informed consent in accordance with the Declaration of Helsinki. The protocol was approved by the Ethical Committee of DLR.
Author Contributions {#s6}
====================
RM, MN, CM, and CC planned the study and the experiments. RM and MN prepared and conducted the experiments. RM postprocessed the experimental data and produced the results. RM, MN, and CC analyzed the results and RM created the figures. RM, MN, and CC wrote the manuscript. All authors reviewed the manuscript for important intellectual content and approved the submitted version.
Conflict of Interest Statement
------------------------------
The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.
^1^The winners are Robert Radocy of TRS Prosthetics (TRS-Prosthetics, [@B35]) and the Softhand Team (Godfrey et al., [@B16]).
[^1]: Edited by: Ricardo Chavarriaga, École Polytechnique Fédérale de Lausanne, Switzerland
[^2]: Reviewed by: Noman Naseer, Air University, Pakistan; Aymar De Rugy, Centre National de la Recherche Scientifique (CNRS), France
| 2024-01-04T01:26:29.851802 | https://example.com/article/2525 |
Q:
AWS credentials in Dockerfile
I require files to be downloaded from AWS S3 during container build, however I've been unsuccessful to provide the AWS credentials to the build process without actually hardcoding them in the Dockerfile. I get the error:
docker fatal error: Unable to locate credentials
despite previously having executed:
aws configure
Moreover, I was not able to use --build-arg for this purpose.
My question: is it possible to have these credentials in build time without hardcoding them in the Dockerfile and if so how?
Thank you for your attention.
A:
Using the --build-arg flag is the correct way to do it, however you must use the ARG directive, not the ENV directive to specify them in your Dockerfile.
Here is an example Dockerfile that I have used with AWS credentials. It takes in the aws credentials as build arguments, including a default argument for the AWS_REGION build argument. It then performs a basic aws action, in this case logging into ecr.
FROM <base-image>:latest # an image I have that has `aws` installed
ARG AWS_ACCESS_KEY_ID
ARG AWS_SECRET_ACCESS_KEY
ARG AWS_REGION=us-west-2
RUN aws ecr get-login --no-include-email | bash
CMD ["npm", "start"]
You then build the image with the following command:
docker build -t testing --build-arg AWS_ACCESS_KEY_ID=<Your ID Here> \
--build-arg AWS_SECRET_ACCESS_KEY=<Your Key Here> .
Hope this helps.
| 2023-11-06T01:26:29.851802 | https://example.com/article/1226 |
---
abstract: 'Let $\mathfrak R$ be a weakly noetherian variety of unitary associative algebras (over a field $K$ of characteristic 0), i.e., every finitely generated algebra from $\mathfrak{R}$ satisfies the ascending chain condition for two-sided ideals. For a finite group $G$ and a $d$-dimensional $G$-module $V$ denote by $F({\mathfrak R},V)$ the relatively free algebra in $\mathfrak{R}$ of rank $d$ freely generated by the vector space $V$. It is proved that the subalgebra $F({\mathfrak R},V)^G$ of $G$-invariants is generated by elements of degree at most $b(\mathfrak{R},G)$ for some explicitly given number $b(\mathfrak{R},G)$ depending only on the variety $\mathfrak{R}$ and the group $G$ (but not on $V$). This generalizes the classical result of Emmy Noether stating that the algebra of commutative polynomial invariants $K[V]^G$ is generated by invariants of degree at most $\vert G\vert$.'
address:
- 'MTA Alfréd Rényi Institute of Mathematics, Reáltanoda utca 13-15, 1053 Budapest, Hungary'
- 'Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Block 8, 1113 Sofia, Bulgaria'
author:
- Mátyás Domokos and Vesselin Drensky
title: |
Noether bound for invariants\
in relatively free algebras
---
[^1]
Introduction
============
We fix a base field $K$ of characteristic 0. Throughout the paper $V=V_d$ denotes a $K$-vector space of dimension $d\geq 2$ with basis $X_d=\{x_1,\ldots,x_d\}$. We consider the polynomial algebra $K[V]$ and the free unitary associative algebra $K\langle V\rangle=K\langle x_1,\ldots,x_d\rangle$ freely generated by $V$ over $K$. The canonical action of the general linear group $GL(V)$ on $V$ is extended diagonally on $K[V]$ and $K\langle V\rangle$ by the rule $$g(x_{j_1}\cdots x_{j_n})=g(x_{j_1})\cdots g(x_{j_n}),$$ where $g\in GL(V)$ and the monomials $x_{j_1}\cdots x_{j_n}$ belong to $K[V]$ or to $K\langle V\rangle$. So $K\langle V\rangle $ is the tensor algebra of $V$, whereas $K[V]$ is the symmetric tensor algebra of $V$. Note that in commutative invariant theory $K[V]$ is usually identified with the algebra of polynomial functions on the dual space of $V$. One of the ways to develop noncommutative invariant theory is to study invariants of subgroups of $GL(V)$ acting on factor algebras $K\langle V\rangle/I$, where the ideal $I$ of $K\langle V\rangle$ is stable under the action of $GL(V)$. The most attractive ideals for this purpose are the T-ideals, i.e., the ideals invariant under all endomorphisms of $K\langle V\rangle$. Every T-ideal coincides with the ideal $\text{Id}(R,V)$ of the polynomial identities in $d$ variables of a unitary algebra $R$. Then $K\langle V\rangle/\text{Id}(R,V)$ is the relatively free algebra $F({\mathfrak R},V)$ of rank $d$ in the variety ${\mathfrak R}=\text{var}(R)$ of unitary algebras generated by $R$. Note that $\text{Id}(R,V)$ is necessarily contained in the commutator ideal of $K\langle V\rangle$, hence we have the natural surjections $$\label{eq:surjections}
K\langle V\rangle \twoheadrightarrow F({\mathfrak R},V)\twoheadrightarrow K[V] .$$ In the sequel we assume that $R$ is a PI-algebra, i.e., $\text{Id}(R,V)\not=0$. For a background on PI-algebras and varieties of algebras, see e.g., [@DF] or [@GZ], and on noncommutative invariant theory the surveys [@F] and [@D3]. Recall that a polynomial $f(V)=f(X_d)\in K\langle V\rangle$ is a polynomial identity for the algebra $R$ if $f(r_1,\ldots,r_d)=0$ for all $r_1,\ldots,r_d\in R$. The class $\mathfrak R$ of all algebras satisfying a given system of polynomial identities is called a [*variety*]{}. The [*variety $\mathfrak R$ is generated by*]{} $R$ if $\mathfrak R$ has the same polynomial identities as $R$. Then we write $\text{Id}({\mathfrak R},V)=\text{Id}(R,V)$. The action of the group $GL(V)$ on $K\langle V\rangle$ induces an action on the relatively free algebra $F({\mathfrak R},V)$, and the surjections are $GL(V)$-equivariant.
Now let $G$ be a finite group. We say that $V$ is a [*$G$-module*]{} if we are given a representation (i.e., a group homomorphism) $\rho:G\to GL(V)$. We shall suppress $\rho$ from the notation, and write $gv:=(\rho(g))(v)$ for $g\in G$, $v\in V$, and similarly $gf:=(\rho(g))(f)$ for $f\in F(\mathfrak{R},V)$. Moreover, we shall study the [*algebra of invariants*]{} $$F({\mathfrak R},V)^G=\{f \in F({\mathfrak R},V)\mid gf=f \text{ for all } g\in G\}.$$ Since the characteristic of $K$ is assumed to be zero, the group $G$ acts completely reducibly on $K\langle V\rangle$, hence the $G$-equivariant $K$-algebra surjections in restrict to $K$-algebra surjections $$\label{eq:restricted_surjections}
K\langle V\rangle^G \twoheadrightarrow F({\mathfrak R},V)^G\twoheadrightarrow K[V]^G .$$ Our starting point is the following classical fact:
\[thm:noether\] Let $G$ be a finite group and $V$ a $G$-module. Then the following holds:
- The algebra $K[V]^G$ is finitely generated.
- The algebra $K[V]^G$ is generated by its elements of degree at most $|G|$.
Of course, (ii) implies (i). We mention that (i) holds also in the modular case (i.e., when the characteristic of the base field divides the group order), whereas (ii) does not. In view of (ii) it makes sense to introduce the numbers $$\beta(G,V)=\min\{m\mid K[V]^G \text{ is generated by invariants of degree }\leq m\}$$ and $$\beta(G)={\max}_V\{\beta(G,V)\mid V\mbox{ is a }G\mbox{-module}\}.$$ The latter is called the [*Noether number of*]{} $G$, and Theorem \[thm:noether\] (ii) says that $\beta(G)\leq\vert G\vert$. The exact value of $\beta(G)$ is known in few cases only. Barbara Schmid [@Sch] showed that $\beta(G)=\beta(G,V_{\text{reg}})$, where $V_{\text{reg}}$ is the regular $\vert G\vert$-dimensional $G$-module. It is known that $\beta(G)=\vert G\vert$ for $G$ cyclic. Domokos and Hegedűs [@DH] proved that if $G$ is not cyclic then $\beta(G)\leq(3/4)\vert G\vert$ and this bound is exact because is reached for the Klein four-group and for the quaternion group of order 8. Cziszter and Domokos [@CD2; @CD3] showed that the only noncyclic groups $G$ with $\beta(G)\geq(1/2)\vert G\vert$ are the groups with a cyclic subgroup of index 2 and four more sporadic exceptions – ${\mathbb Z}_3\times{\mathbb Z}_3$, ${\mathbb Z}_2\times{\mathbb Z}_2\times{\mathbb Z}_2$, the alternating group $A_4$, and the binary tetrahedral group $\tilde{A}_4$. In particular, they proved that $\beta(G)-(1/2)\vert G\vert=1$ or 2 for groups $G$ with cyclic subgroup of index 2. See also [@C] and [@CDG] for further information on $\beta(G)$.
Note that in the special case when $\mathfrak{R}$ is the variety of commutative algebras, we have $F(\mathfrak{R},V)=K[V]$ and hence $F(\mathfrak{R},V)^G=K[V]^G$. Taking the point of view of universal algebra, we may fix a variety $\mathfrak{R}$ (larger than the variety of commutative algebras), and look for possible analogues of Theorem \[thm:noether\] for the variety $\mathfrak{R}$. Kharchenko [@Kh] characterized the varieties $\mathfrak{R}$ for which $F(\mathfrak{R},V)^G$ is finitely generated for all finite groups $G$ and $G$-modules $V$. More precisely, he showed that if $F(\mathfrak{R},V_2)^G$ is finitely generated for all finite subgroups $G$ of $GL(V_2)$, then the variety $\mathfrak{R}$ is [*weakly noetherian*]{} (i.e., every finitely generated algebra from $\mathfrak{R}$ satisfies the ascending chain condition for two-sided ideals), and conversely, if $\mathfrak{R}$ is weakly noetherian, then $F(\mathfrak{R},V)^G$ is finitely generated for all finite $G$ and $G$-module $V$. By analogy with the definition of $\beta(G,V)$ and $\beta(G)$, given a weakly noetherian variety $\mathfrak{R}$ we introduce the numbers $$\beta(G,{\mathfrak R},V)=\min\{m\mid F({\mathfrak R},V)^G \text{ is generated by invariants of degree }\leq m\},$$ $$\beta(G,{\mathfrak R})={\sup}_V\{\beta(G,{\mathfrak R},V)\mid V\mbox{ is a }G\mbox{-module}\}.$$ The following natural question arises:
\[question\] Let $\mathfrak{R}$ be a weakly noetherian variety of unitary associative $K$-algebras.
1. Is $\beta(G,\mathfrak{R})$ finite for all finite groups $G$?
2. If the answer to (1) is yes, find an upper bound for $\beta(G,\mathfrak{R})$ in terms of $|G|$ and some numerical invariants of $\mathfrak{R}$.
The main result of the present paper is a positive answer to the above questions: in Theorem \[main theorem 2\] we give an explicit bound for $\beta(G,\mathfrak{R})$ in terms of $|G|$ and some quantities associated to $\mathfrak{R}$.
The paper is organized as follows. In Section \[sec:aux\] we present necessary facts from the theory of polynomial identities and invariant theory. First we collect several characterizations of weakly noetherian varieties in Theorem \[finite generation for all finite G\]. Next we recall the theorem of Latyshev [@La] that if a finitely generated PI-algebra $R$ satisfies a nonmatrix polynomial identity, then the commutator ideal $C(R)=R[R,R]R$ of $R$ is nilpotent. We shall also need the Nagata-Higman theorem [@Na; @H] that (nonunitary) nil algebras of bounded nil index are nilpotent. We continue with some lemmas about graded modules and commutative invariant theory and deduce consequences for the noncommutative case. Section \[sec:main\] contains our main results, throughout this section we fix a weakly noetherian variety $\mathfrak{R}$. In Theorem \[main theorem 1\] we provide an upper bound for $\beta(G,\mathfrak{R},V)$ in terms of $\beta(G)$, the degree of an identity of the form (see Theorem \[finite generation for all finite G\] (viii)) satisfied by $\mathfrak{R}$, and the index of nilpotency of the commutator ideal of $F({\mathfrak R},V)$. In particular, this gives a new and effective proof of the result of Kharchenko [@Kh] that the weak noetherianity of $F({\mathfrak R},V)$ implies the finite generation of the algebra of $G$-invariants $F({\mathfrak R},V)^G$, i.e., for the implication $\{\text{(iii) and (viii)}\}\Rightarrow\text{(i)}$ in Theorem \[finite generation for all finite G\]. However, this result does not yet answer Question \[question\] (i), since no noncommutative analogues of the result $\beta(G)=\beta(G,V_{\text{reg}})$ is available, and if $\mathfrak R$ cannot be generated by a finitely generated algebra $R$, then the class of nilpotency of the commutator ideal of $F({\mathfrak R},V)$ depends on the dimension of the vector space $V$ (and consequently the bound in Theorem \[main theorem 1\] tends to infinity as the dimension of $V$ grows). Using a different strategy we prove an upper bound on $\beta(\mathfrak{R},G)$ in Theorem \[main theorem 2\], which depends only on $\vert G\vert$, $\beta(G)$, the degree of an identity of the form satisfied by $\mathfrak{R}$ and on the class of nilpotency of nil algebras of index $\ell$, where $\ell$ is the class of nilpotency of the commutator ideal of one relatively free algebra, namely $F({\mathfrak R},V_{\vert G\vert})$. Theorem \[main theorem 2\] is independent from Theorem \[main theorem 1\]. Although this settles Question \[question\], for low dimensional $G$-modules $V$ the bound for $\beta(G,\mathfrak{R},V)$ provided in Theorem \[main theorem 1\] has smaller value than the general bound on $\beta(G,\mathfrak{R})$ from Theorem \[main theorem 2\]. Finally, in Theorem \[main theorem 3\] we improve the bound on $\beta(G,\mathfrak{R})$ for an abelian group $G$, and give one which depends only on the degree of the polynomial identity (\[identity in three variables\]) satisfied by $\mathfrak R$ and the order of $G$, but does not depend on the class of nilpotency of the commutator ideal of any of the relatively free algebras in $\mathfrak R$.
Auxiliaries {#sec:aux}
===========
Although $F({\mathfrak R},V)$ shares many properties of polynomial algebras, it has turned out that the finite generation of $F({\mathfrak R},V)^G$ for all finite $G$ forces very strong restrictions on $\mathfrak R$. Below we summarize the known results, see the survey articles [@D3; @KS]. Recall that for an associative algebra $R$ $$[u,v]=u(\text{ad}v)=uv-vu,\quad u,v\in R,$$ is the commutator of $u$ and $v$. Our commutators are left normed, i.e., $$[u_1,\ldots,u_{n-1},u_n]=[[u_1,\ldots,u_{n-1}],u_n],\quad u_1,\ldots,u_{n-1},u_n\in R,\quad n\geq 3.$$ First we define a sequence of PI-algebras $R_k$, $k = 1,2,\ldots$. Let $D_k = K[t]/(t^k)$ and let $$R_k = \left(\begin{matrix}
D_k&tD_k\\
tD_k&D_k\\
\end{matrix}\right)
\subset M_2(D_k),$$ where $M_2(D_k)$ is the $2 \times 2$ matrix algebra with entries from $D_k$. These algebras appear in [@D1] and “almost” describe the T-ideals containing strictly the T-ideal $\text{Id}(M_2(K),V)$. (Another description of those T-ideals was given by Kemer [@K2].)
\[finite generation for all finite G\] Let $\mathfrak R$ be a variety of algebras. The following conditions on $\mathfrak R$ are equivalent. If some of them is satisfied for some vector space $V_{d_0}$ of dimension $d_0 \geq 2$, then all of them hold for all $d$-dimensional vector spaces $V$, $d\geq 2$:
[(i)]{} The algebra $F({\mathfrak R},V)^G$ is finitely generated for every finite subgroup $G$ of $GL(V)$.
[(ii)]{} The algebra $F({\mathfrak R},V)^{\langle g\rangle}$ is finitely generated, where $g \in GL(V)$ is a matrix of finite multiplicative order with at least two eigenvalues (or characteristic roots) of different order.
[(iii)]{} The algebra $F({\mathfrak R},V)$ is [**weakly noetherian**]{}, i.e., satisfies the ascending chain condition for two-sided ideals.
[(iv)]{} Let $S$ be an algebra satisfying all the polynomial identities of $\mathfrak R$ (i.e., $S \in \mathfrak R$) and generated by $d$ elements $s_1,\ldots,s_d$. Then $S$ is [**finitely presented**]{} as a homomorphic image of $F({\mathfrak R},V)$, i.e., the kernel of the canonical homomorphism $F({\mathfrak R},V) \longrightarrow S$ defined by $x_i \longrightarrow s_i$, $i = 1,\ldots,d$, is a finitely generated ideal of $F({\mathfrak R},V)$.
[(v)]{} If $S$ is a finitely generated algebra from $\mathfrak R$, then $S$ is [**residually finite**]{}, i.e., for every nonzero element $s \in S$ there exist a finite dimensional algebra $D$ and a homomorphism $\varphi:S \longrightarrow D$ such that $\varphi(s) \not=0$.
[(vi)]{} If $S$ is a finitely generated algebra from $\mathfrak R$, then $S$ is [**representable by matrices**]{}, i.e., there exist an extension $L$ of the base field $K$ and an integer $k$ such that $S$ is isomorphic to a subalgebra of the $K$-algebra $M_k(L)$ of all $k\times k$ matrices with entries from $L$.
[(vii)]{} If the base field $K$ is countable, then the set of pairwise non-isomorphic homomorphic images of $F({\mathfrak R},V)$ is countable.
[(viii)]{} For some $n\geq 2$ the variety $\mathfrak R$ satisfies a polynomial identity of the form $$\label{identity in three variables}
\begin{array}{c}
f(x_1,x_2,x_3)\displaystyle{=x_2x_1^nx_3 +\gamma x_3x_1^nx_2
+\sum_{i+j>0}\alpha_{ij}x_1^ix_2x_1^{n-i-j}x_3x_1^j}\\
\displaystyle{+\sum_{i+j>0}\beta_{ij}x_1^ix_3x_1^{n-i-j}x_2x_1^j= 0},\quad\alpha_{ij}, \beta_{ij},\gamma \in K.\\
\end{array}$$
[(ix)]{} For some $n\geq 2$ the variety $\mathfrak R$ satisfies a polynomial identity of the form $$x_2x_1^nx_2 +
\sum_{i+j>0}\alpha_{ij}x_1^ix_2x_1^{n-i-j}x_2x_1^j = 0,\quad
\alpha_{ij} \in K.$$
[(x)]{} The variety $\mathfrak R$ satisfies the polynomial identity $$[x_1,x_2,\ldots,x_2]x_3^n[x_4,x_5,\ldots,x_5] = 0$$ for sufficiently long commutators and $n$ large enough.
[(xi)]{} The variety $\mathfrak R$ satisfies the polynomial identity $$[x_1,\ldots,x_n]x_{n+1}\ldots x_{2n}[x_{2n+1},\ldots,x_{3n}] = 0$$ for some positive integer $n$.
[(xii)]{} The variety $\mathfrak R$ satisfies a polynomial identity which does not follow from the polynomial identities $$[x_1,x_2][x_3,x_4][x_5,x_6] = 0,\quad
[[x_1,x_2][x_3,x_4],x_5] = 0,\quad
s_4(x_1,x_2,x_3,x_4) = 0.$$
[(xiii)]{} The T-ideal $\text{\rm Id}({\mathfrak R},V)$ is not contained in the T-ideal $\text{\rm Id}(R_3,V)$ of the algebra $R_3$ defined above.
The equivalence of (i) and (iii) was established by Kharchenko [@Kh], of (iii), (viii), and (ix) by L’vov [@Lv], of (iii), (v), (vi), (x) and (xi) (for finitely generated algebras $R\in\mathfrak R$) by Anan’in [@A], of (ix) and (xii) by Tonov [@T], of (ii), (viii) and (xiii) by Drensky [@D2]. The equivalence of (iii), (iv) and (vii) is obvious. The general case of the implication (v) $\Rightarrow$ (ix) is due to Kemer [@K1] who showed that associative algebras satisfying the Engel identity are Lie nilpotent. (The theorem that Lie algebras with the Engel identity are nilpotent was proved by Zelmanov [@Z].) We want to mention that the study of representable algebras begins with the paper by Malcev [@M]. The condition (ii) is a generalization of the following result of Fisher and Montgomery [@FM]. If $\text{Id}({\mathfrak R},V) \subseteq \text{Id}(M_2(K),V)$, $g \in GL(V)$, $g^n = 1$, and $g$ has at least two characteristic roots of different multiplicative order, then the algebra of invariants $F({\mathfrak R},V)^{\langle g\rangle}$ is not finitely generated. The condition (ii) gives a simple criterion to check the equivalent conditions of Theorem \[finite generation for all finite G\]. It is sufficient to choose $d = 2$ and $$g = \left(\begin{matrix}
-1&0\\
0&1\\
\end{matrix}\right).$$ If $F({\mathfrak R},V_2)^{\langle g\rangle}$ is finitely generated for the $2$-dimensional vector space $V_2$, then all the assertions (i) – (xiii) hold for $F({\mathfrak R},V)$ and $\text{Id}({\mathfrak R},V)$ for any $d$-dimensional vector space $V$, $d \geq 2$.
Several parts of the proof of Theorem \[finite generation for all finite G\] depend on two important results in the theory of PI-algebras, which play crucial role also in the proofs of our results.
\[theorem of Latyshev\] Let $R$ be a finitely generated algebra which satisfies a nonmatrix polynomial identity, i.e., a polynomial identity which does not hold for the $2\times 2$ matrix algebra $M_2(K)$. Then $R$ satisfies the identity $$[x_1,x_2]\cdots[x_{2k+1},x_{2k+2}]=0$$ for some $k$. Equivalently, the commutator ideal $C(R)=R[R,R]R$ of $R$ is nilpotent of class $k+1$.
The next result we need is the Nagata-Higman theorem [@Na; @H] which is one of the milestones of PI-theory. (More precisely, it should be called the Dubnov-Ivanov-Nagata-Higman theorem, established first by Dubnov and Ivanov [@DuI] in 1943, and then independently by Nagata [@Na] in 1953. The proof of Higman [@H] from 1956 covers also the case of nil algebras over fields of positive characteristic $p>n$.) Since we shall consider nil and nilpotent algebras which are without unit, in the next lines we work with nonunitary algebras and, in particular, with the free nonunitary algebra $K\langle V_{\infty}\rangle_+$ on the vector space $V_{\infty}$ of countable dimension.
\[Nagata-Higman\] Let $R$ be an associative algebra without unit which is nil of bounded index, i.e., $R$ satisfies a polynomial identity $x^n=0$. Then $R$ is nilpotent, i.e., it satisfies the identity $x_1\cdots x_N=0$ for some $N$.
Let $\nu(n)$ be the minimal positive integer such that the polynomial $x_1\cdots x_{\nu(n)}$ belongs to the T-ideal generated by $x^n$. We call $\nu(n)$ the [*Nagata-Higman number*]{} for nil algebras of index $n$. The upper bound $\nu(n)\leq 2^n-1$ is given in the proof of Higman [@H]. The best known bounds for $\nu(n)$ $$\frac{n(n+1)}{2}\leq \nu(n) \leq n^2$$ are due respectively to Kuz’min [@Ku] (see also [@DF Theorem 6.2.7, page 85]) and Razmyslov [@R]. Kuz’min [@Ku] conjectured that $$\nu(n)=\frac{n(n+1)}{2},$$ and this is confirmed for $n \leq 4$, with partial results for $n=5$, see the comments in [@DF page 79].
The Nagata-Higman theorem has a precision which is contained in the proof of Higman [@H], see also [@DF Theorem 6.1.2 (ii), pages 75-77].
\[Nagata-Higman as vector space\] The T-ideal generated by $x^n$ in the free nonunitary algebra $K\langle V_{\infty}\rangle_+$ coincides with the vector space spanned by all $n$-th powers. In particular, for $m\geq \nu(n)$ the monomial $x_1\cdots x_m$ has the form $$x_1\cdots x_m=\sum\alpha_uu^n$$ for some $\alpha_u\in K$ and $u\in K\langle V_m\rangle_+$.
We continue with some facts about graded modules. Suppose that $\displaystyle R=\bigoplus_{d=0}^\infty R_d$ is a graded $K$-algebra with $R_0=K$, on which the finite group $G$ acts via graded $K$-algebra automorphisms. Let $\displaystyle M=\bigoplus_{d=0}^\infty M_d$ be a finitely generated graded $R$-module (left module), where each homogeneous component $M_d$ is a $G$-module. Suppose that the $R$-module structure of $M$ is compatible with the $G$-action on $R$ and $M$, i.e., for $g\in G$, $r\in R$, and $m\in M$ we have $g(rm)=(gr)(gm)$. Write $\beta(R)$ for the minimal $n$ such that $R$ is generated as a $K$-algebra by homogeneous elements of degree at most $n$, and denote by $\gamma(M,R)$ the minimal $n$ such that the $R$-module $M$ is generated by homogeneous elements of degree at most $n$. A set of homogeneous elements generates $R$ as a $K$-algebra if and only if they generate $R_+$ (the sum of the positive degree homogeneous components of $R$) as an $R$-bimodule (i.e., as an ideal). If $S$ is a finitely generated $K$-subalgebra of $R$, and $R$ is a finitely generated $S$-module, then $M$ is a finitely generated $S$-module, and we have the obvious inequality $$\label{eq:gamma(M,S)}
\gamma(M,S)\le \gamma(M,R)+\gamma(R,S).$$ Moreover, we have the inequality $$\label{eq:reynolds}
\gamma(M^G,R^G)\le\gamma(M,R^G).$$ Indeed, the Reynolds operator $\rho:M\to M^G$, $\displaystyle m\mapsto\frac{1}{|G|}\sum_{g\in G}gm$ is a surjective $R^G$-module homomorphism, and therefore $\rho$ maps a homogeneous $R^G$-module generating system of $M$ to an $R^G$-module generating system of $M^G$. Since $\rho$ preserves the degrees, follows. Next we reformulate a result from [@CD1]:
\[lemma:CD1\] We have the inequality $\gamma(K[V],K[V]^G)\le \beta(G)-1$.
Lemma 3.1 of [@CD1] gives that there exists an irreducible $G$-module $U$ such that $$\beta(G,V\oplus U)\geq\gamma(K[V],K[V]^G)+1.$$ Since $\beta(G,V\oplus U)$ is trivially bounded by $\beta(G)$, we obtain the desired inequality.
\[general case for bound for modules\] Let $M$ be a finitely generated graded $R$-module as above, where $R=K[V]$ for some $G$-module $V$. Then $M$ and $M^G$ are finitely generated $R^G$-modules, and we have the inequalities $$\gamma(M^G,R^G)\le \gamma(M,R^G)\le \gamma(M,R)+\beta(G)-1.$$
By and we have $\gamma(M^G,R^G)\le \gamma(M,R^G)\le \gamma(M,R)+\gamma(R,R^G)$. By Lemma \[lemma:CD1\] we have $\gamma(R,R^G)\le \beta(G)-1$.
\[generators of invariants in X and Y\] Let $V$ and $W$ be isomorphic as $G$-modules. Identifying $K[V]\otimes K[W]$ and $K[V\oplus W]$, we have $$\gamma(K[V\oplus W]^G,K[V]^G\otimes K[W]^G)\leq 2(\beta(G)-1).$$
By Lemma \[lemma:CD1\] the $K[V]^G$-module $K[V]$ is generated by homogeneous polynomials $w_1(V),\ldots,w_s(V)$ of degree $\leq \beta(G)-1$. The products $\{w_a(V)w_b(W)\mid a,b=1,\dots,s\}$ generate $K[V\oplus W]$ as an $R=K[V]^G\otimes K[W]^G$-module, thus $\gamma(K[V\oplus W],R)\le 2(\beta(G)-1)$. Now apply for $M=K[V\oplus W]$ viewed as an $R$-module (where $G$ acts trivially on $R$, i.e., $R=R^G$).
\[lemma from commutative invariants\] Let $V$ be a $G$-module and let $\pi:K[V]\to R$ be a surjective $K$-algebra homomorphism of $K[V]$ onto $R$ such that $\ker(\pi)\subset K[V]_+$ and $G(\ker(\pi))=\ker(\pi)$. Then $R_+^{\beta(G)}$ is contained in the ideal $RR_+^G$ of $R$ generated by the subalgebra $R_+^G$ consisting of the elements fixed by the induced action of $G$ on $R_+=\pi(K[V]_+)$.
First we shall establish the lemma for $R=K[V]$. By the graded Nakayama lemma (see for example Lemma 3.5.1 in [@DK]) $\gamma(K[V],K[V]^G)$ coincides with the top degree of the factor space $K[V]/K[V]K[V]^G_+$ (inheriting a grading from $K[V]$). Therefore $K[V]_+^{\beta(G)}\subseteq K[V]K[V]^G_+$ holds by Lemma \[lemma:CD1\]. Applying $\pi$ to this inclusion we get $R_+^{\beta(G)}=\pi(K[V]_+)^{\beta(G)}=\pi(K[V]_+^{\beta(G)})\subseteq \pi(K[V]K[V]^G_+)=RR^G_+$.
\[ideal of squares of invariants\] Let $V$ be a $G$-module and let $\pi:K\langle V\rangle\to R$ be a surjective $K$-algebra homomorphism of $K\langle V\rangle$ onto $R$ such that $\ker(\pi)\subset K\langle V\rangle_+$ and $G(\ker(\pi))=\ker(\pi)$ (so the action of $G$ on $K\langle V\rangle$ induces a $G$-action on $R$ via $K$-algebra automorphisms). If the commutator ideal of $R$ is nilpotent of class $\ell+1$, then $R_+^{2\beta(G)(\ell+1)}$ is contained in the ideal $R(R_+^G)^2R$ of $R$ generated by the square of the subalgebra $R_+^G$ of $G$-fixed elements of $R_+=\pi(K\langle V\rangle_+)$. In particular, if $u\in R_+$, then $$u^{2\beta(G)(\ell+1)}\in R(R_+^G)^2R.$$
Let $\bar{R}=R/C$, where $C$ is the commutator ideal of $R$. Since $C$ is stable under the action of $G$, there is an induced $G$-action on $R/C$ via $K$-algebra automorphisms. Complete reducibility of the $G$-action on $R$ implies that $R^G/C^G=(R/C)^G$. Then, by Lemma \[lemma from commutative invariants\], $(\bar{R}_+)^{\beta(G)}\subseteq \bar{R}\bar{R}_+^G$ and hence $(\bar{R}_+)^{2\beta(G)}\subseteq \bar{R}(\bar{R}_+^G)^2$. Therefore $R_+^{2\beta(G)}\subset R(R_+^G)^2+C$. Since $C^{\ell+1}=(0)$, we have that $(R(R_+^G)^2+C)^{\ell+1}\subseteq R(R_+^G)^2R$, implying $R_+^{2\beta(G)(\ell+1)}\subseteq R(R_+^G)^2R$.
\[action of abelian groups\] Let $G$ be a finite abelian group, and denote by $G^{\ast}$ the group of the characters (i.e., homomorphisms $G\to K^\times$) of $G$. Suppose that $G$ acts on $V$ as a group of diagonal matrices, i.e., the action on the basis $X_d$ of $V$ is given by $$g(x_i)=\chi_i(g)x_i,\quad \chi_i\in G^{\ast}, \quad i=1,\ldots,d.$$ Then for any $\vert G\vert$ words $u_1,\ldots, u_{\vert G\vert}\in K\langle V\rangle$, $$u_i=x_{ij_1}\cdots x_{ij_{s_i}},\quad x_{ij}\in X_d, \quad i=1,\ldots,\vert G\vert,$$ the product $u_1\cdots u_{\vert G\vert}$ contains a $G$-invariant subword of the form $u_{i+1}\cdots u_j$, $1\leq i< j\leq\vert G\vert$.
The group $G$ acts on $u_i$ and on $u_1\cdots u_i$ by the rule $$g(u_i)=g(x_{ij_1})\cdots g(x_{ij_{s_i}})=\chi_{ij_1}(g)\cdots \chi_{ij_{s_i}}(g)x_{ij_1}\cdots x_{ij_{s_i}}=\chi^{(i)}(g)u_i,$$ $$g(u_1\cdots u_i)=\chi^{(1)}(g)\cdots \chi^{(i)}(g)u_1\cdots u_i.$$ Consider the $\vert G\vert +1$ products of characters $$\chi^{(0)}=\chi_{\text{\rm id}},\quad
\chi^{(i)}=\chi_1\cdots\chi_i,\quad i=1,\ldots,\vert G\vert.$$ Since $\vert G^{\ast}\vert\le \vert G\vert$ (with equality if $K$ is algebraically closed), by the Pigeonhole Principle, there exist two characters $\chi^{(i)}=\chi_1\cdots\chi_i$ and $\chi^{(j)}=\chi_1\cdots\chi_j$, $0\leq i<j\leq \vert G\vert$ which are equal. Hence $\chi_{i+1}\cdots\chi_j=\chi_{\text{\rm id}}$. This means that the product $u_{i+1}\cdots u_j$ is $G$-invariant.
The main results {#sec:main}
================
Till the end of the paper we fix a variety of unitary algebras $\mathfrak R$ satisfying the polynomial identity (\[identity in three variables\]) from Theorem \[finite generation for all finite G\] (viii). Replacing $x_3$ by $x_1x_3$ in $f(x_1,x_2,x_3)=0$ from (\[identity in three variables\]) we obtain a multihomogeneous consequence of total degree $n+3$ of the form $$\label{identity of special kind}
h(x_1,x_2,x_3)=x_2x_1^{n+1}x_3+x_1h_1(x_1,x_2,x_3)+h_2(x_1,x_2,x_3)x_1=0$$ where $h_1,h_2$ are multihomogeneous of total degree $n+2$. In (\[identity of special kind\]) we replace $x_1,x_2,x_3$ by $u\in K\langle V_{\infty}\rangle_+$, $y$, and $z$, respectively, and obtain $$\label{eq:master}
h(u,y,z)=yu^{n+1}z+uh_1(u,y,z)+h_2(u,y,z)u=0,$$ i.e., $yu^{n+1}z$ can be expressed as a linear combination of polynomials starting or finishing with $u$. Applying Proposition \[Nagata-Higman as vector space\] we obtain a consequence of (\[identity in three variables\]) of the form $$\label{Nagata-Higman type identity for R}
\begin{array}{c}
h'(x_1,\ldots,x_{\nu},y,z)=yx_1\cdots x_{\nu}z+\sum_{i=1}^{\nu}(x_iv_i'(x_1,\ldots,\widehat{x_i},\ldots,x_{\nu},y,z)\\
\\
+v_i''(x_1,\ldots,\widehat{x_i},\ldots,x_{\nu},y,z)x_i)=0,\quad \nu=\nu(n+1).\\
\end{array}$$ We fix the notation $$F=F({\mathfrak R},V)\text{ and } C=C({\mathfrak R},V)=F[F,F]F$$ for the relatively free algebra on $V$ and its commutator ideal, respectively. It is well known that $C^p$ modulo $C^{p+1}$ is spanned on the products $$\label{typical element in the power of the commutator ideal}
w=X_d^{a^{(0)}}[x_{i_1},x_{j_1}]X_d^{a^{(1)}}[x_{i_2},x_{j_2}]\cdots X_d^{a^{(p-1)}}[x_{i_p},x_{j_p}]X_d^{a^{(p)}},$$ where $X_d^a=x_1^{a_1}\cdots x_d^{a_d}$. Note that $C^p/C^{p+1}$ is a naturally a $K[V]$-bimodule. Equivalently, we consider $C^p/C^{p+1}$ as a module over $K[V\oplus W]\cong K[V]\otimes K[W]$, where the $G$-module $W$ is isomorphic to $V$ and has a basis $Y_d=\{y_1,\ldots,y_d\}$. The action of $X_d^bY_d^c=X_d^b\otimes Y_d^c\in K[V]\otimes K[W]$ is defined by $$X_d^bY_d^c(w)=X_d^{a^{(0)}+b}[x_{i_1},x_{j_1}]X_d^{a^{(1)}}[x_{i_2},x_{j_2}]\cdots X_d^{a^{(p-1)}}[x_{i_p},x_{j_p}]X_d^{a^{(p)}+c}.$$
\[bounds of lengths between commutators\] Let $\nu=\nu(n+1)$ be the Nagata-Higman number for the nil algebras of index $n+1$. Then for $p\geq 1$ the vector space $C^p/C^{p+1}$ is spanned by the products (\[typical element in the power of the commutator ideal\]) such that $0\leq a_i^{(q)}\leq n$ and $a_1^{(q)}+\cdots+a_d^{(q)}\leq \nu-1$ for each $a^{(q)}=(a_1^{(q)},\ldots,a_d^{(q)})$, $q=1,\ldots,p-1$.
Take $w$ as in . By induction on $\displaystyle \sum_{j=1}^{p-1}\sum_{i=1}^da_i^{(j)}$ we shall show that $w+C^{p+1}$ belongs to the subspace of $C^p/C^{p+1}$ spanned by the special elements in the statement. If the above sum is zero, then all $a_i^{(j)}=0$ for $j=1,\dots,p-1$ and $i=1,\dots,d$, so the induction can start. If $a_i^{(j)}\geq n+1$ for some $i\in\{1,\ldots,d\}$ and some $j\in \{1,\ldots,p-1\}$ then we have $w=X_d^{a^{(0)}}yu^{n+1}zX_d^{a^{(p)}}$ where $$u:=x,\quad
y:=[x_{i_1},x_{j_1}]X_d^{a^{(1)}}
\cdots x_{i-1}^{a_{i-1}^{(j)}}x_i^{a_i^{(j)}-n-1},
\quad z:=x_{i+1}^{a_{i+1}^{(j)}}\cdots X_d^{a^{(p-1)}}[x_{i_p},x_{j_p}].$$ Applying the identity we express $yu^{n+1}z$ (and hence $w$) as a linear combination of elements of the form with $\displaystyle \sum_{j=1}^{p-1}\sum_{i=1}^da_i^{(j)}$ one less than for $w$. If $a_1^{(q)}+\cdots+a_d^{(q)}\leq \nu-1$ for some $q\in\{1,\ldots,p-1\}$, then we can use the polynomial identity (\[Nagata-Higman type identity for R\]) in a similar vein.
Now we are ready to prove the main results of our paper.
\[main theorem 1\] Let $V$ be a $d$-dimensional $G$-module ($d\ge 2$) and $\mathfrak R$ a weakly noetherian variety of associative algebras properly containing the variety of commutative algebras (so $C\neq 0$). Then $$\beta(G,{\mathfrak R},V)\leq \oneconst(\mathfrak{R},d)+3(\beta(G)-1)$$ where $$\oneconst(\mathfrak{R},d)=2(\ell(\mathfrak{R},d)-1)+(\ell(\mathfrak{R},d)-2)\cdot \min\{\nu(n(\mathfrak{R}))-1,(n(\mathfrak{R})-1)d\};$$ here $\ell(\mathfrak{R},d)$ is the nilpotence class of the commutator ideal $C$ of $F$, $n(\mathfrak{R})$ is the minimal positive integer $n+1$ such that $\mathfrak{R}$ satisfies a polynomial identity of the form of degree $n+3$, whereas $\beta(G)$ is the Noether number for $G$ and $\nu(n(\mathfrak{R}))$ is the Nagata-Higman number for nil algebras of index $n(\mathfrak{R})$.
The commutator ideal $C$ of $F$ is stable under the action of $GL(V)$, and hence under the action of its finite subgroup $G$. Therefore we have an induced action of $G$ on $C^p/C^{p+1}$, and the $G$-invariants in $C^p/C^{p+1}$ can be lifted to $G$-invariants in $C^p\subset F$. Note that $F/C\cong K[V]$ and hence $(F/C)^G\cong K[V]^G$. Moreover, $(C^p/C^{p+1})^G$ is a $K[V]^G\otimes K[W]^G$-submodule of $C^p/C^{p+1}$ (whose $K[V\oplus W]$-module structure was introduced in the paragraph preceding Lemma \[bounds of lengths between commutators\]). Every homogeneous system of generators $\bar u_{p1},\ldots,\bar u_{pr_p}$ of the $K[V]^G\otimes K[W]^G$-module $(C^p/C^{p+1})^G$ can be lifted to sets of homogeneous $G$-invariants $u_{p1},\ldots,u_{pr_p}\in C^p$ with $\deg(u_{pj})=\deg(\bar u_{pj})$, and it is straightforward that the elements $u_{pq}$, $p=0,1,\ldots,\ell(\mathfrak{R},d)-1$, $q=1,\ldots,r_p$, generate $F^G$ as a $K$-algebra (indeed, by induction on $k$ one shows that the images of the elements $u_{pj}$ generate the subalgebra of $G$-invariants in the factor algebra $F/C^k$). Therefore it is sufficient to show that $$\label{eq:Cp}\gamma((C^p/C^{p+1})^G,K[V]^G\otimes K[W]^G)
\leq \oneconst(\mathfrak{R},d)+3(\beta(G)-1)$$ for $p=0,1,\ldots,\ell(\frak{R},d)-1$. By Lemma \[bounds of lengths between commutators\] we have $$\gamma(C^p/C^{p+1},K[V\oplus W])
\leq 2p+(p-1)\min(\nu(n(\mathfrak{R}))-1,(n(\mathfrak{R})-1)d) \leq \oneconst(\mathfrak{R},d)$$ (the latter inequality is immediate from $p\le \ell(\mathfrak{R},d)-1$). It follows by Corollary \[general case for bound for modules\] that $$\gamma((C^p/C^{p+1})^G,K[V\oplus W]^G)\leq
\oneconst(\mathfrak{R},d)+(\beta(G)-1).$$ Applying with $M=(C^p/C^{p+1})^G$, $R=K[V\oplus W]^G$, $S=K[V]^G\otimes K[W]^G$, and using that $\gamma(R,S)\leq 2(\beta(G)-1)$ by Lemma \[generators of invariants in X and Y\], we conclude that $$\gamma((C^p/C^{p+1})^G,K[V]^G\otimes K[W]^G)\leq \gamma((C^p/C^{p+1})^G,K[V\oplus W]^G)+2(\beta(G)-1).$$ Combining the above two inequalities we obtain the desired inequality which completes the proof of the theorem.
\[main theorem 2\] Let $\mathfrak{R}$ be a weakly noetherian variety of associative algebras properly containing the variety of commutative algebras and $G$ a finite group. Then $$\beta(G,{\mathfrak R})\leq (\nu(n(\mathfrak{R}))-1) \cdot \nu\left(2\beta(G)\ell(\mathfrak{R},|G|)\right)-1$$ where $n(\mathfrak{R})$ and $\ell(\mathfrak{R},|G|)$ are the same as in Theorem \[main theorem 1\].
Take a $G$-module $V$ and consider $F=F(\mathfrak{R},V)$. Let $u\in F_+$ and let $W$ be the vector subspace of $F_+$ spanned by $\{g(u)\mid g\in G\}$. Clearly $W$ is a $G$-submodule of $F$. Hence the (unitary) subalgebra $R$ of $F$ generated by $W$ is also a $G$-submodule of $F$ and $R_+^G\subseteq F_+^G$. Since $R$ is generated by at most $\vert G\vert$ elements, it is a homomorphic image of the relatively free algebra $F({\mathfrak R},V_{\vert G\vert})$ of rank $\vert G\vert$ in $\mathfrak R$. Hence the commutator ideal $C(R)$ of $R$ satisfies $C(R)^{\ell(\mathfrak{R},\vert G\vert)}=0$. On the other hand, the identity map $W\to W$ extends to a $G$-equivariant $K$-algebra surjection $\pi: K\langle W\rangle\to R$. By Corollary \[ideal of squares of invariants\], $$u^{2\beta(G)\ell(\frak{R},\vert G\vert)}\in R(R_+^G)^2R\subseteq F(F_+^G)^2F.$$ Hence the factor algebra $F_+/F(F_+^G)^2F$ is nil of index $2\beta(G)\ell(\frak{R},\vert G\vert)$. Let $\xi=\nu(2\beta(G)\ell(\frak{R},\vert G\vert))$. By Proposition \[Nagata-Higman as vector space\], for every $u_1,\ldots,u_{\xi}\in F_+$, the product of their images $\bar{u_i}$ in $F_+/F(F_+^G)^2F$ satisfies $\bar{u}_1\cdots\bar{u}_{\xi}=\bar{0}$, i.e., $$u_1\cdots u_{\xi}\in F(F_+^G)^2F.$$ Hence $F_+^{\xi}$ is spanned by products $u'v'v''u''$, where $v',v''\in F_+^G$ and $u',u''\in F$. Consequently, setting $\nu=\nu(n(\mathfrak{R}))-1$, we have that $F_+^{\xi \nu}$ is spanned by products $$\begin{aligned}
\label{monomials in Theorem 2}
w&=&(u_1'v_1'v_1''u_1'')\cdots (u_{\nu}'v_{\nu}'v_{\nu}''u_{\nu}'')\\
&=&u_1'(v_1')(v_1''u_1''u_2'v_2')(v_2''u_2''u_3'v_3')\cdots (v_{\nu-1}''u_{\nu-1}''u_{\nu}'v_{\nu}')(v_{\nu}'')u_{\nu}''\end{aligned}$$ (note that by assumption $C\neq 0$, hence $n(\mathfrak{R})\ge 2$ and so $\nu=\nu(n(\mathfrak{R}))-1\ge 2$). Applying the identity for $$y:=u_1', \quad z:=u_{\nu}'', \quad x_1:=v_1',\quad x_{\nu+1}:=v_{\nu}''$$ and $$\quad x_{i+1}:=v_{i}''u_i''u_{i+1}'v_{i+1}'\quad \mbox{for}\quad i=1,\ldots,\nu-1,$$ we obtain that $w$ can be expressed as a linear combination of products of the form $st$ where $s$ or $t$ belongs to $\{v_1',v_1'',\dots,v_{\nu}',v_{\nu}''\}$ and both $s$ and $t$ belong to $F_+$. Therefore we have that $F_+^{\xi \nu}\subseteq F^G_+F_++F_+F^G_+$, implying that $\gamma(F_+,F^G\otimes (F^G)^{\mathrm{op}})\leq \xi \nu-1$ (recall that the $F^G$-bimodule $F_+$ can be thought of as a left $F^G\otimes (F^G)^{\mathrm{op}}$-module, where $(F^G)^{\mathrm{op}}$ stands for the opposite ring of $F^G$). It follows by that $\gamma(F^G_+,F^G\otimes (F^G)^{\mathrm{op}}) \leq \xi \nu-1$, implying in turn the desired inequality $\beta(F^G)\leq \xi \nu-1$.
\[main theorem 3\] Let $G$ be a finite abelian group and let $\mathfrak R$ be a weakly noetherian variety of associative algebras properly containing the variety of commutative algebras. Then $$\beta(G,{\mathfrak R})\leq (\nu(n(\mathfrak{R}))-1)\vert G\vert(\vert G\vert+1)-1$$ where $n(\mathfrak{R})$ is the same as in Theorem \[main theorem 1\].
Let $L$ be an extension of the base field $K$. Embedding the free algebra $K\langle V_{\infty}\rangle$ in $L\otimes_KK\langle V_{\infty}\rangle\cong L\langle L\otimes_KV_{\infty}\rangle$, we may consider the variety ${\mathfrak R}_L$ of $L$-algebras defined by the same polynomial identities as the variety of $K$-algebras $\mathfrak R$. Since the base field $K$ is of characteristic 0, it is well known that $L\otimes_KF({\mathfrak R},V)\cong F({\mathfrak R}_L,L\otimes_KV)$ is the relatively free algebra over the $L$-vector space $L\otimes_KV$ in the variety ${\mathfrak R}_L$. Similarly, embedding $GL(V)$ in $GL(L\otimes_KV)$, we obtain that $$F({\mathfrak R}_L,L\otimes_KV)^G=L\otimes_KF({\mathfrak R},V)^G.$$ Hence it is sufficient to prove the theorem for $K$ algebraically closed. Then the finite abelian group $G\subset GL(V)$ is isomorphic to a group of diagonal matrices and we may assume that $G$ acts on the basis of $V$ as $$g(x_i)=\chi_i(g)x_i,\quad \chi_i\in G^{\ast},\quad i=1,\ldots,d.$$ It follows that $F^G$ is spanned by monomials. Moreover, if $x_{i_1}\cdots x_{i_m}\in F^G$, then $x_{i_{\sigma(1)}}\cdots x_{i_{\sigma(m)}}\in F^G$ for any permutation $\sigma\in S_m$.
It is sufficient to show that any $G$-invariant monomial $w$ of degree at least $(\nu-1)\vert G\vert(\vert G+1\vert)$, $\nu=\nu(n(\mathfrak{R}))$, can be expressed as a linear combination of products of invariant monomials of lower degree (as mentioned in the proof of Theorem \[main theorem 2\], the assumption that $\mathfrak{R}$ properly contains the variety of commutative algebras implies $\nu\ge 2$). We claim that any monomial $z$ with $\deg(z)\ge \vert G\vert(\vert G\vert+1)$ belongs to $F(F_+^G)^2F$ (i.e., $z$ contains two consecutive non-trivial $G$-invariant subwords). Indeed, since by Lemma \[action of abelian groups\] any monomial of degree at least $\vert G\vert$ contains a nontrivial $G$-invariant submonomial, we have $$z=(u_1'v_1u_1'')(u_2'v_2u_2'')\cdots (u_{\vert G\vert+1}' v_{\vert G\vert+1}u_{\vert G\vert+1}'')$$ where $v_i\in F_+^G$ are non-trivial $G$-invariant monomials and $u_i',u_i''\in F$ are arbitrary monomials. Apply Lemma \[action of abelian groups\] for the words $$u_1=v_1u_1''u_2', \ u_2=v_2u_2''u_3', \ \dots\ u_{\vert G\vert}=v_{\vert G\vert}u_{\vert G\vert}''u_{\vert G\vert+1}'.$$ We conclude that there exist $1\le i\le j\le \vert G\vert$ such that the monomial $u_iu_{i+1}\cdots u_j\in F_+^G$, hence $z$ contains the subword $u_i\cdots u_jv_{j+1}\in (F_+^G)^2$, implying $z\in F(F_+^ G)^2F$, so the claim is proved.
Now take a $G$-invariant monomial $w\in F({\mathfrak R},V)^G$ of degree at least $(\nu-1)\vert G\vert(\vert G\vert +1)$. Write $w$ as a product $$w=w_1\cdots w_{\nu-1}$$ of monomials $w_i$ where $\deg(w_i)\ge \vert G\vert (\vert G\vert +1)$, hence $w_i\in F(F_+^G)^2F$ for $i=1,\dots,\nu-1$. So we have $$w=s_1t_1't_1''s_2t_2't_2''s_3\cdots t_{\nu-1}'t_{\nu-1}''s_{\nu}$$ where $t_i',t_i''\in F_+^G$ and $s_j\in F$. Apply the identity for $$y:=s_1,\ x_1:=t_1',\ x_2:=t_1''s_2t_2',
\ \dots \ x_{\nu-1}:=t_{\nu-2}''s_{\nu-1}'t_{\nu-1}', \ x_{\nu}:=t_{\nu-1}'',\ z:=s_{\nu}$$ and present $w$ as a linear combination of $G$-invariant monomials $\tilde{w}$ starting or ending by a non-trivial $G$-invariant submonomial $t_i'$ or $t_i''$. Note that If $\tilde{w}=tu$ or $ut$, where $t\in \{t_i',t_i''\vert i=1,\dots,\nu-1\}$, then $u$ is necessarily a non-trivial $G$-invariant monomial, so $\tilde{w}\in (F_+^G)^2$, implying in turn that $w\in (F_+^G)^2$.
[99]{}
A. Z. Anan’in, [*Locally finitely approximable and locally representable varieties of algebras*]{} (Russian), Algebra Logika [**16**]{} (1977), 3-23. Translation: Algebra Logic [**16**]{} (1977), 1-16.
K. Cziszter, [*The Noether number of the non-abelian group of order $3p$*]{}, Periodica Math. Hungarica [**68**]{} (2014), 150-159.
K. Cziszter, M. Domokos, [*On the generalized Davenport constant and the Noether number*]{}, Cent. Eur. J. Math. [**11**]{} (2013), No. 9, 1605-1615.
K. Cziszter, M. Domokos, [*Groups with large Noether bound*]{}, Ann. Inst. Fourier (Grenoble) [**64**]{} (2014), No. 3, 909-944.
K. Cziszter, M. Domokos, [*The Noether number for the groups with a cyclic subgroup of index two*]{}, J. Algebra [**399**]{} (2014), 546-560.
K. Cziszter, M. Domokos, A. Geroldinger, [*The interplay of invariant theory with multiplicative ideal theory and with arithmetic combinatorics*]{}, Multiplicative Ideal Theory and Factorization Theory, (Scott T. Chapman and M. Fontana and A. Geroldinger and B. Olberding, eds.), Springer-Verlag, 2016.
H. Derksen, G. Kemper, [*Computational Invariant Theory*]{}, Encyclopaedia of Mathematical Sciences [**130**]{}, Springer-Verlag, 2002.
M. Domokos, P. Hegedűs, [*Noether’s bound for polynomial invariants of finite groups*]{}, Arch. Math. (Basel) [**74**]{} (2000), No. 3, 161-167.
V. Drensky, [*Polynomial identities of finite dimensional algebras*]{}, Serdica [**12**]{} (1986), 209-216.
V. Drensky, [*Finite generation of invariants of finite linear groups on relatively free algebras*]{}, Lin. and Multilin. Algebra [**35**]{} (1993), 1-10.
V. Drensky, [*Commutative and noncommutative invariant theory*]{}, Math. and Education in Math., Proc. of the 24-th Spring Conf. of the Union of Bulgar. Mathematicians, Svishtov, April 4-7, 1995, Sofia, 1995, 14-50.
V. Drensky, E. Formanek, [*Polynomial Identity Rings*]{}, Advanced Courses in Mathematics, CRM Barcelona, Birkhäuser Verlag, Basel, 2004.
J. Dubnov, V. Ivanov, [*Sur l’abaissement du degré des polynômes en affineurs*]{}, C.R. (Doklady) Acad. Sci. USSR [**41**]{} (1943), 96-98 (see also MR [**6**]{} (1945), p. 113, Zbl. für Math. [**60**]{} (1957), p. 33).
J. W. Fisher, S. Montgomery, [*Invariants of finite cyclic groups acting on generic matrices*]{}, J. Algebra [**99**]{} (1986), 430-437.
E. Formanek, [*Noncommutative invariant theory*]{}, Contemp. Math. [**43**]{} (1985), 87-119.
A. Giambruno, M. Zaicev, [*Polynomial Identities and Asymptotic Methods*]{}, Mathematical Surveys and Monographs [**122**]{}, AMS, Providence, RI, 2005.
G. Higman, [*On a conjecture of Nagata*]{}, Proc. Camb. Philos. Soc. [**52**]{} (1956), 1-4.
A. R. Kemer, [*Nonmatrix varieties*]{} (Russian), Algebra Logika [**19**]{} (1980), 255-283. Translation: Algebra Logic [**19**]{} (1981), 157-178.
A. R. Kemer, [*Asymptotic basis of the identities with unit of the variety $\text{\rm Var}(M_2(F))$*]{} (Russian), Izv. Vyssh. Uchebn. Zaved. Mat. (1989), No. 6, 71-76. Translation: Sov. Math. Soviet Math. (Iz. VUZ) [**33**]{} (1990), No. 6, 71-76.
V. K. Kharchenko, [*Noncommutative invariants of finite groups and Noetherian varieties*]{}, J. Pure Appl. Alg. [**31**]{} (1984), 83-90.
O. G. Kharlampovich, M. V. Sapir, [*Algorithmic problems in varieties*]{}, Intern. J. Algebra and Computation [**5**]{} (1995), 379-602.
E. N. Kuz’min, [*On the Nagata-Higman theorem*]{} (Russian), Mathematical Structures, Computational Mathematics, Mathematical Modelling. Proc. Deducated to the 60th Birthday of Acad. L. Iliev, Sofia, 1975, 101-107.
V. N. Latyshev, [*Generalization of the Hilbert theorem on the finiteness of bases*]{} (Russian), Sib. Mat. Zhurn. [**7**]{} (1966), 1422-1424. Translation: Sib. Math. J. [**7**]{} (1966), 1112-1113.
I. V. Lvov, [*Maximality conditions in algebras with identity relations*]{} (Russian), Algebra Logika [**8**]{} (1969), 449-459. Translation: Algebra Logic [**8**]{} (1969), 258-263.
A. I. Malcev, [*On the representations of infinite algebras*]{} (Russian), Mat. Sb. [**13**]{} (1943), 263-286.
M. Nagata, [*On the nilpotency of nil algebras*]{}, J. Math. Soc. Japan [**4**]{} (1953), 296-301.
E. Noether, [*Der Endlichkeitssatz der Invarianten endlicher Gruppen*]{}, Math. Ann. [**77**]{} (1916), 89-92; reprinted in “Gesammelte Abhandlungen. Collected Papers”, Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1983, 181-184.
Yu. P. Razmyslov, [*Trace identities of full matrix algebras over a field of characteristic zero*]{} (Russian), Izv. Akad. Nauk SSSR, Ser. Mat. [**38**]{} (1974), 723-756. Translation: Math. USSR Izv. [**8**]{} (1974), 723-760.
B. J. Schmid, [*Finite groups and invariant theory*]{}, Topics in Invariant Theory (Paris, 1989/1990), Lecture Notes in Mathematics, [**1478**]{}, Springer-Verlag, Berlin, 1991, 35-66.
I. K. Tonov, [*Just-non-weakly noetherian varieties of associative algebras*]{} (Russian), Pliska Stud. Math. Bulg. [**2**]{}, 1981, 162-166.
E. I. Zelmanov, [*On Engel Lie algebras*]{} (Russian), Sibirsk. Mat. Zh. [**29**]{} (1988), No. 5, 112-117. Translation: Sib. Math. J. [**29**]{} (1988), 777-781.
[^1]: This project was carried out in the framework of the exchange program between the Hungarian and Bulgarian Academies of Sciences. It was partially supported by Grant K101515 of the Hungarian National Foundation for Scientific Research (OTKA) and by Grant I02/18 of the Bulgarian National Science Fund.
| 2024-04-07T01:26:29.851802 | https://example.com/article/6655 |
In the previous blog-post I promised to tell you why it is difficult to demonstrate 64-bit errors by simple examples. We spoke about operator[] and I told that in simple cases even incorrect code might work. Here is such an example:
class MyArray { public: char *m_p; size_t m_n; MyArray(const size_t n) { m_n = n; m_p = new char[n]; } ~MyArray() { delete [] m_p; } char &operator[](int index) { return m_p[index]; } char &operator()(ptrdiff_t index) { return m_p[index]; } ptrdiff_t CalcSum() { ptrdiff_t sum = 0; for (size_t i = 0; i != m_n; ++i) sum += m_p[i]; return sum; } }; void Test() { ptrdiff_t a = 2560; ptrdiff_t b = 1024; ptrdiff_t c = 1024; MyArray array(a * b * c); for (ptrdiff_t i = 0; i != a * b * c; ++i) array(i) = 1; ptrdiff_t sum1 = array.CalcSum(); for (int i = 0; i != a * b * c; ++i) array[i] = 2; ptrdiff_t sum2 = array.CalcSum(); if (sum1 != sum2 / 2) MessageBox(NULL, _T("Normal error"), _T("Test"), MB_OK); else MessageBox(NULL, _T("Fantastic"), _T("Test"), MB_OK); }
Briefly, this code does the following:
Creates an array of 2.5 Gbytes (more than INT_MAX items).
Fills the array with ones by using the correct operator() with ptrdiff_t parameter.
Calculates the sum of all the items and writes it into the variable sum1.
Fills the array with twos by using the incorrect operator[] with int parameter. Theoretically, int does not allow us to address the items whose numbers are more than INT_MAX. There is one more error in the loop "for (int i = 0; i != a * b * c; ++i)". Here, we also use int as the index. This double error is made for the compiler not to generate warnings about a 64-bit value converting to a 32-bit one. Actually, an overflow and addressing an item with a negative number must take place what will result in a crash. By the way, this is what happens in the debug-version.
Calculates the sum of all the items and writes it into the variable sum2.
If (sum1 == sum2 / 2), it means that the impossible became true and you see the message "Fantastic".
Despite the two errors in this code, it successfully works in the 64-bit release-version and prints the message "Fantastic"!
Now let us make out why. The point is that the compiler guessed our wish to fill the array with the values 1 and 2. And in the both cases it optimized our code by calling memset function:
The first conclusion is: the compiler is a clever guy in the questions of optimization. The second conclusion - stay watchful.
This error might be easily detected in the debug-version where there is no optimization and the code writing twos into the array leads to a crash. What is dangerous, this code behaves incorrectly only when dealing with large arrays. Most likely, processing of more than two milliards of items will not be present in the unit-tests run for the debug-version. And the release-version might keep this error a secret for a long time. The error can occur quite unexpectedly at a slightest change of the code. Look what can happen if we introduce one more variable, n:
void Test() { ptrdiff_t a = 2560; ptrdiff_t b = 1024; ptrdiff_t c = 1024; ptrdiff_t n = a * b * c; MyArray array(n); for (ptrdiff_t i = 0; i != n; ++i) array(i) = 1; ptrdiff_t sum1 = array.CalcSum(); for (int i = 0; i != n; ++i) array[i] = 2; ptrdiff_t sum2 = array.CalcSum(); ... }
The release-version crashed this time. Look at the assembler code.
The compiler again built the code with a memset call for the correct operator(). This part still works well as before. But in the code where operator[] is used, an overflow occurs because "i != n" condition does not hold. It is not quite the code I wished to create but it is difficult to implement what I wanted in a small code while a large code is difficult to examine. Anyways, the fact remains. The code now crashes as it should be.
Why have I devoted so much time to this topic? Perhaps I am tormented with the problem that I cannot demonstrate 64-bit errors by simple examples. I write something simple for the purpose of demonstration and what a pity it is when one tries it and it works well in the release-version. And therefore it seems that there is no error. But there are errors and they are very insidious and difficult to detect. So, I will repeat once again. You might easily miss such errors during debugging and while running unit-tests for the debug-version. Hardly has anyone so much patience to debug a program or wait for the tests to complete when they process gigabytes. The release-version might pass a large serious testing. But if there is a slight change in the code or a new version of the compiler is used, the next build will fail to work at a large data amount.
To learn about diagnosis of this error, see the previous post where the new warning V302 is described. | 2024-04-17T01:26:29.851802 | https://example.com/article/6150 |
// Symbolic execution (loosely) based on semantics used in UFO
#include "llvm/IR/GetElementPtrTypeIterator.h"
#include "seahorn/Transforms/Instrumentation/ShadowMemDsa.hh"
#include "seahorn/UfoOpSem.hh"
#include "seahorn/Support/IteratorExtras.hh"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/FileSystem.h"
#include "seahorn/Support/SeaDebug.h"
#include "seahorn/Support/Stats.hh"
#include "seahorn/Expr/ExprLlvm.hh"
#include "seahorn/Expr/Smt/EZ3.hh"
#include "sea_dsa/Global.hh"
namespace seahorn {
// counters for encoding with InterProcMem option
InterMemStats g_im_stats;
} // namespace seahorn
using namespace seahorn;
using namespace llvm;
static llvm::cl::opt<bool> GlobalConstraints(
"horn-global-constraints",
llvm::cl::desc("Maximize the use of global (i.e., unguarded) constraints"),
cl::init(false));
static llvm::cl::opt<bool> ArrayGlobalConstraints(
"horn-array-global-constraints",
llvm::cl::desc("Extend global constraints to arrays"), cl::init(false));
static llvm::cl::opt<bool> StrictlyLinear(
"horn-strictly-la",
llvm::cl::desc("Generate strictly Linear Arithmetic constraints"),
cl::init(true));
static llvm::cl::opt<bool>
EnableDiv("horn-enable-div", llvm::cl::desc("Enable division constraints."),
cl::init(true));
static llvm::cl::opt<bool> RewriteDiv(
"horn-rewrite-div",
llvm::cl::desc("Rewrite division constraints to multiplications."),
cl::init(false));
static llvm::cl::opt<bool> EnableUniqueScalars(
"horn-singleton-aliases",
llvm::cl::desc("Treat singleton alias sets as scalar values"),
cl::init(false));
static llvm::cl::opt<bool> InferMemSafety(
"horn-use-mem-safety",
llvm::cl::desc("Rely on memory safety assumptions such as "
"successful load/store imply validity of their arguments"),
cl::init(true), cl::Hidden);
static llvm::cl::opt<bool> IgnoreCalloc(
"horn-ignore-calloc",
llvm::cl::desc(
"Treat calloc same as malloc, ignore that memory is initialized"),
cl::init(false), cl::Hidden);
static llvm::cl::opt<bool>
IgnoreMemset("horn-ignore-memset",
llvm::cl::desc("Ignore that memset writes into a memory"),
cl::init(false), cl::Hidden);
static llvm::cl::opt<bool>
UseWrite("horn-use-write",
llvm::cl::desc("Write to store instead of havoc"), cl::init(false),
cl::Hidden);
static const Value *extractUniqueScalar(CallSite &cs) {
if (!EnableUniqueScalars)
return nullptr;
else
return seahorn::shadow_dsa::extractUniqueScalar(cs);
}
static const Value *extractUniqueScalar(const CallInst *ci) {
if (!EnableUniqueScalars)
return nullptr;
else
return seahorn::shadow_dsa::extractUniqueScalar(ci);
}
static bool isShadowMem(const Value &V, const Value **out) {
const Value *scalar;
bool res = seahorn::shadow_dsa::isShadowMem(V, &scalar);
if (EnableUniqueScalars && out)
*out = scalar;
return res;
}
namespace {
struct OpSemBase {
SymStore &m_s;
ExprFactory &m_efac;
UfoOpSem &m_sem;
ExprVector &m_side;
Expr trueE;
Expr falseE;
Expr zeroE;
Expr oneE;
/// -- current read memory
Expr m_inMem;
/// -- current write memory
Expr m_outMem;
/// --- true if the current read/write is to unique memory location
bool m_uniq;
/// -- parameters for a function call
ExprVector m_fparams;
Expr m_activeLit;
// -- input and output parameter regions for a function call
ExprVector m_inRegions;
ExprVector m_outRegions;
OpSemBase(SymStore &s, UfoOpSem &sem, ExprVector &side)
: m_s(s), m_efac(m_s.getExprFactory()), m_sem(sem), m_side(side) {
trueE = mk<TRUE>(m_efac);
falseE = mk<FALSE>(m_efac);
zeroE = mkTerm<expr::mpz_class>(0UL, m_efac);
oneE = mkTerm<expr::mpz_class>(1UL, m_efac);
m_uniq = false;
resetActiveLit();
// -- first two arguments are reserved for error flag
m_fparams.push_back(falseE);
m_fparams.push_back(falseE);
m_fparams.push_back(falseE);
}
Expr symb(const Value &I) { return m_sem.symb(I); }
Expr read(const Value &v) {
return m_sem.isTracked(v) ? m_s.read(symb(v)) : Expr(0);
}
Expr lookup(const Value &v) { return m_sem.lookup(m_s, v); }
Expr havoc(const Value &v) {
return m_sem.isTracked(v) ? m_s.havoc(symb(v)) : Expr(0);
}
void write(const Value &v, Expr val) {
if (val && m_sem.isTracked(v))
m_s.write(symb(v), val);
}
void resetActiveLit() { m_activeLit = trueE; }
void setActiveLit(Expr act) { m_activeLit = act; }
// -- add conditional side condition
void addCondSide(Expr c) { side(c, true); }
void side(Expr v, bool conditional = false) {
if (!v)
return;
if (!GlobalConstraints || conditional)
m_side.push_back(boolop::limp(m_activeLit, v));
else
m_side.push_back(v);
}
void bside(Expr lhs, Expr rhs, bool conditional = false) {
if (lhs && rhs)
side(mk<IFF>(lhs, rhs), conditional);
}
void side(Expr lhs, Expr rhs, bool conditional = false) {
if (lhs && rhs)
side(mk<EQ>(lhs, rhs), conditional);
}
};
struct OpSemVisitor : public InstVisitor<OpSemVisitor>, OpSemBase {
OpSemVisitor(SymStore &s, UfoOpSem &sem, ExprVector &side)
: OpSemBase(s, sem, side) {}
/// base case. if all else fails.
void visitInstruction(Instruction &I) { havoc(I); }
/// skip PHI nodes
void visitPHINode(PHINode &I) { /* do nothing */
}
Expr geq(Expr op0, Expr op1) {
if (op0 == op1)
return trueE;
if (isOpX<MPZ>(op0) && isOpX<MPZ>(op1))
return getTerm<expr::mpz_class>(op0) >= getTerm<expr::mpz_class>(op1) ? trueE
: falseE;
return mk<GEQ>(op0, op1);
}
Expr lt(Expr op0, Expr op1) {
if (op0 == op1)
return falseE;
if (isOpX<MPZ>(op0) && isOpX<MPZ>(op1))
return getTerm<expr::mpz_class>(op0) < getTerm<expr::mpz_class>(op1) ? trueE : falseE;
return mk<LT>(op0, op1);
}
Expr mkUnsignedLT(Expr op0, Expr op1) {
using namespace expr::op::boolop;
return lite(geq(op0, zeroE), lite(geq(op1, zeroE), lt(op0, op1), trueE),
lite(lt(op1, zeroE), lt(op0, op1), falseE));
}
void visitCmpInst(CmpInst &I) {
Expr lhs = havoc(I);
const Value &v0 = *I.getOperand(0);
const Value &v1 = *I.getOperand(1);
Expr op0 = lookup(v0);
Expr op1 = lookup(v1);
if (!(op0 && op1))
return;
Expr rhs;
switch (I.getPredicate()) {
case CmpInst::ICMP_EQ:
rhs = mk<EQ>(op0, op1);
break;
case CmpInst::ICMP_NE:
rhs = mk<NEQ>(op0, op1);
break;
case CmpInst::ICMP_UGT:
rhs = mkUnsignedLT(op1, op0);
break;
case CmpInst::ICMP_SGT:
if (v0.getType()->isIntegerTy(1)) {
if (isOpX<TRUE>(op1))
// icmp sgt op0, i1 true == !op0
rhs = boolop::lneg(op0);
} else
rhs = mk<GT>(op0, op1);
break;
case CmpInst::ICMP_UGE:
side(mk<OR>(mk<IFF>(lhs, mk<EQ>(op0, op1)),
mk<IFF>(lhs, mkUnsignedLT(op1, op0))));
rhs = nullptr;
break;
case CmpInst::ICMP_SGE:
rhs = mk<GEQ>(op0, op1);
break;
case CmpInst::ICMP_ULT:
rhs = mkUnsignedLT(op0, op1);
break;
case CmpInst::ICMP_SLT:
rhs = mk<LT>(op0, op1);
break;
case CmpInst::ICMP_ULE:
side(mk<OR>(mk<IFF>(lhs, mk<EQ>(op0, op1)),
mk<IFF>(lhs, mkUnsignedLT(op0, op1))));
rhs = nullptr;
break;
case CmpInst::ICMP_SLE:
rhs = mk<LEQ>(op0, op1);
break;
default:
rhs = nullptr;
break;
}
if (UseWrite)
write(I, rhs);
else
side(lhs, rhs);
}
void visitSelectInst(SelectInst &I) {
if (!m_sem.isTracked(I))
return;
Expr lhs = havoc(I);
Expr cond = lookup(*I.getCondition());
Expr op0 = lookup(*I.getTrueValue());
Expr op1 = lookup(*I.getFalseValue());
if (cond && op0 && op1) {
Expr rhs = mk<ITE>(cond, op0, op1);
/* avoid creating nest ite expressions by always introducing fresh
* constants */
if (false && UseWrite)
write(I, rhs);
else
side(lhs, rhs);
}
}
void visitBinaryOperator(BinaryOperator &I) {
if (!m_sem.isTracked(I))
return;
Expr lhs = havoc(I);
switch (I.getOpcode()) {
case BinaryOperator::Add:
case BinaryOperator::Sub:
case BinaryOperator::Mul:
case BinaryOperator::UDiv:
case BinaryOperator::SDiv:
case BinaryOperator::Shl:
case BinaryOperator::AShr:
case BinaryOperator::SRem:
case BinaryOperator::URem:
doArithmetic(lhs, I);
break;
case BinaryOperator::And:
case BinaryOperator::Or:
case BinaryOperator::Xor:
case BinaryOperator::LShr:
doLogic(lhs, I);
break;
default:
break;
}
}
void doBitLogic(Expr lhs, BinaryOperator &i) {
const Value &v0 = *(i.getOperand(0));
const Value &v1 = *(i.getOperand(1));
Expr op0 = lookup(v0);
Expr op1 = lookup(v1);
if (!(op0 && op1))
return;
Expr res;
Expr sixteen = mkTerm<expr::mpz_class>(16UL, m_efac);
Expr thirtytwo = mkTerm<expr::mpz_class>(32UL, m_efac);
Expr twoToSixteenMinusOne = mkTerm<expr::mpz_class>(65535UL, m_efac);
switch (i.getOpcode()) {
case BinaryOperator::And: {
if (const ConstantInt *ci = dyn_cast<ConstantInt>(i.getOperand(1))) {
if (ci->getBitWidth() <= 64) {
Expr rhs;
if (isMask_32(ci->getZExtValue())) {
uint64_t v = ci->getZExtValue();
rhs = mk<MOD>(
op0, mkTerm<expr::mpz_class>((unsigned long int)(v + 1), m_efac));
}
if (UseWrite)
write(i, rhs);
else
side(lhs, rhs);
return;
}
}
// other common cases
ExprVector val;
// 0 & x = 0
val.push_back(mk<IMPL>(mk<EQ>(op0, zeroE), mk<EQ>(lhs, zeroE)));
// x & 0 = 0
val.push_back(mk<IMPL>(mk<EQ>(op1, zeroE), mk<EQ>(lhs, zeroE)));
// 32 & 16 == 0
if (op1 == sixteen)
val.push_back(mk<IMPL>(mk<EQ>(op0, thirtytwo), mk<EQ>(lhs, zeroE)));
// x & 65535 == x (if x <= 65535)
if (op1 == twoToSixteenMinusOne)
val.push_back(
mk<IMPL>(mk<LEQ>(op0, twoToSixteenMinusOne), mk<EQ>(lhs, op0)));
// val.push_back (mk<IMPL> (mk<AND> (mk<EQ> (op0, thirtytwo),
// mk<EQ> (op1, sixteen)),
// mk<EQ> (lhs, zeroE)));
res = mknary<AND>(val);
} break;
case BinaryOperator::Or:
// 0 | x = x
res = mk<AND>(mk<IMPL>(mk<EQ>(op0, zeroE), mk<EQ>(lhs, op1)),
mk<IMPL>(mk<EQ>(op1, zeroE), mk<EQ>(lhs, op0)));
break;
case BinaryOperator::LShr:
if (const ConstantInt *ci = dyn_cast<ConstantInt>(&v1))
res = doLShr(lhs, op0, ci);
break;
default:
break;
}
addCondSide(res);
}
Expr doLShr(Expr lhs, Expr op1, const ConstantInt *op2) {
if (!EnableDiv)
return Expr(nullptr);
uint64_t shift = op2->getValue().getZExtValue();
unsigned long factor = 1;
for (unsigned long i = 0; i < shift; ++i)
factor = factor * 2;
Expr factorE = mkTerm<expr::mpz_class>(factor, m_efac);
if (RewriteDiv)
return mk<IMPL>(mk<GEQ>(op1, zeroE), mk<EQ>(mk<MULT>(lhs, factorE), op1));
else
return mk<IMPL>(mk<GEQ>(op1, zeroE), mk<EQ>(lhs, mk<DIV>(op1, factorE)));
}
void doLogic(Expr lhs, BinaryOperator &I) {
const Value &v0 = *(I.getOperand(0));
const Value &v1 = *(I.getOperand(1));
// only Boolean logic is supported
if (!(v0.getType()->isIntegerTy(1) && v1.getType()->isIntegerTy(1)))
return doBitLogic(lhs, I);
Expr op0 = lookup(v0);
Expr op1 = lookup(v1);
if (!(op0 && op1))
return;
Expr rhs;
switch (I.getOpcode()) {
case BinaryOperator::And:
rhs = mk<AND>(op0, op1);
break;
case BinaryOperator::Or:
rhs = mk<OR>(op0, op1);
break;
case BinaryOperator::Xor:
rhs = mk<XOR>(op0, op1);
break;
case BinaryOperator::LShr:
if (const ConstantInt *ci = dyn_cast<ConstantInt>(&v1)) {
Expr res = doLShr(lhs, op0, ci);
side(res);
return;
}
default:
break;
}
if (UseWrite)
write(I, rhs);
else
side(lhs, rhs);
}
Expr doLeftShift(Expr op1, const ConstantInt *op2) {
uint64_t shift = op2->getValue().getZExtValue();
unsigned long factor = 1;
for (unsigned long i = 0; i < shift; ++i) {
factor = factor * 2;
}
return mk<MULT>(op1, mkTerm<expr::mpz_class>(factor, m_efac));
}
Expr doAShr(Expr lhs, Expr op1, const ConstantInt *op2) {
if (!EnableDiv)
return Expr(nullptr);
uint64_t shift = op2->getValue().getZExtValue();
unsigned long factor = 1;
for (unsigned long i = 0; i < shift; ++i)
factor = factor * 2;
Expr factorE = mkTerm<expr::mpz_class>(factor, m_efac);
if (RewriteDiv)
return mk<EQ>(mk<MULT>(lhs, factorE), op1);
else
return mk<EQ>(lhs, mk<DIV>(op1, factorE));
}
void doArithmetic(Expr lhs, BinaryOperator &I) {
const Value &v1 = *I.getOperand(0);
const Value &v2 = *I.getOperand(1);
Expr op1 = lookup(v1);
Expr op2 = lookup(v2);
if (!(op1 && op2))
return;
Expr rhs;
switch (I.getOpcode()) {
case BinaryOperator::Add:
rhs = mk<PLUS>(op1, op2);
break;
case BinaryOperator::Sub:
rhs = mk<MINUS>(op1, op2);
break;
case BinaryOperator::Mul:
// if StrictlyLinear, then require that at least one
// argument is a constant
if (!StrictlyLinear || isOpX<MPZ>(op1) || isOpX<MPZ>(op2) ||
isOpX<MPQ>(op1) || isOpX<MPQ>(op2))
rhs = mk<MULT>(op1, op2);
break;
case BinaryOperator::SDiv:
case BinaryOperator::UDiv:
// if StrictlyLinear then require that divisor is a constant
if (EnableDiv &&
(!StrictlyLinear || isOpX<MPZ>(op2) || isOpX<MPQ>(op2))) {
if (RewriteDiv) {
side(mk<MULT>(lhs, op2), op1, true);
return;
} else
rhs = mk<DIV>(op1, op2);
}
break;
case BinaryOperator::SRem:
case BinaryOperator::URem:
// if StrictlyLinear then require that divisor is a constant
if (EnableDiv && (!StrictlyLinear || isOpX<MPZ>(op2) || isOpX<MPQ>(op2)))
rhs = mk<REM>(op1, op2);
break;
case BinaryOperator::Shl:
if (const ConstantInt *ci = dyn_cast<ConstantInt>(&v2))
rhs = doLeftShift(op1, ci);
break;
case BinaryOperator::AShr:
if (const ConstantInt *ci = dyn_cast<ConstantInt>(&v2)) {
Expr res = doAShr(lhs, op1, ci);
side(res, true);
return;
}
break;
default:
break;
}
// -- always guard division
if (EnableDiv && (I.getOpcode() == BinaryOperator::SDiv ||
I.getOpcode() == BinaryOperator::UDiv ||
I.getOpcode() == BinaryOperator::SRem ||
I.getOpcode() == BinaryOperator::URem ||
I.getOpcode() == BinaryOperator::AShr))
side(lhs, rhs, true);
else if (UseWrite)
write(I, rhs);
else
side(lhs, rhs);
}
void visitReturnInst(ReturnInst &I) {
// -- skip return argument of main
if (I.getParent()->getParent()->getName().equals("main"))
return;
if (I.getNumOperands() > 0)
lookup(*I.getOperand(0));
}
void visitBranchInst(BranchInst &I) {
if (I.isConditional())
lookup(*I.getCondition());
}
void visitTruncInst(TruncInst &I) {
if (!m_sem.isTracked(I))
return;
Expr lhs = havoc(I);
Expr op0 = lookup(*I.getOperand(0));
if (!op0)
return;
if (I.getType()->isIntegerTy(1)) {
// truncation to 1 bit amounts to 'is_even' predicate.
// We handle the two most common cases: 0 -> false, 1 -> true
side(mk<IMPL>(mk<EQ>(op0, zeroE), mk<NEG>(lhs)));
side(mk<IMPL>(mk<EQ>(op0, oneE), lhs));
} else if (UseWrite)
write(I, op0);
else
side(lhs, op0);
}
void visitZExtInst(ZExtInst &I) { doExtCast(I, false); }
void visitSExtInst(SExtInst &I) { doExtCast(I, true); }
void visitGetElementPtrInst(GetElementPtrInst &gep) {
if (!m_sem.isTracked(gep))
return;
Expr lhs = havoc(gep);
Expr op = m_sem.ptrArith(m_s, gep);
if (op) {
// XXX cannot use write because lhs is further constrained below
side(lhs, op);
if (!InferMemSafety)
return;
// -- extra constraints that exclude undefined behavior
if (!gep.isInBounds() || gep.getPointerAddressSpace() != 0)
return;
if (Expr base = lookup(*gep.getPointerOperand()))
// -- base > 0 -> lhs > 0
addCondSide(mk<OR>(mk<LEQ>(base, zeroE), mk<GT>(lhs, zeroE)));
}
}
void doExtCast(CastInst &I, bool is_signed = false) {
Expr lhs = havoc(I);
const Value &v0 = *I.getOperand(0);
Expr op0 = lookup(v0);
if (!op0)
return;
// sext maps (i1 1) to -1
Expr one = mkTerm<expr::mpz_class>(is_signed ? -1L : 1L, m_efac);
if (v0.getType()->isIntegerTy(1)) {
if (const ConstantInt *ci = dyn_cast<ConstantInt>(&v0))
op0 = ci->isOne() ? one : zeroE;
else
op0 = mk<ITE>(op0, one, zeroE);
}
if (UseWrite)
write(I, op0);
else
side(lhs, op0);
}
void visitCallSite(CallSite CS) {
assert(CS.isCall());
const Function *f = CS.getCalledFunction();
Instruction &I = *CS.getInstruction();
BasicBlock &BB = *I.getParent();
// -- unknown/indirect function call
if (!f) {
// XXX Use DSA and/or Devirt to handle better
assert(m_fparams.size() == 3);
visitInstruction(I);
return;
}
const Function &F = *f;
const Function &PF = *I.getParent()->getParent();
// skip intrinsic functions, except for memory-related ones
if (F.isIntrinsic() && !isa<MemIntrinsic>(&I)) {
assert(m_fparams.size() == 3);
return;
}
if (F.getName().startswith("verifier.assume")) {
Expr c = lookup(*CS.getArgument(0));
if (F.getName().equals("verifier.assume.not"))
c = boolop::lneg(c);
assert(m_fparams.size() == 3);
// -- assumption is only active when error flag is false
addCondSide(boolop::lor(m_s.read(m_sem.errorFlag(BB)), c));
} else if (F.getName().equals("calloc") && m_inMem && m_outMem &&
m_sem.isTracked(I)) {
havoc(I);
assert(m_fparams.size() == 3);
if (IgnoreCalloc)
m_side.push_back(mk<EQ>(m_outMem, m_inMem));
else {
// XXX This is potentially unsound if the corresponding DSA
// XXX node corresponds to multiple allocation sites
errs() << "WARNING: zero-initializing DSA node due to calloc()\n";
if (m_uniq) {
side(m_outMem, zeroE);
} else {
m_side.push_back(mk<EQ>(
m_outMem, op::array::constArray(sort::intTy(m_efac), zeroE)));
}
}
} else if (MemSetInst *MSI = dyn_cast<MemSetInst>(&I)) {
if (m_inMem && m_outMem && m_sem.isTracked(*(MSI->getDest()))) {
assert(m_fparams.size() == 3);
if (IgnoreMemset)
m_side.push_back(mk<EQ>(m_outMem, m_inMem));
else {
if (const ConstantInt *c =
dyn_cast<const ConstantInt>(MSI->getValue())) {
// XXX This is potentially unsound if the corresponding DSA
// XXX node corresponds to multiple allocation sites
Expr val = mkTerm<expr::mpz_class>(expr::toMpz(c->getValue()), m_efac);
errs() << "WARNING: initializing DSA node due to memset()\n";
if (m_uniq) {
side(m_outMem, val);
} else {
m_side.push_back(mk<EQ>(
m_outMem, op::array::constArray(sort::intTy(m_efac), val)));
}
}
}
}
}
// else if (F.getName ().equals ("verifier.assert"))
// {
// Expr ein = m_s.read (m_sem.errorFlag ());
// Expr eout = m_s.havoc (m_sem.errorFlag ());
// Expr cond = lookup (*CS.getArgument (0));
// m_side.push_back (boolop::limp (cond,
// mk<EQ> (ein, eout)));
// m_side.push_back (boolop::limp (boolop::lneg (cond), eout));
// }
// else if (F.getName ().equals ("verifier.error"))
// m_side.push_back (m_s.havoc (m_sem.errorFlag ()));
else if (m_sem.hasFunctionInfo(F)) {
// the first three parameters are common for all the encodings
// enabled
m_fparams[0] = m_activeLit; // activation literal
// error flag in
m_fparams[1] = (m_s.read(m_sem.errorFlag(BB)));
// error flag out
m_fparams[2] = (m_s.havoc(m_sem.errorFlag(BB)));
CallSiteInfo csi(CS, m_fparams);
m_sem.execCallSite(csi, m_side, m_s);
// reseting parameter structures
m_fparams.clear();
m_fparams.push_back(falseE);
m_fparams.push_back(falseE);
m_fparams.push_back(falseE);
m_inRegions.clear();
m_outRegions.clear();
} else if (F.getName().startswith("shadow.mem")) {
if (!m_sem.isTracked(I))
return;
if (F.getName().equals("shadow.mem.init"))
m_s.havoc(symb(I));
else if (F.getName().equals("shadow.mem.load")) {
const Value &v = *CS.getArgument(1);
m_inMem = m_s.read(symb(v));
m_uniq = extractUniqueScalar(CS) != nullptr;
} else if (F.getName().equals("shadow.mem.store")) {
m_inMem = m_s.read(symb(*CS.getArgument(1)));
m_outMem = m_s.havoc(symb(I));
m_uniq = extractUniqueScalar(CS) != nullptr;
} else if (F.getName().equals("shadow.mem.global.init")) {
m_inMem = m_s.read(symb(*CS.getArgument(1)));
m_outMem = m_s.havoc(symb(I));
m_side.push_back(mk<EQ>(m_outMem, m_inMem));
} else if (F.getName().equals("shadow.mem.arg.ref"))
m_fparams.push_back(m_s.read(symb(*CS.getArgument(1))));
else if (F.getName().equals("shadow.mem.arg.mod")) {
auto in_par = m_s.read(symb(*CS.getArgument(1)));
m_fparams.push_back(in_par);
m_inRegions.push_back(in_par);
auto out_par = m_s.havoc(symb(I));
m_fparams.push_back(out_par);
m_outRegions.push_back(out_par);
} else if (F.getName().equals("shadow.mem.arg.new"))
m_fparams.push_back(m_s.havoc(symb(I)));
else if (!PF.getName().equals("main") &&
F.getName().equals("shadow.mem.in")) {
m_s.read(symb(*CS.getArgument(1)));
} else if (!PF.getName().equals("main") &&
F.getName().equals("shadow.mem.out")) {
m_s.read(symb(*CS.getArgument(1)));
} else if (!PF.getName().equals("main") &&
F.getName().equals("shadow.mem.arg.init")) {
// regions initialized in main are global. We want them to
// flow to the arguments
/* do nothing */
}
} else {
if (m_fparams.size() > 3) {
if (m_sem.isAbstracted(*f)) {
assert(m_inRegions.size() && m_outRegions.size());
for (unsigned i = 0; i < m_inRegions.size(); i++) {
addCondSide(mk<EQ>(m_inRegions[i], m_outRegions[i]));
}
errs() << "WARNING: abstracted unsoundly a call to " << F.getName()
<< "\n";
} else {
errs() << "WARNING: skipping a call to " << F.getName()
<< " (recursive call?)\n";
}
m_fparams.resize(3);
m_inRegions.clear();
m_outRegions.clear();
}
visitInstruction(*CS.getInstruction());
}
}
void visitAllocaInst(AllocaInst &I) {
if (!m_sem.isTracked(I))
return;
// -- alloca always returns a non-zero address
Expr lhs = havoc(I);
side(mk<GT>(lhs, zeroE));
}
void visitLoadInst(LoadInst &I) {
if (InferMemSafety) {
Value *pop = I.getPointerOperand()->stripPointerCasts();
// -- successful load through a gep implies that the base
// -- address of the gep is not null
if (GetElementPtrInst *gep = dyn_cast<GetElementPtrInst>(pop)) {
Expr base = lookup(*gep->getPointerOperand());
if (base)
addCondSide(mk<GT>(base, zeroE));
}
}
if (!m_sem.isTracked(I))
return;
// -- define (i.e., use) the value of the instruction
Expr lhs = havoc(I);
if (!m_inMem)
return;
if (m_uniq) {
Expr rhs = m_inMem;
if (I.getType()->isIntegerTy(1))
// -- convert to Boolean
rhs = mk<NEQ>(rhs, mkTerm(expr::mpz_class(), m_efac));
if (UseWrite)
write(I, rhs);
else
side(lhs, rhs);
} else if (Expr op0 = lookup(*I.getPointerOperand())) {
Expr rhs = op::array::select(m_inMem, op0);
if (I.getType()->isIntegerTy(1))
// -- convert to Boolean
rhs = mk<NEQ>(rhs, mkTerm(expr::mpz_class(), m_efac));
side(lhs, rhs, !ArrayGlobalConstraints);
}
m_inMem.reset();
}
void visitStoreInst(StoreInst &I) {
if (InferMemSafety) {
Value *pop = I.getPointerOperand()->stripPointerCasts();
// -- successful load through a gep implies that the base
// -- address of the gep is not null
if (GetElementPtrInst *gep = dyn_cast<GetElementPtrInst>(pop)) {
Expr base = lookup(*gep->getPointerOperand());
if (base)
addCondSide(mk<GT>(base, zeroE));
}
}
if (!m_inMem || !m_outMem || !m_sem.isTracked(*I.getOperand(0)))
return;
Expr act = GlobalConstraints ? trueE : m_activeLit;
Expr v = lookup(*I.getOperand(0));
if (v && I.getOperand(0)->getType()->isIntegerTy(1))
// -- convert to int
v = boolop::lite(v, mkTerm(expr::mpz_class(1UL), m_efac),
mkTerm(expr::mpz_class(), m_efac));
if (m_uniq) {
side(m_outMem, v);
} else {
Expr idx = lookup(*I.getPointerOperand());
if (idx && v)
side(m_outMem, op::array::store(m_inMem, idx, v),
!ArrayGlobalConstraints);
}
m_inMem.reset();
m_outMem.reset();
}
void visitCastInst(CastInst &I) {
if (!m_sem.isTracked(I))
return;
Expr lhs = havoc(I);
const Value &v0 = *I.getOperand(0);
Expr u = lookup(v0);
if (UseWrite)
write(I, u);
else
side(lhs, u);
}
void initGlobals(const BasicBlock &BB) {
const Function &F = *BB.getParent();
if (&F.getEntryBlock() != &BB)
return;
if (!F.getName().equals("main"))
return;
const Module &M = *F.getParent();
for (const GlobalVariable &g :
boost::make_iterator_range(M.global_begin(), M.global_end()))
if (m_sem.isTracked(g))
havoc(g);
}
void visitBasicBlock(BasicBlock &BB) {
/// -- check if globals need to be initialized
initGlobals(BB);
// read the error flag to make it live
m_s.read(m_sem.errorFlag(BB));
}
}; // OpSemVisitor
struct OpSemPhiVisitor : public InstVisitor<OpSemPhiVisitor>, OpSemBase {
const BasicBlock &m_dst;
OpSemPhiVisitor(SymStore &s, UfoOpSem &sem, ExprVector &side,
const BasicBlock &dst)
: OpSemBase(s, sem, side), m_dst(dst) {}
void visitBasicBlock(BasicBlock &BB) {
// -- evaluate all phi-nodes atomically. First read all incoming
// -- values, then update phi-nodes all together.
ExprVector ops;
auto curr = BB.begin();
if (!isa<PHINode>(curr))
return;
for (; PHINode *phi = dyn_cast<PHINode>(curr); ++curr) {
// skip phi nodes that are not tracked
if (!m_sem.isTracked(*phi))
continue;
const Value &v = *phi->getIncomingValueForBlock(&m_dst);
ops.push_back(lookup(v));
}
curr = BB.begin();
for (unsigned i = 0; isa<PHINode>(curr); ++curr) {
PHINode &phi = *cast<PHINode>(curr);
if (!m_sem.isTracked(phi))
continue;
Expr lhs = havoc(phi);
Expr act = GlobalConstraints ? trueE : m_activeLit;
Expr op0 = ops[i++];
side(lhs, op0);
}
}
}; // OpSemPhiVisitor
} // namespace
namespace seahorn {
Expr UfoOpSem::errorFlag(const BasicBlock &BB) {
// -- if BB belongs to a function that cannot fail, errorFlag is always false
if (m_canFail && !m_canFail->canFail(BB.getParent()))
return falseE;
return this->LegacyOperationalSemantics::errorFlag(BB);
}
Expr UfoOpSem::memStart(unsigned id) {
Expr sort = sort::intTy(m_efac);
return shadow_dsa::memStartVar(id, sort);
}
Expr UfoOpSem::memEnd(unsigned id) {
Expr sort = sort::intTy(m_efac);
return shadow_dsa::memEndVar(id, sort);
}
void UfoOpSem::exec(SymStore &s, const BasicBlock &bb, ExprVector &side,
Expr act) {
OpSemVisitor v(s, *this, side);
v.setActiveLit(act);
v.visit(const_cast<BasicBlock &>(bb));
v.resetActiveLit();
}
void UfoOpSem::execPhi(SymStore &s, const BasicBlock &bb,
const BasicBlock &from, ExprVector &side, Expr act) {
// act is ignored since phi node only introduces a definition
OpSemPhiVisitor v(s, *this, side, from);
v.setActiveLit(act);
v.visit(const_cast<BasicBlock &>(bb));
v.resetActiveLit();
}
Expr UfoOpSem::ptrArith(SymStore &s, GetElementPtrInst &gep) {
Value &base = *gep.getPointerOperand();
Expr res = lookup(s, base);
if (!res)
return res;
for (auto GTI = gep_type_begin(&gep), GTE = gep_type_end(&gep); GTI != GTE;
++GTI) {
if (const StructType *st = GTI.getStructTypeOrNull()) {
if (const ConstantInt *ci =
dyn_cast<const ConstantInt>(GTI.getOperand())) {
Expr off = mkTerm<expr::mpz_class>((unsigned long)fieldOff(st, ci->getZExtValue()), m_efac);
res = mk<PLUS>(res, off);
} else {
assert(false);
}
} else {
// otherwise we have a sequential type like an array or vector.
// Multiply the index by the size of the indexed type.
Expr sz = mkTerm<expr::mpz_class>((unsigned long)storageSize(GTI.getIndexedType()), m_efac);
res = mk<PLUS>(res, mk<MULT>(lookup(s, *GTI.getOperand()), sz));
}
}
return res;
}
unsigned UfoOpSem::storageSize(const llvm::Type *t) {
return m_td->getTypeStoreSize(const_cast<Type *>(t));
}
unsigned UfoOpSem::fieldOff(const StructType *t, unsigned field) {
return m_td->getStructLayout(const_cast<StructType *>(t))
->getElementOffset(field);
}
Expr UfoOpSem::symb(const Value &I) {
if (isa<UndefValue>(&I))
return Expr(0);
// assert (!isa<UndefValue>(&I));
// -- basic blocks are mapped to Bool constants
if (const BasicBlock *bb = dyn_cast<const BasicBlock>(&I))
return bind::boolConst(mkTerm<const BasicBlock *>(bb, m_efac));
// -- constants are mapped to values
if (const Constant *cv = dyn_cast<const Constant>(&I)) {
if (const ConstantInt *c = dyn_cast<const ConstantInt>(&I)) {
if (c->getType()->isIntegerTy(1))
return c->isOne() ? mk<TRUE>(m_efac) : mk<FALSE>(m_efac);
expr::mpz_class k = toMpz(c->getValue());
return mkTerm<expr::mpz_class>(k, m_efac);
} else if (cv->isNullValue() || isa<ConstantPointerNull>(&I))
return mkTerm<expr::mpz_class>(0UL, m_efac);
else if (const ConstantExpr *ce = dyn_cast<const ConstantExpr>(&I)) {
// -- if this is a cast, and not into a Boolean, strip it
// -- XXX handle Boolean casts if needed
if (ce->isCast() &&
(ce->getType()->isIntegerTy() || ce->getType()->isPointerTy()) &&
!ce->getType()->isIntegerTy(1))
{
if (const ConstantInt *val =
dyn_cast<const ConstantInt>(ce->getOperand(0))) {
expr::mpz_class k = toMpz(val->getValue());
return mkTerm<expr::mpz_class>(k, m_efac);
}
// -- strip cast
else
return symb(*ce->getOperand(0));
}
}
}
// -- everything else is mapped to a constant
Expr v = mkTerm<const Value *>(&I, m_efac);
const Value *scalar = nullptr;
if (isShadowMem(I, &scalar)) {
if (scalar)
// -- create a constant with the name v[scalar]
return bind::intConst(
op::array::select(v, mkTerm<const Value *>(scalar, m_efac)));
if (m_trackLvl >= MEM) {
Expr intTy = sort::intTy(m_efac);
Expr ty = sort::arrayTy(intTy, intTy);
return bind::mkConst(v, ty);
}
}
if (isTracked(I))
return I.getType()->isIntegerTy(1) ? bind::boolConst(v) : bind::intConst(v);
return Expr(0);
}
const Value &UfoOpSem::conc(Expr v) const {
assert(isOpX<FAPP>(v));
// name of the app
Expr u = bind::fname(v);
// name of the fdecl
u = bind::fname(u);
assert(isOpX<VALUE>(v));
return *getTerm<const Value *>(v);
}
bool UfoOpSem::isTracked(const Value &v) const {
const Value *scalar = nullptr;
if (isa<UndefValue>(v))
return false;
// -- shadow values represent memory regions
// -- only track them when memory is tracked
if (isShadowMem(v, &scalar))
return scalar != nullptr || m_trackLvl >= MEM;
// -- a pointer
if (v.getType()->isPointerTy()) {
// -- XXX A hack because shadow.mem generates not well formed
// -- bitcode that contains future references. A register that
// -- is defined later is used to name a shadow region in the
// -- beginning of the function. Perhaps there is a better
// -- solution. For now, we just do not track anything that came
// -- that way.
if (v.hasOneUse())
if (const CallInst *ci = dyn_cast<const CallInst>(*v.user_begin()))
if (const Function *fn = ci->getCalledFunction())
if (fn->getName().startswith("shadow.mem"))
return false;
return m_trackLvl >= PTR;
}
// -- always track integer registers
return v.getType()->isIntegerTy();
}
bool UfoOpSem::isAbstracted(const Function &fn) {
return (m_abs_funcs.count(&fn) > 0);
}
Expr UfoOpSem::lookup(SymStore &s, const Value &v) {
Expr u = symb(v);
// if u is defined it is either an fapp or a constant
if (u)
return bind::isFapp(u) ? s.read(u) : u;
return Expr(0);
}
void UfoOpSem::execEdg(SymStore &s, const BasicBlock &src,
const BasicBlock &dst, ExprVector &side) {
exec(s, src, side, trueE);
execBr(s, src, dst, side, trueE);
execPhi(s, dst, src, side, trueE);
// an edge into a basic block that does not return includes the block itself
const TerminatorInst *term = dst.getTerminator();
if (term && isa<const UnreachableInst>(term))
exec(s, dst, side, trueE);
}
void UfoOpSem::execBr(SymStore &s, const BasicBlock &src, const BasicBlock &dst,
ExprVector &side, Expr act) {
// the branch condition
if (const BranchInst *br = dyn_cast<const BranchInst>(src.getTerminator())) {
if (br->isConditional()) {
const Value &c = *br->getCondition();
if (const ConstantInt *ci = dyn_cast<const ConstantInt>(&c)) {
if ((ci->isOne() && br->getSuccessor(0) != &dst) ||
(ci->isZero() && br->getSuccessor(1) != &dst)) {
side.clear();
side.push_back(boolop::limp(act, s.read(errorFlag(src))));
}
} else if (Expr target = lookup(s, c)) {
Expr cond = br->getSuccessor(0) == &dst ? target : mk<NEG>(target);
cond = boolop::lor(s.read(errorFlag(src)), cond);
cond = boolop::limp(act, cond);
side.push_back(cond);
}
}
}
}
// internal function only for debugging (avoids duplication of code)
static void printCS(const CallSiteInfo &csi, const FunctionInfo &fi) {
errs() << "Call instruction: " << *csi.m_cs.getInstruction() << "\n";
errs() << "Caller: " << *csi.m_cs.getCaller() << "\n";
errs() << "Callee: " << *csi.m_cs.getCalledFunction() << "\n";
// errs () << "Sum predicate: " << *fi.sumPred << "\n";
errs() << "m_fparams.size: " << csi.m_fparams.size() << "\n";
errs() << "Domain size: " << bind::domainSz(fi.sumPred) << "\n";
errs() << "m_fparams\n";
for (auto r : csi.m_fparams)
errs() << *r << "\n";
errs() << "regions: " << fi.regions.size() << " args: " << fi.args.size()
<< " globals: " << fi.globals.size() << " ret: " << fi.ret << "\n";
errs() << "regions\n";
for (auto r : fi.regions)
errs() << *r << "\n";
errs() << "args\n";
for (auto r : fi.args)
errs() << *r << "\n";
errs() << "globals\n";
for (auto r : fi.globals)
errs() << *r << "\n";
if (fi.ret)
errs() << "ret: " << *fi.ret << "\n";
}
void UfoOpSem::execCallSite(CallSiteInfo &csi, ExprVector &side, SymStore &s) {
const FunctionInfo &fi = getFunctionInfo(*csi.m_cs.getCalledFunction());
Instruction &I = *csi.m_cs.getInstruction();
for (const Argument *arg : fi.args)
csi.m_fparams.push_back(
s.read(symb(*csi.m_cs.getArgument(arg->getArgNo()))));
for (const GlobalVariable *gv : fi.globals)
csi.m_fparams.push_back(s.read(symb(*gv)));
if (fi.ret)
csi.m_fparams.push_back(s.havoc(symb(I)));
LOG("arg_error", if (csi.m_fparams.size() !=
bind::domainSz(fi.sumPred)){printCS(csi, fi);});
assert(csi.m_fparams.size() == bind::domainSz(fi.sumPred));
side.push_back(bind::fapp(fi.sumPred, csi.m_fparams));
}
// ------------------------------------------------------------
// MemUfoOpSem
void MemUfoOpSem::execCallSite(CallSiteInfo &csi, ExprVector &side, SymStore &s) {
const FunctionInfo &fi = getFunctionInfo(*csi.m_cs.getCalledFunction());
GlobalAnalysis &ga = m_shadowDsa->getDsaAnalysis();
const Function *calleeF = csi.m_cs.getCalledFunction();
const Function *callerF = csi.m_cs.getCaller();
LOG("inter_mem", errs() << "callee: " << calleeF->getGlobalIdentifier();
errs() << " caller: " << callerF->getGlobalIdentifier(); errs() << "\n";);
if (!ga.hasSummaryGraph(*calleeF)) {
UfoOpSem::execCallSite(csi,side,s);
return;
}
processShadowMemsCallSite(csi);
CallSite &CS = csi.m_cs;
Graph &calleeG = ga.getSummaryGraph(*calleeF);
NodeSet &unsafeCallerNodes = m_preproc->getUnsafeCallerNodesCallSite(CS);
SimulationMapper &simMap = m_preproc->getSimulationCallSite(CS);
unsigned init_params = g_im_stats.m_params_copied; // for statistics
// generate literals that copy for arguments and global variables
// this needs to be done before generating the literal for the call
for (const Argument *arg : fi.args) {
Expr argE = s.read(symb(*CS.getArgument(arg->getArgNo())));
csi.m_fparams.push_back(argE);
if (calleeG.hasCell(*arg)) { // checking that the argument is a pointer
unsigned init_fields = g_im_stats.m_fields_copied;
VCgenArg(calleeG.getCell(*arg), argE, unsafeCallerNodes, simMap, side);
LOG("inter_mem_counters", g_im_stats.m_n_params++;
if (init_fields < g_im_stats.m_fields_copied)
g_im_stats.m_params_copied++;);
}
}
for (const GlobalVariable *gv : fi.globals) {
Expr argE = s.read(symb(*gv));
csi.m_fparams.push_back(argE);
if (calleeG.hasCell(*gv)) {
const Cell &c = calleeG.getCell(*gv);
if (!EnableUniqueScalars || !c.getNode()->getUniqueScalar()) {
unsigned init_fields = g_im_stats.m_fields_copied;
VCgenArg(calleeG.getCell(*gv), argE, unsafeCallerNodes, simMap, side);
LOG("inter_mem_counters", g_im_stats.m_n_gv++;
if (init_fields < g_im_stats.m_fields_copied)
g_im_stats.m_gv_copied++;);
}
}
}
LOG("inter_mem_counters", g_im_stats.m_n_callsites++;
if (init_params < g_im_stats.m_params_copied)
g_im_stats.m_callsites_copied++;);
Instruction &I = *csi.m_cs.getInstruction();
if (fi.ret) csi.m_fparams.push_back(s.havoc(symb(I)));
// place the new array name according to the literals generated for the copy
for (auto it : m_tmprep_out) {
const auto pair = it.getFirst();
Node *n = const_cast<Node *>(pair.first);
Cell c(n, pair.second);
Expr origInA = getOrigArraySymbol(c, ArrayOpt::IN);
Expr replaceOutA = it.getSecond();
LOG("inter_mem", errs() << "Replacing by "; replaceOutA->dump();
errs() << "\n");
for (int i = 3; i < csi.m_fparams.size(); i++) { // we can skip the first 3
if (csi.m_fparams[i] == origInA) {
side.push_back(mk<EQ>(csi.m_fparams[i + 1], replaceOutA));
auto it2 = m_rep_out.find(pair);
assert(it2 != m_rep_out.end());
csi.m_fparams[i + 1] = it2->getSecond();
i++;
break;
}
}
}
LOG("arg_error", if (csi.m_fparams.size() !=
bind::domainSz(fi.sumPred)){printCS(csi, fi);});
assert(csi.m_fparams.size() == bind::domainSz(fi.sumPred));
side.push_back(bind::fapp(fi.sumPred, csi.m_fparams));
// reset for the next callsite
m_orig_array_in.clear();
m_orig_array_out.clear();
m_rep_in.clear();
m_rep_out.clear();
m_tmprep_in.clear();
m_tmprep_out.clear();
}
Expr MemUfoOpSem::getOrigArraySymbol(const Cell &c, ArrayOpt ao) {
NodeIdMap *map;
if (ao == ArrayOpt::IN)
map = &m_orig_array_in;
else
map = &m_orig_array_out;
auto it = map->find({c.getNode(), getOffset(c)});
LOG("inter_mem", errs()
<< "--> getArraySymbol\n"
<< " " << c.getNode() << " " << getOffset(c) << "\n";);
assert(it != map->end()); // there should be an entry for that always
// LOG("inter_mem", it->getSecond()->dump(); errs() << "\n";);
return it->getSecond();
}
unsigned MemUfoOpSem::getOffset(const Cell &c) {
return m_shadowDsa->splitDsaNodes() ? c.getOffset() : 0;
}
void MemUfoOpSem::addCIArraySymbol(CallInst *CI, Expr A, ArrayOpt ao) {
auto opt_c = m_shadowDsa->getShadowMemCell(*CI);
assert(opt_c.hasValue());
addArraySymbol(opt_c.getValue(),A,ao);
}
void MemUfoOpSem::addArraySymbol(const Cell &c, Expr A, ArrayOpt ao) {
NodeIdMap *map;
if (ao == ArrayOpt::IN)
map = &m_orig_array_in;
else
map = &m_orig_array_out;
LOG("inter_mem", errs() << "<-- addArraySymbol "; A->dump();
errs() << "\n"
<< " " << c.getNode() << " " << getOffset(c) << "\n";);
map->insert({{c.getNode(), getOffset(c)}, A});
}
Expr MemUfoOpSem::createVariant(Expr origE) {
assert(bind::isArrayConst(origE));
Expr name = bind::fname(origE);
Expr rTy = bind::rangeTy(name);
return bind::mkConst(variant::variant(m_copy_count++, origE), rTy);
}
Expr MemUfoOpSem::getFreshArraySymbol(const Cell &c, ArrayOpt ao) {
NodeIdMap *map;
if (ao == ArrayOpt::IN)
map = &m_rep_in;
else
map = &m_rep_out;
auto it = map->find({c.getNode(), getOffset(c)});
if (it == map->end()) { // not copied yet
Expr origE = getOrigArraySymbol(c, ao);
Expr copyE = createVariant(origE);
map->insert({{c.getNode(), getOffset(c)}, copyE});
return copyE;
} else
return it->getSecond();
}
// Expr MemUfoOpSem::getCurrArraySymbol(const Cell &c, ArrayOpt ao) {
// NodeIdMap *map;
// if (ao == IN)
// map = &m_tmprep_in;
// else
// map = &m_tmprep_out;
// auto it = map->find({c.getNode(), getOffset(c)});
// assert(it == map->end());
// return it->getSecond();
// }
void MemUfoOpSem::newTmpArraySymbol(const Cell &c, Expr &currE, Expr &newE,
ArrayOpt ao) {
NodeIdMap *map;
if (ao == ArrayOpt::IN)
map = &m_tmprep_in;
else
map = &m_tmprep_out;
Expr origE = getOrigArraySymbol(c, ArrayOpt::IN);
newE = createVariant(origE);
auto it = map->find({c.getNode(), getOffset(c)});
if (it == map->end()) {
if (ao == ArrayOpt::IN) { // for the in arrays we need an empty array
currE = newE;
newE = createVariant(origE);
} else {
currE = origE;
}
map->insert({{c.getNode(), getOffset(c)}, newE});
} else {
currE = it->getSecond();
map->erase({c.getNode(), getOffset(c)});
map->insert({{c.getNode(), getOffset(c)}, newE});
}
}
void MemUfoOpSem::VCgenArg(const Cell &c_arg_callee, Expr base_ptr,
NodeSet &unsafeCallerNodes,
SimulationMapper &sm, ExprVector &side) {
NodeSet explored;
recVCGenMem(c_arg_callee, base_ptr, unsafeCallerNodes, sm, explored,
side);
}
void MemUfoOpSem::recVCGenMem(const Cell &c_callee, Expr ptr,
NodeSet &unsafeNodes, SimulationMapper &simMap,
NodeSet &explored, ExprVector &side) {
const Node *n_callee = c_callee.getNode();
explored.insert(n_callee);
if (n_callee->size() == 0)
// the array was created but from the bu graph we know that it is not
// accessed
return;
const Cell &c_caller = simMap.get(c_callee);
const Node *n_caller = c_caller.getNode();
if (n_callee->isArray()) {
LOG("inter_mem_counters", g_im_stats.m_node_array++;);
return;
}
LOG("inter_mem_counters",
if (n_callee->isOffsetCollapsed()) g_im_stats.m_node_ocollapsed++;);
// checking modification in the bu graph, which is more precise
// than the previous approach
if (n_callee->isModified() && !c_callee.getNode()->types().empty() &&
m_preproc->isSafeNode(unsafeNodes, n_caller)) {
for (auto field : c_callee.getNode()->types()) {
unsigned offset = field.getFirst();
Cell c_caller_field(c_caller, offset);
// create a new name for that array if it was not created
Expr copyA = getFreshArraySymbol(c_caller_field, ArrayOpt::OUT);
Expr tmpA = nullptr, nextA = nullptr;
newTmpArraySymbol(c_caller_field, tmpA, nextA, ArrayOpt::OUT);
Expr e_offset = mkTerm<expr::mpz_class>(offset, m_efac);
Expr dirE = mk<PLUS>(ptr, e_offset);
tmpA = mk<STORE>(tmpA, dirE, mk<SELECT>(copyA, dirE));
side.push_back(mk<EQ>(nextA, tmpA));
LOG("inter_mem_counters", g_im_stats.m_fields_copied++;);
}
}
LOG(
"inter_mem_counters", if (!m_preproc->isSafeNode(unsafeNodes, n_caller)) {
g_im_stats.m_node_unsafe++;
});
if (n_callee->getLinks().empty())
return;
// follow the pointers of the node
for (auto &links : n_callee->getLinks()) {
const Field &f = links.first;
const Cell &next_c = *links.second;
const Node *next_n = next_c.getNode();
// obtain the name of the array that represents the field
Expr origA = getOrigArraySymbol(Cell(c_caller, f.getOffset()), ArrayOpt::IN);
if (explored.find(next_n) == explored.end()) { // not explored yet
Expr offset = mkTerm<expr::mpz_class>(f.getOffset(), m_efac);
Expr next_ptr = mk<SELECT>(origA, mk<PLUS>(ptr, offset));
// TODO: missing copy read
recVCGenMem(next_c, next_ptr, unsafeNodes, simMap, explored, side);
}
}
}
// stores the name(s) of the array(s) that represents every cell involved in the
// CallSite
void MemUfoOpSem::processShadowMemsCallSite(CallSiteInfo &csi){
unsigned i = csi.m_fparams.size() - 1;
Instruction *I = csi.m_cs.getInstruction()->getPrevNode();
// traversing backwards the "shadow.mem.arg." annotations
while (I != nullptr) {
CallInst * ci = nullptr;
ci = dyn_cast<CallInst>(I);
if (ci == nullptr)
break;
Function * f_callee = ci->getCalledFunction();
if (f_callee->getName().equals("shadow.mem.arg.ref"))
addCIArraySymbol(ci, csi.m_fparams[i], ArrayOpt::IN);
else if (f_callee->getName().equals("shadow.mem.arg.mod")){
addCIArraySymbol(ci, csi.m_fparams[i], ArrayOpt::OUT);
i--;
addCIArraySymbol(ci, csi.m_fparams[i], ArrayOpt::IN);
}
else if (f_callee->getName().equals("shadow.mem.arg.new"))
addCIArraySymbol(ci, csi.m_fparams[i], ArrayOpt::IN);
else
break;
I = I->getPrevNode();
i--;
}
}
void InterMemStats::print() {
outs() << "BRUNCH_STAT "
<< "NumParams"
<< " " << m_n_params << "\n";
outs() << "BRUNCH_STAT "
<< "NumCallSites"
<< " " << m_n_callsites << "\n";
outs() << "BRUNCH_STAT "
<< "NumGlobalV"
<< " " << m_n_gv << "\n";
outs() << "BRUNCH_STAT "
<< "NumCopiedBytes"
<< " " << m_fields_copied << "\n";
outs() << "BRUNCH_STAT "
<< "NumCopiedParams"
<< " " << m_params_copied << "\n";
outs() << "BRUNCH_STAT "
<< "NumCopiedGlobalV"
<< " " << m_gv_copied << "\n";
outs() << "BRUNCH_STAT "
<< "NumCopiedCallSites"
<< " " << m_callsites_copied << "\n";
outs() << "BRUNCH_STAT "
<< "NumCalleeArrayNodes"
<< " " << m_node_array << "\n";
outs() << "BRUNCH_STAT "
<< "NumCalleeOffsetCollapsedNodes"
<< " " << m_node_ocollapsed << "\n";
outs() << "BRUNCH_STAT "
<< "NumCalleeUnsafeNodes"
<< " " << m_node_unsafe << "\n";
}
void InterMemStats::copyTo(InterMemStats &ims) {
ims.m_n_params = m_n_params;
ims.m_n_callsites = m_n_callsites;
ims.m_n_gv = m_n_gv;
ims.m_fields_copied = m_fields_copied;
ims.m_params_copied = m_params_copied;
ims.m_gv_copied = m_gv_copied;
ims.m_callsites_copied = m_callsites_copied;
ims.m_node_array = m_node_array;
ims.m_node_ocollapsed = m_node_ocollapsed;
ims.m_node_unsafe = m_node_unsafe;
}
} // namespace seahorn
| 2024-05-22T01:26:29.851802 | https://example.com/article/3491 |
The perverse attitude toward reality.
Freud's (1940a) tentative distinction between the defensive maneuvers in neurosis and those in perversion can be extended to good clinical effect. In general, neurotic defenses may be thought of as directed against wishes, whereas perverse defenses are directed against perceived reality. It is suggested that the perverse approach to reality is not limited to frank sexual perversions; it defines a class of operations that involve taking certain liberties with reality. Clinical material is used to demonstrate the perverse attitude and some of its implications for technique. The role of the superego is considered. | 2023-09-03T01:26:29.851802 | https://example.com/article/8696 |
Limitations that have been experienced with the growth of services in many of the professions, trades and industries can be attributed to the expansion of remote or distributed field activities, such as situation/location assessments, estimates or appraisals. New technology and less experienced personnel may be undertaking the initial tasks of customer interaction, sales, data collection and/or the analysis and troubleshooting of problems in the field. Personnel in field are usually required to collect data regarding a field situation that is generally be used later by more senior, experienced and/or responsible personnel to make decisions (business, technical, administrative and/or political). Even the most experienced professionals may find themselves lacking access to critical information or support that would be helpful in undertaking field operations. Efficiency in the remote dispatching of personnel given personnel vs. customer or field locations, as well as asset and inventory control can also be improved.
As an example of a field situation, individuals in the construction industry are often responsible for carrying out field assessments and providing estimates. The consequences of under bidding a project in the construction field can be very costly and/or can affect performance and quality of services/activities related to the underbid project. In cases where a project cost estimate, or bid, must be provided for a construction project, a business owner or senior journeymen can oftentimes be compelled to personally go to the field and collect information regarding a project in order to render a realistic and profitable bid because an inexperienced estimator might render an inaccurate appraisal. Construction project estimates require an accurate assessment and analysis of a job-site/projects in order to develop the data/facts necessary for an estimate to be rendered regarding use of labor, materials and completion time for a project.
If an operator in the field was provided with guidance, access to supplemental information and/or years of experience (e.g., lessons learned by senior personnel), field operations might proceed more accurately and professionally. Field operators, however, are unlikely to have reasonable means to efficiently access the information or the information can not be updated. Materials typically used in the field can include reference materials such as codes, regulations, inventory and price lists.
Personal digital assistant (PDA) is a generic name used for a device belonging to a family of portable handheld data managing devices well known in the art. Another word used to refer to such devices is the word “Smartphone.” Currently, handheld data management devices such as PDAs or Palm PCs can have as much computing power as desktop personal computers and can be used in a wide variety of applications, including wireless communication (infrared and radio frequency), GPS (global positioning system) mapping, Internet access and database storage. Web-phones are also being introduced into the wireless marketplaces that have PDA-like capabilities.
Handheld data management devices are generally enabled with wireless connectivity to data sources over, for example, the connection-oriented Transmission Control Protocol/Internet Protocol (TCP/IP) or message oriented TME/X protocol. Cellular Digital Packet Data (CDPD) is a TCP/IP based technology that supports Point-to-Point Protocol (PPP) or Serial Line Internet Protocol (SLIP) wireless connections to mobile devices. Cellular service is generally available throughout the world from major service providers. With CDPD, data can be transferred over switched Public Switched telephone Network (PSTN) circuits or packet-switched networks. Global System for Mobile Communication (GSM) and Personal Communications Systems (PCS) networks operate in the 800 MHz, 900 MHz, and 1900 MHz range. PCS provides narrowband digital communications in the 900 MHz range for paging, and broadband digital communications in the 1900 MHz band for cellular telephone service. In the U.S. as of the priority date for the present embodiments, PCS 1900 is identical to GSM 1900. GSM operates in the 900 MHz, 1800-1900 MHz frequency bands. GSM 1800 is widely used throughout Europe and throughout many parts of the world. In the U.S., GSM 1900 is the same as PCS 1900; thus, these two technologies are compatible.
The Code Division Multiple Access (CDMA) network is a digital wireless network that defines how a single channel can be segmented into multiple channels using a pseudo random signal (or code) to identify each user's information. Because CDMA spreads each call over more than 4.4 trillion channels across the entire frequency band, it is more immune to interference than TDMA or other current wireless networks and can support more users per channel in some situations. Time Division Multiple Access (TDMA) cellular/wireless systems are currently deployed throughout the wireless communication markets. Wideband CDMA (W-CDMA), which is called CDMA 2000 in North America, will be implemented in the U.S.A. in the near future. W-CDMA is a true 3G wireless technology. W-CDMA increases transfer rates by using multiple 1.25 MHz cellular channels compared to the single channel currently used by CDMA 1.
The General Packet Radio Service (GPRS) network is a 2.5G technology that bridges the gap between the current wireless technologies and the next generation of wireless technologies known as 3G wireless technologies. GPRS is a packet-data transmission technology. GPRS will work with CDMA and TDMA, and it supports X.25 and IP communications protocols. It will also enable features like Voice over IP (VOIP) and multimedia services. Bluetooth is a Personal Area Network (PAN) technology. Adopted by a consortium of wireless equipment manufacturers called the Bluetooth Special Interest Group (BSIG), it is emerging as a global standard for low cost wireless data and voice communication. The current specification for this standard is the 2.4 GHz ISM frequency band.
Bluetooth technology is based on a short-range radio transmitter/receiver built into small application specific circuits (ASICs) and embedded into support devices. Initially, Bluetooth enabled devices will have 1 mw of transmitter power and will be capable of asymmetrical data transfers of up to 721 Mbps over distances of 10 M. The Bluetooth specification permits up to 100 mw of power, which will increase the range to 100 M. In addition, it can support up to three voice channels. Using short data packets and frequency hopping of up to 1600 hops per second, it is a true 3G wireless technology that will enable a host of new applications and possibilities for wireless data communication. Wireless application protocol (WAP) and Extensible Markup Language (XML) are examples of current technology being used in wireless devices and system to provide Web-based (Internet) content on wireless devices.
Despite the growing power and popularity of portable data management devices and the diverse telecommunications alternatives for data communication, few applications were available as of September 2000 (the priority date for the embodiments herein) that directly relate to interactive or industry-specific programs providing management of associated data and providing users with access to daily business practices and procedures related to a particular industry.
As of the priority date of the present embodiments (Sep. 18, 2000), what was, and continue to be, needed in business, government and industry where field operators are utilized is a system and method for managing assets in the field via wireless handheld devices. Systems were, and remain, needed by businesses that could enable their field operators (e.g., users, operators, estimators, investigators, salesmen, and the like) to more efficiently and accurately operate in the field. | 2024-01-04T01:26:29.851802 | https://example.com/article/3032 |
Electric Car Charging Is Misunderstood By Non-EV Drivers
July 4th, 2018 by Cynthia Shahan
A new report from the UK notes that an “impatience barrier” with regard to electric vehicle charging could be due to a major misconception around how electric cars will be charged.
“Fast” is not always the way to longevity or positive health outcomes. I hope we do some shifting in all directions back to a more naturalistic flow, naturalistic life. Maybe EV life could help with that?
“Fast food” leads to more heart disease, and worse things than that, it shortens one’s life and one’s quality of life. Filling up at gas stations is “faster” than charging a car, but it involves inhaling particulates and other cancer-causing pollution that might take years off your life — and that doesn’t even capture the point that you don’t have to stand next to the car as it charges, like you do while filling up a gas tank. Rather than standing at a gas station once a week, you can enjoy the fresher air of a park next to a charging station and a walk that improves heart health.
Apparently, all of this additional info and context is something not often known or considered by non-EV drivers.
My experiences with no home charging and time are straightforward. It’s simply not that big of a deal — although, some basic adjustments must take place. I’m fortunate in that I like to exercise regularly. I like to read regularly. One has more daily time for these two top activities while charging outside the home. If you are a social media person — you will be charged before you know it while scrolling your Instagram, Twitter, or other social media feeds.
If people are considering this time charging as a negative issue compared to a smelly refuel at a gas station, the question is how to help them to learn that there is no comparison in terms of opportunity for better health with a 30-minute walk while charging. One is blind to the future, because as with many lifestyle changes, one cannot see the other side of change until the transition is complete. It reminds me of the surveys of people done before and after pedestrian pathways were added to previously automobile streets. Many people resisted, but then found added refreshment, improved health, and more freedom/happiness from the changes.
Many chargers in my area are walkable and friendly to pedestrian life while charging. There are also plenty at the malls these days — if walking inside is your preference. We can reset our state of being in the world and drop the assumption that the particulates at the local gas station are a normal part of life. Perhaps it is simply seeing more and more EVs charging that will bring the mass market to this consciousness.
I’ll admit that it could be a different kind of experience for me if I did not live in an EV charging friendly city. If I worked at a place far from chargers and had tight work schedules, the issue might take more changes in my daily life. I believe charging would still be possible and inconveniences met, but it does depend on charger availability.
I am a person more inclined to be outdoors than not. I enjoy walking while I charge. I enjoy visiting a library or food store to shop while charging. I find my charging time offers that impetus to walk, keeping my brain functioning better in car-oriented Florida. Is that for everybody? Maybe not, but it would probably help a lot of the population to enjoy these benefits of EV life as well.
Back to the new study, the findings are based on the results of an online survey of 2,004 UK adults (18+) conducted by Opinium. This took place from the 27th to the 29th of March 2018. The full report can be found here: Is the UK ready for electric cars?
Impatience with electric car charging puts drivers off, but perception is based on false assumptions.
“New research from Baringa Partners shows that people may be put off buying electric cars because they don’t want to wait more than a quarter of an hour to charge them when out and about. The specialist energy consultancy is warning that this impatience may require the Government, charging infrastructure providers and car manufacturers to launch a public awareness campaign about when and how owners of electric cars are likely to charge their vehicles,” a press release about Baringa’s new report states.
“[M]ore than a third (36%) of people say that the battery taking too long to recharge is a key reason not to consider buying a 100% electric car. On average, people say they are willing to wait a maximum of just 13 minutes to fully charge an electric car at a service station. This is far shorter than the 50 minutes it typically takes a standard 50kW rapid charging point, and more in line with what would be possible from a 350kW ultra-rapid charging point.
“However, the report notes that this impatience barrier could be due to a major misconception around how electric cars will be charged. Just under half (48%) of people say they are unlikely to buy a 100% electric car because they are concerned about not being able to travel far enough with one charge to reach the next charging point. But the average car journey in the UK is just 8.7 miles and most existing 100% electric cars have a range of around 100 miles, with newer models able to travel even further on one charge. This means that the majority of electric car journeys could be completed without the need to recharge.”
Oliver Rix, Partner in Energy & Resources at Baringa Partners, comments: “Concerns about charging are often cited as a barrier to further growth of the electric car market, and our research shows that there is considerable work to be done.
“As a first step, the Government, charging infrastructure providers and car manufacturers urgently need to work together to correct the misconception drivers seem to have about how reliant they will be on public charging infrastructure. Most journeys are far shorter than the average range of an electric car, so there will be little need to charge at service stations or other public stopping points. Instead, the majority of people will charge their cars at home most of the time.”
That’s not to say more and better EV charging infrastructure isn’t needed. There is much development to be done in the public EV charging arena. In particular, along with a working group of EV charging execs and experts, we have gone through the process of creating EV charging guidelines for cities (with a particular focus on Europe, but applicable widely).
Take those EV charging guidelines to your city decision-makers, local shopping centers, and so on to improve Ev charging access and quality in your area. But perhaps more importantly, get involved in an EV awareness raising effort in your area — or start one!
Appreciate CleanTechnica’s originality? Consider becoming a CleanTechnica member, supporter, or ambassador — or a patron on Patreon.
Sign up for our free daily newsletter or weekly newsletter to never miss a story.
Have a tip for CleanTechnica, want to advertise, or want to suggest a guest for our CleanTech Talk podcast? Contact us here.
Latest Cleantech Talk Episode | 2023-12-02T01:26:29.851802 | https://example.com/article/9505 |
Make Up Your Mind
( Originally Published 1950 )
NOTHING MUCH WORTH WHILE is accomplished without positive decision supported by positive action. Your daily life and career are largely ruled by your own decisions or lack of decision, your own action or a willingness to procrastinate and let your decisions go by default. Millions of our fellows are this very day being pushed around in their own timid half world of gentle passivity because they can't make up their minds. Millions are in or are bordering on a state of abulia. This word, concocted from Greek words meaning without and advice, defines a form of mental derangement in which the will power is lost or impaired.
Mrs. Abulia Jigglesteps spends ten days trying to decide whether to get a new dress. She talks it over with Mr. Jigglesteps and calls some of her friends on the telephone to discuss the matter. Finally, after burning hot and turning cold a score of times, she arrives at the Downtown Frockerie. Now she is in a funk. She tries on a dozen cockeyed little numbers. She goes to a half-dozen other shops but simply can't decide whether to get the one with monkey fur on the shoulder or the one with a cluster of wax fruit. She goes home exhausted, talks it over by telephone with her friend Minnie, who votes for the fruit instead of the monkey fur. She talks it over with Mr. Jigglesteps, who finally takes her by the hand and forces her to get delivery of a little adornment that makes her look something less than a buxom model for one of Helen Hokinson's cartoons. Ah. Now her decision has gone by default. But has it? The dress—and it really is a cute little number—is now modeled for Minnie and other friends. They simply adore it. But in a day or two Mrs. Jigglesteps sends it back to the store and wears last year's black with gold—well, almost gold —ornaments.
Now, this is only one incident in the indecisive life of Mrs. Jigglesteps. She has a difficult time deciding whether to order lamb chops or kidney for good old Jigglesteps' dinner. When she leaves the house to go to the matinee—selected by someone else—she returns to the door two or three times to make sure she locked it. Then she is miserable as she watches beautiful Madeleine Carroll try to make up her mind as to which man she is going to marry in Goodbye My Fancy. You see, Mrs. Jigglesteps can't decide whether or not she turned off the gas before leaving the house either locked or unlocked. One wonders how she ever made up her mind to marry that Jigglesteps boy from next door. It must have been a primitive urge entirely beyond her power. Her life would be revolutionized if she would acquire the habit of making decisions with reasonable dispatch. An exaggeration? No. There are millions like her.
Then there is Mr. Wobbletop. Good old Wobbly. Some years ago he couldn't decide whether to take that newspaper job he really thought he wanted or go behind the wicket in Papa Wobbletop's bank. Papa decided that for him, and he went to work in the bank. Wobbly loved Judy, but it was Ellie who married him. Ellie decided that she wanted him and made up his mind for him in a way that some women have.
Wobbly is a good sort, but he simply can't come to a decision, right or wrong, and stick to it. Here he is in a world he never made, working unhappily on a job Papa picked for him, and married to Ellie, who is a fine girl but not the one he really wanted. Three times he has had a chance to shift from the bank to the newspaper, but one of these times Papa made the decision for him, and he didn't move. The other two times Ellie, who likes the idea of being married to a banker, made the decision for him. Wobbly is stuck until he learns how to make decisions.
Such indecision is one of life's deadliest poisoners. It is prompted by doubts and fears and careless indifference. As it is practiced, it piles up frustrations that can ruin a life. The person suffering from inability to make up his mind is tripped up by a host of negative practices that work against him. One of the worst of these is procrastination, the putting off of decisions, the ducking and dodging that exercises indecision's biceps. The indecisive let their decisions be made for them by default instead of by their own positive control.
The indecisive person is afraid that he may be proved wrong. He may make a mistake. So what of it? Everyone makes mistakes sometimes. The leader, the executive, thrives on making decisions. He became an executive because he was capable of making decisions while others dodged the issue. Yet the executive has been rather accurately defined as one who makes decisions and is sometimes right. It is more than that however—he has a good batting average of correct decisions. The underlings and the unhappy ones in any field are those who avoid or unduly delay making decisions because of a fear of error or responsibility. Can you imagine a Lincoln who couldn't make up his mind? A vacillating General Eisenhower?
Suppose you do make mistakes sometimes. Suppose you are dead wrong. No one is always right. The good fruit of life goes to those who make decisions, who act upon them, and who ask for what they believe they and their followers are entitled to.
Even the famous make errors. But fear of being wrong a part of the time doesn't make them negative thinkers. Sir Isaac Newton, the famous scientist, was frequently wrong, but he was right often enough to make notable contributions to the world. Suppose Sir Isaac had been stopped by such incidents as this: He had been seated by his roaring fireplace, absorbed in thought. The heat became intense. He rang violently for a servant. Protesting that he was being roasted, Newton ordered removal of the grate. "Wouldn't it be better for you to move your chair?" the servant quietly suggested. "Upon my word," exclaimed Sir Isaac, "I never thought of that." Obviously he wasn't brilliant all the time.
There is the tale of the tussle Ralph Waldo Emerson and his son had with an obstinate calf. The Emersons wanted the calf in the barn and tugged and pulled. The calf spread out its legs and resisted stubbornly. A maid, observing that the great mind of Emerson seemed unequal to the situation, put her finger in the calf's mouth and backed into the barn with the calf sucking and following.
The negative-minded person makes mistakes and thereafter may make as few decisions as possible. The positive person brushes mistakes aside and goes on making his decisions, learning by experience to make fewer errors.
Testimony regarding the serious results of indecision is offered by Dr. Lydia Giberson, industrial psychiatrist of the Metropolitan Life Insurance Company. She has helped employees of many large corporations in attacking and solving their personal problems.
"Basically, worry has its roots in indecision," says Dr. Giberson. "We worry about money matters because we're uncertain as to just where we stand. We worry about uncompleted tasks because we can't decide which one to tackle first. We worry about suspected illness because we can't bring ourselves to see a doctor. Chronic indecision reaches a climax in frustration. And the end-product of frustration is a nervous breakdown "
Persons suffering from nervous indecision to the point that they have virtually immobilized their will should have their family physician recommend a competent psychologist or psychiatrist to assist in a careful analysis of causes. There may well be deep-seated causes, and if these are revealed and explained, a cure may be effective.
Dr. Louis E. Bisch, New York psychiatrist and author, cites the case of a woman of his acquaintance who can never be sure that she has turned off the gas stove or unplugged the electric iron or toaster. Once the doubt arises in her mind she has to go back and verify.
"I was on my way to Philadelphia," this woman told him. "I began thinking of the apartment and finally, of course, the gas. I became increasingly anxious. By the time I reached Trenton I could see the house in flames with people jumping from the windows, all because of my carelessness. I simply had to leave the train and return to New York."
Dr. Bisch explains that thwarted wishing was responsible for the woman's indecision about gas stoves and electric appliances. "Note that all such apparatus can cause a fire," he said, "also the subject's imagining an actual fire. As you may have guessed already, she was a spinster. Fire almost invariably stands for love and sex. Here the sex instinct, unable to express itself, found a vicarious wish outlet in playing with fire mentally; setting fire to a building instead of a man's heart. Inhibitory factors, of course, repressed the wish; the downward and upward pressures causing vacillation of emotion, the doubt and uncertainty, the inability to make up her mind."
For every complicated case such as the ones cited there are a multitude of indecisive folk who suffer from much milder fear or frustration-born doubts that balk decisions. They may have been overdominated by parents and teachers and others in childhood and may simply lack practice in making up their minds. With these latter, indecision has become a habit that can be broken by a bit of self-analysis and the practicing of a different habit.
If you are indecisive and plan to do something about it, you can take immediate comfort in the fact that indecision is not necessarily due to ignorance and slow thinking. On the contrary it is often thinking of so many things and consideration of so many doubts that result in the difficulty to reach and act on a simple decision. The more intelligent you are, the more you may be inclined to consider rapidly many factors before making a decision. If you were feeble-minded, you would have little or no difficulty, for you wouldn't be able to think of a variety of possible consequences. Your difficulty may be that you have acquired the habit of applying to a multitude of little, unimportant things the same serious consideration you might advisedly give to vital matters.
In every walk of life it is the man or the woman of decision who leads; and yet there is no magic in making decisions. The formula to follow is very simple. It is the formula used by the business executive, the army officer, the physician, the social leader, the neighbor next door, the politician, the butcher, the artist, the candlestick maker. But invariably the outstanding person in any field is one who has made a regular practice of using the simple formula in his daily life, using it positively, constructively.
The formula for making decisions is already yours. You have seen it operate. You have used it unconsciously on occasion or have used it consciously, but perhaps not regularly, until it is almost automatic. Your attention is called to it again. It is worth noting down on a card and carrying in the pocket or handbag as a reminder reference. With some slight variations it provides the base of decisions in all walks of life.
1. What are you trying to accomplish?
2. What are the pertinent facts?
3. What are the possible courses of action?
4. Which course of action will come closest to accomplishing your desire?
5. What are you going to do about it, and when?
This isn't merely the author's formula. It is a universal formula. It's yours if you want it. I have used it in making decisions for the founding and administration of several enterprises. I have used it successfully in helping others to solve their problems.
You may not deliberately use this five-point formula in making minor decisions, but you use part or all of it whether you realize it or not. But when you have a really important decision to make, it is well to use it thoroughly, even to the point of briefing on paper the answers to each of the questions. Let's consider these questions in more detail.
What are you trying to accomplish? If you don't answer this question quite specifically, you are certain to be adrift in a vague realm of uncertainty and can't come to any very logical conclusion. Success begins with definiteness of purpose. If you have a problem, you should define that problem as clearly as possible in your mind or on paper. Having defined the problem, just what is your purpose? What are you trying to accomplish? Just what is your objective? As you mull over this question, keep your mind on your objective! The further your mind strays from your objective, the more difficult and uncertain your decision will be. If your decision is of high importance to you and yours and your future and you have difficulty in crystallizing your objective, go to competent advisers for assistance in considering the problem. They may help you to gain a focus that is badly needed. But be sure you go to a competent adviser. Uncle Joe may be a grand and sympathetic person, but is he competent to advise on this particular question? Your family doctor may give sound advice on health problems but crazy counsel on finances or real estate.
What are the pertinent facts? Easy as this may seem, you should realize that, if you have only a part of the facts and some of these are faulty, your decision may well be a faulty one. It is not always possible to get all the facts, but you should fight for all the available facts. You can get them from interviews, from books, by writing letters to proper sources. You can't make a truly sound decision without adequate data. Facts exist and are true and subject to checking.
The corner grocer selling his property may state, "As a matter of fact I did a $75,000 business last year and made a net profit of $10,000." That is simply his statement. What is the fact? His books may show that the facts are he did a $50,000 business and lost his last prune. When you are gunning for facts, don't waste any shots at opinions, rumors, guesses. There are still people in this country who have the opinion that the world is flat; there are fine folk who don't hesitate to relay rumor and make sweeping guesses. What are the facts that give you the true picture? And whatever you do, park your emotions outside when you go in to examine facts. Emotions can snarl up a set of facts like the backlash of a line on a faulty reel.
What are the possible courses of action? You have decided what you want to accomplish. You have assembled the available pertinent facts. Now, as you consider your problem, you may jump to or deliberately reach the conclusion that there is only one course of action open. You may be right, but make sure that you have carefully considered the possible alternatives. There is usually more than one road leading to New York or Rome or your own particular land of heart's desire. One road may be more direct and the hardest; another may be longer but with more happiness to be had along the way. An hour, a day, or a week spent in outlining on paper the possible courses of action may save you later loss and expenditure of fruitless months or years.
What are you going to do about it? Now you have really come to the main point of the exercises. It is here that the negative-minded folk are so often lost by the wayside. You may reach a decision, but if you don't back it up with positive action, you might as well never have made any decision at all. And when are you going to take positive action? The matter of timing is vital. Perhaps your analysis dictates delay. But here is a warning signal. It is here that the procrastinators put off action and miss the boat because they are negatively afraid of decision and action. They make excuses for delay. They rationalize inaction. They are afraid of the cars. They are the negatives who trail instead of lead.
The foregoing program should be used deliberately and surely in making important decisions, but it isn't necessary for. many minor decisions in our daily lives. A child and many an adult can put in five minutes deciding whether to have red pop or white. What does it really matter? The important thing at the moment is to take one or the other if pop is wanted.
Much of indecision is due to a faulty habit that can be corrected with practice. Many of the most decisive persons you know have simply acquired a habit of making up their minds quickly, particularly on unimportant matters. A city editor on a daily newspaper is forced each day to make scores and hundreds of quick decisions until it is an automatic process. A good executive is daily called upon to make decisions, and many of them quite automatically. He won't be correct all the time, but he will maintain a good batting average.
The one best way to learn to be decisive is to practice being decisive. Here are a few exercises to be practiced whenever the opportunity arises, and that is daily or many times daily:
Welcome every reasonable opportunity to say "Yes" instead of "No."
Grasp every possible opportunity to decide positively.
Instead of debating whether to take a walk or stay home by the fireside, decide immediately and abide by your decision.
Instead of pondering whether to serve chops or steak, make up your mind immediately. You'll have to make a decision anyhow. Why make it a ponderous problem?
When Pop is asked whether he would rather have cold roast or hash, he shouldn't pass the buck by saying "Either." He should make his choice and give the little woman a break.
You have a choice of three motion pictures for the evening? It is better to close your eyes and make an immediate blind choice and be disappointed than to go on into a ten-minute quandary that exercises and makes stronger your inability to make up your mind.
The next time you buy a hat or a tie, weigh the choices rapidly, and make your selection in double-quick time. It is better to make minor mistakes than constantly rehearse indecision. There is no merit in dillydallying over most matters. Even in reading, the fast reader comprehends more than the slow reader. In my offices and probably in all offices the people who decide quickly and early when they want their vacation periods get the best times. The ones who can't make up their minds take what is left.
Search for little ways in your own daily life in which you can make a fast decision; make it; then act on it. Interrupt your deadly little routines. How about that letter to Aunt Sally—the one you have owed so long? Stop right here. Write it now, and you'll have done one little positive act that may make the next positive act easier.
Make a game of being decisive, and try to play it all day long. If you will do this steadily, you should gain a feeling of being rewarded and encouraged to continue until you, too, have acquired a more positive attitude and broken through the cobwebs of indecisiveness and procrastination. | 2024-07-18T01:26:29.851802 | https://example.com/article/4255 |
Q:
SQL Server : concatenation and sum totals from tables
This is my first stored procedure, not sure what I am doing. Maybe you can teach me something.
I am trying to create a procedure called SPGET_CUSTOMER_BILL and it is supposed to bring up the name of the customer concatenated first name and last name along with the sum of numbers from 2 different tables which would be their total bill.
I have these 4 tables:
SALON_CUSTOMER: CUST_ID, STY_ID, LAST_NAME, FIRST_NAME
APPOINTMENT: APPT_TIME, CUST_ID, STY_ID, SERVICE_ID, PROD_NUM
PRODUCT: PROD_NUM, PROD_TYPE, PROD_NAME, PROD_VENDOR, PRICE
SERVICE_: SERVICE_ID, SERVICE_DESC, EST_TIME, PRICE
What I need to do is sum the PRICE from PRODUCT table and the PRICE from the SERVICE_ table for each appointment/customer and list that along with their first and last name concatenated in the first column.
Here is what the result needs to look like:
CUSTOMER_NAME TOTAL_BILL
-----------------------------
JOHN DOE 45.64
JANE DOE 52.64
I am probably way off, but here is my code right now, its pretty jumbled by now I've been messing around with it too much.
CREATE PROCEDURE SPGET_CUSTOMER_BILL
AS
SELECT
RTRIM(FIRST_NAME) + ' ' + RTRIM(LAST_NAME) AS CUSTOMER_NAME,
SUM(ISNULL(P.PRICE, 0) = ISNULL(S.PRICE, 0) TOTAL_BILL
FROM
APPOINTMENT A
INNER JOIN
SALON_CUSTOMER ON SALON_CUSTOMER.CUST_ID = A.CUST_ID
INNER JOIN
PRODUCT P ON A.PROD_NUM = P.PROD_NUM
INNER JOIN
SERVICE_ S ON S.SERVICE_ID = A.SERVICE_ID;
If I split them up, they work fine. I just can't get them to work together. If you could teach me a little something about what i am doing wrong it would be greatly appreciated. thank you.
A:
Without understanding your data, (assuming your logic and joins are correct) it looks like you just need to group by the computed customer name go get the totals. This will return all customers - you might want to add a CustomerId parameter to the PROC and then add a WHERE filter to it?
CREATE PROCEDURE dbo.SPGET_CUSTOMER_BILL
AS
SELECT RTRIM(FIRST_NAME) + ' ' + RTRIM(LAST_NAME) AS CUSTOMER_NAME,
SUM(ISNULL(P.PRICE, 0)) TOTAL_BILL
FROM APPOINTMENT A
INNER JOIN SALON_CUSTOMER ON SALON_CUSTOMER.CUST_ID = A.CUST_ID
INNER JOIN PRODUCT P ON A.PROD_NUM = P.PROD_NUM
INNER JOIN SERVICE_ S ON S.SERVICE_ID = A.SERVICE_ID
-- WHERE?
GROUP BY RTRIM(FIRST_NAME) + ' ' + RTRIM(LAST_NAME);
| 2023-08-19T01:26:29.851802 | https://example.com/article/9499 |
{
"name": "MobyMax LLC",
"displayName": "MobyMax",
"properties": [
"mobymax.com"
]
} | 2023-09-07T01:26:29.851802 | https://example.com/article/4780 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.