text stringlengths 8 5.77M |
|---|
FOREX-Euro selloff abates, German ZEW may offer brief respite
Reuters Staff
4 Min Read
* Euro steadies, but hedge funds seen sellers
* British pound near 16-month high vs euro on rate outlook
* Swedish crown rises after inflation data
By Anirban Nag
LONDON, May 13 (Reuters) - The euro stabilised near one-month lows against the dollar on Tuesday, as the recent selloff abated before a survey of German investor sentiment that might show some improvement in morale in Europe's biggest economy.
Still, any rallies are likely to be short-lived, with hedge funds seen as the main sellers. Speculation that the European Central Bank will ease monetary policy next month and its apparent concern about a strengthening currency and its impact in subdued inflation will cap the euro, traders said.
The euro climbed to $1.3770, away from its one-month low of $1.3745 hit on Friday, having shed 1.2 percent since ECB chief Mario Draghi said the bank was ready to take action next month to lift economic growth. Near-term support is at its 100-day moving average of $1.3741, which could be tested if the sentiment survey falls short of expectations.
The German ZEW survey for May is due at 0900 GMT. The current situation index is forecast to have risen to 60.5 from 59.5, while the expectations index is forecast to have declined to 41 from 43.2. Last month, worries about a conflict between Russia and Ukraine was a drag on investor morale.
"The main worry for the ECB is inflation, and if there is any improvement in the ZEW, it will not be a game changer," said Yujiro Goto, currency strategist at Nomura.
"We see the euro trading with a downward bias given the market is expecting some kind of easing from the ECB next month. It is still not clear whether it will do quantitative easing, but a rate cut is more likely."
Goto added that unless U.S. data improved significantly, the euro's move lower was likely to be more of a grind rather than a fast-paced decline. U.S. retail sales for April are due later in the session and are expected to show a sales slowed after a sharp rise in the previous month.
Daisuke Uno, chief strategist at Sumitomo Mitsui Bank, noted that the euro had broken below a channel of support connecting its July 2013 low of $1.2755 and February low of $1.3482.
"(The ECB's) easing may not end in June. The euro's uptrend since last summer is likely to have ended," said Uno.
SWEDISH CROWN RISES
The Swedish crown rose to a day's high against the euro after monthly inflation printed above expectations. The euro fell 0.3 percent to 9.00 crowns after the data was released from 9.0420 crowns beforehand.
Against sterling, the euro stood at 81.60 pence, having hit a 16-month low of 81.43 on Monday. The pound was buoyed by prospects of rate hikes by the Bank of England, perhaps as early as later this year.
Data from retailers showed British retail sales jumped in April as rising house prices encouraged shoppers to buy new furniture, flooring and other home decor over the Easter holiday weekend.
The yen ticked down to a one-week low against the dollar as improved risk sentiment sent U.S. share prices to record highs.
The yen traded at 102.32 yen to the dollar. (additional reporting by Hideyuki Sano in Tokyo; Editing by Larry King) |
Councilmember Real Sebastian thanked her family and friends for their support. She introduced her mother and family members. She said her family moved into Monterey Park in the 1970s and they followed them. She thanked the staff at Stevens Steakhouse for putting this event together. She stated that she is humbled by your presents tonight. Her four-year term is almost up. We have made many changes. She will continue to work hard to get results.
Councilmember Real Sebastian listed all of the committees and boards that she sits on including the 710 Freeway and Council of Governments that has been working on the Clean Water Act. Monterey Park joined with COG to help clean up the water and keep our city costs down.
Monterey Park is more transparent now with more documents on city’s Internet sight. Our city budget is balanced and the staff hours are no longer reduced. She did not approve the high raise giving to the city manager.
Councilmember Real Sebastian worked with 2,000 residents to keep Edison from cutting down trees in Edison Park. She has been spearheading the Beautiful Parks Program and is cleaning up our parks. Elder Park was scheduled to be cleaned up on September 27.
She voted NO on the Potrero Grande zone change that converted 9 1/2 acres from commercial to residential. We need more retail projects in the city. The Market Place is scheduled to close escrow by the end of this year.
Monterey Park stores provide sales taxes to run the city. Monterey Park has an Emergency Operations Center. We have a safe city. You are our eyes and ears. We have our own Police and Fire Departments.
Monterey Park has a greater number of seniors than the rest of Los Angeles County.
She spoke about family events that include the October 17 Geranium Festival that will be based on a country fair and the Holiday Snow Village that had 2,000 people in attendance last year.
Education is important. We have many schools and East L A College.
Councilmember Real Sebastian stated she does her homework and asks questions. She will ask question for you. I am here to serve you. As a public servant she conducts herself with the highest ethics. She will not compromise her ethics. She makes her decisions on the wellbeing of the city.
As a City Councilmember she knows how to balance the budget. She does not want people to lose their jobs. She will help keep the schools going.
Councilmember Real Sebastian thanked the audience for their support. We need to encourage women to run for office. She pledged to do a better job for Monterey Park and you. We will win in March. |
Furman University is commemorating its 50th anniversary of desegregation by exploring the events that led to this watershed moment and honoring the pioneers who fought to achieve equality at the institution.
intro paragraph
On Jan. 29, 1965, Joseph Vaughn became Furman's first African-American undergraduate student, joining three educators—Henry Adair, William Bowling, and James Kibler—who enrolled as graduate students. The arrival of these four students marked the turning point in a debate that divided the campus for more than a decade and changed the university's culture forever.
Throughout the 2014-15 academic year, Furman will host a series of events to commemorate this important event—and honor those who put the university on a path toward becoming a more diverse and inclusive community.
Joseph Allen Vaughn
›
Connect with Admission
Furman is one of the nation's premier liberal arts and sciences universities. We offer our students The Furman Advantage—an over-arching approach to education that promises every student a four-year personalized pathway, a team of advisors and mentors, and the opportunity for an engaged learning experience that is tracked and integrated with the students' academic and professional goals.
Undergraduate Evening Studies provides adults the opportunity to receive an education from one of the premier liberal arts universities in the nation.
Whether you are starting or continuing your education, or have been away from the classroom for a few months or several years, our program provides many services to assist you with accomplishing your educational and professional goals. |
Ottawa — Les fonctionnaires de Transport Canada passent au crible les livres de compte d'un programme de subvention fédéral pour retracer environ cinq millions de dollars en réclamations et dont la validité est questionnée par les vérificateurs.
L'argent a servi à rembourser des projets transitoires à Vancouver, Winnipeg et Halifax dans le cadre d'un programme de 35 millions de dollars visant à aider les villes à réduire leurs émissions de gaz à effet de serre.
Une nouvelle vérification indique que le ministère des Transport a instauré des règles vagues pour la subvention et qu'il n'a pas vérifié adéquatement si les villes respectaient ces normes.
Huit centres urbains de tout le Canada ont reçu des sommes pour des projets dont la valeur totale est d'environ 100 millions $, incluant la contribution fédérale.
Le programme avait été lancé par un gouvernement fédéral libéral, mais il a été reconduit par les conservateurs lors de leur arrivée au pouvoir en 2006.
Une porte-parole de Transport Canada a indiqué que des vérificateurs allaient examiner les documents afin de déterminer si ces réclamations étaient valables. |
“Roux-en-Y gastric bypass surgery (RYGB) is one of the most successful treatment strategies for diabetes accompanying morbid obesity. Long-term diabetes remission rates of 83% have been reported.” These findings have led to the suggestion that the surgery improves diabetes by somehow altering digestive hormones, but this interpretation ignores the fact that patients are placed on a severely limited diet for a week or two after the operation just to recover from the major surgery. Severe caloric restriction alone can improve diabetes. So, is it the diet or the surgery?
To answer that question, researchers put diabetics on the exact same diet as one would eat post-RYGB surgery, with or without the actual surgery. As I discuss in Reversing Diabetes with Surgery, the researchers found that their diabetes improved rapidly on the surgery diet before they had the surgery. In fact, the improvement in blood sugar control was better on the diet alone than after the surgery.
Blood sugar control improved more in the absence of surgery.
This suggests that the whole surgical-diabetes-reversal is not due to the surgery at all, but rather because of the diet people have to go on in the hospital during recovery. So, the clinical implication is that nonsurgical interventions have just as much potential to resolve diabetes as major surgery does.
If you’re familiar with my video Diabetes as a Disease of Fat Toxicity, you’ll understand what is occurring. Namely, “[t]ype 2 diabetes can be understood as a potentially reversible metabolic state precipitated by the single cause of chronic excess intraorgan fat”—that is, too much fat in the cells of the liver, pancreas, and muscles. Within seven days of eating about 600 calories a day by either dietary intervention or bariatric surgery, fasting glucose levels (blood sugar levels) can normalize, thanks to a fall in liver fat. If you look at CT scans, you can actually see a 35 percent reduction in liver volume as all the fat is cleared out. Then, the body starts pulling fat out of the pancreas. When the cause of diabetes goes away, the diabetes goes away.
The insulin-producing beta cells of the pancreas “had woken up!… Clearly, the [beta] cells are not permanently damaged in Type 2 diabetes, but are merely metabolically inhibited.” Studies show a reversal of diabetes up to 28 years after diagnosis.
So, diabetics motivated enough to starve themselves can regain normal health. This information should be available to all people with type 2 diabetes, even though it is unlikely many will be motivated enough to escape from the disease. It’s not easy to not eat. Diabetics should know that if they don’t reverse their diabetes, their future health is in jeopardy, although the serious consequences must be balanced against the difficulties and privations associated with starvation diets. “For many people, this may prove too high a price to pay,” as it’s hard to voluntarily restrict food intake that much.
In that case, how about involuntary food restriction? That’s what stomach stapling surgery is. When you essentially remove someone’s stomach, they’re forced into compulsory food restriction.
Of course, major surgery carries major risks—during the operation and afterwards. There can be bleeding, leakage, infections, erosions, herniation, and severe nutritional deficiencies. Surgery or starvation? There has got to be a better way. And there is!
Instead of changing the quantity of food eaten, whether voluntarily or involuntarily, is it possible to reverse diabetes by changing the quality of the food? Watch my videos Reversing Diabetes with Food and Diabetes Reversal: Is It the Calories or the Food? to get the complete picture.
For the lowdown on saturated fat, check out Lipotoxicity: How Saturated Fat Raises Blood Sugar.
Interested in taking a deeper dive into underlying causes of type 2 diabetes? You may be interested in these:
And, for an overview, see How Not to Die from Diabetes.
In health,
Michael Greger, M.D. |
Tom Brady is the greatest quarterback in NFL history.
He has won multiple Super Bowls, MVP's and has his name scattered throughout the league record books. Naturally because of this, any sort of memorabilia of the quarterback will be worth some coin.
Scratch that, a lot of coin.
A rare mint graded Brady rookie card just recently sold for over $24K on eBay.
This mint graded Tom Brady rookie card sold for $24,212 last night on eBay pic.twitter.com/tpxhZ7CXPb — Darren Rovell (@darrenrovell) October 13, 2016
Want to know everything about the Patriots before Tom Brady makes his Gillette Stadium debut against the Bengals? Take a second to sign up for our FREE Patriots newsletter!
The card is just .5 on the surface grade to be completely perfect.
If you have the money to blow and you like the Patriots, then maybe it's worth it. Maybe. |
RatingThis is so quick, and most of all dealious. It is a great meal to cut into squares and vacum pack and freeze and later take out and reheat. Submitted on 2/27/2005 by angel070456
Rating I made this recipe for my family and they loved it. I have since made this a few times and think it would be a great dinner to send over to a sick friend, etc.Submitted on 2/23/2005 by lindaedlin |
In spite of Trigg County’s proximity to Fort Campbell, recent military voting initiatives on the part of Kentucky Secretary of State Alison Lundergan Grimes shouldn’t effect this election.
Trigg County Clerk Dorris McGill said that last week that she doesn’t know how many of the county’s registered voters are active or retired military but added that many absentee ballots have been requested via e-mail or snail mail.
“However, at this point, voted ballots must still be returned by mail to be counted,” said McGill. “I don’t expect this to really effect this election.”
Last week, Grimes made five recommendations that she said will improve ballot access for military and overseas voters. Those recommendations were: online voter registration for military and overseas voters; enough time for those two groups to vote in all elections; allowing those groups to return “executed” ballots via e-mail; make sure that all absentee ballots are counted; and adopt the Uniform Military and Overseas Voting Act.
For the rest of this story, see this week's issue of The Cadiz Record or subscribe to our e-Edition by calling 270-522-6605. |
Rapid and Efficient Self-Assembly of Au@ZnO Core-Shell Nanoparticle Arrays with an Enhanced and Tunable Plasmonic Absorption for Photoelectrochemical Hydrogen Generation.
High-quality Au@ZnO core-shell nanoparticle (NP) array films were easily and efficiently fabricated through an air/water interfacial self-assembly. These materials have remarkable visible light absorption capacity and fascinating performance in photoelectrochemical (PEC) water splitting with a photocurrent density of ∼3.08 mA/cm2 at 0.4 V, which is superior to most ZnO-based photoelectrodes in studies. Additionally, the interesting PEC performance could be effectively adjusted by altering the thickness of the ZnO shell and/or the layer number of the array films. Results indicated that the bilayer film based on Au@ZnO NPs with 25 nm shell thickness displayed optimal behavior. The remarkable PEC capability could be ascribed to the enhanced light-harvesting ability of the Au@ZnO structured NPs by the SPR effect and the optimum film thickness. This work demonstrates a desirable paradigm for preparing photoelectrodes based on the synergistic effect of plasmatic NPs as the core and a visible optical absorbent and semiconductor as the shell. Moreover, this work provides a new approach for fabricating optoelectronic anode thin film devices through a self-assembly method. |
President Donald Trump said the video game industry is partially to blame for the El Paso massacre, claiming that games glorify violence.
Some gaming company stocks lost as much as 6% of their value on Monday before stabilizing on Tuesday.
However, there's no research that links gun violence to video games, video game company and some independent research suggest.
In the aftermath of Saturday's mass shooting in El Paso, President Donald Trump placed blame on video game makers, seeking to link games like "Call of Duty" with a rise in gun violence. Fears of a backlash against the industry sent shares of game developers tumbling on Monday
While gaming companies recovered some that lost ground on Tuesday, with "Call of Duty" maker Activision Blizzard rising in early afternoon trading after losing 6% of its value on Monday, the questions facing the industry may not disappear as quickly. Other video game makers saw their stocks slide Monday, including Take-Two Interactive, the maker of "Grand Theft Auto," and Electronic Arts.
Video game companies have long drawn criticism across the political spectrum for what some say is their capacity to incite violence in some players. Critics are also pointing to the suspected El Paso shooter's reported mention of "Call of Duty" in his manifesto. According to critics, such games normalize violence and are a factor in the rise in mass shootings.
"We must stop the glorification of violence in our society," Mr. Trump said Monday in remarks at the White House after the El Paso massacre. "This includes the gruesome and grisly video games that are now commonplace."
Get Breaking News Delivered to Your Inbox
Other lawmakers chimed in, with both House Minority Leader Kevin McCarthy and Texas Lt. Gov. Dan Patrick telling Fox & Friends that they believe there's a link between violent games and real-world violence. "We've watched from studies, shown before, what it does to individuals, and you look at these photos of how it took place, you can see the actions within video games and others," Patrick said.
"No causal connection"
Despite such claims, there's a lack of research backing up those assertions, according to the video game industry.
"Numerous scientific studies have established that there is no causal connection between video games and violence," the Entertainment Software Association said in a statement to CBS MoneyWatch. "More than 165 million Americans enjoy video games, and billions of people play video games worldwide."
Both the industry and its supporters also point to another fact: Violent games like "Call of Duty" are played across the globe, yet no other country has a rate of gun violence as high as the U.S., suggesting that causes other than video games may be to blame.
"There are no longitudinal studies that show a link between violence and video games," Benjamin Burroughs, a professor of emerging media at the University of Nevada, Las Vegas, told the Associated Press. "Certainly, there is no linkage to gun violence."
Video game catharsis?
One 2014 study from researchers at Villanova and Rutgers universities not only found no link between video games and real-world violence, but also that crimes like aggravated assaults tended to decrease after a video game release -- possibly because it allows for a "catharsis" through expressing aggression in a game rather than real life.
Claims that video games are linked to "the murderous rampages of male adolescents" is a false correlation, the authors noted. About 9 of 10 young men play video games, which means claiming a perpetrator was incited by a video game "is as pointless as pointing out that the criminal also wore socks," they wrote.
Psychologist Jill Peterson and sociologist James Densley, who have compiled a database of mass shootings going back to 1966, say a range of other factors can lead people to commit violence.
"These are complicated pathways," Peterson told CBS This Morning. "It's childhood trauma and mental health and bullying and other stress factors. Picking out any one piece doesn't work." |
Tuesday, May 30, 2006
Anyway, we were joking around about this last night, on our way back to my place, and she said I should write a fan letter to chicken. Since she suggested the last fan letter as well, I decided to go along with it.
So, here we go:
Random fan letter number 2 - Chicken*
Dear Chicken,
I am quite fond of you. You are delicious. Especially when Keem takes you and cooks you with a little olive oil and Mrs. Dash Southwest Chipotle Seasoning. Yum. I especially like it when there is bacon. Did you know that bacon is the same in Portuguese as it is in English? That is very cool. Bacon does not come from chickens, though. It comes from pigs.
Beth likes to say your name a lot. Either she expresses it as Chicken! or sometimes Kurka! That is Ukranian for chicken. She does not like to eat you as much as I like to eat you. That is okay. She likes to eat tomatoes and I think they are horrible.
Thank you for being yummy!
Dana Marie Vittum
*As we were sitting in the car, I protested "I am not writing a fan letter to chicken" and Beth said something along the lines as "You've already written half of it right now so shut up already."
Back to the more normal insanity that is my life. Now that the "chicken is great" letter is out of the way.
Saturday night, Beth picked me up and we headed back to her place so we could scrapbook. I had Monday off so we were thinking we were going to accomplish a lot. After a quick stop at SA, we arrived at her apartment. Minnesota has decided to break some records and get extremely hot. It was midnight and 91 degrees. This is just wrong. Excessive sweating seems to take a lot out of me and I was content to work on my cross stitch while Beth played on the computer.
Sunday, we headed off to karaoke. Dan Lang and his neighbor, Zach, were there already. Angie was also there with her brother and some other people we didn't recognize. Bryan came in a little later. Beth had mentioned, on our way to the Chalet, that, since it was Memorial Day weekend, it should be pretty busy and more than likely insane. She was right but we didn't realize it when we first got there.
When we first entered the Chalet and stopped to talk to Bobby and pick up our drinks, he mentioned that the air conditioning wasn't working. It was 79 degrees inside. After walking in from the 95 degree hell hole known as the great outdoors, we mentioned that it felt nice. Apparently we had forgot the principle rule - the more people in an enclosed space, the warmer it feels.
We decided to get a pizza. Both Beth and I love to put the little pepper flakes on our pizza. Beth walked up to sing and I took a bite of my pizza and started choking. I had inhaled a pepper flake and started choking on it. Dan was rather concerned and asked if I was okay. Unfortunately, the choking turned into a coughing fit and I rather abruptly jumped up from the table and raced to the bathroom.
It was there, while hacking up the pepper flake and some of my life blood along with it (not a lot of blood but still, that's always fun to see), that my life briefly flashed before my eyes. My throat had locked up and I couldn't breathe because I was straining so hard to expel the pepper flake. I felt as though I was going to pass out and had a horrifying moment where I thought "I am 39 years old. I am a good person. I do not want to die in the Chalet bathroom. And dang it, God, when am I going to find romance?" Because, hey, instead of trying to, oh, I don't know, let someone know I was choking to death, let's be more concerned about my lack of romance. That's sensible.
God must have been listening because the coughing fit calmed and I was soon able to start regulating my breathing. Beth came in while this was happening to find out if I was okay and I told her what happened. I was soon out and it was then that God decided to bring to me some romance.
But, as we've all discovered before, God has a sense of humor. Remember Quagna (Suz, if you haven't read this, you should. It is rather hilarious, if I do say so myself)? Remember how he started singing to me? Well, it happened again. Except this time the guy singing to me was not hot and with an intriguing accent. Unless, of course, you consider old men with crooked teeth and a drunken slur to be attractive. Sean Connery he was not.
Anyway, he was singing the song that goes like this - "Have you happened to see the most beautiful girl in the world? And if you did, was she crying?" At least I think that was what he was singing.
Beth: I don't like him.DM: Why not?Beth: When we came in, he walked right into me.DM: Yeah but he apologized.Beth: I think it was deliberate.DM: Oh (sometimes men will, in an attempt to be subtle, bump into women as a way to draw attention to themselves or brush up against soft body parts). Eww.
A few moments go by.
Beth: Dana. He's singing to you.DM: No. No, he's not.Beth: Yes, he is.DM: Oh God, why? Why? I'm a good person.Beth: You are.DM: Is he still singing at me?Beth: Yes.
The song mercifully came to an end and Tony (or Creepy Crazy Guy as he later was named) started walking toward me.
DM: Oh, no.Beth: Giggles.
CCG continues to walk past us and to a back table where he begins talking to a woman and her boyfriend (?).
After Angie leaves, CCG winds his way up to the front, sitting at the table where Angie had been sitting. He starts talking to Angie's brother and some other people. At one point, we do overhear what he says to some of the women and it is very crass but I can't remember what it was. When Dan and Zach leave, CCG comes and sits on the other side of the table, near me.
Beth gets up to sing. CCG starts talking to me. It is hard to understand what he says because he is drunk and, well, crazy and creepy. Plus I am trying to watch Beth sing and he keeps interrupting me, leaning into my point of view. Believe me when I tell you that I wanted to jump and scream every time he did it.
CCG: You're a great singer.DM: Thank you.CCG: You have a gift.DM: Okay. Thanks.CCG: Don't let anyone ever hold you back.DM: Uh...CCG: You just get up there and sing.DM: Uh huh.
Then he kept doing that bump thing that drunken men seem to insist on doing. You know, the making a fist and tapping the other person's fist. None of the sober men I know insist on doing this. They're not even really sure what it means. Does anyone know what it means?
Beth finished singing and came and sat down. CCG didn't let that deter him. He kept telling me how great I was and how I should sing all the time. I would love it if James would tell me this but no, apparently my singing voice only appeals to the insane.
Why is it that, when in a situation like this, neither Beth or I can say "Dude, I'm not interested" or "Hey, Crazy, Creepy Guy, you're freaking me out" or even "Stop touching me, you wacko?" Why is it that we just smile politely and hope that they'll eventually go away? I am hoping that if I am ever confronted by a mad scientist or a vampire, I will do more than smile politely. I am hoping that I will smack them about the head with my purse.
After a few minutes of this, Beth ran over and told Benny what was happening. He, without a moment of hesitation, said "Let's go" and came over to sit next to me.
Benny is my hero. He made a big production of sitting between me and CCG.
Benny: Oh, yeah. This is the best spot here.CCG (ignoring Benny): You gotta sing, girl.Benny: Oh, gee, I'm feeling kind of gassy. I've got the farts.CCG: You better not fart on me.Benny: I had some White Castles. I'm just farting in the chair.CCG: She's my girl! She's my girl!
CCG reaches over to touch me behind Benny's back. Benny blocks him by pretending to stretch. CCG reaches across Benny to try and touch me. Benny leans forward and pretends to sneeze.
James walks in the bar. All at once, Beth, Benny, Stephanie and I all call out "JAMES!" He turns and looks at us, puzzled. In retrospect, I would have run up to him and asked him to save me from the attentions of CCG but I didn't think of it until too late.
CCG (to Bryan): You gotta call her up there so she can sing (indicating me)!Bryan: I'll call her up when it is her turn.
My hero!
Bryan: Dana!
Dang him!
Beth: Sing "Different Drum!"
Beth has sung this song a few times to deter unwanted admirers. I sing the song. It doesn't seem to have any effect on CCG. He is staring at me.
When the song finishes, I see Matt walk in. I have never been so happy to see him in my life. I cry his name and throw my arms around him. I can see the puzzled look in his eyes.
Matt: Hi.DM: Help me. There is a crazy, creepy guy who keeps hitting on me.Matt: Oh. Okay. Let's go.
He escorts me to the table and was going to sit on the left but Beth and Stephanie quickly tell him to sit where Benny was sitting. Benny leaves. Goodbye Benny. Thank you for saving me. You smell nice.
Every time CCG looks at me or moves in my direction, I snuggle up to Matt. He is very nice to be helping me in this manner. Why is he not James? Why?
James sits next to Beth and Dean is on her other side. The five of us start talking about Lost and how frustrating the season finale is and what the heck is going on (I do not mention my theory that Sayid is incredibly sexy. I'm pretty sure Beth already knows that and Dean, James and Matt probably don't care).
James looks somewhat surprised that Matt and I are sitting so close to one another. Because, yes, I went from being absolutely crazy over him to suddenly liking Matt, who, at one drunken time, told me that he would like to do things to Beth. When there is a lull in the conversation, I fill him in on CCG and why Matt is being helpful. He then smiles and looks less perplexed. Maybe it is only hopeful, wishful, crazy thinking on my part but he might possibly have been just a tiny little bit jealous of Matt. Maybe. Oh, shut up. I can dream.
After awhile, CCG has decided to move up to the bar. Perhaps he was overwhelmed by the amount of people now sitting at our table. Not only were James, Dean and Matt there but we were also joined by Dustin and his girlfriend (I want to call her Laura but I'm not sure if that's right), Liz and also Darling and her husband Stacy (is her name not the coolest ever? And she was so nice and, well, absolutely darling) were sitting with us.
It was my last time to sing for the night and I have decided to try singing Drift Away (I forgot my list over at Beth's so I was trying all new stuff).
Bryan: What do you have?DM: I'm trying something new. It'll probably suck. But apparently I have a gift.Bryan: A gift for what?DM: For singing. According to the Crazy Creepy Guy up at the bar.Bryan: That's great. You've been endorsed by the Crazy Creepy Guy! You must be proud. DM: Oh, I am.
I sang the song, it wasn't horrible but it does need work. Apparently Beth got pictures of CCG watching me sing, thinking such thoughts as "She's my girl" and "I want to lock her up in my basement and make her sing only to me." I was able to avoid him for the rest of the night, Matt even escorted me to the bathroom and waited for me. Nice guy, that Matt. He's no Batman but he's still a nice guy.
I gave Liz lots and lots of books to read and she was very excited. She is going to bring in some books for me.
There were two highlights to the evening. One, I got to watch James and Stacy argue about comic books. It was fascinating. I have always loved watching debates, especially when the people in the discussion are very passionate about what they are debating. The fact that it was comic books made it even more thrilling for me (I know. I'm such a geek). That and the fact that James is just brilliant and I like him a lot (I know. You're all sitting around going "Duh, Dana. I think we figured that out").
The second highlight was, after the after karaoke (where we all sit around and talk), some of us were still standing around. I noticed that James was standing in the door way and walked over. We went outside and were talking for a few minutes (where I reiterated the fact that Matt was only hugged because he was saving me from CCG) and then it happened. He hugged me. A big swooping hug for many seconds.
Conversation back to Beth's place revolved around the night and this:
DM: He hugged me.B: Yes, he did hug you.DM: We're going to see him tomorrow. Maybe (we talked about going to see X-Men 3).B: Yes, we might.DM: I like him a lot.B: I know you do.DM: He hugged me.
I may have giggled. I'm not sure. I do know that Beth is very patient and did not kill me. She is a good friend.
I saw him for a few minutes on Monday when we went to see X-Men 3. He let us in to see the movie for free. He also mentioned that he would be gone when the movie was over because he was done at 6 and thought we were going to go to the 4 PM movie. Unfortunately, we overslept and had to drive like the weend to get to the theater in time for the 5 PM movie. But it gave me my James fix, seeing him for those few minutes. I adore him. Have I mentioned that?
Different Drum - Linda Ronstandt
You and I travel to the beat of a different drumOh can't you tell by the way I runEvery time you make eyes at meWo-oh
You cry and moan and say it will work outBut honey child I've got my doubtsYou can't see the forest for the trees
Oh don't get me wrongIt's not that I knock itIt's just that I am not in the marketFor a boy who wants to love only me
Yes, and I ain't saying you ain't prettyAll I'm saying is I'm not readyFor any person place or thingTo try and pull the reins in on me
So good-bye I'll be leavingI see no sense in this crying and grievingWe'll both live a lot longerIf you live without me
Oh don't get me wrongIt's not that I knock itIt's just that I am not in the marketFor a boy who wants to love only me
Yes, and I ain't saying you ain't prettyAll I'm saying is I'm not readyFor any person place or thingTo try and pull the reins in on me
So good-bye I'll be leavingI see no sense in this crying and grievingWe'll both live a lot longerIf you live without me
Sunday, May 28, 2006
I am writing this letter to tell you how I am quite probably your number 1 fan. Even though I have never met you or even listen to your music all that much (except when I'm over at Beth's. By the by, the song "Good morning, little schoolgirl"? Good song. Kind of creepy. But still a good song), I adore you.
I have heard that you are married. This leads me to believe that you believe in love (unless, of course, you married for money and then you can completely disregard what I'm going to write next. But I feel that I know you, Jonny Lang, and have faith in your heart).
I also believe in love. Or, well, extreme Like. This is because I met James. And meeting James could not have happened without you. You've never actually met James so don't rack your brain too hard trying to figure out who he is. Let me describe him for you. He's like Batman.
This is the series of events that led to me meeting James.
In 19something or another, you participated in a contest. A singing contest. You won this contest.
Part of Bryan's income is paid to him in the form of alcoholic beverages.
Working at the Chalet led to Bryan meeting Liz. They are quite possibly the world's most perfect couple (More of that love connection that you, Jonny Lang, are indirectly responsible for. You must be very proud).
When we (Beth and I) first started going up to the Chalet, we would see Liz and knew that she was Bryan's girlfriend. A few of Bryan and Liz's friends would join her at what Beth and I referred to as the Cool Table. One of the Cool Table's inhabitants was a man named Dean. We actually knew Dean from a bar named Wild Tymes which is where we first met Bryan. We followed Bryan (okay, not literally because that would be creepy) from Wild Tymes to the Chalet. We joked that we were Bryan's stalkers.
After Beth and I had been going to the Chalet for awhile, one night Liz came and sat with us. This was very exciting for us. When the rest of the Cool Table came in, they joined us and we were introduced to people that we had just seen from afar (well, as afar as you can get from a fairly small bar but you get the point). One of these men was Barry (hot but quite possibly a serial killer) and James (remember James? He is like Batman).
James is not what most people would call traditionally handsome. He is a self-proclaimed comic book geek, has OCD, may be slightly autistic (well, no, that's more of a joke), talks like William Shatner and thinks like Mr. Spock (extremely logical. I am not a logical person but many of my friends are. It is my cross to bear). The minute I met him, I fell head over heels into Like. Although I denied it for a long period of time.
Although he has not yet realized that I am the one for him or even that I could love him like that, our relationship has made great strides. In fact, in January, a year after I first fell in Like with him, I proceeded to get very drunk and then tell him how I felt.
My professions of Like included telling him the following:
I like him. A lot.
He is like Batman (Batman is my favorite superhero, in case you haven't guessed that yet).
But not just Batman. Adam West Batman (which he didn't seem to find very complimentary until I mentioned that Adam West was hot. Then he liked it).
He is like the captain of the football team (remember that he is a comic book geek).
I also kissed him. And licked him on the neck. Twice.
Nothing much has happened between us since then but I have hope. And at least I got addicted to the television show Lost out of the deal (James spent a lot of time telling us how great the show was and we needed to watch it so we did). Which will lead to my next fan letter to Naveen Andrews, also known as Sayid, he of the succulent man breasts (man boobies are not sexy. Man breasts are extremely tight and hot pectoral muscles. What Naveen Andrews does to a tank top has to be seen to be believed).
So, thank you, Jonny Lang. Thank you for winning that contest and bringing to me my true Like. Because, let's face it, Bryan would probably never had worked at either Wild Tymes or the Chalet if he had won and then he never would have met Liz. And more important, I would never have met James. And that would be horrible in so many ways.
Thursday, May 25, 2006
D: You know, I may hug the occasional tree*, I may be reading a book about Death and giggling hysterically over it** but I have never carried around a shrunken head in a baseball cap***. I'm crazy but I'm not shrunken head crazy****.B: You know what you're getting for your birthday now, don't you?
*One of my latest tree hugging pictures - snapped by Beth in Cananda.
Beth asked me why I hug trees and I tried to give her an explanation but failed miserably. All I can tell you is that when you hug a tree, actually let yourself go and forget about the fact that there might be people around you looking at you like you are the biggest freak in the world, it is the greatest feeling. You slough off all of your concerns and concentrate only on the sun and the smell of the tree bark and the moment becomes not about you and your worries but about you and Nature and all the things that are good in your life. Maybe it is like meditation? I don't know.
**Seriously. You must read this book. It is so great. The name of it is A Dirty Job and it is by Christopher Moore and I have no idea how I went this long without reading anything by him. Think Hitchhiker's Guide to the Galaxy meets Good Omens meets everything else funny in the world. But, keep in mind that I am crazy and my sense of humor is, well, a little weird. Click here for some of the plot details.
***If you have not yet read Beth's post about Shrunken Head Guy, you have no idea what I am talking about. Quick. Go here now.
****I used to say "I'm crazy but I'm not Prozac crazy. I'm Effexor crazy." But shrunken head crazy is even more fun.
Tuesday, May 23, 2006
I am back after a wondrous vacation. 6 glorious days away from work. Unfortunately, that also means no Internet access (well, not technically, I did have access to Beth's computer but I was lazy and played games) and that means that, when I pulled up my Bloglines account today, there are 488 unread posts waiting for me*. I am overwhelmed but also excited about all the new and fun things for me to read. And I promise I will read them, it just might take awhile since my home computer is broken. Stupid computer.
*Update - it's now 460. I have to stop reading until tomorrow or I am going to get into so much trouble.
Anyway, a funny thing happened at karaoke last night.
Donny (an attractive individual but total player) is singing. Instead of his usual version of Prince's Kiss, he decides to sing Neil Diamond's Brother Love's Traveling Salvation Show. When he gets about halfway through the song, he deviates from the usual lyrics and asks us "Have you met Jesus? I met Jesus. I was at the Taco Bell down the road (on the corner of Rice and Larpenteur) and Jesus was at the counter. I knew he was Jesus because that's what his name tag said. His hair was long (and something I didn't catch). And when Jesus asked me for my order, I wanted Peace on Earth but I got a Taco Supreme instead."
It was, in the words of Johnny, "Hi-larious."
Here are a few pictures of Donny. Thanks so much to Beth that uploaded my pictures this week to flickr or I would be devoid of pictures. She's so great, isn't she?
Thursday, May 11, 2006
I am back. I am weak and ineffectual, the dreaded bronchitis monster has attacked me (I'm assuming it is bronchitis because I feel like someone put a fifty pound weight on my chest) and I want to crawl into bed forever but that would be wrong. So I'm at work right now, on my break, wondering where 2 1/2 hours went and watching people watch me, waiting for me to keel over at any moment.
I was going to participate in the day in the life thing that Sheryl and others do. It was supposed to be on Saturday but I only have a vague idea of what I did on Saturday. Here is Saturday and the rest of the week so far, to the best of my knowledge.
8:00 AM Wake up. Curse the fates that have woken me up this early on a Saturday. Go sit out in the living room and cross stitch while watching Oscar.
9:30 AM Keem yells at me to get ready. I tell her I am ready. She says "You are not going out like that." Jeff laughs and says she is mean. I look at him and say "I don't match and my hair is a mess. I'm not going out like this." I was wearing a purple tank top with green and blue flowered capri pants. It doesn't match. Plus, haven't shaved my legs in awhile. I tie my hair up, change to jeans and brush my teeth.
11:00 AM Go to Weight Watchers. Weigh in. I am down 1.8 pounds, a total of 12.4. Can I get a woo-hoo? Keem is also down a pound. We are pleased.
11:15 AM We are on our way to go to a movie. The movie of choice today is RV, Keem has wanted to see it for awhile.
12:45 PM Movie is over, it was funny. We both enjoyed it. Jeff Daniels is in it as well so that was a nice suprise, you don't see him in the previews. Just Robin Williams.
1:00 PM My whining has paid off, we are going to Jo-Ann's so I can buy fun and exciting cross stitch things to work on while at work and while watching TV. It seriously helps cut down the snacking a lot.
Random conversation I have had with Keem to convince her she should start cross stitching again.
DM: Keem. You should get a fun project to work on.Keem: I may. I don't know yet.DM: And then we would be stitch buddies!Keem: If you ever refer to us as stitch buddies again, I won't start cross stitching again.DM: You don't want to be stitch buddies?Keem: Enough with the stitch buddies!
2:00 PM I have been dragged out of Jo-Ann's and we are going to get food. We decide to go to Culver's. This was probably a mistake.
2:30 PM We arrive at home and eat Culver's. Yummy Wisconsin Swiss Melt with yummy cheese and cheese curds on the side and my, I am full now.
3:00 PM We decide to watch lots and lots of movies. The DVD player decides it is broken. It is holding Keem's copy of Dungeons and Dragons hostage.
The next few days pass in a blur because I am sick. All I know is that Saturday night, I had heart burn. Heart burn turned into acid reflux. The acid reflux made me phlegmy (sp?). The phlegm inhabited my lungs and turned into bronchitis. All I pretty much did was sit in the chair, stare at the television and want to die.
Fortunately I did not die. I am back at work. We could say woo-hoo about this but it is not very sincere. I could have stayed home today but, if I did, that would mean I would quickly run out of vacation time. As it is, with the planned trip next week and some time off around Beth's birthday, I have only 4 days unplanned vacation time left. Hmm. This does not bode well.
I am still working my way around to your sites. Sorry it's taking so long. Stupid computer is still broken. Which is stupid. And I was banned from Keem's computer while I was sick. Keem says "If you are too sick to go to work, you are too sick to use my computer."
About Me
Just for the record, my opinions, hopes, dreams, etc., are just that. They have absolutely no reflection on my employer. Not that I'm going to tell you who that is...
I am the (self proclaimed) Queen of the Universe. Join my cadre of loyal subjects and all will be well in your world. My mantra is "Embrace Chaos. Adore Chaos. Give Chaos a big kiss on the mouth." NEW mantra this week - "No one ever suspects the socks."
Email me at greenduckiesgirl(at)comcast(dot)net |
A mathematical approach for evaluating Markov models in continuous time without discrete-event simulation.
Markov models are a simple and powerful tool for analyzing the health and economic effects of health care interventions. These models are usually evaluated in discrete time using cohort analysis. The use of discrete time assumes that changes in health states occur only at the end of a cycle period. Discrete-time Markov models only approximate the process of disease progression, as clinical events typically occur in continuous time. The approximation can yield biased cost-effectiveness estimates for Markov models with long cycle periods and if no half-cycle correction is made. The purpose of this article is to present an overview of methods for evaluating Markov models in continuous time. These methods use mathematical results from stochastic process theory and control theory. The methods are illustrated using an applied example on the cost-effectiveness of antiviral therapy for chronic hepatitis B. The main result is a mathematical solution for the expected time spent in each state in a continuous-time Markov model. It is shown how this solution can account for age-dependent transition rates and discounting of costs and health effects, and how the concept of tunnel states can be used to account for transition rates that depend on the time spent in a state. The applied example shows that the continuous-time model yields more accurate results than the discrete-time model but does not require much computation time and is easily implemented. In conclusion, continuous-time Markov models are a feasible alternative to cohort analysis and can offer several theoretical and practical advantages. |
Bryce Canyon National Park is not a canyon but rather a series of 14 huge amphitheaters with spires, pinnacles, windows, and arches, and carved at least 1,000 feet into limestone along the Paunsaugunt Plateau. |
FROM debian:9.11
RUN mkdir /foo
RUN echo "hello" > /foo/hey
VOLUME /foo/bar /tmp /qux/quux
ENV VOL /baz/bat
VOLUME ["${VOL}"]
RUN echo "hello again" > /tmp/hey
|
Polycyclic aromatic hydrocarbon biodegradation in extracellular fluids and static batch cultures of selected sub-tropical white rot fungi.
Four sub-tropical white rot fungi, Trametes versicolor, Trametes pocas, Trametes cingulata and isolate DSPM95 were studied alongside the well studied white rot fungus, Phanerochaete chrysosporium, for their ability to remove polycyclic aromatic hydrocarbons (PAHs) from culture media. Both static shallow cultures and extracellular fluids were studied using media contaminated with a defined mixture of the PAHs; fluorene, phenanthrene, anthracene, pyrene and benzo(a)anthracene. With all isolates, the total loss of the parent compound in 31 days was high for fluorene, at +60%, phenanthrene at +40% and anthracene at +42%. Biotransformation of pyrene and benzo(a)anthracene by all the isolates was low, with the highest reduction of pyrene of 15.2% and benzo(a)anthracene of 15.8% being achieved with P. chrysosporium. Disappearance of the more condensed PAHs, pyrene and benzo(a)anthracene, increased in shallow static cultures with the addition of glucose and glucose oxidase as a source of additional H2O2. The addition of Mn2+ and ABTS (2,2-azino-bis-(3-ethylbenzthiazoline-6-sulfonic acid)) to culture supernatants was associated with higher levels of biotransformation. Comparison of the isolates T. versicolor, T. pocas, T. cingulata and isolate DSPM95 with P. chrysosporium showed that these strains were competitive in the reduction of the PAHs, reducing the PAHs by more or less the same magnitude. Also these sub-tropical isolates did not accumulate a lot of HPLC detectable metabolites as much as P. chrysosporium. |
EELS analysis of cation valence states and oxygen vacancies in magnetic oxides
Transition metal oxides are a class of materials that are vitally important for developing new materials with functionality and smartness. The unique properties of these materials are related to the presence of elements with mixed valences of transition elements. Electron energy-loss spectroscopy (EELS) in the transmission electron microscope is a powerful technique for measuring the valences of some transition metal elements of practical importance. This paper reports our current progress in applying EELS for quantitative determination of Mn and Co valences in magnetic oxides, including valence state transition, quantification of oxygen vacancies, refinement of crystal structures, and identification of the structure of nanoparticles. |
COACH MITCHELL: I would thank you for coming out early on a Tuesday morning to cover our program. We appreciate that very much. The academic needs of our team this semester required us to practice in the morning, so some of our seniors could get some classes they needed for graduation in the afternoon. Hope it's not too much of an inconvenience, and again, very appreciative of you all coming out and covering our program.
I was down in Birmingham last week, and we were doing some different things for media day, and we were doing some promotional work to promote women's basketball and doing one of these commercials, and the league asked me to describe myself in one word. That's a difficult job, but they wanted me to do it in a very short period of time. So my mind started racing, and started thinking, how would others describe me? So I started thinking, how would Jenna describe me in one word, and I thought about that for a second and I quickly moved on because I didn't want to use that.
Then I started thinking about how the players might describe me and words like crazy, nuts, not that smart; that's three words, so I moved on from all that. I landed on grateful, and I would describe myself this morning as very, very grateful to have a seventh opportunity to coach the Kentucky Wildcats. I thank God for that. There's just no way I would be here and had the opportunities I've had at Kentucky without the strength that God has provided me and my family and the people in this program. So give all the glory and praise to God this morning for that.
Just a quick personal update. We had a little baby, Presley Blue, six pounds, 12 ounces, future shooting guard here at Kentucky if they don't fire me before then. She is doing well. Jenna is doing well. Our family is just so blessed. We thank God for that, as well. Things are really good.
Before we talk about this current team, I just want to express my gratitude and tell you how grateful I am for all the former players that have helped us move into this position because we are in a different position than we were five or six years ago. Players like Carly Morrow and Victoria Dunlop and Lydia Watkins and Amani Franklin, A’dia Mathies, those kind of kids that came in here and really did things not their own way, but they embraced the Kentucky way, which is honesty, hard work and discipline. Really grateful to them, and we find ourselves with this '13-'14 team in a great position to have an outstanding season, and so we would not have been able to do that with all the efforts of the people that have come before this team.
This team has been a lot of fun to coach so far. This is the 17th practice this morning that you all will have a chance to observe, and they've made tremendous progress during that time. They showed up in tremendous shape and their conditioning was strong when they showed up for practice, so they've been a great group to work with. It's a lot of fun to be around them. I think they want to be a championship team.
What we're focusing on this year is real, real simple concept. It's not going to be easy, but it's real simple. We just want to try to be our very best, and we talk about that virtually every day. If we can become our best, we can have a terrific season here at Kentucky.
With that, I'll open it up for questions. We're excited to get started.
Q. This might be basic, but what about the time difference with practice? How has the response been, because that is a change in the routine.
COACH MITCHELL: It is a different situation than we've had in the past. One thing that equips our players to be able to handle that, especially early in the season and in the preseason, we've always trained in the morning. In the summer they train in the morning. They're up even earlier. This is a bit of a break for them. They're up even earlier in the summer. It's unbelievable what our players do when they choose to come in and go through the voluntary workouts during the summer. They're up before 6:00 every morning training.
In the preseason we've always tried to instill some discipline in our team by practicing early in the morning, and so I think we were probably better equipped to handle it than if we had had no experience over the years of going early in the morning.
They get started about 7:40 each morning. We huddle up and circle up and then get going after that. There's a lot of folks in the world going to work a lot earlier than that, so it's not all that tough. And the players have just handled it great. We've had very spirited sessions and have worked very hard, so the early practice time I think has a lot of benefits, and they've handled it well.
Q. Could you just talk about Makayla Epps and how you feel she's come along and where you see her fitting in this year?
COACH MITCHELL: Well, Makayla is someone we're very grateful that she chose Kentucky and we're excited about her talent level, and what I've been impressed by is her character. She comes in with a lot of accolades and with high expectations. I'm very impressed with how she has handled all that. Wherever she's had a deficiency and freshmen coming in with some gaps, whether it may be effort because they're not used to the pace of practice or whether it may be conditioning or whatever it is, freshmen have an adjustment period, and every time Makayla has had something presented to her where she needed to get better, her response has been phenomenal. She's proven to be very receptive to coaching, and so when you get a real talented player who is not afraid to address her weaknesses, that's very, very exciting for a coach.
Makayla is so versatile. She can literally play every position on the floor for us, and we've had some versatile players before. The thing that sort of makes her different is she can legitimately play the one, the point guard position, which is the most difficult position on our team to play.
So she can play them all and play them all well, and so we're really excited about her. Last night we had our tip-off celebration with our booster club, and we talked to her and she addressed the crowd, and she said she's just here to help and she wants to win championships. So just is a very humble attitude for a player of that caliber and is exciting for a coach to see. So I'm very optimistic about her future, and I think she has a chance to have a good freshman season.
Q. Just talk about the depth that you have at this point in the backcourt. I think you have five McDonald's All-Americans now at the various positions back there and what that can do for you.
COACH MITCHELL: Well, I have found this: They don't teach much defense at the McDonald's game. They're not working very hard on the defensive end of the floor, so some of the McDonald's All-Americans have a bit of an adjustment period when they get to Kentucky from that respect.
You know, what I love about our entire team is the talent level, and I don't know where we would land on the most talented team in the country, but we have a very, very talented team, and they are all mobile and agile and athletic. I think that gives us an advantage if we can find a way as coaches to put them in the right positions.
The thing in the backcourt, what I think makes us have the potential to be very dangerous is that anybody really can get the basketball and get it up the floor. That helps with the tempo issue of really pressing the issue tempo-wise. You don't have to wait for one player to come get the ball. And right now in practice, which this is very early and could change and has changed before in our program, but right now Jennifer O'Neill and Janee Thompson are getting the majority of the reps at the point, and they are both so fast and so explosive and both are shooting the three so well that that's two point guards that can keep the pace going, but then you can outlet it to virtually anybody, Kastine Evans, Bria Goss, Linnae Harper, Makayla Epps, really just anybody can take that and push the ball down the court.
It helps you offensively and defensively just to keep the level of intensity up and keep the tempo up, and those are all things that are valuable here at Kentucky.
COACH MITCHELL: You know, DeNesha is very, very talented, and what I try to impress upon her is we have a very important season ahead of us, but also she has a very important future ahead of us beyond this season. I have in my mind a real sense of urgency to try to complete the job that we started. She came here because she wanted to become a complete player, and she wanted to really reach her potential, which is another way of saying she wants to be her best.
I'm just looking for that. She has so many physical gifts. She's such a versatile offensive and defensive player, another player that we love because she's so versatile. What I think she needs to do is just take that approach every single day of believing in herself and making sure that happens before practice starts and then practice with that belief I think is really the key for her to break out and be -- and I think she ought to be one of the top 10 or 12 players in the country. I think she should be an All-American. I think she could work herself into the position of being a top-five draft choice.
All of those things are going to happen. I don't think physically, I think it's going to start mentally and emotionally for her.
Just her believing in herself and coming to practice every day, pushing herself to be the best, because she has everything that you need to be an All-American type, SEC Player of the Year type, first-round draft choice type, long professional career ahead of her if she can get those mental and emotional things that will help her stay strong. I think that's really the key for her.
Q. When you make three Elite Eights in this stretch of time, how much time do you spend thinking about the next step, the Final Four, and what do you think separates you from getting there at this point?
COACH MITCHELL: I spend a lot of time thinking about where this program would be and what it would look like if we are the very best we can be. So I think the best version of Kentucky women's basketball is year in and year out one of the top five or six teams in the country. I think that leads you to Final Fours. I think that leads you to think about national championships. So that's sort of an overall thought that drives you every single day.
I don't sit there every day thinking, oh, we've got to put this play in to get to the Final Four. It's not that kind of thought process. It's more of a ‘what kind of culture do we need here, what kind of players do we need here, what is our mission to be our best?’ Not all of that is wrapped up in a Final Four or national championship. A lot of it has to do with what kind of people are we producing, what kind of preparation are we giving these young women for life. So I think about those things a lot.
I sort of think if we can get the right kind of people here operating at a real high level of character and work ethic and some of those intangibles, I think the basketball side is going to take care of itself. If you have talented players that work really hard and do their best, then you'll end up in a good spot. So that's what I'm thinking about every day. As it relates to getting to a Final Four, I don't know that it's any one thing. I think there's a combination of things. I think we've seen that in the women's game, being a No. 1 seed greatly, greatly enhances your opportunity to go to the Final Four. That's just historical.
So the way you do that is you don't lose very many games. You've got to win games, and I think this team, with our regular season, every game that's on our schedule I think we could win it. So that's a good spot to be in going into the season. And so to be a No. 1 seed I think you have to just try to see how many of those you can win, and I think that would be the next sort of logical step for us is try to get from a two seed to a one seed, and those are just having the mental strength and focus to win a game on the road at South Carolina like we lost last year or win the LSU game that we lost. I don't know that it's any one big glaring deficiency that we have. I think it's just more little things we'll have to pay attention to, and that gets tough to do day in and day out in a long basketball season.
That would be what I think -- that's the best answer I'd have on how to get to a Final Four or win a national championship.
Q. Does this team have a go-to player on the roster like A’dia was for you the last few years?
COACH MITCHELL: It's just too early to tell. We're still going at each other every day and it's really intense competition and different people are doing well. I think there are a lot of candidates, but sitting here this morning after 16 practices and with the 17th practice underway, I don't have that answer for you. A lot of good options there and we'll just see how that develops.
You know, a lot of times that's a bit more involved than just your physical ability. That's another who reacts well in those situations. So I think as we get in those situations, we will find out. From a coaching standpoint the ball to get to DeNesha Stallworth would be at the top of any list right now. I would want the ball in her hands just from a physical standpoint. She can make plays. I have a lot of confidence in a lot of the players, but I think DeNesha is probably the most gifted and talented offensive player that we have.
Q. You talked about your backcourt versatility this season. Last season you had struggles with identity in the backcourt. Do you think that'll be a problem again this season?
COACH MITCHELL: I think our players in the backcourt, as much as we can as coaches, it's a difficult situation sometimes for them because we value versatility so much, and we play so many people, I think you need to, the best you can, establish what roles players are playing and what they need to do out there.
One thing that we like here at Kentucky is not putting anybody in a box or telling you what you can't do so sometimes that makes defining roles a little bit more challenging. But I think from what I've seen so far that we're not going to have any problems with who we want to be and who we're going to become with our players, and I just think that we have the makings of a very explosive team and our backcourt will be a big reason for that if that happens.
Q. When you're talking about the chance to win a national championship and you look up there and you see there's a chance, Lexington, Louisville, Nashville, where you could be playing, do you kind of feel karma? Do you talk about that with your team?
COACH MITCHELL: I do a bad job of that. I haven't talked to the team about -- I don't even know that I've even mentioned to them that we got the first and second round. I probably need to go over that with the team and tell them -- I've had my hands full here the last couple weeks and that slipped by me.
The day they announced that, of course Jenna had to have the baby on that day, all right, and so I was all tied up. I could barely even comment on that. We were so full with responsibility at the hospital. But that was funny, the day that Presley was born was the day the announcement came, so that was really a happy day, a little added bonus to it.
We're so appreciative of everybody here at Kentucky that -- you just don't write on a piece of paper we want to have the first and second round and you get it. A lot of people did a lot of hard work to get that done, and it is an incredible advantage. You think about we have gone on the road the last four years, and three of those years we've been able to find a way to get to the Sweet 16, where a lot of the top programs have hosted, and I just think it's a big, big advantage that I need to probably share with the team of the opportunity that they have. We've been the last four years 62-3 down here at Memorial Coliseum, so we know it's a place that we've had some success, and to have your first and second round game there if you can do the work that gets you into the tournament, that's a big advantage.
I just usually -- this time of year I try to stay so focused on daily progress, the daily process of trying to build the team that we don't get ahead of ourselves a lot and talk about the end a whole lot. But just sitting here visiting with you good folks, that's a huge development for us where we could stay here and play. So we'll work hard to get into the tournament, and we will enjoy if, in fact, they do the work, and I think they will, we'll enjoy being here in Lexington.
And I have not looked at it closely enough; I'm not sure if they're trying to keep everybody close to home, but if we could go over and be fortunate enough to win the first two and play in Louisville, we've had success there in the NCAA Tournament four years ago, and you know our fans would be excited about that. It would be wonderful if that's how it played out.
Right now we're just trying to become the best we can be, and if this team will do that every day, we'll end up in a good spot in the NCAA Tournament and hopefully set ourselves up for a real successful run. A lot of work to do before that happens.
Q. People think of you as kind of a defensive-minded team but a lot of your players said you focused on offense a lot this summer. What is your goal with that and what did you see and do you think it'll show up on the court?
COACH MITCHELL: Well, the last two years we've gotten to the Elite Eight against a very good, strong UConn team. They were very good defensive team and they were also a very good offensive team. I just didn't feel like in either one of those games we did as well as we could do offensively. I thought a lot of that, particularly in last year's game, was our lack of poise in that position leading to some bad shots, which really fueled their offense. Their transition offense is really where they killed us and I think more of a product of us not playing poor defense but us playing poor offense and taking bad shots, which led out to transition for them.
You know, as you go through self-evaluation process, we scored a bunch of points last year against some really good teams, but we've been there at the precipice of the Final Four three times now, and in all three games I felt like our offensive execution could have been better. I just think that we need to make sure as coaches we give them enough opportunity to get to a spot where they, under pressure at the most important time, can execute.
So it's a challenge to become your best, but we're just trying to do that every single day. So I think that where we are as a program and how hard we've worked on our defensive fundamentals, if you watch our practice, those kind of things are really engrained in working hard. So I think trying to pay a little bit extra attention to offensive execution will serve this team well, so that's been the goal.
And also in the summer we were so happy to be able to work with our players, but we also didn't want to lengthen the season to a spot where it just becomes no fun. We all start out playing the game on some court shooting the ball into the hoop, and that's usually what people fall in love with. You don't start out the first experience in basketball doing defensive explosion drills. We just tried to make sure that the players were having a productive summer but also it not become a tremendous grind, because the season we'll practice -- if this team does what I think they can do, we'll practice over 100 times. We'll play in nearly 40 games.
The season is tough and it's a grind. To try to get better and to try to make sure it was a productive summer, that's what we focused on.
Q. Are you seeing advantages now?
COACH MITCHELL: Am I seeing advantages now? Yes, yes. Have we progressed offensively? I think so. I think we're much further ahead after 16 practices than we were after the 16 practices last year. But the summer really helps with that.
Q. You talked about the summer conditioning program your players undergo. What sort of conditioning program did you have to undergo to pull off that dance the other night?
COACH MITCHELL: Well, it was very intense to get in a position to perform in front of 23,000. It's no small task. It's very intense. You have to come prepared, there's no doubt about it.
The real issue, I think, just the elephant in the room, is everyone wants to know how did I do the split and how did I get to that position at 42 years old, and let me tell you, it was not easy to do.
Here's what happened: On about -- I had so much free time in September with the recruiting and a very pregnant wife, I had a lot of free time in September to focus on the dance. I thought y'all would laugh; it was a joke. I had no free time in September.
So October the 1st we brought the team together. It's a very, very involved process. We have costume designer, we have dance choreographer, we bring the team together and say, hey, look, it's 18 days, what are we going to do? So the dance choreographer Dawn Walters, God bless her, says you have to do this split. So on October 1, I could barely just get into the position stationary. I was sitting on the floor and I was like, there's no way I can get this done. So she said, well, this is called stretching. You're going to have to stretch. So over the next 17 days you see the results. I did the work, I stretched out, and we really -- the video before the dance would have been -- we could have sold that. I danced for about 45 minutes back in the dressing room to try to get my muscles loosened up to get the split, so we did the split, and that's really all that had to happen in the dance was the split.
Q. Can this serve as an example to your team that anything is possible?
COACH MITCHELL: There's no doubt. If you're willing to prepare and willing to take risks to get out of your comfort zone, you can do it. That is a great message to the team. That was a fun, fun night. So yeah, there was quite a bit of stretching that went into the preparation.
Q. What have Linnae and Makayla done to the practices in your backcourt, and also the significance of them as recruits? Obviously Linnae is the top rated recruit you've gotten here, and Makayla is one of the best players in state history.
COACH MITCHELL: Well, they've added talent to the practices. They're very talented players. They're high-character young people that I enjoy being around. They're behind defensively. They're just behind because of where our program is and the quality of players in it. But they're making up ground every day, and this week, which is really the third full week of practice, I've started to see them start to narrow that gap and start to catch up and start to sort of get more comfortable with where they are. But they're both really high-quality, high-level players. They'll do well when they come every day and understand how important it is to give a great effort.
You know, Makayla and Kyvin, and Linnae, when they walk into the gym, nobody on our team is concerned with where their recruiting ranking was at all. They're just concerned with can they become a part of our defensive scheme and can they produce offensively. All the recruiting stuff is good because you're getting talented players, but it just doesn't really make anything happen for you on the court.
I think that they'll be very successful players here because I like their attitude and I love their talent level.
Q. Looking at the stats from last season, you could say that Jennifer O'Neill's game play was kind of inconsistent from game to game. What have you all worked on just in these first few weeks of practice to help her have more consistent game play?
COACH MITCHELL: Just continued to work with Jennifer on her mental approach to the game and her emotional approach to the game. She's another example of a player that is so physically gifted, I never grow tired of watching her in practice with the ball in her hand. She is so fast and explosive, and I get excited several plays during the practice, she'll do things that you just can't teach anybody to do. She's so explosive. It's the plays where I can teach her to make better decisions with the basketball, don't go for the home run play, just go for the easy or the more simple play, things like that. That's where we are with Jennifer. It's a mental battle every day where she can make good decisions, and it's an emotional battle every day to let go of the bad and get on to the next play and refocus.
So that is where you will see a lot of our players finally end up at their very best is when they pay attention to the mental and the emotional side of their games I think is really the key because Jennifer is a great example. She has everything you need: Great speed; she's not that tall but she's very strong and tough; she can jump; she can run; she can handle contact; she has great court vision; she can shoot the three. Physically there's just not a lot of deficiencies in her game except for possibly how tall she is. Other than that, she has everything. So now it's just her making sure she can handle things properly.
So that's the coach's job, I think, is to make sure that you are paying attention to that and you are supporting that player in that process and thinking about how we can make that happen. That's a great way to end the discussion today is that's really going to be the key for this team are those kinds of mental and emotional situations. Can we be our strongest and our best in those, because we have a lot of physical gifts.
Really appreciate you guys covering the program. Thanks, everybody.
FastScripts by ASAP Sports
Kentucky Student-Athletes
#0 Jennifer O’Neill, Jr., PG
On the intensity during practices...
“Everyone is getting up early and putting work in, this whole summer everyone was working hard. We’re learning a new offense right now, so it’s taking time to get adjusted because it’s new. It will benefit us because it’s changing the way we play as far as pace and not just going 100 miles per hour the whole time.”
On if it was tough to get over the end of last season...
“It’s something you always remember, but if you dwell on it you aren’t going to improve this year so there is no point in dwelling on it now.”
On the freshmen...
“They are doing really well. Linnae (Harper) is doing really well, (Makayla) Epps is working hard and Kyvin (Goodin-Rogers) is doing the same thing. The good thing about them is they mesh really well together and the fact they didn’t have to come in by themselves like Janee Thompson, is helping them a lot.”
On having a positive mindset...
“I have to make sure my mental state is right when I come to practice, as far as not getting frustrated with myself and being impatient because we’re running a new offense and I tend to get frustrated with myself. When I get frustrated then my teammates get frustrated and that isn’t benefitting anybody if I’m not controlling myself. I’m the person who has to run the team so I take full responsibility for that, but it’s definitely something I’ve been working on and I feel like I’m getting better at it.”
On the freshmen guards...
“I love both of them. I played with Linnae Harper in high school and I’ve actually been playing with her my entire life, so I’m super excited she’s here. (Makayla) Epps is a phenomenal player and she’s been pushing me and Jen (Jennifer O’Neill) to get better every day in practice. They’ve both been doing really well.”
On if she was telling the team about Harper before she arrived on campus...
“Definitely, Linnae is an amazing player and she has all types of accolades that reflect the type of player she is and I was definitely bragging before she got here.”
On what practices have been like for the backcourt...
“It’s rough sometimes because we’re adding a lot of new stuff, but with the talent we have it’s so much fun. There are all sorts of highlights and fun stuff we can do based off the amount of talent we have.”
On the possibility of playing at home in the first and second rounds of the NCAA Tournament...
“It means a lot because our fan base is so passionate and they are so passionate about us. They bring us so much energy, so that will definitely be a plus once we start playing games here.”
#5 Kyvin Goodin-Rogers, Fr., F
On how practice has been going so far...
“It’s going pretty well so far. I’ve adjusted quicker than I thought I would. It’s tough but you just have to do what you need to do to be prepared.”
On the difference between high school and college...
“You have to be more focused and know what’s going on. You have to know what play to run and how to run it. You always have to be prepared.”
On the difference between the 3 and 4 position in college compared to high school...
“There’s a lot more movement. There’s a lot of involvement with the 3 in the play because in high school I just had to set down screens, pop and shoot.”
On if a certain player has helped her the most...
“I would say Jelléah (Sidney). She’s helped me since I’ve been here and she’s been very helpful.”
On the team’s goals for the season ...
“We are trying to work on getting over the hump, and doing whatever we can to knock down every opponent. We will give our best each night to try and reach our goals. The biggest mental obstacle we all face is focus. Being able to stay focused when we play good defensive teams that try to take us out of our offense because they think we are just a run and gun team. Our focus in tough situations is not letting adversity affect us and being able to stick together through it are all challenges.”
On being a leader as a senior ...
“With me it’s more by example. I’m not a really vocal person. I just try to give my best, and go as hard as I can so the freshmen can watch me do what I do. As far as the physical aspect I try to lead by example. I’m just trying to work hard to get my defense down so when the season gets going I can be one of the major contributors on the defensive end.”
On how the team’s freshmen have integrated so far in the preseason ...
“The freshmen are really good. They are still trying to get going, but I think they’re going to be a major help to us, especially on the wing. All of them can shoot, so that’s a help behind the arc.”
#11 DeNesha Stallworth, Sr., F
On the team’s expectations...
“Everything. SEC Champions, (SEC) Tournament Champions, Final Four, National Champions. We are trying to do it all. We have been doing really well in practice and are going to keep getting better daily.”
On her personal expectations and how her game has changed since last season...
“I am just trying to be more consistent and help out my teammates more by not taking those plays off or taking games off. That is my main focus, consistency and working hard for my team.”
On head coach Matthew Mitchell dancing at Big Blue Madness...
“It’s crazy, but that is what he does. He is so enthusiastic and such a great entertainer. He did a great job.”
On if she feels pressure with Coach Mitchell saying she is the most gifted player on the team...“I don’t feel any pressure at all. When he says things like that it is something that players should believe in. I think he is really just trying to build confidence in everybody. I will take full responsibility in doing that and trying to get better for my team.”
On potentially playing the first and second rounds of the NCAA Tournament in Memorial Coliseum...
“I think the excitement and urgency will be 10 times more because we know what it means to us and the fans know what it means to them. The way we play for our fans is really important, so for them to be there for us will be very beneficial.”
On what the offense looks like at this time compared to last season...
“To begin with, we’ve all gotten in the gym a lot more. We’ll see each other in the gym all throughout the day and sometimes late at night, whereas I didn’t really see that my first two years. Also, just being able to break down our offense during an installation period we have during practice. The focus is really there this year.”
On the freshmen...
“We see a lot of heart. Makayla (Epps) said it best last night at our banquet when she said she was here to help (in any way) get us to the National Championship. That just opened my heart because if they are here to help the seniors and the coaches then I have to be there to back them up.”
On if she sees herself as more of an emotional leader this season with A’dia Mathies gone...
“Those are some big shoes to fill because there won’t be another player like A’dia, but I think my role needs to be more of an aggressor or attacking scorer. I just need to have the mindset going into the game that any situation that’s thrown to me, I should be able to handle it with no pressure.”
On her goals this season...
“Just to be a better player and a better person on and off the court. Obviously, we want a national championship, but it takes time, day-by-day, step-by-step to get there, and I think with this group, we have a talented group and a lot of depth. I think if we work hard and do what we have to do we’ll be successful.”
On the guard play...
“It’s pretty good, our backcourt is nice. Our backcourt can upset some games and be pretty good.”
On the depth of the guards and being deep...
“I think so, with practices going well and how fast we go with the tempo, and a hard defense, I think our backcourt, and how much we pressure on defense, will make it easier on offense. We’ll be pretty good.”
On her bond with Makayla Epps...
“Yeah, we’re really close. We met at the McDonalds All-American game, and ever since we’ve always stayed in contact. We always talk to each other and help each other. I think our bond is even deeper.”
On how practices have gone so far ...
“I’m playing more freely. I think I just let go a little bit. It’s my senior year. I have nothing to lose at this point so why not go all out? The talent level is great. I think all of us are talented. The freshmen are talented, but yes they are behind, which is to be expected because they’re only freshmen. The veterans have been doing a pretty good job of keeping them ahead of the game, trying to help them out.”
On her goals for her senior season ...
“I think we all want to reach the next step from the seniors down to the freshmen. It’s something we have been talking about since I’ve been here. I think we actually have a chance to do it this year. You never know. Of course that’s what we are thinking about but we will see how it goes.”
On focusing on offense ...
“We are working a lot on our offensive execution. That’s something we struggled with last year. That is a big reason we lost to UConn (in the NCAA Tournament Elite Eight). We couldn’t execute our offense. We are doing a great job with that this year. That’s definitely what we are focusing on. We added a few new things, but mostly things are still the same as far as our plays. We are just working on it more. We have a drill that’s called ‘perfect execution.’ If we don’t run it perfectly we have to get on the line and run. It is putting things in perspective and helping us focus.”
On Coach Mitchell saying she has the ability to play all five positions on the court...
“I’m a taller, stronger and larger point guard than most of the guards out here, so whoever is guarding me is primarily going to be smaller than me. That’s what we’re looking for are mismatches and right now I’ve been playing the one through the three positions. Coach Mitchell knows what he’s talking about, so if he believes I can play the 4 or the 5 then I can.”
On playing the point guard position in college...
“Playing the point guard is more of a challenge than it was in high school because the talent and the competition is so much more intense. They push me to my limit every day and I get better day by day. I feel myself getting better. I’m so much better now than I was back in March when I played in the state tournament. Every day they are just pushing me to get better.”
On if she will play other positions throughout the season...
“We’re a team of seven guards out of 13 players, so we are guard-heavy. I’m just going to go out there and if he puts me at the 1, then I’m going to handle the ball and run the game, but if he puts me at the 2 or 3 then I’m going to do what I’m told to do.”
On what she has seen defensively from the team in practice...
“The defense here is way more intense than what we ever did back in high school. We primarily played a 2-3 zone, whereas here I’m challenged to move my feet and guard my man one-on-one, so that is a big challenge for me. I’m not the strongest defensive player, but we do defensive fundamentals every day in here, so I’m getting better. I feel like I’m getting better.”
On being a senior and in what ways she is stepping up to lead the team...
“Really just a mentality and having that culture on the team that we have had the last couple of years of playing hard, always playing together and being there for each other. Just continuing that leadership role that I have had in the past and helping the freshmen along so we can make a run like we did last year.”
On possibly playing the first two rounds of the NCAA Tournament in Lexington...
“I think it is a great thing for us. If we can take care of business first and do what we have to do throughout the season to get that No. 1 seed, which is one of our goals, then the NCAA (Tournament) could be a good run for us especially having that home court advantage that we like to take advantage of.”
On taking the next step to the Final Four...
“Really just (trying to improve) our offensive mentality and taking open shots and having great offensive execution. Some of the things that some better teams have done to take us out (of the NCAA Tournament). Some of the things that we have done over the summer and early preseason are offensive execution and just being really consistent on the offensive end.”
On her being a leader...
“I laugh because they call me, ‘Momma Kas’. Everybody has their mom and sometimes you have to be hard on them. That is the role that I have taken and something that I want to do. Really, I am just trying to be that front leader and help everybody out. If they have questions they can come to me and ask. Just being that person they can come to and being that backbone.” |
Multilobular tumor of bone in the mandible of a dog.
An 8-year-old Siberian husky dog was presented for a mass involving the rostral mandible. Intraoral radiographs demonstrated diffusely irregular bone and displacement of all mandibular incisor teeth. The mass was diagnosed as a grade I multilobular tumor of bone based on incisional biopsy. A bilateral rostral mandibulectomy was performed with tumor negative margins. Oral examination at 14-months following surgery indicated normal healing with minimal side effects and no evidence of tumor recurrence. |
Q:
KNMultiItemSelector preselectedItems Not Working
I'm trying to implement KNMultiItemSelector in my code to select multiple items in an array. I've been trying to get the selector to show some of the items as checked off upon initialization but it doesn't seem to work. My code is as follows:
for (Option* option in optionssList) {
NSString* name = [NSString stringWithFormat:@"%@", option.name];
KNSelectorItem* item = [[KNSelectorItem alloc] initWithDisplayValue:name selectValue:option.id imageUrl:nil];
[items addObject:item];
if ([_selectedOptions containsObject:item]) {
NSLog(@"Already selected");
[_selectedOptions addObject:item];
}
}
KNMultiItemSelector * selector = [[KNMultiItemSelector alloc] initWithItems:items
preselectedItems:_selectedOptions
title:@"List"
placeholderText:@"Select Options"
delegate:self];
selector.useRecentItems = YES;
selector.maxNumberOfRecentItems = 5;
UINavigationController * uinav = [[UINavigationController alloc] initWithRootViewController:selector];
uinav.modalTransitionStyle = UIModalTransitionStyleFlipHorizontal; // iPhone
uinav.modalPresentationStyle = UIModalPresentationFormSheet; // iPad only
[self presentViewController:uinav animated:YES completion:nil];
Any help would be appreciated. Thank you!
A:
You are hitting a bug in KNMultiItemSelector: The KNMultiItemSelector initializer ignores preselectedItems. To work around the bug, set selected to YES on the items you want selected, and ensure that preselectedItems is non-nil. (It need not contain the preselected items.) For example:
KNSelectorItem *item = [[KNSelectorItem alloc] initWithDisplayValue:@"Item"];
item.selected = YES;
KNMultiItemSelector *selector = [[KNMultiItemSelector alloc] initWithItems:@[item]
preselectedItems:@[]
title:@"List"
placeholderText:@"Select Options"
delegate:self];
|
Q:
Need help understanding MySQL PACK_KEYS
I am using a BIGINT to hold an id number that will increment from 1. In one table this will be the Primary Key and will, of course, be unique; in other tables it will be a foreign key. I'm trying to figure out whether this key will be "packed" if I set PACK_KEYS, since there will be a lot of leading zeroes.
I'm having difficulty understanding the MySQL doc for the PACK_KEYS table option in table creation. Here is the relevant quote from the doc:
When packing binary number keys, MySQL uses prefix compression:
Every key needs one extra byte to indicate how many bytes of the
previous key are the same for the next key.
The pointer to the row is stored in high-byte-first order directly
after the key, to improve compression.
This means that if you have many equal keys on two consecutive rows,
all following “same” keys usually only take two bytes (including the
pointer to the row). Compare this to the ordinary case where the
following keys takes storage_size_for_key + pointer_size (where the
pointer size is usually 4). Conversely, you get a significant benefit
from prefix compression only if you have many numbers that are the
same. If all keys are totally different, you use one byte more per
key, if the key is not a key that can have NULL values. (In this case,
the packed key length is stored in the same byte that is used to mark
if a key is NULL.)
They've lost me with "many equal keys on two consecutive rows,
all following “same” keys usually only take two bytes (including the
pointer to the row)". Can someone interpret the above doc for me, in light of what I'm trying to accomplish? E.g., for a primary key there won't be ANY "equal keys" - on two consecutive rows, on three consecutive rows, on 100 non-consecutive rows... or whatever they're driving at.
Thanks!
A:
Chances are you do not need PACK_KEYS. I see you are using BIGINT for your PK. How many rows are you looking at having in this table eventually?? What kind of data are you storing? How do you intend to retrieve/report on it and how often?? These are things I would consider first before using this feature.
If I read that documentation correctly, it's basically stating that if you have two consecutive records with long PKs say:
PK-x: 1002350025789001
PK-y: 1002350025789002
With PACK_KEYS, PK-y now becomes something like "[pointer to PK-x]2"
It's basically a way of saying PK-2 is the same as PK-1 except for the last number which is 2... without having to rewrite/store the same refix/preceding numbers.
The gains from this are most likely only realized when you are dealing with very long PKs and will mostly be gains in storage/memory, however I would imagine there's a cost to overall performance which may or may not be noticeable depending on how much access load that table gets.
May not be worth it... I've never used this feature, and I've built some pretty heavy apps on MySQL.
hope this helps.
Good Luck
|
Inactivation of the PTEN gene by mutation, exonic deletion, and loss of transcript in human oral squamous cell carcinomas.
PTEN, a tumor suppressor gene, has been found to be inactivated by structural abnormalities or epigenetic changes in several types of human cancers. Recently, several studies have also suggested the possibility that the PTEN gene is a target of genomic instability in human cancers displaying microsatellite instability (MSI). To investigate the role of PTEN in human oral squamous cell carcinomas, we screened the entire coding region sequences and examined the expression of the PTEN gene in 81 oral cancers displaying microsatellite stability (MSS) and 5 oral cancers displaying MSI. Mutation of the PTEN gene was identified in one MSS cancer (1/81; 1.2%) and three MSI cancers (3/5; 60%). The MSS cancer harbored a missense mutation from Ala (GCA) to Val (GTA) at codon 137. Of the MSI cancers containing the PTEN mutation, case 36 had a missense mutation from Lys (AAA) to Glu (GAA) at codon 254, case 43 contained a frameshift mutation (one A deletion) in a 6 bp poly(A) tract affecting codon 265-267, and case 64 harbored two missense mutations from Val (GTG) to Ala (GCG) at codon 222, and from Gly (GGA) to Arg (AGA) at codon 230 indicating biallelic mutation of PTEN. Genomic deletion of exon 5, resulting in loss of PTEN mRNA, was observed in two MSS cancers. In spite of an intact PTEN gene, one MSS and one MSI cancer lacked PTEN mRNA. These findings suggest that the inactivation of PTEN by either mutation or loss of transcript plays a role in the pathogenesis of some oral cancers (8/86; 9.3%). Furthermore, inactivation of PTEN was far more frequent in MSI oral cancers (4/5; 80%) than in MSS oral cancers (4/81; 4.9%). |
Q:
Concatenating bits
I have have to concatenate the bits of the int. For example:
unsigned char byte1 = 0x0F; // 00001111
unsigned char byte2 = 0xCC; // 11001100
unsigned char byte3 = 0x55; // 01010101
unsigned char byte4 = 0x04; // 00000100
After concatenation the result should be:
00000100010101011100110000001111
I tried doing smth like:
unsigned int temp = 0;
temp = temp | byte1; //the result should be 00001111 for now
temp = temp >> 8;
byte2 = byte2 << 8;
temp = temp | byte2; //the result should be 1100110000001111 for now
temp = temp >> 8;
byte3 = byte3 << 8;
temp = temp | byte3; //the result should be 010101011100110000001111 for now
temp = temp >> 8;
byte4 = byte4 << 8;
temp = temp | byte4; //the result should be 00000100010101011100110000001111
But when I print the temp, it shows 0:
printf("%d", temp) //===> gives 0
A:
Actually it seems to me the
temp = temp >> 8;
bitshifts away your entire temp value.
A:
unsigned int byte1 = 0x0F; // 00001111; //byte1
unsigned int byte2 = 0xCC; // 11001100; //byte2
unsigned int byte3 = 0x55; // 01010101; //byte3
unsigned int byte4 = 0x04; // 00000100; //byte4
unsigned int temp = (byte1) | (byte2 << 8) | (byte3 << 16) | (byte4 << 24);
printf("%u", temp);
prints 72731663 which is 00000100010101011100110000001111.
If you want to keep your inputs as unsigned char, then this has the same result:
unsigned char byte1 = 0x0F; // 00001111; //byte1
unsigned char byte2 = 0xCC; // 11001100; //byte2
unsigned char byte3 = 0x55; // 01010101; //byte3
unsigned char byte4 = 0x04; // 00000100; //byte4
unsigned int temp = byte4;
temp <<= 8;
temp |= byte3;
temp <<= 8;
temp |= byte2;
temp <<= 8;
temp |= byte1;
printf("%u", temp);
|
Korean Broadcasting System
Korean Broadcasting System (KBS) () is the national public broadcaster of South Korea. It was founded in 1927, and operates radio, television, and online services, being one of the biggest South Korean television networks.
History
Beginnings in radio
KBS began as Kyeongseong Broadcasting Station (경성방송국, 京城放送局) with call sign JODK, established by the Governor-General of Korea on 16 February 1927. It became the in 1932. This second radio station started using the call sign HLKA in 1947 after the Republic of Korea was granted the ITU prefix HL. After doing a national broadcast, the radio was renamed Seoul Central Broadcasting Station in 1948.
1950s–1960s - Move into television
Television broadcasts in South Korea began on 12 May 1956 with the first television station HLKZ-TV. It was sold to KBS in 1961.
1970s - Expansion
KBS station status changed from government to public broadcasting station on 3 March 1973. Construction of KBS headquarters in Yeouido started in 1976. In 1979, KBS radio began broadcasting on the FM wave with the launch of KBS Stereo (now KBS 1FM).
1980s - Advertising started after controversial merger
KBS began accepting advertising in 1980, differing from the norm of advert-free broadcasting by public broadcasters, after the forced merger of several private broadcasters into KBS by the military government of Chun Doo-hwan (see Controversies).
1990s - Spinoff of EBS
In 1981, KBS launched KBS 3TV and Educational FM, and on 27 December 1990, the channels split from KBS to form the Educational Broadcasting System (EBS).
After a revision of the television licensing fee system in 1994, KBS1 stopped broadcasting commercials.
2010s
In March 2013, computer shutdowns hit South Korean television stations including the KBS. The South Korean government asserted a North Korean link in the March cyberattacks, which has been denied by Pyongyang.
Structure
KBS is a public corporation (공사, 公社) funded by the South Korean government and license fees, but is managed independently. As part of the Constitution, the president of KBS is chosen by the President of South Korea, after being recommended by its board of directors. Political parties in South Korea also have the right to name members of the KBS board of directors.
Because of this system, which gives politicians effective control over choosing the president of KBS, as well as its board of directors, people who are critical of the system cite political intervention in KBS's governance as reason for revising the current system of recruiting.
Around 37.8% of KBS' revenue comes from a mandatory television licence fee of 2,200 won, with another 47.6% coming from commercial advertisement sales.
KBS' international output such as KBS World, as well as specialised services such as KBS Radio 3 for the disabled, receive public funding from the South Korean government.
CEOs
Channels
Terrestrial television
KBS1 - KBS' flagship channel, it broadcasts news and current affairs, education, sports, and culture. It launched in 1961 as HLKA-TV and is solely funded by the license fee, airing commercial-free. It is available nationally on channel 9, broadcasting via digital terrestrial television. KBS1 also airs public information films and minor entertainment programming, but the majority of which is on KBS2.
KBS2 - KBS' entertainment and drama channel, it was launched in 1980 as a replacement for the Tongyang Broadcasting Corporation, which was controversially merged with KBS. It is available on digital channel 7 via digital terrestrial television. KBS2 also airs public information films and less news and current affairs programming, but the majority of which is on KBS1.
KBS UHD - The Ultra High Definition channel. Airs music videos and re-runs of dramas. It is on national terrestrial digital channel 66.
KBS1 and KBS2 phased out analogue services on 31 December 2012 as part of the switchover to digital television.
Cable and satellite television
KBS N Life - A culture and drama channel, launched in 1995 as KBS Satellite 2. It was renamed as KBS Korea in 2002, renamed as KBS Prime in 2006 before becoming N Life.
KBS Drama - formerly KBS Sky Drama, launched in 2002
KBS N Sports - formerly KBS Sports/KBS Sky Sports, launched in 2002
KBS Joy - a comedy and quiz show channel that was launched in 2006
KBS Kids - the children's channel, launched in 2012
KBS W - a channel aimed at a female audience, launched in 2013
KBS - K Picture Media - distribution paid cartoons online
These six channels are carried by cable and satellite operators in South Korea. There are 100+ cable operators in South Korea, and Skylife is the sole satellite television service provider. These channels are managed and operated by KBS N, a subsidiary company of KBS.
KBS World
KBS World is the international television and radio service of KBS. It officially launched on 1 July 2003. It is broadcast on a 24-hour schedule with programs including news, sports, television dramas, entertainment, and children's. KBS World television is broadcast locally and around the world. As of July 2007, around 65% of its programs are broadcast with English subtitles, it is available in 32 countries, and reportedly more than 40 million households around the world can access KBS World. It has two overseas subsidiaries: KBS America and KBS Japan. KBS Japan is independently operated by a KBS subsidiary in Japan, and most programs are provided with Japanese subtitles.
KBS World television is a television channel that mainly broadcasts programs commissioned for KBS' 2 terrestrial networks: KBS1 and KBS2. KBS World television is distributed over several international communication and broadcasting satellites such as IS-19, IS-20, IS-21, Measat 3, Apstar 6 & 7, Eutelsat Hotbird 13A, Galaxy 11, 18 & 23, Badr 6, Vinasat 1, Palapa D, SES 7, Telkom 1, Thaicom 5, EchoStar 15, Anik F3. Local cable and/or satellite operators receive the signal from one of these satellite and carry the signal to end subscribers of their own networks. KBS doesn't allow individual viewer to receive the signal from IS-19, IS-20, IS-21, Measat 3, Asiasat 5, and Galaxy 18. The signal from Badr 6 and Eutelsat Hotbird 13A is Free-to-Air.
Radio
KBS Radio 1 (711 kHz AM/97.3 MHz FM KBS Radio Seoul) - news, current affairs, drama, documentary and culture. Launched in 1927 as Kyeongseong Broadcasting Corporation JODK and it became KBS Radio 1 in 1965.
KBS Radio 2 (603 kHz AM/106.1 MHz FM KBS Happy FM) - Popular music. Launched in 1948 as HLSA.
KBS Radio 3 (1134 kHz AM/104.9 MHz FM KBS Voice of Love FM) - Launched in 1980 and ceased broadcasting in 1981. It was later replaced by KBS Radio 2's regional radio service and Educational FM (now EBS FM). Later re-launched in 2000 as a spin-off from KBS Radio 2. For the first time in 2010, it was launched on FM and restructured as a radio station for the disabled.
KBS 1FM (93.1 MHz Classic FM) - classical music and folk music. Launched in 1979 as KBS Stereo, adopted current name in 1980.
KBS 2FM (89.1 MHz/DMB CH 12B Cool FM) - popular music. Launched in 1966 as Radio Seoul Broadcasting (RSB), renamed as TBC-FM in the 1970s, renamed as KBS Radio 4 in 1980 after TBC-FM forced merger to KBS, then adopted current name in 2003.
KBS Hanminjok Radio (literal meaning: KBS Korean Nationality Radio) (6.015 MHz shortwave and 1170 kHz mediumwave) - launched in 1975 as KBS Third Programme
KBS World Radio - the South Korean international radio service, funded directly by the government.
Branding
Programmes
Foreign partners
America
Europe
Asia
Oceania
Operational status
Headquarters
KBS passed the reorganisation plan on 1 January 2017, after it was approved by the board of directors. The reorganisation plan is to reform the existing six head offices and four centre systems to one office, six head offices, two centres, and one operation division. The KBS reorganization plan is to completely reform the organisation with a 'business centre', including the newly established broadcasting headquarters.
President
Board of Directors
Board of Directors Secretariat
Vice president
Human Resources office
Human Resource Development Institute
Deliberation office
Foreign Cooperation office
Innovation Promotion Team
Announcer's office
Labour Management Cooperation
Audit
Audit office
Broadcasting head offices
Organized marketing
1TV work
2TV work
Radio work
Advertising
Video production
Future Business head offices
Dynamic Growth office
Content work
Digital services
Infrastructure investment
Future Technology Institute
Reporting head offices
Integrated news room
Broadcasting office
Digital office
Coverage office
International
Sports
Commentary
News picture office
Production head office
TV program production office
Radio centre
Drama head offices
Drama Production office
Network center
Network facilities
Network operation
Namsan transmission centre office
Production Technology Division
Audience head offices
Viewer
Management information
Financial management
Organization infrastructure
Management support center
Human Resource Management
Planning office
Future Planning office
Investment Strategy office
Broadcast Culture Institute
Controversies
KBS being one of Korea's oldest broadcasters, also had controversies like SBS and MBC, but has more controversies than the two broadcasters, which has given them nicknames such as Soonkyu Bangsong and The Department of Last Resort.
1980 – Forced merger of KBS with private broadcasters
During the Chun Doo-hwan regime of the eighties, the president passed a law to force several public broadcasters to merge with the public run KBS. After these broadcasters had shown news stories against Chun, he used this law to stifle their criticism of him. It included:
Tongyang Broadcasting Corporation (TBC)
Donga Broadcasting System (DBS)
Seohae Broadcasting Corporation (SBC)
Jeonil Broadcasting Corporation (VOC)
Hanguk-FM
Munhwa Broadcasting Corporation (MBC) was also affected. MBC was originally a federation of 20 loosely affiliated member stations located in various parts of Korea. Although they shared much of their programming, each member station was privately owned. After the consolidation, however, each affiliate was forced to give up majority of their shares to the MBC based in Seoul, and MBC Seoul, in turn, was forced to give up majority of its shares to KBS.
Consequences
TBC television became KBS2, and TBC Radio became KBS Radio 4 (now Cool FM/2FM).
DBS became the now defunct KBS Radio 5. The frequency is now used by SBS Love FM.
SBC became KBS Gunsan, now known as KBS Radio 3 Jeonju.
VOC became KBS Radio 3 Gwangju
Hanguk-FM became KBS-Daegu-FM.
In 2009, president Lee Myung-bak said that the law was unconstitutional, and in 2011 TBC and DBS were revived as JTBC and Channel A respectively.
2011 – Wiretapping scandal at TV license fee meeting
In 2011, Sohn Hak-kyu, the chairman of the opposition Democratic Party, accused KBS of wiretapping the party's closed-door meeting on TV subscription charges.
Sohn said, "We believe the firm bugged the meeting to secure information about our party's handling of the TV subscription policy. KBS should admit that it resorted to the deplorable method of gathering information."
The ruling Grand National Party initially sought to put a bill concerning the TV subscription charge to a vote, but failed to do so amid strong opposition from the Democrats.
The National Assembly's subcommittee on culture, tourism, broadcasting and communication, was scheduled to deliberate on 28 June 2011, but the meeting was cancelled due to the Democrats' protest.
The scandal erupted on 23 June when Han Sun-kyo, chairman of the parliamentary subcommittee, criticized the Democrats' opposition to increasing the TV subscription charge during a subcommittee meeting.
The GNP lawmakers eventually approved a bill raising the charge by 1,000 won to 3,500 won at a subcommittee meeting in the absence of Democrat lawmakers. That led to a Democrat boycott of a June extraordinary parliamentary session for half a day on 21 June 2011.
2011 – Praising Chinilpa
Bak Han-yong (박한용), head of the Institute for Research in Collaborationist Activities, criticized KBS for censoring negative remarks from a documentary about Chinilpa individuals, and Rhee Syngman, who had pardoned them. This includes the Chinilpa Paik Sun-yup.
2012 – KBS journalists strikes and Reset KBS News 9
The journalists working for KBS (along with MBC, SBS and YTN) have protested against the biased journalism practices that favor the Lee Myung-bak government. The new union for KBS headed by Kim Hyeon-seok released a video clip "Reset KBS News 9" (리셋 KBS 뉴스9) on the internet that discusses the Prime Minister's Office Civilian Surveillance Incident and the controversial money-spending on renovating President Lee Myung-bak's alleged birth house on 13 March 2012.
2013 – Lee Soon-shin naming scandal
Global Youth League DN filed an injunction at Seoul Central District Court against broadcaster KBS for using the name "Lee Soon-shin" in the title of the drama. The injunction requested that the broadcast be halted immediately, that "Lee Soon-shin" be removed from the title and that the character name be changed. The group claimed that historical figure Lee Soon-shin (or Yi Sun-sin), an admiral famed for his victories against the Japanese Navy in the Imjin War during the Joseon Dynasty, is an official national symbol whose status will "deteriorate" when associated with the "weak and clumsy" protagonist that lead actress IU plays. KBS and production company A Story responded that they had no plans of changing the title or character name. Instead, they altered the original drama poster where several cast members are sitting on a pile of 100 won coins that have an image of Admiral Yi, by digitally replacing the coins with a plain gold platform.
2014 – 1st KBS strike against pro-government bias of its president
In early May 2014, Gil Hwan-young removed the KBS news chief after alleged improper remarks over the sinking of the ferry Sewol. The chief then accused Gil of interference with news editing, with an alleged pro-government bias.
After the board postponed a decision on whether or not to dismiss Gil, two of the broadcaster's largest unions went on strike.
As a result of the boycott, most of the broadcaster's news output was affected. The hour-long KBS News 9 ran for just 20 minutes, and during local elections on 4 June 2014, KBS was unable to send reporters to interview candidates.
The strike ended after the board of directors voted to dismiss Gil. The board passed a motion on 5 June 2014 demanding the discharge of President Gil. The majority vote decision was sent to be approved by the country's president Park Geun-hye, who has the power to appoint the broadcaster's head.
2017 – 2nd KBS strike against pro-government bias of its president
On August 2017, KBS union decided to hold a strike, which began on 4 September, due to allegedly influencing news coverage to be in favor of former president Park Geun-hye's administration. As a result of the boycott, there has been a severe reduction in the airing of KBS news programs, culture programs, radio shows, and variety shows due to most staff members taking part in the strike. After 141 days, the strike was over when the broadcasting company's board of directors approved the dismissal of KBS president Ko Dae-young.
See also
Educational Broadcasting System
List of Korea-related topics
KBS World Radio
KBS World (United States) (KBS America)
KBS World Canada
KBS Symphony Orchestra
KBS Hall
List of South Korean broadcasting networks
Korean Central Television (equivalent in North Korea)
References
External links
KBS.co.kr - official KBS Website
World.KBS.co.kr - official KBS World website
KBS America
Category:Media companies of South Korea
Category:Korean-language television stations
Category:Publicly funded broadcasters
Category:South Korean television networks
Category:Media companies established in 1927
Category:Radio stations established in 1927
Category:Television channels and stations established in 1961
Category:1927 establishments in Korea |
European Community Multicentre Trial "Fetal ECG Analysis During Labour": the P-R interval.
The aim of the European Community Multicentre Trial on Fetal ECG Analysis During Labour was to collect a clinical database of electrocardiograms on which the different patterns of ST waveform and time interval changes, so far identified, could be studied. The aim of this paper was to study the PR-RR relationship and the P wave patterns during normal labour. One thousand three hundred fifty accelerations and 350 decelerations were analysed in 618 labours, all with normal fetal outcome. All ECGs were recorded with the STAN recorder and linked to a PC system for data acquisition and analysis. A positive relationship between P-R and R-R intervals was identified in all reactive fetal heart rate traces. A P-R shortening was identified also with all decelerations of more than 40 bpm from the baseline, resulting in a negative PR-RR relationship. Experimental works have described a P-R shortening concurrent with the maximal R-R lengthening during acutely induced hypoxemia in fetal lambs. In our study normal cord acid-base status indicated that the majority of bradycardia episodes recorded were not related to acute hypoxemia: PR-RR relationship changes seem therefore to indicate an intact physiological fetal heart adaptive response to rapid change in the environment of either hypoxemic or haemodynamic origin. A negative PR-RR relationship by itself seems to be nothing more than an indicator of decelerations during labour and seems unable to discriminate between decelerations of different origin. Finally the P wave was no longer detectable during decelerations of more than 800 msec: in this situation the P-R interval can not be reliably measured. |
Q:
Expression.Convert type for Expression.Property
I'm trying to convert a Parameter expression and having trouble with converting to value types. Below is a sample of my code:
public static MemberExpression ConvertToType(ParameterExpression sourceParameter,
PropertyInfo propertyInfo,
TypeCode typeCode)
{
var sourceExpressionProperty = Expression.Property(sourceParameter, sourceProperty);
//throws an exception if typeCode is a value type.
Expression convertedSource = Expression.Convert(sourceExpressionProperty,
Type.GetType("System." + typeCode));
return convertedSource;
}
I get the following invalid operation exception:
No coercion operator is defined between types 'System.String' and 'System.Decimal'.
Any help with this conversion would be greatly appreciated.
A:
public class ExpressionUtils
{
public static MethodCallExpression ConvertToType(
ParameterExpression sourceParameter,
PropertyInfo sourceProperty,
TypeCode typeCode)
{
var sourceExpressionProperty = Expression.Property(sourceParameter, sourceProperty);
var changeTypeMethod = typeof(Convert).GetMethod("ChangeType", new Type[] { typeof(object), typeof(TypeCode) });
var callExpressionReturningObject = Expression.Call(changeTypeMethod, sourceExpressionProperty, Expression.Constant(typeCode));
return callExpressionReturningObject;
}
}
Note that the resulting expression is a call to Convert.ChangeType method, which will return System.Object.
Here is a unit test:
[TestClass]
public class UnitTest1
{
private class MyClass
{
public string ValueAsString { get; set; }
}
[TestMethod]
public void TestMethod1()
{
var parameter = Expression.Parameter(typeof(MyClass));
var property = typeof(MyClass).GetProperty("ValueAsString");
var lambdaBody = ExpressionUtils.ConvertToType(parameter, property, TypeCode.Decimal);
var lambda = Expression.Lambda<Func<MyClass, object>>(lambdaBody, parameter);
var valueAsDecimal = (decimal) lambda.Compile().Invoke(new MyClass { ValueAsString = "42" });
Assert.AreEqual(42m, valueAsDecimal);
}
}
A:
The solution I went with was:
private static Expression GetConvertedSource(ParameterExpression sourceParameter,
PropertyInfo sourceProperty,
TypeCode typeCode)
{
var sourceExpressionProperty = Expression.Property(sourceParameter,
sourceProperty);
var changeTypeCall = Expression.Call(typeof(Convert).GetMethod("ChangeType",
new[] { typeof(object),
typeof(TypeCode) }),
sourceExpressionProperty,
Expression.Constant(typeCode)
);
Expression convert = Expression.Convert(changeTypeCall,
Type.GetType("System." + typeCode));
var convertExpr = Expression.Condition(Expression.Equal(sourceExpressionProperty,
Expression.Constant(null, sourceProperty.PropertyType)),
Expression.Default(Type.GetType("System." + typeCode)),
convert);
return convertExpr;
}
Note the Expression.Condition to handle nulls.
|
Follow KDKA-TV: Facebook | Twitter
BRIDGEVILLE, Pa. (KDKA) – Regular patrons of The Phoenix BIG Cinemas in the Chartiers Valley Shopping Center might want to reconsider eating at the establishment, at least in the near future.
The Allegheny County Health Department issued a consumer alert for a “significant mouse infestation” at the theater after inspectors found “mouse droppings, too numerous to count.”
Health officials spotted the droppings in all cabinets and cup storage areas along cash register line, on the service counter around the pretzel machine, in every cabinet used to store butter dispensers, in a cabinet used for bulk candy storage and on the floor in numerous areas in the back area, among other places.
The lack of cleanliness in the food area no doubt led to the infestation. The theater was observed to have large amounts of old food spilled below the service area and in cabinets below condiment stations. The sinks and floor drains were littered with garbage, and old cookie debris are present on cookie tray on the shelves across from the dish machine.
Approximately 10-15 fruit flies were also found by health officials. |
I have been thinking about that word quite a bit lately, as this past year I have found myself "crushing" on my spiritual roots. I have been reflecting a lot on my catholic upbringing, and revisiting both the gifts and challenges that come with the territory of being born into, and raised by, a catholic family (from my humble, midwestern perspective).
That word :: RESURRECTION.
It has got me thinking about how much waiting we do, you know?
We wait for Saturday. We wait for tomorrow. We wait for springtime. We wait for retirement. We wait for the right partner. We wait for when we lose ten pounds. We wait for when we feel inspired. We wait until the New Year. We wait for someone else to do it - whatever it is....
I have come to a place of realizing that if we want to get something done, we ought to be the "Ones". Perhaps waiting around for springtime, inspiration, or.... even the "resurrection"... doesn't position us in our proper place of power in our own lives.
I reckon that nearly 25 years of not practicing my religion of upbringing now affords me a perspective I didn't have when I was "deep in it". But that word... it just keeps grabbing me. I see it on bumper stickers. I see it on Pinterest. I see it in transcripts of our politicians and even on the label of hard cider sold in our local food coop.
That word :: RESURRECTION.
What is UP with that word?
I mean, there is just something about "rising again".... which is the root of the word resurrection. What if we just did it, ya know? What if WE were the resurrection?
What if we just rose UP? Listened UP? Spoke UP? Gave it UP?
And ABOVE all that, what if we just Got OVER ourselves?
Is there any greater "rising up" than THAT? I'm thinking not.
I am not talking"religion", not even trying to be "spiritual". I am just trying to UP the ante on my own presence.
Any of the avatars -- whomever your fancy -- Ramana Maharishi, the Buddha, Jesus, even Nelson Mandela, Mahatma Ghandi and Desmond Tutu -- any of those wisemen, if we studied any of their lives, we would find a thousand reasons to raise ourselves up...
So I'm not attaching the resurrection to "you know who"... Instead, I'm just going to remind us -- that if we want things to be different somehow, we are the ones we've been waiting for. YOU are the one you have been waiting for.
Raise yourself UP - get bigger than small talk, materialism, your least (or most) favorite body part, your haircut, your house, your kids, your limited perception of who you have been led to believe you are.
Listen UP - take time to be quiet, listen for your "higher self" to give you guidance, ask your teachers, your mentors, your inspirations to help guide you and raise you UP.
Speak UP - say things to yourself, others, and the world that RAISE your vibration. Ixnay the gossip, the judgment, the criticisms, and the complaining.. Replace it with praise, gratitude, compassion. Because that other stuff only keeps you stuck.
Look UP - Seriously, raise your chin. Trust that the same force that awakens the sun everyday will ALSO raise YOU up, but you gotta keep your eyes to the sky, ya know? Feet on the ground and ayes to sky can change everything.
Give it UP - This one is huge.... Give. It. UP. You aren't the Giver. Never were. The same creator that created YOU gave you everything you have ever received. if it's too much -- if it's too hard -- GIVE IT UP. That same creator who created you is willing, waiting and ready to take it all back.
Perhaps you don't know where to start. I get that entirely. Been there -- and quite honestly, it doesn't even matter WHERE you start. It's that you DO start. But you want some direction :: I have a couple of options for you to consider .
The first is a shout out -- to a dear friend of mine, Melanie Madhuri Phillips, who is offering an Inner Empowerment Mentorship Program, a four month guided, group mentorship opportunity -- that starts next week. Madhuri is an amazing teacher and human being, who knows all about getting OVER herself -- and reclaiming forgotten pieces and putting them back together in a way that reeks of self-acceptance and wholeness. If you are looking for a community process -- I highly recommend her and this upcoming program. It starts next week.
The other option is to do one on one work with me --
Currently, my teaching and public offerings are pretty quiet, as I wind down to prepare for an upcoming sabbatical. That being said, I am offering one on one sessions for those who are ready to take their practice, their lives, or their teaching to the next level of clarity and impact. |
Colony formation by subpopulations of human T lymphocytes. VI. Further studies on colony phenotype, function, and cloning efficiency.
Phytohemagglutinin (PHA)-induced colony formation in semisolid agar medium by human peripheral blood T lymphocytes showed an increasing cloning efficiency with decreasing numbers of cultured cells. Ninety percent of CD4+ cells (inducer/helper phenotype) and 20% of CD8+ cells (cytotoxic/suppressor phenotype) formed colonies when cultured at 10-200 cells/ml culture in the presence of sheep red blood cells (SRBC) and a source of interleukin-2 (IL-2). Probably all T-colony-forming cells, but none of the subsequent colony cells, expressed the Leu-8 antigen. The cloning efficiencies of FACS-sorted cells expressing the natural killer antigenic phenotypes Leu-7+ and CD16+ were found to be less than 1%. The costimulatory effect of red blood cells for colony formation was specific for SRBC and not observed in the presence of red cells obtained from seven other species including man. All T-lymphocyte colonies obtained from unseparated peripheral blood mononuclear cells expressed the CD25 antigen (IL-2 receptor) and colonies were always composed of either CD4+ or CD8+ cells. None of the colony cells expressed the Leu-8 or the CD16 antigens. By their specific morphology in agar culture the majority of colonies composed of CD4+ cells were easily recognized, but but approximately one-third of the CD4+ colonies could not be distinguished from colonies composed of CD8+ cells. On expansion of individual colonies in liquid subculture in the presence of interleukin-2, approximately 15% of the colonies developed natural killer (NK)-like cytotoxic activity, being capable of direct killing of K562 tumor cells. It is concluded that the present method for growing human T colonies exhibits the same cloning efficiency as the most efficient liquid culture systems. Individual T colonies are composed exclusively of T inducer/helper or T cytotoxic/suppressor cells, they are never of mixed phenotype, and they do not contain cells of natural killer phenotype. Regulatory mechanisms influencing colony formation are operating between and within the various subsets of T lymphocytes. |
Introduction {#Sec1}
============
Heavy metal contamination of water bodies leads to metal bioaccumulation in various forms, posing serious threat to the ecosystem. Heavy metals (Pb, Cr, As, Hg, Cd) are released into the water by various industrial activities thereby accumulating in food chain due to the binding ability with proteins causing deleterious effects in living beings^[@CR1]^. Chromium is one of the widely used strategic metal in several industrial applications such as electroplating, leather tanning, and cement and catalyst production^[@CR2]^. Chromium alloy coatings (CrAlSiN) are used in high speed machining applications since it enhances the metal resistant properties by encountering oxidation and corrosion^[@CR3]^. Chromium exists in several oxidation states of which +3 and +6 are stable. Minimal amount of Cr(III) is required for glucose metabolism in the body whereas most of the Cr(VI) is a man-made carcinogen wherein its contamination is in limelight because of its cytotoxicity and genotoxicity^[@CR2],[@CR4]^. Within the living cell, Cr(VI) undergoes reduction by producing various reaction intermediates such as Cr(V), Cr(IV), reactive oxygen species (ROS), peroxides, radicals and finally to Cr(III) which causes oxidative damage to DNA and affects DNA replication^[@CR5]^. The USEPA^[@CR6]^ has imposed stringent rules on the safe limit of total Cr in drinking water as 0.1 mg L^−1^. Several conventional methods such as precipitation, coagulation, ion exchange, adsorption, membrane filtration are used for treating metal contaminated water among which adsorption is the most effective and economical approach^[@CR7]^. Therefore development of efficient adsorbents is necessary to remediate Cr(VI) being also important studying their reusability.
Chemical adsorbents developed to remediate Cr(VI) quite recently are xanthum gum grafted polyaniline -- zinc oxide nanocomposite^[@CR8]^, branched polyethylenimine grafted electrospunpolyacrylonitrile^[@CR9]^, polyaniline coated titanate nanobelt^[@CR10]^, MoS~2~/reduced graphene oxide^[@CR11]^ and Fe~2~O~3~/graphitic C~3~N~4~ graphene nano composite^[@CR12]^. Though the chemical based adsorbents show high adsorption capacity for removing heavy metals, their disposal is a major concern. Low cost and naturally available adsorbents such as biopolymers, agricultural wastes, microbes (bacteria/yeast/fungi) are used to remediate heavy metals as they are abundantly available^[@CR13]^. The chitosan/graphene-oxide/montmorillonite composite for Cr(VI) adsorption developed by Yu *et al*.^[@CR14]^ showed a very good adsorption capacity of 87.03 mg g^−1^. An agricultural corn bract waste was functionalised with polyethylenimine showed excellent performance for the removal and recovery of Cr(VI) from aqueous solutions^[@CR15]^. *Pseudochrobactrum asaccharolyticum* isolated from Cr(VI) contaminated soils could completely remove 100 mg L^−1^ of hexavalent chromium in 144 hours^[@CR16]^.
Microbes play a vital role in bioremediation of heavy metals by involving two mechanisms. A passive biosorption process takes place in living/non-living/dead microbes which is independent of microbe metabolism, and an active uptake which is a metabolism dependent process and occurs only in living microbes. Bioaccmulation is the process linking both active and passive modes of metal uptake^[@CR5],[@CR17]^. The direct use of microbes in its native form for metal removal has several disadvantages such as poor mechanical strength, difficulty in microbe separation from the solution and there is always a possibility of loss of microbial mass after regeneration studies. To combat the disadvantages, microbes are immobilized in suitable matrices which help to improve the cell strength, rigidity, porosity and metal removal ability^[@CR18]^. *Aspergillus BRVR* immobilized in montmorillonite and cellulose enhanced the Cr(VI) metal uptake capacity of microbes^[@CR19],[@CR20]^, the exopolymeric substances (EPS) of *Pseudomonas* strains reduced majority of Cr(VI) to Cr(III) involving adsorption coupled reduction mechanism^[@CR21]^, in an anaerobic sludge, Cr(VI) is reduced to Cr(III) by sulfidogenesis and also direct reduction of Cr(VI) was observed by chromate utilizing bacteria such as *Microbacterium*^[@CR22]^. Therefore the possibility of utilizing microbes remain promising making the microbe immobilized matrices open for exploration as suitable biosorbents.
An eukaryotic unicellular microbe *Saccharomyces cerevisiae* (*S*.*cerevisiae*) commonly known as baker's yeast is easily available and is known to have broad applications in food industry^[@CR23]^ such as wine making, brewing, baking etc., As *S*. *cerevisiae* is classified under Generally Recognised as Safe (GRAS) product, it is widely used in industrial water treatment^[@CR24]^. Sathvika *et al*.^[@CR25]^ developed microbe based biosorbents with yeast immobilized in glutaraldehyde crosslinked cellulose matrix for the effective removal of Cr(VI) with a monolayer adsorption capacity of 23.61 mg g^−1^. Titania-yeast nanocomposite showed excellent potential of 99.2% removal for hexavalent chromium^[@CR23]^.
A prokaryotic nitrogen fixing bacteria *Rhizobium* is a symbiotic, rod shaped, gram negative bacteria which is a potential biofertilizer for plants. It also helps in biological nitrogen fixation thereby influencing the agricultural productivity and is used in controlling root rot infections caused by fungi^[@CR26],[@CR27]^. The legumes inoculated with *Rhizobium* inoculants is a common agriculture practice, which is a cost effective process to provide nutrients to the bacteria. Sludge generated from the agro based industries is rich in carbon and nitrogen sources which helps in the growth of *Rhizobium* thereby offering a green alternative to treat waste water as well as reducing the cost of inoculant preparation^[@CR28]^. The activated biomass of *Rhizobium leguminosarum* could remove upto 77.3 ± 4.3% Cr(III) at 35 °C at pH 7.0^[@CR29]^. An ND2 *Rhizobium* isolate from the root nodules of *Phaseolus vulgaris* turned out to be a potential biosorbent for Cr(VI) removal as well as promoting the growth properties of plant thereby increasing the agricultural productivity^[@CR30]^. Understanding the potential of these two varied microbes is an interesting add-on for comparative analysis.
Nano- sized materials with their outstanding properties have attracted the attention of scientists and could efficiently be utilized for varied applications. The sp^2^ hybridized carbon nanotubes (CNT) is one of the interesting forms of elemental carbon categorized into two varieties. The first type is multiwalled carbon nanotubes (MWCNTs) which has concentric rings with a definite spacing between the layers and the second form is single walled carbon nanotubes (SWCNTs) which has a single layer cylinder. Significant progress has been made in the utilization of CNTs for the efficient removal of metal ions and pollutants as they possess large surface area, high mechanical strength, and excellent thermal, electrical properties and are small, hollow and layered structures^[@CR31]^. Several MWCNTs adsorbents were developed for the treatment of aqueous solutions contaminated with Cr(VI). Lu *et al*.^[@CR32]^ developed magnetic Fe~2~O~3~ nanoparticle-MWCNTs composite and was checked for the efficient removal of Cr(VI) at different temperatures with a q~max~ of 42.02 mg g^−1^ at 35 °C. Fe-Ag/f-MWCNT/PES Nanostructured-Hybrid Membranes developed by Masheane *et al*. could remove 94.8% of Cr(VI) from aqueous solution^[@CR33]^. Chitosan was immobilized in nanoparticles and carbon nanotubes by forming a nanocomposite which could efficiently remove Cr(VI) up to 84% within a short contact time^[@CR34]^. Reports involving microbe-MWCNTs combination for the sequestration of heavy metals are scarce. Yan *et al*.^[@CR35]^ reported MWCNTs --calcium alginate complex immobilized in *Shewanella oneidensis* which showed higher reduction capacity of Cr(VI). *Pseudomonas aeruginosa* was immobilized in CNTs for effective adsorption of various heavy metals with q~max~ 6.60 mg g^−1^ for cobalt, 6.18 mg g^−1^ for cadmium, 6.07 mg g^−1^ for lead, 5.83 mg g^−1^ for manganese, 6.23 mg g^−1^ for chromium (III) and 5.25 mg g^−1^ for Ni^[@CR36]^. Following a thorough literature review, we found there are no comparative studies on bacteria-MWCNTs and yeast-MWCNTs combination for sequestration of Cr(VI). In the current study, we demonstrate the differences in the efficiency of Cr(VI) uptake by an eukaryote (yeast) and a prokaryote (*Rhizobium*) immobilized in multiwalled carbon nanotubes. The pristine MWCNTs were oxidised and then were involved in coupling reaction with the amines present on the cell wall of microbes to form amide which react with hydrochromate ion and thus sequesters Cr(VI) from aqueous solutions. This would also pave way to explore the mechanistic and physiological variations leading to the differences in metal adsorption efficiencies.
Results {#Sec2}
=======
Molecular identification of the isolated microbial strains {#Sec3}
----------------------------------------------------------
The morphological study of the gram stained bacteria (BI 1, 3, 4, 6) showed the presence of rod shaped (BI 4, 6) and cocco bacilli (BI 1, 3) gram negative bacteria (Fig. [1a](#Fig1){ref-type="fig"}). The isolated bacteria formed circular, translucent, white mucoid colonies on YMA Congo red medium which is a positive test for *Rhizobium*. Further biochemical tests were performed and the results of four isolates were tabulated in Table [1](#Tab1){ref-type="table"}. 16S rDNA sequencing was performed to confirm the genus of the bacterial isolates with 1500 bp amplicon obtained after PCR (Fig. [1b,c](#Fig1){ref-type="fig"}). Among the sequences obtained, the database available in NCBI gene bank BI 6 strain showed 99% similarity to *Rhizobium* species (Fig. [2a](#Fig2){ref-type="fig"}) and thus bacterial isolate was named as *Rhizobium BVR* which was used for further study. The sequence was assigned an accession number MF136764 when submitted to NCBI Genbank. The evolutionary relationships as seen in the phylogenetic tree (Fig. [3](#Fig3){ref-type="fig"}) generated using MEGA 6.0 version showed the *Rhizobium BVR* is distantly related to other *Rhizobium* species. The MALDI TOF spectrum also confirmed the isolated strain to be *Rhizobium* (Fig. [2b](#Fig2){ref-type="fig"}). The confirmation of *S*.*cerevisiae* through the morphological and biochemical tests was reported in our previous studies^[@CR25]^.Figure 1(**a**) Gram stain image of *Rhizobium BVR* (**b**) Gel picture of amplified products of 16S rDNA (1.5 kb) of the bacterial isolates; lane 1--100 bp DNA ladder Invitrogen (cat no: 15628050)\]; 3 - bacterial isolate BI 1,; 4- bacterial isolate BI 3; 6 - bacterial isolate BI 4; 7- bacterial isolate BI 6. (**c**) Gel elution image of BI 6 \[1 kb DNA ladder, Thermo scientific (cat no: SM1331)\].Table 1Morphological and biochemical characteristics of the bacterial isolates.StrainShapeMotilityGram testIndoleMethyl redVoges-ProkasverCitrateStarchBI1Cocco bacillusMotileGram negative**+**−−−**+**BI3Cocco bacillusMotileGram negative**+**−−−**+**BI4RodsMotileGram negative−−−**+**−BI6RodsMotileGram negative−−−**+**−Figure 2(**a**) Blast search for BI 6 sequence confirming *Rhizobium* species (**b**) MALDI TOF of *Rhizobium BVR*.Figure 3Phylogenetic tree of the *Rhizobium BVR* created using MEGA (version 6.0).
Characterisation of the biosorbent {#Sec4}
----------------------------------
The FTIR spectra of pristine and oxidised CNTs, biosorbents CNTR (multiwalled carbon nanotubes-*Rhizobium*) and CNTY (multiwalled carbon nanotubes-yeast) before and after Cr(VI) adsorption were recorded (Fig. [4](#Fig4){ref-type="fig"}). The pristine MWCNTs was oxidised using KMnO~4~ and H~2~SO~4~. The peak at 1732 cm^−1^corresponds to C=O of carboxylic acid confirming the introduction of COOH groups on the surface of MWCNTs. The carboxyl groups fluctuations leads to comparatively broader O-H stretch than in pristine CNTs. Symmetric and asymmetric COO^−^ stretchings^[@CR37]^ gives rise to two peaks at 1387 cm^−1^ and 1625 cm^−1^. The successful immobilization of microbe in MWCNTs is assisted by EDC-HOBT coupling by forming amide bond around 1644--1648 cm^−1^ and also this peak is due to amide-1 of protein-peptide bond from the microbes^[@CR38]^. The disappearance of carboxyl C=O peak after the amide formation indicates the involvement of carboxyl groups present on the surface of MWCNTs in amide formation. The band in the range 1541--1546 cm^−1^ corresponds to amide-II of in plane N-H bending^[@CR39]^. After Cr(VI) adsorption the changes in the amide bond, O-H and C=O wavenumbers indicate they were involved in Cr(VI) uptake by protonating in acidic medium thereby forming electrostatic interactions with Cr(VI). The field emission scanning electron microscope (FESEM) and high resolution scanning electron microscopy (HRTEM) images of pristine, oxidised MWCNT and the biosorbent before and after Cr(VI) adsorption were recorded. The tiny lumps in FESEM images (Fig. S1c,d) and the particulates on MWCNTs in HRTEM images (Fig. [S2c](#MOESM1){ref-type="media"}) indicate microbial immobilizations. The oxidation process caused minimal irregularities in the wall surfaces of MWCNTs^[@CR37]^ as indicated in Fig. S2. The elemental analysis of the biosorbent before and after adsorption of Cr(VI) was recorded using Energy Dispersive X-ray Spectroscopy indicating Cr(VI) adsorption onto the biosorbent with characteristic peak between 5--6 keV (Fig. [S1i--iv](#MOESM1){ref-type="media"}).Figure 4FTIR spectra of pristine, oxidised MWCNTs, before and after Cr(VI) adsorption on CNTR, CNTY.
The presence of Cr(VI) on the biosorbent surface was also strongly supported by the X-ray photo electron spectroscopy (XPS). The base peak was corrected to 284.8 eV in the high resolution carbon scan. The survey scan of the biosorbents confirmed the presence of C, N, O and Cr respectively. The high resolution spectra of Cr 2p gave two peaks Cr2p~3/2~ and Cr2p~1/2~. Cr2p~3/2~ is deconvoluted into two peaks at 577 eV, 578 eV which represent Cr(III) and Cr(VI) respectively^[@CR40]^ and Cr2p~1/2~ at 587 eV corresponds to Cr(VI) in both CNTR and CNTY shown in Fig. [5](#Fig5){ref-type="fig"}. Instant reduction of Cr(VI) was not observed after treatment with the biosorbents due to short agitation period and this was confirmed through chromium speciation by ion chromatography. The XPS analysis showed the presence of Cr(III) and as reported earlier^[@CR25]^ Cr(III) formation on the biosorbent surface was evident only after 4--5 days. This could be due to extended interactions of Cr(VI) with the carbon and specific iron regulated surface proteins in the microbes^[@CR41],[@CR42]^. The Brunauer--Emmett--Teller (BET) adsorption isotherm was used to measure the specific surface area of the biosorbent^[@CR43]^. The nitrogen adsorption/desorption curves provided by the BET isotherm gave the surface areas for oxidised MWCNTs as 115.72 m^2^ g^−1^, 69.81 m^2^ g^−1^ for CNTR and 37.029 m^2^ g^−1^ for CNTY. The average pore volume and pore diameter was found to be as follows: Oxidised CNTs (1.3857 cm^3^ g^−1^, 47.897 nm), CNTR (0.9183 cm^3^ g^−1^, 52.613 nm) and CNTY (0.6573 cm^3^ g^−1^, 71.0 nm) respectively. These features could be attributed to the difference in the morphological features of the respective microorganisms. The thermal stability of the biosorbents were studied using thermogravimetric analysis (TGA). A sample mass of 2.43 mg of CNTR and 5.569 mg of CNTY were analyzed in air atmosphere at a flow rate of 50 mL min^−1^ in the temperature range 35--800 °C ramped at 10 °C per minute. The TGA curves (Fig. [5e](#Fig5){ref-type="fig"}) signify that biosorbents were stable at higher temperatures i.e., till 600 °C (CNTY) and 677 °C (CNTR) and the initial loss of mass is due to the moisture present in biosorbents^[@CR44]^.Figure 5XPS spectra of (**a**,**b**) survey scan of CNTR and CNTY (**c**,**d**) high resolution chromium scan spectra (**e**) TGA of the biosorbents.
The presence of chromium in its +3 and +6 form were also differentiated using laser confocal microscopy using specific rhodamine based chemosensors. The physical properties of RBH such as colorless, non-fluorescent nature owes to its spirolactam structure which is highly stable and detects Cr(VI) whereas RF is a pale pink solid which exhibits fluorescence and detects Cr(III). RBH was dissolved in 10 mmol L^−1^ H~2~SO~4~ and added to the sample for further detection of Cr(VI). It was observed that after addition of RBH to the sample containing Cr(VI) it turned pink due to the conversion of RBH to RB in view of RBH oxidation caused by Cr(VI) in acid medium^[@CR45]^. The excitation and emission was recorded at 560 nm and 585 nm respectively. RF when dissolved in 10 mmol L^−1^ Tris-HCl is a colorless solution. The RF was added to the biosorbent with Cr(VI) which did not show any fluorescence indicating no immediate reduction of Cr(VI). After 4 days, the addition of biosorbent to RF turned pink due to chelation of RF with Cr(III) present on the surface of the biosorbent, generating a rhodamine type product in spirolactam by ring opening at C-N bond^[@CR46]^. The excitation and emission for Cr(III) in RF was recorded at 525 nm and 590 nm respectively. The bright field and fluorescent images of CNTR and CNTY are shown in Figs [3a--h](#Fig3){ref-type="fig"} and S3 i--viii. The images captured before and after addition of RBH confirmed the presence of Cr(VI) in sample and also Cr(III) presence was confirmed by the addition of RF which exhibited fluorescence.
Effect of pH, adsorbent dosage and interaction mechanisms {#Sec5}
---------------------------------------------------------
Influence of pH plays a vital role in the uptake of Cr(VI) onto the biosorbent. A 0.1 g weight of each of the biosorbent was weighed in a series of Erlenmeyer flasks and to that 20 mL of 5 mg L^−1^ Cr(VI) solution was added and adjusted to pH 2.0--7.0 and agitated for 3 hours to attain equilibrium. After analysis, it was found that the biosorbents could equally adsorb hexavalent chromium completely at pH 2.0. At pH \> 2 it was observed that there was a decrease in the metal uptake (Fig. [S4a](#MOESM1){ref-type="media"}). This is due to the existence of Cr(VI) ions in various forms such as hydro chromate (HCrO~4~^−^) at pH 2--4, in strongly acidic medium (pH \< 2) it exists as dichromate (Cr~2~O~7~^2−^) and at higher pH as chromate (CrO~4~^2−^). In acidic medium, the biosorbent surface which has functional groups such as hydroxyl, carboxylic and amide gets protonated and is involved in electrostatic interactions with HCrO~4~^−^ thus aiding the metal to participate in biosorption (Fig. [6](#Fig6){ref-type="fig"}). Amides are usually poor leaving groups hence under highly acidic conditions (pH 2.0) the carbonyl oxygen of amide is protonated and further the protonation of amide nitrogen is also probable^[@CR47]^ in influencing the metal uptake. According to HSAB (hard-soft acid base) principle CrO~4~^2−^ \< HCrO~4~^−^ \< OH^−^ with regard to the hardness of the ions^[@CR25]^. At higher pH, the hydroxide and chromate ions compete each other resulting in the electrostatic repulsion thereby decreasing the Cr(VI) uptake. The adsorbent dosages were varied from 0.01 g to 0.5 g to observe the minimal dosage of the biosorbent which can remediate maximum amount of Cr(VI) at pH 2.0. A 20 mL volume of 5 mg L^−1^ Cr(VI) was taken with varying biosorbent dosage and agitated for 180 min and observed that with 0.1 g, CNTR as well as CNTY could adsorb Cr(VI) quantitatively indicating the saturation of adsorbent sites (Fig. [S4b](#MOESM1){ref-type="media"}).Figure 6Interaction mechanism of the biosorbents with Cr(VI).
Biosorption kinetics, isotherms and temperature effect studies {#Sec6}
--------------------------------------------------------------
The kinetic experiments were performed using 0.1 g of the biosorbent mixed with 20 mL of 5 mg L^−1^ Cr(VI) at time intervals ranging from 5--180 min. The maximum uptake of the metal ion was observed at 180 min. The data obtained from the plots (Fig. [S5a--c](#MOESM1){ref-type="media"}) were fitted into the pseudo first order^[@CR48]^, second order^[@CR49]^ and intra particle diffusion to evaluate the adsorption kinetics. The kinetic parameters are presented in Table [S1](#MOESM1){ref-type="media"}. The equations representing pseudo first order and pseudo second order kinetics are given as$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\mathrm{log}({{\rm{q}}}_{{\rm{e}}}-{{\rm{q}}}_{{\rm{t}}})=\,\mathrm{log}\,{{\rm{q}}}_{{\rm{e}}}-\frac{{{\rm{k}}}_{1}{\rm{t}}}{2.303}$$\end{document}$$$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\frac{{\rm{t}}}{{{\rm{q}}}_{{\rm{t}}}}=\frac{1}{{{\rm{k}}}_{2}{{\rm{q}}}_{{\rm{e}}}^{2}}+\frac{{\rm{t}}}{{{\rm{q}}}_{{\rm{t}}}}$$\end{document}$$
The best suited kinetics depends on the experimental data which has the highest regression coefficient and the system follows pseudo second order kinetics with 1.844 mg g^−1^ (q~eexp~), 1.8848 mg g^−1^ (q~ecal~) for CNTY and 1.8026 mg g^−1^ (q~eexp~), 1.826 mg g^−1^ (q~ecal~) for CNTR. The ability of biosorbents to eliminate a unit mass of contaminants under similar conditions is explained by the isotherms. The plot q~t~ vs t^1/2^ relates to the intraparticle diffusion which is evaluated using q~t~ = k~i~ t^1/2^ + C where c corresponds to intercept and k~i~ is the intra particle diffusion constant which is obtained from the slope of the plot. The rate at which Cr(VI) gets adsorbed is mostly influenced by the diffusion mechanisms such as (i) the Cr(VI) from the bulk of the solution gets transferred onto the CNTR-CNTY biosorbent surface via external mass transfer (ii) intraparticle diffusion^[@CR50]^ wherein Cr(VI) diffuses through the pores of the CNTR-CNTY biosorbent. From the plot it was observed that the straight line deviates from the origin having a significant intercept indicating the boundary layer phenomenon also plays role in the adsorption kinetics of hexavalent chromium.
Among several isotherms, commonly studied theoretical and empirical isotherms are Langmuir and Freundlich^[@CR51]^. The data obtained from the plots (Fig. [S5d,e](#MOESM1){ref-type="media"}) and the equations are presented in Table [2](#Tab2){ref-type="table"}. The system assumed a monolayer Langmuir adsorption model as it has the low chi square value and high R^2^ value. The CNTY biosorbent has an adsorption capacity of 31.605 mg g^−1^ with an R^2^ value as 0.96 whereas CNTR has an adsorption capacity of 24.8 mg g^−1^ with an R^2^ value of 0.96. The dimensionless constant R~L~ value lies below unity indicating the reversibility of the isotherm which is represented as$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${{\rm{R}}}_{{\rm{L}}}=1/1+{{\rm{bC}}}_{{\rm{o}}}$$\end{document}$$where b is the Langmuir constant associated to adsorption energy, C~o~ represents the equilibrium concentration of the heavy metal ion. The Freundlich constants n and K~F~ are related to adsorption intensity and its capacity respectively. The values of n of both the biosorbents are greater than 1 (2.17, 2.29) indicating the favorability of metal adsorption onto the biosorbent. The pristine MWCNTs have an adsorption capacity of 11.93 mg g^−1^, when oxidised the uptake capacity enhanced to 16.22 mg g^−1^ and after the addition of *Rhizobium* and yeast to the MWCNTs adsorption capacity increased to 24.82 mg g^−1^ and 31.6 mg g^−1^ respectively.Table 2Biosorption isotherm parameters for Cr(VI) adsorption.Langmuir$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\frac{{{\boldsymbol{C}}}_{{\boldsymbol{e}}}}{{{\boldsymbol{q}}}_{{\boldsymbol{e}}}}{\boldsymbol{=}}\,\frac{{\bf{1}}}{{{\boldsymbol{q}}}_{{\boldsymbol{o}}}{\boldsymbol{b}}}{\boldsymbol{+}}\frac{{{\boldsymbol{C}}}_{{\boldsymbol{e}}}}{{{\boldsymbol{q}}}_{{\boldsymbol{o}}}}$$\end{document}$q~o~(mg g^−1^)b (mg^−1^ L)R~L~R^2^χ^2^CNTY31.6050.0720.5780.9671.021CNTR24.820.0430.6950.9620.46**Freundlich** $\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${\bf{log}}\,{{\boldsymbol{q}}}_{{\boldsymbol{e}}}=\,{\bf{log}}\,{{\boldsymbol{K}}}_{{\boldsymbol{F}}}-\frac{{\bf{1}}}{{\boldsymbol{n}}}\,{\bf{log}}\,{{\boldsymbol{C}}}_{{\boldsymbol{e}}}$$\end{document}$**K** ~**F**~ **(mg** ^**1-1/n**^ **g** ^**−1**^ **L** ^**1/n**^ **)nR** ^**2**^**χ** ^**2**^CNTY3.2982.29250.8541.667CNTR2.1722.1780.8950.61
The thermodynamic parameters such as Gibbs free energy (ΔG°), enthalpy (ΔH°) and entropy (ΔS°) explain the spontaneity of adsorption process. The equilibrium constant K at different temperatures was derived from the ratio of Cr(VI) present on the surface of CNTR, CNTY to that in the liquid phase and fitted into Gibbs free energy equation (ΔG = −RTlnK). The changes in enthalpy and entropy for the respective biosorbents were obtained from the Van't Hoff plot of ln K against 1/T (Fig. S5f). The negative free energy values indicate the spontaneity in the biosorbent- sorbate interactions and the negative values of enthalpy and activation energy (E~a~ = ΔH°~ads~ + RT) indicates the system involves exothermic adsorption. The negative ΔS° values indicate the decrease in the disorderliness of the system with increase in temperature^[@CR25]^. The ΔH values obtained for CNTR (−31.6 kJ mol^−1^) and CNTY (−72.2 kJ mol^−1^) indicate both the systems involve exothermic physicochemical adsorption^[@CR19]^. The enthalpy-entropy compensation is well illustrated through the corresponding values obtained for the biosorbents. The adsorption process is more exothermic in CNTY as evident from the largely negative enthalpy values from Table [S2](#MOESM1){ref-type="media"}. The entropy change is also more negative for CNTY reflecting more orderliness at the biosorbent-solution interphase.
Effect of sample volume, regeneration and interference studies {#Sec7}
--------------------------------------------------------------
Laboratory scale column studies were done to test the applicability of developed biosorbents for their sustainability to higher sample volume. A 1.5 g biosorbent was packed to 2 cm bed height in a glass column of 30 cm length with a diameter of 2 cm and was allowed to settle for a minimum of 2 hours to avoid air voids before the start of the experiment. A Cr(VI) concentration of 5 mg L^−1^ was prepared and the column was loaded with 50 mL of 5 mg L^−1^ at 5 mL min^−1^ flow rate and the eluate concentration was checked periodically for every 10 mL using ion chromatography. 50 mL of 5 mg L^−1^ Cr(VI) was completely adsorbed effectively. Subsequently, 300 mL of the Cr(VI) solution was loaded continuously and the heavy metal was adsorbed completely beyond which there was saturation owing to the non-availability of active adsorption sites^[@CR52]^. A sample volume of 350 mL and 250 mL was adsorbed effectively onto CNTY and CNTR respectively as shown in Fig. S6a.
A significant property of the adsorbent is the ability to reuse thereby reducing the operational cost in treating pollutants. Varying sodium hydroxide concentrations (0.1--2.0 mol L^−1^) were tried (Fig. S6b,c) of which 1.0 mol L^−1^ sodium hydroxide was effective in desorbing Cr(VI) as sodium chromate^[@CR25]^. It was observed that in CNTY, second, third, fourth, fifth cycles completed 100% adsorption- desorption cycles beyond which there was a decrease in the adsorption percentage. 70% adsorption was observed in 6^th^ cycle, 45% in 7^th^ cycle as shown in Fig. S6d,e. In CNTR, there were four complete adsorption-desorption cycles and the decrease in adsorption was observed from 5^th^ cycle.
A 100 mg L^−1^ concentration each of various cations such as Mn^+2^, Cu^+2^ Fe^+2^, Co^+2^, Ni^+2^, Pb^+2^ and anions such as nitrate, chloride, sulfate were added to 5 mg L^−1^ Cr(VI) solution and the adsorption studies were carried out to observe the influence of these ions in the uptake of chromium. It was observed that the adsorption percentage decreased by 2.0 ± 0.5% in CNTY as well as CNTR attributed to the interference of anions which compete with hydrochromate ions to occupy the adsorption sites, whereas cations such as Fe(II) and Mn (II) have the ability to reduce Cr(VI) to Cr(III)^[@CR53]^.
Discussion {#Sec8}
==========
The oxidised MWCNTs have larger surface area compared to the microbe immobilized carbon nanotubes. Also the pore parameters such as pore volume and pore diameter contribute to the surface area. In the current method the oxidised MWCNTs have a higher pore volume compared to microbe immobilized MWCNT. However for adsorption studies apart from the surface area, availability of more functional groups also aid in enhancing the metal uptake. The surface of the microbial cell wall have carboxyl, hydroxyl and amine functionalities which tend to participate in the metal uptake along with functionalised MWCNTs thereby increasing the Cr(VI) adsorption capacity.
Clearly yeast showed better adsorption capacity and the difference can be attributed to the morphological properties such as cell wall composition. The *Rhizobium* cell wall composition is similar to gram negative bacterial cell wall. Major component of cell wall is peptidoglycan which is made up of alanine, amino sugars, glutamic acid and diaminopimelic acid. It also contains lipo-polysaccharide which is composed of uronic acid, glucosamines, glucose, 2-keto, 3-deoxy octanoic acid, mannose and galactose which have functional groups such as amines, carboxyl, hydroxyl and phosphates^[@CR54]^. The yeast cell wall composition is similar to gram positive bacteria which is majorly made up of polysaccharides such as β-glucans (60%), mannoproteins (40%), and chitin (2%)^[@CR55]^ which mainly consists of amines, carboxylic and hydroxyl groups in larger amounts than in *Rhizobium* cell wall. Although, both the microbial cell walls are made up of polysaccharides, lipids and proteins, yeast cell wall has (1--10%) more lipid content^[@CR56]^ owing to the presence of more functional groups. Hence, in the current work the uptake of chromium (VI) in yeast is higher as compared to *Rhizobium*.
When microbes are added as amine sources to the EDC-HOBT coupling reactions with oxidised MWCNTs, a covalent interaction in the form of amide bond is formed between them which participates in Cr(VI) adsorption in acidic medium and also the available OH, COOH groups in microbes augments the electrostatic interactions with the hydrochromate ion. The comparison of adsorption capacities of various adsorbents with the current developed biosorbents is given in Table [S3](#MOESM1){ref-type="media"}. Clearly, the microbe immobilized MWCNTs shows a higher adsorption capacity as compared to the pristine and oxidised MWCNTs.
In conclusion, this work has highlighted the confluence of biotechnology and nano materials as an emerging area towards heavy metal remediation. The proposed methodology has illustrated the ability of two diverse microorganisms in oxidised multiwalled carbon nanotubes as effective adsorbents to sequester chromium in the +6 oxidation state. The biosorbents CNTR and CNTY followed Langmuir isotherm with 24.86 mg g^−1^ and 31.6 mg g^−1^ adsorption capacities respectively. The biosorption process was exothermic, spontaneous and pseudo second order model was effective in understanding the adsorption kinetics. The mechanism involves electrostatic interaction between the heavy metal ion and biosorbent surface. Characterisation techniques confirmed the interaction of microbes and oxidised carbon nanotubes with Cr(VI). A good sample volume of synthetic waste water sample was treated in lab scale column studies which could tolerate up to 4--5 cycles of adsorption and desorption by regenerating the biosorbents using 1.0 mol L^−1^ sodium hydroxide. It was observed that CNTY has better adsorption capacity than CNTR owing to the larger accessibility of functional groups present in the microbial cell walls. On an optimistic note, biotechnology and nanoscience complement each other by opening diverse possibilities in detoxifying the pollutants from industrial waste water.
Materials and Methods {#Sec9}
=====================
Chemicals and materials {#Sec10}
-----------------------
All the chemicals used were analytical and guaranteed reagents. MWCNTs type 5 were procured from Sisco Research Laboratories, India with an outer diameter of 30--50 nm and length 10--30 µm. A 1000 mg L^−1^ Cr(VI) stock solution was prepared from potassium dichromate (K~2~Cr~2~O~7~, Merck) and further dilutions were prepared accordingly in high purity Milli Q water. The solvents and salts used for Cr(VI) analysis using ion chromatography were supplied by Merck. The chemicals used to prepare YEPD medium (Yeast extract, peptone, dextrose) to culture yeast and YMA medium (Yeast extract, Mannitol, agar/broth) for the growth of rhizobium were procured from Himedia. The chemicals used in coupling reaction were (3-Dimethylaminopropyl)-N′-ethylcarbodiimide hydrochloride (EDC), Hydroxybenzotriazole (HOBT)(Sisco Research Laboratories, India), triethylamine (Merck), dimethylformamide (SD Fine Chemicals Ltd, India).
Isolation and identification of microbial species {#Sec11}
-------------------------------------------------
### Rhizobium species {#Sec12}
*Rhizobium* species was isolated from soil that was collected from nearby legume crop fields and followed a simple isolation procedure using standard pour plate technique on a YMA medium containing yeast extract, mannitol, NaCl, MgSO~4~, K~2~HPO~4~, Congo red and agar. The inoculated plates were incubated at 37 °C for 48 hours. Based on the morphological characteristics of the colonies, four isolates of the bacteria were selected (BI 1, BI 3, BI 4, BI 6). Further the isolates were subjected to morphological tests such as gram staining and motility tests, biochemical tests popularly known as IMVIC tests and molecular characterisations for the bacterial confirmation^[@CR57]^.
### Saccharomyces cerevisiae {#Sec13}
The yeast granules purchased from local market were revived on YEPD medium and identified as *S*.*cerevisiae* through morphological and biochemical tests as reported by our group previously^[@CR25]^.
Genomic DNA isolation and 16S rDNA PCR amplification {#Sec14}
----------------------------------------------------
The bacterial genomic DNA was isolated according to a standard DNA isolation protocol^[@CR58],[@CR59]^. The strains isolated were grown in 5 mL YMA medium at 37 °C overnight and mid log phase of the culture obtained was harvested as a pellet by centrifugation. The pellet obtained was re-suspended in 500 µL of TEG buffer (Tris-50mM EDTA-50mM Glucose −20%) for the cell lysis. Further it was treated with lysozyme and RNAase at 37 °C for 40 min followed by action of 10% SDS solution at 37 °C for 60 min. Isolation was accomplished by adding equivalent quantities of Phenol, Chloroform and Isoamyl alcohol followed by precipitating with 90% isopropanol (ice cold). The white DNA precipitate which was obtained was washed with 70% ethyl alcohol and suspended in 30 µL TE (Tris-EDTA) buffer for further analysis.
The amplification of 16S rDNA was performed using Polymerase chain reaction (PCR). The PCR reaction was setup using 25 µL reaction mixture containing 200 µM dNTP, 1 µL of *Taq polymerase*, 10 × PCR buffer (2.5 µL) with MgCl~2~ (1.5 mM), 100 ng/µl genomic DNA, with 200 ng of forward \[27 F 5′-AGAGTTTGATCMTGGCTCG-3′\] and reverse primers \[1492 R 5′-GGTTACCTTGTTACACTT-3′\]^[@CR60]^. The PCR program was operated starting with initial denaturation at 94 °C for 4 min, followed by denaturation for 1 min at 94 °C for 32 cycles, annealing at 58.5 °C for 50 min, extended for 2 min at 72 °C followed by a final extension at 72 °C for 10 min^[@CR61]^ and the obtained product was resolved using electrophoresis. The purified amplicons were commercially sequenced. The sequences obtained were used to carry out a NCBI blast search analysis to confirm the identity of bacteria as *Rhizobium BVR*.
Preparation of the *Rhizobium* -- MWCNTs and *Yeast* -- MWCNTs biosorbent {#Sec15}
-------------------------------------------------------------------------
The isolated *Rhizobium* species was grown in yeast- mannitol broth medium and spun down to make a pellet. The yeast grown on YEPD medium was used^[@CR25]^. Pristine MWCNTs were functionalised by covalent modification as reported previously^[@CR31],[@CR62]^. A 200 mL of 0.5 mol L^−1^ H~2~SO~4~, was mixed with 0.25 g of KMnO~4~ as an initial step for oxidation. In another beaker, 0.1 g of MWCNTs, 200 mL of 0.5 mol L^−1^ H~2~SO~4~ was added and subjected to ultra-sonication for 30 min to ensure proper dispersion. After sonication the solution containing MWCNTs was heated up to 150 °C prior to the addition of KMnO~4~ solution dropwise. The mixed solution was refluxed for 5 hours at 150 °C and cooled down to room temperature proceeded by the addition of 10 mL of concentrated HCl to dissolve MnO~2~. The oxidised MWCNTs were washed till the pH reached between 6.0--7.0 and then dried at 100 °C.
The dried MWCNTs were further used in the preparation of biosorbent along with microbes (free amine sources) by involving in EDC-HOBT coupling. To 0.1 g of oxidised MWCNTs, 0.1 g each of EDC, HOBT were added. The solvent used was DMF (dimethyl formamide) and 3 mL of triethylamine was added to the above mixture and stirred for 20 minutes. 3.0 g of yeast was added to the solution and the mixture was stirred overnight for the coupling reaction to take place^[@CR63]^. Similar procedure was repeated for the coupling reaction with *Rhizobium BVR*. The coupling mixture was filtered, washed with water and dried at 80 °C for 4 hours before proceeding for metal adsorption studies.
Synthesis of probes for Cr(VI) and Cr(III) {#Sec16}
------------------------------------------
Cr(VI) and Cr(III) have specific binding probes to differentiate them. Rhodamine based sensors are selected due to its spiro lactam structure and spiro ring opening of sensing a molecule. Rhodamine B hydrazide (RBH)^[@CR45]^ and Rhodamine based chemo sensor (RF)^[@CR46]^ were synthesized as described in literature which are specific for Cr(VI) and Cr(III) respectively and the samples were prepared for capturing the laser confocal images.
Characterisation techniques {#Sec17}
---------------------------
The developed biosorbent was characterized using various analytical techniques before and after Cr(VI) adsorption. FTIR analysis was performed for the Pristine CNT, microbe-carbon adsorbent (before as well as after adsorption) using JASCO-- 4200 model spectrometer (400--4000 cm^−1^) where 1.0 mg of the samples were mixed with 100 mg of KBr and the individual spectra were recorded. Thermogravimetric analysis (TGA) of the biosorbent was recorded using a Shimadzu DTG-60 thermal analyser. A known weight of the biosorbent was taken and subjected to a temperature range of 30--800 °C under air atmosphere to analyze the thermal stability. For the elemental analysis energy dispersive X-ray spectra (EDAX) was recorded using Bruker -- X Flash 6/30 and to study the surface morphology of the biosorbents, field emission scanning electron microscopic (FESEM) images were captured using Carl Zeiss Supra 55 and High resolution transmission electron microscopic (HRTEM) images taken by Tecnai 20 (FEI) 200 kV gives an insight into the microstructure and the defects at atomic resolution. The elemental speciation was ascertained by X-ray photo electron spectroscopy using PHI 5000 Versa Prob II, FEI Inc, and the source used is an aluminium monochromator at 25.4 W and 187.85 eV. The BET surface area, BJH pore volume and average pore diameter of the biosorbent were measured using a BELSORP II mini (Microtrac BEL Corp) at an outgassing temperature of 150 °C for 2 hour duration. LeicaDMi8 laser scanning microscopy (S/N 418513) was used to capture confocal images. The quantitative Cr(VI) adsorption was performed using 883 Basic IC plus Ion chromatography^[@CR64]^ with a 887 professional UV/Vis detector. The 16S rDNA sequencing was carried out using the Biosystems ABI 3730 xls Genetic analyser at Bioserve Pvt. Ltd., Hyderabad, India. Matrix assisted laser desorption ionisation time of flight (MALDI-TOF) was performed using VITEK MS (Biomerieux) spectrometer, with the knowledge Base v2 database (closed) at Zeal Biologicals, Hyderabad, India for the confirmation of the isolated bacteria.
Batch adsorption studies {#Sec18}
------------------------
The batch adsorption studies were performed by optimizing various parameters such as pH, adsorbent dosage, kinetics, thermodynamics. A 0.1 g of the biosorbent was used to treat 20 mL of 5 mg L^−1^ Cr(VI) solution at pH 2.0. The equilibration was performed for 180 min using an orbital incubator shaker (Biotechnics, India) operating at 120 rpm maintained at 30 °C. After separation of the biosorbent through filtration, the concentration of Cr(VI) was estimated using ion chromatography coupled with a UV detector and the amount of Cr(VI) adsorbed onto the developed biosorbents was calculated as$$\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${{\rm{q}}}_{{\rm{e}}}=\frac{({{\rm{C}}}_{{\rm{o}}}-{{\rm{C}}}_{{\rm{e}}}){\rm{V}}}{{\rm{W}}}$$\end{document}$$q~e~ = amount of Cr(VI) adsorbed (mg g^−1^) onto biosorbent. C~o~ = initial Cr(VI) concentration. Ce = Cr(VI) concentration remaining in solution phase. V = Volume of Cr(VI) solution used for biosorption (L). W = weight of the biosorbent used for Cr(VI) treatment (g).
Electronic supplementary material
=================================
{#Sec19}
Supplementary Information
**Electronic supplementary material**
**Supplementary information** accompanies this paper at 10.1038/s41598-018-28067-9.
**Publisher\'s note:** Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The authors acknowledge the Department of Science and Technology, India (DST-SERB) for funding (SR/S1/IC-06/2012) the project. We thank Central Analytical Laboratory, BITS Pilani Hyderabad Campus, Sprint testing solutions, Mumbai, India and the surface characterisation lab, IIT Kanpur, India and for their assistance in biosorbent characterisation.
The experiments were designed and coordinated by V.R. and N.R. and the isolation of *Rhizobium BVR* was carried out by T.S. and M.M. and the adsorption experiments and analysis were carried out by T.S. A.S., K.S., M.P. All authors have approved the manuscript.
Competing Interests {#FPar1}
===================
The authors declare no competing interests.
|
Q:
How fast could a magic-using society get from agriculture to industrial revolution?
I've been creating a science fantasy conworld, but I'm honestly not interested as much in pre-industrial stuff. But I don't want to ignore the pre-industrial history, so I'm looking for a way for the Industrial Revolution to happen as soon as possible.
While most fantasy settings are medieval, this one is not. Furthermore, while most settings assume a dark ages of some sort before renaissance and industrialization, this doesn't have to be true -- the Song Dynasty of China nearly industrialized several hundred years before England, and it only didn't because the Mongols invaded. So I'd like to avoid the dark ages trope as well.
Limitations and conditions of the magic involved: magic requires a human to be performed (NB: it can be performed without humans, but that is difficult enough to be done long after industrialization), electricity and heat/fire magic is possible, alchemy/transmutation is also possible. Magic is fuelled by mana, which is found naturally in the world, generated from solar and kinetic energy. Assume the magic is more like elemental manipulation and such, not Harry Potter-esque "clean yourselves, dishes".
A:
2 Minute Version:
"And as my third wish, I desire a complete implementation of a Kardashev Type II industrial infrastructure around the planet's primary."
Harry Potter Version:
"Manufacturo perpetuum mobile!"
Dark Satanic (mana-)Mills version:
A century at most. Presumably, mana can be harnessed with high efficiency compared to steam or solar power by a previously agrarian civ. Moreover, magic can be used to refine tools, including tools that make magic more powerful. Since the mana resource does not need to be mined, and needs no infrastructure to develop, the magic-driven industrial revolution can proceed at accelerated pace. Even if magic is hard to master, schools of Thaumaturgic Engineers will start churning mages out on industrial scales. The artefacts they create will soon pervade every household, improving productivity at rates undreamt by our measly coal-driven industrial revolution. The only source of concern would be the social implications. How quickly would these Engineers take power, and how would the reactionary forces react against them? Think the French revolution at 10x speed.
A:
Alright then, to be able to do something, you will generally need these 3 things in order to do a thing, anything in fact.
Can you do the thing?
Do you know how to do the thing?
Do you want to do the thing?
Can they do it?
Since you stated that magic can only work with a user nearby doing it, and there are no simple things like:
not Harry Potter-esque "clean yourselves, dishes".
What I would imagine the industry of a magic society would then be a bit like the city from the Legend of Korra, where they had fire bender clock in and shoot lightning at a dynamo thing, which then powers the rest of the city via electricity. I would then imagine that if your magic is primarily elemental manipulation, than it would also likely end up like that.
Not only that, since your mana is solar and kinetic powered, your power generators would then be actually quite reasonably green and eco friendly.
So, can they create electricity? The answer would be a simple yes. If your magic using society from the far future was cast out to another planet or something, they would be very quickly be able to industrialize things. However, that is based on a fairly important thing that needs to be discussed next, which is:
Do they know how to do it?
Very obviously not at first, so they would have to go through roughly the same progression of science in order to be able to create dynamos to generate electricity, uniform spring steel in order to build factories, and some other things.
This would probably be the factor that makes the magic using society fairly slow at industrializing, I would imagine, as there would be fairly little need for a magic using society to advance their sciences to the point of industrialization.
Your society would need to be forced into advancing their industrialization, and for that I can imagine a short and simple Dark Age where their magic simply stopped working for some time, like a century or so, would cause industrialization to happen quite surprisingly fast.
Do they want to do it?
Well, as their population grows, subsistence and local craftsmen would simply be unable to work well enough, so of course they would see a need to increase their production of anything, from food crops to magic wands in order to be able to sustain their growing population
|
Bacterial topoisomerases, anti-topoisomerases, and anti-topoisomerase resistance.
Topoisomerases are ubiquitous enzymes necessary for controlling the interlinking and twisting of DNA molecules. Among the four topoisomerases identified in eubacteria, two, DNA gyrase and topoisomerase IV have been exploited by nature and the pharmaceutical industry as antibacterial targets. Natural products that are inhibitors of one or both of these topoisomerases include the coumarin and cyclothialidine classes, which interfere with adenosine triphosphate hydrolysis, cinodine, flavones, and terpenoid derivatives. The plasmid-encoded bacterial peptides micron B17 and CcdB also inhibit DNA gyrase. The quinolones, a synthetic class of antibacterials that act on both DNA gyrase and topoisomerase IV have had the broadest clinical applications, however. Quinolone congeners differ in their relative potencies for DNA gyrase and topoisomerase IV Studies of an expanding set of resistant mutant enzymes and the crystal structure of the homologous enzyme in yeast have contributed to our understanding of interactions of these drugs with topoisomerase-DNA complexes and the ways in which mutations effect resistance. |
Tanishaa has been a controversial captain since day one. Whether it’s taking a decision for her team or choosing contestants for a task, her choices were always questioned.
“Though contestants mutually elected Tanishaa as the captain of Red team, her decision as the captain has always put her team in trouble,” said a source.
During a task, the “Neal ‘n’ Nikki” actress chose Tina and Faisal to perform a task against their will, which led to an argument.
“During one such task, she nominated Tina and Faisal to perform the task against their will. This led to a heated argument between Tanishaa, Tina and Faisal but eventually both of them performed the task,” the source added. |
If You Liked George Bush, You Will LOVE Mitt Romney's Foreign Policy
Mitt
Romney rolled out his foreign policy platform this morning —
and it looks remarkably familiar.
Addressing cadets at South Carolina's Citadel
military academy, Romney attacked President Obama for forfeiting
U.S. military and economic primacy and promised to restore
America's global dominance by increasing defense spending and
taking a more aggressive approach toward global threats.
Here's an excerpt from his speech:
"This century must be an American Century. In an American
Century, America has the strongest economy and the strongest
military in the world. In an American Century, America leads the
free world and the free world leads the entire world. God did not
create this country to be a nation of followers. America is not
destined to be one of several equally balanced global
powers. America must lead the world, or someone else will.
Without American leadership, without clarity of American purpose
and resolve, the world becomes a far more dangerous place, and
liberty and prosperity would surely be among the first
casualties....
...This is very simple: If you do not want America to be the
strongest nation on Earth, I am not your President. You have that
President today."
If that sounds a lot like a page out of the George W. Bush
playbook, that's because it basically is. Romney's foreign policy
team is stacked deep with former Bush administration officials,
and his platform adheres closely to their hardline — and
occasionally controversial — view of American exceptionalism.
Even the venue of Romney's speech harkens back to the Bush era —
George W. Bush rolled out his first foreign policy campaign
platform at the Citadel in 2000.
The Romney plan lays out eight actions that he will take during
his first 100 days in office to roll back Obama's policies and
"set a new tone" for America. Here's a rundown:
Build a bigger Navy. Romney also promised to reverse Obama's
"massive defense cuts," a reference to the $350 billion spending
cuts included in this summer's debt ceiling deal.
"Strengthen and repair relationships with steadfast allies" —
namely Israel, the United Kingdom, and Mexico. Romney promises to
reduce aid to Palestinians if they keep trying to pursue
statehood at the UN. He also says he will enhance military
cooperation with Mexico, but it is unclear how a border fence
will help "repair" relations.
Take a harder line against Iran. Romney says he will "make
clear that the military option is one the table" and step up
military aid to Israel. He also rejects diplomatic engagement as
an option. |
Emmet Crawford
Emmet Crawford (December 22, 1844 – January 18, 1886) was an American soldier who rose through the ranks to become an officer. He was most noted for his time spent in the Arizona Territory under General George Crook in the United States Cavalry. He was killed in pursuit of the Apache leader Geronimo in January 1886 in Mexico.
Early life
Emmet Crawford was the second of four sons of William and Jemima Crawford of Philadelphia, Pennsylvania (according to the 1850 U.S. Census). Charles was the eldest of the four brothers, followed by Emmet, Zachariah, and Henry, the youngest. By 1860, the family had been split, with Emmet, Zachariah, and Jemima showing up in the 1860 census living separately but still in Philadelphia. William Crawford does not show up in the 1860 census in Philadelphia. While Emmet continued to have contact with Charles and his mother, he only remained close to his brother Zachariah (or Zachary T Crawford).
Military Service
Civil War
Lying about his age, in May 1861, in order to join the army, Crawford enlisted in the 71st Pennsylvania Infantry Regiment, fighting in many actions as part of the Army of the Potomac, including the Battle of Antietam and the Battle of Fredericksburg. Wounded in the Second Battle of Fredricksburg in spring 1863, Crawford was sent to Philadelphia to convalesce. During his recovery, he attended the first officer training school designed to train white officers assigned to command U.S. Colored Troops. Returned to duty in June 1864, just in time to be mustered out with the rest of the 71st Pennsylvania Regiment, Crawford and brothers Charles and Zachary all reenlisted in the 197th Pennsylvania Infantry. Crawford received his appointment as a first lieutenant with the colored troops, but was not reassigned until September 1864. The war's ending found Crawford assigned to the 13th Colored Artillery in Bowling Green, Kentucky.
Fort Verde
Crawford was recommended for retention of service and, in February 1866, accepted an appointment as second lieutenant in the 37th Colored Infantry in Wilmington, North Carolina. He survived the post-war trimming of the army in the late 1860s and on January 2, 1871 was assigned to the 3rd Cavalry as a first lieutenant. He was sent to Fort Verde in Arizona Territory, north of Tucson.
Sioux Wars
On January 2, 1872, the 3rd Cavalry was transferred north to fight the Sioux in Nebraska and Wyoming Territory. Emmet was stationed at Fort D.A. Russell (later F.E. Warren Air Force Base). His company was sent to the Red Cloud Agency to assist J. J. Saville in March 1874. The camp they established was named Camp Robinson, later renamed Fort Robinson. In November 1874, Crwaford and his company were transferred to Sidney Barracks and served in many capacities in Nebraska.
In early summer 1876, the 3rd Cavalry under General George Crook was sent to Montana Territory as part of a three-pronged effort to force the Sioux back to the reservation. The other two commanders were General John Gibbon and Lieutenant Colonel George Custer. On June 17, 1876, Crook's forces were attacked at Rosebud Creek by the Sioux in strength. After a six-hour battle, Crook claimed a narrow victory and retreated to his base camp. On June 25, only a short distance away, along the Little Bighorn River, Colonel Custer and all of his men were killed in the Battle of the Little Bighorn.
In late 1876, Crawford was reassigned to recruiting duty in Baltimore, Maryland, for 2 years. He returned to the 3rd Cavalry in Nebraska before the end of 1878. He was stationed at Camp Sheridan and Fort Robinson and later at Fort D.A. Russell.
Fort Thomas
In the spring of 1882, the 3rd Cavalry was transferred to Arizona to deal with the Apache. Crawford was assigned to Fort Thomas, near the San Carlos Apache Indian Reservation. In September 1882, General Crook assigned Crawford to San Carlos as military commandant, where he was to work with the civilian agent to maintain peace and help the Indians become self-supporting. He was also to enlist and train Apaches as scouts. To assist him were Lt. Charles B. Gatewood, 6th Cavalry, and Lt. Britton Davis of the 3rd. The Apache scouts proved their worth on a campaign in 1883. Crawford's concern that the Apaches be treated fairly led to friction with the agent, P. P. Wilcox. This led to Crawford requesting a transfer to Texas, but a month later he was recalled to deal with Geronimo.
Apache Wars
Geronimo headed for Mexico with the cavalry in pursuit, thanks to a border-crossing agreement with Mexico. They spent the spring of 1885 in a fruitless attempt at capturing Geronimo. After returning to Fort Bowie to refit, Crawford headed out with only Apache scouts, Tom Horn(the civilian chief of scouts), three officers, Lt. Marion Maus, Lt. Samson L. Faison, and Lt. William Shipp, and the surgeon Dr. Davis. On December 11, 1885, they crossed the border into Mexico, and according to the border agreement, Crawford stopped to inform the Mexican authorities that they were in pursuit of the hostiles before pushing on into the rugged Sierra Madres.
The Apache scouts picked up Geronimo's trail and, on January 9, 1886, they located his camp. They continued through the night and successfully attacked the next morning. Geronimo's band fled, leaving all their stock, provisions and blankets. Geronimo sent an old woman to Crawford to talk, and a meeting was set the following morning.
The next morning started with an attack by Mexican irregular troops under the command of Mauricio at Teopari, District of Sahuaripa. had shot and killed the Apache, Victorio, six years earlier at the Battle of Tres Castillos (29.91°N 105.82°W). Crawford attempted to get them to stop by waving a white handkerchief, but was shot in the head. Dutchy, one of the Apache scouts, pulled the mortally wounded Crawford to safety, and then killed the Mexican who had shot him. He also slew the Mexican commander. Emmet Crawford did not die immediately, but he never regained consciousness. On January 13, Lieutenant Maus met with Geronimo, obtained the surrender of some of his band and an agreement that Geronimo would meet with General Crook in two months. Maus proceeded to carry the wounded Crawford back to the border, but on January 18, he quietly slipped away. His body was buried in the little village of Nacori Chico. Crawford's death nearly sparked a second war between the United States and Mexico, but after an official hearing, no further action was taken.
General Crook did meet with Geronimo as agreed, but Geronimo did not return. Crook resigned over the incident and Geronimo was not brought in until September. Later, Crook stated his belief that if Crawford had not been killed, he would have been successful in obtaining Geronimo's surrender and ending the Apaches' bloody raids.
Burial
Crawford's body was exhumed and reburied in Kearney, Nebraska, where his younger brother Zachary lived. Emmet had never married and Zachary and his family were his closest relatives. It was one of the largest funerals Nebraska had ever seen.
In 1908, Crawford's former comrades, by then including many generals, were granted permission by his closest relative, sister-in-law Caroline Crawford, to have his body moved to Arlington National Cemetery. On December 1, 1908, with full military honors, the body of Emmet Crawford was finally put to rest. His grave is located down the hill from General Crook's tomb and is marked by a marble obelisk.
Legacy
The town of Crawford, Nebraska, incorporated in 1886, was named after Emmet Crawford. In 1986, the descendants of Zachary Crawford were invited to the centennial celebrations of the town and served as grand marshals of the centennial parade. The remaining descendants still live in Nebraska today.
Fort Crawford in Colorado was also named after him in 1886.
Miscellaneous
Emmet Crawford is mentioned in many books covering the events of the Indian Wars and is shown in many field photographs.
One of the original adobe officer's duplexes at Fort Robinson is named after him.
He was portrayed by Jeremy Slate in the 1979 TV movie Mr. Horn and was given a fictitious sister portrayed by Karen Black.
See also
References
"The Truth About Geronimo" by Britton Davis, 1929
National Archives Military Records of Emmet Crawford (available on microfilm)
Papers relating to the Foreign Relations of the United States transmitted to the 49th Congress, December 6, 1886
Category:1844 births
Category:1886 deaths
Category:Union Army officers
Category:American people of the Indian Wars
Category:People of the Great Sioux War of 1876
Category:Burials at Arlington National Cemetery
Category:People of Pennsylvania in the American Civil War |
Evaluation of a urine antibody test for Helicobacter pylori in Japanese children.
To evaluate the accuracy of a urine-based enzyme-linked immunosorbent assay (ELISA) kit for anti-Helicobacter pylori immunoglobulin G antibody (urine-HpELISA) in children, we compared its sensitivity and specificity in reference to (13)C-urea-breath test (UBT) and H pylori stool antigen test (HpSA). Japanese children without significant upper abdominal symptoms were included (n=100; mean age, 7.0 years; range, 2 to 15). UBT, HpSA, and urine-HpELISA were performed. Of 100 children, 36 and 64 were judged H pylori-positive and H pylori-negative, respectively, by UBT and HpSA. Thirty-four of 36 positive children were positive by urine-HpELISA, and 62 out of 64 negative children were negative by urine-HpELISA. Thus, the urine-HpELISA had 94.4% sensitivity and 96.9% specificity, with accuracy of 96.0%. The urine-HpELISA is a rapid, inexpensive, reliable, and easy-to-perform method for the diagnosis of H pylori infection in children. It may be useful not only for diagnosis but also for mass screening for epidemiological studies in pediatric population. |
8 (d) 0
d
Let t = -176.9 - -31.9. Let w = t + 146. Which is the third smallest value? (a) w (b) -4 (c) 5/6
a
Let d = 8.55 - -54.45. What is the biggest value in d, -6, 0.2?
d
Let y = -0.5014 - -0.1014. Let g be 2*-2*2/12. Which is the third biggest value? (a) g (b) 19 (c) y
a
Let l = -0.346 + 28.146. Let p = 28 - l. Which is the third smallest value? (a) p (b) -2/3 (c) -1
a
Let s = -0.199 - 4.801. Let n = -241/252 + 7/9. Let p = 3/140 - n. What is the smallest value in s, p, -0.4?
s
Let m = -543/5 + 4359/40. Suppose -l - 6 = -3, -5*z = 5*l + 45. Which is the smallest value? (a) z (b) 5 (c) m
a
Suppose 3*g - 2*x = -33 + 43, 5*g - 20 = 4*x. Which is the third biggest value? (a) -5 (b) -2 (c) g
a
Let i = 41.4 + -39.4. What is the second biggest value in -0.3, -4, 0.05, i?
0.05
Let t = -3/46 + -10513/322. Let y = t - -33. Which is the biggest value? (a) y (b) -2/5 (c) -2
a
Let u = -24 + 29. Let t be (1/((-20)/8))/(3/u). What is the third biggest value in t, 0.12, 4?
t
Let f(h) = h**3 + 3*h**2 + 4*h + 2. Let b be f(-2). Let g = 6.8 - -13.7. Let m = 20 - g. What is the third biggest value in b, m, 0.2?
b
Let l = 11.92 + 0.68. Let k = -18 + l. Let g = -2.4 - k. Which is the second biggest value? (a) 0.1 (b) g (c) 0
a
Let w = 1301 + -1385. Which is the biggest value? (a) w (b) -0.5 (c) -8
b
Let u = 66 - 63. Let i = 8 - 9. Let g = i + 3. Which is the third smallest value? (a) g (b) -5 (c) u
c
Suppose -2*g = 4*p - 14, 0*p + 25 = 5*p + 4*g. Suppose 0 = 5*h + 16 + 9. Which is the second smallest value? (a) -3 (b) -1/2 (c) h (d) p
a
Let n be (-3)/((-189)/266) - (2 + 2). What is the second smallest value in -5, -25, n?
-5
Let t be 13129/5510 + 3/(-2). Let h = 14/29 - t. What is the third biggest value in h, 9, -2?
-2
Let l be 8/(-12) - (-28)/6. Let y(k) = 2*k + 14. Let h be y(-9). Let j be (-1)/(h/(-3)) + (-14)/(-28). Which is the smallest value? (a) l (b) -3 (c) j
b
Let m = -13 - -12.9. Let o = -1.4 + 2.5. Let t = 1.3 - o. Which is the smallest value? (a) t (b) m (c) 1
b
Let o = -0.0356 - -20.9556. Let w = o + 0.08. Let j = w - 26. Which is the second biggest value? (a) -3 (b) -0.04 (c) j
a
Suppose 4*q - q - 126 = 0. Let a = 173/4 - q. Let y = 37/70 + 1/14. What is the second biggest value in a, y, 2?
a
Let p = -0.36 - -0.6. Let o = 0.04 - p. Let v be (-1)/((-1)/4*2). Which is the biggest value? (a) v (b) o (c) -1/4
a
Let z = 126 - 83. Let p = -43.3 + z. What is the smallest value in 2, p, 4?
p
Let a = 0.056 - -0.944. What is the smallest value in a, -2/21, -4, 0?
-4
Let d = -2/375 + 84/125. Let a = -3 - -4. Let f = -3.1 + 3. What is the third biggest value in f, d, a?
f
Let g be 1/6*(-30)/(-2). Let k(i) = -i**3 - 5*i**2 + i + 1. Let s be k(-5). What is the smallest value in g, s, 4, -1/3?
s
Let x = 2054 + -2053. Which is the third biggest value? (a) x (b) -4/11 (c) 3 (d) 2/7
d
Let f be (2/3)/((-2)/3). Let q be f/(-22)*10/(-15)*6. Which is the biggest value? (a) q (b) -0.4 (c) 0.2
c
Suppose -16 = -2*o + 5*w, -3*o + 3 = -3*w - 3. Let x = 0.4 + -0.3. Suppose 3*v - v - 6 = 0. Which is the third biggest value? (a) v (b) o (c) x
b
Let m be (7/(-28))/(15/8). Let p = -6 - -8. Suppose 0*w + 5*w = 0, p*y = w + 2. What is the second biggest value in m, y, -3?
m
Let j = -1.2 - -1. Let f = -25.4 + -2.2. Let o = 28 + f. What is the second smallest value in o, -2, j?
j
Let z be 4/(-30)*(-549)/12 + -6. Which is the fourth smallest value? (a) z (b) 1/3 (c) -74 (d) -0.1
b
Let h = -0.7 - -0.2. Let x = 3861/4 - 965. Let p = -3.7 + 4. Which is the third smallest value? (a) h (b) x (c) p
c
Let k = 0.17 - 0.17. Let s = -17 + 27. Suppose 0*n = 2*n - s. What is the third biggest value in -4, k, n?
-4
Let o = -42 - -40.5. Let y = -2.4 - o. What is the second smallest value in 0.1, y, 2/19?
0.1
Let f = 5815/14 - 829/2. What is the biggest value in 1.4, 0, f?
1.4
Suppose 8*a = a + 1078. Let b = 1080/7 - a. What is the second smallest value in 1/5, b, -0.5, -20?
-0.5
Let o = 1082 - 1086. Which is the biggest value? (a) o (b) 2 (c) 0.3
b
Let m be (20/(-50))/(8/(-12)). Let f = -0.6 - -0.2. Let o = f + 0.4. What is the third biggest value in m, 2/9, o?
o
Let k = 815.77 - 816. Which is the smallest value? (a) 0 (b) k (c) -6
c
Let v = 0.4 + -0.5. Let n = -6.8 - 2.2. Let x = 0.259 - 0.259. Which is the second biggest value? (a) x (b) v (c) n
b
Let u = -188/375 + 46/125. Let j = -0.1 - -0.1. Which is the second biggest value? (a) j (b) 2 (c) u
a
Let o be (-470)/1175*(-2 + 1)/(-1). Which is the third smallest value? (a) 13/4 (b) o (c) 7/3
a
Let a = 5282/7 - 754. What is the third biggest value in a, 0.18, 4?
0.18
Let h(m) = 2*m - 7. Let d be h(5). Let q = 4359 - 4358.7. Which is the second smallest value? (a) q (b) -0.7 (c) d
a
Suppose -2*y + 5 = 3*y. Let l = y - 2. Let h be ((-9)/(-21))/(20/(-8) + 4). Which is the second biggest value? (a) 2 (b) l (c) h
c
Let l = 0.48 - 2.48. What is the third biggest value in 3, l, -13, -5/6?
l
Let u = -46/101 + -9/202. Which is the fourth smallest value? (a) 0.5 (b) u (c) 3 (d) 0.1
c
Let a = 7 + -3. Let u = a - 2. What is the third smallest value in u, 1, 3?
3
Let t = 0.6 - 0.1. Let i = 46 - 52.5. Let v = t + i. Which is the smallest value? (a) -4 (b) v (c) -1/8
b
Let p = 0.107 - -1.873. Let h = p - -0.02. Let w be 2/(-7 + 11)*14. Which is the smallest value? (a) w (b) h (c) 0
c
Let i = -81/28 + 22/7. Let c be 1/((3 - 2) + 0). What is the third biggest value in c, -0.02, i?
-0.02
Let q = 8.9718 + 0.0282. What is the second biggest value in -2, q, -3, 2/11?
2/11
Let h = -10.9 + 11. Let x = -6 + 6.2. Let u = 0.2 - x. What is the smallest value in -2, u, h?
-2
Let o(h) = -h**2 - 5*h - 1. Let j = -11 - -7. Let p be o(j). Suppose 4*z - p = 5*z. What is the biggest value in -0.5, z, 2?
2
Let v = -0.41 - 39.59. Let g = 37 + v. Which is the second biggest value? (a) -4 (b) g (c) 0.1
b
Let i = -2485/8 - -311. Which is the third smallest value? (a) -0.3 (b) i (c) 4
c
Let l = 0.1104 + 210.4896. Let g = -192 + l. Let y = -18 + g. What is the biggest value in 2, y, 4?
4
Let w = 29 - 30.4. Let s = 1.6 - w. Which is the biggest value? (a) -4 (b) 2/5 (c) s
c
Suppose -q - 1 = -4*q - 2*a, -a = -3*q + 13. Let i = 1071/5 + -215. Let j be (-4)/4 - (-78)/90. What is the second smallest value in i, q, j?
j
Let d(z) = -z**3 + 7*z**2 - 7*z + 1. Let a(f) = -f**3 + 11*f**2 - 11*f + 16. Let r be a(10). Let p be d(r). What is the third biggest value in 0.4, -0.4, 1, p?
-0.4
Let f be (-136)/12 - (12 - 23). What is the third smallest value in -4, f, -5/2, -44?
-5/2
Let n = -10.4 - -11.4. Which is the third biggest value? (a) -2 (b) n (c) 2 (d) 5
b
Let x = 3127/9 - 347. What is the smallest value in -5, x, -1/9?
-5
Let u = -0.1 + 11.1. Let n = u + -14. Let i = 21 + -83/4. Which is the third smallest value? (a) i (b) -1 (c) n
a
Let t = 1.6 - 2.1. Suppose -5*h = 5*u + 5, 2*u + 0*u = -h - 6. What is the fourth biggest value in -2/9, u, -0.3, t?
u
Let i = -5 + 11.2. Let q = 52.8 + -54. Let f = q + i. Which is the smallest value? (a) 2/9 (b) 1/5 (c) f
b
Let x = 42 + -35. Let l = 9 - x. What is the third biggest value in -1, l, 6?
-1
Let p be 2 - 85/80*2. Suppose -j - 4*t + 10 = 0, 2*j - 5*t + 38 = -j. Which is the second smallest value? (a) -1/3 (b) j (c) p (d) 1
a
Let w be 1*-3*(-102)/(-18). What is the second smallest value in -0.1, -0.35, w?
-0.35
Let t = -0.926 - 2.074. Which is the second biggest value? (a) -2 (b) t (c) 8/15 (d) -0.5
d
Suppose 4*h + 12 = k - 3*k, -3*h - 23 = 5*k. Let b = 9/8 - 97/72. Let x = -462.9 - -462.4. What is the biggest value in b, h, x?
b
Let b = -75 - -95. What is the third smallest value in -3, -0.2, b, 0.1?
0.1
Let z = -23.19 + 0.19. Let o = -20 + -3.1. Let n = z - o. Which is the biggest value? (a) n (b) 1/3 (c) 3
c
Suppose 12*x - 11*x + 8 = 0. Let h = -10 - 0. Let m = h - x. What is the third smallest value in m, -1/8, 3/2?
3/2
Let h = -12 - -37/3. Let x = 1.8678 + 0.1322. What is the smallest value in h, -1, x?
-1
Let r = -20.89 - -20.79. What is the second biggest value in 1.7, 2/13, r, -2/5?
2/13
Let q = -355 + 2125/6. Let z = -1/2 - q. Which is the second smallest value? (a) -0.3 (b) 4 (c) z
c
Let p be (3/(-5))/(335/166 + -2 |
170 F.3d 846
133 Ed. Law Rep. 344
Chinyere JENKINS, by her next friend, Joi JENKINS; NicholasPaul Winchester-Rabelier, by his next friend, PaulaWinchester; Margo Vaughn-Bey, by her next friend, FranklinVaughn-Bey; Nicholas C. Light, by his next friend, MarianLight; Stephon D. Jackson, by his next friend, B.J. Jones;Travis N. Peter, by his next friend, Debora Chadd-Peter;Leland Guess, by his next friend, Sharon Guess; Plaintiffs-Appellants,American Federation of Teachers, Local 691, Intervenor-Appellee,v.State of MISSOURI; Mel Carnahan, Governor of the State ofMissouri; Bob Holden, Treasurer of the State of Missouri;Missouri State Board of Education; Peter Herschend, Memberof the Missouri State Board of Education; Thomas R. Davis,Member of the Missouri State Board of Education; Robert E.Bartman, Commissioner of Education of the State of Missouri;Gary D. Cunningham, Member of the Missouri State Board ofEducation; Terry M. Riley, Member of the Board ofDirectors; Sharon M. Williams, Member of the Missouri StateBoard of Education; Lance Loewenstein, Member of the Boardof Directors; Betty Preston, Member of the Missouri StateBoard of Education; Russell Thompson, Member of theMissouri State Board of Education; Jacquelline Wellington,Member of the Missouri State Board of Education; MarilynSimmons, Member of the Board of Directors; Sandy AguireMayer, Member of the Board of Directors; School District ofKansas City; Dr. Henry D. Williams, Superintendent thereof;John A. Rios, Member of the Board of Directors; DarwinCurls, Member of the Board of Directors; Patricia Kurtz,Member of the Board of Directors; Edward J. Newsome, Memberof the Board of Directors; John W. Still, Member of theBoard of Directors, Defendants-Appellees.Chinyere Jenkins, by her next friend, Joi Jenkins; NicholasPaul Winchester-Rabelier, by his next friend, PaulaWinchester; Margo Vaughn-Bey, by her next friend, FranklinVaughn-Bey; Nicholas C. Light, by his next friend, MarianLight; Stephon D. Jackson, by his next friend, B.J. Jones;Travis N. Peter, by his next friend, Debora Chadd-Peter;Leland Guess, by his next friend, Sharon Guess, Plaintiffs-Appellees,American Federation of Teachers, Local 691, Intervenor-Appellee,v.State of Missouri; Mel Carnahan, Governor of the State ofMissouri; Bob Holden, Treasurer of the State of Missouri;Missouri State Board of Education; Peter Herschend, Memberof the Missouri State Board of Education; Thomas R. Davis,Member of the Missouri State Board of Education; Robert E.Bartman, Commissioner of Education of the State of Missouri;Gary D. Cunningham, Member of the Missouri State Board ofEducation; Rice Pete Burns, Member of the Missouri StateBoard of Education; Sharon M. Williams, Member of theMissouri State Board of Education; Betty Preston, Member ofthe Missouri State Board of Education; JacquellineWellington, Member of the Missouri State Board of Education;Russell Thompson, Member of the Missouri State Board ofEducation, Defendants-Appellants,School District of Kansas City; Dr. Henry D. Williams,Superintendent thereof; Terry M. Riley, Member of the Boardof Directors; Lance Loewenstein, Member of the Board ofDirectors; Marilyn Simmons, Member of the Board ofDirectors; Sandy Aguire Mayer, Member of the Board ofDirectors; John A. Rios, Member of the Board of Directors;Darwin Curls, Member of the Board of Directors; PatriciaKurtz, Member of the Board of Directors; Edward J. Newsome,Member of the Board of Directors; Dr. Julia H. Hill, Memberof the Board of Directors; John W. Still, Member of theBoard of Directors, Defendants-Appellees.Chinyere Jenkins, by her next friend, Joi Jenkins; NicholasPaul Winchester-Rabelier, by his next friend, PaulaWinchester; Margo Vaughn-Bey, by her next friend, FranklinVaughn-Bey; Nicholas C. Light, by his next friend, MarianLight; Stephon D. Jackson, by his next friend, B.J. Jones;Travis N. Peter, by his next friend, Debora Chadd-Peter;Leland Guess, by his next friend, Sharon Guess; Plaintiffs-Appellees,American Federation of Teachers, Local 691, Intervenor-Appellee,v.State of Missouri; Mel Carnahan, Governor of the State ofMissouri; Bob Holden, Treasurer of the State of Missouri;Missouri State Board of Education; Peter Herschend, Memberof the Missouri State Board of Education; Thomas R. Davis,Member of the Missouri State Board of Education; Robert E.Bartman, Commissioner of Education of the State of Missouri;Gary D. Cunningham, Member of the Missouri State Board ofEducation; Rice Pete Burns, Member of the Missouri StateBoard of Education; Sharon M. Williams, Member of theMissouri State Board of Education; Betty Preston, Member ofthe Missouri State Board of Education; JacquellineWellington, Member of the Missouri State Board of Education;Russell Thompson, Member of the Missouri State Board ofEducation, Defendants-Appellants,School District of Kansas City; Dr. Henry D. Williams,Superintendent thereof; Terry M. Riley, Member of the Boardof Directors; Lance Loewenstein, Member of the Board ofDirectors; Marilyn Simmons, Member of the Board ofDirectors; Sandy Aguire Mayer, Member of the Board ofDirectors; John A. Rios, Member of the Board of Directors;Darwin Curls, Member of the Board of Directors; PatriciaKurtz, Member of the Board of Directors; Edward J. Newsome,Member of the Board of Directors; Dr. Julia H. Hill, Memberof the Board of Directors; John W. Still, Member of theBoard of Directors, Defendants-Appellees.Chinyere Jenkins, by her next friend, Joi Jenkins; NicholasPaul Winchester-Rabelier, by his next friend, PaulaWinchester; Margo Vaughn-Bey, by her next friend, FranklinVaughn-Bey; Nicholas C. Light, by his next friend, MarianLight; Stephon D. Jackson, by his next friend, B.J. Jones;Travis N. Peter, by his next friend, Debora Chadd-Peter;Leland Guess, by his next friend, Sharon Guess, Plaintiffs-Appellees,American Federation of Teachers, Local 691, Intervenor below-Appellee,v.State of Missouri; Mel Carnahan, Governor of the State ofMissouri; Bob Holden, Treasurer of the State of Missouri;Missouri State Board of Education; Peter Herschend, Memberof the Missouri State Board of Education; Thomas R. Davis,Member of the Missouri State Board of Education; Robert E.Bartman, Commissioner of Education of the State of Missouri;Gary D. Cunningham, Member of the Missouri State Board ofEducation; Rice Pete Burns, Member of the Missouri StateBoard of Education; Sharon M. Williams, Member of theMissouri State Board of Education; Betty Preston, Member ofthe Missouri State Board of Education; JacquellineWellington, Member of the Missouri State Board of Education;Russell Thompson, Member of the Missouri State Board ofEducation, Defendants-Appellants,School District of Kansas City; Dr. Henry R. Williams,Superintendent thereof; Terry M. Riley, Member of the Boardof Directors; Lance Loewenstein, Member of the Board ofDirectors; Marilyn Simmons, Member of the Board ofDirectors; Sandy Aguire Mayer, Member of the Board ofDirectors; John A. Rios, Member of the Board of Directors;Darwin Curls, Member of the Board of Directors; PatriciaKurtz, Member of the Board of Directors; Edward J. Newsome,Member of the Board of Directors; Dr. Julia H. Hill, Memberof the Board of Directors; John W. Still, Member of theBoard of Directors, Defendants-Appellees.Chinyere Jenkins, by her next friend, Joi Jenkins; NicholasPaul Winchester-Rabelier, by his next friend, PaulaWinchester; Margo Vaughn-Bey, by her next friend, FranklinVaughn-Bey; Nicholas C. Light, by his next friend, MarianLight; Stephon D. Jackson, by his next friend, B.J. Jones;Travis N. Peter, by his next friend, Debora Chadd-Peter;Leland Guess, by his next friend, Sharon Guess, Plaintiffs-Appellants,American Federation of Teachers, Local 691, Intervenor,v.State of Missouri; Mel Carnahan, Governor of the State ofMissouri; Bob Holden, Treasurer of the State of Missouri;Missouri State Board of Education; Peter Herschend, Memberof the Missouri State Board of Education; Thomas R. Davis,Member of the Missouri State Board of Education; Robert E.Bartman, Commissioner of Education of the State of Missouri;Gary D. Cunningham, Member of the Missouri State Board ofEducation; Rice Pete Burns, Member of the Missouri StateBoard of Education; Sharon M. Williams, Member of theMissouri State Board of Education; Betty Preston, Member ofthe Missouri State Board of Education; JacquellineWellington, Member of the Missouri State Board of Education;Russell Thompson, Member of the Missouri State Board ofEducation, Defendants-Appellees,School District of Kansas City; Dr. Henry D. Williams,Superintendent thereof; Terry M. Riley, Member of the Boardof Directors; Lance Loewenstein, Member of the Board ofDirectors; Marilyn Simmons, Member of the Board ofDirectors; Sandy Aguire Mayer, Member of the Board ofDirectors, John A. Rios, Member of the Board of Directors;Darwin Curls, Member of the Board of Directors; PatriciaKurtz, Member of the Board Directors; Edward J. Newsome,Member of the Board of Directors; Dr. Julia H. Hill, Memberof the Board of Directors; John W. Still, Member of theBoard of Directors, Defendants.
Nos. 96-2809, 96-2918, 96-3215, 96-3568 and 96-3870.
United States Court of Appeals,Eighth Circuit.
Submitted Nov. 6, 1997.Decided March 15, 1999.
Arthur A. Benson, II, Jamie Kathryn Lansford, Kansas City, MO, for Appellant.
Jeremiah W. (Jay) Nixon, Attorney General, John R. Munich, Michael J. Fields, Bart A. Matanic, for Appellee.
Before: McMILLIAN, HEANEY, and JOHN R. GIBSON, Circuit Judges.
JOHN R. GIBSON, Circuit Judge.
1
The Jenkins class seeks an award under 42 U.S.C. § 1988 (Supp. II 1996) for attorneys' fees and expenses incurred in defending against the State's petitions for rehearing on earlier fee awards. We grant an award of fees and expenses reduced to account for partial success.
2
After we awarded fees in Jenkins v. Missouri, Nos. 96-2809, 96-2918, 96-3215, and 96-3568 (8th Cir. July 11, 1997) (unpublished), and held that fees should be awarded in Jenkins v. Missouri, 115 F.3d 554 (8th Cir.1997), the State petitioned for rehearing on both orders. Rehearing was denied as to No. 96-2809 and consolidated cases, but granted as to No. 96-3870. Jenkins v. Missouri, 124 F.3d 1310 (8th Cir.1997). We then entered a revised panel opinion in No. 96-3870 in which we adhered to our original holding that fees should be awarded and in fact awarded fees. However, we only awarded half the amount requested by the class, to reflect the class's limited success in the particular matter for which fees were requested. Jenkins v. Missouri, 127 F.3d 709 (8th Cir.1997) (Jenkins Fees VI ). The Jenkins class then requested an award of fees and expenses for defending against the rehearing petitions. The State and the KCMSD oppose the request.
3
The State argues that the Jenkins class is not entitled to fees because it was not successful in resisting the rehearing petition in No. 96-3870. This is a question of whether the glass is half full or half empty, since the Jenkins class retained its award but suffered a reduction from its requested amount. Fortunately, Hensley v. Eckerhart, 461 U.S. 424, 103 S.Ct. 1933, 76 L.Ed.2d 40 (1983), gives us a framework for handling such cases. As we developed at length in Jenkins Fees VI, 127 F.3d at 716, the Jenkins class is the prevailing party in this litigation, and the litigation at issue in No. 96-3870 was integrally related to the underlying case in which the class has been quite successful. 127 F.3d at 719. The fees requested here were incurred in work that was "useful and of a type ordinarily necessary." Id. at 718 (quoting Pennsylvania v. Delaware Valley Citizens' Council, 478 U.S. 546, 561, 106 S.Ct. 3088, 92 L.Ed.2d 439 (1986)). Because we held that an award of fees was proper in the two underlying appeals, it follows that defending against an attack on the propriety of those awards is also work that is a proper subject for a fee award.
4
The KCMSD argues that fee awards for fee litigation must have an end, and that awarding fees in this case will encourage counsel to file further requests "in seriatim and in perpetuity." The short answer to that argument is that the Jenkins class did not file the rehearing petitions; it is hardly equitable to blame the class for litigation initiated by the State, which the class was required to defend.
5
We recognized in Jenkins Fees VI that success in the particular matter litigated is "relevant but not determinative to the reasonableness of the fee" in that matter. 127 F.3d at 718. We therefore conclude that a reasonable fee for defending against the partially successful rehearing motion in No. 96-3870 is half the amount requested. We thus award the Jenkins class fees of $11,648.75 and expenses of $835.78 in No. 96-3870. In No. 96-2809 and consolidated cases, in which the rehearing petition was denied, we award full compensation of $1,840.35 for fees and expenses. As the fees and expenses were all incurred before November 10, 1997, the State is liable for the award, in accordance with our opinion in Jenkins v. Missouri, 158 F.3d 980, 983 (8th Cir.1998) (Jenkins Fees IX ).
|
When Is Activism “Terrorism”? When It’s Effective. |
"Concentration!" "Ben, film your sister." "And again." "Skis out, Emma!" "Skis out!" "Emma, concentrate." "You can do it!" "Good!" "Arms straight." "Straight!" "I said, legs bent, skis together!" "It's not rocket science!" "If at first you don't succeed, try, try again!" "You know that, don't you'?" "Do what I say!" "Concentrate!" "Go for it, honey!" "Go!" "Yes!" "Superb!" "BEST IN BED" "You saw the boss?" "He said he was relying on me, all of us, for the relaunch of the mag." "He wants powerful, new subjects that shift units." "Motivating the troops, y'knovv." "You're not motivated?" "We have different standards." "Maybe so." "Living proof that a journalist can be competent and attractive." "I'm delighted for you, Emma." "Your first real assignment." "A major subject." "Make sure your sources are solid." "Moving onto next month's issue." "Let's hear your ideas." "How about an in-depth report on miorooredits in India?" "I have the inside track." "Yes, very exciting." "Any other ideas?" "Maybe a major exclusive on the water shortage in Central Asia?" "No, we've been there, Tristan." "I came up with a subject." "Sex in a recession." "Why not Paris Hilton's sex life from a Freudian viewpoint?" "Hold on, Tristan, remember that our sales are down 20%." "Okay, you handle this one." "I expect investigative reporting, the big picture, key figures." "From the economic angle, of course." "Yes, go ahead, Yam." "The subject I suggested last year, the dark side of Pokemon." "It's big news right now." "Look, Yam," "I'm not sure that Pikachevv is a good fit with our editorial policy." "Why not?" "Mangas are big business nowadays." "Maybe a piece on the merchandising?" "I'm not sure that's Yann's angle on it." "But it's worth considering." "Yes, we'll discuss it another time." "Yann, remember you're on life insurance." "My whole internship so far." "Dig deeper on funeral guarantees." "They're crucial." "I can't let you take your eye off the ball." "Thanks for speaking up." "Really sweet of you." "No problem." "If ever you need a favor or anything, just shout." "Thanks." "You're our star writer, the one the competition covets, but you never agree." "You knowl hate lurid subjects like that." "Give it to Goody-Two-Shoes." "You're a pain." "The owner's on my ass, asking why our best-paid writer submits 12 pages a year that nobody reads." "The owner's cool with us paying his retarded son for a 10-year internship?" "Under a false name." "I'd appreciate you keeping that quiet." "See you." "The report on worldwide deficits, are you doing it novfl" "Yes, Paul asked me to." "Right." "You didn't knovfl" "Is it a problem?" "Far from it." "You're here 2 weeks, I pitched it 2 years ago." "No problem." "Give me sex every time." "Banging gets myjuices flowing." "Sorry, I filed it last night." "Don't waste time on sleep." "Ms. Emma Dorian?" "Sign here, please." "Looks very practical." "It's ergonomic." "Eases back fatigue and strained muscles, so you work hours at a stretch." "How many?" "50-60 non-stop'?" "Shit, gotta go." "You've gone part-time?" "To see my dentist, I need permission?" "Rinse." "Perfect!" "Let's see..." "Gently does it." "Perfect." "Say, Emma..." "You're on the IPO feature?" "Fine." "And the Andersen intervievfl" " I'm doing it tomorrow." " Alone?" "I think Paul's testing me." "Tell me, the interrogation, every day same time?" "Just asking because..." "You know, it's just..." "You need experience to face guys like him." "I'm not sure a beginner..." "I've been working 5 years." "Sorry, I always forget women's magazines." "Look, I left grad school with an MBA in public policy and applied economics, and completed my doctorate summa cum laude." "And you play violin?" "Yes." "Piano, too." "And to pay for college," "I freelanced for 5 years for women's magazines." "Is that a problem?" "Hey there." "You okay?" "Great, and you?" "I'm good." "You're married?" "Scared of commitment?" "No." " Complicated breakup?" " Not either." "Health issues?" "I'm fine." "Look..." "We don't have to..." "I mean, we can just hook up, now and then, just for fun." "Yes, but..." "Fun for who?" "I should have done my accounts." "You know what it's like at the beginning." "You get to know each other and gradually..." "Sure, but one time was enough." "You're a bit..." "How can I put it'?" "A bit limp." "I'm not into that." "Limp?" "Like shagging an anesthetized slug." "Nothing personal." "Asshole!" "Fine." "Is this PVC coated, Frangoise?" "Waterproof and stain proof." "Knew it!" "It's been bugging me all night." "It just wipes clean?" "And every Sunday, machine wash at 60°." "Amazing." "I saw a magazine report about it." "And heatproof, too." "You can put hot dishes on it." "In fact, it's real cotton, coated with PVC, which means..." "I've forgotten." "Do you remember, Frangoise?" "No, I'm afraid I don't." "The initials..." "It's on the tip of my tongue." "It's okay." "Tell us next time." "If I kept the warranty, I'll look." "Sorry, I don't feel too well." "I need to lie down before I go home." "We'll give you a ride." "Won't we, Ben?" "That's really sweet." "I'll make some coffee." "She's down in the clumps." "I can't say I'm surprised..." "The press is in big trouble." "What are you doing?" "Are you sick?" "I'm fine." "I needed to be alone." "What's wrong, sweetie?" "Mom?" "When you married dad, had you consummated?" "What do you mean?" "Had you slept together?" "Obviously." "Were you happy?" "Very." "We had a little place near city hall, your dad got a job..." "No, in the bedroom?" "Look..." "Benjamin came along very soon." "What can I say?" "So you were happy?" "Yes, very!" "Why all the questions?" "Apparently, I'm no good." "No good at your job?" "Not you, sweetie." "You're good at everything." "Know what dad would say?" "Mom, it doesn't work every time." "Your father's method." "4 steps, and lock it off." "It worked just fine." "Your father taught you to be winners." "Not losers, flattened by the tiniest setback." "I have some free time if you need anything doing." "What'?" "I was saying, I have some free time, so just ask." "Thanks." "Hows it going?" "Okay." "I'm beginning to get a good overview." "By the way," "I had an idea." "You need to drop by The Jackhammer." "The swinger club." "The boss is Zeno..." "You know him?" "Very vaguely." "If you play it right, he'll give you the juice." "Except he leaves on vacation tomorrow." "Okay, I'll check it out." "You won't get in alone." "Go with Emma." "Yeah, sure." "You realize what it is?" "Yes, Tristan." "A swinger club." "The boss'll give you the juice, but he's going on vacation." "You don't miss a trick!" "You forgot the bullet-proof vest." "Look, there's Zeno." "Thanks." "I'll grab him." "Champagne, please." "You saw the new room?" "With the gynecologisfs chair." "Yeah, great." "Next up is a medieval-style torture chamber." "Very hip in Amsterdam." "They were all tangled up." "A bowl of spaghetti." "Too much Red Bull, seriously." "The old guys can't take it." "I've seen three strokes here." "Hassle every time." "When do you begin?" "I'm just killing time." "Want to test the chair, the stirru ps?" "I have 14 guys signed up." "Pardon me?" "You're here for the gangbang?" "Not exactly." "I thought you were the new girl." "The last one who turned up looking like you turned over 60 guys in one night." "I never go by how people look anymore." "We're here, you're home." "Thanks." "Hold on." "I'm hot." "I may not rock but I'm not a slug." "Here." "Thanks." "I'm not a slug." "Feeling okay?" "Great!" "Thanks for last night." "I really did get the juice." "It was fun." "You partied after?" "You know, it was pretty late." "Yeah, true." "What time was it?" "When we got to your place, at least 3 already." "You took me home?" "Of course, silly me." "Hovvfar'd you take me?" "To your bed." "Right." "Did you sleep well?" "Not much." "You got to bed late?" "Just after you." " You don't remember?" " Sure, I do." "I have a feature to finish today about..." "Ethical finance." "It's fascinating, awesome." "I've no doubt it is." "I'm a slave to sex." "Day and night." "I was wondering, about last night..." "Was it good?" "Because right now, I'm a bit..." "Absolutely, you're a bit..." "What'?" "Now you've told me you're a bit..." "It's so much clearer." "What is?" "I don't know." "You say that right now you're a bit..." "So I think, okay, she's a bit..." "Which means you're..." "What am I?" "Forget it, it's awkward enough as it is." "There was a glitch." "Shit happens." "Let's leave it there." "Nothing happened." "Nada." "Don't sweat on it..." "Little slug." "In a word, I suck." "That's new." "Cut it out." "Ben, I'm serious." "I'm sure now." "Lucas never said anything?" "And the guy before him..." "Did he say anything?" "No, but it's not that easy, you know." "Maybe, nobody dared." "It could be why I'm still single." "You dumped them." "Not Frédéric." "I just don't cut it." "That's twice, two different guys, two pieces of terrible feedback." "Apply dad's method." "Give me a break." "You're right, that's what I should do." "What'?" "Become the best lay in Paris." "The best!" " Downtown Paris or..." " All 20 boroughs." "The whole county." "Hey there." "Throw in Normandy, maybe?" "Normandy?" "I love it." "Another time, Béné." "Of course, there's Sex for Dummies, the fundamentals." "If you want to take it further, there's this one." "Last year's bestseller." "Similar vein..." "There's this one, too." "Let's Talk About Sex'?" "With that, you're already past the beginner stage." "And if I want to go straight to expert." "In that case, don't beat about the bush," "First in Bed, by Professor Chaban-Cerbére." "But be warned, it's very technical." "Can you stick to green, maybe, for today?" "Or red, even." "Just choose a color and stick with it." "Sorry." "So, hows it going?" "I got a source on Eastern Europe." "And tomorrow, I'm seeing the guy behind French Porn." "That's great." "A guy at the body shop gave me the number of an escort girl, one of the best in Paris, knows her stuff." "Charges 5 grand a night." "5,000?" "And it's word-of-mouth." "It's extortionate." "It's the market price." "You can reach her every day, anytime till 6." "And after 9 on Sundays." "Say I sent you." "You sent me?" "Or the guy at the body shop?" "Yeah, him." "But I'll give her a call." "See you." " Hello." " Hey." "Ag ath e'?" "Yep, come in." "I'm Emma Dorian." "Nice to meet you." "Put your stuff down there." "A drink?" "Yeah, sure." "Exams in two weeks, sorry about the mess." "It's cool you could find time to see me." "I'll pay you, of course." "Forget it." "So, how can I help you'?" "Okay, as I said to you on the phone earlier," "I thinkl suck in bed." "And so, if I sleep with a guy once, he never comes back for more." "That's not very practical." "No." "You've always sucked?" "No." "I mean..." "I'd never noticed, but twice running..." "Statistically, it's not good at all." "A dentist and a reporter I work with." "You're in the media?" "Who with?" "A magazine?" "Sorry, one of my regulars." "Hello, Peter." "I can be there in under an hour, if you can hold out." "I'm on my W3)'" "Sorry, an emergency." "In this business, you're on call 2417." "And he's wild." "Can you call a cab?" "Sure." "She's on her way." "Sorry." "Come with?" "Yeah, right, sure." "Rule number 1, always keep them waiting." "It's like any line of work, there are fads." "Right now, I'm top 5, but only because I play smart." "Going on internet kills you." "The golden rule, no photos, only fantasy." "So, how many clients do you have'?" "At around 5-6, I start turning people away." "It's not all fun." "And technique-wise..." "Are there any tricks or things that work every time?" "It's my job, Emma." "I'm a pro." "Your problem's different." "You need to start getting off." "A good lay is a chick having a blast." "The problem is, I'm not up to speed." "Up to speed at what?" "You need to get to know your body, honey." "Got any toys?" "Here you go." "Call me." "Don't worry, I'll send you something to light up your puss!" "Thanks, great." "How about that!" "Yeah." "Make some room for the Baked Alaska." "How are you working on it'?" "How do you do that'?" "Well, I watch films," "I read books, I..." "Screw theory, learn on the job." "Sure, but that takes some organization." " Did you make it?" " Yes." "I found the recipe in Universal Woman." "You should find someone to help out." "You're overworked?" "Can't your intern lend a hand?" "Sure." "Y'knovv, before interns climb the ladder, they're horribly exploited." "I saw a documentary." "As we speak, in this day and age, interns are slave labor, like it or not." "Sure, but in this case, I can't..." "This isn't for interns." "Precisely." "They love tasks that aren't just copying." "Béné's right." "Get the intern on board." "Listening to her blowing him, 9 felt my pussy pulsating." "My mind was drained, I was melting..." " How are you'?" " Fine, and you'?" "Say..." "Are you trying to stiff me?" "At work." "Why do you say that?" "I needed a stapler and looked in your drawer..." "You know what I found?" "I can guess, but it's not..." "It's not what you think." "It was for earlier, when I thought I could help you." "Very good of you." "But I'm doing fine without you." "Of course." "That's not what I meant." "You don't like me." "It's not my style to tread on someone's toes." "Maybe." "Sorry, if I got you wrong." "I've gotta go." "See you later." "I can't bring myself to hate her." "Your crown's at stake." "You know who you're up against." "No complacency." "Good luck to the rookie, though." "Let's be fair play." "Concentrate, and let's play..." "Fire!" "Hi." "Hi, Emma." "Sorry, it's the final." "The final?" "It's the big Copy Fight-Off." "She's 3-time champ, but she's new, so the title's up for grabs." "Copy both sides?" "Sure." "The first to finish wins." "The Xerox has a 20-page handicap because she staples faster." "I was thinking..." "You've been here long?" "Three years in June." "Before I was at Photocopy Weekly." "Let's go!" "You remember when you said that I could ask you a favor, any favor?" "Well, I've thought of something." "This is a bit..." "Shall we begin?" "What, now?" "No, finish your apple." "I brushed up on Cowgirl and Doggie to start with." "Dear Emma, a partner for you Agatha" "My lawyer's wife gave me an address." "The celebrities' sexologist." "Gipch." "It's madness, a six-month waiting list." "What's he do?" "He resolves every issue." "Fantasy issues, libido, all kinds of hangup." "Even people who can't satisfy their partner." "He's the best." "Say Peter sent you and he'll talk to you." "Peter or his wife?" "Peter." "Take it down." "So..." "O1... 4455... 6745..." "There you go." "I'm relying on you." "Emma, your copy is perfect." "If you have time, let's have a talk." "I'd like us to discuss some ideas..." "No, no pressure." "Like a numeroscope..." "We said no horoscopes." "A numeroscope." "The angle's economic." "Okay then." "This adjusts your chair?" "Wrong button." "No, it's not the..." "Okay, I've got it." "No, you press there." "That's not..." "Wait!" "That's not the chair." "Give that back." "Let me see." "That's not what's buzzing." "It's not that." "It's my garage remote!" " You don't have a car." " Soon!" "I've got work to do." "What's wrong with her?" "Her self-esteem's low." "I can't bring myself to hate her." "It'll feel weird, after my whole career with one firm." "I've seen it all." "Layoffs, strikes, computerization..." "So many faces and changes." "You'll love it down south and you can freelance." "How long's Tristan been here?" "Maybe 8-10 years." "Before, he was a war reporter in Iran." "Not at all, it was Iraq." "His stuffs still at work?" "No, he moved in with a woman." "Not at all, he's back living in his camping car." "Nonsense!" "He never owned a camping car." "I heard he was in a squat uptown." "Not at all!" "Does he have kids?" "Not precisely." "He married a biology researcher." "One day, she ran off to work with animals in Africa." "What are they called?" "They run fast." "Panthers with spots." "I wouldn't kick Tristan out of bed." "I just saw the escort girl Paul told me about." "She does it to pay for college." "Guys are praying for her to repeat a year." "She obviously blew you away." "I admit I didn't take many notes." "That good?" "C'mon, she's a pro." "How can you tell'?" "Did you..." "You mean, you tried her?" " Is that all?" "Thanks." " You can't get enough?" "Hows your article coming on?" "If you wanted to nit-pick," "I'm short a paragraph on the sex lives of train conductors, but they're hard to pin down." "Harder than an escort girl, I guess." "For sure." "Seriously, did you sleep with her?" "This is for your sex file?" "That's a point..." "Hows it going?" "Let's see." "It was just if you needed backup." "C'mon, show me." "Maybe you nailed something." " It's random..." " Don't be shy." "Cut it out." "Where is it?" "You're annoying!" "We said, no pens." "Hands off those!" "Tonight still on?" "You look a million dollars." "I'm going with Paul to a meeting." "What's he disguised as?" "See you tonight." "Good bye." "Miss..." "Come in." "Excuse me, you're not Bob Clark, are you?" "I saw you last night in Pussy Patrol." "And I also saw you in..." "I always forget the title." "You won an award..." "The Gardener Returns." " Emma Dorian." " Nice to meet you." "I am so glad I ran into you." "Catherine, my wife." " Emma's a fan." " Not at all." "I mean, I really like your work, honestly." "You're great..." "But that's not why... anyway," "I'm a journalist and our cover story is on your business." " Great!" "You have a card?" " Sure." "I work for an economic monthly." "Mr. and Mrs. Clark!" "Good bye." "How can I help'?" "I'd like to try to..." "No, I want to improve my performance sexually." "You realized there's a problem." "Before, I never really thought about it." "I was doing fine." "No, you weren't." "Don't delude yourself." "What made you realize?" "A recent experience." "Two, in fact." "I sucked so bad I became aware of..." "So you want to improve?" "Exactly." "Fine." "Three solutions." "The electronic perineum, a procedure developed in Brazil." "It replaces natural muscle with artificial muscle, with a range of functions, vibrate, squeeze, contract, and squeezing the organ." "Several clients have had it done and they're delighted." "30,000 euros, including fitting." "Guaranteed two years." "Besides that?" "My personal coaching program to train women up to be experts." "95% success rate." "And patients only come back when their husband has been banged to a pulp or he's died on the job." "What does it involve?" "Correction of bad posture and the history of sex." "It's interconnected." "You can't be a great lay and not know a few crucial dates." "12,000 euros." "All inclusive?" "Look, it's very popular." "This year, 3 patients reached the regional finals." "Performance is my trade." "My best clients perform in competition." "Okay, so we've been married 15 years, we have sex occasionally, but you never get off." "You want more variation." "And you?" "I act the wham-bam-thank-you-mafam kinda guy." "That won't be hard." "Remember, Dictaphone on, bag open." "Don't you feel you should move on?" "Cut that out." "This is work, not a shrink session." "Just focus on your role." "What he's offering, how much and does he take cash'?" "We'll start nice and easy." "Think about it and call me." " Thanks." " Miss..." "Liliane, I pay you to open the door, not to chat on Facebook!" "You want to talk to me?" "Tristan, it's not what you think." "It so happens that Gilbert Gipch was my pediatrician." "Long ago, when I was a little girl, he cured me of..." "Regurgitation." "Look, I'll be very clear." "I don't know what you're up to, but it's game over." "I've seen tons of suckups like you." "From now on, if you go anywhere near my files or contacts..." "It's not what you think." "Can it, it's getting boring." " But..." " No, enough." "You think guys train to be good?" "Half of them need to bone up on the female anatomy first." "But I'm not up to speed." "Cut out the up to speed crap, it freaks me out." "You got an FWB." "Friend with benefits, to keep puss happy." " It's all the rage." " I have." "That's good." "I'm on my W3)'" "An emergency." "Same guy." "Can we meet next week?" "I might be going to Belgium with him, on business." "My brother's a bank exec." "He could maybe swing you a job." "Come for dinner with us." "I'll get back to you." "I'll see you again anyway." "I'd like a few practical lessons." "Fellatio, maybe." "You've blown guys, haven't you?" "I want the pro version." "That keeps a guy coming back." "Fellatio isn't like tennis." "You have to improvise." "But you must have tips on what to do and what not to do." "Hot-and-colds a goodie." "I usually use whiskey, or peppermint sorbet." "Only Picard's, though." "Guaranteed ejaculation." "Right, but you don't always have some to hand." "What matters is working out what gets you off." "What makes you vibrate." "I've vibrated a lot recently." "You must notice a difference." "You know, if it's Penelope Bowl or Samantha Pearl, who's worth every penny she makes, to me, it's the same." "You've met Catherine, my wife." "We met Emma at Gipch's." "Eric, I remember." "Your name's Eric, Bob?" "That's funny." "Catherine's your real name?" "I'm a teacher." "A pseudonym's unnecessary." "Sorry." "Going back to your scene partners, if I may, no one's better than another?" "Sure, obviously." "Some take lessons, so they have more presence on set." "But sexually?" "It's all about technique." "The girls have to train regularly, to avoid cramp and dislocations." "For us, it's all about the climax." "Meaning?" "The ejaculation, the money shot." "Isn't your angle the economics?" "Yes, of course." "What about you, Catherine?" "It can't be easy all the time, being a porn star's wife." "My girlfriends wonder if their man's banging the office intern." "I know he bangs all his co-workers." "Very pragmatic." "Eric's tired, I think." "He has four climaxes tomorrow, so if you have all you need..." "I'll make do with this." "After you graduate, I'll get you an interview." "Thanks, that's cool." "That's a date!" "All without having to put out, unlike in some jobs." "You're kidding!" "Is this VPC'?" "Not VPC." "It's PVC!" "I went out and bought it next day." "It's brilliant." "A tablecloth that wipes clean and doesn't crease." "Heaven!" "It's cotton coated in PVC, otherwise known as polyvinyl chloride." "What do you do, Béné?" "I read magazines, I watch daytime TV, I..." "I live out other people's lives, light years from mine." "And I cook for my hubby and sister-in-law, who's always here." "I chat with the cleaner." "I can't even get pregnant after three years of trying." "I tell boring stories that make people laugh." "I'm the housewife under 50 advertisers aim for." "You are our beacon in a storm." "We're lucky to have you." "I was thinking, you should use a little makeup to highlight your eyes." " Really?" " Sure." "A touch of eyeliner here would bring out your natural presence." "It's a shame not to." "Okay, I'll give it a try." "I have a date with my intern." "On Sunday?" "That's appalling." "That feels so good!" "Goldorak, go!" "Let's drop anchor here." "You'll be so energized, you'll see." "Cheesy triangle or cheesy cube?" "Cheesy cube." "You went to Oxford?" "You bet!" "And every other summer camp." "Oxford, Cambridge..." "Really?" "Your family had money?" "Dad wanted me to speak 4 languages, at least." "So, around 10-11 years old, I developed a mental block." "I refused to speak." "Nothing." "Not in French, nor in English, nor in Flemish." "The shrinks all told him I had huge potential, but I'd express it later." "I went to live with my Granny, and that did the trick." "You made a pretty good recovery." "Yeah." "And now..." "There's us." "Us'?" "Slow down now." "What more do you want?" "Vanilla or chocolate?" "I mentioned your problem to Dad and he'll lend us the house in Ostend." "Yann..." "I hope we're on the same page." "We have our little sessions, we're good friends, and that's all." "It's two co-workers hooking up, no more." "You understand?" "Do you understand?" "Thierry?" "Paul wants me to add a porn star interview, but this time he has no contact." "He could ask his butcher." "Seriously, what's the name of that guy who's all over the media?" "Bob Clark." "He's washed up." "Come again?" "He's a bit washed up." "You're an expert on porn stars?" "Not particularly." "I just know Clark won an award for The Gardener in 2003, which is getting pretty dated." "You can do better." "What about Richie Salmon, the rising star of Hands Down?" "Or the guy with the prehistoric penis?" "Bartlomiej Zabrisleski." "What a performer!" "He's Polish." "Top notch." "Did your folks run a sex shop?" "I have a drill for you." "You're young at heart, if I say porn star, you think..." " Alive or dead?" " Alive." "Bob Clark." "Out of the mouths of babes..." "I called Bob Clark." "See who I mean?" "He turned me down, saying he'd told you all he knew." "I'm sorry." "It's not what you think." "I don't think anything, I want an explanation." "I met him in Gipch's waiting room." "I swear it's true." "We got chatting and..." "He suggested that we had a more private meeting." "He came onto you?" "The sleazeball fucks all day, then hits on random women?" "How come he sees Gipoh'?" " Sperm issues." " Yeah, right." "Seriously." "He has a very tough schedule, you know, so he needs a special diet." "So what's with the intervievfl" "We came up with that in case there was any hassle with his wife." "A kind of alibi." "So, you banged Bob Clark?" "No, personally, I don't bang anybody." "No way!" "Was it just like the movies?" "What can I say?" "He's a pro." "Precision, flexibility..." "He does things with his body other guys can't." "You're here already?" "Well?" "You lay down the lamf?" "There's no point, she's a total nutcase." "The superhero lowers his guard." "The end of an era." "I can't bring myself to hate her." "Well, let's just get a rapid overview of the situation." " Is your copy ready?" " Except for one sidebar." "Great, we're going to press Thursday." "My article's the whole mag, or there are others?" "What can I say?" "It's the cover story, the main feature." "For February's issue," "I came up with a killer subject, maybe worth a special edition." "It's a recent but significant phenomenon, and I want to be first on it, for once." "What is it then?" "Prostitution in old folks' homes." "The economic angle." "Any takers?" "Emma, it's a golden opportunity." "A French exclusive." "I'm good thanks." "I've had enough sex recently." "Really?" "Michéle?" "I just put my morn in a home." "I can't do that." "Doesn't it cross the line?" "It's on the razor's edge, but it happens, it's serious and it sells." "Leave your hipster cafés." "I'm warning you, I'll decide unilaterally." "And for the supplement, and I want volunteers here, the black economy of gnomes." "The economic angle." "Garden gnomes?" "No, vertically challenged people." "Any takers?" "Michéle!" "So we're agreed." "We have targets to meet." "See you Thursday." "Emma, Tristan, in my office." "I want a word." "Slight problem." "I'm double-booked, Cabourg and Belgium." "Belgium?" "The majority stockholdefis Belgian." "So you two will represent the mag in Cabourg." "Watch out, it's no vacation." "Sign up for the workshops, give presentations." "It'll be great to get out." "Nothing beats a congress for team bonding." "I'll leave the details to you." "That top suits you wonderfully." "You okay?" "No, not okay, at all." "I'm in a total panic." " How long before I'm hot'?" " Hot'?" "Like guys are always saying..." "She's hot, she looks hot, what a hottie!" "What does hot mean exactly?" "Having tits and an ass, period." "No, there has to be more to being hot." "You're on a hot streak, hot in bed, smoking hot, but what makes a hottie hot?" "You've lost it." "Being a hottie means being hot to trot." "In his dreams." " Are you sure?" " Yes, I'm sure." "Afternoon, what can I get you?" "Same as her." "I don't know anymore..." "I'm so confused." "I've even forgotten how to show a guy I like him." "I can help." "You make eye contact, look deep into his eyes, lustfully, and think sex." "With every particle of your being, think sex." "With every pore in your skin, think sex." "Even if the conversation's about Marxism or the veal stew, you gotta think sex." "Demonstration?" "That'd be good." "Excuse me, sir, my friend and I have two days left in Paris, and we're wondering what to do." "We can't decide." "Take in the Eiffel Tower?" "Or meander down the canal?" "Or go down on the Latin Quarter'?" "I love the uncertainty, that moment when nothing is set in stone." "Maybe I can take you?" "Not right away." "Give me your card." "Thank you very much." "Blow." "Blow, I said." "Crazy, the wastage of office supplies." "I was thinking, maybe we should have a debriefing, one to one." "Sure, but not tonight." "I'm going swimming." "You still ache?" "No, I do not still ache." "I knew it." "You're not using all your muscles." "All your organs need to be active." "See you after the pool." "Before the next session," "I want you to conduct an experiment." "Drink this in one go before the act." "You'll have a wonderful time." "See you again..." "Next week." "But I can't fit you in every time." "This cannot be sporadic, treat it like a training program." "Thank you, doctor." "Liliane!" "It's 15 years since he passed!" "After the accident, I panicked about the children..." "Mom, not again." "I'm talking to Bénédicte!" "A half-hour later, at the hospital, the doctor told us he was hemorrhaging..." "And sinking fast." "I can't talk, I'm at my mother's." "More mashed potato anyone?" "Emma, don't do this." "I'm working my nuts off to help you." "You can?" "stand me up." " Yann, it's breaking up." " I have lots to tell you." "The reception's terrible." "I can't hear you." "I'll call you back." "My intern." "He's taking too many initiatives." "You know..." "I'm worried about your mom." "It's hard for a woman, living alone, in today's selfish society that's losing touch with reality." "If Ben passed away..." "Are you okay, Béné?" "You seem depressed lately." "You think?" "I don't know..." "I'm glad I have you guys." "You'll see, it matters, being accepted into a family." "I can hardly accept myself." "I have a migraine." "In my bag, help yourself." "Thanks." "Until I've asked my N+1, I can't do anything." "We need to have a meeting and discuss it, see if we can agree, before we put anything in writing..." "You okay, honey?" "I'm hot." "It's tricky with regard to Europe." "The directives won't change, just like that." "We'll consult and see how it goes." "Anyway, we don't write it up." "We consult first, with our colleagues, because there's..." "How many of us'?" "There must be more or less four of us." "The consultation period and the..." "Anyhow, we don't care, we don't write it up." "It's not our department." "Honey, we're going to have to leave." "Come on!" "Sorry, honey." "I can't wait." "Come on." "I'm so embarrassed." "I don't know what came over me." "Forget it, honey." "I am so ashamed." "Really ashamed." "So ashamed!" "It felt as if I were possessed." "It wasn't at all unpleasant, Béné." "In fact, it was very" "nice." "Very, very nice." "That's reassuring." "You won't leave me?" "'Course not." "Hi, mom." "No, everything's fine." "Say, I need to know, the spice in that dish last night." "What was it?" "Cardamom?" "Really?" "You're not answering?" "I'm finishing an article." "You think you're up to speed?" "Can we do some work here?" "Look, Yam, we got in some training and I thank you for your help." "Thank you, seriously." "It really helped." " Now I need to work solo." " You're disheartened." " No, I'm not." " You are." "You're losing it." "You're drained." "From now on, leave it all to me." "I'll be fine on my own." "If you end it, I swear I'll tell everyone everything." "Everything!" "See you Thursday." "If you could give me some advice, I'd appreciate it." "You have my card?" "Call me after your internship." "Okay." "See you soon, then." " Don't you despise free newspapers?" " Me?" "Not at all." "Know what I did at college?" "I edited a home base catalogue." "So you haven't always been the acclaimed, campaigning radical?" "How about dinner on my expenses?" "Sure." "L guess, relationships, projects, mortgages, all that stuff that blows up in your face just isn't for me." "No commitment, then?" "I didn't say that." "What's commitment?" "An all-inclusive, 20-year plan." "No, I prefer... scattered fragments, random little nuggets, not a special deal for suckers, all packaging, no content." "You can hold your drink, for a slug." "But watch out, after one bottle," "I take no responsibility." "Our moment of intimacy was nice, though." "Yeah, right." "You seemed unimpressed." "What did I say?" "You implied I was not right up there." "Hold on, you didn't think we slept together?" "We didn't?" "Absolutely not." "I'd rather die." "Thanks a lot." "I mean, taking advantage of a woman who blacks out is not my style." "I just bought what you said." "What'?" "It could've happened." "Technically, yes, but no." "We should be going." "Hold on a second." "What the hell!" "Shit!" "Tonight, doggie and helicopter." "Your king of sex." "Keep calm!" "Arch your back." "It's all on there." "All What?" "Your assessment." "SEX ASSESSMENT" "I told you about it." "Everybody's on their way." "We'll do this later." "I can post it in the elevator." "Okay, here we go." "In terms of overall performance, there's a positive trend." "Great." "Relax, we're coming to your return on objectives." "Move it." "Hold on." "The highly anticipated conclusion is next." "So, in terms of post-coital reassurance of your partner..." "What's wrong?" "Already hard at it." "Good job!" "Don't forget the article on Finderscom." "I'll call Gaillard and we'll talk." "Right." "Yann?" "Can we talk long-term funeral loans?" "AFTERGLOW BLOWJOBS" "Fascinating." "So, you're leaving us?" "It's a shame." "I had a great subject for you." "The housewife lobby." "Funding, cooptation, the black market..." "Not forgetting addiction to household products." "See?" "You key into the editorial line." "And you key in?" "What do you think?" "Excuse me." " The body shop, sir." " I'll take it." "Yes, sir." "I couldn't not tell him we'd been eating it all week." "He said I'd OD'd." "If it's not that, what possessed you?" "Okay, the context was dinner at mom's in memory of dad." "What do you call people who..." "I'm so hot." "That's it, Béné!" "Dad's death." "You're a necrophile!" "Can we talk about it later?" "You're a necrophile!" "There's Peter." "I invited him to join us for coffee." "He works in the financial press." "Maybe he can help you switch jobs." "I'm training her up." "She's very keen." "I thought you could teach her a few tricks." "She's very open-minded." "If it makes you happy." "Excuse me." "What were you doing in there?" "Peter, this is Emma, whom I was telling you about." "Emma, Peter is my favorite." "Insatiable and inexhaustible." "Nice to meet you." "Sorry, I have to run." "I forgot we had friends for dinner." "Good bye." "That's a pity." "I told him I was training you up and you were totally into it." "Hi, my name is Jules." "Yann Damimo told me you were in training to become the best lay in Paris." "Pm interested." "You can reach me on..." "This is Thierry from work." "Venn told us everything." "If you need to talk about it, I'm here for you." "You have my number." "Lots of love." "Don?" "think twice." "It wasn't bad." "Not bad at all." "Hurry, we'll miss the 'I 'I o'clock at Pére Laohaise." "It sounded awful." "You said that yesterday, but it was great." "What are you guys doing here?" "A loss in the family?" " No, a friend of mine." " Who?" "What was his name again?" "Raymond Mullard." "Sorry, we have to go." "Bob Clark called for you." "He said you were welcome on the set of The Plumber Leaks." "Apparently, you asked..." " He misunderstood." " I don't know." "You're coming to Nicole's leaving party?" "Hello?" " Miss Dorian?" " Speaking." "Dr. G§pch's secretary." "I have great news." "You're in the semi-finals." "The competition Dr. Gipch mentioned." "Three-way with Peter?" "You'll love it!" "You seem embarrassed." "There's no problem, no consequences." "Nothing happened." " Nothing." " Nothing at all." "Dear friends, can I have your attention, please?" "My dear Nicole..." "It's the big clay." "You're leaving us." "I can say without fear of contradiction that we'll miss you." "Yam, who spent some considerable time as your intern, insisted on saying a few words." "So, over to Yann." "Testing, testing." "When I joined the company as intern, you looked me in the eye and said," "Look beyond the Xerox machine..." "Proud of your man?" "It's not what you think." "So it's not you banging the owner's son to get on?" "Banging who?" "The owner's son." "The great romantic poet who sexts you." "Yeah, right." "And Nicole's Lady Gaga." "She's just warming up for her show." "For a brilliantjournalist, you're badly informed." "See, you can't control everything." "Shit happens, there are little glitches..." "We all have moments of weakness, even you." "Nicole, keep on rocking!" "I'll take this opportunity to announce two other departures..." "Tristan is joining one of our competitors, which equates more with his..." "How can I put it'?" "He's leaving us." "And Yann... is moving to another of the group's titles, where, as Executive Intern and insurance expert, he will supervise the junior intern." "Finally, I'm pleased to announce that Emma will become chief editor of Futures, a fine and well deserved promotion." "Enjoy your day." "The bar is open." "I'm afraid I can't." "I don't want more training, I don't want anything." "Exactly, I'll vegetate." "Take your electronic perineum and shove it up your ass!" "What'?" "The stalker in the Goldorak robe can shove it, too." "Same goes tot the has-mews contacts." "Above all, I'm giving up locking-off." "I'm tired." "Can't you understand that?" "If a guy wants to hit on me, he can start by getting up to speed." "And if I suck at fellatio," "I don't give a damn!" "I'm resigning, too." "Yes, Peter, I'm gone." "Your gnomes and wrinkly hookers..." "Say hi from me." "Friends, help yourselves." "I'm afraid..." "I'm gonna have a sluggy moment." "Sorry, yeah..." "What's the forecast for an upswing?" "Good." "After a quick pick-me-up." "Subtitles:" "Simon John" "Subtitling:" "C. M. C." |
(05-26-2012 11:09 PM)Firefly Wrote: that's probablly why we all like him lol
The thing about personality profiling (actually FBI behavioral psychologists apply these concepts to catch serial killers, etc) is that while we have a dominant mode that is natural to us, in various situations we can shift to another mode or personality, a strong secondary mode that we use in particular circumstances. For instance, by myself I'm an INFJ, but at work I'm an ESTJ.
So wait, a person's personality makes them a serial killer. i think i'm a little confused lol
No. Rather, the behavior of a psychopathic individual points back to a personality. Did you know 80% of CEO's and politicians tested positive as having a psychopathic personality? While none of them are serial killers, they all display the Glibness/superficial charm, grandiose sense of self-worth, the lying, manipulating lack of remorse
and absence of empathy that characterizes a psychopath.
Psychopathology is strongly tied to a certain disposition in personality. The Pt Types guy identifies it as ISTP pushed to the extreme. The key here is "in the extreme". Any personality in the extreme becomes a personality disorder, because it forsakes certain qualities entirely in favor of a particular approach to life that aligns with a key value.
Literature adds to reality, it does not simply describe it. It enriches the necessary competencies that daily life requires and provides; and in this respect, it irrigates the deserts that our lives have already become. CS Lewis. |
Every four years I take a break from being an anti-football supporter to scream at the big screen with the rest of the world.
This year has been particularly special: I watch it as a resident of the host continent AFRICA.
Uganda didn’t qualify for a place in the World Cup. No matter, for if passion were all that were required they’d have been among the first through. Everyone’s been talking football, and I can confidently say there are more avid British Premier League supporters here than in the whole of the UK. On match nights, crowds of men line up 10-deep in the street outside bars and restaurants, peering at the small TV sets.
And so last Friday the huge expectant crowd of Ugandans, expats, volunteers, NGO workers and visitors from across Africa crowded into the bar and onto the pavement of Kisementi, Kampala. The early birds – still in shock at the earlier thrashing of Brazil by the Netherlands? – had the best seats, or at least they had seats. Inside, necks were craned up at the screen in expectation, ladies perched on upended beer crates. The Vuvuzela Virgins passed the instrument around nervously, daring each other to purse their lips around it, as if they were caught smoking in public. (We don’t worry about a little thing like smoking in public in Uganda anyway, it’s just another one of many well-meaning but ignored laws).
The bar will remain nameless thanks to their World Cup pricing policy (you’re supposed to see double, not pay double). I was slighted by the “manager’s substitution” too: replacing Triple Distilled Uganda waragi (gin) with the local village yellow jerry can variety. (I didn’t wake up blind like some people have, so at least I can see my lucky stars to thank them).
You could hardly contain the Kampala crowd’s excitement as the Ghana players walked onto the pitch. There was no doubt that everyone believed the Black Stars would get through to become the first African team to make it to the World Cup’s last four.
Oh Ghana, you were our last hope.
An American woman screamed full-blast in my ear and I knew the game had kicked off.
The atmosphere was palpable: hoots, cheers and screams accompanied the incredible build up to half time. After a bit of practice, the Vuvuzela Virgins were getting into their stride. Barely discernible above the baying of the crowd, the TV commentator screamed “ … and, with just 20 seconds to half time, if Ghana want to get through …..”
GOAL!!!
The whole bar went into total meltdown. The man behind me leaped onto my shoulders, I couldn’t see the screen for people jumping wildly up and down, arms and beer bottles waving in front of me; you’d have thought we’d won the match there and then!
The atmosphere soon changed in the second half after Uruguay equalised.
The Congolese guy in front of me shifted his body weight from one foot to another, back and forth nervously, willing Ghana to pull ahead.
So many chances, so many lost opportunties. The man moved in such an exaggerated fashion that I had to mirror his movements just to see the screen. His movements were giving me ‘mal de mer’ (seasickness) so I pushed my way in front of him.
With disbelief, and our hearts in our mouths, we watched on as Uruguay’s Luis Suarez snatched the ball out of the mouth of the goal in the last seconds of extra time. Everyone agreed it was clearly a goal.
It was all over for Ghana when Asamoah Gyan’s penalty hit the crossbar. Who’d want to be in his shoes? We all wanted to cry for him.
According to the BBC: ”It was a truly remarkable final few minutes, surely some of the most dramatic in World Cup history, and came at the end of an engrossing and occasionally bad-tempered contest.”
PHOTO: Kids at the Royal Academy School all want to play with their new football, given by VSO friends Alan and Alison.
On my trip to South Africa in November 2009, preparations for Africa’sWorld Cup were well underway: World Cup advertising hoardings everywhere, free World Cup merchandise at the new airport in Cape Town, the new stadia, newly planted flowerbeds, you couldn’t ignore it:
Diary of a Muzungu follows my Ugandan adventures. I fell in love with Uganda the moment I set foot here. Despite the challenges of life in a developing country, there's nowhere else I’d rather be.
Experience Uganda with me: cultural (mis)interpretations, expat travel advice, travel and tourism, wildlife and birds, Safari field trips, conservation, East African culture, volunteering and the occasional cross-border bus journey.
2 Responses to Go Ghana! Go Ghana! Gone …
[…] MTN, the main mobile phone provider, also sponsor of the 2010 World Cup to be held in South Africa. The World Cup is going to be HUGE for Africa. Ugandans are crazy about football, Premier League in particular, and people line the streets outside […] |
Guinness West Indies Porter Guinness Dublin, Ireland One of two recently launched porters from the Guinness Brewers Project in Dublin, West Indies Porter is based on an 1801 diary entry for the first Guinness purposely brewed to maintain its freshness on long seas voyages to the Caribbean and beyond. ABV: 6 ABW: 4.8 COLOR: 53... View Article |
Q:
What is the best way to approach pagination with Promises?
My friend and I are working with promises, and we are making sure that we are getting all pages of data before returning back to our initial call. Is there a more trivial way to approach this?
function getDocuments(startIndex, result, entries) {
startIndex = typeof startIndex !== 'undefined' ? startIndex : 0;
result = typeof result !== 'undefined' ? result : {};
entries = typeof entries !== 'undefined' ? entries : [];
// build our entries set with the result parameter
for(var i in result.items) {
try
{
var id = result.items[i].id;
var name = result.items[i].name;
var content = result.items[i].content;
var entry = { "id": id, "name": name, "content": content };
entries.push(entry);
}
catch(e) {
}
}
// return a promise that fulfills a promise that then returns either a promise or a result.
return new Promise(function(fulfill, reject) {
// fulfill the promise and resolve the value, we pass a recursive promise as the value.
fulfill(documentClient.getDocuments({ "startIndex": startIndex }).then(function(result) { // once our request is made, let's check the page count.
var startIndex = result.startIndex;
var pageSize = result.pageSize;
var totalCount = result.totalCount;
if (startIndex + pageSize <= totalCount) { // if our current position is not at the end of the pages, return a promise with our current data and our current entries.
return getDocuments(startIndex + pageSize, result, entries);
}
return entries; // otherwise our entries will bubble back up the stack and be resolved into the initial fulfill value.
}));
});
}
getDocuments().then(function(d) { console.log(d.length); });
My adjustments:
function getDocuments(startIndex, result, entries) {
startIndex = typeof startIndex !== 'undefined' ? startIndex : 0;
result = typeof result !== 'undefined' ? result : {};
entries = typeof entries !== 'undefined' ? entries : [];
// build our entries set with the result parameter
// ...
// return a promise that fulfills a promise that then returns either a promise or a result.
return documentClient.getDocuments({ "startIndex": startIndex }).then(function(result) { // once our request is made, let's check the page count.
var startIndex = result.startIndex;
var pageSize = result.pageSize;
var totalCount = result.totalCount;
if (startIndex + pageSize <= totalCount) { // if our current position is not at the end of the pages, return a promise with our current data and our current entries.
return getDocuments(startIndex + pageSize, result, entries);
}
return entries; // otherwise our entries will bubble back up the stack and be resolved into the initial fulfill value.
});
}
getDocuments().then(function(d) { console.log(d.length); });
A:
Yes, you can chain the promises like this as documentClient.getDocuments returns a promise.
function getDocuments(startIndex, result, entries) {
// ...
return documentClient.getDocuments({ "startIndex": startIndex }).then(function(result) {
// ...
return entries; // otherwise our entries will bubble back up the stack and be resolved into the initial fulfill value.
});
}
getDocuments().then(function(d) { console.log(d.length); });
|
Q:
Ajax-Solr Installation
I am not able to set Ajax-Solr on my system.I did a bit of R&D on Ajax-Solr for the same .
I understood what it tries to do with the tutorial provided at https://github.com/evolvingweb/ajax-solr/ , but unfortunately, I am not able to able to set it up on my system.
I dont know how to integrate it with Solr. Into which directory of Solr instance does Ajax-Solr goes?(I know it doesn't matter where Ajax-Solr folder is kept but still just to to be sure)
I changed my solrURL to "http://localhost:8080/solr/" in reuters.js file.But still when i browse to "http://localhost:8080/solr/", it still shows the same backend Solr UI. (This may sound a kinda noobish)
Can you please suggest me how to get the Ajax-Solr front end UI ??
Please suggest something.
Thanks
Regards
A:
You have to deploy the Ajax-solr web application either on jetty or on some web server or app server.
If you want to deploy this in jetty, you have to create a WAR file out of th. S reuters sample.
If you have Apache on your machine, you can copy this to the htdocs folder, for eg.
|
Q:
Generate a list of resolutions for a new window
My program is a wrapper for Remote Desktop Connection which generates a ".rdp" file and launches the file through the normal program. I am trying to mimic Remote Desktop Connection's resolution slider so I can enter in to the file the desired size of the new window, here is a screen shot of the program:
What would be the best way of generating the stopping points for my version of the slider? Currently I see two options:
Build a large list of common resolutions and filter out ones that can not be used because the monitor does not support it (I think this is what Remote Desktop Connection is doing)
Take the difference between the minimum and maximum resolution then divide by a fixed number of ticks I want to display.
If I go with option 1 I am concerned about putting too many items in the list. I would likely use the list from the List of common resolutions page from Wikipedia but I don't know which ones I should include and which ones I should not.
Here is my preliminary list of resolutions that I plan on using for option 1
1024 x 768
1366 x 768
1280 x 960
1440 x 900
1280 x 1024
1600 x 900
1400 x 1050
1440 x 1080
1600 x 1200
1920 x 1080
1920 x 1200
2048 x 1152
2560 x 2048
3200 x 2048
A:
As you have done create a list of resolutions that your application will support. There is no point in supporting a resolution that is too small to make your application workable.
Next, get your clients screen resolution. No point in giving them an option that goes beyond their screen. This can get tricky for multi monitor deployments.
Last, create your rdp connection file, with the screen options from the first step, up to the maximum resolution supported by your client.
If this is a support tool, might want to look into a VNC alternative.
|
Q:
How to create multiple model instances without duplicated writable nested serializer in Django REST Framework?
I have two related models: Product and ProductDescription. In 1 submit action user able to insert a new Product with multiple descriptions depend on the available languages. I use writable nested serializer to insert into Product and ProductDescription simultaneously. I do it by overriding create function in ProductDescriptionSerializer class, it works. However, I can only insert 1 ProductDescription at a time.
Then I tried to use this answer to create multiple model instances at once. The problem is it also creates the same Product twice instead of using the newly created Product Id to insert the next ProductDescription.
My models.py:
class Product(models.Model, ProductStatus):
product_code = models.CharField(max_length=6)
color = models.ForeignKey(ColorParent, on_delete=models.SET_NULL, null=True)
collection = models.ForeignKey(ProductCollection, on_delete=models.SET_NULL, null=True)
video = models.URLField(verbose_name='Video URL', max_length=250, null=True, blank=True)
status = models.CharField(max_length=20, choices=ProductStatus.status, default=ProductStatus.active)
class ProductDescription(models.Model):
product = models.ForeignKey(Product, on_delete=models.CASCADE)
language = models.ForeignKey(Language, on_delete=models.CASCADE)
description = models.TextField(max_length=500, null=True, blank=True)
def __str__(self):
return '%s - %s' % (self.product, self.language)
My serializers.py:
class CustomRelatedField(serializers.RelatedField):
def display_value(self, instance):
return instance
def to_representation(self, value):
return str(value)
def to_internal_value(self, data):
model = self.queryset.model
return model.objects.get(id=data)
class ProductSerializer(serializers.ModelSerializer):
collection = CustomRelatedField(queryset=ProductCollection.objects.all(), many=False)
color = CustomRelatedField(queryset=ColorParent.objects.all(), many=False)
class Meta:
model = Product
fields = ['id', 'product_code', 'collection', 'color', 'video', 'status']
class ProductDescriptionSerializer(serializers.ModelSerializer):
product = ProductSerializer()
language = CustomRelatedField(many=False, queryset=Language.objects.all())
class Meta:
model = ProductDescription
fields = ['id', 'product', 'language', 'description']
def to_representation(self, instance):
data = super().to_representation(instance)
if self.context['request'].method == 'GET':
data['product'] = instance.product.product_code
return data
return Serializer.to_representation(self, instance)
# The `.create()` method does not support writable nested fields by default.
def create(self, validated_data):
# create product data for Product model.
product_data = validated_data.pop('product')
product = Product.objects.create(**product_data)
# create ProductDescription and set product FK.
product_description = ProductDescription.objects.create(product=product, **validated_data)
# return ProductDescription instance.
return product_description
My views.py:
class CreateListModelMixin(object):
def get_serializer(self, *args, **kwargs):
if isinstance(kwargs.get('data', {}), list):
kwargs['many'] = True
return super(CreateListModelMixin, self).get_serializer(*args, **kwargs)
class ProductDescriptionView(CreateListModelMixin, viewsets.ModelViewSet):
permission_classes = [permissions.DjangoModelPermissions]
queryset = ProductDescription.objects.all()
serializer_class = ProductDescriptionSerializer
http_method_names = ['get', 'head', 'post', 'put', 'patch', 'delete']
The JSON format I use to POST data:
[
{
"product": {
"product_code": "BQ1080",
"collection": 5,
"color": 7,
"video": "https://www.youtube.com/watch?v=",
"status": "Continue"
},
"language": 1,
"description": "English description."
},
{
"product": {
"product_code": "BQ1080",
"collection": 5,
"color": 7,
"video": "https://www.youtube.com/watch?v=",
"status": "Continue"
},
"language": 2,
"description": "Vietnamese description."
}
]
It creates a duplicate Product in Product List:
[
{
"id": 26,
"product_code": "BQ1080",
"collection": 5,
"color": 7,
"video": "https://www.youtube.com/watch?v=",
"status": "Continue"
},
{
"id": 27,
"product_code": "BQ1080",
"collection": 5,
"color": 7,
"video": "https://www.youtube.com/watch?v=",
"status": "Continue"
}
]
The ProductDescription datas are correct though:
[
{
"id": 5,
"product": "BQ1080",
"language": "English",
"description": "English description."
},
{
"id": 6,
"product": "BQ1080",
"language": "Vietnam",
"description": "Vietnamese description."
}
]
A:
To avoid duplicate product you can use get_or_create() method:
class ProductDescriptionSerializer(serializers.ModelSerializer):
...
def create(self, validated_data):
# create product data for Product model.
product_data = validated_data.pop('product')
product_code = product_data.pop("product_code")
product, _ = Product.objects.get_or_create(product_code=product_code, defaults=product_data)
# create ProductDescription and set product FK.
product_description = ProductDescription.objects.create(product=product, **validated_data)
# return ProductDescription instance.
return product_description
Note that get_or_create is prone to race condition. So if two same requests came to you service at the same time you may still have duplicate products.
|
Abstract
BACKGROUND: Recreational use of 3,4 methylenedioxymethamphetamine (ecstasy, MDMA) is increasing worldwide. Its use by pregnant women causes concern due to potentially harmful effects on the developing fetus. MDMA, an indirect monoaminergic agonist and reuptake inhibitor, affects the serotonin and dopamine systems. Preclinical studies of fetal exposure demonstrate effects on learning, motor behavior, and memory. In the first human studies, we found prenatal MDMA exposure related to poorer motor development in the first year of life. In the present study we assessed the effects of prenatal exposure to MDMA on the trajectory of child development through 2 years of age. We hypothesized that exposure would be associated with poorer mental and motor outcomes. MATERIALS AND METHODS: The DAISY (Drugs and Infancy Study, 2003-2008) employed a prospective longitudinal cohort design to assess recreational drug use during pregnancy and child outcomes in the United Kingdom. Examiners masked to drug exposures followed infants from birth to 4, 12, 18, and 24 months of age. MDMA, cocaine, alcohol, tobacco, cannabis, and other drugs were quantified through a standardized clinical interview. The Bayley Scales (III) of Mental (MDI) and Motor (PDI) Development and the Behavior Rating Scales (BRS) were primary outcome measures. Statistical analyses included a repeated measures mixed model approach controlling for multiple confounders. RESULTS: Participants were pregnant women volunteers, primarily white, of middle class socioeconomic status, average IQ, with some college education, in stable partner relationships. Of 96 women enrolled, children of 93 had at least one follow-up assessment and 81 (87%) had ≥ two assessments. Heavier MDMA exposure (M=1.3±1.4 tablets per week) predicted lower PDI (p<.002), and poorer BRS motor quality from 4 to 24 months of age, but did not affect MDI, orientation, or emotional regulation. Children with heavier exposure were twice as likely to demonstrate poorer motor quality as lighter and non-exposed children (O.R.=2.2, 95%, CI=1.02-4.70, p<.05). DISCUSSION: Infants whose mothers reported heavier MDMA use during pregnancy had motor delays from 4 months to two years of age that were not attributable to other drug or lifestyle factors. Women of child bearing age should be cautioned about the use of MDMA and MDMA-exposed infants should be screened for motor delays and possible intervention. |
Lisa Vox
"Deeply researched and impeccably even-handed in its treatment of scientists and evangelicals, Existential Threats fills a large gap in the historical literature about apocalyptic writings in American culture."—Grant Wacker, author of America's Pastor: Billy Graham and the Shaping of a Nation
"Existential Threats offers lucidly written and knowledgeable discussions of fundamentalism, Pentecostalism, premillennialism, and dispensationalism and brings them to bear on a topic of interest to both religion and science: the end of the world as Americans imagine it."—Ronald L. Numbers, University of Wisconsin-Madison
Americans have long been enthralled by visions of the apocalypse. Will the world end through nuclear war, environmental degradation, and declining biodiversity? Or, perhaps, through the second coming of Christ, rapture of the faithful, and arrival of the Antichrist—a set of beliefs known as dispensationalist premillennialism? These seemingly competing apocalyptic fantasies are not as dissimilar as we might think. In fact, Lisa Vox argues, although these secular and religious visions of the end of the world developed independently, they have converged to create the landscape of our current apocalyptic imagination.
In Existential Threats, Vox assembles a wide range of media—science fiction movies, biblical tractates, rapture fiction—to develop a critical history of the apocalyptic imagination from the late 1800s to the present. Apocalypticism was once solely a religious ideology, Vox contends, which has secularized in response to increasing technological and political threats to American safety. Vox reads texts ranging from Christianity Today articles on ecology and the atomic bomb to Dr. Strangelove, and from Mary Shelley's The Last Man to the Left Behind series by Tim LaHaye and Jerry B. Jenkins, demonstrating along the way that conservative evangelicals have not been as resistant to science as popularly believed and that scientists and science writers have unwittingly reproduced evangelical eschatological themes and scenarios in their own works. Existential Threats argues that American apocalypticism reflects and propagates our ongoing debates over the authority of science, the place of religion, uses of technology, and America's evolving role in global politics. |
In existing wireless technologies, signal repeating devices, or “repeaters” are used to extend the coverage of the overall wireless system. For example, often such wireless or cellular systems consist of a plurality of base stations that communicate with each other in an overlapping fashion, and operate to provide a defined signal coverage area for user equipment (“UE”), such as a cell phone or other wireless device. In such coverage areas, there are often smaller, more remote areas that have very low signal reception, such as areas within buildings or areas that are otherwise obstructed. Rather than implementing another costly and large base station to provide coverage to such low signal areas, signal repeating devices or repeaters are utilized.
A repeater essentially has a donor antenna that is in communication with one or more base stations. The repeater receives downlink signals from the base station, processes and amplifies those signals, and then transmits those signals through a coverage antenna into the remote area that otherwise has low signal reception or low signal power. For example, referring to FIG. 1, a portion of a wireless communications system 10 might include a base station 12 that communicates with a repeater 14 having a donor antenna 16, a coverage antenna 18, and processing electronics 20 that are configured to process and amplify the repeated signal. Accordingly, downlink wireless signals 22 from the base station 12 are received by the donor antenna 16 of the repeater 14. The signals are then amplified and repeated to be transmitted through the coverage antenna 18 as downlink signals 22a. The repeated downlink signals 22a are transmitted into the remote area and are received by the UE that may include one or more wireless communication devices, such as cell phones 24, as show in FIG. 1. Similarly, in an uplink direction, as indicated by reference numerals 26 and 26a, the UE devices 24 communicate signals back to the coverage antenna 18, and the repeated signal 26 is then transmitted as an uplink signal back to the base station 12. As would be readily understood by a person of ordinary skill in the art, such repeater devices 14 can take many different forms.
One particular performance characteristic of a repeater is the gain of the repeater, or the amount of amplification that the repeater provides in the repeated signal. In many applications for a repeater within a wireless system, it is desirable to vary the gain of the repeater based upon certain signal transmission parameters. For example, in a spread spectrum system, such as a CDMA system that utilizes spread spectrum signal traffic, it may be desirable to lower the gain of the repeater based upon the absence of any spread spectrum signal traffic through the repeater. Otherwise, a repeater that continuously operates at a high gain may very likely increase the interference level within the wireless coverage area. Spread spectrum signals appear generally noise-like in structure, and are thus, susceptible to the overall noise figure within the wireless system. The overall network capacity within a spread spectrum communication network is a function of the interference or noise level within that network. As such, it is desirable to automatically adjust the gain, and specifically lower the gain when there is no signal traffic through the repeater. Conversely, when signal traffic is present, it would be desirable to increase the repeater gain.
There is an inherently difficult problem in automatically controlling the gain of a repeater within a spread spectrum system based upon the existence or absence of the spread spectrum signal. In spread spectrum technology, the signals are subject to spreading codes, which are often called “Pseudo Noise” (“PN”) codes. Because of the noise-like structure of the signals, they are difficult to detect at a repeater when the spreading codes are not known. As such, it becomes difficult to automatically adjust the gain of a repeater based upon such signal detection.
Accordingly, there exists a need in the art to provide gain control within a repeater, and particularly to provide gain control in a network utilizing spread spectrum signals. |
This section provides background information related to the present disclosure which is not necessarily prior art.
Hair accessories are commonly worn by girls in their hair. Examples of hair accessories include barrettes, bows, clips, decorative combs, headbands, etc. |
AAMFT Coalitions and Partnerships
Online Store
Update My Account
Contact Us
Pay Your Membership Dues
Membership Information and Benefits
Update my AAMFT Community Profile
Coalitions and Partnerships
The American Association for Marriage and Family Therapy (AAMFT) is a firm believer in the power of collaboration. By partnering with counterpart organizations and consumer groups sharing an interest in effective mental health/whole-health services, we work to further the profession of Marriage and Family Therapy (MFT), while also promoting the interests of those for whom we practice. The AAMFT is proud to provide members with this informational resource that demonstrates our commitment to staying active within the health care community & beyond.
MFT & LPC Medicare Coalition
This coalition is composed of AAMFT, the California Association of Marriage and Family Therapists (CAMFT), the American Counseling Association (ACA), the American Mental Health Counselors Association (AMHCA) and the National Board for Certified Counselors (NBCC). The purpose of this coalition is to obtain a change in federal law to add eligibility of private-practice MFTs and LPCs as Medicare Part B office-based practitioners.
MFT & LPC VA Coalition
This coalition is composed of AAMFT, the California Association of Marriage and Family Therapists (CAMFT), the American Counseling Association (ACA), the American Mental Health Counselors Association (AMHCA) and the National Board for Certified Counselors (NBCC). The purposes of this coalition are to increase the number of MFT and LPC jobs at federal Department of Veterans Affairs (VA) facilities, and to permit MFT and LPC post-graduate interns to become eligible for VA stipends for clinical internships.
SAMHSA Minority Fellowship Program (MFP) Coalition
The federal Substance Abuse and Mental Health Services Administration (SAMHSA) operates a program under which professional-association grantees select Doctoral students in six behavioral-health professions for fellowships based on applicants’ commitment to pursue a clinical or research career serving communities of color. AAMFT is one of the grantees, as are the American Psychiatric Association (ApA), the American Psychological Association (APA), the Council on Social Work Education (CSWE), the American Nurses Association (ANA), and the National Board for Certified Counselors (NBCC). This coalition advocates for maximum funding for this program.
Health Professions and Nursing Education Coalition (HPNEC)
HPNEC is a coalition of healthcare professional groups that advocates for maximum funding under the federal Health Professions Education Act. Funds are available under Title VII of this Act for non-nursing personnel (including MFTs) training involving student fellowships and loans as well as faculty financial support. Title VIII of this Act provides similar funds for nursing personnel.
Friends of Indian Health
The Friends of Indian Health is a coalition of healthcare professional groups that advocates for maximum funding for the federal Indian Health Service (IHS), which provides healthcare on Tribal Reservations as well as to urban Natiive American people. MFTs are eligible for IHS employment.
Coalition for Patient Rights (CPR)
CPRconsists of 37 organizations representing a variety of licensed health care professionals who provide a diverse array of safe, effective, and affordable health care services to millions of patients each year.
AAMFT was selected to participate in a 2009 CPR communications listening session
AAMFT signed onto a CPR letter to President Obama on health care reform
National Coalition on Mental Health & Aging (NCMHA)
A mental health and aging coalition is characterized by the common interest of a diverse group of agencies, organizations and individuals working together to improve and increase mental health and substance abuse services to older adults.
Amer. Red Cross Disaster Mental Health Services
"In the broadest definition, the function of the American Red Cross Disaster Mental Health Worker (DMHW) is to ease the feelings of emotional distress among all the people with whom he/she is in contact. Provides emergency and preventive mental health services to people affected by disaster and to Red Cross workers assigned to a disaster relief operation and their families; services include educations about stressors and their effects, methods of coping; and advocacy, crisis interventions, and referral services to resources to meet mental health related problems."
Fair Access Coalition on Testing (FACT)
- "FACT is an independent organization of professionals dedicated to the protection and support of public access to professionals and organizations who have demonstrated competence in the administration and interpretation of assessment instruments, including psychological tests."
Give an Hour
"Our mission is to develop national networks of volunteers capable of responding to both acute and chronic conditions that arise within our society. Our first target population is the U.S. troops and families who are being affected by the current military conflicts in Afghanistan and Iraq. Give an Hour™ is asking mental health professionals nationwide to literally donate an hour of their time each week to provide free mental health services to military personnel and their families."
Recovery Month
Recovery Month provides a platform to celebrate people in recovery and those who serve them. Each September, thousands of treatment programs around the country celebrate their successes and share them with their neighbors, friends, and colleagues in an effort to educate the public about treatment, how it works, for whom, and why. Substance abuse treatment providers have made significant accomplishments, having transformed the lives of untold thousands of Americans. These successes often go unnoticed by the broader population; therefore, Recovery Month provides a vehicle to celebrate these successes."
National Depression Screening Day
National Depression Screening Day is held during Mental Illness Awareness Week each October. It is designed to call attention to the illness of depression on a national level, educate the public about its symptoms and effective treatments, offer individuals the opportunity to be screened for depression, and connect those in need of treatment to the mental health care system."
AAMFT Consumer Partners/Collaborations:
Witness Justice
National Military Families Association
Alliance for Health Reform
End Insurance Discrimination Now - parity law passed in 2009
White House Nat'l Conference on Aging - last held in 2005
AAMFT Staff Affiliations
American Society of Association Executives (ASAE)
American Bar Association (ABA)
Act on Federal MFT issues--Contact Congress Now!
You can quickly contact your Members of Congress on federal issues by Clicking Here.
Explore TherapistLocator.net, a public service of the AAMFT Research and Education Foundation, and find a marriage and family therapist in your area today. In this directory, you will find information about a range of problems facing today's families, and can search from over 15,000 AAMFT professionals, qualified to treat a variety of situations, from individuals, to couples, to entire families. |
mssymb.tex
=cmti10 scaled 1
\#1 \#1[[20 [\#1]{}]{}]{} \#1
\#1[\_[(\#1)]{}]{} ø[\_[(1)]{}]{}
\#1[[**\#1**]{}]{} \#1
\#1\#2[$$#2\label{#1}$$]{} \#1[$$\begin{array}{c} #1 \end{array}$$]{} \#1\#2[$$\label{#1}
\begin{array}{c}#2\end{array}$$]{} \#1[$$\begin{aligned}
#1\end{aligned}$$]{} \#1\#2[$$\begin{aligned}
\label{#1}#2\end{aligned}$$]{}
23.6cm -.2in
\[section\] \[lemma\][Proposition]{} \[lemma\][Example]{} \[lemma\][Theorem]{} \[lemma\][Corollary]{} \[lemma\][Corollary]{} \[lemma\][Definition]{} \[lemma\][Remark]{} \[lemma\][Conjecture]{}
[ ]{}4.2in DAMTP/93-64
[SOLUTIONS OF THE YANG-BAXTER EQUATIONS FROM BRAIDED-LIE ALGEBRAS AND BRAIDED GROUPS]{}\
\
S. Majid[^1]\
[ ]{}\
Department of Applied Mathematics & Theoretical Physics\
University of Cambridge, Cambridge CB3 9EW, U.K.
December, 1993
> [**ABSTRACT**]{} We obtain an R-matrix or matrix representation of the Artin braid group acting in a canonical way on the vector space of every (super)-Lie algebra or braided-Lie algebra. The same result applies for every (super)-Hopf algebra or braided-Hopf algebra. We recover some known representations such as those associated to racks. We also obtain new representations such as a non-trivial one on the ring $k[x]$ of polynomials in one variable, regarded as a braided-line. Representations of the extended Artin braid group for braids in the complement of $S^1$ are also obtained by the same method.
Introduction
============
In this paper we apply some constructions from the theory of braided groups and braided geometry[@Ma:introm] to obtain a new construction for matrix solutions of the celebrated Quantum Yang-Baxter Equations (QYBE). Equivalently, we provide a new and canonical class of representations of the Artin braid group. The importance of such representations or R-matrices has been very clearly established in the last few years and is one of the primary motivations behind the celebrated quantum groups $U_q(g)$[@Dri][@Jim:dif]. Representations lead ultimately to link invariants and families of representations to 3-manifold invariants.
By contrast to the theory of quantum groups, our construction is based on what we believe to be a more primitive object, called a [*braided Lie algebra*]{}[@Ma:lie]. The famous quantum groups $U_q(g)$ have finite-dimensional braided-Lie algebras associated to them and one can work with them instead of the quantum group. In this case our canonical braiding reproduces the braiding associated to the quantum double[@Dri].
More generally however, our notion of braided Lie algebra also includes as a special case the notion of a rack, see e.g[@FenRou:rac]. In this case we recover the rack braiding. Super-Lie algebras, super-racks and other much more esoteric objects are also included in the theory.
The axioms of a braided-Lie algebra are recalled in the Preliminaries. They are Lie algebra-like objects living in a braided tensor category with braiding $\Psi$. Ordinary Lie algebras and ordinary racks are defined with $\Psi$ given by the usual transposition. Their super-versions are defined with $\Psi=\pm 1$ according to a $\Z_2$-grading. Unlike previous attempts to go beyond supersymmetry, we need not assume that $\Psi^2=\id$.
In Section 3 we give a parallel theorem for Hopf algebras, super-Hopf algebras and more generally, for braided-Hopf algebras[@Ma:bg]. The latter are Hopf algebras living in our braided tensor category with background braiding $\Psi$. This theory is more general because not every braided-Hopf algebra is the enveloping algebra of a braided-Lie algebra, but in the case that it is, we recover the results of Section 2. The example of a finite group and its canonical braiding fits comfortably into either setting. We will also give some more novel examples in Section 4, including one based on the anyonic line where $\Psi$ is given by a root of unity. Many other important algebras of interest in the theory of $q$-deformations are not naturally Hopf algebras but rather braided ones.
Finally, we show in the Appendix how the extended Artin braid relations for braids in the complement of the unknot in $S^3$ can be represented equally well using the same techniques. We assume that we are given a cocommutative representation of a braided-Hopf algebra in the sense that it is central in the braided representation ring of the braided-Hopf algebra[@Ma:tra]. Representations of such extended braid relations have been used by knot theorists in [@LamPrz:hom] and elsewhere. In short, the techniques which we use here are of quite wide applicability and this appendix demonstrates one more instance of them.
Although we will not go as far as constructing knot and three-manifold invariants from our canonical braiding, knot theory nevertheless enters in a fundamental way. This is because we will be working throughout in a background braided category with braiding $\Psi$. Usually one uses quantum groups etc to construct such a braided category and hence to obtain knot-invariants: we proceed in exactly the reverse direction by assuming that $\Psi$ is given and doing all our proofs by drawing braids and tangles. These techniques and the formulation of a large number of geometrical constructions of planes, lines, matrices, groups, differential operators etc., is the topic of braided geometry as developed over 30-40 papers by the author in the last few years. We refer to [@Ma:introp][@Ma:introm] for reviews and to [@Ma:bg][@Ma:tra][@Ma:bos][@Ma:skl][@Ma:lin][@Ma:fre] for some of the basic theory.
Preliminaries {#preliminaries .unnumbered}
-------------
Here we recall very briefly the definition of braided or quasitensor categories and the diagrammatic notation for them. Firstly, a monoidal category consists of a category $\CC$ equipped with a functor $\tens:\CC\times \CC \to \CC$ and functorial isomorphisms $\Phi_{V,W,Z}:V\tens (W\tens Z)\to
(V\tens W)\tens Z$ for all objects $V,W,Z$, and a unit object $\und 1$ with functorial isomorphisms $l_V:V\to \und 1\tens V,r_V:V\to
V\tens \und 1$ for all objects $V$. The $\Phi$ should obey a well-known pentagon coherence identity while the $l$ and $r$ obey triangle identities of compatibility with $\Phi$[@Mac:cat]. We assume such a monoidal category and suppress writing $\Phi,l,r$ explicitly. A monoidal category also has an opposite tensor product $\tens^{\rm op}:\CC\times\CC\to \CC$ defined in the obvious way.
A braided monoidal or quasitensor category $(\CC,\Psi)$ is a monoidal category $\CC$ equipped further with a natural transformation $\Psi:\tens^{\rm op}\to
\tens$ called the [*braiding*]{} or quasisymmetry and subject to two hexagon coherence identities. Explicitly, this means a collection of functorial isomorphisms $\Psi_{V,W}:V\tens W\to W\tens V$ for any two objects and such that One can deduce also that $\Psi_{V,\und 1}=\id=\Psi_{\und 1,V}$ for all $V$. If $\Psi^2=\id$ then one of the hexagons is superfluous and we have an ordinary symmetric monoidal category or tensor category. Braided monoidal categories were formally introduced in [@JoyStr:bra], while being known also to specialists in the representation theory of quantum groups[@Ma:qua Sec. 7].
Crucial for us is the following diagrammatic notation for working with algebraic objects in braided categories. Firstly, we write all morphisms pointing downwards (say) and in the case of the braiding morphism, we use the shorthand This distinguishes between $\Psi$ and $\Psi^{-1}$, while the hexagons (\[psi-hex\]) appear as The doubled lines refer to the composite objects $V\tens W$ and $W\tens Z$ in a convenient extension of the notation. The coherence theorem for braided categories says then that if two series of morphisms built from $\Psi,\Phi$ correspond to the same braid then they compose to the same morphism. The proof is just the same as Mac Lane’s proof in the symmetric case with the action of the symmetric group replaced by that of the Artin braid group.
Finally, we take this notation further by writing any other morphisms as nodes on a string connecting the inputs down to the outputs. Functoriality of the braiding then says that morphisms $\phi:V\to Z$, $W\to Z$, etc. can be pulled through braid crossings, Similarly for $\Psi^{-1}$ with inverse braid crossings. The simplest example is with $\CC={\rm SuperVec}$, the category of $\Z_2$-graded vector spaces and braiding where $|\ |$ denotes the degree of a homogeneous element. Of course, this example is not truly braided since $\Psi^2=\id$.
We recall also the celebrated Yang-Baxter equations or Artin braid relations. Thus, a Yang-Baxter operator is a morphism $\check{R }:V\tens V\to
V\tens V$ such that where the suffices refer to the copy of $V$ in $V\tens V\tens V$. If $V$ is an ordinary vector space and everything is linear then we can write $\check{R
}=PR$ where $P:V\tens V\to V\tens V$ is the permutation operator. Then the corresponding equation for $R$ is which is the so-called [*quantum Yang-Baxter equation*]{} (QYBE). The matrices of such operators are called in physics ‘R-matrices’.
There is a close relation between R-matrices and braided categories for which the objects are built on vector spaces. Obviously, if $\Psi$ is a braiding then $\Psi_{V,V}$ is an invertible Yang-Baxter operator and hence when $V$ is a finite-dimensional vector space we have an associated invertible R-matrix. Conversely, any invertible R-matrix defines a braiding on the monoidal category generated by $V$.
Note that the general theory of Sections 2,3 works in any braided monoidal category. In this case we use the word ‘operator’ etc here a bit loosely. On the other hand, our examples in Section 4 are in a $k$-linear setting where $k$ is a field, and then our operators are indeed linear maps.
Canonical braiding of a braided-Lie algebra
===========================================
We have introduced in [@Ma:lie] the notion of a braided-Lie algebra or Lie-algebra-like object in a braided monoidal category $(\CC,\Psi)$ as $(\CL,\Delta,\eps,[\ ,\ ])$ where $(\CL,\Delta,\eps)$ is a coalgebra in the category and $[\ , \ ]:\CL\tens\CL\to \CL\tens\CL$ is the [*braided Lie bracket*]{} and is required to obey We use here the diagrammatic notation described in the preliminaries. A coalgebra in the category is defined in just the same way as an algebra, but with arrows reversed. Thus, $\Delta:\CL\to \CL\tens \CL$, the comultiplication, is coassociative in an obvious sense and $\eps:\CL\to \und 1$ is a counit for it in the obvious sense. Explicitly,
The condition (L1) is called the [*braided-Jacobi*]{} identity axiom, (L2) the [*braided-cocommutativity*]{} axiom and (L3) the [*coalgebra-compatibility axiom*]{}. We refer to [@Ma:lie] for the justification and full explanation of these axioms. Suffice it to say that in a truly braided category the naive notions of $\Psi$-anticommutativity and $\Psi$-Jacobi identity are not appropriate and one needs a genuinely new idea. The new idea in [@Ma:lie] is to allow ourselves a more general coalgebra $\Delta$ instead of the primitive coalgebra structure $\Delta\xi=\xi\tens 1+1\tens\xi$ on $k\oplus g$ which is implicitly assumed in the theory of Lie algebras.
The basic theory of braided-Lie algebras has also been developed in [@Ma:lie]. This includes such things as (in the Abelian category case) a braided-enveloping bialgebra $U(\CL)$, braided-Killing forms and braided-Casimirs etc. To this theory we want to add now the following theorem announced in [@Ma:mex].
Let $(\CL,\Delta,\eps,[\ ,\ ])$ be a braided-Lie algebra. Then $$\check{\bf R }=\ {{}\atop \epsfbox{Liebraid.eps}}=([\ ,\
]\tens\id)\circ(\id\tens\Psi)\circ(\Delta\tens\id):\CL\tens\CL\to \CL\tens
\CL$$ is a Yang-Baxter operator.
$$\epsfbox{Liebraproof.eps}$$
We do this diagrammatically in Figure 1, using the notation explained in the preliminaries. The vertices are $\Delta=\epsfbox{deltafrag.eps}$ and $[\ ,\
]=\epsfbox{prodfrag.eps}$ throughout. The first expression is the right-hand side of (\[YBop\]) for $\check{\bf R
}$ as stated. The first equality is (L3). The second equality is coassociativity (\[Liecoalg\]) and functoriality to put the diagram in a form suitable for (L2), which is the third equality. The fourth equality is coassociativity (\[Liecoalg\]) again. The fifth then uses our braided-Jacobi identity axiom (L1). The sixth is coassociativity once more and finally we use functoriality to slide the diagram into the final form, which is the left hand side of (\[YBop\]) for $\check{\bf R }$.
Moreover, it is evident from its diagrammatic definition in [@Ma:lie] that the braided enveloping algebra $U(\CL)$ is generated by $1$ and $\CL$ with the relations of braided commutativity.
Canonical braiding of a braided-Hopf algebra
============================================
In this section, we further generalise the result of the last section to associate to any braided-Hopf algebra at all a canonical Yang-Baxter operator. Braided-Hopf algebras were introduced by the author in [@Ma:bg][@Ma:exa][@Ma:eul][@Ma:bra] as a generalisation to braided categories of the usual notion of Hopf algebra or super-Hopf algebra. Briefly, a braided-Hopf algebra means $(B,\Delta,\eps,S)$ where firstly $B$ is a unital algebra in a braided monoidal category. This means it comes equipped with product and unit morphisms $B\tens
B\to B$ and $\und1\to B$ respectively, obeying the obvious axioms of associativity and unity. Secondly, $\Delta:B\to B\und\tens B$ and $\eps:B\to\und 1$ form a coalgebra as already encountered in Section 2. We require further that $\Delta$ is an algebra homomorphism where $B\und\tens B$ is the braided tensor product algebra (as also introduced by the author). This forms a braided-bialgebra or bialgebra in a braided category. Finally, we require an antipode $S:B\to B$ obeying axioms similar to those for quantum groups or Hopf algebras, but as a morphism in our category. In the diagrammatic notation with $\Delta=\epsfbox{deltafrag.eps}$ and $\cdot=\epsfbox{prodfrag.eps}$, our axioms read
The general theory of braided-Hopf algebras has also been developed by now in a diagrammatic form[@Ma:tra][@Ma:bos][@Ma:introp]. One has left and right dual Hopf algebras (when $B$ has a dual object), regular actions and coactions, braided-adjoint actions and coactions, cross products etc. We use the braided-adjoint action now.
Let $(B,\Delta,\eps,S)$ be a braided-Hopf algebra and $\Ad$ the braided-adjoint action. Then $$\check{\bf R }=\ {{}\atop
\epsfbox{hopfbraid.eps}}
=(\Ad\tens\id)\circ(\id\tens\Psi)\circ(\Delta\tens\id):B\tens B\to B\tens B$$ is a Yang-Baxter operator.
$$\epsfbox{hbraproof.eps}$$
This is given in diagrammatic form in Figure 2. Some of the $\epsfbox{prodfrag.eps}$ vertices are the braided-adjoint action $\Ad$[@Ma:exa][@Ma:lie] and the rest are the product in $B$. The $\epsfbox{deltafrag.eps}$ are the coproduct throughout. The first expression is the right hand side of (\[YBop\]) for $\check{\bf R }$ as stated. The first equality uses that $\Ad$ is indeed an action of $B$ on $B$. The second equality substitutes the form of $\Ad$ in terms of the braided-Hopf algebra structure, as shown in the definition of $\check{\bf R }$. The third equality uses the bialgebra axiom that $\Delta$ is an algebra homomorphism to the braided tensor product as on the left in (\[hopfax\]). We also adopt the convention that repeated applications of $\Delta$ can be represented by multiple branches. Likewise for multiple products. This convention expresses coassociativity and associativity respectively. The fourth equality is the lemma proven in [@Ma:tra] that $S$ is a braided-anti-algebra homomorphism in the sense $S\circ\cdot=\cdot\circ\Psi\circ(S\tens S)$. The fifth equality recognises a loop involving the antipode and cancels it according to the left-hand antipode axiom shown in (\[hopfax\]). We also recognise the remaining antipode $S$ as part of an application of $\Ad$. The sixth equality is coassociativity and functoriality to push this $\Ad$ down to the bottom of the expression. Finally, we use again that $\Ad$ is an action to obtain the left hand side of (\[YBop\]) for $\check{\bf R }$.
Moreover, it is obvious from coassociativity, associativity and the axioms for the antipode that $B$ itself is braided-commutative in the sense $$\epsfbox{hbracom.eps}$$
Let us note also that the axioms of a braided-Hopf algebra in (\[hopfax\]) are symmetric under the operations of left-right reflection and braid crossing reversal, up-down reflection and braid crossing reversal, and rotation by 180 degrees. As explained in [@Ma:introm], it means that the diagrammatic method always gives three theorems for the price of one. Applying these symmetries to Figure 2 and its associated lemmas gives $$\check{\bf R }=\ {{}\atop \epsfbox{hbravar3.eps}}\qqquad \check{\bf R }=\
{{}\atop \epsfbox{hbravar1.eps}}\qqquad \check{\bf R }=\ {{}\atop
\epsfbox{hbravar2.eps}}$$ as three other Yang-Baxter operators. $B$ is also braided-commutative with respect to the first and braided-cocommutative with respect to the second and third.
Examples
========
In this section we describe various examples and special cases of the general constructions above. Throughout this section we work over a field $k$ of characteristic zero. The same results apply more generally with appropriate care. As far as I know, only the case in subsection 4.4 was known before from the theory of racks and its generalisation in subsection 4.5 from Drinfeld’s quantum double construction for Hopf algebras and later from [@Wor:sol]. The rest appear to be a product of our construction, as announced recently in the conference proceedings[@Ma:mex].
Ordinary Lie Algebras
---------------------
Note that an ordinary Lie algebra obeys these axioms if one puts $[1,\xi]=\xi$, $[\xi,1]=0$, $[1,1]=1$ and So this structure $\Delta,\eps$ is implicit for an ordinary Lie algebra but we never think about it because it has this standard form. This was our motivation in [@Ma:lie].
Let $V=k\oplus g$ and define the linear map Then ${\check{\bf R }} $ is a braiding [*iff*]{} $[\ ,\ ]:g\tens g\to g$ obeys the Jacobi identity. It has minimal polynomial $[\ ,\ ]$ is non-zero and antisymmetric.
The forward direction is a special case of Theorem 2.1 where we view $\CL=k\oplus g$ as a braided-Lie algebra with trivial braiding $\Psi$ as explained above. On the other hand, at least in this setting, one can compute it explicitly and see that it is reversible. Thus so that the only condition is the Jacobi identity in the form that $[\xi,\ ]$ acts like a Lie derivation. The braid relations involving the basis element $1$ are all empty. Secondly, we compute $$(\check{\bf R }^2-\id)\circ (\check{\bf R
}+\id)(\xi\tens\eta)=([\xi,\eta]+[\eta,\xi])\tens 1+1\tens
([\xi,\eta]+[\eta,\xi])$$ so this vanishes [*iff*]{} the bracket is antisymmetric. Finally, we compute which are all non-zero for some $\xi,\eta$ if $[\ ,\ ]$ is non-zero. Hence in this case (\[minpoly\]) is the minimum polynomial. Conversely, if this is the minimum-polynomial then in each case there exist $\xi,\eta$ such that the expression is non-zero. In particular, $(\check{\bf R }^2-\id)\ne 0$ implies that $[\xi,\eta ]\ne 0$ for some $\xi,\eta$. .
This says that the definition of a Lie algebra is mathematically completely equivalent to looking for a braiding of a certain form. We say accordingly that a Yang-Baxter operator obeying (\[minpoly\]) is of [*Lie type*]{}.
We next discuss the braided-enveloping algebra. To avoid confusion here we denote the basis element of $k$ in $k\oplus g$ by $\lambda$ rather than $1$ as above. So our starting point is that that $\Psi$ trivial (usual transposition) and extends a usual Lie algebra $g$ to a braided Lie algebra $\CL=k\oplus g$. The braided enveloping algebra in this case is $U(\CL)=\widetilde{U(g)}$, a homogenised form of the enveloping algebra $U(g)$. It is an ordinary bialgebra since the braiding $\Psi$ is trivial. On the other hand we know from the definition of $U(\CL)$ that it is braided-commutative in the sense (\[bracom\]) relative to $\check{\bf R }$. Moreover, everything descends to the quotient $\lambda=1$ so we recover the usual enveloping algebra too as braided-commutative in this sense, a fact which is in any case evident from the form of $\Psi$.
Note also that if we allow $\lambda^{-1}$ then this form of $\widetilde{U(g)}$ has $\xi\lambda^{-1}$ primitive and $\lambda$ group-like, and forms a Hopf algebra. It is only for this part of its structure that antisymmetry of the Lie bracket of $g$ is needed. For a general braided-Lie algebra I do not know any very natural notion of antisymmetry for the bracket.
Finally, we give the concrete matrix version in which we choose a basis $g=\{x_i\}$ for $i=1,2,\cdots ,n-1$ and $k=\{x_0\}$ for $V=k\oplus g$. Then where $I$ are identity matrices and $c^i{}_{jk}$ are the structure constants of the bracket $[\ ,\ ]$ on $g$. The basis for $V\tens V$ used here is $\{x_0\tens
x_0,x_0\tens
x_j,x_i\tens x_0,x_i\tens x_j\}$. Explicitly, $${\bf R}^0{}_i{}^k{}_j=c^k{}_{ij},\ {\bf
R}^i{}_j{}^k{}_l=\delta^i{}_j\delta^k{}_l,\ {\bf
R}^0{}_0{}^i{}_j=\delta^i{}_j={\bf R}^i{}_j{}^0{}_0,\ {\bf R}^0{}_0{}^0{}_0=1$$ and zero for the rest. This obeys the QYBE and has minimal polynomial of Lie type [*iff*]{} $c$ defines a non-zero Lie algebra. The quantum R-plane or Zamolodchikov algebra $$x_ix_j=x_bx_a{\bf R}^a{}_i{}^b{}_j$$ for this R-matrix recovers the homogenised enveloping algebra above in our basis. The indices here range $0,\cdots,n-1$ and summation of the repeated indices is understood.
Finally, we note that homogenised Lie algebras have recently been studied in [@LeBSmi:hom][@LeBBer:spa] as examples of a kind of non-commutative geometry based on ‘projective line modules’. It would be interesting to try connect this with the braided-geometrical picture developed above.
Super-Lie Algebras
------------------
A super-Lie algebra is a $\Z_2$-graded or ‘super’ vector space $g$ with a degree-preserving map $[\ ,\ ]:g\tens g\to g$ obeying the axiom of graded-antisymmetry and the graded-Jacobi identity: $$[\xi,\eta]=(-1)^{|\xi||\eta|+1}[\xi,\eta],\quad
[[\xi,\eta],\zeta]+[\eta,[\xi,\zeta]](-1)^{|\xi||\eta|}=[\xi,[\eta,\zeta]]$$ on homogeneous elements $\xi,\eta,\zeta\in g$. One can view any super-Lie algebra as a braided-Lie algebra $\CL=k\oplus g$ in the category of super vector spaces with braiding given by super-transposition (\[supertran\]) and the remaining structure as in subsection 4.1 in (\[ordLie\]). The $k$ part of $\CL$ is given degree zero.
Let $g$ be a $\Z_2$-graded vector space and $V=k\oplus g$ with $k$ given degree zero, and $[\ ,\ ]:g\tens g\to g$ a degree-preserving linear map. Then obeys the braid relations [*iff*]{} $[\ ,\ ]:g\tens g\to g$ obeys the graded-Jacobi identity. Moreover, it has minimal polynomial (\[minpoly\]) [*iff*]{} $[\ ,\
]$ is graded-antisymmetric and non-zero.
That $\check{\bf R }$ obeys the braid relations follows from Theorem 2.1 in the category of $\Z_2$-graded vector spaces where $V$ is viewed as a braided-Lie algebra in this category as explained. Conversely, an explicit computation along the same lines as the proof of Proposition 4.1 gives that the braid relations force $[\ ,\ ]$ to obey the graded Jacobi identity. Similarly for the minimal polynomial by explicit computation.
The braided-enveloping algebra $U(\CL)$ in this case is a homogenised super-bialgebra version of the enveloping super-Hopf algebra $U(g)$. It is the Zamolodchikov or quantum plane algebra for the matrix ${\bf R}$ corresponding to $\check{\bf R }$ in this case.
This generalisation of the preceding subsection is immediate because the category is not truly braided, i.e. one has $\Psi^2=\id$ and hence all the properties familiar in the category of vector spaces. The same applies if we work in any symmetric monoidal category of vector spaces with $\Psi^2=\id$ and the same form of coproduct $\Delta$ and $[\ ,\ ]$ on an object $\CL=k\tens g$. The analogue of Proposition 4.2 recovers the obvious axioms of a $\Psi$-Lie algebra as studied, for example, in [@Gur:yan]. We still find (\[minpoly\]) for $\check{\bf R}$ even for this more general case.
Matrix braided-Lie algebras
---------------------------
The data we need is a matrix solution $R\in M_n\tens M_n$ of the QYBE which is bi-invertible. The ‘second inverse’ $\widetilde R$ which we suppose here is characterised by $$\widetilde{R}^i{}_a{}^b{}_l
R^a{}_j{}^k{}_b=\delta^i{}_j\delta^k{}_l
=R^i{}_a{}^b{}_l\widetilde{R}^a{}_j{}^k{}_b.$$ We assume summation of repeated indices throughout this section. These $R,\widetilde{R}$ generate a braided monoidal category $\CC$ and this has an associated braided group $\Aut(\CC)$[@Ma:bra][@Ma:bg] which has in turn, a braided-Lie algebra $\CL$. Explicitly[@Ma:skl][@Ma:lie], where we write $I=(i_0,i_1)$ etc as multi-indices. We changed conventions here from [@Ma:lie] to lower indices for the $\{u_I\}$. There is also a nice compact notation used in physics where subscripts refer to the positions in a matrix tensor product (as in the QYBE above). In this notation,
Let $R\in M_n\tens M_n$ be a bi-invertible solution of the QYBE and $\CL(R)$ its associated matrix braided-Lie algebra. Then the associated canonical braiding from Theorem 2.1 is $${\check{\bf R }} (u_J\tens u_L)= u_K\tens u_I {\bf R}^I{}_J{}^K{}_L;\quad
{\bf R}^I{}_J{}^K{}_L=R^{-1}{}^{d}{}_{k_0}{}^{j_0}{}_{a}
R^{k_1}{}_{b}{}^{a}{}_{i_0}R^{i_1}{}_c{}^b{}_{l_1} {\widetilde
R}^c{}_{j_1}{}^{l_0}{}_d$$ and ${\bf R}\in M_{n^2}\tens M_{n^2}$ necessarily obeys the QYBE.
We compute the canonical braiding for the matrix braided-Lie algebra above. In fact, the necessary computation was done already in the proof of [@Ma:lie Prop. 5.2] in the course of computing the relations of $U(\CL)$. We need only the matrix form of $\Delta$ and the formulae for $\Psi=\epsfbox{braid.eps},[\ ,\ ]=\epsfbox{prodfrag.eps}$ in (\[L(R)-coalg\])–(\[L(R)\]). Hence from Theorem 2.1 we conclude that $\check{\bf R }$ obeys the QYBE too.
The braided enveloping algebra $U(\CL)$ for this class was computed and identified in [@Ma:lie Prop. 5.2] as the braided-bialgebra of $B(R)$ of ‘braided matrices’ as introduced in [@Ma:exa]. This is the associative algebra generated by $1$ and $\vecu=\{u^i{}_j\}$ with the braided-commutativity relations (\[bracom\]) which are now where the second puts two of the $R$’s to the left and uses the matrix notation. The coproduct $\Delta \vecu=\vecu\tens \vecu$ extends as an algebra homomorphism $B(R)\to B(R)\und\tens B(R)$ to the braided tensor product algebra determined by $\Psi$, i.e. according to the axiom on the left in (\[hopfax\]). Note that the motivation in [@Ma:exa] for $B(R)$ was as a braided-version of quantum or super matrices, with braid statistics $\Psi$, i.e. the generators are to be regarded as, by definition, the braided-commutative ring of co-ordinate functions on a braided space. Hence it is remarkable that this $B(R)$ is also the enveloping algebra of a braided-Lie algebra. We obtain in the corollary a new and conceptual proof that the matrix $\bf R$ that describes its relations indeed obeys the QYBE.
This class of examples generalises those of Section 4.1 for ordinary Lie algebras and Section 4.2 for super-Lie algebras, as well as including the case of Lie algebras defined in an obvious way relative to any background braiding where $\Psi^2=\id$. The way to obtain these from the notion of braided-Lie algebras is explained in [@Ma:lie]. One uses $\bar\chi={\vecu-\id\over
\hbar}$ along with $1$ as generators of $U(\CL)$ in place of $1$ and $\vecu$, where $R$ is parametrised in such a way that $R_{21}R=O(\hbar)$. The standard R-matrices associated to semisimple Lie algebras $g$ in [@FRT:lie] then give deformations as braided-bialgebras of their homogenised enveloping algebras $\widetilde U(g)$ from this point if view.
Unfortunately, the simplest non-trivial example of a matrix braided-Lie algebra has to be four-dimensional. We mention the standard one from [@Ma:lie], namely the braided-Lie algebra $\CL=gl_{2,q}$ with basis $$gl_{2,q}=\{\pmatrix{a& b\cr c& d}\},\quad t=q^{-1}a+qd,\quad x={b+c\over
2},\quad y={b-c\over 2i},\quad z=d-a$$ if we work over $\C$. The braided-Lie bracket is obtained from (\[L(R)\]) with the standard $sl_2$ R-matrix, and given explicitly in [@Ma:lie Example 5.5]. The braided-enveloping algebra here in terms of the $\chi$ variables is a deformation of $U(gl_2)$ or from another point of view, of $\widetilde{U(sl_2)}$.
The canonical braiding $\check{\bf R }$ from Theorem 2.1 for this example is the braided-commutativity relations for the algebra of $2\times 2$ braided matrices[@Ma:exa] and with the braided-determinant $${\rm BDET}\pmatrix{a& b\cr c& d}={q^2\over(q^2+1)^2}t^2-q^2x^2-q^2 y^2-
{(q^4+1)q^2\over 2(q^2+1)^2}z^2+\left({q^2-1\over q^2+1}\right)^2{q\over 2}
tz$$ it can be viewed as a braided $q$-deformation of the algebra of functions on Minkowski space with its Lorentzian metric[@Ma:mec][@Mey:new]. These $t,x,y,z$ are the non-commutative spacetime co-ordinates. The algebra here also agrees with the proposal for $q$-Minkowski space based on spinors in the approach [@CWSSW:lor][@OSWZ:def]. We note that the FRT bialgebra $A({\bf R})$ associated to this canonical braiding has a Hopf algebra quotient $SO_q(1,3)$, the $q$-Lorentz group in the interpretation above. On the other hand, this is also closely related to the dual of the quantum double of $U_q(su_2)$. These points are described in detail elsewhere.
The braided-enveloping algebra here of $2\times 2$ braided matrices is also isomorphic to a degenerate form of the 4-dimensional Sklyanin algebra as shown in [@Ma:skl], so the latter has the R-matrix form (\[B(R)\]). More recently, some remarkable homological properties of braided-matrix algebras have been found in [@LeB:hom].
Finite Groups and Racks
-----------------------
A [*rack*]{} is a set $X$ and a map $X\times X\to X$ denoted $x\times y\mapsto
{}^xy$ obeying the ‘rack-identity’ $${}^{({}^{\scriptstyle x}y)}({}^x z)={}^x({}^yz),\qquad \forall x,y,z\in X.$$ One usually adds to this that the map ${}^x(\ )$ is bijective for each $x$, but we do insist on this here. One may also have conventions in which the notation is $y^x$ rather than ${}^x y$. Such objects have a long history and some applications in algebraic topology[@FenRou:rac]. It is easy to see that every rack provides an example of a braided-Lie algebra if we take as our category $\CC$ as the category of sets, with tensor product provided by the direct product of sets, and with the usual permutation map as $\Psi$. This is a symmetric monoidal category rather than a truly braided one. We just take $$[x,y]={}^xy,\quad \Delta x=x\times x$$ and note that the axiom (L1) in (\[Lie\]) then becomes the rack identity above, while the others are empty. At the level of sets the braiding from Theorem 2.1 is $$\check{\bf R }(x\times y)=[x,y]\times x$$ and recovers the braiding associated to a rack in [@FenRou:rac].
For a $k$-linear setting over a field we let $\CL=kX$, the vector space with basis $X$, and the above definitions extended $k$-linearly. So $\CL$ is the coalgebra with basis $X$ and all basis elements grouplike. Then we have a (trivially braided) braided-Lie algebra in the category of vector spaces and the canonical braiding from Theorem 2.1 is just $$\check{\bf R }(x\tens y)=[x,y]\tens x.$$ The braided-enveloping algebra $U(\CL)$ consists of the algebra generated by elements of $X$ modulo the relations $xy=[x,y]x$ for all $x,y$. This is the bialgebra generated by the rack monoid. Here the rack monoid is the free monoid generated by symbols from $x,y$ modulo such relations, and is also a classical construction for racks.
Our examples of matrix braided-Lie algebras in subsection 4.3 are a deformation of a mixture of some Lie-algebra like elements as in subsection 4.1 and some rack-like elements. In the $gl_{2,q}$ example mentioned there, the rack-like element is proportional to the ‘time’ direction $t$ and the Lie-algebra like elements are the ‘space’ directions $x,y,z$.
We see that even when the braiding is trivial, the notion of a braided-Lie algebra in (\[Lie\]) is still useful. Moreover, it is more general than a rack because we are free to specify a more general coproduct $X\to X\times X$ than the diagonal map, as long as we obey (L1)–(L3) in the category of sets. The simplest way to obey (L2) is for $\Delta$ to be cocommutative.
The classic example of a rack is a group with the rack operation $[x,y]=xyx^{-1}$. The braiding $\check{\bf R }$ in the $k$-linear setting is then the braiding associated to the quantum double Hopf algebra $D(X)$[@Dri]. The latter is defined for $X$ finite but the rack point of view is more general and works for any group. The associated 3-manifold invariants in this case are well-known, see for example [@FreYet:bra]. On the other hand, we have super-racks, etc. just as easily as examples of braided-Lie algebras, and their associated braidings may prove more interesting.
Ordinary Hopf Algebras
----------------------
If $H$ is any Hopf algebra then it acts on itself by the Hopf-algebra adjoint action $\Ad_h(g)=\sum h\o g S h\t$ where we use the notation $\Delta h=\sum
h\o\tens h\t$ of [@Swe:hop] for the coproduct. Theorem 3.1 reduces for ordinary Hopf algebras (with trivial braiding) to One can easily verify in a couple of lines that $\check{\bf R }$ obeys the braid relations. This was perhaps first explicitly remarked in [@Wor:sol]. The case of $H$ a group algebra clearly reduces us to the rack braiding in subsection 4.4.
Once again, this braiding can be viewed as originating in Drinfeld’s quantum double construction $D(H)$[@Dri], this time applied to a general finite-dimensional Hopf algebra $H$. Drinfeld introduced $D(H)$ as a quasitriangular Hopf algebra defined by generators and relations in a basis. Here the quasitriangular structure $\CR\in D(H)\tens D(H)$ obeys Drinfeld’s axioms which are such as to ensure that its image in any representation obeys the QYBE. We introduced a form of this in [@Ma:phy] built explicitly on the vector space $H^*\tens H$ with product $$(a\tens h)(b\tens g)=\sum \<Sh\o,b\o\>b\t a\tens h\t g \<
h\th,b\th\>,\qquad\forall a,b\in H^*,\ h,g\in H$$ and tensor product unit and coalgebra. In writing this we switch also to conventions with $H$ and $H^{*\rm op}$ (the opposite algebra) as sub-hopf algebras, rather than Drinfeld’s original conventions with $H,H^{*\rm cop}$ (the opposite coalgebra). Let $\{e_a\}$ be a basis of $H$ and $\{f^a\}$ a dual basis then $$\CR=\sum_a(f^a\tens 1)\tens (1\tens e_a)$$ is Drinfeld’s quasitriangular structure in these conventions.
$D(H)$ acts on $H$ by $$(1\tens h)\la g=\sum h\o g Sh\t,\quad (a\tens 1)\la g=\sum \<a, h\o\>h\t$$ and the associated braiding is (\[brahopf\]).
It is easy to see that this defines an action of $D(H)$ (this is modelled on quantum mechanics and could be called the ‘Schroedinger representation’ of the quantum double). Then the action of $\CR$ is $\CR\la
(h\tens g)=\sum_a (f^a\tens 1)\la h\tens (1\tens e_a)\la g=\sum h\t\tens
(1\tens h\o)\la g=\sum h\t\tens \Ad_{h\o}(g)$ giving exactly (\[brahopf\]) for the corresponding $\check{\bf R }$.
Thus the braiding from Theorem 3.1 does not give anything genuinely new for an ordinary Hopf algebra. It is slightly more general than the braiding coming from the quantum double in that it does not require $H$ to be finite dimensional, but this issue too can be dealt with in other ways[@Dri]. On the other hand, it is still a useful observation, as is the fact which is obvious from (\[brahopf\]) that $\cdot\circ \check{\bf R }=\cdot$ holds in $H$. See for example [@AndDev:ext] where such an observation recently proved very useful for some Hopf algebraic constructions.
Super Hopf Algebras
-------------------
To obtain something new from Theorem 3.1 we can consider Hopf algebras in categories other than the usual one of vector spaces. The simplest setting is that of $\Z_2$-graded or super Hopf algebras. These are defined in the obvious way with all maps degree-preserving, where the degree of a term in a tensor product is the sum of the degrees in a homogeneous decomposition. Plenty of super-Hopf algebras are known, not least in algebraic topology[@MilMor:str].
The braiding in this case is $$\check{\bf R }(h\tens g)=\sum \Ad_{h\o}(g)\tens (-1)^{|h\t||g|} h\t;\quad
\Ad_{h}(g)=\sum h\o g Sh\t (-1)^{|h\t||g|}$$ where it is assumed that all tensor product elements are decomposed homogeneously.
The Braided Line $k[x]$
-----------------------
The previous subsection is still not a truly braided example of Theorem 3.1. Truly braided-Hopf algebras were first introduced and studied by the author through a number of papers. In this subsection we compute Theorem 3.1 for the simplest of these[@Ma:any], where the braiding is still a factor but not necessarily $\pm 1$ as it was in subsection 4.6.
The braided-line $k[x]$ as an algebra is nothing other than the polynomials in one variable. However, we regard it as an algebra in the category of $\Z$-graded vector spaces. As such, it has a braiding where $q\ne 0,1$ is a fixed but otherwise arbitrary element of $k$. The ideas here are from [@Ma:any]. We define $\Delta x=x\tens 1+1\tens x$, $\eps x=0$ and extend to products as a braided-Hopf algebra according to (\[hopfax\]). It is easy to see that The $q$-integers and $q$-binomial coefficients here are well-known[@And:ser] but we use them in a novel way as defining a braided-Hopf algebra structure[@Ma:fre]. Using the lemma that $S$ is a braided-antialgebra map we have also that to complete the braided-Hopf algebra structure. Finally, we note that this braided-Hopf algebra approach to $q$-analysis derives the standard $q$-derivative as infinitesimal translations[@Ma:fre], a point of view which generalises at once to $n$-dimensional quantum plane algebras.
The braided adjoint action of $k[x]$ on itself as in Theorem 3.1 is $$\Ad_f(g)(x)=f(x^2(1-q)\del_q)g(x),\qquad \forall f,g\in k[x]$$
We know from the general theory of braided-Hopf algebras[@Ma:introp] that the braided-adjoint action is an action and also that it acts on itself as a braided module-algebra. The latter condition means in the present case that it acts as a braided-derivation $$\Ad_x(fg)=\Ad_x(f)g+\cdot\circ \Psi(\Ad_x\tens
f)g=\Ad_x(f)g+L_q(f)\Ad_x(g);\quad L_q(f)(x)=f(qx).$$ Since $\Ad_x(x)=xx-qxx=(1-q)x^2$ we deduce from this $q$-derivation property of the adjoint action that $\Ad_x(x^n)=x^{n+1}(1-q^n)=x^2(1-q)\del_q x^n$. Since $\Ad_x$ is an action, we deduce the result stated. Explicitly, this has on monomials the form $$\Ad_{x^m}(x^n)=(1-q^n)\cdots (1-q^{n+m-1})x^{n+m}=(1-q)^m{[n+m-1;q]!\over
[n-1;q]!}x^{n+m}.$$
We note in passing that our derivation here depends strongly on the properties of $\Ad$ proven in [@Ma:lin][@Ma:exa] using the same novel diagrammatic techniques as in Figure 2. If we try to compute it directly from (\[anydelta\])–(\[anyS\]) on monomials then we derive the novel $q$-identity $$\sum_{r=0}^m [{m\atop r};q] q^{r(r-1)\over 2} (-1)^r
q^{rn}=(1-q)^m{[n+m-1;q]!\over [n-1;q]!}.$$ This is the content of the lemma from the point of view of $q$-analysis.
The braiding $\check{\bf R }:k[x]\tens k[x]\to k[x]\tens k[x]$ obtained from Theorem 3.1 is $$\check{\bf R }(x^m\tens x^n)=\sum_{r=0}^m [{m\atop r};q] q^{n(m-r)}(1-q)^r
{[n+r-1;q]!\over [n-1;q]!} x^{n+r}\tens x^{m-r}.$$
We compute from Theorem 3.1 in our case. Thus from the formula above for $\Delta$ we have $$\check{\bf R }(x^m\tens x^n)=\sum_{r=0}^m [{m\atop r};q] \Ad_{x^r}(x^n)\tens
x^{m-r} q^{n(m-r)}$$ and putting in the form of $\Ad$ computed in Lemma 4.5 gives the result stated.
We now provide a braided-geometrical picture of this $\check{\bf R }$ as an operator on polynomials in two variables. Thus we distinguish the two copies of $k[x]$ in both the input and output, so that $\check{\bf R }:k[y]\tens k[x]\to
k[x]\tens k[y]$ say. Next we consider these variables to be non-commuting with the quantum-plane relations, i.e. $$\check{\bf R }:k[x,y;q]\to k[x,y;q],\quad k[x,y;q]={k\<x,y\>\over yx-qxy}.$$ This is a purely notational device because this algebra has a basis $\{y^nx^m\}$ so as a linear space can be identified with $k[y]\tens k[x]$, but also has a basis $\{x^my^n\}$ and so can be identified with the linear space $k[x]\tens k[y]$ as well.
$\check{\bf R }$ in the form $k[x,y;q]\to k[x,y;q]$ is the operator $$\check{\bf R }=e_q^{x^2(1-q)\del_{q,x}|\del_{q,y}}=\sum_{m=0}^\infty
{(x^2(1-q)\del_{q,x})^m\del_{q,y}^m\over [m;q]!}$$ where the $|$ denotes that the $q$-exponential is to be understood as ordered in the form shown and $\del_{q,x}$ and $\del_{q,y}$ are as in (\[anydif\]) acting on $x,y$ respectively.
Note that the expression is a well-defined operator since on any polynomial the power-series always terminates. The $q$-exponential is the standard one except that we have adopted the ordering convention stated. This is such that we have where we recall that $\Delta$ is an algebra homomorphism to the braided tensor product algebra which we identify as $k[x]\und\tens k[y]=k[x,y;q]$ for the braiding (\[anybraid\]). This (\[anyTay\]) describes a ‘braided-Taylors theorem’ as explained in [@Ma:fre], where it is also generalised to $n$-dimensions. Applying the braided-adjoint representation $x\mapsto\Ad_x=(1-q)x^2\del_{q,x}$ to both sides of (\[anyTay\]) allows us to recompute $\check{\bf R }$ from Theorem 3.1 as $$\check{\bf R
}(f(y)g(x))=f(x^2(1-q)\del_{q,x}+y)g(x)
=e_q^{x^2(1-q)\del_{q,x}|\del_{q,y}}f(y)g(x)$$ which is the form stated. Here $f,g$ are arbitrary polynomials and a general polynomial in $x,y$ can be written as a linear combination of such products.
In this form, our Yang-Baxter operator $\check{\bf R }$ has some similarities with the quasitriangular structure $\CR$ of $U_q(sl_2)$. To see this we note that classically one can embed $sl_2$ inside the Witt algebra of ‘vector fields’ on $k[x]$ by $$L_0=x{d\over dx},\quad L_1=x^2{d\over dx},\quad L_{-1}={d\over dx}$$ so $\check{\bf R }$ resembles the factor $e_q^{(1-q)L_{1}\tens L_{-1}}$ ocurring in the formula for $\CR$ in [@KirRes:rep], cf[@Dri] and elsewhere. On the other hand, there is no Gaussian factor $q^{L_0\tens L_0}$ as to be found there.
If one works over $\C[[\hbar]]$ rather than over a field and sets $q=e^{\hbar}$ then $\check{\bf R }$ has a an expansion $$\check{\bf R }=P\circ(\id+\hbar r+O(\hbar^2));\quad r=x{d\over dx}\tens
x{d\over dx}-{d\over dx}\tens x^2{d\over dx}$$ which $r$ is necessarily an operator realisation $k[x]\tens k[x]\to k[x]\tens
k[x]$ of the Classical Yang-Baxter equation (CYBE). Here $P$ is permutation. To obtain this formula one can work from Corollary 4.6 or else from Proposition 4.7 provided one remembers the contribution (the first term in $r$) coming from the fact that the output of $\check{\bf R }$ has to be viewed in $k[x]\tens k[y]$ while its input is viewed in $k[y]\tens k[x]$. In this case $r$ is indeed the image in the Witt algebra of the Drinfeld-Jimbo solution[@Dri][@Jim:dif] of the CYBE on $sl_2$ when represented as vector fields on $k[x]$. The connection with theory of quantum groups is provided by the ‘bosonisation theorem’ introduced in [@Ma:bos]. In the present case this turns constructions on $k[x]$ into equivalent ones on the Hopf algebra $U_q(b_+)$ in [@Dri].
On the other hand, we have obtained this $\check{\bf R }$ starting from nothing other than $k[x]$ regarded as a braided-Hopf algebra (the braided-line) and Theorem 3.1. Moreover, we can suppose that $q\in k^*$ is a root of unity and proceed with the same calculations. More precisely, we can repeat the above calculations for the braided-Hopf algebra $U_n(k)=k[x]/x^n$ introduced in [@Ma:any], where $q$ is a primitive $n$’th root of $1$. This ‘anyonic line’ braided-Hopf algebra is $n$-dimensional and hence $\check{\bf R }$ corresponds to a matrix solution of the QYBE in $M_n\tens M_n$. An elementary computation gives for example,
The braiding from Theorem 3.1 applied to the anyonic line for $n=3$ has minimal polynomial $$(\check{\bf R }^2-1)^2(\check{\bf R }-q)=0$$ and corresponding matrix solution of the QYBE $${\bf R}=\pmatrix{1&0&0 &0&0&0 &0&0&0\cr
0&1&0 &0&0&0 &0&0&0\cr
0&0&1 &0&1-q&0 &0&0&0\cr
0&0&0 &1&0&0 &0&0&0\cr
0&0&0 &0&q&0 &0&0&0\cr
0&0&0 &0&0&q^2 &0&$q$-1&0\cr
0&0&0 &0&0&0 &1&0&0\cr
0&0&0 &0&0&0 &0&q^2&0\cr
0&0&0 &0&0&0 &0&0&q}$$ where $q^3=1$ is a primitive root and the basis is $\{1\tens 1,1\tens
x,\cdots,x^2\tens x^2\}$.
This braided-line which we have studied above is only the very simplest example of a braided-Hopf algebra. The next simplest is probably the quantum plane $k[x,y;q]$ this time regarded itself as a braided-Hopf algebra with braiding provided by the standard $sl_2$ R-matrix corresponding to the Jones knot polynomial[@Ma:poi]. Explicitly, Using this, one obtains the braided adjoint action on generators as $$\Ad_x(x)=x^2(1-q^2),\ \Ad_x(y)=(1-q^2)xy,\ \Ad_y(x)=yx(1-q^2),\
\Ad_x(y)=y^2(1-q^2).$$ Extending this to higher products along the lines above, one obtains the braided-vector fields for the braided-adjoint action as $$\Ad_x=(1-q^2)x(x\del_{q,x}+y\del_{q,y}),\quad
\Ad_y=(1-q^2)y(x\del_{q,x}+y\del_{q,y})$$ where $\del_{q,x}$ and $\del_{q,y}$ are the partial derivatives on the quantum plane[@WesZum:cov] in the form obtained by an infinitesimal translation in [@Ma:fre]. From this one can compute the braiding $\check{\bf R }$ from Theorem 3.1 as represented by $q$-deformed vector fields on a quantum plane. We have not found an explicit exponential formula for it along the lines of Proposition 4.7.
This class of examples generalises further to any quantum plane algebra of the R-matrix type. The necessary braided-Hopf algebra structure, braided differential calculus and R-binomial theorem are in [@Ma:fre]. For example, the $q$-Minkowski space example with generators $t,x,y,z$ fits into this setting with additive braided-Hopf algebra structure found in [@Mey:new]. In these cases the appropriate $q$-exponential map needed for the analogue of Proposition 4.7 is not yet known. In a different direction, we can take the free braided-Hopf algebra $k\<x_1,\cdots,x_n\>$ with braiding determined by $R$ as a generalisation of the example $k[x]$ above. In this case the relevant exponential map is provided in [@Ma:fre].
Extended braid relations and braided cocommutativity
====================================================
Here we give an application of the notion, introduced by the author in [@Ma:bra] of a braided-cocommutative module of a braided-bialgebra. We do not need a braided-antipode in this section. Given $B$ a bialgebra in a braided tensor category $\CC$ as in Section 3, a $B$-module in the category means $(V,\alpha_V)$ where $V$ is an object and $\alpha_V:B\tens V\to V$ is a morphism obeying the obvious notion of an action of $B$ on $V$. We say that $B$ is [*braided-cocommutative*]{} with respect to $V$ (or simply that the module is [*braided cocommutative*]{} when the Hopf algebra is understood) if So for example, the braided-enveloping bialgebra $U(\CL)$ in Section 2 acts cocommutatively on $\CL$ by $[\ , \ ]$. The braided-Hopf algebras that arise by transmutation from quantum groups[@Ma:bra] are likewise braided-cocommutative with respect to all the corresponding braided-modules that come from modules of the quantum group. So this is a large class.
Now, for any $B$-module $(V,\alpha_V)$ we define the associated operator $$U_{B,V}=\ {{}\atop\epsfbox{Ualpha.eps}}\
=(\id\tens\alpha_V)\circ\Delta:B\tens V\to B\tens V$$ Working with this is equivalent to working with our original module since we can recover the latter as $(\eps\tens\id)\circ U_{B,V}=\alpha_V$. We have
Let $(V,\alpha_V)$, $(W,\alpha_W)$ be modules of a braided-bialgebra $B$, with $(W,\alpha_W)$ cocommutative. Then the corresponding operators $U$ obeys the extended braid relations $$U_{B,V}\circ\Psi_{W,V}\circ U_{B,W} \circ \Psi_{V,W}=\Psi_{W,V}\circ U_{B,W}
\circ \Psi_{V,W}\circ U_{B,V}$$
$$\epsfbox{refl.eps}$$
This is shown in our diagrammatic notation in Figure 3. The $\epsfbox{prodfrag.eps}$ vertices are the module action $\alpha_V$ or $\alpha_W$ while the $\epsfbox{deltafrag.eps}$ vertices are the coproduct $\Delta$ throughout. We begin with the left hand side of the extended braid relations with $U$ of the form stated above and $\Psi=\epsfbox{braid.eps}$ as usual. The first equality is (\[V-cocom\]) for $W$. The second slides this group containing $\alpha_W$ over to the left using functoriality. The third likewise pushes the group containing $\alpha_V$ up to the top of the expression. The fourth is coassociativity of $\Delta$. The fifth pulls the $\alpha_W$ vertex down and to the right. The sixth now uses the cocommutativity condition (\[V-cocom\]) again for $W$, to obtain the right hand side of the extended braid relations as required.
We note that this proof used nothing more than coassociativity of the coproduct $\Delta$ and the cocommutativity axiom (\[V-cocom\]) as it was introduced in [@Ma:bra], being essentially equivalent to it when we demand it for all $V$. Another equivalent way to write the condition is that $\alpha_{V\tens
W}\isom \alpha_{W\tens V}$ by the braiding $\Psi_{V,W}$, i.e. that the module $V$ is central in the category of $B$-modules, up to the trivial isomorphism provided by the background braiding. This is the key property of representations of ordinary groups (which are commutative up to ordinary transposition) and was the main motivation behind the theory of braided groups in [@Ma:tra]. See [@Ma:introp Eqn. (64)] for the connection with physics from this point of view.
To describe a class of examples we observe that exactly the same definitions and theorem hold for a braided-commutative module of a braided-Lie algebra $\CL$ (as defined in [@Ma:lie]) so it is not necessary to work with an entire braided-bialgebra here. In particular, $\CL$ acts on itself by $\alpha_{\CL}=[\ ,\ ]$, the adjoint representation of the braided-Lie algebra. So we have $$U_{12}\circ \Psi_{23}\circ U_{12}\circ \Psi_{23}=\Psi_{23}\circ U_{12}\circ
\Psi_{23}\circ U_{12}$$ as operators on $\CL\tens\CL\tens\CL$. Such matrix representations of the extended Artin braid group are useful in defining invariants of links in the complement of the trivial knot, as explored in [@LamPrz:hom]. The canonical extension to an action of $U(\CL)$ puts us into the setting of Theorem A.1.
Note also that one can of course turn all these diagram-proofs upside-down. Then we have another operator $U_{V,B}$ for every right $B$-comodule $V$. This time the upside-down (\[V-cocom\]) becomes the condition of $V$ a commutative right-comodule with respect to $B$, as studied in[@Ma:bg]. An example is provided by $B=B(R)$ as the bialgebra of braided matrices. It has a braided-coaction on the Zamolodchikov or quantum R-plane algebra $V$ with generators $\{x_i\}$ and coaction $\beta(x_i)=x_j\tens u^j{}_i$, which is braided-commutative because it comes from transmutation[@Ma:lin]. Hence we can apply Theorem A.1 in dual form. This gives another point of view on the braided-commutativity relations (\[B(R)\]) of $B(R)$.
[10]{}
S. Majid. Algebras and [H]{}opf algebras in braided categories. To appear in [*Advances in [H]{}opf Algebras*]{}. Marcel Dekker, 1993.
V.G. Drinfeld. Quantum groups. In A. Gleason, editor, [*Proceedings of the [ICM]{}*]{}, pages 798–820, Rhode Island, 1987. AMS.
M. Jimbo. A [$q$]{}-difference analog of [$U(g)$]{} and the [Y]{}ang-[B]{}axter equation. , 10:63–69, 1985.
S. Majid. Quantum and braided [L]{}ie algebras, february 1993 (damtp/93-4). To appear in [*J. Geom. Phys.*]{}
R. Fenn and C. Rourke. Racks and links in codimension two. , 1(4):343–406, 1992.
S. Majid. Braided groups. , 86:187–221, 1993.
S. Majid. Transmutation theory and rank for quantum braided groups. , 113:45–70, 1993.
S. Lambropoulou and J. Przytycki. The [HOMFLY-PT]{} polynomial in the lens spaces [L(p,1)]{}. , 1993.
S. Majid. Beyond supersymmetry and quantum symmetry (an introduction to braided groups and braided matrices). In M-L. Ge and H.J. de Vega, editors, [*Quantum Groups, Integrable Statistical Models and Knot Theory*]{}, pages 231–282. World Sci., 1993.
S. Majid. Cross products by braided groups and bosonization, 1991. To appear in [*J. Algebra*]{}.
S. Majid. Braided matrix structure of the [S]{}klyanin algebra and of the quantum [L]{}orentz group. , 156:607–638, 1993.
S. Majid. Quantum and braided linear algebra. , 34:1176–1196, 1993.
S. Majid. Free braided differential calculus, braided binomial theorem and the braided exponential map. , 34:4843–4856, 1993.
S. Mac Lane. . Springer, 1974. GTM vol. 5.
A. Joyal and R. Street. Braided monoidal categories. Mathematics Reports 86008, Macquarie University, 1986.
S. Majid. Quasitriangular [H]{}opf algebras and [Y]{}ang-[B]{}axter equations. , 5(1):1–91, 1990.
S. Majid. Lie algebras and braided geometry. To appear in [*Proc. XXII’s DGM, Ixtapa, Mexico, September, 1993*]{}. Kluwer.
S. Majid. Examples of braided groups and braided matrices. , 32:3246–3253, 1991.
S. Majid. Rank of quantum groups and braided groups in dual form. In [*Proc. of the Euler Institute, St. Petersberg (1990)*]{}, volume 1510 of [*Lec. Notes. in Math.*]{}, pages 79–89. Springer.
S. Majid. Braided groups and algebraic quantum field theories. , 22:167–176, 1991.
S.L. Woronowicz. Solutions of the braid equation related to a [H]{}opf algebra. , 23:143–145, 1991.
L. LeBruyn and S.P. Smith. Homogenised [$sl_2$]{}. , 118:725–730, 1993.
L. LeBruyn and M. van den Bergh. On quantum spaces of lie algebras. , 1993.
D.I. Gurevich. The [Y]{}ang-[B]{}axter equations and a generalization of formal [L]{}ie theory. , 33:758–762, 1986.
L.D. Faddeev, N.Yu. Reshetikhin, and L.A. Takhtajan. Quantization of [L]{}ie groups and [L]{}ie algebras. , 1:193–225, 1990.
S. Majid. The quantum double as quantum mechanics, september 1992 (damtp/92-48). To appear in [*J. Geom. Phys.*]{}
U. Meyer. A new [$q$]{}-[L]{}orentz group and $q$-[M]{}inkowski space with both braided coaddition and [$q$]{}-spinor decomposition. , DAMTP/93-45, 1993.
U. Carow-Watamura, M. Schlieker, M. Scholl, and S. Watamura. A quantum [L]{}orentz group. , 6:3081–3108, 1991.
O. Ogievetsky, W.B. Schmidke, J. Wess, and B. Zumino. -deformed poincar[é]{} algebra. , 150:495–518, 1992.
L. LeBruyn. Homological properties of braided matrices, 1993. To appear in [*J. Algebra*]{}.
P. Freyd and D. Yetter. Braided compact closed categories with applications to low dimensional topology. , 77:156–182, 1989.
M.E. Sweedler. . Benjamin, 1969.
S. Majid. Physics for algebraists: Non-commutative and non-cocommutative [H]{}opf algebras by a bicrossproduct construction. , 130:17–64, 1990. From PhD Thesis, Harvard, 1988.
N. Andruskiewitsch and J. Devoto. Extensions of [H]{}opf algebras. , 1993.
J. Milnor and J.C. Moore. On the structure of [H]{}opf algebras. , 81:211, 1969.
S. Majid. Anyonic quantum groups. In Z. Oziewicz et al, editor, [*Spinors, Twistors, Clifford Algebras and Quantum Deformations (Proc. of 2nd Max Born Symposium, Wroclaw, Poland, 1992)*]{}, pages 327–336. Kluwer.
G.E. Andrews. -series: Their development and application in analysis, number theory, combinatorics, physics and computer algebra. Technical Report 66, AMS, 1986.
A.N. Kirillov and N.Yu. Reshetikhin. Representations of the algebra [$U_q(sl(2))$]{}, [$q$]{}-orthogonal polynomials and invariants of links. , 1988.
S. Majid. Braided momentum in the [$q$]{}-[P]{}oincar[é]{} group. , 34:2045–2058, 1993.
J. Wess and B. Zumino. Covariant differential calculus on the quantum hyperplane. , 18B:302, 1990.
[^1]: Royal Society University Research Fellow and Fellow of Pembroke College, Cambridge
|
1 posts from October 29, 2012
October 29, 2012
Just walked out my front door to the most invigorating splash of cool air I've felt in a long time.
Of course, I've had my TV on for the past hour watching The Weather Channel for news on Hurricane Sandy and how it's affecting the Northeast and Mid-Atlantic areas.
Much of my family lives in New York, New Jersey and the surrounding states.
Coach Al Golden, who also grew up in New Jersey, told us his brother, Shaun Golden, "is the sheriff of Monmouth County'' in New Jersey.
"That's a shore community,'' Golden said. "So they're [going] a million miles an hour and my parents are back there and so is my older brother. They're expecting quite a bit. Clearly it's going to be a big one, so we're praying for those people and hopefully they'll come out of it OK.''
Meanwhile, in Blacksburg, Va., home of the Hokies, it's 37 degrees (feels like 31) and raining, with high winds.
The forecast for tomorrow is snow and wind with a high of 37 and a low of 33.
We'll keep track of whether the Hokies alter their travel schedule for their Thursday-night game at Sun Life Stadium. Usually they would arrive Wednesday.
Either way, here's hoping that people keep safe during this "perfect'' storm that's about to hit.
Today, the Miami Hurricanes will have their weekly press conference that usually occurs on Tuesdays. Today would be considered a normal Wednesday for UM, because the game is being played two days earlier than usual. |
Today we’re unveiling Dark and moving into private beta.
Backends today are too complicated to build. Dark is designed to massively reduce that complexity. Dark is a holistic programming language, editor, and infrastructure for building backends. You write in the Dark language, using the Dark editor, and your program is hosted on Dark’s infrastructure. As a result, you can code without thinking about infrastructure, and have safe instant deployment, which we’re calling “deployless”.
Dark in Action
Today we’re releasing two videos showing how Dark works. Ellen Chisa, our CEO, demonstrates how to build a backend application (an office sign-in app) in 10 minutes, showing how Dark works and how it’s used.
(We’re sorry the video player won’t full screen here, the one at https://darklang.com does! Or see Ellen’s talk as a blog post!)
An API endpoint from the demo with a live values & code references.
Next, watch Paul Biggar, our CTO, talk about the philosophy of Dark: why we designed Dark, and the details of the language, editor, and infrastructure. He’ll also show off how we make “deployless” safe with feature flags and versioning, and how Dark allows you introspect and debug live requests.
Who uses Dark?
During our private alpha, developers have built entire backends in Dark. Chase Olivieri built Altitude, a flight deal subscription site. Julius Tarng moved the backend of Tokimeki Unfollow to Dark for scalability. Jessica Greenwalt & Pixelkeet ported Birb, their internal project tracker, into a SaaS for other design studios to use.
We’ve seen our alpha users build backends for web and mobile applications, internal tools, Slackbots, Alexa skills, and personal projects. We’ve even started building parts of Dark in Dark, including our presence service and large parts of our signup flow.
Private Beta
Starting today, Dark is in private beta. During the private beta, we’ll be opening Dark in waves to many more people. If you have a project that is well scoped and you’re ready to get started, we can let you into the beta quickly (even immediately!).
Work at Dark
Building Dark has been a challenging and fulfilling journey, and we’re just getting started. We’re hiring for dozens of roles remotely (in US time zones) and in San Francisco. We have an inclusive culture, an important mission and values, and a transparent hiring process.
Learn more and check out our open roles: https://darklang.com/careers.
Thank you
It takes a lot to build a language, editor, and infrastructure. The last two years wouldn’t have been possible without the support of countless people. Our alpha users, who provided amazing feedback and filed approximately a million bugs. Our investors and advisors, who supported us from when this was just an idea, and held us accountable to our goals.
And most importantly, so many people have sent us ideas and encouragement on twitter and in person. Your support is everything 💯🔥🎉
Thank you!
Ellen, Paul, IanC, Alice, IanS, Sydney, Korede, Julian, and Dean |
Q:
Why do my Tkinter widgets get stored as None?
I'm putting my buttons into an array but when I call them they are not there. If I print out the array I get:
{0: None, 1: None, 2: None, 3: None, 4: None, 5: None, 6: None, 7: None, ...}
I just don't know what I am doing wrong.
from tkinter import *
def main():
pass
if __name__ == '__main__':
main()
b={}
app = Tk()
app.grid()
f = Frame(app, bg = "orange", width = 500, height = 500)
f.pack(side=BOTTOM, expand = 1)
def color(x):
b[x].configure(bg="red") # Error 'NoneType' object has no attribute 'configure'
print(b) # 0: None, 1: None, 2: None, 3: None, 4: None, 5:.... ect
def genABC():
for r in range(3):
for c in range(10):
if (c+(r*10)>25):
break
print(c+(r*10))
b[c+(r*10)] = Button(f, text=chr(97+c+(r*10)), command=lambda a=c+(r*10): color(a), borderwidth=1,width=5,bg="white").grid(row=r,column=c)
genABC()
app.mainloop()
A:
The grid, pack, and place methods of every Tkinter widget operate in-place and always return None. This means that you cannot call them on the same line as you create a widget. Instead, they should be called on the line below:
widget = ...
widget.grid(...)
widget = ...
widget.pack(...)
widget = ...
widget.place(...)
So, in your code, it would be:
b[c+(r*10)] = Button(f, text=chr(97+c+(r*10)), command=lambda a=c+(r*10): color(a), borderwidth=1,width=5,bg="white")
b[c+(r*10)].grid(row=r,column=c)
|
/*******************************************************************************
* Copyright (c) 2020 Pivotal, Inc.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* https://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* Pivotal, Inc. - initial API and implementation
*******************************************************************************/
package org.springframework.ide.eclipse.boot.dash.docker.ui;
import java.util.ArrayList;
import java.util.List;
import org.eclipse.core.runtime.IStatus;
import org.eclipse.core.runtime.MultiStatus;
import org.eclipse.core.runtime.Status;
import org.eclipse.jface.dialogs.ErrorDialog;
import org.eclipse.swt.widgets.Display;
import org.eclipse.swt.widgets.Shell;
import org.eclipse.ui.PlatformUI;
import org.springframework.ide.eclipse.boot.dash.BootDashActivator;
import org.springframework.ide.eclipse.boot.dash.di.SimpleDIContext;
import org.springframework.ide.eclipse.boot.dash.docker.ui.SelectDockerDaemonDialog.Model;
import org.springsource.ide.eclipse.commons.livexp.ui.UIContext;
public class DefaultDockerUserInteractions implements DockerUserInteractions {
private static final String MESSAGE_WIRING_ERROR = "This is embarassing... There was an error encountered in the OSGi setup as some bundles are incorrectly wired.\n" +
"\nPlease restart your IDE with the '-clean' parameter once to workaround the problem. It is shame of course that we could not automate the proper restart, apologies for the inconvenience.\n" +
"\nThe issue will be fixed in the next version of Eclipse (4.17)";
private SimpleDIContext injections;
public DefaultDockerUserInteractions(SimpleDIContext injections) {
this.injections = injections;}
@Override
public void selectDockerDaemonDialog(Model model) {
Display.getDefault().syncExec(() -> new SelectDockerDaemonDialog(model, getShell()).open());
}
private Shell getShell() {
return injections.getBean(UIContext.class).getShell();
}
public static void openBundleWiringError(Throwable t) {
List<Status> childStatuses = new ArrayList<>(t.getStackTrace().length);
for (StackTraceElement stackTrace : t.getStackTrace()) {
Status status = new Status(IStatus.ERROR, BootDashActivator.PLUGIN_ID, stackTrace.toString());
childStatuses.add(status);
}
MultiStatus status = new MultiStatus(BootDashActivator.PLUGIN_ID, IStatus.ERROR,
childStatuses.toArray(new Status[] {}), t.toString(), t);
Display display = Display.getCurrent();
if (display != null && !display.isDisposed()) {
ErrorDialog.openError(display.getActiveShell(), "Error Wiring Bundles", MESSAGE_WIRING_ERROR, status);
} else {
display = PlatformUI.getWorkbench().getDisplay();
if (display != null && !display.isDisposed()) {
display.asyncExec(() -> ErrorDialog.openError(Display.getCurrent().getActiveShell(), "Error Wiring Bundles", MESSAGE_WIRING_ERROR, status));
}
}
}
}
|
1. Technical field
The invention relates to a thiazolothiazole compound and a thiazolothiazole polymer having the thiazolothiazole compound as a polymerization unit thereof.
2. Related Art
Various compounds and polymers which have charge transporting property have been known. |
The automobile service ramp has developed through the years from simply:
A. an inclined plane block with a flat portion made from large pieces of wood, for example, sections of railroad ties, to PA1 B. truss like structures, to PA1 C. my recent invention of the stamped, welded ramp disclosed in co-pending applications, Ser. No. 520,566, now Pat. No. Des. 239,610 and 503,947, now U.S. Pat. No. Des. 237,162.
The stamped automobile service ramp has several advantages including simplicity and reduction in cost, combined with additional safety. Because the ramp is of a single piece of metal, there is no danger of failure of the ramp by reason of failure of fastening devices such as loosening of bolts, shearing of rivets and the like, or improper assembly or maintenance by the user. To obtain sufficient strength in initial designs of stamped ramps, increased thickness material was required.
One other limitation on existing service ramps of all types has been the lack of any clear indication to the driver, while driving his vehicle up onto a ramp, that the tire has reached the final, desired position. Even stops which have been present at the end of the rest portion can easily be driven over and the vehicle driven off the ramp. This is particularly a problem with lower profile low pressure tires which do not give a feeling to the driver of striking any small stop or obstruction.
One other difficulty has been that ramps of the unitary type do not have handles which were present in the old truss type of ramps where any portion of the truss can be grasped to carry a ramp.
Typically stamped or formed ramps have employed flat cross section ramp surfaces with upstanding side walls. The side walls are intended as guides for the tires and to act like a truss on each side to give added strength. |
Date: Wed, 24 Nov 2010 06:10:55 -0500 (EST)
From: BertMcK@aol.com
Subject: Crystal Throne/Journey to the West chapter 13
Journey to the West
By Bert McKenzie
Copyright 2010
Chapter XIII
"I'm going with you," she said emphatically. Akuta just shook his head and
continued to dress for his journey, pulling on the heavy woolen and leather
garments that had been provided by the dwarves. It never occurred to him
to wonder that this race of little people would happen to have clothing
that would fit one of the 'tall ones' as they called his species. He
finally pulled on the thick, fur poncho that covered him and turned to her.
"Take this," he said, holding out his silver dagger, the only one of his
weapons that remained. "You may have need of it one day."
"We had a bargain," she said, stamping her foot like an angry child. "You
said you would take me to see this western island of yours, and now you
abandon me with these...these dwarves!"
"Korbod has promised you safety," he repeated. Then he turned to leave the
cave.
Sharon could see that no argument would change his mind. She had never met
anyone so stubborn in her life. "Look," she said, trying another approach
as she followed him out of the cave. "I didn't get thrown from a horse,
almost eaten by a flying mountain lion, attached by leprechauns in a
forest, lost and almost drowned in a swamp just to sit here while you go
exploring caves. I'll follow you, Akuta. If you leave me here, I'll just
come after you."
The fairy suddenly turned on his heel, stopping so abruptly in front of her
that she collided into him. "Listen to me and hear me well," he said in an
angry voice, his hands grabbing her by the upper arms, his tightly gripping
fingers bruising her. "You will follow my instructions as I tell you."
Akuta then looked around, realizing they were arguing in the middle of a
crowd of dwarves who looked on in astounded and amused interest. He
quickly drapped his voice to a wind whisper. "Korbod will prevent you from
following me. He shall keep you as a guest or a prisoner, whichever you
prefer. Now you may come with us as far as the gateway of Turin Kareem if
you remember your place."
"Remember my place!" she shouted, white hot anger flaring her temper.
"You are my property in their eyes," he said calmly. "Please act as such.
I know not how you may be treated in my absence if you act not as they
expect. Now come, but keep your eyes down."
Sharon continued to glare angrily at him, taking slow, deep breaths as she
tried to calm her anger. She wasn't afraid of him or these little people.
All she had to do was bide her time, then follow him.
"Our travel time is here," Korbod announced as he walked up to the two
giants, towering over his people. "Be ye ready?"
"Yes," Akuta replied.
"Here be food for ye journey," the little man said, handing a full nap sack
to Akuta that one of the nearby women had carried. "Let us go." Korbod,
Akuta and Sharon moved off toward the entrance to the box canyon. The
dwarf suddenly stopped to look at Sharon who dutifully dropped her eyes.
"Why bring ye this?"
"This?" Sharon said as her head snapped up and she made eye contact with
the little man.
"She comes to see me away," Akuta said as he quickly stepped in front of
the girl. "She has deep affection for me." Sharon responded with a snort
of derision. The little dwarf seemed not to notice her attitude, but
merely nodded and turned to walk on.
Just outside the village was a group of little men waiting to accompany the
three on their journey. In their midst stood a giant, a taller man, bound
tightly by thick ropes. "This is the problem we wish ye to take away,"
Korbod said, gesturing toward the taller man surrounded by dwarves.
"Pardoo," Sharon gasped in recognition.
* * *
"There are but two solutions," Lorfana said as she addressed Robin as he
sat in the conference room just off the main throne room. "The entire high
council is in agreement on this."
"I fear I know what you shall say," he replied as he dropped his head in
his hands. He ran his fingers through his hair until they made contact
with the thick, gold band that he wore circling his brow.
"Nevertheless, let me say it," the old woman continued. "We must produce
this servant boy which will prove Lastel a fool. The others of the blue
tower will then follow your lead. You may expel him and select another
from the west to rule the tower and sit at council."
"That was my plan," the king agreed.
"But it must be done now, before another day passes," she urged.
"I have my consort and the captain of the guard searching for the youth,"
Robin explained. "They even have the help of the Keeper of Magic. What
more can we attempt?"
"How difficult can this be to find one boy?" Lorfana asked.
"He has escaped to the human world," Robin finally confessed to the council
leader.
Lorfana's eyes widened in surprise. "Then this explains the delay," she
said in a hushed voice. "I thank you, my lord, for sharing this confidence
with me. You are correct to keep this knowledge secret. It could only
cause more harm than good." She sat in silent thought for a minute before
speaking again. "You must be prepared to take the second solution to our
problem."
"I fear this next solution most of all," the king said.
"You must prepare for war between our kingdoms and the west."
"Our kingdoms?"
She folded her hands calmly in her lap and sat back in her chair. "I mean,
of course, the high born. We may also be able to have an alliance with the
woodlings of the great forest. I fear the merchants will wish to remain
neutral to protect their trade. I cannot speak for the other tribes. At
present Lastel has painted us as the aggressors."
"And shall I have the support of the high council?" Robin asked.
"No," Lorfana said firmly. "The council is composed of all the tribes. We
cannot support one tribe in warfare against another."
Robin shook his head slowly. "This is very bad," he admitted.
"We can but hope your consort shall succeed in his task," the old woman
said softly.
* * *
"Good morning," Jennifer said cheerily as she and Caseldra joined their
companions in the hotel coffee shop.
"How can you be so damned happy?" Scott grumbled as he took a swig of
coffee.
"Uh oh. Did somebody get up on the wrong side of the bed?" the girl asked,
looking at her friend.
"Is there an incorrect way to rise from those overly soft reclining
platforms?" Rood asked in surprise. "Is that why he is so unpleasant
today?"
"Rood," Scott said, setting his cup down.
"Yes, lord?"
"Shut up."
The waiter came walking up with more coffee and two additional menus. This
effectively stalled further conversation for a few minutes. Jennifer
ordered for Caseldra as well as herself, then ordered breakfast for Rood
when she realized Scott only asked for coffee. As the man quickly
disappeared toward the back of the restaurant Jennifer turned to her old
friend. "If you want to grouse and starve yourself, fine, but don't forget
these friends of yours want to eat, and they don't know how to read a
menu."
"Sorry," Scott replied sullenly.
"I should think so," she said. They all lapsed into silence. Soon the
food arrived and the three began to enjoy their meal while Scott continued
to brood.
"My lord, you should eat something," Caseldra suggested. "We may have a
difficult search today."
"You're telling me," the man answered sarcastically. "How hard can it be
to find one little fairy in a city of seven million?" This drew a nasty
look from the effeminate waiter as he happened to walk by just then.
"The poor guy," Jennifer said. "Everything here must be pretty alien to
him."
Scott suddenly froze, his cup halfway to his lips. "Alien," he repeated,
an idea beginning to form in the back of his mind. "That's it. He's an
alien."
"So?" Jennifer asked.
"So he's an illegal alien. I bet the INS can get that drag club to give
them Dannemel's address."
"Now Scott, how is that going to help us?"
"You're going to work for the INS," he said.
"I'm what?" she asked in shock. He quickly began to outline his plan to
her.
A few hours later a conservatively dressed woman in a grey business suit
and dark rimmed glasses, carrying a brief case was seated in Moe's office
at the Boom Boom Room.
"Well, Missy..." Moe began as he leaned back in his chair, pulling out a
cigar.
"The name is Miss Sloan, and would you mind not smoking," Jennifer said
coldly as she could manage.
"Look, lady," the fat little man said as he leaned forward. "This is my
joint. You're in my office and I'll do as I please."
Jennifer pushed her glasses up on her nose as she had seen her friend Troy
do many months ago when he was alive. She always thought it was a perfect
gesture of impatient contempt. "Well, I can see I won't be able to conduct
my investigation here. I'll just have my office call the Justice
Department and they'll have to shut your business down for a couple of
months while we subpoena your files." She stood up and turned to the door.
"Now wait just a minute," Moe said, jumping up so quickly he overturned his
chair. "I'm willing to cooperate in any way I can." Jennifer turned back
and gave him a cool stare, as if she were examining a bug under a
microscope. She looked at the unlit cigar in his hand. Moe quickly opened
a desk drawer and dropped the offensive stogey in it. "What is it you
want?"
"To begin with, I need to see your employee records."
"My employee records?" he repeated.
"Your I-9, Employment Eligibility Verification forms to be specific."
"I-9?" Moe said.
"Yes," Jennifer replied as she sat down and reached into her brief case.
She pulled out one of the forms they had picked up at the office of
Immigration and Naturalization Services just an hour earlier. "As an
employer in the United States you are required to keep one of these on
every one of your employees."
Moe looked blankly at the form. "Oh, yeah? Sure. We got these," he said.
He stood up and crossed to the door, sticking his head out and bellowing.
"Sarah!" A moment later a mousy looking little woman who served as
bookkeeper came in. "We got these?" He stuck the form in her hand.
"Well, yes on a few employees," she replied.
Jennifer slowly stood and began reciting the information she had memorized
from the back of the form. "You are required to have this form on file by
Title 8 of the United States Code, Section 1324A. If you cannot furnish me
with this evidence you may be in violation of the law and may be open to
prosecution in a civil court. I guess we might have to close down your
operations after all."
"Sarah, go get the personnel files," Moe instructed. The woman scurried
off. "Now Miss...um."
"Sloan," Jennifer said icily.
"Miss Sloan. Have a seat. Can I get you a drink? We have a complete
bar."
"No thank you. Just the files please."
About this time the little woman scurried back into the office carrying a
large shoe box. She handed it reverently to Jennifer. Moe and Sarah
watched as the girl opened the lid and found a jumble of papers and forms.
She carefully dug through the mess, finding a couple of crumpled I-9's, a
couple of W-4's and lots of homemade resumes and job applications. As she
looked at each piece of paper, she grew more frustrated. It was obvious
that Moe and his bookkeeper were not the most efficient record keepers.
"Well," she said, looking up. "I guess I'll just have to question each of
your employees personally since you obviously don't have the proper
eligibility forms on hand for all of them. Where can I find a list of
addresses and phone numbers?"
"Get the payroll ledger," Moe said.
Again the woman scurried out and returned shortly with a big, black book.
Jennifer opened it up and almost squealed with delight. There on the front
page was a list of employees with addresses and phone numbers. Second from
the bottom was Danny Smith with an address but no phone. Jennifer grabbed
a pad and pencil from her brief case and quickly copied down the
information. She handed the ledger back and stood up.
Moe practically fell over himself trying to be cooperative. "I'm not
really gonna be closed down on account of some dumb forms, am I?"
The girl reached into her case once more and pulled out a pad of the I-9's
the people at INS gave her when she told them she was opening a business.
"Here," she said, handing Moe the pad. "Have one of these completed on
every one of your people by next week. I'll be back." She turned and
quickly left the club.
On the street below Scott, Caseldra and Rood waited anxiously. Jennifer
came out of the door with a smile on her face. "How did it go?" Scott
asked.
"Easy as pie," she said as she handed him the address. She then took off
the clear glass spectacles. "See what eight years of community theatre can
do?"
"You remembered not to over act as Scott says you always have on stage?"
Caseldra asked innocently.
"Let's get a cab. Taxi!" Scott shouted as he jumped for the street.
* * *
The group traveled all day, finally stopping for the night in the shelter
of an overhanging stone shelf. Sharon was exhausted, and after a frugal
but filling meal she curled up near the campfire and fell into a deep
sleep. Akuta sat beside her for a time, and then decided to take a walk in
the starlight. Just a little way from the warmth of the camp he came
across a couple of dwarf guards and the western elf as their prisoner.
Pardoo looked up at Akuta and smiled. "Welcome to the camp for the
prisoners, reversal," he said. Akuta stared warily at him. "Oh, fear not,
my man loving friend. These little people speak not our language."
"How came you to this?" Akuta asked the other tall man.
"If you mean the station of a prisoner, I am an innocent victim. These
little ones have a quarrel with the western kingdom so I suffer." Akuta
nodded in sympathy. "And now I ask you a question," Pardoo said. "You
seem to have a part in this journey. Know you where they are going?"
Akuta thought for a moment, but could see no reason why the prisoner should
not know. "We go to Turin Kareem," he said at last.
Pardoo looked frightened for the first time since Akuta had rescued him
from the griffin. "Turin Kareem," he repeated. "Is this your punishment
to me for leaving you in the marsh?"
"Heard you not the stories?" Akuta admonished with a smile. "Turin Kareem
is full of color crystal. You may retrieve much wealth there."
"I may retrieve my death there," the elf returned. "That cannot be it.
You seek not the color crystal. You are not that much of a fool. Know you
we shall die in the darkness?" But Akuta simply turned around and headed
back to the main camp.
Korbod sat by the fire, waiting for the fairy. "I would speak to ye," he
said as Akuta drew near.
"Speak," the guard said as he sat down next to the dwarf.
"On the morrow we reach ye destination. Before we journey on I must have
ye pledge."
"If it is mine to give," Akuta responded.
"Ye must kill the other tall one. He must not return from the dark. In
such ye shall eliminate our problem." The dwarf gazed into the fire.
"Why must he die?" the fairy asked.
"If he returns to his land and they hear of our treatment of him, our
location and strength, it will be all they need to begin the war they have
prepared for all these past months. They wish to kill us all and seize our
stones and crystals."
"Cannot you kill him yourself?" Akuta asked in disgust.
"If he dies by our hand his people shall hear of it," the gray bearded man
said. "If he enters the darkness with ye, no one shall ever hear of him
again."
"I shall do as you ask if again you pledge to keep my property safe," came
the answer.
Korbod smiled and agreed. "Ye property shall be safe with me," he said.
Akuta nodded, and then rose so he could draw apart from the others to
meditate. Korbod took the opportunity to gaze across the flames to where
Sharon was sleeping. His smile widened perceptibly.
Dawn finally broke, and the men of the camp began to prepare for the trip
again. Sharon barely had time to gulp down a meager breakfast of bread and
honey before she was hurried back to the trail. The sky was a gloomy grey
overcast which made the dull grey and brown of the rocks around them seem
even more depressing. Around mid-morning the trail suddenly widened to a
large, flat paved roadway that wound through the foot hills. The little
group was able to make much faster progress now on the smooth surface. In
no time at all they came to the base of a steep mountain that thrust up out
of the rocky plateau like a giant phallus. The paved roadway ended in a
wide stairway that ascended about ten feet to a flat pavilion butting up
against the mountain's side.
"Behold, the steps of Turin Kareem," Korbod said. He and his men began to
busy themselves in preparing a camp at the foot of the stairway.
"This is where I leave you," Akuta said to Sharon.
"Please," she pleaded. "I want to go along."
"No," he said firmly, then gave her a tight hug. "Thank you for being my
friend," he said. "I shall return as soon as I find the secret I seek.
Then we may go back to Esbereth and live in happiness as before."
"We go no further," Korbod said as his men dragged Pardoo to the base of
the steps. "Ye have the food and water I give ye. Now take my sword as
well. Ye may have need of weapons." The little man held out his short
sword in its scabbard to Akuta. The fairy took the jeweled weapon and
strapped it on. "Fare ye well," Korbod said. "We shall await ye return
for a time. If ye return not soon, ye may find us in our village." With
that he nodded. At the signal his men cut the bonds that had held Pardoo
as a prisoner, and they gave him a shove. Slowly the two men mounted the
stairs.
At the top of the steps was a smooth, square, wide expanse of unbroken
stone. On one side was the mountain. On two other sides the plateau
dropped down to a deep gorge. The fourth side was the stairway. "What
now, reversal?" Pardoo asked. "I see no gateway."
"It must be here," Akuta said, fear slowly rising in him. Perhaps it had
all been a wild goose chase after all. He crossed the pavilion to the rock
wall of the mountain. "It must be here," he repeated as he ran his hands
across the stone.
"You fool," Pardoo taunted. "They sealed up that cavern long ago. The
little people have tricked you in bringing me here. There may have been a
doorway once, but no more." He slowly started to cross the flat, stone
floor to where Akuta stood, running his hands again and again over the
wall. "What asked they of you?" the westerner continued. "That you slay
me? They only brought you here so you would kill me and then they will
kill you. And they have your woman, the one female willing to bed a
man-loving reversal like you," he continued.
Akuta turned, his anger flaring up. His sword hand reached instinctively
to the jeweled hilt.
Pardoo took another step toward him, and then suddenly disappeared. The
stone floor beneath his feet gave way with a thunderous groan and the fairy
plunged down into a hole that now gaped in the center of the floor. Akuta
ran to the edge and looked down into the gloom. The westerner was lying on
his back, covered with dirt and debris from the cave in, but most of the
larger rocks had missed the spot where he landed. The sand covered floor
of the interior was ten feet below. Akuta took one last look at the tall
mountain beside him, reaching up into the grey cloud cover, and then he
dropped lightly down into the hole. |
Flood
My high school economics teacher told us that even if you get a “free” lunch, you are spending time and consuming finite resources. What else could you be doing with that time? It’s possible that more value could be gained by eating in different company. Another option would be to work straight through lunch while knocking back a (gasp!) peanut butter & jelly sandwich.
The cost of going to work on any given day is not the cost of gas + your hourly pay. It is both of those plus the cost of not spending your time and energy starting a company, furthering your education, playing with your children, eradicating world hunger… and the list goes on.
Recently, we’ve all been talking about the trade off between flooding some parts of the country to avoid flooding more populated areas and major cities. The rivers are swollen from heavy winter snow and spring rains. If we do nothing, everyone runs the risk of major flooding. If we flood less populated areas, the pressure is reduced and potentially thousands of lives are saved.
This is the situation currently in South Louisiana
Corps of Engineers map of possible flood levels
The Morganza Floodway, if opened, will displace more than 22,000 residents, seriously harming homes, crops, and a region’s way of life. Without opening the floodway, more than a million residents may be displaced throughout Greater New Orleans and Baton Rouge.
Even if levees hold back the floods, the Coast Guard noted they will likely close the river to vessels if it rises above 18 feet. According to Gary Lagrange of the Port of New Orleans, the national economic impact of closing the port is $295 million per day, and grows exponentially after the fourth day.
The bottom line: damage will be done
Engineers work out exact risk percentages for each possible scenario. Financial economists look at the same scenarios and assign the expected cost of damages and the overall economic impact.
In a perfectly rational and objective world, the decision would be easy. The problem arises when we have incomplete data, and no way to measure certain losses. What is the monetary value of culture? What kind of emotional damage will be done? With a region still physically and mentally scarred from several major disasters, those costs are hard to pinpoint.
So instead of being quick to judge, let’s put ourselves in the shoes of the decision-maker. As a casual observer it can seem like the “right” decision should be obvious. Presented with a large amount of imperfect information, lives at stake, and the pressure of the masses, I imagine it might be a little harder to actually pull the trigger. |
M.SRB Bench Motor with C.EMH-2 Dial Control
Use Product Options Menu to Select Power Cord Plug Option: -2 for US Plug (M.SRB-EMH-2), -21 for UK Plug (M.SRB-EMH-21), -22 for Continental European (M.SRB-EMH-22) or -26 for Australian Plug (M.SRB-EMH-26).
Here a bench style version of Foredom's 1/6 HP Series SR motor comes mounted in a cast-iron base for easy placement anywhere on the workbench. It is teamed up with the C.EMH-2 table top dial speed control in plastic housing.
This is a 230 Volt motor-control combination with a Two Year Limited Warranty.
M.SRB Motor Description:
Foredom's 1/6 HP, universal, flexible shaft machine runs in forward and reverse rotation at speeds up to 18,000 RPM. The M.SRB combines the most important features our customers expect - power, reversibility, reliability, and versatility - all in one motor. It comes equipped with our standard 39" long key tip shafting for connecting to any of Foredom's interchangeable, quick disconnect handpieces.
C.EMH-2 Speed Control Description:
This table top speed control is constructed of heavy duty plastic with durable solid state electronics. It has a dial control for precise speed settings, as well as good repeatability of previous settings. For use with 230 Volt Series SR, SRB, SRH and SRBH motors.
5" long, 5-3/4" wide, 2-5/8" high, ship wt-2 lbs./1 kg. It is interchangeable with Foredom's C.FCH-2 and C.SCH-2 controls. Can also be used with discontinued 230 volt Series H and HB motors.
Motor Details:
The 1/6 hp, ball bearing Series SR has 33% more power than our older 1/8 hp motors, and 66% more than our original 1/10 hp models. The added power helps to reduce stalling or slowing down under normal workloads.
Advantages of Running in Reverse:
Left handed users have more control of the cutting tool
Reverse helps to keep dust and other debris flying away from right handed users
Alternating motor direction helps to extend the life of certain abrasives
Reverse helps with accomplishing symmetrical grinding and carving techniques
Reverse makes it easier to back out stuck drill bits
Alternating motor direction makes it easier and faster to polish metals |
Postal Address:
Contact Us
Analyzing Experimental Data
by Donald J. Wheeler
This book extends and updates a simple, proven, and effective approach to the analysis of experimental data. With the simplicity of computation generally associated with average and range charts and the explanatory power of a graphic technique, the Analysis of Means techniques presented here will expedite your analysis and facilitate the interpretation of your results. With tables that are twice the size of any previously published this book is an essential tool for practitioners.
Techniques covered include the Analysis of Means; the Analysis of Ranges; the Analysis of Main Effects; the Analysis of Mean Ranges; ANOM using standard deviation statistics, ANOM using the root mean square within, ANOM with fractional factorial designs, and the differences between ANOM and ANOVA. While this book includes material given in my earlier Range Based Analysis of Means, it extends that material, expands the tables, and provides newer, more exact scaling factors.
188 pages, 59 figures, 28 data tables, 25 reference tables, softcover
ISBN 978-0-9445320-73-9
$49.00
Customer Comments:
Your books on SPC and Quality are fantastic. They are concise and to the point. |
WIOX
WIOX (91.3 FM) is a community radio station licensed to Roxbury, New York and serves Delaware County and the Catskill Mountains region.
History
Originally licensed to the Town of Roxbury, WIOX received its initial construction permit from the Federal Communications Commission on May 7, 2008. The new station was assigned the WIOX call sign by the FCC on May 14, 2008. The station received its license to cover from the FCC on September 23, 2010. In 2014, the WSKG Public Telecommunications Council became the licensee of WIOX.
See also
WSKG-FM
WSQX-FM
References
External links
IOX
Category:Radio stations established in 2010
Category:2010 establishments in New York (state) |
Introduction {#Sec1}
============
Contemporary cognitive science increasingly reveals that the traditional way of depicting the unconscious as a dimension deeply separated from and even opposed to consciousness is misleading and overly simplistic \[[@CR1]\]. Unawareness[1](#Fn1){ref-type="fn"} is far more than a passive repository of information: a lot of monitory work (i.e., active exploration of the environment) takes place at the unaware level, which shows remarkable similarities with awareness as well as a deep connection with it. From a neurophysiological point of view, awareness (consciousness) is what psychoanalysis claimed a century earlier: merely "the tip of the mental iceberg" \[[@CR2]\](p. 17).
We explore the ethical relevance of the unconscious and its possible clinical implications for the assessment and care of patients with disorders of consciousness (DOCs), e.g. coma, vegetative state/unresponsive wakefulness syndrome, minimally conscious state \[[@CR3]--[@CR5]\]. Our aim is to show that not only awareness but also unawareness should be taken into account in the ethical analyses of DOCs. Two arguments are provided to support this view: one strong and one weak. The strong argument says that unawareness is ethically relevant because it has (at least in part) those characteristics of awareness that are usually considered critical in contemporary ethical debates about DOCs. In other words, if consciousness is ethically relevant by virtue of certain characteristics, and the unconscious shares those characteristics, then the unconscious is *ipso facto* ethically relevant.
The weak argument says that if consciousness is considered ethically relevant for the assessment of a patient with DOCs, and the unconscious is (at least in part) the result of consciousness and also heavily affects the development of consciousness (i.e., there is a relation of mutual influence between the two \[[@CR6]\] (p. 112--114, cf. further below), then the unconscious is also ethically relevant.
The term 'ethical relevance' is here used in the same sense that Goodpaster uses the term 'moral considerability' (i.e., deserving moral consideration) as distinguished from moral significance (i.e., valuable, characterized by a specific moral value) \[[@CR7]\]. Qualifying the unconscious as ethically relevant does accordingly not imply that it is also ethically valuable.
Both the abovementioned arguments stress the need to include unawareness in the ethical analysis of patients with DOCs. We suggest that the actual default way of setting ethical issues arising from DOCs (i.e., checking whether patients retains some aware abilities) is limited, and that this limitation is ethically and clinically questionable.
Background {#Sec2}
==========
Recent descriptions of the unconscious {#Sec3}
--------------------------------------
Recent neuroscientific evidence shows that our brain is able to do a lot of things without requiring any actual aware experience by the subject. For instance, the brain is able to, without awareness, correlate information, associate meanings, reason in a very fast way, develop complex computations, perform sophisticated mathematical operations, selectively focus on information, develop complex inferences \[[@CR8]\], and even perceive the affective value of stimuli and to influence motivation, value judgment and goal-directed behaviour \[[@CR9]\].
Examples of activities traditionally associated with aware consciousness but showed to be feasible also at unaware levels are reading and doing arithmetic \[[@CR10]\]. Using a technique called Continuous Flash Suppression (CFS), which consists of the presentation of a target stimulus to one eye and the simultaneous presentation of rapidly changing masks to the other eye, allowing subliminal presentations that last seconds, Sklar and colleagues have shown that even quite sophisticated human cultural products, such as semantically processing a number of words and solving arithmetic equations, can take place outside explicit awareness. Participants were presented with semantically coherent and semantically non-coherent expressions. The latter appeared to awareness before the former, showing the ability of the brain to semantically process them outside explicit awareness.
The amount of operations that the brain is able to perform at the unaware level is impressive. Summarizing empirical evidence, Hassin is quite radical in concluding that the unconscious is able to perform every fundamental high-level cognitive function performed by consciousness (e.g., cognitive control, pursuit of goals, information broadcasting, reasoning) \[[@CR11]\]. Hassin's conclusions are in line with other studies and related interpretations \[[@CR12], [@CR13]\], within a new scientific approach that has been developed, called "the new unconscious" \[[@CR14]\].
Furthermore, on the basis of extensive empirical evidence, Hassin outlines that this large amount of unaware operations that the brain is able to perform is not disconnected from but has an important impact on the aware operations. For instance, several findings show that subliminal information can drive executive functions \[[@CR15]\] and that subliminal priming of stimuli changes how we feel about them when we are actually aware of them \[[@CR16]\]. Other examples confirm the fact that the unconscious plays a significant role in shaping our conscious experiences, like attributions of agency \[[@CR17]\], actual choice \[[@CR18]\], and even political attitudes \[[@CR19]\].
Thus we can legitimately conclude that our aware conscious experience is delayed and reconstructed: it depends on preceding processes taking place without awareness. The brain's relation with the external environment is not limited to conscious awareness (if that were the case, we could not survive, since our reactions would be far too slow and delayed), and is even in part independent of it.
Moreover, stimuli coming from the external can be evaluated (i.e., assessed in relation to organic developmental needs) at both conscious and unconscious levels. In particular, the unaware evaluation of the stimuli is not free of emotional dimensions: the affective value of the information is largely processed outside our awareness \[[@CR9]\], so that the unconscious is not emotionally-free or emotionally-neutral. Even if not universally accepted \[[@CR20]\], the concept of unconscious emotion has gained an increasing scientific legitimacy, both in the sense of unawareness of the stimuli eliciting the emotion and of unawareness of the emotion itself \[[@CR21]--[@CR25]\].
In short, the modern sciences of mind, including cognitive science, neuroscience, psychology and philosophy, increasingly reveal the complexity of the unconscious, suggesting that even the deep neuronal distinction between conscious and unconscious levels may need to be revised: stimuli processed without awareness can activate high-level cortical regions \[[@CR9]\] (albeit without leading to the functional connectivity with the global neuronal workspace), while aware consciousness might be difficult to segregate from them \[[@CR26]\].
Results {#Sec4}
=======
Ethics of disorders of consciousness {#Sec5}
------------------------------------
In the ethical discussions about DOCs, two abilities are usually considered as central: experiencing well-being and having interests. In the dominant literature on the ethical dimensions of patients with DOCs these abilities are typically analysed in relation to the residual awareness retained \[[@CR5], [@CR27]--[@CR34]\].
Well-being {#Sec6}
----------
Well-being can broadly be understood as the positive effect related to what makes life good (according to specific standards) for the individual in question. This broad, abstract understanding of well-being need not be assigned only to specific levels or modes of consciousness: for instance, we can meaningfully attribute a so defined well-being also to non-human animals. The only condition for well-being broadly considered is the ability to experience its 'positiveness'.
Experiencing positiveness is basically an emotional process. As mentioned before, cognitive science provides increasing evidence of unconscious emotions. Particularly, there are some basic emotions (e.g., anger, fear, happiness, disgust) that have a long phylogenetic root and are likely to occur also at a completely unaware level \[[@CR22]\]. In other words, the negative or positive reactions to stimuli (i.e., affective reactions) can occur at the unaware level. As some empirical tests show, subjects exposed to subliminal emotional stimuli can be unaware of both the stimuli and the associated positive or negative emotions, even though their behaviour is influenced by them \[[@CR21]\].
If the only condition for well-being broadly considered is the ability to experience positive emotions, and these emotions can be experienced at the unaware level, then it is plausible to talk about an unconscious well-being.
The situation becomes more challenging if we try to identify what specifically constitutes the general condition of well-being: depending on the identified constituents, well-being can be related to specific levels or modes of consciousness (e.g., relegated to humans excluding other animals).
Noting that different theories of well-being (both regarding its definition and nature), e.g. hedonism, desire-theories and objectivist theories may likely have diverging views on this, that discussion is beyond the scope of the present paper since well-being broadly defined is sufficient to be ethically relevant.
Interests {#Sec7}
---------
Having an interest in a specific domain can be understood as having a stake in something that can potentially affect what makes our life good within that domain. An interest is what directly and immediately improves life from a certain point of view or within a particular domain, or greatly increases the likelihood of life improvement enabling the subject to realize some good \[[@CR28]\]. Even if there is no general consensus on the definition of a good, for the sake of the present discussion we can understand it as what is appropriate for fulfilling a particular need, which of course can be of different kinds. Thus a good is something we can benefit from.
What are the minimal capacities that an individual should have for life to be a good for her/him? Specifically analysing DOCs, Hawkins identifies two possible answers \[[@CR28]\]: 1. A life is good if the subject is able to value, or more basically if the subject is able to care. Importantly, Hawkins stresses that caring has no need for cognitive commitment, i.e. for high-level cognitive activities: it requires being able to distinguish something, track it for a while, recognize it over time, and have certain emotional dispositions *vis-à-vis* something. 2. A life is good if the subject has the capacity for relationship with others, i.e. for meaningfully interacting with other people. In her ethical discussion about the best interests of patients with DOCs, Hawkins analyses these two capacities only in relation to awareness without taking into account the possibility that unawareness might also play a role in the adequate understanding of those capacities.
As said above, the brain can be described as evaluative also in its unconscious operations, in the sense that it is able to distinguish relevant inputs, to track and recognize them, and to emotionally react to them in a relevant way. Sensitivity to reward signals is a fundamental element in the learning process, both consciously and unconsciously \[[@CR35]\]. Moreover, the unconscious brain is able to interact with its surroundings in a meaningful way and to produce meaningful information processing of stimuli coming from the external environment, including other people \[[@CR36]\].
This suggests that unawareness may (at least partly) fulfil both conditions identified by Hawkins for life to be a good for a subject, thus making the unconscious ethically relevant. It is, of course, a different kind of good than what a paradigm cognitive subject with a healthy brain can experience: while we affirm the ethical relevance of unawareness, we leave open the question of its potential ethical value (for example: is the good that an unaware patient with DOC can get from life sufficient for ethically requiring that the patient be kept alive?). We consider this kind of practical and clinical questions important, yet the present paper is not directly aimed at answering them, but rather at suggesting a possible framework allowing a more comprehensive reflection about them.
Focusing specifically on phenomenal consciousness and its relevance for DOCs, Kahane and Savulescu outline that the value of phenomenal consciousness is grounded in the moral significance of interests, which, analogously to well-being, can include hedonic, desiderative and objective elements \[[@CR30]\]. Hedonic interests relate to states of suffering or enjoyment; desiderative interests relate to desires´ satisfaction; objective interests relate to having a meaningful existence by possessing relevant goods (e.g., relationship, achievement, knowledge). The authors identify having aware phenomenal consciousness as a necessary condition for all three kinds of interests, because without an aware subjectivity there is no point of view to which such interests can be ascribed \[[@CR30], [@CR31]\]. According to this view aware phenomenal consciousness makes a moral difference through its tie to interests, which in turn always require awareness (actual or at some point in time, since at least some interests can extend beyond the extinction of consciousness, as they can extend beyond the life of the beholder \[[@CR37]\] ). This definition of interests as necessarily related to awareness is at the root of the "best interests argument" generally employed in ethical discussions about clinical treatment of patients unable to express their preferences, like patients with DOCs \[[@CR38]\].
We agree that subjectivity is needed for ascribing interest, but on the basis of recent findings about the unconscious we suggest that awareness is not necessary even if it is sufficient. Rather, in the light of those findings, unawareness is necessary and also sufficient for subjectivity. If, as suggested by Hassin \[[@CR11]\], the ability to act unconsciously is something that is developed by practice (i.e., the unconscious is partly shaped by consciousness), then we can reasonably conclude that not only awareness but also unawareness is something highly subjective, in the sense that it is developed in a peculiar and subjective way. We are not all unaware in the same way: there is a "what it is like" to be an unaware subject (e.g., my unconscious could be more emotionally prone to a particular kind of music than yours, so that our brains will react differently to the same music we listen to). Now, if it is reasonable to say that we may have interests also at the unaware level, these interests should be included in the ethical discussion, particularly about patients with DOCs.
Levy says that when approaching patients with DOCs in addition to asking ´is the patient conscious?´ we need to ask ´how is the patient conscious?´ \[[@CR32]\]. We agree with this, but disagree with the tendency to place the questions within the limits of awareness ignoring the complexity of unawareness and its ethical relevance.
It is important to note that the existence and ethical relevance of interests at the level of unawareness does not imply that all life is worth living. The kind of good a wholly unaware patient is able to enjoy is not necessarily sufficient for her/his life to be worth living. The determination of when life is worth living depends on numerous other ethical and existential considerations that may vary greatly between individuals, and on other, notably social-legal factors that are beyond our scope here to consider.
Discussion {#Sec8}
==========
We suggest that the ethical relevance of the unconscious can legitimately be inferred from the evidence summarized above about the considerable abilities qualifying the unconscious, which some do not hesitate to describe as comparable to conscious abilities. Two arguments have been provided to support this inference. The first was described as strong because it is based on the assumption that unconscious abilities are comparable to conscious abilities:
*If consciousness is ethically relevant because of what it can enable, and the unconscious may enable comparable things, then the unconscious is also ethically relevant*.
Judging by the evidence summarized above, this is plausible, but remains a debated issue in scientific literature \[[@CR39]--[@CR41]\]. For instance, there is lively debate about the possibility of shifting from subliminal (i.e., unconscious) perception to unconscious cognition (i.e., unawareness of processes and their effects). While Hassin considers unconscious perception to be a subset of the more general and complex phenomenon of unconscious cognition \[[@CR11]\], Hesselmann and Moors find this position problematic \[[@CR40]\].
A weaker (less controversial) argument is the following:
*If consciousness is ethically relevant, and the unconscious is (at least in part) the result of consciousness, then the unconscious is also ethically relevant*. Or conversely: *if consciousness is ethically relevant, and the unconscious plays an important role in shaping consciousness, then the unconscious is also ethically relevant.*
In other words: the mutual influence of the conscious and unconscious realms yields ethical relevance to them both. In this argument, the focus is not primarily on how similar consciousness and the unconscious are, but rather on their mutual relationship, which is increasingly becoming an object of scientific studies.
Implications of the ethical relevance of the unconscious for clinical practice {#Sec9}
------------------------------------------------------------------------------
When research on consciousness and the unconscious deepen our understanding, this may have important clinical implications \[[@CR42], [@CR43]\]. Enlarging the focus of the ethical analysis of DOCs to include unconscious states has potential clinical implications, to which we would like to draw attention. Acknowledging the ethical relevance of the unconscious may, notably, call for further development and refinement of:diagnostics (including also the need for nosological revision)assessments and interpretations of subjective states (trying to identify unconscious, e.g. emotional, states)adaptations of living conditions (taking into account the possibility of unconscious positive and negative conditions)therapeutic interventions.
If the unconscious is ethically relevant, then diagnostic strategies for the assessment of residual unconscious activities should arguably be implemented. Moreover, the interpretation of subjective states, as well as the adaptation of living conditions, should acknowledge that negative and positive emotions are not necessarily aware. To illustrate, new stimulations of patients' unconscious perception might be implemented in order to increase their unconscious well-being (e.g., through tactile, olfactory or acoustic inputs), possibly involving those who are close to the patient. Finally, therapeutic interventions on patients with DOCs would be incomplete if they do not involve their unaware level.
End-of-life clinical decisions could be affected by including the unconscious in the ethical assessment. The end-of-life case clearly illustrates that the ethical relevance of the unconscious per se is neutral with regard to specific clinical decisions. One person could consider it right to withdraw life-sustaining care because of the high risk of conscious and/or unconscious negative emotions, while another would consider such withdrawal unjust because of the possibility of residual positive conscious and/or unconscious emotions.
This list of clinical situations where the ethical relevance of the unconscious might have an impact is by no means exhaustive. The point we are making is that acknowledging the ethical relevance of the unconscious makes the task of gaining appropriate clinical assessment and treatment of patients with DOCs even more complex and challenging. We are aware that ideal conditions are not always attainable: there are priorities in healthcare and clinicians need to draw lines as clearly as possible to settle issues arising from their practice. Nevertheless, this should not prevent questions from being raised: reality's limitations do not constrain theoretical investigations. Even if the actual standards of clinical care of patients with DOCs are the highest possible today, we should be aware that more could be done. And only by raising questions and doubts can we identify the goals to achieve in a close or more distant future.
Conclusion {#Sec10}
==========
The wedge between consciousness and the unconscious, awareness and unawareness, with the resulting clinical and ethical primacy usually attributed to the former does not appear to be in line with contemporary science that reveals the complexity of our unaware mental life and how much it affects our awareness. In light of this knowledge, the exclusive functional and ethical primacy of awareness over unawareness can only be justified by a biased perspective. For this reason, we recommend assessing both aware and unaware abilities in patients with DOCs, since both are ethically relevant. For instance, it could be that the unconscious manifests a particular attitude to enjoy a specific input (e.g., tactile or auditory), and that this should be considered in order to improve the positive emotions the subjects may retain even at the unaware level while reducing the unpleasant ones.
A focus on these aspects should trigger a major change in the ethical discussion about DOCs, which has hitherto been limited to an analysis of residual awareness and its ethical significance. Within this traditional approach, different views have been elaborated concerning the necessary and sufficient conditions for patients with DOCs to be considered conscious in a morally relevant sense, distinguishing different aspects of consciousness and their respective ethical value. Accordingly, the conditions considered critical for the ethical evaluation of patients with DOCs (e.g., well-being and interests) are qualified and assessed only in reference to such residual awareness only. In light of the above discussion, we contest this approach as limited.
It is true that our analysis does not result in concrete suggestions for clinical practice but we consider it important to acknowledge the limitation of the actual default approach to patients with DOCs, stressing the need for a more comprehensive picture of residual mental activity.
In what follows, the unconscious and unawareness, as well as consciousness and awareness are used as synonyms.
Special thanks to Arleen Salles and the participants to the CRB seminars for important comments on previous drafts of the present paper.
Funding {#FPar1}
=======
The research is supported by funding from the European Union's Horizon 2020 research and innovation program under grant agreement 720,270 (HBP SGA1).
Availability of data and materials {#FPar2}
==================================
Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.
MF is first and corresponding author. MF wrote the manuscript with important inputs from KE. KE reviewed the manuscript critically. Both MF and KE read and approved the final manuscript.
Ethics approval and consent to participate {#FPar3}
==========================================
This manuscript does not report data collected from humans or animals.
Consent for publication {#FPar4}
=======================
Not applicable.
Competing interests {#FPar5}
===================
The authors declare that they have no competing interests.
Publisher's Note {#FPar6}
================
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
|
Recent concepts in bile formation and cholestasis.
Progress has recently been made in the understanding of normal bile secretion mechanisms. The membrane carriers for bile acids have been identified and new insights into intracellular transport mechanisms have been obtained. In particular, characterization of a vesicular pathway involving the Golgi apparatus is well under way. Hypercholeretic bile acids, such as ursodeoxycholic acid, have been discovered. Their choleretic effect is far greater than that of physiological bile acids and they stimulate bicarbonate secretion. Testable hypotheses to explain their hypercholeretic effect have been proposed, in particular the chole-hepatic shunt hypothesis. Several mechanisms capable of inducing cholestasis have been identified: a) inhibition of Na+, K(+)-ATPase; b) increased permeability of the paracellular pathway leading to leakage of bile constituents back into plasma; c) microtubule or microfilament dysfunction; d) increased cytosolic free calcium concentration due to permeabilization of the endoplasmic reticulum calcium stores. It is not yet possible, in a given case, to establish which of these mechanisms is predominant. Several may operate. A better knowledge of the mechanisms involved may lead to improved treatment. |
using System;
using System.Collections;
using Newtonsoft.Json;
namespace OmniSharp.Extensions.JsonRpc.Serialization.Converters
{
public class AggregateConverter<T> : JsonConverter<AggregateResponse<T>> where T : IEnumerable
{
public override void WriteJson(JsonWriter writer, AggregateResponse<T> value, JsonSerializer serializer)
{
writer.WriteStartArray();
foreach (var item in value.Items)
{
foreach (var v in item)
{
serializer.Serialize(writer, v);
}
}
writer.WriteEndArray();
}
public override bool CanRead => false;
public override AggregateResponse<T> ReadJson(JsonReader reader, Type objectType, AggregateResponse<T> existingValue, bool hasExistingValue, JsonSerializer serializer) =>
throw new NotImplementedException();
}
}
|
How Much Money Do You Need To Make To Own A Home In North Dakota?
The American Dream, owning a home. For most people and families, owning a home is their goal in life.
From my observations, and I've traveled the country, my career has taken me to many states, and I can say, just from my viewpoint, living in North Dakota is one of the most expensive states I have lived in.
We turn to GoBankingRates.com for a comparison from every state to determine the average annual salary you must earn to own a home in North Dakota.
GBR reviewed the estimated salary needed to purchase a home in every state based on home prices and mortgage rates in every state.
According to the information listed above you would need an average salary of at least $54,480. The average monthly mortgage payment is $1,362 with a monthly salary of $4,540. |
Ice cream service at the new Humphry Slocombe shop at the SF Ferry Building.Photo credit: Sean Vahey, Humphry Slocombe
With so many hot new food projects happening it can be hard to keep track of them all. Here are the fresh updates on folks we've profiled in the past: the Humphry Slocombe team, as well as Dave McLean of Magnolia Brewery fame.
Fans of the wildly popular artisan Humphry Slocombe ice cream store, from Sean Vahey and Jake Godby, are able to now enjoy scoop action at a new Ferry Building outpost (Ferry Plaza Farmers Market at The Embarcadero), which opened earlier this month. We caught up with Vahey to find out more. His comments have been edited for content and clarity.
Vahey: The Ferry Building approached us and we're honored to be asked. We'd been doing the Tuesday market outside and have a lot of great relationships with folks in the building like Blue Bottle coffee--they serve our ice cream with their affogato. There's also Far West Fungi, who helped us do our candy cap popsicles. Some say they taste like waffles, or pancakes, I say “Who cares?” It's that maple-y, "Who knew mushrooms could taste like that?" thing.
Other relationships include McEvoy Ranch Olive Oil, who has our pints. And then there's Boccalone Salumeria who worked on our lard caramels. Since we're involved with so many people at the Ferry Building, it's a good fit for us.
Bay Area Bites: Tell us about what folks can look forward to now that you're open.
Sponsored
Vahey: The first thing people ask is “You will have Secret Breakfast, right?” I love the look on everyone's face—they have their nose down and this sort of panicked look. Yes, we will have Secret Breakfast, and very similar flavors as our Mission shop: Tahitian Vanilla, Blue Bottle Vietnamese coffee and Secret Breakfast will always be offered so people can get their fix.
Some flavors will change and there's no rhyme or reason to it, like in the Mission.
We are most proud of the space--Jane Martin at Shift Design is our Mission neighbor and that's how we got to know her. She's also a friend and customer. Her idea on how to change the space really went along with what we were thinking -- it was darker and we wanted it be more interactive. We fought her on some things -- the open up wall, that continues the space out into the breezeway, makes the store appear bigger and more welcoming. We'll have stand up tables, because we want customers to stay and hang out.
Humphry Slocombe ingredients. Photo: Sean Vahey, Humphry Slocombe
Bay Area Bites: What is the toughest part about opening?Vahey: Probably the transition of the space, which took a lot longer than we thought. We demolished the whole space, and made it completely our own.
Bay Area Bites: What do you have planned for the future?Vahey: We want to get the Ferry Building spot up and running. We do all of our production out of the Mission shop. It's almost 24 hour production at this point. We have a great kitchen manager and bought a new bigger machine. I do see us growing out of that space.
We're so lucky to be working with Virgin America, which will serve our Butter By Moodlight flavor on eastbound flights. It's a creamy combination of brown butter and blueberry glaze and was voted in based on a people's choice contest on Twitter.
Bay Area Bites: What’s your guilty food pleasure?
Vahey: Salt and vinegar chips, and fries--anything that has salt and vinegar in front of it. I can't believe I just said that.
The wait for a new brewery and BBQ spot—called Smokestack (2505 3rd St. at 22nd St.) -- from Dave McLean has been eagerly anticipated and means a new place to eat and drink in the increasingly popular Dogpatch neighborhood. The brewery is reportedly up and running and played host to SF Beer Week and Strong Beer Month happenings--but it's not yet open for business. The targeted opening remains uncertain but is said to be as soon as this month. McLean filled us in on what to expect; his comments have been edited for content and clarity.
McLean: It’s a BBQ place, Smokestack, in the front of our new production brewery in the Dogpatch. Like brewing, BBQ is a time-honored craft, full of tradition and regional variation but ultimately an opportunity for creative expression in the hands of people who love it and dedicate themselves to it. For us, it’s a great extension of many of our longtime culinary values, especially sustainable sourcing, in-house butchery and making everything from scratch.
Beer and BBQ just go so well together. So do bourbon and BBQ, and Smokestack has an extensive whiskey selection, focusing on American producers, and a somewhat whiskey-centric cocktail menu developed by bar manager, Eric Quilty. We forged an exciting partnership with Dennis Lee to man the smokers and bring our BBQ vision to life in a unique and expressive way. I’ve always loved his food and it’s exciting to be working with him. Smokestack brings together a great team of people, along with products and ideas that we love, in a special place that we hope exudes both warm hospitality and a nod to the neighborhood’s industrial past. Like the original Magnolia Pub as well as Alembic, we hope it further highlights the delicious interconnectedness of beer and brewing with all manner of food and other beverages.
Bay Area Bites: For food, what can folks look forward to?
McLean: The heart of the kitchen is in its smokers. In fact, everything in the kitchen is wood-fired. It’s an order by the pound at the counter place so diners will get to try a lot of different items, especially if they bring a hungry friend or two. The selection will vary based on availability but look for smoked pork belly, beef brisket and house-made sausages like Thai chili cheddar pork. Sides include burnt ends heirloom beans, collard greens with Kölsch, miso and chili, and Namu’s signature old family recipe kimchee.
Bay Area Bites: And share about the beers of course!
McLean: We’ve brewed over 75 different beers since Magnolia opened in 1997 and our new brewery in the Dogpatch allows us to experiment even more. The beer selection will rotate often, as it does at the original Haight pub, but we have a core lineup that includes our Kalifornia Kölsch, Proving Ground IPA, and Blue Bell Bitter, which is our ode to the great heirloom barley from the UK, Maris Otter. Alongside those and others, there will be Magnolia beers at Smokestack that are only available at our own two pubs.
Bay Area Bites: What is the toughest part about opening?
Sponsored
McLean: It’s the classic adage — everything takes a lot longer and costs a lot more than planned, no matter how well you plan. I think it might be a little different every time, in terms of which variables are the toughest to figure out. It has its challenging moments but in the end love for what we do keeps enthusiasm high and there’s plenty of energy to weather the hurdles and delays.
Which of these new spots are you excited to try? What other openings are on your list? |
No Data Corruption & Data Integrity
Discover what No Data Corruption & Data Integrity is and how it can be beneficial for the files within your website hosting account.
Data corruption is the damage of data caused by various hardware or software failures. When a file is damaged, it will no longer work accurately, so an application will not start or shall give errors, a text file can be partially or entirely unreadable, an archive will be impossible to open and then unpack, etc. Silent data corruption is the process of information getting damaged without any acknowledgement by the system or an administrator, that makes it a significant problem for web hosting servers as failures are very likely to occur on larger hard disks where significant volumes of info are located. If a drive is part of a RAID and the information on it is duplicated on other drives for redundancy, it is more than likely that the bad file will be treated as an ordinary one and it'll be duplicated on all drives, making the damage permanent. A lot of the file systems that run on web servers today often are not able to locate corrupted files right away or they need time-consuming system checks through which the server is not operational.
The integrity of the data that you upload to your new cloud hosting account will be ensured by the ZFS file system which we employ on our cloud platform. The vast majority of internet hosting providers, like our firm, use multiple hard drives to store content and considering that the drives work in a RAID, the exact same information is synchronized between the drives at all times. When a file on a drive gets damaged for whatever reason, however, it is likely that it will be copied on the other drives because other file systems do not include special checks for this. Unlike them, ZFS works with a digital fingerprint, or a checksum, for every single file. In case a file gets corrupted, its checksum will not match what ZFS has as a record for it, which means that the damaged copy shall be substituted with a good one from another disk drive. Due to the fact that this happens right away, there's no risk for any of your files to ever be corrupted.
Your semi-dedicated hosting account will be protected against silent data corruption as all of our storage servers work with the reliable ZFS file system. What makes the latter unique is that it employs checksums, or digital identifiers, to guarantee the integrity of each and every file. When you upload content to your account, it will be placed on a couple of redundant drives operating in a RAID i.e. the files shall be the same on all disks. All the copies of a specific file will feature the same checksum on all drives and ZFS will compare the checksums of the copies quickly, so if it discovers a mismatch, which would indicate that one of the copies is damaged, it'll replace that file with a healthy copy from one of the other disks. Even if there is an unforeseen power failure, the data on the servers will not get corrupted and there will not be any need for a time-consuming system check that other file systems perform after some malfunction, extending the time needed for the server to return online. ZFS is the file system that can really protect your content from silent data corruption. |
Michael Jackson left the courthouse here Monday just as he entered it, a free but somber man waving to fans and blowing a kiss, after a jury rejected charges that he repeatedly molested a 13-year-old boy, gave him alcohol and held him and his family captive at Neverland ranch.
The jury of eight women and four men concluded that the evidence was not sufficient beyond any reasonable doubt that Jackson was a predatory child molester who groomed his alleged victim with liquor and porn and then groped him. The jurors found him not guilty on all 10 counts.
AD
AD
“The evidence said it all,” said one of the jurors, a middle-aged mother. “We had a closet full of evidence that made us come back to the same thing — that there wasn’t enough” to convict. “Things didn’t add up,” she said.
In comments after the verdict, the jurors did not call Jackson’s young accuser a liar, but the foreman described the teen as programmed by his mother.
It was a stinging rebuke against the case brought by the Santa Barbara County prosecutors and sheriff’s investigators, but it was a virtual moment of rebirth for the pop singer, who had faced the possibility of leaving the courthouse in a sheriff’s van on his way to jail or prison for as long as 18 years if he had been found guilty on all charges.
AD
Jackson returned to his ranch, a 2,600-acre estate in the nearby foothills, as fans and the media trailed behind and camped out at its gates.
AD
What Jackson will do next is unknown. The taint of the charges may linger, but his attorneys and entourage have repeatedly described the case against him as an attempt to shake down the singer for money by a family of, according to Jackson’s defense attorney, “con artists, actors and liars.”
The sensational 15-week trial ended in early afternoon as the court clerk read the verdicts and repeatedly stated that the jury found the 46-year-old Jackson “not guilty.”
In the courtroom, fans openly wept, and so did several of the jurors, who later described the scene as filled with emotion and a release of pent-up tensions. Jackson's mother wrapped her arms around Tito, one of her sons. The prosecutors leaned back, as if stunned.
AD
Throughout, Jackson remained seated and still, as he has through the entire trial, and only toward the end did he raise a tissue to his whitened face and dab at his eyes. Afterward, he hugged his defense attorneys and left the courthouse in one of the entourage’s four black SUVs parked outside, surrounded by his family and bodyguards, one holding the now trademark black umbrella above the entertainer’s head.
AD
Outside, the fans erupted in cheers, screaming, “We love you Michael,” and jumping excitedly. One woman released a white dove each time a not-guilty verdict was announced, and others let balloons sail aloft in the warm breeze.
Jackson’s lead defense attorney, the silver-maned Thomas Mesereau Jr., walked back inside after Jackson’s retinue headed back to Neverland. Mesereau beamed, and said simply, “Justice has been served.”
AD
In his remarks after the verdict, a glum Santa Barbara District Attorney Tom Sneddon said, “Obviously we’re disappointed in the verdict,” but went on to add that “we did the right thing” in pursuing Jackson. “We thought we had a good case.” He denied — again — that he had a vendetta to pursue against the pop star.
Sneddon was asked in a news conference after the verdicts whether he believed a child molester just went free.
AD
“No comment,” snapped the prosecutor, who had investigated Jackson on previous allegations of molestation in 1993 and 1994. That accuser refused to cooperate after settling a civil case against Jackson in which he and his family were given a reported $20 million by the entertainer.
AD
The media and most legal analysts following the case were divided over whether Jackson would be found guilty. So was Sneddon, who said he had “no inkling” which way the case would go when Santa Barbara County Superior Court Judge Rodney S. Melville announced that the jury had reached a verdict around 12:30 p.m. Pacific time Monday, after seven days and about 32 hours — not including breaks — of deliberations.
In the news conference in the courtroom after the verdict, the jurors (who were identified only by their assigned numbers) described a case that was weak and an accuser and his family, especially his mother, who could not be believed.
AD
The jurors said they found the mother odd, and thought it weird that while on the stand, she snapped her fingers and tried to address them directly.
AD
Sneddon suggested the jury might have been influenced by Jackson’s celebrity and the throngs of media covering the trial, but the jurors said they often forgot that Jackson was in the courtroom.
They said their deliberations were calm and confident, that they raised their hands when they wanted to speak in the jury room, and that they remained on good terms. There were “no screaming matches,” one of them said.
The criminal trial, with 140 witnesses, presented two clashing story lines.
In the defense case, Jackson was the naive and childlike victim, a creative if strange genius and a guileless pigeon, ripped off and sold out by his closest advisers and the hired help, and entrapped by the accuser and his family.
AD
AD
The prosecution countered that Jackson was an evil puppet master, the orchestrator of a complex conspiracy and a man who spent months grooming his accuser and other young victims with lavish gifts, all-expenses-paid travel and constant phone calls before he began to show them pornographic magazines, give them alcohol and then go in for the assault.
“The lion on the Serengeti doesn’t go after the strongest antelope,” Senior Deputy District Attorney Ron Zonen told jurors in closing arguments. “The predator goes after the weakest.”
The heart of the trial was the veracity of Jackson’s accuser, now 15 and in remission from cancer, and his mother, sister and younger brother. The accuser said that Jackson fondled him twice. His younger brother recalled two other incidents, witnessed while he believed his older brother was asleep. The children also accused the singer of giving them wine, vodka and “Jim Bean” bourbon to drink, and their mother said they were kept as prisoners at Neverland in the wake of a controversial documentary about the singer by Martin Bashir.
AD
AD
But during the trial, Jackson attorney Mesereau scoffed at the family’s motives, his voice dripping with derision when he called them “these little lambs,” describing the family as seasoned shakedown artists attempting to pull off “the biggest con of their careers.”
The family sued the JCPenney Co. after the boy was accused of shoplifting, saying that department store security guards roughed them up. They were awarded $152,000 in an out-of-court settlement.
Mesereau was merciless in his cross-examination of the accuser, his siblings, and especially his mother, whose time on the stand provided some of the more bizarre moments in the trial. She sparred with Mesereau and rolled her eyes and made exasperated comments to jurors about “the Germans” in Jackson’s camp who kept her prisoner, even as she was taken out for trips to a day spa to have her legs waxed.
AD
As for the children’s testimony, it was often vague. They confused dates and times. The accuser admitted lying when he denied in earlier interviews with authorities that Jackson had molested him.
The current case erupted into the public eye in the fall of 2003, when dozens of Santa Barbara Sheriff’s Department deputies descended on the singer’s ranch in the coastal wine region. Armed with search warrants, they hauled away crates of pornographic material, computers, ranch records, videotapes and other evidence after the then-13-year-old cancer patient — a Latino from a troubled family from East Los Angeles — and his family charged that the pop star groped him in February and March of 2003.
The alleged molestation — in which Jackson was accused of fondling himself and the young boy while the two were together in Jackson’s bed — occurred in the aftermath of the documentary filmed in late 2002 by British journalist Bashir, called “Living With Michael Jackson.”
The boy said in court that the molestation began when “Michael started talking to me about masturbation . . . He told me males had to masturbate . . . If I didn’t know how, he would do it for me.” After about five minutes of touching, the boy said, “I kind of felt weird and embarrassed by it, and he said it was natural.”
When the Bashir program aired on ABC in February 2003, Jackson was shown with the boy who would become his accuser, the two of them holding hands. On camera, Jackson denied having had plastic surgery — but admitted sharing his bed with children during sleepovers at Neverland.
“Why can’t you share your bed?” Jackson said. “The most loving thing to do is to share your bed with someone. It’s a beautiful thing. It’s very right. It’s very loving. Because what’s wrong with sharing a love?”
Jackson portrayed himself in the documentary as feeling like a little boy in a man’s body. “I am Peter Pan,” he told Bashir.
Previous incidents and allegations against Jackson were presented under a California law that allows a defendant’s past actions to be weighed in sex crimes. Jurors said they found some of this evidence credible, but not enough to convict. During that part of the trial, former child actor Macaulay Culkin took the stand and said he had slept with Jackson on numerous occasions but denied any abuse. He described the relationship as “comforting” and Jackson as “childlike.”
Two other young men, described in court as “special friends” who both slept with Jackson, also denied any inappropriate touching. The mother of one of the men, Joy Robson, said of Jackson: “Unless you know him, it’s hard to understand him . . . He’s not the boy next door.”
Now an acquitted man, Jackson is no less a mystery than when the trial began. But he is a happy one, said those who know him.
“I’m ecstatic,” said Raymone Bain, a Washington publicist who worked as Jackson’s spokesman during the trial. “We have been through pure hell. I just thank God that the jury showed mercy to Michael Jackson.” |
How do you feel about Gun Control?
There seems to be a push toward government intervention and with all the shootings that keep getting publicized in the news, we will all eventually be affected by guns in some way. Now of course we have the 2nd Amendment (for now), but what if the government did attempted to take that right away? What you be comfortable giving up your right to LEGALLY protect yourself while criminals who already ILLEGALLY protect themselves will not only have an upper hand, but an open season to start hunting unarmed homes?
What push? There have been a heap of shootings since Sandy Hook, and nothing has changed. There may be changes at state levels, but I doubt anything at the national level will happen. It is too close to elections and Congress is useless.
As for how I feel, I am in favor of abolishing the Second Amendment and severely restricting gun ownership. Guns would only be allowed for hunting purposes. Absent that level of restriction than I am in favor of universal registration, far stricter background checks and training requirements, and punishment for owners/manufacturers of guns used in violence.
And I know my opinion will cause some to have convulsions, you might as well save your comments. I no longer care what the pro-gun side thinks. I no longer am interested in debate. I can and will vote to take your guns away.
Our nation is one built on independence. Lots of Americans died so that you can have the freedom to state that opinion you just stated. Without gun rights we are basically going backwards. read a history book, find out why we have the right.
Read a book written in this century. I don't live in the past. Guns did nothing to prevent the erosion of our democracy or the rise of the most powerful central government in existence. They are now irrelevant.
Note that the best that junk can do is to "vote" to take our guns away. Actually ~taking~ them away himself? No... that is far beyond his capabilities and abilities. He may find that his 'taking" has much more blowback for him than he ever imagined.
Was wondering when you would show up. I believe in democracy, not authoritarian takings, so it wouldn't ever be MY taking, it would be ours. If you don't like democracy, that's your problem. Can't help you with that.
A man kept destroying his neighbors fence with a bulldozer for years. One day he did not stop at the fence. He destroyed the neighborhood and almost killed people. Houses were destroyed. When there are warning signs people should have things like bulldozers and guns taken away from them.
You do not just need protection from criminals. You also need protection from the crazy people and the people that shoot first and see who it is later. I live in Canada and I do not have a gun so I am biased but there is obviously a problem involving guns in the United States. Problems should be fixed.
Some of the driving laws were changed where I live and it saved a lot of lives. Fewer teenagers are getting into car accidents. Ignoring problems does not help.
In the US the Government now monitors our phone calls, internet use and has centralized cameras in public places. With face recognition software they can trac most people's lives. Once they get the guns, we must obey, we must obey.
Mike you are reacting to the stories that main stream media is pushing out there. They don't tell you about the amount of gun killings that happen in the "Urban" areas all due to ILLEGAL guns. Legal guns are rarely used compared to ILLEGAL.
I'm against gun control. The bad guys will always have guns no matter what we do because they don't care about the law. We need laws that let the good guys have guns for protection.
I also think there's a reason it's the second amendment, not the first or third of fifth or any other number.
The first amendment is for a peaceful revolution.You have the right to say the government is corruptyou have a right to publish articles in the media that say the government is corruptyou have a right to peaceably assemble and protest the governmentyou have a right to your religion which gives you morals so you can tell when and how the government is being corrupt.
The first amendment is obviously a way for the people to start a peaceful revolution. A war of words and information instead of guns.
If the government limits our words, then we may have to resort to the second amendment, a violent revolution. Although I pray this never happens.
Evil is evil no matter what the choice weapon may be. The law abiding citizens will not be able to protect themselves if made to give up their guns. The right to bear arms at least gives them a fighting chance. I do believe these weapons should be under lock and key though in a home with children or at least kept out of reach.
I don't think it's possible in the U.S. The right to bare arms is right up there with baseball and apple pie. It's ingrained in our national fabric.Secondly criminals will never abide by laws! Unless all guns were removed from (all citizens) it's unlikely we'd see a major drop in murders by guns because criminals will simply steal them or buy them on the "black market" just like illegal drugs are bought are sold.
People have always killed each other and always will. There were murders long before there were guns. Making guns illegal would only create a huge black market for guns and give criminals the upper hand. If guns were never invented, then these crazy folks would be killing people with swords, or knives, or maybe sticks and rocks. It is important to think about what the government is trying to control when they start taking things away. Are they trying to control guns or citizens? Have we learned nothing from prohibition or the war on drugs?
What do you think about gun control? Stricter or needs to be more lax?This issue always comes up during an unfortunate tragedy, I would like to know what people think. Keep it sensible and respectful please.
When is the right time to talk about gun control - NOT banning guns, but sensible controls?Why is it whenever the subject of gun control is brought up people get so hostile and angry about protecting guns at all costs?...
What is it about gun control that makes people so crazy? Wouldn't "some" be better than NONE?I understand the 2nd amendment but who really needs to buy a semi-automatic weapon? Is it just a matter of "my... |
Q:
Extract part of HTML in C/Objective-C
I need to extract the detail content of a website while preserve all formatting of the division. The section I wish to extract is:
...
<div class="detailContent"><p>
<P dir=ltr><STRONG>Hinweis</strong>: Auf ... </p>
</div>
...
My current solution is to use HTMLParser from libxml2 and xpath to find the nodes and walk through all the nodes to reconstruct this piece of HTML. This is a long an complicated code.
I' just wondering if there is an easier solution to extract part of HTML?
Thanks.
A:
Simple Javascript solution: document.getElementsByClassName("detailContent")
Combine that with UIWebView's support for running Javascript and you might have a more concise solution.
|
Yokoyama Dam
is a dam in Ibigawa, in the Gifu Prefecture of Japan.
Category:Dams in Gifu Prefecture
Category:Dams completed in 1964 |
A late goal by Brent McGrath, who capitalised on an error by Antun Kovacic, proved to be the difference.
The Knights defender misread the bounce of the ball and failed to bring it under control, gifting McGrath a one-on-one with Chris May. The former Adelaide United striker made no mistake, burying the ball in the net.
Knights could consider themselves unlucky to come away from the contest with no points, after putting in a solid performance throughout the 90 minutes only to be undone by one error.
The visitors had the better of the play in the early stages of the contest, creating numerous chances.
Bentleigh, however, worked it’s way back into the contest and could have taken the lead when Liam McCormick squared the ball across the face of goal for Brent McGrath. Luckily for Knights, Sam Torrens was alert to the situation and put in a last-ditch tackle to deny the home side.
On a sour note for the visitors, Torrens was forced off the field in the 67th minute after tweaking the hamstring he injured in the warm up ahead of the Oakleigh game in Round 8.
Quite remarkably, despite a number of chances for both sides, the scores remained locked at 0-0 at half time.
Just four minutes after the break, Brent McGrath had the ball in the net, only for the goal to be ruled out by the assistant’s flag for offside.
David Stirton was the next to go close to opening the scores, when his well-struck free kick in the 61st minute beat May but not the right upright, bouncing away for Michael Simms to clear.
For the visitors, Daniel Visevic, who has been in fine form in recent weeks, should have scored in the 64th minute. Capitalising on a poor goal kick by Alistair Bray, Visevic was afforded a one-on-one opportunity with the keeper, but hit the post.
As the full time whistle approached and the match seemed destined for a 0-0 draw, Kovacic’s error and McGrath’s subsequent goal proved to be decisive.
Melbourne Knights’ next match is away to Northcote City next Sunday, 22 June. Kick off at John Cain Reserve is at 3pm. |
Britain's Brexit drama went into overtime Wednesday as Prime Minister Theresa May and the country's main opposition sought a compromise deal to prevent an abrupt British departure from the European Union at the end of next week.
In an about-face that left pro-Brexit members of May's Conservative Party howling with outrage, the prime minister sought to forge an agreement with left-wing Labour Party leader Jeremy Corbyn after failing three times to win Parliament's backing for her Brexit deal.
May also said she would ask the EU for a further delay to Britain's departure date — postponed once already — to avert a chaotic and economically damaging no-deal Brexit on April 12. Skeptical lawmakers, reluctant to take her word for it, approved a hastily crafted law that compels May to ask for an extension to the Brexit deadline if a no-deal departure is looming.
"The country needs a solution, the country deserves a solution, and that's what I'm working to find," May told lawmakers before meeting with Corbyn for about two hours.
Afterward, both the government and Labour called the meeting "constructive" and said their teams would hold more in-depth talks Thursday.
May's office said both sides had shown "flexibility and a commitment to bring the current Brexit uncertainty to a close."
Corbyn, more muted, said "the meeting was useful but inconclusive."
"There hasn't been as much change as I expected," he said.
May's change of direction left her caught between angry Conservatives who accuse her of throwing away Brexit, and Labour opponents mistrustful of her sudden change of heart.
Labour lawmaker Paul Sweeney said May's outreach to his party "shows the desperation that she's in."
Pro-Brexit Conservatives, meanwhile, expressed outrage. Two junior ministers quit, and other lawmakers angrily accused May of putting the socialist Corbyn in the Brexit driver's seat.
Her cross-party talks — after almost three years of seeking to push through her own version of a Brexit divorce deal — came amid EU warnings that a damaging withdrawal without a plan was growing more likely by the day.
After lawmakers three times rejected an agreement struck between the bloc and May late last year, the leaders of the EU's 27 remaining countries postponed the original March 29 Brexit date and gave the U.K. until April 12 to approve the divorce deal or come up with a new one.
So far the House of Commons has failed to find a majority for any alternative plan.
"A no deal on 12 April at midnight looks more and more likely," European Commission President Jean-Claude Juncker said Wednesday, adding that would bring disruption for EU citizens and businesses, but much worse economic damage for Britain.
EU Economy Commissioner Pierre Moscovici said a "no-deal" Brexit would mean long lines at borders and paperwork headaches for customs checks on the 11,000 vehicles entering and leaving Britain each day.
Bank of England Governor Mark Carney warned that, even though Britain and the EU both wanted to avoid a no-deal Brexit, it remained the legal default position, and the risk of Britain accidentally crashing out was "alarmingly high."
Carney told Sky News that claims by pro-Brexit politicians that such a situation could be managed were "absolute nonsense."
May's pivot toward Labour points Britain toward a softer Brexit than the one she has championed since British voters decided in June 2016 to leave the EU. Labour wants the U.K. to remain in the EU's customs union — a trading area that sets common tariffs on imports to the bloc while allowing free trade in goods moving between member states.
May has always ruled that out, saying it would limit Britain's ability to forge an independent trade policy.
May's decision to negotiate with Corbyn is risky for both the Conservatives and Labour, and could widen divisions over Brexit that run through both parties.
Labour is formally committed to enacting the voters' decision to leave the EU, but many of the party's lawmakers want a new referendum that could keep Britain in the bloc. They will be angry if the party actively helps bring about the U.K.'s departure.
Meanwhile, May's move infuriated pro-Brexit Conservatives who say Britain must make a clean break with the EU in order to take control of its laws and trade policy.
Former Foreign Secretary Boris Johnson said Brexit "is becoming soft to the point of disintegration."
Junior Wales Minister Nigel Adams quit his post, criticizing May for seeking a deal with "a Marxist who has never once in his political life put British interests first" — a reference to the left-wing Corbyn.
He was followed by junior Brexit minister Chris Heaton-Harris, who said in his resignation letter that the government "should have honored the result of the 2016 referendum" and left the EU on March 29.
Meanwhile, pro-EU lawmakers were not banking on talks between May and Corbyn succeeding. The House of Commons on Wednesday approved a bill to ensure May can't go back on her promise to seek a delay to Brexit rather than let Britain tumble out of the bloc.
The bill, debated and approved in a single day, compels May to seek to extend the Brexit process beyond April 12 in order to prevent a no-deal departure. In a reflection of how divided lawmakers are over Brexit, it passed by a single vote, 313-312.
The bill still needs approval from the House of Lords, Parliament's unelected upper chamber — likely on Thursday. And it does not force the EU to agree to delay Brexit.
EU leaders, weary of the whole Brexit circus, gave a cautious welcome to May's attempt at rapprochement.
German Chancellor Angela Merkel said she would work "until the last hour" to secure an orderly Brexit, but stressed that "these solutions have to be reached above all in Britain itself."
CLICK HERE TO GET THE FOX NEWS APP
Britain's televised political melodrama over Brexit — with its weeks of passionate debates, narrow votes and seemingly endless crises — has left EU leaders exasperated, but also fascinated.
The EU's Brexit coordinator, Guy Verhofstadt, joked that "the sessions in the House of Commons have become more popular than the matches in the Premier League."
"The trouble is that it is always a draw in the House of Commons," he said. |
Union Home Minister Amit Shah on Monday (6 January) launched an attack on Delhi Chief Minister (CM) Arvind Kejriwal accusing him of protecting the “tukde tukde gang that raised anti-India slogans” inside Jawaharlal Nehru University (JNU) campus in 2015.
“Delhi government wants to save tukde tukde gang. Students who raised anti-India slogans should be put behind the bars or not? But Kejriwal (Delhi CM) is not giving sanction to Police to prosecute them,” said the Home Minister, while accusing Delhi government of shielding former Jawaharlal Nehru University Students' Union leader Kanhaiya Kumar and others in the sedition case.
The Bharatiya Janata Party (BJP) national president also alleged that the Congress and the Aam Aadmi Party (AAP) were misleading people, specially minorities in the country over the Citizenship (Amendment) Act (CAA), according to a report by India Today.
He also held them responsible for the recent violent clashes between protesters and security forces across the country.
He said, “AAP and Congress, especially Rahul Gandhi and Priyanka Gandhi are misleading the minorities of the country. Nobody's citizenship will be revoked under CAA, it is an act to give citizenship. These parties are responsible for the riots which broke out.”
The BJP is leaving no stones unturned to come back to power in the national capital where it is out in the cold for nearly two decades. The party has begun its campaign for the assembly polls which are going to be held on 8 February, as announced by the Election Commission on Monday. The counting of votes will be done on 11 February.
The model code of conduct comes into effect immediately, said the Election Commission. The date of notification is 14 January, while 21 January will be the last date for filing nominations.
There are a total of 70 seats in Delhi out of which ruling AAO won 67 last time in 2015. |
package com.jiepier.filemanager.bean.entity;
import java.util.ArrayList;
import java.util.List;
/**
* Created by panruijie on 2017/3/3.
* Email : zquprj@gmail.com
*/
public abstract class AbstractExpandableItem<T> implements IExpandable<T> {
protected boolean mExpandable = false;
protected List<T> mSubItems;
@Override
public boolean isExpanded() {
return mExpandable;
}
@Override
public void setExpanded(boolean expanded) {
mExpandable = expanded;
}
@Override
public List<T> getSubItems() {
return mSubItems;
}
public boolean hasSubItem() {
return mSubItems != null && mSubItems.size() > 0;
}
public void setSubItems(List<T> list) {
mSubItems = list;
}
public T getSubItem(int position) {
if (hasSubItem() && position < mSubItems.size()) {
return mSubItems.get(position);
} else {
return null;
}
}
public int getSubItemPosition(T subItem) {
return mSubItems != null ? mSubItems.indexOf(subItem) : -1;
}
public void addSubItem(T subItem) {
if (mSubItems == null) {
mSubItems = new ArrayList<>();
}
mSubItems.add(subItem);
}
public void addSubItem(int position, T subItem) {
if (mSubItems != null && position >= 0 && position < mSubItems.size()) {
mSubItems.add(position, subItem);
} else {
addSubItem(subItem);
}
}
public boolean contains(T subItem) {
return mSubItems != null && mSubItems.contains(subItem);
}
public boolean removeSubItem(T subItem) {
return mSubItems != null && mSubItems.remove(subItem);
}
public boolean removeSubItem(int position) {
if (mSubItems != null && position >= 0 && position < mSubItems.size()) {
mSubItems.remove(position);
return true;
}
return false;
}
}
|
The present invention relates to an apparatus for the input of information.
Various apparatuses have become known for the input of information in conjunction with a screen. Thus, it is known, for example, to point at a screen with a so-called light pen. Located in the tip of the light pen is a photodetector which emits an output signal when the area of the screen covered by the photodetector is scanned by the writing beam of the screen. From the position of said signal with respect to time it is possible to deduce the location of the light pen. Consequently, it is possible, first, to mark an image detail and, second, also to write on the screen.
Further apparatuses for the input of information in conjunction with a screen are so-called touch-screen devices, which are pressure-sensitive or work on a capacity basis. Such devices are presently available from component manufacturers as an addition for picture tubes and flat screens, for example in the catalogue Elektronika, Munich 1995. The measurement of capacity or a change in pressure or resistance in the matrix-addressed plastic sheet applied to the screen is identified by corresponding computer programs and is assigned to the functions and information or program steps placed underneath in masks.
An object of the present invention is to indicate an apparatus for the input of information, said apparatus being able to be manufactured both as a built in (self-contained) apparatus and also as an addition for a screen.
The object of the invention is achieved, in that a raster of light-emitting screen elements is associated with a raster of photodetectors and with a raster of lenses, in that the lenses, the screen elements and the photodetectors are spaced out in such a manner that the emitted light is not-focused and the light emitted by at least one of the screen elements and reflected by an object as said object approaches the apparatus is focused onto at least one of the photodetectors, and in that output signals of the photodetectors are able to be supplied to an evaluation apparatus in order to obtain information on which of the photodetectors are receiving reflected light.
A raster of lenses associated with the raster of screen elements and the raster of photodetectors is provided, the lenses, the screen elements and the photodetectors being spaced apart so that light is not focused. When an object nears the device, light emitted by at least one of the screen elements is focused onto at least one of the photodectors.
The apparatus according to the invention allows specified information entered (to be input) by pointing at it. Input is achieved by the controlled interplay of the image-reproduction function and the image-recording function in the apparatus according to the invention. The selectable information is output in programmed manner through the image-reproduction function of the screen and is shown on the screen as an existing image with different brightnesses and, where appropriate, colors. Using a finger or a reflecting object, the information can be selected by pointing at the area in which the information is displayed and by bringing the finger near to the screen. It is equally possible to use a light-emitting pointer.
The number of photodetectors and light-emitting screen elements may be chosen to suit the requirements. The numbers of screen elements customary in television technology and computer screens, such as 600xc3x97800, may be used for the representation of images to whose resolution an observer is accustomed and which have a high information content. Through a large-area embodiment of the apparatus according to the invention, for example in DIN A4 format, the demands on the lithographic processes and the resolution thereof are lower and, consequently, the costs of the manufacturing machines are relatively low. These can also be implemented through the modification of conventional printing presses.
The phosphors customary in picture tubes may be used as the emitting screen elements, said phosphors being irradiated with electrons by spaced-apart electron sources to which corresponding voltage is applied. The electron sources are preferably field-emitter arrangements which may be produced by corpuscular-beam deposition.
The photodetectors may consist of nanocrystalline composite material produced by corpuscular-beam-induced deposition and described in German patent application 196 21 175.1.
Preferably, it is provided in the device according to the invention that each light-emitting screen element is associated with one photodetector. Depending on the specific requirements, however, it is also possible to employ different numbers of screen elements and photodetectors.
The use of the apparatus according to the invention as a xe2x80x9cflat cameraxe2x80x9d is enabled (made possible) according to an embodiment of the invention in that a converging lens is positioned in front of each photodetector.
A further development of the apparatus according to the invention consists in that, for screen areas each formed by a reproduced mask, in that the intensity measured by the therein situated photodetectors is compared with a known background intensity and in that, when the intensity exceeded the background intensity, it is detected that the object is approaching.
This further development of the invention prevents interference from stray light, which on the one hand, may penetrate from outside and, on the other hand, may be caused by the light-emitting screen elements themselves.
The further development of the invention may preferably be such that the background intensity of the apparatus during times, at which the object is not approaching, is measured and stored in a memory, it being advantageous to provide a computer with screen-comparison routines for comparison and detection.
A particularly advantageous embodiment of the further development of the invention consists in that a memory is provided for at least one mask, the mask preferably being of such design that a minimum light intensity is radiated by those areas of the light-emitting screen elements in which an input is required to be possible. This ensures that, in the area of those photodetectors which are required to detect an input, there is sufficient light for reflection.
In order, however, to prevent the light emitted by the screen elements from likewise entering the photodetectors and interfering with the evaluation process, it may be provided in the apparatus according to the invention that the photodetectors are shielded from the light-emitting screen elements by a light-impermeable layer. Additionally or alternatively, it may also be provided in the apparatus according to the invention that, inside each of the areas, a lower or no light intensity is radiated by those screen elements situated in the direct vicinity of photodetectors from whose output signals information is obtained. Nevertheless, the undirected light propagated from the screen elements ensures sufficient illumination of the object in front of the lenses in front of the photodetectors.
For the purpose of input an additional separation between ambient light and the light emitted by the screen elements may, according to a further embodiment of the invention, be accomplished in that the light emitted by the screen elements is modulated and in that the output signals of the photodetectors are sent through filters which allow the modulation signal to pass.
This measure may, in that different modulation signals and different filters are provided for different areas, also be used for further location selection. In this connection, attention is also drawn to the fact that the apparatus according to the invention is capable not only of evaluating one single approaching object but also of evaluating a plurality of objects.
Furthermore, the apparatus according to the invention may be used not only for the input of information but also for the display of any images and for the recording of images of objects brought in front of the apparatus according to the invention. In another further development of the apparatus according to the invention, therefore, operation in three phases is provided, wherein
during a first phase, the screen elements are energized for the reproduction of an image;
in a second phase, the screen elements emit no light while the output signals of the photodetectors are evaluated for image recording and
in a third phase, the screen elements emit light and the output signals of the photodetectors are evaluated in order to obtain the information to be input.
If the camera function is not required, the apparatus according to the invention may also readily be operated with two phases, namely the first and third phases.
This further development of the invention is preferably designed such that the repetition frequency of the three or two phases is greater than the flicker frequency perceptible by the human eye and/or that the duration of the third phase is considerably shorter than the duration of the first phase. This ensures the flicker-free reproduction of the image, which is extensively free from interference through the mask displayed during the input phase.
The apparatus according to the invention may, on the one hand, be in the form of an independent unit characterized by the apparatus being in the form of a plate-shaped body in which both the light-emitting screen elements and also the photodetectors are located. On the other hand, however, it is also possible to retrofit existing screens by the apparatus being in the form of a plastic sheet, said plastic sheet containing the photodetectors and conductors for derivation of the output signals of the photodetectors and being adapted to be applied to a screen containing the light-emitting screen elements. |
A question was posed in Friday's class regarding the rand() function. The person wanted to know how to make their robot move for a random range of time; specifically between 0 and 4 seconds. I used the help menu in ROBOTC to show the rand() function, but I didn't think I did a very good job answering the question. With that in mind, I wanted to share the following code. The code contains comments that hopefully explains everything. If there are any other questions or comments, please feel free to chime in. Thanks,
There are many, many other parameters that can be used with the rand() function (for instance, to tweak the seed values used for the random number generation), but for basic random number generation, the rand() function will suffice.*/
long rTime = 0;//Created a global variable. The data type is long in order to get a bigger range of valuestask main(){
Who is online
Users browsing this forum: No registered users and 1 guest
You cannot post new topics in this forumYou cannot reply to topics in this forumYou cannot edit your posts in this forumYou cannot delete your posts in this forumYou cannot post attachments in this forum |
Thursday, October 24, 2013
NEW
YORK, October 24: A newly formed coalition of human rights activists and
advocates for fiscal responsibility has submitted an ad to the MTA to run the
week before the election, telling the truth about the front runner in the
mayoral race, Bill de Blasio.
The leader of the Stop
Red Bill coalition, Pamela Geller, explained that the ad was necessary because
the mainstream media is not telling New Yorkers the disturbing details of de
Blasio’s career, associations, and plans for the city.
Said Geller in a
statement: “We held a press conference Thursday that was widely announced to
expose the subversive, seditious and Communist candidate for New York mayor,
arguably a job that is second in importance only to that of President of the United
States. We exposed the Marxist and terrorist ties of Warren Wilhelm, aka Bill
de Blasio.”
The media had been
advised of this press conference repeatedly over the last several weeks. “However,”
Geller continued, “No media was present. If a Soros-funded group like Media Matters
or the Center for American Progress had announced that it was holding a press
conference to expose Joe Lhota, there would have been a stampede.”
Geller concluded: “Therein
lies the problem. Is it any wonder that this Marxist is 50 points ahead in the
polls? De Blasio’s 50-point lead speaks to a larger problem: not just the low-information
voter, but the no-information voter. This is why we created the Stop Red Bill committee,
and we will be running advertisements across the New York City transit system.”
Bill de Blasio plans
that he will not allow surveillance of jihadi suspects and terror mosques. This
although two New Yorkers were charged with plotting jihad terror attacks in the
last week. And since 9/11, there have been plots against the Brooklyn Bridge,
the subway system, the Stock Exchange, Citigroup headquarters, the Garment
District, the PATH train, JFK Airport, Long Island Railroad, synagogues in the
Bronx and Manhattan, Times Square, and more.
De Blasio has a great
deal to hide: he has had a number of aliases and name changes. And it’s not
surprising that he would want to cover up his past. He has aided the brutal
Communist Sandinistas and ‘Palestinian’ jihadists, although he has scrubbed
that from his website. He even supported the bloodthirsty President Robert
Mugabe of Zimbabwe.
Newly available documents from his years on
the New York City Council years show him interfering with the work of the Manhattan
district attorney when a New York teacher named Steve Quester was facing prison
for working with jihad terrorists in Gaza, Judea and Samaria. Quester called
suicide bombers “desperate and hopeless” and said that “all the heartbreak
flows directly from Israel's policy” of “occupying the Palestinian territories.”And he recently appeared at a
Muslims for de Blasio rally with Linda Sarsour, who has called Zionism
“racism.”
His plans to increase
taxes are the death knell of the city. The fact is, nearly half this city’s job
growth has come from health care and social services. Who’s going to pay for it
if he kills the businessman?
Tuesday, October 22, 2013
The Democrat corruption machine is high gear for Red Bill. Not only are illegal donors welcomed by Hillary Clinton; so are convicted criminals.
This nasty piece of work means to be President of the United States.
After Obama, the more subversive and criminal, the better the chances
for election. Look at de Blasio. He is a hard core marxist and terror supporter.
Former Secretary of State Hillary Rodham Clinton, a frontrunner to
be the Democrats’ 2016 presidential candidate, hosted a fundraiser for
New York City Democratic mayoral candidate Bill de Blasio on Monday
night. But it was no ordinary fundraiser, Breitbart News has learned.
At least one of the main figures at the event is a convicted
financial criminal, and another has come under the glare of federal
authorities for alleged financial malfeasance.
According to a document published by Capitol New York, the headlining co-chairs for the event included Paul and Mary Adler and Sant Singh Chatwal.
Paul Adler once served as the chairman of the Democratic Party in Rockland County, New York, and according to a September 2000 article in the New York Times,
“was one of the county's earlier and most ardent supporters of Hillary
Rodham Clinton in her race for the United States Senate.”
Bill
de Blasio, the Democrat nominee for mayor of New York City, leads his
Republican rival, Joseph J. Lhota, by more than 40 points, so he is
virtually certain to be the next mayor. Now, 12 years after Sept. 11,
when New Yorkers were literally throwing themselves out of a building
attacked by jihadists, a terror-supporting Marxist is a shoo-in for
Gracie Mansion.
It seems as if New York is a victim of Giuliani’s great success in
preventing the continual pursuit of the jihad against the most desirable
target of the Muslim world, New York City. Giuliani’s policies were
followed, in a rare example of good sense, by his successor, Michael
Bloomberg, in his unwavering support of Police Commissioner Raymond
Kelly. De Blasio is living off the successes of Republican terror
policies.
Bill de Blasio plans that he will not allow surveillance of jihadi
suspects and terror mosques. This, although two New Yorkers were charged
with plotting jihad terror attacks in the last week. And since Sept.
11, there have been plots against the Brooklyn Bridge, the subway
system, the stock exchange, Citigroup headquarters, the Garment
District, the PATH train, JFK airport, Long Island Railroad, synagogues
in the Bronx and Manhattan, Times Square and more.
What’s de Blasio’s strategy? The Faisal Shahzad approach? Let’s just
hope the bomb doesn’t go off? We see what happens when you cater to
Islamic supremacist demands of removing jihad and counterterror
programs. The Boston bombing – those people are dead because law
enforcement didn’t pursue leads they received, out of fear of offending
Muslims. That’s de Blasio’s plan.Pamela Geller’s commitment to freedom from jihad and Shariah shines forth in her books – featured at the WND Superstore
Last Thursday, de Blasio met
at a “Muslims for de Blasio” rally with Muslim groups that seek to
dismantle counterterrorism measures that have kept New York City safe
from jihadists. New York is the Muslim terrorists’ most desirable target
in the world. De Blasio promised these groups that he would give them
what they wanted and end surveillance of mosques and Muslim
organizations with ties to the Muslim Brotherhood. This surveillance is
in large part what has prevented another major jihad attack in the city
since Sept. 11. So, of course stealth jihadis like “Palestinian”
activist and vicious Jew-hater Linda Sarsour want this surveillance
ended, and the leftist de Blasio is anxious to accommodate them. Linda Sarsour is an apologist for terror who calls Zionism “racism.” De Blasio happily stood with her at the “Muslims for de Blasio” event.
What’s even more disturbing is that while he is kissing up to Islamic
supremacists, de Blasio is criticizing Joe Lhota for visiting a Borough
Park synagogue and respecting Jewish law.Read the rest here
NEW YORK (Aug. 1)
The Reagan Administration has charged that the
Palestine Liberation Organization “is an active ally of Communist
revolutionaries throughout Central America.” This charge was contained
in the July 20 issue of the White House Digest, a service provided by
the White House Office of Media Relations and Planning.
According to the Digest, the PLO is supplying training and materiel
to the Sandinista government in Nicaragua and to the anti-government
guerrillas in El Salvador. The report noted that “since being introduced
to the region by (Cuban President Fidel) Castro, the PLO has developed
ties with revolutionary groups in nearly half the countries in the
region.”
At the same time, the Sandinistas were fighting alongside the PLO in
the Middle East as early as 1970, according to the report. The Digest
emphasized that neither side has denied the link between them, and it
cited statements issued by Latin American and PLO leaders.
Thursday, October 17, 2013
New York is the jihadis' prime target. This surveillance is in
large part what has prevented another major jihad attack in the City
since 9/11. So of course stealth jihadis like Linda Sarsour want this
surveillance ended, and the leftist de Blasio is anxious to accommodate
them. As I wrote yesterday, Linda Sarsour is an apologist for terror who calls Zionism "racism." De Blasio as mayor would be as bad or worse than Dinkins.
Join us on October 24th for our press conference on Bill de Blasio at the Hotel Pennsylvania (across from Penn Station), 401 7th Ave, New York, NY, 10001, Gold Ballroom, 18th floor, 12:30 – 3:00 pm.
De Blasio Tells Muslims He’ll End Broad NYPD Spying If Elected CBS New York, October 16, 2013
A group of Muslims attend a rally in Brooklyn for mayoral
candidate Bill de Blasio on Oct. 16, 2013. (credit: Jim Smith/WCBS 880)
NEW YORK (CBSNewYork) — Democratic mayoral candidate Bill de Blasio
told a group of Muslim supporters Wednesday that they won’t have to
live in fear of being under constant surveillance if he’s elected mayor.
As WCBS 880′s Jim Smith reported, de Blasio, the front-runner in the Nov. 5 general election,
said that, on his watch, NYPD surveillance tactics would only be
authorized to follow up on specific leads and that the police force
would be under the supervision of a new inspector general.
“The efforts of surveillance have to be based on specifically
specific information, and obviously you need to go through a careful
vetting process,” de Blasio said during a rally at Columbus Park in
Downtown Brooklyn.
Based on internal NYPD reports and interviews with officials involved in the programs, the NYPD has conducted wholesale surveillance of entire Muslim neighborhoods,
chronicling daily life including where people eat, pray and get their
hair cut, according to a series of reports by The Associated Press.
Police also reportedly infiltrated dozens of mosques and Muslim student
groups.
In addition, the NYPD secretly labeled entire mosques as terrorism organizations,
a designation that allows police to use informants to record sermons
and spy on imams, often without specific evidence of criminal
wrongdoing, according to the AP.
The NYPD has said its investigations target individuals suspected of criminal activity and are constitutional.
Repeating remarks that he has used during his campaign to justify
curbing the NYPD’s stop-and-frisk policy, de Blasio, the city’s public
advocate, said it’s imperative to restore trust between police officers
and the communities they serve. Doing so would make the city safer
because the police force could better gather intelligence from
residents.
“Not only are we going to be safe, but we’re going to be safe in a
manner that is, again, consistent with our values and our constitution,”
de Blasio said.
Linda Sarsour, head of the Muslim Democratic Club, said surveillance on the community is weighing on the minds of voters.
“Yes, it’s bringing people out to the polls,” she told Smith. “People
are tired of a mayor that unequivocally stands behind the (police)
commissioner and says that everything we’re doing is right.”
Earlier this month, Republican mayoral hopeful Joe Lhota
questioned the AP’s reporting about Muslim surveillance, saying
evidence he’s seen suggests that the investigations targeted individuals
and that gathering such intelligence keeps the city safer.
How will de Blasion slither out of this? Join us on October 24th for our press conference on Bill de Blasio at the Hotel Pennsylvania (across from Penn Station), 401 7th Ave, New York, NY, 10001, Gold Ballroom, 18th floor, 12:30 – 3:00 pm.
From FPM:
.... according to IPT, Sarsour tweeted the Islamist demonization of Israel equating Zionism with “racism.” She posted links on her Twitter feed to an anti-Israel video
by a New York poet named Remroum, accusing Israel of ethnic cleansing
and rejecting attempts at normalization between Israelis and
Palestinians.
Sarsour did not deny what the IPT reported. Instead, she hid behind the label Islamophobia to try and kill the messenger in one of her many tweets.
In another tweet, Sarsour claimed “white male privilege” has “oppressed” her. In an interview
she linked Islamophobia, and what she called “racial profiling” of
Muslim Americans, with slavery, “genocide” of Native Americans and
oppression of African Americans and Latinos.
In yet another one of her tweets, Sarsour called for the repeal of
the Patriot Act. She thinks the concern of Americans with the continuing
Islamist terror threat is overblown. Indeed, she tweeted that the “Underwear bomber was the #CIA all along. Why did I already know that?! Shame on us – scaring the American people.”
Wearing the badge of radicalism proudly, Sarsour also tweeted, “When did radical become a bad word?”
Tuesday, October 15, 2013
Sandinista support, and Robert Mugabe, too. Now this. And yetBill de Blasio, the Democratic nominee for mayor, leads his Republican rival, Joseph J. Lhota, by over 40 points. We have got to get the word out. Join us on October 24th for our press conference on Bill de Blasio at the Hotel Pennsylvania (across from Penn Station), 401 7th Ave, New York, NY, 10001, Gold Ballroom, 18th floor, 12:30 – 3:00 pm.Newly available documents
from de Blasio's City Council years show that the Democratic mayoral
candidate interfered with the Manhattan district attorney when NYC
teacher Steve Quester was looking at jail time for colluding with
terrorists in Gaza, Judea and Samaria.
— even though it was well
known that Mr. Mugabe had been starving his nation, jailing political
dissenters, pushing anti-gay rhetoric and policies, and grabbing land
from white farmers. At the time of the ceremony, Mr. de Blasio was
serving his first term as a City Council member.
Thirty-six of 51 New York City Council members shunned a 2002 event
honoring Zimbabwean President Robert Mugabe, expressing concern with the
leader’s despotic ways and worrying their attendance might be spun as
an endorsement of his torturing of political rivals.
But not Democrat Bill de Blasio here
New York, what have you wrought? Today, de Blasio's absolute contempt
for New Yorkers was again made plain when, after days of silence, he said
that he didn't know the teacher was an anti-Israel activist. But that
was the charge lodged against Steve Quester. De Blasio wants us to
believe that he went to extraordinary lengths and he didn't know what
the man did? Really? He goes out on a limb like that for a complete
stranger who met with and stood with terrorists in Gaza? Photo: Cold-blooded Bill de Blasio (nee Wilhelm) uses every opportunity to politically exploit his son and mixed-race family. Google de Blasio; there are more pics of his son than of him.
From the NY Daily News: Bill de Blasio defended teacher at daughter's school facing jail for Israel protestBill de Blasio
once went to a bat for a teacher at his daughter’s school who was
arrested protesting Israel’s policies in the West Bank and the Gaza
Strip.
Newly available documents from de Blasio’s years as a City Councilman
show the Democratic mayoral frontrunner intervened with the Manhattan
District Attorney in 2004 to help first-grade teacher Steve Quester
avoid jail time after he and 15 other protesters were charged with
blocking traffic and disorderly conduct during a 2003 protest.
“I want to personally call the D.A.,” de Blasio wrote in an email to a top aide in April, 2004, the documents show.
It’s not clear if de Blasio knew about Quester’s controversial views on Israel.
The teacher, who worked at Public School 372 where de Blasio’s daughter
Chiara was a student at the time, was quoted in a 2002 Associated Press
article calling suicide bombers “desperate and hopeless” and adding
that “all the heartbreak flows directly from Israel's policy” of
occupying the Palestinian territories.
February 16, 1985Nowhere do we see this more than in Nicaragua, whose
Sandinista government is a Marxist-Leninist clique that broke the hearts
of the freedom-loving people of their country by imposing a brutal
dictatorship soon after taking control in 1979. Functioning as a
satellite of the Soviet Union and Cuba, they moved quickly to suppress
internal dissent, clamp down on a free press, persecute the church and
labor unions, and betray their pledge to hold free elections. Now
they're exporting drugs to poison our youth and linking up with the
terrorists of Iran, Libya, the Red Brigades, and the PLO. The
Sandinistas aren't democrats, but Communists; not lovers of freedom, but
of power; not builders of a peaceful nation, but creators of a fortress
Nicaragua that intends to export communism beyond its borders.
Glassy-eyed rebel
Mayoral candidate Bill de Blasio was known as Bill Wilhelm during his
days at New York University, where he majored in Metropolitan Studies. Bill de Blasio has had a number of aliases and name changes. The de Blasio campaign declines to answer reporters' questions about his many name changes.
It was when de Blasio (nee Wilhelm) worked for the worst
mayor this city ever head, David Dinkins, he began calling himself Bill
de Blasio. If Dinkins is any indication of what we can come to expect,
there will be a mass exodus out of this great city.
In 1992, when he was a junior
staffer under then-Mayor David Dinkins, he was calling himself Bill de
Blasio. But on this mortgage document, he used his legal name at the
time, Warren de Blasio-Wilhelm.
Join me on October 24th for a press conference at the Hotel Pennsylvania (across from Penn Station), 401 7th Ave, New York, NY, 10001, Gold Ballroom, 18th floor, 12:30 – 3:00 pm. Free and open to the public.
I will be speaking along with Cliff Kincaid, Joe Connor, and Trevor Loudon. We will be exposing the seditious De Blasio and why he must be stopped.
As CBS 2′s Lou Young reported, the archived minutes of a meeting of the
Nicaragua Solidarity Network, a group whose meetings de Blasio last
attended in 1991, list, in shorthand, “end capitalism and replace with
democratic socialism tomorrow” as an immediate goal.
Bill de Blasio’s signature apparently appears on this Nicaragua Solidarity Network document. (Credit: CBS 2)
De Blasio needs to explain his support for the socialist government of Nicaragua and a
honeymoon in Cuba that was so secret that he never told his kids.
Press Release: Terrorism and the Tea Party: Who’s Hiding What in the New York City Mayoral Contest?
An October 24 press conference in New York City will ask whether
Democratic mayoral candidate Bill de Blasio’s ties to anti-American
terrorists pose more of a threat to public safety than the Tea Party
backers of Republican candidate Joe Lohta. The event is open to the
public and the press.
“De Blasio accuses Lohta of hiding his Tea Party ties,” notes event
organizer Cliff Kincaid, president of the public policy group America’s
Survival, Inc. (ASI) “If Lohta is somehow hiding his Tea Party
connections, so what? The Tea Party people are not terrorists. They
simply advocate for fiscal responsibility and our elected officials to
live up to their oath to defend the Constitution.”
By contrast, Kincaid added, “De Blasio, who has had three different
legal names, omitted his own controversial foreign connections in his
official bio and refuses to answer legitimate questions about his past.”
Those connections include De Blasio’s leadership role in the Nicaraguan
Solidarity Network, a communist front organization, and his comrades in
the Communist Nicaraguan Sandinista movement, who were praised by
Libya’s lunatic leader Moammar Gaddafi for having the will to “fight
America on its own ground” and promised a “revolution beyond our
borders” in Nicaragua. The Sandinistas were backed by the Soviet Union
and Castro’s Cuba and fought in the Middle East with the PLO. In 2012,
Sandinista leader and Nicaraguan President Daniel Ortega hosted Iranian
President Mahmoud Ahmadinejad as a guest of honor.
These matters are far more important than whether de Blasio would bike
to work and what he thinks is the best pizza in New York City, topics
recently featured in the New York media. On the other hand, the New York
Post has run several follow-up stories about the candidate’s
controversial foreign connections and is now under attack by de Blasio’s
former comrades in the Nicaraguan Solidarity Network.
“The real questions,” Kincaid said, “are what more and what else is de
Blasio hiding?” Although some coverage of de Blasio’s ties to
anti-American terrorists in Central America has emerged in the press,
Kincaid said his event will encourage the media to dig deeper because of
the need to protect public safety in New York City.
ASI is an educational organization with a more than ten year track
record of exposing extremist groups and threats to the U.S. The group
exposed Barack Obama’s communist ties in 2008, including the fact that
his childhood mentor growing up in Hawaii was Communist Party
propagandist Frank Marshall Davis.
At the event, a series of speakers will attempt to unlock the secrets
behind de Blasio’s mysterious trips to Cuba and Nicaragua in the 1980s
and ‘90s and his prediction that radical Islam will become a “dominant
force” in politics.
The speakers at the event and their topics include:
• Joe Connor, co-author of the book The New Founders, whose father
Frank was murdered in the Fraunces Tavern bombing in New York City,
carried out by the Cuban-backed Puerto Rican terrorist group, the FALN.
Connor, who is also a 9/11 World Trade Center eyewitness and family
member and Tea Party leader, will discuss what de Blasio’s travel to
Cuba on a “honeymoon” means to him and what it should mean to all New
Yorkers.
• Pamela Geller of the American Freedom Defense Initiative on
Arab/Muslim terror threats to New York City and the need to support the
New York City Police Department in the face of political efforts to
dismantle or restrict it.
• Trevor Loudon, author of The Enemies Within, on de Blasio’s
commitment to “democratic socialism” and the significance of de Blasio’s
work for David Dinkins, the former New York City mayor who was closely
associated with the Democratic Socialists of America.
• Cliff Kincaid, veteran journalist and media critic, on the
communist origins of the Nicaraguan Solidarity Network, which was
organized by the Soviet-linked U.S. Peace Council, and its subversive
sister organization, the Committee in Solidarity with the People of El
Salvador.
Friday, October 11, 2013
New York is a blue state. I know, I was born and raised here. So
we have become inured to the abuses and absurd government overreach and
looting that is the hallmark of the Democrat party.
But Bill DiBlasio, the candidate for Mayor with over 60% of the vote
in recent poll numbers, is a dyed-in-the-wool communist. He is a
Sandinista activist with Palestinian ties (NY Times). This is a whole other thing, and it's devastating and frightening. DiBlasio will make Dinkins look like Reagan.
Cliff Kincaid and I will be holding a press conference on October 24th in NYC to expose new shocking information -- stay tuned.
Bill
de Blasio, the Obama-backed Democrat “progressive” poised to become New York
City’s mayor, is under attack by “Rupert Murdoch’s tabloid empire,” his
supporters are charging. It’s a reference to the New York Post examining the
candidate’s ties to the Nicaraguan Solidarity Network, a Communist-front
organization that still supports the Marxist regime in Nicaragua headed by Communist
Sandinista Daniel Ortega.
In
fact, however, it was The New York Times that originally disclosed de Blasio’s
fondness for the “foreign revolution” in Nicaragua, in a major piece that
shocked even some liberals. The Times article revealed de Blasio’s
pro-communist activities and his prediction back in 1991 that Islam would become
a major political force. |
---
abstract: 'In this paper we investigate an adaptive discretization strategy for ill-posed linear problems combined with a regularization from a class of semiiterative methods. We show that such a discretization approach in combination with a stopping criterion as the discrepancy principle or the balancing principle yields an order optimal regularization scheme and allows to reduce the computational costs.'
---
[**On adaptive discretization schemes for the regularization of ill-posed problems with semiiterative methods**]{}
[W. Erb$^{(\dag)}$ E.V. Semenova$^{(*)}$]{}
*$(\dag)$ Institute of Mathematics, University of Lübeck\
Ratzeburger Allee 160, 23562 Lübeck, Germany*
*$(*)$ Institute of Mathematics, National Academy of Sciences of Ukraine\
Tereshchenkivska Str. 3, 01601 Kiev, Ukraine*
[**Key words:**]{} linear ill-posed problem, semiiterative method, discrepancy principle, balancing principle, Hölder-type source condition, adaptive discretization scheme
Introduction
============
Cost-efficient discretization methods for linear ill-posed equations are well-studied at the present day. Already in the early monographs of A. N. Tikhonov, V. K. Ivanov and M. M. Lavrentiev (see for example [@TA]) devoted to the regularization of unstable equations different discretizations were studied by applying finite-dimensional approximation techniques to the input data. But only in the beginning of the nineties R. Plato and G. M. Vainikko [@PlVai] established estimates on the minimal rank of finite-dimensional operators that guarantee an efficient discretization and preserve the accuracy of the method at the same time. After this work the question on how to reduce the volume of necessary discrete information was studied in several works. A first answer was given in [@P]. In this work, as a discretization domain the author proposed the so-called hyperbolic cross for a particular class of ill-posed problems. This cost-efficient discretization approach was then extended to larger classes of ill-posed problems in [@PerSol1], [@Sol] and several other works. In particular, it is shown in [@SolLev] that if the solution of the ill-posed linear equation is smooth enough a large class of regularization methods is more economic when using the hyperbolic cross discretization instead of the classical discretization on a whole rectangular domain.
However, the results of these articles also imply that there are some cases when the discretization with the hyperbolic cross doesn’t give an advantage in comparison with the classical discretization. In the case that the smoothness of the solution is low the volume of necessary discrete information is the same for both mentioned approaches. Nevertheless, it is shown in [@MaaPerRamSol] that an additional adaptive strategy for the hyperbolic cross discretization allows to reduce the volume of discrete information even for a low smoothness of the solution. In [@MaaPerRamSol] such a technique was applied for the Tikhonov-Philips regularization. For a particular semiiterative method, namely for the $1$-method, a similar adaptive discretization approach was considered in [@SolVol] by S. G. Solodky and E. A. Volynets.
The work presented in this article is an extension of the results in [@MaaPerRamSol] and [@SolVol]. We show that with a similar adaptive discretization strategy as in [@SolVol] it is possible to obtain cost-efficient and order optimal regularization schemes for a general class of semiiterative methods. Compared to [@SolVol], slight changes in the adaptive algorithm allow us to control the influence of the discretization in the approximation error and to get explicit constants in the error estimates. Moreover, beside the discrepancy principle we consider in this work also the balancing principle as a stopping rule for the adaptive algorithm.
In the following two sections we introduce all preliminary information regarding semiiterative regularization methods and projection methods for the hyperbolic cross discretization of linear ill-posed equations. The main results of this article can then be found in Section \[section-main\]. Here, we present two adaptive regularization schemes (Algorithm \[algorithm1\] and Algorithm \[algorithm2\]) for the solution of ill-posed linear equations that combine regularization with semiiterative methods and a cost-efficient discretization strategy based on the hyperbolic cross. The algorithms are stopped either with the discrepancy principle of Morozov or with the balancing principle. In Theorem \[teorem1\] and Theorem \[teorem2\] we will show that both algorithms are order optimal regularization methods if the smoothness of the solution is contained in a given range. In the last section some numerical tests are provided that confirm the theoretical results on the order optimality of the algorithms.
Preliminaries
-------------
We shortly introduce the theoretical setup of this article. The space $X$ denotes a Hilbert space with inner product $(\cdot, \cdot)$ and norm $\|x\|=\sqrt{(x,x)}$. We consider operator equations of the first kind, i.e. $$\label{eq_main}
Ax=f,$$ where $A: X \to X$ is a linear compact operator with $ {\rm Range} (A) \ne
\overline {{\rm Range } (A)}$ and $f \in {\rm Range} (A)$.
By $x^\dag$ we denote the solution of with minimal norm in $X$ that satisfies a Hölder-type source condition, namely we suppose that $$\label{source_condition}
x^\dag\in M_{\mu,\rho}(A) = \left\{x \in X:\, x=|A|^\mu v, \|v\|\leq \rho \right\} .$$ In this article, $\rho > 0$ is supposed to be known whereas the unknown smoothness parameter $\mu$ is supposed to belong to an interval $(0,\mu_0]$ with some $0 <\mu_0< \infty$. Further, we set $|A| =
(A^*A)^{1/2}$ with $A^*$ denoting the adjoint operator of $A$. Also, we suppose that instead of the right-hand side $f$ in (\[eq\_main\]) we have given some perturbation $f_\delta$, $\|f-f_\delta\|\leq\delta$ with known noise level $\delta$.
Finally, we introduce the class of operators under consideration. We denote by ${\cal H}^r$ the class of compact linear operators $A,$ $\|A\|\leq 1,$ such that for any $m\in {\mathbb{N}}$ the following conditions hold: $$\|(I-P_m)A\|\leq m^{-r}, \quad \|A(I-P_m)\|\leq m^{-r},$$ where $P_m$ is the orthoprojector on the linear span of the first $m$ elements of some orthonormal basis $E=\{e_k\}_{k=1}^\infty$ in the space $X$.
Properties of semiiterative methods
===================================
In order to obtain cost-effective iterative schemes for the solution of , it is useful to consider sequences of orthogonal polynomials and use its three term recurrence relation to generate the iterates (see [@Hanke]). Let therefore $P_k(x)$, $k \in {\mathbb{N}}_0$, denote monic polynomials of degree $k$ that are orthogonal with respect to a weight function supported on the interval $[-1,1]$. Then, the following recursion formula is valid (cf. [@Chihara I. Theorem 4.1]): $$\label{Pol_cond}
P_{k+1}(x) = (x - \alpha_k) P_k(x) - \beta_k P_{k-1}(x), \quad P_0(x) = 1, \quad P_1(x) = x - \alpha_0.$$ The recursion coefficients $\alpha_k \in {\mathbb{R}}$ and $\beta_k > 0$ are uniquely determined and $P_k(1) > 0$ holds for all $k \in {\mathbb{N}}_0$. Then (see [@Erb14 Algorithm 1] and [@Hanke Theorem 2.1]) a semiiterative method can be defined as $$\label{SimiItMeth}
\begin{gathered}
x_{k} = x_{k-1} + ((1-\alpha_k) \omega_{k}-1) ( x_{k-1} - x_{k-2}) + 2 \omega_{k} \; A^*( f - A x_{k-1}), \quad k \geq 1,\\
x_{-1} = 0, \quad x_0 = 2 \omega_0 \; A^* f,
\end{gathered}$$ with $$\omega_{k} = \frac{1}{1-\alpha_k - \beta_k \omega_{k-1} } \quad \text{for}\quad k \geq 1 \quad \text{and} \quad \omega_0 = \frac{1}{1-\alpha_0}.$$ The iterative method (\[SimiItMeth\]) yields an approximate solution of that can be written as $$\label{AppSol}
x_k=g_k(A^*A)A^*f,$$ where $g_k(\lambda)$ is a polynomial of degree $k-1$. Combining (\[AppSol\]) and (\[eq\_main\]), we can write the difference $x^\dag - x_k$ as $$x^\dag - x_k = r_k(A^*A)x^\dag,$$ with the residual polynomial $r_k(\lambda)=1-\lambda g_k(\lambda)$ of degree $k$. For the scheme (\[SimiItMeth\]) the residual polynomials have the form $$\label{Resid}
r_k(\lambda)=\frac{P_{k}(1-2\lambda)}{P_k(1)},$$ with the monic polynomials $P_k(\lambda)$ satisfying the recursion formula (\[Pol\_cond\]).
Taking into account that we are only given a perturbed right-hand side $f_\delta$, the semiiterative method (\[SimiItMeth\]) yields $$\label{AppSol_pert}
x_k^\delta=g_k(A^*A)A^*f_\delta$$ as approximate solution of equation (\[eq\_main\]).
For an optimal speed of convergence to the solution $x^\dag\in M_{\mu,\rho}$, $0 < \mu \leq \mu_0 < \infty$, a sufficient condition for the residual polynomials $r_k$ in (\[Resid\]) is (see [@EnglHankeNeubauer Section 6.2.])
$$\label{cond1}
\begin{array}{lrll}
(i) & |r_k(\lambda)|& \leq \; \kappa_0 & \mbox{for all} \quad \lambda\in [0,1], \; k\in {\mathbb{N}}, \\
(ii) & |\lambda^\frac{\mu}{2} r_k(\lambda)| & \leq \; \frac{\kappa_\mu}{(k+1)^{\mu}} & \mbox{for all} \quad 0 < \mu \leq \mu_0,\; \lambda\in[0,1], \; k\in \mathbb{N},
\end{array}$$
with positive constants $\kappa_\mu > 0$, $0 < \mu \leq \mu_0$, and $\kappa_0 \geq 1$. The number $\mu_0$ is called the qualification of the semiiterative method (\[SimiItMeth\]).
[**Example 1:**]{} The $\nu$-methods of Brakhage [@Brakhage] are semiiterative methods based on the monic Jacobi polynomials $P_k^{(2\nu - \frac12, -\frac12)}$. For $\nu > 0$, its residual polynomials are given as $$r_k(\lambda) = \frac{P_k^{(2\nu - \frac12, -\frac12)}(1-2\lambda)}{P_k^{(2\nu - \frac12, -\frac12)}(1)}.$$ The qualification of this method is $\mu_0 = 2 \nu$. It is well-known that the Jacobi polynomials satisfy (see [@Hanke Section 4]) $$|r_k(\lambda)| \leq |r_k(0)| = 1, \quad \text{and} \quad |\lambda^{\nu} r_k(\lambda)| \leq |r_k(1)| = \binom{k+2\nu}{k}^{-1}.$$ Therefore $\kappa_0 = 1$, and, if we assume that $2 \nu$ is an integer, we get $$|\lambda^{\nu} r_k(\lambda)| \leq \frac{(2 \nu)! k!}{(k+2\nu)!} \leq \frac{(2\nu)!}{(k+1)^{2\nu}}.$$ Hence, in this case condition (ii) in is satisfied with $\kappa_{2\nu} = (2 \nu)!$ and $\kappa_\mu \leq \max(\kappa_0,\kappa_{2\nu}) = (2 \nu)!$ for all $0 < \mu \leq 2 \nu$. The last statement follows from [@Hanke Theorem 4.2].\
[**Example 2:**]{} The $\nu$-method with parameter $\nu = \frac12$ is called Chebyshev method of Nemirovskii and Polyak [@NemirovskiiPolyak]. It is based on the Chebyshev polynomials $P_k^{(\frac12, -\frac12)}$ of fourth kind and its qualification is $\mu_0 = 1$. For the constants $\kappa_\mu$ in we have $\kappa_\mu = 1$ for all $0 \leq \mu \leq 1$.\
[**Example 3:**]{} The $\nu$-method with parameter $\nu = 1$ was studied in [@SolVol] in combination with cost-efficient adaptive discretization schemes. This scheme has qualification $\mu_0 = 2$ and the constants $\kappa_\mu$ in can be chosen as $\kappa_0 = 1$ and $\kappa_\mu = 2$ for all $0 < \mu \leq 2$.\
[**Example 4:**]{} Modified $\nu$-methods based on co-dilated Jacobi polynomials with an additional dilation parameter are investigated in [@Erb14]. These modified schemes have the same qualification $\mu_0 = 2 \nu$ as the $\nu$-methods. However, for these schemes the constant $\kappa_0$ is in general larger than $1$.
For our further analysis we need the Markov inequality in the form $$\label{markov}
|p'_k(\lambda)|\leq 2 \kappa k^2,$$ where $p_k(\lambda)$, $\lambda \in[0,1]$, is a polynomial of degree $k$ and $\kappa =\max\limits_{\lambda \in[0,1]} |p_k(\lambda)|$. Using the Markov inequality (\[markov\]) and the conditions (i) and (ii) in it is easy to obtain the following inequalities.
\[lemma1\] If the polynomials $r_k(\lambda)$, $k \in {\mathbb{N}}$, satisfy (i), then $$\begin{aligned}
\sup_{\lambda \in [0,1]} |g_k(\lambda)| & \leq & 2 \kappa_0 k^2, \label{Ing1a}\\
\sup_{\lambda \in [0,1]} |\sqrt{\lambda} g_k(\lambda)| & \leq & 2 \kappa_0 k, \label{Ing1b}\\
|r_k(\lambda)-r_k(\tau)| & \leq & 2 \kappa_0 k^2 |\lambda-\tau| \quad \text{for all $\lambda, \tau \in [0,1]$.} \label{Ing1}\end{aligned}$$ Moreover, if condition (ii) is satisfied with $\mu_0 \geq 2$, then $$\label{Ing2}
|\lambda r_k(\lambda)-\tau r_k(\tau)|\leq 2 \kappa_2 |\lambda-\tau| \quad \text{for all $\lambda, \tau \in [0,1]$.}$$
[**Proof.**]{} Using the Markov inequality (\[markov\]), condition (i) and the mean value theorem, we immediately get for $\lambda \in [0,1]$ the inequality $$\begin{aligned}
|g_k(\lambda)| = \frac{1-r_k(\lambda)}{\lambda} \leq \sup_{\lambda \in [0,1]} |r_k'(\lambda)| \leq 2 \kappa_0 k^2.\end{aligned}$$ Moreover, we get the inequality $$\begin{aligned}
\lambda g_k(\lambda)^2 = |\lambda g_k(\lambda)||g_k(\lambda)| = |1-r_k(\lambda)||g_k(\lambda)| \leq (1 + \kappa_0) 2 \kappa_0 k^2 \leq 4 \kappa_0^2 k^2.\end{aligned}$$ These two inequalities imply directly and . Using the same ingredients, we also get : $$\begin{aligned}
\frac{r_k(\lambda) - r_k(\tau)}{\lambda-\tau} \leq \sup_{\lambda \in [0,1]} |r_k'(\lambda)| \leq 2 \kappa_0 k^2, \quad \lambda \neq \tau.\end{aligned}$$ Finally we show (\[Ing2\]) in the case $\lambda\neq\tau$ (the case $\lambda=\tau$ is evident). Using again the mean value theorem and the Markov inequality (\[markov\]), we have $$\left|\frac{\lambda r_k(\lambda)-\tau r_k(\tau)}{\lambda-\tau}\right|\leq \max\limits_{\lambda\in[0,1]}|(\lambda r_k(\lambda))'|
\leq 2 (k+1)^2\max\limits_{\lambda\in[0,1]}|\lambda r_k(\lambda)|.$$ Since the qualification $\mu_0$ of the residual polynomial is larger than $2$, we obtain due to property (ii) in the inequality $$\left|\frac{\lambda r_k(\lambda)-\tau r_k(\tau)}{\lambda-\tau}\right|\leq 2 \kappa_2.$$
\[lemma2\] If the properties (i) and (ii) are satisfied with $\mu_0 \geq 2$, then the inequalities $$\label{Ing3}
|\lambda(r_k(\lambda)-r_k(\tau))|\leq (\kappa_0 + 2 \kappa_2)|\lambda-\tau|,$$ and $$\label{Ing4}
\sqrt{\lambda}|r_k(\lambda)-r_k(\tau)|\leq 2 \kappa_0 \sqrt{ \textstyle \frac12 + \frac{\kappa_2}{\kappa_0}}\, k |\lambda-\tau|$$ hold for $\lambda, \tau\in [0,1]$.
[**Proof.**]{} By (\[Ing2\]) and (i), we immediately obtain $$|\lambda (r_k(\lambda)-r_k(\tau))|\leq |\lambda r_k(\lambda)-\tau r_k (\tau)|+|\lambda-\tau||r_k(\tau)| \leq
(\kappa_0 + 2\kappa_2) |\lambda-\tau|.$$ The inequality (\[Ing4\]) follows from (\[Ing3\]) and (\[Ing1\]) since $$\lambda|r_k(\lambda)-r_k(\tau)|^2=\lambda|r_k(\lambda)-r_k(\tau)||r_k(\lambda)-r_k(\tau)|\leq 2 \kappa_0 (\kappa_0 + 2\kappa_2) k^2|\lambda-\tau|^2.$$
We remark that the qualitative statements of Lemma \[lemma1\] and \[lemma2\] are not new. In a simplified version, they can for instance be found in [@SolVol] for the residual polynomials of the $1$-method. However, for the error estimates in the following sections the explicit constants on the right hand side of the above inequalities, in particular of , play an important role. Therefore, we decided to include both lemmas with proof in this article.
Discretization schemes for linear equations
===========================================
To obtain finite dimensional approximations $A_\Omega$ of the operator $A$ we consider in this article projection methods and use the inner products $$\label{inn_pr}
(Ae_i, e_j) , \, (f_\delta, e_j), \quad (i,j)\in\Omega$$ as discrete information about the linear equation (\[eq\_main\]), where $\Omega \subset \{(i,j) \in {\mathbb{N}}^2\}$ denotes some subdomain of the coordinate plane.
In the following, we denote by $R_{\Omega}^{\mu_0}$ the class of iterative methods that solve (\[eq\_main\]) approximatively using the discretization domain $\Omega$ and a chosen semiiterative method with qualification $\mu_0 > 0$. We denote the corresponding iterates by $$\label{AppSol_pert_disc}
x_{\Omega,k}^\delta := g_k(A^*_{\Omega} A_{\Omega})A^*_{\Omega} f_\delta,\qquad k \in {\mathbb{N}}.$$ We have the following general error bound for the iterates $x_{\Omega,k}^\delta$.
\[lemma3\] Let the solution $x^\dag\in M_{\mu,\rho}(A)$ of satisfy a Hölder-type source condition with smoothness $0 < \mu \leq \mu_0$. Then, for the accuracy of an iterative method in the class $R_{\Omega}^{\mu_0}$ we obtain the following estimate: $$\|x^\dag-x_{\Omega,k}^\delta\|\leq \kappa_\mu \rho k^{-\mu}+ 2 \kappa_0 k \delta + 2 \kappa_0 k^2 \|x^\dag\| \Big(\|A^*A-A^*_\Omega A_\Omega\|+\|A^*_\Omega(A_\Omega-A)\|\Big).$$
[**Proof.**]{} We decompose the total error in the three terms $$\|x^\dag- x_{\Omega,k}^\delta\|\leq\|x^\dag-x_k\|+\|g_k(A_\Omega A_\Omega)A_\Omega^*(f-f_\delta)\|+\|x_k-g_k(A^*_\Omega A_\Omega)A_\Omega^* f\|$$ and estimate each summand separately. For the estimate of the first summand we use the fact that $x^\dag\in M_{\mu,\rho}(A)$ and adopt a well-known result for regularization filters (see [@Rieder Lemma 3.3.6]) with qualification $\mu_0 \geq \mu$. This gives $$\|x^\dag-x_k\|= \kappa_\mu (k+1)^{-\mu} \rho \leq \kappa_\mu \rho k^{-\mu}.$$ The second estimate can be easily deduced from (\[Ing1b\]): $$\|g_k(A_\Omega A_\Omega)A_\Omega^*(f-f_\delta)\|\leq \sup_{\lambda\in [0,1]} |\lambda^{1/2} g_k(\lambda) |\|f-f_\delta\|\leq 2 \kappa_0 k\delta.$$ Finally, we estimate the third summand using (\[Ing1a\]) and (\[Ing1\]): $$\begin{aligned}
\|x_k-g_k(A^*_\Omega A_\Omega)A_\Omega f\| & \leq \|(g_k(A^*A)A^*A-g_k(A^*_\Omega A_\Omega)A_\Omega^*A_\Omega)x^\dag\|+\|g_k(A^*_\Omega A_\Omega)A_\Omega^*(A_\Omega-A)x^\dag\| \\
& \leq \|(r_k(A^*_\Omega A_\Omega)-r_k(A^*A))x^\dag\|+\|g_k(A^*_\Omega A_\Omega)\|\|A^*_\Omega( A_\Omega-A)x^\dag\| \\
& \leq 2 \kappa_0 k^2\|x^\dag\|\|A^*_\Omega A_\Omega-A^*A\|+2 \kappa_0 k^2\|x^\dag\|\|A^*_\Omega( A_\Omega-A)\|.\end{aligned}$$ Combining these three estimates, we get the statement of the lemma.\
We remark that the qualitative statement of Lemma \[lemma3\] can be already found in [@SolVol Lemma 3.3] (therein proven for the $1$-method). Since the constants in the error estimate are important for our purposes, we decided to formulate also the above proof explicitly, although it is quite similar to the proof in [@SolVol Lemma 3.3].
The efficiency of the discretization depends heavily on the structure of $\Omega$. One standard choice for $\Omega$ (suggested in [@PlVai]) is to take the rectangular domain $\Omega=[1,...,M]\times[1,...,N]$. In this case the discretized operator $A_\Omega$ has the form $$A_\Omega=P_{M} A P_{N}.$$ A second more efficient possibility is to take the hyperbolic cross $$\label{HyperCross}
\Gamma_n := \bigcup_{k=1}^{2n} (2^{k-1}, 2^k]\times [1, 2^{2n-k}] \cup \{1\}\times[1,2^{2n}] \subset {\mathbb{N}}^2$$ as a discretization domain. In this case, the discretized operator $A_n := A_{\Gamma_n}$ has the form $$\label{A_disc}
A_n:= A_{\Gamma_n} = \sum_{k=1}^{2n}(P_{2^k}-P_{2^{k-1}})AP_{2^{2n-k}}+P_1AP_{2^{2n}}.$$
\[scale=1\]
\(A) [ |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[hc\]| & |\[hc\]| & |\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[hc\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
|\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]| & |\[ze\]|\
]{}; (x1) \[above=10pt, label=above:[1]{}\] at (A-1-1) ; (zero) \[left = 10pt\] at (x1) ; (x2) \[above=10pt, label=above:[10]{}\] at (A-1-10) ; (x3) \[above=10pt, label=above:[20]{}\] at (A-1-20) ; (x4) \[right = 20 pt, label=above:[i]{}\] at (x3) ; (zero) +(-20pt,0) – (x4.east) ; (x1.north) – (x1.south); (x2.north) – (x2.south); (x3.north) – (x3.south); (y1) \[left=10pt, label=left:[1]{}\] at (A-1-1) ; (y2) \[left=10pt, label=left:[10]{}\] at (A-10-1) ; (y3) \[left=10pt, label=left:[20]{}\] at (A-20-1) ; (y4) \[below = 20 pt, label=left:[j]{}\] at (y3) ; (zero) +(0,20pt) – (y4.south) ; (y1.west) – (y1.east); (y2.west) – (y2.east); (y3.west) – (y3.east);
at (zero) ;
It is easy to compute the volume of Galerkin information necessary for the realization of the hyperbolic cross approximation $A_n$ given by (\[A\_disc\]): one has to compute $\# \Gamma_n = 2^{2n}(n+1)$ inner products to construct $A_n$. In comparison, one has to compute $2^{4n}$ inner products for the approximation with $A_\Omega$ for the standard quadratic domain $\Omega = [1, \ldots, N]^2$, $N = 2^{2n}$.
If $A \in {\cal H}^r$ and $A_n$ has the form (\[A\_disc\]), the following error estimates hold (see [@Sol]): $$\|A^*A-A^*_nA_n\|\leq (1+2^{r+3})2^{-2rn} n, \quad \|A_n^*(A-A_n)\|\leq 3 \; 2^{-2rn+r}n .$$ Moreover, since $A \in {\cal H}^r$ we have the bound $$\|A -A P_{2^{2n}}\| \leq 2^{-2rn}.$$
\[corollary-discretization\] If $A \in {\cal H}^r$, $A_n$ has the form (\[A\_disc\]) and $$\label{conddiscr}
(1+2^{r+3})2^{-2rn} n < \frac{\gamma \delta}{2 k \rho }$$ with $k \in {\mathbb{N}}$ and a control parameter $\gamma > 0$, then $$\label{inequality-discretization}
\|A^*A-A^*_nA_n\| \leq \frac{\gamma \delta}{2 k \rho}, \qquad
\|A_n^*(A-A_n)\| \leq \frac{\gamma \delta}{2 k \rho}, \qquad
\|A - A P_{2^{2n}} \| \leq \frac{\gamma \delta}{2 k \rho n }.$$ If $x^\dag \in M_{\mu,\rho}(A)$, the approximation error of methods from the class $R_{n}^{\mu_0} := R_{\Gamma_n}^{\mu_0}$ with $\mu_0 \geq \mu > 0$ is given by $$\label{accuracy}
\|x^\dag- x_{n,k}^\delta\|\leq \kappa_\mu \rho k^{-\mu}+2 \kappa_0 k \delta (1 + \gamma).$$
In the adaptive algorithms of the next section the values $\delta$, $\rho$ and $k \in {\mathbb{N}}$ can not be chosen freely. The control parameter $\gamma$ in enables a possible user to handle the trade-off between accuracy and cost-efficiency of the adaptive scheme.
Regularization with semiiterative methods and adaptive discretization strategies {#section-main}
================================================================================
This section contains the main new results of the article. We present two algorithms in which the regularization with semiiterative methods is combined with an adaptive and cost-efficient discretization strategy. As stopping rule for the regularization we consider the discrepancy principle of Morozov [@Morozov] on the one hand and the balancing principle [@PerSch] on the other.
The discrepancy principle as stopping rule
------------------------------------------
To solve the linear ill-posed problem (\[eq\_main\]) we consider the adaptive Algorithm \[algorithm1\] which combines a method from the class $R_{n}^{\mu_0}$, $\mu_0 \geq 2$, with an adaptive discretization strategy and the discrepancy principle of Morozov [@Morozov] (implemented as in Algorithm \[algorithm1\]) as stopping rule.
given data $A\in {\cal H}^r, \delta, f_\delta, \rho$. choose control parameters $\gamma > 0$, $\tau > \kappa_0 \left( 1 + \sqrt{ \textstyle \frac12 + \frac{\kappa_2}{\kappa_0} } \, \gamma \right)$. choose discretization level $n \geq 1$ such that $(1+2^{r+3})2^{-2rn} n < \frac{\gamma \delta}{2 \rho}$ holds. compute Galerkin information: $$(f_\delta, e_j), \quad j\in [1, 2^{2n}], \qquad
(Ae_i, e_j), \quad (i,j) \in \Gamma_{n}.$$
choose $K_n \in {\mathbb{N}}$ as maximal integer such that $$\label{equation-n}
(1+2^{r+3})2^{-2rn} n < \frac{\gamma \delta}{2 K_{n} \rho}$$ is satisfied.\
compute $k-th.$ iterate of semiiterative method in the class $R_n^{\mu_0}$, $\mu_0 \geq 2$ (cf. ): $$x_{n,k}^\delta = x_{n,k-1}^\delta + ((1-\alpha_k) \omega_{k}-1) ( x_{n,k-1}^\delta - x_{n,k-2}^\delta) + 2 \omega_{k} A_n^*( f_\delta - A_n x_{n,k-1}^\delta).$$ discrepancy principle $=$ true,\
stopping index $K = k$, discretization level $n$ and solution $x_{n,K}^\delta$.\
\
\
increase discretization level $n \to n+1$. compute new Galerkin information: $$(f_\delta, e_j), \quad j\in [2^{2n-2}, 2^{2n}]; \qquad
(Ae_i, e_j), \quad (i,j) \in \Gamma_{n} \setminus \Gamma_{n-1}.$$
In Theorem \[teorem1\] we show that Algorithm \[algorithm1\] yields an order optimal regularization scheme for the solution of . For the proof we need some additional statements.
\[lemma4\] Let $A \in {\cal H}^r$, $x^\dag \in M_{\mu,\rho}(A)$ and $x_{n,k}^\delta$ be computed according to Algorithm \[algorithm1\]. Then, we have the estimate $$\|A x_k - f\|\leq \|A_n x_{n,k}^\delta - P_{2^{2n}} f_\delta\|+c_1\delta,$$ with $c_1 = \kappa_0 + 2 + \left( \sqrt{ \kappa_0( \textstyle \frac{\kappa_0}2 + \kappa_2 )} + \frac{1}{2n} \right) \gamma.$
[**Proof.**]{} To prove the statement we write $Ax_k-f$ in the following telescoping sum: $$Ax_k-f = A x_k - A x_k^\delta + A x_k^\delta - A_n x_{n,k}^\delta + A_n x_{n,k}^\delta - P_{2^{2n}} f_\delta + P_{2^{2n}} f_\delta - P_{2^{2n}} f + P_{2^{2n}} f - f$$ Now, using the triangle inequality and the definition of the generating polynomials $g_n$ we get $$\begin{aligned}
\| Ax_k-f \| & \leq \|A g_k(A^*A) A^* (f-f_\delta)\| + \| A g_k(A^*A) A^* f_\delta - A_n g_k(A_n^* A_n) A_n^* f_\delta\| \\
& \quad + \|A_n x_{n,k}^\delta - P_{2^{2n}} f_\delta\| + \|P_{2^{2n}} (f_\delta - f)\| + \|P_{2^{2n}} f - f\|.\end{aligned}$$
Since $g_k(A^*A)A^*=A^*g_k(AA^*)$, we can further estimate $$\begin{aligned}
\| Ax_k-f \| & \leq \sup_{\lambda\in[0,1]}|\lambda g_k(\lambda)| \|f-f_\delta\| + \| (r_k(AA^*) - r_k(A_n A_n^*)) Ax^\dag\| \\
& \quad + \|A_n x_{n,k}^\delta - P_{2^{2n}} f_\delta\| + \|f_\delta - f\| + \|(P_{2^{2n}}A - A) x^\dag\|.\end{aligned}$$
Using property (i) of the residual polynomials, inequality (\[Ing4\]) as well as the inequalities in Corollary \[corollary-discretization\], we finally obtain $$\begin{aligned}
\| Ax_k-f \| & \leq ( \kappa_0 + 2 )\delta + 2 \sqrt{ \kappa_0( \textstyle \frac{\kappa_0}2 + \kappa_2 )}\, k \| A^*A - A_n^* A_n \| \rho + \|A_n x_{n,k}^\delta - P_{2^{2n}} f_\delta\| + \| P_{2^{2n}}A - A\| \rho. \\
& \leq \|A_n x_{n,k}^\delta - P_{2^{2n}} f_\delta\| + \left( \kappa_0 + 2 + \left( \sqrt{ \kappa_0( \textstyle \frac{\kappa_0}2 + \kappa_2 )} + \frac{1}{2n} \right) \gamma \right) \delta.\end{aligned}$$
\[lemma5\] Let $A \in {\cal H}^r$, $x^\dag \in M_{\mu,\rho}(A)$, $0 < \mu \leq \mu_0 - 1$, $\mu_0 \geq 2$ and $x_{n,k}^\delta$ be computed according to Algorithm \[algorithm1\]. Further, we assume that the level of noise satisfies $\delta < \|f\|$. Then, the stopping index $K$ is bounded by $$\label{inequalitystoppingindex}
K < c_2 \rho^{\frac{1}{\mu+1}} \delta^{-\frac{1}{\mu+1}}, \quad \text{with}
\quad c_2 = \max \left\{ \left( \frac{\kappa_\mu}{\tau - \kappa_0 \left( 1 + \sqrt{ \textstyle \frac12 + \frac{\kappa_2}{\kappa_0} }\, \gamma\right) } \right)^{\frac{1}{\mu+1}} , 1 \right\}.$$ If Algorithm \[algorithm1\] is not stopped in the first iteration of the while loop, then also the index $K_{n-1}$ satisfies the estimate $$\label{inequalitymaximalindex}
K_{n-1}+1 < c_2 \rho^{\frac{1}{\mu+1}} \delta^{-\frac{1}{\mu+1}}.$$
[**Proof.**]{} To prove this statement we consider the second inequality in Algorithm \[algorithm1\]. For the stopping index $K \geq 2$, we get $$\begin{aligned}
\tau \delta & < \|A_{n} x_{n,K-1}^\delta- P_{2^{2n}} f_\delta \| = \|r_{K-1} (A_n A_n^*) f_\delta\| \\
& \leq \|r_{K-1} (A A^*) A x^\dag\| + \|( r_{K-1} (A_n A_n^*) - r_{K-1} (A A^*)) A x^\dag \| + \|r_{K-1} (A_n A_n^*) (f-f_\delta)\|.\end{aligned}$$ Now using the fact that $x^\dag \in M_{\mu,\rho}(A)$, property (i) of the residual polynomials $r_n$ as well as inequality (here $\mu_0 \geq 2$ is necessary), we obtain $$\tau \delta < \||A|^{\mu+1} r_{K-1} (A^* A) v\| + 2 \sqrt{ \kappa_0( \textstyle \frac{\kappa_0}2 + \kappa_2 )}\, (K-1) \| A^*A - A_n^* A_n \| \rho + \kappa_0 \delta.$$ Finally, using property (ii) of (here $\mu+1 \leq \mu_0$ must be satisfied) and Corollary \[corollary-discretization\] (the conditions of the corollary are satisfied by the construction of Algorithm \[algorithm1\]) we conclude $$\tau \delta < \kappa_{\mu+1} K^{-(\mu+1)} \rho + \left(\kappa_0 + \sqrt{ \kappa_0( \textstyle \frac{\kappa_0}2 + \kappa_2 )}\, \gamma \right) \delta.$$ Solving this inequality for the index $K$ implies inequality .
For the case that Algorithm \[algorithm1\] is stopped at $K = 1$, the assumption $\delta < \|f\|$ implies $$\delta < \|f\| = \||A|^{\mu+1} v\| \leq \rho.$$ Thus, we get for $K = 1$ $$K < \rho^{\frac{1}{\mu+1}} \delta^{-\frac{1}{\mu+1}}.$$ The proof of inequality follows the same lines of argumentation as the proof of inequality with $K-1$ replaced by $K_{n-1}$ and $n$ replaced by $n-1$.
\[teorem1\] Let $A \in {\cal H}^r$, $\delta < \|f\|$ and $\mu_0 \geq 2$ for the qualification of the semiiterative method. Then, Algorithm \[algorithm1\] gives an order optimal regularization method for the solution $x^\dag$ of in the class $M_{\mu,\rho}(A)$ for all $0 < \mu \leq \mu_0 - 1$. In particular, the approximative solution $x_{n,K}^\delta$ given by Algorithm \[algorithm1\] satisfies $$\label{orderoptimalitydiscrepancy}
\|x^\dag-x_{n,K}^\delta\|\leq C \rho^{\frac{1}{\mu+1}} \delta^{\frac{\mu}{\mu+1}},$$ with $C = \left(\kappa_0^{\frac{1}{\mu+1}} (\tau + c_1)^{\frac{\mu}{\mu+1}} + 2 \kappa_0 (1+\gamma) c_2 \right)$.
[**Proof.**]{} We only have to prove inequality , i.e. that Algorithm \[algorithm1\] gives an order optimal reconstruction scheme for all $0 < \mu \leq \mu_0 -1$. Then, it follows from a general result of R. Plato [@Plato Theorem 2.1] that Algorithm \[algorithm1\] is also a regularization method for the solution of . Using the estimates of Lemma \[lemma3\] and Corollary \[corollary-discretization\] (excluding the estimate for the approximation error), we get the error bound. $$\label{ax1}
\|x^\dag- x_{n,K}^\delta\|\leq \| x^\dag - x_K \| + 2 \kappa_0 K \delta (1 + \gamma).$$ To estimate the approximation error, we use an interpolation inequality (see [@Rieder Satz 2.4.2.] or [@Louis Satz 2.3.3.]) and obtain $$\begin{aligned}
\| x^\dag - x_K \| & \leq \|r_K(A^* A) x^\dag\| = \||A|^{\mu} r_K(A^* A) v\| \\
& \leq \||A|^{\mu+1} r_K(A^* A) v\|^{\frac{\mu}{\mu+1}} \| r_K(A^* A) v\|^{\frac{1}{\mu+1}} \\
& \leq \|A r_K(A^* A) x^\dag\|^{\frac{\mu}{\mu+1}} (\kappa_0 \rho)^{\frac{1}{\mu+1}} = \|A x_K - f\|^{\frac{\mu}{\mu+1}} (\kappa_0 \rho)^{\frac{1}{\mu+1}}.\end{aligned}$$ Now, Lemma \[lemma4\] and the discrepancy principle give $$\begin{aligned}
\| x^\dag - x_K \| &\leq (\|A_n x_{n,k}^\delta - P_{2^{2n}} f_\delta\| + c_1\delta)^{\frac{\mu}{\mu+1}} (\kappa_0 \rho)^{\frac{1}{\mu+1}} \\
&\leq \kappa_0^{\frac{1}{\mu+1}} (\tau + c_1)^{\frac{\mu}{\mu+1}} \rho^{\frac{1}{\mu+1}}\delta^{\frac{\mu}{\mu+1}}.\end{aligned}$$ For the data error in Lemma \[lemma5\] gives the bound $$2 \kappa_0 K \delta (1 + \gamma) \leq 2 \kappa_0 (1+\gamma) c_2 \rho^{\frac{1}{\mu+1}} \delta^{\frac{\mu}{\mu+1}}.$$ In total we can conclude: $$\|x^\dag- x_{n,K}^\delta\| \leq \left(\kappa_0^{\frac{1}{\mu+1}} (\tau + c_1)^{\frac{\mu}{\mu+1}} + 2 \kappa_0 (1+\gamma) c_2 \right) \rho^{\frac{1}{\mu+1}}\delta^{\frac{\mu}{\mu+1}}.$$
Regarding the computational expenses of Algorithm \[algorithm1\], we get the following result.
\[teorem3\] Let $A \in {\cal H}^r$, $x^\dag \in M_{\mu,\rho}(A)$, $0 < \mu \leq \mu_0 - 1$, $\mu_0 \geq 2$ and $x_{n,k}^\delta$ be computed according to Algorithm \[algorithm1\]. Further, we assume that the level of noise satisfies $\delta < \|f\|$ and that Algorithm \[algorithm1\] is not stopped in the first iteration of the while loop. Then, the discretization level $n$ of the solution $x_{n,K}^\delta$ is bounded by. $$\label{inequalitydiscretizationlevel}
n < c_4 + c_5 \ln \frac{\rho}{\delta}$$ with $c_4 = \frac{1}{r \ln 2} \ln \frac{c_2}{\gamma} \frac{2^{r+1} (1+2^{r+3})}{2^r-1}$ and $c_5 = \frac{1}{r \ln 2} \frac{\mu +2 }{ \mu+1}$. Further, the number of calculated inner products $\langle Ae_i, e_j\rangle$ for the domain $\Gamma_n$ can be estimated as $$\label{inequalityinformational}
\# \Gamma_n = 2^{2n}(n+1) < c_3 \left( \frac{\rho}{\delta} \right)^{\frac{\mu+2}{r(\mu+1)}} \left( 1+ c_4 + c_5 \ln \frac{\rho}{\delta} \right)^{1 + \frac1r},$$ with $c_3 = \left( \frac{c_2}{\gamma} 2^{2r+1} (1+2^{r+3}) \right)^{\frac1r}$,
[**Proof.**]{} Since Algorithm \[algorithm1\] is not stopped in the first iteration we have by definition of the index $K_{n-1}$ in : $$(1+2^{r+3})2^{-2r (n-1)} (n-1) > \frac{\gamma \delta}{2 (K_{n-1}+1) \rho}.$$ This can be formulated equivalently as $$\frac{2^{2r n}}{n-1} < 2^{2r+1} (1+2^{r+3}) \frac{\rho}{ \gamma \delta } (K_{n-1}+1).$$ By inequality in Lemma \[lemma5\] we get now the estimate $$\label{inequality2}
\frac{2^{2r n}}{n-1} < \frac{c_2}{ \gamma} 2^{2r+1} (1+2^{r+3}) \left( \frac{\rho}{\delta} \right)^{\frac{\mu+2}{\mu+1}}.$$ The Bernoulli inequality $1+(n-1)(2^r-1) \leq 2^{r(n-1)}$ yields the bound $ (n-1) \leq \frac{2^{rn-r}}{2^r-1}$. Thus, we obtain from the inequality $$2^{r n} < \frac{c_2}{ \gamma} \frac{2^{r+1}}{2^r-1} (1+2^{r+3}) \left( \frac{\rho}{\delta} \right)^{\frac{\mu+2}{\mu+1}}.$$ Now, taking the logarithm on both sides gives the desired inequality . Finally, using again and we obtain $$\# \Gamma_n = 2^{2n}(n+1) < \left(\frac{2^{2r n}}{n-1}\right)^{\frac1r} (n+1)^{1+\frac1r} <
c_3\left( \frac{\rho}{\delta} \right)^{\frac{\mu+2}{r(\mu+1)}} \left( 1+ c_4 + c_5 \ln \frac{\rho}{\delta} \right)^{1 + \frac1r},$$ with $c_3 = \left( \frac{c_2}{\gamma} 2^{2r+1} (1+2^{r+3}) \right)^{\frac1r}$.
For a standard nonadaptive Galerkin scheme with quadratic domain $\Omega = [1, \ldots 2^{2n}]^2$ the computational expenses for a suitable large discretization level $n$ turn out to be of order $\mathrm{O}((\frac{\rho}{\delta})^{\frac{2}{r}})$. This asymptotic result can be deduced from the error bounds given in [@PlVai] and the fact that $A \in H_r$. In comparison, by Theorem \[teorem3\] the computational costs of Algorithm \[algorithm1\] are of order $\mathrm{O}\left((\frac{\rho}{\delta})^{\frac{\mu+2}{(\mu+1)r}} \left(\ln \frac{\rho}{\delta} \right)^{1+\frac1r} \right)$. In this sense, the adaptive algorithm presented in this article is more economic than regularization schemes using the standard Galerkin scheme. The same order of complexity was also shown for the adaptive scheme in [@MaaPerRamSol] using a Tikhonov regularization and in [@SolVol] for the regularization with the $1$-method (with different proofs).
The balancing principle as stopping rule
----------------------------------------
In this section, we consider a second adaptive algorithm to solve (\[eq\_main\]) combining again a method from the class $R_{n}^{\mu_0}$ $\mu_0 \geq 2$ with an adaptive discretization strategy. However, this time we use the balancing principle (see in Algorithm \[algorithm2\]) as stopping rule.
given data $A\in {\cal H}^r, \delta, f_\delta, \rho$. choose control parameters $\gamma > 0$, $K_{sec} \in {\mathbb{N}}$. choose discretization level $n$ such that $(1+2^{r+3})2^{-2rn} n < \frac{\gamma \delta}{2 \rho}$ holds. compute Galerkin information: $$(f_\delta, e_j), \quad j\in [1, 2^{2n}]; \qquad
(Ae_i, e_j), \quad (i,j) \in \Gamma_{n}.$$
choose $K_n \in {\mathbb{N}}$ as maximal integer such that $$\label{equation-n2}
(1+2^{r+3})2^{-2rn} n < \frac{\gamma \delta}{2 K_n \rho}$$ is satisfied.\
compute iterates of semiiterative method in the class $R_n^{\mu_0}$, $\mu_0 \geq 2$ (cf. ): $$x_{n,k}^\delta = x_{n,k-1}^\delta + ((1-\alpha_k) \omega_{k}-1) ( x_{n,k-1}^\delta - x_{n,k-2}^\delta) + 2 \omega_{k} A_n^*( f_\delta - A_n x_{n,k-1}^\delta).$$\
compute the set $$\label{Balanc_princp}
D_n^+ = \{k: k \leq K_n, \|x_{n,k}^\delta - x_{n,j}^\delta\|\leq 8 (1 + \gamma) \kappa_0 j \delta \quad \text{for all $j$ with $k < j \leq K_n+K_{sec}$} \}.$$ increase discretization level $n \to n+1$. balancing principle $=$ true stopping index $K=\min\{k: k \in D_n^+\}$, discretization level $n$ and solution $x_{n,K}^\delta$\
compute new Galerkin information: $$(f_\delta, e_j), \quad j\in [2^{2n-2}, 2^{2n}]; \qquad
(Ae_i, e_j), \quad (i,j) \in \Gamma_{n} \setminus \Gamma_{n-1}.$$
For technical purposes we need the index $K_{opt} :=\left\lceil\left(\frac{2 (1+\gamma) \delta}{\kappa_{\mu}\rho}\right)^{-\frac{1}{\mu+1}}\right\rceil$. It is easy to see that $\kappa_{\mu} \rho K^{-\mu}_{opt} \leq 2(1+\gamma) K_{opt}\delta$ is satisfied and that for all $k\geq K_{opt}$ we have the inequality $$\label{k1}
\kappa_{\mu} \rho k^{-\mu}\leq 2(1+\gamma) k \delta.$$
\[teorem2\] Let $A \in {\cal H}^r$ and $\mu_0 \geq 2$ for the class $R_n^{\mu_0}$. Then, Algorithm \[algorithm2\] gives an order optimal regularization method for the solution $x^\dag$ of in the class $M_{\mu,\rho}(A)$ for all $0 < \mu \leq \mu_0$. In particular, the approximative solution $x_{n,K}^\delta$ given by Algorithm \[algorithm2\] satisfies $$\label{orderoptimalitybalancing}
\|x^\dag-x_{n,K}^\delta\|\leq C \rho^{\frac{1}{\mu+1}} \delta^{\frac{\mu}{\mu+1}},$$ with $C = 12 \kappa_\mu^{\frac{1}{\mu+1}} \left(2(1+\gamma)\kappa_0 \right)^{\frac{\mu}{\mu+1}}$.
[**Proof.**]{} We check that $K_{opt} \geq K$. For all $k\geq 1$, Corollary \[corollary-discretization\] implies $$\| x^\delta_{n,k} - x^\delta_{n,K_{opt}}\| \leq \|x^\dag - x^\delta_{n,K_{opt}}\|+\|x^\dag - x^\delta_{n,k}\|
\leq \kappa_{\mu} \rho K^{-\mu}_{opt}+ 2(1+\gamma) \kappa_0 K_{opt} \delta + \kappa_{\mu} \rho k^{-\mu}+ 2(1+\gamma) \kappa_0 k \delta.$$ Now, using (\[k1\]) we get for all $k\geq K_{opt}$: $$\| x^\delta_{n,k} - x^\delta_{n,K_{opt}}\| \leq 4 (1+\gamma) \kappa_0 k \delta + 4(1+\gamma) \kappa_0 K_{opt}\delta \leq 8(1+\gamma) \kappa_0 k \delta.$$ Thus, $K_{opt}\in D_n^+$ if $K_{opt} \leq K_n$ and $K_{opt} \geq K.$ Therefore, by the balancing principle the total error can be bounded as follows: $$\begin{aligned}
\|x^\dag- x^\delta_{n,K}\| &\leq\|x^\dag- x^\delta_{n,K_{opt}}\|+\| x^\delta_{n,K_{opt}} - x^\delta_{n,K}\|\leq
\kappa_{\mu} \rho K^{-\mu}_{opt} + 2(1+\gamma) \kappa_0 K_{opt} \delta + 8(1+\gamma) \kappa_0 K_{opt}\delta \\
& \leq 12 (1 + \gamma) \kappa_0 K_{opt}\delta = 12 (1 + \gamma) \kappa_0 \left\lceil \left(\frac{2(1+\gamma) \kappa_0 \delta}{\kappa_{\mu}\rho}\right)^{-\frac{1}{\mu+1}}\right\rceil \delta \\
& \leq 24 (1+\gamma) \kappa_0 \left(\frac{2(1+\gamma) \kappa_0 \delta}{\kappa_{\mu}\rho}\right)^{-\frac{1}{\mu+1}}\delta= C \rho^\frac{1}{\mu+1} \delta^\frac{\mu}{\mu+1}.\end{aligned}$$ Thus, Algorithm \[algorithm2\] yields an order optimal reconstruction scheme for all $0 < \mu \leq \mu_0$. It follows again from [@Plato Theorem 2.1] that Algorithm \[algorithm2\] is also a regularization method for .
Examples and numerical tests
============================
In this final section, we present a simple test equation, in which the preliminary assumptions of Theorem \[teorem1\] and \[teorem2\] are satisfied. With help of this example we test the convergence order and the performance of the introduced adaptive algorithms. As a simple example of a linear problem (\[eq\_main\]) in which the operator $A$ is in the class ${\cal H}^2$, we consider in $X = L^2([0,1])$ the Fredholm integral equation of the first kind (see [@DelvesMohamed Example 12.4.1.] $$A x(t) = \int_0^1 k(s,t) x(s) ds = f(t),\qquad 0 \leq t \leq 1, \label{equation-generaltestequation}$$ with the kernel $$k(s,t) = \left\{ \begin{array}{ll} t(s-1) & 0\leq t < s \leq 1, \\ s(t-1) & 0\leq s \leq t \leq 1. \end{array} \right.$$ The self-adjoint operator $A$ maps $L^2([0,1])$ into the Sobolev space $W^{2,2}([0,1])$. In the setting of boundary value problems, the application of $A$ to $x$ corresponds to the solution of the boundary value problem $f''(t) = x(t)$ with homogeneous boundary conditions $f(0) = f(1) = 0$. It is well-known that the functions $$e_k(t) = \sqrt{2}\sin (\pi k t), \quad k \in {\mathbb{N}}, \; t \in [0,1],$$ form an orthonormal basis of eigenfunctions of the operator $A$ with corresponding eigenvalues $\lambda_k = - (\pi k)^{-2}$. Therefore, we have $\|A\| \leq \pi^{-2}$ and $\|( I - P_m) A \| = \|A ( I - P_m)\| \leq (\pi (m+1))^{-2}$. This implies in particular $\pi^2 A \in {\cal H}^2$.
In , we consider the two different right hand sides $f_1$ and $f_2$ given by $$\begin{aligned}
f_1(t) &= t^3(1-t)^3, \\
f_2(t) &= \textstyle \frac{t^3}3 - \max\left(0,t-\frac12 \right)^2 - \frac{t}{12}.\end{aligned}$$ The corresponding exact solutions of the inverse problem are given by $$\begin{aligned}
x_1^\dag(t) &= 18 t(5t^3-10t^2+6t-1) \quad \text{with $x_1^\dag \in M_{\mu,\rho}$ for $0 < \mu < 1.25$}, \\
x_2^\dag(t) &= 2t - \mathrm{sign}(2t-1) - 1 \quad \text{with $x_2^\dag \in M_{\mu,\rho}$ for $0 < \mu < 0.25$}.\end{aligned}$$
Test of Algorithm 1
-------------------
We test first Algorithm 1 for the two right hand sides $f_1$ and $f_2$. As semiiterative method we chose the $\nu$-method with $\nu = 1.5$. Since the qualification of this method is $\mu_0 = 3$ it can be applied in Algorithm 1 for both test examples. In this way we have $\kappa_0 = 1$ and $\kappa_2 = 6$. Choosing $\gamma = \frac12$, we can take $\tau = 1.01 + \sqrt{\frac{13}{8}}$ as parameter for the discrepancy principle. We set $\rho = 1$ and generate perturbed right hand sides $f_{i,\delta}, i = 1,2$ for different values of $\delta > 0$. Now, we use Algorithm 1 to compute the approximate solutions $x_{i,n,K}^\delta$ of $x_i^\dag$. The resulting errors and stopping indices of Algorithm \[algorithm1\] are displayed in Table \[table-1\], \[table-2\] and Figure \[figure-1\], \[figure-2\]
------------- ---------- ----- ------- ----- ------------------------------------------------------- --------------------------------
$\nu$ $\delta$ $n$ $K_n$ $K$ $\frac{\|x_{1,n,K}^\delta -x_1^\dag\|}{\|x_1^\dag\|}$ $\delta^{\frac{1.25}{1+1.25}}$
\[2mm\] 1.5 0.062500 6 37 12 0.49975111 0.21431100
1.5 0.031250 6 19 17 0.29238913 0.14581613
1.5 0.015625 7 125 20 0.21650878 0.09921257
1.5 0.007812 7 63 24 0.17715080 0.06750373
1.5 0.003906 8 435 45 0.10086226 0.04592920
1.5 0.001953 8 218 57 0.07100275 0.03125000
1.5 0.000977 8 109 80 0.04971398 0.02126234
1.5 0.000488 9 774 108 0.03362040 0.01446679
1.5 0.000244 9 387 147 0.02322422 0.00984313
1.5 0.000122 10 2784 203 0.01549616 0.00669722
------------- ---------- ----- ------- ----- ------------------------------------------------------- --------------------------------
: Results of Algorithm \[algorithm1\] to solve the test problem $A x_1 = f_1$. []{data-label="table-1"}
![The error and the stopping index $K$ of Algorithm \[algorithm1\] compared to the expected error $\delta^{\frac{1.25}{1+1.25}}$ and the expected stopping index $\delta^{-\frac{1}{1+1.25}}$ of the first test problem $A x_1 = f_1$.[]{data-label="figure-1"}](Alg1error1.pdf){width="\textwidth"}
![The error and the stopping index $K$ of Algorithm \[algorithm1\] compared to the expected error $\delta^{\frac{1.25}{1+1.25}}$ and the expected stopping index $\delta^{-\frac{1}{1+1.25}}$ of the first test problem $A x_1 = f_1$.[]{data-label="figure-1"}](Alg1Index1.pdf){width="\textwidth"}
------------- ---------- ----- ------- ------ ------------------------------------------------------- --------------------------------
$\nu$ $\delta$ $n$ $K_n$ $K$ $\frac{\|x_{2,n,K}^\delta -x_2^\dag\|}{\|x_2^\dag\|}$ $\delta^{\frac{0.25}{1+0.25}}$
\[2mm\] 1.5 0.062500 6 16 9 0.59696031 0.57434918
1.5 0.031250 7 105 23 0.50523819 0.50000000
1.5 0.015625 7 53 36 0.44800149 0.43527528
1.5 0.007812 8 366 68 0.38638037 0.37892914
1.5 0.003906 8 183 120 0.33629235 0.32987698
1.5 0.001953 9 1300 207 0.29364826 0.28717459
1.5 0.000977 9 650 361 0.25566471 0.25000000
1.5 0.000488 10 4678 625 0.22295988 0.21763764
1.5 0.000244 10 2339 1091 0.19402742 0.18946457
1.5 0.000122 11 17010 1901 0.16890368 0.16493849
------------- ---------- ----- ------- ------ ------------------------------------------------------- --------------------------------
: Results of Algorithm \[algorithm1\] to solve the test problem $A x_2 = f_2$. []{data-label="table-2"}
![The error and the stopping index $K$ of Algorithm \[algorithm1\] compared to the expected error $\delta^{\frac{0.25}{1+0.25}}$ and the expected stopping index $\delta^{-\frac{1}{1+0.25}}$ of the second test problem $A x_2 = f_2$.[]{data-label="figure-2"}](Alg1error2.pdf){width="\textwidth"}
![The error and the stopping index $K$ of Algorithm \[algorithm1\] compared to the expected error $\delta^{\frac{0.25}{1+0.25}}$ and the expected stopping index $\delta^{-\frac{1}{1+0.25}}$ of the second test problem $A x_2 = f_2$.[]{data-label="figure-2"}](Alg1Index2.pdf){width="\textwidth"}
Test of Algorithm 2
-------------------
Now we test Algorithm \[algorithm2\] for the two right hand sides $f_1$ and $f_2$. As semiiterative method we choose again the $\nu$-method with $\nu = 1.5$. As further control parameter, we choose $\gamma = \frac12$. Also for Algorithm \[algorithm2\], we set $\rho = 1$ and generate perturbed right hand sides $f_{i,\delta}, i = 1,2$, for different values of $\delta > 0$. With Algorithm \[algorithm2\] we then compute approximate solutions $x_{i,n,K}^\delta$ of $x_i^\dag$. The resulting errors for the two test problems are displayed in Table \[table-3\], \[table-4\] and Figure \[figure-3\], \[figure-4\].
------------- ---------- ----- ------- ----- ------------------------------------------------------- --------------------------------
$\nu$ $\delta$ $n$ $K_n$ $K$ $\frac{\|x_{1,n,K}^\delta -x_1^\dag\|}{\|x_1^\dag\|}$ $\delta^{\frac{1.25}{1+1.25}}$
\[2mm\] 1.5 0.062500 6 37 8 0.68979661 0.21431100
1.5 0.031250 6 19 15 0.36601474 0.14581613
1.5 0.015625 7 125 19 0.23679445 0.09921257
1.5 0.007812 7 63 22 0.18993287 0.06750373
1.5 0.003906 8 435 33 0.14615533 0.04592920
1.5 0.001953 8 218 48 0.09181469 0.03125000
1.5 0.000977 8 109 59 0.06784866 0.02126234
1.5 0.000488 9 774 88 0.04481807 0.01446679
1.5 0.000244 9 387 114 0.03125762 0.00984313
1.5 0.000122 9 194 158 0.02144644 0.00669722
------------- ---------- ----- ------- ----- ------------------------------------------------------- --------------------------------
: Results of Algorithm \[algorithm2\] to solve the test problem $A x_1 = f_1$. []{data-label="table-3"}
![The error and the stopping index $K$ of Algorithm \[algorithm2\] compared to the expected error $\delta^{\frac{1.25}{1+1.25}}$ and the expected stopping index $\delta^{-\frac{1}{1+1.25}}$ of the first test problem $A x_1 = f_1$.[]{data-label="figure-3"}](Alg2error1.pdf){width="\textwidth"}
![The error and the stopping index $K$ of Algorithm \[algorithm2\] compared to the expected error $\delta^{\frac{1.25}{1+1.25}}$ and the expected stopping index $\delta^{-\frac{1}{1+1.25}}$ of the first test problem $A x_1 = f_1$.[]{data-label="figure-3"}](Alg2Index1.pdf){width="\textwidth"}
------------- ---------- ----- ------- ----- ------------------------------------------------------- --------------------------------
$\nu$ $\delta$ $n$ $K_n$ $K$ $\frac{\|x_{2,n,K}^\delta -x_2^\dag\|}{\|x_2^\dag\|}$ $\delta^{\frac{0.25}{1+0.25}}$
\[2mm\] 1.5 0.062500 6 16 8 0.60790728 0.57434918
1.5 0.031250 7 105 13 0.57256321 0.50000000
1.5 0.015625 7 53 26 0.48809868 0.43527528
1.5 0.007812 8 366 43 0.43126730 0.37892914
1.5 0.003906 8 183 74 0.37805221 0.32987698
1.5 0.001953 9 1300 131 0.32892273 0.28717459
1.5 0.000977 9 650 228 0.28663978 0.25000000
1.5 0.000488 9 325 281 0.27204892 0.21763764
1.5 0.000244 10 2339 643 0.22139020 0.18946457
1.5 0.000122 10 1170 818 0.20848631 0.16493849
------------- ---------- ----- ------- ----- ------------------------------------------------------- --------------------------------
: Results of Algorithm \[algorithm2\] to solve the test problem $A x_2 = f_2$. []{data-label="table-4"}
![The error and the stopping index $K$ of Algorithm \[algorithm2\] compared to the expected error $\delta^{\frac{0.25}{1+0.25}}$ and the expected stopping index $\delta^{-\frac{1}{1+0.25}}$ of the first test problem $A x_2 = f_2$.[]{data-label="figure-4"}](Alg2error2.pdf){width="\textwidth"}
![The error and the stopping index $K$ of Algorithm \[algorithm2\] compared to the expected error $\delta^{\frac{0.25}{1+0.25}}$ and the expected stopping index $\delta^{-\frac{1}{1+0.25}}$ of the first test problem $A x_2 = f_2$.[]{data-label="figure-4"}](Alg2Index2.pdf){width="\textwidth"}
The graphs in Table \[table-1\] - \[table-4\] confirm the theoretical results on the order optimality of Algorithm \[algorithm1\] and \[algorithm2\]. The parameters $\tau$ and $\gamma$ in the two algorithms are chosen conservatively such that the assumptions in Theorem \[teorem1\] and \[teorem2\] are satisfied. Neglecting these theoretical preconditions on the parameters it is possible to further improve the numerical results. In particular for Algorithm \[algorithm1\], a smaller choice of $\tau$ yields better results for the approximation error $\frac{\|x_{n,K}^\delta -x^\dag\|}{\|x^\dag\|}$. Also, increasing the parameter $\gamma$ leads to smaller discretization levels $n$, as compared to the ones displayed in Table \[table-1\] - \[table-4\], and reduces the numerical costs of the algorithms.
[99]{}
, , In [ Inverse and ill-posed problems, Alpine-U.S. Semin. St. Wolfgang/Austria 1986]{}, H. W. Engl and C. W. Groetsch, Eds., Notes Rep. Math. Sci. Eng. 4 (1987), pp. 165–175.
, , Gordon and Breach, Science Publishers, New York, 1978.
. Cambridge University Press, 1985.
, , , 1996.
, Accelerated Landweber methods based on co-dilated orthogonal polynomials, Numer. Alg. (2014), DOI: 10.1007/s11075-014-9842-z,
, Accelerated Landweber iterations for the solution of ill-posed equations, Numer. Math. 60 (1) (1991), pp. 341–373
, , Teubner-Verlag, Stuttgart, 1989.
, An adaptive discretization for Tikhonov-Phillips regularization with a posteriori parameter selection, Numer. Math. 87 (2001), pp. 485–502.
, On the solution of functional equations by the method of regularization, Soviet Math. Doklady 7, (1966), pp. 414–417.
, . (4) (1984), pp. 50–56.
, Optimization of Projection Methods for Solving Ill-Posed Problems, Computing 55 (1995), pp. 113–124.
, On the adaptive selection of the parameter in regularization of ill-posed problems, SIAM J. Numer. Anal. 43 (5) (2005), pp. 2060–2076.
, An Efficient Discretization for Solving Ill-Posed Problems, Lect. Appl. Math. 32 (1996), pp. 643–649.
, Optimal algorithms for linear ill-posed problems yield regularization methods, [Numer. Funct. Anal. Optimization]{} 11 (1990), pp. 111–118.
, On the Regularization of Projection Methods for solving Ill-posed Problems, [Numer. Math.]{} 57 (1990), pp. 63–79.
, , , 2003.
, A generalized projection scheme for solving ill-posed problems. [*J. Inverse Ill-Posed Probl.*]{} 7 (2) (1999), 185–200.
, Bounds of information expenses in constructing projection methods for solving ill-posed problems, [ *Comp. Method Appl. Math.*]{} 6 (1) (2006), 87–93.
, Adaptive scheme of discretization for one semiiterative method in solving ill-posed problems, [Ukrainian Mathematical Bulletin]{} 7 (4) (2010), pp. 553–569.
, Solutions of ill-posed problems, Wiley, New York, 1977.
|
Effects of proton pump inhibitor on outcomes of patients with severe acute pancreatitis based on a national administrative database.
This study aimed to investigate whether proton pump inhibitors (PPIs) affect the outcomes of patients with severe acute pancreatitis based on a national administrative database. A total of 10,400 patients with severe acute pancreatitis were referred to 1021 hospitals between 2010 and 2012 in Japan. Patients were divided into two groups: patients who used PPIs (n = 3879) and those without PPIs (n = 6521). We collected patients' data from the administrative database to compare in-hospital mortality within 7, 14, and 28 days, and overall in-hospital mortality between groups, using propensity score analysis to adjust for treatment selection bias. Multiple logistic regression showed that use of PPIs did not affect in-hospital mortality within 7 and 14 days. The odds ratio (OR) for mortality within 7 days was 1.14 (95% confidence interval [CI]: 0.91-1.42, p = 0.236) while that within 14 days was 1.10 (95% CI: 0.89-1.35, p = 0.349). No significant association was observed for in-hospital mortality within 28 days and overall in-hospital mortality (OR for within 28 days: 1.12, 95% CI: 0.92-1.37, p = 0.224; OR for overall in-hospital mortality: 1.42, 95% CI: 0.97-1.87, p = 0.065). This study shows that use of PPIs does not affect clinical outcomes of patients with severe acute pancreatitis. Prospective or randomized studies are needed to confirm the efficacy of PPIs on outcomes of patients with severe acute pancreatitis in the future. |
Q:
Constructing array of objects programmatically
Say I want the object to be something like this:
var Book = {
title: "the catcher in the rye",
price: "80.98",
characters: [{name: "holden caulfield", age: 16, height:"6.2"},
{name: "phoebe caulfield",age:13, height: "5"}]
};
EDITED
question:
characters array is built by adding a character one by one. How can do this while making sure that name, age and height properties are defined as above.
Something to the effect of?
Book.characters.add({name: "phoebe caulfield",age:13, height: "5"});
I would like to be able to define this programmatically, ie add properties to the object rather than define it like this.
Is this possible?
A:
You can do it in dynamic code (rather than a static declaration) like this:
var Book = {};
Book.title = "the catcher in the rye";
Book.price = "80.98";
Book.characters = [];
Book.characters.push({name: "holden caulfield", age: 16, height: "6.2"});
Book.characters.push({name: "phoebe caulfield", age: 13, height: "5"});
|
Centrum:
They make their own chocolates in an amazing variety and the size is smaller than a standard choc, so you can pick and eat more tastes! Quality is very high, Kuyt is a very famous patisserie and everything is made there. |
OTTAWA—The federal government is moving to pare down its controversial tax proposal on passive income so that it will only affect three per cent of private corporations.
Finance Minister Bill Morneau will be in New Brunswick on Wednesday to unveil changes to his passive investment proposal so that it only targets unfair tax advantages used by the wealthy, a senior government official told The Canadian Press.
Some tax experts believe the passive-income proposal is the most-complex and most-contentious tax reform idea in the government’s three-part plan.
Read more:
Federal government to cut small business tax rate to 9% by 2019
Small-business tax cut is an unseemly buy-off: Editorial
Trudeau and Morneau’s efforts to sugar-coat tax reforms turns into comedy of errors: Hébert
The official, speaking on condition of anonymity ahead of the announcement, said Morneau will also share updated estimates showing there’s between $200 billion and $300 billion in assets sitting in the passive investment accounts of just two per cent of all private corporations.
The finance minister will also point out that the dollar figure has been growing by $16 billion a year as wealthy incorporated individuals reap what the official described as unlimited benefits from tax-advantaged savings accounts over and above RRSPs and TFSAs, the official said.
The government wants to prevent all of this cash, which it contends is not being reinvested into the businesses or the economy, from piling up in these savings portfolios over generations, the official added.
The tweak to Morneau’s original proposal comes after an onslaught of complaints that warned cracking down on passive investments could adversely affect middle-class entrepreneurs who use their companies to save for economic downturns, sick leaves and parental leaves.
Morneau will provide more details Wednesday at an event near Saint John on the mechanics of the tweak and a timeline for the introduction of change to passive-income rules, the official said.
The announcement is part of a weeklong Liberal effort to calm the anger surrounding the tax proposals, which have outraged entrepreneurs, doctors, tax professionals, farmers and Liberal backbench MPs.
Prime Minister Justin Trudeau began the week by announcing tax cuts for small businesses and plans to abandon part of one of the proposals to avoid negative impacts on the intergenerational transfer of family businesses, like farms.
Trudeau also said the government intended to move ahead with another controversial proposal from the tax package. That change is aimed at limiting the ability of business owners to lower their personal income taxes by sprinkling their income to family members who do not contribute to their companies.
The government has yet to announce how it will proceed with the remaining proposal, which is designed to limit the ability of business owners to convert regular income of a corporation into capital gains, which are typically taxed at a lower rate.
On passive income, the official said the problem isn’t with individuals, but the system, since it encourages wealthy Canadians to keep their personal money inside their corporations so they can receive tax advantages not available to everyone else.
Loading... Loading... Loading... Loading... Loading... Loading...
The changes will not be retroactive, as outlined in the original proposal, and they will not affect existing savings, nor the income from those savings, the official said.
Morneau is expected to provide further details Wednesday on the changes to its passive-investment proposal, including a plan for addressing the concerns of angel investors and venture capitalists.
Kim Moody, a director at Moodys Gartner Tax Law, said the passive-income proposal is the most-contentious part of the plan, which is probably due to the fact there’s far more money at stake.
“They’re going to target the top three per cent, but those three per cent are not going to stand by idly and be subject to a 72 per cent, 73 per cent all-in tax rate — they’re not that foolish,” said Moody, who believes some wealthy business owners may leave the country if they can’t find ways around the new rules.
“They will change their behaviour to try and avoid that kind of punishment. There’s always ways.”
But he added that it would be a good development if the government can find a way to remove the impact for 97 per cent of private corporations. Moody said it would bring back certainty for those who would otherwise be worried that they won’t be able to set aside funds for rainy days, retirement or business expansion.
Greg Wiebe, managing partner for KPMG’s Canadian tax division, said the passive-income proposal troubles him the most out of Ottawa’s three initiatives.
“I hope that the answer they have is simple because the tax system in our country is very complicated now,” Wiebe said.
“And added complexity just adds costs and makes it difficult for people to comply, frankly.”
Morneau has argued the proposals are designed to create a fairer tax system, especially for those in the so-called middle class. He’s also said he hopes the tax reforms will unlock cash for business investment and help lift the country’s “productive capacity.”
Note to readers: This is a corrected story. An earlier version suggested the measures would only affect three per cent of small businesses.
Read more about: |
Missional Women
If you’re anything like me, you give Amazon Prime a run for their money. I wonder if my neighbors think that I have an Amazon-problem. I don’t—I promise! I do have a time problem though. I am always on the go. I think that’s one of the best parts about Amazon, it does the work for you!
With that in mind, I wanted to list out a few ideas of how to use your Amazon Prime Membership for God’s Kingdom and your personal growth.
1. Support a non-profit with Amazon Smile
Amazon Smile is pretty cool, actually. If you’re anything like me, you order lots of stuff from amazon on a regular basis. Amazon will donate 0.5% of eligible purchases to a non-profit of your choice. What an easy way to support the growth of God’s Kingdom—you’re already doing all the work.
2. Read Christian Books
Kindle First is a way to get free books. And, sometimes, the editors’ picks are Christian books. Getting to read more about our creator and savior for FREE—what could be better?
3. Listen to Worship Music Hello, Worship playlists. Similar to Spotify or Pandora, Amazon Prime has its own version of music streaming. There are awesome playlists for Christians to stream. Christian workout, acoustic, sleep, etc. I love music, but sometimes I get tired of the songs that I have been listening to—this is a great way to find new music.4. Bless Other PeopleSubscribe and Save. This idea is my favorite because you set it up once and then it is like a surprise in the mail every (week, month, etc.) . If you subscribe (set the frequency you would like to order something) then you save a percentage off that product every time. So Cool! I do it for things like shampoo and deodorant. Subscribe to a product that you can bless someone else with every month. Examples: -Diapers for a new family on your block -Granola Bars to keep in your car and give to the homelessLaura, the Missional Women host, tells a story about a friend of hers in college that “TP’s” people. When she visits their home she restocks their bathroom with a bunch of toilet paper. So thoughtful and it is so easy with Amazon.Any other ideas that you’ve thought of? How have you maximized your Amazon Prime Membership?
About Jacque
Jacque is the Missional Women Intern and a college student in Denver, CO who balances her time between trying to go to class and learning about His saving grace and perfect love as much as she can. She is a twenty something, DIY attempting, Jesus loving, Denver living, small town rooted, Colorado sports fan. She loves black coffee, long conversations and watching people do what God created them for. You can find her Christian Twenty Somethings blog at Desperately Dependent.
If you'd like to read more from this contributor, type her name in the search box on the top right.
I had always secretly hated sermons on stewardship. I knew the Bible taught that all of our possessions were Gods and we were only stewards of them, but a big side of me didn't like it. I wanted the money and things I had worked for to be all about me, and not about God. However, I became more and more convicted that living like this wasn't God's best and was not pleasing to him. So, in April of 2014, my husband and I took a good look at our possessions and made some radical decisions to live like our possessions were Gods, not ours. We had a 3 bedroom house, basically as full as it could be, with clothes, electronics, furniture, etc. We owned a car, an SUV, a motorcycle and 2 bicycles. We both love crafts and hobbies, so we had various boxes filled with paints, yarn, modeling supplies, scrapbooking materials, and many other well-intended projects. There were boxes and boxes of books that I had great intentions of reading, and the list continues. We took a good look around, and it felt suffocating. Compared to many Americans, we lived in a small house and had meager belongings, most of our furniture was cheap or free, and most of our 3 closets full of clothing had come from second hand stores. However, the sheer volume of it was unsettling to us.
So, we sold it all.
We sold everything except what would fit in our cars, put these few boxes in storage at our parents house and then, we sold the cars.
I realize that this is drastic, and our giant purge was made easier by moving halfway across the world, but still, the perspective that we gained was invaluable. And, looking back almost 2 years later, I don't regret purging any of it. As we have made some necessary purchases in our new life overseas, we have tried to keep them at a minimum and think about what things we really need. Owning less stuff frees up your life so many ways. First of all, it frees up your time. One example of this is our choice to live without a car. While I realize it is not practical for each of you to function without a vehicle, Ive found going vehicle-free to be a very freeing and positive experience. I don't spend time, or money, filling my car up with gas, getting it detailed each month, buying tires, rotating tires, etc. I can invest this time and money I am saving in the kingdom, rather than in maintaining my earthly possessions. It frees up time that I can invest in my relationship with God, my husband and my daughter. It frees up valuable time I can spend doing ministry and sharing life with the women I serve.
It frees up money to give away for Jesus. Buying less stuff obviously costs less money. Spending less money means that we can give more away. We can help hurting people in practical ways by meeting their physical needs. We can support missionaries serving in various parts of the world. Also, we can afford to take vacations to exotic places and spend quality time making memories as a family because we are living below our means.
Through owning less and buying less, we are learning to be better stewards of the money that God has given us, and we are truly learning that “every good and perfect gift is from above,” because in the end, none of the things I have are about me anyway.
About Melanie
Melanie and her husband Joel live and do ministry in Bangkok, Thailand. She is mommy to baby Claire and a graduate of Denver Seminary with a degree in Intercultural Ministry. She enjoys traveling, reading and discussing theology, and spending time with her family and friends. She loves the adventure that comes with living every day in another culture.
If you'd like to read more from this contributor, type her name in the search box on the top right.
A few years ago, I joined a few girlfriends for a night out on the town. After a yummy meal and lots of girl talk, we went for a walk. We discovered an open area downtown that had lots of shops and restaurants and a big central courtyard with little carts full of wares for sale. I love looking at funky rings and trying on cute costume jewelry. I was browsing at a table with inexpensive pieces when I saw a silver piece that grabbed my attention. It had a turquoise butterfly on the front. I immediately reached for my wallet. I love butterflies. Yes, they are pretty things that fly, but for me they provide inspiration in my walk as a Christ follower. Butterflies remind me that God is transforming my life. Like a caterpillar, I am on a journey of metamorphosis. God is doing a work in my heart, and each day, I am shedding more and more of my hard shell of sin and learning to fly with greater purpose in complete freedom. In Romans 12, Paul actually challenges us to “present our bodies a living sacrifice.” He explains that we are to live transformed lives. The actual Greek word for “transformed” here is synonymous with “metamorphosis.” Basically, I am called to be a mission-minded butterfly for the Kingdom. I wore that butterfly ring for years. And, since my friends know I love butterflies, I’ve received lots more beautiful pieces as gifts over the years. I actually own a pair of butterfly earrings, a lapel pin, a bracelet, and a few butterfly necklaces. Not long ago, I was wearing my favorite butterfly necklace on a Saturday morning when I went to get a manicure. The girl who was making my hands look lovely was from the Dominican Republic, and we both speak Spanish. We chatted about the similarities in our upbringings and discovered that we had a great deal in common. She mentioned that she liked my necklace, and I explained it was a gift from a sweet friend who knew I loved butterflies. “Why do you like butterflies so much?” she asked. I smiled. “Well,” I explained, “I am a Christian, and butterflies remind me of how God is changing my life. Christ has set me free from a life of sin, and He is helping me to fly in freedom.” My butterfly necklace has opened up for the door for me to share the Gospel many times. Sometimes, cute jewelry is a tool for the Kingdom.
About Lyli
Lyli Dunbar loves teaching. For 17 years, she mentored teenagers in the Christian school setting, and now she has serves as Associate Director of Curriculum at Trinity International University Florida. Lyli married her Prince Charming in her 40’s and has a heart for encouraging young couples and singles in God’s waiting room. She enjoys road trips with her husband, connecting with women through Bible study, and reading way too many books. Lyli writes about life lessons and faith on her personal blog. You may also connect with her on Facebook,Twitter, and Pinterest.
If you'd like to read more from this contributor, type her name in the search box on the top right.
Let me start by saying I am not a professional nail stylist. I'm just a girl who desires to use even little things to glorify the Lord. I also am not a natural born evangelist but also know that when I surrendered my life to Christ, I was given an adventurous mission of telling people about Him and the amazing things He's done in my life.
So I've been thinking and experimenting with ways to use nails to get into spiritual conversations without being weird. So I was thinking of the ways God has shown off in my life and they are many. One time when I was going on a missions trip to Nepal, I was $2,000 short and right before heading to the airport the Lord provided $2,100 in a span of 5 minutes. There's more to that story but I just LOVE telling it because I had always wanted a story of God coming through in some last minute, dramatic way like that. So if I could paint a plane on my nails, I could tell people that comment on my nails about this cool story.
But let's get real, not only am I not a professional nail artist, I think my kids may be better artists than me. So I found a cute little paper airplane nail art on pinterest and thought I would try it. Here's what I did.
We'll see how it goes and if anyone comments on my nails. But I'm excited to try something new as a way to start spiritual conversations. For once the spiritual conversation is going it's pretty easy to transition to sharing the Gospel from there through asking good questions:"What is your spiritual background?" followed up with, "Where would you say your at with Jesus right now?" and "I have a crazy hard question for you. Are you up for it? If you died tonight and God said, 'Why should I let you into heaven what would you say?" and then "Well, do you want to know how the Bible (or God) would answer that?"
I'm excited to keep experimenting knowing I have freedom to fail. Want to experiment with me? I would love to hear how it goes!
Here's other ideas I had...Each of my kids and even how I met Austin have awesome God showing off stories. So the stick people could get me to brag on God that way. Then I tried to paint symbols of my testimony... but that turned out just a bit too cheesy, so I'm still figuring out how to share my testimony through nail art.
And here are a couple tools (here and here) of great questions to help you get into spiritual conversations and turn a spiritual conversation into a opportunity to share the actual Gospel.
In the past I had a hard time seeing a connection between the great commission and fashion; to me they seemed two completely different things. Lately God’s been showing me how fashion can be one of the best tools to making a statement in the world for Christ and for opening up gospel conversations. Here are four key ways God has been showing me how to use fashion and the great commission together!1. Buy cute jewelry and purses! Yes you can buy jewelry and pack around a cute purse while doing the great commission! Light Gives Heat is a non-profit Christian organization based in Grand Junction, Colorado. Light Gives Heat provides income opportunities to over 90 Ugandan women who before could not find work to provide for their families. One thing I really love about this organization is when you buy their jewelry it comes in a box with a picture and short description of the woman who spent tedious hours making your necklace or earrings. You could even use that picture to remember to pray for that woman and her family too. Here is their website so you can browse through their items! 2. Share the gospel with your hairstylist! If your hairstylist is not a Christian you have such an amazing opportunity to share your testimony and the gospel! Hairstylists are opened to listing to you since you will be there for at least thirty minutes. Take the initiative right away and start the conversation. Here are a few helpful questions that will get the conversation started: Have you ever heard my story of how God changed my life? Can I share one thing I’ve found most important to me? What has been your experience with Christianity? What do you think about Jesus? Those are just a few examples but I hope you find the time to try them out on your hairstylist and see where the conversation goes. The best part of this conversation is it can continue at your next hair appointment!3. Be courteous when you go shopping! In college I worked at Target. I loved working there because of all the cute clothes and shoes that I could get on my work discount but the thing that I dreaded the most were the inconsiderate shoppers. Working retail is no easy job. You are on your feet the entire day. You spend hours neatly folding clothes and in one second some lady comes through unfolds about twenty shirts throws them down walks away and you have to spend another hour re-folding the same shirts. Imagine what kind of witness for Christ you could be if you were considerate when you unfolded clothes by refolding them again, or turning and thanking the worker for all their hard work and acknowledge them by asking “how have you been today, has it been a tough day for you, is there anyway I can be praying for you today?” This might lead into a longer conversation or it may just end up a short conversation but the impression you made to that retail worker will last a lot longer than that and it will show them God’s kindness and love through you. 4. Make a statement with your clothes! Kylie Bisutti’s new clothing line God Inspired Fashion is a great place to look for cute clothes and accessories with scripture verses embroidered on them for you, your kids, and there’s even stuff for the men in your life too!
However it’s also inspiring to hear what Kylie did, or rather what she gave up and why, before starting this very stylish Christian clothing brand. Kylie Bisutti’s won the Victoria's Secret Angel Search in 2009, when she was 19 and newly married, this win came with a multimillion-dollar contract as a lingerie model with Victoria Secret. She soon began to see that she was not honoring God or her husband as her job asked her to flirt down the Victoria Secret runway and pose provocatively for their ads wearing nothing but lingerie.
In 2012 she gave up her multimillion-dollar contract for her relationship with her husband, and more importantly her relationship with Christ! It’s inspiring seeing a young woman who desires her relationship with God more than a Victoria Secret Modeling contract and millions of dollars, and inspiring to see that she is now using her love for God and fashion together for the great commission. Here is the website for God Inspired Fashion if you want to check it out, you can even e-mail prayer requests to the prayer team of God Inspired Fashion and they will pray for you! As you can see fashion is a valuable tool that can be used in many different ways in the great commission, and it doesn’t have to stop with the four key ideas I shared. The possibilities are endless! Even wearing modest clothes can make a statement and start a conversation with friends as to why you dress they way that you do. My prayer for you is that God would show you how he wants you to use your fashion for Him and that you would make Him look fabulous to this world!
Did you benefit from this?
If so, we have a FREE book for you! All of this and more is in our brand new book, Missional Life; A Practical Guide to Living in Light of Eternity. Sign up here.
About Hope
Hope McCleary graduated from Mesa State College with a degree in Mass Communications. After graduating she spent two years working in local news at KKCO 11 News in Grand Junction, Co. She decided to give up her career in the media to share the message of Christ full-time. She joined full-time staff with Master Plan Ministries the summer of 2012 and got married to Forrest McCleary in September of 2012. Through her own personal ups and downs in college Hope has a heart for college women understand their worth as God’s daughters, to see them grow in their faith, to grow in the unique gifts God has given them, and to stand firm in their faith even with the pressures of the world all around them. Hope’s interests include world and local missions, photography, singing, playing guitar and writing music, reading, meeting new people, coffee, and hiking.
Want to read more from this contributor? Put her name in the search box at the top. Sharing this article over at these awesome blogs
There’s that one area of the store you constantly avoid. That item of clothing that you absolutely LOATHE buying. Maybe it’s swim suits, maybe it’s pants, for me- it’s dresses. I hate buying dresses with everything in me. I have a figure that isn’t suited to most dresses- I’m radically different sizes on top and on bottom, plus I’m wicked short so almost no dress fits me the right way. Every time that one of my sweet friends asks me to be a bridesmaid in their wedding I have a moment of sheer terror- “What if they pick an ugly bridesmaid dress?” Now let me just put your thoughts to rest, so far I’ve only been in weddings with the kindest and most gracious brides- allowing each of us to pick dresses that suit our style and body type. I realize what a serious blessing that is! But what a crazy selfish mind I have to let that be my first thought! Instead of being honored and humbled that my friend considers me special enough to stand next to her on such an important day my focus immediately turns to my bad body image! “I look horrible in _____________” We’ve all said it. We’ve all thought it. And maybe it’s true. Maybe you just should avoid bright colors, or you should choose boot cut jeans over skinnies, or stick with brown boots over black. But what if the root of that is deeper? What if it isn’t just a matter of style or knowing what suits your figure best? What if the issue is about our focus? When those words “I look horrible in ______” come out of our mouth, our focus is ultimately about ourselves. How we look, how we feel and what other people think about us. I don’t want to be one of those girls who bashes society and blames commercialism for how I view myself, but I think it’s true. We live in a society where how we look matters, where impressing others is the norm. We are conditioned to think we need ________ to make us happy, pretty, sexy, fulfilled. And the root of it for me always come down to one thing- my eyes are fixed on the temporary. The things that will pass away. My constant battle in the mall and the mirror is not looking at myself, but rather on Christ who gave me life. Our negative self-talk must be replaced with positive “God-talk” (I know that may be the cheesiest sentence ever written but stick with me for a minute…) When we replace ourselves with God, He shines through us. Instead of projecting our insecurities and fears, people see in us love, joy, peace, patience, kindness, gentleness, goodness, faithfulness and self-control. They will see Jesus through us. The next time you stare at a mirror and think “I look horrible”, take control of your thoughts! Replace that thought with “God is good” or “How merciful is our Savior” or some other praise to God. And then go out confident! Shining as the woman Christ made you to be!
About Angi
Angi loves Jesus, coffee, baseball and baking cakes. She is a missionary to college students and can't think of anything she'd rather do to serve God. Angi first met the Lord while climbing Mt. Kilimanjaro in Tanzania, Africa but really understood His love and grace as a freshman in college. Her heart is to invest in college students in the same way that many others invested in her. You can find her blogging over at Stuff Angi Does where she tells stories about Jesus, college students, and life. You can also find her on facebook, twitter, pintrest and instagram.
If you could use a simple daily decision, something you do everyday, to fight for justice in our world...would you do it?
I'm guessing you answered "yes," right? Who wouldn't when it is truly that simple?
Our God is so terrifically creative that He has inspired people to create and use fashion and jewelry for His glory. Even more stunning, they also can be utilized to fight injustice across the globe! The scope of God even stretches into fashion--isn't He surprisingly dynamic?
I was picking up our Christmas pictures at Wal-Mart the other day and on my way out noticed a couple cute pair of earrings for $3. $3 friends! How in the world can I not get these adorable earrings for $3!? Even if they would only last a month, they are still super cute for that month right!?
Needless to say I'm a sucker for an almost too good to be true offer. Ya know that feeling that you got ripped off. I hate that feeling. Overpaying which in my mind equals wasting money is a pet peeve of mine. I'm not sure if this is mainly a Colorado thing or if it was how I was raised but I'm just not into paying for a label or paying for something when I know I can get it cheaper somewhere else. |
@sidebar-nav-prefix: ~'.sidebar-nav';
@sidebar-nav-arrow-width: 10px;
@{sidebar-nav-prefix} {
display: block;
margin: 0;
padding: 0;
font-size: @alain-default-aside-nav-fs;
&__item {
position: relative;
display: flex;
flex-direction: column;
border-left: 3px solid transparent;
transition: border-left-color 0.4s ease;
&-link {
position: relative;
display: block;
padding: @alain-default-aside-nav-padding-top-bottom @alain-default-aside-nav-padding-left-right * 2
@alain-default-aside-nav-padding-top-bottom @alain-default-aside-nav-padding-left-right;
overflow: hidden;
color: @alain-default-aside-nav-text-color;
white-space: nowrap;
text-decoration: none !important;
text-overflow: ellipsis;
user-select: none;
&:hover {
color: @alain-default-aside-nav-text-hover-color;
}
}
&-icon {
display: inline-block;
min-width: @alain-default-aside-nav-icon-width;
margin-right: @layout-gutter;
transition: font-size 0.15s @ease-out, margin 0.3s @ease-in-out;
}
&-img {
width: @alain-default-aside-nav-img-wh;
height: @alain-default-aside-nav-img-wh;
}
&-text {
opacity: 1;
transition: opacity 0.3s @ease-in-out, width 0.3s @ease-in-out;
}
&-disabled {
cursor: default;
opacity: 0.6;
&:hover {
color: @alain-default-aside-nav-text-color;
}
}
}
// Selected
&__selected {
background-color: @alain-default-aside-nav-selected-bg;
border-left-color: @alain-default-aside-nav-selected-text-color;
> @{sidebar-nav-prefix}__item-link {
color: @alain-default-aside-nav-selected-text-color;
}
}
// Open Submenu
&__open {
> @{sidebar-nav-prefix}__sub {
display: block;
animation: fadeIn 0.5s;
}
> @{sidebar-nav-prefix}__item-link {
@{sidebar-nav-prefix}__sub-arrow {
transform: translateY(-2px);
&::before {
transform: rotate(45deg) translateX(2px);
}
&::after {
transform: rotate(-45deg) translateX(-2px);
}
}
}
}
&__group-title {
padding: @alain-default-aside-nav-padding-top-bottom @layout-gutter * 2;
color: @alain-default-aside-nav-group-text-color;
}
&__sub {
display: none;
overflow: hidden;
@{sidebar-nav-prefix}__item {
border-left: 0 !important;
}
&-arrow {
position: absolute;
top: 50%;
right: @alain-default-aside-nav-padding-left-right;
width: @sidebar-nav-arrow-width;
transition: transform 0.3s @ease-in-out;
&::before,
&::after {
position: absolute;
width: 6px;
height: 1.5px;
background: #fff;
background-image: linear-gradient(to right, @menu-item-color, @menu-item-color);
border-radius: 2px;
transition: background-color 0.3s @ease-in-out, transform 0.3s @ease-in-out, top 0.3s @ease-in-out;
content: '';
}
&::before {
transform: rotate(-45deg) translateX(2px);
}
&::after {
transform: rotate(45deg) translateX(-2px);
}
}
}
// Badge
.badge {
position: absolute;
right: @layout-gutter * 2;
@badge-height: @layout-gutter * 2;
&:not(.badge-dot) {
top: (@alain-default-aside-nav-item-height - @badge-height) / 2;
height: @badge-height;
padding: 0 4px;
overflow: hidden;
line-height: @badge-height;
}
&-dot {
top: (@alain-default-aside-nav-item-height - @layout-gutter) / 2;
}
}
// Dept
&__depth1 {
@{sidebar-nav-prefix}__item-link {
padding-left: @alain-default-aside-nav-depth1-padding-left + @alain-default-aside-nav-icon-width;
}
}
&__depth2 {
@{sidebar-nav-prefix}__item-link {
padding-left: @alain-default-aside-nav-depth2-padding-left + @alain-default-aside-nav-icon-width;
}
}
&__depth3 {
@{sidebar-nav-prefix}__item-link {
padding-left: @alain-default-aside-nav-depth3-padding-left + @alain-default-aside-nav-icon-width;
}
}
&__depth4 {
@{sidebar-nav-prefix}__item-link {
padding-left: @alain-default-aside-nav-depth4-padding-left + @alain-default-aside-nav-icon-width;
}
}
&__depth5 {
@{sidebar-nav-prefix}__item-link {
padding-left: @alain-default-aside-nav-depth5-padding-left + @alain-default-aside-nav-icon-width;
}
}
// Floating
&__floating {
position: absolute;
z-index: @zindex + 7;
display: none;
min-width: 160px;
background-color: @alain-default-aside-bg;
border: 1px solid @alain-default-content-heading-border;
border-radius: 4px;
@{sidebar-nav-prefix}__item {
&-link {
padding-left: @layout-gutter * 2;
}
}
&-show {
display: block;
}
@{sidebar-nav-prefix}__sub {
display: block;
&-arrow {
display: none;
}
}
// Dept
@{sidebar-nav-prefix}__depth2 {
@{sidebar-nav-prefix}__item-link {
padding-left: @layout-gutter * 3;
}
}
@{sidebar-nav-prefix}__depth3 {
@{sidebar-nav-prefix}__item-link {
padding-left: @layout-gutter * 4;
}
}
@{sidebar-nav-prefix}__depth4 {
@{sidebar-nav-prefix}__item-link {
padding-left: @layout-gutter * 5;
}
}
}
}
@media (min-width: @mobile-min) {
@{alain-default-prefix}__collapsed {
@{sidebar-nav-prefix}:not(@{sidebar-nav-prefix}__sub) {
@{sidebar-nav-prefix}__item {
border: none;
&-link {
display: flex;
justify-content: center;
padding: (@layout-gutter * 3) 0;
@{sidebar-nav-prefix}__item-icon {
margin-right: 0;
font-size: @alain-default-aside-collapsed-nav-fs;
}
@{sidebar-nav-prefix}__item-img {
width: @alain-default-aside-collapsed-nav-img-wh;
height: @alain-default-aside-collapsed-nav-img-wh;
}
@{sidebar-nav-prefix}__item-text {
display: none;
opacity: 0;
}
}
}
@{sidebar-nav-prefix}__group-title {
display: none;
}
}
@{sidebar-nav-prefix} {
&__sub {
display: none !important;
&-arrow {
display: none;
}
}
}
}
}
|
All out to stop the KKK! [poster]
click to zoom
November 5 Mobilization to Stop the KKK in Philadelphia, Philadelphia. [1988], 20x26 inch poster, very good, stylized image of klansmen with burning cross. The Spartacist League played a behind-the-scenes leadership role in the Mobilization. |
Often, even if we do catch a virus, it's not so difficult to eradicate it using installed antivirus—but if your system has been crippled, try using Linux to scan the drive for viruses instead.
As any Linux veteran knows, one of Linux's greatest uses is fixing unbootable drives—recovering files, deleting files, and even killing viruses. For those of you that aren't quite as well-versed in Linux, technology blog gHacks has a tutorial for doing just that, though we recommend a few tweaks to their process.
If you have another machine already running Linux, as gHacks suggests, then you'll have a pretty easy time with this—all you need to do is install some antivirus, hook the infected drive into your Linux machine, and go to town. However, we know that not everyone has an extra Linux machine just floating around—so we recommend using a Live CD with antivirus pre-installed, or, even better, a live USB stick on which you can install antivirus yourself (the USB solution is likely easier in the long run, since I have yet to find a Linux Live CD with a GUI-based antivirus program pre-installed). You'll have to make the live USB yourself, but this is a pretty easy process using previously mentioned Usbuntu Live Creator or UNetbootin. However, these require a working Windows computer, and if your only PC is the infected one, you'll have to download, burn, and boot from the Ubuntu Live CD (available here), and under System > Administration, use their easy-to-use Live USB creator.
After making the Live USB stick, boot into it (you may have to set your boot priority in your BIOS, directions for which can be found in step 2 of this post), and install antivirus on it—gHacks recommends F-Prot, but if you don't want to buy a copy of F-Prot just for this, all of our Hive Five antivirus favorites have Linux versions, and open-source favorite ClamAV (pictured above) is available from Synaptic Package Manager (along with the Clamtk GUI for it—just search for clamav and clamtk in Synaptic [available under System > Administration] and install both packages). Start it up from Applications > System Tools, set it to scan your Windows drive and you're good to go.
G/O Media may get a commission Subscribe and Get Your First Bag Free Promo Code AtlasCoffeeDay20
Note that if your BIOS does not support booting from USB, you'll need to make a boot disk that allows it to—which, unfortunately, requires a bit of command-line-fu, and then you're right back where you started with the command-line-requiring Live CDs. If you know of any Linux Live CDs that contain an Antivirus program with a GUI, let us know in the comments!
Scan a Windows drive for viruses using Linux [gHacks] |
178 Cal.App.3d 1210 (1986)
224 Cal. Rptr. 357
MARILYN VASSALLO, Plaintiff and Appellant,
v.
LLOYD M. LOWREY, JR., et al., Defendants and Respondents.
Docket No. A026245.
Court of Appeals of California, First District, Division One.
February 24, 1986.
*1212 COUNSEL
Herb Schwartz for Plaintiff and Appellant.
Paul R. De Lay, Carmela M. Bowns and De Lay, Laredo & McGowan for Defendants and Respondents.
OPINION
HOLMDAHL, J.
A laid-off community college biology instructor appeals from a judgment denying her petitions to compel partial reinstatement as a biology teacher and issuance of a credential for teaching other subjects.
The judgment is affirmed.
Statement of Facts
In 1973, Hartnell Community College District (hereafter, District) hired appellant Marilyn Vassallo, Ph.D., as a full-time biology instructor. In early *1213 1983, facing declining enrollment and a shrinking budget, District decided to cut a certain number of positions from 20 departments in the following year. Thereafter, District notified 23 employees that their positions would be reduced or eliminated. Appellant's full-time position in the biology department was completely eliminated.
Appellant has a credential to teach only biology. On March 15, 1983, she applied for "limited service credentials" (Cal. Admin. Code, tit. 5, § 52250 et seq.; Ed. Code, § 87292) that would qualify her to teach mathematics and chemistry.
District has standards for determining whether limited credential applicants are competent to teach in a specified subject area. For chemistry teachers, District requires 24 units of college chemistry. Appellant had only 12 units. Similarly, mathematics teachers must have majored in mathematics. Appellant had only a single college course in mathematics. Since she did not meet the academic requirements, and had no experience teaching mathematics or chemistry, District refused her request for a limited service credential.
After District notified appellant of her termination, she requested an administrative hearing. The administrative law judge rejected her claim that she had any seniority over her colleague Bette Nybakken, Ph.D., and ruled that her credential application was late. District adopted the decision of the administrative law judge and laid appellant off.
Procedural History
Appellant filed a petition for a writ of administrative mandamus, seeking reinstatement to 40 percent of a full-time position teaching biology. (Code Civ. Proc., § 1094.5.)[1] She also petitioned for a writ of traditional mandamus, directing District to help her obtain limited mathematics and chemistry credentials. (Code Civ. Proc., § 1086.) The trial court denied both petitions, as well as appellant's request for attorney's fees. (Gov. Code, § 800.) She appeals from the denial of both petitions, and renews her request for attorney's fees.
Seniority of Appellant's Position
(1a) Appellant contends that she is senior to her colleague Dr. Nybakken with respect to 40 percent of a full-time position. Dr. Nybakken was given *1214 60 percent of a full-time equivalent (hereafter, FTE) position in 1969. Appellant began a full-time position (1.0 FTE) in 1973. In 1982, Dr. Nybakken was hired for an additional .4 FTE, giving her a full-time position (1.0 FTE). By appellant's calculation, she has held the last 40 percent of her position longer than Dr. Nybakken has held the last 40 percent of the latter's 1.0 FTE.
According to appellant, to eliminate 1.0 FTE while respecting seniority rights, District should reduce Dr. Nybakken's job by .4 FTE and appellant's job by .6 FTE. Her argument is grounded on her views on educational policy and the "spirit" of the Education Code, especially section 87743.[2]
(2) (See fn. 3.), (3) Section 87743 provides that, when enrollment declines, community college districts may discharge a corresponding percentage of tenured and contract employees.[3] The statute specifically protects tenure rights and seniority. Layoffs must begin with the most recently hired. Furthermore, tenured employees who are competent and properly credentialed must be reassigned to replace junior employees. Thus, section 87743 gives "bumping privileges" to qualified, senior employees, even if their specific post has been eliminated. (See Krausen v. Solano County Junior College Dist., supra, 42 Cal. App.3d 394, 402.) As an addition or alternative to appellant's seniority claim, she also hints that she is different from Dr. Nybakken in terms of tenure: She has tenure to a 1.0 FTE position, while the latter has tenure to .6 FTE and is a contract employee for .4 FTE. Appellant cites Ferner v. Harris (1975) 45 Cal. App.3d 363 [119 Cal. Rptr. 385] as authority for recognizing and giving preference to partial tenure. The case is inapposite, however, since no seniority issue or comparison of employees was involved.[4]
(1b) District argues that under section 87414, a certificated employee has one date for purposes of seniority. District cites an administrative law decision reaching this conclusion under section 44845, the equivalent to *1215 87414, but governing elementary teacher seniority. Section 87414 provides, in part, "Every contract or regular employee employed after June 30, 1947, shall be deemed to have been employed on the date upon which he first rendered paid service in a probationary or contract position." Thus, Dr. Nybakken, who was hired first, was senior to appellant. District contends that seniority, not tenure, must govern staff reductions and reappointments, citing Lacy v. Richmond Unified Sch. Dist. (1975) 13 Cal.3d 469, 475 [119 Cal. Rptr. 1, 530 P.2d 1377].) In Lacy, the court held that the system of layoffs and reassignments set out in sections 87743 and 87744 (then numbered §§ 13447 and 13448) does not incorporate the provisions of the tenure statutes. Layoffs and reassignments depend on seniority and qualifications. (Lacy v. Richmond Unified Sch. Dist., supra, 13 Cal.3d at p. 475.)
The trial court concluded that appellant's proposed theory of "split seniority has equitable appeal," but that section 87414 only provides for a single date for seniority, since if "the [L]egislature intended to provide for seniority in different categories, it would presumably have so stated."
While this appeal depends upon statutory interpretation and, hence, this court may decide such a pure question of law without deference to the trial court's ruling (see Goddard v. South Bay Union High School Dist. (1978) 79 Cal. App.3d 98, 105 [144 Cal. Rptr. 701]), we concur in both the reasoning and conclusion of the trial court. The Education Code does not offer a basis for appellant's "split seniority" analysis. Section 87414 clearly establishes a single date for purposes of seniority. Section 87743 protects seniority and tenure rights by incorporating section 87414 without change. Only a legislative amendment to section 87743 can establish the seniority system that appellant advocates. We decline her invitation to complexify further the Education Code.
Limited Service Credential
A limited service credential is an alternative to the full instructor's credential (Cal. Admin. Code, tit. 5, § 52080) that allows the holder to teach up to 40 percent of a full-time assignment and is further limited as to duration, subject, and location. (Cal. Admin. Code, tit. 5, § 52250 et seq.) Issuance of a limited credential gives community college districts flexibility when they need or want to hire an otherwise uncredentialed person. There are several bases for issuing the credential, one of which gives the college a measure of discretion. (Cal. Admin. Code, tit. 5, § 52255, subd. (c)(2).) A district may decide to hire an uncredentialed but otherwise qualified person, and apply to the Board of Governors of the California Community Colleges on behalf of that person for a limited credential. (§ 87250 et seq.)
*1216 (4) Appellant contends that she is qualified to teach mathematics and chemistry. Therefore, District has a duty to reassign her "to render any service which [her] seniority and qualifications entitle [her] to render." (§ 87743; Krausen v. Solano County Junior College Dist., supra, 42 Cal. App.3d 394, 402.) Since appellant would need a new credential to teach anything outside of biology, she argues District's duty under section 87743 includes helping her obtain a "limited service credential." The duty is mandatory, she argues, and leaves no room for discretion or comparison of her academic qualifications to those of others. (See Martin v. Kentfield School Dist. (1983) 35 Cal.3d 294, 299 [197 Cal. Rptr. 570, 673 P.2d 240].) Appellant asserts that her application for the limited credential was timely.
No authority supports appellant's contention that the seniority system relates to the credentialing process. We must analyze the denial of appellant's application separately from her seniority and tenure claims, discussed previously. (Cf. Taylor v. Board of Trustees (1984) 36 Cal.3d 500 [204 Cal. Rptr. 711, 683 P.2d 710] ["automatic" reemployment under § 44918 nevertheless requires credential].)
District contends that the California Administrative Code provisions relating to limited service credentials and cases interpreting reemployment rights of laid-off teachers accord it discretion to set standards of competence. (Cal. Admin. Code, tit. 5, §§ 52000, subd. (b), 52255, subd. (c)(2); see King v. Berkeley Unified School Dist. (1979) 89 Cal. App.3d 1016, 1023 [152 Cal. Rptr. 782].) District asserts that appellant does not meet its standards. District also asserts that her application was late.
Appellant's claim that her application was timely rests on Wellbaum v. Oakdale Joint Union High School Dist. (1977) 70 Cal. App.3d 93 [138 Cal. Rptr. 553]. In Wellbaum a foreign language teacher was given proper notice on April 29, 1974, that the district had formally decided to lay her off. The next day she received a credential to teach English. The teacher was still employed until June 30. In early June, three English teaching vacancies opened. The Court of Appeal held that section 13447 (now 87743) mandated the teacher's reassignment to one of the vacancies. No "bumping" or layoffs were necessary.
We agree with the administrative law judge, the trial court, and District, however, that appellant's application was too late. (See Campbell Elementary Teachers Assn., Inc. v. Abbott (1978) 76 Cal. App.3d 796, 814-815 [143 Cal. Rptr. 281].) In Campbell a certified counselor was laid off. The counselor also had a teaching credential that would have entitled her to be reassigned as a teacher, but it was not recorded with the county board of education in time for the school district to consider it. Section 87740, subdivision *1217 (a), requires community college districts to send all termination notices by March 15 of the preceding academic year. Since such districts cannot add to the layoff list after March 15, sometime before that date such districts must consider the seniority and credentials of all employees to be laid off, reassigned, or "bumped." Thus, credentials recorded after March 15 cannot be used by a teacher to assert bumping or reassignment rights. (Campbell Elementary Teachers Assn., Inc. v. Abbott, supra, 76 Cal. App.3d at p. 815.)
In appellant's situation, her reassignment to a mathematics or chemistry position would necessitate layoffs. Therefore, Campbell, not Wellbaum, applies. Since appellant applied for a credential on March 15, there was no possibility that she would receive and record a credential in time for District to send out termination notices. Therefore, the application was late, and did not have to be considered.[5]
Since appellant's application was untimely, we do not review District's alternate justification for denying her application, based on academic standards it has developed.
Request for Attorney's Fees
We deny appellant's request for attorney's fees pursuant to Government Code section 800, since we have concluded that District did not act arbitrarily or capriciously.
The judgment denying appellant's application for writs of administrative and traditional mandamus is affirmed.
Racanelli, P.J., and Elkington, J., concurred.
A petition for a rehearing was denied March 14, 1986. Appellant's petition for review by the Supreme Court was denied May 21, 1986.
NOTES
[1] Appellant's petition names Lloyd W. Lowrey, Jr., and seven other respondents as members of District's board of trustees. District, as such, was not named as a party.
[2] Hereafter, all statutory references are to the Education Code.
[3] The Education Code recognizes three types of certificated employees: temporary, contract, and regular. (§ 87400 et seq.) Temporary employees have no vested rights. "Contract" employees begin to earn seniority. (Krausen v. Solano County Junior College Dist. (1974) 42 Cal. App.3d 394, 403 [116 Cal. Rptr. 833].) They have probationary tenure-track positions. Finally, after two years, a contract employee can become "regular," i.e. "permanent," or tenured, if the district extends his or her contract (§ 87609.).
[4] In Ferner the question was whether a partially tenured teacher, laid off after program cuts, had statutory reassignment rights to a full-time vacancy that opened the next year. The district offered the teacher a fraction of the position, but the Court of Appeal held that the teacher's tenure gave him a right to the entire position. The court emphasized that the case involved one teacher and his tenure relationship to the district, not seniority relationships between teachers. (Ferner v. Harris, supra, 45 Cal. App.3d at pp. 368-369.)
[5] No apparent reason prevents appellant from reapplying. Her qualifications, possibly along with those of other applicants, would then be determined, and without regard to her seniority as a biology instructor.
|
The Athletic keeps growing .......
I know The Athletic isn't a traditional news outlet, but one thing that annoys me is how slow the writers are to post content. I just looked and they have nothing about the Bears loss and nothing about Tom Thibodeau getting fired. They are probably writing fluff pieces about both situations...
Click to expand...
I like it. It's like The Athletic suits are telling their writers they value them and are giving them some time to write their pieces. Everybody knows who won and who lost and rather than having them write some drivel for immediate page views, trash for immediate page views, the Athletic suits let their reporters attack postgame. Newspaper suits work their reporters way too hard, demanding twitter posts, halftime updates, instant game stories, then videos and other postgame stories and video analysis. That's simply too much work. Kudos to the Athletic suits for treating their writers as special human beings, not machines.
I know The Athletic isn't a traditional news outlet, but one thing that annoys me is how slow the writers are to post content. I just looked and they have nothing about the Bears loss and nothing about Tom Thibodeau getting fired. They are probably writing fluff pieces about both situations...
Click to expand...
Moddy can correct me if I'm wrong, but if one believes teh Twitterez, didn't The Athletic's T'wolves beat guy, a former AP reporter, break the story first?
Moddy can correct me if I'm wrong, but if one believes teh Twitterez, didn't The Athletic's T'wolves beat guy, a former AP reporter, break the story first?
Click to expand...
Since the firing reportedly came about 30 minutes after a home game, with local media still on the premises and the media work room about 50 feet from the locker room, I sure as hell would hope somebody on the scene would break it.
Nothing mysterious about it - I've replied to countless people who have reached out to me (and admit I may have missed a couple because I have received and continue to receive a lot of inquiries).
The positions have drawn considerable interest. Many applications to sort through and nothing is going to get rushed. Interviews are being done this week. If you haven't heard from us yet, it doesn't mean you won't but these spots will be filled fairly soon.
So many job openings. So much money tied up in just those openings. It's interesting the Athletic can take on all that salary. Somebody out there is sold on the old model of subscription based writing. I repeat what I've asked before. Is The Athletic going to be a huge hit financially? Or not? |
It Raineth Every Day
Day 133 of A Year of War and Peace
King Lear took an odd approach to estate planning. He was more desirous of hearing his name praised than of adequately managing the disposition of his lands so he decided to bequeath the largest portions of his kingdom to whomever of his three daughters most effusively declared their love for him. Unfortunately, obsequious deceit is more endearing than candid honesty and anger born of disappointment breeds tragedy. That’s the lesson of Lear who disowns his most favored daughter, Cordelia, when she fails to acceptably praise him. Instead he gives his lands to his two unscrupulous daughters and before the end of the play almost everyone is dead because of it.
There is only the slimmest of chances that Nikolai Rostov’s decision in this chapter will lead to either a crisis of British royal succession or a great Shakespearean tragedy, but the young man will, as he has so many times before now, face the trial of responding reasonably to a desire denied. In today’s chapter that desire is the capture of a wolf on the hunt.
Nikolai doesn’t want to be like his father. He doesn’t want to be a failure. He wants to prove himself. In this chapter he needs, more than anything, to catch a wolf to do so. He prays for it. He dreads failure and dwells on his unlucky past. Attentive readers, familiar with his character, can already sense the anger brewing inside of him.
When a wolf finally appears, however, it seems as if his luck is changing. The wolf heads right for him. He sets his borzoi upon it.
But the wolf escapes and Rostov despairs, though not for long. Danilo, one of the Rostov’s huntsmen, ends up trapping the wolf. He and Nikolai then bring the bound and gagged animal before the rest of the party for examination.
Things don’t end so badly for Nikolai today. He does catch the wolf, albeit with the assistance of his huntsman, Danilo. Still, one can easily imagine a poor response to failure on his part. We’ve seen Rostov, time and again, lose his patience and explode in anger when he doesn’t get what he wants. There is, however, a slight change in his character in today’s chapter. It’s subtle but it’s there.
We see it when the wolf appears to have escaped him. His response isn’t one of anger but, rather, despair. That may not seem like much of a change — despair is still a negative emotion — but he does appear to respond less intensely than usual to his disappointment. It’s important that Rostov continue to moderate his response to disappointment for, as Lear’s Fool puts it:
He that has and a little tiny wit,
With hey, ho, the wind and the rain,
Must make content with his fortunes fit,
Though the rain it raineth every day.
DAILY MEDITATION |
Backstreet
A temperamental, twitchy bundle of tightly-wound circuits. Jumps from one mode to another at the drop of a gasket. Constantly jumping to the wrong conclusions. Headlights equipped with high-intensity heat rays that turn enemy robots into molten steel. Fires 2 independent, targetable, laser-guided proton missile cannons. Able to accelerate up to 400 mph for 60 seconds, using rear rocket thrusters. |
Inactivation of Lactobacillus plantarum WCFS1 during spray drying and storage assessed with complementary viability determination methods.
Survival of Lactobacillus plantarum WCFS1 spray-dried and stored under different conditions was investigated using complementary methods. One method involved a cell membrane integrity viability-based determination, the other assessed cell growth behavior in a liquid medium by means of detection time or by conventional plating. Survival decreased below 95% when spray drying was carried out at higher outlet spray drying temperatures (Tout>70°C). However, the membrane integrity method provided higher residual viability values compared to the detection time and conventional plating. This suggests that loss of viability may be due to a combination of damage to intracellular components and cell membrane. Also during storage viability based on growth behavior declined faster and was more temperature dependent compared to the viability as determined by the membrane integrity method. Also here additional damage to intracellular components is expected responsible to loss of viability. Major conclusion is that one should not only rely on a cell-membrane integrity based method to assess survival during spray drying and storage of bacteria. Previous studies that did so most probably underestimated viability as critical damage to intracellular components was not assessed. |
Archive for the ‘Holistic Healing with Everyday Foods’ Category
Like my mother, I have always had a bountiful crop of tomatoes. More so than our surrounding neighbours.
This year, I experimented with planting some heritage tomato varieties, including a beautiful yellow-orange one that tastes remarkably like the blood-red beefsteak tomatoes that my mother used to grow in the 1950’s.
Extremely tasty! And low acid, too! I [...]
The healing effects of the aloe vera combined with the cooling of the cucumber and the avocado make this Refreshing Green Facial Recipe a very effective sunscreen, or after the fact as a sunburn-soother and healer. The ingredients in this version of Refreshing Green Facial are perfect for improving your overall skin health by deep [...]
These 10 nutrient-rich foods will help give you more energy, glowing skin, boost brain power, a stronger immunity, faster metabolism, enhance your mood…..in short, including these powerhouse foods in your diet will help change your life for the better! It’s easy to sneak them into your diet, so that the whole family will benefit. Recipes [...]
Know the Difference between a Cold and the H1N1 Flu:Symptoms
Symptoms are easily spelled out here to help you differenciate between a common cold and the flu. More identifications and cold home-remedies are available on this betweenclosefriends.com blog in Herbal Teas, Holistic Healing and Natural Herbal Remedies. The most important [...]
Hello everyone, this email was sent to me today by a very reliable friend. I have often heard of and seen natural remedies for several different maladies throughout the years, and obviously promote them here. This one is too good not to share with you, immediately. I am reminded of my mother (and [...]
Whether it is the middle of summer or the middle of winter, we can all benefit from an undisturbed soak in a relaxing and calming bath. Especially in these uncertain times.
Let our thoughts drift as we unwind, with cares and troubles following and dissipating. A bubble bath is wonderful, such as Lavender Bubble Bath [...]
Either with winter’s drying winds or summers chaffing heat, dry skin is universal. We have all suffered the ill effects that the seasons have caused our sensitive skin.
This wonderful healing and Soothing Lavender Body Butter is so very easy and inexpensive to make, that you will want to prepare a large batch for yourself, friends [...]
This is my favourite salad dressing for a spinach salad! This Buttermilk Herb Dressing reminds me so much of the delectable dressing that Cultures uses. The parsley and wine vinegar are so healthy!
Sometimes I will add a few cut up strawberries to my salad as well, just for a little variation. Or, sprinkle a few [...]
Below are listed some foods that play an important role in the anti-aging skin saga. Being aware of these powerhouse foods, and more importantly, making them a part of your daily diet and consuming them on a regular basis, will help you to have young radiant skin and optimal health. (For herbal recipes; all natural [...]
Avocados are great on salads, but did you know that avocado oil has superior powers when it comes to slowing skin problems such as dermatitis and eczema, which can be aggravated by dry conditions? Applied directly to any itchy, red or irritated areas of skin provides almost instant relief which can last for several days.
But [...] |
// !$*UTF8*$!
{
archiveVersion = 1;
classes = {
};
objectVersion = 39;
objects = {
089C165FFE840EACC02AAC07 = {
children = (
089C1660FE840EACC02AAC07,
);
isa = PBXVariantGroup;
name = InfoPlist.strings;
refType = 4;
sourceTree = "<group>";
};
089C1660FE840EACC02AAC07 = {
fileEncoding = 10;
isa = PBXFileReference;
lastKnownFileType = text.plist.strings;
name = English;
path = English.lproj/InfoPlist.strings;
refType = 4;
sourceTree = "<group>";
};
//080
//081
//082
//083
//084
//100
//101
//102
//103
//104
1058C7A6FEA54F5311CA2CBB = {
children = (
1058C7A7FEA54F5311CA2CBB,
1058C7A80EA54F5311CA2CBB,
);
isa = PBXGroup;
name = "Linked Frameworks";
refType = 4;
sourceTree = "<group>";
};
1058C7A7FEA54F5311CA2CBB = {
isa = PBXFileReference;
lastKnownFileType = wrapper.framework;
name = Cocoa.framework;
path = /System/Library/Frameworks/Cocoa.framework;
refType = 0;
sourceTree = "<absolute>";
};
1058C7A80EA54F5311CA2CBB = {
isa = PBXFileReference;
lastKnownFileType = wrapper.framework;
name = RubyCocoa.framework;
path = /Library/Frameworks/RubyCocoa.framework;
refType = 0;
sourceTree = "<absolute>";
};
1058C7A8FEA54F5311CA2CBB = {
children = (
2A37F4C5FDCFA73011CA2CEA,
7788DA0506752A1600599AAD,
2A37F4C4FDCFA73011CA2CEA,
);
isa = PBXGroup;
name = "Other Frameworks";
refType = 4;
sourceTree = "<group>";
};
//100
//101
//102
//103
//104
//190
//191
//192
//193
//194
19C28FB0FE9D524F11CA2CBB = {
children = (
8D15AC370486D014006FF6A4,
);
isa = PBXGroup;
name = Products;
refType = 4;
sourceTree = "<group>";
};
//190
//191
//192
//193
//194
//2A0
//2A1
//2A2
//2A3
//2A4
2A37F4A9FDCFA73011CA2CEA = {
buildSettings = {
};
buildStyles = (
4A9504D0FFE6A4CB11CA0CBA,
4A9504D1FFE6A4CB11CA0CBA,
);
hasScannedForEncodings = 1;
isa = PBXProject;
mainGroup = 2A37F4AAFDCFA73011CA2CEA;
projectDirPath = "";
targets = (
8D15AC270486D014006FF6A4,
);
};
2A37F4AAFDCFA73011CA2CEA = {
children = (
2A37F4ABFDCFA73011CA2CEA,
E1B74B1A0667B4A90069E3BA,
2A37F4AFFDCFA73011CA2CEA,
2A37F4B8FDCFA73011CA2CEA,
2A37F4C3FDCFA73011CA2CEA,
19C28FB0FE9D524F11CA2CBB,
);
isa = PBXGroup;
name = "«PROJECTNAMEASXML»";
path = "";
refType = 4;
sourceTree = "<group>";
};
2A37F4ABFDCFA73011CA2CEA = {
children = (
8D15AC362486D014006FF6A4,
);
isa = PBXGroup;
name = Classes;
path = "";
refType = 4;
sourceTree = "<group>";
};
2A37F4AFFDCFA73011CA2CEA = {
children = (
32DBCF750370BD2300C91783,
2A37F4B0FDCFA73011CA2CEA,
);
isa = PBXGroup;
name = "Other Sources";
path = "";
refType = 4;
sourceTree = "<group>";
};
2A37F4B0FDCFA73011CA2CEA = {
fileEncoding = 4;
isa = PBXFileReference;
lastKnownFileType = sourcecode.c.objc;
path = main.m;
refType = 4;
sourceTree = "<group>";
};
2A37F4B4FDCFA73011CA2CEA = {
children = (
2A37F4B5FDCFA73011CA2CEA,
);
isa = PBXVariantGroup;
name = MyDocument.nib;
path = "";
refType = 4;
sourceTree = "<group>";
};
2A37F4B5FDCFA73011CA2CEA = {
isa = PBXFileReference;
lastKnownFileType = wrapper.nib;
name = English;
path = English.lproj/MyDocument.nib;
refType = 4;
sourceTree = "<group>";
};
2A37F4B6FDCFA73011CA2CEA = {
children = (
2A37F4B7FDCFA73011CA2CEA,
);
isa = PBXVariantGroup;
name = MainMenu.nib;
path = "";
refType = 4;
sourceTree = "<group>";
};
2A37F4B7FDCFA73011CA2CEA = {
isa = PBXFileReference;
lastKnownFileType = wrapper.nib;
name = English;
path = English.lproj/MainMenu.nib;
refType = 4;
sourceTree = "<group>";
};
2A37F4B8FDCFA73011CA2CEA = {
children = (
2A37F4B9FDCFA73011CA2CEA,
2A37F4B6FDCFA73011CA2CEA,
2A37F4B4FDCFA73011CA2CEA,
8D15AC360486D014006FF6A4,
8D15AC361486D014006FF6A4,
089C165FFE840EACC02AAC07,
);
isa = PBXGroup;
name = Resources;
path = "";
refType = 4;
sourceTree = "<group>";
};
2A37F4B9FDCFA73011CA2CEA = {
children = (
2A37F4BAFDCFA73011CA2CEA,
);
isa = PBXVariantGroup;
name = Credits.rtf;
path = "";
refType = 4;
sourceTree = "<group>";
};
2A37F4BAFDCFA73011CA2CEA = {
isa = PBXFileReference;
lastKnownFileType = text.rtf;
name = English;
path = English.lproj/Credits.rtf;
refType = 4;
sourceTree = "<group>";
};
2A37F4C3FDCFA73011CA2CEA = {
children = (
1058C7A6FEA54F5311CA2CBB,
1058C7A8FEA54F5311CA2CBB,
);
isa = PBXGroup;
name = Frameworks;
path = "";
refType = 4;
sourceTree = "<group>";
};
2A37F4C4FDCFA73011CA2CEA = {
isa = PBXFileReference;
lastKnownFileType = wrapper.framework;
name = AppKit.framework;
path = /System/Library/Frameworks/AppKit.framework;
refType = 0;
sourceTree = "<absolute>";
};
2A37F4C5FDCFA73011CA2CEA = {
isa = PBXFileReference;
lastKnownFileType = wrapper.framework;
name = Foundation.framework;
path = /System/Library/Frameworks/Foundation.framework;
refType = 0;
sourceTree = "<absolute>";
};
//2A0
//2A1
//2A2
//2A3
//2A4
//320
//321
//322
//323
//324
32DBCF750370BD2300C91783 = {
fileEncoding = 4;
isa = PBXFileReference;
lastKnownFileType = sourcecode.c.h;
path = "«PROJECTNAME»_Prefix.pch";
refType = 4;
sourceTree = "<group>";
};
//320
//321
//322
//323
//324
//4A0
//4A1
//4A2
//4A3
//4A4
4A9504D0FFE6A4CB11CA0CBA = {
buildSettings = {
COPY_PHASE_STRIP = NO;
GCC_DYNAMIC_NO_PIC = NO;
GCC_ENABLE_FIX_AND_CONTINUE = YES;
GCC_GENERATE_DEBUGGING_SYMBOLS = YES;
GCC_MODEL_TUNING = G5;
GCC_OPTIMIZATION_LEVEL = 0;
PREBINDING = NO;
ZERO_LINK = NO;
};
isa = PBXBuildStyle;
name = Development;
};
4A9504D1FFE6A4CB11CA0CBA = {
buildSettings = {
COPY_PHASE_STRIP = YES;
GCC_ENABLE_FIX_AND_CONTINUE = NO;
GCC_MODEL_TUNING = G5;
PREBINDING = NO;
ZERO_LINK = NO;
};
isa = PBXBuildStyle;
name = Deployment;
};
//4A0
//4A1
//4A2
//4A3
//4A4
//770
//771
//772
//773
//774
775BDEF0067A8BF0009058FE = {
fileEncoding = 4;
isa = PBXFileReference;
lastKnownFileType = wrapper.xcdatamodel;
path = MyDocument.xcdatamodel;
refType = 4;
sourceTree = "<group>";
};
775BDEF1067A8BF0009058FE = {
fileRef = 775BDEF0067A8BF0009058FE;
isa = PBXBuildFile;
settings = {
};
};
775DFF38067A968500C5B868 = {
fileRef = 1058C7A7FEA54F5311CA2CBB;
isa = PBXBuildFile;
settings = {
};
};
775DFF38067A968500C5B869 = {
fileRef = 1058C7A80EA54F5311CA2CBB;
isa = PBXBuildFile;
settings = {
};
};
775DFF39067A968500C5B868 = {
fileRef = 1058C7A80EA54F5311CA2CBB;
isa = PBXBuildFile;
settings = {
};
};
7788DA0506752A1600599AAD = {
isa = PBXFileReference;
lastKnownFileType = wrapper.framework;
name = CoreData.framework;
path = /System/Library/Frameworks/CoreData.framework;
refType = 0;
sourceTree = "<absolute>";
};
//770
//771
//772
//773
//774
//8D0
//8D1
//8D2
//8D3
//8D4
8D15AC270486D014006FF6A4 = {
buildPhases = (
8D15AC2B0486D014006FF6A4,
8D15AC300486D014006FF6A4,
8D15AC330486D014006FF6A4,
);
buildRules = (
);
buildSettings = {
GCC_ENABLE_OBJC_EXCEPTIONS = YES;
GCC_GENERATE_DEBUGGING_SYMBOLS = NO;
GCC_MODEL_TUNING = G5;
GCC_PRECOMPILE_PREFIX_HEADER = YES;
GCC_PREFIX_HEADER = "«PROJECTNAME»_Prefix.pch";
GCC_WARN_ABOUT_RETURN_TYPE = YES;
GCC_WARN_UNUSED_VARIABLE = YES;
INFOPLIST_FILE = Info.plist;
INSTALL_PATH = "$(HOME)/Applications";
PREBINDING = NO;
PRODUCT_NAME = "«PROJECTNAME»";
WRAPPER_EXTENSION = app;
};
dependencies = (
);
isa = PBXNativeTarget;
name = "«PROJECTNAME»";
productInstallPath = "$(HOME)/Applications";
productName = "«PROJECTNAME»";
productReference = 8D15AC370486D014006FF6A4;
productType = "com.apple.product-type.application";
};
8D15AC2B0486D014006FF6A4 = {
buildActionMask = 2147483647;
files = (
8D15AC2C0486D014006FF6A4,
8D15AC2D0486D014006FF6A4,
8D15AC2E0486D014006FF6A4,
8D15AC2F0486D014006FF6A4,
8D15AC2F0486D014006FF6A5,
8D15AC2F0486D014006FF6A6,
);
isa = PBXResourcesBuildPhase;
runOnlyForDeploymentPostprocessing = 0;
};
8D15AC2C0486D014006FF6A4 = {
fileRef = 2A37F4B9FDCFA73011CA2CEA;
isa = PBXBuildFile;
settings = {
};
};
8D15AC2D0486D014006FF6A4 = {
fileRef = 2A37F4B6FDCFA73011CA2CEA;
isa = PBXBuildFile;
settings = {
};
};
8D15AC2E0486D014006FF6A4 = {
fileRef = 2A37F4B4FDCFA73011CA2CEA;
isa = PBXBuildFile;
settings = {
};
};
8D15AC2F0486D014006FF6A4 = {
fileRef = 089C165FFE840EACC02AAC07;
isa = PBXBuildFile;
settings = {
};
};
8D15AC2F0486D014006FF6A5 = {
fileRef = 8D15AC361486D014006FF6A4;
isa = PBXBuildFile;
settings = {
};
};
8D15AC2F0486D014006FF6A6 = {
fileRef = 8D15AC362486D014006FF6A4;
isa = PBXBuildFile;
settings = {
};
};
8D15AC300486D014006FF6A4 = {
buildActionMask = 2147483647;
files = (
8D15AC320486D014006FF6A4,
775BDEF1067A8BF0009058FE,
);
isa = PBXSourcesBuildPhase;
runOnlyForDeploymentPostprocessing = 0;
};
8D15AC320486D014006FF6A4 = {
fileRef = 2A37F4B0FDCFA73011CA2CEA;
isa = PBXBuildFile;
settings = {
ATTRIBUTES = (
);
};
};
8D15AC330486D014006FF6A4 = {
buildActionMask = 2147483647;
files = (
775DFF38067A968500C5B868,
775DFF38067A968500C5B869,
);
isa = PBXFrameworksBuildPhase;
runOnlyForDeploymentPostprocessing = 0;
};
8D15AC360486D014006FF6A4 = {
fileEncoding = 4;
isa = PBXFileReference;
lastKnownFileType = text.plist;
path = Info.plist;
refType = 4;
sourceTree = "<group>";
};
8D15AC361486D014006FF6A4 = {
fileEncoding = 4;
isa = PBXFileReference;
lastKnownFileType = text.script.ruby;
path = rb_main.rb;
refType = 4;
sourceTree = "<group>";
};
8D15AC362486D014006FF6A4 = {
fileEncoding = 4;
isa = PBXFileReference;
lastKnownFileType = text.script.ruby;
path = MyDocument.rb;
refType = 4;
sourceTree = "<group>";
};
8D15AC370486D014006FF6A4 = {
explicitFileType = wrapper.application;
includeInIndex = 0;
isa = PBXFileReference;
path = "«PROJECTNAME».app";
refType = 3;
sourceTree = BUILT_PRODUCTS_DIR;
};
//8D0
//8D1
//8D2
//8D3
//8D4
//E10
//E11
//E12
//E13
//E14
E1B74B1A0667B4A90069E3BA = {
children = (
775BDEF0067A8BF0009058FE,
);
isa = PBXGroup;
name = Models;
refType = 4;
sourceTree = "<group>";
};
};
rootObject = 2A37F4A9FDCFA73011CA2CEA;
}
|
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this file,
* You can obtain one at http://mozilla.org/MPL/2.0/. */
const appConfig = require('./constants/appConfig')
const Immutable = require('immutable')
const settings = require('./constants/settings')
const config = require('./constants/config')
const {passwordManagers, defaultPasswordManager, extensionIds, displayNames} = require('./constants/passwordManagers')
const {bookmarksToolbarMode} = require('../app/common/constants/settingsEnums')
// individual settings were deprecated with 0.11.4
// DO NOT ADD TO THIS LIST
const passwordManagerDefault = (settingKey, settingsCollection) => {
const onePasswordEnabled = resolveValue(settings.ONE_PASSWORD_ENABLED, settingsCollection) === true
if (onePasswordEnabled) return passwordManagers.ONE_PASSWORD
const dashlaneEnabled = resolveValue(settings.DASHLANE_ENABLED, settingsCollection) === true
if (dashlaneEnabled) return passwordManagers.DASHLANE
const lastPassEnabled = resolveValue(settings.LAST_PASS_ENABLED, settingsCollection) === true
if (lastPassEnabled) return passwordManagers.LAST_PASS
const disabled = resolveValue(settings.PASSWORD_MANAGER_ENABLED, settingsCollection) === false
if (disabled) return passwordManagers.UNMANAGED
return defaultPasswordManager
}
// individual settings were deprecated with 0.12.6
// DO NOT ADD TO THIS LIST
const bookmarksBarDefault = (settingKey, settingsCollection) => {
const faviconsOnly = resolveValue(settings.SHOW_BOOKMARKS_TOOLBAR_ONLY_FAVICON, settingsCollection) === true
if (faviconsOnly) return bookmarksToolbarMode.FAVICONS_ONLY
const favicons = resolveValue(settings.SHOW_BOOKMARKS_TOOLBAR_FAVICON, settingsCollection) === true
if (favicons) return bookmarksToolbarMode.TEXT_AND_FAVICONS
return bookmarksToolbarMode.TEXT_ONLY
}
const contributionDefaultAmount = (settingKey, settingsCollection) => {
return appConfig.payments.defaultContributionAmount
}
const getDefaultSetting = (settingKey, settingsCollection) => {
// Two use cases for this:
switch (settingKey) {
// 1) Retrofit a new setting based on old values
// we don't want to lose existing user settings.
case settings.ACTIVE_PASSWORD_MANAGER:
return passwordManagerDefault(settingKey, settingsCollection)
case settings.BOOKMARKS_TOOLBAR_MODE:
return bookmarksBarDefault(settingKey, settingsCollection)
// 2) Get a default value when no value is set
// allows for default to change until user locks it in
//
// These are overridden when:
// >> user picks their own setting in about:preferences#payments
case settings.PAYMENTS_CONTRIBUTION_AMOUNT:
return contributionDefaultAmount(settingKey, settingsCollection)
// >> locale is intialized (which determines default search engine)
case settings.DEFAULT_SEARCH_ENGINE:
return config.defaultSearchEngineByCountry.default
}
return undefined
}
const resolveValue = (settingKey, settingsCollection) => {
if (settingsCollection && Immutable.Map.isMap(settingsCollection) &&
settingsCollection.get(settingKey) !== undefined) {
return settingsCollection.get(settingKey)
}
if (settingsCollection && settingsCollection[settingKey] !== undefined) {
return settingsCollection[settingKey]
}
const appStore = (process.type === 'browser'
? require('./stores/appStore').getState()
: require('./stores/appStoreRenderer').state) || Immutable.Map()
const appSettings = appStore.get('settings') || Immutable.Map()
return appSettings.get(settingKey) !== undefined ? appSettings.get(settingKey) : appConfig.defaultSettings[settingKey]
}
module.exports.getSetting = (settingKey, settingsCollection, defaultWhenNull = true) => {
const setting = resolveValue(settingKey, settingsCollection)
if (typeof setting !== 'undefined' && setting !== null) return setting
return defaultWhenNull
? getDefaultSetting(settingKey, settingsCollection)
: setting
}
module.exports.getActivePasswordManager = (settingsCollection) => {
const passwordManager = module.exports.getSetting(settings.ACTIVE_PASSWORD_MANAGER, settingsCollection)
let details = {
name: passwordManager,
extensionId: extensionIds[passwordManager],
displayName: displayNames[passwordManager]
}
return Immutable.fromJS(details)
}
|
Q:
Не работает скрипт транслита
Добрый день) Знаю что это убогий пример (пишется как тренировка, посмотреть как работает) , но если будет корректно работать этот фрагмент, то не думаю что будет большим затруднением все корректно дописать, и прилепить пару функций, чтобы скрипт нормально отрабатывал)
В общем, код выводит какую-то кракозябру)
<?php
function translit ($str) {
$str = strtr($str,"абвгдежзиклмнопрстуфхцы",
"abvgdejziklmnoprstyfhcu"
);
// $str = strtr($str, [ё => yo, й => ui, ч => ch, ш => sh, щ => sha, ю => you, я => ai ]);
return $str;
}
var_dump(translit("кино"));
?>
Результат: ufutu�u�
Функция strtr - работает по-байтово. Анг - 1 байт, русские - 2 байта. Var_dump - выводит 8 символов.
Как тогда это пофиксить?
Или вариант только - все массивом сделать?
A:
<?php
function translit($input) {
$iso9_table = array(
'А' => 'A', 'Б' => 'B', 'В' => 'V', 'Г' => 'G', 'Ѓ' => 'G',
'Ґ' => 'G', 'Д' => 'D', 'Е' => 'E', 'Ё' => 'YO', 'Є' => 'YE',
'Ж' => 'ZH', 'З' => 'Z', 'Ѕ' => 'Z', 'И' => 'I', 'Й' => 'J',
'Ј' => 'J', 'І' => 'I', 'Ї' => 'YI', 'К' => 'K', 'Ќ' => 'K',
'Л' => 'L', 'Љ' => 'L', 'М' => 'M', 'Н' => 'N', 'Њ' => 'N',
'О' => 'O', 'П' => 'P', 'Р' => 'R', 'С' => 'S', 'Т' => 'T',
'У' => 'U', 'Ў' => 'U', 'Ф' => 'F', 'Х' => 'H', 'Ц' => 'TS',
'Ч' => 'CH', 'Џ' => 'DH', 'Ш' => 'SH', 'Щ' => 'SHH', 'Ъ' => '',
'Ы' => 'Y', 'Ь' => '', 'Э' => 'E', 'Ю' => 'YU', 'Я' => 'YA',
'а' => 'a', 'б' => 'b', 'в' => 'v', 'г' => 'g', 'ѓ' => 'g',
'ґ' => 'g', 'д' => 'd', 'е' => 'e', 'ё' => 'yo', 'є' => 'ye',
'ж' => 'zh', 'з' => 'z', 'ѕ' => 'z', 'и' => 'i', 'й' => 'j',
'ј' => 'j', 'і' => 'i', 'ї' => 'yi', 'к' => 'k', 'ќ' => 'k',
'л' => 'l', 'љ' => 'l', 'м' => 'm', 'н' => 'n', 'њ' => 'n',
'о' => 'o', 'п' => 'p', 'р' => 'r', 'с' => 's', 'т' => 't',
'у' => 'u', 'ў' => 'u', 'ф' => 'f', 'х' => 'h', 'ц' => 'ts',
'ч' => 'ch', 'џ' => 'dh', 'ш' => 'sh', 'щ' => 'shh', 'ъ' => '',
'ы' => 'y', 'ь' => '', 'э' => 'e', 'ю' => 'yu', 'я' => 'ya'
);
return strtr($input, $iso9_table);
}
var_dump(translit('Рабочий скрипт транслита'));
?>
Таблицу символов смотреть тут.
|
A Lebanese man was killed Wednesday after an argument about a World Cup game turned heated inside a Beirut coffee shop.
Mohammad Zahar was fatally stabbed while celebrating Brazil’s win with a group of friends in the suburb of Hay El Sellom.
Zahar, a Brazil supporter, allegedly got into a heated argument with a Germany supporter inside the coffee shop.
The Germany supporter, identified only by his initials H.K., allegedly pulled out a knife and stabbed Zahar.
The two were neighbors, media reports said.
Germany was knocked out of the World Cup after a 2-0 loss to South Korea. Brazil scored twice against Costa Rica.
Lebanese security officials have not released any information about the suspect. |
prime?
True
Is 1340492147 prime?
True
Is 5136346567 a prime number?
False
Is 18517633549 a prime number?
False
Is 202608011 prime?
True
Is 1706915867 composite?
False
Is 9583849643 prime?
False
Is 1899289697 prime?
False
Is 10572206771 a prime number?
False
Is 22100561533 a composite number?
False
Is 4572274835 prime?
False
Is 7067395 a composite number?
True
Is 678014431 a composite number?
False
Is 432977429 composite?
False
Is 8152073 composite?
True
Is 3035064317 a prime number?
False
Is 10415038903 a prime number?
False
Is 1010343251 a composite number?
True
Is 2283056141 a composite number?
False
Is 13746136279 prime?
False
Is 5187569287 composite?
False
Is 13500496363 prime?
True
Is 9696953089 composite?
True
Is 352712891 composite?
True
Is 347312816021 composite?
False
Is 4498456579 a composite number?
False
Is 2385075691 a prime number?
True
Is 776700799 a prime number?
False
Is 4411725737 composite?
True
Is 3328499567 prime?
False
Is 375957473 prime?
True
Is 13582115431 prime?
True
Is 116102463241 prime?
False
Is 1006537117 a prime number?
True
Is 172636421 a composite number?
True
Is 495382813 prime?
False
Is 12249985999 a composite number?
False
Is 2511613735 prime?
False
Is 233656551463 prime?
True
Is 1780679393 a prime number?
False
Is 27997478731 a prime number?
True
Is 7119112373 prime?
True
Is 29071153 a prime number?
True
Is 12674479287 prime?
False
Is 1517092471 a composite number?
False
Is 11662600921 a composite number?
True
Is 29409741997 a prime number?
True
Is 19572706123 a prime number?
True
Is 33968755069 composite?
False
Is 132287821811 prime?
True
Is 1569947395 prime?
False
Is 96536134 a composite number?
True
Is 837680414 a composite number?
True
Is 6494129039 composite?
False
Is 67284481 a composite number?
True
Is 40742171203 a prime number?
True
Is 2380234613 a composite number?
True
Is 9048957382 a prime number?
False
Is 100743608711 composite?
True
Is 9944367431 prime?
True
Is 20538049757 a prime number?
True
Is 6836754851 a prime number?
True
Is 28282973 a composite number?
True
Is 3879619319 a prime number?
False
Is 6778876903 composite?
False
Is 621088709 a composite number?
False
Is 25943173811 a composite number?
False
Is 2317837877 composite?
True
Is 100145927307 a prime number?
False
Is 1875077387 a composite number?
True
Is 42352062983 a composite number?
False
Is 3424074119 composite?
False
Is 8845444073 a composite number?
True
Is 1622027971 a composite number?
True
Is 4270368077 composite?
True
Is 674913133 a prime number?
True
Is 652588513 composite?
True
Is 33969241073 a composite number?
False
Is 1118175923 prime?
False
Is 4195046909 prime?
False
Is 4417847509 a prime number?
False
Is 7537686231 a composite number?
True
Is 8613968621 prime?
False
Is 39160386971 a composite number?
False
Is 110862135673 a composite number?
False
Is 92457100889 composite?
True
Is 45680647 a composite number?
True
Is 3269772521 a composite number?
False
Is 26302944221 a composite number?
True
Is 1818978151 composite?
False
Is 8261196509 prime?
True
Is 33110570093 a prime number?
True
Is 20040326935 prime?
False
Is 1237894807 a prime number?
True
Is 1820612253 a composite number?
True
Is 1817513927 composite?
False
Is 36325131971 a prime number?
True
Is 103144950163 a composite number?
True
Is 47273630869 a prime number?
True
Is 49920112129 a composite number?
False
Is 19817017889 a prime number?
True
Is 15469676611 a prime number?
True
Is 277069679 a composite number?
False
Is 541635811 a composite number?
False
Is 1490204567 composite?
False
Is 22450209289 a prime number?
True
Is 5990100667 a composite number?
False
Is 71350537091 composite?
True
Is 3801725491 prime?
True
Is 27587207887 composite?
True
Is 13648859143 composite?
False
Is 44753953151 composite?
True
Is 17439912055 a composite number?
True
Is 4539191153 composite?
True
Is 80129971327 a prime number?
False
Is 25249040689 a composite number?
True
Is 349234513 prime?
True
Is 192125881 a prime number?
True
Is 4752064747 prime?
False
Is 3779752489 a composite number?
True
Is 10954676519 composite?
False
Is 31797674569 a composite number?
False
Is 292831663 prime?
False
Is 5224097657 a composite number?
False
Is 3120610067 prime?
False
Is 49979427 composite?
True
Is 139606573 a prime number?
False
Is 5227922443 a composite number?
False
Is 1394712971 a prime number?
False
Is 3944326931 a prime number?
False
Is 1246058291 a composite number?
False
Is 824129711 composite?
False
Is 15440088182 a composite number?
True
Is 2065953931 composite?
False
Is 22775668117 composite?
True
Is 908701621 composite?
False
Is 3235515313 a composite number?
False
Is 577781909 a composite number?
False
Is 245964127 composite?
True
Is 43892515409 prime?
True
Is 1147797817 a composite number?
True
Is 292658082307 prime?
True
Is 4924301491 prime?
True
Is 1692455255 composite?
True
Is 31146907531 prime?
True
Is 4628534961 prime?
False
Is 20341920607 a composite number?
True
Is 371288849 prime?
True
Is 346697814473 a prime number?
True
Is 1352069771 a composite number?
True
Is 5205750769 composite?
True
Is 3473526877 prime?
True
Is 2389973307 prime?
False
Is 132361590535 prime?
False
Is 13387495879 a prime number?
True
Is 4571414549 a prime number?
False
Is 681101387 a composite number?
False
Is 56267861647 a composite number?
False
Is 4602892353 a prime number?
False
Is 14573340907 prime?
True
Is 7137269261 composite?
False
Is 656871893 a composite number?
False
Is 185890283 a composite number?
True
Is 10659164809 composite?
True
Is 20483865299 prime?
False
Is 3601811147 prime?
False
Is 33250718051 prime?
True
Is 37259264677 a composite number?
True
Is 6940824901 a composite number?
False
Is 1207368611 a prime number?
False
Is 238007821 composite?
False
Is 145356451 composite?
True
Is 60660995327 a composite number?
False
Is 365625677 prime?
True
Is 5489897641 prime?
True
Is 49993253 prime?
False
Is 655435433 composite?
True
Is 4098328835 composite?
True
Is 245987879 composite?
True
Is 13965865091 composite?
True
Is 245036333 composite?
True
Is 66706547 composite?
False
Is 11913374531 composite?
False
Is 82971953 composite?
False
Is 82819673 a prime number?
False
Is 616076161 a prime number?
True
Is 4023604919 a composite number?
False
Is 70749832555 a composite number?
True
Is 27875032579 a composite number?
False
Is 16562247122 a prime number?
False
Is 3290529127 a prime number?
True
Is 81672295531 prime?
False
Is 70018950181 prime?
False
Is 140022633302 prime?
False
Is 13706883019 composite?
True
Is 50407151051 prime?
True
Is 5201068657 composite?
False
Is 9395802443 a composite number?
False
Is 107815567 a prime number?
True
Is 1057185163 a prime number?
True
Is 451888993 prime?
True
Is 1325274487 composite?
True
Is 18047315191 prime?
False
Is 12292942969 a prime number?
True
Is 705698569 prime?
False
Is 13822884961 a prime number?
True
Is 17065717973 composite?
False
Is 19605388291 composite?
False
Is 10689837119 prime?
False
Is 20172218837 composite?
True
Is 112319369753 prime?
False
Is 578215393 a prime number?
False
Is 980480933771 a prime number?
True
Is 5726245153 a composite number?
False
Is 11573119627 a composite number?
True
Is 15992962033 a prime number?
True
Is 1695582271 prime?
True
Is 5773815727 a composite number?
True
Is 6792868759 a prime number?
False
Is 367456527989 composite?
False
Is 1849814171 a composite number?
True
Is 1423637561 a composite number?
False
Is 136743770567 composite?
True
Is 5964441523 a composite number?
True
Is 139170100343 a composite number?
True
Is 31593717839 composite?
False
Is 6052321739 a prime number?
True
Is 19459882087 prime?
True
Is 27717550351 composite?
True
Is 1220226529 prime?
True
Is 369061487 composite?
True
Is 3503781593 prime?
False
Is 12147393881 composite?
True
Is 543750133 a prime number?
False
Is 265898527 prime?
True
Is 15048967021 prime?
False
Is 11949900667 a prime number?
True
Is 11679375809 a composite number?
True
Is 231815083 a composite number?
False
Is 125845837483 a composite number?
False
Is 1863257941 a composite number?
False
Is 220908851 prime?
True
Is 54060699529 composite?
False
Is 2794133257 composite?
True
Is 25662364993 a prime number?
True
Is 9090331457 a prime number?
True
Is 4829312389 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.