text
stringlengths 8
5.77M
|
|---|
Nuts and Bolts
Everyone has opinions and thoughts. Here are some of ours.
A Simple Introduction to AWS CloudFormation Part 2: EC2 Instance and Route53
Posted by Tung Nguyen
on
Mar 20, 2017
This is a continuation of A Simple Introduction to AWS CloudFormation.
We will build on top of the first simple CloudFormation template from Part 1, which provisions an EC2 instance and Security Group. We will add to it a Route53 record that points to the EC2 instance’s DNS public hostname. This demonstrates CloudFormation’s ability to “orchestrates” the components of the stack. CloudFormation will wait until the EC2 instance’s DNS public hostname is ready and then create the Route53 record pointing to it.
Add Route53 Record to CloudFormation
First let’s take a look at the AWS CloudFormation documentation that covers a AWS::Route53::RecordSet. It provides an example of how to build a Route53 route which we can build from. I’ve taken that example and modified it so that the stack will create a subdomain based on the parameter being passed in.
Here are the simple changes that were needed in order to add this DNS record. First, I added a AWS::Route53::RecordSet resource under the Resources section.
I also added 2 parameters: HostedZoneName and Subdomain under the Parameters section that the resource requires:
HostedZoneName:
Description: The route53 HostedZoneName. For example, "mydomain.com." Don't forget the period at the end.
Type: String
Subdomain:
Description: The subdomain of the dns entry. For example, hello -> hello.mydomain.com, hello is the subdomain.
Type: String
After launching the stack you can check on it’s status via the CloudFormation console. It looks similar to this:
Clean Up
Delete the stack at the end now:
aws cloudformation create-stack --stack-name route53
Summary
You can see the EC2 instance and Route53 record all got created in about 3 minutes. Also noticed that you did not have to tell CloudFormation anything about the ordering of how the resources needed to be created. CloudFormation was smart enough to figure that it needed to first create the EC2 instance and then the Route53 record. It takes orchestration, something that is pretty complicated and makes it very simple.
Hopefully, you are starting to see that CloudFormation is not that complicated but gives you a lot of power. We have barely touched the surface of CloudFormation in these introductory tutorials. You can create AutoScaling groups, ELBs, VPCs, Subnets and many more resources with CloudFormation. To browse through all the possibilities you can look at the AWS Resource Type Reference documentation for a very long list all the resources CloudFormation supports.
|
A device for producing beer is known, containing a system of communicated pipe-lines, a mash wort brewing unit and a low pressure steam-generator connected thereto, a filtrating chan, a hydrocyclone unit, cylindrical reservoirs arranged vertically for fermentation and after-fermentation with cooling jackets, a unit for cooling wort, a tank for hot water, a container for gathering brewers' yeast (See patent document RU No2039801 cl. C12C 11/00 05.07.93).
However, the known device is not designated for operational delivery to the consumer of beer without loss of taste properties and its realization will cost much.
The closest prior art for the claimed device is a device for producing beer comprising interconnected by a communicating system a device for beer wort brewing, a cooler, N units for fermentation, where N is an integer, K units for after-fermentation, where K is an integer and a cooling system (see patent SU 1817791 cl. C12C 13/00, 12.03.92).
However, the known device requires great expenses to deliver and store finished non-filtrated beer to the consumer, and to organize its sale, and it does not guarantee preservation of the natural taste properties, as the time of storage of non-filtrated beer without strict temperature regime is limited to 3-4 days.
A unit for after-fermentation is known, used in the said known device, comprising an isothermal vessel in insulated enclosure, having a cooling jacket and functional valves (See Patent document SU 1817791, cl.C12C 13/00, 12.03.92).
However, the structure of the known device is of stationary type, which makes it impossible to use for operational delivery of non-filtrated beer at a point of dispense and sale.
The basis of the invention is the problem of creation of a device that can reduce expenses for beer realization to the consumer, preserving its taste properties with the help of exclusion of intermediate operations of non-filtrated beer delivery, transfer procedures and providing optimal regime for its storage.
Another problem is to create the structure of a unit for after-fermentation, which makes possible qualitative non-filtrated beer dispensing from it not only in the place of production, but also in any beer-dispensing section within a region or a city.
The problem is solved in that a device for producing beer, comprising a device for beer wort brewing, a cooler, N units for fermentation, where N is an integer, K units for after-fermentation, where K is an integer, and a cooling system, interconnected by a communicating system, according to the invention, further comprises i-number of communication units, necessary for operational connection and disconnection of i-number of said K units for after-fermentation, where i—is an integer, equal to or less than K, and each of i-number of units for after-fermentation is embodied in such a way so that it is transportable, thermally insulated, hermetic, protected from deposited yeast mixing with non-filtrated beer during transportation, and can be connected to a cooling system, arranged at a point of dispense and/or sale, and the inner volume of each of i-number units for after-fermentation does not exceed 0,8 of inner volume of a unit for fermentation.
According to another subject of the invention, a unit for after-fermentation comprises an isothermal vessel with a cooling jacket and is made with the possibility for operational connection, disconnection and transportation with finished beer at a point of sale and/or dispense, or beer at the stage of after-fermentation to another place of after-fermentation with the possibility for its dispense and/or realization. The bottom of an isothermal vessel comprises deposit space, which can have a conical shape with an angle between generatrixes in an axial plane of its cross section, constituting ≦90° or it can have the form of a cylinder, and the volume of deposit space may be equal to 0,01÷0,1 of the isothermal vessel's volume, and the isothermal vessel can be arranged on a common base on supports in an insulation shell with a housing. Furthermore, it can be provided by a fitting box with measuring devices, functional valves and joints for operational connection and disconnection, communicated by corresponding pipe-lines to the inner space of the isothermal vessel and to its cooling jacket.
The essence of the invention is in the fact that the implementation in the above mentioned manner of units for after-fermentation and the introduction of necessary quantity of additional communication units makes possible the realization of operational connection and disconnection of units for after-fermentation, and transportation of non-filtrated beer with the possibility to connect them to cooling system at the place of sale and/or dispense, to provide preservation of taste properties for a long time. No intermediate operations on delivery and dispense procedure are made, which leads to reduction of expenses for beer-realization to the consumer.
|
Additional TV games added to baseball schedule
FAYETTEVILLE, Ark. (Univ. of Ark.) - Four additional televised games have been added to the 2013 University of Arkansas baseball schedule. With the four added TV games, the Razorbacks will now have 22 games televised during the 2013 regular season.
All four games that were added are road contests. Arkansas' games at Nebraska on April 16 (Big Ten Network), at Georgia on April 26 (CSS) and at Kentucky on May 3 and 4 (Big Blue Sports Network/Fox Sports South) will now be televised. The game at Georgia on April 26 will now start at 6:30 p.m. (CT), while the May 4th game at Kentucky will move to a 6 p.m. (CT) start to accommodate television.
The Razorbacks are back in action this weekend, traveling to No. 6 South Carolina. Game times for the weekend series are 6:30 p.m. on Friday, 2:15 p.m. on Saturday and 12:30 p.m. on Sunday. Friday's game will be televised by CSS, while Saturday's contest will be televised by FSN.
|
Semantic Treatments for Word and Sentence Production Deficits in Aphasia.
The cognitive domains of language and memory are intrinsically connected and work together during language processing. This relationship is especially apparent in the area of semantics. Several disciplines have contributed to a rich store of data about semantic organization and processing, and several semantic treatments for aphasic word and sentence production impairments have been based on these data. This article reviews the relationships between semantics and memory as they relate to word and sentence production, describes the aphasic language impairments that result from deficits in these areas, and summarizes treatment approaches that capitalize on what we have learned about these domains and how they work together.
|
Olivia Colman, winner for Best Actress in a Leading Role, attends the 2019 Vanity Fair Oscar Party hosted by Radhika Jones on Feb. 24, 2019, in Beverly Hills, Calif. Photo : Dia Dipasupil ( Getty Images )
The stench of stagnant progression is in the air as we look back at the history of Oscar nominations in the 2010s.
The Hollywood Reporter recently highlighted every Oscar-winning actress (in both lead and supporting categories) in the 2010s and in doing so, found one glaring bit of news: only five actresses of color were recognized by the Academy in the lead actress category in the past decade. This bears repeating—of every single nomination under the Best Performance b y a n Actress i n a Leading Role (50 women total) category over this decade, only five of them were women of color.
Gabourey Sidibe (Precious, 2009), Viola Davis (The Help, 2011), Quvenzhané Wallis (Beasts of the Southern Wild, 2013), Ruth Negga (Loving, 2017) and Yalitza Aparicio (Roma, 2019), who became the first Indigenous woman and second Mexican woman to be nominated in the lead actress category.
Of course, none of them took home the statuette, as Halle Berry is still the only black woman to have won the Best Actress Oscar in the Academy’s history (in 2001, for her performance in Monster’s Ball).
G/O Media may get a commission First Bag Free
It’s one thing to engage in the trending hashtag in a single year (April Reign certainly got the people going every year with the creation of #OscarsSoWhite), but to see the entire summation right here in black… and white? Wow.
Of course, the past decade has been better to black actresses in the supporting category, such as Mo’Nique (Precious, 2010), Octavia Spencer (The Help, 2012), Lupita Nyong’o (12 Years A Slave, 2014), Viola Davis (Fences, 2017) and Regina King (If Beale Street Could Talk, 2019). I won’t even get into the frustrations I felt with Davis, whose film campaign decided to vie for the Supporting Actress category even though she was clearly the Lead Actress in Fences. Of course, it was a smart, strategic and surefire way for Davis to get her much-deserved Oscar (Emma Stone was the shoo-in that year, according to experts), but having to play those types of politics isn’t the least bit comforting.
THR adds:
Sandra Bullock, Natalie Portman, Meryl Streep, Jennifer Lawrence and Cate Blanchett lead the first half of the decade as the top actresses in Hollywood to bring home the highest acting honor of the Academy Award for best actress. Bullock, Portman and Lawrence each won their first Oscars, while Streep won her third (she has two for best actress and one for best supporting) and Blanchett won her second (she has one for best actress and one for best supporting). Julianne Moore, Brie Larson, Emma Stone, Frances McDormand and Olivia Colman rounded out the decade with their best actress wins (McDormand won her second best actress honor), making the claim of #OscarsSoWhite highly relevant for the lead category.
So, not only were actresses of color being looked over for simple recognition, they were being looked over for individual white actresses to rack in multiple awards. Fabulous.
Nominations for the 92nd Academy Awards in 2020 will be announced on Jan. 13, 2020. Let’s see if we can kick off a new decade with some damn seasoning...
|
15 Interesting Facts About James Bond
Royal Navy Commander James Bond, CMG, RNVR, a character who is a British Secret Service Agent, the hero of uncountable novels, movies, comics and video games. Besides being a larger than life figure, James Bond has many other aspects worth knowing. Here are some interesting facts about James Bond and his adventurous journey:
1. Those Who Missed Out Being The James Bond!
Clint Eastwood 1960s
Clint Eastwood, Adam West, Burt Reynolds, all these actors were offered the role of portraying James Bond in the movies, but they all declined this role because they thought the character would be justified only by a British actor.Source: kickassfacts.com, Image: wikimedia.org
2. A Smart Makeover!
George Lazenby
George Lazenby, who portrayed the role of James Bond in the 1969 movie, “On Her Majesty’s Secret Service” was not an actor before this movie. To impress the producer, he got himself a suit, put on a Rolex, had a new haircut and convinced him that he had worked in a few so-called “made-up” movies, thus bagging the famous role.Source: kickassfacts.com, Image: pagesz.net
3. A Boring Name?
Ian Fleming
The creator of James Bond, British Journalist, and novelist, Ian Fleming, named James Bond after an American bird expert. He stated that he wanted the character’s name to be as dull as possible and his personality as boring as one could imagine.Source: buzzfeed.com, Image: dailymail.co.uk
4. The VIP Fans
John F. Kennedy
The late American President Mr. John. F Kennedy was a huge fan of James Bond Series. On Nov. 23, 1963, one day before he was brutally assassinated, he viewed an early print of James Bond Movie, “From Russia, with love” at the white house.Source: kickassfacts.com, Image: wikimedia.org
5. The woman behind James Bond!
Barbara Brocolli
Truly said, behind every successful man, there is a woman! And the same goes with this fictional character. Barbara Broccoli is the producer of James Bond movies and she herself casts the main character, the girls in the movie and even works on the stories.Source: kickassfacts.com, Image: cinetropolis.net
6. James Bond And Hitler!
Walther PPK-E
The gun used in the James Bond movies, Walther PPK, is the same gun model that was used by Adolf Hitler to shoot and kill himself.Source: kickassfacts.com, Image: wikimedia.org
7. Guys as Girls
Pussy Galore’s Pilots
In the 1964 movie, “Goldfinger” the girls portrayed as the pilots in Pussy Galore’s Flying Circus were actually men dressed up as blondes and wearing a wig.Source: msnevent.com, Image: jamesbond.wikia.com
8. An Expensive Event
During the shoot of the movie (in 1997), “Tomorrow Never Dies,” more than 15 BMW’s were a part of the crash, and all were destroyed.Source: msnevent.com, image: youtube
9. Training and Preparations
During the weapon training for the movie “Skyfall” (2012), 200,000 rounds of ammunition were used! It looks like the producers had a lot of budgets to spend!Source: msn.com
10. The Bond Girl; Who was actually a Boy!
One of the bond girls, Caroline Cossey, who was cast as an extra in the movie “For your eyes only,” was a boy at birth. She had a full sex reassignment surgery at the age of 17.Source: omgfacts.com, Image: universalexports.net
11. The Killer Bond Girls!
Funnily yet strangely, 3/4 of the women who have slept with James Bond in his movies have tried to kill him.Source: omgfacts.com, Image: futureaa.com.au
12. Google it!
Try typing \”James Bond\” on Google translate and then have it translated into standard Chinese. You will see it appear as \”007\”. Interesting, isn’t it?Source: omgfacts.com
13. Harder than it seems
In the movie “The spy who loved me,” Richard Kiel had to do a role with metal teeth in his mouth. It was so difficult and painful that he could not put the metal for more than half a minute in his mouth.Source: msn.com, Image: gbtyl.com
14. Dangerous Deal
For jumping into a shark-infested pool in the movie “Thunderball,” the stuntman Bill Cumming was paid a whopping amount of $450.Source: buzzfeed.com
15. Gold Plated Typewriter
Fleming’s typewriter
The Bond novels written by writer Ian Fleming were typed on a gold-plated Royal Typewriter.Source: buzzfeed.com, Image: jamesbond-shop.com
|
Q:
Groovy concurrency: A better way to aggregate results semantically?
I need to call a number of methods in parallel and wait for results. Each relies on different resources, so they may return at different times. I need to wait until I receive all results or time out after a certain amount of time.
I could just spawn threads with a reference to a shared object via a method call, but is there a better, more groovy way to do this?
Current Implementation:
Executors exec = Executors.newFixedThreadPool(10);
for (obj in objects) {
def method = {
def result = new ResultObject(a: obj, b: obj.callSomeMethod())
result
} as Callable<ResultObject>
callables << method
}
List<Future<ResultObject>> results = exec.invokeAll(callables)
for (result in results) {
try{
def searchResult = result.get()
println 'result retrieved'
} catch (Exception e)
{
println 'exception'
e.printStackTrace()
}
}
}
A:
A Groovier solution is to use GPars - a concurrency library written in Groovy.
import static groovyx.gpars.GParsExecutorsPool.withPool
withPool {
def callable = {obj -> new ResultObject(a: obj, b: obj.callSomeMethod())}.async()
List<ResultObject> results = objects.collect(callable)*.get()
}
A:
AbstractExecutorService.invokeAll(Collection<? extends Callable<T>> tasks, long timeout, TimeUnit unit)
The groovy part would be using closures as Callable
|
Q:
Considerando um BD que se baseia em ODBC, qual é a função do JDBC neste caso?
Qual o objetivo do JDBC em um bd que se baseia em ODBC?
A:
ODBC é uma interface que não depende de uma linguagem de programação, banco de dados ou sistema operacional específico. Pode ser usado para escrever aplicações que buscam dados de qualquer banco de dados, independente do ambiente que estiver rodando. A maior vantagem de se usar ODBC é como interface entre uma aplicação e um banco de dados é que quando o banco de dados for alterado a aplicação não precisa ser modificada.
JDBC é uma API para a linguagem Java que a facilita o client a acessar uma base de dados, provendo métodos para buscar e atualizar os dados do banco. JDBC é melhor aplicado para banco de dados orientados a objeto.
Decidindo entre ODBC e JDBC
Use o ODBC para:
Melhor performance para importação e exportação de dados
Importação e exportações que usem muita memória.
Use o JDBC para:
Plataformas independentes, permitindo trabalhar com qualquer sistema operacional(32 e 64 bits).
Usar funções já implementadas na interface;
Trabalhar com tipos complexos de dados como LONG, BLOB, etc.
|
“Sebastian Sellam, 23, was a popular disc jockey at a hot Parisian night club called Queen. At about 11:45 p.m. on Wednesday November 19, the young man known as DJ Lam C (a reverse play on his surname) left the apartment he shared with his parents in a modest building in of Paris’ 10th arrondissement near la Place Colonel Fabien, heading to work as usual. In the underground parking lot, a Muslim neighbor slit Sellam’s throat twice, according to the Rosenpress interview. His face was completely mutilated with a fork. Even his eyes were gouged out.
“Following the crime, Rosenpress correspondent Alain Azria reported, Sellam’s mother said the Muslim perpetrator mounted the stairs, his hands still bloody, and announced his crime. ‘I have killed my Jew. I will go to heaven,’ he reportedly said. The alleged murderer’s family was well known for rabid anti-Semitism, Mrs. Sellam reportedly told Rosenpress, a point confirmed by the victim’s brother. Within the previous year, Sellam’s mother reportedly said, the family found a dead rooster outside their apartment door with its throat slit, and their Mezuzah was ripped from their door post. Leaving dead roosters is reportedly a traditional warning of impending murder.”
Why would this man think he would go to heaven for killing a Jew? Maybe because of this hadith: “When judgment day arrives, Allah will give every Muslim, a Jews or Christian to kill so that the Muslim will not enter into hell fire” (Mishkat Al-Messabih, no. 5552).
“The homicide especially traumatized the Paris Jewish community: According to Rosenpress, another gruesome murder, also allegedly committed by a Muslim, occurred earlier that evening. Chantal Piekolek, 53, was working in her Avenue de Clichy shoe store when Mohamed Ghrib, 37, stabbed her 27 times in the neck and chest.
“Piekolek’s 10-year-old daughter hid in the storeroom behind the shop with a girlfriend and heard the entire crime. There was no evidence of sexual assault, according to Rosenpress. Paris reporters believe the cash remained in the shop’s register, but this detail remained unconfirmed at press time. . . .
“Initial reports in small news outlets naturally terrified and confused the French Jewish community. Intense anti-Semitism has been building for more than a decade, according to Nidra Poller, an American expatriate in Paris for several decades. Anti-Semitic crimes frequently go unreported in the major press, she said, suppressed by French authorities, victims fearing retribution–and news agencies. Jewish community members thus usually learn of attacks as they did during previous centuries in North African and Eastern European ghettoes–by word of mouth.
“In 2001, a rabbi in Poller’s neighborhood was kidnapped and held hostage in a car for two hours. Another religious Jew was kidnapped in similar fashion, Poller reported. A Jewish woman and her husband, whom she had just picked up at a local hospital, were abused and threatened with murder for several hours by their Muslim taxi driver, she said. . . .
“French Jews live in constant fear, Poller said. Everyday activities, such as taking a taxi, going to synagogue or shopping can bring attacks. The entire community is traumatized. This pattern was effectively repeated with the November murders in Paris after initial reports indicated that both cases were anti-Semitic crimes. . . .
“Given intense and worsening anti-Semitism in France and Europe, there seems little hope that the government will actually investigate the arson, much less prosecute the perpetrator if it finds one. After all, EU officials deny the severity of the problem. Last week, they shelved an EU report on the subject for fear of antagonizing Muslims, who were behind many of the incidents examined. . . .
“Poller left France for a U.S. speaking tour in November with one week’s news publications to read on her flight–two weekly magazines and three major newspapers. All of them, she said, were ‘reeking with hatred [for Jews].’ They also sympathized extensively with terrorists. News reports are not factual. ‘They are sermons,’ Poller said. A profile of philosopher Gilles Deleuze in the weekly Nouvel Observateur, for example, praised his defense of the Palestinians, citing an article he wrote on ‘le grandeur de Arafat,’ despite his personal responsibility for more than 1,000 civilian murders.”
Popular Categories
Robert Spencer FaceBook Page
Robert Spencer Twitter
Robert Spencer YouTube Channel
Jihad Watch® is a registered trademark of Robert Spencer in the United States and/or other countries - Site Developed and Managed by Free Speech Defense
Content copyright Jihad Watch, Jihad Watch claims no credit for any images posted on this site unless otherwise noted. Images on this blog are copyright to their respective owners. If there is an image appearing on this blog that belongs to you and you do not wish for it appear on this site, please E-mail with a link to said image and it will be promptly removed.
|
Q:
On which variables can we condition to observe a direct effect?
Suppose we're interested in the effect of $D$ on $Y$. Suppose that variables $D$ and $O$ are mutually dependent on a variable $C$, and that $Y$ is mutually dependent on variables $D$ and $O$. I find it quiet obvious that we could condition on $O$ to observe the desired effect. However, my professor and textbook say that equivalently, we could condition on "C". Personally, I do believe that this is incorrect for the following reason:
If we conditioned on $C$, then theoretically, there would be no variance in $D$, $O$ or $Y$, and so a causal relationship between $D$ and $Y$ could not be determined. But even if there were some variance in $D$ within each strata of $C$, there could very well also be some variance in $O$ within each strata of $C$. If this were the case, then even after having conditioned on $C$, variance in $Y$ could still be attributable to both variance in $D$ and variance in $O$. Hence, the direct causal effect of $D$ on $Y$ cannot be determined from conditioning on $C$.
Assuming that my professor and textbook are correct, where is my analysis lacking?
A:
First to help everyone see your case with a DAG the below:
To make this problem rigorous, replace "$Y$ mutually depends on $X$" with "$X$ causes $Y$". "Dependence" is a probabilistic phenomenon and is not directed, if cancer depends on smoking, smoking depends on cancer by Bayes' Rule. But smoking causes cancer, and not vice versa.
Also the direct effect (of $D$ on $Y$) is the effect without the presence of mediators. There is no mediation in this DAG, so modeling $P(Y|D)$ would be direct, albeit confounded. If--to correct you again--you mean you wish to control for confounding in the $P(Y | \text{do}(D))$ causal question, then the answer is: you're both right, and your argument is not about confounding, but rather about precision.
The trick to understanding this problem is understanding the backdoor criterion. This is defined in Pearl's Causality. The sets ${C}, {O}, and {C,O}$ all satisfy the backdoor criterion because they block every path from $D$ to $Y$ that has an arrow leading to $D$.
A:
I will just complement Adam's answer (+1) regarding precision.
As Adam has said, given the description of your problem (as in the DAG), adjusting either for $C$ or for $O$ is enough for identification of the causal effect of $D$ on $Y$, since both sets satisfy the backdoor criterion. What does that mean? It means that, given infinite samples, both adjusted estimates will converge to the causal effect of interest.
With finite samples, however, both sets are not equivalent, and they differ on the precision of your estimates. Among backdoor admissible sets of covariates, in order to get a more precise estimate of the causal effect of $D$ on $Y$, you want to look for two things: (i) you want to maximally reduce the variation of $Y$; (ii) you want to minimally reduce the variation of $D$.
Thus, in finite samples, considering your problem structure, adjusting for $O$ will give you more precise estimates than adjusting for $C$. Here is a simple simulation in R:
gen_data <- function(n = 1e2){
c <- rnorm(n)
d <- c + rnorm(n)/2
o <- c + rnorm(n)
y <- d + o + rnorm(n)
data <- data.frame(c,d,o,y)
data
}
set.seed(10)
summary(replicate(1000, coef(lm(y ~ d + c, gen_data()))["d"]))
# Min. 1st Qu. Median Mean 3rd Qu. Max.
# 0.04868 0.82050 0.99792 0.99813 1.18057 2.11129
summary(replicate(1000, coef(lm(y ~ d + o, gen_data()))["d"]))
# Min. 1st Qu. Median Mean 3rd Qu. Max.
# 0.5899 0.9312 1.0066 1.0079 1.0867 1.3466
In our example, although both estimates are unbiased, you can see the estimates adjusting for $O$ have substantially less variance.
|
Revised. Amendments from Version 1
==================================
This revised version of our case report includes a detailed description of the intraoperative management in this patient undergoing awake craniotomy for cerebral abscess. An additional figure showing the intraoperative anesthetic record highlights the major surgical and anesthesiological events during the procedure. We emphasize the patient\'s respiratory and hemodynamic stability, present throughout the case. Despite the severe underlying cyanotic congenital heart disease and the emergency situation, the patient did remarkably well during and after surgery.
Introduction
============
Congenital heart disease (CHD) affects about 0.6% of newborns with a stable incidence over time ^[@ref-1],\ [@ref-2]^. Advances in surgical and medical treatment have shifted mortality largely to adulthood ^[@ref-3]^. Numbers of adult patients with CHD are steadily increasing, except in cohorts with Eisenmenger syndrome and unrepaired cyanotic defects ^[@ref-4]^. Therefore, surgeons and anesthesiologists are now facing more repaired survivors of CHD for noncardiac surgery ^[@ref-5]^. CHD patients are at high risk for long-term cardiac and noncardiac complications, and the perioperative management of these patients may be challenging ^[@ref-6]^. In this case report, we present the multidisciplinary management of a nighttime emergency awake craniotomy (AC) for stereotactic evacuation of an intracerebral abscess in an adult with unrepaired tricuspid atresia (TA) with palliative shunts.
Case description
================
A 39-year-old man (weight 75 kg; height 180 cm; body mass index 23 kg m ^-2^) presented to the emergency department at 7 *p.m.* with right frontal headache, fever, and paresthesia of the left side of the body. Nine days earlier, he underwent diode laser surgery for hypertrophic nasal turbinates under local anesthesia. The patient's medical history revealed cyanotic CHD -- a complex form of unrepaired TA. The patient received bilateral palliative Blalock-Taussig shunts in early childhood. The shunt on the left side was reported to be stenotic, and the right one was secondarily closed. A detailed illustration of the underlying cardiovascular anatomy is shown in [Figure 1](#f1){ref-type="fig"}. In the past, the patient had suffered from bacterial endocarditis, pulmonary hemorrhage, renal and splenic infarctions, transitory ischemic attack and recurrent supraventricular tachycardia that were considered to be complications of his CHD. Regular oral medication consisted of metoprolol 50 mg, torasemide 10 mg and isotretinoin 10 mg once daily. An allergy to cephalosporins was noted.
Baseline peripheral oxygen saturation (SpO ~2~) on room air was 80%. Examination of the patient's hands revealed clubbed fingers with Hippocratic nails. Blood analysis showed secondary erythrocytosis (hemoglobin 210 g l ^-1^; hematocrit 0.62%) and mild leukocytosis (10.650 × 10 ^9^ l ^-1^). Serum C-reactive protein concentration was 47.8 mg l ^-1^. He was in sinus rhythm, and left ventricular function was mildly decreased with an ejection fraction of 46%.
{#f1}
Emergency contrast-enhanced computed tomography of the brain showed a ring-enhancing lesion within the right superior temporal gyrus. Subsequent Gadolinium-enhanced magnetic resonance imaging supported the differential diagnosis of an acute intracerebral abscess ( [Figure 2](#f2){ref-type="fig"}). Based on these findings, emergency surgical evacuation of the abscess by computer-assisted stereotactic craniotomy was indicated. After interdisciplinary consensus involving the anesthetic and neurosurgical team, as well as the treating cardiologist, we decided to perform the procedure as an AC.
{#f2}
Upon arrival in the operating room, the patient was comfortably installed in the supine position with routine anesthesia monitoring (5-lead electrocardiogram, pulse-oximetry, noninvasive blood pressure monitoring). An arterial line was inserted in the left radial artery. The peripheral intravenous line was equipped with an air-eliminating filter to prevent paradoxical embolism. Supplemental oxygen at 4 l min ^-1^ was administered via nasal cannula to the spontaneously breathing patient. Expiratory carbon dioxide and respiratory rate were measured. Fentanyl 50 µg and midazolam 1 mg IV were administered during preparation for surgery. Prior to fixing the head in the Mayfield frame, conscious sedation was initiated using a target-controlled infusion (TCI, Injectomat TIVA Agilia, Fresenius Kabi AG, Oberdorf, Switzerland) of propofol and remifentanil with target effect-site concentrations (Cet) of 0.5 µg ml ^-1^ and 1.0 ng ml ^-1^, respectively. After increasing the Cet of propofol to 1.0 µg ml ^-1^ due to patient discomfort during head pinning, the patient lost consciousness for a short period of time. Bradypnoea and oxygen desaturation to a Sp0 ~2~ of 80% occurred, and assisted mask-bag ventilation was required temporarily. The neurosurgeon then applied local anesthesia to the incision site using 20 ml of a 1:1 mixture of 0.5% bupivacaine and 1% lidocaine with 1:100,000 epinephrine. For remainder of the procedure, Cet of propofol (0.5 µg ml ^-1^) and remifentanil (0.5--1.5 ng ml ^-1^) were adjusted to the patient's clinical level of sedation and pain and bispectral index monitoring. The patient was hemodynamically stable throughout the intervention. Respiratory rate stayed at 12--15 breath min ^-1^, and SpO ~2~ ranged between 80 and 88%. Relevant intraoperative events are shown in [Figure 3](#f3){ref-type="fig"}.
{#f3}
The patient's left hemiparesthesia improved immediately following craniotomy and abscess decompression. Postoperatively, the patient was admitted to the intensive care unit. Some residual paresthesia was still present at discharge from the intensive care unit 10 hours later; however, neurological symptoms completely ceased by the second postoperative day. Bacteriological culture of the abscess fluid confirmed the diagnosis of a cerebral abscess and revealed *Streptococcus intermedius*. This was interpreted as hematogenous spread in the context of the previous turbinate surgery. The patient had received 2 g of meropenem IV intraoperatively. Under specific antibiotic treatment consisting of penicillin IV and oral metronidazole for 6 weeks, the abscess radiologically regressed. The patient was discharged home 14 days after the operation in stable condition.
Discussion
==========
It was important to understand the complex anatomy and underlying pathophysiology of the CHD for optimal anesthetic management of this patient. The predominant defect in this case is TA ( [Figure 1](#f1){ref-type="fig"}). The tricuspid valve is absent, and the right ventricle is hypoplastic leading to a single-ventricle physiology. Transposed great arteries (TGA), as in this patient, are associated in about 30% of cases ^[@ref-7]^. In children with TA and TGA, pulmonary blood flow is usually elevated, unless the pulmonary valve is stenotic or artretic. Because no direct communication exists between the right atrium and the right ventricle, systemic venous return to the right atrium must be shunted to the left atrium through an atrial septal defect or patent *foramen ovale* (right-to-left shunt). Oxygen saturation values are equal in the aorta and the pulmonary artery due to complete mixing of systemic and pulmonary venous blood in the left ventricle. Pulmonary blood flow determines the degree of cyanosis and is influenced by the interplay of several factors such as the size of the ventricular septal defect, the presence or absence of pulmonary stenosis, as well as the patency of the ductus arteriosus. Most infants with TA require a palliative procedure ( *e.g.* Blalock-Taussig shunt) before definitive surgery can be performed ^[@ref-8]^. In this case, a Fontan palliation could not be performed, and survival was only possible due to decreased pulmonary blood flow.
Patients with CHD and chronic cyanosis may present a number of secondary pathophysiologic phenomena and are prone to cardiac and extracardiac complications, such as cardiac arrhythmias, thrombotic events, or bleeding disorders ^[@ref-6],\ [@ref-9]^. There is an increased risk for any kind of infection, including those of the central nervous system. Patients with new-onset headaches should be screened for cerebral abscess, which is a well-described complication of cyanotic CHD. The purpose of emergency surgery is to reduce the infectious burden, to decompress the adjacent brain, and to provide bacteriological samples that may guide antimicrobial therapy.
Patients with CHD, especially those with complex defects, have increased perioperative morbidity ^[@ref-10],\ [@ref-11]^. Additional risk factors for poor outcome in noncardiac surgery are emergencies and procedures involving the respiratory or central nervous system ^[@ref-9],\ [@ref-9]--\ [@ref-11]^. The main objective in the management of this patient undergoing emergency craniotomy was to maintain pulmonary blood flow through the aorto-pulmonary anastomosis (Blalock-Taussig shunt) in order to provide optimal oxygen delivery, maintain systemic and pulmonary vascular resistance, and myocardial contractility ^[@ref-9],\ [@ref-12]^. We decided that these goals may best be achieved using a conscious sedation technique for AC. We considered that the myocardial depression and the drop in systemic vascular resistance associated with large doses of anesthetic agents during a general anesthetic could have compromised intraoperative hemodynamic stability in this high-risk patient.
AC has evolved into a standard of care for neurosurgical procedures that require awake functional mapping of the motor, sensory, visual, or language cortex when tumors are located in close proximity to eloquent areas of the brain, as well as for functional neurosurgery and epilepsy surgery. However, the practice of AC has spread to include routine procedures that do not involve awake functional cortical mapping or electrophysiological recording, *e.g.* stereotactic brain biopsy, ventriculostomy, or the evacuation of subdural hematomas. This is in part due to the implication of refined anesthetic management protocols and the use of effect-site controllable intravenous anesthetic agents such as propofol, dexmedetomidine and ultra-short acting opioids ( *e.g.* remifentanil). A recent systematic review showed that awake brain tumor resection led to a better perioperative neurological outcome compared with surgery under general anesthesia; moreover, AC was consistently associated with shorter hospital stay, less resource utilization, and high patient satisfaction ^[@ref-13]^. Major intraoperative complications during AC include respiratory depression, arterial hypertension, nausea and vomiting, air embolisms, brain swelling, seizures and loss of patient cooperation ^[@ref-14]^. Cautious patient selection focusing on airway assessment, ability to cooperate, risk of sedation failure and intraoperative surgical complications, as well as adequate preoperative psychological preparation of the patient are key elements for successful AC ^[@ref-14]^.
The evidence from the literature regarding the use of AC in cardiac patients is scarce. A recent case report describes the anesthetic management of an AC in a patient with cardiomyopathy and low cardiac output ^[@ref-15]^. The maintenance of intraoperative hemodynamic stability, indicated by a reduced use of vasopressors, seems to be facilitated during AC ^[@ref-16]^. In our patient, we favored AC primarily because of the underlying complex cyanotic CHD, and in order to preserve as much functional cardiovascular capacity as possible.
Consent
=======
Written informed consent for publication of the patients' details and images was obtained from the patient.
The authors thank Allison Dwileski for proof-reading this manuscript.
10.5256/f1000research.10480.r17000
Referee response for version 1
Rath
Girija Prasad
1
Referee
Department of Neuroanaesthesiology and Critical Care, Neurosciences Centre, All India Institute of Medical Sciences (AIIMS), New Delhi, Delhi, India
**Competing interests:**No competing interests were disclosed.
16
11
2016
Version 1
It is an interesting case report of awake craniotomy with an indication to preserve functional cardiovascular capacity in an adult with congenital cyanotic heart disease. The case was well managed by the authors. The report may be indexed with following minor changes:
Hemodynamic responses to various interventions or to painful responses to be described in graphical / picture format.
I have read this submission. I believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard.
10.5256/f1000research.10480.r17294
Referee response for version 1
Lysakowski
Christopher
1
Referee
Division of Anesthesiology, Geneva University Hospitals (HUG), Geneva, Switzerland
**Competing interests:**No competing interests were disclosed.
1
11
2016
Version 1
Concerning a case report of awake craniotomy in patient with cyanotic congenital heart disease (CHD).
The authors describe an unusual case of a rather complicated and rare pathology that needs an emergency surgical intervention during a night. I have no specific scientific remarks concerning the content nor the design, but I think that for several reasons this case should be known by large anaesthesia community.
First, the number of patients with CHD that can be scheduled for surgery is growing so our responsibility is to know how they should be handled, why spontaneous ventilation is preferable than mechanical, for which kind of complications we should be prepared etc.
Second, we can always discuss which drugs should be used in a case of awake craniotomy, is dexmedetomidine better than other drugs? Personal experience and a local policy should be respected in such case.
What is notable is that the authors were capable to establish, in this short time and during a night, an interdisciplinary consensus involving all disciplines, which was probably crucial to handle this case in this remarkable way.
I have read this submission. I believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard.
[^1]: These authors contributed equally to this work.
[^2]: C. D'A., A. H., and N. G. were the anesthesiologists involved in the case, and drafted and approved the final manuscript. J. F. and L. A. S. reviewed and approved the final manuscript. D. T. is the treating cardiologist of the patient, and drafted and approved the final manuscript. D. Z. was the neurosurgeon involved in the case, and drafted and approved the final manuscript.
[^3]: **Competing interests:**No competing interests were disclosed.
|
*4 + 160*j**3 - 50*j**2
Let f(u) = -u + u - 5*u**2. Suppose -n - 5*v = 0, -5*n + 16 = -2*v - 11. Let q(b) = -2*b - n*b - 4*b + 14*b. Calculate q(f(a)).
-15*a**2
Let k(z) = -25*z. Let l(b) = -3*b**2 - 267. What is k(l(h))?
75*h**2 + 6675
Let q(d) = -19*d**2. Let c(o) = -59*o - 14 + 14 + 33*o. Calculate q(c(i)).
-12844*i**2
Let x(l) be the second derivative of 0*l**2 + 0*l**3 + 0 + 46*l - 1/6*l**4. Let b(v) = -75*v**2. Calculate x(b(d)).
-11250*d**4
Let f(k) = 8 + 18*k**2 - 8 + 0. Let v be (15/5)/((-12)/(-8)). Let n(i) = -3 + 3 + 0*i - v*i. Give f(n(r)).
72*r**2
Let u(y) = 8*y**2. Let w(d) = -35*d**2 - 8*d - 8. Suppose -9*l + 8 = -19. Let n(c) = 12*c**2 + 3*c + 3. Let b(h) = l*w(h) + 8*n(h). Determine b(u(k)).
-576*k**4
Let s(z) = -359*z**2 - 25. Let j(p) = 3*p. What is s(j(o))?
-3231*o**2 - 25
Let p(v) = -105*v + 210. Let q(c) = 2*c - 5. Let z(r) = p(r) + 42*q(r). Let h(a) = -a**2. Give h(z(m)).
-441*m**2
Let p(d) = -d**2. Let s(a) = -22*a - 18*a - 2 - 26*a + 64*a. Determine s(p(r)).
2*r**2 - 2
Let y(n) = -2*n. Let b(o) = -o**3 - o**2 + 8*o + 4. Let f be b(-6). Let w(x) = -71 + 40*x**2 + f - 65. What is w(y(j))?
160*j**2
Let f(t) = -3*t**2. Let x(w) = -w**3 - 5*w**2 + 5*w + 7. Let u be x(-6). Let j(i) = 0*i + 5*i + u*i. What is j(f(h))?
-54*h**2
Let j(b) = 9*b - 1. Let y(q) = q - 4737. Calculate y(j(v)).
9*v - 4738
Let a(m) be the second derivative of 13*m**3/6 - 2*m. Let o = -4213 + 8040. Let n(r) = -2*r**2 + 3827*r - o*r. Determine a(n(x)).
-26*x**2
Suppose -6*d + d = 0. Suppose 7 = 3*q - d*q - 4*i, -4 = 4*i. Let j(p) = q + 3*p - 1 - 5*p. Let v(k) = -7*k**2. Determine v(j(c)).
-28*c**2
Let v(x) = 18*x - 2*x - 6*x - 9*x. Let o(b) = 174*b. What is o(v(j))?
174*j
Let l(d) = -2*d. Let b(c) = -6*c**2 - 8*c + 20. Let o(q) = 17*q**2 + 22*q - 59. Let n(t) = -11*b(t) - 4*o(t). Determine l(n(j)).
4*j**2 - 32
Let h(z) = -428*z**2 - 44*z - 44. Let f(w) = -6*w**2 - w - 1. Let t(c) = 88*f(c) - 2*h(c). Let l(d) = d**2. What is l(t(b))?
107584*b**4
Let b(s) = 7*s**2. Let n(p) = 2*p + 18*p + 2*p**2 - 20*p. Calculate b(n(z)).
28*z**4
Let i(g) = -g**2 + g - 1. Let y(w) = 21*w**2 - 4*w + 4. Let s(h) = 4*i(h) + y(h). Let k(t) = -8*t. Calculate k(s(p)).
-136*p**2
Let t(h) be the second derivative of -h**4/24 + 11*h**2/2 - 8*h. Let v(a) be the first derivative of t(a). Let o(j) = 9*j**2. Calculate v(o(x)).
-9*x**2
Let b(k) = 34390*k**2. Let i(c) = 2*c. Determine b(i(d)).
137560*d**2
Let n(w) be the third derivative of -w**4/8 + 3*w**2 - 52*w. Let o(s) = 1. Let u(h) = -18*h + 6. Let m(p) = 6*o(p) - u(p). Give m(n(f)).
-54*f
Let v(g) = -13*g. Let u(f) be the first derivative of f**2/2 - 4. Calculate u(v(y)).
-13*y
Let b(k) = -13*k**2. Let c(p) be the first derivative of p**5/10 - 11*p**2 - 34. Let g(v) be the second derivative of c(v). What is b(g(u))?
-468*u**4
Let h(q) = -728*q**2 - 65*q - 65. Let y(n) = -33*n**2 - 3*n - 3. Let s(j) = -3*h(j) + 65*y(j). Let c(p) = 2*p**2. Determine c(s(a)).
3042*a**4
Let m(u) = 5*u + 6. Let d(v) = -45*v - 55. Suppose x - 46 = 9. Let n(s) = x*m(s) + 6*d(s). Let l(k) = -2*k**2. Calculate l(n(c)).
-50*c**2
Let p(d) = -d**2. Let n(s) = -12*s + 22*s - 15*s. Let a = -6 + 51. Let h(l) = 55*l. Let m(f) = a*n(f) + 4*h(f). Give m(p(v)).
5*v**2
Let t = -19 + 24. Let i(v) = 16*v**2 + 7. Let d(o) = -11*o**2 - 5. Let l(b) = t*i(b) + 7*d(b). Let x(w) = -5*w. Determine x(l(f)).
-15*f**2
Let c(o) = 2*o. Let k(l) = 64*l**2 - 768*l. Let n(z) = z**2 - 3*z. Let w(b) = k(b) - 256*n(b). What is c(w(x))?
-384*x**2
Let z(h) = -11*h**2. Let d(q) = 4*q - 5. Let k(f) be the second derivative of -f**3/3 + f**2 + 25*f. Let a(s) = 2*d(s) + 5*k(s). Calculate z(a(j)).
-44*j**2
Let f(p) = 109*p - 2. Let r(b) = -23*b**2 + b. Give f(r(z)).
-2507*z**2 + 109*z - 2
Let f = 1282 - 1282. Let y(k) be the third derivative of 0*k**4 + 0*k + 4*k**2 + 0 + f*k**3 - 1/60*k**5. Let x(t) = 5*t. Give x(y(g)).
-5*g**2
Let l(x) = x - 5. Let o(s) be the first derivative of -s**2/2 + 6*s - 1. Let u(m) = 6*l(m) + 5*o(m). Let k(j) = 209 - 209 + 8*j. Determine k(u(r)).
8*r
Let v(z) = 4*z**2. Let w(q) = q + 3 + 11*q + 4*q + 17*q - 11*q. Determine w(v(x)).
88*x**2 + 3
Let i(q) = -6*q**2. Let v(c) = 351403*c. Calculate v(i(j)).
-2108418*j**2
Let z(s) be the third derivative of s**5/30 + s**2 + 213. Let o(n) be the third derivative of 0*n**3 - n**2 + 0 + 0*n - 5/24*n**4. Calculate z(o(r)).
50*r**2
Let b(c) = 104*c. Let u(p) = 3152*p**2. Calculate b(u(w)).
327808*w**2
Let v(g) = 100*g - 15. Let o(z) = -14*z + 2. Let y(u) = 15*o(u) + 2*v(u). Let x(f) = -1 - 2*f + 1. Give x(y(h)).
20*h
Suppose -h - 37 = -4*q, -5*h = -5 + 30. Suppose -5*r + 2 + 10 = m, -3*m = r - q. Let t(s) = -22*s**2 + 3*s**2 - 7*s**r. Let p(z) = -z. Determine t(p(u)).
-26*u**2
Let y(d) = -27*d. Let a(h) be the second derivative of h**6/720 + h**4/6 - 10*h. Let l(t) be the third derivative of a(t). Determine y(l(f)).
-27*f
Let d(u) = 29 - 4*u - 2*u + 6*u + 16 + u. Let t(i) = 2*i. What is d(t(w))?
2*w + 45
Let a(v) = -9*v. Let h(f) = 48145*f. What is a(h(t))?
-433305*t
Let s(x) = -3*x. Let a = 305 + -44. Let y(u) = -262 + 3*u + 523 - a. What is s(y(b))?
-9*b
Let x(c) = -184*c - 20. Let u(r) = 6*r**2. Give u(x(v)).
203136*v**2 + 44160*v + 2400
Let u(x) = 2 - 2 + 4*x. Let j(r) = -64*r + 7. Let l(g) = -18*g + 2. Let m(q) = 2*j(q) - 7*l(q). What is u(m(z))?
-8*z
Let w(c) be the first derivative of -4*c**3/3 - 123. Let b(v) = 15*v. Give w(b(d)).
-900*d**2
Let h(c) = 9*c**2. Let p(l) = -7*l**2 + 3*l. Let t(y) = -6*y**2 + 2*y. Let s(n) = -2*p(n) + 3*t(n). Determine s(h(d)).
-324*d**4
Let n(q) = 4*q - 5*q - 4*q + 4*q. Let j be ((-24)/(-30))/(2/75). Let s(t) = 19*t + 13*t - j*t. Give s(n(l)).
-2*l
Let p(z) = -76070*z**2. Let o(h) = -10*h. Calculate o(p(j)).
760700*j**2
Let c(k) = -5*k**2. Let b(p) = -3*p + 8. Let i(o) = -12*o + 36. Let n(q) = -9*b(q) + 2*i(q). Determine n(c(m)).
-15*m**2
Let w(z) = 2*z. Let p(g) = 99*g + 6. Let i(c) = 54944*c + 3333. Let y(f) = -2*i(f) + 1111*p(f). What is w(y(v))?
202*v
Let a(m) = 21*m**2. Let l(j) = -3*j**2 - 2*j - 2. Calculate l(a(c)).
-1323*c**4 - 42*c**2 - 2
Let n(s) = s. Let y(u) be the second derivative of 0*u**3 - 2 + 4*u**2 - 21*u - 1/3*u**4. What is n(y(h))?
-4*h**2 + 8
Let f(g) be the first derivative of -2*g**2 - 11*g + 6. Let k(n) = -n - 3. Let a(y) = -6*f(y) + 22*k(y). Let w(r) = -2*r + r + 9*r. Give a(w(z)).
16*z
Let m(j) = 19*j**2 - 10. Let f(u) = 6*u + 5. What is m(f(q))?
684*q**2 + 1140*q + 465
Let o(r) = 2*r. Let c(i) = i**2 - 11830 + 11830. Give o(c(g)).
2*g**2
Let d(k) = -10*k**2. Let a(s) be the second derivative of 0 + 0*s**3 + 0*s**2 + 1/12*s**4 + 18*s. What is d(a(w))?
-10*w**4
Let h(m) be the third derivative of m**4/4 - 5*m**2. Let y(q) = q + 10. Let j be y(0). Let k(f) = j*f - 10*f - f**2. Determine h(k(s)).
-6*s**2
Let h(j) = -j**2. Let q(g) be the third derivative of 1/10*g**5 + g**2 + 0*g**4 + 0 + 0*g + 0*g**3. What is q(h(m))?
6*m**4
Let w(u) = 5*u. Let p(j) = 2*j. Let o(n) = 2*p(n) - w(n). Let x(m) = -m - 46. Calculate x(o(d)).
d - 46
Let y(z) be the third derivative of z**5/20 + z**2 - 32*z. Let n(l) = 4*l - 1. What is n(y(s))?
12*s**2 - 1
Let q(r) = -r - 70. Let p(h) = -h - 65. Let x(a) = 4*p(a) - 5*q(a). Let d(t) = -t. Give d(x(v)).
-v - 90
Suppose 2*i - 5*i - 4*b + 9 = 0, -i = b - 3. Let a(h) be the second derivative of 0*h**2 + 0 - 1/12*h**4 + 0*h**i + 6*h. Let f(w) = 6*w**2. Calculate f(a(t)).
6*t**4
Let v(p) = 1657*p. Let f(k) = -15*k. Determine f(v(w)).
-24855*w
Let u(d) = 2*d. Let v(h) = 1693*h - 39. Let a(o) = 847*o - 18. Let k(j) = 13*a(j) - 6*v(j). Give u(k(r)).
1706*r
Suppose -50 = -2*s - 3*s - 2*k, 0 = -2*s - 3*k + 31. Let w(h) = -22 + 14 - h + s. Let g(u) = 80*u**2. Calculate w(g(j)).
-80*j**2
Let q(g) = -1764*g**2. Let d(r) = -2*r**2 + 65. What is d(q(s))?
-6223392*s**4 + 65
Let q(v) = v**2 + 0*v**2 + 53 + v - 54. Let f(h) = h**2 - 3 + 2*h - h + 2*h. Let d(w) = -f(w) + 3*q(w). Let n(s) = 3*s**2. Determine n(d(m)).
12*m**4
Suppose 7*u - 163 = -149. Let z = 9 + -4. Let t(d) = -z*d**2 + d**2 - d**u. Let c(l) = l**2. Determine t(c(j)).
-5*j**4
Let x(g) = -3*g**2. Let o(m) = 54*m**2 + 15*m. Let r(p) = -2322*p**2 - 648*p. Let w(t) = 216*o(t) + 5*r(t). Give x(w(v)).
-8748*v**4
Let t(c) = 2*c**2. Let m(n) = -n**3 + 4*n**2 + 6*n - 5. Let q be m(5). Let i(g) =
|
Arm and leg substrate utilization and muscle adaptation after prolonged low-intensity training.
This review will focus on current data where substrate metabolism in arm and leg muscle is investigated and discuss the presence of higher carbohydrate oxidation and lactate release observed during arm compared with leg exercise. Furthermore, a basis for a possible difference in substrate partitioning between endogenous and exogenous substrate during arm and leg exercise will be debated. Moreover the review will probe if differences between arm and leg muscle are merely a result of different training status rather than a qualitative difference in limb substrate regulation. Along this line the review will address the available studies on low-intensity training performed separately with arm or legs or as whole-body training to evaluate if this leads to different adaptations in arm and leg muscle resulting in different substrate utilization patterns during separate arm or leg exercise at comparable workloads. Finally, the influence and capacity of low-intensity training to influence metabolic fitness in the face of a limited effect on aerobic fitness will be challenged.
|
Hemodialysis is the most frequent choice for the treatment of end stage renal disease patients in Iran and the world[@ref1] and although it is a safe procedure but it has adverse complications.[@ref2] Intradialytic hypotension is a common complication during hemodialysis[@ref3] and occurs in about 20% of hemodialysis sessions[@ref4], even in some patients it has been reported up to 50%.[@ref5] It is characterized by dizziness, headache, weakness, nausea, vomiting, cramp, dim sight and fatigue.[@ref4][@ref6] Intradialytic hypotension makes the patients to be greatly bored and not only limits removing excessive fluid during hemodialysis but also causes vascular complications including brain infarction, mesenteric, and cardiac ischemia[@ref7]. In one hand, more nursing care is needed[@ref8], the staff would spend more time to control and treat this complication via checking blood pressure frequently, administrating solutions and medicines for increasing blood pressure, oxygen therapy, positioning, decreasing ultra filtration or stopping dialysis before the standard time. It also will reduce the dialysis efficiency and has negative effect on patients' quality of life[@ref9], therefore one of challenges of nursing staffs is how to prevent intradialytic hypotension and its accompanying complication. Happening of intradialytic hypotension is due to the reduction of circulating blood volume of the patient followed by ultra filtration. The decreased volume is the result of osmolality reduction from extracellular space after removing active particles specially sodium.[@ref2][@ref6] Reduced osmolality causes the fluid to transfers from extracellular to intracellular space, leading to an increase in the volume of intracellular fluid and a decrease in extracellular fluid.[@ref2] Hypotension will occur when compensatory mechanism fails following removal of much fluid.[@ref10] Since during dialysis, reduction of plasma osmolilaty is related to reduction of plasma sodium, changing sodium concentration of dialsate will prevent the reduction of plasma osmolality. Studies showed that sodium concentration of dialsate which is equal or more than plasma sodium concentration prevented extracellular osmolality reduction and reabsorbed water into the cell and facilitated fluid transmission into vessels.[@ref11] But hypernatremic solutions cause complications such as gaining weight and blood pressure between dialysis sessions[@ref2], regulation of sodium profiles has been suggested in order to reduce these complications.[@ref6] Regulation of these profiles will modify active level of plasma sodium by changing concentration of dialsate.[@ref12] Regulating sodium profile, hypernatremic dialysate is used at the beginning of dialysis, and during treatment the amount of sodium will be decreased in order to remove additional sodium transferred from patient\'s blood during hypernatremic period.[@ref6][@ref13] Another preventive way of hypotension is ultra filtration profile. By regulating ultra filtration profile, dialysis machine set such that at the beginning of dialysis, much fluid and in final stages little fluid will be removed from patient\'s blood. Reducing rate of ultra filtration in the end stages of dialysis can prevent hypotension.[@ref13] Removing fluid from inside of vessels during ultra filtration profile causes increase of oncotic pressure inside the vessels and reduction of hydrostatic pressure in venous system.
These mechanisms led to increase return of fluids from extra vascular space to intravascular and decrease hypotension during dialysis.[@ref10] In sodium and ultra filtration profiles, amount of removing water and sodium may rise or fall alternatively or it may only reduce gradually.[@ref9][@ref14] Several studies suggested combination of sodium and ultra filtration profiles in order to reduce the complication during dialysis[@ref15][@ref9][@ref6] and in some studies; the emphasis is on more effective sodium profile 3 and ultra filtration profile 3 in comparison with other profiles.[@ref6][@ref16][@ref17] On the other hand, some studies offered reduction of intradialytic hypotension using cold dialysate as an inexpensive, simple and effective method and believed that using hemodialysate with temperature between 34-35.5 centigrade makes hemodynamic status stable during dialysis[@ref3][@ref7][@ref18] , reduces the number of blood pressure drops, improves dialysis quality. But both groups showed that the method applied by them could not prevent blood pressure drop during hemodialysis. Concerning its significance and according to suggestion of Dheenan and Henrich[@ref19] and Rezki et al[@ref17] , we designed a study to compare hypotension incidence and its related symptoms in each method separately and compare it with the combination method in patients with frequent intradialytic hypotension.
Methods {#sec1-1}
=======
This study was a cross over clinical trial. The studied population of this study was patients with end stage renal disease undergoing hemodialysis Aliasghar hospital, Isfahan, at 2008. The patients (n = 24) were between 18-75 years old and they have experienced intradialytic hypotension in 20 percent of sessions during last month. Intradialytic hypotension was defined as reduction of more than 30 percent of systolic blood pressure compared with the status before dialysis or systolic blood pressure less than 60 ml of mercury. The patients underwent dialysis using bicarbonate solution, three times a week via permanent venous access for more than three months Patients with cardiac or hepatic diseases, active bleeding, peripheral vascular disease, thrombosis of deep veins, defective vessels or having body temperature higher than normal during sampling (37.5°c) were excluded. The subjects underwent hemodialysis using cold dialysate for three sessions, ultra filtration and sodium profiles 3 for another three sessions and at last using combination of cold dialysate and ultra filtration and sodium profiles 3 in three sessions. Data was collected using a two part check list. The first part was composed of demographic characteristics of the patients. The second part included information about hemodialysis such as beginning time, terminal time, blood pressure (before, the first hour, second hour, third hour and after dialysis), symptoms following hypotension (cramp, nausea, vomiting, headache and dizziness) and medicines consumed by patient. In order to obtain scientific validity of gathered information, all subjects underwent hemodialysis using Ferznioz 4008 machine, made in Germany. A standard mercury indicator was used in all subjects to measure blood pressure. (a checklist does not need to be validated). Data was analyzed by Chi Square and variance analysis using SPSS. A p-value under 0.05 was considered to be significant.
Results {#sec1-2}
=======
Results showed that a significant difference in hypotension rate was present using ultra filtration and sodium profiles 3, cool dialysate, and combination method (p \< 0.05) but it did not show any significant difference in symptoms following hypotension while using ultra filtration and sodium profiles 3, cool dialysate and combination method (p \> 0.05). There was a significant difference in frequency of dizziness while undergoing dialysis with cool dialysate and combination of the two methods (p \< 0.05) but there was not any significant difference in other symptoms following hypotension between these two groups. In spite of insignificant difference among above mentioned items, in the group received combination method, hypotension and its symptoms was less experienced than in each method separately. Frequent measurements of variance analysis showed that there was a significant difference between average of systolic and diastolic blood pressures before, within and after dialysis in three methods (p \< 0.05). In the combination approach, the rate of drop in systolic and diastolic blood pressure was less than it in each individual method.
Discussion {#sec1-3}
==========
In the present study, two different methods were used to reduce hypotension episodes during hemodialysis and the effect of each method was compared with the combination of two methods. Results showed that there was no significant difference in happening of hypotension between the group used sodium profile 3 and ultra filtration profile 3 and the combination of these methods and also in the group received sodium profile 3 and ultra filtration profile 3 and cold dialysate. These findings suggested that both methods are appropriate in reducing hypotension. But in the group that combination method was used, the frequency of hypotension was less than the groups used each method but the differences were not statistically significant. Rezki et al. concluded that symptoms and number of intradialytic hypotension incidences reduced significantly in hemodialysis group with sodium profile and cold dialysate and also in hemodialysis group with sodium profile compared with control group.[@ref17]
Our results did not show any significant difference considering hypotension symptoms (muscular crump, nausea, vomiting, headache and dizziness) between combination group and each individual method and. But for all complications, number of sessions that patients experienced them was less than those who did experience it. But in combination method, number of sessions that patients experienced adverse symptoms was less than those who received each method separately. Oliver et al. showed that using sodium and ultra filtration profiles not only reduced hypotension during dialysis, but also decreased its symptoms.[@ref20] Ayoub and Finlayson found that cold dialysate increased patients' resistance against reduction of blood pressure and caused increase of ultra filtration and maintenance of hemodynamic stability within and after hemodialysis.[@ref18] The mean of systolic blood pressure before hemodialysis was not different among three groups while a significant difference was present in the mean of systolic blood pressure in the first, second and the third hours and after dialysis. Systolic blood pressure of patients during hemodialysis decreased gradually in all groups and these changes were expected due to reduction of intravascular fluid volume but these changes were at minimum rate while using combination method, cold dialysate users were in the second order and patients received sodium and ultra filtration experienced the most changes in systolic blood pressure comparing two other methods ([Figure 1](#F1){ref-type="fig"}).
{#F1}
The difference between systolic blood pressure changes was not significant between cold dialysate method and the profiles groups but this difference was significant between these two groups and the combination one. Shahgholian et al. concluded that changes of systolic blood pressure while using sodium and ultra filtration profiles were less than control group.16 Frequent measurements of variance analysis showed that the mean of systolic blood pressure was significantly different in the first, second, third hours and before dialysis among three groups.
Several study results including Shahgholian et al. and Moattari et al. agreed with this conclusion.[@ref3][@ref16] Results showed that patients while using combination method had the least changes in the mean of diastolic blood pressure, cold dialysate group were in the second place and patients received sodium and ultra filtration experienced the most changes in diastolic blood pressure ([Figure 2](#F2){ref-type="fig"}). Therefore according to the results obtained from this study, it is recommended to use combination of sodium profile 3 and ultra filtration profile 3 and cold dialysate in patients suffered from hypotension during hemodialysis.
{#F2}
The authors declare no conflict of interest in this study.
|
Look at our new pet…I mean, son.
In the week gay women got the go-ahead to have IVF on the NHS, one couple who paid for treatment insist their son won’t miss not having a father…
Oh well, if they insist their son won’t miss having a father, then it must be the case, right? Why don’t they try asking their son when he’s older whether he likes not having a dad and instead being raised by two selfish fucking rug-munching men-hating scumbags.
Certainly Ruth and Jude, 37, a detective constable with the Met, believe that their son Ben doesn’t need a father — as long as he has two loving parents.
Ruth says: “I feel the most important thing for any baby is that it is born into a loving family, not that it has a mum and a dad. If a child has such a loving and caring upbringing, the typical father figure is not required.”
Your son has not been born in to a family, loving or otherwise!
How many fucking times does it have to be said; a family is a mum, dad and children. Not one woman and her bastard or two women and their bastard.
Note the first couple of words this Ruth says: “I feel…”
She feels that the kid doesn’t need a dad, so therefore it must be true.
If a woman feeeh-ulls that 1 + 1 = 3 then that means 1 + 1 = 3. QED.
So where once children had ‘mums’ and ‘dads’, they now have ‘parents’ and judging by the widespread support Jude and Ruth claim to have received from family, friends and work colleagues, British society today is far more accepting than it has ever been.
Probably because the only family and and friends they have contact with them anymore are those that support them; everyone else has no doubt shunned them. I would. Pair of selfish child abusers; that’s what they are, child abusers, because they are inflicting illegitimacy on a child and depriving him of a father, which is abuse.
Note this comment:
“There will be plenty of male role models in his [the baby’s] life because it’s not a case of our hating men…”
Yet a few paragraphs later:
“There have been no problems with my kids at all because I think women are naturally more caring.”
So they don’t hate men, but they regard men as uncaring and not necessary in a child’s life?
If someone said “I don’t hate black people” then explained that “white people are more caring than blacks” and insisted black people aren’t necessary in any part of society, I think most people could safely conclude that such a person, in fact, does hate black people and is therefore a racist git. The same goes for these women; they claim they don’t hate men…they just regard them as uncaring and unnecessary. That sounds pretty misandrist to me.
Then they explain why they used an anonymous donor:
“We just didn’t want a complication of a dad in our children’s lives. We worried that any man would want access to his child or to be a father to it. At worst, he could even make a claim on his child or want to interfere in the way it’s brought up.”
This seems to be the attitude of an increasing number of women, not just lesbians or single women who go to sperm banks, but divorced women or those splitting up from a boyfriend they have kids with; they’re worried the man might actually be a father to his child or might – “at worst” – make a claim on his child. That above paragraph makes it clear these two hopeless “parents” see their child as nothing more than a pet or a toy, especially the way they refer to their son as “it” in the last sentence! “…the way it’s bought up.” Charming.
This is a call to all men; do not ever ever donate sperm ever. Let’s stop scum like this from inflicting illegitimacy on children.
The couple are planning to go through a civil partnership ceremony next year, which will give Ruth the same parental rights as any father…
So absolutely fuck all rights then?
I can barely finish this article. I can’t stand to read any more of the sickening drivel spouted forth by these two shitbags, especially in the knowledge that the British government is encouraging this.
I hate this stinking society.
posted by Duncan Idaho @ 10:30 AM
——————————————————————————–
At 11:56 AM, Anonymous said…
Thanks a lot for posting this one … spewed my morning coffee all over the keyboard!
——————————————————————————–
At 4:35 PM, The 2nd Nin said…
I find this interesting, how exactly does IVF help two lesbians, by default (and unless they have made advances I am not aware of) there has to be a man involved somewhere in this process.
Considering some of the nasty things that have happened to sperm doners (presumably these women aren’t using husbands / boyfriends) the sperm doners may still have rights to this “it”… I think the words that fit are “be afraid, very afraid”.
——————————————————————————–
At 4:36 PM, Captain Zarmband said…
When the kids in therapy in a few years time these too will blame society for the problem.
This is another example of female consumerism… “I want so therefore I’ll have it and everyone else will have to accept it….Me…me…me..meeeeee.”
So what happens if these two split up which is highly likely in their kind of relationship? Who looks after the kid then? Who has financial responsibility?
I must go now I think I’m about to throw up.
——————————————————————————–
At 5:05 PM, Duncan Idaho said…
I must go now I think I’m about to throw up.
Here, borrow my bucket.
——————————————————————————–
At 5:21 PM, Anonymous said…
I feel sorry for their kid, born and raised by two dikes instead of a normal couple. Fucking selfish bitches
——————————————————————————–
At 4:03 AM, HAWKEYE said…
this is sick and wrong on so many levels.
my compassion is for the child ,poor thing ,
barrrrrf
——————————————————————————–
At 8:22 AM, Anonymous said…
Are you upset that we don’t let you watch our sex, or are you upset that two women make a better father than an asshole like you?
Fuck off and die.
——————————————————————————–
At 10:03 AM, Anonymous said…
Yo anon @ 8:22 am, no we ain’t upset. Seeing two old, fugly, stanky skanks going at it ain’t my idea of a good time. Get a grip. The world ain’t as bad as your crew “frame the worldview”. Bitter and ugly straight women are even worse.
Icepick the Mad!
——————————————————————————–
At 6:24 AM, HAWKEYE said…
i would have more to say on this issue, but i know these cruel, venomous retards will make the man child suffer for it down the track.
——————————————————————————–
Share this:
Like this:
LikeLoading...
Related
This entry was posted on Monday, July 9th, 2007 at 5:12 pm and is filed under lesbos, misandry and single mothers.
You can feed this entry.
Responses are currently closed, but you can trackback from your own site.
|
Australia's Kevin Rudd fights to get Vegemite on plane Published duration 19 September 2011
image caption Mr Rudd said he needed his Vegemite to go with his toast
Australian Foreign Minister Kevin Rudd had to talk himself out of trouble after airport officials flagged up a suspicious liquid in his cabin baggage - a jar of Vegemite.
Mr Rudd was heading to New York from Mexico City when he attracted the authorities' attention.
He explained that the dark brown paste was his breakfast and, with help from local diplomats, was allowed through.
Vegemite, a savoury paste made from yeast extract, is popular in Australia.
It is similar to Marmite, which is widely eaten in the UK, but is hard to buy in many countries.
"Only problem travelling to NY is that they tried to confiscate our Vegemite at the airport. Needed Foreign Ministerial intervention," Mr Rudd tweeted.
"Airport staff were surprised when I said it is good for you and I ate it for breakfast. They then waved me through," he said.
Mr Rudd is not Vegemite's only high-profile defender - Prime Minister Julia Gillard also spoke out in its support when she visited the US in March.
The subject came up when she and US President Barack Obama visited a school in Virginia.
Describing Vegemite as "a quasi-vegetable by-product paste that you smear all over your toast", the US president pronounced it "horrible".
|
For News Media
The botulinum toxins are among the deadliest substances on Earth, and two specific toxins — including the popular drug Botox — have multiple uses for treating many neuromuscular conditions, including frown lines, disabling muscle spasms and migraine headaches.
The botulinum toxins cancel nerve signals to the muscles, creating paralysis that can last for months. Given its extraordinary toxicity, doses are typically measured in trillionths of a gram, and targets are carefully chosen to silence only the desired motor nerves.
When Botox and related botulinum drugs entered the market, “the idea was that they are safe to use, they stay where they are injected, and you don’t have to worry about toxin going to the central nervous system and causing weird effects,” says Edwin Chapman, an investigator at the Howard Hughes Medical Institute and professor of neuroscience at the University of Wisconsin–Madison.
Edwin Chapman
The concern that this powerful toxin can move beyond the injection site was reinforced in 2009, when the Food and Drug Administration added a prominent warning to prescribing information “to highlight that botulinum toxin may spread from the area of injection to produce symptoms consistent with botulism,” including “unexpected loss of strength or muscle weakness. … Understand that swallowing and breathing difficulties can be life-threatening and there have been reports of deaths related to the effects of spread of botulinum toxin.”
Additionally, physicians have seen puzzling results from treatment, adds Ewa Bomba-Warczak, a doctoral candidate in neuroscience. “In many cases, after an injection for a disabling spasm of neck muscles called cervical dystonia, there is no change in muscle tone but the patient finds relief and is perfectly happy. That result can’t be explained by the local effects.”
In a study published today (Aug. 4, 2016) in Cell Reports, senior author Chapman, first author Bomba-Warczak and colleagues present clear evidence that toxin is moving between neurons in a lab dish.
The study looked at mouse neurons in wells connected by tiny channels that allow growth of axons — the long fibers that neurons use to communicate.
Ewa Bomba-Warczak
Jason Vevea
In tests of two botulinum toxins, the researchers saw toxin molecules entering the injected cell, as expected.
Once inside a neuron, botulinum toxin cleaves proteins responsible for fusion of chemical containers, known as vesicles, with the plasma membrane. This fusion event releases chemical signals that underlie communication with muscles, and the inability to fuse leads to the temporary paralysis caused by botulinum toxin.
Using antibodies to identify fragments of the damaged proteins, Chapman’s group showed that toxin molecules were moving to nerve cells in wells that had not initially received the harmful molecules. “Every time one fraction of the toxin acts locally (on the first nerve cell it contacts), another fraction acts at a distance,” says Chapman. “It’s unknown how far they travel, which likely depends on the dose of toxin and other factors.”
Botulinum toxins were first described in the 1800s, and have long been a subject of research at UW–Madison. Allergan PLC, which markets four versions of botulinum toxin, reported global Botox sales of nearly $2 billion in 2015.
Injected botulinum toxin is taken up in axons and reaches the cell body, shown in green, before being transported into different neurons, shown in red. Diagram: Ewa Bomba-Warczak
By finding that toxin molecules don’t always stay where they are injected, Chapman says the Wisconsin study answers a long-standing question about mobility, but raises several more. “We have seen that these toxins enter neurons at the injection site, causing the desired local paralysis, but Ewa and Jason have shown unambiguously the existence of a second entry pathway that takes some of the toxin molecules to other neurons.”
The research, done in a lab dish, removes variables that have plagued similar studies performed in animals, Chapman says. “We wanted to see if we could build an in vitro (in a dish) system that allows direct visualization of this putative movement, in a way that’s simple, easy to interpret, and unambiguous. Do they move, or do they not?”
Chapman wonders about the effects of extraordinarily powerful toxin molecules that travel the neural networks. Local effects have, until now, been deemed the sole effects. But could part of its effects be due to the transported toxin?
“It’s an exciting prospect, supplanting a $2 billion drug with a safer drug.”
Edwin Chapman
These questions could be answered by genetically engineering the Clostridium bacteria that make botulinum toxin to alter the toxin’s structure, Chapman says. “We may be in a position to mutate the part of the toxin that attaches to a receptor on the neuron so it can only enter the local pathway, not this new pathway we have described.”
If only the local effects matter for medicine, tomorrow’s versions of this ancient toxin molecule may be able to alleviate symptoms from wrinkles to severe muscle spasms without moving beyond the target neurons.
“I have a hard time imagining that any physician is going to want to inject something they know can move about when they have an option to use something that stays put,” Chapman says. “It’s an exciting prospect, supplanting a $2 billion drug with a safer drug.”
|
Thomas Colby
Thomas Colby may refer to:
Thomas Colby (MP for Melcombe Regis) (1530–1588), English politician
Thomas Colby (MP for Thetford) (died 1588), MP for Thetford
Sir Thomas Colby, 1st Baronet (1670–1729), MP for Rochester
Thomas Frederick Colby (1784–1852), British major-general and director of the Ordnance Survey
See also
Colby (surname)
|
History of benzodiazepine dependence.
The benzodiazepines were developed in the 1950s, some introduced in the 1960s, and many more since then. Pharmacologically, they are sedative/hypnotics akin to alcohol, chloral, the barbiturates, and meprobamate. All have been widely used both within and outside the licit medical context. Usage of benzodiazepines increased dramatically during the 1960s and early 1970s; tranquilizer but not hypnotic usage has since declined. Both abuse and misuse were documented early, but the incidence was deemed low in view of the widespread prescription. Normal-dose physical dependence was first suspected in the early 1970s but it was not until the early 1980s that scientific evidence was adduced to establish its reality and frequency. Further studies have revealed the complex nature of the withdrawal syndrome. A reaction has set in against these drugs, with attempts to limit them to short-term use.
|
..Administration of cocaine by different routes alters the amount of cocaethylene formed through hepatic first-pass effects. Increased cardiovascular and subjective effects might explain the toxicity and popularity of the combined drugs...
|
Q:
CSS column on the right, same height as container
I have a container with 2 divs inside it. One takes the left side of the container and the second one (rightBarItems) should be positioned on the right side but I want its height to be the same as the Container's height. Basically, I am creating a column to the right.
HTML:
<div class="container">
<div class="itemMain"><?php include("itemMain.php"); ?></div>
<div class="rightBarItems"><?php include("rightBarItems.php"); ?></div>
</div>
CSS:
.container {
overflow: hidden;
background: white;
padding-right: 20px;
-webkit-box-shadow: 4px 2px #492409, -4px 0 2px #492409;
-moz-box-shadow: 4px 0 2px -6 #492409, -1px 0 2px #492409;
box-shadow: 4px 0 2px #492409, -4px 0 2px #492409;
}
A:
Two drity solutions (both of them have their issues)
The first:
1) postion relative the container
2) and float the left element.
3) position absolute the right element and set its top:0 and bottom:0, right and the width
The issue of course with this is that the left cotainers content should be larger than the right ones
The second (if you can add more elements to the html):
1) postion relative the container
2) float the right and the left container
3) create a new div that is the "bg" for the right element
4) position absolute that the same way in the previous: right:0, top:0, bottom:0 and the width
5) tweak the z-index if necessary
:O
edit:
quick sample of the latter solution: http://jsbin.com/ecaced/1
|
Sunday, August 30, 2009
Family is somehow one of the best gifts God has given to mankind. They are the only persons who understand, love and care for you no matter what. They will always be there for you when the rest of the world leaves you. And I am so thankful because God has endowed me the best family whom I can say is my inspiration in everything I do.
But yesterday, my mom cried in front of me and I can't just endure the pain whenever I see those liquid crystals flowing from her eyes. She's hurting. I don't wanna detail out what really happened but it's between her and dad. I have only seen them fight once. It was hard for me to digest all those words that my mom uttered because I am a daddy's girl ever since. I was hurting too and yes, I cried. I can't help it. Whenever I see her crying, I cry, as well. Just to give you a little information, it has something to do with money. So yeah, if the entire world is in recession right now, my family is experiencing it too.
Last night, I was chatting with a friend whom I consider as my Best Bud. I opened up. You know what I asked him? "Bakit pa kasi nauso ang financial problem eh?" I'm just too glad because I have friends like him, Dyei and Unjeh whom I can open up all my problems with. He was just telling me that maybe my dad was just stressed out or pressured. He assured me that everything will be okay so I have to cheer up. You know what I really like about him is that whenever I need him, he's always there. I don't know if he has this so-called spider sense but I'm so happy that he's around. For the past weeks, we have never kept in touch that's why when he buzzed me last night, I was surprised. Perhaps, he felt it.
I may not have the perfect family but I consider them as the best. With all those sacrifices and hardships that they had in the past just for them to give me the good life, I guess, it's time for me to return the favor. I must look for a job already. I want to give them a good life, something that they truly deserve. I want to take care of my parents the way they took good care of me and my brother.
I hope the problem between my parents will be settled down as soon as possible. Though I know my dad a lot. He will never let the problem pass by without solving it. He is a family man and I know how much he loves us especially my mom. I just hope and pray that everything will be okay. I just can't wait for it because my mom's birthday will be on Tuesday.
I also wish that once I turn twenty, several opportunities will finally come my way. I can't wait to work. I'm excited, in fact. I have plans for my family and for myself and I want to fulfill all of those very soon.
Saturday, August 29, 2009
Monday, August 24, 2009
Ate Pj, Claudine, Erika, Charlene, Celine, Cez, Ej, Kuya Chet, Jasper
With cousins during the double birthday blowout of Kuya Chester and Charlene. Just so you know, Kuya Chet is now part of the U.S Army. Proud cousin here. :) The party was held last Saturday at the Ozeano Fusion Restaurant in Manila Ocean Park.
Thursday, August 20, 2009
It has been my routine everytime I'm getting online to first check the Yahoo! headlines, my Yahoo! Mail, Plurk, Twitter, Multiply and Facebook. While I was reading the headlines of Yahoo a while ago, a news caught my attention with the title "U.S. News' rankings of America's best colleges."
And yes, Harvard University in Massachusetts and Princeton University in New Jersey are America's best colleges of 2010. Two of the eight Ivy League schools are tied for the first place. Ranking in third is another Ivy League school which is the Yale University.
Know what, it is really my ultimate dream to study at any of the eight Ivy League schools. I guess, it is everyone's dream but only few are privileged enough to study in those world-renowned universities. And I know that I will never have the chance to study at any of the Ivy League schools. It will remain as a dream forever.
Actually, right now, I am very confused. I actually don't know what I really want to do. I've been reflecting lately and the idea of becoming a pre-school teacher suddenly popped out. I love kids ever since. Although I easily lose patience but when it comes to them, it is really a different thing. I would love to bond, teach and play with them.
You might be confused as well because I finished college with a degree in IT and yet I want to pursue a career related to child development. Even me, I really don't know what's going on my mind. Perhaps because I've been a bum for many months now. Another thing that really bothers me is the fact that I want to go to school again not to pursue a Master's Degree in IT but with a different course.
I want to do a lot of things. I want to try new things which include careers with no relation at all. I want to become a Systems Engineer (IT-related), pre-school teacher and even establish my own clothing line and restaurant. It's just that I don't know what I really want and if I wanna pursue all of those, I don't know where to start. It is really confusing.
Perhaps, I need some time to reflect on what I really want but most likely it's either becoming an IT professional or a pre-school teacher. And yes, my mom didn't like the idea of me becoming a teacher. Hehehe :))
Saturday, August 8, 2009
I was away for one week but not really away, actually. I was in Las Piñas for a vacation and to tutor my two cousins, as well. Nothing much happened except for non-stop bonding and laughtrip. I had good times with Mama Lolly, Daddy Rap-rap, Ninang Carina, Reina, Celine, Claudine and Stephen.
Last night, we were in SM Mall of Asia to meet Celine's best friend. We strolled around MOA with Issa. Afterwhich, we met the rest of the guys at Racks. We went directly to Fields because Ninang Carina and Daddy Rap-rap were inquiring about the condo unit. So yeah, we just stayed there for quite a long time while hearing our stomachs producing unwanted sounds. Hahaha :))
After that, we dropped by Team Manila and Ninang Carina bought us tote bags. Thanks for that! :D We had our super late dinner at North Park. We actually arrived home at around 12am because of traffic. Hays.
Today, we first dropped by the cemetery to visit Inang, Amang and Tita Helen then off we went to Kuya Jojo's new house. It is his birthday today, by the way. He had a mini celebration. Yummy foods. :) I really had a good conversation with Ate Alex. Too bad, we went home early.
And now, I'm back in Manila. I missed my family, the place, my laptop and everything. :) Ninang Carina is actually encouraging me to extend my stay but unfortunately, I will go to Quezon City on Tuesday. And yes, they will be here on Tuesday and she was asking me if I want to go with them again. I'm still thinking about it.
|
I'm campaigning for the local Labour party.
Hello Peterborough!
This is a very big political moment for the
country.
It's quite crazy, obviously, growing up here
to see it in the national spotlight,
it's quite scary.
It's like the barometer of the whole nation really,
like the last bastion of hope type of thing.
I've seen the way this town has been shafted
over the years, to be honest.
… this isn't even about Brexit,
this is about the kind of country we live in.
… people transform our society,
so we won't be one that's so divided,
we won't be one where we walk by
on the other side
for those that are unfortunate.
I mean, with the odd break,
this is about 14 days on the road now.
Frimley, Manchester, Swindon,
Thornbury on the edge of the Cotswolds.
Look at that,
we've got to go and get a shot of that.
That was post apocalyptic.
GPS: At the roundabout,
take the third exit.
Peterborough has got everything really
that sort of denotes modern Britain for good and ill.
It's got loads and loads of warehouses
and distribution centres.
It has got a huge population of people
from EU countries,
and other countries besides,
and it voted by a pretty heflty majority
for Brexit.
You know there's a giant bird cack down your windscreen
I've kept that there
for symbolic purposes.
It's to indicate the fact we're being that we're being shat on.
I wanted to send a message,
because we are sick and tired of the establishment.
I am here to support it
and teach the elite a lesson.
Tell me about your idea of the elite,
who are the elite?
Well, the elite are the same people who
control the Guardian now and are
putting through your neocon agenda.
Wow!
So where are you coming from politically? Well, it depends, I'm a supporter of Julian Assange,
which the Guardian isn't,
I'm a supporter of Bradley Manning,
which the Guardian isn't.
Left and right all joins.
Right.
I also blame the free markets,
but I don't think they have the free markets anymore.
We have crony capitalism.
Big queue.
In any given political situation,
someone's got a big queue, you know,
It was sort of, Corbyn two years ago,
wasn't it?
And it was Scottish independence,
a year or two before that.
These MPs are payed about £75,000,
they voted in to do what …
... our bidding.
But they're not doing it ...
What we tell them to do, but they don't ...
They're going off on a tangent ...
Respect the people.
I've watched some of these on the internet
and I thought:
'oh, this sounds intersting'
and he's got a very, very powerful message.
The British political class
is rotten to the core.
Parliament has abolished the referendum
and declared war on the British people.
Welcome to the stage,
Nigel Farage!
And trust me, trust me,
there are shitloads, a lot more people feel like this.
A lot more people.
And don't think this movement,
and it is a movement now,
that means nothing still,
that's what they think,
it means nothing still.
Wait until after this European election,
and then Peterborough,
when we win that too.
Who are you fighting?
Everybody.
This part of Manchester is at the other end
of the Brexit spectrum.
I'm just freestyling here, guys.
You're sort of freestyling about topical
things…
I obviously, you know,
share the concern about Brexit
but at the same time,
I am not knowledgable enough
to share, you know,
a prevalent opinion.
What's your sense of the future?
Are you feeling optimistic or pessimistic?
Optimistic, absolutely.
You know, my journey now
is just to carry on creating, that's cool with me.
I don't…
You don't see any sort of…
I'm a bit older than you,
I feel there's a lot of dark clouds on the horizon,
the world's not going in a very nice direction.
Yeah, but for what I can do as an individual,
I just think it's about being, you know,
on an individual to individual basis,
just being positive with one another,
that's sort of the easiest way to effect change.
You are the one man antidote
to the bleak mood.
I've stopped watching the news
because it's like,
what's the point,
it's just the same stuff, different day.
You tuned out?
Yeah.
Just because I've got more important things
to think about now.
What like, one on the way?
Yeah.
What kind of world do you think
you're bringing your baby into?
I don't know.
You're talking to the wrong guy.
You must have an opinion.
My opinion is,
don't worry about the country,
worry about yourself.
Really?
There's nothing else you can do.
If you worry about the country,
what can we do about it?
This is where vox pops are
simultaneously completely unscientific and random ...
But also, very revealing.
About three days ago
we were in Surrey,
at a Nigel Farrage rally.
and I know exactly what they want,
Brexit now, right?
The people I've spoken to here seem much more …
I'm just politically confused.
Do you know about Change the UK,
the independent group?
Yeah, don't start ...
Why you're laughing?
You know why I'm laughing.
Speaking of being politically confused,
there's an event in the centre of town
put on by the other new party,
trying to use these elections
to make a big breakthrough.
No queue here as yet.
It's like a gate at an airport.
The Change UK flight to Romania
is now ready for boarding.
We've decided that we could no longer
put up with politics as it was.
We'll come to that,
we are just whetting your appetite for it.
That's what we're going to do in a second.
So … ah!
While we find our wi-fi connection…
I want to stand on a platform
to rebuild something,
to reshape and to change our politics.
We are campaigning,
if we're going to go off the cliff in October
to revoke article 50.
It's not quite funny
but it's not bad.
It's the way in which
my community is dismissed,
the way which is smeared as some liberal
metropolitan elite,
it's disgusting.
We have to walk,
otherwise I am going to miss this train,
and I'm going to be killed
if I miss it.
You should have called yourself
the remain party,
shouldn't you?
No, because the broken nature of our politics
is far beyond Brexit.
You're not going to out
with a whimper, you don't worry about that?
No, God no.
I mean, I wouldn't…
Apparently were these narcissistic,
egotistical careerists ...
we've done like the most non-careerist thing you can think of.
Hi mate, are you alright?
So what happens next?
I hear there's infinite possibilities so …
Infinite possibilities.
Right, go and get your train.
I am going as well!
There they go.
Change UK.
Well considering how het up everyone's
got about this election,
it's a little bit tumbleweedy.
Not by the look of it.
What, because two people have got in to vote?
It's not exactly South Africa.
It's not like Nelson Mandela.
You can't tell us how you voted,
could you?
I wish I could.
Who did you vote for?
Brexit.
Did you?
Yeah.
I mean, you know the fella in charge of
of the Brexit party, Nigel Farage?
A great fan of Mrs Thatcher and all that.
Well aren't they the people who did for Merthyr
not that long ago.
You can't keep going back in history,
can you?
What do people say leave the EU
to make things even worse?
I don't believe it.
They said the day we voted out.
Everyone said that the European Union
has put so much into Merthyr, and they have.
You know, we've got a nice bridge, you know,
we've had a lot of funding,
but it doesn't help us.
Do you work?
Yeah.
What do you do?
I'm a gardener.
What do you do?
Healthcare.
You know,
there's always a struggle.
I don't know, it's the same as it's always been.
And that's why we need to change.
Radio presenter: It's Friday for most
of us today,
Some warm sunshine around as well.
There'll be some changes coming in to the south-west …
We drove across the social spectrum
on election day,
and went a bit mad in the process.
John, what are you doing to my car?
What have we done?
Two things were pretty constant.
However low trust in politics was before
the referendum,
it's worse now.
Brexit party or no Brexit party.
I don't believe Farage for one minute
he's for the working people.
And no one likes the media either.
Every time you switch on the telly,
it's Nigel Farage.
Yeah, I agree, I agree.
That's media driven,
with respect to you guys.
In fact, no one seems to trust anything anymore.
We don't know where we are.
Feels good though.
This is the sort of place where
vox pops could be.
What have we got here? Blair Parade!
I'm liking it!
Can I talk to you for a minute?
I ain't got time.
Come one, one quick question.
What?
Are you going to vote today?
No.
You're not?
No.
Wow!
Blair Parade.
- Blair Parade.
What do you think of the state of the country?
Last question.
It's not very good, is it?
So why don't you vote then?
They will do what they want to do anyway.
Not this time, maybe.
Yeah, right …
They are corrupt, got to go.
All the bankers, mate, all the top bankers,
the Rothschilds and all them lot mate
The politicians, they're all under their cuff now,
They all give them money.
The entrails of this modern internet politics
are everywhere, aren't they?
Everyone is a conspiracy theorist now.
Which is why, in retrospect,
holding a referendum just as technology
completely changed the way millions
of people thought about politics
was always going to turn everything
on its head.
Do you know what it is?
The beauty of representative democracy
and I include myself in this, right ...
Is you don't have to have
a detailed opinion about fuck all
you can vote on the basis of whatever you like
and it just goes in a big mincing machine,
and out comes the government …
If you don't want them you can vote them out.
The idea that everybody's got to be an expert,
it's ridiculous.
Look at that lorry mate
Why, what's wrong with it?
It's on zigzags and he knows that.
They ought to take your license away
He just blocked someone in.
So, have you voted yet?
Yes.
I'm going now, mate.
And who are you going to vote for?
Have a guess.
Brexit party?
Yeah.
Why do I need to be in Europe?
You give me an answer to that.
Well, because it's a series of trading arrangements.
How did we trade it before?
Different world then, no?
Different world?
Yeah, it's a different world now.
What needs to change about the country
to make you feel better about all of this?
You don't want it on there ...
Go on.
Have you been up Swindon town?
No, go on.
Well, I will tell you what,
on a hot day like today.
When I go to town ... it feels like
I've already gone on holiday,
and you know what that means.
They are not the people who do all the work?
Keep the place ticking over?
Who's not all the people who…?
Well, the immigrants you're talking about.
You're trying to put words into my mouth.
What I am going to say is,
look at our town, mate, Primark's all we've got here, Primarks and a charity shop, look at me.
Right? Primarks and a charity shop.
These old jeans.
I am not a Primark or a charity shop shopper.
I worked hard.
There's a lot that's going on for my age to be truthfully honest, like, not many of my friends my age vote
or to be truthfully honest,
so, it's one of these things that I try to
get information relevant to it
but I don't know…
What if I said though that by not participating
you lose to people like the gentleman we've just met.
Who's that?
Who thinks Swindon isn't Britain anymore,
doesn't want immigration
and he's going down there to vote for the
Brexit party.
OK.
And you and your friends
aren't really engaging on politics
and therefore, he's winning.
I know, I can see why you're saying that.
I am more concerned for what my daughter
and my kids growing up
and what it's going to be like for them,
to be truthfully honest…
I don't know,
I really don't know.
But I literally need to go.
Go, go.
Who did you vote for just now?
Where is this going?
On the Guardian's website.
Right.
Put it this way,
democracy is broken.
Go on.
That's it.
Work out from there.
It's the Saturday before
the Peterborough byelection.
Activists have come from all over this part
of England
and beyond,
to help Labour get their vote out.
We need a Labour government.
How do you feel about the state of the country,
right now?
It's dying.
The far right is on the rise,
racism is almost as bad as it was on the 70s.
Thanks to all of the constituencies that are
here today.
and of course the danger is if I start mentioning them I'll leave somebody out,
and be told off forever more,
but I'm used to that kind of problem
with the mainstream media.
And I don't care!
The one-trick pony Farage
is in town today.
What does he know about education,
what does he know about police cuts?
What does he know about the pain
of trying to survive on universal credit?
He's not talking about Brexit.
The B word is unmentioned.
We're going to go because
we have stuff to do.
Can we follow you around?
Sorry to disturb you …
She's voting Labour.
Can you tell me what you think about Brexit?
Is this your business?
It's my aunty's.
So you're from a Portuguese family.
I am.
But were you born in Peterborough?
I've been here for 20 years.
How do you feel about the state
of the country right now?
Brexit and all that…
Shit.
Sorry, I don't know if I am allowed to use that,
but yes, it is, it's really bad.
I work at Pizza Hut in town,
and we are all foreigners.
And we get quite a lot of,
you know,
abusive …
And we've noticed it more since Brexit.
Like you know,
that we're worthless, really.
Nigel Farage, I've just tried
to have a bet on him
He's 200-1 for the next prime minister
and I'm going to have £10 on him.
Do you mean that's a good or bad thing
if he was the prime minister?
I think it would be a good thing.
But what's the point
if it's all corrupted?
They listen to the English people,
they don't listen to the foreigners.
We've got no say here.
It's called democracy
It's corruption, really,
it really is.
Well with democracy we should be allowed to vote for the Brexit as well because we pay the taxes.
It's amazing how for Brexit only the older
generation voted
and not the younger generation.
If you think about it, it's the younger generation
that's going to be here,
not the older generation.
See, you're judging me already.
God, but the atmosphere has got worse
in Peterborough ... you say.
Are you canvassing for the Conservative …
Oh, no, you're Brexit party people.
Only the Brexit party can bring about the
change
in politics that Peterborough desperately
needs.
Well, I was into Ukip
but that relationship ended.
But I've got from left to right, you see.
I stood for Labour in West ward here.
I did.
- Isn't politics weird these days?
It was a question of democracy
and sovereignty.
What Nigel said is that he's going to bring
direct democracy,
like the Five Star Movement,
his aim is to make the Brexit party like the
Five Star Movement in Italy,
which has direct democracy,
where members vote on the policies electronically.
God, what a funny old state the country is in, eh?
That he wants direct democracy.
Beppe Grillo.
Well, you better bring back hanging then,
that's the thing.
See, what I think this is all about is something we've only just started to understand, you know,
it's really about what the internet does to
politics.
Because everywhere is open to everything.
Who would have though that we would meet
people in with a shout of getting an MP
who go on about Beppe Grillo's direct democracy.
You know, people who are sensibly on the right of politics who support Julian Assange ...
And then Corbyn comes out and says …
makes reference to the mainstream media.
And it's sort of out of anyone's control.
And it's still going.
And the crowd here is different.
It's more diverse, there's more women,
there's more young people…
Probably shows you that the Brexit party
is spreading.
Well I think its the realignment of politics,
isn't it?
Left and right is in the past.
This is about a call for people to try
and you know, reconnect
with you know, where power is actually…
Do you feel like that yourself?
Yeah.
Thursday, in Peterborough, is democracy day!
|
Molecular ecology and adaptation of visual photopigments in craniates.
In craniates, opsin-based photopigments expressed in the eye encode molecular 'light sensors' that constitute the initial protein in photoreception and the activation of the phototransduction cascade. Since the cloning and sequencing of the first vertebrate opsin gene (bovine rod opsin) nearly 30 years ago (Ovchinnikov Yu 1982, FEBS Letters, 148, 179-191; Hargrave et al. 1983, Biophysics of Structure & Mechanism, 9, 235-244; Nathans & Hogness 1983, Cell, 34, 807-814), it is now well established that variation in the subtypes and spectral properties of the visual pigments that mediate colour and dim-light vision is a prevalent mechanism for the molecular adaptation to diverse light environments. In this review, we discuss the origins and spectral tuning of photopigments that first arose in the agnathans to sample light within the ancient aquatic landscape of the Early Cambrian, detailing the molecular changes that subsequently occurred in each of the opsin classes independently within the main branches of extant jawed gnathostomes. Specifically, we discuss the adaptive changes that have occurred in the photoreceptors of craniates as they met the ecological challenges to survive in quite differing photic niches, including brightly lit aquatic surroundings; the deep sea; the transition to and from land; diurnal, crepuscular and nocturnal environments; and light-restricted fossorial settings. The review ends with a discussion of the limitations inherent to the 'nocturnal-bottleneck' hypothesis relevant to the evolution of the mammalian visual system and a proposition that transition through a 'mesopic-bottleneck' may be a more appropriate model.
|
Synthesis and application of a fluorescent substrate analogue to study ligand interactions for undecaprenyl pyrophosphate synthase.
Farnesyl pyrophosphate (FPP) serves as a common substrate for many prenyltransferases involved in the biosynthesis of isoprenoid compounds. Undecaprenyl pyrophosphate synthase (UPPs) catalyzes the chain elongation of FPP to C(55) undecaprenyl pyrophosphate (UPP) which acts as a lipid carrier in bacterial peptidoglycan synthesis. In this study, 7-(2,6-dimethyl-8-diphospho-2,6-octadienyloxy)-8-methyl-4-trifluoromethyl-chromen-2-one geranyl pyrophosphate, a fluorescent analogue of FPP, was prepared and utilized to study ligand interactions with E. coli UPPs. This compound displays an absorbance maximum at 336 nm and emission maximum at 460 nm without interference from protein autofluorescence. It is a competitive inhibitor with respect to FPP (K(i) = 0.57 microM) and also serves as an alternative substrate (K(m) = 0.69 microM and k(cat) = 0.02 s(-)(1)), but mainly reacts with one isopentenyl pyrophosphate (IPP) probably due to unfavorable product translocation. Fluorescence intensity of this compound is reduced when bound to the enzyme (1:1 stoichiometry), and is recovered by FPP replacement. Using stopped-flow apparatus, the interaction of enzyme with the compound was measured (k(on) = 55.3 microM(-)(1) s(-)(1) and k(off) = 31.6 s(-)(1)). The product dissociation rate constant (0.5 s(-)(1)) determined from the competition experiments is consistent with our previous prediction from kinetic simulation. Unlike several other prenyltransferase reactions in which FPP dissociates slowly, UPPs binds FPP in a rapid equilibrium manner with a fast release rate constant of 30 s(-)(1). The fluorescent analogue of FPP presented here may provide a tool to investigate the ligand interactions for a broad class of FPP-binding proteins.
|
Mark and Charla Eastwood, Directors of Charis Bible College in Kansas City. (Click to enlarge)Mark and Charla Eastwood met in rural Kansas in 1990, and both truly believed they were born again. But when they realized that neither of their lives showed any visible fruit of the peace and joy that Jesus has promised to those who follow Him, they knew something wasn’t right.
As they sought the Lord, He led them to watch Kenneth Copeland’s television program, where they heard truths of God’s Word that they had never before been taught. Once they got a glimpse of all God had for them, they became immersed in learning more of His Word and His ways: “We learned about Mark and Charla on their second-year mission trip to Mexico in 2001.(Click to enlarge)divine healing, which we knew nothing about,” says Mark. “I prayed for Charla, and the sinus headaches she’d been plagued with almost daily for more than two decades were gone, never to return. We were off and running!”
After several years of walking with the Lord in a Spirit-led relationship, God put it on their hearts to attend Bible college. They had no idea where to begin searching for a Bible college, but God did. God led Mark into a conversation on his construction job site one day, and he was given a cassette tape of one of Charla teaching in Mexico. The outreach began while there was still daylight, and according to Charla, there were not many in attendance. By the time the team gave an altar call, more than 120 people came forward from the shadows to receive Jesus. Out of darkness into the Light! (Click to enlarge)Andrew’s teachings.
After learning more about Andrew and his ministry, they also discovered that he had a Bible college. At the time, Charis Bible College (CBC) Colorado was Andrew’s only college, so the Eastwoods began their studies via the correspondence program. After finishing their first-year courses, they relocated to Colorado Springs to complete the second-year program.
At CBC, the Eastwoods learned about God’s grace and love, how to live victorious Christian lives, and how to pray effectively—for themselves and for others. Charla recalls, “We were trained to minister. We volunteered on the prayer line, we effectively ministered discipleship, and we even traveled to other countries to minister.” In May of 2001, In 2012, the Eastwoods became the Directors of CBC-Kansas City. Here students attend class at the extension school. (Click to enlarge)the Eastwoods became graduates of CBC-Colorado.
Upon graduation, Mark and Charla returned to Kansas and began serving as prayer ministers at Gospel Truth Seminars around the country. “Using the training we had received at school, along with the opportunity for practical application, we were able to minister God’s love and grace to hundreds—seeing signs, wonders, and miracles following,” said Mark.
During this time, God arranged many divine appointments for the Eastwoods, and they began holding local Bible Mark and Charla speaking during a special event. CBC-Colorado's Healing School held a special seminar at CBC-Kansas City. (Click to enlarge) studies and meetings, where they taught the Discipleship Evangelism program while ministering and praying for people. In 2011, God opened a door for them to intern with CBC-Kansas City when the director, Cody Hull, relocated to Houston to start a new CBC. In March 2012, the Eastwoods were chosen to take the helm as directors at CBC-Kansas City.
“The 2012-2013 school year has been an exciting one,” said Charla. “The college relocated, we have all- new classes for first-year students, and we have hungry students who are learning Mark (center) praying for a pastor in Nicaragua. To Mark's left is CBC-Florida's Director, Danon Winter. (Click to enlarge)and growing quickly... Our second-year class has already been on a mission trip to Nicaragua, where they saw blind eyes opened and many physical ailments healed, along with salvations and baptisms in the Holy Spirit.”
Mark and Charla have caught Andrew’s vision of planting Charis Bible Colleges all over the world. They have seen firsthand how the message of God’s goodness and grace that is taught at CBC is both life giving and life changing. As the newest directors of CBC-Kansas City, the Eastwoods have the opportunity to impact their home community—and ultimately the world—in a bigger way than they ever thought possible. And it all started with a teaching tape that led them to CBC over ten years ago.
Reader Comments (2)
I am another "Wilde Christian" Carpenter and I meet you both several years ago when you first started your circuit with Andrew on his prayer team. I am glad to see how God is using you with your on school and doing so well. I am also a second year student in Raleigh-Durham School. Hope our paths cross again someday soon!
|
click to enlarge
Event organizers announced Tuesday that former White House chief strategist Steve Bannon will speak later this month at UC Berkeley’s controversial “Free Speech Week.” However, campus officials say they've received no confirmation that the speaking event will take place.News broke last month that the Berkeley Patriot, a conservative UC Berkeley news outlet, had invited Bannon to join “Free Speech Week,” which is slated to begin Sept. 24 and is scheduled to also feature Milo Yiannopoulos and right-wing commentator Ann Coulter as speakers.In a statement, Yiannopoulos wrote that Bannon would also be appearing alongside 20 other speakers that have yet to be announced.“Uncle Steve was the force behind Trump’s election victory and much of his initial policymaking,” Yiannopoulos wrote in the statement. “Nothing could be better for the leftists who oppose Trump so vehemently than a lesson in the logic behind Trump’s actions, direct from the architect of his policies.”Pranav Jandhyala, an editor for the Berkeley Patriot, said his organization has been working with the campus, the police department, and the state government for months in preparation to host Bannon.“We’re excited the opportunity to host someone like Steve Bannon, a speaker of that caliber is amazing for us,” Jandhyala said. “He’s one of the most coveted speakers out there.”But campus spokesperson Dan Mogulof wrote in a statement that the campus can't confirm when or if Bannon and the other speakers will appear on campus. He noted that none of the speakers invited for Free Speech Week has connected with the campus to discuss security arrangements and that rental fees for venues have not yet been paid.“Simply put, the [u]niversity cannot provide the security and support the student organization has requested, and the campus wants to provide, if we do not receive the essential information,” Mogulof wrote in a statement. “The group’s failure to meet important deadlines is making it increasingly difficult to ensure a safe and secure program.”
|
When Ken Belanger tells you, somewhat sternly, he didn’t “enjoy” fighting during his OHL and NHL careers — “For the record, keep that straight.” — you don’t dare defy him despite his reputation for regularly dropping the gloves and devoting his six-foot-four inch frame to devouring the poor sap at the other end of his long reach.
But if the Sault Ste. Marie native and former Ottawa 67’s enforcer, who went on to log a about a decade in the NHL as one of the league’s renowned heavyweights, were today an OHL up and comer, it might have been a kinder, gentler Belanger fans would have come to have known.
That’s because of the Ontario Hockey League’s latest bid to land a knockout punch on frequent fighters.
“Let’s not keep any secrets. There’s the dollar bills being paid in the NHL now ... That’s the ultimate goal,” Belanger said on Tuesday.
“No one’s going to make the NHL fighting, anyway. Those days are completely gone. So you have to be a well-rounded player.”
Commissioner David Branch announced last Wednesday players who engage in more than 10 altercations during the regular season will receive a two-game suspension for each additional fight up to 15. For fights 16-20, the player will continue to receive two-game bans and his team will also be fined $1,000 and the league also has the latitude to institute further punishment.
If a player is instigated upon, the fight will not be included in his season total, a move designed to prevent goading a player into a suspension. OHL statistics over the past five years show 66% of OHL players fight less than twice in a season and 92% less than 10 times, Branch said.
Belanger is simply bewildered.
The 38-year-old, responsible for 695 penalty minutes during his NHL career, said if this move is merely directed to scale back fighting in hockey, Branch is barking up the wrong tree.
Fighting will never be completely eliminated, Belanger argues, and further penalizing OHL players who drop the gloves will only hurt those who move up the hockey hierarchy.
“(Hockey’s) a game of emotion, it’s a game of teamwork, it’s a game of guys protecting guys, watching each other’s backs, guys stepping up to each other if someone does a dirty hit ... It’s a game of accountability,” he said, adding NHL instigator rules have only seen concussions increase, “respect rates” diminish and “head shots” hike.
In 1992, the league ushered in the controversial “instigator” rule, which adds an additional two-minute minor penalty to the player who starts a fight.
“But I really think there will be an issue when a guy can’t stand up for a teammate,” Belanger said.
“If someone hammers a goalie, that’s OK now because, guess what, my excuse is I can’t do anything to the guy because I don’t want to get suspended.
“So now, is there accountability for anybody?”
In other words, what you might see now are some players thinking they can, perhaps, high-stick or do other dirty deeds with impunity — violations that would have earlier landed them a crack in the jaw.
“(The new rules are) not going to eliminate head shots and guys getting into fights, because, guess what, if your top-line players aren’t going to be getting into fights, they’re going to be running around, and now you’ve got your small guys who don’t have to worry about fighting,” he added.
“I just think it doesn’t put accountability in for someone not to respect their opponents because there’s no fear, there’s no repercussions.”
Denny Lambert would agree.
The Wawa native and Soo Greyhounds alumnus, who spent parts of eight seasons in the NHL, was no slouch when it came to fisticuffs — but nor was he a six-foot-five picture of elegance on the ice.
And it’s such restrictive fighting rules as those recently ushered in by OHL brass that can only hurt what Lambert dubs as one of hockey’s most enduring qualities: player versatility.
“Hockey is not just based on all skilled players ... That’s why it’s so exciting,” said the five-foot, 11 Lambert, who racked up 1,391 penalty minutes in 487 regular season NHL games.
“If you want to watch the all-star game every day, I’d advise not to want that. It’s not a very exciting game, star players not touching each other and not playing with this emotion.”
Unlike Belanger, Lambert, who spent three seasons with the Greyhounds (1988-91), said if such rules had been imposed during his OHL career, he doubts he’d have changed his style of play.
He doubts he could have.
“I’d want to play my game ... play the game on the edge,” said Lambert, 42. “I’m a little rough player, I’m not the tallest player where I just go out there and sit there and score goals.”
As far as eliminating fighting from hockey, Lambert insists it’s those campaigning for a less rough-and-tumble game who have a real battle on their hands.
“I don’t care if you’re a player who doesn’t want to fight, at some point, your emotions will boil over,” Lambert said. “Even a skilled player, at some point, they’re going to boil over and you might see them retaliate or get into a fight.
“It’s just the nature of the beast out there on the ice where you’re battling and you’re competing hard and emotions are high you’re going to see these fights happen every once in a while.”
|
Q:
Unable to get local json file in Angular 5 - persistent 404 error
I've read every other article or post about this I can find. I cannot for the life of me figure out where I'm going wrong with this simple task. (Specifically following this example.) I must be doing something obviously stupid but I've been looking at this so long I can't see it.
I have a json file called isRecognized.json in assets/mockData. I've added the mockData directory to my webpack config file so it's included in the /dist directory. If I go to http:localhost:4200/assets/mockData/isRecognized.json I'm able to see the file, so I know it's available.
However, when I try to retrieve the file using HTTP Client, it throws a 404 no matter what I try.
EDIT: I'm using Webpack, not Angular CLI.
app.component.ts
import { MyService } from './services/my.service';
import { Component, OnInit, Renderer2 } from '@angular/core';
import { ActivatedRoute } from '@angular/router';
/*
* Main app component that houses all views.
*/
@Component({
selector: 'app-comp',
templateUrl: './app.component.html'
})
export class AppComponent implements OnInit {
constructor(
private route: ActivatedRoute, private service: MyService
) {}
ngOnInit() {
this.service.isRecognized();
}
}
my.service.ts
import { Injectable } from '@angular/core';
import { HttpClient } from '@angular/common/http';
import { Observable } from 'rxjs/Observable';
import 'rxjs/add/operator/map';
import 'rxjs/add/operator/catch';
import 'rxjs/add/observable/throw';
@Injectable()
export class MyService {
constructor(private http: HttpClient) { }
isRecognized() {
this.getJSON('isRecognized').subscribe(data => {
console.log(data);
});
}
getJSON(fileName): Observable<any> {
return this.http.get('http://localhost:4200/assets/mockData/' + fileName + '.json');
}
}
The error I get in the browser console is:
AppComponent_Host.ngfactory.js? [sm]:1 ERROR Error: [object Object]
at viewWrappedDebugError (core.js:9795)
at callWithDebugContext (core.js:15101)
at Object.debugCheckAndUpdateView [as checkAndUpdateView] (core.js:14628)
at ViewRef_.webpackJsonp../node_modules/@angular/core/esm5/core.js.ViewRef_.detectChanges (core.js:11605)
at core.js:5913
at Array.forEach (<anonymous>)
at ApplicationRef.webpackJsonp../node_modules/@angular/core/esm5/core.js.ApplicationRef.tick (core.js:5913)
at core.js:5746
at ZoneDelegate.webpackJsonp../node_modules/zone.js/dist/zone.js.ZoneDelegate.invoke (zone.js:391)
at Object.onInvoke (core.js:4756)
If I debug the error, I can see the body of the error is:
A:
I have this working successfully in my app just using a URL like this:
private productUrl = 'api/products/products.json';
Notice that it does not have the localhost part of the path.
So try something more like this:
'assets/mockData/' + fileName + '.json'
Also ensure that your angular.json has the path listed under assets:
"assets": [
"src/favicon.ico",
"src/assets",
"src/api"
],
NOTE: I also didn't do anything to modify my webpack configuration. (But I'm using the CLI.)
If you want to look at some working code that accesses a json file, I have an example here:
https://stackblitz.com/edit/github-gettingstarted-deborahk
|
Q:
Windows Server 2008 R2 or Windows 7
Which OS would you recommend for a development machine:
Windows Server 2008 R2
or
Windows 7
As of now, most "web developers" probably use Windows Server 2008 because of IIS and Vista SuckingBigTime.
Does this change with Windows 7? Can we finally use a client OS on a client computer again or the time has yet to come?
A:
This is not a definative list and can be expanded by other editors if so required but:
Windows 7
Desktop OS so supports sleep/hibernate
Windows XP Mode for XP based testing
May have a smaller footprint than Server
May have more GUI Bling than Server
Has pretty animation when you boot up!
Can run all Windows OS's that you may need to deploy your application on with 3rd-Party Hypervisor
Native bluetooth stack
Windows 2008 R2
Server OS may support sleep/hibernate if no Hyper-V enabled
Ships with a free Hypervisor (HyperV)
Maybe faster a specific tasks due to optimizations made
May have a larger footprint than Desktop
Can run all Windows OS's that you may need to deploy your application on
No bluetooth capabilities
Both OS's
Built on the same kernel
Have the same networking stack
Share the same GUI
Decision
Go with what fits your needs.
Just for the record I have used Windows 2008 as my desktop of choice since the early beta's. I may have lost my sleep/hibernate but I can make my coffee while my machine boots in the morning.
Also I did not mention running other OS's in the Hypervisors but you could do that as well.
A:
My only beef with 2008 R2 was the lack of Bluetooth support, which meant no keyboard and mouse for me...so, I went for 7.
With it's full version of IIS, I can't beat it - totally awesome.
Running it though a MacBookPro with 4GB of RAM and a i7 920 with 12GB - both x64 (obviously) - not a single complaint!
|
Michael Senych
Michael Senych (September 24, 1926 - March 27, 2002) was a politician from Alberta, Canada. He served in the Legislative Assembly of Alberta from 1963 to 1971 as a member of the Social Credit Party.
Early life
Michael Senych was born in Corbin, British Columbia. He attended the University of Alberta and worked twenty-six years as a teacher before entering provincial politics.
Political career
Senych was elected to the Alberta legislature in the district of Redwater in the 1963 general election. He ran for and won a second term in 1967 He ran for a third term in office in the new electoral district of Redwater-Andrew in the 1971 general election; he was defeated by George Topolnisky of the Progressive Conservative Party.
Senych attempted a return to the legislature in the 1982 general election; he ran as an independent in Redwater-Andrew and was defeated by Topolnisky again, finishing in fourth place out of five candidates. He ran once more under the Representative Party banner in the 1986 Alberta general election; he finished a distant third to Progressive Conservative candidate Steve Zarusky.
Senych was elected Mayor of the Village of Thorhild in 1996 and served until his death in a motor vehicle accident in 2002.
References
External links
Michael Senych death announcement, Alberta Legislative Assembly April 8, 2002.
The Record Alberta Edition, April 2002
Category:Alberta Social Credit Party MLAs
Category:1926 births
Category:2002 deaths
Category:People from the Regional District of East Kootenay
Category:Mayors of places in Alberta
Category:University of Alberta alumni
Category:People from Thorhild County
|
Fitbit
Fitbit, Inc. is an American company owned by Google headquartered in San Francisco, California. Its products are activity trackers, wireless-enabled wearable technology devices that measure data such as the number of steps walked, heart rate, quality of sleep, steps climbed, and other personal metrics involved in fitness. Before October 2007, the company was previously named Healthy Metrics Research, Inc. While these devices appear to increase physical activities, there is little evidence that they improve health outcomes.
According to an IDC report published on December 3, 2018, Fitbit is considered the third largest wearable company in shipments as of the third quarter of 2018, behind Xiaomi and Apple. Fitbit reports to have sold more than 100 million devices and have 28 million users. In 2019, Google announced its intention to buy Fitbit for $2.1 billion.
Effectiveness
While activity tracking devices appear to be useful when used with other interventions to increase physical activity, one review of six studies found that there is little evidence that they improve health outcomes. Of five studies that looked at weight loss, one found benefit, one found harm, and three found no effect. It is unclear whether activity changes occur in children and adolescents who use activity tracking devices.
Products
Alongside the activity trackers, Fitbit began offering a website and mobile app for iOS, Android and Windows 10 Mobile in 2014. This allowed the trackers to sync to devices such as mobile phones via Bluetooth, or to a Bluetooth-equipped computer running Windows or MacOS. Users now had the ability to log their food, activities, and weight, to track over time and set daily and weekly goals for themselves for steps, calories burned and consumed, and distance walked. The app also offered a community page where users could challenge themselves and compete against other users. The social element anticipated an increase in motivation, and found that users took an average of 700 more steps per day when they had friends on the app. Users could also choose to share their progress pictures and achievement badges.
The first product released was the Fitbit Tracker. The company released its Fitbit Ionic smartwatch in October 2017 and a redesigned, lower-priced version in 2018 called the Versa.
The Fitbit Charge 3, a wristband health and fitness tracker introduced in October 2018, was the first device to feature an oxygen saturation (SPO2) sensor; however, as of January 2019, it was non-functional and Fitbit had not provided an implementation timeline.
The Fitbit Charge 3 comes with two different-sized bands: small and large. The small is around between 5.5 - 7.1 inches and the large is 7.1- 8.7-inches. Additionally, the screen is larger than the Charge 2 by approximately 40%. Fitbit Charge 3 comes in two color combos: a Rose-Gold case with a Blue Grey band and a “Graphite Aluminum” screen case with a Black band.
On December 17, 2018, Fitbit released the Fitbit OS 3.0, which included an extended dashboard, quick logging for weight and water intake, and goal-based exercise mode. The new extended on-device dashboard (Fitbit Today) would include more data regarding sleep, water intake and weight.
There are a few versions of the Fitbit Versa, which include the standard, Special, and Lite edition.
On December 19, 2018, Emirates NBD announced its support of Fitbit Pay, providing services to the app. Emirates NBD is the first bank in the Middle East to offer this service.
On December 20, 2018, Fitbit announced a running detection feature, enabling auto-pause and auto-stop. Additionally, Fitbit added a birdie goal celebration and new clock faces.
That same month Fitbit added an API and open source tools to allow, developers to better build apps for its smartwatch products.
On January 2, 2019, the company announced the release of the Fitbit Charge 3 in India.
Accuracy
A small 2014 study of eight fit band devices during 69-minute workouts that included 13 different activities found the bands were at best "reasonably accurate", with the Fitbit Zip and Fitbit One scoring 10.1% and 10.4% error ratings, respectively.
A small 2015 study had participants wear multiple devices on their wrists and hips while performing different walking/running speeds on a treadmill. Fitbit devices worn on the hip accurately measured steps taken within 1 step of 100% accuracy. Devices worn on the wrist, however, were off by an average of 11 steps per minute. When measuring the number of calories burned, Fitbit devices worn on the hip underestimated by an average of 6%, while devices worn on the wrist overestimated calories burned by 21%. Authors concluded that both the Fitbit One and Fitbit Flex devices reliably measured step counts and energy expenditure, with hip-based Fitbit devices being more accurate than wrist-based devices.
A 2019 study found that the Fitbit Charge 2 accurately measures the average heart rate of healthy adults during sleep and that it is most accurate for medium range of heart rate.
A 2019 study found that Fitbit Charge 2 relative to EEG, overestimated sleep efficiency by about 4%, but there was no difference in measured total sleep time.
A 2019 review found that Fitbit devices which utilize the sleep-staging feature show a better performance than non-sleep-staging models, especially in differentiating wake from sleep.
Recall
Fitbit, working with the Consumer Protection Safety Commission, recalled the Fitbit Force on February 20, 2014 because some users experienced allergic reactions to the materials used in the product. On March 12, 2014, the Consumer Product Safety Commission (CPSC) made the recall official. At that time, it was revealed that there were 9,900 reports of skin irritation and 250 reports of blistering.
In April 2017, a woman claimed her Flex 2 malfunctioned and caught fire, causing second-degree burns on her arm. Following an investigation, Fitbit was adamant the cause of the exploding tracker was due to external forces, and assured its customers that it was not aware of any other complaints and they can wear their own Fitbit without concern.
History
Headquartered in San Francisco, California, Fitbit was founded on March 26, 2007 by James Park (CEO) and Eric Friedman (CTO). On May 7, 2015, Fitbit announced it had filed for IPO with a NYSE listing. The IPO was filed for $358 million. The company's stock began trading with the symbol "FIT" on June 18, 2015. After Fitbit's stocks fell more than 50% in 2016, CEO James Park announced in October that the company was undergoing a major transformation from what he called a "consumer electronics company" to a "digital healthcare company."
In February 2018, Fitbit announced that it would be partnering with Adidas to release an Adidas-branded Fitbit Ionic. The special edition Ionic was released on March 19, 2018.
In August 2018, Blue Cross Blue Shield Association announced a partnership with Fitbit in which BCBS will include Fitbit's wearables and fitness trackers in its Blue365 program.
Acquisitions
On March 5, 2015, Fitbit announced that it had acquired fitness coaching app developer Fitstar for $17.8 million.
On March 12, 2016, Fitbit acquired smart credit card company Coin, which included key personnel and intellectual property, but excluded any of Coin's hardware products, which stopped being produced around the time of the acquisition. Fitbit shut down the Coin Rewards and Coin Developer Program during the acquisition. Coin said that existing Coin cards will continue to work until the battery runs out and that existing Coin cards will remain under their one-year manufacturer's warranty.
On December 6, 2016, Fitbit acquired assets from Pebble, including key personnel, as the company decided to stop producing wearable technology. The acquisition excludes Pebble's hardware products.
On January 10, 2017, Fitbit acquired Romania-based smartwatch startup Vector Watch SRL. Vector said that there will be no new products with the Vector name, but that existing Vector watches will continue to work.
On February 13, 2018, Fitbit acquired Boston-based software startup Twine Health for an undisclosed amount. A Fitbit spokesperson said that “nearly all” of Twine Health's employees would start working at Fitbit.
Alphabet Inc. announced its intent to acquire Fitbit on November 1, 2019, pending approvals. The deal valued Fitbit at $2.1 billion. The sale is expected to close in 2020. On January 6, 2020, Fitbit shareholders overwhelmingly approved of Google's acquisition.
Reception
Awards
Fitbit has won numerous awards, including runner-up at TechCrunch50 in 2008 and Innovation honoree and best in the Health & Wellness category at CES 2009. In 2016, Fitbit ranked 37 out of the 50 most innovative companies for that year. In 2016, the company was ranked #46 on the Deloitte Fast 500 North America list.
Privacy concerns
To set up and use the hardware, one has to create an account with Fitbit and agree to data collection, transfer and privacy rules.
Starting in June 2011, Fitbit was criticized for its website's default activity-sharing settings, which made users' manually-entered physical activities available for public viewing. All users had the option to make their physical activity information private, but some users were unaware that the information was public by default. One specific issue, which technology blogs made fun of, was that some users were including details about their sex lives in their daily exercise logs, and this information was, by default, publicly available. Fitbit responded to criticism by making all such data private by default and requesting that search engines remove indexed user profile pages from their databases.
The company's devices have also been used in criminal investigations; in one instance, a rape claim against an unnamed intruder was turned around to a criminal charge for false reports based on data from the claimant's Fitbit.
The company's proposed sale to Alphabet has resulted in concern that Fitbit user data could be combined with other Google services data or sold for purposes such as targeted advertising, causing some to look for alternative devices. In response, Fitbit stated that user data would not be used or sold for advertising by Google, citing that trustworthiness was "paramount" to the company, and that the sale would not change their historic commitment to user privacy and security.
In December 2019, it was reported that the Federal Trade Commission and the Department of Justice intended to review the merger between Fitbit and Google due to concerns that the purchase would allow Google increased access to personal data.
Surveillance
A Fitbit device played a role in solving a murder. Connie Dabate was murdered by her husband Richard Dabate. Initially, Richard framed the situation, telling police and law enforcement officials that an intruder had broken into their home and fatally shot his wife. However, Connie's Fitbit tracker showed that she was at the gym at the time Richard told police his wife was shot. Using Connie's Fitbit and analyzing her movements, analysts were able to create a timeline that proved Richard had created a false story.
On March 10, 2015, a woman fabricated a story in which an intruder appeared in her employer's home she was staying at and raped her. Risley told police that a man had assaulted her around midnight. Police found a Fitbit lying on the floor when they arrived at the scene. Prosecutors used the Fitbit as evidence and data to determine what had occurred. The Fitbit revealed that the woman was active throughout the night, and the Fitbit surveillance analysis demonstrated the woman had not gone to bed like she stated to the police, proving that the woman had lied to the police.
A Fitbit device played a role in solving another murder in 2018. Anthony Aiello murdered his stepdaughter Karen Navarra while visiting her home and her body was found five days later. Data from her Fitbit fitness tracker showed that her heart rate spiked when Aiello visited her and stopped five minutes before he left. Aiello was arrested in September 2018 on murder charges and was booked into the Santa Clara County Jail.
See also
Garmin
Jawbone
Key finder
Microsoft Band
Misfit (company)
Quantified Self
Smart keychain
Smartwatch
References
External links
Category:American companies established in 2007
Category:Android (operating system) software
Category:2007 establishments in Delaware
Category:Companies listed on the New York Stock Exchange
Category:Electronics companies established in 2007
Category:Electronics companies of the United States
Category:Exercise equipment companies
Category:Fitness apps
Category:IOS software
Category:Manufacturing companies based in San Francisco
Category:Technology companies established in 2007
Category:Technology companies based in the San Francisco Bay Area
Category:Universal Windows Platform apps
Category:2015 initial public offerings
Category:Announced technology acquisitions
|
In case you ask any random online shopper about the biggest problem of Indian ecommerce sector; then 9 out of 10 times, the answer would be ‘trust factor’. Portals promise something else, deliver something else; and most of the times, the expectations and delivery are massively mismatched.
In the past, we have witnessed cases wherein stones were delivered instead of iPods (happened on Flipkart) and once, Vim bar was delivered instead of Samsung Galaxy phone on Snapdeal.
Snapdeal, which has recently raised $200 million at a valuation of $6.5-7 billion, is now again facing a major embarrassment when it comes to customer satisfaction and delivering what was promised.
A consumer court in Punjab has slapped a fine of Rs 10,000 on Snapdeal and ordered them to deliver what they had initially promised: iPhone for Rs 68! Note here, that Snapdeal managed to sell Rs 500 crore worth of mobile phones during last Diwali..
The Case
Nikhil Bansal, a BTech Student at Punjabi University saw a listing of an iPhone 5S 16 GB (Gold) on Snapdeal, which was priced Rs 68. On February 12th, he ordered the phone, and started waiting anxiously for such an awesome, cheap deal.
But as it so often happens on ecommerce portals, the order was cancelled and Nikhil never received that iPhone.
But unlike other shoppers, he refused to be silent.
He approached the district consumer forum in Sangrur district of Punjab, and filed a complaint after Snapdeal refused to ‘honor the deal’. The forum passed the judgment in favor of Nikhil, and Snapdeal was ordered to deliver the iPhone at the same rate in which it was initially promised: Rs 68.
Besides, the forum also ordered Snapdeal to pay Rs 2000 as penalty.
However, Snapdeal appealed in the consumer forum against this decision, and decided to fight the case. But again, they lost, as the forum now ordered them to pay a fine of Rs 10,000 to close the case.
This penalty needs to be deposited in consumer welfare fund.
Is it a right decision?
Indeed it is! Just because online medium is easier to manipulate; and promises are easy to be made, it doesn’t mean that ecommerce portals shall resort to false promise and would refuse to deliver what was promised.
As we had witnessed with Micromax, bad customer experience translates into bad future for any company; and Snapdeal might just have learnt a very important lesson here.
Have you experienced any such false promises made by any ecommerce portal? Did you complain?
Do share your experiences by commenting right here!
Must Read: 8 reasons why the E-Commerce Balloon in India is going to burst…
|
Q:
Talking to Tohoku earthquake survivors as volunteering
When I was in Fukushima prefecture, a Japanese person I was talking to said I should volunteer to speak with people affected by 3/11, as I'm not a local, and some people want to talk to non-locals about the event. He was aware of my limited Japanese when suggesting this.
However, I haven't been able to find any information on this on the net, including where, when and how to do this. What information sources are there for this (especially in Iwate prefecture), and what words are used for this volunteering activity?
A:
You have to figure out first which helping organizations still accept volunteers. This is compiled on this page (google translation) (in the table 1/3rds down the page).
The primary challenge might be that you will have to provide transport and housing yourself in many cases. The minimum I would prepare is an international drivers license and a sleeping bag.
The next one will be that you need insurance for what you do. Since it might require you to also help building a wall etc, and you are injured, you get yourself and everyone else into huge trouble. Some of the help centers apparently provide a insurance scheme, but I am not sure if they do so also for foreigners. Getting an insurance from a Japanese company if you do not have a residence in Japan is basically impossible.
Now, the third issue is that only one of the pages on the list actually offers an English page, and it does not seem to specifically mention counseling help possible through foreigners and rather offer all services they do, but they do list these phone numbers:
For more information in English,
Call: +81-198-62-1001 Tuesday through Sunday
Call: +81-3-5809-3953 Monday through Friday
English operator may be available
Since I do not know your language skills and neither know what language skills are required for the individual jobs, it will be hard to make any recommendation for you what you should know or learn for such a job. I would recommend that you contact this one service and talk to them first in English, and then show how much Japanese you know. They will then be able to assess, what job is best for you to do.
One of the jobs they offer, which seems to fit most to what you want to do is this here:
Listen to stories of afflicted people while massaging their hands for relaxation
Regarding the other services on the list, I would suggest running through the pages with google translate and seeing if you can find any information about foreigners having worked there in their activity logs. Then, contacting them directly might be the best idea. If you cannot make yourself understood on the phone, you know that this will not be the right place for you.
Otherwise ask someone in Japan you know to help you contacting the services and ask them how you can be of help.
|
/*M///////////////////////////////////////////////////////////////////////////////////////
//
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
//
// By downloading, copying, installing or using the software you agree to this license.
// If you do not agree to this license, do not download, install,
// copy or use the software.
//
//
// License Agreement
// For Open Source Computer Vision Library
//
// Copyright (C) 2010-2013, University of Nizhny Novgorod, all rights reserved.
// Third party copyrights are property of their respective owners.
//
// Redistribution and use in source and binary forms, with or without modification,
// are permitted provided that the following conditions are met:
//
// * Redistribution's of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
//
// * Redistribution's in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
//
// * The name of the copyright holders may not be used to endorse or promote products
// derived from this software without specific prior written permission.
//
// This software is provided by the copyright holders and contributors "as is" and
// any express or implied warranties, including, but not limited to, the implied
// warranties of merchantability and fitness for a particular purpose are disclaimed.
// In no event shall the Intel Corporation or contributors be liable for any direct,
// indirect, incidental, special, exemplary, or consequential damages
// (including, but not limited to, procurement of substitute goods or services;
// loss of use, data, or profits; or business interruption) however caused
// and on any theory of liability, whether in contract, strict liability,
// or tort (including negligence or otherwise) arising in any way out of
// the use of this software, even if advised of the possibility of such damage.
//
//M*/
//Modified from latentsvm module's "lsvmc_featurepyramid.cpp".
//#include "precomp.hpp"
//#include "_lsvmc_latentsvm.h"
//#include "_lsvmc_resizeimg.h"
#include "fhog.hpp"
#ifdef HAVE_TBB
#include <tbb/tbb.h>
#include "tbb/parallel_for.h"
#include "tbb/blocked_range.h"
#endif
#ifndef max
#define max(a,b) (((a) > (b)) ? (a) : (b))
#endif
#ifndef min
#define min(a,b) (((a) < (b)) ? (a) : (b))
#endif
/*
// Getting feature map for the selected subimage
//
// API
// int getFeatureMaps(const cv::Mat& image, const int k, featureMap **map);
// INPUT
// image - selected subimage
// k - size of cells
// OUTPUT
// map - feature map
// RESULT
// Error status
*/
int getFeatureMaps(const cv::Mat& image, const int k, CvLSVMFeatureMapCaskade **map)
{
float kernel[3] = {-1.f, 0.f, 1.f};
cv::Mat kernel_dx(1, 3, CV_32F, kernel);
cv::Mat kernel_dy(3, 1, CV_32F, kernel);
float boundary_x[NUM_SECTOR + 1];
float boundary_y[NUM_SECTOR + 1];
int height = image.rows;
int width = image.cols;
int numChannels = image.channels();
int sizeX = width / k;
int sizeY = height / k;
int px = 3 * NUM_SECTOR;
int p = px;
int stringSize = sizeX * p;
allocFeatureMapObject(map, sizeX, sizeY, p);
cv::Mat dx;
cv::Mat dy;
cv::filter2D(image, dx, CV_32FC3, kernel_dx, cv::Point(-1, 0));
cv::filter2D(image, dy, CV_32FC3, kernel_dy, cv::Point(0, -1));
for (int i = 0; i <= NUM_SECTOR; i++)
{
float arg_vector = ( (float) i ) * ( (float)(PI) / (float)(NUM_SECTOR) );
boundary_x[i] = cosf(arg_vector);
boundary_y[i] = sinf(arg_vector);
}/*for(i = 0; i <= NUM_SECTOR; i++) */
float* r = (float *)malloc( sizeof(float) * (width * height));
int* alfa = (int *)malloc( sizeof(int ) * (width * height * 2));
for (int j = 1; j < height - 1; j++)
{
const float* datadx = dx.ptr<float>(j);
const float* datady = dy.ptr<float>(j);
for (int i = 1; i < width - 1; i++)
{
int c = 0;
float x = (datadx[i * numChannels + c]);
float y = (datady[i * numChannels + c]);
r[j * width + i] =sqrtf(x * x + y * y);
for(int ch = 1; ch < numChannels; ch++)
{
float tx = (datadx[i * numChannels + ch]);
float ty = (datady[i * numChannels + ch]);
float magnitude = sqrtf(tx * tx + ty * ty);
if(magnitude > r[j * width + i])
{
r[j * width + i] = magnitude;
c = ch;
x = tx;
y = ty;
}
}/*for(ch = 1; ch < numChannels; ch++)*/
float max = boundary_x[0] * x + boundary_y[0] * y;
int maxi = 0;
for (int kk = 0; kk < NUM_SECTOR; kk++)
{
float dotProd = boundary_x[kk] * x + boundary_y[kk] * y;
if (dotProd > max)
{
max = dotProd;
maxi = kk;
}
else
{
if (-dotProd > max)
{
max = -dotProd;
maxi = kk + NUM_SECTOR;
}
}
}
alfa[j * width * 2 + i * 2 ] = maxi % NUM_SECTOR;
alfa[j * width * 2 + i * 2 + 1] = maxi;
}/*for(i = 0; i < width; i++)*/
}/*for(j = 0; j < height; j++)*/
int* nearest = (int *)malloc(sizeof(int ) * k);
float* w = (float*)malloc(sizeof(float) * (k * 2));
for (int i = 0; i < k / 2; i++)
{
nearest[i] = -1;
}/*for(i = 0; i < k / 2; i++)*/
for (int i = k / 2; i < k; i++)
{
nearest[i] = 1;
}/*for(i = k / 2; i < k; i++)*/
for (int j = 0; j < k / 2; j++)
{
float b_x = k / 2 + j + 0.5f;
float a_x = k / 2 - j - 0.5f;
w[j * 2 ] = 1.0f/a_x * ((a_x * b_x) / ( a_x + b_x));
w[j * 2 + 1] = 1.0f/b_x * ((a_x * b_x) / ( a_x + b_x));
}/*for(j = 0; j < k / 2; j++)*/
for (int j = k / 2; j < k; j++)
{
float a_x = j - k / 2 + 0.5f;
float b_x =-j + k / 2 - 0.5f + k;
w[j * 2 ] = 1.0f/a_x * ((a_x * b_x) / ( a_x + b_x));
w[j * 2 + 1] = 1.0f/b_x * ((a_x * b_x) / ( a_x + b_x));
}/*for(j = k / 2; j < k; j++)*/
for (int i = 0; i < sizeY; i++)
{
for (int j = 0; j < sizeX; j++)
{
for (int ii = 0; ii < k; ii++)
{
for (int jj = 0; jj < k; jj++)
{
if ((i * k + ii > 0) &&
(i * k + ii < height - 1) &&
(j * k + jj > 0) &&
(j * k + jj < width - 1))
{
int d = (k * i + ii) * width + (j * k + jj);
(*map)->map[ i * stringSize + j * (*map)->numFeatures + alfa[d * 2 ]] +=
r[d] * w[ii * 2] * w[jj * 2];
(*map)->map[ i * stringSize + j * (*map)->numFeatures + alfa[d * 2 + 1] + NUM_SECTOR] +=
r[d] * w[ii * 2] * w[jj * 2];
if ((i + nearest[ii] >= 0) &&
(i + nearest[ii] <= sizeY - 1))
{
(*map)->map[(i + nearest[ii]) * stringSize + j * (*map)->numFeatures + alfa[d * 2 ] ] +=
r[d] * w[ii * 2 + 1] * w[jj * 2 ];
(*map)->map[(i + nearest[ii]) * stringSize + j * (*map)->numFeatures + alfa[d * 2 + 1] + NUM_SECTOR] +=
r[d] * w[ii * 2 + 1] * w[jj * 2 ];
}
if ((j + nearest[jj] >= 0) &&
(j + nearest[jj] <= sizeX - 1))
{
(*map)->map[i * stringSize + (j + nearest[jj]) * (*map)->numFeatures + alfa[d * 2 ] ] +=
r[d] * w[ii * 2] * w[jj * 2 + 1];
(*map)->map[i * stringSize + (j + nearest[jj]) * (*map)->numFeatures + alfa[d * 2 + 1] + NUM_SECTOR] +=
r[d] * w[ii * 2] * w[jj * 2 + 1];
}
if ((i + nearest[ii] >= 0) &&
(i + nearest[ii] <= sizeY - 1) &&
(j + nearest[jj] >= 0) &&
(j + nearest[jj] <= sizeX - 1))
{
(*map)->map[(i + nearest[ii]) * stringSize + (j + nearest[jj]) * (*map)->numFeatures + alfa[d * 2 ] ] +=
r[d] * w[ii * 2 + 1] * w[jj * 2 + 1];
(*map)->map[(i + nearest[ii]) * stringSize + (j + nearest[jj]) * (*map)->numFeatures + alfa[d * 2 + 1] + NUM_SECTOR] +=
r[d] * w[ii * 2 + 1] * w[jj * 2 + 1];
}
}
}/*for(jj = 0; jj < k; jj++)*/
}/*for(ii = 0; ii < k; ii++)*/
}/*for(j = 1; j < sizeX - 1; j++)*/
}/*for(i = 1; i < sizeY - 1; i++)*/
free(w);
free(nearest);
free(r);
free(alfa);
return LATENT_SVM_OK;
}
/*
// Feature map Normalization and Truncation
//
// API
// int normalizeAndTruncate(featureMap *map, const float alfa);
// INPUT
// map - feature map
// alfa - truncation threshold
// OUTPUT
// map - truncated and normalized feature map
// RESULT
// Error status
*/
int normalizeAndTruncate(CvLSVMFeatureMapCaskade *map, const float alfa)
{
int i,j, ii;
int sizeX, sizeY, p, pos, pp, xp, pos1, pos2;
float * partOfNorm; // norm of C(i, j)
float * newData;
float valOfNorm;
sizeX = map->sizeX;
sizeY = map->sizeY;
partOfNorm = (float *)malloc (sizeof(float) * (sizeX * sizeY));
p = NUM_SECTOR;
xp = NUM_SECTOR * 3;
pp = NUM_SECTOR * 12;
for(i = 0; i < sizeX * sizeY; i++)
{
valOfNorm = 0.0f;
pos = i * map->numFeatures;
for(j = 0; j < p; j++)
{
valOfNorm += map->map[pos + j] * map->map[pos + j];
}/*for(j = 0; j < p; j++)*/
partOfNorm[i] = valOfNorm;
}/*for(i = 0; i < sizeX * sizeY; i++)*/
sizeX -= 2;
sizeY -= 2;
newData = (float *)malloc (sizeof(float) * (sizeX * sizeY * pp));
//normalization
for(i = 1; i <= sizeY; i++)
{
for(j = 1; j <= sizeX; j++)
{
valOfNorm = sqrtf(
partOfNorm[(i )*(sizeX + 2) + (j )] +
partOfNorm[(i )*(sizeX + 2) + (j + 1)] +
partOfNorm[(i + 1)*(sizeX + 2) + (j )] +
partOfNorm[(i + 1)*(sizeX + 2) + (j + 1)]) + FLT_EPSILON;
pos1 = (i ) * (sizeX + 2) * xp + (j ) * xp;
pos2 = (i-1) * (sizeX ) * pp + (j-1) * pp;
for(ii = 0; ii < p; ii++)
{
newData[pos2 + ii ] = map->map[pos1 + ii ] / valOfNorm;
}/*for(ii = 0; ii < p; ii++)*/
for(ii = 0; ii < 2 * p; ii++)
{
newData[pos2 + ii + p * 4] = map->map[pos1 + ii + p] / valOfNorm;
}/*for(ii = 0; ii < 2 * p; ii++)*/
valOfNorm = sqrtf(
partOfNorm[(i )*(sizeX + 2) + (j )] +
partOfNorm[(i )*(sizeX + 2) + (j + 1)] +
partOfNorm[(i - 1)*(sizeX + 2) + (j )] +
partOfNorm[(i - 1)*(sizeX + 2) + (j + 1)]) + FLT_EPSILON;
for(ii = 0; ii < p; ii++)
{
newData[pos2 + ii + p ] = map->map[pos1 + ii ] / valOfNorm;
}/*for(ii = 0; ii < p; ii++)*/
for(ii = 0; ii < 2 * p; ii++)
{
newData[pos2 + ii + p * 6] = map->map[pos1 + ii + p] / valOfNorm;
}/*for(ii = 0; ii < 2 * p; ii++)*/
valOfNorm = sqrtf(
partOfNorm[(i )*(sizeX + 2) + (j )] +
partOfNorm[(i )*(sizeX + 2) + (j - 1)] +
partOfNorm[(i + 1)*(sizeX + 2) + (j )] +
partOfNorm[(i + 1)*(sizeX + 2) + (j - 1)]) + FLT_EPSILON;
for(ii = 0; ii < p; ii++)
{
newData[pos2 + ii + p * 2] = map->map[pos1 + ii ] / valOfNorm;
}/*for(ii = 0; ii < p; ii++)*/
for(ii = 0; ii < 2 * p; ii++)
{
newData[pos2 + ii + p * 8] = map->map[pos1 + ii + p] / valOfNorm;
}/*for(ii = 0; ii < 2 * p; ii++)*/
valOfNorm = sqrtf(
partOfNorm[(i )*(sizeX + 2) + (j )] +
partOfNorm[(i )*(sizeX + 2) + (j - 1)] +
partOfNorm[(i - 1)*(sizeX + 2) + (j )] +
partOfNorm[(i - 1)*(sizeX + 2) + (j - 1)]) + FLT_EPSILON;
for(ii = 0; ii < p; ii++)
{
newData[pos2 + ii + p * 3 ] = map->map[pos1 + ii ] / valOfNorm;
}/*for(ii = 0; ii < p; ii++)*/
for(ii = 0; ii < 2 * p; ii++)
{
newData[pos2 + ii + p * 10] = map->map[pos1 + ii + p] / valOfNorm;
}/*for(ii = 0; ii < 2 * p; ii++)*/
}/*for(j = 1; j <= sizeX; j++)*/
}/*for(i = 1; i <= sizeY; i++)*/
//truncation
for(i = 0; i < sizeX * sizeY * pp; i++)
{
if(newData [i] > alfa) newData [i] = alfa;
}/*for(i = 0; i < sizeX * sizeY * pp; i++)*/
//swop data
map->numFeatures = pp;
map->sizeX = sizeX;
map->sizeY = sizeY;
free (map->map);
free (partOfNorm);
map->map = newData;
return LATENT_SVM_OK;
}
/*
// Feature map reduction
// In each cell we reduce dimension of the feature vector
// according to original paper special procedure
//
// API
// int PCAFeatureMaps(featureMap *map)
// INPUT
// map - feature map
// OUTPUT
// map - feature map
// RESULT
// Error status
*/
int PCAFeatureMaps(CvLSVMFeatureMapCaskade *map)
{
int i,j, ii, jj, k;
int sizeX, sizeY, p, pp, xp, yp, pos1, pos2;
float * newData;
float val;
float nx, ny;
sizeX = map->sizeX;
sizeY = map->sizeY;
p = map->numFeatures;
pp = NUM_SECTOR * 3 + 4;
yp = 4;
xp = NUM_SECTOR;
nx = 1.0f / sqrtf((float)(xp * 2));
ny = 1.0f / sqrtf((float)(yp ));
newData = (float *)malloc (sizeof(float) * (sizeX * sizeY * pp));
for(i = 0; i < sizeY; i++)
{
for(j = 0; j < sizeX; j++)
{
pos1 = ((i)*sizeX + j)*p;
pos2 = ((i)*sizeX + j)*pp;
k = 0;
for(jj = 0; jj < xp * 2; jj++)
{
val = 0;
for(ii = 0; ii < yp; ii++)
{
val += map->map[pos1 + yp * xp + ii * xp * 2 + jj];
}/*for(ii = 0; ii < yp; ii++)*/
newData[pos2 + k] = val * ny;
k++;
}/*for(jj = 0; jj < xp * 2; jj++)*/
for(jj = 0; jj < xp; jj++)
{
val = 0;
for(ii = 0; ii < yp; ii++)
{
val += map->map[pos1 + ii * xp + jj];
}/*for(ii = 0; ii < yp; ii++)*/
newData[pos2 + k] = val * ny;
k++;
}/*for(jj = 0; jj < xp; jj++)*/
for(ii = 0; ii < yp; ii++)
{
val = 0;
for(jj = 0; jj < 2 * xp; jj++)
{
val += map->map[pos1 + yp * xp + ii * xp * 2 + jj];
}/*for(jj = 0; jj < xp; jj++)*/
newData[pos2 + k] = val * nx;
k++;
} /*for(ii = 0; ii < yp; ii++)*/
}/*for(j = 0; j < sizeX; j++)*/
}/*for(i = 0; i < sizeY; i++)*/
//swop data
map->numFeatures = pp;
free (map->map);
map->map = newData;
return LATENT_SVM_OK;
}
//modified from "lsvmc_routine.cpp"
int allocFeatureMapObject(CvLSVMFeatureMapCaskade **obj, const int sizeX,
const int sizeY, const int numFeatures)
{
int i;
(*obj) = (CvLSVMFeatureMapCaskade *)malloc(sizeof(CvLSVMFeatureMapCaskade));
(*obj)->sizeX = sizeX;
(*obj)->sizeY = sizeY;
(*obj)->numFeatures = numFeatures;
(*obj)->map = (float *) malloc(sizeof (float) *
(sizeX * sizeY * numFeatures));
for(i = 0; i < sizeX * sizeY * numFeatures; i++)
{
(*obj)->map[i] = 0.0f;
}
return LATENT_SVM_OK;
}
int freeFeatureMapObject (CvLSVMFeatureMapCaskade **obj)
{
if(*obj == NULL) return LATENT_SVM_MEM_NULL;
free((*obj)->map);
free(*obj);
(*obj) = NULL;
return LATENT_SVM_OK;
}
|
---
abstract: 'If a 2-connected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every 2-connected graph has a canonical decomposition into 2.5-connected components. These components are arranged in a tree-structure. We also discuss the connection between 2.5-connected components and triconnected components and use this to present a linear time algorithm which computes the 2.5-connected components of a graph. We show that every critical 2.5-connected graph other than $K_4$ can be obtained from critical 2.5-connected graphs of smaller order using simple graph operations. Furthermore, we demonstrate applications of 2.5-connected components in the context of cycle decompositions and cycle packings.'
author:
- 'Irene Heinrich[^1], Till Heller, Eva Schmidt[^2], and Manuel Streicher[^3]'
bibliography:
- 'spqr.bib'
title: '$2.5$-Connectivity: Unique Components, Critical Graphs, and Applications'
---
Introduction
============
Over the years, connectivity has become an indispensable notion of graph theory. A tremendous amount of proofs start with a reduction which says “The main result holds for all graphs if it holds for all *sufficiently connected* graphs.” Here, *sufficiently connected* stands for some measure of connectedness as, for example, 2-connected, 4-edge-connected, vertex-edge-connected, or just connected. Usually, first a reduction from the desired statement for general graphs to sufficiently connected graphs is proven. Then, the subsequent section starts with a sentence of the following manner: “From now on, all considered graphs are sufficiently connected." For example, it is shown in [@tutte1954] that the Tutte polynomial is multiplicative over the biconnected components of a considered graph. Another reduction to components of higher connectivity is that finding a planar embedding can be reduced to embedding the triconnected components of the graph, cf. [@maclane1937].
------------------------------ ----------------- ------------ ----------------- ---------------------
\[tab: kindsOfConnectivity\] connected after unique tree-structured example of
removal of components components an application
connected — various
2-connected 1 vertex Tutte polynomial
cycle decomposition
triconnected 2 vertices planarity test
------------------------------ ----------------- ------------ ----------------- ---------------------
: 2.5-connectivity as an intermediate connectivity measure.[]{data-label="tab: conjecture summary"}
By far the largest part of the existing literature treats either *$k$-connectivity* (where, loosely speaking, graphs which stay connected even if $k-1$ vertices are removed are considered) or *$k$-edge connectivity* (where graphs which stay connected even if $k-1$ edges are removed are considered). We speak of *mixed connectivity*, when graphs are regarded which stay connected after $k$ vertices and $l$ edges are removed. This measure of connectivity has only rarely been studied. We refer the reader to [@beineke2012] for a brief survey of mixed connectivity. In [@heinrichStreicher2019] it is shown that the behaviour of cycle decompositions is preserved under splits at vertex-edge separators (that is, a vertex and an edge whose removal disconnects the graph).
#### Our contribution
We introduce a canonical decomposition of a graph into its 2.5-connected components, where a graph is 2.5-connected if it is 2-connected and the removal of a vertex and an edge does not disconnect the graph. We prove the following decomposition theorem.
Let $G$ be a 2-connected graph. The decomposition of $G$ into its 2.5-connected components is unique and can be computed in linear time.
Furthermore, we demonstrate that the behaviour of critical 2.5-connected graphs is preserved in their triconnected components. We obtain a result similar to Tutte’s decomposition theorem for 3-connected 3-regular graphs: all critical 2.5-connected graphs other than $K_4$ can be obtained from critical 2.5-connected graphs of smaller order by simple graph operations.
Finally, we show that the minimum (maximum) cardinality of a cycle decomposition of an Eulerian graph can be obtained from the minimum (maximum) cardinalities of the cycle decompositions of its 2.5-connected component. This gives new insights into a long standing conjecture of Hajós.
#### Techniques
We demonstrate that 2.5-connected components can be defined in the same manner as triconnected components. The novel underlying idea of the present article is a red-green-colouring of the virtual edges of the triconnected components (a virtual edge of a component is not part of the original graph but stores the information where the components need to be glued together in order to obtain the host graph). The colouring is assigned to the virtual edges during the process of carrying out splits that give the triconnected components. It preserves the information whether a virtual edge could arise in a sequence of 2.5-splits (those corresponding to a vertex-edge separator). If so, the edge is coloured green, otherwise red. We prove that the exact same colouring can be assigned to the virtual edges of the triconnected components (without knowledge of the splits that led there) in linear time. It can be exploited to obtain 2.5-connected components: glue the red edges. We show that the uniqueness of the red-green-colouring implies the uniqueness of the 2.5-connected components.
#### Further Related Work
We refer to [@tutte1966] as a standard book on graph connectivity. The same topic is considered from an algorithmic point of view in [@nagamochi2008]. A short overview on mixed connectivity with strong emphasis on partly raising Menger’s theorem to mixed separators can be found in Chapter 1.4 of [@beineke2012]. Grohe [@grohe2016] introduces a new decomposition of a graph into quasi-4-connected components and discusses the relation of the quasi-4-connected components to triconnected components.
The importance of triconnected components for planarity testing was already observed in [@maclane1937]. Hopcroft and Tarjan [@hopcroftTarjan1973] proved that these components are tree-structured and exploited this algorithmically. On this basis, Battista and Tamassia [@battista1996] developed the notion of SPQR-trees. Gutwenger and Mutzel [@gutwengerMutzel2000] used this result and the results of [@hopcroftTarjan1973] for a linear-time algorithm that computes the triconnected components of a given graph and their tree-structure (SPQR-tree).
#### Outline
Preliminaries and definitions are introduced in the next section. In particular, Hopcroft and Tarjan’s notions of triconnected components and virtual edges (cf. [@hopcroftTarjan1973]) are explained. In Section \[sec: 25Connectivity\] we adapt the definition of triconnected components in order to give a natural definition of 2.5-connected components. We prove that these are unique and show how they can be obtained from the triconnected components. We exploit this knowledge in Section \[sec: linearTime\] in order to give a linear time algorithm which computes the 2.5-connected components of a given graph. We characterize the critical 2.5-connected graphs in Section \[sec: CriticalGraps\]. Finally, some applications of 2.5-connected graphs are discussed in Section \[sec: Applications\].
Preliminaries {#sec: preliminaries}
=============
If not stated otherwise, we use standard graph theoretic notation as can be found in [@diestel2000]. Graphs may contain multiedges but no loops. A connected graph is *2-connected* if for each triple of distinct vertices $(u,v,w) \in V(G)^3$ there exists a $u$-$v$-path $P$ in $G$ with $w \notin V(P)$. A graph of order 2 and size $\ell \geq 2$ is a *multiedge* (or *$\ell$-edge*). The following notation and the results in this paragraph are borrowed from [@hopcroftTarjan1973]. Let $u$ and $v$ be two vertices of a 2-connected graph $G$. We divide $E(G)$ into equivalence classes $E_1, E_2, \dots, E_k$ such that two edges lie in the same class if and only if they are edges of a (possibly closed) subpath of $G$ which neither contains $u$ nor $v$ internally. The classes $E_i$ are the *separation classes* of $G$ with respect to $\{u,v\}$. If $k\geq 2$, the tuple $\{u,v\}$ is a *separation pair* unless $k = 2$ and $\min\{|E_1|, |E_2|\} = 1$, or, $k=3$ and $|E_1| = |E_2| = |E_3| = 1$.
Let $\{u,v\}$ be a separation pair. For $I \subseteq \{1, \dots, k\}$ such that $E' \coloneqq \bigcup_{i \in I}E_i$ satisfies $\min\{|E'|,|E(G) \setminus E'|\} \geq 2$ the graphs $G_1 \coloneqq G[E'] +uv$ and $G_2 \coloneqq G[E(G)\setminus E'] + uv$ are called *split graphs* of $G$ with respect to $\{u,v\}$. Replacing $G$ by $G_1$ and $G_2$ is called *splitting $G$*. The edges $uv$ added to $G[E']$ and to $G[E(G)\setminus E']$ are called *virtual edges*. They are labelled in order to identify them with the split.
A 2-connected graph without a separation pair is *triconnected*. Graphs that result from splitting a given multigraph $G$ as much as possible are called *split components* of $G$. More precisely: If $G$ is triconnected, then $\{G\}$ contains the *split components* of $G$. Otherwise, there are split graphs $G'$ and $\hat{G}$ of $G$ with respect to some separation pair of $G$, then $\{G_1',\dots , G_{k'}'\} \cup \{\hat{G}_1\dots \hat{G}_{\hat{k}}\}$ is a set of *split components* of $G$, where $\{G_1',\dots, G_{k'}'\}$ (respectively $\{\hat{G}_1,\dots, \hat{G}_{\hat{k}}\}$) is a set of split components of $G'$ (respectively $\hat{G}$). Split components of a graph are not necessarily unique. Consider for example a cycle of length at least 4.
If $G_1$ and $G_2$ are two split graphs with virtual edges $e_1 \in E(G_1)$ and $e_2 \in E(G_2)$ with the same label, then the *merge graph* of $G_1$ and $G_2$ is the graph with vertex set $V(G_1) \cup V(G_2)$ and edge set $(E(G_1) \cup (E(G_2))\setminus\{e_1,e_2\}$. The split components of $G$ are of one of the following types: $$\text{triangles,\quad multiedges of size~3 \quad and \quad other triconnected graphs.}$$ Denote the latter set by $\mathcal{T}$. Merge the triangles of the split components as much as possible to obtain a set of cycles $\mathcal{C}$. Further, merge the three-edges as much as possible to obtain a set of multiedges $\mathcal{M}$. The set $\mathcal{C} \cup \mathcal{M} \cup \mathcal{T}$ is the set of *triconnected components* of $G$. Indeed, it is accurate to speak of *the* triconnected components as the following statement of Hopcroft and Tarjan [@hopcroftTarjan1973] shows:
\[thm: triconnCompUnique\] The triconnected components of a graph are unique.
The following statement is crucial for the proof of Theorem \[thm: triconnCompUnique\], cf. [@hopcroftTarjan1973]. We will discuss in the next section how a variation of Lemma \[lem: splitsSuffice\] serves us in proving the uniqueness of 2.5-connected components.
\[lem: splitsSuffice\] Let $\mathcal{I}$ be a set of graphs obtained from a 2-connected graph $G$ by a sequence of splits and merges.
(a) The graph $S(\mathcal{I})$ with $$\begin{aligned}
V(S(\mathcal{I})) &= \mathcal{I},\\
E(S(\mathcal{I})) &=\{st\colon \text{$s$ and $t$ contain virtual edges sharing the same label}\}
\end{aligned}$$ is a tree.
(b) The set $\mathcal{I}$ can be produced by a sequence of splits.
2.5-Connectivity {#sec: 25Connectivity}
================
In the following, we transfer the above notation of [@hopcroftTarjan1973] to *mixed connectivity*, where separators may contain both, vertices and edges. Let $G$ be a 2-connected graph which is not a triangle. A tuple $(c,uv) \in V(G) \times E(G)$ is a *vertex-edge-separator* if $G-uv-c$ is disconnected.
\[lem: veSeparationUniqueAndBiconnected\] Let $G$ be a 2-connected graph. If $(c, uv)$ is a vertex-edge-separator of $G$, then $G-uv-c$ has exactly two components, each containing a vertex of $\{u,v\}$. Let $a \in \{u,v\}$. Denote the component containing $a$ by $C_a$ and set $G_a \coloneqq G[C_a \cup \{c\}]$. Then $G_a + ca$ is 2-connected.
With the same notation as in Lemma \[lem: veSeparationUniqueAndBiconnected\] let $a \in \{u,v\}$. If $|E(G_a)| \geq 2$, then $\{c,a\}$ is a separation pair of $G$. Let $b$ denote the vertex in $\{u,v\}\setminus\{a\}$. Now $G_a+ac$, $G_b+ba+ac$ are split graphs of $\{c,a\}$ with virtual edges $ac$. We say that $\{a,c\}$ *supports* the vertex-edge-separator $(c, uv)$ or that $\{a,c\}$ is *supporting*. Replacing $G$ by the two graphs $G_a + ac$ and $G_b + ba + ac$ is called *supporting split* $G$ at $(c, uv)$ *with support* $\{a,c\}$. The graphs $G_a+ac$ and $G_b + ba + ac$ are *the 2.5-split graphs* of $G$ at $(c, uv)$ with support $\{a,c\}$. A *non-supporting* split is a split which is not of this form for any vertex-edge separator. Observe that a vertex-edge-separator has at least one and at most two separation pairs in its support.
(-2,0) node (1) \[svertex\] (-1,1) node (2) \[svertex\] (-1,-1) node (3) \[svertex\] (-3,-1) node (4) \[svertex\] (-3,1) node (5) \[svertex\] (-4,-0.5) node (6) \[svertex\] (-4,-1.5) node (7) \[svertex\] (-4.5,0) node (8) \[svertex\] (-5.5,0) node (9) \[svertex\] (-5,1) node (10) \[svertex\] (-5,-1) node (11) \[svertex\] ; (1) to (2) (1) to (3) (1) to (4) (1) to (5) (2) to (3) (2) to (5) (3) to (4) (4) to (6) (4) to (7) (6) to (7) (11) to (6) (11) to (7) (5) to (10) (9) to (10) (8) to (10) (8) to (9) (8) to (11) (9) to (11); (4) to (5); (4) to (5);
(4,0.5) node (12) \[svertex\] (4,1.5) node (13) \[svertex\] (3,1) node (14) \[svertex\] (5,1) node (15) \[svertex\] (3,2.5) node (16) \[svertex\] (5,2.5) node (17) \[svertex\] (3,4.5) node (18) \[svertex\] (5,4.5) node (19) \[svertex\] (1.5,2.5) node (20) \[svertex\] (1,3.5) node (21) \[svertex\] (2,3.5) node (22) \[svertex\] (1.5,4.5) node (23) \[svertex\] (6,2.5) node (24) \[svertex\] (6,4.5) node (25) \[svertex\] (7,2.5) node (26) \[svertex\] (7,4.5) node (27) \[svertex\] (9,2.5) node (28) \[svertex\] (9,4.5) node (29) \[svertex\] (8,3.5) node (30) \[svertex\] ; (20) to (21) (20) to (22) (21) to (22) (23) to (22) (23) to (21) (18) to (19) (14) to (12) (14) to (13) (15) to (13) (15) to (12) (27) to (29) (28) to (29) (28) to (26) (30) to (26) (30) to (27) (30) to (29) (30) to (28); (16) to (18) (16) to (17) (17) to (19); (26) to (27); (20) to (23); (14) to (15); (25) to (24); (25) to (24); (25) to (24); (25) to (24);
(4,-4.5) node (31) \[svertex\] (4,-3.5) node (32) \[svertex\] (3,-4) node (33) \[svertex\] (5,-4) node (34) \[svertex\] (3,-2.5) node (35) \[svertex\] (5,-2.5) node (36) \[svertex\] (3,-0.5) node (37) \[svertex\] (5,-0.5) node (38) \[svertex\] (1.5,-2.5) node (39) \[svertex\] (1,-1.5) node (40) \[svertex\] (2,-1.5) node (41) \[svertex\] (1.5,-0.5) node (42) \[svertex\] (6,-2.5) node (43) \[svertex\] (6,-0.5) node (44) \[svertex\] (8,-2.5) node (45) \[svertex\] (8,-0.5) node (46) \[svertex\] (7,-1.5) node (47) \[svertex\] ; (39) to (40) (39) to (41) (40) to (41) (40) to (42) (41) to (42) (37) to (38) (33) to (32) (33) to (31) (32) to (34) (31) to (34) (32) to (31) (43) to (45) (46) to (44) (46) to (45) (46) to (47) (43) to (47) (44) to (47) (45) to (47); (39) to (42); (33) to (34); (44) to (43); (44) to (43); (44) to (43); (35) to (37) (35) to (36) (38) to (36);
If $G$ is 2-connected and no tuple $(v,e) \in V(G) \times E(G)$ is a vertex-edge-separator, then $G$ is *2.5-connected*. In analogy to the notion of *triconnected components* of Hopcroft and Tarjan cf. [@hopcroftTarjan1973], we define 2.5-connected components of $G$, see also Figure \[fig: triconVs25Conn\].
- If $G$ is 2.5-connected, then $\{G\}$ contains the *2.5-split components* of $G$.
- Otherwise, there are 2.5-split graphs $G'$ and $\hat{G}$ of $G$ with respect to some separation pair of $G$. Then $\{G_1',\dots , G_{k'}'\} \cup \{\hat{G}_1\dots \hat{G}_{\hat{k}}\}$ is a set of *2.5-split components* of $G$, where $\{G_1',\dots, G_{k'}'\}$ (respectively $\{\hat{G}_1,\dots, \hat{G}_{\hat{k}}\}$) is a set of 2.5-split components of $G'$ (respectively $\hat{G}$).
Observe that 2.5-split components of a 2-connected graph are not unique (a cycle with more than three edges serves again as an example). The 2.5-split components of a given graph are of the following types: $$\text{triangles, \quad multiedges of size at least~3,\quad and \quad other 2.5-connected graphs.}$$ Let $G$ be a graph. Consider a decomposition of $G$ into 2.5-split components, where $\mathcal{T}$ denotes the subset of triangles, $\mathcal{M}$ the set of multiedges and $\mathcal{H}$ denotes the set of other 2.5-connected graphs in the decomposition. Now merge the triangles in $\mathcal{T}$ as much as possible and leave the multiedges and 2.5-connected graphs unchanged. Replace $\mathcal{T}$ in the split components by the set $\mathcal{C}$ of cycles obtained this way. The components $\mathcal{C} \cup \mathcal{M} \cup \mathcal{H}$ obtained this way are the *2.5-connected components* of $G$. Applying the exact same arguments as in the proof of Lemma \[lem: splitsSuffice\] in [@hopcroftTarjan1973] we obtain the following statement:
\[lem: auxiliaryGraphIsTree\] Let $\mathcal{I}$ be a set of graphs obtained from a 2-connected graph $G$ by a sequence of 2.5-splits and merges.
(a) The graph $S(\mathcal{I})$ is a tree.[^4]
(b) The set $\mathcal{I}$ can be produced by a sequence of 2.5-splits.
\[lem: triconnectedFrom25Connected\] If $\mathcal{I}$ is a set of graphs obtained from a 2-connected graph $G$ by a sequence $s_1$ of 2.5-splits such that no two distinct cycles in $\mathcal{I}$ share a virtual edge with the same label, then the triconnected components of $G$ can be obtained from $\mathcal{I}$ by a (possibly empty) sequence of splits $s_2$. In particular, the triconnected components of $G$ can be obtained from a set of 2.5-connected components of $G$ by a (possibly empty) sequence of splits.
Apply a sequence of splits $s$ to the graphs in $\mathcal{I}$ to obtain a set of split components $\mathcal{I}'$ of $G$. In order to obtain the triconnected components of $G$ from $\mathcal{I}'$, cycles (respectively multiedges) with a virtual edge in common are merged. The splits that correspond to these shared virtual edges must appear in $s$ since $\mathcal{I}$ does not contain cycles with a common virtual edge by assumption. (Note that $\mathcal{I}$ neither contains multiedges with a common virtual edge since two parallel edges always lie in the same separation class with respect to a supporting separation pair.) Consequently, we can obtain the triconnected components of $G$ from $\mathcal{I}$ by applying the subsequence of $s$ to $\mathcal{I}$ which skips those splits that are reversed in the construction of the triconnected components from $\mathcal{I}'$.
Recall that an *ear* of a given edge $e$ in a graph $H$ is the cycle containing $e$ if the connected component of $e$ is a cycle and, otherwise, it is the maximal path in $H$ that contains $e$ as an edge such that all its internal vertices are of degree two in $H$. A subgraph $P$ of $H$ is called an *ear* if it is an ear of some edge of $H$. In particular, if both endvertices of an edge $e$ are of degree at least 3 in $H$, then the length-1 path containing $e$ is an ear. An ear of length 1 is called a *trivial ear*. Otherwise it is called *non-trivial*.
\[lem: no2VertexSplitInTriconnectedFrom25Connected\] Let $s = s_1\dots s_k$ be a sequence of splits of a 2-connected graph $G$ such that the resulting graphs are the triconnected components of $G$.
(a) \[itm: 2vertexNeverSplit\] None of the separation pairs that correspond to the splits in $s$ contains a vertex which is of degree 2 when the split is carried out.
(b) \[itm: atLeastOneEarIsTrivial\] Let $i \in \{1, \dots, k\}$. Consider the graphs obtained from carrying out $s_1, \dots, s_i$ on $G$. It holds that at most one of the two virtual edges corresponding to the same split lies on a non-trivial ear.
(c) \[obs: virtualEars\] Regard two distinct ears in the triconnected components of $G$ that contain a virtual edge with the same label. Either both ears are trivial or one of them is a cycle and the other is trivial.
We prove part . Suppose towards a contradiction that $s$ contains a split $s_i$ which splits the graph $H$ at a separation pair $\{u,v\}$ with $\deg_H(u) = 2$. It follows by a simple induction on the number of splits succeeding $s_i$ that amongst the triconnected components of $G$ there are two graphs $G_1$ and $G_2$ such that $u \in V(G_1) \cap V(G_2)$ and $\deg_{G_1}(u) = \deg_{G_2}(u) = 2$ and, in both graphs $G_1$ and $G_2$, $u$ is incident to a virtual edge that corresponds to $s_i$. The only triconnected components that contain degree-2 vertices are cycles and, hence, $G_1$ and $G_2$ are cycles with a common virtual edge. That contradicts the construction of the triconnected components, where cycles with a common virtual edge are merged.
Now, part follows with similar considerations. Suppose towards a contradiction that two virtual edges $e$ and $e'$ corresponding to the same split each lie on a non-trivial ear after carrying out splits $s_1 \dots s_i$. In particular, $e$ and $e'$ are both incident to a degree-2 vertex. As above, this implies that both, $e$ and $e'$ are virtual with the same label and contained in distinct cycles of the triconnected components of $G$, which is a contradiction.
Since triconnected components with degree-2 vertices are cycles, part is a consequence of .
\[thm: redGreenVirtualEdges\] Let $s=s_1s_2\dots s_k$ be a sequence of splits that is carried out on a graph $G$ such that the obtained graphs are the triconnected components of $G$. We define a 2-colouring of the virtual edges of the triconnected components starting from the uncoloured graph $G$. For $i \in \{1, \dots, k\}$:
- If $s_i$ is a non-supporting split, then the respective virtual edges are coloured red.
- If $s_i$ is a supporting split only for vertex-edge-separators $(c,e)$ with $e$ red, then the virtual edges corresponding to $s_i$ are coloured red.
- If $s_i$ is a supporting split for some vertex-edge-separator $(c,e)$ where $e$ is a green virtual edge or a non-virtual edge, then let $e^{\star}$ and $e^{\star\star}$ be the corresponding the virtual edges. Colour all virtual edges with labels that appear in the ear of $e^{\star}$ and $e^{\star\star}$ green.
The colouring of the virtual edges of the triconnected components obtained this way is independent of the choice of $s$.
See Figure \[fig: triconVs25Conn\] for an example of the above colouring.
We prove the following more general statement:
**Claim 1:** *Let $i \in \{0, 1, \dots, l\}$ and let $G_1, G_2, \dots, G_{i+1}$ be the graphs that are obtained from carrying out the splits $s_1, s_2, \dots, s_i$. It holds that a virtual edge in $\bigcup_{j=1}^{i+1}E(G_j)$ is coloured green if and only if it or its corresponding edge with the same label is contained in an ear with at least one non-virtual edge. Otherwise it is red.*
Internal vertices of ears are of degree 2. Thus by Lemma \[lem: no2VertexSplitInTriconnectedFrom25Connected\], internal vertices are never contained in a separation pair that corresponds to one of the splits $s_1, \dots, s_k$, that is, $$\label{eq: ears never split}
\text{ears are never split by the sequence~}s_1s_2 \dots s_k.$$
We prove Claim 1 by induction on $i$. If $i = 0$, then no split is carried out and, hence, there are no virtual edges to consider and the statement is trivially satisfied.
Now let $i \geq 1$. By induction, Claim 1 holds for the graphs $G_1', G_2', \dots, G_i'$ obtained from carrying out $s_1, \dots, s_{i-1}$. Without loss of generality, $s_i$ is a split on $G_i'$ into $G_i$ and $G_{i+1}$. Let $e^{\star}_i$ (respectively $e^{\star}_{i+1}$) be the new virtual edge that corresponds to $s_i$ in $G_i$ (respectively $G_{i+1}$).
First assume that $s_i$ is a non-supporting split. The edge $e_i^{\star}$ (respectively $e_{i+1}^{\star}$) is red and lies in a trivial ear of $G_i$ (respectively $G_{i+1}$) since $s_i$ is non-supporting. Thus, $e_i^{\star}$ and $e_{i+1}^{\star}$ satisfy Claim 1. Other virtual edges and their ears remain unchanged by $s_i$.
Now assume that $s_i$ is a supporting split of some vertex-edge-separator $(c,e)$ in $G_i'$. We may assume that $e \in E(G_i)$. In particular, $$\label{eq: same ear}
\text{$e$ and $e^{\star}_i$ lie on the same ear in $G_i$.}$$ By Lemma \[lem: no2VertexSplitInTriconnectedFrom25Connected\] and it holds that $$\label{eq: otherEarTrivial}
\text{the ear of $e_{i+1}^{\star}$ is trivial}.$$ If $e$ is non-virtual, then $e^{\star}_i$ and $e_{i+1}^{\star}$ are coloured green. Both new virtual edges and the virtual edges on their respective ears satisfy Claim 1 by and . If $e$ is green and there exists a non-virtual edge on the same ear as $e$, then Claim 1 is satisfied by similar arguments.
If $e$ is green and there is no non-virtual edge on the ear of $e$, then the ear that contains the other virtual edge with the same label as $e$ contains a non-virtual edge and, hence, is non-trivial. In $G_i$, also the ear that contains $e$ and $e_i^{\star}$ in $G_i$ is non-trivial. This is a contradiction to Lemma \[lem: no2VertexSplitInTriconnectedFrom25Connected\]..
If $e$ is red and $s_i$ is non-supporting for any vertex-edge-separator with a green or non-virtual edge, then the ear of $e$ in $G_i'$ contains only virtual edges. This property is maintained in $G_i$ since all edges which are added to the ear of $e$ in $G_i$ are virtual by induction. Hence, $e_i^{\star}$ and the virtual edges on its ear in $G_i$ and $e_{i+1}^{\star}$ satisfy Claim 1. Again, other virtual edges and their ears remain unchanged by $s_i$.
\[coro: redVirtualEdges\] Let $G$ be a 2-connected graph and let $e$ and $e'$ be two virtual edges of the triconnected components of $G$ with the same label. Apply the edge-colouring of Theorem \[thm: redGreenVirtualEdges\]. The following statements are equivalent:
- $e$ is red.
- $e'$ is red.
- The ears of $e$ and $e'$ in the triconnected components are both trivial, or, one of the two ears is a cycle solely consisting of virtual edges and the other ear is trivial.
Let $e$ and $e'$ be two distinct virtual edges with the same label. By Claim 1 of the above proof, $e$ is red if and only if the ear of $e$ and the ear of $e'$ solely consist of virtual edges. If we consider triconnected components, then it follows from Lemma \[lem: no2VertexSplitInTriconnectedFrom25Connected\] that the two ears are trivial or one of them is a cycle solely consisting of virtual edges.
In Chapter \[sec: linearTime\] we will exploit Corollary \[coro: redVirtualEdges\] to develop a linear time algorithm that computes the 2.5-connected components of a given graph. We need one more lemma in order to prove the uniqueness of 2.5-connected components.
\[lem: noGreenEdgesAfter25\] Let $G_1$ and $G_2$ be the split graphs of a 2-connected graph $G$ with respect to some separation pair. If $(c,e)$ is a vertex-edge-separator of $G_1$ and $e \in E(G)$, then $(c,e)$ is a vertex-edge-separator of $G$.
\[thm: 2.5 unique\] The decomposition of a 2-connected graph $G$ into 2.5-connected components is unique. With respect to the colouring described in Theorem \[thm: redGreenVirtualEdges\], the 2.5-connected components of $G$ are obtained from the unique triconnected components by merging all red edges of the triconnected components of $G$.
We use the same edge colouring as in Theorem \[thm: redGreenVirtualEdges\]. Let $s$ be a sequence of 2.5-splits that leads to some 2.5-connected components $H_1, H_2, \dots, H_l$ of $G$. Observe that all virtual edges that correspond to the splits in $s$ are green. By Lemma \[lem: triconnectedFrom25Connected\] there exists a sequence of splits $s'$ such that the triconnected components of $G$ are obtained by carrying out $ss'$. As a direct consequence of Lemma \[lem: noGreenEdgesAfter25\], all virtual edges that correspond to splits in $s'$ are red.
Altogether, splits from $s$ correspond to green edges and splits from $s'$ correspond to red edges. However, we know that the red-green colouring of the virtual edges of triconnected components is independent of the choice of $s$ and $s'$ by Theorem \[thm: redGreenVirtualEdges\]. This implies that any sequence that leads to 2.5-connected components corresponds to the same set of virtual edges of the triconnected components. This settles the claim.
\[coro: 25TreeMinorOfTriTree\] Let $G$ be a graph. If $\mathcal{I}$ denotes the 2.5-connected components of $G$ and $\mathcal{I}'$ denotes the triconnected components of $G$, then $S(\mathcal{I})$ is a minor of $S(\mathcal{I}')$.[^5]
This follows from Theorem \[thm: 2.5 unique\] since merging two components corresponds to contracting an edge of $S(\mathcal{I}')$.
\[coro: 2.5ConnectivityTest\] A 2-connected graph $G$ is 2.5-connected if and only if no ear of a triconnected component of $G$ contains both, virtual and non-virtual edges.
A Linear Time Algorithm for 2.5-Connected Components {#sec: linearTime}
====================================================
Based on [@hopcroftTarjan1973] is it shown in [@gutwengerMutzel2000] that the triconnected components of a given graph can be computed in linear time. In this section, we provide a linear-time algorithm which computes the 2.5-connected components of a graph given its triconnected components. It follows that the 2.5-connected components of a given graph can be computed in linear time. The main idea is again, to exploit the red-green colouring of the virtual edges in order to obtain the 2.5-connected components from the triconnected components.
\[thm: linearAlgo\] The 2.5-connected components of a 2-connected graph can be computed in linear time.
Let $G$ be a 2-connected graph and denote by $E^\prime$ the set of all virtual edges in the triconnected components of $G$. By Gutwenger and Mutzel [@gutwengerMutzel2000] the triconnected components as well as the set of virtual edges can be computed in linear time. It remains to determine those virtual edges that need to be merged again in order to get the 2.5-connected components of $G$. By Theorem \[thm: 2.5 unique\] these are the red edges defined in Theorem \[thm: redGreenVirtualEdges\]. By Corollary \[coro: redVirtualEdges\] an edge is coloured red if and only if it and the edge with the same label both lie on a trivial ear or one of the two ears is a cycle solely consisting of virtual edges. Clearly, we can find these virtual edges in linear time by moving through the tree structure given by the triconnected components, taking into account that the number of virtual edges is linear in the number of vertices and edges of $G$, cf. [@gutwengerMutzel2000]. Further each merge can be realised in constant time which gives us the desired result.
Critical 2.5-Connected Graphs {#sec: CriticalGraps}
=============================
In this chapter, we provide novel decomposition techniques for critical 2.5-connected graphs. In analogy to Tutte’s well-known decomposition theorem (cf. Theorem \[thm: tutte\]) we show that critical 2.5-connected graphs which are not isomorphic to the $K_4$ can be reduced to critical 2.5-connected graphs of smaller order using simple graph operations.
Let $G$ be a 2-connected graph. A vertex-2-edge-separator of $G$ is a triple $(c,e_1,e_2) \in V(G) \times E(G)^2$ such that $G-e_1-e_2-c$ is disconnected. A graph $G$ is *critical 2.5-connected* if $G$ is 2.5-connected and for every edge $e \in E(G)$ it holds that $G-e$ is not 2.5-connected, that is, $e$ is contained in a vertex-2-edge-separator of $G$. If $u \in V(G)$ is a degree-3 vertex with incident edges $e_0$, $e_1$, $e_2$, then the vertex-2-edge-separator $(c, e_1, e_2)$ is *degenerate*, where $c$ denotes the vertex that is joined to $u$ by $e_0$. A critical 2.5-connected graph is *degenerate* if every vertex-2-edge-separator is degenerate. Consider prisms of order at least 8 or complete bipartite graphs isomorphic to $K_{3,n}$ with $n \geq 3$ as examples for infinite families of degenerate graphs.
\[thm: criticalWith2Seps\] A 2.5-connected graph $G$ is critical if and only if all triconnected components $H$ of $G$ satisfy that each non-virtual edge of $H$ lies on a vertex-2-edge-separator of $H$ with both edges non-virtual.
First assume that $G$ is critical 2.5-connected. Let $H$ be a triconnected component of $G$ which contains a non-virtual edge $e_1 \in E(H)$. Since $G$ is critical, there exists an edge $e_2$ and a vertex $c$ in $G$ such that $(c, e_1, e_2)$ is a vertex-2-edge-separator of $G$.
Suppose towards a contradiction that $e_2 \notin E(H)$. Let $H'$ be the triconnected component of $G$ with $e_2 \in E(H')$. It follows from Corollary \[coro: 2.5ConnectivityTest\] that neither $H$ nor $H'$ is a cycle. In particular, $H-e_1$ and $H'-e_2$ are 2-connected graphs. Now, merging preserves 2-connectivity and, hence, $G-e_1-e_2$ is 2-connected. This is a contradiction since $G-e_1-e_2-c$ is disconnected.
So far, we have shown that $e_1$ and $e_2$ are both contained in the same triconnected component $H$ of $G$ (which is not a cycle). If $c \in V(H)$, then $(c,e_1,e_2)$ is a vertex-2-edge-separator of $H$. (A virtual edge with ends in distinct components of $G-e_1-e_2-c$ would imply the existence of a path in $G-e_1-e_2-c$ between the components which is a contradiction.) If, otherwise, $c \notin V(H)$, then let $e^{\star}$ be the virtual edge in $H$ with the following property: Removing the edge corresponding to the label of $e^{\star}$ from $S(\mathcal{I})$ disconnects the triconnected components containing $c$ from $H$, where $\mathcal{I}$ is the set of triconnected components of $G$. Now $H-e_1-e_2-e^{\star}$ is disconnected. Choose an appropriate endvertex $u$ of $e^{\star}$ to obtain the desired vertex-2-edge-separator.
Now assume that for each triconnected component $H$ of $G$ it holds that every non-virtual edge $e_1 \in E(H)$ lies on a vertex-2-edge-separator $(c,e_1,e_2)$ of $H$ such that also $e_2$ is non-virtual. Now, $G-e_1-e_2-c$ is disconnected since each path in $G$ connecting vertices of $H$ with edges outside of $H$ is represented by virtual edges in $H$.
\[thm: reductionV2eSeparators\] Let $G$ be a 3-connected graph that contains a non-degenerate vertex-2-edge-separator $(c,e_1, e_2)$.
(a) \[itm: 3VertexSeparatorConstr\] If $c$ is incident to an edge $e_0 \in E(G)$ such that $G-e_0-e_1-e_2$ is disconnected with components $C_1$ and $C_2$, then let $G_1$ ($G_2$) be the graph constructed by adding a new vertex $x_1$ ($x_2$) and the edges $u_ix_1$ ($v_ix_2$) for $i \in \{0, 1,2\}$, where $u_i$ ($v_i$) denotes the endvertex of $e_i$ in $C_1$ ($C_2$).
(b) \[itm: v2eSeparatorConstr\] Otherwise, there are exactly two components $C_1$ and $C_2$ of $G-e_1-e_2-c$. Let $G_1$ ($G_2$) be the graph constructed from $G[V(C_1) \cup \{c\}]$ ($G[V(C_2) \cup \{c\}]$) by adding a new vertex $x_1$ ($x_2$) and the edges $u_1x_1$, $u_2x_1$, and $cx_1$ ($v_1x_2$, $v_2x_2$, and $cx_2$), where $u_i$ ($v_i$) is the endvertex of $e_i$ in $C_1$ ($C_2$).
If $G$ is critical 2.5-connected, then $G_1$ and $G_2$ are critical 2.5-connected 3-connected graphs of smaller order than $G$.
Assume that the constraints of are satisfied. We may restrict ourselves to proving that $G_1$ is a critical 2.5-connected 3-connected graph of lesser order than $G$. If follows from Menger’s theorem that $G_1$ is a 3-connected graph ($\star$). This implies that $G_1$ is 2.5-connected. It remains to show that $G_1$ is critical 2.5-connected.
Suppose towards a contradiction that $G_1-\hat{e}_1$ is 2.5-connected for some $\hat{e}_1 \in E(G_1)$. Since $\{u_1x_1, u_2x_1, cx_1\}$ disconnects $x_1$ from the rest of $G_1$, we know that $\hat{e}_1 \in E(G)$. Let $\hat{e}_2 \in E(G)$ and $\hat{c} \in V(G)$. If $\hat{e}_2 \in \{e_0, e_1, e_2\}$, then $G-\hat{e}_1-\hat{e}_2-\hat{c}$ is connected as a consequence of the 3-connectivity of $G_1$ and $G_2$. From now on, we assume that $\hat{e}_2 \notin \{e_0, e_1, e_2\}$. If $\hat{c} \in V(G_1)\setminus\{x_1\}$, then $G_1-\hat{e}_1-\hat{e}_2-\hat{c}$ is connected by the assumption on $\hat{e}_1$ and $G_2-\hat{e}_2 - x_2$ is connected by $(\star)$. Then $G_1-\hat{e}_1-\hat{e}_2-\hat{c} - x_1$ has at most three components, each containing at least one vertex from $\{u_0, u_1, u_2\}$. This implies that $G - \hat{e}_1-\hat{e}_2-\hat{c} = G_1 - x_1 \cup G_2 - x_2 - \hat{e}_1-\hat{e}_2-\hat{c} + e_1 + e_2 + e_3$ is connected for any choice of $\hat{e}_2$ and $\hat{c}$ which is a contradiction. If, otherwise $\hat{c} \in V(G_2)\setminus\{x_2\}$, then $G_1-\hat{e}_1-\hat{e}_2$ is 2-connected and $G_2-\hat{e}_2 - x_2 - \hat{c}$ has at most three components, each containing at least one vertex from $\{v_0, v_1, v_2\}$. As above, we obtain a contradiction to $G$ being critical since $G - \hat{e}_1-\hat{e}_2-\hat{c}$ is connected for any choice of $\hat{e}_2$ and $\hat{c}$.
In order to prove , observe that it follows from the 3-connectivity of $G$ that there are exactly two components $C_1$ and $C_2$ of $G-e_1-e_2-c$. Now, we may apply the exact same arguments as in . This settles the claim.
The only 3-connected critical graphs which cannot be decomposed into critical graphs of smaller order using operations above are degenerate graphs.
Let $H$ be a 2.5-connected graph. Observe that $$\label{eq: allIncidentTo3VertexImpliesCritical}
\text{if every edge in $H$ is incident to a degree-3 vertex, then $H$ is critical.}$$ This follows since an edge that is incident to a degree-3 vertex lies in a degenerate separator. Vice versa, it holds that $$\label{eq: degenerateImpliesAllIncidentTo3Vertex}
\text{if $H$ is degenerate, then every edge of $H$ is incident to a degree-3 vertex.}$$ Suppose that a degenerate graph $H$ contains a triangle. It follows from that at least two vertices, say $u$ and $v$, of the triangle are of degree 3. Let $w$ denote the third vertex of the triangle and denote by $e_u$ ($e_v$) the unique edge that is incident to $u$ ($v$) but is not contained in the triangle. Now $(w, e_u, e_v)$ is a non-degenerate separator if $H$ is not a complete graph on four vertices. This is a contradiction. We obtain that $$\label{eq: triangle free}
\text{if a degenerate graph is not isomorphic to the $K_4$, then it is triangle-free.}$$
\[thm: reductionOfDegeneratedGraphs\] Let $G$ be a degenerate 3-connected graph which is not 3-regular and let $u \in V(G)$ with $\deg_G(u) = 3$. Denote the neighbours of $u$ by $v_1, v_2,$ and $v_3$.
(a) \[itm: 3vertex with geq4nbs\] If $\deg_G(v_i) \geq 4$ for $i \in \{1,2,3\}$, then set $G' \coloneqq G-u$.
(b) \[itm: 3vertex with 1 3nb and 1 geq4nb\] If $\deg_G(v_1) = 3$ and $\deg_G(v_3) \geq 4$, then set $G' \coloneqq G-u + v_1v_2$.
The graph $G'$ is critical 2.5-connected with $|V(G')| < |V(G)|$.
Every edge in $G$ is incident to a degree-3 vertex by . This is maintained when we construct $G'$. It follows from that it suffices to prove that $G'$ is 2.5-connected. Suppose towards a contradiction that $G'$ contains a vertex-edge-separator $(c,e)$. If the neighbourhood of $u$ is contained in one component of $G'-c-e$, then $(c,e)$ is a vertex-edge-separator of $G$ which is a contradiction. Therefore, $v_1, v_2,$ and $v_3$ are not all in the same component of $G'-c-e$.
First assume . Without loss of generality $v_1$ is in a different component of $G'-c-e$ than $v_2$ and $v_3$. Consequently $(c, e, uv_1)$ is a non-degenerate separator in the degenerate graph $G$ which is a contradiction.
Now assume . Observe that $\{v_1, v_2, v_3\}$ is an independent set in $G$ by . If $v_1$ is in a different component than $v_2$ and $v_3$ in $G'-c-e$, then $e= v_1v_2$ or $c = v_2$. In the first case $G-c-uv_1$ is disconnected which contradicts that $G$ is 2.5-connected. In the second case $(c, e, uv_1)$ is a non-degenerate separator of $G$ which contradicts the degeneracy of $G$. Interchanging the roles of $v_1$ and $v_2$ leads to a contradiction if $v_2$ is separated from $v_1$ and $v_3$ by $(c,e)$.
Last assume that $v_3$ does not share a component with $v_1$ and $v_2$ in $G'-c-e$. Now $(c,e, uv_3)$ is a non-degenerate separator of $G$ since $\deg_G(v_3) \geq 4$. This settles the claim.
We have shown in this chapter that critical 2.5-connected graphs can be reduced using simple operations until the obtained graphs are 3-regular and 3-connected. Then, we may apply the following theorem of Tutte.
\[thm: tutte\] Each simple 3-connected 3-regular graph other than a complete graph on four vertices can be obtained from a 3-connected 3-regular graph $H$ by subdividing two distinct edges of $H$ and connecting the subdivision vertices with a new edge. Conversely, each graph obtainable in this way is 3-connected.
The graph $H$ in Theorem \[thm: tutte\] is 3-regular and 3-connected and, hence, $H$ is critical 2.5-connected.
(2,-5) node (1) \[svertex\] (3.3,-5.2) node (l1) \[novertex\] [$v_3$]{} (-2,-5) node (2) \[svertex\] (-5,-2) node (3) \[svertex\] (-5,2) node (4) \[svertex\] (-2,5) node (5) \[svertex\] (-3,5.5) node (l5) \[novertex\] [$v_2$]{} (2,5) node (6) \[svertex, myRed\] (3,5.5) node (l6) \[novertex, myRed\] [$u$]{} (5,2) node (7) \[svertex\] (6.2,2) node (l7) \[novertex\] [$v_1$]{} (5,-2) node (8) \[svertex\] ; (1) – (2) – (3) – (4) – (5) – (6) – (7) – (8) – (1) – (4) (1) – (6) (2) – (5) (5) – (8) (3) – (7);
(2,-5) node (1) \[svertex\] (-2,-5) node (2) \[svertex\] (-5,-2) node (3) \[svertex\] (-5,2) node (4) \[svertex\] (-2,5) node (5) \[svertex, red\] (-3,5.5) node (l5) \[novertex, myRed\] [$c$]{} (5,2) node (7) \[svertex\] (5,-2) node (8) \[svertex\] (-.2,0.8) node (le1) \[novertex, myRed\] [$e_1$]{} (2.8,-2.7) node (le2) \[novertex, myRed\] [$e_2$]{}; (1) – (2) – (3) – (4) – (5) (4) – (1) (2) – (5) – (7) – (8) – (5); (3) – (7) (8) – (1);
(2,-5) node (1) \[svertex\] (-2,-5) node (2) \[svertex\] (-5,-2) node (3) \[svertex\] (-5,2) node (4) \[svertex\] (-2,5) node (5) \[svertex\] (1,0) node (x1) \[svertex\] (1.9,.8) node (lx1) \[novertex\] [$x_1$]{}; (4) – (1) – (2) – (3) – (4) – (5) – (2) ; (5) – (x1) – (1) (x1) – (3);
(-2,5) node (5) \[svertex\] (5,2) node (7) \[svertex\] (5,-2) node (8) \[svertex\] (1,0) node (x2) \[svertex\] (1.1,-1.1) node (lx2) \[novertex\] [$x_2$]{}; (5) – (7) – (8) – (5); (5) – (x2) – (7) (x2) – (8);
\[fig: reductionExample\]
We close this chapter with an example. Consider Figure \[fig: reductionExample\]. The left graph is degenerate and not 3-regular. We apply Theorem \[thm: reductionOfDegeneratedGraphs\] to obtain the graph in the middle. This graph is critical 2.5-connected and contains a non-degenerate separator $(c, e_1, e_2)$. We obtain the isomorphic copies of the $K_{3,3}$ and the $K_4$ on the right by carrying out the construction of Theorem \[thm: reductionV2eSeparators\]. Observe that both of the graphs on the right are 3-regular and 3-connected. We may now apply Theorem \[thm: tutte\] to reduce the bipartite graph further while the critical 2.5-connectivity is preserved.
Application to Extremal Cycle Decomposition {#sec: Applications}
===========================================
In this section, we prove that the problem of finding an extremal cycle decomposition of an Eulerian graph can be reduced to finding an extremal cycle decomposition for its 2.5-connected components. Furthermore, we show how Hajós’ conjecture can be reduced to considering 2.5-connected components. A *decomposition* of a graph $G$ is a set of subgraphs $\mathcal{C}$ of $G$ such that each edge of $G$ is contained in exactly one of the subgraphs. We say that $G$ can be *decomposed* into the elements of $\mathcal{C}$. If all of the subgraphs in $\mathcal{C}$ are cycles, then $\mathcal{C}$ is a *cycle decomposition*. For an Eulerian graph $G$ we set $$\begin{aligned}
c(G) &\coloneqq \min \{k \colon G~\text{can be decomposed into $k$ cycles}\}~\text{and}\\
\nu(G) &\coloneqq \max \{k \colon G~\text{can be decomposed into $k$ cycles}\}.
\end{aligned}$$ A cycle decomposition of $G$ with $c(G)$ ($\nu(G)$) cycles is *minimal* (*maximal*). Let $G_1$ and $G_2$ be obtained from carrying out a 2.5-split on $G$. It is proven in [@heinrichStreicher2019] that $c(G) = c(G_1) + c(G_2) - 1$ and $\nu(G) = \nu(G_1) + \nu(G_2)-1$. The theorem below follows.
Let $G$ be a 2-connected Eulerian graph and $G_1, G_2, \dots, G_k$ its 2.5-connected components.
(a) $c(G) = \sum_{i=1}^k c(G_i) -k + 1$,
(b) $\nu(G) = \sum_{i=1}^k \nu(G_i) -k + 1$.
Hajós’ conjecture asserts that an Eulerian graph can be decomposed into at most $\nicefrac{1}{2}(|V(G)| + m(G) - 1)$[^6] cycles, where $m(G)$ denotes the minimal number of edges that need to be removed from $G$ in order to obtain a simple graph. The only progress made towards a verification of Hajós’ conjecture concerns graphs that contain vertices of degree at most 4 (cf. [@fan2002]), very sparse graphs (cf. [@fuchs2019]) and, very dense graphs (cf. [@girao2019]).
\[thm: hajos\] The conjecture of Hajós’ is satisfied if and only if all 2.5-connected graphs satisfy Hajós’ conjecture.
Assume that all 2.5-connected graphs satisfy Hajós’ conjecture. Let $G$ be an Eulerian graph. Granville and Moisiades [@granville1987] proved that it suffices to verify Hajós’ conjecture for all 2-connected graphs in order to show that all graphs satisfy the conjecture. In particular, we may assume that $G$ is 2-connected. We prove the following claim: *Let $G_1$ and $G_2$ be obtained from carrying out a 2.5-split on $G$. If $G_1$ and $G_2$ satisfy Hajós’ conjecture, then $G$ satisfies Hajós’ conjecture.*
We have $V(G_1) + V(G_2) = V(G) + 2$ and $m(G_1) + m(G_2) \leq m(G) + 1$. Consequently, $$\begin{aligned}
c(G) &= c(G_1) + c(G_2) - 1\\
& \leq \nicefrac{1}{2}\left(|V(G_1)| + |V(G_2)| + m(G_1) + m(G_2) - 2 \right)-1\\
&\leq\nicefrac{1}{2}\left(|V(G)| + 2 + m(G) + 1 - 2 \right)\\
&=\nicefrac{1}{2}\left(|V(G)| + m(G) - 1 \right).
\end{aligned}$$ Now, the statement follows by induction on the number of 2.5-connected components of $G$.
Conclusion {#sec: ConclusionAndFurtherResearch}
==========
We provide a canonical decomposition of a 2-connected graph into its unique 2.5-connected components. Furthermore, we show how these components can be constructed from the triconnected components of the graph. This overall gives a linear-time algorithm for the 2.5-connected components. We show that all critical 2.5-connected except complete graphs on four vertices can be reduced to smaller critical 2.5-connected graphs. Finally, we prove that it suffices to verify Hajós’ conjecture for all 2.5-connected graphs in order to verify the conjecture for all graphs.
plus 1fill Version
Irene Heinrich\
Algorithms and Complexity Group, Department of Computer Science\
Technische Universität Kaiserslautern, Kaiserslautern\
Germany\
ORCiD: 0000-0001-9191-1712\
Till Heller\
Department of Optimization\
Fraunhofer ITWM, Kaiserslautern\
Germany\
ORCiD: 0000-0002-8227-9353\
Eva Schmidt\
Optimization Research Group, Department of Mathematics\
Technische Universität Kaiserslautern, Kaiserslautern\
Germany\
Manuel Streicher\
Optimization Research Group, Department of Mathematics\
Technische Universität Kaiserslautern, Kaiserslautern\
Germany\
ORCiD: 0000-0001-5605-7637\
[^1]: Irene Heinrich has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (EngageS: grant agreement No. 820148).
[^2]: Eva Schmidt was partially funded by the Federal Ministry of Education and Research (BMBF) of Germany.
[^3]: Manuel Streicher was partially funded by the Federal Ministry of Education and Research (BMBF) of Germany.
[^4]: Recall the definition of $S(\mathcal{I})$ from Lemma \[lem: splitsSuffice\].
[^5]: Recall the definition of $S(\mathcal{I})$ from Lemma \[lem: splitsSuffice\].
[^6]: Originally, Hajós conjectured that at most $\nicefrac{1}{2}|V(G)|$ cycles are needed. This equivalent reformulation is due to Fan and Xu, cf. [@fan2002].
|
Q:
Styling promoted links web part
I have a promoted links web part with 12 items. I would like to show the tiles in a 4x3 grid for which I'm using code.
Though I'm able to make changes to the UI, the tiles appear very close to each other. I would like to know if there any option to increase the space / padding between each tile?
Thank you
A:
This depends on the width of tile-root, tile-content
<style>
div.ms-tileview-tile-root {
width: 185px !important;
}
div.ms-tileview-tile-content
{
width: 180px !important;
}
</style>
This will keep a 5px border around the tile, if its width 185px
Note: the CSS style working only with the custom promoted list, not to the default prompted list like "Get Started with your Web Site" that created at a new site.
|
Q:
Is there any way to get Mvx.MvxLinearLayout to respect android:layout_weight?
I have a horizontal list of items that i wish to share the available screen width equally.
Previously I had used index binding to each item and a static LinearLayout with each item having an equal layout_weight.
When I replace the static LinearLayout with an Mvx.MvxLinearLayout and ItemsSource binding, and move the markup for the items into an Itemtemplate the layout_weight is no longer respected by the MvxLinearLayout.
I've tried various ways of restructuring the item template and there seems to be no way to get this control to obey layout_weight when arranging its items.
Is there any way to get Mvx.MvxLinearLayout to respect android:layout_weight, or any alternative approach that could give me a dynamic list of items that will arrange equally given a boundary of fixed dimensions?
Edit
Assuming a list of 3 items, with a string property 'Name'.
This markup works as expected, giving 3 text items of equal width:
<LinearLayout
android:orientation="horizontal"
android:layout_width="fill_parent"
android:layout_height="wrap_content">
<TextView
android:layout_weight="1"
android:layout_width="0dp"
android:layout_height="wrap_content"
local:MvxBind="Text Items[0].Name"
/>
<TextView
android:layout_weight="1"
android:layout_width="0dp"
android:layout_height="wrap_content"
local:MvxBind="Text Items[1].Name"
/>
<TextView
android:layout_weight="1"
android:layout_width="0dp"
android:layout_height="wrap_content"
local:MvxBind="Text Items[2].Name"
/>
</LinearLayout>
This Approach does not work, the layout weight is not applied correctly to the TextViews:
<Mvx.MvxLinearLayout
android:orientation="horizontal"
android:layout_width="fill_parent"
android:layout_height="wrap_content"
local:MvxBind="ItemsSource Items"
local:MvxItemTemplate="@layout/item_template" />
The ItemTemplate layout file:
<?xml version="1.0" encoding="utf-8"?>
<TextView xmlns:android="http://schemas.android.com/apk/res/android"
xmlns:local="http://schemas.android.com/apk/res-auto"
android:layout_weight="1"
android:layout_width="0dp"
android:layout_height="wrap_content"
local:MvxBind="Text Name" />
A:
The problem is, mvvmcross inserts an additional view when using MvxLinearLayout with an ItemTemplate. So instead of getting a view hierarchy:
MvxLinearLayout -> TextView
you end up with:
MvxLinearLayout -> MvxListItemView -> TextView.
The layout properties applied to the TextView, notably the weight, are therefore invisible to the LinearLayout. The MvxListItemView is primed with the default layout properties (wrap content), and no weight effects are seen.
The location where the action happens is in MvxViewGroupExtensions (e.g. Refill), where the subviews are added to the LinearLayout, and the CreateBindableView method in MvxAdapter, where the subview is packed inside an IMvxListItemView.
One way to solve this is to override the methods in MvxViewGroupExtensions, and after the views are added to update the layout properties of the MvxListItemViews (e.g. copy them from the underlying view). For example:
private static void Refill(this ViewGroup viewGroup, IAdapter adapter) {
.... // rest of code
Invalidate();
for (int j = 0; j < viewGroup.ChildCount; j++)
{
var child = GetChildAt(j) as MvxListItemView;
var param = new LinearLayout.LayoutParams(
0, ViewGroup.LayoutParams.WrapContent, 1.0f);
child.LayoutParameters = param;
}
}
|
This Program Project is designed to provide funds for four projects and one core facility. The studies of the four projects will focus on the intra- and extra-cellular signals which determine the fate of lymphocytes at various stages of their life history. Particular attention will be paid to the factors which affect whether lymphocytes live or die, since the phenomena which control the proliferation and differentiation versus tolerance of lymphocytes are absolutely crucial to the health of the animal. The investigators on the first project have developed a method for isolation of very early lymphocyte progenitors. They will use these cells to find out which transcription factors they express, and how these transcription factors may affect cell development. The functions of these cells and their descendants will also be studied. The studies of the second project will deal with the effect of antigen valency on the fate of lymphocytes. The third project will concentrate on the properties of memory T cells and will study the properties which distinguish these cells from other types of T cells. The investigatory on the last project have discovered that the fate of antigen activated T cells in animals is affected by inflammatory processes. Experiments will be done to find out why antigen- activated T cells die in animals, and how inflammation prevents this death.
|
1. Field of the Invention
The present invention relates to a two-way interactive system having a mechanism for matching lines of sight between interlocutors through a transmission means, and a terminal equipment and an image pickup apparatus constituting the system and, more particularly, to a counseling system which realizes a two-way interactive operation between, e.g., a doctor and a patient or a counselor and a client in remote areas through a transmission means and is mainly oriented to a one-to-one two-way interactive operation, and an apparatus constituting the system.
2. Related Background Art
Conventionally, counseling in the field of education, medical service, psychology, or the like is generally performed between interlocutors directly facing each other while establishing an intimate reliability relationship between them. In some cases, however, a person who needs counseling and a person (counselor) who has mastered a counseling technique can hardly share place and time because a natural disaster has occurred, or they are in remote areas. Along with a progress in communication technology, a system for realizing counseling between persons in remote areas is strongly demanded.
In construction of such a counseling system by using a communication technology, to ensure an intimate relationship between interlocutors and an ideal counseling environment, as in the conventional face-to-face system, it is important to match the lines of sight between the interlocutors.
A conventional image pickup apparatus for matching the lines of sight between interlocutors through a transmission line is disclosed in Japanese Patent Laid-Open No. 62-269128 (first prior art). In the first prior art, a half mirror is provided between an interlocutor and the image pickup apparatus, so that light from the interlocutor as an object is divided toward the image pickup apparatus and toward an image display apparatus. Therefore, according to the arrangement of the first prior art, the image pickup apparatus is arranged at a position offset from the display screen of the image display apparatus at which the interlocutor looks, thereby matching the optical axis of light incident in the image pickup apparatus with the line of sight of the interlocutor.
Another image pickup apparatus is disclosed in Japanese Patent Laid-Open No. 4-213287 (second prior art) in which a special display apparatus capable of selecting reflection/transmission of light is used, and an image pickup apparatus is arranged behind the display apparatus (on the opposite side of an interlocutor through the display apparatus). According to this arrangement, the line of sight of the interlocutor is directed to the display apparatus, i.e., the image pickup apparatus arranged behind the display apparatus at a position offset from the display screen of the display apparatus at which the interlocutor looks, so that the lines of sight between interlocutors can be matched each other.
A still another image pickup apparatus is disclosed in Japanese Patent Laid-Open No. 4-97633 (third prior art) in which a small-size mirror or a small-size half mirror is attached to the upper portion of a display apparatus, and the image of an interlocutor is picked up by a small-size camera with an optical axis directed to the mirror. According to this arrangement, the image of the interlocutor, which is reflected by the mirror, is picked up by the small-size camera arranged at a position offset from the display screen of a display apparatus at which the interlocutor looks. Therefore, the angle of elevation of the line of sight of the interlocutor is suppressed to 10.degree. or less, which is an allowance for line-of-sight matching in the vertical direction, so that the lines of sight between interlocutors can be matched each other.
|
In a network environment, a packet needs to be forwarded from a source node to a destination node along a forwarding path, so that a data packet is forwarded, and data is transmitted. The source node is also referred to as an ingress node (Ingress Node), and the destination node is also referred to as an egress node (Egress Node). For a network environment that supports multiprotocol label switching (MPLS), different mechanisms may be selected to forward packets, such as an Internet Protocol (IP) routing mechanism, an MPLS mechanism, and a segment routing (SR) mechanism. In packet forwarding mechanisms such as the MPLS mechanism and the segment routing mechanism, the forwarding path is also referred to as a label switched path (LSP).
In a process of forwarding a packet in a network, some service processing needs to be performed on the packet sometimes. For example, when a forwarding node on a forwarding path of the packet has multiple links for selection, to implement load balance on the forwarding node, the forwarding node needs to select, according to a load status of each link, a link to forward the packet.
In the prior art, for a forwarding equivalence class (FEC), to perform service processing on a packet corresponding to the FEC in a forwarding process of the packet, some forwarding nodes on a forwarding path of the FEC need to be statically configured, so that these forwarding nodes can process, in a statically configured service processing manner, the packet corresponding to the FEC. However, because there are a large quantity of FECs in the network environment, and a service processing manner of each FEC needs to be configured for different forwarding nodes, a large quantity of forwarding nodes in the network need to be statically configured. Consequently, work of configuring and maintaining service processing for the network environment is extremely complex, and it is difficult to flexibly implement various service processing in the network environment.
|
Derby duo named in Championship's top XI for the 2013/14 season.
Derby County’s Craig Bryson and Will Hughes were named in the Sky Championship ‘Team of the Season’ at the annual PFA Awards Dinner on Sunday evening.
The midfield pair were nominated by fellow players in the Championship for their impressive performances in a Derby shirt throughout the campaign.
Scottish international Bryson, 27, has bagged an impressive 16 goals in 46 appearances this season while England Under 21 international Hughes, 19, has scored four times in 44 appearances.
The Sky Bet Championship ‘Team of the Season’ is as follows:
Kasper Schmeichel (Leicester City)
Kieran Trippier (Burnley)
Wes Morgan (Leicester City)
Jason Shackell (Burnley)
Aaron Cresswell (Ipswich Town)
Danny Drinkwater (Leicester City)
Craig Bryson (Derby County)
Will Hughes (Derby County)
Andy Reid (Nottingham Forest)
Ross McCormack (Leeds United)
Danny Ings (Burnley)
PFA ‘Team Of The Season’ Voting Explained
PFA representatives deliver the ballot forms to the training ground of the 92 League clubs.
Amongst the instructions and procedures that a player is given is that they are not allowed to vote for a player that is at the same club as themselves and applies in all award categories.
Another stipulation is that a player can only win an award if their club has taken part in the ballot, this ensures that all players from other clubs that have voted have a fair chance of winning an award.
After a member has decided who they are voting for they must sign, fold and then give their envelope to the PFA representative who will seal the vote.
The PFA use an independent company to count and verify the votes cast, and completed ballots are sent directly to Beever & Struthers Chartered Accountants.
Tweets by @ dcfcofficial
|
Sexual orientation in the 2013 national health interview survey: a quality assessment.
Objective-This report presents a set of quality analyses of sexual orientation data collected in the 2013 National Health Interview Survey (NHIS). NHIS sexual orientation estimates are compared with those from the National Survey of Family Growth (NSFG) and the National Health and Nutrition Examination Survey (NHANES). Selected health outcomes by sexual orientation are compared between NHIS and NSFG. Assessments of item nonresponse, item response times, and responses to follow-up questions to the sexual orientation question are also presented. Methods-NHIS is a multipurpose health survey conducted continuously throughout the year by the Centers for Disease Control and Prevention's National Center for Health Statistics. Analyses in this report were based on NHIS data collected in 2013 from 34,557 adults aged 18 and over. Sampling weights were used to produce national estimates that are representative of the civilian noninstitutionalized U.S. adult population. Data from the 2006-2010 NSFG and 2009-2012 NHANES were used for the comparisons. Results-Based on the 2013 NHIS data, 96.6% of adults identified as straight, 1.6% identified as gay/lesbian, and 0.7% identified as bisexual. The remaining 1.1% of adults identified as ''something else,'' stated ''I don't know the answer,'' or refused to answer. Responses to follow-up questions suggest that the sexual orientation question is producing little classification error. In addition, largely similar patterns of association between sexual orientation and health were observed for NHIS and NSFG. Analyses of item nonresponse rates revealed few data quality issues, although item response times suggest possible shortcutting of the question and comprehension problems for select respondents.
|
My life as a member of the Adjunct Majority who has decided to no longer remain silent.
Monday, September 29, 2014
One Year Later: Margaret Mary, Burning It Down, and What Comes Next
Today, September 29, is the remembrance day for Margaret Mary Vojtko. Dan Kovalik's piece broke the story on the 19th and by the month's end, her sorrowful tale resounded worldwide. Here we are on the day dedicated to her: one year later, one year louder. The death of Margaret Mary stands as a lightning strike in the midst of the drab chaos adjuncting can be. It was her death that shook so many into realizing that the story could end the same for them. It was her death that made many who do care about teaching and learning conditions realize the situation was indeed dire. It was her death that put many of us on the path to activism. When we win any victory, any recognition, it also belongs to Margaret Mary.
When I drive into the City of Pittsburgh and past Duquesne, I imagine her spirit there. When I waiver on publishing a post, or speaking to a reporter and using my name, I think of Margaret Mary. I remember how cold, so very cold I felt inside though the day was blistering hot when I read Kovalik's article. This could be me. Oh god, this could be me, my brain whispered as I stood at the start of my first multiple-school teaching year. That feeling has driven me ever since. I will not let an entire generation of scholars go down in flames. I will not let students be deprived of the educations they are paying large sums of money for. I will use my words and time to work for better. If I have to, I will also use actions.
This weekend, Twitter citizen @downwardlymobilePhD, with the help of others, planned and carried out an adjunct online forum that allowed for truth telling and airing of grievances, and I also participated in the event. Given the marker #BurnItDown, the hashtag raged much of Saturday afternoon and into Monday was still garnering new hits. Anyone with a Twitter account can, of course, search the hashtag and see the full stream of tweets. Raging Chicken Press created a Storify of some tweets called "Ripping Back the Veil of Exploitation in Higher Ed" that gives a good summary of the tone and the truth many adjuncts face. I just wrapped up my Saturday class as this event began and was still amazed, as I scrolled to catch up and join the fray, how similar to my own experience total strangers' adjunct lives are no matter where they call home. This is indeed a worldwide crisis at this point and adjunct issues often garner hits not only from the US, but Canada, the UK, Australia, and New Zealand.
Certainly, these fiery tweets will be read as complaining and whining by some. That happens nearly every time an adjunct speaks out. However, for many of us, our scholarly community--the people who understand exactly what this life is--are our on-line adjunct colleagues and we need these moments of shared experiences to affirm our solidarity. Make no mistake about it: solidarity amongst adjuncts exists not only on campuses as we unionize, but now it extends across state lines and country borders. One success at a small school is a victory for everyone. It is a slice of light seeping in. Our cause now regularly appears in publication and news venues. We are not whining so much as standing up for ourselves at last. We dare to challenge the current state of higher education with our BurnItDown mentality. We care about the workpain of adjuncts and other downgraded--both in salaries and hours-- and entirely necessary campus employees. We care about our students and do not like that they pay for educations but are given climbing walls and waterfalls. It is this last part, this care for our students, for the art and craft of teaching that has lead many adjuncts to ponder, "What next? What can we do to start again? To create something better that meets the needs of students and teachers without exploitation and unnecessary expense." That answer will come and it will be beautiful and varied as the people who now fall under the term "contingent labor." Make no mistake, we may take a day to air our grievances, but we never stop working towards the ultimate goal of better for all who want to take part.
Strength is in numbers, as Margaret Mary knew when she sought out the union. I hope our efforts would make her proud. If she knew how many her life inspired to speak up, to challenge the system in quieter and equally effective ways, I think she would be pleasantly surprised. Thus, today after Burning It Down, we remember her and are renewed in our quest to find a better way.
~~~~
(Oh, and Happy First Payday to those of us who've been waiting until the 30th of Sept. to get some much needed monies for our labor.)
Obligatory Disclaimer
This blog represents my own opinions and reactions to my life and experiences as an adjunct educator in the United States. I comment on other writings regarding the adjunct crisis. My views are my own and do not represent the official views of any of the various schools for whom I may be teaching.
|
Growing a Business in a Recession
May 29, 2009
COLUMNBy MICHAEL S. MALONE
The great companies of high technology are at the starting line and waiting for the pistol to fire. When they come out of the blocks, it's going to be a dazzling sight … and our lives will change in the process.
Most of us see the current economic downturn as a particularly nasty recession -- one that, given Washington's current fiscal strategy, is likely to leave us with both a ton of debt and very slow, inflation-driven recovery. But for the electronics industry, driven by the unrelenting pressure of Moore's Law, downturns are merely interregnums between booms. They are a time for consolidating resources and staff, abandoning low-performing product and market ventures … and most of all, stealing the march on competitors by gearing up new products for the return of demand.
That's what's been going all over the tech world over the last year. While we've had our attention elsewhere, smart companies -- not to mention those firms that haven't been too distracted by plummeting sales -- have been gearing up for the next generation of products. Now, as they queue up in the months before the formal introduction of those products, we are starting to get some early -- and exciting -- glimpses of what that future will be.
To my mind, the single most important piece of technology news last year, though few people noticed, was Intel's announcement that it would continue to maintain its current level of R&D investment despite the recession. In other words, no matter what happened, Intel was going to keep Moore's Law moving forward. As CEO Paul Otellini told me when I interviewed him for the Wall Street Journal, he wasn't going to be the guy who had Moore's Law die on his watch.
Why was that important? Because what happens upstream in the world of chips sets the pace for everything that happens downstream in computers, smart phones, videogames, servers and, ultimately, in social networks, Google, Twitter, Facebook, etc.
Intel's gutsy decision to keep spending billions of dollars on new products when the rest of the world was tightening its belts meant that the company (if it didn't commit suicide in the process) would be perfectly positioned to own the semiconductor industry when the economy turned upward. [Indeed, if I was buying stock these days -- which I can't do as a journalist -- I'd seriously consider loading up on those guys.]
But, just as important, Intel's announcement provided those tens of thousands of downstream companies, big and small, the assurance that they could still plan for the future, extrapolating their future products out on the exponential curve of Moore's Law. That may not seem important, but in fact, in the digital age of which all of us are citizens, it is almost everything.
When you know the performance, price and size of the new generation of computational engines, you also know how small, how powerful, and how inexpensive you can plan to make your own products; what features you can add to your Web site or social network; and what level of experience you can bring to your online or video game.
|
Atherothrombosis and plaque heterology: different location or a unique disease?
Formation of unstable plaques frequently results in atherothrombosis, the major cause for ischaemic stroke, myocardial infarction and peripheral arterial disease. Patients who have symptomatic thrombosis in one vascular bed are at increased risk of disease in other beds. However, the development of the disease in carotid, coronary and peripheral arteries may have different pathophysiology suggesting that more complex treatment protocols may have to be designed to reduce plaque development at different locations. In this review we describe the known risk factors, compare the developmental features of coronary and carotid plaque development and determine their association with end-point ischaemic events. Differences are also seen in the genetic contribution to plaque development as well as in the deregulation of gene and protein expression and cellular signal transduction activity of active cells in regions susceptible to thrombosis. Differences between carotid and coronary artery plaque development might help to explain the differences in anatomopathological appearance and risk of rupture.
|
Introduction {#Sec1}
============
Osteoarthritis (OA) is the most common type of degenerative joint arthritis and is characterized by cartilage loss and osteophyte formation^[@CR1]^. OA was once thought to be a simple degenerative disease caused by excessive mechanical stress on articular cartilage. However, OA is currently known to have a complex etiology that affects the entire joint, and the production of matrix-degrading proteases plays a pivotal role^[@CR1],[@CR2]^. Persistent mechanical stress induces a hypertrophic change in articular chondrocytes and the production of cartilage matrix-degrading proteases, such as matrix metalloprotease (MMP)-3, MMP-13, disintegrin and metalloproteinase with thrombospondin motifs 5 (Adamts5). Due to these changes, a central area in the cartilage undergoes cartilage loss, and the peripheral cartilage with a good blood supply from the synovium forms osteophytes through endochondral bone formation^[@CR2],[@CR3]^.
Several studies investigating the pathogenesis of OA converge on the molecular cascades of producing cartilage matrix degrading proteases, such as MMP-13 and Adamts5^[@CR4]^. In the producing these proteases, a lot of signaling mechanisms and transcription factors have been known to be involved as major upstream including nuclear factor-kappa B (NF-kB), mitogen-activated protein (MAP) kinases, hypoxia-induced factor 2 alpha (Hif-2α), and runt-related transcription factor 2 (Runx2)^[@CR4],[@CR5]^. Among them, NF-kB signaling, which has known to play a role in biomechanical cartilage degeneration^[@CR6]^, involves in the interleukin (IL)-1-mediated MMP-13 production and can strongly induce Hif-2α^[@CR7],[@CR8]^. MAP kinases also participate in the induction of MMP-13 through extracellular signal-regulated kinase (Erk)-induced phosphorylation of ETS transcription factor, p38-mediated C/EBPβ and Runx2 activation, and c-Jun N-terminal kinase (JNK)-driven activator protein (AP)-1^[@CR9],[@CR10]^. Because NF-kB and MAP kinases are major signaling molecules in the inflammatory response, inflammation in the synovium in response to cartilage breakdown products is believed to be a major upstream inducer of the NF-kB/MAP kinase-protease cascade^[@CR11]^. In contrast to the inflammation hypothesis, several researchers have argued that OA is primarily a mechanical disease based on the role of misalignment or excessive loading during the development of OA^[@CR12]^. However, the mechanism by which mechanical stress induces the activation of the NF-kB and MAP kinase cascades in OA remains unknown^[@CR13]^.
In the context of mechanical loading, subchondral bone can be the primarily affected articular structure since subchondral bone is a major contributor to the dispersion of mechanical loading forces across the joint^[@CR14]^. Indeed, activated osteoclasts are found in subchondral bone before the occurrence of the degradation of articular cartilage^[@CR15],[@CR16]^. The subchondral bone pathology in early stage OA shows increased microfractures and a decreased thickness in the subchondral bone plate and trabecular bone, implying the presence of micro-damage and active remodeling of subchondral bone^[@CR17]^. Therefore, the subchondral bone milieu in the early phase of OA may have a high concentration of calcium (Ca) and phosphate (Pi) due to resorption of the bone matrix by osteoclasts.
To date, most studies regarding the role of Ca and Pi in OA have focused on Ca-Pi crystals as a degradation product of bone involved in the late stages of OA^[@CR18]^. Ca-Pi crystals, such as basic Ca-Pi, hydroxyapatite or Ca pyrophosphate dihydrate (CPPD), are increased in severe OA and can induce synovial inflammation^[@CR19],[@CR20]^. Here, we hypothesized that the increased Ca-Pi levels in active subchondral bone remodeling can affect the physiology of articular cartilage in early stages of OA. To test our hypothesis, we applied Time-of-Flight Secondary Ion Mass Spectrometry (ToF-SIMS) to investigate the ion levels of Ca and Pi in articular cartilage. In addition, we analyzed the Ca-Pi complex-mediated global protease expression in hypertrophic chondrocytes, which revealed a significant increase in MMP-3 and MMP-13 expression that was dependent on NF-kB, p38 and Erk1/2 MAP kinase signaling. Our results provide insights into the mechanisms by which the changes in subchondral bone can affect articular cartilage degradation.
Results {#Sec2}
=======
Ca was increased and co-localized with Pi in articular cartilage in early-stage OA {#Sec3}
----------------------------------------------------------------------------------
Evidence of increased subchondral bone remodeling in early OA prompted us to investigate whether Ca and Pi are increased in articular cartilage in OA^[@CR16]^, which were quantified using ToF-SIMS analyses. The surgical DMM model was used to induce OA in 10-week-old male C57BL/6 J mice. As expected, compared to the sham-operated group, increased osteoclast activity, as assessed using TRAP staining, was observed as early as 2 weeks post-surgery in the subchondral bone area of the DMM group (Fig. [1A](#Fig1){ref-type="fig"}). The ToF-SIMS analysis of Ca^2+^ and PO~3~ ^−^ levels in articular cartilage revealed an increase in Ca^2+^ in the DMM surgery group, while PO~3~ ^−^ levels showed a decreasing trend in the DMM group compared to the those in the sham group. Interestingly, most Ca^2+^ in the articular cartilage in the DMM animals colocalized with PO~3~ ^−^, as is evident from the merge of the two channels producing yellowish punctuate signals. However, the articular cartilage in the control sham operation group remained green after merging the channels, indicating a predominance of PO~3~ ^−^ that was not colocalized with Ca^2+^ (Fig. [1B](#Fig1){ref-type="fig"}).Figure 1Ca^2+^ and PO~3~ ^−^ localization in articular cartilage following the DMM surgery. (**A**) Representative images of TRAP staining in subchondral bone 2 weeks after the DMM and control sham surgeries. Areas within the black rectangles are magnified in the right panels. TRAP-positive area per trabecular bone surface was quantified. Scale bar is 100 μm. (**B**) Representative images of ToF-SIMS analysis of the distribution of Ca^2+^ and PO~3~ ^−^ in articular cartilage. Original yellow colored images were converted to red for Ca^2+^ and green for PO~3~ ^−^ and then merged. Articular cartilage areas within the white rectangles are magnified in the right panels. The intensity of Ca^2+^ and PO~3~ ^−^ was quantified in multiple 47 × 47 μm-sized rectangles that were randomly selected in the area of the articular cartilage. TEM; Transmission electron microscopy. n = 7 in each group. \*P \< 0.05.
Ca and Pi increase the expression of MMP-3 and MMP-13 in hypertrophic chondrocytes {#Sec4}
----------------------------------------------------------------------------------
Based on the Ca-Pi co-localization in the OA articular cartilage, we explored the effects of the Ca-Pi on catabolic enzyme production in hypertrophic chondrocytes since articular chondrocytes that are adjacent to calcified cartilage and subchondral bone, which are major sources of MMP-13, have hypertrophic features^[@CR21]^. First, we assessed the Ca-Pi-mediated global changes in gene expression in hypertrophic chondrocytes obtained from 12-day micromass cultures of limb-bud MPCs. The microarray analysis revealed that the Ca (2.5 mM) and Pi (1.5 mM) treatment of the hypertrophic chondrocytes significantly increased the expression of MMP-3, MMP-13, and Adamts1 among the proteases involved in the proteolytic degradation of the extracellular matrix (ECM) (Supplementary Table [2](#MOESM1){ref-type="media"}).
Expression of the identified targets was determined by real-time qPCR and a Western blot analysis of hypertrophic chondrocytes obtained from the micromass cultures (Fig. [2A](#Fig2){ref-type="fig"}). Ca and Pi increased the expression of type X collagen at the RNA level, while the expression of Runx2 was decreased, and Epas1 was not affected by the Ca and Pi treatment (Fig. [2B,C](#Fig2){ref-type="fig"}). As expected, MMP-3 and MMP-13 were significantly increased by the Ca and Pi treatment at the RNA and protein level, and this finding was confirmed by the immunostaining of the micromass cultures, which revealed a positive ECM staining of MMP-3 and MMP-13 following the Ca-Pi treatment (Fig. [2D](#Fig2){ref-type="fig"}). In contrast, the expression levels of Adamts1 and Adamts5 was unchanged following the Ca and Pi treatment (Fig. [2B,C](#Fig2){ref-type="fig"}).Figure 2Ca- and Pi-mediated production of MMP-3 and MMP-13 in hypertrophic chondrocytes. (**A**) MPCs from E10.5 limb buds were high-density cultured (2.5 × 10^5^ cells/10 μL) for 12 days and treated with Ca (2.5 mM) or Pi (1.5 mM) for 1 day. Hypertrophic differentiation and matrix mineralization were assessed by ALP and Alizarin red staining, respectively. n = 5. (**B**) Gene expression related to the hypertrophic chondrocyte phenotype was assessed in Ca- or Pi-treated micromass cultures by real-time qPCR. (**C**) Total cell lysates from Ca- or Pi-treated micromass cultures were analyzed for chondrocyte differentiation markers by Western blotting. (**D**) Representative images of the expression of MMP-3 and MMP-13 assessed in Ca- or Pi-treated micromass cultures by immunostaining analysis. Scale bar = 100 μm. n = 5.
Ca-Pi-mediated MMP induction is dependent on Erk1/2, p38 MAP kinase, NF-kB and STAT3 signaling {#Sec5}
----------------------------------------------------------------------------------------------
To evaluate the transcriptional regulation of the Ca-Pi-mediated MMP production, we characterized the activation of the MAP kinases and NF-kB signaling, which has been previously identified as a key regulator of MMPs^[@CR22]^. When we checked activation of these signalings at 5 min after Ca or Pi stimulation, the phosphorylation of Erk1/2, p38 MAP kinase and Akt signaling was increased by the Ca-Pi co-treatment and, to a lesser extent, the Pi treatment alone. At 5 min, the Ca or Pi treatment failed to activate JNK, MAP kinase, p65 and IkB, which are components of NF-kB signaling (Fig. [3A](#Fig3){ref-type="fig"}). However, a time course analysis of the changes in the signaling pathway following the Ca-Pi treatment revealed a delayed activation of p65 and IkB signaling at 15 min (Fig. [3B](#Fig3){ref-type="fig"}). We also measured changes in the NFAT family because these family members are major targets of Ca signaling. Of the members of this family, only NFAT1 was increased by the Ca-Pi stimulation at 15 min, which reflects the increased stability of this protein (Fig. [3C](#Fig3){ref-type="fig"}). We also checked the STAT3 signaling activation by Ca-Pi based on the recent data of basic Ca-Pi crystal-mediated IL-6-STAT3 signaling activation^[@CR19]^. Interestingly, Ca-Pi treat initially reduced the phosphorylation of STAT3 and increased it in one hour, suggesting an indirect delayed stimulation of STAT3 (Fig. [3C](#Fig3){ref-type="fig"}).Figure 3Ca- and Pi-induced activation of NF-kB, Erk1/2 and p38 MAP kinase, and STAT3 signaling is responsible for the MMP-3 and MMP-13 expression in hypertrophic chondrocytes. (**A**) Murine limb-bud MPCs were cultured at a high density (2.5 × 10^5^ cells/10 μL) for 12 days and then treated with Ca (2.5 mM) or Pi (1.5 mM) for 5 mins. Total cell lysates were subjected to Western blotting for Erk1/2, p38, JNK MAP kinase, Akt, and NF-kB signaling. (**B**,**C**) Hypertrophic chondrocytes obtained from micromass cultures were treated with Ca and Pi for the indicated time course, and the phosphorylation of the components in each signaling pathway was assessed by Western blotting. n = 3. (**D**) Representative Western blot analysis of whole cell lysates from micromass cultures treated with specific inhibitors of Erk1/2 (PD98059), p38 MAP kinase (SB203058), NF-kB (JSH-23) and calcineurin-NFAT signaling (FK506) during the co-treatment with Ca and Pi for 24 h. (**E**) Micromass-cultured cells were treated with various doses of Stattic, a small-molecule inhibitor of STAT3 activation and dimerization. n = 3.
We then investigated the role of these activated signaling pathways in MMP production by Ca-Pi. After blocking the Erk1/2, p38 MAP kinase and NF-kB signaling pathways with their specific inhibitors (PD98059, SB203058 and JSH-23, respectively), the Ca-Pi-mediated induction of MMP-3 and MMP-13 was significantly attenuated. However, the inhibition of the NFAT family by the calcineurin inhibitor, FK506 increased the production of MMP-3 and MMP-13, suggesting that the NFAT family plays a repressive role in MMPs transcription (Fig. [3D](#Fig3){ref-type="fig"}). The inhibition of STAT3 signaling with a various doses of Stattic, a small-molecule inhibitor of STAT3 activation and dimerization, significantly attenuated the Ca-Pi-mediated induction of MMP-3 and MMP-13 in hypertrophic chondrocytes (Fig. [3E](#Fig3){ref-type="fig"}).
Ca-Pi complexes increase endocytosis in chondrocytes, and TLRs are not responsible for the MMPs production by Ca-Pi {#Sec6}
-------------------------------------------------------------------------------------------------------------------
To determine whether the Ca-Pi complex acts as a ligand for a specific receptor on chondrocytes, we investigated the activation of Toll-like receptors (TLRs), which are well-known receptors for Ca-containing crystals^[@CR23]^. First, we determined the type of TLR signaling that is involved in the production of MMP-3 and MMP-13. When treated with various TLR ligands, the ligands for TLR2 and TLR4 both increased the expression of MMP-3 and MMP-13 at the protein and RNA levels (Fig. [4A,B](#Fig4){ref-type="fig"}). However, the pretreatment with OxPAPC, which is a dual inhibitor of TLR2 and TLR4, could not attenuate the increase in MMP-3 and MMP-13. Furthermore, LPS-RS, which is a TLR-4 antagonist that functions by binding MD2, rather increased the expression of MMP-3 and MMP-13. These results suggest that TLR signaling is not responsible for the Ca-Pi-mediated MMP induction (Fig. [4C](#Fig4){ref-type="fig"}). Ca-Pi crystals can be internalized into chondrocytes through endocytosis, which can increase the intracellular Ca levels and production of MMP and Adamts-family molecules^[@CR24],[@CR25]^. Treatment of primary chondrocytes with Ca and Pi increased the expression of EEA 1, which is a marker of early endocytosis. In addition, the treatment increased the nuclear distribution of Caveolin-1, which is a major scaffolding protein in endosomes or matrix vesicles. However, treatment with methylene-diphosphonate (MDP), which is an inhibitor of the Ca-Pi complex formation that functions as an analog of pyrophosphate (PPi), completely restored the Ca-Pi-mediated changes in the endocytosis markers (Fig. [4D,E](#Fig4){ref-type="fig"}). To further clarify Ca-Pi-mediated enhanced endocytosis, we conducted electron microscophy (EM) analysis. Ca-Pi-treated primary chondrocytes revealed a prominent increase of endosome-like vacuoles in their cytoplasm compared to controls (Fig. [4F](#Fig4){ref-type="fig"}).Figure 4Ca and Pi increase endocytosis in chondrocytes, and their effects on MMP production may not be dependent on TLR signaling. (**A**,**B**) MMP-3, MMP-13 and Adamts5 protein and RNA production by TLR ligands were analyzed by Western blotting and real-time qPCR in hypertrophic chondrocytes obtained from 12-day high-density micromass cultures of limb-bud MPCs. (**C**) Representative Western blotting of MMP-3 and MMP-13 in Ca- and Pi-treated hypertrophic chondrocytes that were treated with 30 μM OxPAPC (TLR2 and TLR4 dual inhibitor) or 1 μM LPS-RS (TLR4-MD2 inhibitor). (**D**) Representative immunofluorescence staining of EEA 1, which is an early endosome marker, and Caveolin-1, a marker of matrix vesicles in primary chondrocytes in the presence of Ca-Pi or 1 mM MDP (a calcification inhibitor). Red fluorescence intensity was quantified using the ImageJ program. n = 8 per group. \*P \< 0.05. (**E**) Western blot analysis of subcellular fractionated lysates. Micromass-cultured hypertrophic chondrocytes were treated with Ca-Pi or MDP for 1 day. (**F**) Representative electron microphotography (EM) image of primary chondrocytes showing increased endosomes in the cytoplasm when treated with CaPi compared to controls. Images shown to the right is an enlargement of rectangle shown in the left panel. N represents the nucleus of chondrocyte.
The endocytosed Ca-Pi complex works as signaling effector {#Sec7}
---------------------------------------------------------
To confirm whether the endocytosed Ca-Pi complex is responsible for the increase of MMPs, we treated the Ca-Pi formation inhibitor, MDP or phosphate channel inhibitor, phosphonoformic acid (PFA) in micromass-cultured hypertrophic chondrocytes with Ca and Pi. The inhibition of the Ca-Pi complex formation by MDP ameliorated the observed increase in the expression of MMP-3 and MMP-13 following the Ca-Pi treatment, whereas the inhibition of the Pi channels PiT1 and PiT2 with PFA failed to attenuate the observed increase in MMP expression following the Ca-Pi treatment (Fig. [5A](#Fig5){ref-type="fig"}). Finally, we investigated whether the intracellular signaling effects of Ca-Pi are mediated by free Ca ions. BAPTA-AM, which is an intracellular Ca chelator, failed to attenuate the Ca-Pi-mediated production of MMP-3 and MMP-13 in hypertrophic chondrocytes (Fig. [5B](#Fig5){ref-type="fig"}). Therefore, Ca-Pi can be endocytosed and act as a signaling effector in a complexed form.Figure 5CaPi-mediated MMPs production depends on Ca-Pi complex formation (**A**) Representative Western blot analyses of MMP-3 and MMP-13 in high-density cultured hypertrophic chondrocytes. Cells were treated with Ca-Pi in the presence of PFA (a selective PiT1 and PiT2 inhibitor), or MDP (a calcification inhibitor) for 1 day. (**B**) Hypertrophic chondrocytes were treated with various doses of BAPTA-AM (an intracellular Ca chelator) with or without Ca-Pi for 1 day. (**C**) Schematic role of Ca and Pi in the pathogenesis of OA elicited from this study. Excessive mechanical stress can induce microfractures in subchondral bone. The microfractures can recruit macrophages to subchondral bone and promote bone remodeling. This remodeling can increase the Ca^+^ levels in articular cartilage, which primarily exists in a combined form with PO~3~ ^−^. The Ca-Pi complex induces MMP-3 and MMP-13 via the NF-kB, p38 and Erk1/2 MAP kinase, and STAT3 signaling pathways. The increased MMP-3 and MMP-13, in turn, release Ca and Pi from calcified cartilage through the degradation of the ECM. This positive catabolic loop associated with the Ca-Pi complex may accelerate the progression of OA.
Discussion {#Sec8}
==========
Subchondral bone is considered a potential contributor to the pathogenesis of OA based on observations that subchondral microstructural damage and subchondral bone loss in the early stages of OA are strongly associated with cartilage damage^[@CR26]--[@CR28]^. Using a surgical model of OA, increased subchondral osteoclast activity was observed as early as 1 week after surgery before the articular cartilage damage occurred^[@CR16]^. Therefore, molecules originating from subchondral bone in the remodeling process can affect the catabolic processing of articular cartilage in early OA. To the best of our knowledge, we are the first to identify an increase in the Ca ion content, which mainly exists in the form of a complex with Pi ions, in articular cartilage following surgically induced OA. Our data provide a model in which Ca, which is not normally present in articular cartilage, is increased, accompanied by increased subchondral bone remodeling during the early stages of OA. The increased Ca appears to mostly form a complex with Pi ions in the articular cartilage.
The Ca-Pi treatment of the hypertrophic chondrocytes significantly induces the production of MMP-3 and MMP-13 but not Adamts. This increase in MMPs was attenuated by a calcification inhibitor of a PPi analog but not by an intracellular Ca chelator or Pi channel inhibitor, suggesting that the Ca-Pi complex acts as a signaling molecule. Ca-Pi crystals have been known to act as mediators of inflammation in late stages of OA^[@CR18]^. However, intra-articular injections of basic Ca-Pi crystals can induce OA-like changes^[@CR29]^. In addition, Ca-Pi crystals have a positive feed forward loop with IL-6, which is an important mediator of joint damage as a key component of the senescence-associated secretory phenotype (SASP)^[@CR19]^. We showed that the effects of Ca and Pi to hypertrophic chondrocytes including MMPs production and cellular changes all depended on Ca-Pi complex formation, but not by Ca or Pi ion alone. We used Ca or Pi-containing solution instead of Ca-Pi crystal, and did not characterize the exact molecular structure of Ca-Pi complex. Further study is needed to elucidate the functioning Ca-Pi complex structure as well as their signaling mechanisms.
MMP-3, which is most prominently induced in Ca-Pi-treated hypertrophic chondrocytes, is known to participate in the activation of additional latent MMPs, such as MMP-1 and MMP-13^[@CR30]^. MMP-13 is the main collagenase involved in the degradation of type II collagen, which is sufficient to induce OA^[@CR31]^. The cartilage of mice lacking MMP-13 was protected in a surgically induced OA model, while the cartilage-specific overexpression of MMP-13 aggravated spontaneous cartilage damage^[@CR32],[@CR33]^. A spontaneous OA model of transgenic Del1 mice revealed that MMP-13 is expressed in deep calcified cartilage and subchondral bone where tissue remodeling is active but not in degenerative hyaline cartilage^[@CR21]^. The expression of MMP-3 and MMP-13 in OA chondrocytes is known to be mainly regulated by Runx2 and Hif-2α^[@CR34],[@CR35]^. However, in spite of the increase in MMP-3 and MMP-13, the expression of Runx2 and Hif-2α was surprisingly reduced following the Ca-Pi treatment in the hypertrophic chondrocytes, suggesting that the induction of MMPs by Ca-Pi is independent of Runx2 and Hif-2α.
Our results suggest that the Ca-Pi complex can activate NF-kB, p38 and Erk1/2 MAP kinase, and STAT3 signaling, and it was responsible for the production of MMP-3 and MMP-13 in hypertrophic chondrocytes. It is well known that the NF-kB and MAP kinase signaling are abnormally activated in OA chondrocytes, and these findings provided a foundation of inflammation theory in the development of OA^[@CR36],[@CR37]^. There has been much debate regarding whether OA is a chronic inflammatory disease in which inflammatory cytokines from the synovium play a critical role, or a mechanically-induced "wear and tear" disease^[@CR38]^. Here, our data provide a missing piece of the puzzle regarding how abnormal cartilage mechanics can be connected to the inflammation-related phenotype in OA as the Ca-Pi increases due to abnormal mechanics can activate NF-kB and MAP kinase signaling in hypertrophic chondrocytes.
BCP crystals are known to induce IL-6 production through involving Syk, PI3 kinases and STAT3 pathways in chondrocytes and IL-6, in turn, promotes BCP crystal formation, which leads to a positive amplification loop of BCP crystal formation^[@CR19]^. In this study, the treatment of Ca and Pi gradually decreased the phosphorylation of STAT3 for the first 30 mins in hypertrophic chondrocytes. However, it showed a delayed activation in 60 mins after Ca-Pi stimulation, suggesting the presence of indirect trans-activation mechanisms in STAT3. In addition, the inhibition of STAT3 signaling with Stattic significantly attenuated the Ca-Pi-dependent production of MMPs in hypertrophic chondrocytes. This can be, same as the previous evidence^[@CR19]^, dependent on the production of IL-6 by Ca-Pi complex. However, the early STAT3 activation just in one hour suggests the direct interaction with other signaling pathways such as NF-kB and MAP kinases. Our result provides another evidence of the interactions between Ca-Pi complex and STAT3 signaling pathway and further investigation is needed to elucidate the molecular mechanisms of Ca-Pi and STAT3 interaction.
From a clinical perspective, our data provide a theoretical basis for antiresorptive therapy to suppress bone remodeling and prevent the progression of OA. Although conflicting data have been reported, the NIH Osteoarthritis Initiative cohort study showed a trend for reduced knee joint space narrowing following bisphosphonate use after 4 years^[@CR39]^. The benefits of antiresorptive agents in OA can depend on the timing of the treatment initiation, which may be the cause of conflicting clinical results. As subchondral bone remodeling is already active in the early stages of OA, the chondroprotective effects of antiresorptives can be maximized when used very early in the disease course. Antiresorptives have been shown to be effective in a surgical OA model using bisphosphonates immediately after the OA induction surgery^[@CR40]^.
In conclusion, our data demonstrate for the first time an increase in Ca levels in articular cartilage during the early stages of OA and shed light on the role of the Ca-Pi complex as an intermediary that connects subchondral bone changes to articular cartilage (Fig. [5](#Fig5){ref-type="fig"}). These findings regarding the Ca-Pi- MMP feedback loop may introduce a new starting point for the development of disease-modifying OA drugs.
Methods {#Sec9}
=======
Surgical induction of OA and tissue preparation {#Sec10}
-----------------------------------------------
Experimental OA was induced by destabilization the medial meniscus (DMM) as previously described^[@CR41]^. Briefly, after anesthetizing 10-week-old C57BL/6 male mice, the left knee was dissected with a longitudinal incision approximately 3 mm in length over the distal patella to the proximal tibial plateau. The joint capsule was opened, and the infra-patella fat pad was dissected. The medial meniscotibial ligament, which is located at the end of the medial femoral condyle, was transected under a microscope to destabilize the medial meniscus. In the sham-operated mice, the medial meniscotibial ligament was visualized but not transected. The mice were maintained in their preoperative groups, allowed unrestricted cage exercise, and euthanized 2 weeks after the surgery. All animal protocols were approved by the Institutional Animal Care and Use Committee of the Daegu Fatima Hospital (approved protocol number F-15--03) and conformed to the Guide for the Care and Use of Laboratory Animals published by the US National Institutes of Health (NIH publication, 8^th^ Edition, 2011). The knee joints of the DMM or sham-operated mice were fixed in 4% paraformaldehyde (Merck, Darmstadt, Germany) at 4 °C for 24 h and dehydrated in increasing concentrations of ethanol for 12 days. Subsequently, the hydrated knee joints were embedded in methyl-methacrylate (MMA, Sigma) and sectioned at a thickness of 6 µm using a microtome with a tungsten carbide knife. The sections were mounted on glass slides for tartrate-resistant acid phosphatase (TRAP) staining or indium tin oxide (ITO) glass for ToF-SIMS analysis.
TRAP staining and ToF-SIMS analyses {#Sec11}
-----------------------------------
The engagement of osteoclasts in early OA was evaluated using TRAP staining after removing the MMA via 2-Methoxyethyl Acetate (AME, Sigma-Aldrich, St. Louis, MO) and rehydrating the sections. The rehydrated knee joint sections were incubated in a solution of naphthol-1-phosphate sodium salt and fast violet (Sigma-Aldrich) in an acetate buffer (pH 5.0) at 37 °C for 15 min. After washing with dH~2~O, the red-colored osteoclasts were analyzed under a microscope (Nikon, Japan).
The distribution of Ca^2+^ and PO~3~ ^−^ in the DMM and sham-operated knee joints was analyzed using a ToF-SIMS instrument (ION-TOF GmbH, Munster, Germany) equipped with a bismuth liquid metal ion gun (LMIG). A bismuth primary ion (Bi^3+^) beam at 30 keV in low-current bunched mode (pulse width \~1.13 ns, beam diameter \~2.0 μm) with a target current of 0.50 pA and a cycle time of 100 μsec was used to acquire the chemical images of the knee joints with a high-mass resolution. The primary ion dose density was 5 × 10^11^ ions∙cm^−2^. The analysis area was 500 × 500 μm^2^ (256 × 256 pixels) and was charge-compensated using an electron flooding gun. The positive and negative ion spectra were internally calibrated using Ca^2+^ and PO~3~ ^−^ ion peaks, respectively. To extract the ToF-SIMS spectra, 47 × 47 μm-sized regions of interest (ROIs) were manually selected in the cartilage region of the DMM or sham-operated knee joints. If multiple ROIs were selected in the same image, all ROIs were the same size, and their mass spectra were normalized to the total ion count. Each image was normalized to the intensity of the brightest pixel^[@CR42]^.
Micromass culture and inhibitor assay {#Sec12}
-------------------------------------
The micromass culture was performed as previously described^[@CR43]^. Briefly, limb buds from 10.5 dpc embryos were digested with Dispase II (Roche, Indianapolis, IN), and the suspended cells were grown in media composed of DMEM mixed with Ham's F12 at a 2:3 ratio, 10% FBS, and 2 mM L-glutamine. The cells were concentrated at 2.5 × 10^7^ cells/ml, and a 10 μl drop was spotted on the culture plate. After achieving a stable attachment to the culture dish, the cells were differentiated into chondrocytes by a treatment with 10 mM β-glycerophosphate and 50 μg/ml ascorbic acid in the growth media and cultured for 12 days, and the media were changed every other day. To elucidate the role of the Ca-Pi complex in the hypertrophic chondrocytes, CaCl~2~ (2.5 mM) and a Pi buffer (1.5 mM) composed of Na~2~HPO~4~ and NaH~2~PO~4~-H~2~O were added to the 12-day-cultured micromasses for 24 h. For the inhibitor assays of each signaling pathway, the 12-day-cultured micromass cells remained untreated (control) or were stimulated with Ca and Pi for 24 h in the absence or presence of 50 μM PD98059 (MEK/Erk inhibitor), 10 μM SB203058 (p38 MAP kinase inhibitor), 20 μM JSH-23 (NF-kB nuclear translocation inhibitor), 10 μM FK506 (calcineurin inhibitor), various doses of Stattic (STAT3 inhibitor), 30 μM OxPAPC (TLR2 and TLR4 dual inhibitor), 1 μM LPS-RS (TLR4-MD2 inhibitor), 1 mM methylenediphosphonate (MDP; calcification inhibitor), various doses of phosphonoformic acid (PFA; selective PiT1 and PiT2 inhibitor) and BAPTA-AM (intracellular Ca^2+^ chelator).
Microarray analysis {#Sec13}
-------------------
Total RNA was extracted from the micromass cultures that were treated with Ca-Pi or PBS as a control using an Easy-Blue™ Total RNA extraction kit (iNtRON biotechnology, Korea). After evaluating the RNA quality, 100 ng of total RNA were biotin-labeled using the Affymetrix GeneChip whole-transcript sense target-labeling assay and hybridized to Affymetrix mouse gene ST1.0 arrays (Affymetrix, High Wycombe, UK). After normalizing the scanned data using Expression Console software version 1.1 (Affymetrix), the differential gene expression was analyzed.
Real-time qPCR analysis {#Sec14}
-----------------------
Total RNA was extracted from the cultured primary chondrocytes or micromass cultures that were treated with Ca or Pi or untreated (control). In total, 2 μg of RNA were synthesized from cDNA and used to perform the real-time qPCR using the SYBR Green PCR master mix on an ABI ViiA7 real-time PCR machine (Applied Biosystems, Waltham, MA). All samples were run in triplicate and normalized to the expression of GAPDH. The calculation of the relative expression was performed using the 2-ddCT method. Each reaction was repeated three times independently. The primers used for the real-time qPCR are listed in Supplementary Table [1](#MOESM1){ref-type="media"}.
Western blotting {#Sec15}
----------------
Cell lysates from the micromass cultures or primary chondrocytes that were treated with Ca-Pi were separated by SDS-PAGE and transferred onto PVDF membranes (Amersham Biosciences, Buckinghamshire, UK). The membranes were blocked with 5% skim milk at room temperature (RT) for 1 h, followed by incubation with the primary antibodies listed below for 1 h with shaking. After washing the membrane with TBS-T, the membranes were incubated with an HRP-conjugated secondary antibody (Santa Cruz Biotechnology, CA, USA) for 1 h and washed again. The signal on the membranes was visualized using enhanced chemiluminescence solution (Amersham Biosciences). The primary antibodies against Col2, Col10, Mmp-3, Mmp-13, Adamts5 and Runx2 were purchased from Abcam (Cambridge, UK); the phospho-Erk1/2, phospho-P38, phospho-JNK, phospho-Akt, phospho-P65, phospho-IkB, NFAT1 and NFAT3 antibodies were purchased from Cell Signaling Technology (Danvers, MA); and the Epas1 and NFAT4 antibodies were purchased from Santa Cruz Biotechnology (Santa Cruz, CA).
Immunofluorescence staining {#Sec16}
---------------------------
The immunofluorescence staining was performed in cultured primary chondrocytes or sections of paraffin-embedded micromass samples. Primary chondrocytes cultured on 8-chamber slides (Thermo Fisher Scientific, Waltham, MA) were fixed with 4% paraformaldehyde (PFA) for 5 min and permeabilized on ice with 0.25% Triton X-100 in PBS for 3 min. After blocking with 2% BSA for 1 h, the cells were incubated with the anti-early endocytosis antigen (EEA1) (1:200) and anti-Caveolin-1 (1:200, Cell Signaling Technology, CA) antibodies at RT for 1 h. The cells were washed with PBS, incubated with an Alexa Fluor 594-conjugated anti-rabbit antibody (1:200, Thermo Fisher Scientific) for 1 h and counter-stained with DAPI.
For the immunostaining of the micromass cultures, paraffin-embedded micromass samples were cut into 3 µm-thick sections and then deparaffinized. After rehydration with decreasing concentrations of ethanol and antigen retrieval using proteinase K, the sections were blocked with 1% BSA for 1 h and incubated with the anti-Mmp3 and Mmp-13 antibodies (Abcam) in 1% BSA at 4 °C overnight. The sections were washed and incubated with Alexa Fluor 594-conjugated anti-rabbit antibody (1:200, Thermo Fisher Scientific) for 1 h. After counter-staining with DAPI, the sections were mounted with anti-fade mounting solution (Invitrogen, Carlsbad, CA) and imaged under a fluorescence microscope (Nikon, Japan).
Electron microscopic analysis {#Sec17}
-----------------------------
Electron microscopy was performed to determine the number of endosome-like vacuoles in primary chondrocytes treated with or without Ca and Pi. Briefly, primary chondrocytes were cultured for 4 days and treated with or without Ca and Pi for 24 h, and then washed three times with 1X PBS, and collected by centrifugation at 1,000 × g for 5 min. The cell pellets were fixed in 4% paraformaldehyde overnight at 4 °C, post-fixed with 1% OsO4 in cacodylate buffer for 1 h at room temperature, and gradually dehydrated with ethanol. The dehydrated pellets were rinsed with propylene oxide for 30 min at room temperature and then embedded in Spurr resin prior to sectioning. Images of thin sections were observed under a transmission electron microscope (Tecnai G2 F20 TWIN TMP; FEI).
Statistical analyses {#Sec18}
--------------------
The Mann-Whitney U tests and Kruskal--Wallis one-way analysis of variance (ANOVA) tests were used to determine the differences between the means. All analyses were conducted using SPSS version 14.0 software (SPSS, Chicago, IL). The results are presented as the means ± SDs, and statistical significance was accepted at P-values \< 0.05.
Electronic supplementary material
=================================
{#Sec19}
Supplementary Tables and Figures
**Electronic supplementary material**
**Supplementary information** accompanies this paper at 10.1038/s41598-017-18946-y.
**Publisher\'s note:** Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
We are grateful to Prof. J. Choi (Department of Biochemistry and Cell Biology, Kyungpook National University, Daegu, Republic of Korea) for thoughtful discussions and valuable assistance. This study was supported by a grant to S.H. from the Korea Health Technology R&D Project through the Korea Health Industry Development Institute (KHIDI), which is funded by the Ministry of Health & Welfare, Republic of Korea. (Grant Number: HI15C1780) and to D.M. from the DGIST R&D Programs of the Ministry of Science, ICT & Future Planning (17-BD-06).
Conceived and designed the experiments: Y.J., G.K., D.M. and S.H. Performed the experiments: Y.J., M.H., H.P., E.L., J.J. and S.L. Analyzed the data: Y.J., G.K., S.L., D.M. and S.H. Wrote the paper: Y.J., D.M. and S.H. Critical revision: Y.J., G.K., D.M. and S.H.
Competing Interests {#FPar1}
===================
The authors declare that they have no competing interests.
|
TrucknTow.com is the best place to find Truck Accessories for your big rig, tow truck, autohauler or work truck.
If you use your truck for work, then you owe it to yourself to check out our complete line of truck accessories and trailer accessories for the truck and truck driver. Whether you drive a tow truck, semi truck, work truck, work van, dump truck, rollback, or refer truck; whether you're pulling a utility trailer, a cargo trailer, an equipment trailer, a dump trailer, or a car hauler trailer — Truckntow has the new or replacement truck accessory to keep you trucking.
On our website you will find high quality ratchet tie down straps, specialty tie downs, chain tie down, and tiedown accessories for your flatbed truck from brand names like Vulcan®, Ancra®, and Durabilt®. Straps for Tiedown can be custom made or we offer a great selection of standard lengths and types.
You will find the right truck light bar, truck work light, cargo light, cab light, or truck light from manufacturers like Whelen®, Star®, Federal Signal®, Sound Off Signal®, Code 3®, North American Signal®, ShoMe®, Maxxima®, Peterson®, Grote®, and Hella®.
We stock and offer Rigging, Lifting, Hoist, and Material Handling equipment. Find hooks for Rigging and Slings for Lifting everything. Slings can be custom or select from in stock certified Chain Slings and Nylon Slings. Sling Straps are made from Nylon or Polyester. All Slings meet OSHA safety standards. Manufacturers offered include Cooper Tools®, Columbus McKinnon®, PEWAG®.
Need a Tow Strap? We offer the best selection of Tow Straps anywhere.
We have towing straps for every type of job. From light duty tow straps for towing cars to heavy duty Recovery Straps for Lifting large vehicles, TrucknTow can get you the right Straps for your tow or recovery job.
You will find DOT compliant truck reflective tape and ANSI compliant trucker reflective vests, safety vests, and reflective clothing from brand names like 3M®, Reflexite®, Occunomix®, TrafFix®, and Dicke®. Take a look around for life simplifying accessories for inside your truck cab or camper. Look for service truck accessories like jumper cables, jump starter systems, and truck mounted generators. We stock Jump Starters from Associated®, Xantrex®, Goodall®, and Grip®. Pick a jump starter that is right for you.
Find every size and type of truck tool box. Truck tool boxes are made of steel and aluminum by Buyers®, RCI®, and Dee Zee®. These Truck Boxes are made to fit under the body, behind the cab, or on the front of the trailer. Truck toolboxes are available in many sizes with several door styles. Choose the truck box that's right for your job.
|
First detection of tick-borne "Candidatus Neoehrlichia mikurensis" in Denmark 2011.
This is the first reporting of the tick-borne zoonotic bacterium “Candidatus Neoehrlichia mikurensis” in Denmark. A total of 2,625 Ixodes ricinus ticks from 58 locations in Denmark were collected and analysed for “Ca. Neoehrlichia mikurensis”. A nested PCR revealed the presence of the bacterium at three geographically separate locations, which indicates that it is widely established in ticks.
|
Quran 8:39 [Fighting for Religion]
And fight with them until there is no more persecution (fitnah) and religion should be only for Allah; but if they desist, then surely Allah sees what they do [Quran 8:39]
Objection 1
The verse is predicated on not one but two requirements: (1) the end of fitna and (2) that religion is only to Allah. The second requirement means one must fight on even if fitna has ceased, which essentially boils down to justified persecution of and waging war against the Mushrikeen and Mulhideen.
Explanation
The way you are interpreting this is that Muslim should fight non-stop unless these two conditions are met, but almost all Muslims understand this verse to mean that they can fight to end oppression as well as to establish conditions where they can freely worship God. This is further explained by Hadith where it says that if you see evil, stop it by hand; if you cannot stop it by hand, stop it by your tongue; and if you cannot do that either, then consider that to be evil in your heart. And if you go back to verse 8:34 where kuffar are warned to stop preventing Muslims from performing pilgrimage, the latter part of the verse “and religion is for Allah alone,” makes perfect sense_ the idea being that in al-Masjid al-Haram only God is to be worshipped [the idea being explicitly stated in verse 2:191 which sets the stage for verse 2:193, which is identical to verse 8:39].
Verse 8:39 is a continuation of verse 8:38. That is obvious because verse 8:39 starts with “wa-” (And), and so do verses 8:40 and 8:41. You have to read these in conjunction with each other. It’s the brilliance of Quran that every single word is important, and you shouldn’t take each verse out of context. Allow me to reproduce these verses, for sake of this discussion:
[8.38] Say to those who disbelieve, if they desist, that which is past shall be forgiven to them; and if they return, then what happened to the ancients has already passed.
[8.39] And fight with them until there is no more persecution and religion should be only for Allah; but if they desist, then surely Allah sees what they do.
[8.40] And if they turn back, then know that Allah is your Patron; most excellent is the Patron and most excellent the Helper.
[8.41] And know that whatever thing you gain, a fifth of it is for Allah and for the Apostle and for the near of kin and the orphans and the needy and the wayfarer, if you believe in Allah and in that which We revealed to Our servant, on the day of distinction, the day on which the two parties met; and Allah has power over all things.
What is being discussed is mischief of “wicked” or “bad” disbelievers (Verse 8:37) who are being asked to desist from their wickedness, for if they do so (it doesn’t say that they have to convert), their past wickedness would be forgiven. Verse 8:39 establishes two reasons by which Muslims can fight: 1) to end persecution 2) to fight for conditions by which religion would only be for God, and not for anything else. Part 2) may also mean that if somebody is fighting for religion but that struggle is not for God or for His commandments, and/or if it ends up violating God’s other commandments, that is unlawful. Verse 8:40 clarifies that if the mischief-makers turn away, Muslims shouldn’t worry about them (in other words, Muslims should leave them alone) for God is their Protector and Helper. Verse 8:41 is simply about the distribution of booty gained from these wars.
The idea is for kuffar (disbelievers) to cease ‘fitnah’ (persecution). If you interpret this to mean that they should cease their “disbelief,” it doesn’t make any sense because numerous other verses of Quran would contradict that, such as:
[9.6] And if one of the idolaters seek protection from you, grant him protection till he hears the word of Allah, then make him attain his place of safety; this is because they are a people who do not know.
If your interpretation was correct, then God would have said that they should not be allowed to leave and they should be forced to believe. Actually, the discussion of these kuffar starts with verse 8:30, where it is said:
[8.30] And when those who disbelieved devised plans against you that they might confine you or slay you or drive you away; and they devised plans and Allah too had arranged a plan; and Allah is the best of planners.
That was the first indictment. The second indictment comes in verse 8:34 where it is said:
[8.34] And what (excuse) have they that Allah should not chastise them while they hinder (men) from the Sacred Mosque and they are not (fit to be) guardians of it; its guardians are only those who guard (against evil), but most of them do not know.
The third indictment is given in Verse 8:36:
[8.36] Surely those who disbelieve spend their wealth to hinder (people) from the way of Allah; so they shall spend it, then it shall be to them an intense regret, then they shall be overcome; and those who disbelieve shall be driven together to hell.
And because of these three indictments, God calls their acts “fitnah” or persecution.
Objection 2
Fitnah does not mean persecution. The Hillali-Musin Khan translation translates the word as “disbelief and polytheism, i.e. worshipping others besides Allah.” Their understanding is not entirely wrong – a literal reading of the text does seem to be calling for a global jihad against the ikhwaan al-Mushrikeen wa’l-Mulhideen. Fitna (from the verb fatana, for infatuation, charm, enticement, temptation, turning away) refers to temptation, fascinating, things that turn Muslims away from their deen, sedition, dissension, et cetera.
Response
I think just about every translator, whether Muslim or not, has translated fitnah for this verse as “persecution:”
YUSUFALI: And fight them on until there is no more tumult or oppression, and there prevail justice and faith in Allah altogether and everywhere; but if they cease, verily Allah doth see all that they do.
PICKTHAL: And fight them until persecution is no more, and religion is all for Allah. But if they cease, then lo! Allah is Seer of what they do.
SHAKIR: And fight with them until there is no more persecution and religion should be only for Allah; but if they desist, then surely Allah sees what they do.
A.J.ARBERRY: Fight them, till there is no persecution and the religion is God’s entirely; then if they give over, surely God sees the things they do.
SHER ALI: And fight them until there is no persecution and religion is wholly to Allah. But if they desist, then surely Allah is Watchful of what they do.
MUHAMMAD ALI: 39. And fight with them until there is no more persecution, and all religions are for Allah. But if they desist, then surely Allah is Seer of what they do.
MUHAMMAD ASAD: And fight against them until there is no more oppression and all worship is devoted to God alone.
T.B. IRVING: Fight them off until there is no more persecution, and Religion belongs wholly to God: yet if they do stop, then God is Observant of anything they do.
RASHAD KHALIFA: You shall fight them to ward off oppression, and to practice your religion devoted to GOD alone. If they refrain from aggression, then GOD is fully Seer of everything they do.
E.H. PALMER: Fight them then that there should be no sedition, and that the religion may be wholly God’s; but if they desist, then God on what they do doth look.
J.M. RODWELL: Fight then against them till strife be at an end…
Hilalli-Khan translation is simply wrong. Within the same Surah, look up Verse 8:25. Here Hillali-Khan translation correctly translates fitnah as “affliction and trial.” I hope you know what “literal” means. The literal meaning would be simply a statement that “religion is for God alone.” What you or Hilali-Khan are suggesting is NOT literal meaning but an interpretation, which is not supported by the text itself. Secondly, you are implying that “fatana” is the root word which it is not. Usually, a verb is derived from a noun, not vice versa. Quran has used the term in a variety of other ways, and for a native speaker, it is not difficult to understand what is meant.
Additional information on the origin of word fitnah.
From an Islamic web site:
“Al-Azhari said: “The Arabic word fitnah includes meanings of testing and trial. The root is taken from the phrase fatantu al-fiddah wa’l-dhahab (I assayed (tested the quality of) the silver and gold), meaning I melted the metals to separate the bad from the good. Similarly, Allaah says in the Qur’aan (interpretation of the meaning): ‘(It will be) a Day when they will be tried [yuftanoona] (punished, i.e. burnt) over the Fire!’ [al-Dhaariyaat 51:13], meaning, burning them with fire.” (Tahdheeb al-Lughah, 14/196).
“Ibn Faaris said: “Fa-ta-na is a sound root which indicates testing or trial.” (Maqaayees al-Lughah, 4/472). This is the basic meaning of the word fitnah in Arabic.
“Ibn al-Atheer said: “Fitnah: trial or test… The word is often used to describe tests in which something disliked is eliminated. Later it was also often used in the sense of sin, kufr (disbelief), fighting, burning, removing and diverting.” (al-Nihaayah, 3/410. Ibn Hajar said something similar in al-Fath, 13/3).”
The word “fitnah” has been used in a variety of meanings. The meaning is usually derived from the context. Most translators have translated it as “persecution” though “mischief” would also be a good translation within this context. The same word “fitnah” appears in verse 2:217 where it is said that “fitnah is worse than murder.” Obviously, here “fitnah” would mean persecution. But again, Hilali/ Muhsen Khan got terribly confused and left the word “al-fitnah” in the English translation with a footnote so confusing that few can understand the meaning of the verse.
Objection 3
So what we see is that 8:38 simply states a message to be said to the disbelievers: they have a choice – either they can abandon their kufr, and be forgiven, or face the same wrath past believers have faced (and the Qur’an, as well as the Judeo-Christian, is replete with stories about harsh punishments – be they inflicted by God or his servants – meted out to disbelievers living in the times of other prophets). It is from there that we step into the next verse:
Response
Usually, in the language of the Quran, when it is said “example of those before them,” it usually means nations that perished in the past. See 2:66, 3:137, 14:45, 15:13, 25:39. These people were not killed by Muslims but were destroyed by God.
Additional Explanatory Notes by Muslim Scholars
Agha Puya, a Shiah scholar, has given an excellent interpretation of this term: “Fitna means subversive activities to destroy peace and rule of law. With reference to other verses like this verse (Nisa 135; Ma-idah 2 and 8 ) it must be said that Islam advocates universal peace and harmony in the human society and teaches us to tolerate and accommodate other creeds so far as their followers do not hatch plots and generate ill-will to destroy the Muslims and ascribe falsehood to Allah and His religion. In verses 1, 8 and 9 of al Mumtahanah, the believers are advised to show kindness and do justice to the unbelievers who are not hostile to them, but at all events, friendship with the enemies of Allah has been discouraged. Islam avoids killing and destruction, but when public peace and safety is at stake, prompt and severe action is taken to bring order and eliminate lawlessness. Islam has no room for willful aggressors and cunning mischief-makers.”
Among Sunni scholars, Maududi thinks that there are two purposes to this verse: the “negative” is to eradicate mischief. The “positive purpose” is to establish a state of affairs where all obedience is to God. According to him, “fighting for any other purpose is not lawful.”
Like this:
LikeLoading...
2 thoughts on “Quran 8:39 [Fighting for Religion]”
Abdullah, you have sent me several comments, but there is not much “meat” in any of those; in fact, not even a bone of contention. You need to present a strong argument for your views. If you are a Christian, present your side, but don’t just come up with insults or labels.
No religion is uniform; it always has its shades and levels of understanding. I present my understanding of Islam, which is based on reliable sources. If others disagree with it, they are entitled to their own views.
|
A complex number is also a multivalue object. It consists of two parts: real part and imaginary part. The imaginary part carries symbol i which is equal to √-1 . A complete number is written as sum of the real part and the imaginary part as shown below.
Cl = x + iy
C2 = u + iv
Here, Cl and C2 are two complex numbers. The real part of number C1 is x and its imaginary part is y. Similarly, u is the real part of complex number C2 and v is its imaginary part. When two complex numbers C1 and C2 are added, the real part of C1 is added to the real part of C2, while the imaginary part of C1 is added to imaginary part of C2 in the following manner:
Cl + C2 = x + u + i(y + v)
Similarly, while performing subtraction (C1 - C2), the real part ofC2 is subtracted from the real part of C1 and the imaginary part of C2 is subtracted from the imaginary part of C1 as illustrated below.
C1 - C2 = x - u + i(y - v)
These operations may be carried out with the help of a function which returns structures. Program provides an example of performing these operations.
|
She was told by nurses that the patient “meant no harm”
Woah, Nelly. I can’t…it’s just…that’s not…but what about…I never…damn.
On Friday, August 5th, Lory Beth Synder’s four-month-old daughter, Lorelai, was admitted to the pediatric unit at NEA Baptist Hospital in Jonesboro, Arkansas. Snyder eventually fell asleep with her daughter in her hospital room. When she woke up about an hour later, her daughter was gone.
In a post describing the incident on her Facebook page, she wrote that when she found her daughter, “…she was in another woman’s hospital room, in that woman’s arms, with a room full of six or seven nurses just laughing and playing with her and Lorelai.” Her diaper bag was in the room with some its contents removed, as well as the child’s crib and IV pole. She took her daughter out of the woman’s arms, despite the woman (who was apparently just another patient at the hospital) telling Snyder that she should leave the baby with her because Snyder “needed to just go rest.”
The most terrifying thing happened to my family two days ago. As many of you know Lorelai had been admitted to NEA… Posted by Lory Beth Snyder on Sunday, August 7, 2016
As if all of that isn’t terrifying and awful enough, the nurses, according to Snyder, were unconcerned. Wrote Snyder, “Three nurses followed me [out of the room]. They all trying to assure me that my child was in no danger, that they new [sic] the patient, and she meant no harm.”
Snyder and her family were then moved to a secure ICU room for the rest of their stay. She called the police, who told her that, according to Snyder’s Facebook post, “…no crime was committed because Harris didn’t ‘intend’ to rape or molest my child.”
As someone who worked in a hospital for over five years and taught people about privacy laws and how to respond in abduction scenarios, this entire incident flabbergasts me.
Flabber. Gasts. Me.
Based on the mother’s account, what happened here was that a bunch of nurses brought someone else’s baby to the room of a favorite patient so that she could play with it without the mother’s knowledge or permission. I would describe the many ways that this is wrong, but I am so stunned by it that my brain is not able to form the words needed. So let me just put it this way: this is 100% bad. And I mean “bad” as in “laws were broken and morals and common sense were disregarded.” Bad bad bad. No good. All bad.
For their part, the hospital has released the following statement:
An incident occurred in one of our patient care units (not labor and delivery) on Friday involving two patients, one of them a pediatric patient. While we cannot go into details because of patient privacy laws, two of our nurses acted immediately, followed all protocols, and rapidly brought the situation under control. Because of their quick work, all patients remained safe. Our nurses quickly secured the pediatric patient and mother and fully cooperated with police, who declined to take action against anyone. We are grateful that everyone is safe, and we wish everyone the best and continued good health.
Obviously, they have a different version of what happened. That’s not a surprise, though there is no reason right now to think that Snyder made up the details about the nurses’ reactions. Also, the fact that Snyder “declined to take action against anyone” means nothing. She had a sick infant and was probably too shocked, confused, and relieved to think about pressing charges at the time. It shouldn’t be on this patient to decide whether or not action needed to be taken. If this happened the way Snyder says it did then it is so egregious that the hospital should be on its hands and knees begging for her forgiveness and firing everybody.
In the meantime, Snyder (whose daughter was eventually diagnosed with a milk allergy) is grateful to have Lorelai safe at home. “We were lucky. Many parents do not get as lucky as we have. Child Abduction isn’t something that should be so easily dismissed.”
|
Three-dimensional virtual refocusing of fluorescence microscopy images using deep learning.
We demonstrate that a deep neural network can be trained to virtually refocus a two-dimensional fluorescence image onto user-defined three-dimensional (3D) surfaces within the sample. Using this method, termed Deep-Z, we imaged the neuronal activity of a Caenorhabditis elegans worm in 3D using a time sequence of fluorescence images acquired at a single focal plane, digitally increasing the depth-of-field by 20-fold without any axial scanning, additional hardware or a trade-off of imaging resolution and speed. Furthermore, we demonstrate that this approach can correct for sample drift, tilt and other aberrations, all digitally performed after the acquisition of a single fluorescence image. This framework also cross-connects different imaging modalities to each other, enabling 3D refocusing of a single wide-field fluorescence image to match confocal microscopy images acquired at different sample planes. Deep-Z has the potential to improve volumetric imaging speed while reducing challenges relating to sample drift, aberration and defocusing that are associated with standard 3D fluorescence microscopy.
|
A post hoc analysis of d-threo-methylphenidate hydrochloride (focalin) versus d,l-threo-methylphenidate hydrochloride (ritalin).
To evaluate clinical measures of the benefit/risk ratio in a post hoc analysis of a clinical trial of d-threo-methylphenidate hydrochloride (d-MPH) and d,l-threo-methylphenidate hydrochloride (d,l-MPH). Data from a phase III clinical trial was used to compare equimolar doses of d-MPH and d,l-MPH treatment for attention-deficit/hyperactivity disorder (ADHD) on clinician ratings of improvement/deterioration, teacher ratings of remission, and duration of action. d-MPH was clinically and statistically significantly superior to d,l-MPH on clinician's dimensional ratings of global improvement, teacher ratings of remission of ADHD symptoms and parent 6:00 p.m. ADHD symptom ratings. No treatment differences were observed for symptom ratings at 3:00 p.m. and for 6:00 p.m. math test performance. The results suggest that the two drugs may have distinct profiles on the measures analyzed. Because d-MPH may have be more than twice the potency of d,l-MPH, the differences reported here are only applicable to the doses of the study drugs involved in the clinical trial. The results are limited by the exploratory nature of our analysis, small samples, and multiple analyses. The findings are suggestive that further study is warranted to look at these differences prospectively but cannot be used to draw clinical conclusions at this time.
|
35 Md. App. 572 (1977)
371 A.2d 706
NATHAN M. HARRIS ET AL.
v.
MAYOR AND CITY COUNCIL OF BALTIMORE ET AL.
No. 723, September Term, 1976.
Court of Special Appeals of Maryland.
Decided April 12, 1977.
The cause was argued before DAVIDSON, MELVIN and LISS, JJ.
*573 Jonathan A. Azrael, with whom were Azrael & Gann on the brief, for appellants.
John N. Spector, with whom were Benjamin L. Brown and William Hughes on the brief, for appellee Mayor and City Council of Baltimore. Mark Pollak, with whom were Kenneth A. Reich and Donald F. Burke on the brief, for other appellees.
LISS, J., delivered the opinion of the Court.
This appeal concerns itself with the hotly contested and long delayed effort of the Mayor and City Council of Baltimore to "rollback" the occupancy of non-conforming multiple family structures which were converted to four or more dwelling units.
The appellants include Nathan Harris and a number of other multiple family dwelling owners and the Property Owners Association of Baltimore, Inc. The appellees, in addition to the City, include a number of intervenors (neighborhood improvement associations and other property owners in the affected areas) who sought and were granted permission to intervene as defendants in the trial court. They are represented by counsel who participated in the preparation and presentation of this case to this Court; their position is essentially the same as that urged by the City.
The appellants filed a bill for declaratory judgment and injunctive relief seeking to prevent the City from enforcing certain rezoning ordinances enacted by the City on the grounds that the ordinances were unconstitutional and void under the Fourteenth Amendment to the Constitution of the United States, and under Article 23 of the Declaration of Rights of the Maryland Constitution in that the ordinances were an arbitrary, unreasonable and capricious exercise of the police powers of the City; and further that the effect of the ordinances amounted to a taking of property without due process of law, and without payment of just compensation. In the alternative, if the ordinances be upheld as constitutional, the appellees requested that the court declare the effective dates of the ordinances to be July 2, 1976 and *574 April 20, 1979, and that the City be enjoined from enforcing the ordinances prior to those dates. The case was heard in the Circuit Court of Baltimore City before Judge Harry A. Cole who issued a well reasoned memorandum opinion in which he declared the ordinance to be constitutional and denied the prayer for injunctive relief. It is from these findings and the order implementing them that this appeal was taken. We agree with the conclusions of the trial court and shall affirm.
There are two questions raised by the appellants for our determination.
I. (a) Is the termination and rollback of non-conforming dwelling units required by the rezoning ordinances, as adopted by the City, a valid exercise of the City's police power?
(b) Is the rollback provision an unconstitutional taking of property without due process and without just compensation?
II. Are the classifications established by the rollback ordinances reasonable and valid?
I. (a)
In April, 1962, the Mayor and City Council of Baltimore adopted Ordinance No. 1162 known as the rollback ordinance. The purpose of its enactment as stated in new Section 13A to Article 40 of the Baltimore City Code was to prevent the extension, expansion or enlargement of non-conforming uses of land, building or structure and to provide a time limit or tolerance period during which the non-conforming uses were to be extinguished or rolled back.
The rollback provisions were applicable to structures non-conforming as to density limitations in those residential districts zoned R-8, R-9 and R-10. These areas are the densest residential districts permitted in Baltimore City and are concentrated in the inner-city neighborhoods. Such neighborhoods as Bolton Hill, Harlem Park, Locust Point, Federal Hill and Charles Village were affected by the ordinance. It is to be noted that extensive renewal and *575 redevelopment of the areas was contemplated at the time of the adoption of the ordinance and has occurred in the intervening decade and a half.
Ordinance No. 1162 was the response of the Mayor and City Council of Baltimore to a study, review and report of a previously appointed Zoning Commission which had reported that the existing zoning ordinance had permitted large areas of the City to suffer overcrowding, and that "overcrowding of dwellings and excessive population densities are among the prime causes of the deterioration of residential areas and the creation of slums."[1] The rollback provisions were specifically designed to overcome some of the problems created by the conversion of structures to multi-family use.
Ordinance No. 1162 was amended by the Mayor and City Council on July 2, 1968 by Ordinance No. 153 which extended the tolerance period for the rollback of non-conforming uses from five to eight years.
On April 20, 1971 the City adopted the new comprehensive zoning ordinance, No. 1051, Section 8.0-5e (2), which provided:
"Termination of Non-Complying Dwelling Units. The number of dwelling units in a structure non-complying as to the minimum lot area requirements of Sections 4.8-2, 4.9-2 and 4.10-2 of this ordinance, which structure is located in an R-8, R-9 or R-10 District and has been converted at any time, whether with or without Board authorization, for four or more dwelling units, shall be reduced and comply with the provisions of the aforesaid Sections 4.8-2, 4.9-2 and 4.10-2 not later than eight years after the effective date of this subsection. Provided, further, that when a district is hereafter reclassified as R-8, R-9 or R-10, the number of dwelling units in any structure non-complying as to the minimum lot area requirements of Sections *576 4.8-2, 4.9-2 and 4.10-2, as hereinbefore provided, shall be reduced and comply with the provisions of Sections 4.8-2, 4.9-2 and 4.10-2 within eight years after the effective date of the reclassification. Notwithstanding the provisions of this subsection, however, the Board may authorize the continuance of a non-complying dwelling unit or units in any such non-complying structure in accordance with the authority and procedures established in Section 8.0-7 of this chapter."
Section 8.0-7d of the latter ordinance provided:
"Notwithstanding any other provision of this chapter, where any use is required to be terminated under this ordinance and was also required to be terminated or made conforming under any prior ordinance of the Mayor and City Council, the prior ordinance shall govern as to the date of such termination."
In summary, the original rollback ordinance established minimum lot sizes per dwelling unit and required owners of buildings which had been converted to four or more dwelling units to reduce the number of dwelling units to comply with the established lot size. Buildings which had not been so converted, but which were originally built to contain more than four dwelling units, were not required to comply, and buildings which contained three or fewer dwelling units were likewise exempt, regardless of whether or not these buildings conformed to the minimum lot size. Adherence to the rollback provisions was originally required within five years from the effective date, or April 4, 1967. Ordinance No. 153 extended the date of mandatory compliance from five to eight years. The City recodified its zoning ordinance (1051) effective April 20, 1971, and the rollback provisions were reenacted in that ordinance.
Enforcement of the rollback provisions by the City was not begun until 1972 after the adoption of the new comprehensive zoning ordinance. All of the complaining *577 parties have agreed and stipulated that they own properties which were converted to four or more dwelling units, located in B or C area districts, and that each has been notified by the City that the properties are in violation of Section 8.0-5e (2) of the zoning ordinance, and that the use of one or more dwelling units in each of said properties must be terminated.
The case was submitted to the trial court without "live" testimony and each side presented its case through the affidavits and exhibits of expert witnesses. Both sides waived cross-examination of the experts.
The general rule is that zoning ordinances are entitled to a presumption of constitutional validity and that the burden is upon the party attacking the ordinance to establish clearly its unconstitutionality. Lucky Stores v. Board of Appeals, 270 Md. 513, 312 A.2d 758 (1970); Gino's of Maryland, Inc. v. Mayor and City Council of Baltimore, 250 Md. 621, 244 A.2d 218 (1968); Eutaw Enterprises, Inc. v. Mayor and City Council of Baltimore, 241 Md. 686, 217 A.2d 348 (1966). To prevail the appellants must demonstrate that there is no "real and substantial relation" between the statute or ordinance and the purposes for which it was enacted. Bowie Inn v. City of Bowie, 274 Md. 230, 335 A.2d 679 (1975); Maryland Board of Pharmacy v. Sav-A-Lot, Inc., 270 Md. 103, 311 A.2d 242 (1973).
The appellants concede the City's power to require the termination of non-conforming dwelling units for the purposes set out in the rollback ordinance, i.e., to remove the adverse effect of non-conforming uses on the orderly development, maintenance and taxable value of other property in the area and to substitute therefor the benefits from a substantial uniformity of permitted uses. They contend that the ordinances at issue are an unlawful exercise of the City's zoning (police) power and a violation of due process in that they constitute a taking of the appellant's property without just compensation.
The issue of the phaseout of non-conforming uses was first presented to the Court of Appeals in Grant v. Mayor and City Council of Baltimore, 212 Md. 301, 129 A.2d 363 *578 (1957). In that case the Court had before it an ordinance which required the removal of non-conforming billboards from residential neighborhoods within a five-year period. Judge Hammond (later Chief Judge) in a comprehensively researched opinion discussed the philosophy of the phaseout of non-conforming uses.
"Nonconforming uses have been a problem since the inception of zoning. Originally they were not regarded as serious handicaps to its effective operation; it was felt they would be few and likely to be eliminated by the passage of time and restrictions on their expansion. For these reasons and because it was thought that to require immediate cessation would be harsh and unreasonable, a deprivation of rights in property out of proportion to the public benefits to be obtained and, so, unconstitutional, and finally a red flag to property owners at a time when strong opposition might have jeopardized the chance of any zoning, most, if not all, zoning ordinances provided that lawful uses existing on the effective date of the law could continue although such uses could not thereafter be begun. Nevertheless, the earnest aim and ultimate purpose of zoning was and is to reduce nonconformance to conformance as speedily as possible with due regard to the legitimate interests of all concerned, and the ordinances forbid or limit expansion of nonconforming uses and forfeit the right to them upon abandonment of the use or the destruction of the improvements housing the use." (citations omitted) 212 Md. at 307.
It is generally held that it is unreasonable and unconstitutional for a zoning law to require immediate cessation of non-conforming uses otherwise lawful. Amereihn v. Kotras, 194 Md. 591, 71 A.2d 865 (1950); Anne Arundel County v. Snyder, 186 Md. 342, 46 A.2d 689 (1946); Des Jardin v. Town of Greenfield, 262 Wis. 43, 53 N.W.2d 784 (1952); Standard Oil Co. v. City of Bowling Green, 244 *579 Ky. 362, 50 S.W.2d 960, 86 A.L.R. 648 (1932); Jones v. City of Los Angeles, 211 Cal. 304, 295 P. 14 (1931).
The opinion in Grant indicated, at least at that time, that there was some divergence of opinion as to whether a law requiring cessation of non-conforming uses after the expiration of a tolerance or amortization period was constitutional. 212 Md. at 309 n. 2. The Maryland courts adopted the view that the elimination of existing non-conforming uses within a reasonable time and with the use of a reasonable amortization scheme provided an equitable means of reconciliation of due process requirements. Grant was followed and reaffirmed by Shifflett v. Baltimore County, 247 Md. 151, 230 A.2d 310 (1967) (two year phaseout non-conforming junkyards); Eutaw Enterprises, Inc. v. Mayor and City Council of Baltimore, supra (18 months phaseout of non-conforming check cashing services); Gough v. Board of Zoning Appeals, 21 Md. App. 697, 321 A.2d 315 (1974) (two year phaseout for all non-conforming uses conducted on open land not utilizing permanent buildings or structures). These cases establish the general validity of the amortization method of terminating non-conforming uses in Maryland. We hold that the scheme adopted by the Mayor and City Council for the rollback of non-conforming uses, as provided in the instant ordinances, was a valid exercise of the police power of the City of Baltimore.
I. (b)
We are next required to consider whether the amortization scheme, as adopted in the rollback provisions in these rezoning ordinances, amount to an unconstitutional taking of property without due process and without just compensation.
Appellants urge that Harbison v. City of Buffalo, 4 N.Y.2d 553, 176 N.Y.S.2d 598, 152 N.E.2d 42 (1958), accurately states the law with respect to amortization wherein the New York Court of Appeals said:
"With regard to prior nonconforming structures, reasonable termination periods based upon the *580 amortized life of the structure are not, in our opinion, unconstitutional. They do not compel the immediate destruction of the improvements, but envision and allow for their normal life without extensive alterations or repairs. Such a regulation is akin to those we have sustained relating to restrictions upon the extension or substantial repair or replacement of prior nonconforming structures.
As to prior nonconforming uses ... [the] rule is analogous to that with respect to nonconforming structures. In ascertaining the reasonable period during which an owner of property must be allowed to continue a nonconforming use, a balance must be found between social harm and private injury. We cannot say that a legislative body may not in any case, after consideration of the factors involved, conclude that the termination of a use after a period of time sufficient to allow a property owner an opportunity to amortize his investment and make other plans is a valid method of solving the problem." 4 N.Y.2d at 561-62, 176 N.Y.S.2d at 604-05, 152 N.E.2d at 46.
Where the amortization period is unreasonable, the statutes requiring termination of non-conforming uses have been held unconstitutional. See, e.g., McCaslin v. City of Monterey Park, 163 Cal. App.2d 339, 329 P.2d 522 (1958); City of LaMesa v. Tweed & Gambrell Planing Mill, 146 Cal. App.2d 762, 304 P.2d 803 (1956); O'Connor v. City of Moscow, 69 Idaho 37, 202 P.2d 401 (1949); Standard Oil Co. v. City of Bowling Green, supra. We agree that this correctly states the law. The fallacy in appellants' argument, however, arises out of their error in assuming which "investment" was to be amortized. Appellants' experts assumed that their "investment" was the acquisition price of the property and that the proper time frame to be considered should be based on (i) an amortization of the acquisition price over the useful life of the building or (ii) the period of depreciation. The "investment" in these rollback cases is not the entire cost of *581 the structure (since all but the non-conforming uses will continue to have a useful life), but the cost to be amortized is the original cost of converting the excess non-conforming units. Nor is the amortization period intended to provide an owner with an opportunity to depreciate fully the value of his property. See Art Neon Co. v. City and County of Denver, 488 F.2d 118 (10th Cir.1973), cert. denied, 417 U.S. 932 (1974). As Judge Prescott of the Court of Appeals said in Stevens v. City of Salisbury, 240 Md. 556, 570-71, 214 A.2d 775, 783 (1965):
"True amortization provisions almost if not universally call for a termination of non-conforming uses after the lapse of a reasonable, specified period in order that the owner may amortize his investment (the reasonableness of the period depends upon the nature of the non-conforming use, the structures thereon, and the investment therein) ...."
We are not restricted in our consideration to the reasonableness of the original five year amortization period or its later extension by ordinance to eight years. The passage of time has now extended that period to almost fifteen years since the enactment of the original rollback ordinance. The non-conforming uses undoubtedly existed for a number of years prior to the passage of the ordinance.
Judge Cole in his findings of fact stated:
"The complainants have not persuaded this court that the useful life of their structures is so much longer than 13 years, or that the necessary expenditures that they would make for the normal maintenance of their properties over 13 years is so much less than the cost of alteration to conform to the new minimum lot sizes, that the rollback provisions have made the complainants victims of an unconstitutional confiscation of their property. Indeed, the complainants' losses are even further reduced by the possibilities of increased tax benefits due to the depreciation on, and business *582 investment in, their properties and even further by the possibility of increased rents collectible on the enlarged apartments in the buildings they own."
We have before us then ordinances which have already provided for those holders of non-conforming uses in the buildings affected an amortization period of fifteen years. We cannot hold that this period is not constitutionally sufficient to avoid the appellants' contention that the ordinance amounts to an unlawful taking of property without due process and just compensation.
There is one other saving grace in the ordinance as adopted. The Zoning Board of Baltimore City is authorized by Chapter 8.0-7b (6) of the ordinance to grant the continuance of a non-conforming dwelling unit or units in a non-complying structure located in the areas covered by the rollback provisions subject to specific criteria set out in the ordinance. The stated purpose of this grant of authority is to effect substantial justice not only for the property owner affected by the rollback ordinance but also for the value, utilization, enjoyment and ultimate development of neighboring properties. Cases of individual hardship can be resolved under this section of the zoning ordinance.
In light of the presumption of constitutionality of the ordinances here considered and the conclusions of fact reached by the chancellor we believe the phasing out of the non-conforming uses over the amortization period existing in this case is a constitutional exercise of the police power of the City.
As a corollary to their argument on this issue, the appellants contend that the termination of the non-conforming dwelling units imposed by Section 8.0-5e (2) requires that they destroy, reduce and/or remove their own property at their own expense, without payment or just compensation. They offer in support of this theory Leet v. Montgomery County, 264 Md. 606, 287 A.2d 491 (1972), and Stevens v. City of Salisbury, supra.
We believe these cases to be factually inapposite. In Salisbury an ordinance was passed which attempted to clear *583 an obstruction of view at intersections by setting up an "amortization" scheme for the phasing out of non-conforming uses. The ordinance required the property owners to grade and remove excess soil and structures above a certain height, regardless of how much grading was required and without regard to whether the excess ground elevation resulted from natural causes or from lawful and permissible manmade changes. The Court held this portion of the ordinance unconstitutional because in its opinion the facts did not create a true case of amortization. No such factual situation arises in this case where the controversy is over the period of amortization rather than the existence of an amortization scheme. Leet is also inapplicable. In that case the Court had before it a local ordinance which attempted to make a property owner liable to remove from his property, at his expense, abandoned motor vehicles left by trespassers without his knowledge or consent. In no way did this case concern itself with non-conforming uses or with the amortization of these uses.
We find no merit in this contention.
II.
Appellants make a final attack on the constitutionality of the ordinances on the ground that the classifications established are arbitrary and unreasonable. We do not agree.
The Maryland Court of Appeals has consistently held that the question of classification is primarily one for the legislature to decide and courts will not intervene unless that classification is clearly unreasonable or arbitrary. McBriety v. Mayor and City Council of Baltimore, 219 Md. 223, 148 A.2d 408 (1959); Bevard v. Baughman, 167 Md. 55, 173 A. 40 (1934). Judge Cole correctly stated the standards by which a classification is tested to be:
"1. The equal protection clause of the Fourteenth Amendment does not take from the State the power to classify in the adoption of police laws, but admits of the exercise of a wide scope of discretion in that regard, and avoids what is done only when it is *584 without any reasonable basis and therefore is purely arbitrary.
2. A classification having some reasonable basis does not offend against that clause merely because it is not made with mathematical nicety or because in practice it results in some inequality.
3. When the classification in such a law is called in question, if any state of facts reasonably can be conceived that would sustain it, the existence of that state of facts at the time the law was enacted must be assumed.
4. One who assails the classification in such a law must carry the burden of showing that it does not rest upon any reasonable basis, but is essentially arbitrary." Administrator, Motor Vehicle Administration v. Vogt, 267 Md. 660, 671, 299 A.2d 1, 7 (1973), quoting Lindsley v. Natural Carbonic Gas Co., 220 U.S. 61, 31 S.Ct. 337, 55 L.Ed. 369 (1911).
In assessing the reasonableness of the ordinance's distinction between converted and non-converted structures the trial court was persuaded by statement of James Dembeck, one of the City's witnesses, who in his affidavit stated:
"It was also recognized that the greatest problems were with structures that were converted to and contained four or more dwelling units. Although there were some structures that exceeded density limits and contained three or less dwelling units, it was my feeling and that of the Commission that these particular buildings were not generally overcrowded and that the number of problem-creating buildings in this category was insignificant."
The rollback ordinance creates a class of buildings; those converted to four or more units, and treats that class uniformly by requiring rollback to the original number of *585 units constructed or the number of units permitted by law, whichever is greater. There is no requirement that the legislative body treat a problem exhaustively and it may legally leave for a later time other problems of density and overcrowding. Dandridge v. Williams, 397 U.S. 471, 90 S.Ct. 1153, 25 L.Ed.2d 491 (1970). As was said in City of New Orleans v. Dukes, 427 U.S. 297, 96 S.Ct. 2513, 2517, 49 L.Ed.2d 511 (1976):
"Legislatures may implement their program step-by-step ... in such economic areas, adopting regulations that only ameliorate a perceived evil and deferring complete elimination of the evil to future regulations." (citations omitted)
The purpose of the rollback provision as stated by the Zoning Commission is to alleviate urban blight and to check the proliferation of overcrowded slum conditions in Baltimore City. We believe the classification established by the Mayor and City Council was a reasonable legislative classification enacted in pursuance of the purposes sought to be accomplished. We find the classification violates no fundamental personal rights and is based upon no suspect distinctions such as race, religion or alienage, and that it was a valid exercise of the police power of the Mayor and City Council of Baltimore.
Order affirmed.
Costs to be paid by appellants.
NOTES
[1] Zoning Commission, New Zoning for Baltimore (1962), p. 1.
|
Unilateral acute retinal necrosis occurring 2 years after herpes simplex type 1 encephalitis.
Acute retinal necrosis (ARN) syndrome is known to occur occasionally in association with or shortly after herpetic encephalitis. We describe a patient with unilateral ARN occurring 2 years after herpes simplex virus (HSV) type 1 encephalitis. A 49-year-old man presented with unilateral visual loss. He had a history of HSV-1 encephalitis 2 years previously, and had been successfully treated without a subsequent recurrence. The ophthalmologic findings were all consistent with the ARN syndrome. The same type 1 HSV was identified from ocular fluid as was identified from the patient's cerebrospinal fluid 2 years ago. There was no evidence of a recurrence of encephalitis. This case suggests that following encephalitis retinal neurons may function as a reservoir for latent HSV-1, that can be reactivated to cause ARN in situ several years later.
|
Psychological study of cleft palate children with or without cleft lip by kinetic family drawing.
To clarify how cleft palate children with or without cleft lip perceive their family, we applied the Kinetic Family Drawing (KFD) technique to 60 cleft palate children (with or without cleft lip). The children were aged 7-9 years (in the 1-3 grade of elementary school) and attended the Department of Oral Surgery, Nagoya University Hospital, between 1990 and 1997. Controls consisted of 100 normal elementary school children of the same age. Major findings were: (1) Compared with normal children, cleft lip and palate boys and cleft palate only girls drew their self-images significantly more often in region D (lower right) and in region A (upper left), respectively. (2) Cleft palate children with or without cleft lip felt anxiety and fear toward their family, rarely viewing their homes as a restful place; this suggested insecurity. Uniquely dynamic relations were also suggested in their homes. (3) Cleft palate children with or without cleft lip often perceived their father or mother as persons easily acceptable in society. Rather remote psychological distance between parents and cleft palate children with or without cleft lip was suggested.
|
This invention relates generally to a heat actuated fuse and to an apparatus which incorporates such a fuse for protecting electrical circuitry. The invention is particularly useful for interrupting current flow to thick film circuits and components.
A heat actuated fuse has an important advantage over the more common current actuated fuse. Although both types of fuses ultimately open at a predetermined temperature, a heat actuated fuse can be positioned such that it responds directly to the temperature of a protected component or circuit, and temperature is often a better indicator of imminent failure than current. Examples of known heat actuated fuses are described in Great Britain Patent 2,145,295A and U.S. Pat. Nos. 4,533,896, 5,084,691, and 5,097,247.
Great Britain Patent 2,145,295A discloses a thermal fuse disposed on a substrate nearby a resistor, which is also disposed on the substrate. The fuse includes a pair of electrodes defining a gap between them, a gold fuse link extending across the gap to electrically interconnect the electrodes, and a film of solder overlying the gold fuse link and overlapping at least one of the electrodes. When the temperature of the substrate exceeds the melting point of the solder film, the solder is intended to melt, dissolve the gold fuse link, and then retreat from the gap with the dissolved gold to sever the electrical connection between the electrodes.
This fuse is relatively simple to manufacture, but its reliability depends on thorough dissolution of the gold fuse link by the process of leaching. This is a gradual process which begins after the film of solder melts. The gold fuse link then dissolves and is attracted to tin in the solder. The speed of opening of this fuse is relatively slow, and the solder material is limited to a composition containing tin or whatever material will effectively leach the gold or other metal chosen for the fuse link.
U.S. Pat. No. 4,533,86 discloses a fuse for protecting thick film devices deposited on a substrate. The fuse includes two terminal clocks, each including a hole, which are mounted to the substrate in close proximity to each other and with the holes aligned. An electrically conductive fusible link (e.g., solder) is suspended across a space between the terminal blocks and extends into the holes to complete an electrical circuit. The holes are larger than necessary to accept the fusible link so that, when the fusible link melts because of excessive heat, molten material from the fusible link will be drawn into the holes.
Manufacture of this fuse is a complicated and labor intensive process. Manufacture requires boring of holes in the terminal blocks, coating the inner surfaces of the holes and the end surfaces of the terminal blocks with solder, assembling the blocks and fusible link, and then positioning and soldering the assembled fuse onto electrodes provided on the substrate.
U.S. Pat. No. 5,084,691 discloses a thermal fuse comprising a pair of silver conductive pads and a solderable and/or meltable electrically conductive bar extending between the conductive pads. When a conductive bar is applied between the conductive pads, a solder mass structure is applied to the conductive pads, a solder paste is applied through a stencil, and the solder is then heated to provide a connection to the conductive pads. In alternate cases, a solder preform is applied as the fuse element. In this case, the ends of the solder preform are soldered directly to the conductor pads, without the use of a layer of solder paste on the electrodes.
Again, the reliability of this fuse substantially depends on the dissolution of the conductive pads by the process of leaching of the silver material. This is a gradual process which begins only after the fuse is activated. The silver in the pads dissolves to increase the gap when the fuse is activated. The speed of opening of this fuse, therefore, is relatively slow. Furthermore, both the solder material and conductive pad materials are limited to certain defined compositions.
U.S. Pat. No. 5,097,247 discloses an arrangement of materials which function as a fuse and can be deposited on an electrically insulating substrate, using standard printed circuit fabrication techniques. First and second electrodes are disposed on the substrate, defining a gap therebetween. A layer of first solder paste material, having a melting temperature higher than the actuation temperature of the fuse is disposed on at least one of the electrodes. A conductive link disposed on at least a portion of each electrode and on the substrate extends across the gap to provide an electrical connection between the electrodes. The conductive link is comprised of a second solder paste material which has a melting temperature substantially corresponding to the actuation temperature of the fuse.
The melting temperature of the second solder paste, however, necessitates an inert, nitrogen or otherwise non-oxidizing atmosphere during manufacture. Depending upon the circuit board to which the fuse is attached and how the board is processed, the paste may reflow and inadvertently open the fuse.
Accordingly, there are a number of problems and drawbacks to the present technology. There is a need for a fuse and/or a method of manufacture to meet the requirements described above, as well as others known to those skilled in the art.
It is an object of the invention to provide a heat actuated fuse which opens reliably and quickly, but not at process temperatures.
It is another object of the invention to provide such a fuse which can be manufactured simply to open within a wide range of temperatures.
It is yet another object of the invention top provide apparatus incorporating one or more of such fuses for protecting circuitry including one or more electrical elements.
It can also be an object of the present invention to provide a thermal fuse using a solder paste to tin an underlying metal pattern and/or to control the dimensional coverage of the paste and permit further screen printing.
It can also be an object of this invention to provide a thermal fuse prepared using a solder paste and a solder portion and/or chip using standard and/or modified thick film high bred printing technology.
It can also be an object of the present invention to provide a thermal fuse and/or method of preparing the same, such that circuit density is increased.
It can also be an object of the present invention to provide a thermal fuse and/or method of preparing the same, such that the thermal characteristics of the fuse are improved and the solder contact with the substrate is enhanced.
It can also be an object of the present invention to provide a thermal fuse having a preformed solder portion.
It can also be an object of the present invention to provide a method for preparing a thermal fuse without manual attachment of a solder wire and/or without a fluxing operation.
It can also be an object of the present invention to provide a method for preparing a thermal fuse using a removable solder to bond a second solder portion and/or chip to a substrate.
It will be understood by those skilled in the art that one or more aspects of this invention can meet certain objectives, while one or more other aspects can meet certain other objectives. Each objective may not apply equally, in all instances, to every aspect of the present invention. In this regard, the aforementioned objectsxe2x80x94as well as those aspects and features which followxe2x80x94can be viewed in the alternative with respect to any one aspect of the present invention.
Other objects, features and advantages of the present invention will be apparent from this summary and will be readily apparent to those skilled in the art having knowledge of thermal fuse and thick film technology. Other objects, features, benefits and advantages will be apparent from the above as taken into conjunction with the accompanying examples, figures, tables, data and all reasonable inferences to be drawn therefrom.
In accordance with the invention, a heat actuated fuse for opening at a predetermined temperature comprises an arrangement of materials which can be deposited on an electrically insulating substrate by commonly used printed circuit fabrication techniques. First and second electrodes of electrically conductive material are disposed on the substrate in a spaced relationship to define a gap between the electrodes. A layer of a first solder material is disposed on at least one of the electrodes. A conductive solder portion and/or chip is disposed on at least a portion of each electrode and on the substrate and extends across the gap to provide an electrical connection between the electrodes. The conductive portion/chip comprises a predetermined preformed quantity of a non-paste solder material preferably comprising a flux core solder material, which is in contact with the first solder layers on the electrodes. In alternate applications, a second attachment layer of solder can also be used to attach the conductive solder portion and/or chip to the first layer of solder.
Because different solder materials having a large range of respective melting temperatures are readily available, the fuse can be constructed to open at any temperature within a correspondingly large range. The melting temperature of the conductive portion/chip corresponds to the actuation temperature of the fuse. In some applications, the melting temperature of the first layer and optional second layer of solder material used in constructing the thermal fuse are the same or substantially the same as the actuation temperature of the fuse. In alternate applications, the first and optional second layers of solder can have melting temperatures lower than or greater than the actuation temperature of the fuse.
A quantity of flux-containing material can be disposed in contact with the conductive solder portion/chip to effect a rapid and reliable flow of the conducting portion/chip to the first and second electrodes, when the fuse is heated to its actuation temperature. As noted above, however, the conductive solder portion and/or chip can comprise a flux core material. When material of this type is used, the amount of external flux used can be reduced or the external flux can be eliminated.
In another embodiment of the invention, a resistive device is disposed proximate the fuse for effecting heating of the fuse in response to an electrical current passed through the device. Various advantages can be achieved by utilizing such means, independent of the protected circuit element(s), for heating the fuse. For example, by electrically connecting and physically disposing the resistive device such that it is subjected to the same electrical and environmental conditions as the circuitry protected by the fuse, freedom is achieved in the placement of the circuit element(s). Also, types of circuit elements which cannot, without destruction, produce sufficient heat to melt the fusible portion/chip may be protected.
The non-paste solder portion/chip of this invention precludes the need for an inert, nitrogen or otherwise non-oxidizing atmosphere during manufacture. The higher melting point associated with such a solder material can prevent opening the fuse during reflow of the circuit board associated therewith.
|
Lyrics 作詞 : Shi Jun Wei 史俊威
Composer 作曲 : Shi Jun Wei 史俊威
Producer 編曲 : Xu Qian Xiu 徐千秀
這條路 好漫長 時光逼著我們長大
On the long road of life, passing time forces us to grow old
好多話 不能講 只有把酒言歡地藏
So many words remain unsaid, even those drunken truths remain hidden in your heart
這世界 說大不大
This world isn’t as big as it seems
一生能有多少的失望
How much disappointment can fill one life?
一人能裝多少的希望
How much hope can fill one person?
我最盼望有一雙翅膀
My greatest wish is to grow wings
能夠帶我飛離這城牆 讓我們 都一樣
To fly over these city walls until we all look the same
停不了對夢想的渴望
If you can’t bear to give up on your dreams
那就放膽一搏再去闖一闖
Then gather up your courage to try again
Tomorrow will be fine.
Tomorrow I’ll be fine.
Tomorrow we’ll be fine.
黑夜裡 的亮光 放在心裡自問自答
The light in the dark makes me question myself
對不起 我好傻 並不只是一句氣話
“I’m sorry” “It’s all my fault” are more than angry words
再一起 地老天荒
Let’s stay together until the world ends
一生能有多少個願望
How many possibilities can one life hold?
我最盼望有一雙翅膀
My greatest wish is to grow wings
能夠帶我飛離這城牆 讓我們 都一樣
To fly over these city walls until we all look the same
停不了對夢想的渴望
If you can’t bear to give up on your dreams
那就放膽一搏再去闖一闖
Then gather up your courage to try again
Tomorrow will be fine.
Tomorrow I’ll be fine.
Tomorrow we’ll be fine.
穿過雲間的光照在人間
That’s what we promised each other after all
這是我們宣告的信念
To fly above the clouds and shine
我最盼望有一雙翅膀
My greatest wish is to grow wings
能夠帶我飛離這城牆 讓我們 都一樣
To fly over these city walls until we all look the same
停不了對夢想的渴望
If you can’t bear to give up on your dreams
那就放膽一搏再去闖一闖
Then gather up your courage to try again
Tomorrow will be fine.
Tomorrow I’ll be fine.
Tomorrow we’ll be fine.
|
As soon as summer hits, Zinnias start to open up and show off their bright, bold colors. And with them comes a steady stream of butterflies: swallowtails, monarchs, painted ladies, and much more. Zinnias are one of the easiest annual wildflowers to grow from seed and one of our favorite plants for a… Read More →
Whether you’re hosting an event or looking for a unique business mailing, seed packets are the perfect choice. The easy-to-grow seeds inside help the earth and keep your event or business in front of mind all season long.
As soon as summer hits, Zinnias start to open up and show off their bright, bold colors. And with them comes a steady stream of butterflies: swallowtails, monarchs, painted ladies, and much more. Zinnias are one of the easiest annual wildflowers to grow from seed and one of our favorite plants for a… Read More →
One of our most popular flowers, cosmos lights up the garden or meadow in midsummer and blooms continuously until frost. Whether you’re planting an acre with wildflowers, or adding easy color to your small space garden, cosmos are the perfect choice. With an abundance of long-lasting blooms, you’ll have plenty of flowers to cut and make gorgeous summer bouquets. Cosmos also attracts butterflies and hummingbirds to the garden. All of the seed we handle at American Meadows is non-GMO, neonicotinoid-free and guaranteed to grow. Annual. Learn More →
Also known as Blanket Flower, this native wildflower adds bold, fiery color to the summer garden or meadow. Growing to be about 12-24” tall, this bold beauty is perfect for the front of a meadow or even for adding quick, easy color to a small space garden. Plant Blanket Flower in full sun and enjoy a burst of bright, red and yellow blooms in the summer garden. All of the seed we handle at American Meadows is non-GMO, neonicotinoid-free and guaranteed to grow. Annual. Learn More →
Sunflower Autumn Beauty steals the show in the late-season garden with a mixture of warm oranges, reds and yellow. An extremely popular cut flower, make sure to plant extra to enjoy their beauty indoors. This variety is easy to grow and offers blooms from the late summer all the way into fall. Sunflower Autumn Beauty is a must-have for any sunflower lover and attracts butterflies and hummingbirds to the garden. All of the seed we handle at American Meadows is non-GMO, neonicotinoid-free and guaranteed to grow. Annual. Learn More →
Love cosmos but looking for a shorter variety? Cosmos Seeds Dwarf Mix is the perfect choice, growing to be just 2-4’ tall. Plant this colorful mixture in the front of the garden or meadow, or add to large containers in your small space or patio garden. Like all cosmos, this mixture is extremely easy to grow, attracts pollinators and blooms from summer until frost, offering up an abundance of flowers to cut and bring indoors. All of the seed we handle at American Meadows is non-GMO, neonicotinoid-free and guaranteed to grow. Annual. Learn More →
Create a unique splash of color in your meadow with Cosmos Seashells. Each petal is shaped like a seashell and will ignite the garden in just weeks after planting. The gorgeous, contrasting colors and unique shape are a true conversation starter and must-have for the wildflower gardener! Like all Cosmos, this variety is extremely easy to grow, attracts hummingbirds and butterflies, and makes for fantastic cut bouquets. All of the seed we handle at American Meadows is non-GMO, neonicotinoid-free and guaranteed to grow. Annual. Learn More →
Love Lies Bleeding is a true conversation starter in the garden or meadow – The large, maroon seed pods dangle above striking green foliage. This flower is not only extremely easy to grow and drought-tolerant, but gorgeous in dried flower arrangements. Annual. Learn More →
This Marigold mixture adds fiery color to the summer garden with bold reds, oranges and yellows. Growing to be only 12-14” tall, this mixture is great for the border of meadows, a small space garden or containers. Marigold Sparky Mix is so easy to grow that it is the perfect choice for a child’s first garden. Also, try planting Marigolds in your veggie garden to help attract beneficial insects. All of the seed we handle at American Meadows is non-GMO, neonicotinoid-free and guaranteed to grow. Annual. Learn More →
This compact Nasturtium grows into a 8" to 12" tall mound, with flowers in shades of red, dark orange, light orange, yellow, and dark red. Use in beds and borders or as a sunny groundcover. Annual.
Learn More →
A must-have for any sunflower lover, Red Sun’s vibrant, bronze/maroon petals are offset by dark centers, creating a unique statement in the summer garden. Blooming a little later in the summer and growing to be about 5-6’ tall, this Sunflower extends the bloom season with a splash of vibrant color. Red Sun is a fantastic cut flower, often lasting up to 10 days in a vase. Bonus: bees, butterflies and hummingbirds love this easy-to-pollinate variety! Learn More →
Creating huge color with classic red blooms all summer long, this Dahlia-flowering Zinnia is the perfect choice for any sunny spot in the garden or meadow. Growing to be about 30” tall, pair this beauty with other Zinnias or plant on its own for a bold, red look. Will Rogers attracts a variety of pollinators to the garden, providing nectar throughout the season. Learn More →
Full, double red blooms create a dramatic statement in the summer garden, lasting until frost. Zinnia Super Yoga Scarlet is extremely easy to grow, thriving in any sunny spot with well-draining soil. We recommend giving this variety room to grow into large, bushy plants, which will provide larger blooms for you to enjoy. Like all Zinnias, pollinators love this variety and will come to your garden or meadow for a snack throughout the season. Learn More →
Looking for an earlier start to your Cosmos blooms? The Dwarf Sensation Mix is the perfect choice, bursting in a variety of pinks and whites earlier than other varieties. Growing to be only 12” tall, plant this mixture in the garden, meadow, containers and anywhere in between. This variety is a pollinator magnet and makes for fun, bright early summer bouquets. Learn More →
Looking to create a bold statement in your meadow or garden this year? Our Cornflower Patriot Mixture blooms in red, white and blue, perfect to plant for your 4th of July celebration or any time of the season. So easy to grow, this Cornflower Mixture will grow in any sunny spot. Learn More →
Bright yellow blooms are streaked with mahogany, making this Marigold a gorgeous addition to any flower or vegetable garden. This easy-to-grow annual is perfect for a child’s first garden. Learn More →
Red Chief is a striking, scarlet variation of the favorite California Poppy. The spectacular blooms create a bold statement in the meadow planted on its own or paired with other California Poppy varieties. Annual. Learn More →
Red Cornflower is a dwarf variety that adds drama to the meadow or garden with full, red blooms. Red Cornflower is easy to grow and quick blooming. Try pairing with White and Blue Cornflower for a spectacular burst of color in just weeks! Annual. Learn More →
The Wildflowers of the Midwest
America's heartland is a combination of the ecosystems of the Great Plains and parts of the grand deciduous forests that extend into the northeast and mid-Atlantic states. Long known as the "breadbasket" of the world, the American midwest is the greatest agricultural region on the planet, and its rich soils and growing conditions make it a wonderful place to garden with wild flowers.
Optimum planting times for the region are mid-March to mid-May in spring, although you can plant as late as mid-June. Fall planting in October and November is also successful in all but the coldest regions.
Watch Our Video All About Midwest Wildflower Seed Mix:
The Safe Seed Pledge
"Agriculture and seeds provide the basis upon which our lives depend. We must protect this foundation as a safe and genetically stable source for future generations. For the benefit of all farmers, gardeners and consumers who want an alternative, We pledge that we do not knowingly buy, sell or trade genetically engineered seeds or plants.
The mechanical transfer of genetic material outside of natural reproductive methods and between genera, families or kingdoms, poses great biological risks as well as economic, political, and cultural threats. We feel that genetically engineered varieties have been insufficiently tested prior to public release. More research and testing is necessary to
further assess the potential risks of genetically engineered seeds. Further, we wish to support agricultural progress that leads to healthier soils, genetically diverse agricultural ecosystems and ultimately healthy people and communities."
We’re sorry, but the following items are currently unavailable
The following items are either out of season or we’ve sold out of our inventory. Please feel free to browse our selection and sign up for our newsletter to be notified when these products are available for next season! We often have similar items available, so please utilize our search or filters (on the left) to explore other options. Or, call us at (877) 309-7333 for help.
|
Tuesday, 27 November 2012
There is a soul of all mankind,
One entity divine.
Fed and nourished on our thoughts,
Fertilised by battles we have fought,
Enriched with the wisdom of the meek,
Scratched by the claws of the greedy elite,
Marked and branded by all that we do,
Unable to portray anything,
But me and you.
Birthed by the soul creator,
Sustained by our human nature.
Formed without a choice,
Unable to ever voice,
Dismay or despair,
Just am, being, there.
The universal soul we made,
With all we thought was erased,
All the deeds we dutifully did,
All the secrets we secretly hid,
All the lies we deemed to tell,
All the cracks upon the shell,
All the frowns and laughter lines,
Etched on it for all of time.
It is the art of our minds.
“The country needs more than a
building right now – it needs hope”
V for Vendetta
Anonymous is a group
you can be in or out of at any point you choose, there is no membership list
and like the Occupy movement, its cause is the many; from freedom on the
internet, to anti-war, anti-cuts and a stand against the ugly attack on
disability benefits as well as the control of bankers and corporate interests
over our governments.
At the demonstration on Guy Fawkes nighttalk too was of the currently breaking
news about paedophilia; the government, judiciary and BBC are blamed for
involvement and silencing of the victims over many decades and an unwillingness
to act for those still suffering .
The sea of V for Vendetta masks was an incredible sight –
anonymous yet character-full individuals of all backgrounds and for all
reasons, gathered together to make themselves heard, make the government aware
that they cannot act without witness and that these people are not going to sit
back and take it quietly.
To those still not active with Occupy, Anonymous, UK Uncut,
unions, environmental, disability and student groups – the country and indeed
the world must look like a map of markers of uprisings perhaps seeming
unconnected; they aren’t.I was
interviewed earlier in the day and asked what it was everybody was complaining
about and the interviewer observed that we “can’t just keep saying things are
wrong and not presenting a way to do it right.” My reply was:
“Each
uprising large or small, here or somewhere else is essentially the same
uprising – we the people no longer find the current system to be fit for the
way we would choose to live our lives. From Tahrir Square to Kuwait, Bahrain,
Wall Street and London – we the people KNOW what we want; social justice, a
fair crack at life for all and not just the 1% with the power and the money.
“The very vast majority of the people in the world would never choose
war as a tool of government, would never see poverty, hunger and abuse go
uncared for and would never want to inflict misery on another – yet THIS is
what our governments tolerate and even facilitate.”
So I went to join Anonymous and it was liberating to be so.
The masks have been an almost comforting presence at every Occupy event and
occasion and I wanted to support them in return; what I found was much more.
Yes. They changed me and they changed the person next to me
and others that listened. They change onlookers and viewers, they empower
individuals and those individuals – connect across the world at a level not
dictated by our politics, religion, location, wealth or status. We are united
in our anger at the way things are and in a society disconnected – this changes
everything.
I find myself amidst a society re-shuffle where instead of
gathering under our usual labels of job, gender, religion, politics and
location – we are gathering a new kind of mass made up of otherwise unrelated
individuals united by our determination to find a better way; not just for one
group, party or type but for all.
|
Over the years, insomniacs have been offered pills, plants, “mindfulness”, and even special lamps to help them get off to sleep.
But it now turns out that a far simpler solution has always been at hand, and one that is, literally, all around: the great outdoors.
New research suggests that rather than lying in bed miserably counting imaginary sheep, insomniacs should get out among some real ones and try a spot of camping.
|
Feasibility of surveillance resistance to antituberculosis drugs :Europe, 1997.
Between 28% and 100% of isolates from ten countries from the EuroTB network in 1997 were reported with data on antituberculosis drug susceptibility. Drug resistance was commoner among foreign-born patients and in general among patients who had been treate
|
India lost Rs 32 lakh crore in illicit outflows in 10yrs. This money can be used to improve public services. Read more. http://bit.ly/1RoL9a7
According to estimates by the International Monetary Fund (IMF) developing countries lose Rs 14 lakh crore (at current exchange rates) a year to tax cheating. Recent research covering 1500 MNCs in India showed that those with links to tax havens reported 1.5 % less profit.
This money could fund free quality public services, vital to fight poverty and inequality by putting virtual money in peoples’ pockets, as Oxfam research has shown- they do the opposite of what user charges do. With the final round of UN Financing for Development negotiations ongoing, these are crucial times to make our tax systems more equitable and efficient – for stronger public services, including healthcare.
Out of pocket (OOP) expenditures push an estimated 60 million Indians (six crore) into poverty every year. User charges still remain in the public healthcare delivery system. The overall public spending hovers at about 1% of GDP. Yet, increased health spending in rural India over the last decade is slowly yielding results.
Unfortunately, there are budget cuts and insurance-based initiatives towards Universal Health Coverage (UHC) being proposed that seem extremely worrying. A recent paper brought out by Oxfam India explores available evidence around financing healthcare for all in India and offers recommendations.
During 1986-87, about 60% of the hospitalised cases were treated by the government institutions across urban and rural areas. In 2004, it fell to about 40%, reflecting the poor public spending on health1 . However, the following decade saw focused attention on rural care, and most deliveries across urban and rural areas are now taking place in government hospitals as the following chart shows.
In a decade which saw government schemes across the country that offered incentives to deliveries in private sector facilities, this is a remarkable result.
Sharp Spending Cuts in India’s Latest Budget
The spending cuts by the centre- despite being accompanied by higher revenue share to states - are deeply concerning. The employment guarantee scheme saw a reduction of 3% in real terms. Allocations to the child nutrition scheme were cut by half. Total allocations for health was cut by about Rs. 6000 crore.
Budget for government’s mid-day meal scheme in schools was cut by 41%. The central government argues that cuts will be compensated by a larger allocation to states. The share of taxes to states has indeed increased in an encouraging step of fiscal devolution. However, researchers point out that poorer states who rely more on central support face net losses.
At the same time, the latest report from Global Financial Integrity found that developing countries lost Rs 422 lakh crore (at current exchange rates) in illicit financial flows in the last decade. India was among the top five countries in the world with almost Rs 32 lakh crore (at current exchange rates) in illicit outflows. Just to compare, India’s annual central outlay on health and rural housing put together is Rs 34,575 crore.
India’s tax to GDP ratio is among the lowest of all G20 countries, just above Mexico and Indonesia, and far below other BRICS (Brazil, Russia, India, China and South Africa) countries. In addition, national aggregate amount of revenue foregone due to exemptions by the central government is estimated to be 43.2 % of total tax revenue for the year 2014-15, at Rs 5.89 lakh crore.
This shows that there indeed are alternative sources that can be tapped in order to generate more resources for health. Moreover, the bigger question seems to be how these new alternative funds will be spent— will it be through an expansion of the public sector, or through an insurance-based, private sector dependant platform?
The situation seems grim: it is puzzling that policy advice that although flies in the face of evidence still carries weight within the government. Prof Arvind Panagariya, the Vice Chairperson of Niti Aayog –a think tank which just replaced India’s Planning Commission- suggests the following in a recent book:
Turning to medical service delivery, we recommend that rather than further expand the provision of free primary, secondary, and tertiary health care services in the public sector, the government must focus on providing financial resources to the poor for routine and non-routine care... Even so, if the government must insist on the provision of the services, it must do so on the full cost recovery basis.
It is highly disappointing that India’s policy elite refuses to learn from India’s own or the global experience about the disastrous effects of user charges on peoples’ lives. Echoing the Vice Chairperson’s viewpoint, Niti Aayog’s latest Working Paper on financing healthcare veers dangerously towards insurance-based solutions, Corporate Social Responsibility, and PPPs.
Thankfully, despite the clear focus on insurance based, demand-side financing measures incentivising access to private providers, rural public health infrastructure has been silently improving in the last decade, with remarkably positive results.
Government should be the primary provider of healthcare, and provision of healthcare for all should not be based on expansion of health insurance-based models focusing on hospitalisation.
A clear roadmap to enhance budgetary spending on healthcare to 3%-5% of GDP should be drawn. Public tax-based funding and contribution from the organised sector should finance healthcare and focused funding in the form of specific central transfers should be made to promote equitable access.
Regulation of the private sector must be a priority. Establishment of standard treatment protocols and empowerment of communities to hold the healthcare system accountable will be critical to ensure quality of healthcare in the public and private sectors.
A comprehensive review of Rashtriya Swasthya Bima Yojana (RSBY) and other currently fragmented government funded healthcare schemes like Central Government Health Scheme (CGHS) should be conducted with the aim of future consolidation for a national programme ensuring healthcare for all.
_____________________________________________
1Still, 60% of all people from the bottom 20% were getting hospitalised in the public sector in 2004.
Written by: Oommen C. Kurian, Research Coordinator, Oxfam India
Photo credit: Srikant Kolari
Content on this website is for general information purposes only.
Your comments are provided by your own free will and you take sole responsibility for any direct or indirect liability.
You hereby provide us with an irrevocable, unlimited, and global license for no consideration to use, reuse, delete or
publish comments, in accordance with Community Rules & Guidelines and Terms and Conditions.
Disclaimer: Please note that the products mentioned are to illustrate activities and the change that your donation can make to the lives of women, children and men. Oxfam India, based on the need on the ground, will allocate resources to areas that need funds the most.
Data Security: We take utmost precautions with your data, we will never share your information. We also do not store any sensitive information like your credit card or bank details.
|
using Shouldly.Tests.Strings;
using Xunit;
namespace Shouldly.Tests.ShouldBeOfType
{
public class BasicTypesScenario
{
[Fact]
public void BasicTypesScenarioShouldFail()
{
var one = 1;
Verify.ShouldFail(() =>
one.ShouldBeOfType<string>("Some additional context"),
errorWithSource:
@"one
should be of type
System.String
but was
System.Int32
Additional Info:
Some additional context",
errorWithoutSource:
@"1
should be of type
System.String
but was
System.Int32
Additional Info:
Some additional context");
}
[Fact]
public void ShouldPass()
{
1.ShouldBeOfType<int>();
}
}
}
|
American plastic surgery and global health: a brief history.
Access to essential surgical care in resource-poor settings is gaining recognition as a major component of international public health efforts. As evidence is mounting about the burden of surgically treatable disease in low- and middle-income countries, so too is the evidence for the significant need for plastic surgery treatment of disease rising in these areas. American plastic surgery has a long history with international surgical efforts in resource-poor regions around the world. Early experiences were not formalized until after World War II, when a foundation partnership provided a venue for interested plastic surgeons to volunteer. These efforts progressed and advanced throughout the 1960s-1970s, but were ultimately devastated by the Vietnam War. Subsequent international plastic surgical experiences by American surgeons over the last 40 years have been largely through several nongovernmental organizations. American plastic surgical involvement in global surgery has changed significantly over the last 70 years. Although quality care is being delivered to resource-poor regions around the world, many of the challenges of regionally appropriate, sustainable care persist today.
|
--- !ruby/object:RI::MethodDescription
aliases: []
block_params:
comment:
full_name: Zip::ZipFileSystem::ZipFsFile::ZipFsStat#gid
is_singleton: false
name: gid
params: ()
visibility: public
|
From 41977e86c984fcdddb454a3d7887de5d47b5f530 Mon Sep 17 00:00:00 2001
From: Roman Yeryomin <[email protected]>
Date: Tue, 21 Mar 2017 00:43:00 +0100
Subject: [PATCH 19/19] rt2x00: add support for MT7620
Basic support for MT7620 built-in wireless radio was added to
OpenWrt in r41441. It has seen some heavy cleaning and refactoring
since in order to match the Kernel's code quality standards.
Signed-off-by: Roman Yeryomin <[email protected]>
Signed-off-by: Daniel Golle <[email protected]>
Acked-by: Stanislaw Gruszka <[email protected]>
Signed-off-by: Kalle Valo <[email protected]>
---
drivers/net/wireless/ralink/rt2x00/Kconfig | 2 +-
drivers/net/wireless/ralink/rt2x00/rt2800.h | 177 +++
drivers/net/wireless/ralink/rt2x00/rt2800lib.c | 1421 +++++++++++++++++++++++-
drivers/net/wireless/ralink/rt2x00/rt2800lib.h | 4 +
drivers/net/wireless/ralink/rt2x00/rt2x00.h | 1 +
5 files changed, 1578 insertions(+), 27 deletions(-)
diff --git a/drivers/net/wireless/ralink/rt2x00/Kconfig b/drivers/net/wireless/ralink/rt2x00/Kconfig
index de62f5dcb62f..a1d1cfe214d2 100644
--- a/drivers/net/wireless/ralink/rt2x00/Kconfig
+++ b/drivers/net/wireless/ralink/rt2x00/Kconfig
@@ -210,7 +210,7 @@ endif
config RT2800SOC
tristate "Ralink WiSoC support"
depends on m
- depends on SOC_RT288X || SOC_RT305X
+ depends on SOC_RT288X || SOC_RT305X || SOC_MT7620
select RT2X00_LIB_SOC
select RT2X00_LIB_MMIO
select RT2X00_LIB_CRYPTO
diff --git a/drivers/net/wireless/ralink/rt2x00/rt2800.h b/drivers/net/wireless/ralink/rt2x00/rt2800.h
index fd1dbd956bad..6a8c93fb6a43 100644
--- a/drivers/net/wireless/ralink/rt2x00/rt2800.h
+++ b/drivers/net/wireless/ralink/rt2x00/rt2800.h
@@ -79,6 +79,7 @@
#define RF5372 0x5372
#define RF5390 0x5390
#define RF5392 0x5392
+#define RF7620 0x7620
/*
* Chipset revisions.
@@ -639,6 +640,24 @@
#define RF_CSR_CFG_BUSY FIELD32(0x00020000)
/*
+ * MT7620 RF registers (reversed order)
+ */
+#define RF_CSR_CFG_DATA_MT7620 FIELD32(0x0000ff00)
+#define RF_CSR_CFG_REGNUM_MT7620 FIELD32(0x03ff0000)
+#define RF_CSR_CFG_WRITE_MT7620 FIELD32(0x00000010)
+#define RF_CSR_CFG_BUSY_MT7620 FIELD32(0x00000001)
+
+/* undocumented registers for calibration of new MAC */
+#define RF_CONTROL0 0x0518
+#define RF_BYPASS0 0x051c
+#define RF_CONTROL1 0x0520
+#define RF_BYPASS1 0x0524
+#define RF_CONTROL2 0x0528
+#define RF_BYPASS2 0x052c
+#define RF_CONTROL3 0x0530
+#define RF_BYPASS3 0x0534
+
+/*
* EFUSE_CSR: RT30x0 EEPROM
*/
#define EFUSE_CTRL 0x0580
@@ -1022,6 +1041,16 @@
#define AUTOWAKEUP_CFG_AUTOWAKE FIELD32(0x00008000)
/*
+ * MIMO_PS_CFG: MIMO Power-save Configuration
+ */
+#define MIMO_PS_CFG 0x1210
+#define MIMO_PS_CFG_MMPS_BB_EN FIELD32(0x00000001)
+#define MIMO_PS_CFG_MMPS_RX_ANT_NUM FIELD32(0x00000006)
+#define MIMO_PS_CFG_MMPS_RF_EN FIELD32(0x00000008)
+#define MIMO_PS_CFG_RX_STBY_POL FIELD32(0x00000010)
+#define MIMO_PS_CFG_RX_RX_STBY0 FIELD32(0x00000020)
+
+/*
* EDCA_AC0_CFG:
*/
#define EDCA_AC0_CFG 0x1300
@@ -1095,6 +1124,12 @@
#define TX_PWR_CFG_0_OFDM6_CH1 FIELD32(0x00f00000)
#define TX_PWR_CFG_0_OFDM12_CH0 FIELD32(0x0f000000)
#define TX_PWR_CFG_0_OFDM12_CH1 FIELD32(0xf0000000)
+/* bits for new 2T devices */
+#define TX_PWR_CFG_0B_1MBS_2MBS FIELD32(0x000000ff)
+#define TX_PWR_CFG_0B_5MBS_11MBS FIELD32(0x0000ff00)
+#define TX_PWR_CFG_0B_6MBS_9MBS FIELD32(0x00ff0000)
+#define TX_PWR_CFG_0B_12MBS_18MBS FIELD32(0xff000000)
+
/*
* TX_PWR_CFG_1:
@@ -1117,6 +1152,11 @@
#define TX_PWR_CFG_1_MCS0_CH1 FIELD32(0x00f00000)
#define TX_PWR_CFG_1_MCS2_CH0 FIELD32(0x0f000000)
#define TX_PWR_CFG_1_MCS2_CH1 FIELD32(0xf0000000)
+/* bits for new 2T devices */
+#define TX_PWR_CFG_1B_24MBS_36MBS FIELD32(0x000000ff)
+#define TX_PWR_CFG_1B_48MBS FIELD32(0x0000ff00)
+#define TX_PWR_CFG_1B_MCS0_MCS1 FIELD32(0x00ff0000)
+#define TX_PWR_CFG_1B_MCS2_MCS3 FIELD32(0xff000000)
/*
* TX_PWR_CFG_2:
@@ -1139,6 +1179,11 @@
#define TX_PWR_CFG_2_MCS8_CH1 FIELD32(0x00f00000)
#define TX_PWR_CFG_2_MCS10_CH0 FIELD32(0x0f000000)
#define TX_PWR_CFG_2_MCS10_CH1 FIELD32(0xf0000000)
+/* bits for new 2T devices */
+#define TX_PWR_CFG_2B_MCS4_MCS5 FIELD32(0x000000ff)
+#define TX_PWR_CFG_2B_MCS6_MCS7 FIELD32(0x0000ff00)
+#define TX_PWR_CFG_2B_MCS8_MCS9 FIELD32(0x00ff0000)
+#define TX_PWR_CFG_2B_MCS10_MCS11 FIELD32(0xff000000)
/*
* TX_PWR_CFG_3:
@@ -1161,6 +1206,11 @@
#define TX_PWR_CFG_3_STBC0_CH1 FIELD32(0x00f00000)
#define TX_PWR_CFG_3_STBC2_CH0 FIELD32(0x0f000000)
#define TX_PWR_CFG_3_STBC2_CH1 FIELD32(0xf0000000)
+/* bits for new 2T devices */
+#define TX_PWR_CFG_3B_MCS12_MCS13 FIELD32(0x000000ff)
+#define TX_PWR_CFG_3B_MCS14 FIELD32(0x0000ff00)
+#define TX_PWR_CFG_3B_STBC_MCS0_MCS1 FIELD32(0x00ff0000)
+#define TX_PWR_CFG_3B_STBC_MCS2_MSC3 FIELD32(0xff000000)
/*
* TX_PWR_CFG_4:
@@ -1175,6 +1225,9 @@
#define TX_PWR_CFG_4_STBC4_CH1 FIELD32(0x000000f0)
#define TX_PWR_CFG_4_STBC6_CH0 FIELD32(0x00000f00)
#define TX_PWR_CFG_4_STBC6_CH1 FIELD32(0x0000f000)
+/* bits for new 2T devices */
+#define TX_PWR_CFG_4B_STBC_MCS4_MCS5 FIELD32(0x000000ff)
+#define TX_PWR_CFG_4B_STBC_MCS6 FIELD32(0x0000ff00)
/*
* TX_PIN_CFG:
@@ -1201,6 +1254,8 @@
#define TX_PIN_CFG_RFTR_POL FIELD32(0x00020000)
#define TX_PIN_CFG_TRSW_EN FIELD32(0x00040000)
#define TX_PIN_CFG_TRSW_POL FIELD32(0x00080000)
+#define TX_PIN_CFG_RFRX_EN FIELD32(0x00100000)
+#define TX_PIN_CFG_RFRX_POL FIELD32(0x00200000)
#define TX_PIN_CFG_PA_PE_A2_EN FIELD32(0x01000000)
#define TX_PIN_CFG_PA_PE_G2_EN FIELD32(0x02000000)
#define TX_PIN_CFG_PA_PE_A2_POL FIELD32(0x04000000)
@@ -1547,6 +1602,95 @@
#define TX_PWR_CFG_4_EXT_STBC4_CH2 FIELD32(0x0000000f)
#define TX_PWR_CFG_4_EXT_STBC6_CH2 FIELD32(0x00000f00)
+/* TXn_RF_GAIN_CORRECT: RF Gain Correction for each RF_ALC[3:2]
+ * Unit: 0.1 dB, Range: -3.2 dB to 3.1 dB
+ */
+#define TX0_RF_GAIN_CORRECT 0x13a0
+#define TX0_RF_GAIN_CORRECT_GAIN_CORR_0 FIELD32(0x0000003f)
+#define TX0_RF_GAIN_CORRECT_GAIN_CORR_1 FIELD32(0x00003f00)
+#define TX0_RF_GAIN_CORRECT_GAIN_CORR_2 FIELD32(0x003f0000)
+#define TX0_RF_GAIN_CORRECT_GAIN_CORR_3 FIELD32(0x3f000000)
+
+#define TX1_RF_GAIN_CORRECT 0x13a4
+#define TX1_RF_GAIN_CORRECT_GAIN_CORR_0 FIELD32(0x0000003f)
+#define TX1_RF_GAIN_CORRECT_GAIN_CORR_1 FIELD32(0x00003f00)
+#define TX1_RF_GAIN_CORRECT_GAIN_CORR_2 FIELD32(0x003f0000)
+#define TX1_RF_GAIN_CORRECT_GAIN_CORR_3 FIELD32(0x3f000000)
+
+/* TXn_RF_GAIN_ATTEN: TXn RF Gain Attenuation Level
+ * Format: 7-bit, signed value
+ * Unit: 0.5 dB, Range: -20 dB to -5 dB
+ */
+#define TX0_RF_GAIN_ATTEN 0x13a8
+#define TX0_RF_GAIN_ATTEN_LEVEL_0 FIELD32(0x0000007f)
+#define TX0_RF_GAIN_ATTEN_LEVEL_1 FIELD32(0x00007f00)
+#define TX0_RF_GAIN_ATTEN_LEVEL_2 FIELD32(0x007f0000)
+#define TX0_RF_GAIN_ATTEN_LEVEL_3 FIELD32(0x7f000000)
+#define TX1_RF_GAIN_ATTEN 0x13ac
+#define TX1_RF_GAIN_ATTEN_LEVEL_0 FIELD32(0x0000007f)
+#define TX1_RF_GAIN_ATTEN_LEVEL_1 FIELD32(0x00007f00)
+#define TX1_RF_GAIN_ATTEN_LEVEL_2 FIELD32(0x007f0000)
+#define TX1_RF_GAIN_ATTEN_LEVEL_3 FIELD32(0x7f000000)
+
+/* TX_ALC_CFG_0: TX Automatic Level Control Configuration 0
+ * TX_ALC_LIMIT_n: TXn upper limit
+ * TX_ALC_CH_INIT_n: TXn channel initial transmission gain
+ * Unit: 0.5 dB, Range: 0 to 23.5 dB
+ */
+#define TX_ALC_CFG_0 0x13b0
+#define TX_ALC_CFG_0_CH_INIT_0 FIELD32(0x0000003f)
+#define TX_ALC_CFG_0_CH_INIT_1 FIELD32(0x00003f00)
+#define TX_ALC_CFG_0_LIMIT_0 FIELD32(0x003f0000)
+#define TX_ALC_CFG_0_LIMIT_1 FIELD32(0x3f000000)
+
+/* TX_ALC_CFG_1: TX Automatic Level Control Configuration 1
+ * TX_TEMP_COMP: TX Power Temperature Compensation
+ * Unit: 0.5 dB, Range: -10 dB to 10 dB
+ * TXn_GAIN_FINE: TXn Gain Fine Adjustment
+ * Unit: 0.1 dB, Range: -0.8 dB to 0.7 dB
+ * RF_TOS_DLY: Sets the RF_TOS_EN assertion delay after
+ * deassertion of PA_PE.
+ * Unit: 0.25 usec
+ * TXn_RF_GAIN_ATTEN: TXn RF gain attentuation selector
+ * RF_TOS_TIMEOUT: time-out value for RF_TOS_ENABLE
+ * deassertion if RF_TOS_DONE is missing.
+ * Unit: 0.25 usec
+ * RF_TOS_ENABLE: TX offset calibration enable
+ * ROS_BUSY_EN: RX offset calibration busy enable
+ */
+#define TX_ALC_CFG_1 0x13b4
+#define TX_ALC_CFG_1_TX_TEMP_COMP FIELD32(0x0000003f)
+#define TX_ALC_CFG_1_TX0_GAIN_FINE FIELD32(0x00000f00)
+#define TX_ALC_CFG_1_TX1_GAIN_FINE FIELD32(0x0000f000)
+#define TX_ALC_CFG_1_RF_TOS_DLY FIELD32(0x00070000)
+#define TX_ALC_CFG_1_TX0_RF_GAIN_ATTEN FIELD32(0x00300000)
+#define TX_ALC_CFG_1_TX1_RF_GAIN_ATTEN FIELD32(0x00c00000)
+#define TX_ALC_CFG_1_RF_TOS_TIMEOUT FIELD32(0x3f000000)
+#define TX_ALC_CFG_1_RF_TOS_ENABLE FIELD32(0x40000000)
+#define TX_ALC_CFG_1_ROS_BUSY_EN FIELD32(0x80000000)
+
+/* TXn_BB_GAIN_ATTEN: TXn RF Gain Attenuation Level
+ * Format: 5-bit signed values
+ * Unit: 0.5 dB, Range: -8 dB to 7 dB
+ */
+#define TX0_BB_GAIN_ATTEN 0x13c0
+#define TX0_BB_GAIN_ATTEN_LEVEL_0 FIELD32(0x0000001f)
+#define TX0_BB_GAIN_ATTEN_LEVEL_1 FIELD32(0x00001f00)
+#define TX0_BB_GAIN_ATTEN_LEVEL_2 FIELD32(0x001f0000)
+#define TX0_BB_GAIN_ATTEN_LEVEL_3 FIELD32(0x1f000000)
+#define TX1_BB_GAIN_ATTEN 0x13c4
+#define TX1_BB_GAIN_ATTEN_LEVEL_0 FIELD32(0x0000001f)
+#define TX1_BB_GAIN_ATTEN_LEVEL_1 FIELD32(0x00001f00)
+#define TX1_BB_GAIN_ATTEN_LEVEL_2 FIELD32(0x001f0000)
+#define TX1_BB_GAIN_ATTEN_LEVEL_3 FIELD32(0x1f000000)
+
+/* TX_ALC_VGA3: TX Automatic Level Correction Variable Gain Amplifier 3 */
+#define TX_ALC_VGA3 0x13c8
+#define TX_ALC_VGA3_TX0_ALC_VGA3 FIELD32(0x0000001f)
+#define TX_ALC_VGA3_TX1_ALC_VGA3 FIELD32(0x00001f00)
+#define TX_ALC_VGA3_TX0_ALC_VGA2 FIELD32(0x001f0000)
+#define TX_ALC_VGA3_TX1_ALC_VGA2 FIELD32(0x1f000000)
+
/* TX_PWR_CFG_7 */
#define TX_PWR_CFG_7 0x13d4
#define TX_PWR_CFG_7_OFDM54_CH0 FIELD32(0x0000000f)
@@ -1555,6 +1699,10 @@
#define TX_PWR_CFG_7_MCS7_CH0 FIELD32(0x000f0000)
#define TX_PWR_CFG_7_MCS7_CH1 FIELD32(0x00f00000)
#define TX_PWR_CFG_7_MCS7_CH2 FIELD32(0x0f000000)
+/* bits for new 2T devices */
+#define TX_PWR_CFG_7B_54MBS FIELD32(0x000000ff)
+#define TX_PWR_CFG_7B_MCS7 FIELD32(0x00ff0000)
+
/* TX_PWR_CFG_8 */
#define TX_PWR_CFG_8 0x13d8
@@ -1564,12 +1712,17 @@
#define TX_PWR_CFG_8_MCS23_CH0 FIELD32(0x000f0000)
#define TX_PWR_CFG_8_MCS23_CH1 FIELD32(0x00f00000)
#define TX_PWR_CFG_8_MCS23_CH2 FIELD32(0x0f000000)
+/* bits for new 2T devices */
+#define TX_PWR_CFG_8B_MCS15 FIELD32(0x000000ff)
+
/* TX_PWR_CFG_9 */
#define TX_PWR_CFG_9 0x13dc
#define TX_PWR_CFG_9_STBC7_CH0 FIELD32(0x0000000f)
#define TX_PWR_CFG_9_STBC7_CH1 FIELD32(0x000000f0)
#define TX_PWR_CFG_9_STBC7_CH2 FIELD32(0x00000f00)
+/* bits for new 2T devices */
+#define TX_PWR_CFG_9B_STBC_MCS7 FIELD32(0x000000ff)
/*
* RX_FILTER_CFG: RX configuration register.
@@ -2137,11 +2290,14 @@ struct mac_iveiv_entry {
#define RFCSR1_TX1_PD FIELD8(0x20)
#define RFCSR1_RX2_PD FIELD8(0x40)
#define RFCSR1_TX2_PD FIELD8(0x80)
+#define RFCSR1_TX2_EN_MT7620 FIELD8(0x02)
/*
* RFCSR 2:
*/
#define RFCSR2_RESCAL_EN FIELD8(0x80)
+#define RFCSR2_RX2_EN_MT7620 FIELD8(0x02)
+#define RFCSR2_TX2_EN_MT7620 FIELD8(0x20)
/*
* RFCSR 3:
@@ -2160,6 +2316,12 @@ struct mac_iveiv_entry {
#define RFCSR3_BIT5 FIELD8(0x20)
/*
+ * RFCSR 4:
+ * VCOCAL_EN used by MT7620
+ */
+#define RFCSR4_VCOCAL_EN FIELD8(0x80)
+
+/*
* FRCSR 5:
*/
#define RFCSR5_R1 FIELD8(0x0c)
@@ -2214,6 +2376,7 @@ struct mac_iveiv_entry {
*/
#define RFCSR13_TX_POWER FIELD8(0x1f)
#define RFCSR13_DR0 FIELD8(0xe0)
+#define RFCSR13_RDIV_MT7620 FIELD8(0x03)
/*
* RFCSR 15:
@@ -2224,6 +2387,8 @@ struct mac_iveiv_entry {
* RFCSR 16:
*/
#define RFCSR16_TXMIXER_GAIN FIELD8(0x07)
+#define RFCSR16_RF_PLL_FREQ_SEL_MT7620 FIELD8(0x0F)
+#define RFCSR16_SDM_MODE_MT7620 FIELD8(0xE0)
/*
* RFCSR 17:
@@ -2236,6 +2401,8 @@ struct mac_iveiv_entry {
/* RFCSR 18 */
#define RFCSR18_XO_TUNE_BYPASS FIELD8(0x40)
+/* RFCSR 19 */
+#define RFCSR19_K FIELD8(0x03)
/*
* RFCSR 20:
@@ -2246,11 +2413,14 @@ struct mac_iveiv_entry {
* RFCSR 21:
*/
#define RFCSR21_RX_LO2_EN FIELD8(0x08)
+#define RFCSR21_BIT1 FIELD8(0x01)
+#define RFCSR21_BIT8 FIELD8(0x80)
/*
* RFCSR 22:
*/
#define RFCSR22_BASEBAND_LOOPBACK FIELD8(0x01)
+#define RFCSR22_FREQPLAN_D_MT7620 FIELD8(0x07)
/*
* RFCSR 23:
@@ -2273,6 +2443,11 @@ struct mac_iveiv_entry {
#define RFCSR27_R4 FIELD8(0x40)
/*
+ * RFCSR 28:
+ */
+#define RFCSR28_CH11_HT40 FIELD8(0x04)
+
+/*
* RFCSR 29:
*/
#define RFCSR29_ADC6_TEST FIELD8(0x01)
@@ -2333,6 +2508,7 @@ struct mac_iveiv_entry {
*/
#define RFCSR42_BIT1 FIELD8(0x01)
#define RFCSR42_BIT4 FIELD8(0x08)
+#define RFCSR42_TX2_EN_MT7620 FIELD8(0x40)
/*
* RFCSR 49:
@@ -2435,6 +2611,7 @@ enum rt2800_eeprom_word {
EEPROM_TSSI_BOUND_BG5,
EEPROM_TXPOWER_A1,
EEPROM_TXPOWER_A2,
+ EEPROM_TXPOWER_INIT,
EEPROM_TSSI_BOUND_A1,
EEPROM_TSSI_BOUND_A2,
EEPROM_TSSI_BOUND_A3,
diff --git a/drivers/net/wireless/ralink/rt2x00/rt2800lib.c b/drivers/net/wireless/ralink/rt2x00/rt2800lib.c
index 8d00c599e47a..201b12ed90c6 100644
--- a/drivers/net/wireless/ralink/rt2x00/rt2800lib.c
+++ b/drivers/net/wireless/ralink/rt2x00/rt2800lib.c
@@ -59,6 +59,9 @@
rt2800_regbusy_read((__dev), BBP_CSR_CFG, BBP_CSR_CFG_BUSY, (__reg))
#define WAIT_FOR_RFCSR(__dev, __reg) \
rt2800_regbusy_read((__dev), RF_CSR_CFG, RF_CSR_CFG_BUSY, (__reg))
+#define WAIT_FOR_RFCSR_MT7620(__dev, __reg) \
+ rt2800_regbusy_read((__dev), RF_CSR_CFG, RF_CSR_CFG_BUSY_MT7620, \
+ (__reg))
#define WAIT_FOR_RF(__dev, __reg) \
rt2800_regbusy_read((__dev), RF_CSR_CFG0, RF_CSR_CFG0_BUSY, (__reg))
#define WAIT_FOR_MCU(__dev, __reg) \
@@ -150,19 +153,56 @@ static void rt2800_rfcsr_write(struct rt2x00_dev *rt2x00dev,
* Wait until the RFCSR becomes available, afterwards we
* can safely write the new data into the register.
*/
- if (WAIT_FOR_RFCSR(rt2x00dev, ®)) {
- reg = 0;
- rt2x00_set_field32(®, RF_CSR_CFG_DATA, value);
- rt2x00_set_field32(®, RF_CSR_CFG_REGNUM, word);
- rt2x00_set_field32(®, RF_CSR_CFG_WRITE, 1);
- rt2x00_set_field32(®, RF_CSR_CFG_BUSY, 1);
+ switch (rt2x00dev->chip.rt) {
+ case RT6352:
+ if (WAIT_FOR_RFCSR_MT7620(rt2x00dev, ®)) {
+ reg = 0;
+ rt2x00_set_field32(®, RF_CSR_CFG_DATA_MT7620, value);
+ rt2x00_set_field32(®, RF_CSR_CFG_REGNUM_MT7620,
+ word);
+ rt2x00_set_field32(®, RF_CSR_CFG_WRITE_MT7620, 1);
+ rt2x00_set_field32(®, RF_CSR_CFG_BUSY_MT7620, 1);
+
+ rt2800_register_write_lock(rt2x00dev, RF_CSR_CFG, reg);
+ }
+ break;
- rt2800_register_write_lock(rt2x00dev, RF_CSR_CFG, reg);
+ default:
+ if (WAIT_FOR_RFCSR(rt2x00dev, ®)) {
+ reg = 0;
+ rt2x00_set_field32(®, RF_CSR_CFG_DATA, value);
+ rt2x00_set_field32(®, RF_CSR_CFG_REGNUM, word);
+ rt2x00_set_field32(®, RF_CSR_CFG_WRITE, 1);
+ rt2x00_set_field32(®, RF_CSR_CFG_BUSY, 1);
+
+ rt2800_register_write_lock(rt2x00dev, RF_CSR_CFG, reg);
+ }
+ break;
}
mutex_unlock(&rt2x00dev->csr_mutex);
}
+static void rt2800_rfcsr_write_bank(struct rt2x00_dev *rt2x00dev, const u8 bank,
+ const unsigned int reg, const u8 value)
+{
+ rt2800_rfcsr_write(rt2x00dev, (reg | (bank << 6)), value);
+}
+
+static void rt2800_rfcsr_write_chanreg(struct rt2x00_dev *rt2x00dev,
+ const unsigned int reg, const u8 value)
+{
+ rt2800_rfcsr_write_bank(rt2x00dev, 4, reg, value);
+ rt2800_rfcsr_write_bank(rt2x00dev, 6, reg, value);
+}
+
+static void rt2800_rfcsr_write_dccal(struct rt2x00_dev *rt2x00dev,
+ const unsigned int reg, const u8 value)
+{
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, reg, value);
+ rt2800_rfcsr_write_bank(rt2x00dev, 7, reg, value);
+}
+
static void rt2800_rfcsr_read(struct rt2x00_dev *rt2x00dev,
const unsigned int word, u8 *value)
{
@@ -178,22 +218,48 @@ static void rt2800_rfcsr_read(struct rt2x00_dev *rt2x00dev,
* doesn't become available in time, reg will be 0xffffffff
* which means we return 0xff to the caller.
*/
- if (WAIT_FOR_RFCSR(rt2x00dev, ®)) {
- reg = 0;
- rt2x00_set_field32(®, RF_CSR_CFG_REGNUM, word);
- rt2x00_set_field32(®, RF_CSR_CFG_WRITE, 0);
- rt2x00_set_field32(®, RF_CSR_CFG_BUSY, 1);
+ switch (rt2x00dev->chip.rt) {
+ case RT6352:
+ if (WAIT_FOR_RFCSR_MT7620(rt2x00dev, ®)) {
+ reg = 0;
+ rt2x00_set_field32(®, RF_CSR_CFG_REGNUM_MT7620,
+ word);
+ rt2x00_set_field32(®, RF_CSR_CFG_WRITE_MT7620, 0);
+ rt2x00_set_field32(®, RF_CSR_CFG_BUSY_MT7620, 1);
- rt2800_register_write_lock(rt2x00dev, RF_CSR_CFG, reg);
+ rt2800_register_write_lock(rt2x00dev, RF_CSR_CFG, reg);
- WAIT_FOR_RFCSR(rt2x00dev, ®);
- }
+ WAIT_FOR_RFCSR_MT7620(rt2x00dev, ®);
+ }
- *value = rt2x00_get_field32(reg, RF_CSR_CFG_DATA);
+ *value = rt2x00_get_field32(reg, RF_CSR_CFG_DATA_MT7620);
+ break;
+
+ default:
+ if (WAIT_FOR_RFCSR(rt2x00dev, ®)) {
+ reg = 0;
+ rt2x00_set_field32(®, RF_CSR_CFG_REGNUM, word);
+ rt2x00_set_field32(®, RF_CSR_CFG_WRITE, 0);
+ rt2x00_set_field32(®, RF_CSR_CFG_BUSY, 1);
+
+ rt2800_register_write_lock(rt2x00dev, RF_CSR_CFG, reg);
+
+ WAIT_FOR_RFCSR(rt2x00dev, ®);
+ }
+
+ *value = rt2x00_get_field32(reg, RF_CSR_CFG_DATA);
+ break;
+ }
mutex_unlock(&rt2x00dev->csr_mutex);
}
+static void rt2800_rfcsr_read_bank(struct rt2x00_dev *rt2x00dev, const u8 bank,
+ const unsigned int reg, u8 *value)
+{
+ rt2800_rfcsr_read(rt2x00dev, (reg | (bank << 6)), value);
+}
+
static void rt2800_rf_write(struct rt2x00_dev *rt2x00dev,
const unsigned int word, const u32 value)
{
@@ -250,6 +316,7 @@ static const unsigned int rt2800_eeprom_map[EEPROM_WORD_COUNT] = {
[EEPROM_TSSI_BOUND_BG5] = 0x003b,
[EEPROM_TXPOWER_A1] = 0x003c,
[EEPROM_TXPOWER_A2] = 0x0053,
+ [EEPROM_TXPOWER_INIT] = 0x0068,
[EEPROM_TSSI_BOUND_A1] = 0x006a,
[EEPROM_TSSI_BOUND_A2] = 0x006b,
[EEPROM_TSSI_BOUND_A3] = 0x006c,
@@ -524,6 +591,7 @@ void rt2800_get_txwi_rxwi_size(struct rt2x00_dev *rt2x00dev,
break;
case RT5592:
+ case RT6352:
*txwi_size = TXWI_DESC_SIZE_5WORDS;
*rxwi_size = RXWI_DESC_SIZE_6WORDS;
break;
@@ -2810,7 +2878,8 @@ static void rt2800_config_channel_rf53xx(struct rt2x00_dev *rt2x00dev,
rt2800_rfcsr_write(rt2x00dev, 59,
r59_nonbt_rev[idx]);
} else if (rt2x00_rt(rt2x00dev, RT5390) ||
- rt2x00_rt(rt2x00dev, RT5392)) {
+ rt2x00_rt(rt2x00dev, RT5392) ||
+ rt2x00_rt(rt2x00dev, RT6352)) {
static const char r59_non_bt[] = {0x8f, 0x8f,
0x8f, 0x8f, 0x8f, 0x8f, 0x8f, 0x8d,
0x8a, 0x88, 0x88, 0x87, 0x87, 0x86};
@@ -3104,6 +3173,242 @@ static void rt2800_config_channel_rf55xx(struct rt2x00_dev *rt2x00dev,
rt2800_bbp_write(rt2x00dev, 196, (rf->channel <= 14) ? 0x19 : 0x7F);
}
+static void rt2800_config_channel_rf7620(struct rt2x00_dev *rt2x00dev,
+ struct ieee80211_conf *conf,
+ struct rf_channel *rf,
+ struct channel_info *info)
+{
+ struct rt2800_drv_data *drv_data = rt2x00dev->drv_data;
+ u8 rx_agc_fc, tx_agc_fc;
+ u8 rfcsr;
+
+ /* Frequeny plan setting */
+ /* Rdiv setting (set 0x03 if Xtal==20)
+ * R13[1:0]
+ */
+ rt2800_rfcsr_read(rt2x00dev, 13, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR13_RDIV_MT7620,
+ rt2800_clk_is_20mhz(rt2x00dev) ? 3 : 0);
+ rt2800_rfcsr_write(rt2x00dev, 13, rfcsr);
+
+ /* N setting
+ * R20[7:0] in rf->rf1
+ * R21[0] always 0
+ */
+ rt2800_rfcsr_read(rt2x00dev, 20, &rfcsr);
+ rfcsr = (rf->rf1 & 0x00ff);
+ rt2800_rfcsr_write(rt2x00dev, 20, rfcsr);
+
+ rt2800_rfcsr_read(rt2x00dev, 21, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR21_BIT1, 0);
+ rt2800_rfcsr_write(rt2x00dev, 21, rfcsr);
+
+ /* K setting (always 0)
+ * R16[3:0] (RF PLL freq selection)
+ */
+ rt2800_rfcsr_read(rt2x00dev, 16, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR16_RF_PLL_FREQ_SEL_MT7620, 0);
+ rt2800_rfcsr_write(rt2x00dev, 16, rfcsr);
+
+ /* D setting (always 0)
+ * R22[2:0] (D=15, R22[2:0]=<111>)
+ */
+ rt2800_rfcsr_read(rt2x00dev, 22, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR22_FREQPLAN_D_MT7620, 0);
+ rt2800_rfcsr_write(rt2x00dev, 22, rfcsr);
+
+ /* Ksd setting
+ * Ksd: R17<7:0> in rf->rf2
+ * R18<7:0> in rf->rf3
+ * R19<1:0> in rf->rf4
+ */
+ rt2800_rfcsr_read(rt2x00dev, 17, &rfcsr);
+ rfcsr = rf->rf2;
+ rt2800_rfcsr_write(rt2x00dev, 17, rfcsr);
+
+ rt2800_rfcsr_read(rt2x00dev, 18, &rfcsr);
+ rfcsr = rf->rf3;
+ rt2800_rfcsr_write(rt2x00dev, 18, rfcsr);
+
+ rt2800_rfcsr_read(rt2x00dev, 19, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR19_K, rf->rf4);
+ rt2800_rfcsr_write(rt2x00dev, 19, rfcsr);
+
+ /* Default: XO=20MHz , SDM mode */
+ rt2800_rfcsr_read(rt2x00dev, 16, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR16_SDM_MODE_MT7620, 0x80);
+ rt2800_rfcsr_write(rt2x00dev, 16, rfcsr);
+
+ rt2800_rfcsr_read(rt2x00dev, 21, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR21_BIT8, 1);
+ rt2800_rfcsr_write(rt2x00dev, 21, rfcsr);
+
+ rt2800_rfcsr_read(rt2x00dev, 1, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR1_TX2_EN_MT7620,
+ rt2x00dev->default_ant.tx_chain_num != 1);
+ rt2800_rfcsr_write(rt2x00dev, 1, rfcsr);
+
+ rt2800_rfcsr_read(rt2x00dev, 2, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR2_TX2_EN_MT7620,
+ rt2x00dev->default_ant.tx_chain_num != 1);
+ rt2x00_set_field8(&rfcsr, RFCSR2_RX2_EN_MT7620,
+ rt2x00dev->default_ant.rx_chain_num != 1);
+ rt2800_rfcsr_write(rt2x00dev, 2, rfcsr);
+
+ rt2800_rfcsr_read(rt2x00dev, 42, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR42_TX2_EN_MT7620,
+ rt2x00dev->default_ant.tx_chain_num != 1);
+ rt2800_rfcsr_write(rt2x00dev, 42, rfcsr);
+
+ /* RF for DC Cal BW */
+ if (conf_is_ht40(conf)) {
+ rt2800_rfcsr_write_dccal(rt2x00dev, 6, 0x10);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 7, 0x10);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 8, 0x04);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 58, 0x10);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 59, 0x10);
+ } else {
+ rt2800_rfcsr_write_dccal(rt2x00dev, 6, 0x20);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 7, 0x20);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 8, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 58, 0x20);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 59, 0x20);
+ }
+
+ if (conf_is_ht40(conf)) {
+ rt2800_rfcsr_write_dccal(rt2x00dev, 58, 0x08);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 59, 0x08);
+ } else {
+ rt2800_rfcsr_write_dccal(rt2x00dev, 58, 0x28);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 59, 0x28);
+ }
+
+ rt2800_rfcsr_read(rt2x00dev, 28, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR28_CH11_HT40,
+ conf_is_ht40(conf) && (rf->channel == 11));
+ rt2800_rfcsr_write(rt2x00dev, 28, rfcsr);
+
+ if (!test_bit(DEVICE_STATE_SCANNING, &rt2x00dev->flags)) {
+ if (conf_is_ht40(conf)) {
+ rx_agc_fc = drv_data->rx_calibration_bw40;
+ tx_agc_fc = drv_data->tx_calibration_bw40;
+ } else {
+ rx_agc_fc = drv_data->rx_calibration_bw20;
+ tx_agc_fc = drv_data->tx_calibration_bw20;
+ }
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 6, &rfcsr);
+ rfcsr &= (~0x3F);
+ rfcsr |= rx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 6, rfcsr);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 7, &rfcsr);
+ rfcsr &= (~0x3F);
+ rfcsr |= rx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 7, rfcsr);
+ rt2800_rfcsr_read_bank(rt2x00dev, 7, 6, &rfcsr);
+ rfcsr &= (~0x3F);
+ rfcsr |= rx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 7, 6, rfcsr);
+ rt2800_rfcsr_read_bank(rt2x00dev, 7, 7, &rfcsr);
+ rfcsr &= (~0x3F);
+ rfcsr |= rx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 7, 7, rfcsr);
+
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 58, &rfcsr);
+ rfcsr &= (~0x3F);
+ rfcsr |= tx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 58, rfcsr);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 59, &rfcsr);
+ rfcsr &= (~0x3F);
+ rfcsr |= tx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 59, rfcsr);
+ rt2800_rfcsr_read_bank(rt2x00dev, 7, 58, &rfcsr);
+ rfcsr &= (~0x3F);
+ rfcsr |= tx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 7, 58, rfcsr);
+ rt2800_rfcsr_read_bank(rt2x00dev, 7, 59, &rfcsr);
+ rfcsr &= (~0x3F);
+ rfcsr |= tx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 7, 59, rfcsr);
+ }
+}
+
+static void rt2800_config_alc(struct rt2x00_dev *rt2x00dev,
+ struct ieee80211_channel *chan,
+ int power_level) {
+ u16 eeprom, target_power, max_power;
+ u32 mac_sys_ctrl, mac_status;
+ u32 reg;
+ u8 bbp;
+ int i;
+
+ /* hardware unit is 0.5dBm, limited to 23.5dBm */
+ power_level *= 2;
+ if (power_level > 0x2f)
+ power_level = 0x2f;
+
+ max_power = chan->max_power * 2;
+ if (max_power > 0x2f)
+ max_power = 0x2f;
+
+ rt2800_register_read(rt2x00dev, TX_ALC_CFG_0, ®);
+ rt2x00_set_field32(®, TX_ALC_CFG_0_CH_INIT_0, power_level);
+ rt2x00_set_field32(®, TX_ALC_CFG_0_CH_INIT_1, power_level);
+ rt2x00_set_field32(®, TX_ALC_CFG_0_LIMIT_0, max_power);
+ rt2x00_set_field32(®, TX_ALC_CFG_0_LIMIT_1, max_power);
+
+ rt2800_eeprom_read(rt2x00dev, EEPROM_NIC_CONF1, &eeprom);
+ if (rt2x00_get_field16(eeprom, EEPROM_NIC_CONF1_INTERNAL_TX_ALC)) {
+ /* init base power by eeprom target power */
+ rt2800_eeprom_read(rt2x00dev, EEPROM_TXPOWER_INIT,
+ &target_power);
+ rt2x00_set_field32(®, TX_ALC_CFG_0_CH_INIT_0, target_power);
+ rt2x00_set_field32(®, TX_ALC_CFG_0_CH_INIT_1, target_power);
+ }
+ rt2800_register_write(rt2x00dev, TX_ALC_CFG_0, reg);
+
+ rt2800_register_read(rt2x00dev, TX_ALC_CFG_1, ®);
+ rt2x00_set_field32(®, TX_ALC_CFG_1_TX_TEMP_COMP, 0);
+ rt2800_register_write(rt2x00dev, TX_ALC_CFG_1, reg);
+
+ /* Save MAC SYS CTRL registers */
+ rt2800_register_read(rt2x00dev, MAC_SYS_CTRL, &mac_sys_ctrl);
+ /* Disable Tx/Rx */
+ rt2800_register_write(rt2x00dev, MAC_SYS_CTRL, 0);
+ /* Check MAC Tx/Rx idle */
+ for (i = 0; i < 10000; i++) {
+ rt2800_register_read(rt2x00dev, MAC_STATUS_CFG,
+ &mac_status);
+ if (mac_status & 0x3)
+ usleep_range(50, 200);
+ else
+ break;
+ }
+
+ if (i == 10000)
+ rt2x00_warn(rt2x00dev, "Wait MAC Status to MAX !!!\n");
+
+ if (chan->center_freq > 2457) {
+ rt2800_bbp_read(rt2x00dev, 30, &bbp);
+ bbp = 0x40;
+ rt2800_bbp_write(rt2x00dev, 30, bbp);
+ rt2800_rfcsr_write(rt2x00dev, 39, 0);
+ if (rt2x00_has_cap_external_lna_bg(rt2x00dev))
+ rt2800_rfcsr_write(rt2x00dev, 42, 0xfb);
+ else
+ rt2800_rfcsr_write(rt2x00dev, 42, 0x7b);
+ } else {
+ rt2800_bbp_read(rt2x00dev, 30, &bbp);
+ bbp = 0x1f;
+ rt2800_bbp_write(rt2x00dev, 30, bbp);
+ rt2800_rfcsr_write(rt2x00dev, 39, 0x80);
+ if (rt2x00_has_cap_external_lna_bg(rt2x00dev))
+ rt2800_rfcsr_write(rt2x00dev, 42, 0xdb);
+ else
+ rt2800_rfcsr_write(rt2x00dev, 42, 0x5b);
+ }
+ rt2800_register_write(rt2x00dev, MAC_SYS_CTRL, mac_sys_ctrl);
+}
+
static void rt2800_bbp_write_with_rx_chain(struct rt2x00_dev *rt2x00dev,
const unsigned int word,
const u8 value)
@@ -3228,7 +3533,7 @@ static void rt2800_config_channel(struct rt2x00_dev *rt2x00dev,
struct channel_info *info)
{
u32 reg;
- unsigned int tx_pin;
+ u32 tx_pin;
u8 bbp, rfcsr;
info->default_power1 = rt2800_txpower_to_dev(rt2x00dev, rf->channel,
@@ -3273,6 +3578,9 @@ static void rt2800_config_channel(struct rt2x00_dev *rt2x00dev,
case RF5592:
rt2800_config_channel_rf55xx(rt2x00dev, conf, rf, info);
break;
+ case RF7620:
+ rt2800_config_channel_rf7620(rt2x00dev, conf, rf, info);
+ break;
default:
rt2800_config_channel_rf2xxx(rt2x00dev, conf, rf, info);
}
@@ -3347,7 +3655,8 @@ static void rt2800_config_channel(struct rt2x00_dev *rt2x00dev,
if (rf->channel <= 14) {
if (!rt2x00_rt(rt2x00dev, RT5390) &&
- !rt2x00_rt(rt2x00dev, RT5392)) {
+ !rt2x00_rt(rt2x00dev, RT5392) &&
+ !rt2x00_rt(rt2x00dev, RT6352)) {
if (rt2x00_has_cap_external_lna_bg(rt2x00dev)) {
rt2800_bbp_write(rt2x00dev, 82, 0x62);
rt2800_bbp_write(rt2x00dev, 75, 0x46);
@@ -3367,7 +3676,7 @@ static void rt2800_config_channel(struct rt2x00_dev *rt2x00dev,
rt2800_bbp_write(rt2x00dev, 82, 0x94);
else if (rt2x00_rt(rt2x00dev, RT3593))
rt2800_bbp_write(rt2x00dev, 82, 0x82);
- else
+ else if (!rt2x00_rt(rt2x00dev, RT6352))
rt2800_bbp_write(rt2x00dev, 82, 0xf2);
if (rt2x00_rt(rt2x00dev, RT3593))
@@ -3388,7 +3697,7 @@ static void rt2800_config_channel(struct rt2x00_dev *rt2x00dev,
if (rt2x00_rt(rt2x00dev, RT3572))
rt2800_rfcsr_write(rt2x00dev, 8, 0);
- tx_pin = 0;
+ rt2800_register_read(rt2x00dev, TX_PIN_CFG, &tx_pin);
switch (rt2x00dev->default_ant.tx_chain_num) {
case 3:
@@ -3437,6 +3746,7 @@ static void rt2800_config_channel(struct rt2x00_dev *rt2x00dev,
rt2x00_set_field32(&tx_pin, TX_PIN_CFG_RFTR_EN, 1);
rt2x00_set_field32(&tx_pin, TX_PIN_CFG_TRSW_EN, 1);
+ rt2x00_set_field32(&tx_pin, TX_PIN_CFG_RFRX_EN, 1); /* mt7620 */
rt2800_register_write(rt2x00dev, TX_PIN_CFG, tx_pin);
@@ -3495,7 +3805,7 @@ static void rt2800_config_channel(struct rt2x00_dev *rt2x00dev,
usleep_range(1000, 1500);
}
- if (rt2x00_rt(rt2x00dev, RT5592)) {
+ if (rt2x00_rt(rt2x00dev, RT5592) || rt2x00_rt(rt2x00dev, RT6352)) {
rt2800_bbp_write(rt2x00dev, 195, 141);
rt2800_bbp_write(rt2x00dev, 196, conf_is_ht40(conf) ? 0x10 : 0x1a);
@@ -4182,6 +4492,128 @@ static void rt2800_config_txpower_rt3593(struct rt2x00_dev *rt2x00dev,
(unsigned long) regs[i]);
}
+static void rt2800_config_txpower_rt6352(struct rt2x00_dev *rt2x00dev,
+ struct ieee80211_channel *chan,
+ int power_level)
+{
+ u32 reg, pwreg;
+ u16 eeprom;
+ u32 data, gdata;
+ u8 t, i;
+ enum nl80211_band band = chan->band;
+ int delta;
+
+ /* Warn user if bw_comp is set in EEPROM */
+ delta = rt2800_get_txpower_bw_comp(rt2x00dev, band);
+
+ if (delta)
+ rt2x00_warn(rt2x00dev, "ignoring EEPROM HT40 power delta: %d\n",
+ delta);
+
+ /* populate TX_PWR_CFG_0 up to TX_PWR_CFG_4 from EEPROM for HT20, limit
+ * value to 0x3f and replace 0x20 by 0x21 as this is what the vendor
+ * driver does as well, though it looks kinda wrong.
+ * Maybe some misunderstanding of what a signed 8-bit value is? Maybe
+ * the hardware has a problem handling 0x20, and as the code initially
+ * used a fixed offset between HT20 and HT40 rates they had to work-
+ * around that issue and most likely just forgot about it later on.
+ * Maybe we should use rt2800_get_txpower_bw_comp() here as well,
+ * however, the corresponding EEPROM value is not respected by the
+ * vendor driver, so maybe this is rather being taken care of the
+ * TXALC and the driver doesn't need to handle it...?
+ * Though this is all very awkward, just do as they did, as that's what
+ * board vendors expected when they populated the EEPROM...
+ */
+ for (i = 0; i < 5; i++) {
+ rt2800_eeprom_read_from_array(rt2x00dev, EEPROM_TXPOWER_BYRATE,
+ i * 2, &eeprom);
+
+ data = eeprom;
+
+ t = eeprom & 0x3f;
+ if (t == 32)
+ t++;
+
+ gdata = t;
+
+ t = (eeprom & 0x3f00) >> 8;
+ if (t == 32)
+ t++;
+
+ gdata |= (t << 8);
+
+ rt2800_eeprom_read_from_array(rt2x00dev, EEPROM_TXPOWER_BYRATE,
+ (i * 2) + 1, &eeprom);
+
+ t = eeprom & 0x3f;
+ if (t == 32)
+ t++;
+
+ gdata |= (t << 16);
+
+ t = (eeprom & 0x3f00) >> 8;
+ if (t == 32)
+ t++;
+
+ gdata |= (t << 24);
+ data |= (eeprom << 16);
+
+ if (!test_bit(CONFIG_CHANNEL_HT40, &rt2x00dev->flags)) {
+ /* HT20 */
+ if (data != 0xffffffff)
+ rt2800_register_write(rt2x00dev,
+ TX_PWR_CFG_0 + (i * 4),
+ data);
+ } else {
+ /* HT40 */
+ if (gdata != 0xffffffff)
+ rt2800_register_write(rt2x00dev,
+ TX_PWR_CFG_0 + (i * 4),
+ gdata);
+ }
+ }
+
+ /* Aparently Ralink ran out of space in the BYRATE calibration section
+ * of the EERPOM which is copied to the corresponding TX_PWR_CFG_x
+ * registers. As recent 2T chips use 8-bit instead of 4-bit values for
+ * power-offsets more space would be needed. Ralink decided to keep the
+ * EEPROM layout untouched and rather have some shared values covering
+ * multiple bitrates.
+ * Populate the registers not covered by the EEPROM in the same way the
+ * vendor driver does.
+ */
+
+ /* For OFDM 54MBS use value from OFDM 48MBS */
+ pwreg = 0;
+ rt2800_register_read(rt2x00dev, TX_PWR_CFG_1, ®);
+ t = rt2x00_get_field32(reg, TX_PWR_CFG_1B_48MBS);
+ rt2x00_set_field32(&pwreg, TX_PWR_CFG_7B_54MBS, t);
+
+ /* For MCS 7 use value from MCS 6 */
+ rt2800_register_read(rt2x00dev, TX_PWR_CFG_2, ®);
+ t = rt2x00_get_field32(reg, TX_PWR_CFG_2B_MCS6_MCS7);
+ rt2x00_set_field32(&pwreg, TX_PWR_CFG_7B_MCS7, t);
+ rt2800_register_write(rt2x00dev, TX_PWR_CFG_7, pwreg);
+
+ /* For MCS 15 use value from MCS 14 */
+ pwreg = 0;
+ rt2800_register_read(rt2x00dev, TX_PWR_CFG_3, ®);
+ t = rt2x00_get_field32(reg, TX_PWR_CFG_3B_MCS14);
+ rt2x00_set_field32(&pwreg, TX_PWR_CFG_8B_MCS15, t);
+ rt2800_register_write(rt2x00dev, TX_PWR_CFG_8, pwreg);
+
+ /* For STBC MCS 7 use value from STBC MCS 6 */
+ pwreg = 0;
+ rt2800_register_read(rt2x00dev, TX_PWR_CFG_4, ®);
+ t = rt2x00_get_field32(reg, TX_PWR_CFG_4B_STBC_MCS6);
+ rt2x00_set_field32(&pwreg, TX_PWR_CFG_9B_STBC_MCS7, t);
+ rt2800_register_write(rt2x00dev, TX_PWR_CFG_9, pwreg);
+
+ rt2800_config_alc(rt2x00dev, chan, power_level);
+
+ /* TODO: temperature compensation code! */
+}
+
/*
* We configure transmit power using MAC TX_PWR_CFG_{0,...,N} registers and
* BBP R1 register. TX_PWR_CFG_X allow to configure per rate TX power values,
@@ -4378,6 +4810,8 @@ static void rt2800_config_txpower(struct rt2x00_dev *rt2x00dev,
{
if (rt2x00_rt(rt2x00dev, RT3593))
rt2800_config_txpower_rt3593(rt2x00dev, chan, power_level);
+ else if (rt2x00_rt(rt2x00dev, RT6352))
+ rt2800_config_txpower_rt6352(rt2x00dev, chan, power_level);
else
rt2800_config_txpower_rt28xx(rt2x00dev, chan, power_level);
}
@@ -4393,6 +4827,7 @@ void rt2800_vco_calibration(struct rt2x00_dev *rt2x00dev)
{
u32 tx_pin;
u8 rfcsr;
+ unsigned long min_sleep = 0;
/*
* A voltage-controlled oscillator(VCO) is an electronic oscillator
@@ -4431,6 +4866,15 @@ void rt2800_vco_calibration(struct rt2x00_dev *rt2x00dev)
rt2800_rfcsr_read(rt2x00dev, 3, &rfcsr);
rt2x00_set_field8(&rfcsr, RFCSR3_VCOCAL_EN, 1);
rt2800_rfcsr_write(rt2x00dev, 3, rfcsr);
+ min_sleep = 1000;
+ break;
+ case RF7620:
+ rt2800_rfcsr_write(rt2x00dev, 5, 0x40);
+ rt2800_rfcsr_write(rt2x00dev, 4, 0x0C);
+ rt2800_rfcsr_read(rt2x00dev, 4, &rfcsr);
+ rt2x00_set_field8(&rfcsr, RFCSR4_VCOCAL_EN, 1);
+ rt2800_rfcsr_write(rt2x00dev, 4, rfcsr);
+ min_sleep = 2000;
break;
default:
WARN_ONCE(1, "Not supported RF chipet %x for VCO recalibration",
@@ -4438,7 +4882,8 @@ void rt2800_vco_calibration(struct rt2x00_dev *rt2x00dev)
return;
}
- usleep_range(1000, 1500);
+ if (min_sleep > 0)
+ usleep_range(min_sleep, min_sleep * 2);
rt2800_register_read(rt2x00dev, TX_PIN_CFG, &tx_pin);
if (rt2x00dev->rf_channel <= 14) {
@@ -4470,6 +4915,42 @@ void rt2800_vco_calibration(struct rt2x00_dev *rt2x00dev)
}
rt2800_register_write(rt2x00dev, TX_PIN_CFG, tx_pin);
+ if (rt2x00_rt(rt2x00dev, RT6352)) {
+ if (rt2x00dev->default_ant.tx_chain_num == 1) {
+ rt2800_bbp_write(rt2x00dev, 91, 0x07);
+ rt2800_bbp_write(rt2x00dev, 95, 0x1A);
+ rt2800_bbp_write(rt2x00dev, 195, 128);
+ rt2800_bbp_write(rt2x00dev, 196, 0xA0);
+ rt2800_bbp_write(rt2x00dev, 195, 170);
+ rt2800_bbp_write(rt2x00dev, 196, 0x12);
+ rt2800_bbp_write(rt2x00dev, 195, 171);
+ rt2800_bbp_write(rt2x00dev, 196, 0x10);
+ } else {
+ rt2800_bbp_write(rt2x00dev, 91, 0x06);
+ rt2800_bbp_write(rt2x00dev, 95, 0x9A);
+ rt2800_bbp_write(rt2x00dev, 195, 128);
+ rt2800_bbp_write(rt2x00dev, 196, 0xE0);
+ rt2800_bbp_write(rt2x00dev, 195, 170);
+ rt2800_bbp_write(rt2x00dev, 196, 0x30);
+ rt2800_bbp_write(rt2x00dev, 195, 171);
+ rt2800_bbp_write(rt2x00dev, 196, 0x30);
+ }
+
+ if (rt2x00_has_cap_external_lna_bg(rt2x00dev)) {
+ rt2800_bbp_write(rt2x00dev, 75, 0x60);
+ rt2800_bbp_write(rt2x00dev, 76, 0x44);
+ rt2800_bbp_write(rt2x00dev, 79, 0x1C);
+ rt2800_bbp_write(rt2x00dev, 80, 0x0C);
+ rt2800_bbp_write(rt2x00dev, 82, 0xB6);
+ }
+
+ /* On 11A, We should delay and wait RF/BBP to be stable
+ * and the appropriate time should be 1000 micro seconds
+ * 2005/06/05 - On 11G, we also need this delay time.
+ * Otherwise it's difficult to pass the WHQL.
+ */
+ usleep_range(1000, 1500);
+ }
}
EXPORT_SYMBOL_GPL(rt2800_vco_calibration);
@@ -4568,7 +5049,8 @@ static u8 rt2800_get_default_vgc(struct rt2x00_dev *rt2x00dev)
rt2x00_rt(rt2x00dev, RT3593) ||
rt2x00_rt(rt2x00dev, RT5390) ||
rt2x00_rt(rt2x00dev, RT5392) ||
- rt2x00_rt(rt2x00dev, RT5592))
+ rt2x00_rt(rt2x00dev, RT5592) ||
+ rt2x00_rt(rt2x00dev, RT6352))
vgc = 0x1c + (2 * rt2x00dev->lna_gain);
else
vgc = 0x2e + rt2x00dev->lna_gain;
@@ -4795,7 +5277,8 @@ static int rt2800_init_registers(struct rt2x00_dev *rt2x00dev)
0x00000000);
}
} else if (rt2x00_rt(rt2x00dev, RT5390) ||
- rt2x00_rt(rt2x00dev, RT5392)) {
+ rt2x00_rt(rt2x00dev, RT5392) ||
+ rt2x00_rt(rt2x00dev, RT6352)) {
rt2800_register_write(rt2x00dev, TX_SW_CFG0, 0x00000404);
rt2800_register_write(rt2x00dev, TX_SW_CFG1, 0x00080606);
rt2800_register_write(rt2x00dev, TX_SW_CFG2, 0x00000000);
@@ -4805,6 +5288,24 @@ static int rt2800_init_registers(struct rt2x00_dev *rt2x00dev)
rt2800_register_write(rt2x00dev, TX_SW_CFG2, 0x00000000);
} else if (rt2x00_rt(rt2x00dev, RT5350)) {
rt2800_register_write(rt2x00dev, TX_SW_CFG0, 0x00000404);
+ } else if (rt2x00_rt(rt2x00dev, RT6352)) {
+ rt2800_register_write(rt2x00dev, TX_SW_CFG0, 0x00000401);
+ rt2800_register_write(rt2x00dev, TX_SW_CFG1, 0x000C0000);
+ rt2800_register_write(rt2x00dev, TX_SW_CFG2, 0x00000000);
+ rt2800_register_write(rt2x00dev, MIMO_PS_CFG, 0x00000002);
+ rt2800_register_write(rt2x00dev, TX_PIN_CFG, 0x00150F0F);
+ rt2800_register_write(rt2x00dev, TX_ALC_VGA3, 0x06060606);
+ rt2800_register_write(rt2x00dev, TX0_BB_GAIN_ATTEN, 0x0);
+ rt2800_register_write(rt2x00dev, TX1_BB_GAIN_ATTEN, 0x0);
+ rt2800_register_write(rt2x00dev, TX0_RF_GAIN_ATTEN, 0x6C6C666C);
+ rt2800_register_write(rt2x00dev, TX1_RF_GAIN_ATTEN, 0x6C6C666C);
+ rt2800_register_write(rt2x00dev, TX0_RF_GAIN_CORRECT,
+ 0x3630363A);
+ rt2800_register_write(rt2x00dev, TX1_RF_GAIN_CORRECT,
+ 0x3630363A);
+ rt2800_register_read(rt2x00dev, TX_ALC_CFG_1, ®);
+ rt2x00_set_field32(®, TX_ALC_CFG_1_ROS_BUSY_EN, 0);
+ rt2800_register_write(rt2x00dev, TX_ALC_CFG_1, reg);
} else {
rt2800_register_write(rt2x00dev, TX_SW_CFG0, 0x00000000);
rt2800_register_write(rt2x00dev, TX_SW_CFG1, 0x00080606);
@@ -5786,6 +6287,231 @@ static void rt2800_init_bbp_5592(struct rt2x00_dev *rt2x00dev)
rt2800_bbp_write(rt2x00dev, 103, 0xc0);
}
+static void rt2800_bbp_glrt_write(struct rt2x00_dev *rt2x00dev,
+ const u8 reg, const u8 value)
+{
+ rt2800_bbp_write(rt2x00dev, 195, reg);
+ rt2800_bbp_write(rt2x00dev, 196, value);
+}
+
+static void rt2800_bbp_dcoc_write(struct rt2x00_dev *rt2x00dev,
+ const u8 reg, const u8 value)
+{
+ rt2800_bbp_write(rt2x00dev, 158, reg);
+ rt2800_bbp_write(rt2x00dev, 159, value);
+}
+
+static void rt2800_bbp_dcoc_read(struct rt2x00_dev *rt2x00dev,
+ const u8 reg, u8 *value)
+{
+ rt2800_bbp_write(rt2x00dev, 158, reg);
+ rt2800_bbp_read(rt2x00dev, 159, value);
+}
+
+static void rt2800_init_bbp_6352(struct rt2x00_dev *rt2x00dev)
+{
+ u8 bbp;
+
+ /* Apply Maximum Likelihood Detection (MLD) for 2 stream case */
+ rt2800_bbp_read(rt2x00dev, 105, &bbp);
+ rt2x00_set_field8(&bbp, BBP105_MLD,
+ rt2x00dev->default_ant.rx_chain_num == 2);
+ rt2800_bbp_write(rt2x00dev, 105, bbp);
+
+ /* Avoid data loss and CRC errors */
+ rt2800_bbp4_mac_if_ctrl(rt2x00dev);
+
+ /* Fix I/Q swap issue */
+ rt2800_bbp_read(rt2x00dev, 1, &bbp);
+ bbp |= 0x04;
+ rt2800_bbp_write(rt2x00dev, 1, bbp);
+
+ /* BBP for G band */
+ rt2800_bbp_write(rt2x00dev, 3, 0x08);
+ rt2800_bbp_write(rt2x00dev, 4, 0x00); /* rt2800_bbp4_mac_if_ctrl? */
+ rt2800_bbp_write(rt2x00dev, 6, 0x08);
+ rt2800_bbp_write(rt2x00dev, 14, 0x09);
+ rt2800_bbp_write(rt2x00dev, 15, 0xFF);
+ rt2800_bbp_write(rt2x00dev, 16, 0x01);
+ rt2800_bbp_write(rt2x00dev, 20, 0x06);
+ rt2800_bbp_write(rt2x00dev, 21, 0x00);
+ rt2800_bbp_write(rt2x00dev, 22, 0x00);
+ rt2800_bbp_write(rt2x00dev, 27, 0x00);
+ rt2800_bbp_write(rt2x00dev, 28, 0x00);
+ rt2800_bbp_write(rt2x00dev, 30, 0x00);
+ rt2800_bbp_write(rt2x00dev, 31, 0x48);
+ rt2800_bbp_write(rt2x00dev, 47, 0x40);
+ rt2800_bbp_write(rt2x00dev, 62, 0x00);
+ rt2800_bbp_write(rt2x00dev, 63, 0x00);
+ rt2800_bbp_write(rt2x00dev, 64, 0x00);
+ rt2800_bbp_write(rt2x00dev, 65, 0x2C);
+ rt2800_bbp_write(rt2x00dev, 66, 0x1C);
+ rt2800_bbp_write(rt2x00dev, 67, 0x20);
+ rt2800_bbp_write(rt2x00dev, 68, 0xDD);
+ rt2800_bbp_write(rt2x00dev, 69, 0x10);
+ rt2800_bbp_write(rt2x00dev, 70, 0x05);
+ rt2800_bbp_write(rt2x00dev, 73, 0x18);
+ rt2800_bbp_write(rt2x00dev, 74, 0x0F);
+ rt2800_bbp_write(rt2x00dev, 75, 0x60);
+ rt2800_bbp_write(rt2x00dev, 76, 0x44);
+ rt2800_bbp_write(rt2x00dev, 77, 0x59);
+ rt2800_bbp_write(rt2x00dev, 78, 0x1E);
+ rt2800_bbp_write(rt2x00dev, 79, 0x1C);
+ rt2800_bbp_write(rt2x00dev, 80, 0x0C);
+ rt2800_bbp_write(rt2x00dev, 81, 0x3A);
+ rt2800_bbp_write(rt2x00dev, 82, 0xB6);
+ rt2800_bbp_write(rt2x00dev, 83, 0x9A);
+ rt2800_bbp_write(rt2x00dev, 84, 0x9A);
+ rt2800_bbp_write(rt2x00dev, 86, 0x38);
+ rt2800_bbp_write(rt2x00dev, 88, 0x90);
+ rt2800_bbp_write(rt2x00dev, 91, 0x04);
+ rt2800_bbp_write(rt2x00dev, 92, 0x02);
+ rt2800_bbp_write(rt2x00dev, 95, 0x9A);
+ rt2800_bbp_write(rt2x00dev, 96, 0x00);
+ rt2800_bbp_write(rt2x00dev, 103, 0xC0);
+ rt2800_bbp_write(rt2x00dev, 104, 0x92);
+ /* FIXME BBP105 owerwrite */
+ rt2800_bbp_write(rt2x00dev, 105, 0x3C);
+ rt2800_bbp_write(rt2x00dev, 106, 0x12);
+ rt2800_bbp_write(rt2x00dev, 109, 0x00);
+ rt2800_bbp_write(rt2x00dev, 134, 0x10);
+ rt2800_bbp_write(rt2x00dev, 135, 0xA6);
+ rt2800_bbp_write(rt2x00dev, 137, 0x04);
+ rt2800_bbp_write(rt2x00dev, 142, 0x30);
+ rt2800_bbp_write(rt2x00dev, 143, 0xF7);
+ rt2800_bbp_write(rt2x00dev, 160, 0xEC);
+ rt2800_bbp_write(rt2x00dev, 161, 0xC4);
+ rt2800_bbp_write(rt2x00dev, 162, 0x77);
+ rt2800_bbp_write(rt2x00dev, 163, 0xF9);
+ rt2800_bbp_write(rt2x00dev, 164, 0x00);
+ rt2800_bbp_write(rt2x00dev, 165, 0x00);
+ rt2800_bbp_write(rt2x00dev, 186, 0x00);
+ rt2800_bbp_write(rt2x00dev, 187, 0x00);
+ rt2800_bbp_write(rt2x00dev, 188, 0x00);
+ rt2800_bbp_write(rt2x00dev, 186, 0x00);
+ rt2800_bbp_write(rt2x00dev, 187, 0x01);
+ rt2800_bbp_write(rt2x00dev, 188, 0x00);
+ rt2800_bbp_write(rt2x00dev, 189, 0x00);
+
+ rt2800_bbp_write(rt2x00dev, 91, 0x06);
+ rt2800_bbp_write(rt2x00dev, 92, 0x04);
+ rt2800_bbp_write(rt2x00dev, 93, 0x54);
+ rt2800_bbp_write(rt2x00dev, 99, 0x50);
+ rt2800_bbp_write(rt2x00dev, 148, 0x84);
+ rt2800_bbp_write(rt2x00dev, 167, 0x80);
+ rt2800_bbp_write(rt2x00dev, 178, 0xFF);
+ rt2800_bbp_write(rt2x00dev, 106, 0x13);
+
+ /* BBP for G band GLRT function (BBP_128 ~ BBP_221) */
+ rt2800_bbp_glrt_write(rt2x00dev, 0, 0x00);
+ rt2800_bbp_glrt_write(rt2x00dev, 1, 0x14);
+ rt2800_bbp_glrt_write(rt2x00dev, 2, 0x20);
+ rt2800_bbp_glrt_write(rt2x00dev, 3, 0x0A);
+ rt2800_bbp_glrt_write(rt2x00dev, 10, 0x16);
+ rt2800_bbp_glrt_write(rt2x00dev, 11, 0x06);
+ rt2800_bbp_glrt_write(rt2x00dev, 12, 0x02);
+ rt2800_bbp_glrt_write(rt2x00dev, 13, 0x07);
+ rt2800_bbp_glrt_write(rt2x00dev, 14, 0x05);
+ rt2800_bbp_glrt_write(rt2x00dev, 15, 0x09);
+ rt2800_bbp_glrt_write(rt2x00dev, 16, 0x20);
+ rt2800_bbp_glrt_write(rt2x00dev, 17, 0x08);
+ rt2800_bbp_glrt_write(rt2x00dev, 18, 0x4A);
+ rt2800_bbp_glrt_write(rt2x00dev, 19, 0x00);
+ rt2800_bbp_glrt_write(rt2x00dev, 20, 0x00);
+ rt2800_bbp_glrt_write(rt2x00dev, 128, 0xE0);
+ rt2800_bbp_glrt_write(rt2x00dev, 129, 0x1F);
+ rt2800_bbp_glrt_write(rt2x00dev, 130, 0x4F);
+ rt2800_bbp_glrt_write(rt2x00dev, 131, 0x32);
+ rt2800_bbp_glrt_write(rt2x00dev, 132, 0x08);
+ rt2800_bbp_glrt_write(rt2x00dev, 133, 0x28);
+ rt2800_bbp_glrt_write(rt2x00dev, 134, 0x19);
+ rt2800_bbp_glrt_write(rt2x00dev, 135, 0x0A);
+ rt2800_bbp_glrt_write(rt2x00dev, 138, 0x16);
+ rt2800_bbp_glrt_write(rt2x00dev, 139, 0x10);
+ rt2800_bbp_glrt_write(rt2x00dev, 140, 0x10);
+ rt2800_bbp_glrt_write(rt2x00dev, 141, 0x1A);
+ rt2800_bbp_glrt_write(rt2x00dev, 142, 0x36);
+ rt2800_bbp_glrt_write(rt2x00dev, 143, 0x2C);
+ rt2800_bbp_glrt_write(rt2x00dev, 144, 0x26);
+ rt2800_bbp_glrt_write(rt2x00dev, 145, 0x24);
+ rt2800_bbp_glrt_write(rt2x00dev, 146, 0x42);
+ rt2800_bbp_glrt_write(rt2x00dev, 147, 0x40);
+ rt2800_bbp_glrt_write(rt2x00dev, 148, 0x30);
+ rt2800_bbp_glrt_write(rt2x00dev, 149, 0x29);
+ rt2800_bbp_glrt_write(rt2x00dev, 150, 0x4C);
+ rt2800_bbp_glrt_write(rt2x00dev, 151, 0x46);
+ rt2800_bbp_glrt_write(rt2x00dev, 152, 0x3D);
+ rt2800_bbp_glrt_write(rt2x00dev, 153, 0x40);
+ rt2800_bbp_glrt_write(rt2x00dev, 154, 0x3E);
+ rt2800_bbp_glrt_write(rt2x00dev, 155, 0x38);
+ rt2800_bbp_glrt_write(rt2x00dev, 156, 0x3D);
+ rt2800_bbp_glrt_write(rt2x00dev, 157, 0x2F);
+ rt2800_bbp_glrt_write(rt2x00dev, 158, 0x3C);
+ rt2800_bbp_glrt_write(rt2x00dev, 159, 0x34);
+ rt2800_bbp_glrt_write(rt2x00dev, 160, 0x2C);
+ rt2800_bbp_glrt_write(rt2x00dev, 161, 0x2F);
+ rt2800_bbp_glrt_write(rt2x00dev, 162, 0x3C);
+ rt2800_bbp_glrt_write(rt2x00dev, 163, 0x35);
+ rt2800_bbp_glrt_write(rt2x00dev, 164, 0x2E);
+ rt2800_bbp_glrt_write(rt2x00dev, 165, 0x2F);
+ rt2800_bbp_glrt_write(rt2x00dev, 166, 0x49);
+ rt2800_bbp_glrt_write(rt2x00dev, 167, 0x41);
+ rt2800_bbp_glrt_write(rt2x00dev, 168, 0x36);
+ rt2800_bbp_glrt_write(rt2x00dev, 169, 0x39);
+ rt2800_bbp_glrt_write(rt2x00dev, 170, 0x30);
+ rt2800_bbp_glrt_write(rt2x00dev, 171, 0x30);
+ rt2800_bbp_glrt_write(rt2x00dev, 172, 0x0E);
+ rt2800_bbp_glrt_write(rt2x00dev, 173, 0x0D);
+ rt2800_bbp_glrt_write(rt2x00dev, 174, 0x28);
+ rt2800_bbp_glrt_write(rt2x00dev, 175, 0x21);
+ rt2800_bbp_glrt_write(rt2x00dev, 176, 0x1C);
+ rt2800_bbp_glrt_write(rt2x00dev, 177, 0x16);
+ rt2800_bbp_glrt_write(rt2x00dev, 178, 0x50);
+ rt2800_bbp_glrt_write(rt2x00dev, 179, 0x4A);
+ rt2800_bbp_glrt_write(rt2x00dev, 180, 0x43);
+ rt2800_bbp_glrt_write(rt2x00dev, 181, 0x50);
+ rt2800_bbp_glrt_write(rt2x00dev, 182, 0x10);
+ rt2800_bbp_glrt_write(rt2x00dev, 183, 0x10);
+ rt2800_bbp_glrt_write(rt2x00dev, 184, 0x10);
+ rt2800_bbp_glrt_write(rt2x00dev, 185, 0x10);
+ rt2800_bbp_glrt_write(rt2x00dev, 200, 0x7D);
+ rt2800_bbp_glrt_write(rt2x00dev, 201, 0x14);
+ rt2800_bbp_glrt_write(rt2x00dev, 202, 0x32);
+ rt2800_bbp_glrt_write(rt2x00dev, 203, 0x2C);
+ rt2800_bbp_glrt_write(rt2x00dev, 204, 0x36);
+ rt2800_bbp_glrt_write(rt2x00dev, 205, 0x4C);
+ rt2800_bbp_glrt_write(rt2x00dev, 206, 0x43);
+ rt2800_bbp_glrt_write(rt2x00dev, 207, 0x2C);
+ rt2800_bbp_glrt_write(rt2x00dev, 208, 0x2E);
+ rt2800_bbp_glrt_write(rt2x00dev, 209, 0x36);
+ rt2800_bbp_glrt_write(rt2x00dev, 210, 0x30);
+ rt2800_bbp_glrt_write(rt2x00dev, 211, 0x6E);
+
+ /* BBP for G band DCOC function */
+ rt2800_bbp_dcoc_write(rt2x00dev, 140, 0x0C);
+ rt2800_bbp_dcoc_write(rt2x00dev, 141, 0x00);
+ rt2800_bbp_dcoc_write(rt2x00dev, 142, 0x10);
+ rt2800_bbp_dcoc_write(rt2x00dev, 143, 0x10);
+ rt2800_bbp_dcoc_write(rt2x00dev, 144, 0x10);
+ rt2800_bbp_dcoc_write(rt2x00dev, 145, 0x10);
+ rt2800_bbp_dcoc_write(rt2x00dev, 146, 0x08);
+ rt2800_bbp_dcoc_write(rt2x00dev, 147, 0x40);
+ rt2800_bbp_dcoc_write(rt2x00dev, 148, 0x04);
+ rt2800_bbp_dcoc_write(rt2x00dev, 149, 0x04);
+ rt2800_bbp_dcoc_write(rt2x00dev, 150, 0x08);
+ rt2800_bbp_dcoc_write(rt2x00dev, 151, 0x08);
+ rt2800_bbp_dcoc_write(rt2x00dev, 152, 0x03);
+ rt2800_bbp_dcoc_write(rt2x00dev, 153, 0x03);
+ rt2800_bbp_dcoc_write(rt2x00dev, 154, 0x03);
+ rt2800_bbp_dcoc_write(rt2x00dev, 155, 0x02);
+ rt2800_bbp_dcoc_write(rt2x00dev, 156, 0x40);
+ rt2800_bbp_dcoc_write(rt2x00dev, 157, 0x40);
+ rt2800_bbp_dcoc_write(rt2x00dev, 158, 0x64);
+ rt2800_bbp_dcoc_write(rt2x00dev, 159, 0x64);
+
+ rt2800_bbp4_mac_if_ctrl(rt2x00dev);
+}
+
static void rt2800_init_bbp(struct rt2x00_dev *rt2x00dev)
{
unsigned int i;
@@ -5830,6 +6556,9 @@ static void rt2800_init_bbp(struct rt2x00_dev *rt2x00dev)
case RT5592:
rt2800_init_bbp_5592(rt2x00dev);
return;
+ case RT6352:
+ rt2800_init_bbp_6352(rt2x00dev);
+ break;
}
for (i = 0; i < EEPROM_BBP_SIZE; i++) {
@@ -6901,6 +7630,615 @@ static void rt2800_init_rfcsr_5592(struct rt2x00_dev *rt2x00dev)
rt2800_led_open_drain_enable(rt2x00dev);
}
+static void rt2800_bbp_core_soft_reset(struct rt2x00_dev *rt2x00dev,
+ bool set_bw, bool is_ht40)
+{
+ u8 bbp_val;
+
+ rt2800_bbp_read(rt2x00dev, 21, &bbp_val);
+ bbp_val |= 0x1;
+ rt2800_bbp_write(rt2x00dev, 21, bbp_val);
+ usleep_range(100, 200);
+
+ if (set_bw) {
+ rt2800_bbp_read(rt2x00dev, 4, &bbp_val);
+ rt2x00_set_field8(&bbp_val, BBP4_BANDWIDTH, 2 * is_ht40);
+ rt2800_bbp_write(rt2x00dev, 4, bbp_val);
+ usleep_range(100, 200);
+ }
+
+ rt2800_bbp_read(rt2x00dev, 21, &bbp_val);
+ bbp_val &= (~0x1);
+ rt2800_bbp_write(rt2x00dev, 21, bbp_val);
+ usleep_range(100, 200);
+}
+
+static int rt2800_rf_lp_config(struct rt2x00_dev *rt2x00dev, bool btxcal)
+{
+ u8 rf_val;
+
+ if (btxcal)
+ rt2800_register_write(rt2x00dev, RF_CONTROL0, 0x04);
+ else
+ rt2800_register_write(rt2x00dev, RF_CONTROL0, 0x02);
+
+ rt2800_register_write(rt2x00dev, RF_BYPASS0, 0x06);
+
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 17, &rf_val);
+ rf_val |= 0x80;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 17, rf_val);
+
+ if (btxcal) {
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 18, 0xC1);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 19, 0x20);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 20, 0x02);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 3, &rf_val);
+ rf_val &= (~0x3F);
+ rf_val |= 0x3F;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 3, rf_val);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 4, &rf_val);
+ rf_val &= (~0x3F);
+ rf_val |= 0x3F;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 4, rf_val);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 5, 0x31);
+ } else {
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 18, 0xF1);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 19, 0x18);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 20, 0x02);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 3, &rf_val);
+ rf_val &= (~0x3F);
+ rf_val |= 0x34;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 3, rf_val);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 4, &rf_val);
+ rf_val &= (~0x3F);
+ rf_val |= 0x34;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 4, rf_val);
+ }
+
+ return 0;
+}
+
+static char rt2800_lp_tx_filter_bw_cal(struct rt2x00_dev *rt2x00dev)
+{
+ unsigned int cnt;
+ u8 bbp_val;
+ char cal_val;
+
+ rt2800_bbp_dcoc_write(rt2x00dev, 0, 0x82);
+
+ cnt = 0;
+ do {
+ usleep_range(500, 2000);
+ rt2800_bbp_read(rt2x00dev, 159, &bbp_val);
+ if (bbp_val == 0x02 || cnt == 20)
+ break;
+
+ cnt++;
+ } while (cnt < 20);
+
+ rt2800_bbp_dcoc_read(rt2x00dev, 0x39, &bbp_val);
+ cal_val = bbp_val & 0x7F;
+ if (cal_val >= 0x40)
+ cal_val -= 128;
+
+ return cal_val;
+}
+
+static void rt2800_bw_filter_calibration(struct rt2x00_dev *rt2x00dev,
+ bool btxcal)
+{
+ struct rt2800_drv_data *drv_data = rt2x00dev->drv_data;
+ u8 tx_agc_fc = 0, rx_agc_fc = 0, cmm_agc_fc;
+ u8 filter_target;
+ u8 tx_filter_target_20m = 0x09, tx_filter_target_40m = 0x02;
+ u8 rx_filter_target_20m = 0x27, rx_filter_target_40m = 0x31;
+ int loop = 0, is_ht40, cnt;
+ u8 bbp_val, rf_val;
+ char cal_r32_init, cal_r32_val, cal_diff;
+ u8 saverfb5r00, saverfb5r01, saverfb5r03, saverfb5r04, saverfb5r05;
+ u8 saverfb5r06, saverfb5r07;
+ u8 saverfb5r08, saverfb5r17, saverfb5r18, saverfb5r19, saverfb5r20;
+ u8 saverfb5r37, saverfb5r38, saverfb5r39, saverfb5r40, saverfb5r41;
+ u8 saverfb5r42, saverfb5r43, saverfb5r44, saverfb5r45, saverfb5r46;
+ u8 saverfb5r58, saverfb5r59;
+ u8 savebbp159r0, savebbp159r2, savebbpr23;
+ u32 MAC_RF_CONTROL0, MAC_RF_BYPASS0;
+
+ /* Save MAC registers */
+ rt2800_register_read(rt2x00dev, RF_CONTROL0, &MAC_RF_CONTROL0);
+ rt2800_register_read(rt2x00dev, RF_BYPASS0, &MAC_RF_BYPASS0);
+
+ /* save BBP registers */
+ rt2800_bbp_read(rt2x00dev, 23, &savebbpr23);
+
+ rt2800_bbp_dcoc_read(rt2x00dev, 0, &savebbp159r0);
+ rt2800_bbp_dcoc_read(rt2x00dev, 2, &savebbp159r2);
+
+ /* Save RF registers */
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 0, &saverfb5r00);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 1, &saverfb5r01);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 3, &saverfb5r03);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 4, &saverfb5r04);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 5, &saverfb5r05);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 6, &saverfb5r06);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 7, &saverfb5r07);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 8, &saverfb5r08);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 17, &saverfb5r17);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 18, &saverfb5r18);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 19, &saverfb5r19);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 20, &saverfb5r20);
+
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 37, &saverfb5r37);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 38, &saverfb5r38);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 39, &saverfb5r39);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 40, &saverfb5r40);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 41, &saverfb5r41);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 42, &saverfb5r42);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 43, &saverfb5r43);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 44, &saverfb5r44);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 45, &saverfb5r45);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 46, &saverfb5r46);
+
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 58, &saverfb5r58);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 59, &saverfb5r59);
+
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 0, &rf_val);
+ rf_val |= 0x3;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 0, rf_val);
+
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 1, &rf_val);
+ rf_val |= 0x1;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 1, rf_val);
+
+ cnt = 0;
+ do {
+ usleep_range(500, 2000);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 1, &rf_val);
+ if (((rf_val & 0x1) == 0x00) || (cnt == 40))
+ break;
+ cnt++;
+ } while (cnt < 40);
+
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 0, &rf_val);
+ rf_val &= (~0x3);
+ rf_val |= 0x1;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 0, rf_val);
+
+ /* I-3 */
+ rt2800_bbp_read(rt2x00dev, 23, &bbp_val);
+ bbp_val &= (~0x1F);
+ bbp_val |= 0x10;
+ rt2800_bbp_write(rt2x00dev, 23, bbp_val);
+
+ do {
+ /* I-4,5,6,7,8,9 */
+ if (loop == 0) {
+ is_ht40 = false;
+
+ if (btxcal)
+ filter_target = tx_filter_target_20m;
+ else
+ filter_target = rx_filter_target_20m;
+ } else {
+ is_ht40 = true;
+
+ if (btxcal)
+ filter_target = tx_filter_target_40m;
+ else
+ filter_target = rx_filter_target_40m;
+ }
+
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 8, &rf_val);
+ rf_val &= (~0x04);
+ if (loop == 1)
+ rf_val |= 0x4;
+
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 8, rf_val);
+
+ rt2800_bbp_core_soft_reset(rt2x00dev, true, is_ht40);
+
+ rt2800_rf_lp_config(rt2x00dev, btxcal);
+ if (btxcal) {
+ tx_agc_fc = 0;
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 58, &rf_val);
+ rf_val &= (~0x7F);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 58, rf_val);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 59, &rf_val);
+ rf_val &= (~0x7F);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 59, rf_val);
+ } else {
+ rx_agc_fc = 0;
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 6, &rf_val);
+ rf_val &= (~0x7F);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 6, rf_val);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 7, &rf_val);
+ rf_val &= (~0x7F);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 7, rf_val);
+ }
+
+ usleep_range(1000, 2000);
+
+ rt2800_bbp_dcoc_read(rt2x00dev, 2, &bbp_val);
+ bbp_val &= (~0x6);
+ rt2800_bbp_dcoc_write(rt2x00dev, 2, bbp_val);
+
+ rt2800_bbp_core_soft_reset(rt2x00dev, false, is_ht40);
+
+ cal_r32_init = rt2800_lp_tx_filter_bw_cal(rt2x00dev);
+
+ rt2800_bbp_dcoc_read(rt2x00dev, 2, &bbp_val);
+ bbp_val |= 0x6;
+ rt2800_bbp_dcoc_write(rt2x00dev, 2, bbp_val);
+do_cal:
+ if (btxcal) {
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 58, &rf_val);
+ rf_val &= (~0x7F);
+ rf_val |= tx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 58, rf_val);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 59, &rf_val);
+ rf_val &= (~0x7F);
+ rf_val |= tx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 59, rf_val);
+ } else {
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 6, &rf_val);
+ rf_val &= (~0x7F);
+ rf_val |= rx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 6, rf_val);
+ rt2800_rfcsr_read_bank(rt2x00dev, 5, 7, &rf_val);
+ rf_val &= (~0x7F);
+ rf_val |= rx_agc_fc;
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 7, rf_val);
+ }
+
+ usleep_range(500, 1000);
+
+ rt2800_bbp_core_soft_reset(rt2x00dev, false, is_ht40);
+
+ cal_r32_val = rt2800_lp_tx_filter_bw_cal(rt2x00dev);
+
+ cal_diff = cal_r32_init - cal_r32_val;
+
+ if (btxcal)
+ cmm_agc_fc = tx_agc_fc;
+ else
+ cmm_agc_fc = rx_agc_fc;
+
+ if (((cal_diff > filter_target) && (cmm_agc_fc == 0)) ||
+ ((cal_diff < filter_target) && (cmm_agc_fc == 0x3f))) {
+ if (btxcal)
+ tx_agc_fc = 0;
+ else
+ rx_agc_fc = 0;
+ } else if ((cal_diff <= filter_target) && (cmm_agc_fc < 0x3f)) {
+ if (btxcal)
+ tx_agc_fc++;
+ else
+ rx_agc_fc++;
+ goto do_cal;
+ }
+
+ if (btxcal) {
+ if (loop == 0)
+ drv_data->tx_calibration_bw20 = tx_agc_fc;
+ else
+ drv_data->tx_calibration_bw40 = tx_agc_fc;
+ } else {
+ if (loop == 0)
+ drv_data->rx_calibration_bw20 = rx_agc_fc;
+ else
+ drv_data->rx_calibration_bw40 = rx_agc_fc;
+ }
+
+ loop++;
+ } while (loop <= 1);
+
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 0, saverfb5r00);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 1, saverfb5r01);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 3, saverfb5r03);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 4, saverfb5r04);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 5, saverfb5r05);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 6, saverfb5r06);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 7, saverfb5r07);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 8, saverfb5r08);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 17, saverfb5r17);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 18, saverfb5r18);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 19, saverfb5r19);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 20, saverfb5r20);
+
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 37, saverfb5r37);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 38, saverfb5r38);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 39, saverfb5r39);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 40, saverfb5r40);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 41, saverfb5r41);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 42, saverfb5r42);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 43, saverfb5r43);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 44, saverfb5r44);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 45, saverfb5r45);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 46, saverfb5r46);
+
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 58, saverfb5r58);
+ rt2800_rfcsr_write_bank(rt2x00dev, 5, 59, saverfb5r59);
+
+ rt2800_bbp_write(rt2x00dev, 23, savebbpr23);
+
+ rt2800_bbp_dcoc_write(rt2x00dev, 0, savebbp159r0);
+ rt2800_bbp_dcoc_write(rt2x00dev, 2, savebbp159r2);
+
+ rt2800_bbp_read(rt2x00dev, 4, &bbp_val);
+ rt2x00_set_field8(&bbp_val, BBP4_BANDWIDTH,
+ 2 * test_bit(CONFIG_CHANNEL_HT40, &rt2x00dev->flags));
+ rt2800_bbp_write(rt2x00dev, 4, bbp_val);
+
+ rt2800_register_write(rt2x00dev, RF_CONTROL0, MAC_RF_CONTROL0);
+ rt2800_register_write(rt2x00dev, RF_BYPASS0, MAC_RF_BYPASS0);
+}
+
+static void rt2800_init_rfcsr_6352(struct rt2x00_dev *rt2x00dev)
+{
+ /* Initialize RF central register to default value */
+ rt2800_rfcsr_write(rt2x00dev, 0, 0x02);
+ rt2800_rfcsr_write(rt2x00dev, 1, 0x03);
+ rt2800_rfcsr_write(rt2x00dev, 2, 0x33);
+ rt2800_rfcsr_write(rt2x00dev, 3, 0xFF);
+ rt2800_rfcsr_write(rt2x00dev, 4, 0x0C);
+ rt2800_rfcsr_write(rt2x00dev, 5, 0x40);
+ rt2800_rfcsr_write(rt2x00dev, 6, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 7, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 8, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 9, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 10, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 11, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 12, rt2x00dev->freq_offset);
+ rt2800_rfcsr_write(rt2x00dev, 13, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 14, 0x40);
+ rt2800_rfcsr_write(rt2x00dev, 15, 0x22);
+ rt2800_rfcsr_write(rt2x00dev, 16, 0x4C);
+ rt2800_rfcsr_write(rt2x00dev, 17, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 18, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 19, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 20, 0xA0);
+ rt2800_rfcsr_write(rt2x00dev, 21, 0x12);
+ rt2800_rfcsr_write(rt2x00dev, 22, 0x07);
+ rt2800_rfcsr_write(rt2x00dev, 23, 0x13);
+ rt2800_rfcsr_write(rt2x00dev, 24, 0xFE);
+ rt2800_rfcsr_write(rt2x00dev, 25, 0x24);
+ rt2800_rfcsr_write(rt2x00dev, 26, 0x7A);
+ rt2800_rfcsr_write(rt2x00dev, 27, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 28, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 29, 0x05);
+ rt2800_rfcsr_write(rt2x00dev, 30, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 31, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 32, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 33, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 34, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 35, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 36, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 37, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 38, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 39, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 40, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 41, 0xD0);
+ rt2800_rfcsr_write(rt2x00dev, 42, 0x5B);
+ rt2800_rfcsr_write(rt2x00dev, 43, 0x00);
+
+ rt2800_rfcsr_write(rt2x00dev, 11, 0x21);
+ if (rt2800_clk_is_20mhz(rt2x00dev))
+ rt2800_rfcsr_write(rt2x00dev, 13, 0x03);
+ else
+ rt2800_rfcsr_write(rt2x00dev, 13, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 14, 0x7C);
+ rt2800_rfcsr_write(rt2x00dev, 16, 0x80);
+ rt2800_rfcsr_write(rt2x00dev, 17, 0x99);
+ rt2800_rfcsr_write(rt2x00dev, 18, 0x99);
+ rt2800_rfcsr_write(rt2x00dev, 19, 0x09);
+ rt2800_rfcsr_write(rt2x00dev, 20, 0x50);
+ rt2800_rfcsr_write(rt2x00dev, 21, 0xB0);
+ rt2800_rfcsr_write(rt2x00dev, 22, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 23, 0x06);
+ rt2800_rfcsr_write(rt2x00dev, 24, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 25, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 26, 0x5D);
+ rt2800_rfcsr_write(rt2x00dev, 27, 0x00);
+ rt2800_rfcsr_write(rt2x00dev, 28, 0x61);
+ rt2800_rfcsr_write(rt2x00dev, 29, 0xB5);
+ rt2800_rfcsr_write(rt2x00dev, 43, 0x02);
+
+ rt2800_rfcsr_write(rt2x00dev, 28, 0x62);
+ rt2800_rfcsr_write(rt2x00dev, 29, 0xAD);
+ rt2800_rfcsr_write(rt2x00dev, 39, 0x80);
+
+ /* Initialize RF channel register to default value */
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 0, 0x03);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 1, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 2, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 3, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 4, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 5, 0x08);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 6, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 7, 0x51);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 8, 0x53);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 9, 0x16);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 10, 0x61);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 11, 0x53);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 12, 0x22);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 13, 0x3D);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 14, 0x06);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 15, 0x13);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 16, 0x22);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 17, 0x27);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 18, 0x02);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 19, 0xA7);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 20, 0x01);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 21, 0x52);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 22, 0x80);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 23, 0xB3);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 24, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 25, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 26, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 27, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 28, 0x5C);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 29, 0x6B);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 30, 0x6B);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 31, 0x31);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 32, 0x5D);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 33, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 34, 0xE6);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 35, 0x55);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 36, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 37, 0xBB);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 38, 0xB3);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 39, 0xB3);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 40, 0x03);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 41, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 42, 0x00);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 43, 0xB3);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 44, 0xD3);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 45, 0xD5);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 46, 0x07);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 47, 0x68);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 48, 0xEF);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 49, 0x1C);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 54, 0x07);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 55, 0xA8);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 56, 0x85);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 57, 0x10);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 58, 0x07);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 59, 0x6A);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 60, 0x85);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 61, 0x10);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 62, 0x1C);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 63, 0x00);
+
+ rt2800_rfcsr_write_bank(rt2x00dev, 6, 45, 0xC5);
+
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 9, 0x47);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 10, 0x71);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 11, 0x33);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 14, 0x0E);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 17, 0x23);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 19, 0xA4);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 20, 0x02);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 21, 0x12);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 28, 0x1C);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 29, 0xEB);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 32, 0x7D);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 34, 0xD6);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 36, 0x08);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 38, 0xB4);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 43, 0xD3);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 44, 0xB3);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 45, 0xD5);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 46, 0x27);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 47, 0x69);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 48, 0xFF);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 54, 0x20);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 55, 0x66);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 56, 0xFF);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 57, 0x1C);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 58, 0x20);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 59, 0x6B);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 60, 0xF7);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 61, 0x09);
+
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 10, 0x51);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 14, 0x06);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 19, 0xA7);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 28, 0x2C);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 55, 0x64);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 8, 0x51);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 9, 0x36);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 11, 0x53);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 14, 0x16);
+
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 47, 0x6C);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 48, 0xFC);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 49, 0x1F);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 54, 0x27);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 55, 0x66);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 59, 0x6B);
+
+ /* Initialize RF channel register for DRQFN */
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 43, 0xD3);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 44, 0xE3);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 45, 0xE5);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 47, 0x28);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 55, 0x68);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 56, 0xF7);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 58, 0x02);
+ rt2800_rfcsr_write_chanreg(rt2x00dev, 60, 0xC7);
+
+ /* Initialize RF DC calibration register to default value */
+ rt2800_rfcsr_write_dccal(rt2x00dev, 0, 0x47);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 1, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 2, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 3, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 4, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 5, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 6, 0x10);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 7, 0x10);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 8, 0x04);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 9, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 10, 0x07);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 11, 0x01);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 12, 0x07);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 13, 0x07);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 14, 0x07);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 15, 0x20);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 16, 0x22);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 17, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 18, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 19, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 20, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 21, 0xF1);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 22, 0x11);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 23, 0x02);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 24, 0x41);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 25, 0x20);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 26, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 27, 0xD7);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 28, 0xA2);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 29, 0x20);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 30, 0x49);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 31, 0x20);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 32, 0x04);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 33, 0xF1);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 34, 0xA1);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 35, 0x01);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 41, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 42, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 43, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 44, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 45, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 46, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 47, 0x3E);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 48, 0x3D);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 49, 0x3E);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 50, 0x3D);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 51, 0x3E);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 52, 0x3D);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 53, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 54, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 55, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 56, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 57, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 58, 0x10);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 59, 0x10);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 60, 0x0A);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 61, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 62, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 63, 0x00);
+
+ rt2800_rfcsr_write_dccal(rt2x00dev, 3, 0x08);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 4, 0x04);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 5, 0x20);
+
+ rt2800_rfcsr_write_dccal(rt2x00dev, 5, 0x00);
+ rt2800_rfcsr_write_dccal(rt2x00dev, 17, 0x7C);
+
+ rt2800_bw_filter_calibration(rt2x00dev, true);
+ rt2800_bw_filter_calibration(rt2x00dev, false);
+}
+
static void rt2800_init_rfcsr(struct rt2x00_dev *rt2x00dev)
{
if (rt2800_is_305x_soc(rt2x00dev)) {
@@ -6941,6 +8279,9 @@ static void rt2800_init_rfcsr(struct rt2x00_dev *rt2x00dev)
case RT5592:
rt2800_init_rfcsr_5592(rt2x00dev);
break;
+ case RT6352:
+ rt2800_init_rfcsr_6352(rt2x00dev);
+ break;
}
}
@@ -7307,7 +8648,8 @@ static int rt2800_init_eeprom(struct rt2x00_dev *rt2x00dev)
*/
if (rt2x00_rt(rt2x00dev, RT3290) ||
rt2x00_rt(rt2x00dev, RT5390) ||
- rt2x00_rt(rt2x00dev, RT5392))
+ rt2x00_rt(rt2x00dev, RT5392) ||
+ rt2x00_rt(rt2x00dev, RT6352))
rt2800_eeprom_read(rt2x00dev, EEPROM_CHIP_ID, &rf);
else if (rt2x00_rt(rt2x00dev, RT3352))
rf = RF3322;
@@ -7339,6 +8681,7 @@ static int rt2800_init_eeprom(struct rt2x00_dev *rt2x00dev)
case RF5390:
case RF5392:
case RF5592:
+ case RF7620:
break;
default:
rt2x00_err(rt2x00dev, "Invalid RF chipset 0x%04x detected\n",
@@ -7746,6 +9089,23 @@ static const struct rf_channel rf_vals_5592_xtal40[] = {
{196, 83, 0, 12, 1},
};
+static const struct rf_channel rf_vals_7620[] = {
+ {1, 0x50, 0x99, 0x99, 1},
+ {2, 0x50, 0x44, 0x44, 2},
+ {3, 0x50, 0xEE, 0xEE, 2},
+ {4, 0x50, 0x99, 0x99, 3},
+ {5, 0x51, 0x44, 0x44, 0},
+ {6, 0x51, 0xEE, 0xEE, 0},
+ {7, 0x51, 0x99, 0x99, 1},
+ {8, 0x51, 0x44, 0x44, 2},
+ {9, 0x51, 0xEE, 0xEE, 2},
+ {10, 0x51, 0x99, 0x99, 3},
+ {11, 0x52, 0x44, 0x44, 0},
+ {12, 0x52, 0xEE, 0xEE, 0},
+ {13, 0x52, 0x99, 0x99, 1},
+ {14, 0x52, 0x33, 0x33, 3},
+};
+
static int rt2800_probe_hw_mode(struct rt2x00_dev *rt2x00dev)
{
struct hw_mode_spec *spec = &rt2x00dev->spec;
@@ -7849,6 +9209,11 @@ static int rt2800_probe_hw_mode(struct rt2x00_dev *rt2x00dev)
spec->channels = rf_vals_3x;
break;
+ case RF7620:
+ spec->num_channels = ARRAY_SIZE(rf_vals_7620);
+ spec->channels = rf_vals_7620;
+ break;
+
case RF3052:
case RF3053:
spec->num_channels = ARRAY_SIZE(rf_vals_3x);
@@ -7980,6 +9345,7 @@ static int rt2800_probe_hw_mode(struct rt2x00_dev *rt2x00dev)
case RF5390:
case RF5392:
case RF5592:
+ case RF7620:
__set_bit(CAPABILITY_VCO_RECALIBRATION, &rt2x00dev->cap_flags);
break;
}
@@ -8024,6 +9390,9 @@ static int rt2800_probe_rt(struct rt2x00_dev *rt2x00dev)
return -ENODEV;
}
+ if (rt == RT5390 && rt2x00_is_soc(rt2x00dev))
+ rt = RT6352;
+
rt2x00_set_rt(rt2x00dev, rt, rev);
return 0;
diff --git a/drivers/net/wireless/ralink/rt2x00/rt2800lib.h b/drivers/net/wireless/ralink/rt2x00/rt2800lib.h
index d9ef260d542a..f357531d9488 100644
--- a/drivers/net/wireless/ralink/rt2x00/rt2800lib.h
+++ b/drivers/net/wireless/ralink/rt2x00/rt2800lib.h
@@ -33,6 +33,10 @@
struct rt2800_drv_data {
u8 calibration_bw20;
u8 calibration_bw40;
+ char rx_calibration_bw20;
+ char rx_calibration_bw40;
+ char tx_calibration_bw20;
+ char tx_calibration_bw40;
u8 bbp25;
u8 bbp26;
u8 txmixer_gain_24g;
diff --git a/drivers/net/wireless/ralink/rt2x00/rt2x00.h b/drivers/net/wireless/ralink/rt2x00/rt2x00.h
index ce340bfd71a0..8fdd2f9726ee 100644
--- a/drivers/net/wireless/ralink/rt2x00/rt2x00.h
+++ b/drivers/net/wireless/ralink/rt2x00/rt2x00.h
@@ -174,6 +174,7 @@ struct rt2x00_chip {
#define RT5390 0x5390 /* 2.4GHz */
#define RT5392 0x5392 /* 2.4GHz */
#define RT5592 0x5592
+#define RT6352 0x6352 /* WSOC 2.4GHz */
u16 rf;
u16 rev;
--
2.12.1
|
First Congregational Church (Sandusky, Ohio)
First Congregational Church, also known as First Congregational United Church of Christ, is an historic church located at 431 Columbus Avenue in Sandusky, Ohio. Designed in the Romanesque Revival style of architecture, it was built in 1895 by Sandusky builder George Philip Feick (1849-1932). On October 20, 1982, it was added to the National Register of Historic Places. First Congregational is still an active member of the United Church of Christ.
References
Category:Churches on the National Register of Historic Places in Ohio
Category:Romanesque Revival church buildings in Ohio
Category:Churches completed in 1895
Category:Churches in Erie County, Ohio
Category:National Register of Historic Places in Erie County, Ohio
Category:United Church of Christ churches in Ohio
|
James Sherwin
James Terry Sherwin (born October 25, 1933) is an American corporate executive and International Master in chess.
Born in New York City in 1933, Sherwin attended Stuyvesant High School, Columbia College (Phi Beta Kappa) and Columbia Law School. He graduated from the U.S. Coast Guard Academy Officer Candidate School in 1956 and later became a Lieutenant Commander. He is an attorney admitted to the New York and Supreme Court Bars. He joined GAF Corporation in 1960 serving in various legal and operational roles and eventually becoming its Chief Financial Officer. He was CFO at Triangle Industries from 1983 to 1984, rejoining GAF Corporation as Vice Chairman from 1985 to 1990.
While at GAF, in 1988, he was indicted by the US Attorney for the Southern District of New York, Rudolph Giuliani, for stock manipulation in connection with the 1986 sale of stock owned by GAF. He was convicted after three trials, but the conviction was reversed on appeal and dismissed with prejudice. In 1991 he was appointed Executive Vice President and Chief Financial Officer of Hunter Douglas N.V., a Dutch multinational company, in which capacity he served until 1999. Since then he has been a Director and an adviser to Hunter Douglas.
He is an Overseer of the International Rescue Committee and member of the Association of the Bar of the City of New York. He received an Honorary Doctor of Laws Degree from the University of Bath in December, 2007.
In chess, Sherwin finished third and tied for third in the US Chess Championship four times and tied for fourth three times. He was Intercollegiate Champion and New York State Champion in 1951 and US Speed Champion in 1956–57 and 1959–60. He earned the International Master title in 1958. He played in the Portorož Interzonal in 1958, which was part of the 1960 World Championship cycle. While he finished only 17th out of 21 players, he scored (+2–2=2) against the six players who qualified from the tournament to the Candidates tournament at Bled 1959. He is a previous President of the American Chess Foundation.
Sherwin resides with his wife, Hiroko, near Bath, United Kingdom.
References
External links
Category:1933 births
Category:Living people
Category:American chess players
Category:Chess International Masters
Category:Columbia Law School alumni
Category:Stuyvesant High School alumni
Category:American chief financial officers
Category:Sportspeople from New York City
Category:Columbia College (New York) alumni
|
Hypnotizing Illustration of Rent Your Apartment
Gallery of Rent Your Apartment
DB Orchid Heights by DB Realty located at Mahalaxmi encompasses 2 towers of 77 and 50 storey respectively. The exclusive 4 BHK flats offers unrestricted views of Haji Ali, Willingdon sports club etc. This property has close proximity to business districts of BKC and Lower Parel; Palladium Mall, NSS Hill spring school etc. This project gives the choicest of amenities 800 meter jogging track, swimming pools, private movie theatre, amphitheater etc.One the most affordable states in New England area, New Hampshire Apartments can be found in a wide range of locations and prices. All in all one can find both great job options and plenty to do in this state that makes it very worth looking into.
Living/Dining and all rooms have arrangement for AC. All entryway screen have overlay completing with synchronized lighting highlight for principle entryway shade. Every one of the rooms in flats have powder covered aluminum sliding windows with mosquito net.
4) If your building has an intercom system, use it wisely. If you do not know the person who rang your intercom, do not "buzz" them in - even if they claim to be a friend of another tenant. Awkward perhaps, but you can always say "I'm sorry but I don't know you so I cant let you in." Cost: Free
10) Install a motion sensor alarm. Wireless units like the LaserShield system require no installation and are portable when you move to another apartment or home. Motion sensors immediately detect an intruder and emit a loud siren, and can also be professionally monitored. Cost: under $200.00.Once you have found the perfect apartment and executed all the paper work you can now move in and enjoy the place.
|
adaasn1rtl specification is in adaasn1rtl.ads
adaasn1rtl body is in adaasn1rtl.adb
mymodule specification is in mymodule.ads
mymodule body is in mymodule.adb
|
1. The Field of the Invention
The present invention generally relates to a structure of surface-adhered the light emitting diode display device, and more particularly, to a light emitting diode display device having a lower circuit board and an upper circuit board stacked on the lower circuit board forming a protruded circuit board, wherein the protruded circuit board is covered by a frame which securely joints with the upper and lower circuit board for effectively preventing the sidewall of the frame of the display device flit outwardly, as well as to reinforce the structure to resist an external force.
2. Description of the Related Art
With the rapid advances in high-tech electronic information industry, several valuable electronic products have advanced functions to provide users prompt service and convenience, leading to a high-tech civilization. When enjoying the pleasure brought such high-tech products, at work or in daily activities, the high-tech products have become a part of users' life. Among these valuable high-tech products, only few of them comprise light-emitting diode display for displaying the execution of speed, time, channel and other operational information.
The general light-emitting diode display has a light-emitting diode crystal and IC on the circuit board, and the arrangement of circuit board may be a single layer or a double layer. The single layer circuit board has copper foil loop or IC, and light-emitting diode crystal positioned on its upper and lower side, with an outer frame covering directly onto the circuit board, or alternatively, a resin is injected to joint the outer frame with the circuit board. For the double layer circuit board, after stacking the two boards, the copper foil loop or IC, and light-emitting diode crystal are set on the circuit board. Next, a frame is directly covered onto the resulting structure or alternatively, a resin is injected to joint the outer frame with the circuit board. Referring to FIGS. 7 and 8, the elevational view of the conventional light-emitting diode display device and the sectional view taken along the line a—a of the structure shown in FIG. 7 respectively are shown. The conventional light-emitting diode display A comprises a circuit board B, an IC B1, a light-emitting diode crystal, and a frame C. The IC B1 and the light-emitting diode crystal are disposed on the circuit board B, and the frame C is directly covered onto the circuit board B and a resin D is injected securely adhere the frame C to the circuit board B. However, such conventional light-emitting diode display A has the following defects.
The frame C is jointed with the circuit board B (single or double layer) only with one side. Because the joint surface thereof is small, and therefore the jointing cannot be substantially secure.
Because of the small joint surface, the transfiguration or loss of original shape could easily occur due to change of the surrounding temperature, and may result in flitting up of the frame on the sidewall or the frame may come loose.
Because of the weak structure of the sidewall of the frame, the frame could easily flit up or become loose causing loose contact between the IC B1 and the light-emitting diode crystal and thereby adversely affecting the display function of the light-emitting diode display A.
Accordingly, it is highly desirable to improve the structure of the conventional light emitting diode display to overcome the above defects.
|
# The MIT License (MIT)
#
# Copyright (c) 2018 George Marques
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in all
# copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
tool
extends Reference
# Constants for tile flipping
# http://doc.mapeditor.org/reference/tmx-map-format/#tile-flipping
const FLIPPED_HORIZONTALLY_FLAG = 0x80000000
const FLIPPED_VERTICALLY_FLAG = 0x40000000
const FLIPPED_DIAGONALLY_FLAG = 0x20000000
# XML Format reader
const TiledXMLToDictionary = preload("tiled_xml_to_dict.gd")
# Polygon vertices sorter
const PolygonSorter = preload("polygon_sorter.gd")
# Prefix for error messages, make easier to identify the source
const error_prefix = "Tiled Importer: "
# Properties to save the value in the metadata
const whitelist_properties = [
"backgroundcolor",
"compression",
"draworder",
"gid",
"height",
"imageheight",
"imagewidth",
"infinite",
"margin",
"name",
"orientation",
"probability",
"spacing",
"tilecount",
"tiledversion",
"tileheight",
"tilewidth",
"type",
"version",
"visible",
"width",
]
# All templates loaded, can be looked up by path name
var _loaded_templates = {}
# Maps each tileset file used by the map to it's first gid; Used for template parsing
var _tileset_path_to_first_gid = {}
func reset_global_memebers():
_loaded_templates = {}
_tileset_path_to_first_gid = {}
# Main function
# Reads a source file and gives back a scene
func build(source_path, options):
reset_global_memebers()
var map = read_file(source_path)
if typeof(map) == TYPE_INT:
return map
if typeof(map) != TYPE_DICTIONARY:
return ERR_INVALID_DATA
var err = validate_map(map)
if err != OK:
return err
var cell_size = Vector2(int(map.tilewidth), int(map.tileheight))
var map_mode = TileMap.MODE_SQUARE
var map_offset = TileMap.HALF_OFFSET_DISABLED
var map_pos_offset = Vector2()
var map_background = Color()
var cell_offset = Vector2()
if "orientation" in map:
match map.orientation:
"isometric":
map_mode = TileMap.MODE_ISOMETRIC
"staggered":
map_pos_offset.y -= cell_size.y / 2
match map.staggeraxis:
"x":
map_offset = TileMap.HALF_OFFSET_Y
cell_size.x /= 2.0
if map.staggerindex == "even":
cell_offset.x += 1
map_pos_offset.x -= cell_size.x
"y":
map_offset = TileMap.HALF_OFFSET_X
cell_size.y /= 2.0
if map.staggerindex == "even":
cell_offset.y += 1
map_pos_offset.y -= cell_size.y
"hexagonal":
# Godot maps are always odd and don't have an "even" setting. To
# imitate even staggering we simply start one row/column late and
# adjust the position of the whole map.
match map.staggeraxis:
"x":
map_offset = TileMap.HALF_OFFSET_Y
cell_size.x = int((cell_size.x + map.hexsidelength) / 2)
if map.staggerindex == "even":
cell_offset.x += 1
map_pos_offset.x -= cell_size.x
"y":
map_offset = TileMap.HALF_OFFSET_X
cell_size.y = int((cell_size.y + map.hexsidelength) / 2)
if map.staggerindex == "even":
cell_offset.y += 1
map_pos_offset.y -= cell_size.y
var tileset = build_tileset_for_scene(map.tilesets, source_path, options)
if typeof(tileset) != TYPE_OBJECT:
# Error happened
return tileset
var root = Node2D.new()
root.set_name(source_path.get_file().get_basename())
if options.save_tiled_properties:
set_tiled_properties_as_meta(root, map)
if options.custom_properties:
set_custom_properties(root, map)
var map_data = {
"options": options,
"map_mode": map_mode,
"map_offset": map_offset,
"map_pos_offset": map_pos_offset,
"map_background": map_background,
"cell_size": cell_size,
"cell_offset": cell_offset,
"tileset": tileset,
"source_path": source_path,
"infinite": bool(map.infinite) if "infinite" in map else false
}
for layer in map.layers:
err = make_layer(layer, root, root, map_data)
if err != OK:
return err
if options.add_background and "backgroundcolor" in map:
var bg_color = str(map.backgroundcolor)
if (!bg_color.is_valid_html_color()):
print_error("Invalid background color format: " + bg_color)
return root
map_background = Color(bg_color)
var viewport_size = Vector2(ProjectSettings.get("display/window/size/width"), ProjectSettings.get("display/window/size/height"))
var parbg = ParallaxBackground.new()
var parlayer = ParallaxLayer.new()
var colorizer = ColorRect.new()
parbg.scroll_ignore_camera_zoom = true
parlayer.motion_mirroring = viewport_size
colorizer.color = map_background
colorizer.rect_size = viewport_size
colorizer.rect_min_size = viewport_size
parbg.name = "Background"
root.add_child(parbg)
parbg.owner = root
parlayer.name = "BackgroundLayer"
parbg.add_child(parlayer)
parlayer.owner = root
colorizer.name = "BackgroundColor"
parlayer.add_child(colorizer)
colorizer.owner = root
return root
# Creates a layer node from the data
# Returns an error code
func make_layer(layer, parent, root, data):
var err = validate_layer(layer)
if err != OK:
return err
# Main map data
var map_mode = data.map_mode
var map_offset = data.map_offset
var map_pos_offset = data.map_pos_offset
var cell_size = data.cell_size
var cell_offset = data.cell_offset
var options = data.options
var tileset = data.tileset
var source_path = data.source_path
var infinite = data.infinite
var opacity = float(layer.opacity) if "opacity" in layer else 1.0
var visible = bool(layer.visible) if "visible" in layer else true
if layer.type == "tilelayer":
var layer_size = Vector2(int(layer.width), int(layer.height))
var tilemap = TileMap.new()
tilemap.set_name(str(layer.name))
tilemap.cell_size = cell_size
tilemap.modulate = Color(1.0, 1.0, 1.0, opacity);
tilemap.visible = visible
tilemap.mode = map_mode
tilemap.cell_half_offset = map_offset
tilemap.format = 1
tilemap.cell_clip_uv = options.uv_clip
tilemap.cell_y_sort = true
tilemap.cell_tile_origin = TileMap.TILE_ORIGIN_BOTTOM_LEFT
tilemap.collision_layer = options.collision_layer
var offset = Vector2()
if "offsetx" in layer:
offset.x = int(layer.offsetx)
if "offsety" in layer:
offset.y = int(layer.offsety)
tilemap.position = offset + map_pos_offset
tilemap.tile_set = tileset
var chunks = []
if infinite:
chunks = layer.chunks
else:
chunks = [layer]
for chunk in chunks:
err = validate_chunk(chunk)
if err != OK:
return err
var chunk_data = chunk.data
if "encoding" in layer and layer.encoding == "base64":
if "compression" in layer:
chunk_data = decompress_layer_data(chunk.data, layer.compression, layer_size)
if typeof(chunk_data) == TYPE_INT:
# Error happened
return chunk_data
else:
chunk_data = read_base64_layer_data(chunk.data)
var count = 0
for tile_id in chunk_data:
var int_id = int(str(tile_id)) & 0xFFFFFFFF
if int_id == 0:
count += 1
continue
var flipped_h = bool(int_id & FLIPPED_HORIZONTALLY_FLAG)
var flipped_v = bool(int_id & FLIPPED_VERTICALLY_FLAG)
var flipped_d = bool(int_id & FLIPPED_DIAGONALLY_FLAG)
var gid = int_id & ~(FLIPPED_HORIZONTALLY_FLAG | FLIPPED_VERTICALLY_FLAG | FLIPPED_DIAGONALLY_FLAG)
var cell_x = cell_offset.x + chunk.x + (count % int(chunk.width))
var cell_y = cell_offset.y + chunk.y + int(count / chunk.width)
tilemap.set_cell(cell_x, cell_y, gid, flipped_h, flipped_v, flipped_d)
count += 1
if options.save_tiled_properties:
set_tiled_properties_as_meta(tilemap, layer)
if options.custom_properties:
set_custom_properties(tilemap, layer)
tilemap.set("editor/display_folded", true)
parent.add_child(tilemap)
tilemap.set_owner(root)
elif layer.type == "imagelayer":
var image = null
if layer.image != "":
image = load_image(layer.image, source_path, options)
if typeof(image) != TYPE_OBJECT:
# Error happened
return image
var pos = Vector2()
var offset = Vector2()
if "x" in layer:
pos.x = float(layer.x)
if "y" in layer:
pos.y = float(layer.y)
if "offsetx" in layer:
offset.x = float(layer.offsetx)
if "offsety" in layer:
offset.y = float(layer.offsety)
var sprite = Sprite.new()
sprite.set_name(str(layer.name))
sprite.centered = false
sprite.texture = image
sprite.visible = visible
sprite.modulate = Color(1.0, 1.0, 1.0, opacity)
if options.save_tiled_properties:
set_tiled_properties_as_meta(sprite, layer)
if options.custom_properties:
set_custom_properties(sprite, layer)
sprite.set("editor/display_folded", true)
parent.add_child(sprite)
sprite.position = pos + offset
sprite.set_owner(root)
elif layer.type == "objectgroup":
var object_layer = Node2D.new()
if options.save_tiled_properties:
set_tiled_properties_as_meta(object_layer, layer)
if options.custom_properties:
set_custom_properties(object_layer, layer)
object_layer.modulate = Color(1.0, 1.0, 1.0, opacity)
object_layer.visible = visible
object_layer.set("editor/display_folded", true)
parent.add_child(object_layer)
object_layer.set_owner(root)
if "name" in layer and not str(layer.name).empty():
object_layer.set_name(str(layer.name))
if not "draworder" in layer or layer.draworder == "topdown":
layer.objects.sort_custom(self, "object_sorter")
for object in layer.objects:
if "template" in object:
var template_file = object["template"]
var template_data_immutable = get_template(remove_filename_from_path(data["source_path"]) + template_file)
if typeof(template_data_immutable) != TYPE_DICTIONARY:
# Error happened
print("Error getting template for object with id " + str(data["id"]))
continue
# Overwrite template data with current object data
apply_template(object, template_data_immutable)
set_default_obj_params(object)
if "point" in object and object.point:
var point = Position2D.new()
if not "x" in object or not "y" in object:
print_error("Missing coordinates for point in object layer.")
continue
point.position = Vector2(float(object.x), float(object.y))
point.visible = bool(object.visible) if "visible" in object else true
object_layer.add_child(point)
point.set_owner(root)
if "name" in object and not str(object.name).empty():
point.set_name(str(object.name))
elif "id" in object and not str(object.id).empty():
point.set_name(str(object.id))
if options.save_tiled_properties:
set_tiled_properties_as_meta(point, object)
if options.custom_properties:
set_custom_properties(point, object)
elif not "gid" in object:
# Not a tile object
if "type" in object and object.type == "navigation":
# Can't make navigation objects right now
print_error("Navigation polygons aren't supported in an object layer.")
continue # Non-fatal error
var shape = shape_from_object(object)
if typeof(shape) != TYPE_OBJECT:
# Error happened
return shape
if "type" in object and object.type == "occluder":
var occluder = LightOccluder2D.new()
var pos = Vector2()
var rot = 0
if "x" in object:
pos.x = float(object.x)
if "y" in object:
pos.y = float(object.y)
if "rotation" in object:
rot = float(object.rotation)
occluder.visible = bool(object.visible) if "visible" in object else true
occluder.position = pos
occluder.rotation_degrees = rot
occluder.occluder = shape
if "name" in object and not str(object.name).empty():
occluder.set_name(str(object.name))
elif "id" in object and not str(object.id).empty():
occluder.set_name(str(object.id))
if options.save_tiled_properties:
set_tiled_properties_as_meta(occluder, object)
if options.custom_properties:
set_custom_properties(occluder, object)
object_layer.add_child(occluder)
occluder.set_owner(root)
else:
var body = Area2D.new() if object.type == "area" else StaticBody2D.new()
var offset = Vector2()
var collision
var pos = Vector2()
var rot = 0
if not ("polygon" in object or "polyline" in object):
# Regular shape
collision = CollisionShape2D.new()
collision.shape = shape
if shape is RectangleShape2D:
offset = shape.extents
elif shape is CircleShape2D:
offset = Vector2(shape.radius, shape.radius)
elif shape is CapsuleShape2D:
offset = Vector2(shape.radius, shape.height)
if shape.radius > shape.height:
var temp = shape.radius
shape.radius = shape.height
shape.height = temp
collision.rotation_degrees = 90
shape.height *= 2
collision.position = offset
else:
collision = CollisionPolygon2D.new()
var points = null
if shape is ConcavePolygonShape2D:
points = []
var segments = shape.segments
for i in range(0, segments.size()):
if i % 2 != 0:
continue
points.push_back(segments[i])
collision.build_mode = CollisionPolygon2D.BUILD_SEGMENTS
else:
points = shape.points
collision.build_mode = CollisionPolygon2D.BUILD_SOLIDS
collision.polygon = points
collision.one_way_collision = object.type == "one-way"
if "x" in object:
pos.x = float(object.x)
if "y" in object:
pos.y = float(object.y)
if "rotation" in object:
rot = float(object.rotation)
body.set("editor/display_folded", true)
object_layer.add_child(body)
body.set_owner(root)
body.add_child(collision)
collision.set_owner(root)
if options.save_tiled_properties:
set_tiled_properties_as_meta(body, object)
if options.custom_properties:
set_custom_properties(body, object)
if "name" in object and not str(object.name).empty():
body.set_name(str(object.name))
elif "id" in object and not str(object.id).empty():
body.set_name(str(object.id))
body.visible = bool(object.visible) if "visible" in object else true
body.position = pos
body.rotation_degrees = rot
else: # "gid" in object
var tile_raw_id = int(str(object.gid)) & 0xFFFFFFFF
var tile_id = tile_raw_id & ~(FLIPPED_HORIZONTALLY_FLAG | FLIPPED_VERTICALLY_FLAG | FLIPPED_DIAGONALLY_FLAG)
var is_tile_object = tileset.tile_get_region(tile_id).get_area() == 0
var collisions = tileset.tile_get_shape_count(tile_id)
var has_collisions = collisions > 0 && object.has("type") && object.type != "sprite"
var sprite = Sprite.new()
var pos = Vector2()
var rot = 0
var scale = Vector2(1, 1)
sprite.texture = tileset.tile_get_texture(tile_id)
var texture_size = sprite.texture.get_size() if sprite.texture != null else Vector2()
if not is_tile_object:
sprite.region_enabled = true
sprite.region_rect = tileset.tile_get_region(tile_id)
texture_size = tileset.tile_get_region(tile_id).size
sprite.flip_h = bool(tile_raw_id & FLIPPED_HORIZONTALLY_FLAG)
sprite.flip_v = bool(tile_raw_id & FLIPPED_VERTICALLY_FLAG)
if "x" in object:
pos.x = float(object.x)
if "y" in object:
pos.y = float(object.y)
if "rotation" in object:
rot = float(object.rotation)
if texture_size != Vector2():
if "width" in object and float(object.width) != texture_size.x:
scale.x = float(object.width) / texture_size.x
if "height" in object and float(object.height) != texture_size.y:
scale.y = float(object.height) / texture_size.y
var obj_root = sprite
if has_collisions:
match object.type:
"area": obj_root = Area2D.new()
"kinematic": obj_root = KinematicBody2D.new()
"rigid": obj_root = RigidBody2D.new()
_: obj_root = StaticBody2D.new()
object_layer.add_child(obj_root)
obj_root.owner = root
obj_root.add_child(sprite)
sprite.owner = root
var shapes = tileset.tile_get_shapes(tile_id)
for s in shapes:
var collision_node = CollisionShape2D.new()
collision_node.shape = s.shape
collision_node.transform = s.shape_transform
if sprite.flip_h:
collision_node.position.x *= -1
collision_node.position.x -= cell_size.x
collision_node.scale.x *= -1
if sprite.flip_v:
collision_node.scale.y *= -1
collision_node.position.y *= -1
collision_node.position.y -= cell_size.y
obj_root.add_child(collision_node)
collision_node.owner = root
if "name" in object and not str(object.name).empty():
obj_root.set_name(str(object.name))
elif "id" in object and not str(object.id).empty():
obj_root.set_name(str(object.id))
obj_root.position = pos
obj_root.rotation_degrees = rot
obj_root.visible = bool(object.visible) if "visible" in object else true
obj_root.scale = scale
# Translate from Tiled bottom-left position to Godot top-left
sprite.centered = false
sprite.region_filter_clip = options.uv_clip
sprite.offset = Vector2(0, -texture_size.y)
if not has_collisions:
object_layer.add_child(sprite)
sprite.set_owner(root)
if options.save_tiled_properties:
set_tiled_properties_as_meta(obj_root, object)
if options.custom_properties:
if options.tile_metadata:
var tile_meta = tileset.get_meta("tile_meta")
if typeof(tile_meta) == TYPE_DICTIONARY and tile_id in tile_meta:
for prop in tile_meta[tile_id]:
obj_root.set_meta(prop, tile_meta[tile_id][prop])
set_custom_properties(obj_root, object)
elif layer.type == "group":
var group = Node2D.new()
var pos = Vector2()
if "x" in layer:
pos.x = float(layer.x)
if "y" in layer:
pos.y = float(layer.y)
group.modulate = Color(1.0, 1.0, 1.0, opacity)
group.visible = visible
group.position = pos
if options.save_tiled_properties:
set_tiled_properties_as_meta(group, layer)
if options.custom_properties:
set_custom_properties(group, layer)
if "name" in layer and not str(layer.name).empty():
group.set_name(str(layer.name))
group.set("editor/display_folded", true)
parent.add_child(group)
group.set_owner(root)
for sub_layer in layer.layers:
make_layer(sub_layer, group, root, data)
else:
print_error("Unknown layer type ('%s') in '%s'" % [str(layer.type), str(layer.name) if "name" in layer else "[unnamed layer]"])
return ERR_INVALID_DATA
return OK
func set_default_obj_params(object):
# Set default values for object
for attr in ["width", "height", "rotation", "x", "y"]:
if not attr in object:
object[attr] = 0
if not "type" in object:
object.type = ""
if not "visible" in object:
object.visible = true
# Makes a tileset from a array of tilesets data
# Since Godot supports only one TileSet per TileMap, all tilesets from Tiled are combined
func build_tileset_for_scene(tilesets, source_path, options):
var result = TileSet.new()
var err = ERR_INVALID_DATA
var tile_meta = {}
for tileset in tilesets:
var ts = tileset
var ts_source_path = source_path
if "source" in ts:
if not "firstgid" in tileset or not str(tileset.firstgid).is_valid_integer():
print_error("Missing or invalid firstgid tileset property.")
return ERR_INVALID_DATA
ts_source_path = source_path.get_base_dir().plus_file(ts.source)
# Used later for templates
_tileset_path_to_first_gid[ts_source_path] = tileset.firstgid
if ts.source.get_extension().to_lower() == "tsx":
var tsx_reader = TiledXMLToDictionary.new()
ts = tsx_reader.read_tsx(ts_source_path)
if typeof(ts) != TYPE_DICTIONARY:
# Error happened
return ts
else: # JSON Tileset
var f = File.new()
err = f.open(ts_source_path, File.READ)
if err != OK:
print_error("Error opening tileset '%s'." % [ts.source])
return err
var json_res = JSON.parse(f.get_as_text())
if json_res.error != OK:
print_error("Error parsing tileset '%s' JSON: %s" % [ts.source, json_res.error_string])
return ERR_INVALID_DATA
ts = json_res.result
if typeof(ts) != TYPE_DICTIONARY:
print_error("Tileset '%s' is not a dictionary." % [ts.source])
return ERR_INVALID_DATA
ts.firstgid = tileset.firstgid
err = validate_tileset(ts)
if err != OK:
return err
var has_global_image = "image" in ts
var spacing = int(ts.spacing) if "spacing" in ts and str(ts.spacing).is_valid_integer() else 0
var margin = int(ts.margin) if "margin" in ts and str(ts.margin).is_valid_integer() else 0
var firstgid = int(ts.firstgid)
var columns = int(ts.columns) if "columns" in ts and str(ts.columns).is_valid_integer() else -1
var image = null
var imagesize = Vector2()
if has_global_image:
image = load_image(ts.image, ts_source_path, options)
if typeof(image) != TYPE_OBJECT:
# Error happened
return image
imagesize = Vector2(int(ts.imagewidth), int(ts.imageheight))
var tilesize = Vector2(int(ts.tilewidth), int(ts.tileheight))
var tilecount = int(ts.tilecount)
var gid = firstgid
var x = margin
var y = margin
var i = 0
var column = 0
while i < tilecount:
var tilepos = Vector2(x, y)
var region = Rect2(tilepos, tilesize)
var rel_id = str(gid - firstgid)
result.create_tile(gid)
if has_global_image:
result.tile_set_texture(gid, image)
result.tile_set_region(gid, region)
if options.apply_offset:
result.tile_set_texture_offset(gid, Vector2(0, -tilesize.y))
elif not rel_id in ts.tiles:
gid += 1
continue
else:
var image_path = ts.tiles[rel_id].image
image = load_image(image_path, ts_source_path, options)
if typeof(image) != TYPE_OBJECT:
# Error happened
return image
result.tile_set_texture(gid, image)
if options.apply_offset:
result.tile_set_texture_offset(gid, Vector2(0, -image.get_height()))
if "tiles" in ts and rel_id in ts.tiles and "objectgroup" in ts.tiles[rel_id] \
and "objects" in ts.tiles[rel_id].objectgroup:
for object in ts.tiles[rel_id].objectgroup.objects:
var shape = shape_from_object(object)
if typeof(shape) != TYPE_OBJECT:
# Error happened
return shape
var offset = Vector2(float(object.x), float(object.y))
if options.apply_offset:
offset += result.tile_get_texture_offset(gid)
if "width" in object and "height" in object:
offset += Vector2(float(object.width) / 2, float(object.height) / 2)
if object.type == "navigation":
result.tile_set_navigation_polygon(gid, shape)
result.tile_set_navigation_polygon_offset(gid, offset)
elif object.type == "occluder":
result.tile_set_light_occluder(gid, shape)
result.tile_set_occluder_offset(gid, offset)
else:
result.tile_add_shape(gid, shape, Transform2D(0, offset), object.type == "one-way")
if options.custom_properties and options.tile_metadata and "tileproperties" in ts \
and "tilepropertytypes" in ts and rel_id in ts.tileproperties and rel_id in ts.tilepropertytypes:
tile_meta[gid] = get_custom_properties(ts.tileproperties[rel_id], ts.tilepropertytypes[rel_id])
if options.save_tiled_properties and rel_id in ts.tiles:
for property in whitelist_properties:
if property in ts.tiles[rel_id]:
if not gid in tile_meta: tile_meta[gid] = {}
tile_meta[gid][property] = ts.tiles[rel_id][property]
gid += 1
column += 1
i += 1
x += int(tilesize.x) + spacing
if (columns > 0 and column >= columns) or x >= int(imagesize.x) - margin or (x + int(tilesize.x)) > int(imagesize.x):
x = margin
y += int(tilesize.y) + spacing
column = 0
if str(ts.name) != "":
result.resource_name = str(ts.name)
if options.save_tiled_properties:
set_tiled_properties_as_meta(result, ts)
if options.custom_properties:
if "properties" in ts and "propertytypes" in ts:
set_custom_properties(result, ts)
if options.custom_properties and options.tile_metadata:
result.set_meta("tile_meta", tile_meta)
return result
# Makes a standalone TileSet. Useful for importing TileSets from Tiled
# Returns an error code if fails
func build_tileset(source_path, options):
var set = read_tileset_file(source_path)
if typeof(set) == TYPE_INT:
return set
if typeof(set) != TYPE_DICTIONARY:
return ERR_INVALID_DATA
# Just to validate and build correctly using the existing builder
set["firstgid"] = 0
return build_tileset_for_scene([set], source_path, options)
# Loads an image from a given path
# Returns a Texture
func load_image(rel_path, source_path, options):
var flags = options.image_flags if "image_flags" in options else Texture.FLAGS_DEFAULT
var embed = options.embed_internal_images if "embed_internal_images" in options else false
var ext = rel_path.get_extension().to_lower()
if ext != "png" and ext != "jpg":
print_error("Unsupported image format: %s. Use PNG or JPG instead." % [ext])
return ERR_FILE_UNRECOGNIZED
var total_path = rel_path
if rel_path.is_rel_path():
total_path = ProjectSettings.globalize_path(source_path.get_base_dir()).plus_file(rel_path)
total_path = ProjectSettings.localize_path(total_path)
var dir = Directory.new()
if not dir.file_exists(total_path):
print_error("Image not found: %s" % [total_path])
return ERR_FILE_NOT_FOUND
if not total_path.begins_with("res://"):
# External images need to be embedded
embed = true
var image = null
if embed:
image = ImageTexture.new()
image.load(total_path)
else:
image = ResourceLoader.load(total_path, "ImageTexture")
if image != null:
image.set_flags(flags)
return image
# Reads a file and returns its contents as a dictionary
# Returns an error code if fails
func read_file(path):
if path.get_extension().to_lower() == "tmx":
var tmx_to_dict = TiledXMLToDictionary.new()
var data = tmx_to_dict.read_tmx(path)
if typeof(data) != TYPE_DICTIONARY:
# Error happened
print_error("Error parsing map file '%s'." % [path])
# Return error or result
return data
# Not TMX, must be JSON
var file = File.new()
var err = file.open(path, File.READ)
if err != OK:
return err
var content = JSON.parse(file.get_as_text())
if content.error != OK:
print_error("Error parsing JSON: " + content.error_string)
return content.error
return content.result
# Reads a tileset file and return its contents as a dictionary
# Returns an error code if fails
func read_tileset_file(path):
if path.get_extension().to_lower() == "tsx":
var tmx_to_dict = TiledXMLToDictionary.new()
var data = tmx_to_dict.read_tsx(path)
if typeof(data) != TYPE_DICTIONARY:
# Error happened
print_error("Error parsing map file '%s'." % [path])
# Return error or result
return data
# Not TSX, must be JSON
var file = File.new()
var err = file.open(path, File.READ)
if err != OK:
return err
var content = JSON.parse(file.get_as_text())
if content.error != OK:
print_error("Error parsing JSON: " + content.error_string)
return content.error
return content.result
# Creates a shape from an object data
# Returns a valid shape depending on the object type (collision/occluder/navigation)
func shape_from_object(object):
var shape = ERR_INVALID_DATA
set_default_obj_params(object)
if "polygon" in object or "polyline" in object:
var vertices = PoolVector2Array()
if "polygon" in object:
for point in object.polygon:
vertices.push_back(Vector2(float(point.x), float(point.y)))
else:
for point in object.polyline:
vertices.push_back(Vector2(float(point.x), float(point.y)))
if object.type == "navigation":
shape = NavigationPolygon.new()
shape.vertices = vertices
shape.add_outline(vertices)
shape.make_polygons_from_outlines()
elif object.type == "occluder":
shape = OccluderPolygon2D.new()
shape.polygon = vertices
shape.closed = "polygon" in object
else:
if is_convex(vertices):
var sorter = PolygonSorter.new()
vertices = sorter.sort_polygon(vertices)
shape = ConvexPolygonShape2D.new()
shape.points = vertices
else:
shape = ConcavePolygonShape2D.new()
var segments = [vertices[0]]
for x in range(1, vertices.size()):
segments.push_back(vertices[x])
segments.push_back(vertices[x])
segments.push_back(vertices[0])
shape.segments = PoolVector2Array(segments)
elif "ellipse" in object:
if object.type == "navigation" or object.type == "occluder":
print_error("Ellipse shapes are not supported as navigation or occluder. Use polygon/polyline instead.")
return ERR_INVALID_DATA
if not "width" in object or not "height" in object:
print_error("Missing width or height in ellipse shape.")
return ERR_INVALID_DATA
var w = abs(float(object.width))
var h = abs(float(object.height))
if w == h:
shape = CircleShape2D.new()
shape.radius = w / 2.0
else:
# Using a capsule since it's the closest from an ellipse
shape = CapsuleShape2D.new()
shape.radius = w / 2.0
shape.height = h / 2.0
else: # Rectangle
if not "width" in object or not "height" in object:
print_error("Missing width or height in rectangle shape.")
return ERR_INVALID_DATA
var size = Vector2(float(object.width), float(object.height))
if object.type == "navigation" or object.type == "occluder":
# Those types only accept polygons, so make one from the rectangle
var vertices = PoolVector2Array([
Vector2(0, 0),
Vector2(size.x, 0),
size,
Vector2(0, size.y)
])
if object.type == "navigation":
shape = NavigationPolygon.new()
shape.vertices = vertices
shape.add_outline(vertices)
shape.make_polygons_from_outlines()
else:
shape = OccluderPolygon2D.new()
shape.polygon = vertices
else:
shape = RectangleShape2D.new()
shape.extents = size / 2.0
return shape
# Determines if the set of vertices is convex or not
# Returns a boolean
func is_convex(vertices):
var size = vertices.size()
if size <= 3:
# Less than 3 verices can't be concave
return true
var cp = 0
for i in range(0, size + 2):
var p1 = vertices[(i + 0) % size]
var p2 = vertices[(i + 1) % size]
var p3 = vertices[(i + 2) % size]
var prev_cp = cp
cp = (p2.x - p1.x) * (p3.y - p2.y) - (p2.y - p1.y) * (p3.x - p2.x)
if i > 0 and sign(cp) != sign(prev_cp):
return false
return true
# Decompress the data of the layer
# Compression argument is a string, either "gzip" or "zlib"
func decompress_layer_data(layer_data, compression, map_size):
if compression != "gzip" and compression != "zlib":
print_error("Unrecognized compression format: %s" % [compression])
return ERR_INVALID_DATA
var compression_type = File.COMPRESSION_DEFLATE if compression == "zlib" else File.COMPRESSION_GZIP
var expected_size = int(map_size.x) * int(map_size.y) * 4
var raw_data = Marshalls.base64_to_raw(layer_data).decompress(expected_size, compression_type)
return decode_layer(raw_data)
# Reads the layer as a base64 data
# Returns an array of ints as the decoded layer would be
func read_base64_layer_data(layer_data):
var decoded = Marshalls.base64_to_raw(layer_data)
return decode_layer(decoded)
# Reads a PoolByteArray and returns the layer array
# Used for base64 encoded and compressed layers
func decode_layer(layer_data):
var result = []
for i in range(0, layer_data.size(), 4):
var num = (layer_data[i]) | \
(layer_data[i + 1] << 8) | \
(layer_data[i + 2] << 16) | \
(layer_data[i + 3] << 24)
result.push_back(num)
return result
# Set the custom properties into the metadata of the object
func set_custom_properties(object, tiled_object):
if not "properties" in tiled_object or not "propertytypes" in tiled_object:
return
var properties = get_custom_properties(tiled_object.properties, tiled_object.propertytypes)
for property in properties:
object.set_meta(property, properties[property])
# Get the custom properties as a dictionary
# Useful for tile meta, which is not stored directly
func get_custom_properties(properties, types):
var result = {}
for property in properties:
var value = null
if str(types[property]).to_lower() == "bool":
value = bool(properties[property])
elif str(types[property]).to_lower() == "int":
value = int(properties[property])
elif str(types[property]).to_lower() == "float":
value = float(properties[property])
elif str(types[property]).to_lower() == "color":
value = Color(properties[property])
else:
value = str(properties[property])
result[property] = value
return result
# Get the available whitelisted properties from the Tiled object
# And them as metadata in the Godot object
func set_tiled_properties_as_meta(object, tiled_object):
for property in whitelist_properties:
if property in tiled_object:
object.set_meta(property, tiled_object[property])
# Custom function to sort objects in an object layer
# This is done to support the "topdown" draw order, which sorts by 'y' coordinate
func object_sorter(first, second):
if first.y == second.y:
return first.id < second.id
return first.y < second.y
# Validates the map dictionary content for missing or invalid keys
# Returns an error code
func validate_map(map):
if not "type" in map or map.type != "map":
print_error("Missing or invalid type property.")
return ERR_INVALID_DATA
elif not "version" in map or int(map.version) != 1:
print_error("Missing or invalid map version.")
return ERR_INVALID_DATA
elif not "tileheight" in map or not str(map.tileheight).is_valid_integer():
print_error("Missing or invalid tileheight property.")
return ERR_INVALID_DATA
elif not "tilewidth" in map or not str(map.tilewidth).is_valid_integer():
print_error("Missing or invalid tilewidth property.")
return ERR_INVALID_DATA
elif not "layers" in map or typeof(map.layers) != TYPE_ARRAY:
print_error("Missing or invalid layers property.")
return ERR_INVALID_DATA
elif not "tilesets" in map or typeof(map.tilesets) != TYPE_ARRAY:
print_error("Missing or invalid tilesets property.")
return ERR_INVALID_DATA
if "orientation" in map and (map.orientation == "staggered" or map.orientation == "hexagonal"):
if not "staggeraxis" in map:
print_error("Missing stagger axis property.")
return ERR_INVALID_DATA
elif not "staggerindex" in map:
print_error("Missing stagger axis property.")
return ERR_INVALID_DATA
return OK
# Validates the tileset dictionary content for missing or invalid keys
# Returns an error code
func validate_tileset(tileset):
if not "firstgid" in tileset or not str(tileset.firstgid).is_valid_integer():
print_error("Missing or invalid firstgid tileset property.")
return ERR_INVALID_DATA
elif not "tilewidth" in tileset or not str(tileset.tilewidth).is_valid_integer():
print_error("Missing or invalid tilewidth tileset property.")
return ERR_INVALID_DATA
elif not "tileheight" in tileset or not str(tileset.tileheight).is_valid_integer():
print_error("Missing or invalid tileheight tileset property.")
return ERR_INVALID_DATA
elif not "tilecount" in tileset or not str(tileset.tilecount).is_valid_integer():
print_error("Missing or invalid tilecount tileset property.")
return ERR_INVALID_DATA
if not "image" in tileset:
for tile in tileset.tiles:
if not "image" in tileset.tiles[tile]:
print_error("Missing or invalid image in tileset property.")
return ERR_INVALID_DATA
elif not "imagewidth" in tileset.tiles[tile] or not str(tileset.tiles[tile].imagewidth).is_valid_integer():
print_error("Missing or invalid imagewidth tileset property 1.")
return ERR_INVALID_DATA
elif not "imageheight" in tileset.tiles[tile] or not str(tileset.tiles[tile].imageheight).is_valid_integer():
print_error("Missing or invalid imageheight tileset property.")
return ERR_INVALID_DATA
else:
if not "imagewidth" in tileset or not str(tileset.imagewidth).is_valid_integer():
print_error("Missing or invalid imagewidth tileset property 2.")
return ERR_INVALID_DATA
elif not "imageheight" in tileset or not str(tileset.imageheight).is_valid_integer():
print_error("Missing or invalid imageheight tileset property.")
return ERR_INVALID_DATA
return OK
# Validates the layer dictionary content for missing or invalid keys
# Returns an error code
func validate_layer(layer):
if not "type" in layer:
print_error("Missing or invalid type layer property.")
return ERR_INVALID_DATA
elif not "name" in layer:
print_error("Missing or invalid name layer property.")
return ERR_INVALID_DATA
match layer.type:
"tilelayer":
if not "height" in layer or not str(layer.height).is_valid_integer():
print_error("Missing or invalid layer height property.")
return ERR_INVALID_DATA
elif not "width" in layer or not str(layer.width).is_valid_integer():
print_error("Missing or invalid layer width property.")
return ERR_INVALID_DATA
elif not "data" in layer:
if not "chunks" in layer:
print_error("Missing data or chunks layer properties.")
return ERR_INVALID_DATA
elif typeof(layer.chunks) != TYPE_ARRAY:
print_error("Invalid chunks layer property.")
return ERR_INVALID_DATA
elif "encoding" in layer:
if layer.encoding == "base64" and typeof(layer.data) != TYPE_STRING:
print_error("Invalid data layer property.")
return ERR_INVALID_DATA
if layer.encoding != "base64" and typeof(layer.data) != TYPE_ARRAY:
print_error("Invalid data layer property.")
return ERR_INVALID_DATA
elif typeof(layer.data) != TYPE_ARRAY:
print_error("Invalid data layer property.")
return ERR_INVALID_DATA
if "compression" in layer:
if layer.compression != "gzip" and layer.compression != "zlib":
print_error("Invalid compression type.")
return ERR_INVALID_DATA
"imagelayer":
if not "image" in layer or typeof(layer.image) != TYPE_STRING:
print_error("Missing or invalid image path for layer.")
return ERR_INVALID_DATA
"objectgroup":
if not "objects" in layer or typeof(layer.objects) != TYPE_ARRAY:
print_error("Missing or invalid objects array for layer.")
return ERR_INVALID_DATA
"group":
if not "layers" in layer or typeof(layer.layers) != TYPE_ARRAY:
print_error("Missing or invalid layer array for group layer.")
return ERR_INVALID_DATA
return OK
func validate_chunk(chunk):
if not "data" in chunk:
print_error("Missing data chunk property.")
return ERR_INVALID_DATA
elif not "height" in chunk or not str(chunk.height).is_valid_integer():
print_error("Missing or invalid height chunk property.")
return ERR_INVALID_DATA
elif not "width" in chunk or not str(chunk.width).is_valid_integer():
print_error("Missing or invalid width chunk property.")
return ERR_INVALID_DATA
elif not "x" in chunk or not str(chunk.x).is_valid_integer():
print_error("Missing or invalid x chunk property.")
return ERR_INVALID_DATA
elif not "y" in chunk or not str(chunk.y).is_valid_integer():
print_error("Missing or invalid y chunk property.")
return ERR_INVALID_DATA
return OK
# Custom function to print error, to centralize the prefix addition
func print_error(err):
printerr(error_prefix + err)
func get_template(path):
# If this template has not yet been loaded
if not _loaded_templates.has(path):
# IS XML
if path.get_extension().to_lower() == "tx":
var parser = XMLParser.new()
var err = parser.open(path)
if err != OK:
print_error("Error opening TX file '%s'." % [path])
return err
var content = parse_template(parser, path)
if typeof(content) != TYPE_DICTIONARY:
# Error happened
print_error("Error parsing template map file '%s'." % [path])
return false
_loaded_templates[path] = content
# IS JSON
else:
var file = File.new()
var err = file.open(path, File.READ)
if err != OK:
return err
var json_res = JSON.parse(file.get_as_text())
if json_res.error != OK:
print_error("Error parsing JSON template map file '%s'." % [path])
return json_res.error
var result = json_res.result
if typeof(result) != TYPE_DICTIONARY:
print_error("Error parsing JSON template map file '%s'." % [path])
return ERR_INVALID_DATA
var object = result.object
if object.has("gid"):
if result.has("tileset"):
var ts_path = remove_filename_from_path(path) + result.tileset.source
var tileset_gid_increment = get_first_gid_from_tileset_path(ts_path) - 1
object.gid += tileset_gid_increment
_loaded_templates[path] = object
var dict = _loaded_templates[path]
var dictCopy = {}
for k in dict:
dictCopy[k] = dict[k]
return dictCopy
func parse_template(parser, path):
var err = OK
# Template root node shouldn't have attributes
var data = {}
var tileset_gid_increment = 0
data.id = 0
err = parser.read()
while err == OK:
if parser.get_node_type() == XMLParser.NODE_ELEMENT_END:
if parser.get_node_name() == "template":
break
elif parser.get_node_type() == XMLParser.NODE_ELEMENT:
if parser.get_node_name() == "tileset":
var ts_path = remove_filename_from_path(path) + parser.get_named_attribute_value_safe("source")
tileset_gid_increment = get_first_gid_from_tileset_path(ts_path) - 1
data.tileset = ts_path
if parser.get_node_name() == "object":
var object = TiledXMLToDictionary.parse_object(parser)
for k in object:
data[k] = object[k]
err = parser.read()
if data.has("gid"):
data["gid"] += tileset_gid_increment
return data
func get_first_gid_from_tileset_path(path):
for t in _tileset_path_to_first_gid:
if is_same_file(path, t):
return _tileset_path_to_first_gid[t]
return 0
static func get_filename_from_path(path):
var substrings = path.split("/", false)
var file_name = substrings[substrings.size() - 1]
return file_name
static func remove_filename_from_path(path):
var file_name = get_filename_from_path(path)
var stringSize = path.length() - file_name.length()
var file_path = path.substr(0,stringSize)
return file_path
static func is_same_file(path1, path2):
var file1 = File.new()
var err = file1.open(path1, File.READ)
if err != OK:
return err
var file2 = File.new()
err = file2.open(path2, File.READ)
if err != OK:
return err
var file1_str = file1.get_as_text()
var file2_str = file2.get_as_text()
if file1_str == file2_str:
return true
return false
static func apply_template(object, template_immutable):
for k in template_immutable:
# Do not overwrite any object data
if typeof(template_immutable[k]) == TYPE_DICTIONARY:
if not object.has(k):
object[k] = {}
apply_template(object[k], template_immutable[k])
elif not object.has(k):
object[k] = template_immutable[k]
|
Q:
Pouchdb / CouchDB all_docs error
I'm setting up a pouchdb / couchdb live sync. I'm using pouchdb-authentication to login.
When on my local dev server, everything works fine.
let pdbConfig = { skipSetup: true};
let remoteDb : any = new PouchDB(config.couch.server, pdbConfig);
remoteDb.login(config.couch.username, config.couch.password).then(u => {
db.sync(remoteDb, {
live: true
}).on('complete', (info)=> {
store.dispatch({type: "REMOTE_SYNC_COMPLETE"});
})
}).catch(e=>{
console.error(e)
})
On production, I receive this error:
{"error":"case_clause","reason":"{forbidden,<<\"You are not a db or server admin.\">>}"}
Request URL: https://myproductionserver:6984/userdb-82911660-c14b-472c-adb4-6f2ed280cae9/_all_docs?conflicts=true&include_docs=true
I've noticed that this only happens when a new sync occurs (otherwise it does not appear all_docs is called) all_docs doesn't appear to be called at all on my local dev server, regardless of state.
Other calls (to _session, _changes) etc work fine to the production server.
A:
Looks like users need to have admin permissions on a database to use all_docs. My users were only "members. all_docs isn't called in pouchdb unless a database already exists on the couchdb server, but not on the client.
|
Getting justice and awareness for our daughter Rebecca Florenece Wilson who was very tragically Stillborn but yet Still Born.
Menu
Category Archives: Uncategorized
Six months have passed since I last wrote a blog post . My darling Rebecca should now be 18 months old. When I started this blog last year I didn’t know what it was going to be used for and whether I would be writing weekly, monthly or just whenever I felt like it – turned out I wrote whenever I felt like it and it worked for me.
I feel like writing today.
Writing this blog helps me to rabble on and release thoughts and feelings. That way they’re out, no one needs to read it, but it’s out there for anyone who chooses to. It’s quite therapeutic.
I last wrote when Rebecca turned 1 years old. That was a difficult time, the last of the ‘firsts’ had come; We had our first week, first month, first Halloween, first Christmas, first New Year, first anniversary of death and finally first birthday. Our first year without our daughter had passed.
One of my favourite films, Notting Hill, has a scene whereby the heartbroken character William Thacker, played by Hugh Grant, walks through a market place. Whilst walking the seasons change around him, from spring through to winter then back to spring. That’s how I feel; Rebecca was buried amongst the bright golden daffodils in the cemetery, then before I knew it those same daffodils were blooming once again. Life has just carried on around me. Sometimes I’d pop my head up, look around then sink back down unbeknown what’s really going on up there. Suppose that’s living in grief. That suited me fine, I was content being below the goings on of the world lying in the depths of grief.
That was until October 2015 came. Suddenly I was forced above ground whether I was ready or not.
My husband and I agreed rather quickly after Rebecca’s birth that we should try again, let me re-phrase that – Empty Arms Syndrome was consuming me, I was desperate to hold a baby once again. Obviously, I was desperate to hold Rebecca, but after those sacred 6 weeks with her I knew I could hold her no more, I had to do what was best for her – I had to lay her to rest. But the grief was so strong, my aching arms were killing me. I quickly realised I couldn’t go near, let alone hold, another baby other then my own. My pregnacy with Rebecca was me wanting a baby, this soon turned to needing a baby.
My husband agreed that he too wanted to give Rebecca a younger sibling, but he was so worried about jeopardising my journey through grief – I was so vulnerable. I persuaded him otherwise.
I found myself obsessed with becoming pregnant. I was constantly scrolling through websites and support groups. Spending a fortune on ovulation kits, checking temperatures, timing everything. Sex became something that just needed to be done.
There is so much that goes into trying for a baby after loss, the feelings are amplified. The obsession. The desperation. The heartbreak . The anger. The disappointment. The feeling of being a failure. The fear… But mostly the guilt – guilt towards being disloyal to Rebecca.
October 2015 brought a positive pregnancy test.
I would be lying if I said I was happy about it. This is what I thought I needed. But the realisation came that I not only did I want Rebecca, I needed her too. I stared at the test and cried. What had I done?
Now the new feelings started – which also seemed amplified. The obsession. The fear. The panic. The uncertainty. The paranoia. The confusion. The anger…. But again, mostly the guilt – guilt towards being disloyal to Rebecca.
The first trimester sent me spiralling into a frenzy. I couldn’t bond with this pregnancy – I couldn’t even admit to it. I felt so stupid for taking this risk again. Risking losing another child. Breaking my family’s hearts once again. The anxiety got too much. I needed help.
By Christmas I had started counselling. Thankfully this was with a familiar face who knew me and knew Rebecca (The Bereavement Midwife who looked after me Rebecca and my family during our stay at hospital) I cannot thank this wonderful lady enough for helping me getthrough each week. The amount tears and fears shared in those four walls were obscene. Slowly she neutered me, teaching me to bond, opening my eyes to the new life growing inside of me. The fears didn’t go away, but I was able to realise my fears were valid and so was this new life.
I soon found myself obsessed by the term Rainbow Baby and of any stories of them.
I tried to hide from the baby’s first movements. I was going to bed early to avoid feeling them start. Once I had felt them that was it, the almighty fear of one day feeling it no more consumed me.
I tried to hide my growing bump as long as possible, but it finally had to be exposed. Suddenly I was surrounded by many ‘congratulations’ and soon realised people who avoided me before were able to speak to me again. Sadly I quickly became aware that some thought that a new pregnancy meant I was soon to be ‘all better’, ‘healed’ or ‘over it’ – this hurt immensely. I hated the idea that people may think I was replacing Rebecca. Others were quick to tell me that ‘things would be better this time’, that ‘nothing would go wrong’ – this angered me, how could they possibly know that?
Time was slowly moving forward and my pregnancy was progressing. I was under the care of a fantastic consultant who catered to my every need. I was scanned at least once a week for foetal developments, monitored whenever I felt I needed it (which was sometimes everyday) soon the hospital became my second home. By my request, induction was set for the 38th week. Trusting the staff in this hospital was always going to be difficult. My dear midwife friend who delivered Rebecca was on 24/7 standby via telephone for any of my weak moments or crazy questions. The doctor who performed Rebecca’s ECV was clearly told to stay well away.
There are so many diffetences I personally realised about a pregnancy after loss, other than the extreme emotions I’ve already mentioned. Little things like; not wanting to take photos of my growing bump, not wanting to write a pregnancy diary, not wanting to buy anything for baby, not wanting to plan ahead or prepare for their birth. I was still unable to be around other expectant mothers, I was still so very jealous – jealous of their innocence and excitement. Dare I say it but I found myself constantly planning the death of this baby, discussing burial, headstones, the birth and memory making – I couldn’t let myself imagine this baby being born alive. I really struggled to bond, I had to keep reminding myself that whether I bonded or not the pain of losing this child would still hurt – so surely I should cherish with each day with them? This battle was exhausting. My counsellor tried so hard to break down these barriers.
Towards the end of pregnancy the anxiety and fear were getting intense, I was constantly on a yo-yo of emotions. Forever waiting for the next foetal movement, all whilst trying to stay calm.
My induction date was two weeks away – I found myself at 36+4 weeks, the same gestation Rebecca died. This day was immensely difficult, I spent the morning being monitored and the rest of the day crying with Rebecca. Begging her to come back and allow me to wake up from this bad dream. Preying she bring her little sibling safe to me. I spent the next day in appointmens; at hospital being monitored out of fear of something going wrong, seeing my counsellor and meeting my midwife friend.
The following day I woke to find myself having intense Braxton hicks. Luckily I was already booked in that morning with my consultant. The baby was fine on the scan, irregular contractions were monitored and although I was dilating, it was diagnosed as false labour. As I returned home from hospital I found myself bleeding, heavily – it was happening again, I thought my baby was dying. I rushed straight back to hospital. I was quickly assured my baby was alive but I was told to prepare for labour.
I suddenly realised I wasn’t prepared. I was scared.
My birth plan didn’t exist, it was a stillbirth plan… So I insisted to be monitored constantly throughout labour and my husband was ordered to keep a close eye on the monitor. With my husband and friend (midwife) by my side our baby quickly arrived a few hours later. There are no words to describe this moment. I won’t even try. To have this breathing, moving and crying bundle placed upon me was surreal. I couldn’t believe it. I still can’t.
Twelve weeks on and Ella has thrived beautifully. She has settled in well and has acquired her own special place in our family. She is absolutely gorgeous. We love her so much. We are so grateful.
This isn’t our happy ending, what we deserve nor something given back to us. Our Rebecca still died, we still live each day without her knowing she should be with us. How can we be happy now, just like that? We deserve our baby who was taken, she hasn’t been given back. I still have my bad days, we are still grieving, we always will be. Rebecca knows each and every day how much we miss and love her.
But we can now let love back in again, Ella has been given to us to bring some colour back into our lives, to shine a bright rainbow through our hearts. I savour each and every moment with Ella, every night feed, every smile. At times it is comforting to see how Rebecca would have been, at times painful to see, but this will follow me throughout the rest of my life – it’s not Ella’s fault. She has engraved her own beautiful Ella shape into my heart, but in no way does this shape try to fill Rebecca’s. Each of my children have their own shape. Ella is no different.
I strongly believe that Rebecca sent Ella to fulfil my days, to ease my aching arms and to allow me to see the world in colour again.
Well, as the title reads, our amazing daughter Rebecca has celebrated her first birthday in Heaven.
Since I came out of the purest depths of grief I wondered how this occasion would pass – Would I find myself back to the depths, in my bed, crying and wearing the pain on my sleeve – Or would I find the strength to enjoy the day and focus on where Rebecca is rather then where she isn’t. I went through a very long stage of wanting a huge celebration and charitable event to raise money for Sands (Stillbirth And Neonatal Death Society) but then I backed down not knowing how I would feel and whether I would have the capacity to deal with the added pressure?
Before I knew it March 2016 was fast approaching and I thought it was just best to accept the way I felt about the day when the day actually arrived.
Two days prior Rebecca’s ‘Angelversary’ we had her headstone erected. This was something I was incredibly excited about. It was like an early birthday present from my husband and I. I insisted to be there to watch the whole process, knowing it was the last thing I could do for her i wanted to be part of it and make sure Rebecca was ok. It was perfect, the stonemason was perfect and her headstone was perfect. Half of me was relieved that she could now lay in total peace but another half was devastated that the possibility that I could dig her back up for a cuddle was now pretty slim…Yes, i know, completely crazy thing to want to do but I am sure other mothers in my position can relate to it – when you’re in those dark moments or having a ‘bad day’, all you want is your baby, you are fully aware with who/what/where they are, but you need to hold them, to feel their skin, to feel the weight of your baby in your arms once more… how will I cope in those moments now when I know there is definitely no way I can sneak a quick cuddle?
So her headstone is up and it’s just lush. She looks so different.
Thursday 3rd March arrived. A beautiful cold, crisp sunny morning greeted us at the cemetry.
We moved on to the hospital where Rebecca was born, at the exact time one year later I was walking through the main entrance, but this time for another reason. My husband and I visited the Chaplinacy to see Rebecca’s name in the Book of Rememberance, this was when the realization hit. Seeing her beautiful name written alongside other babies who were taken the same day (but different years) was too much… we sat, we cried, we prayed for Rebecca. We left.
The rest of the day past quiet casually, fairly normally. We sat together as a family for dinner and I held my living children just that little bit closer whilst saying goodnight.
Saturday 5th March was Rebecca’s birthday. Another beautiful sunny day greeted us. We all started the day bright and early by seeing Rebecca in the morning, taking a big balloon and pure white roses to her grave. We then headed to hospital again, this time to visit the Children’s Unit….
Since Rebecca passed away I have missed out on so much, I can’t even begin to list the things/moments/memories/dreams I have missed. Whilst buying a Christmas present for my neice, who is now soon turning one herself, I found it hard looking at all the toys I could/should be buying for Rebecca. I carried the pain of that moment into the new year. Until I realised that it doesn’t have to be that hard, why can’t I buy Rebecca toys/gifts/teddies? So I decided I would from now on.
So we headed up to the hospital and donated the gifts we had chosen for Rebecca as a family and donated them to the Children’s Unit – they won’t be played with by Rebecca, but they will be played with. I released the overpowering need to buy Rebecca gifts and I know that they will be played with and bring joy to others. We will do this every year.
We then had a lovely pub lunch with Rebecca’s grandparents, aunts, uncles and cousins. We cut Rebecca’s birthday cake and made a wish…
We finished the day by wishing Rebecca one more happy birthday with her at her grave, the children released their balloons and I gave Rebecca a slice of her birthday cake.
All in all, the day went as well as it could.
We celebrated Rebecca for who, what and where she is, rather then the opposite.
This past year has taught me so much, I have grown to accept my ‘bad days’ and to embrace my ‘good days’. I never know what tomorrow might bring or whether it’ll be a ‘good’ or ‘bad’ day, but I know I love Rebecca the same regardless.
I’m writing this letter as I’m feeling a little blue. I hope you don’t think I’m asking too much of you. You visit every year and leave us such wonderful things, but I’m wondering if you visit all the children who have wings?
I know you are very busy, so much to do in one night, but could you please make an extra trip to the stars that shine so bright? You see my baby lives up there, just too perfect for life on earth, no presents I could send to truly show their worth.
Please leave them a gift and put a stocking on their cloud, filled full of precious presents from their family on the ground. Please stroke their sleepy head and tell my baby I love them so, that my heart aches with sadness and my tears just seem to flow.
If you could do this for me Santa, I may even be able to smile, even if it is just for a little while. So thank you very much Santa for all that you do, after all it is Christmas in heaven too xx
The title of this post may seem a bit exaggerated but due to the way I have been feeling these past few days, I deem it to be fit.
I swore I would never again trust the hospital that took Rebecca’s life. Never again would I place one of my children’s lives into someone else’s care. I’ve been so angry.
But Saturday 26th September I found myself in a very scary predicament. My elder daughter needed medical assistance, I believed it to be serious.
As I drove to the same hospital in a panic, disturbing memories of my last panic drive to hospital filled my head. I was so scared. Scared of my daughters condition and scared to enter this hospital again.
My daughter has since been admitted into hospital and I must say the doctors and nurses have done an amazing job, after worrying speculations of meningitis, a diagnosis of pneumonia was ascertained, my daughter is now regaining her health.
What I have regained goes deeper then health.
Walking into any hospital is a risk to me now, risk of the unknown and risk of seeing lots of bumps and babies. This particular hospital has been so difficult to enter, relying on another doctor here has been even more difficult. To makw matters worse, ironically the Childrens Ward is located on the same floor as Maternity Services – so balloons, bumps and babies are everywhere. As I travelled from my daughters ward to x-ray I passed their Delivery Suite. I found myself just staring at the door to the Delivery Suite. My head was divided; a sheer gut-wrenching pain of the memories of the last time I entered that door, the last time I walked out of that door and the horrific moments inbetween. Another half was that of wishful thinking, a fantasy that I was still one of these unsuspecting mothers again, the mothers who enter that door with an excited knot in their stomachs, the hospital bag that has been on stand-by can now be used and the baby that has been grown can soon be heard and held. A fantasy fills my head that I am still one of those unsuspecting mothers who walk out of that door with a baby in a car seat, one who takes their baby home.
I cry for my elder daughter, who thankfully is recovering, but the fear of losing another child was just too much. I’m emotionally drained.
Nearly 7 months later, I am here again, regaining some of the trust I lost.
The fears that I have will never go away, these past few days and nights don’t repair any damage that was caused by Rebecca’s death. These past few days and nights have just been another hurdle in my new life. I have faced a fear.
I cry here for my daughter who has been helped. But I also cry for my daughter who wasn’t.
I miss you so much Rebecca, you would now be 6 months old. Smiling at me with your bright beautiful eyes, holding your arms out to me to hold you close.
The pain in my heart still screams out so loud inside my body for you.
Six months have passed, does not seem long for most, but for me; a lifetime. The world has carried on without me. The flowers died long ago, the cards have been gently placed inside a box, inside your draw, inside your bedroom. The messages of condolences have stopped. The hugs and gentle looks have slowly dimised.
Life has carried on, but I am still here. Grieving.
I am still here grieving but I am still here.
Life is pushing me forward, the sun shines, a smile has been returning to my face, I can sing along to music again – to your music. You have given me the strength to return to back to work this week, to my office, to fimilar faces who watched you grow. Memories are painful, but for some reason I feel so close to you there.
Six months have passed since you changed my life, my heart breaks and aches each day for you. I will forever long to hold you once more. But I know you are still here, helping me – guiding me through my new life. You’ll always be here. You’re never far away.
I love you,
x Mummy x
Just one little peek into heaven, Is all I’m asking for today. I just want to know how she’s doing, As heaven seems so far away.
Is she playing on the clouds with angels? Is she laughing and running today? Does she miss me? I guess only she knows.
Oh why does heaven seem so far away? If you just let me look for a moment, To catch a glimpse of her sweet smiling face, I promise I won’t try to take her, For I know she’s in a better place.
Just one little peek into heaven, Is all I’m asking for today. I just want to know how she’s doing, As heaven seems so far away…
As those first days without Rebecca turned into weeks and months, I was unaware of the world, I was in a thick, dark foggy bubble of grief and shock, I was completely numb. I couldn’t breathe – only cry. I would lay in bed just staring at photos of Rebecca. Thinking about Rebecca. Longing for Rebecca.
As the first month turned into the second I found myself moving forward, not far forward mind. I’m not sure how but I moved, I got dressed, I washed, I ate, I cared for my living children and I started to smile again. Life was pushing me forward. The guilt I felt whilst doing these things started to lift. Heaven knows how much I wanted to stay in that thick, dark foggy bubble, surrounded by my angel. But my ‘new life’ had other plans. It cleared the thick fog, but whilst remaining in my bubble, I was starting to see through it clearer. Life pushed me forward without me having a chance to stop it. I allowed myself to start watching one programme… Only one, our family staple – Eastenders.
A few weeks ago I was given the ‘heads up’ of an upcoming storyline in Eastenders. The storyline being that of two parents-to-be were to endure the devastating news their baby had died inside the womb.
Ironically only a week or so before this news was given, two pregnancies were announced on Eastenders and each time I rolled my eyes and muttered under my breathe how I doubted their baby would meet the same fate our Rebecca did. Soapland babies always come into the world perfectly.
I was wrong. Eastenders will be airing a stillbirth storyline and I don’t know how to feel. Or whether I have the strength to watch.
On one hand I’m so scared how they will portray this subject. I have no idea how much they will show, how their baby will pass nor how long they will follow these parents in the aftermath. So scared of what my feelings will be whlist watching, scared of flashbacks, triggers and memories being brought up. Scared of reliving those first few days. No doubt I will be watching behind a tear soaked pillow.
I hope people are kind and gentle. I hope people understand this isn’t just a soapline, for parents like me and my husband this is real life. This is what we’re up against for the rest of our lives.
My husband and I are not alone, a staggering 17 babies are stillborn each day in the UK, 17 families torn apart, 17 babies who don’t come home.
On another hand I’m so glad to hear that BBC are having the ‘balls’ to show such a tragic story, glad to hear producers and the actors involved have been in very close contact with Sands (Stillbirth And Neonatal Death Charity) speaking to parents who have lived through this ordeal for real.
With a bit of luck Eastenders will help lift the taboo that surrounds Stillbirth. I firmly believe parents should be allowed to talk about their babies openly, if they wish, without dampening an atmosphere. Without awkward silences. Without strange looks. Our babies were much wanted and are still so loved. These are our children. We are proud of them. They needn’t be ignored or hidden.
I read somewhere that this world needs to learn alot about the differences between sympathy and empathy. I agree. When Rebecca left us I was surrounded by two types of comments,
“At least you have 2 at home already”
“We’ll, you’re still young, I’m sure you can try again”
“Everything happens for a reason”
“At least you got to meet your baby”
These comments may seem innocent to the person saying them but they hurt. There are no “At least…”
Thankfully other comments were easier to hear, they helped.
“So sorry your baby couldn’t stay, what was her name”
“Did you manage to make precious memories with your daughter?”
“She will always be with you – in your heart”
The difference in what is said can really make a difference.
If you watch Eastenders, I’m aware this will be a hard watch, but please hold a thought for all the parents who have to go through this every day. Thankfully most you can turn off after 30 minutes, we cannot turn off, our drama is real. I hope Eastenders do well, I’m aware entertainment programmes can have the power to gain awareness for a topic and to generate reactions. I hope this can be the start of a change on the public perception of the babies who are taken so soon.
|
Q:
Remove category_id property from ColumnValue object in Vue template
I want to remove category_id from {{ columnValue }}, but what is the best way to to that, because i need category_id in the first part ?
<table>
<tr>
<td v-for="columnValue, column in record">
<template v-if="editing.id === record.id && isUpdatable(column)">
<template v-if="columnValue === record.category_id">
<select class="form-control" v-model="editing.form[column]">
<option v-for="column in response.joins">
{{ column.category }} {{ column.id }}
</option>
</select>
</template>
<template v-else="">
<div class="form-group">
<input class="form-control" type="text" v-model= "editing.form[column]">
<span class="helper-block" v-if="editing.errors[column]">
<strong>{{ editing.errors[column][0]}}</strong>
</span>
</div>
</template>
</template>
<template v-else="">
{{ columnValue }} // REMOVE category_id here!
</template>
</td>
</tr>
</table>
And the view (its the number under group i want to remove):
The DataTable view
The script:
<script>
import queryString from 'query-string'
export default {
props: ['endpoint'],
data () {
return {
response: {
table: null,
columntype: [],
records: [],
joins: [],
displayable: [],
updatable: [],
allow: {},
},
sort: {
key: 'id',
order: 'asc'
},
limit: 50,
quickSearchQuery : '',
editing: {
id: null,
form: {},
errors: []
},
search: {
value: '',
operator: 'equals',
column: 'id'
},
creating: {
active: false,
form: {},
errors: []
},
selected: []
}
},
filters: {
removeCategoryId: function (value) {
if (!value) return ''
delete value.category_id
return value
}
},
computed: {
filteredRecords () {
let data = this.response.records
data = data.filter((row) => {
return Object.keys(row).some((key) => {
return String(row[key]).toLowerCase().indexOf(this.quickSearchQuery.toLowerCase()) > -1
})
})
if (this.sort.key) {
data = _.orderBy(data, (i) => {
let value = i[this.sort.key]
if (!isNaN(parseFloat(value)) && isFinite(value)) {
return parseFloat(value)
}
return String(i[this.sort.key]).toLowerCase()
}, this.sort.order)
}
return data
},
canSelectItems () {
return this.filteredRecords.length <=500
}
},
methods: {
getRecords () {
return axios.get(`${this.endpoint}?${this.getQueryParameters()}`).then((response) => {
this.response = response.data.data
})
},
getQueryParameters () {
return queryString.stringify({
limit: this.limit,
...this.search
})
},
sortBy (column){
this.sort.key = column
this.sort.order = this.sort.order == 'asc' ? 'desc' : 'asc'
},
edit (record) {
this.editing.errors = []
this.editing.id = record.id
this.editing.form = _.pick(record, this.response.updatable)
},
isUpdatable (column) {
return this.response.updatable.includes(column)
},
toggleSelectAll () {
if (this.selected.length > 0) {
this.selected = []
return
}
this.selected = _.map(this.filteredRecords, 'id')
},
update () {
axios.patch(`${this.endpoint}/${this.editing.id}`, this.editing.form).then(() => {
this.getRecords().then(() => {
this.editing.id = null
this.editing.form = {}
})
}).catch((error) => {
if (error.response.status === 422) {
this.editing.errors = error.response.data.errors
}
})
},
store () {
axios.post(`${this.endpoint}`, this.creating.form).then(() => {
this.getRecords().then(() => {
this.creating.active = false
this.creating.form = {}
this.creating.errors = []
})
}).catch((error) => {
if (error.response.status === 422) {
this.creating.errors = error.response.data.errors
}
})
},
destroy (record) {
if (!window.confirm(`Are you sure you want to delete this?`)) {
return
}
axios.delete(`${this.endpoint}/${record}`).then(() => {
this.selected = []
this.getRecords()
})
}
},
mounted () {
this.getRecords()
},
}
</script>
And here is the json:
records: [
{
id: 5,
name: "Svineskank",
price: "67.86",
category_id: 1,
category: "Flæskekød",
visible: 1,
created_at: "2017-09-25 23:17:23"
},
{
id: 56,
name: "Brisler vv",
price: "180.91",
category_id: 3,
category: "Kalvekød",
visible: 0,
created_at: "2017-09-25 23:17:23"
},
{
id: 185,
name: "Mexico griller 500 gram",
price: "35.64",
category_id: 8,
category: "Pølser",
visible: 0,
created_at: "2017-09-25 23:17:23"
},
{
id: 188,
name: "Leverpostej 250 gr.",
price: "14.25",
category_id: 9,
category: "Pålæg",
visible: 1,
created_at: "2017-09-25 23:17:23"
},
}]
.. and so on......
A:
I would recommend using a filter in Vue to remove the property, such as:
new Vue({
// ...
filters: {
removeCategoryId: function (value) {
if (!value) return ''
delete value.category_id
return value
}
}
})
An then use this in your template:
{{ columnValue | removeCategoryId }}
Update: I misunderstood the scope of the loop. This works, and I verified on jsfiddle: https://jsfiddle.net/spLxew15/1/
<td v-for="columnValue, column in record" v-if="column != 'category_id'">
|
Phase separation dynamics of polydisperse colloids: a mean-field lattice-gas theory.
New insights into phase separation in colloidal suspensions are provided via a dynamical theory based on the polydisperse lattice-gas model. The model gives a simplified description of polydisperse colloids, incorporating a hard-core repulsion combined with polydispersity in the strength of the attraction between neighbouring particles. Our mean-field equations describe the local concentration evolution for each of an arbitrary number of species, and for an arbitrary overall composition of the system. We focus on the predictions for the dynamics of colloidal gas-liquid phase separation after a quench into the coexistence region. The critical point and the relevant spinodal curves are determined analytically, with the latter depending only on three moments of the overall composition. The results for the early-time spinodal dynamics show qualitative changes as one crosses a 'quenched' spinodal that excludes fractionation and so allows only density fluctuations at fixed composition. This effect occurs for dense systems, in agreement with a conjecture by Warren that, at high density, fractionation should be generically slow because it requires inter-diffusion of particles. We verify this conclusion by showing that the observed qualitative changes disappear when direct particle-particle swaps are allowed in the dynamics. Finally, the rich behaviour beyond the spinodal regime is examined, where we find that the evaporation of gas bubbles with strongly fractionated interfaces causes long-lived composition heterogeneities in the liquid phase; we introduce a two-dimensional density histogram method that allows such effects to be easily visualized for an arbitrary number of particle species.
|
1. Field of the Invention
The present invention relates to a cleansing control apparatus adapted to automatically control the amount, direction, angle, etc. of a fluid when the fluid such as cleanser, medicine or the like is jetted out to clean or sanitize an aimed part of one's rump.
2. Description of the Prior Art
A conventional cleansing control apparatus of the type referred to above, for instance, a control apparatus used in a toilet is designed to control opening and closure of a jet port having one or a plurality of opening holes, or to oscillate and move the position of the jet port to clean a predetermined area of the aimed part.
The jet port of the conventional control apparatus is preliminarily positioned and directed towards a point where the aimed part of the rump is supposed to be found after easing nature. The aimed part is made clean by opening the jet port and flushing the liquid to the aimed part.
However, in the above arrangement where the jet port is positioned at a fixed position, a flush of the liquid does not always hit the aimed part correctly since the position of the aimed part in the rump is different depending on the stature, age, and the like of the user. Therefore, the user is obliged to move the aimed part in the way of the gushing fluid. Moreover, the aimed part spreads a predetermined area, and it becomes necessary to move the rump during cleansing in order to clean up the whole aimed part desired to be cleaned.
In the meantime, such an approach is made to lessen the movement of the rump around the center of the aimed part such that a moving part which is able to change the position of the jet port from the standard position is provided in the control apparatus. The moving part is adapted to oscillate for every user.
However, any of the aforementioned arrangements is not capable of confirming the position of the aimed part, and since the fluid is jetted only to a predetermined point, the user is inconveniently required to move the aimed part by himself or herself.
In addition, a selection button must be used to switch the position of the jet port depending on whether the user is male or female or, excretes feces or urine. It is a troublesome to manipulate the button every time before use.
|
Euthanasia advocate Philip Nitschke investigated for role in murder suspect's death
Kate Hagan
The Medical Board of Australia has launched a fourth investigation into euthanasia campaigner Philip Nitschke over his involvement with a 45-year-old man without a terminal illness who took his own life.
Nigel Brayley, who ended his life using a euthanasia drug, was being investigated over the suspected murder of his wife.
Dr Nitschke said he provided support to Mr Brayley to end his life. He said there was nothing to suggest Mr Brayley was depressed, and he did not have any obligation to refer him to a psychiatrist.
Dr Nitschke's actions have drawn the ire of groups including the Australian Medical Association and beyondblue.
Advertisement
He said he had been informed by the Australian Health Practitioner Regulation Agency that it would investigate him over the case.
''I’ll have to fight it every step of the way, whether there was any breach of so-called medical ethics in Nigel’s case,'' he said.
A spokeswoman for Exit International added that any action by the agency would have ''no bearing on Philip’s activities at Exit, as this is not a medical practice''.
Dr Nitschke was due to speak at the Australian Medical Students' Association national convention conference on Thursday, but said his presentation was cancelled at 24 hours' notice. He was due to speak on the topic ''Voluntary euthanasia or rational suicide – two sides of the same coin?''
He is facing three other board investigations, including complaints that he tried to import nitrogen cylinders that could be used for suicide.
Voluntary euthanasia campaigner Rodney Syme has expressed ''grave concerns'' that people with mental illnesses may be accessing information on how to kill themselves through websites and seminars run by Dr Nitschke.
Dr Syme said the Brayley case reinforced his long-held concerns about Dr Nitschke providing information to people through websites and seminars without any knowledge of their mental states.
''I've been concerned for some years that Philip's approach is irresponsible; that it does not protect people who are vulnerable because of psychiatric disturbance,'' he said. ''Everyone has a duty of care to someone who might be considering suicide and a doctor has a much higher duty of care.''
For help or information call Suicide Line on 1300 651 251 or Lifeline on 131 114, or visit beyondblue.org.au.
|
(March 24, 2020) Since the release of the "Path Forward", (brought to you by the Humane Society of the United States, the ASPCA, Wild horse sanctuary, Return to Freedom, the National Cattlemen's Beef Association, etc.) its supporters have consistently maintained that safe and humane fertility control is the core of the proposal and have downplayed the plan’s key component -- removal of up to 130,000 horses and burros from the public lands over the next 10 years.
In reality, the Path Forward is pursuing the same failed strategy that the Bureau of Land Management (BLM) has employed in the last 40 years – massive roundup and removals with minimum fertility control. While the proposal is short in detail, it makes clear that the “business as usual” roundups and removals is the preferred strategy and that sterilization of both mares and stallions is on the table.
The Path Forward: More of the Same - Increased Roundups and Stockpiling.
Despite this, proponents convinced Congress to increase the BLM’s Wild Horse and Burro Program budget by a whopping 25% — $21 million — last year, based on their representation that the plan provided a “path forward” for a radical shift away from roundups and toward reliance on fertility control to manage the nation’s wild herds. According to New York Times and Pulitzer Prize-winning reporter David Phillips, author of Wild Horse Country: The History, Myth, and Future of the Mustang, this is the third time in the program’s history that Congress has decided to increase the program’s budget based on promises of reform. Twice before, the agency has used additional funding to round up as many horses as possible, deepening the crisis with each accelerated roundup push.
Roundups and Removals
Is the Path Forward really a “fertility control” plan as its proponents claim? Let’s look at the numbers. The 10-year Path Forward plan asserts, based on unpublished population models, that 15,000-20,000 horses should be rounded up and removed each year for the first three years and then 5,000-10,000 each year for the next seven years in order to “to get the population close to the BLM’s desired AML [Appropriate Management Level] of just 26,690” wild horses and burros.
To justify these huge numbers, the Path Forward states, removals “need to be higher initially to allow fertility control to catch up with the population” because implementing “fertility control alone or alongside current average removal numbers would not achieve population balance and control.” That statement by itself reveals the prevalent role that roundup and removals will play compared to fertility control in this proposal. It also emphasizes the plan’s core goal: achieving the AML, despite the National Academy of Science (NAS) 2013 conclusion that these population limits are not supported by science or transparent to the public.
On top of the massive roundups and removals, the Path Forward calls for “reasonable” sex ratio skewing, which it defines as a 70% to 30% stallion to mare ratio. It’s hard to imagine how any humane organization could endorse this extreme manipulation of wild horse and burro populations. Even the BLM admits that sex ratio skewing will cause social disruption and increased aggression among herds as a large number of stallions fight for a small number of mares. Clearly, this will have profound impacts on the welfare and natural behaviors of wild herds.
Fertility Control
The Path Forward acknowledges the BLM’s abysmal record on implementing safe, cost-effective, and humane fertility control: “Between 2012 and 2018, the BLM treated fewer than 4,353 horses with fertility control, and released many gathered horses back onto the range without fertility control treatment.” At the same time, it gives the BLM a complete pass by stating that the agency has a “limited range of tools at its disposal” because of “logistics and controversy.” This contradicts the NAS’ 2013 finding that “Tools already exist for BLM to address many challenges.”
Further, while calling for an annual roundup of up to 20,000 horses, the Path Forward is vague about the actual number of horses who will be treated with fertility control and when the treatments will begin. In fact, according to Bruce Rittenhouse, Acting Wild Horse and Burro Division Chief, speaking at the BLM Advisory Board Meeting in October, the agency needs to aggressively remove wild horses down to AML and hold off on implementing fertility control while HMAs are over AML because it is not cost-effective. Other BLM officials have reiterated this position.
Permanent Sterilization
The BLM has made clear that it defines “fertility control” to include permanent sterilization, and the agency currently is placing an emphasis on surgical removal of wild mares’ ovaries and castration of free-roaming stallions as its preferred population control methods.
When it commissioned the 2013 report, the BLM asked the NAS to answer several questions, including whether the use of surgical sterilization methods — ovariectomy in mares and castration of stallions — was appropriate as a wild horse and burro management tool. The NAS concluded that they were not, stating,
“The possibility that ovariectomy may be followed by prolonged bleeding or peritoneal infection makes it inadvisable for field application. ”
” “A potential disadvantage of both surgical and chemical castration is loss of testosterone and consequent reduction in or complete loss of male-type behaviors necessary for maintenance of social organization, band integrity, and expression of a natural behavior repertoire.”
Nothing in the Path Forward plan discourages these dangerous and controversial methods that the NAS warned against. In fact, the ASPCA, a major plan proponent, has acknowledged that ovariectomy and castration could be part of the plan.
Rep. Chris Stewart, a vocal advocate in favor of the plan, said on the House floor that the Congressional funding would be used for mass sterilization.
Utah BLM Wild Horse and Burro Lead Gus Warr has stated clearly that the Path Forward Plan will help BLM implement surgical sterilization and facilitate the creation of non-reproducing or partial non-reproducing herds on the range.
Given the extreme population reductions envisioned, the combined use of sex ratio skewing and “fertility control,” particularly sterilization, on 90% of the horses left on the range could spell the end for America’s wild free-roaming mustang and burro herds.
Definition of Insanity
The last time Congress threw money at the wild horse and burro program was during the previous administration, which promised “fundamental reforms” including making science-based management decisions based on the recommendations of the NAS, reducing removals, and expanding the use of fertility control to maintain herd levels.
The BLM, however, failed to deliver on promised fertility control, focusing instead on roundups, removals, and warehousing of horses and burros and pushing the program to the verge of fiscal collapse — while also illegally selling nearly 2,000 wild horses for slaughter.
Albert Einstein defined insanity as doing the same thing over and over again but expecting different results. This the third time that Congress has thrown money at the broken wild horse and burro program. Each time before, the BLM used the funding but failed to deliver on promises of reform. Given its call for accelerated and unprecedented roundups and removals, there’s no reason to expect the Path Forward will achieve anything different this time. Instead, it could spell the end for America’s wild free-roaming horses and burros.
Up next: Part III: Perpetuating the Myth of “Overpopulation”
Read Part I: The Science Fallacy
|
Q:
Check an array of session values in PHP
There is an array of user states stored in the session. This works:
<?php if ($_SESSION['_app_user']['data']['state']['1']) { ?>
<p>User has state 1</p>
<?php } ?>
But, selecting multiple states doesn't:
<?php if ($_SESSION['_app_user']['data']['state']['1,6,10']) { ?>
<p>User has state 1 or 6 or 10</p>
<?php } ?>
How can you check on multiple states?
A:
By checking multiple.
You may find it easier to store the least common denominator to a temporary variable:
$s = $_SESSION['_app_user']['data']['state'];
if(isset($s[1]) || isset($s[6]) || isset($s[10])) {
echo 'Tahdah!';
}
unset($s);
Also, please use quotes for your strings. It makes code clearer, and saves the PHP interpreter a bit of effort guessing that you mean a string instead of, say, a constant named _app_user :)
|
/*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
package com.gmail.filoghost.holographicdisplays.nms.v1_11_R1;
import java.util.Collection;
import org.bukkit.EntityEffect;
import org.bukkit.Location;
import org.bukkit.craftbukkit.v1_11_R1.CraftServer;
import org.bukkit.craftbukkit.v1_11_R1.entity.CraftArmorStand;
import org.bukkit.entity.Entity;
import org.bukkit.event.player.PlayerTeleportEvent.TeleportCause;
import org.bukkit.inventory.ItemStack;
import org.bukkit.potion.PotionEffect;
import org.bukkit.util.EulerAngle;
import org.bukkit.util.Vector;
public class CraftNMSArmorStand extends CraftArmorStand {
public CraftNMSArmorStand(CraftServer server, EntityNMSArmorStand entity) {
super(server, entity);
}
// Disallow all the bukkit methods.
@Override
public void remove() {
// Cannot be removed, this is the most important to override.
}
// Methods from Armor stand class
@Override public void setArms(boolean arms) { }
@Override public void setBasePlate(boolean basePlate) { }
@Override public void setBodyPose(EulerAngle pose) { }
@Override public void setBoots(ItemStack item) { }
@Override public void setChestplate(ItemStack item) { }
@Override public void setHeadPose(EulerAngle pose) { }
@Override public void setHelmet(ItemStack item) { }
@Override public void setItemInHand(ItemStack item) { }
@Override public void setLeftArmPose(EulerAngle pose) { }
@Override public void setLeftLegPose(EulerAngle pose) { }
@Override public void setLeggings(ItemStack item) { }
@Override public void setRightArmPose(EulerAngle pose) { }
@Override public void setRightLegPose(EulerAngle pose) { }
@Override public void setSmall(boolean small) { }
@Override public void setVisible(boolean visible) { }
@Override public void setMarker(boolean marker) { }
// Methods from LivingEntity class
@Override public boolean addPotionEffect(PotionEffect effect) { return false; }
@Override public boolean addPotionEffect(PotionEffect effect, boolean param) { return false; }
@Override public boolean addPotionEffects(Collection<PotionEffect> effects) { return false; }
@Override public void setRemoveWhenFarAway(boolean remove) { }
@Override public void setAI(boolean ai) { }
@Override public void setCanPickupItems(boolean pickup) { }
@Override public void setCollidable(boolean collidable) { }
@Override public void setGliding(boolean gliding) { }
@Override public boolean setLeashHolder(Entity holder) { return false; }
// Methods from Entity
@Override public void setVelocity(Vector vel) { }
@Override public boolean teleport(Location loc) { return false; }
@Override public boolean teleport(Entity entity) { return false; }
@Override public boolean teleport(Location loc, TeleportCause cause) { return false; }
@Override public boolean teleport(Entity entity, TeleportCause cause) { return false; }
@Override public void setFireTicks(int ticks) { }
@Override public boolean setPassenger(Entity entity) { return false; }
@Override public boolean eject() { return false; }
@Override public boolean leaveVehicle() { return false; }
@Override public void playEffect(EntityEffect effect) { }
@Override public void setCustomName(String name) { }
@Override public void setCustomNameVisible(boolean flag) { }
@Override public void setGlowing(boolean flag) { }
@Override public void setGravity(boolean gravity) { }
@Override public void setInvulnerable(boolean flag) { }
@Override public void setMomentum(Vector value) { }
@Override public void setSilent(boolean flag) { }
@Override public void setTicksLived(int value) { }
}
|
Complementation analysis of patients with intact peroxisomes and impaired peroxisomal beta-oxidation.
Complementation analysis, using peroxisomal beta-oxidation of very long chain fatty acids (VLCFA) as the criterion for complementation, is useful in the study of patients who are suspected of having a single enzyme defect in the peroxisomal beta-oxidation pathway. Laboratory findings for these patients include elevated plasma VLCFA and impaired VLCFA oxidation in fibroblasts. Some of these patients have slightly abnormal phytanic acid oxidation in fibroblasts. In addition, elevated levels of bile acid intermediates have been reported in some cases. Plasmalogen synthesis, pipecolic acid levels, and subcellular distribution of catalase are normal. Using complementation analysis, we show that six patients, who were suspected of having a single enzyme defect in the peroxisomal beta-oxidation pathway, are deficient in peroxisomal bifunctional enzyme [enoyl-CoA hydratase (EC 4.2.1.17)/3-hydroxyacyl-CoA dehydrogenase (EC 1.1.1.35)] activity. This group of six patients, deficient in bifunctional enzyme activity, may be subdivided into two complementation groups. It would appear that patients in each of these two groups are deficient in only one of the bifunctional enzyme activities.
|
Role of phase II drug metabolizing enzymes in cancer chemoprevention.
Chemical insults, such as environmental or occupational carcinogenic agents, play a major role in the pathogenesis of many cancers. Many carcinogens exert genotoxic and cytotoxic effects via bioactivation into electrophilic species, a process catalyzed primarily by phase I drug metabolizing enzymes, typically cytochrome P450s. These reactive intermediates can induce DNA and RNA damage, and formation of protein adducts. The reactive species are often detoxified by phase II drug metabolizing enzymes, such as glutathione S-transferases (GSTs), UDP-glucuronosyl transferases (UGTs), sulfotransferase (ST) and N-acetyltransferase (NAT). Phase II enzymes classically conjugate these hydrophobic intermediates to a water-soluble group, thus masking their reactive nature, and allowing subsequent excretion. Therefore, strategies that modulate the levels of phase II enzymes by either pharmacological or nutritional means can lead to enhanced elimination of reactive species. Agents that preferentially activate phase II over phase I enzymes can be beneficial as chemopreventives. Compounds, such as isothiocyanates and dithiolthiones have been shown to act as transcriptional activators of phase II enzymes. A consensus enhancer element, known as antioxidant response element (ARE), in the regulatory domains of many phase II genes and an ARE-binding transcription factor nuclear factor E2-related factor 2 (Nrf2) have been implicated in the action of many chemopreventive agents. In this review, we will discuss the mechanisms of regulation of phase II enzymes, including the signal transduction events elicited by chemopreventive agents. We will also summarize the data available for these agents in preclinical models of tumorigenesis. Some chemopreventive agents have progressed to various stages of clinical trials, e.g. biomarker studies in healthy volunteers or in susceptible populations. These clinical data will be reviewed. Finally, we will provide a commentary on implementation of discovery and development programs for novel chemopreventive agents that are based on rational drug design, with lead optimization towards a safe and efficacious regimen in man.
|
Fourteen normal subjects (18-42 y) were studied using venous occlusion plethysmography to investigate the characteristics and reproducibility of the forearm vasoconstrictor response following a prolonged venous occlusion stimulus. Upon release of the stimulus, a transient vasodilation is followed by a vasoconstriction. As the stimulus of venous occlusion pressure increased (40, 60, 80, and 100 mmHg for 5 min), there was a significant increase in maximum flow (p = 0.01). Minimum relative flow (minimum divided by control) was unchanged except at the highest occlusion pressure (0.49 +/- 0.05, 0.38 +/- 0.04, 0.47 +/- 0.07, 0.66 +/- 0.12, p = 0.04). As venous occlusion duration increased (3, 4, 5, and 6 min at 80 mmHg), there was no significant change in minimum relative flow (p = 0.73). With increasing ambient temperature (18, 23, and 28 degrees C), there were no significant changes in maximum or minimum relative flows (p = 0.40 and 0.25, respectively). Minimum relative flow was not significantly altered following occlusion with a 2.5-cm cuff vs. a 10-cm cuff (p = 0.77). Thus, the vasoconstriction response was reproducible over a range of venous occlusion stimuli and experimental conditions. We conclude that dynamic vascular responsiveness to prolonged venous occlusion can be measured by venous plethysmography and that calculation of the minimum flow relative to control flow is an appropriate and reproducible index of the vasoconstrictor response. Based on our studies and to conveniently measure these changes, we recommend a 10-cm venous occlusion cuff, with a pressure < or = 80 mmHg, for durations < or = 5 min, in an ambient temperature of 23 degrees C.
|
Introduction {#Sec1}
============
C*itrus* are widely used for the consumption of fruit flesh and juices. Modern citrus varieties were generated over thousands of years by intraspecific and interspecific crosses of a handful of species combined with clonal propagation^[@CR1]--[@CR3]^. Acidity is a major trait determining the taste and use of citrus fruits and selection by breeders and producers has generated a broad palette of sour and "sweet" (i.e., non-sour) varieties of lemons, oranges, pummelos, and other citrus fruits^[@CR4]^
For a sour taste, food/liquid should have (i) a high concentration of free H^+^ ions (low pH), which is sensed by acid-sensitive cells in taste buds, presumably via an H^+^-selective channel^[@CR5]^ and (ii) a certain pH-buffering capacity to prevent the liquid from being neutralized by the saliva. The acidity (low pH) of *Citrus* fruits is determined by the pH of the vacuoles in juice vesicle cells, which can be as low as 2 in sour lemons and lime^[@CR6]--[@CR8]^. The steep proton gradient across the vacuolar membrane (tonoplast) drives massive transport of citrate into the vacuole via a mechanism that is only partially understood^[@CR9],[@CR10]^. As citrate enters the vacuole in dissociated form (citrate^3−^), it increases its buffer capacity, which contributes to the sour taste^[@CR11]^, but does not lower the pH. How juice vesicle cells can hyperacidify their vacuoles to such an extreme extent remained elusive in spite of extensive biochemical work^[@CR8],[@CR9],[@CR12]--[@CR15]^.
In most plant cells, the cytoplasm is about neutral and the vacuolar lumen mildly acidic. The (moderate) pH gradient across the tonoplast is generated by vacuolar-ATPases (V-ATPases)^[@CR16],[@CR17]^, which are complex multi-subunit proton pumps found in both animals and plants^[@CR18],[@CR19]^. V-ATPases translocate 2--4 protons per hydrolyzed ATP (H^+^/ATP = 2--4) depending on the pH on both sides of the membrane^[@CR20],[@CR21]^ and may in theory acidify vacuoles down to pH ≈ 3.5, when operating without kinetic inhibition, which it rarely if ever occurs in vivo, and in its "lowest gear" (H^+^/ATP = 2). Further acidification to pH \< 3, as in lemon vacuoles, would require H^+^/ATP ratios \<2 (ref. ^[@CR20]^). Acid lemons indeed contain a proton-pump activity with H^+^/ATP = 1 stoichiometry^[@CR8],[@CR12],[@CR14],[@CR15]^. However, the nature of this fruit-specific proton pump has remained elusive ever since, because it could not be completely purified^[@CR13],[@CR15]^.
In petunia, mutations in one of the seven *PH* loci (*PH1*--*PH7*) reduce the acidity of petal vacuoles and petal homogenates, resulting in a blue flower color^[@CR22],[@CR23]^. *PH3* and *PH4* encode transcription factors of the WRKY and MYB family, respectively, which together with the helix--loop--helix protein ANTHOCYANIN1 (AN1) and the WD-repeat protein AN11, form a complex (WMBW) that activates genes involved in vacuolar acidification^[@CR24]--[@CR27]^. *PH1* and *PH5* are the major downstream genes involved in vacuolar hyperacidification^[@CR28]^. *PH5* encodes a P~3A~-ATPase proton pump that resides in the tonoplast instead of the plasma membrane where other P~3A~-ATPases reside^[@CR29],[@CR30]^. PH1 is a P~3B~-ATPase similar to bacterial Mg transporters and also resides in the tonoplast. It has no known transport activity on its own but can bind to PH5 and promote PH5 proton-pumping activity^[@CR28]^ and has an additional role in membrane/protein trafficking to the vacuole^[@CR31]^.
PH1 and PH5 homologs are widely conserved among flowering plants, including species without colored petals, suggesting that their function is not confined to flower pigmentation^[@CR30],[@CR32]^. Since *CitPH5* homologs are expressed in sour lemons and oranges^[@CR33]--[@CR35]^ and P-ATPase proton pumps can theoretically generate steeper proton gradients (because H^+^/ATP = 1), we investigated whether the PH5/PH1 complex might be the proton pump that acidifies *Citrus* vacuoles to such extreme extent.
Analyzing a collection of lemon, orange, and pummelo varieties (Supplementary Table [1](#MOESM1){ref-type="media"}), we found that *PH1* and *PH5* homologs are highly expressed in all acidic (low pH) fruits but are downregulated in non-acidic (high pH) fruits, due to inactivating mutations in CitAN1 (sweet lemon and sweet oranges) or regulatory mutations that inactivate *CitAN1*, *CitPH3*, and/or *CitPH4* expression.
Results {#Sec2}
=======
*CitPH1* and *CitPH5* expression in Faris lemons {#Sec3}
------------------------------------------------
Lemon trees of the variety 'Faris' produce branches bearing either sour or sweet (non sour) fruits, enabling a comparison of sweet and sour fruits grown in the same conditions^[@CR33]^. However, sweet and sour fruits are not necessarily isogenic, because 'Faris' is a graft chimera in which the L1 tunica layer of the shoot meristem derives from an unknown variety related to 'Millsweet' limetta and the L2 layer from a standard sour lemon^[@CR33]^. Branches of 'Faris' trees carrying sour fruits (*Fso*) have purple immature leaves, a purple blush on the lower petal epidermis, and dark spots at the chalazal end of the seeds, whereas the branches bearing sweet fruits (*Fsw*) lack purple pigmentation on leaves, petals, and seeds (Fig. [1a](#Fig1){ref-type="fig"}). The juice of *Fsw* fruits is less acidic (pH 5.1) than that of *Fso* or 'Frost Lisbon' *(Fli)* (pH 2.5), a standard lemon with strong sour taste, and *Fsw* fruits contain less titratable acid than *Fso* or *Fli* fruits (Fig. [1b](#Fig1){ref-type="fig"}). There was, however, no correlation between soluble solid content (Brix) and juice taste (Fig. [1b](#Fig1){ref-type="fig"}), indicating that juice pH and/or titratable acid rather than the sugars, which are major components of total soluble solids, determine the different taste of *Fsw* and *Fso* fruits.Fig. 1Analysis of 'Frost Lisbon' (*Fli*), 'Faris' sour (*Fso*), and 'Faris' sweet (*Fsw*) lemons. **a** Phenotypes of *Fli*, *Fso*, and *Fsw* fruits, flowers, and leaves. Scale bars represent 1 cm. **b** pH, titratable acid, and soluble solid content (°Brix) in juice from (nearly) mature *Fli*, *Fso*, and *Fsw* fruits (mean ± SE). **c** Real-time RT-PCR of *CitPH1*, *CitPH5*, and *CitMAC9F1* mRNA in juice vesicles from (nearly) mature *Fli*, *Fso*, and *Fsw* fruits. **d** Real-time RT-PCR of *CitAN1* mRNA in *Fli*, *Fso* and *Fsw* juice cells, using primers that amplify the 5', middle, and 3' part of the mRNA. **e** Structure of the *CitAN1* alleles and their transcripts in *Fso* and *Fsw* juice vesicles. **f** Real-time RT-PCR of *CitPH3*, *CitPH4*, and *CitAN11* mRNA in juice vesicles from (nearly) mature *Fli*, *Fso*, and *Fsw* fruits. Values in **c**, **d**, **f** are mean ± SE; *n* = number of samples from different fruits × number of technical replicates of each. Source data are provided as a [Source Data file](#MOESM3){ref-type="media"}
In melon (*Cucumis melo*) and tomato (*Solanum lycopersicum*), which both lack *PH1* and *PH5* homologs^[@CR30]^, the (mild) acidification of the fruit flesh requires a membrane transporter of unknown function, known in melon as PH or SOUR^[@CR36]^. We identified the *SOUR* homolog of *Citrus* (*CitSO*) and found that *CitSO* mRNAs in *Fsw* and *Fli* fruits are expressed at similar levels and lack mutations with an obvious effect on the expression and/or activity of the encoded protein, indicating that *CitSO* does not contribute to the differences in their acidity (Supplementary Figs. [1](#MOESM1){ref-type="media"} and [2](#MOESM1){ref-type="media"}).
Analysis of the *Citrus limon* homologs *CitPH1* and *CitPH5* identified previously^[@CR30]^ revealed that both are expressed in low-pH *Fli* and *Fso* lemons but not in high-pH *Fsw* lemons (Fig. [1c](#Fig1){ref-type="fig"}, Supplementary Fig. [3a](#MOESM1){ref-type="media"}). Expression of the *Citrus* homolog of *MAC9F1*, a petunia gene of unknown function that is activated by the same transcription factors as *PH1* and *PH5*^[@CR37]^, is also downregulated in *Fsw* juice vesicles similar to *CitPH1* and *CitPH5* (Fig. [1c](#Fig1){ref-type="fig"}).
These findings indicate that (i) the CitPH1-PH5 heterodimeric proton pump is involved in the hyperacidification of *Fso* and *Fli* fruits and (ii) that the reduced acidity of *Fsw* fruits results from a mutation in a regulatory gene controlling the expression of *CitPH1*, *CitPH5*, and other genes like *CitMAC9F1*.
Inactivation of *CitAN1* causes the reduced acidity in *Fsw* {#Sec4}
------------------------------------------------------------
To identify the mutation(s) responsible for the reduced expression of *CitPH1* and *CitPH5* in *Fsw* fruits, we identified *Citrus* homologs of the transcription regulators *AN1*, *AN11*, *PH4*, and *PH3* (Supplementary Fig. [4](#MOESM1){ref-type="media"}), which drive *PH1* and *PH5* expression in petunia petals and seeds^[@CR28],[@CR29]^. Public RNA-seq data^[@CR38]^ indicate that in the *Citrus sinensis* (sweet orange) variety 'Valencia' *CitPH4* is predominantly expressed in fruits, like *CitPH5* and *CitMAC9F1*, whereas *CitAN1* is also expressed in flowers, where it most likely drives anthocyanin synthesis in concert with other MYB proteins (Supplementary Fig. [5](#MOESM1){ref-type="media"}).
Reverse transcriptase--polymerase chain reaction (RT-PCR) experiments using primers complementary to the 5′ and 3′ end of the *CitAN1* coding sequence revealed that *Fli* and *Fso* juice vesicles express full-size *CitAN1* mRNAs (Fig. [1d](#Fig1){ref-type="fig"}; Supplementary Fig. [3b](#MOESM1){ref-type="media"}), which encode a functional protein (see below). Both *CitAN1* alleles of *Fso* juice vesicles consist of seven exons, of which one (exon 4) is skipped in a fraction of the mature *CitAN1* mRNA (Fig. [1e](#Fig1){ref-type="fig"}; Supplementary Fig. [3](#MOESM1){ref-type="media"}), and are distinguishable by sequence polymorphisms in *CitAN1* (single-nucleotide polymorphism (SNPs) and a 1661-bp transposon insertion in the 5′ flanking region) and in the genes immediately upstream (*CitFAR-like*) and downstream (*CitTFIIH-like*) (Supplementary Figs. [6](#MOESM1){ref-type="media"}--[8](#MOESM1){ref-type="media"}).
*Fsw* fruits, by contrast, lack full-size *CitAN1* mRNAs and instead express truncated *CitAN1* transcripts, which span the 5′ and middle region of the mRNA but lack the 3′ part (Fig. [1d, e](#Fig1){ref-type="fig"} and Supplementary Fig. [3](#MOESM1){ref-type="media"}). Analysis of genomic and 3′-RACE cDNA fragments revealed that the *citan1*^*Fsw*^ allele(s) contain an identical 1.3-kb deletion with breakpoints in exon 7 and 143 bp downstream the normal polyadenylation site, resulting in a transcript that lacks exon 8 and most of exon 7 to terminate at a cryptic polyadenylation site 57 bp downstream from the deletion breakpoint (Fig. [1e](#Fig1){ref-type="fig"} and Supplementary Fig. [9](#MOESM1){ref-type="media"}). Sequencing of PCR products from *CitAN1* and the flanking genes *CitFAR-like* and *CitTFIIH-like* revealed no sequence polymorphism (Supplementary Fig. [8](#MOESM1){ref-type="media"}). This indicates that in *Fsw* fruits the genomic *CitAN1* region is either homozygous or hemizygous over a larger deletion in the sister chromosome that spans *CitAN1*, *CitFAR-like*, and *CitTFIIH-like*.
Transcripts of the *PH4* homolog *CitPH4* accumulate at similar levels in *Fso* and *Fsw* fruits (Fig. [1f](#Fig1){ref-type="fig"}), excluding that the high-pH phenotype results from downregulation of *CitPH4*. *Fso* and *Fsw* fruit both contain two distinct *CitPH4* alleles distinguishable by few SNPs and triplet repeats of variable length, resulting in several amino acid replacements and polyglutamine (Q) tracks of variable length, which may affect protein function and/or stability (Supplementary Figs. [10](#MOESM1){ref-type="media"}--[11](#MOESM1){ref-type="media"}). The sequences of *CitAN11*^*Fso*^ and *CitAN11*^*Fsw*^ did not reveal differences with an obvious negative effect on *Fsw* protein activity (Supplementary Fig. [12](#MOESM1){ref-type="media"}), and in fruits, mRNA expression levels of the two alleles are comparable (Fig. [1e](#Fig1){ref-type="fig"}).
The finding that juice vesicles of *Fso* and *Fsw* fruits contain distinct alleles for multiple genes, including *CitAN1*, *CitPH4*, *CitAN11*, *CitFAR*-*like*, and *CitTFIID-like*, suggests that the occurrence of sweet and sour fruits results from atypical periclinal cell division(s) by which a daughter of a cell in the L2 meristem layer, containing the genome of a standard sour lemon, invaded L1 and displaced the mutant 'Millsweet'-like L1 cells, or vice versa, as in other chimeras^[@CR39],[@CR40]^, rather than the somatic reversion of an unstable (epi)allele.
To examine whether *CitPH1* and *CitPH5* are transcriptionally activated by *CitAN1* and *CitPH4* and whether the deletion in *CitAN1* and/or the polymorphisms in *CitPH4* coding sequence impair the transcription of *CitPH1* and *CitPH5* in *Fsw* lemons, we performed transient expression in protoplasts from *ph4* petunia petals, where endogenous *PH1* and *PH5* promoters are inactive. Therefore, we expressed various combinations of CitAN1^Fso^, CitAN1^Fsw^, and green fluorescent protein (GFP) fusions of CitPH4^Fso^ or CitPH4^Fsw^ from the constitutive 35S promoter and measured the expression of red fluorescent protein (RFP) reporter genes that were translationally fused to the *CitPH1*^*Fso*^ or *CitPH5*^*Fso*^ promoters (Fig. [2a](#Fig2){ref-type="fig"}). To identify transformed cells and normalize the expression levels for transformation efficiency, we co-transformed *p35S:AHA10-GFP*, which encodes a GFP fusion of the *Arabidopsis* PH5-homolog AHA10 that localizes in tonoplast of the central vacuole^[@CR32]^, and the nuclear localized GFP-CitPH4.Fig. 2Activation of *CitPH1* and *CitPH5* promoters by CitAN1 and CitPH4. **a** Structure of effector, reporter, and control genes used for transient transformation of protoplast from the epidermis of petunia *ph4* petals. **b** Relative expression (real-time RT-PCR of effector (*CitAN1* and *CitPH4*) and reporter (*pCitPH1:RFP* and *pCitPH5:RFP*) mRNA expression in petal protoplasts transformed with different effectors \[mean ± SE from 2 technical PCR replicates of 4 independent transformation experiments (*n* = 4 × 2)\]. Expression of the co-transformed *35S:AHA10-GFP* gene was used for normalization. **c** Confocal micrographs of petunia *ph4* epidermal petal protoplasts, with anthocyanins in the central vacuole, from stage 6 flowers, 24 h after transformation of *35S:AHA10-GFP*, the reporters *pCitPH1:RFP*, *pCitPH5:RFP*, and different combinations of the effectors *35S:GFP-CitPH4*^*Fso*^, *35S:GFP-CitPH4*^*Fsw*^, *35S:CitAN1*^*Fso*^, and *35S:CitAN1*^*Fsw*^. Note that GFP-CitPH4 expression is visible in the nucleus (green arrows). Images shown are representative of tens to hundreds of cells observed. Size bars equal 10 µm. Source data are provided as a [Source Data file](#MOESM3){ref-type="media"}
Expression of either CitAN1 or GFP-CitPH4 alone was insufficient to induce the *CitPH1* or *CitPH5* reporters in protoplasts (Fig. [2b, c](#Fig2){ref-type="fig"}; Supplementary Fig. [13](#MOESM1){ref-type="media"}). However, co-expression of CitAN1 and GFP-CitPH4 strongly induced *pCitPH1:RFP* and *pCitPH5:RFP* expression (Fig. [2b](#Fig2){ref-type="fig"}) in most if not all cells expressing GFP-CitPH4 and AHA10-GFP (Fig. [2c](#Fig2){ref-type="fig"}) and was independent from other (petunia) regulators of the anthocyanin/pH pathway as it also occurred in white mesophyll cells (Supplementary Fig. [13](#MOESM1){ref-type="media"}) where endogenous *AN* and *PH* genes are not expressed^[@CR26],[@CR27],[@CR29]^. The *CitPH4*^*FS*o^ and *CitPH4*^*Fsw*^ alleles activated the *CitPH1* and *CitPH5* reporters with similar efficiency, whereas the truncated AN1 protein encoded by *an1*^*Fsw*^ proved unable to induce *pCitPH1:RFP* or *pCitPH5:RFP* expression.
These findings indicate that the mutation in *citan1*^*Fsw*^ is responsible for the reduced *CitPH1* and *CitPH5* expression in the *Fsw* fruits and very likely also the loss of anthocyanins in leaves and flowers on the branches bearing *Fsw* fruits, whereas the polymorphisms in the *CitPH4*^*Fs*w^ and *CitPH4*^*Fs*o^ have little or no effect. The reduced expression of *CitPH3* in *Fsw* juice cells (Fig. [1f](#Fig1){ref-type="fig"}) is likely due to the *citan1*^*Fsw*^ mutation, since in petunia petals *PH3* is (partially) regulated by AN1 and PH4 and essential for transcription of *PH1* and *PH5*^[@CR27]^.
*CitPH1* and *CitPH5* expression in other sweet lemons {#Sec5}
------------------------------------------------------
To support that the reduced acidity of *Fsw* fruit was caused by mutation in *CitAN1* and consequent loss of *CitPH1* and *CitPH5* expression, rather than by independent mutations affecting unrelated pathway(s), we analyzed additional sweet and sour lemon varieties (Fig. [3a](#Fig3){ref-type="fig"}). 'Schaub' rough lemon is a non-edible citrus variety, unrelated to standard lemons and generally used as rootstock. 'Millsweet' limetta (*Citrus limetta*) and unnamed Sweet lemon (*Citrus limettioides*) bear sweet-tasting fruits, which have a similar soluble solid content (Brix) but have reduced juice acidity and titratable acid content. as well as *CitPH1*, *CitPH5*, and *CitMAC9F1* mRNA expression compared to 'Schaub' and 'Frost Lisbon' fruits (Fig. [3b, c](#Fig3){ref-type="fig"}).Fig. 3Analysis of 'Schaub', 'Amber', 'Millsweet', and Sweet lemon varieties. **a** Fruits, flower, and leaf phenotypes of the analyzed varieties. Size bars represent 1 cm. **b** pH, titratable acid, and soluble solid content (°Brix) in juice from different varieties (mean ± SE). **c** Real-time RT-PCR of *CitPH1*, *CitPH5*, and *CitMAC9F1* mRNA juice vesicles. **d** Real-time RT-PCR of *CitAN1*, *CitPH3*, *CitPH4*, and *CitAN11* mRNA in juice vesicles. Values in **c**, **d** are mean ± SE; *n* = number samples from different fruits × number of technical replicates of each. For **c**, **d**, full-size nearly mature fruits were analyzed. Relative mRNA expression levels from 'Frost Lisbon' were taken from Fig. [1](#Fig1){ref-type="fig"} and are repeated here for comparison. Source data are provided as a [Source Data file](#MOESM3){ref-type="media"}
*CitAN1*, *CitPH3*, and *CitPH4* transcripts are low in abundance in 'Millsweet' limetta and Sweet lemon compared to low-pH fruits, whereas *CitAN11* is expressed at similar levels as in low-pH fruits (Fig. [3d](#Fig3){ref-type="fig"}). 'Schaub', sweet 'Amber', and sour 'Amber' lemons have two *CitAN1* alleles with wild-type structure (Fig. [4](#Fig4){ref-type="fig"}), differing only for a few SNPs in *CitAN1* and the flanking genes *CitFAR-like* and *CitTFIIH-like* (Supplementary Figs. [8](#MOESM1){ref-type="media"}--[9](#MOESM1){ref-type="media"}). 'Millsweet' instead contains one allele with a wild-type structure and a truncated allele (*citan1*^*Msw*^) with a 1.3-kb deletion. The deletion in *citan1*^*Msw*^ has the same breakpoints as that in *citan1*^*Fsw*^ (Fig. [4](#Fig4){ref-type="fig"}, Supplementary Fig. [9](#MOESM1){ref-type="media"}) suggesting that both alleles originate from the same deletion event, which apparently occurred in the distant past as *citan1*^*Fsw*^ and *citan1*^*Msw*^ and the flanking *CitFAR-LIKE* and *CitTFIIH-like* genes acquired since then several polymorphisms (Supplementary Figs. [8](#MOESM1){ref-type="media"}--[9](#MOESM1){ref-type="media"}). As the first plant containing this 3' deletion allele of *CitAN1* was most likely heterozygous, homozygotes appeared later in progenies segregating for the deletion allele from various crosses, because of which today's varieties can be homozygous (*Fsw*) or heterozygous (*Msw*) for this allele.Fig. 4Structure and expression of *CitAN1* alleles in distinct lemon, orange, and pummelo varieties. Exons are indicated by rectangles with 5' and 3' untranslated regions at reduced height. Deleted sequences are indicated with dotted red lines and pink filling and transposon insertions by triangles with different colors. The hooked arrow marks the transcription start. The red dotted hooked arrows in 'Millsweet' and Sweet lemon indicate (inferred) reduced transcription caused by reduced activity of an upstream regulator(s). Gene structures confirmed by sequencing are depicted as dark gray lines (introns and flanking DNA), filled rectangles (exons), or filled triangles (transposon insertion). Gene structures inferred from polymerase chain reaction alone are marked by gray lines and white filling
PCR analysis and partial sequencing showed that Sweet lemon contains a *CitAN1* allele of normal size and a truncated allele with a deletion in 3′ end that may be similar to the deletion in *citan1*^*Fsw*^ and *citan1*^*Msw*^ (Supplementary Fig. [14](#MOESM1){ref-type="media"}). One of the Sweet lemon alleles, presumably the full-size allele, contains in its upstream region the same 1.7-kb transposon insertion as found in the 'Faris' sour and 'Frost Lisbon' alleles (Fig. [4](#Fig4){ref-type="fig"}; Supplementary Fig. [6](#MOESM1){ref-type="media"}). Given that, in 'Millsweet' limetta and Sweet lemon fruits mRNAs from both the full-size and a truncated *CitAN1* allele are downregulated, in spite of their very different origin, it is most likely that their reduced expression is caused by a mutation in an upstream *trans*-acting factor, rather than independent *cis*-acting mutations in each allele.
'Amber' is a chimera, like 'Faris', that originated as a variant tree in a grove of 'Eureka' lemons. Some branches on the 'Amber' tree bear pale green leaves, white flowers, and sweet-tasting fruits with "amber"-colored flesh, while other branches bear purplish young leaves, flowers with a purple blush, and fruits with yellow flesh and sour taste (Fig. [3a](#Fig3){ref-type="fig"}). Sweet 'Amber' lemons have a low juice pH similar to sour 'Amber', 'Schaub', and 'Frost Lisbon' lemons and express similar *CitPH1* and *CitPH5* mRNA levels as sour 'Amber' fruits and only slightly less than in 'Frost Lisbon'. Expression of the *CitAN1* allele(s) in 'Amber' sour fruits, which contain the same transposon insertion as *CitAN1*^*Fso*^, and those in sweet 'Amber' fruit, which lack this insertion (Supplementary Fig. [6](#MOESM1){ref-type="media"}), differs less than two-fold, indicating that this transposon has little or no effect on the expression of *CitAN1* and downstream genes. Thus 'Amber' sweet is essentially a low-pH variety that owes its sweet taste not from increased juice pH, but from the reduced buffer capacity, as measured by the amount of titratable acid (Fig. [3b](#Fig3){ref-type="fig"}), which might result from genetic defects in distinct pathways affecting, for example, citrate transport into the vacuole.
Taken together, we found that all varieties with low-pH lemons ('Frost Lisbon', 'Schaub', sour 'Amber', sweet 'Amber') express relatively high levels of *CitPH1* and *CitPH5* mRNA, whereas in all varieties with strongly reduced acidity ('Faris sweet', 'Millsweet', Sweet lemon) *CitPH1* and *CitPH5* expression is reduced due to independent mutations that affect upstream transcription regulators. This strongly supports the view that *CitPH1* and *CitPH5* are essential for the hyperacidification of vacuoles in lemon juice vesicles and sour taste of the fruit.
*CitAN1* and *CitPH4* are downregulated in high-pH oranges {#Sec6}
----------------------------------------------------------
Next, we extended our investigation to orange varieties (Fig. [5a](#Fig5){ref-type="fig"}). Sweet (*Citrus sinensis*) and sour oranges (*Citrus aurantium*) are both hybrids originating from pummelo and mandarin^[@CR1],[@CR3]^, with tastes ranging from sharply sour to insipidly sweet. We analyzed 'Pineapple' orange, a variety with moderate acid and sweet-rich taste, three varieties with a bland (non-sour) taste ('Lima', 'Vaniglia', and 'Orange of Heaven'), and sour oranges from two trees growing on different locations on Gran Canaria Island (small and large fruits) and one from Ostia, Italy. 'Pineapple' orange juice vesicles express *CitPH1* and *CitPH5* and *CitMAC9F1* at similar levels as sour oranges, which correlates with the low pH of the fruit juice, whereas the titratable acid content is much lower than in sour oranges (Fig. [5b, c](#Fig5){ref-type="fig"}).Fig. 5Analysis of sweet and sour orange varieties. **a** Fruits, flower, and leaf phenotypes of the analyzed varieties. Size bars represent 1 cm. **b** pH, titratable acid, and soluble solid content (°Brix) in juice from full colored mature fruits (mean ± SE; *n* ≥ 3). Note that titratable acid was not determined for Ostia (nd). **c** Real-time RT-PCR of *CitPH1*, *CitPH5*, and *CitMAC9F1* mRNA in juice vesicles from full colored mature fruits. **d** Real-time RT-PCR of *CitAN1*, *CitPH3*, *CitPH4*, and *CitAN11* mRNA in juice vesicles from full colored mature fruits. Values in **c**, **d** are mean ± SE; *n* = number samples from different fruits × number of technical replicates of each. Source data are provided as a [Source Data file](#MOESM3){ref-type="media"}
The juice of 'Lima', 'Vaniglia', and 'Orange of Heaven' oranges has higher pH and lower titratable acidity than juice from the sour varieties from Ostia, Gran Canaria1 (*GC1*) and *GC2*, whereas the soluble solid content (Brix) is similar and therefore does not contribute to the taste differences (Fig. [5b](#Fig5){ref-type="fig"}). The high pH of 'Lima', 'Vaniglia', and 'Orange of Heaven' fruits correlates with strongly reduced amounts of *CitPH1*, *CitPH5*, and *CitMAC9F1* mRNAs and approximately four-fold less *CitPH3* mRNA as compared to the low-pH fruits from 'Pineapple' orange and the trees from Ostia and Gran Canaria (GC1, GC2), possibly due to the strongly reduced levels of *CitAN1* and *CitPH4* mRNA (Fig. [5c, d](#Fig5){ref-type="fig"}). RNA-seq data revealed that *CitPH5*, *CitPH4*, and *CitAN1* mRNAs are also downregulated in the 'Sucarri' and 'Bintang' sweet oranges^[@CR35]^.
The low-pH oranges from Gran Canaria (GC1 and GC2) and Ostia all have two *CitAN1* alleles, which differ for a few SNPs and the presence/absence of the same transposon insertion as in *CitAN1*^*Fso*^ and *CitAN1*^*Aso*^ (Supplementary Figs. [6](#MOESM1){ref-type="media"}--[7](#MOESM1){ref-type="media"}; Fig. [4](#Fig4){ref-type="fig"}). The *citan1* allele(s) of the high-pH 'Lima' and 'Orange of Heaven' oranges are disrupted by the insertion of a 6.9-kb transposable element containing 39-bp inverted repeats (MudR-like element) in intron 2. The *citan1* allele(s) of 'Vaniglia' are disrupted by the insertion of a 5.3-kb copia-like TCS1 retrotransposon in exon 6 (Fig. [4](#Fig4){ref-type="fig"}). The downregulation of *CitPH4* is most likely due to an independent mutation, as *CitPH4* expression in lemons is independent from *CitAN1* (Fig. [1](#Fig1){ref-type="fig"}).
No relevant differences in the expression of *CitAN11* were detected in fruits of low- and high-pH orange varieties, while *CitPH3* is low expressed in high-pH oranges as compared to the low-pH ones, consistent with its (partial) regulation by CitAN1 and CitPH4^[@CR27]^. Because the *CitPH4* alleles from these varieties contain no mutations in the coding sequence (Supplementary Fig. [10](#MOESM1){ref-type="media"}), it is conceivable that transcription of *CitPH4* (and possibly *CitAN1*) transcription is reduced by additional mutations in higher-rank regulator(s).
These data show that CitPH1 and CitPH5 are also in oranges responsible for hyperacidification in juice vesicles and that independent mutations in *CitAN1* and an (unknown) upstream regulator of *CitPH4* have been selected to obtain fruit varieties with decreased acidity.
Analyses of acidless pummelos and rangpur limes {#Sec7}
-----------------------------------------------
We further broadened our survey to a group of pummelo accessions (Fig. [6a](#Fig6){ref-type="fig"}). Pummelos (*C*. *maxima*) are non-hybrid citrus fruits^[@CR1],[@CR3]^. They are similar to large grapefruit, variable in sweetness, and native of Southeast Asia but now grown in tropical and subtropical areas all over Asia and the Pacific Islands as well as in California and Florida.Fig. 6Analysis of sweet and sour pummelo and rangpur lime varieties. **a** Fruits of the analyzed pummelo varieties. Size bars represent 1 cm. **b** pH, titratable acid, and soluble solid content (Brix) in juice from the analyzed varieties (mean ± SE). **c** Real-time RT-PCR of *CitPH1*, *CitPH5*, and *CitMAC9F1* mRNA in juice vesicles. **d** Real-time RT-PCR of *CitAN1*, *CitPH3*, *CitPH4*, and *CitAN11* mRNA in juice vesicles. **e** Fruits, flower, and leaf phenotypes of the analyzed rangpur limes. Size bars represent 1 cm. Values in **c**, **d** are mean ± SE; *n* = number samples from different fruits × number of technical replicates of each. Fruits analyzed in **b**--**d** were mature with a slight green blush (pummelos) or full colored mature (rangpurs and rangpur × pummelo hybrids). Images of Punk and 'Chandler' fruits were provided by and reproduced with permission of the UC-Riverside Citrus Variety collection. Source data are provided as a [Source Data file](#MOESM3){ref-type="media"}
'Pin Shan Kong Yau' (PSKY) and an unnamed 'Kao Panne' pummelo (Punk) are acidic pummelos with blond fruit flesh (Fig. [6a](#Fig6){ref-type="fig"}), whereas the unrelated Siamese pummelo P2240 (also known as 'Siamese sweet') is an acidless pummelo with blond flesh that is commonly used in breeding to reduce acidity in the progeny. The "sweet" (non-sour) taste of P2240 fruits correlated with reduced acidity and titratable acid content of the fruit juice and reduced *CitPH1*, *CitPH5*, and *CitMAC9F1* mRNA levels in juice vesicles, as compared to the low-pH PSKY and Punk fruits (Fig. [6b, c](#Fig6){ref-type="fig"}). In the pink and mildly sweet-tasting fruits of 'Chandler', a hybrid of *P2240* and an acidic accession (P2241), the juice pH as well as *CitPH1*, *CitPH5*, and *CitMAC9F1* mRNA levels are similar to those of the low-pH PSKY and Punk fruits. This indicates the acidification of pummelo fruits also depends on *CitPH1* and *CitPH5* and that the causative mutation(s) that reduce the acidity and expression of *CitPH1* and *CitPH5* in P2240 fruits (are) recessive.
Since the reduced acidity of P2240 fruits is associated with downregulation of at least three genes (Fig. [6c](#Fig6){ref-type="fig"}), the causative mutation(s) most likely affect one of more upstream transcription activators. Because the *CitAN1*, *CitPH3*, and *CitPH4* alleles of *P2240* express in juice vesicles similar mRNA amounts as those from Punk and 'Chandler' (Fig. [6d](#Fig6){ref-type="fig"}), and because their coding sequences do not contain polymorphisms with obvious negative effects on protein activity (Supplementary Figs. [11](#MOESM1){ref-type="media"} and [15](#MOESM1){ref-type="media"}), the causative mutation likely affects an unknown transcription factor that operates in concert with CitAN1, CitPH3, and CitPH4, which may be encoded or controlled by an unknown locus (*acitric*) within 1.2 cM of the RFLP marker RFZ20 (ref. ^[@CR41]^), which maps to genome sequences on chromosome 2.
The rangpur limes (*Citrus limonia*) 'Philippine' and 'Weirick' have flowers and leaves with anthocyanin pigments (Fig. [6e](#Fig6){ref-type="fig"}). While soluble solid content (Brix) is similar, the acidity and amount of titratable acid is reduced in juice from sweet tasting 'Weirick' fruit, compared to the sour fruits from 'Philippine' (Fig. [6b](#Fig6){ref-type="fig"}). This correlates with strongly reduced mRNA expression levels of *CitPH1*, *CitPH5*, and *CitMAC9F1*, most likely due to reduced activity of an upstream transcription factor (Fig. [6c](#Fig6){ref-type="fig"}). *CitAN1* and *CitPH4* transcripts accumulate at similar levels in sour 'Philippine' and sweet 'Weirick' juice vesicles, whereas *CitPH3* mRNA was essentially abolished in 'Weirick' fruits (Fig. [6d](#Fig6){ref-type="fig"}). PH3 is in petunia, like other WMBW complex components (AN1, PH4, AN11), essential for *PH1*, *PH5*, and *MAC9F1* expression^[@CR27]^, suggesting that the strongly reduced *CitPH1* and *CitPH5* expression in 'Weirick' fruits is most likely caused by abolished *CitPH3* expression. We found no obvious defects in the coding part of the 'Weirick' *CitPH3* allele (Supplementary Fig. [16](#MOESM1){ref-type="media"}) or any large rearrangements in its promoter that may account for the reduced *CitPH3* transcription or mRNA processing. Hence, we infer that the reduced acidity and titratable acid is most likely due to a mutation in an (unknown) upstream regulator(s), which strongly reduces the expression of *CitPH3* and its target genes *CitPH1*, *CitPH5*, and *CitMAC9F1*.
The hybrid 'Weirick' × P2240 (7D-76-03) had sour fruits with high titratable acid, indicating that loss of acidity in 'Weirick' and P2240 is due to recessive mutations in distinct genes. Since 7D-76-03 is no longer available, we analyzed progeny with sour (6C-32-01) and sweet fruits (6C-32-02) from the cross 'Chandler' × 7D-76-03 in which segregation of acidity is observed. Whereas soluble solid content (Brix) is similar in both fruits, juice acidity, titratable acid content, and the expression of *CitPH1*, *CitPH5*, and *CitMAC9F1* are all reduced in 6C-32-02 fruits compared to 6C-32-01. The latter is probably due to mutations originating from P2240 rather than from 'Weirick', as *CitPH3* expression in 6C-32-02 is strongly increased compared to 'Weirick' (Fig. [6d](#Fig6){ref-type="fig"}).
Discussion {#Sec8}
==========
How juice cell vacuoles in sour citrus fruits can be acidified to such an extreme extent is a long-standing question, as vacuolar proton pumps capable of generating the required steep pH gradient across the tonoplast were unknown. We have shown that juice vesicles of *Citrus* varieties with acidic (low pH) fruits express *CitPH1* and *CitPH5*, encoding two interacting P-ATPases that constitute a vacuolar proton pump, while *CitPH1* and *CitPH5* expression levels are drastically decreased in fruit varieties with reduced acidity (high pH). The downregulation of *CitPH1* and *CitPH5* in distinct fruits results from independent mutations in multiple genes required for *CitPH1* and *CitPH5* expression, such as, for example, *CitAN1*, or upstream regulators thereof, suggesting that these are the causative mutations for the loss of acidity rather than being linked to them. These results indicate that the long-sought vacuolar proton pump is a P-ATPase complex, encoded by *CitPH1* and *CitPH5*, previously identified for its role in the pigmentation of flowers and seeds. The coupling ratio of P-ATPases (H^+^/ATP = 1), the sensitivity of PH1/PH5 activity to vanadate, and its insensitivity to bafilomycin^[@CR28]^ fit perfectly with the biochemical properties of the proton-pump activity that is expressed in sour (low pH) fruits but absent in sweet fruit varieties^[@CR8],[@CR12]--[@CR15]^.
While our results show that the large pH differences between acidic (low pH) and acidless (high pH) varieties within a *Citrus* group (lemons, oranges, or pummelos) are due to differences in *CitPH1* and *CitPH5* expression, the cause(s) of the much smaller pH variations between acidic (non-mutant) varieties of different *Citrus* groups or the even smaller pH differences within a group remain unclear. Given that the analyzed varieties are not isogenic and not grown under identical circumstances, such small pH differences may originate from small differences in the expression of CitPH1/CitPH5 or other transporters, like CitSO or various vacuolar antiporters that import solutes in exchange for protons^[@CR17]^.
It is noteworthy that fruits with strongly reduced *CitPH1* and *CitPH5* expression all contain reduced amounts of titratable acids, which is in *Citrus* mostly citric acid. This provides in vivo support of biochemical data, which indicated that most of the citrate transport into vacuoles is driven by the H^+^ gradient across the tonoplast (ΔpH), while only a small part relies on ATP-driven transporters^[@CR9]^. Hence, we infer that CitPH1 and CitPH5 promote sour taste by (i) hyperacidifying vacuoles resulting in low pH of the fruit (juice) and by (ii) generating the steep pH gradient required for the import and sequestration of citrate and conjugate bases of other acids into the vacuole. The latter increases pH-buffering capacity of the juice and prevents the juice pH from being neutralized by saliva before the low pH can be sensed.
*Citrus* varieties have been subject to cultivation and selection for several thousands of years^[@CR3]^. Our data show that citrus varieties with reduced acidity arose multiple times independently in different citrus lineages through mutations disrupting the expression of genes that encode transcription activators of *CitPH1* and *CitPH5*. The finding that the *citan1*^*Fsw*^ and *citan1*^*Msw*^ alleles contain several SNPs suggests that the inactivating 3′ deletion and, hence, varieties with reduced acidity, arose in the distant past, possibly hundreds if not thousands of years ago during early stages of *Citrus* domestication. It is, however, difficult to give a precise timing without a better estimate of mutation rates in (inactivated) *Citrus* genes that are not under selection.
Inspection of public RNA-seq data^[@CR42]^ indicates that *Malus domestica* homologs of *PH1* (MDP0000319016) and *PH5* (MDP0000303799) are expressed in developing apples and RT-PCR data^[@CR30]^ indicate that the *Vitis vinifera* homologs *VvPH1* and *VvPH5* are expressed in developing grape berries. Hence, *PH1* and *PH5* and genes encoding upstream transcription activators are likely to be important determinants of the acidity and taste in many other fruits besides *Citrus*.
Taken together, our genetic data show that a vacuolar proton pump consisting of the P-ATPases PH1 and PH5 is required for the hyperacidification of vacuoles in juice vesicles and the very sour taste of Citrus fruits and juices and that over thousands of years of *Citrus* breeding "sweet" (non sour) tasting varieties were obtained many times via independent mutations in distinct transcription regulators driving *CitPH1* and *CitPH5* expression. This opens the way to develop molecular markers for fruit acidity and taste to speed up the breeding in *Citrus* and other fruit crops, most of which are trees or shrubs with long generation times.
Methods {#Sec9}
=======
Plant material {#Sec10}
--------------
Lemon, sweet orange, pummelo, and rangpur lime fruits were collected from trees belonging to the Citrus Variety Collection or from other citrus orchards on the Agricultural Experiment Station at the University of California, Riverside, CA. Sour oranges were collected from a tree in Ostia, Italy (Ostia orange) and from trees grown in the botanical garden Jardin Botanico Canario Viera y Clavijo (GC1) and from the town Agüimes (GC2) in Gran Canaria, Spain. For transient expression assays and isolation of protoplasts, we used petals from the petunia line V74 (*ph4* mutant) grown under normal greenhouse conditions.
Fruit taste parameters {#Sec11}
----------------------
Vesicles were excised from the fruits and frozen in liquid nitrogen. After grinding 800 mg of frozen pulp and dissolving in 6 ml distilled water, pH was immediately measured with a pH meter (Consort P901). Brix was determined by directly reading the juice on a refractometer (Marius, Poland). The acid content (expressed as citric acid equivalents) was evaluated by titration using sodium hydroxide (0.1 M) and a phenolphthalein pH indicator. To deliver and measure the volumes, we use a volumetric buret.
*Citrus* homologs of petunia *AN* and *PH* genes and melon *SO* {#Sec12}
---------------------------------------------------------------
To identify *Citrus* homologs of petunia and melon genes, we searched *Citrus* genome sequences at Phytozome (<https://phytozome.jgi.doe.gov/pz/portal.html>) and *Citrus sinensis* Annotation Project (<http://citrus.hzau.edu.cn/orange/index.php>) with BLAST and confirmed homology by phylogenetic analysis^[@CR30]^. Protein sequences were aligned using MUSCLE, and after curation by GBLOCKS phylogenetic trees were constructed with maximum likelihood (PHYML) using online tools^[@CR43]^. For comparison of DNA and proteins, sequences were aligned with Clustal-Omega (<https://www.ebi.ac.uk>) and MUSCLE (<http://phylogeny.lirmm.fr/phylo_cgi/index.cgi>) respectively, optimized by hand using Aliview^[@CR44]^, and colored using BOXSHADE (<https://embnet.vital-it.ch/software/BOX_form.htm>).
*CitAN1*, *CitPH4*, *CitPH3*, and *CitAN11* alleles from citrus varieties (Supplementary Table [2](#MOESM1){ref-type="media"}) were isolated by PCR with primers amplifying the entire genomic sequence (for *CitAN1* gDNA primers 7642 and 7590, for *CitAN1* cDNA primers 7642 and 6592, for *CitPH4* gDNA and cDNA primers 6572 and 6573, for *CitPH3* cDNA primers 6611 and 6612, for *CitAN11* cDNA primers 6613 and 6615). PCR fragments were then directly sequenced or cloned into pDONR P1-P2 by Gateway cloning system. *CitSO* cDNAs were amplified by RT-PCR from juice vesicle RNA using primers 8932 and 8933.
To isolate *CitAN1* promoters, PCR fragments were generated using primers covering the 4-kb promoter (primers 7674 and 7473) and used directly for sequencing.
To isolate the flanking sequences of the *CitAN1* gene, we designed primers to amplify fragments (1000 bp) of the *FAR-like* gene located 29 kb upstream of the start of the *AN1* coding sequence (primers 8066 and 8068) and of the *TFIIH* gene (570 bp) located 617 bp downstream of the *AN1* stop codon (primers 8063 and 8065). PCR fragments were directly sequenced and nucleotide polymorphisms were depicted using the IUPAC code. Primer sequences are shown in Supplementary Tables [3](#MOESM1){ref-type="media"}--[7](#MOESM1){ref-type="media"}.
DNA and RNA isolation from *Citrus* vesicles {#Sec13}
--------------------------------------------
For DNA and RNA extraction, 800 mg of frozen vesicles were ground in liquid nitrogen and 7.5 ml of preheated (65 °C) extraction buffer (2% (w/v) CTAB, 2% (w/v) PVP (molecular weight 30,000--40,000), 25 mM EDTA pH 8.0, 2 M NaCl, 100 mM Tris-HCl (pH 8.0), 2% β-mercaptoethanol) was added to the frozen powder. To (re)adjust the solution to pH 7--8, we added for citrus vesicles from very acidic fruits (pH 2--2.5) approximately 800 μl 1 M Tris/HCl pH 9.0 and for less acidic or acidless fruits 400 μl Tris/HCl pH 9.0 and verified the pH using pH paper. The samples were then incubated at 65 °C for 15 min and extracted twice with chloroform--isoamyl alcohol (24:1), precipitated with 2-propanol, resuspended in sterile water, extracted with phenol/chloroform (1:1), precipitated with NaOAc and 2-propanol, washed in 70% ethanol, and resuspended in RNAse free water. Total RNA was precipitated using 1 volume of 4 M LiCl. The RNA pellet was washed with 70% ethanol, dissolved in sterile water, and quantified by measuring optical density (OD)~260/280~. To ensure the absence of genomic DNA, we performed a DNAse treatment.
Total DNA was obtained from the supernatant left after LiCl precipitation of RNA by precipitation with 2-propanol, washed with 70% ethanol, dissolved in water, and checked by agarose electrophoresis and OD~260/280~.
Expression analysis {#Sec14}
-------------------
To identify the truncated *AN1* transcript in *Fsw* juice vesicles, we amplified the 3′ cDNA ends by 3′-RACE (5′/3′-RACe KIT 2nd generation; Roche). RT products from *Fso* and *Fsw AN1* were amplified with a primer complementary to the 5′ untranslated region (UTR) (primer 6577) and an adaptor primer complementary to the poly(A) tail (primer 64a). Two nested PCRs were then performed using gene-specific primers: nested1 PCR: primer 6577 designed on the 5′ UTR and adaptor primer 65a (tail adaptor); nested2 PCR: primer 6579 designed on the exon 5 sequence and adaptor primer 65a.
RT-PCR analysis of *CitPH1*, *CitPH5*, *CitAN1*, *CitPH3*, *CitPH4*, *CitAN11*, and *CitACTIN* were performed as described previously^[@CR24],[@CR26],[@CR45]^, using primers shown in Supplementary Table [3](#MOESM1){ref-type="media"}. cDNA products were amplified using primers specific for *PH1* (primers 6524 and 4383), *PH5* (primers 6530 and 6529), *AN1* (primers 6623 and 6593, for the *Fsw* allele*:* primers 6623 and 6592), *PH3* (primers 6538 and 6540), *PH4* (primers 6544 and 6546), *AN11* (primers 6614 and 6615), and *ACTIN* (primers 58a and 59a). All primer sequences are reported in Supplementary Table [3](#MOESM1){ref-type="media"}.
Quantitative RT-PCR was performed with an QuantStudio 3 Real-Time PCR System (Thermo Fisher Scientific) using the SensiMix (Bioline QT650--05) as described before^[@CR27]^, using primers shown in Supplementary Table [8](#MOESM1){ref-type="media"}. Relative expression was calculated by normalizing against *CitANKYRIN*, *CitANNEXIN2*, and *CitRIBOSOMAL PROTEIN S10*, which are the most constantly expressed genes in broad range of tissues and *Citrus* species^[@CR33]^, and *CitACTIN11*. For 'Schaub', 'Amber' sour, 'Amber' sweet, Sweet lemon, GC1, GC2, and Ostia, one biological replicate was analyzed and for all other varieties two or three fruits. For each fruit, two quantitative PCR reactions (technical replicates) were performed.
Gene constructs and transient expression in protoplasts {#Sec15}
-------------------------------------------------------
To generate *35S:CitAN1*^*Fso*^*cDNA*, the 2.2-kb full-size cDNA *AN1* was amplified from *Fso* cDNA with primers 6623 and 6593 and used to generate a Gateway Entry clone by BP reaction with pDONR P1-P2 (Gateway system; Life Technologies, Invitrogen, Carlsbad, CA, USA) and then recombined into the pK2GW7.0 overexpression vector.
*35S:CitAN1*^*Fsw*^*cDNA* construct was obtained by amplifying the PCR fragment of *Fsw* cDNA, with primers 6623 and 6595 and cloning the 1.3-kb cDNA fragment in pDONR P1-P2. The insert was then recombined into pK2GW7.0 by Gateway recombination. The *35S:GFP-CitPH4*^*Fso*^ construct was generated by amplification of the *PH4*^*Fso*^ cDNA with a 3′-RACE PCR primer (6572) and a 65a (oligo dT), cloning in pDONR P1-P2, and recombining in pK7WGF2.0 by Gateway system. The *35S:GFP-CitPH4*^*Fsw*^ construct was obtained similarly from cDNA of *Fsw* juice vesicles.
Promoter:RFP constructs of the target genes were generated as follows: a 3.3-kb *PH1* promoter fragment was amplified with primers 7326 and 7328, cloned in pDONR P1-P2, and recombined into pWSK by Gateway system; a 3-kb *PH5* promoter fragment was amplified with primers 7194 and 7195 and cloned with the same procedure. In *35S:AtAHA10-GFP*, the 35S promoter drives expression of a translational fusion of the coding sequence of the AHA10 gene (including all introns) and GFP^[@CR30],[@CR32]^. All primer sequences are reported in Supplementary Table [9](#MOESM1){ref-type="media"}. For isolation and transformation of petunia protoplasts^[@CR28],[@CR31],[@CR32]^, chopped corollas of 15 open flowers (stage 6--7) from line V74 (*ph4*) were incubated in the dark for 16 h at room temperature in 0.2% (w/v) macerozyme R-10, 0.4% (w/v) cellulose R-10 in TEX buffer (3.1 g/l Gamborg's B5 salts (Sigma-Aldrich), 500 mg/l 4-morpholineethanesulfonic acid (MES), 750 mg/l CaCl~2~, 250 mg/l NH~4~NO~3~, 136.9 g/l sucrose, pH 5.7) and centrifuged for 10 min at 700 RPM. The floating protoplasts were recovered by removing the underlying layers, washed twice in TEX buffer, and left for 2 h at 4 °C. After centrifugation (10 min, 700 RPM), floating protoplasts were recovered and resuspended in 5 ml MMM solution (0.1% (w/v) MES, 0.5 M Mannitol, 15 mM MgCl~2~). For transformation, 300 µl protoplast suspension, 20 µg plasmid DNA, and 300 µl PEG solution (0.4 M Mannitol, 0.1 M Ca(NO~3~)~2~, 40% (w/v) Polyethyleneglycol 4000, pH 8) were mixed, and after 1 min 2 ml of TEX buffer was added. After 2 h at room temperature, 5 ml W5 buffer (154 mM NaCl, 125 mM CaCl~2~, 5 mM KCl, 5 mM glucose) was added and protoplasts were pelleted for 5 min at 700 RPM, resuspended in 2 ml TEX buffer, and kept for 16 h in the dark at room temperature and then analyzed by confocal microscopy and RNA isolation.
Total RNA was extracted from protoplasts using the NucleoSpin® RNA II Kit (Macherey-Nagel, Düren, Germany). In the expression analysis after transient transformation, *AHA10* mRNA was used as reference to normalize the data.
GFP, RFP, and anthocyanin fluorescence were imaged with a LSM Pascal Zeiss confocal microscope^[@CR28],[@CR31],[@CR32]^.
Reporting Summary {#Sec16}
-----------------
Further information on experimental design is available in the [Nature Research Reporting Summary](#MOESM4){ref-type="media"} linked to this article.
Supplementary information
=========================
{#Sec17}
Supplementary Information Peer Review File Source Data Reporting Summary
**Journal peer review information:** *Nature Communications* thanks the anonymous reviewers for their contribution to the peer review of this work. Peer reviewer reports are available.
**Publisher's note:** Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
These authors contributed equally: Ronald Koes, Francesca Quattrocchio.
Supplementary information
=========================
**Supplementary Information** accompanies this paper at 10.1038/s41467-019-08516-3.
Thanks to Toni Siebert and the UC Riverside Citrus Variety Collection for photos and for fruit and leaves and colleagues at the van Leeuwenhoek Center of Advanced Microscopy at University of Amsterdam for the use of microscopy facilities. This work was supported by fellowships to P.S. (iMove, 13001124001502512520) and S.L. (China Scholarship Council 201406910001). C.T.F. and M.L.R. were supported by the USDA National Institute of Food and Agriculture (Hatch project CA-R-BPS-7660-H). Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the author(s) and do not necessarily reflect the view of the National Institute of Food and Agriculture (NIFA) or the United States Department of Agriculture (USDA).
P.S., S.L., C.E.S., and M.B. performed experiments. C.T.F. and M.L.R. suggested varieties for examination, collected plant material, and provided photos and background knowledge on *Citrus* varieties and genetics. P.S., C.E.S., M.B., F.M.Q., and R.K. analyzed data. P.S., F.M.Q., and R.K. wrote the manuscript. All authors commented on the manuscript.
Identifiers for genes in distinct *Citrus* species and varieties can be found in Supplementary Table [2](#MOESM1){ref-type="media"}. Sequence data generated in this study have been deposited in NCBI-Genbank and are accessible under accession numbers [MH843936--MH843962](https://www.ncbi.nlm.nih.gov/search/all/?term=MH843936:MH843962) (cDNAs of *CitSO* and *CitPH3*), [MH885854--MH885946](https://www.ncbi.nlm.nih.gov/search/all/?term=MH885854:MH885946) (genomic DNAs of *CitAN1*, *CitPH4*, *CitPH3*, *CitFAR*-like, *CitTFIIH-like*), and [MH898434--MH898465](https://www.ncbi.nlm.nih.gov/search/all/?term=MH898434:MH898465) (cDNAs of *CitAN1*, *CitPH4*, *CitAN11*, and *CitPH3*). A reporting summary for this article is available as a Supplementary Information file. Source data underlying Figs. [1](#Fig1){ref-type="fig"}--[3](#Fig3){ref-type="fig"}, [5](#Fig5){ref-type="fig"}, and [6](#Fig6){ref-type="fig"} and Supplementary Figs. [1](#MOESM1){ref-type="media"}, [2, 5](#MOESM1){ref-type="media"} and [13](#MOESM1){ref-type="media"} are provided as a [Source Data file](#MOESM3){ref-type="media"}. Other data and biological materials are available from the authors on request. Requests for fruits from the Riverside Citrus Variety Collection should be addressed directly to Mikeal Roose \[roose\@ucr.edu\]. Availability is dependent on flowering and fruiting season and on the recipient providing an appropriate import permit if required.
Competing interests {#FPar1}
===================
The authors declare no competing interests.
|
import ModalDialog from 'ember-modal-dialog/components/modal-dialog';
import { computed } from '@ember/object';
import { getOwner } from '@ember/application';
export default ModalDialog.extend({
renderInPlace: computed(function() {
let config = getOwner(this).resolveRegistration('config:environment')
return config.environment === 'test';
})
});
|
Depression imposes a very high societal burden in terms of cost, morbidity, suffering, and mortality. It is the leading cause of disability in the Unted States and the fourth leading cause worldwide. Current methods of treatment are insufficient to combat such a widespread health problem. Therefore, addressing this mental health epidemic requires significant changes in intervention strategies. A growing body of research is examining the use of behavioral intervention technologies (BITs), such as mobile phones to deliver behavioral and mental health interventions. The delivery of interventions via mobile phones offers the potential to provide a near continuous connection between a care system and the patient. However, currently available mobile applications (apps) for depression lack evidence regarding their efficacy. App stores currently offer apps for depression that are designed based on cognitive therapy (CT) interventions, some with behavioral activation (BA), some with mood monitoring only, and many with no discernable psychological approach. Even when based on psychological theory, there is no evidence that the translation of these theories, developed for face- to-face treatment, work the same way for people with depression when delivered through an app. Given the quickly evolving nature of mobile apps, conducting research on every available app will never be possible, nor very useful. The proposed research plan takes an innovative approach to investigating BITs for depression by incorporating principles from psychology, engineering, and design to examine two primary psychological principles, CT and BA, delivered by mobile apps. The project will include two stages. First, the most usable elements of existing apps will be identified to create two apps, one using CT and the other BA, targeting depressive symptoms. This usability process will use a clear, model-driven approach to identify the most usable and useful characteristics for three app elements: information delivery, tools, and visual feedback. Following usability testing and improvements, the two apps will be subjected to a small comparative trial. Secondary aims will include an examination of usage of the apps, defined as how many times the apps are opened on the mobile devices. Results will provide information that can be broadly used by developers of apps for depression and may also have implications for apps aimed at treating other mental health disorders.
|
Q:
Lower- to uppercase, printing words of one line under each other
I have to make a little c program that converts lowercase letters to uppercase. I have managed to do this, however, it's output is not yet completed.
The following is what I made so far:
#include <stdio.h>
#include <ctype.h>
#include <string.h>
int main(void){
char s[100];
int i;
gets(s);
for(i = 0; i < strlen(s); ++i)
{
s[i] = toupper(s[i]);
}
printf (s);
}
If you'd insert 'this is a_test' it's output would be 'THIS IS A_TEST'. However, it should be the following:
'THIS
IS
A_TEST'
How do I do this?
Thanks in advance.
A:
for(i = 0; i < strlen(s); ++i) {
if(s[i] = ' ')
s[i] = '\n');
else
s[i] = toupper(s[i]);
}
|
Military history of the Soviet Union
The military history of the Soviet Union began in the days following the 1917 October Revolution that brought the Bolsheviks to power. In 1918 the new government formed the Red Army, which then defeated its various internal enemies in the Russian Civil War of 1917–22. The years 1918–21 saw defeats for the Red Army in the Polish–Soviet War (1919–21) and in independence wars for Estonia (1918–20), Latvia (1918–20) and Lithuania (1918–19). The Red Army invaded Finland (November 1939); fought the Battles of Khalkhin Gol of May–September 1939 (together with its ally Mongolia) against Japan and its client state Manchukuo; it was deployed when the Soviet Union, in agreement with Nazi Germany, took part in the invasion of Poland in September 1939, and occupied the Baltic States (June 1940), Bessarabia (June–July 1940) and Northern Bukovina (June–July 1940) (from Romania). In World War II the Red Army became a major military force in the defeat of Nazi Germany and conquered Manchuria. After the war, it occupied East Germany and many nations in central and eastern Europe, which became satellite states in the Soviet bloc.
Following the Allies' victory over Germany and Japan in 1945, the Soviet Union became the sole superpower rival to the United States. The Cold War between the two nations led to military buildups, the nuclear arms race, and the Space Race. By the early 1980s the Soviet armed forces had more troops, tanks, artillery guns and nuclear weapons than any other nation on earth. The Soviet Union fell in 1991, not because of military defeat but because of economic and political factors - see History of the Soviet Union (1982–91).
The Soviet military consisted of five armed services - in their official order of importance:
the Strategic Rocket Forces (service established in 1959)
Ground Forces
Air Forces
Air Defense Forces (separate service from 1949)
Naval Forces
Two other Soviet militarized forces existed: the Internal Troops (MVD Troops), subordinated to the Ministry of the Interior, and the Border Troops, subordinated to the KGB.
Czarist and revolutionary background
See also: Tsarist officers in the Red Army
The February Revolution replaced the Tsar with the Russian Provisional Government, 1917 which was itself overthrown by the Bolshevik Revolution of 1917. The Russian army, exhausted by its participation in World War I, was in the final stages of disintegration and collapse.
Even though Bolshevik influence in the ranks was strong, the officer corps was staffed with many who violently opposed communism. The Bolsheviks perceived the Tsarist army to be one of the foundations of the hated old regime, and decided to abolish it in favor of establishing a new military loyal to the Marxist cause. Thus the core of the Tsarist army became the core of the Russian Provisional Government army which became the core of the White Army, which in intermittent collaboration with interventionist forces from outside Russia (from Japan, Britain, France and the United States) aided the Whites and tried to contain the Red Army during the Russian Civil War.
On January 28, 1918 the Bolshevik leader Vladimir Lenin decreed the establishment of the Red Army, officially merging the 20,000 Red Guards, 60,000 Latvian red riflemen with 200,000 Baltic Fleet sailors and a handful of sympathetic Petrograd garrison soldiers. Leon Trotsky served as their first commissar for war.
The early Red Army was egalitarian and therefore poorly disciplined. The Bolsheviks considered military ranks and saluting to be bourgeois customs and abolished them; soldiers now elected their own leaders and voted on which orders to follow. This arrangement was abolished, however, under pressure of the Russian Civil War (1918–21), and ranks were reinstated.
During the civil war, the Bolsheviks fought counterrevolutionary groups that became known as the White armies as well as armies sponsored by Russia's former allies such as the Britain and France, which saw a need to overthrow the Bolshevik government. The Red Army enjoyed a series of initial victories over their opponents, and in a surge of optimism Lenin ordered the Soviet Western Army to advance West in the vacuum created by the German forces retreating from the Ober-Ost areas. This operation swept the newly formed Ukrainian People's Republic and Belarusian People's Republic and eventually lead to the Soviet invasion of Second Polish Republic, a newly independent state of the former Russian Empire. By invading Poland and initiating the Polish-Soviet War the Bolsheviks expressed their belief that they would eventually triumph over opposing capitalist forces both at home and abroad.
The overwhelming majority of professional officers in the Russian army were of nobility (dvoryanstvo); moreover, most of them had joined the White armies. Therefore, the Workers' and Peasants' Army initially faced a shortage of experienced military leaders. To remedy this, the Bolsheviks recruited 50,000 former Imperial Army officers to command the Red Army. At the same time, they attached political commissars to Red Army units to monitor the actions and loyalty of professional commanders, formally termed as "military specialists" (voyenspets, for voyenny spetsialist). By 1921 the Red Army had defeated four White armies and held off five armed foreign contingents that had intervened in the civil war, but began to face setbacks in Poland.
Polish forces managed to break a long streak of Bolshevik victories by launching a bold counteroffensive at the Battle of Warsaw in August 1920. At Warsaw the Red Army suffered a defeat so great and so unexpected that it turned the course of the entire war and eventually forced the Soviets to accept the unfavorable conditions offered by the Treaty of Riga, signed on March 18, 1921. It was the biggest defeat of the Red Army in history.
After the civil war, the Red Army became an increasingly professional military organization. With most of its five million soldiers demobilized, the Red Army was transformed into a small regular force, and territorial militias were created for wartime mobilization. Soviet military schools, established during the civil war, began to graduate large numbers of trained officers loyal to the Soviet power. In an effort to increase the prestige of the military profession, the party reestablished formal military ranks, downgraded political commissars, and eventually established the principle of one-man command.
Development of the structure, ideology, and doctrine of the Soviet military
Military counterintelligence
Throughout the history of the Soviet Army, the Soviet secret police (known variously as the Cheka, GPU, NKVD, among many others) maintained control over the counterintelligence Special Departments (Особый отдел) that existed at all larger military formations. The best known was SMERSH (1943–1946) created during the Great Patriotic War. While the staff of a Special Department of a regiment was generally known, it controlled a network of secret informants, both chekists and recruited ordinary military.
Political doctrine
Under the direction of Lenin and Trotsky, the Red Army claimed to adhere to Karl Marx's proclamation that the bourgeoisie could be overcome only by a worldwide revolt of the proletariat, and to this end early Soviet military doctrine focused on spreading the revolution abroad and expanding Soviet influence throughout the world. Lenin provided an early experiment of Marx's theory when he invaded Poland in hopes of generating a communist uprising in neighboring Germany. Lenin's Polish expedition only complemented his March 1919 establishment of the Comintern, an organization whose sole purpose was to fight "by all available means, including armed force, for the overthrow of the international bourgeoisie and for the creation of an international Soviet republic as a transition stage to the complete abolition of the State."
In keeping with the Comintern philosophy, the Red Army forcibly suppressed the anti-Soviet Basmachi Revolt in Central Asia in order to keep Turkestan in the Soviet alliance system. In 1921, a Red Army occupation of the Democratic Republic of Georgia overthrew the representative Georgian government and replaced it with a Soviet Republic. Georgia was then forcibly merged with Armenia and Azerbaijan in order to form the Transcaucasian SFSR, a member state of the Soviet Union.
Military-party relations
During the 1930s, Joseph Stalin's Five Year Plans and industrialization drive built the productive base necessary to modernize the Red Army. As the likelihood of war in Europe increased later in the decade, the Soviet Union tripled its military expenditures and doubled the size of its regular forces to match the power of its potential enemies.
In 1937, however, Stalin purged the Red Army of its best military leaders. Fearing that the military posed a threat to his rule, Stalin jailed or executed many Red Army officers, estimated in thousands, including three of five marshals. These actions were to severely impair the Red Army's capabilities in the Soviet–Finnish War (Winter War) of 1939–40 and in World War II.
Fearing the immense popularity of the armed forces after World War II, Stalin demoted war hero Marshal Georgy Zhukov and took personal credit for having saved the country. After Stalin's death in 1953, Zhukov reemerged as a strong supporter of Nikita Khrushchev. Khrushchev rewarded Zhukov by making him minister of defense and a full Politburo member. Concern that the Soviet army might become too powerful in politics, however, led to Zhukov's abrupt dismissal in the autumn of 1957. Khrushchev later alienated the armed forces by cutting defense expenditures on conventional forces in order to carry out his plans for economic reform.
Leonid Brezhnev's years in power marked the height of party-military cooperation as he provided ample resources to the armed forces. In 1973 the minister of defense became a full Politburo member for the first time since 1957. Yet Brezhnev evidently felt threatened by the professional military, and he sought to create an aura of military leadership around himself in an effort to establish his authority over the armed forces.
In the early 1980s, party-military relations became strained over the issue of resource allocations to the armed forces. Despite a downturn in economic growth, the armed forces argued, often to no avail, for more resources to develop advanced conventional weapons.
Mikhail Gorbachev downgraded the role of the military in state ceremonies, including moving military representatives to the end of the leadership line-up atop Lenin's Mausoleum during the annual Red Square military parade commemorating the October Revolution. Instead, Gorbachev emphasized civilian economic priorities and reasonable sufficiency in defense over the professional military's perceived requirements.
Military doctrine
The Russian army was defeated in the First World War, a fact which strongly shaped the early stages of Red Army development. While the armies of Britain and France were content to retain strategies which had made them victorious, the Red Army proceeded to experiment and develop new tactics and concepts, developing parallel to the reborn German armed forces. The Soviets viewed themselves as a nation unique to human history and thus felt no loyalty to previous military tradition, an ideology which allowed for and prioritized innovation.
From its conception, the Red Army committed itself to emphasizing highly mobile warfare. This decision was influenced by the formative wars of its history, namely the Russian Civil War and the Polish–Soviet War. Both of these conflicts had little in common with the static trench warfare of the First World War. Instead, they featured long range mobile operations, often by small but highly motivated forces, as well as rapid advances of hundreds of kilometers in a matter of days.
Under Lenin's New Economic Policy, the Soviet Union had few resources to devote to the Red Army during its formative years in the 1920s. This changed only when Stalin began the industrialisation drive in 1929, a policy created in part to allow for unprecedented funds to be dedicated to the military.
Using these new resources, the Red Army of the 1930s developed a highly sophisticated concept of mobile warfare which relied on huge formations of tanks, aircraft, and airborne troops designed to break through the enemy's line and carry the battle deep to the enemy's rear. Soviet industry responded, supplying tanks, aircraft and other equipment in sufficient numbers to make such operations practical. To avoid overestimating the power of the Soviet army, although before 1941 Soviet formations of a given level were at least equal to and often stronger than equivalent formations of other armies, huge wartime losses and reorganisation based on war experience reversed the trend during the later war years. Thus, for example, the Soviet Tank Corps was equivalent in armored vehicle power to an American armored division, and a Soviet rifle (infantry) division, unless specifically reinforced, was often equivalent to an American infantry regiment.
The Soviets developed their armament factories under the assumption that during the war they would have to rebuild the whole equipment of the ground and air forces many times over. This assumption was indeed proven correct during the four-year-long war.
The Red Army's focus on mobile operations in the early 1930s was gravely disrupted by Stalin's purge of the military's leadership. Since the new doctrines were associated with officers who had been declared enemies of the state, the support for them declined. Many large mechanised formations were disbanded, with the tanks distributed to support the infantry. After the German blitzkrieg proved its potency in Poland and France, the Red Army started a frantic effort to rebuild the large mechanised corps, but the task was only partly finished when the Wehrmacht attacked in 1941. The huge tank forces, powerful only on paper, were mostly annihilated by the Germans in the first months of Operation Barbarossa. Another factor contributing to the initial defeat was that the Soviet post-World War I rearmament effort was started too early, and in 1941 the majority of Soviet equipment was obsolete and inferior to that of the Wehrmacht.
In the initial period of the war, in the face of catastrophic losses, the Red Army drastically scaled down its armored formations, with the tank brigade becoming the largest commonly deployed armored unit, and reverted to a simpler mode of operations. Nevertheless, the revolutionary doctrines of the 1930s, modified by combat experience, were eventually successfully used at the front starting in 1943 after the Red Army regained the initiative.
Practical deployment of the Soviet military
Interwar period
Following the death of Lenin, the Soviet Union was enmeshed in a struggle for succession that pitted Trotsky and his policy of "world revolution" against Stalin and his policy of "socialism in one country." Thanks to his control over and support from the Party and state bureaucracy, Stalin prevailed and Trotsky was removed as war commissar in 1925, resulting in a turn away from the policy of spreading the revolution abroad in favour of focusing on domestic issues and defending the country against the possibility of foreign invasion.
Eager to dispose of Trotsky's political and military supporters, Stalin directed the execution of eight high-ranking generals between 1935 and 1938. Primary among these was Marshal Mikhail Tukhachevsky, leader of the Soviet invasion of Poland.
Despite Stalin's isolationist policies, and even though the Soviet Union's borders would remain static for fifteen years following Lenin's death, the Soviets continued to involve themselves in international affairs, and the Comintern was instrumental in establishing the Communist parties of China in 1921 and Indochina in 1930. Additionally, the Red Army played a crucial role in the Spanish Civil War, supplying over 1,000 aircraft, 900 tanks, 1,500 artillery pieces, 300 armored cars, hundreds of thousands of small arms and 30,000 tons of ammunition to the Republican cause.
Soviet participation in the Spanish Civil War was greatly influenced by the growing tension between Stalin and Adolf Hitler, the leader of Nazi Germany and an avid supporter of the fascist forces of Francisco Franco. Nazi–Soviet relations were tempered by Hitler's personal hatred for communist ideology and for wanting to expand German territories. Direct armed conflict between Germany and the Soviet Union was delayed by the signing of the Molotov–Ribbentrop Pact on August 23, 1939, which essentially divided the nations of Eastern Europe into two spheres of interest, one belonging to the Soviets and the other to the Nazis.
The Soviet Union sold arms to the Governor of Xinjiang province of the Republic of China, Jin Shuren, and help install his successor Sheng Shicai in 1934 as their puppet governor. They intervened militarily in an invasion of Xinjiang against the Chinese Muslims 36th Division (National Revolutionary Army) and Han chinese troops led by the Chinese Muslim General Ma Zhongying and the Han chinese general Zhang Peiyuan when they were on the verge of defeating Sheng's manchurian and white Russian troops. 2 brigades of 7,000 men, armed with tanks, planes, mustard gas, and armored cars were the Soviet forces which invaded. After fierce fighting, in which mustard gas was used by the Soviet Union at the Battle of Tutung, Ma Zhongying retreated and Zhang committed suicide to avoid capture. During the battle, the chinese Muslims reportedly dressed up in sheepskins and stormed Soviet machine guns posts with swords. Ma encountered a Red Army column at the Battle of Dawan Cheng and wiped out the entire column, his Muslim troops rolled the wrecked Soviet armored cars off the mountainside. The Soviet Union intervened again in the Xinjiang War (1937), invading with 5,000 troops and using planes with mustard gas.
In late 1930s, Soviet Union was no longer satisfied with the status quo in its relations with independent countries of Finland, Estonia, Latvia, Lithuania, Poland and Romania. This came as a result of a change in Soviet foreign policy. The Molotov-Ribbentrop Pact gave a great opportunity to recover the provinces of Imperial Russia lost during the chaos of the October Revolution and the Russian Civil War. As a result of this pact, on 1 September, the Germans invaded Poland from the west. When the Poles were close to defeat and the Polish government left the country, on 17 September the Red Army invaded Poland from the east to regain the territories populated mostly by ethnic Belarusians and Ukrainians.
Next, Soviet Union sent ultimatums to the Baltic states and gained control in September and October. The Soviet Union had negotiated with the Finns for over a year, but they refused Soviet demands, and the Red Army assaulted on 30 November 1939 starting the Winter War. Simultaneously, a puppet regime, called the Finnish Democratic Republic, was set by the Soviets. The initial period of the resulting war proved disastrous for the Soviet military. As a direct result of the Soviet aggression the Soviet Union was expelled from the League of Nations on December 14, 1939. The Red Army faced a disastrously underestimated opponent, suffering a series of embarrassing defeats.
However, in 1940 the Soviets reorganized their forces and mauled the enemy in a final great offensive. Mannerheim, the Finnish commander, then advised his government to negotiate peace on Soviet terms. Recognizing that they had lost the war, the Finns wisely chose to settle early with the Soviets, while there was still potential for a relatively lenient peace treaty. In the end, the Finns retained their independence, but ceded huge tracts of territory, and resources, to the victorious Soviets.
World War II
The Molotov–Ribbentrop Pact of August 1939 established a non-aggression treaty between Nazi Germany and the Soviet Union with a secret protocol describing how Poland and the Baltic countries would be divided between them. In the invasion of Poland of 1939 the two powers invaded and partitioned Poland, and in June 1940 the Soviet Union also occupied Estonia, Latvia and Lithuania.
The Red Army had little time to correct its numerous deficiencies before Nazi Germany and other Axis countries allied with it swept across the newly relocated Soviet border on June 22, 1941, in the opening stages of Operation Barbarossa. The poor Soviet performance in the Winter War against Finland encouraged Hitler to ignore the terms of the Molotov–Ribbentrop Pact and take the Red Army by surprise. During the initial stages of the war, Soviet forces were often ordered to stand their ground despite limited defensive capabilities, resulting in numerous encirclements and correspondingly high numbers of casualties.
The United States program of lend-lease was extended to Soviet Union in September 1941, supplying planes, tanks, trucks and other war materials. Eventually the Soviets managed to slow the Wehrmacht's blitzkrieg, halting the Nazi offensive in December 1941 outside the gates of Moscow, in part because mobilized troops with winterized clothing from Siberia were transferred from there after Stalin realized that Japan was not going to attack the Soviet Union (Japan had just attacked Pearl Harbor). The Red Army launched a powerful winter counteroffensive which pushed the Germans back from the outskirts of Moscow. At the start of 1942, the weakened Axis armies abandoned their march on Moscow and advanced south towards the Caucasus and Volga river. This offensive, in turn, ran out of steam in autumn 1942, allowing the Soviet forces to stage a devastating counteroffensive on the overextended enemy. The Red Army encircled and destroyed significant German forces at the Battle of Stalingrad, which ended in February 1943 and reversed the tide of the war in Europe.
In the summer of 1943, following the Battle of Kursk, the Red Army seized the strategic initiative for the remainder of the war. All Soviet territory was liberated from Axis occupation by 1944. After having driven the Axis armies out of Eastern Europe, in May 1945 the Red Army launched its assault on Berlin, which effectively ended World War II in Europe (see V-E Day). Much of Eastern Europe and great parts of the Soviet Union were devastated by Red Army troops as a result of an aggressive policy of "scorched earth". Once Germany had surrendered, the Red Army joined the war against Japan, and in summer 1945 carried out an offensive against Japanese forces stationed in northern Manchuria. The Red Army emerged from the war as one of the most powerful land armies in history with five million soldiers, and more tanks and artillery than all other countries combined.
The defeat of the Wehrmacht had come, however, at the cost of over eight million soldiers and as much as fifteen million civilians dead, by far the highest losses of any country during the war. This is believed to be the highest human death toll from any military conflict.
The Cold War and conventional forces
By the end of World War II, the Soviet Union had a standing army of 10 to 13 million men. During and right after the war, the Red Army was by far the most powerful land army in the world. Immediately following Germany's surrender, this number was reduced to five million; this decline was indicative not of diminishing interest in the Soviet military but rather of a growing interest in establishing more modern and mobile armed forces. This policy resulted in the 1949 introduction of the AK-47, designed two years earlier as an improvement on the submachine gun which supplied Soviet infantry with a rugged and reliable source of short-range firepower. Also important was the 1967 introduction of the BMP-1, The first mass-used infantry fighting vehicles commissioned by any armed force in the world. These innovations would help direct the course of Soviet military operations throughout the Cold War.
The Soviet military assisted the Second East Turkestan Republic during the Ili Rebellion.
The Mongolian People's Republic became involved in a border dispute with the Republic of China during the Pei-ta-shan Incident, Soviet Russian and Mongol forces attempted to occupy and raid Chinese territory, in response, a Chinese Muslim Hui cavalry regiment, the 14th Tungan Tungan Cavalry regiment was sent by the Chinese government to attack Mongol and Soviet positions.
Many of the Soviet forces who fought to liberate the countries of Eastern Europe from Nazi control remained in the region even after Germany's surrender in 1945. Stalin used this military occupation to establish satellite states, creating a buffer zone between Germany and the Soviet Union. The Soviets quickly became an enormous political and economic influence in the region and the Soviet Union actively assisted local communist parties in coming to power. By 1948, seven eastern European countries had communist governments.
In this setting, the Cold War emerged from a conflict between Stalin and U.S. President Harry S. Truman over the future of Eastern Europe during the Potsdam Conference in 1945. Truman charged that Stalin had betrayed the agreement made at the Yalta Conference. With Eastern Europe under Red Army occupation, the Soviet Union remained adamant in the face of Truman's attempt to stop Communist expansion, and in 1955 Moscow introduced the Warsaw Pact to counterbalance the Western NATO alliance.
Conventional military power showed its continued influence when the Soviet Union used its troops to invade Hungary in 1956 and Czechoslovakia in 1968 to suppress the democratic aspirations of their peoples and keep these countries within the Soviet regime. The Soviet Union and the western forces, led by the US, faced a number of standoffs that threatened to turn into live conflicts, such as the Berlin Blockade of 1948–49 and the Cuban Missile Crisis of 1962, which saw "hawks" on both sides push the respective rivals closer towards war due to policies of brinksmanship. This attitude was tempered by fears of a nuclear conflict and desires among moderates for détente.
Under Khrushchev's leadership, Soviet relations with Josip Broz Tito's Yugoslavia were finally repaired with the 1956 dissolution of the Cominform. This decision generated a further rift between the Soviet Union and the People's Republic of China, a neighboring communist state which felt the Soviets were turning their back on the fundamental Marxist–Leninist struggle for the worldwide triumph of communism. This Sino-Soviet split erupted in 1967 when the Red Guard besieged the Soviet embassy in Beijing. Additional conflicts along the Sino-Soviet border followed in 1969.
Tension between the political forces in Moscow and Beijing would greatly influence Asian politics during the 1960s and 1970s, and a microcosm of the Sino-Soviet split emerged when the by-then late-Ho Chi Minh's Soviet-aligned Vietnam invaded Pol Pot's pro-Chinese Cambodia in 1978. The Soviets had ensured the loyalty of Vietnam and Laos through an aggressive campaign of political, economic and military aid – the same tactic which allowed the Soviet Union to compete with the United States in a race to establish themselves as neocolonial rulers of newly independent states in Africa and the Middle East. Extensive arms sales made weapons like the AK-47 and the T-55 tank icons of the contemporary wars between Israel and its Arab neighbors.
Also significant was the 1968 declaration of the Brezhnev Doctrine which officially asserted the Soviet Union's right to intervene in other nation's internal affairs in order to secure socialism from opposing capitalist forces. This doctrine was used to justify the Soviet invasion of Afghanistan in 1979. In Afghanistan the Soviet forces met a fierce resistance from the Afghans who were supported by the CIA. Battling an opposition that relied on guerrilla tactics and asymmetric warfare, the massive Soviet war machine proved incapable of achieving decisive victories and the entire campaign quickly devolved into a quagmire not unlike that which the U.S. faced a decade earlier in the Vietnam War. After ten years of fighting at the cost of approximately 20 billion dollars a year (in 1986 United States dollars) and 15,000 Soviet casualties, Gorbachev surrendered to public opinion and ordered troops to withdraw in early 1989.
The Cold War and nuclear weapons
The Soviet Union tested their first atomic bomb codenamed "First Lightning" on 29 August 1949, four years after the atomic bombings of Hiroshima and Nagasaki, surprising many Western commentators who had expected the U.S. monopoly to last for some time longer. It soon came out that the Soviet atomic bomb project had received a considerable amount of espionage information about the wartime Manhattan Project, and that its first bomb was largely a purposeful copy of the U.S. "Fat Man" model. More important from the perspective of the speed of the Soviet program, the Soviets had developed more uranium reserves than specialists in the American military had thought possible. From the late 1940s, the Soviet armed forces focused on adapting to the Cold War in the era of nuclear arms by achieving parity with the United States in strategic nuclear weapons.
Though the Soviet Union had proposed various nuclear disarmament plans after the U.S. development of atomic weapons in the Second World War, the Cold War saw the Soviets in the process of developing and deploying nuclear weapons in full force. It would not be until the 1960s that the United States and the Soviet Union finally agreed to ban weapon buildups in Antarctica and nuclear weapons tests in the atmosphere, outer space, and underwater.
By the late 1960s, the Soviet Union had reached a rough parity with the United States in some categories of strategic weaponry, and at that time offered to negotiate limits on strategic nuclear weapons deployments. The Soviet Union wished to constrain U.S. deployment of an antiballistic missile (ABM) system and retain the ability to place multiple independently targetable re-entry vehicles (MIRVs).
The Strategic Arms Limitation Treaty began in November 1969 in Helsinki. The interim agreement signed in Moscow in May 1972 froze existing levels of deployment of intercontinental ballistic missiles (ICBMs) and regulated the growth of submarine-launched ballistic missiles (SLBMs). As part of the SALT process, the ABM Treaty was also signed.
The SALT agreements were generally considered in the West as having codified the concept of Mutually assured destruction (MAD), or deterrence. Both the U.S. and the Soviet Union recognized their mutual vulnerability to massive destruction, no matter which state launched nuclear weapons first. A second SALT agreement, SALT II, was signed in June 1979 in Vienna. Among other provisions, it placed an aggregate ceiling on ICBM and SLBM launchers. The second SALT agreement was never ratified by the United States Senate, in large part because of the breakdown of détente in the late 1970s and early 1980s.
At one time, the Soviet Union maintained the world's largest nuclear arsenal in history. According to estimates by the Natural Resources Defense Council, the peak of approximately 45,000 warheads was reached in 1986. Roughly 20,000 of these were believed to be tactical nuclear weapons, reflecting the Red Army doctrine that favored the use of these weapons if war came in Europe. The remainder (approximately 25,000) were strategic ICBMs. These weapons were considered both offensive and defensive in nature. The production of these weapons is one of the factors that led to the collapse of the Soviet Union.
Military-industrial complex and the economy
With the notable exception of Khrushchev and possibly Gorbachev, Soviet leaders from
the late 1920s onwards emphasized military production over investment in the civilian economy. The high priority given to military production traditionally enabled military-industrial enterprises to commandeer the best managers, labor, and materials from civilian plants. As a result, the Soviet Union produced some of the world's most advanced armaments. In the late 1980s, however, Gorbachev transferred some leading defense-industry officials to the civilian sector of the economy in an effort to make it as efficient as its military counterpart.
The integration of the party, government, and military in the Soviet Union became most evident in the area of defense-related industrial production.
Gosplan, the state planning committee, had an important role in directing necessary supplies and resources to military industries. The Soviet Defense Council made decisions on the development and production of major weapons-systems. The Defense Industry Department of the Central Committee supervised all military industries as the executive agent of the Defense Council. Within the government, a Deputy Chairman of the Council of Ministers headed the Military Industrial Commission, which coordinated the activities of many industrial ministries, state committees, research-and-development organizations, and factories and enterprises that designed and produced arms and equipment for the armed forces.
In the late 1980s the Soviet Union devoted a quarter of its gross economic output to the defense sector (at the time most Western analysts put the figure at 15%). At the time, the military–industrial complex employed at least one of every five adults in the Soviet Union. In some regions of the Union of Soviet Socialist Republics, at least half of the workforce was employed in defense plants. (The comparable U.S. figures were roughly one-sixteenth of gross national product and about one of every sixteen in the workforce.) In 1989, one-fourth of the entire Soviet population was engaged in military activities, whether active duty, military production, or civilian military training.
Collapse of the Soviet Union and the military
The political and economic chaos of the late 1980s and early 1990s soon erupted into the disintegration of the Warsaw Pact and the collapse of the Soviet Union. The political chaos and rapid economic liberalization, the infamous IMF shock therapy, had an enormously negative impact on the strength and funding of the military. In 1985, the Soviet military had about 5.3 million men; by 1990 the number declined to about four million. At the time the Soviet Union dissolved, the residual forces belonging to the Russian Federation were 2.7 million strong. Almost all of this drop occurred in a three-year period between 1989 and 1991.
The first contribution to this was a large unilateral reduction which began with an announcement by Gorbachev in December 1988; these reductions continued as a result of the collapse of the Warsaw Pact and in accordance with Conventional Forces in Europe (CFE) treaties. The second reason for the decline was the widespread resistance to conscription which developed as the policy of glasnost revealed to the public the true conditions inside the Soviet army and the widespread abuse of conscript soldiers.
As the Soviet Union moved towards disintegration in 1991, the huge Soviet military played a surprisingly feeble and ineffective role in propping up the dying Soviet system. The military got involved in trying to suppress conflicts and unrest in the Caucasus and central Asia, but it often proved incapable of restoring peace and order. On April 9, 1989, the army, together with MVD units, killed 20 demonstrators in Tbilisi in Georgia. The next major crisis occurred in Azerbaijan, when the Soviet army forcibly entered Baku on January 19–20, 1990, resulting in the death of 137 people. On January 13, 1991 Soviet forces stormed the State Radio and Television Building and the television retranslation tower in Vilnius, Lithuania, both under opposition control, killing 14 people and injuring 700. This action was perceived by many as heavy-handed and achieved little.
At the crucial moments of the August Coup, arguably the last attempt by the Soviet hardliners to prevent the breakup of the state, some military units did enter Moscow to act against Boris Yeltsin but ultimately refused to crush the protesters surrounding the Russian parliament building. In effect, the leadership of the Soviet military decided to side with Gorbachev and Yeltsin, and thus finally doomed the old order.
As the Soviet Union officially dissolved on December 31, 1991, the Soviet military was left in limbo. For the next year and a half various attempts to keep its unity and transform it into the military of the Commonwealth of Independent States (CIS) failed. Steadily, the units stationed in Ukraine and some other breakaway republics swore loyalty to their new national governments, while a series of treaties between the newly independent states divided up the military's assets. In mid-March 1992, Yeltsin appointed himself as the new Russian minister of defence, marking a crucial step in the creation of the new Russian armed forces, comprising the bulk of what was still left of the military. The last vestiges of the old Soviet command structure were finally dissolved in June 1993.
In the next few years, Russian forces withdrew from central and eastern Europe, as well as from some newly independent post-Soviet republics. While in most places the withdrawal took place without any problems, the Russian army remained in some disputed areas such as the Sevastopol naval base in the Crimea as well as in Abkhazia and Transnistria.
The loss of recruits and industrial capacity in breakaway republics, as well as the breakdown of the Russian economy, caused a devastating decline in the capacity of post-Soviet Russian armed forces in the decade following 1992.
Most of the nuclear stockpile was inherited by Russia. Additional weapons were acquired by Ukraine, Belarus and Kazakhstan. Amid fears of nuclear proliferation, these were all certified as transferred to Russia by 1996. Uzbekistan is another former Soviet republic where nuclear weapons may once have been stationed, but they are now signatories of the Nuclear non-proliferation treaty.
Timeline
Foreign military aid
In addition to explicit wars, the Soviet military took part in a number of internal conflicts in various countries, as well as proxy wars between third countries as a means of advancing their strategic interests while avoiding direct conflict between the superpowers in the nuclear age (or, in the case of the Spanish Civil War, avoiding a direct conflict with Nazi Germany at a time when neither side was prepared for such a war). In many cases, involvement was in the form of military advisors as well as the sale or provision of weapons.
See also
List of military aircraft of the Soviet Union and the CIS
Missiles of Russia and the USSR
List of Soviet tanks
Russia involvement in regime change
Timeline of Russian inventions and technology records
Notes
References
– Soviet Union
Crozier, Brian: The Rise and Fall of the Soviet Empire. Forum, 1999.
Koenig, William and Schofield, Peter: Soviet Military Power. Hong Kong: Bison Books, 1983.
Odom, William E.: The Collapse of the Soviet Military. New Haven & London:Yale University Press, 1998.
Stone, David R.: A Military History of Russia: From Ivan the Terrible to the War in Chechnya. Westport: Praeger Security International, 2006.
Malone, Richard: The Russian Revolution. Cambridge Press 2004
Blackett, P.M.S.: Fear, War, and the Bomb, Military and Political Consequences of Atomic Energy New York: Whittlesey House 1949.
Alperovitz, Gar: Atomic Diplomacy: Hiroshima and Potsdam, New York, Simon and Shus
Choudhury, Soumen Dhar, Strategic doctrine from Khrushchev to Gorbachev, (unpublished PhD thesis, JNU,1996)
Further reading
Robin Higham and Frederick W. Kagan (editors), 2002. The Military History of the Soviet Union (Palgrave, New York).
*
Category:History of the Soviet Union
Category:Defence companies of the Soviet Union
|
A cloud of dust followed the team and wagon into the yard of the grain elevator, and I set my broom against a wall and watched the farmer maneuver the wagon up the ramp into the scale shed.
Herman Pearson was a wiry man with a face like a ferret, thin-nosed, small-chinned, with a sparse crop of graying hair. But under his bushy brows, his eyes were merry, bright with humour and kindliness.
I watched him expertly handle the team, lining them out over the scale, which was a real feat, considering that Herman had only one arm.
“I left it in France,” he’d say, patting his shoulder indulgently, as if the errant arm had had better things to do in a foreign country beyond the sea.
The wheels of the wagon settled into the cradle on the scale deck, and Herman jumped down, landing lightly. He unhitched the team, leading the horses forward.
“Let ‘er go,” he hollered, and the elevator agent activated the mechanism that would tip the wagon up and empty the grain. The golden flood cascaded through the grate, dust billowing in powdery clouds.
I stood by Herman, to see better, and it was then I noticed Herman’s crisply ironed shirt, the collar turned down neatly. The bright cotton was sprinkled liberally with dancing green teapots and smiling pineapples.
Herman caught me looking at the shirt and he grinned.
“Like it, do you? The missus sewed it. Made herself an apron to match and dresses for the girls. Lovely, eh?”
Doubt must have shown on my face, because Herman gave a hearty chuckle. “Not so sure? Yer thinkin’ a growed man shouldn’t be wearin’ duds made outta flour sacks?”
It wasn’t that exactly, for my own shirt was made from a flour sack, a tan and blue plaid, faded and well patched, used for working at the elevator or in the field. It was the jolly green teapots cavorting with the pineapples that made me smirk, disrespectfully, I fear. Not even the sight of the empty sleeve, pinned up, was going to quench the snicker I could feel welling up, relentless as the grain pouring from the wagon.
“Let me tell you somethin’, son. When I was in France, during the Great War, I seen things that would curl yer toes. My pal, Tommy Diggs, breathed in the mustard gas. Thought he was gonna cough out his insides, but no, he were spared that, gettin’ hisself shot instead, dying in the trench covered with mud, blood, and things you’d rather not hear about.”
I felt bad for Tommy Diggs, suffering from the gas, and then getting shot after all, but that was the way of war, with so many not coming home.
The horses stood patiently, heads down, glistening hides occasionally twitching, and tails flicking at flies. I wondered if Herman’s arm, holding the lines, was getting tired. A fine trail of sweat trickled down his neck into the collar of the shirt.
“The missus and me’d only been married one day before I took the train to Halifax, then sailed across the Atlantic. After the tortures I seen in them trenches, I knowed life would be mighty good if I were lucky enough to come back.”
I didn’t see what the war had to do with the cheerful green teapots on Herman’s shirt, but I knew if we stood long enough in the hazy heat, he’d tell me.
“Then I took a chunk of shrapnel in my arm. I says, Herman, it’s just an arm and I got another one. Jus’ think of poor ol’ Tommy, rottin’ in the muck. Yes, sir, I were lucky.”
I waited.
“If the missus wants ter make me shirts with teapots, that’s fine. If she were to make somethin’ with waltzing purple giraffes, I’d be proud to wear it. Fact be knowed, I picked out these flour sacks myself, thinkin’ the missus’d make towels.”
Laughing gleefully at his own observation, he re-hitched the team to the emptied wagon, whorls of choking dust swirling around the horses’ hooves.
“So long, son.” Herman nodded farewell as he clattered off the scale deck, his one hand holding the lines.
I’ll admit, I was covetous of the unabashed way he confidently wore the shirt with the green teapots. A cheap sacking shirt made and worn with love, as if it were the finest linen.
I was with you from the beginning to the end of this story. I agree with the other reviewer - you do seem to be able to write well with not much effort. Now, that might cause one to be green with envy! LOL Laura
“If the missus wants ter make me shirts with teapots, that’s fine. If she were to make somethin’ with waltzing purple giraffes, I’d be proud to wear it. Fact be knowed, I picked out these flour sacks myself, thinkin’ the missus’d make towels.”
I absolutely love these lines.
Ah true love! You sure know how to spin a good yarn!
I am always in awe of your storytelling. So much character..so much unforced back story woven in...all within this tiny word limit. Perfect prose, as always.
(On a complete sidenote, the second paragraph describing Herman's face made me think of ol' ferret face Frank Burns from MASH. Lol;)
Congrats, Ann! I enjoyed this, especially the ending. I grew up hearing about WWI (the great war) from my grandfather and my grandmother make clothing and bedding from the flour sacks. This took me back.
|
116 Mich. App. 436 (1982)
323 N.W.2d 431
VILLANUEVA
v.
GENERAL MOTORS CORPORATION
Docket No. 57582.
Michigan Court of Appeals.
Decided May 20, 1982.
van Benschoten, Hurlburt & van Benschoten, P.C., for plaintiff.
Munroe & Nobach, P.C. (by Richard R. Weiser), for defendant General Motors Corporation.
Frank J. Kelley, Attorney General, Louis J. Caruso, Solicitor General, and Richard F. Zapala, *438 Assistant Attorney General, for defendant Second Injury Fund.
Before: DANHOF, C.J., and M.F. CAVANAGH and D.F. WALSH, JJ.
M.F. CAVANAGH, J.
Plaintiff filed a petition for a hearing with the Bureau of Workers' Disability Compensation alleging permanent and total loss of the use of his legs within the meaning of § 361(2)(g) of the Worker's Disability Compensation Act of 1969. MCL 418.361(2)(g); MSA 17.237(361)(2)(g). Plaintiff was found to be disabled and entitled to a continuation of his weekly disability benefits. However, the administrative law judge concluded that plaintiff was not totally and permanently disabled within the meaning of the act because plaintiff had not lost the industrial use of both legs. Plaintiff appealed to the Workers' Compensation Appeal Board (WCAB) which issued an order and opinion affirming the decision of the administrative law judge. Plaintiff then sought leave to appeal to this Court, alleging that the WCAB erred as a matter of law in evaluating plaintiff's injury in terms of his retained ability to perform favored work. Plaintiff's application for leave to appeal was denied, whereupon plaintiff sought leave to appeal to the Michigan Supreme Court. The Michigan Supreme Court issued an order remanding the case to this Court for consideration as on leave granted, and by this remand the instant case is now before us.
The issue on appeal is whether the WCAB erred in finding that plaintiff failed to prove by a preponderance of the evidence that he is totally and permanently disabled as defined in MCL 418.361(2)(g); MSA 17.237(361)(2)(g). Plaintiff alleges that the administrative denial of his claim *439 for benefits for permanent and total loss of industrial use of both legs resulted from the application of erroneous legal standards. First, plaintiff states that the administrative law judge erroneously concluded that plaintiff had not suffered the permanent and total loss of industrial use of both legs because the evidence regarding plaintiff's left leg was "inconclusive". Plaintiff claims that the initial denial was based upon the administrative law judge's erroneous belief that it was necessary that either or both legs be injured. Second, plaintiff alleges that the decision by the WCAB, affirming the decision of the administrative law judge, was based on testimony to the effect that plaintiff retained the residual ability to do favored sit/stand work with restricted bending and lifting. Plaintiff contends that an injured claimant's ability to perform favored work is irrelevant to the determination of whether an employee has suffered the loss of industrial use of both legs, and, therefore, the WCAB's affirmance was based upon an erroneous consideration.
The scope of our review in workers' compensation cases is extremely limited. Hahn v Sarah Coventry, Inc, 97 Mich App 389, 397; 296 NW2d 36 (1980). A claimant before the WCAB is required to establish his or her claim by a preponderance of the evidence. Whether this standard has been met is a judgment for the WCAB. As long as the WCAB has not misapplied the governing law, its factual determinations, if supported by any evidence, are conclusive upon the reviewing court. Aquilina v General Motors Corp, 403 Mich 206; 267 NW2d 923 (1978); Thorton v Luria-Dumes Co-Venture, 347 Mich 160, 162; 79 NW2d 457 (1956).
The Worker's Disability Compensation Act provides for two types of workers' compensation benefits, *440 consisting of wage loss disability payments and schedule loss payments. MCL 418.371; MSA 17.237(371), and MCL 418.361; MSA 17.237(361). With regard to schedule loss payments, the act stated:
"(2) Total and permanent disability, compensation for which is provided in section 351 means:
* * *
"(g) Permanent and total loss of industrial use of both legs or both hands or both arms or 1 leg and 1 arm; for the purpose of this subdivision such permanency shall be determined not less than 30 days before the expiration of 500 weeks from the date of injury." MCL 418.361(2)(g); MSA 17.237(361)(2)(g).
The loss of industrial use is a question of fact to be determined by the WCAB. Miller v Sullivan Milk Products, Inc, 385 Mich 659, 669; 189 NW2d 304 (1971). In Burke v Ontonagon County Road Comm, 391 Mich 103; 214 NW2d 797 (1974), the Michigan Supreme Court established the test for the loss of industrial use of both legs, holding that:
"There is permanent and total loss of industrial use of both legs where, inter alia,
"1. An employment-related injury in one or both legs causes pain or other condition that prevents use of both legs in industry.
"2. The use of one or both legs, whether or not injured, triggers an employment-related injury or malady in any part of the body, including one or both legs, that causes pain or other condition that prevents use of both legs in industry." Id., 114. (Emphasis added.)
Although both parties agree that Burke provides the relevant test for determining total and permanent loss of industrial use of both legs, the Supreme Court remanded this case to us for consideration *441 as on leave granted with instructions to consider the cases of Martin v Ford Motor Co, 401 Mich 607; 258 NW2d 465 (1977), and Dechert v General Motors Corp, 92 Mich App 124; 284 NW2d 751 (1979).
In Martin, plaintiff claimed workers' compensation benefits against Ford Motor Company and the Second Injury Fund for an employment-related disability. The WCAB found that plaintiff was totally and permanently disabled because of a back ailment but that she had not suffered the loss of industrial use of her legs and left arm. The Second Injury Fund was thus relieved of any liability for differential benefits. This Court affirmed that decision, but the Michigan Supreme Court reversed and reinstated the order of the referee awarding differential benefits. In doing so, the Court reaffirmed its prior decision in Burke, which held that it is not necessary for either or both legs to be injured in order to establish permanent and total loss of industrial use of both legs. The Court further held that the WCAB may not reject undisputed controlling testimony regarding plaintiff's disability, from which only one inference can legitimately be drawn, simply because the WCAB chooses to decide that plaintiff is not totally and permanently disabled.
The case before us can be distinguished from Martin, supra. In Martin, the Court reinstated the hearing referee's award of benefits because there was substantial evidence in the record which showed that plaintiff had lost the industrial use of her legs, but there was no competent testimony to support the WCAB's findings to the contrary. 401 Mich 607, 620-621. Here the record contains substantial evidence negating plaintiff's claim, as can be seen from the medical testimony of Drs. Woods *442 and Goodsell, who indicated that plaintiff could perform reasonable and gainful employment. Thus, this is not a case of the WCAB drawing factual inferences contrary to undisputed evidence in the record.
We also conclude that the administrative law judge's finding that the evidence regarding plaintiff's left leg was inconclusive does not mean that the finding was based upon a belief that either or both of plaintiff's legs had to be actually injured. The tests in Burke, supra, and Martin, supra, make it clear that the loss of industrial use of both legs may result from leg-connected disabling pain alone and neither leg need be injured at all. The administrative law judge's statement, "I am not satisfied with the proof of the left leg", can reasonably be interpreted to mean that plaintiff failed to prove by the preponderance of the evidence that the industrial use of his left leg was, due to injury or severe pain, totally and permanently lost. As previously indicated, both Drs. Woods and Goodsell testified that plaintiff could make industrial use of his legs, subject to certain restrictions regarding bending, lifting, and a sit/stand option. This evidence justified the administrative law judge in concluding that plaintiff had failed to prove that injury or severe pain resulted in the permanent industrial loss of use of plaintiff's legs.
In Dechert, supra, plaintiff claimed workers' compensation benefits against General Motors Corporation and the Second Injury Fund for total and permanent disability, alleging the loss of industrial use of both legs. Plaintiff was denied compensation, and the issue on appeal was whether the ability to return to favored work was a sufficient basis on which to deny worker's disability benefits for total and permanent loss of industrial use of *443 both legs. This Court held that the economic impact of an injured claimant's ability to perform favored work is irrelevant to the decision of a case claiming loss of industrial use of both legs. The case was remanded to the WCAB with an order to clarify its findings as to what use, if any, plaintiff could make of her legs in industry.
In Lockwood v Continental Motors Corp, 27 Mich App 597, 604; 183 NW2d 807 (1970), this Court found plaintiff entitled to total and permanent disability benefits where he suffered vertigo when he used his legs. This Court expressly noted that the plaintiff's ability to work while seated did not disqualify him from receiving total and permanent disability benefits and in fact relied upon the sedentary work as evidence that plaintiff had lost the industrial use of his legs. The Lockwood decision was specifically cited with approval by the Michigan Supreme Court in Martin, supra, 620, fn 14.
Both the Dechert and Lockwood decisions stand for the proposition that the economic impact of an injured plaintiff's ability to do favored work is irrelevant to a decision regarding a claim of loss of industrial use of both legs. However, as we noted in Dechert:
"[T]he physical abilities of an injured claimant are germane to the factual question faced by the WCAB in such cases, and should not be ignored merely because the capacity for use of the legs is expressed in terms of a claimant's ability to perform a particular type of work." 92 Mich App 124, 129.
The analysis thus should not be focused on whether plaintiff can perform "favored work", but rather on "what, if any, use plaintiff can make of *444 her legs in industry in `favored work' or otherwise". Dechert, 92 Mich App 124, 129.
In Pipe v Leese Tool & Die Co, 410 Mich 510, 527; 302 NW2d 526 (1981), the Michigan Supreme Court held that, for the purposes of awarding specific-loss benefits, the loss of industrial use of a member is "determined by the loss of the primary service of [the member] in industry". (Emphasis changed.) We find that this standard offers guidance in assessing a claim of total and permanent disability resulting from the loss of industrial use of both legs. The primary service of legs includes standing and walking. In determining what use plaintiff can make of his legs in industry, plaintiff's physical abilities may be expressed in terms of his ability to perform a particular type of work. Thus, if plaintiff can perform a job which entails some walking and standing, as opposed to a sedentary job in which walking and standing are incidental to the performance of the job, then plaintiff has not lost the primary service of his legs. The fact that plaintiff may be restricted in the amount of walking and standing he can do does not mean that plaintiff has lost the primary service of his legs or that he is prevented from using his legs in industry.
In the instant case, plaintiff alleged total and permanent disability as a result of injuries to his right shoulder and both legs. The medical testimony presented was conflicting as to whether plaintiff had lost the practical use of his legs completely or whether plaintiff could perform a job which would involve no heavy lifting or bending and in which the plaintiff would have the option of sitting or standing. In affirming the decision of the administrative law judge, the WCAB found that plaintiff "has failed by a preponderance *445 of evidence to establish that his injury causes pain or other condition that prevents the use of both legs in industry". We find that there was sufficient evidence before the WCAB to support its finding that plaintiff had not sustained his burden of proving that he had lost the industrial use of both legs. Although all three doctors who examined plaintiff found that he was disabled from his previous employment, two doctors testified that plaintiff could be employed in restricted work which involved the use of his legs. The WCAB did not base its opinion on the economic impact of plaintiff's ability to perform favored work, as prohibited by Dechert, supra, but rather focused on plaintiff's physical ability to perform particular types of work. Such an analysis was approved by this Court in Dechert.
As recognized by the Michigan Supreme Court in Thorton v Luria-Dumes Co-Venture, supra, as long as the WCAB has not misapplied the governing law, its factual determinations, if supported by any evidence, are conclusive. We conclude that there is evidence in the WCAB's record to support its factual determination that plaintiff failed to prove by a preponderance of the evidence that he is totally and permanently disabled as defined by MCL 418.361(2)(g); MSA 17.237(361)(2)(g).
Affirmed.
|
• So many were surprised at the sudden exit of Sir Paul Stephenson, the ex-commissioner. And after an hour of grilling him about his decision, members on the home affairs committee were none the wiser on the subject of why he left the top policing job in the land. I wasn't pushed, I did no wrong, he said. Still, one man saw it coming and that man was the former assistant commissioner of the Met, Brian Paddick. He tells a Guardian Focus Podcast on the Met crisis that he never believed the former commissioner would hang around if things became problematic. "I had a conversation with Paul Stephenson when he became deputy commissioner. He told me he already had his time in for his pension and that if you got to the stage where it got too difficult and he wasn't enjoying it, he would go. And that was when he was deputy. So I am not surprised that when it did get difficult, he went." The ducking stool or a well-earned retirement? No brainer.
• Yes, troubles at the Met, with the top tier out the door and questions mounting about its failure to get tough on pie-wielding comedians. Much is going awry, and that must include the London police station where officers have been sent a bulletin warning them that a former colleague – a PC who left in disgrace – may be planning to smuggle or trick his way back into one of their buildings and they should all be ready for him. He doesn't stand a chance of evading security. Unless he is carrying shaving foam and a paper plate.
• And trouble in the Lords, where Lib Dem peer Jenny Tonge rose to speak against plans which might make it harder for individuals to get an arrest warrant to facilitate a citizen's arrest. Things work pretty well as they are, said the baroness. You are merely cross that a warrant was obtained last year to facilitate the arrest of the then Israeli foreign minister Tzipi Livni. No we are not, said such as Lord Carlile. Our objections are procedural. Pretty strong objections they were too. For when the baroness sought to press ahead, Lord Carlile protested that she was "having a rant at Mrs Livni" and moved a motion to shut her up in a fashion unlikely to be entertained in the Commons. Peers agreed "that the noble baroness be no longer heard". Silenced and enraged, Baroness Tonge exited forthwith. They have their own way of doing things in the other place.
• Too long since we checked on our friend, the author, commentator and rightwing polemicist Paul Johnson. We find him in the Spectator writing about the extent to which Evelyn Waugh's writing was helped by the sexual betrayal he suffered at the hands of his wife. "Evelyn Gardner again rendered him a priceless service by her almost diabolical treachery," writes Johnson. "Her cunning adultery and then her flagrant desertion struck Waugh like an earthquake, and showed him that he cared very much indeed. Coinciding as it did with his gradual, then accelerated, immersion in Catholicism, it added a whole new dimension to his fictional appetites." So was it his own quest for excellence that led Johnson himself to betrayal and the fervent pursuit of sexual adventures? ("Paul loved to be spanked and it was a big part of our relationship. I had to tell him he was a very naughty boy," confessed his mistress of 11 years, Gloria Stewart). It is what separates the great writers from the mundane. The Waughs and the Johnsons of this world go the extra mile.
• Finally, a big hi to Nicholas "Fatty" Soames, the Tory grandee who is characteristically forthright as he considers the often complicated, mutually beneficial, currently fraught, relationship between journalists and politicians. "You would never get me cosying up to journalists," he said on the BBC Radio Sussex breakfast show. "I hate them." Which is his right, though it would suggest a certain frostiness towards Saga magazine, edited by his sister. One might also recall his cheery appearance in the offices of the Daily Telegraph some years back, but that would be churlish, for then he had been summoned to eat eight-year-old beef to prove to the nation that it was healthy to do so. Fatty bottled his hatred and cleaned his plate.
|
We use cookies to give you the best possible experience of our website. If you continue, we'll assume you're happy for your web browser to receive all cookies from our website. See our Privacy policy for more information on cookies and how to manage them.
You'll find we are a friendly bunch but there are just a couple of conditions that we'd ask you to look at:
If you'd like to use the gym, we will need to make an appointment for your first visit. This is so that we can get to know your goals and keep you safe.
The pass offers Premium Membership benefits for consecutive days.
Customers can enjoy one free pass per year.
We take our responsibilities to juniors seriously. For 11 - 17 year olds a parent/guardian (18yrs+) must sign the Health Commitment Statement (HCS) and a gym introduction may be required. Under 16's access to the gym is limited to set times. Specific age range classes can be attended and may require attendance with a parent / guardian.
We reserve the right to refuse admission without reason. Free passes are not always available immediately.
|
Recommended on
“Simply wonderful!”
“Our first time in the Dales and we loved our week roaming across the countryside. Very impressed with Sykes Cottages but even more impressed with the outstanding quality of this accommodation.
We were welcomed by Roger on arrival who was friendly, thorough and informative..........he even helped us to unpack. Thank you.
This property is beautiful, spacious, well appointed and equipped. Value for money, excellent. We couldn't believe additional cleaning materials, toilet rolls, ...............
The wood burner is a first for us and we loved it!
The outside space is impressive too.”
Er-Jill, Bridge Of Weir, United Kingdom, October 2016
“Relaxing Holiday with friends”
“Delightful, comfortable cottage. Owners helpful and friendly and the location superb. Wonderful to see the horses going through village up to the gallops every day. Thoroughly enjoyed our week at the gate house and the area around Middleham has some great scenic rides out.”
Chaney650, Norwich, United Kingdom, July 2015
“Outstanding rental”
“The Gatehouse was a little treasure - and provided a true home from home for us. We were greeted by the owners on arrival with a complete walk through the cottage and who explained everything about the place. The location is excellent - literally a few feet from Middleham main square yet so absolutely private and nice to have the car parked off-road. The owners were particularly friendly and shared great advice on where to eat, the local amenities and the 'not-to-be-missed' sites. If any advice was needed they were only next door and also helped in our visit to Jervaulx Abbey in East Witton so we could explore the wonderful grounds and take the 'short' walk home to the Gatehouse. The village is home to many racehorse stables so it was lovely to see the horses being ridden in the mornings to their daily warm-up run on The Gallops; it's not everyday you get to see racehorses at such close quarters. With so much to see and do in the near vicinity, our planned trip to York had to be skipped. Which is good news really as we will have to return again! For us, there will only be one place to stay - The Gatehouse. Highly recommend and one of the nicest cottages we have ever rented either in the UK or abroad.”
“The cottage was lovely and clean with a great location and the owners were very friendly and helpful. Would definitely recommend staying here”
Mrs Carrick, Hull, October 2016
“Rodger was very nice and helpful with local information. The Cottage was brilliant and being in a village made all he difference for us. As we were pretty central we could get out and about without too much driving.”
Mr Parsons, Southampton, September 2016
“A lovely cottage in a superb location. The lovely courtyard is a sun trap. The owner was very helpful.”
Miss Barnes, St. Neots, May 2016
“A lovely holiday cottage that was warm, cosy and very centrally located for touring the Yorkshire Dales.”
Mrs Poyser, DERBY, March 2016
“An excellent cottage in a lovely central area, with plenty of private parking.”
Mrs Lambert, Hull, November 2015
“Enjoying The Gatehouse and its high standard of accommodation was an important part of the holiday. There were many places to visit a short car journey away and lovely walks from the property and in the surrounding countryside.”
Mrs Batcheler, Waterlooville, September 2015
“Middleham is a wonderful spot for a holiday. The people were welcoming, the food was great and our hosts were very helpful as we planned our daily activities. I hope we can go back again soon.”
Mrs Logan, NASHVILLE, August 2015
“Liked the friendliness of the owners and staying in their lovely comfortable cottage. This is a lovely scenic area with lots of good drives nearby.”
Features
The property
An outstanding, stone-built, semi-detached cottage, a former gatehouse located just off the main market square in Middleham, famous for its horse racing connections.
Bright and stylish throughout, this fully renovated Middleham cottage is perfect for a romantic holiday or family break.
With an unusual but effective upside down layout, this Dales cottage features a spacious first floor sitting room with lovely views, a cosy woodburner and solid wood floor, making it a cosy, homely space to watch the changing seasons outside, whilst tucked up in front of the roaring fire.
The ground floor boasts a beautiful modern kitchen with dining area, and two delightful bedrooms, both with stylish en-suite facilities.
This is a first-class Middleham holiday home for those wishing to get away from it all and enjoy fine country living and beautiful walks, including the nearby Gallops and Penhill.
The amenities of Middleham are on your doorstep, and include excellent old pubs and local restaurants, as well as a well-stocked general store, and the historic castle, just a two-minute walk.
The nearby village of West Witton boasts an award-winning gastropub and is well worth a visit.
Explore nearby Bolton Castle where Mary Queen of Scots was held captive, visit the famous Aysgarth Falls or take a ride on the Wensleydale Railway.
A superb Middleham cottage, ideal for a romantic break, a touring base to explore Wensleydale, or somewhere to just relax and enjoy the many delights of this ever-popular area.
Amenities
Logs only inc. in rent for stove from start of October to end of March
Bed linen and towels inc. in rent
Off road parking for 2 cars
Enclosed courtyard garden with patio and furniture
Sorry, no pets and no smoking
Shop 2 mins walk, pub 1 min walk
Note: Only logs are provided for the stove from October to March
Firelighters and kindling can be purchased locally
Outside of these months guests must provide their own logs, firelighters and kindling.
About the location
MIDDLEHAM
Leyburn 2.5 miles; Richmond 12 miles.
The attractive Wensleydale town of Middleham is renowned for its history and race horses. Much of the history is bound up with its Norman castle, which dates from 1190 and has a castle keep second in size only to the Tower of London. The horses are a great sight as they make their way to the gallops every morning. The pretty market square is partially cobbled and offers a range of shops, pubs and places to eat. The bustling market town of Leyburn is just a short drive away offering a variety of great shops and pubs, or why not take some time to explore The Forbidden Corner, a unique labyrinth of tunnels, chambers and surprises set amidst 4 acres of grounds, providing a fun day out for all the family? All in all a superb base for exploring Wensleydale and all within easy driving distance of York, the North York Moors and the Yorkshire Dales and Heritage Coast.
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!-- NewPage -->
<html lang="en">
<head>
<!-- Generated by javadoc (1.8.0_171-google-v7) on Mon Apr 08 11:10:17 PDT 2019 -->
<title>Queue (Google App Engine API for Java)</title>
<meta name="date" content="2019-04-08">
<link rel="stylesheet" type="text/css" href="../../../../../stylesheet.css" title="Style">
<script type="text/javascript" src="../../../../../script.js"></script>
</head>
<body>
<script type="text/javascript"><!--
try {
if (location.href.indexOf('is-external=true') == -1) {
parent.document.title="Queue (Google App Engine API for Java)";
}
}
catch(err) {
}
//-->
var methods = {"i0":6,"i1":6,"i2":6,"i3":6,"i4":6,"i5":6,"i6":6,"i7":6,"i8":6,"i9":6,"i10":6,"i11":6,"i12":6,"i13":6,"i14":6,"i15":6,"i16":6,"i17":6,"i18":6,"i19":6,"i20":6,"i21":6,"i22":6,"i23":6,"i24":6,"i25":6,"i26":6,"i27":6,"i28":6};
var tabs = {65535:["t0","All Methods"],2:["t2","Instance Methods"],4:["t3","Abstract Methods"]};
var altColor = "altColor";
var rowColor = "rowColor";
var tableTab = "tableTab";
var activeTableTab = "activeTableTab";
</script>
<noscript>
<div>JavaScript is disabled on your browser.</div>
</noscript>
<!-- ========= START OF TOP NAVBAR ======= -->
<div class="topNav"><a name="navbar.top">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.top" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.top.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../../overview-summary.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../../index-all.html">Index</a></li>
<li><a href="../../../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="../../../../../com/google/appengine/api/taskqueue/LeaseOptions.Builder.html" title="class in com.google.appengine.api.taskqueue"><span class="typeNameLink">Prev Class</span></a></li>
<li><a href="../../../../../com/google/appengine/api/taskqueue/QueueConstants.html" title="class in com.google.appengine.api.taskqueue"><span class="typeNameLink">Next Class</span></a></li>
</ul>
<ul class="navList">
<li><a href="../../../../../index.html?com/google/appengine/api/taskqueue/Queue.html" target="_top">Frames</a></li>
<li><a href="Queue.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_top">
<li><a href="../../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_top");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<div>
<ul class="subNavList">
<li>Summary: </li>
<li>Nested | </li>
<li><a href="#field.summary">Field</a> | </li>
<li>Constr | </li>
<li><a href="#method.summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail: </li>
<li><a href="#field.detail">Field</a> | </li>
<li>Constr | </li>
<li><a href="#method.detail">Method</a></li>
</ul>
</div>
<a name="skip.navbar.top">
<!-- -->
</a></div>
<!-- ========= END OF TOP NAVBAR ========= -->
<!-- ======== START OF CLASS DATA ======== -->
<div class="header">
<div class="subTitle">com.google.appengine.api.taskqueue</div>
<h2 title="Interface Queue" class="title">Interface Queue</h2>
</div>
<div class="contentContainer">
<div class="description">
<ul class="blockList">
<li class="blockList">
<hr>
<br>
<pre>public interface <span class="typeNameLabel">Queue</span></pre>
<div class="block"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a> is used to manage a task queue.
<p>Implementations of this interface must be threadsafe.
<p>Queues are transactional. If a datastore transaction is in progress when
<a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#add--"><code>add()</code></a> or <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#add-com.google.appengine.api.taskqueue.TaskOptions-"><code>add(TaskOptions)</code></a> is invoked, the task will only
be added to the queue if the datastore transaction successfully commits. If
you want to add a task to a queue and have that operation succeed or fail
independently of an existing datastore transaction you can invoke
<a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#add-com.google.appengine.api.datastore.Transaction-com.google.appengine.api.taskqueue.TaskOptions-"><code>add(Transaction, TaskOptions)</code></a> with a <code>null</code> transaction
argument. Note that while the addition of the task to the queue can
participate in an existing transaction, the execution of the task cannot
participate in this transaction. In other words, when the transaction
commits you are guaranteed that your task will be added and run, not that
your task executed successfully.
<p> Queues may be configured in either push or pull mode, but they share the
same interface. However, only tasks with <a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.Method.html#PULL"><code>TaskOptions.Method.PULL</code></a> may
be added to pull queues. The tasks in push queues must be added with one of
the other available methods.
<p>Pull mode queues do not automatically deliver tasks to the application.
The application is required to call
<a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#leaseTasks-long-java.util.concurrent.TimeUnit-long-"><code>leaseTasks</code></a> to acquire a lease on
the task and process them explicitly. Attempting to call
<a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#leaseTasks-long-java.util.concurrent.TimeUnit-long-"><code>leaseTasks</code></a> on a push queue causes
a <a href="../../../../../com/google/appengine/api/taskqueue/InvalidQueueModeException.html" title="class in com.google.appengine.api.taskqueue"><code>InvalidQueueModeException</code></a> to be thrown. When the task processing
has finished processing a task that is leased, it should call
<a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#deleteTask-java.lang.String-"><code>deleteTask(String)</code></a>. If deleteTask is not called before the lease
expires, the task will again be available for lease.
<p> Queue mode can be switched between push and pull. When switching from
push to pull, tasks will stay in the task queue and are available for lease,
but url and headers information will be ignored when returning the tasks.
When switching from pull to push, existing tasks will remain in the queue but
will fail on auto-execution because they lack a url. If the queue mode is
once again changed to pull, these tasks will eventually be available for
lease.</div>
</li>
</ul>
</div>
<div class="summary">
<ul class="blockList">
<li class="blockList">
<!-- =========== FIELD SUMMARY =========== -->
<ul class="blockList">
<li class="blockList"><a name="field.summary">
<!-- -->
</a>
<h3>Field Summary</h3>
<table class="memberSummary" border="0" cellpadding="3" cellspacing="0" summary="Field Summary table, listing fields, and an explanation">
<caption><span>Fields</span><span class="tabEnd"> </span></caption>
<tr>
<th class="colFirst" scope="col">Modifier and Type</th>
<th class="colLast" scope="col">Field and Description</th>
</tr>
<tr class="altColor">
<td class="colFirst"><code>static java.lang.String</code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#DEFAULT_QUEUE">DEFAULT_QUEUE</a></span></code>
<div class="block">The default queue name.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>static java.lang.String</code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#DEFAULT_QUEUE_PATH">DEFAULT_QUEUE_PATH</a></span></code>
<div class="block">The default queue path.</div>
</td>
</tr>
</table>
</li>
</ul>
<!-- ========== METHOD SUMMARY =========== -->
<ul class="blockList">
<li class="blockList"><a name="method.summary">
<!-- -->
</a>
<h3>Method Summary</h3>
<table class="memberSummary" border="0" cellpadding="3" cellspacing="0" summary="Method Summary table, listing methods, and an explanation">
<caption><span id="t0" class="activeTableTab"><span>All Methods</span><span class="tabEnd"> </span></span><span id="t2" class="tableTab"><span><a href="javascript:show(2);">Instance Methods</a></span><span class="tabEnd"> </span></span><span id="t3" class="tableTab"><span><a href="javascript:show(4);">Abstract Methods</a></span><span class="tabEnd"> </span></span></caption>
<tr>
<th class="colFirst" scope="col">Modifier and Type</th>
<th class="colLast" scope="col">Method and Description</th>
</tr>
<tr id="i0" class="altColor">
<td class="colFirst"><code><a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#add--">add</a></span>()</code>
<div class="block">Submits a task to this queue with an auto generated name with default
options.</div>
</td>
</tr>
<tr id="i1" class="rowColor">
<td class="colFirst"><code>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#add-java.lang.Iterable-">add</a></span>(java.lang.Iterable<<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a>> taskOptions)</code>
<div class="block">Submits tasks to this queue.</div>
</td>
</tr>
<tr id="i2" class="altColor">
<td class="colFirst"><code><a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#add-com.google.appengine.api.taskqueue.TaskOptions-">add</a></span>(<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a> taskOptions)</code>
<div class="block">Submits a task to this queue.</div>
</td>
</tr>
<tr id="i3" class="rowColor">
<td class="colFirst"><code>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#add-com.google.appengine.api.datastore.Transaction-java.lang.Iterable-">add</a></span>(<a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore">Transaction</a> txn,
java.lang.Iterable<<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a>> taskOptions)</code>
<div class="block">Submits tasks to this queue in the provided Transaction.</div>
</td>
</tr>
<tr id="i4" class="altColor">
<td class="colFirst"><code><a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#add-com.google.appengine.api.datastore.Transaction-com.google.appengine.api.taskqueue.TaskOptions-">add</a></span>(<a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore">Transaction</a> txn,
<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a> taskOptions)</code>
<div class="block">Submits a task to this queue in the provided Transaction.</div>
</td>
</tr>
<tr id="i5" class="rowColor">
<td class="colFirst"><code>java.util.concurrent.Future<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#addAsync--">addAsync</a></span>()</code>
<div class="block">Asynchronously submits a task to this queue with an auto generated name with default
options.</div>
</td>
</tr>
<tr id="i6" class="altColor">
<td class="colFirst"><code>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#addAsync-java.lang.Iterable-">addAsync</a></span>(java.lang.Iterable<<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a>> taskOptions)</code>
<div class="block">Asynchronously submits tasks to this queue.</div>
</td>
</tr>
<tr id="i7" class="rowColor">
<td class="colFirst"><code>java.util.concurrent.Future<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#addAsync-com.google.appengine.api.taskqueue.TaskOptions-">addAsync</a></span>(<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a> taskOptions)</code>
<div class="block">Asynchronously submits a task to this queue.</div>
</td>
</tr>
<tr id="i8" class="altColor">
<td class="colFirst"><code>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#addAsync-com.google.appengine.api.datastore.Transaction-java.lang.Iterable-">addAsync</a></span>(<a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore">Transaction</a> txn,
java.lang.Iterable<<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a>> taskOptions)</code>
<div class="block">Asynchronously submits tasks to this queue in the provided Transaction.</div>
</td>
</tr>
<tr id="i9" class="rowColor">
<td class="colFirst"><code>java.util.concurrent.Future<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#addAsync-com.google.appengine.api.datastore.Transaction-com.google.appengine.api.taskqueue.TaskOptions-">addAsync</a></span>(<a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore">Transaction</a> txn,
<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a> taskOptions)</code>
<div class="block">Asynchronously submits a task to this queue in the provided Transaction.</div>
</td>
</tr>
<tr id="i10" class="altColor">
<td class="colFirst"><code>java.util.List<java.lang.Boolean></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#deleteTask-java.util.List-">deleteTask</a></span>(java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> taskHandles)</code>
<div class="block">Deletes a list of tasks from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>.</div>
</td>
</tr>
<tr id="i11" class="rowColor">
<td class="colFirst"><code>boolean</code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#deleteTask-java.lang.String-">deleteTask</a></span>(java.lang.String taskName)</code>
<div class="block">Deletes a task from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>.</div>
</td>
</tr>
<tr id="i12" class="altColor">
<td class="colFirst"><code>boolean</code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#deleteTask-com.google.appengine.api.taskqueue.TaskHandle-">deleteTask</a></span>(<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a> taskHandle)</code>
<div class="block">Deletes a task from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>.</div>
</td>
</tr>
<tr id="i13" class="rowColor">
<td class="colFirst"><code>java.util.concurrent.Future<java.util.List<java.lang.Boolean>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#deleteTaskAsync-java.util.List-">deleteTaskAsync</a></span>(java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> taskHandles)</code>
<div class="block">Asynchronously deletes a list of tasks from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>.</div>
</td>
</tr>
<tr id="i14" class="altColor">
<td class="colFirst"><code>java.util.concurrent.Future<java.lang.Boolean></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#deleteTaskAsync-java.lang.String-">deleteTaskAsync</a></span>(java.lang.String taskName)</code>
<div class="block">Asynchronously deletes a task from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>.</div>
</td>
</tr>
<tr id="i15" class="rowColor">
<td class="colFirst"><code>java.util.concurrent.Future<java.lang.Boolean></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#deleteTaskAsync-com.google.appengine.api.taskqueue.TaskHandle-">deleteTaskAsync</a></span>(<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a> taskHandle)</code>
<div class="block">Asynchronously deletes a task from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>.</div>
</td>
</tr>
<tr id="i16" class="altColor">
<td class="colFirst"><code><a href="../../../../../com/google/appengine/api/taskqueue/QueueStatistics.html" title="class in com.google.appengine.api.taskqueue">QueueStatistics</a></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#fetchStatistics--">fetchStatistics</a></span>()</code>
<div class="block">Obtain statistics for this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>.</div>
</td>
</tr>
<tr id="i17" class="rowColor">
<td class="colFirst"><code>java.util.concurrent.Future<<a href="../../../../../com/google/appengine/api/taskqueue/QueueStatistics.html" title="class in com.google.appengine.api.taskqueue">QueueStatistics</a>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#fetchStatisticsAsync-java.lang.Double-">fetchStatisticsAsync</a></span>(java.lang.Double deadlineInSeconds)</code>
<div class="block">Asynchronously obtains statistics for this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>.</div>
</td>
</tr>
<tr id="i18" class="altColor">
<td class="colFirst"><code>java.lang.String</code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#getQueueName--">getQueueName</a></span>()</code>
<div class="block">Returns the queue name.</div>
</td>
</tr>
<tr id="i19" class="rowColor">
<td class="colFirst"><code>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#leaseTasks-com.google.appengine.api.taskqueue.LeaseOptions-">leaseTasks</a></span>(<a href="../../../../../com/google/appengine/api/taskqueue/LeaseOptions.html" title="class in com.google.appengine.api.taskqueue">LeaseOptions</a> options)</code>
<div class="block">Leases tasks from this queue, with lease period and other options specified by
<code>options</code>.</div>
</td>
</tr>
<tr id="i20" class="altColor">
<td class="colFirst"><code>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#leaseTasks-long-java.util.concurrent.TimeUnit-long-">leaseTasks</a></span>(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit)</code>
<div class="block">Leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>.</div>
</td>
</tr>
<tr id="i21" class="rowColor">
<td class="colFirst"><code>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#leaseTasksAsync-com.google.appengine.api.taskqueue.LeaseOptions-">leaseTasksAsync</a></span>(<a href="../../../../../com/google/appengine/api/taskqueue/LeaseOptions.html" title="class in com.google.appengine.api.taskqueue">LeaseOptions</a> options)</code>
<div class="block">Asynchronously leases tasks from this queue, with lease period and other options specified by
<code>options</code>.</div>
</td>
</tr>
<tr id="i22" class="altColor">
<td class="colFirst"><code>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#leaseTasksAsync-long-java.util.concurrent.TimeUnit-long-">leaseTasksAsync</a></span>(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit)</code>
<div class="block">Asynchronously leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>.</div>
</td>
</tr>
<tr id="i23" class="rowColor">
<td class="colFirst"><code>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#leaseTasksByTag-long-java.util.concurrent.TimeUnit-long-java.lang.String-">leaseTasksByTag</a></span>(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit,
java.lang.String tag)</code>
<div class="block">Leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>, having tag <code>tag</code>.</div>
</td>
</tr>
<tr id="i24" class="altColor">
<td class="colFirst"><code>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#leaseTasksByTagAsync-long-java.util.concurrent.TimeUnit-long-java.lang.String-">leaseTasksByTagAsync</a></span>(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit,
java.lang.String tag)</code>
<div class="block">Asynchronously leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>, having tag <code>tag</code>.</div>
</td>
</tr>
<tr id="i25" class="rowColor">
<td class="colFirst"><code>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#leaseTasksByTagBytes-long-java.util.concurrent.TimeUnit-long-byte:A-">leaseTasksByTagBytes</a></span>(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit,
byte[] tag)</code>
<div class="block">Leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>, having tag <code>tag</code>.</div>
</td>
</tr>
<tr id="i26" class="altColor">
<td class="colFirst"><code>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#leaseTasksByTagBytesAsync-long-java.util.concurrent.TimeUnit-long-byte:A-">leaseTasksByTagBytesAsync</a></span>(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit,
byte[] tag)</code>
<div class="block">Asynchronously leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>, having tag <code>tag</code>.</div>
</td>
</tr>
<tr id="i27" class="rowColor">
<td class="colFirst"><code><a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a></code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#modifyTaskLease-com.google.appengine.api.taskqueue.TaskHandle-long-java.util.concurrent.TimeUnit-">modifyTaskLease</a></span>(<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a> taskHandle,
long lease,
java.util.concurrent.TimeUnit unit)</code>
<div class="block">Modify the lease of the specified task in this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a> for a period of time specified
by <code>lease</code> and <code>unit</code>.</div>
</td>
</tr>
<tr id="i28" class="altColor">
<td class="colFirst"><code>void</code></td>
<td class="colLast"><code><span class="memberNameLink"><a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#purge--">purge</a></span>()</code>
<div class="block">Clears all the tasks in this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>.</div>
</td>
</tr>
</table>
</li>
</ul>
</li>
</ul>
</div>
<div class="details">
<ul class="blockList">
<li class="blockList">
<!-- ============ FIELD DETAIL =========== -->
<ul class="blockList">
<li class="blockList"><a name="field.detail">
<!-- -->
</a>
<h3>Field Detail</h3>
<a name="DEFAULT_QUEUE">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>DEFAULT_QUEUE</h4>
<pre>static final java.lang.String DEFAULT_QUEUE</pre>
<div class="block">The default queue name.</div>
<dl>
<dt><span class="seeLabel">See Also:</span></dt>
<dd><a href="../../../../../constant-values.html#com.google.appengine.api.taskqueue.Queue.DEFAULT_QUEUE">Constant Field Values</a></dd>
</dl>
</li>
</ul>
<a name="DEFAULT_QUEUE_PATH">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>DEFAULT_QUEUE_PATH</h4>
<pre>static final java.lang.String DEFAULT_QUEUE_PATH</pre>
<div class="block">The default queue path.</div>
<dl>
<dt><span class="seeLabel">See Also:</span></dt>
<dd><a href="../../../../../constant-values.html#com.google.appengine.api.taskqueue.Queue.DEFAULT_QUEUE_PATH">Constant Field Values</a></dd>
</dl>
</li>
</ul>
</li>
</ul>
<!-- ============ METHOD DETAIL ========== -->
<ul class="blockList">
<li class="blockList"><a name="method.detail">
<!-- -->
</a>
<h3>Method Detail</h3>
<a name="getQueueName--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>getQueueName</h4>
<pre>java.lang.String getQueueName()</pre>
<div class="block">Returns the queue name.</div>
</li>
</ul>
<a name="add--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
<pre><a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a> add()</pre>
<div class="block">Submits a task to this queue with an auto generated name with default
options.
<p>This method is similar to calling <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#add-com.google.appengine.api.taskqueue.TaskOptions-"><code>add(TaskOptions)</code></a> with
a <a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue"><code>TaskOptions</code></a> object returned by
<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.Builder.html#withDefaults--"><code>TaskOptions.Builder.withDefaults()</code></a>.</div>
<dl>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a>.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InvalidQueueModeException.html" title="class in com.google.appengine.api.taskqueue">InvalidQueueModeException</a></code> - task method is <a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.Method.html#PULL"><code>TaskOptions.Method.PULL</code></a> and queue is
push queue or vice versa.</dd>
</dl>
</li>
</ul>
<a name="add-com.google.appengine.api.taskqueue.TaskOptions-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
<pre><a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a> add(<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a> taskOptions)</pre>
<div class="block">Submits a task to this queue.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>taskOptions</code> - The definition of the task.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a>.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TaskAlreadyExistsException.html" title="class in com.google.appengine.api.taskqueue">TaskAlreadyExistsException</a></code></dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/UnsupportedTranslationException.html" title="class in com.google.appengine.api.taskqueue">UnsupportedTranslationException</a></code> - If chosen character encoding is unsupported.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InvalidQueueModeException.html" title="class in com.google.appengine.api.taskqueue">InvalidQueueModeException</a></code> - task method is <a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.Method.html#PULL"><code>TaskOptions.Method.PULL</code></a> and queue is
push queue or vice versa.</dd>
</dl>
</li>
</ul>
<a name="add-java.lang.Iterable-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
<pre>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> add(java.lang.Iterable<<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a>> taskOptions)</pre>
<div class="block">Submits tasks to this queue.
<p>Submission is not atomic i.e. if this method throws then some tasks may have been added to
the queue.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>taskOptions</code> - An iterable over task definitions.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A list containing a <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each added task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TaskAlreadyExistsException.html" title="class in com.google.appengine.api.taskqueue">TaskAlreadyExistsException</a></code> - If any of the provided <code>TaskOptions</code> contained a name
of a task that was previously created, and if no other <code>Exception</code> would be thrown. Note
that if a <code>TaskAlreadyExistsException</code> is caught, the caller can be guaranteed that for
each one of the provided <code>TaskOptions</code>, either the corresponding task was successfully
added, or a task with the given name was successfully added in the past.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/UnsupportedTranslationException.html" title="class in com.google.appengine.api.taskqueue">UnsupportedTranslationException</a></code> - If chosen character encoding is unsupported.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InvalidQueueModeException.html" title="class in com.google.appengine.api.taskqueue">InvalidQueueModeException</a></code> - task method is <a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.Method.html#PULL"><code>TaskOptions.Method.PULL</code></a> and queue is
push queue or vice versa.</dd>
</dl>
</li>
</ul>
<a name="add-com.google.appengine.api.datastore.Transaction-com.google.appengine.api.taskqueue.TaskOptions-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
<pre><a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a> add(<a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore">Transaction</a> txn,
<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a> taskOptions)</pre>
<div class="block">Submits a task to this queue in the provided Transaction.
<p>A task is added if and only if the transaction is applied successfully.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>txn</code> - an enclosing <a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore"><code>Transaction</code></a> or null, if not null a task cannot be named.</dd>
<dd><code>taskOptions</code> - The definition of the task.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a>.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TaskAlreadyExistsException.html" title="class in com.google.appengine.api.taskqueue">TaskAlreadyExistsException</a></code> - if a task with the same name was previously created.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/UnsupportedTranslationException.html" title="class in com.google.appengine.api.taskqueue">UnsupportedTranslationException</a></code> - If chosen character encoding is unsupported.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InvalidQueueModeException.html" title="class in com.google.appengine.api.taskqueue">InvalidQueueModeException</a></code> - task method is <a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.Method.html#PULL"><code>TaskOptions.Method.PULL</code></a> and queue is
push queue or vice versa.</dd>
</dl>
</li>
</ul>
<a name="add-com.google.appengine.api.datastore.Transaction-java.lang.Iterable-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>add</h4>
<pre>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> add(<a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore">Transaction</a> txn,
java.lang.Iterable<<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a>> taskOptions)</pre>
<div class="block">Submits tasks to this queue in the provided Transaction.
<p>The tasks are added if and only if the transaction is applied successfully.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>txn</code> - an enclosing <a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore"><code>Transaction</code></a> or null, if not null a task cannot be named.</dd>
<dd><code>taskOptions</code> - An iterable over task definitions.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A list containing a <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each added task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TaskAlreadyExistsException.html" title="class in com.google.appengine.api.taskqueue">TaskAlreadyExistsException</a></code> - if a task with the same name was previously created.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/UnsupportedTranslationException.html" title="class in com.google.appengine.api.taskqueue">UnsupportedTranslationException</a></code> - If chosen character encoding is unsupported.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InvalidQueueModeException.html" title="class in com.google.appengine.api.taskqueue">InvalidQueueModeException</a></code> - task method is <a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.Method.html#PULL"><code>TaskOptions.Method.PULL</code></a> and queue is
push queue or vice versa.</dd>
</dl>
</li>
</ul>
<a name="addAsync--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>addAsync</h4>
<pre>java.util.concurrent.Future<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> addAsync()</pre>
<div class="block">Asynchronously submits a task to this queue with an auto generated name with default
options.
<p>This method is similar to calling <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#addAsync-com.google.appengine.api.taskqueue.TaskOptions-"><code>addAsync(TaskOptions)</code></a> with
a <a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue"><code>TaskOptions</code></a> object returned by
<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.Builder.html#withDefaults--"><code>TaskOptions.Builder.withDefaults()</code></a>.</div>
<dl>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> with a result type of <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a>.</dd>
</dl>
</li>
</ul>
<a name="addAsync-com.google.appengine.api.taskqueue.TaskOptions-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>addAsync</h4>
<pre>java.util.concurrent.Future<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> addAsync(<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a> taskOptions)</pre>
<div class="block">Asynchronously submits a task to this queue.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>taskOptions</code> - The definition of the task.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> with a result type of <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a>.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/UnsupportedTranslationException.html" title="class in com.google.appengine.api.taskqueue">UnsupportedTranslationException</a></code> - If chosen character encoding is unsupported.</dd>
</dl>
</li>
</ul>
<a name="addAsync-java.lang.Iterable-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>addAsync</h4>
<pre>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>> addAsync(java.lang.Iterable<<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a>> taskOptions)</pre>
<div class="block">Asynchronously submits tasks to this queue.
<p>Submission is not atomic i.e. if this method fails then some tasks may have been added to
the queue.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>taskOptions</code> - An iterable over task definitions.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> whose result is a list containing a <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each added
task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/UnsupportedTranslationException.html" title="class in com.google.appengine.api.taskqueue">UnsupportedTranslationException</a></code> - If chosen character encoding is unsupported.</dd>
</dl>
</li>
</ul>
<a name="addAsync-com.google.appengine.api.datastore.Transaction-com.google.appengine.api.taskqueue.TaskOptions-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>addAsync</h4>
<pre>java.util.concurrent.Future<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> addAsync(<a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore">Transaction</a> txn,
<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a> taskOptions)</pre>
<div class="block">Asynchronously submits a task to this queue in the provided Transaction.
<p>A task is added if and only if the transaction is applied successfully.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>txn</code> - an enclosing <a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore"><code>Transaction</code></a> or null, if not null a task cannot be named.</dd>
<dd><code>taskOptions</code> - The definition of the task.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> with a result type of <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a>.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/UnsupportedTranslationException.html" title="class in com.google.appengine.api.taskqueue">UnsupportedTranslationException</a></code> - If chosen character encoding is unsupported.</dd>
</dl>
</li>
</ul>
<a name="addAsync-com.google.appengine.api.datastore.Transaction-java.lang.Iterable-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>addAsync</h4>
<pre>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>> addAsync(<a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore">Transaction</a> txn,
java.lang.Iterable<<a href="../../../../../com/google/appengine/api/taskqueue/TaskOptions.html" title="class in com.google.appengine.api.taskqueue">TaskOptions</a>> taskOptions)</pre>
<div class="block">Asynchronously submits tasks to this queue in the provided Transaction.
<p>The tasks are added if and only if the transaction is applied successfully.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>txn</code> - an enclosing <a href="../../../../../com/google/appengine/api/datastore/Transaction.html" title="interface in com.google.appengine.api.datastore"><code>Transaction</code></a> or null, if not null a task cannot be named.</dd>
<dd><code>taskOptions</code> - An iterable over task definitions.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> whose result is a list containing a <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each added
task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/UnsupportedTranslationException.html" title="class in com.google.appengine.api.taskqueue">UnsupportedTranslationException</a></code> - If chosen character encoding is unsupported.</dd>
</dl>
</li>
</ul>
<a name="deleteTask-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>deleteTask</h4>
<pre>boolean deleteTask(java.lang.String taskName)</pre>
<div class="block">Deletes a task from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>. Task is identified by taskName.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>taskName</code> - name of the task to delete.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>True if the task was successfully deleted. False if the task was not found or was
previously deleted.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if the provided name is null, empty or doesn't match the
expected pattern.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
</dl>
</li>
</ul>
<a name="deleteTask-com.google.appengine.api.taskqueue.TaskHandle-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>deleteTask</h4>
<pre>boolean deleteTask(<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a> taskHandle)</pre>
<div class="block">Deletes a task from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>. Task is identified by a TaskHandle.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>taskHandle</code> - handle of the task to delete.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>True if the task was successfully deleted. False if the task was not found or was
previously deleted.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if the provided name is null, empty or doesn't match the
expected pattern.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/QueueNameMismatchException.html" title="class in com.google.appengine.api.taskqueue">QueueNameMismatchException</a></code> - if the task handle refers to a different named queue.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
</dl>
</li>
</ul>
<a name="deleteTask-java.util.List-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>deleteTask</h4>
<pre>java.util.List<java.lang.Boolean> deleteTask(java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> taskHandles)</pre>
<div class="block">Deletes a list of tasks from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>. The tasks are identified
by a list of TaskHandles. This method supports deleting up to 1000 tasks.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>taskHandles</code> - list of handles of tasks to delete.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd><code>List<Boolean></code> that represents the result of deleting each task in
the same order as the input handles. True if a task was successfully deleted.
False if the task was not found or was previously deleted.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if the provided name is null, empty or doesn't match the
expected pattern, or if the size of taskHandles is too large.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/QueueNameMismatchException.html" title="class in com.google.appengine.api.taskqueue">QueueNameMismatchException</a></code> - if the task handle refers to a different named queue.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
</dl>
</li>
</ul>
<a name="deleteTaskAsync-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>deleteTaskAsync</h4>
<pre>java.util.concurrent.Future<java.lang.Boolean> deleteTaskAsync(java.lang.String taskName)</pre>
<div class="block">Asynchronously deletes a task from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>. Task is identified by taskName.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>taskName</code> - name of the task to delete.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> whose result is True if the task was successfully deleted,
False if the task was not found or was previously deleted.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if the provided name is null, empty or doesn't match the
expected pattern.</dd>
</dl>
</li>
</ul>
<a name="deleteTaskAsync-com.google.appengine.api.taskqueue.TaskHandle-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>deleteTaskAsync</h4>
<pre>java.util.concurrent.Future<java.lang.Boolean> deleteTaskAsync(<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a> taskHandle)</pre>
<div class="block">Asynchronously deletes a task from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>. Task is identified by a TaskHandle.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>taskHandle</code> - handle of the task to delete.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> whose result is True if the task was successfully deleted,
False if the task was not found or was previously deleted.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if the provided name is null, empty or doesn't match the
expected pattern.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/QueueNameMismatchException.html" title="class in com.google.appengine.api.taskqueue">QueueNameMismatchException</a></code> - if the task handle refers to a different named queue.</dd>
</dl>
</li>
</ul>
<a name="deleteTaskAsync-java.util.List-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>deleteTaskAsync</h4>
<pre>java.util.concurrent.Future<java.util.List<java.lang.Boolean>> deleteTaskAsync(java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> taskHandles)</pre>
<div class="block">Asynchronously deletes a list of tasks from this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>. The tasks are identified
by a list of TaskHandles. This method supports deleting up to 1000 tasks.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>taskHandles</code> - list of handles of tasks to delete.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> whose result is a <code>List<Boolean></code> that represents the result of
deleting each task in the same order as the input handles. True if a task was
successfully deleted. False if the task was not found or was previously deleted.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if the provided name is null, empty or doesn't match the
expected pattern.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/QueueNameMismatchException.html" title="class in com.google.appengine.api.taskqueue">QueueNameMismatchException</a></code> - if the task handle refers to a different named queue.</dd>
</dl>
</li>
</ul>
<a name="leaseTasks-long-java.util.concurrent.TimeUnit-long-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>leaseTasks</h4>
<pre>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> leaseTasks(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit)</pre>
<div class="block">Leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>. If fewer tasks than <code>countLimit</code> are available, all
available tasks in this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a> will be returned. The available tasks are those in the
queue having the earliest eta such that eta is prior to the time at which the lease is
requested. It is guaranteed that the leased tasks will be unavailable for lease to others in
the lease period. You must call deleteTask to prevent the task from being leased again after
the lease period. This method supports leasing a maximum of 1000 tasks for no more than one
week. If you generate more than 10 LeaseTasks requests per second, only the first 10 requests
will return results. The others will return no results.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>lease</code> - Number of <code>unit</code>s in the lease period</dd>
<dd><code>unit</code> - Time unit of the lease period</dd>
<dd><code>countLimit</code> - maximum number of tasks to lease</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A list of <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each leased task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InvalidQueueModeException.html" title="class in com.google.appengine.api.taskqueue">InvalidQueueModeException</a></code> - if the target queue is not in pull mode.</dd>
<dd><code>java.lang.IllegalArgumentException</code> - if lease < 0, countLimit <= 0,
or either is too large.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
</dl>
</li>
</ul>
<a name="leaseTasksByTagBytes-long-java.util.concurrent.TimeUnit-long-byte:A-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>leaseTasksByTagBytes</h4>
<pre>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> leaseTasksByTagBytes(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit,
byte[] tag)</pre>
<div class="block">Leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>, having tag <code>tag</code>. If <code>tag</code> is <code>null</code>, tasks
having the same tag as the task with earliest eta will be returned. If fewer such tasks than
<code>countLimit</code> are available, all available such tasks in this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a> will be
returned. The available tasks are those in the queue having the earliest eta such that eta is
prior to the time at which the lease is requested.
It is guaranteed that the leased tasks will be unavailable for lease to others in the
lease period. You must call deleteTask to prevent the task from being leased again after
the lease period. This method supports leasing a maximum of 1000 tasks for no more than one
week. If you generate more than 10 LeaseTasks requests per second, only the first 10 requests
will return results. The others will return no results.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>lease</code> - Number of <code>unit</code>s in the lease period</dd>
<dd><code>unit</code> - Time unit of the lease period</dd>
<dd><code>countLimit</code> - maximum number of tasks to lease</dd>
<dd><code>tag</code> - User defined tag required for returned tasks. If <code>null</code>, the tag of the task
with earliest eta will be used.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A list of <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each leased task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InvalidQueueModeException.html" title="class in com.google.appengine.api.taskqueue">InvalidQueueModeException</a></code> - if the target queue is not in pull mode.</dd>
<dd><code>java.lang.IllegalArgumentException</code> - if lease < 0, countLimit <= 0,
or either is too large.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
</dl>
</li>
</ul>
<a name="leaseTasksByTag-long-java.util.concurrent.TimeUnit-long-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>leaseTasksByTag</h4>
<pre>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> leaseTasksByTag(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit,
java.lang.String tag)</pre>
<div class="block">Leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>, having tag <code>tag</code>. If <code>tag</code> is <code>null</code>, tasks
having the same tag as the task with earliest eta will be returned. If fewer such tasks than
<code>countLimit</code> are available, all available such tasks in this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a> will be
returned. The available tasks are those in the queue having the earliest eta such that eta is
prior to the time at which the lease is requested.
<p>It is guaranteed that the leased tasks will be unavailable for lease to others in the
lease period. You must call deleteTask to prevent the task from being leased again after
the lease period. This method supports leasing a maximum of 1000 tasks for no more than one
week. If you generate more than 10 LeaseTasks requests per second, only the first 10 requests
will return results. The others will return no results.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>lease</code> - Number of <code>unit</code>s in the lease period</dd>
<dd><code>unit</code> - Time unit of the lease period</dd>
<dd><code>countLimit</code> - maximum number of tasks to lease</dd>
<dd><code>tag</code> - User defined <code>String</code> tag required for returned tasks. If <code>null</code>, the
tag of the task with earliest eta will be used.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A list of <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each leased task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InvalidQueueModeException.html" title="class in com.google.appengine.api.taskqueue">InvalidQueueModeException</a></code> - if the target queue is not in pull mode.</dd>
<dd><code>java.lang.IllegalArgumentException</code> - if lease < 0, countLimit <= 0,
or either is too large.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
</dl>
</li>
</ul>
<a name="leaseTasks-com.google.appengine.api.taskqueue.LeaseOptions-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>leaseTasks</h4>
<pre>java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>> leaseTasks(<a href="../../../../../com/google/appengine/api/taskqueue/LeaseOptions.html" title="class in com.google.appengine.api.taskqueue">LeaseOptions</a> options)</pre>
<div class="block">Leases tasks from this queue, with lease period and other options specified by
<code>options</code>. The available tasks are those in the queue having the earliest eta such that
eta is prior to the time at which the lease is requested.
<p> If <code>options</code> specifies a tag, only tasks having that tag will be returned.
If <code>options</code> specifies no tag, but does specify <code>groupByTag</code>, only tasks
having the same tag as the task with earliest eta will be returned.
<p> It is guaranteed that the leased tasks will be unavailable for lease to others in
the lease period. You must call deleteTask to prevent the task from being leased again after
the lease period. This method supports leasing a maximum of 1000 tasks for no more than one
week. If you generate more than 10 LeaseTasks requests per second, only the first 10 requests
will return results. The others will return no results.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>options</code> - Specific options for this lease request</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A list of <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each leased task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InvalidQueueModeException.html" title="class in com.google.appengine.api.taskqueue">InvalidQueueModeException</a></code> - if the target queue is not in pull mode.</dd>
<dd><code>java.lang.IllegalArgumentException</code> - if lease period or countLimit is null or either is too large.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
</dl>
</li>
</ul>
<a name="leaseTasksAsync-long-java.util.concurrent.TimeUnit-long-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>leaseTasksAsync</h4>
<pre>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>> leaseTasksAsync(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit)</pre>
<div class="block">Asynchronously leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>. If fewer tasks than <code>countLimit</code> are available, all
available tasks in this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a> will be returned. The available tasks are those in the
queue having the earliest eta such that eta is prior to the time at which the lease is
requested. It is guaranteed that the leased tasks will be unavailable for lease to others in
the lease period. You must call deleteTask to prevent the task from being leased again after
the lease period. This method supports leasing a maximum of 1000 tasks for no more than one
week. If you generate more than 10 LeaseTasks requests per second, only the first 10 requests
will return results. The others will return no results.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>lease</code> - Number of <code>unit</code>s in the lease period</dd>
<dd><code>unit</code> - Time unit of the lease period</dd>
<dd><code>countLimit</code> - maximum number of tasks to lease</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> whose result is a list of <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each leased task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if lease < 0, countLimit <= 0,
or either is too large.</dd>
</dl>
</li>
</ul>
<a name="leaseTasksByTagBytesAsync-long-java.util.concurrent.TimeUnit-long-byte:A-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>leaseTasksByTagBytesAsync</h4>
<pre>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>> leaseTasksByTagBytesAsync(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit,
byte[] tag)</pre>
<div class="block">Asynchronously leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>, having tag <code>tag</code>. If <code>tag</code> is <code>null</code>, tasks
having the same tag as the task with earliest eta will be returned. If fewer such tasks than
<code>countLimit</code> are available, all available such tasks in this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a> will be
returned. The available tasks are those in the queue having the earliest eta such that eta is
prior to the time at which the lease is requested.
It is guaranteed that the leased tasks will be unavailable for lease to others in the
lease period. You must call deleteTask to prevent the task from being leased again after
the lease period. This method supports leasing a maximum of 1000 tasks for no more than one
week. If you generate more than 10 LeaseTasks requests per second, only the first 10 requests
will return results. The others will return no results.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>lease</code> - Number of <code>unit</code>s in the lease period</dd>
<dd><code>unit</code> - Time unit of the lease period</dd>
<dd><code>countLimit</code> - maximum number of tasks to lease</dd>
<dd><code>tag</code> - User defined tag required for returned tasks. If <code>null</code>, the tag of the task
with earliest eta will be used.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> whose result is a list of <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each leased task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if lease < 0, countLimit <= 0,
or either is too large.</dd>
</dl>
</li>
</ul>
<a name="leaseTasksByTagAsync-long-java.util.concurrent.TimeUnit-long-java.lang.String-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>leaseTasksByTagAsync</h4>
<pre>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>> leaseTasksByTagAsync(long lease,
java.util.concurrent.TimeUnit unit,
long countLimit,
java.lang.String tag)</pre>
<div class="block">Asynchronously leases up to <code>countLimit</code> tasks from this queue for a period specified by
<code>lease</code> and <code>unit</code>, having tag <code>tag</code>. If <code>tag</code> is <code>null</code>, tasks
having the same tag as the task with earliest eta will be returned. If fewer such tasks than
<code>countLimit</code> are available, all available such tasks in this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a> will be
returned. The available tasks are those in the queue having the earliest eta such that eta is
prior to the time at which the lease is requested.
<p>It is guaranteed that the leased tasks will be unavailable for lease to others in the
lease period. You must call deleteTask to prevent the task from being leased again after
the lease period. This method supports leasing a maximum of 1000 tasks for no more than one
week. If you generate more than 10 LeaseTasks requests per second, only the first 10 requests
will return results. The others will return no results.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>lease</code> - Number of <code>unit</code>s in the lease period</dd>
<dd><code>unit</code> - Time unit of the lease period</dd>
<dd><code>countLimit</code> - maximum number of tasks to lease</dd>
<dd><code>tag</code> - User defined <code>String</code> tag required for returned tasks. If <code>null</code>, the
tag of the task with earliest eta will be used.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> whose result is a list of <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each leased task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if lease < 0, countLimit <= 0,
or either is too large.</dd>
</dl>
</li>
</ul>
<a name="leaseTasksAsync-com.google.appengine.api.taskqueue.LeaseOptions-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>leaseTasksAsync</h4>
<pre>java.util.concurrent.Future<java.util.List<<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a>>> leaseTasksAsync(<a href="../../../../../com/google/appengine/api/taskqueue/LeaseOptions.html" title="class in com.google.appengine.api.taskqueue">LeaseOptions</a> options)</pre>
<div class="block">Asynchronously leases tasks from this queue, with lease period and other options specified by
<code>options</code>. The available tasks are those in the queue having the earliest eta such that
eta is prior to the time at which the lease is requested.
<p> If <code>options</code> specifies a tag, only tasks having that tag will be returned.
If <code>options</code> specifies no tag, but does specify <code>groupByTag</code>, only tasks
having the same tag as the task with earliest eta will be returned.
<p> It is guaranteed that the leased tasks will be unavailable for lease to others in
the lease period. You must call deleteTask to prevent the task from being leased again after
the lease period. This method supports leasing a maximum of 1000 tasks for no more than one
week. If you generate more than 10 LeaseTasks requests per second, only the first 10 requests
will return results. The others will return no results.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>options</code> - Specific options for this lease request</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> whose result is a list of <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> for each leased task.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if lease period or countLimit is null or either is too large.</dd>
</dl>
</li>
</ul>
<a name="purge--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>purge</h4>
<pre>void purge()</pre>
<div class="block">Clears all the tasks in this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>. This function returns
immediately. Some delay may apply on the server before the Queue is
actually purged. Tasks being executed at the time the purge call is
made will continue executing, other tasks in this Queue will continue
being dispatched and executed before the purge call takes effect.</div>
<dl>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalStateException</code> - If the Queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
</dl>
</li>
</ul>
<a name="modifyTaskLease-com.google.appengine.api.taskqueue.TaskHandle-long-java.util.concurrent.TimeUnit-">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>modifyTaskLease</h4>
<pre><a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a> modifyTaskLease(<a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue">TaskHandle</a> taskHandle,
long lease,
java.util.concurrent.TimeUnit unit)</pre>
<div class="block">Modify the lease of the specified task in this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a> for a period of time specified
by <code>lease</code> and <code>unit</code>. A lease time of 0 will relinquish the lease on the
task and make it available to be leased by calling
<a href="../../../../../com/google/appengine/api/taskqueue/Queue.html#leaseTasks-com.google.appengine.api.taskqueue.LeaseOptions-"><code>leaseTasks</code></a>.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>taskHandle</code> - handle of the task that is having its lease modified.</dd>
<dd><code>lease</code> - Number of <code>unit</code>s in the lease period.</dd>
<dd><code>unit</code> - Time unit of the lease period.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>Updated <a href="../../../../../com/google/appengine/api/taskqueue/TaskHandle.html" title="class in com.google.appengine.api.taskqueue"><code>TaskHandle</code></a> with the new lease period.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InvalidQueueModeException.html" title="class in com.google.appengine.api.taskqueue">InvalidQueueModeException</a></code> - if the target queue is not in pull mode.</dd>
<dd><code>java.lang.IllegalArgumentException</code> - if lease < 0 or too large.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
<dd><code>java.lang.IllegalStateException</code> - If the queue does not exist, or the task lease has expired
or the queue has been paused.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
</dl>
</li>
</ul>
<a name="fetchStatistics--">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>fetchStatistics</h4>
<pre><a href="../../../../../com/google/appengine/api/taskqueue/QueueStatistics.html" title="class in com.google.appengine.api.taskqueue">QueueStatistics</a> fetchStatistics()</pre>
<div class="block">Obtain statistics for this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>.</div>
<dl>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>The current <a href="../../../../../com/google/appengine/api/taskqueue/QueueStatistics.html" title="class in com.google.appengine.api.taskqueue"><code>QueueStatistics</code></a> for this queue.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalStateException</code> - If the Queue does not exist. (see queue.xml)</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/TransientFailureException.html" title="class in com.google.appengine.api.taskqueue">TransientFailureException</a></code> - Attempting the request after this exception may succeed.</dd>
<dd><code><a href="../../../../../com/google/appengine/api/taskqueue/InternalFailureException.html" title="class in com.google.appengine.api.taskqueue">InternalFailureException</a></code></dd>
</dl>
</li>
</ul>
<a name="fetchStatisticsAsync-java.lang.Double-">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>fetchStatisticsAsync</h4>
<pre>java.util.concurrent.Future<<a href="../../../../../com/google/appengine/api/taskqueue/QueueStatistics.html" title="class in com.google.appengine.api.taskqueue">QueueStatistics</a>> fetchStatisticsAsync(java.lang.Double deadlineInSeconds)</pre>
<div class="block">Asynchronously obtains statistics for this <a href="../../../../../com/google/appengine/api/taskqueue/Queue.html" title="interface in com.google.appengine.api.taskqueue"><code>Queue</code></a>.</div>
<dl>
<dt><span class="paramLabel">Parameters:</span></dt>
<dd><code>deadlineInSeconds</code> - the maximum duration, in seconds, that the fetch statistics
request can run. A default deadline will be used if <code>null</code> is supplied.</dd>
<dt><span class="returnLabel">Returns:</span></dt>
<dd>A <code>Future</code> with a result type of <a href="../../../../../com/google/appengine/api/taskqueue/QueueStatistics.html" title="class in com.google.appengine.api.taskqueue"><code>QueueStatistics</code></a>.</dd>
<dt><span class="throwsLabel">Throws:</span></dt>
<dd><code>java.lang.IllegalArgumentException</code> - if deadlineInSeconds <= 0.</dd>
</dl>
</li>
</ul>
</li>
</ul>
</li>
</ul>
</div>
</div>
<!-- ========= END OF CLASS DATA ========= -->
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<div class="bottomNav"><a name="navbar.bottom">
<!-- -->
</a>
<div class="skipNav"><a href="#skip.navbar.bottom" title="Skip navigation links">Skip navigation links</a></div>
<a name="navbar.bottom.firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../../overview-summary.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../../index-all.html">Index</a></li>
<li><a href="../../../../../help-doc.html">Help</a></li>
</ul>
<div class="aboutLanguage">Java is a registered trademark of Oracle and/or its affiliates. Other names may be trademarks of their respective owners.</div>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="../../../../../com/google/appengine/api/taskqueue/LeaseOptions.Builder.html" title="class in com.google.appengine.api.taskqueue"><span class="typeNameLink">Prev Class</span></a></li>
<li><a href="../../../../../com/google/appengine/api/taskqueue/QueueConstants.html" title="class in com.google.appengine.api.taskqueue"><span class="typeNameLink">Next Class</span></a></li>
</ul>
<ul class="navList">
<li><a href="../../../../../index.html?com/google/appengine/api/taskqueue/Queue.html" target="_top">Frames</a></li>
<li><a href="Queue.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_bottom">
<li><a href="../../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_bottom");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<div>
<ul class="subNavList">
<li>Summary: </li>
<li>Nested | </li>
<li><a href="#field.summary">Field</a> | </li>
<li>Constr | </li>
<li><a href="#method.summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail: </li>
<li><a href="#field.detail">Field</a> | </li>
<li>Constr | </li>
<li><a href="#method.detail">Method</a></li>
</ul>
</div>
<a name="skip.navbar.bottom">
<!-- -->
</a></div>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
</body>
</html>
|
G. Glazko\'s present address is Department of Biostatistics and Computational Biology, University of Rochester Medical Center, Rochester, NY 14642.
G. Morgan\'s present address is Institute for Molecular Bioscience, University of Queensland, Brisbane QLD4072, Australia.
Abbreviations used in this paper: 5-FOA, 5-fluorootic acid; G6PDH, glucose-6-phosphate dehydrogenase; KASH, Klarsicht/ANC-1/Syne homology; MBP, maltose binding protein; SPB, spindle pole body; SUN, Sad1-Unc-84 homology; ts, temperature-sensitive.
Introduction
============
Centrosomes are the primary microtubule-organizing center in most eukaryotic cells. Centrosomes are considered to be soluble cytoplasmic organelles that lack membrane-associated structures. However, centrosomes are closely associated with the nuclear envelope in most interphase cells. A variety of data suggests that a biochemical link exists between the centrosome and nuclear membrane ([@bib5]; [@bib22]; [@bib16]; [@bib19]), and tethering of the centrosome to the nuclear envelope might be important for rapid formation of the mitotic spindle, nuclear positioning within the cell, and/or centrosome inheritance.
SUN (Sad1-UNC-84 homology) domain--containing proteins are an emerging family of inner nuclear envelope proteins that are excellent candidates to play a role in connecting centrosomes with the nuclear envelope. Originally identified based on an ∼150-amino-acid region of homology between the C terminus of the *Schizosaccharomyces pombe* Sad1 protein and the *Caenorhabditis elegans* UNC-84 protein ([@bib10]; [@bib18]), SUN proteins are present in the proteomes of most eukaryotes (Fig. S2, available at <http://www.jcb.org/cgi/content/full/jcb.200601062/DC1>; [@bib20]). In addition to the SUN domain, these proteins contain a transmembrane sequence and at least one coiled-coil domain and localize to the inner nuclear envelope. SUN proteins are anchored in the inner nuclear envelope by their transmembrane segment and oriented in the membrane such that the C-terminal SUN domain is located in the space between the inner and outer nuclear membranes. Here, the SUN domain can interact with the C-terminal tail of an outer nuclear envelope protein that binds to the cytoskeleton, including the centrosome (for review see [@bib32]).
The spindle pole body (SPB) is the *Saccharomyces cerevisiae* centrosome-equivalent organelle and is the sole site of microtubule nucleation in budding yeast. The SPB is a multilayered cylindrical structure that is embedded in the nuclear envelope throughout the yeast life cycle (for review see [@bib13]). The soluble SPB core consists of three primary layers called the outer, inner, and central plaques. Cytoplasmic and nuclear microtubules are nucleated from the outer and inner plaques, respectively, whereas the central layer of the SPB plays an important role in tethering the organelle to the nuclear envelope. Associated with one side of the core SPB is an electron-dense region of the nuclear envelope termed the half-bridge, which is important for SPB duplication as well as for microtubule nucleation during G1 ([@bib6], [@bib7]). SPBs in fission yeast have a similar but not identical structure. Importantly, the *S. pombe* SPB is also embedded in the nuclear envelope, possibly by its SUN protein, Sad1 ([@bib10]). Until now, the budding yeast orthologue of Sad1 had not been identified.
The half-bridge is critical for SPB duplication; yet, details of its structure and function at a molecular level are only beginning to emerge. Four proteins are found at the half-bridge: Cdc31, Kar1, Mps3, and Sfi1. Kar1 and Mps3 are integral membrane proteins that localize to the cytoplasmic and nuclear sides of the half-bridge, respectively ([@bib31]; [@bib14]; [@bib24]), whereas Cdc31 and Sfi1 are soluble half-bridge components ([@bib30]; [@bib15]). Recently, multiple Cdc31 proteins were shown to associate with Sfi1 to form a soluble cytoplasmic filament that spans the length of the half-bridge, and a model in which duplication of the Cdc31-Sfi1 filament generated a non-SPB associated end to initiate assembly of a new SPB was proposed ([@bib17]). However, it is unclear how Mps3 and Kar1 associate with this filament and what roles both membrane proteins play during SPB duplication and assembly. One possibility is that Mps3 and Kar1 form the physical half-bridge because mutations in *KAR1* and *MPS3* cause cells to arrest with unduplicated SPBs that lack any recognizable half-bridge structure ([@bib34]; [@bib14]). Interestingly, Cdc31 and Sfi1 may play a role in the insertion step later in SPB duplication, although this function is poorly understood ([@bib34]; [@bib15]). The insertion step of SPB duplication also requires the membrane proteins Mps2 and Ndc1 and their respective binding partners Bbp1 and Nbp1 ([@bib35], [@bib36]; [@bib27]; [@bib4]). These proteins may be recruited to the half-bridge to facilitate insertion of the newly formed SPB into the nuclear envelope and/or to tether the half-bridge to the core SPB. Direct binding between the half-bridge and membrane components of the SPB has not been demonstrated, but genetic and two-hybrid interactions between Bbp1 and Kar1 suggest that the half-bridge is connected to the core SPB through these two proteins ([@bib27]).
Not only is the half-bridge important for SPB duplication, but it is also essential for nuclear migration and fusion after mating (karyogamy; for review see [@bib25]). During G1, cytoplasmic microtubules are nucleated from the half-bridge instead of from the outer plaque ([@bib7]). After mating, half-bridge microtubules interdigitate, allowing the two nuclei to congress, and the juxtaposed half-bridges form the site where SPB and nuclear membrane fusion originates ([@bib6], [@bib7]). The importance of the SPB half-bridge for nuclear migration and fusion is illustrated by the fact that mutations in *KAR1*, *MPS3*, and *CDC31* cause defects in both steps of karyogamy ([@bib26]; [@bib34]; [@bib24]).
In the present work, we show that budding yeast half-bridge protein Mps3 is homologous to the *S. pombe* SPB component and SUN protein Sad1 ([@bib10]). Mps3 also contains a SUN domain, and mutational analysis of this region of Mps3 demonstrated that it is critical for Mps3 function during SPB duplication and karyogamy. The SUN domain of Mps3 binds to the C terminus of another integral membrane component of the SPB, Mps2, and the Mps2--Mps3 interaction is required for formation of an intact SPB. Our results demonstrate at a molecular level how the half-bridge is tethered to the core SPB and describe the consequences of disrupting this interaction. They also support the novel function of SUN proteins in bridging the inner and outer nuclear envelope and provide further evidence that SUN proteins function to tether centrosomes to the nuclear envelope.
Results
=======
*MPS3* is related to *SAD1*
---------------------------
*MPS3* encodes a 682-amino-acid protein with an acidic N terminus, a transmembrane segment, two coiled-coil domains, and a poly-glutamine region ([@bib14]; [@bib24]). Analysis of secondary structure and local compositional complexity also suggests that the C-terminal region of Mps3 (amino acids 436--682) folds into a discrete globular domain, which has been shown by deletion analysis to be important for Mps3 function (Tables S2 and S3, available at <http://www.jcb.org/cgi/content/full/jcb.200601062/DC1>; [@bib24]).
To learn more about the function of the C-terminal domain, we searched for similar sequences in protein databases using PSI-BLAST with the model inclusion cutoff set at 0.05 ([@bib1]). After the first round of search, only Mps3 orthologues from other budding yeasts were detected; however, after the second iteration, we identified numerous proteins from various eukaryotes that showed homology to the Mps3 C terminus. The best matches were to the C-terminal SUN domain of the *S. pombe* Sad1 and to other SUN domain--containing proteins. Alignment of the C terminus of Mps3 with the SUN domain from Sad1 and other SUN proteins indicates a good fit between Mps3 and the sequence consensus of the SUN domain family ([Fig. 1 A](#fig1){ref-type="fig"}).
![**Mps3 is related to Sad1 and contains a C-terminal SUN domain.** (A) A ClustalW alignment of SUN domains from the indicated proteins shows conserved (red), similar (cyan), and virtually conserved residues (green; in 5 out of 6 SUN proteins included in the alignment). Boxed residues in UNC-84 show the positions of missense mutations that affect nuclear migration (S988F, C994Y, and G1000D), and the arrows show the positions of our ts alleles and a previously described *mps3* mutant, *nep98-7* (N597K; [@bib24]). The predicted β-strands of the SUN domain are shown by bars above the alignment ([@bib20]). (B) Four SUN domain--containing proteins are depicted: *S. cerevisiae* Mps3, *S. pombe* Sad1, *C. elegans* UNC-84, and *H. sapiens* Sun1. All contain at least one transmembrane domain (tm), regions of coiled coil (cc), and a SUN domain. Mps3 and Sad1 also contain an acidic N terminus, but the poly-glutamine region (pQ) is unique to Mps3. (C) *GAL-MPS3*, *GAL-SAD1*, and vector were transformed into the ts *mps3-ΔSUN2* mutant (SLJ1789), and cultures were serially diluted 10-fold and spotted onto plates containing 2% galactose. Plates were incubated at 23 or 37°C for 2 d.](jcb1740665f01){#fig1}
The 514-amino-acid Sad1 protein shares a common overall architecture with Mps3 ([Fig. 1 B](#fig1){ref-type="fig"}) and localizes to the SPB ([@bib10]), raising the possibility that Mps3 and Sad1 perform similar cellular roles. We overexpressed *SAD1* in various budding yeast temperature-sensitive (ts) mutants in *mps3* and found that growth at the nonpermissive temperature was partially restored in *mps3-ΔSUN2* cells (see the following section; [Fig. 1 C](#fig1){ref-type="fig"}), indicating that Sad1 and Mps3 are functionally related.
*MPS3* SUN domain mutants
-------------------------
Mutation of the highly conserved asparagine to lysine at position 597 of *MPS3* ([Fig. 1 A](#fig1){ref-type="fig"}; N597K) suggests that the SUN domain is important for Mps3 function during mitosis and mating ([@bib24]). To more thoroughly analyze the role of the Mps3 SUN domain, we constructed an allelic series within the Mps3 SUN domain by mutating residues that are conserved or similar in most vertebrate SUN domains ([Fig. 1 A](#fig1){ref-type="fig"}) or are conserved in at least four out of the six sequenced *Saccharomyces* species ([@bib9]). We found that many of the conserved residues are essential for Mps3 function because their mutation results in a nonviable allele (Tables S2 and S3). However, mutation of some conserved residues, such as serine 516, proline 518, and tyrosine 563, had no effect on cell viability. In our analysis, we isolated a series of five new ts *MPS3* alleles (*mps3-W487A*, *-Y502H*, *-A540D*, *-Q572LQ573L*, and *-F592S*; [Fig. 1 A](#fig1){ref-type="fig"} and Tables S2 and S3). We also found that loss of the second half of the SUN domain (*mps3-ΔSUN2*; amino acids 524--645) or mutation of the conserved tryptophan at position 477 (*mps3-W477A*) resulted in ts alleles if multiple copies of the mutant gene were present in the cell (Table S3).
The Mps3 SUN domain is required for SPB duplication
---------------------------------------------------
We suspected that the SUN domain was critical for Mps3 function during SPB duplication because several of our mutants spontaneously diploidize ([Fig. 2, A and B](#fig2){ref-type="fig"}; and Fig. S1, available at <http://www.jcb.org/cgi/content/full/jcb.200601062/DC1>), a phenotype shared by *mps3-1* and some *kar1* and *cdc31* mutants that are defective in SPB duplication. To test whether our Mps3 SUN domain mutants show defects in SPB duplication, asynchronously growing wild-type and mutant cells were analyzed after a 4-h shift to the nonpermissive temperature (37°C). Flow cytometric analysis of DNA content and budding index confirmed that all of the SUN domain mutants arrest in mitosis at 37°C. Analysis of mitotic spindle morphology by indirect immunofluorescence microscopy and EM revealed that \>75% of large-budded *mps3-W487A*, *-Y502H*, *-A540D*, and *-Q572L Q573L* cells contain a monopolar spindle at 37°C ([Fig. 2, A and B](#fig2){ref-type="fig"}; and Fig. S1). These results suggest that the SUN domain in Mps3 is required for SPB duplication.
![***mps3* SUN domain mutants are defective in SPB duplication and karyogamy.** (A, top) Flow cytometric analysis of DNA content showed that some *mps3* SUN domain mutant cells (e.g., *mps3-F592S*) are haploids (1N and 2N) at the permissive temperature of 23°C, whereas others (e.g., *mps3-W487A*) spontaneously diploidize (2N and 4N). ts *mps3* SUN domain mutants (Table S1, available at <http://www.jcb.org/cgi/content/full/jcb.200601062/DC1>) were grown to midlog phase at 23°C and then shifted to 37°C for 4 h. (middle) Indirect immunofluorescence microscopy revealed that both mutants arrest at 37°C with monopolar spindles: a single microtubule array (anti-Tub1; green) nucleated from one SPB (anti-Tub4; red) associated with one DNA mass (DAPI; blue). Bar, 5 μm. (bottom) Nuclei from large budded cells were examined by EM to further examine SPB number and mitotic spindle structure. Thin section images of representative SPBs, the number cells with the depicted SPB number/structure, and the total number of nuclei examined is shown. Bar, 0.2 μm. (B) The experiment in A was performed with other *mps3* SUN domain mutants (Fig. S1). The DNA content of each mutant at 23°C, the percentage of large-budded cells for each sample at 23°C and 37°C, and the percentage of large-budded cells with monopolar spindles at 37°C was determined (*n* = 200 in three independent experiments). (C) The indicated gene on a 2μ *URA3* plasmid (pRS202 or pRS426) was transformed into each *mps3* SUN mutant and analyzed for its ability to restore growth at 37°C in a serial dilution assay. 2 OD~600~ of cells from an overnight culture were spotted onto SD-URA plates in a series of six fivefold dilutions. After 3 d at 37°C, suppression was scored as follows: ++, growth at the fourth dilution and beyond; +, growth at the second or third dilution; −/+, growth only at the first dilution; −, no growth above background. None of the mutants were suppressed by 2μ *SPC42*, 2μ *SPC29*, 2μ *CNM67*, or 2μ *NUD1* (not depicted). (D) Levels of wild-type Mps3 or mps3 mutant proteins in cell extracts from A and B were determined by Western blotting with anti-Mps3 antibodies (top). We also included a sample from a strain in which the endogenous copy of *MPS3* was replaced with *MPS3-GFP* (GFP; SLJ911); because Mps3-GFP is 27 kD larger than wild-type Mps3, this allows us to clearly determine the position of endogenous Mps3. G6PDH serves as a loading control (bottom). (E) In the same cells grown at 37°C, localization of wild-type Mps3 and mutant mps3 proteins to the SPB, marked by the end of the microtubule signal, was analyzed by indirect immunofluorescence microscopy with affinity-purified Mps3 polyclonal antibodies. Anti-Mps3 is in red, microtubules are in green, and DNA is in blue. Arrowheads point to SPB-localized Mps3, and the percentage of cells with visible Mps3 at the SPB is indicated (*n* = 100 in two independent experiments). In addition to what is shown, 38% of mps3-W477A, 58% of mps3-Y502H, 11% of mps3-A540D, and 17% of mps3-Q572L Q573L protein localized to the SPB at the SPB at 37°C; in the remainder of cells, a diffuse staining pattern similar to that of mps3-W487A and mps3-F592S was observed. All of the mutant mps3 proteins localized to the SPB in \>80% of cells at 23°C (not depicted). Background staining away from the SPB is due to a combination of Mps3 localization to the nuclear periphery ([@bib14]; [@bib24]) as well as nonspecific cross-reactivity of the antibody; therefore, only Mps3 localization to the spindle poles was analyzed. Bar, 5 μm.](jcb1740665f02){#fig2}
In *mps3-W477A*, *-F592S*, and *-ΔSUN2* mutants, we also observed monopolar spindles in roughly half of the large-budded cells by both indirect immunofluorescence microscopy and EM ([Fig. 2, A and B](#fig2){ref-type="fig"}; and Fig. S1). The remaining cells contained short, bipolar spindles with a single DNA mass indicative of a metaphase arrest. This heterogeneous arrest phenotype supports the possibility that Mps3 has a second function in mitotic progression separate from its role in SPB duplication that is defective in these mutants (see Discussion).
Like *mps3-1* mutants, we observed that the growth defect of some of our *mps3* SUN mutants was partially rescued by overexpression of components of the half-bridge, including *CDC31* ([Fig. 2 C](#fig2){ref-type="fig"}; [@bib14]). The fact that these mutants also displayed defects in Cdc31 localization at 37°C suggests that their failure in SPB duplication is due to an inability to bind to Cdc31 at the half-bridge (unpublished data). Interestingly, the growth defect of all of the SUN domain mutants at 37°C was suppressed at least in part by overexpression of *NBP1* or *MPS2* ([Fig. 2 C](#fig2){ref-type="fig"}). One interpretation of this genetic interaction is that the SUN region of Mps3 might interact directly with Nbp1 or Mps2; therefore, having more of either Mps3 binding partner present in the cell could stabilize a weak interaction with the mps3 SUN mutant protein and allow the *mps3* cells to proliferate at the restrictive temperature. Defects in Cdc31, Mps2, and/or Nbp1 binding could also explain why localization of most of mps3 SUN domain mutant proteins to the SPB is reduced or eliminated in cells grown at 37°C ([Fig. 2 E](#fig2){ref-type="fig"}), even though total protein levels determined by Western blotting are not dramatically altered ([Fig. 2 D](#fig2){ref-type="fig"}).
*mps3* SUN domain mutants have karyogamy defects
------------------------------------------------
Mps3 is important not only for SPB duplication but also for karyogamy. Analysis of the *nep98-7* allele, which contains a mutation in one of the most highly conserved residues in the SUN domain, indicated that Mps3 is required for both steps of karyogamy: nuclear congression and fusion ([@bib24]). To test whether our mutants displayed karyogamy defects, we analyzed the position of nuclei in mating mixtures of wild-type and *mps3* SUN domain mutants after 5 h at the semipermissive temperature of 30°C; at higher temperatures, karyogamy itself is affected and our mutants begin to exhibit a significant delay in mitosis, a cell cycle stage that is nonpermissive for mating. After 5 h, 95% of zygotes contained a single nucleus in the wild-type mating, whereas only 60--70% of *mps3* SUN domain mutant zygotes had successfully completed both steps of karyogamy and contained a single nucleus ([Fig. 3](#fig3){ref-type="fig"}). The SUN domain mutants displayed a unilateral defect in karyogamy (unpublished data) and were defective in both nuclear congression and fusion, although the congression defect was more pronounced. We suspect that allele and strain-background differences are responsible for the less severe karyogamy phenotypes that we observed compared with others ([@bib24]). The simplest interpretation of the karyogamy defect, like the SPB duplication defect, is that *mps3* SUN domain mutants fail to form an intact half-bridge, which is critical for both nuclear congression and fusion ([@bib7]).
{#fig3}
The Mps3 SUN domain interacts with Mps2
---------------------------------------
Because Mps3 is located at the SPB and SUN proteins are thought to interact with other integral membrane proteins, we hypothesized that the Mps3 SUN domain might bind Kar1 or Mps2, the other single pass membrane proteins at the SPB ([@bib33]; [@bib31]; [@bib21]). Full-length Kar1 and Mps2 expressed as maltose binding protein (MBP) fusions in bacteria were transferred to nitrocellulose membranes after SDS-PAGE of bacterial extracts, and the membrane was probed with the Mps3 SUN domain (amino acids 457--617) labeled with the infrared dye Alexa 680 in a gel overlay assay. We found that the SUN domain bound to full-length Mps2 (MBP-Mps2) and to the Mps2 C terminus (MBP-mps3-Ct) but did not interact with MBP, Kar1 (MBP-Kar1), or other proteins in the bacterial extracts ([Fig. 4 A](#fig4){ref-type="fig"}). Binding of the Mps3 SUN domain to Mps2 required a functional SUN domain because most mps3 SUN domain mutant proteins were unable to compete with the wild-type protein for Mps2 binding in the gel overlay assay, even when present in at least 10-fold excess ([Fig. 4 B](#fig4){ref-type="fig"} and not depicted).
{#fig4}
To test whether Mps2 and Mps3 interact in yeast, we created strains expressing *MPS2-13xMYC* and/or *MPS3-3xFLAG* from their endogenous promoters and immunoprecipitated the tagged proteins from the membrane fraction of lysates from spheroplasted cells treated with the short 12-Å membrane-permeable cross-linker dithiobis(succinimidyl)propionate. Mps2-13xMYC coimmunoprecipitated with Mps3-3xFLAG, as did the Mps3 binding protein Cdc31 ([Fig. 4 C](#fig4){ref-type="fig"}; [@bib14]). The fact that Mps2-13xMYC did not precipitate in cells lacking Mps3-3xFLAG and that other SPB components such as Spc29 did not coprecipitate indicates that binding is specific and likely occurs through Mps3. Mps2 and Mps3 also coimmunoprecipitated in the absence of a cross-linker when cell lysates were prepared by grinding in liquid nitrogen ([Fig. 4 D](#fig4){ref-type="fig"}), providing further evidence of a direct interaction between Mps2 and Mps3 in yeast. However, as SPBs remain largely intact by this method of lysis ([@bib23]), we cannot totally exclude the possibility that the Mps2--Mps3 interaction is mediated by another SPB component. From the binding data in vitro and our ability to coimmunoprecipitate Mps2 and Mps3 from yeast extracts using two different techniques, we conclude that Mps2 binds to Mps3 in vivo and that this interaction is likely mediated by the Mps3 SUN domain.
The C terminus of Mps2 binds to the Mps3 SUN domain
---------------------------------------------------
Several proteins predicted to bind to SUN domains contain a conserved C-terminal transmembrane segment followed by ∼30 amino acids known as the Klarsicht/ANC-1/Syne homology (KASH) domain ([@bib32]). Protease protection and protein binding experiments demonstrated that the N terminus of Mps3 is exposed to the cytoplasm/nucleoplasm, whereas the C terminus, including the SUN domain, is located in the space between the inner and outer nuclear membranes ([@bib24]). In contrast, the N terminus of Mps2 is exposed to the cytoplasm/nucleoplasm, whereas the C terminus of Mps2 is in the intermembrane space ([@bib27]). Therefore, we would predict that the Mps3 SUN domain binds to the C terminus of Mps2. However, neither the Mps2 C terminus nor any other protein sequence in *S. cerevisiae* contain regions of significant similarity to a hidden Markov model of the KASH domain (unpublished data); instead, Mps2 and its orthologues from other budding yeasts have a unique C-terminal region that includes seven conserved aromatic residues ([Fig. 5 A](#fig5){ref-type="fig"}).
{#fig5}
Despite its lack of a KASH domain, the Mps2 C terminus clearly binds to the Mps3 SUN domain in both the gel overlay assay and pull-down assays in vitro ([Fig. 4 A](#fig4){ref-type="fig"} and not depicted). In addition, a version of Mps2 lacking the C-terminal amino acids (mps2ΔC; amino acids 1--328) does not bind to the SUN domain in vitro ([Fig. 4 A](#fig4){ref-type="fig"} and [Fig. 5 D](#fig5){ref-type="fig"}) and *mps2ΔC* is unable to rescue the growth defect of *mps2Δ* and serve as the sole copy of *MPS2* in cells ([Fig. 5 B](#fig5){ref-type="fig"}). Thus, the C terminus of Mps2, like the Mps3 SUN domain, is critical for cell viability.
Analysis of a series of point mutations (not depicted) and truncations ([Fig. 5 C](#fig5){ref-type="fig"}) in the Mps2 C terminus indicates that residues throughout the region are essential for Mps2 function and for Mps3 binding. Insertion of a nonsense codon after residue 381 in Mps2 resulted in an allele of *MPS2* (*mps2-381*) that encodes a protein containing all but the last six amino acids. The fact that *mps2-381* cells display a conditional growth defect ([Fig. 5, C and E](#fig5){ref-type="fig"}), combined with the fact that the mps2-381 protein only weakly bound to the SUN domain in vitro ([Fig. 5 D](#fig5){ref-type="fig"}), is evidence that the C terminus of Mps2 is important for the interaction with Mps3 in vivo. Additional support for the notion that the growth defect in *mps2-381* cells is due to loss of Mps3 binding comes from our observations that overexpression of wild-type *MPS3*, but not SUN domain mutants, partially rescues the growth defect of *mps2-381* mutants at 37°C ([Fig. 5, E and F](#fig5){ref-type="fig"}). Interestingly, *MPS3* overexpression is unable to suppress *mps2* mutants that contain lesions in the N terminus (not depicted), whereas *BBP1* overexpression, which suppresses some N-terminal *mps2* mutants ([@bib27]), only weakly rescues growth of *mps2-381* ([Fig. 5 F](#fig5){ref-type="fig"}). These results strongly suggest that the SUN domain of Mps3 binds to the C terminus of Mps2 and supports the possibility that loss of Mps3 binding is responsible for the growth defect of *mps2-381* and other C-terminal Mps2-deletion mutants.
*mps2-381* mutants have SPB duplication and karyogamy defects
-------------------------------------------------------------
Asynchronously growing wild-type and *mps2-381* mutant cells were analyzed after a 4-h shift to the nonpermissive temperature (37°C). Flow cytometric analysis of DNA content and budding index confirmed that the *mps2-381* mutants spontaneously diploidize at 23°C and arrest in mitosis at 37°C ([Fig. 6 A](#fig6){ref-type="fig"}). Analysis of mitotic spindle morphology by indirect immunofluorescence microscopy and EM revealed that \>75% of large-budded *mps2-381* cells contain a monopolar spindle at 37°C ([Fig. 6, B and C](#fig6){ref-type="fig"}). Other *mps2* mutants also have monopolar spindles ([@bib35]); however, *mps2-381* mutants have a distinct terminal SPB mutant phenotype: they contain a single monopolar spindle on a deep nuclear invagination, and the SPB appears to have failed to initiate SPB duplication ([Fig. 6 C](#fig6){ref-type="fig"}). The morphology of the *mps2-381* SPB is highly reminiscent of many of our *mps3* SUN mutants ([Fig. 2 A](#fig2){ref-type="fig"} and Fig. S1), and it appears that *mps2-381* SPBs lack a normal half-bridge, although visualization of the half-bridge by EM alone on such a constricted invagination is difficult. We found no evidence by morphology or by immunolabeling of a second partially assembled SPB like that observed in *mps2-1* mutants in spite of good overall fixation (unpublished data; [@bib35]). This novel terminal SPB phenotype uncovered by the *mps2-381* allele suggests that Mps2 has an earlier function in SPB duplication, perhaps during half-bridge formation or tethering of the half-bridge to the SPB, which was not previously indicated through analysis of other *mps2* mutants.
{#fig6}
Like the Mps3 SUN domain, the Mps2 C terminus is important not only for SPB duplication but also for both steps of karyogamy. Although other *mps2-1* alleles also have a mild karyogamy defect, \>30% of *mps2-381* cells fail to complete both nuclear congression and fusion, indicating that Mps2--Mps3 binding is important for karyogamy ([Fig. 3](#fig3){ref-type="fig"}).
*mps2-381* mutants have defects in Mps3 localization
----------------------------------------------------
The fact that *mps2-381* mutants have phenotypes very similar to our *mps3* SUN mutants and to other mutants that lack a functional half-bridge led us to examine the localization and levels of Mps3 and the half-bridge component Cdc31 in *mps2-381* cells. Asynchronously growing wild-type and *mps2-381* cells that have the endogenous copy of *MPS3* fused to GFP were shifted to 37°C for 3 h. Western blot analysis revealed that Mps3-GFP, as well as other SPB components such as Cdc31, Spc110, and Tub4, were expressed at similar levels in *MPS2* and *mps2-381* cells ([Fig. 7 A](#fig7){ref-type="fig"}). However, we consistently saw a decrease in the number of *mps2-381* cells grown at 37°C containing Mps3-GFP, as well as a decrease in the overall intensity of Mps3-GFP epifluorescence at the SPB ([Fig. 7, B and C](#fig7){ref-type="fig"}). Cdc31 staining at the SPB by indirect immunofluorescence also decreased in *mps2-381* mutants at 37°C ([Fig. 7, B and C](#fig7){ref-type="fig"}). Instead of a distinct SPB signal, Mps3-GFP was diffusely localized and Cdc31 appeared as punctate spots in *mps2-381* cells at 37°C. No change in expression or localization of core SPB components such as Spc110 and Tub4 was observed in *mps2-381* mutants at either temperature ([Fig. 6 B](#fig6){ref-type="fig"} and [Fig. 7 C](#fig7){ref-type="fig"}). The failure of *mps2-381* mutants to localize Mps3-GFP and Cdc31 to the SPB is not due to defects in 9xMYC-mps2-381 expression or its localization to the SPB; 9xMYC-Mps2 and 9xMYC-mps2-381 both localized to the SPB at 23 and 37°C ([Fig. 7 D](#fig7){ref-type="fig"}). Together with our data showing that mps2-381 binding to the Mps3 SUN domain is reduced in vitro, these data strongly suggest that *mps2-381* mutants fail to bind and localize components of the half-bridge to the SPB. We propose that the Mps3 SUN domain and the Mps2 C terminus form an intermolecular bridge spanning the nuclear membranes to tether the half-bridge to the core SPB. This interaction is critical for assembly and/or maintenance of an intact half-bridge ([Fig. 8](#fig8){ref-type="fig"}).
{#fig7}
![**Binding of the Mps3 SUN domain to Mps2 C terminus tethers the SPB to the half-bridge.** Mps3 (green) is an integral membrane protein localized primarily to the inner nuclear membrane with its N terminus exposed to the nucleoplasm/cytoplasm and its C terminus located in the membrane space between the inner and outer nuclear membranes (INM and ONM, respectively). Here, the SUN domain of Mps3 (yellow) can interact with the C terminus of integral membrane proteins such as Mps2 (red) to build the half-bridge (black) and anchor it to the core SPB, which is important for SPB duplication and karyogamy. Previous work showed that the N terminus of Mps2 binds to the soluble protein Bbp1 (orange), which interacts with the core SPB protein Spc29 (black; [@bib27]). It is possible that the SUN domain of Mps3 also interacts with other proteins, such as Jem1 (purple; see Discussion).](jcb1740665f08){#fig8}
Discussion
==========
Association between the core SPB and the half-bridge is critical for SPB duplication and function, yet the molecular details of this link have not been characterized at a biochemical level. In this work, we show that SPBs in Mps3 SUN domain and Mps2 C-terminal mutants lack an associated half-bridge and find that the Mps2 C terminus directly binds to Mps3 in a SUN domain--dependent manner. This strongly suggests that the Mps2--Mps3 interaction is essential to anchoring the half-bridge to the core SPB ([Fig. 8](#fig8){ref-type="fig"}). When combined with previous studies showing that the N terminus of Mps2 binds to Bbp1, which in turn interacts with the central plaque component Spc29 ([@bib27]), our results provide a missing physical connection between the half-bridge and the core SPB.
Previous analysis of *mps2-1* mutants showed that Mps2 function is required for insertion of the newly duplicated SPB into the nuclear envelope ([@bib35]). However, our findings that *mps2-381* mutants lack any recognizable half-bridge structure and fail to localize Mps3 and Cdc31 to the SPB suggests that Mps2 has an additional function earlier in SPB duplication. Based on analysis of Mps2--Mps3 binding, we propose that Mps3 recruits and binds to Mps2 at the distal tip of the newly assembled bridge during SPB duplication. Once this connection between the C terminus of Mps2 and the Mps3 SUN domain is established, Mps2 can interact through its N terminus with additional proteins such as Bbp1, Nbp1, and Ndc1 to facilitate insertion of the newly duplicated SPB into the nuclear envelope. This model would explain why previously characterized *mps2* alleles, which all contain N-terminal mutations, fail in the late step of SPB duplication like *bbp1-1*, *nbp1-td*, and *ndc1-1* mutants ([@bib35], [@bib36]; [@bib27]; [@bib4]). We would also predict that binding between Mps2 and Mps3 is required to tether the half-bridge to the core SPB from the point of SPB duplication throughout the rest of the cell cycle. Consistent with this hypothesis, *mps2-381* cells fail to maintain an intact half-bridge at the restrictive temperature, resulting in defects in the earliest step of SPB duplication as well as in karyogamy.
Is the Mps2--Mps3 interaction the only binding event required to tether the half-bridge to the core SPB? Two-hybrid interactions have been observed between Bbp1 and Kar1 ([@bib27]) as well as between Ndc1 and Kar1 (unpublished data), and numerous genetic interactions have been reported among Mps2, Ndc1, Bbp1, Nbp1, and components of the half-bridge ([@bib27]; [@bib14]; [@bib4]), so we suspect that a complex set of protein--protein interactions likely anchors the half-bridge to the core SPB. Multiple overlapping interactions would help ensure the integrity of the entire SPB and allow it to withstand microtubule forces that push and pull on the SPB and nucleus during the yeast life cycle. Redundancy in protein--protein interactions holding the half-bridge to the core SPB could also explain why we observe only ∼50% reduction in Mps3 and Cdc31 localization to the SPB in *mps2-381* mutants at 37°C. Further analysis of the molecular interactions between the membrane and half-bridge components of the SPB will allow us to better understand how the SPB is assembled and duplicated.
Analysis of Mps3 SUN mutants in yeast suggest that SUN proteins have multiple evolutionarily conserved functions. First, the role of the Mps3 SUN domain in maintaining SPB integrity by tethering the soluble core proteins to the nuclear envelope components suggests the interesting possibility that this protein family is involved in connecting centrosomes to the nuclear envelope. Although the idea that centrosomes are physically linked to the nuclear envelope is controversial, old and new evidence suggests that such an association may exist ([@bib5]; [@bib22]; [@bib16]; [@bib19]). Low sequence conservation between SUN domains makes it impossible to predict the phylogenetic relationships of most proteins within the SUN family with statistical significance. However, our functional data suggests that Mps3 is most related to fission yeast Sad1, *C. elegans* SUN-1, and mammalian Spag4, which have been shown to be essential for tethering SPBs, centrosomes, and axonemes, respectively, with the nuclear envelope ([@bib10]; [@bib28]; [@bib19]). Interestingly, these Mps3-like SUN proteins not only interact with various types of microtubule-organizing centers but also appear to bind to proteins, such as Kms1, ZYG-12, and now Mps2, that show very little sequence similarity to the KASH domain of other SUN binding proteins that interact with the actin cytoskeleton ([@bib32]). One idea is that microtubule SUN proteins may recognize a distinct or divergent motif that is currently poorly defined because of the low number of known binding proteins.
The requirement of an intact Mps3 SUN domain for nuclear migration during karyogamy is consistent with the role of *C. elegans* UNC-84 and SUN-1 in nuclear positioning ([@bib18], [@bib19]). Mps3 SUN mutants also affect the second step of karyogamy. This may be due to a defect in SPB integrity; however, given that hSun1 is required for homotypic membrane fusion in vitro ([@bib12]), the requirement for Mps3 during nuclear fusion may reflect a more general role for SUN proteins as mediators of membrane fusion. Interestingly, the SUN domain region of Mps3 has been shown to interact with the DnaJ-like ER membrane chaperone Jem1, which is required for membrane fusion after mating ([@bib24]).
SUN proteins also appear to have functions within the nucleus. Sad1 is required for formation of the meiotic bouquet during fission yeast meiosis ([@bib29]; [@bib8]), and mammalian Sun1 proteins have Zn^2+^ finger domains that may interact directly with chromatin ([@bib11]). In addition, Mps3 is required for the establishment of sister chromatid cohesion during S phase in budding yeast ([@bib3]), and one of our SUN domain mutants (*mps3-Y502H*) is found in the *mps3-5* allele that has defects in both centromere and telomere cohesion ([@bib2]). Additional nuclear functions could be one reason for the spindle checkpoint--dependent mitotic delay that we observed in *mps3-W477A*, *-F592S*, and *-ΔSUN2* cells (unpublished data). How mutations in the SUN domain might affect nuclear functions of Mps3 is unclear at present. However, our identification of Mps3 as the budding yeast SUN protein should facilitate rapid identification and analysis of additional SUN binding partners and greatly enhance our understanding of SUN protein functions.
Materials and methods
=====================
Yeast strains and plasmids
--------------------------
All strains are derivatives of W303 (*ade2-1 trp1-1 leu2-3,112 ura3-1 his3-11,15 can1-100*) and are listed in Table S1 (available at <http://www.jcb.org/cgi/content/full/jcb.200601062/DC1>). The entire ORF of *MPS2* or *MPS3* was deleted in a diploid with *HIS3MX6* or *KANMX6* using PCR-based methods, and the strain was transformed with a centromeric *URA3*-marked plasmid containing the corresponding wild-type ORF, sporulated, and dissected to generate *mps2Δ∷KANMX6 pURA3-MPS2* and *mps3Δ∷HIS3MX6 pURA3-MPS3* strains in both mating types. *mps2* and *mps3* alleles in pRS305 were created by oligonucleotide-directed mutagenesis and integrated into the *LEU2* locus in single copy in the appropriate deletion. *MPS3* was fused to 3xFLAG and *MPS2* was fused to 13xMYC using PCR. The *9xMYC-mps2-381* was created by mutagenesis of *pRS304-9xMYC-MPS2* ([@bib21]), and vectors containing both wild-type and mutant forms of *MPS2* were cut with BstZ17I to direct integration into the *TRP1* locus of SLJ1901 followed by loss of the covering *MPS2* plasmid on plates containing 5-fluorootic acid (5-FOA).
*SAD1* and *MPS3* were amplified by PCR from pREP42-*SAD1* (a gift from I. Hagan, Paterson Institute for Cancer Research, Manchester, UK) and pSJ140 ([@bib14]), respectively, and cloned into a pRS306-based vector containing the *GAL1/10* promoter to create *pURA3-GAL-SAD1* (pSJ379) and *pURA3-GAL-MPS3* (pSJ146). *MPS2* and mutants, the SUN domain of *MPS3* and mutants and *SPC29* were amplified by PCR and cloned into pMAL-c2 (New England Biolabs, Inc.) or pQE10/pQE11 (QIAGEN) for expression in bacteria as MBP or 6xHis fusion proteins, respectively.
Protein techniques
------------------
6xHis-Spc29 was purified from BL21(DE3) bacteria transformed with pQE11-*SPC29* (pSJ260) by metal affinity followed by anion exchange chromatography, and the C terminus of Mps3 was purified from BL21(DE3) pLysS bacteria transformed with pMALc2-*MPS3-Ct* (pSJ151) using amylose resin. Antibodies against purified 6xHis-Spc29 or MBP-Mps3-Ct were generated in rabbits (Animal Pharm) and purified according to the manufacturer\'s instructions on a Spc29 or Mps3 column created using the Sulfo-link kit (Pierce Chemical Co.). Mps2 antibodies were generated by injecting a KLH-coupled peptide corresponding to residues 212--233 of Mps2 into guinea pigs (Pocono) followed by affinity purification on MBP-Mps2 bound to nitrocellulose filters.
The Mps3 SUN domain was also purified from BL21(DE3) pLysS bacteria transformed with pQE10-*mps3SUN* (pSJ413) by metal affinity chromatography, and 0.5 mg purified 6xHis-mps3SUN labeled with Alexa 680 as described previously ([@bib14]). Expression of MBP, MBP-Mps2 (pSJ426), and MBP-Kar1 (pSJ425) in BL21(DE3) pLysS cells was induced by the addition of 0.1 mM IPTG for 2 h at 23°C. Cells from 1 ml of culture were resuspended in 200 μl 2× SDS sample buffer and heated to 100°C for 5 min, 5 μl of MBP-Mps2 and MBP-Kar1 and 2 μl of MBP-only samples were separated by 8% SDS-PAGE, and proteins were electrophoretically transferred to nitrocellulose. Membranes were probed with 10 μg Alexa 680--labeled 6xHis-mps3SUN, and binding was assessed using the Odyssey imaging system (LiCor). Expression of bacterial proteins was confirmed by Western blotting with a 1:1,000 dilution of anti-MBP antibodies (New England Biolabs, Inc.). For bacterial pull-down assays, MBP, MBP-Mps2, and MBP-mps2 mutants were expressed in BL21(DE3) pLysS cells by the addition of 0.1 mM IPTG for 2 h at 23°C and cell pellets from 2 ml of culture were resuspended in 0.5 ml PBS containing 0.1% Triton X-100 and 1 mM PMSF, vortexed for 5 min at 4°C, and centrifuged at 14,000 *g* for 10 min at 4°C. 100 μl of each extract was mixed with 1 μg of purified 6xHis-mps3SUN in a 500-μl immunoprecipitation that included 2 μl protein A--coated magnetic beads (Dynal) and 1 μl of affinity-purified anti-Mps2 antibodies. After a 1-h incubation a 4°C, immunoprecipitates were washed five times in PBS containing 0.1% Triton X-100 and an additional 250 mM NaCl.
Spheroplast lysates were prepared from 100 OD~600~ midlog phase cells. Harvested cells were resuspended in 5 ml spheroplast buffer (50 mM Tris-HCl, pH 7.5, 1.2 M sorbitol, and 10 mM NaN~3~) containing 40 mM β-mercaptoethanol and treated with 300 μg/ml zymolase 100T for 30 min at 30°C. Cells were then washed three times in spheroplast buffer, resuspended in 2.5 ml spheroplast lysis buffer (20 mM Hepes-KOH, pH 7.4, 100 mM K-acetate, 5 mM Mg-acetate, 1 mM EDTA, 1 mM PMSF, and 1 μg/ml each of pepstatin A, aprotinin, and leupeptin), and lysed by dounce homogenization. Lysates were transferred to ice and treated with 0.2 mg/ml dithiobis(succinimidyl)propionate for 10 min. Cross-linking was quenched by addition of 50 mM Tris-HCl, pH 8.0, and lysates were centrifuged at 13,000 *g* for 15 min at 4°C. The pellet was resuspended in 2.5 ml solubilization buffer (spheroplast lysis buffer plus 1 M NaCl and 1% Triton X-100) and recentrifuged at 13,000 *g* for 15 min at 4°C. The supernatant was added to 20 ml spheroplast lysis buffer immediately before immunoprecipitation.
Ground lysates were prepared from 500 OD~600~ of midlog phase cells as described previously ([@bib23]). In brief, cells were frozen in liquid nitrogen and ground with a Retsch ball mill. Ground cell powder was allowed to thaw on ice and resuspended in 10 ml extraction buffer (25 mM Hepes-NaOH, pH 7.5, 300 mM NaCl, 0.1 mM EDTA, 0.5 mM EGTA, 2 mM MgCl~2~, 0.5% Triton X-100, 1 mM DTT, 1 mM PMSF, and 1 μg/ml each of pepstatin A, aprotinin, and leupeptin). After homogenization with a Polytron 10/35 for 30 s, lysates were centrifuged at 3,000 *g* for 10 min at 4°C, and the resulting supernatant was used for immunoprecipitations.
100 μl FLAG M2 (Sigma-Aldrich) or 9E10 conjugated (Santa Cruz Biotechnology, Inc.) beads were added to lysates to immunoprecipitate Mps3-FLAG or Mps2-13xMYC, respectively. After a 2-h incubation at 4°C, beads were washed five times in extraction buffer, and 1/10 of the bound protein and 1/1,000 of the input protein was analyzed by SDS-PAGE followed by Western blotting. The following primary antibody dilutions were used: 1:5,000 anti-MYC A14 (Santa Cruz Biotechnology, Inc.), 1:1,000 anti-FLAG (Sigma-Aldrich), 1:2,000 anti-Cdc31 ([@bib14]), 1:5,000 anti-Spc29, 1:2,000 anti-Mps3, 1:2,000 anti-Spc110 (a gift of T. Davis, University of Washington, Seattle, WA), 1:1,000 anti-GFP B34 (Covance), 1:2,500 anti-MBP (New England Biolabs, Inc.), and 1:10,000 anti--glucose-6-phosphate dehydrogenase (G6PDH; Sigma-Aldrich). Alkaline phosphatase--conjugated secondary antibodies were used at 1:10,000 (Promega).
Karyogamy assay
---------------
Approximately 5 × 10^6^ midlog phase cells of opposite mating types grown at 23°C were mixed onto a 45-μm nitrocellulose filter, and filters were incubated on YPD plates for 5 h at 30°C. Cells were then stained with DAPI, and nuclear position was analyzed by fluorescence microscopy.
Cytological techniques
----------------------
Analysis of DNA content by flow cytometry, EM, and protein localization by indirect immunofluorescence and epifluorescence microscopy were performed as previously described ([@bib14]). Spc110 polyclonal antibodies were a gift from T. Davis and were used at a 1:2,000 dilution. Mps3 was localized using affinity-purified anti-Mps3 antibodies diluted 1:500 in PBS containing 3% BSA and 0.1% NP-40 followed by detection with Alexa 555--conjugated goat anti--rabbit secondary antibodies (Invitrogen) diluted 1:20,000 in the same buffer. Cells were examined with an Axioimager (Carl Zeiss MicroImaging, Inc.) using a 100× Plan-Fluar lens (NA = 1.45; Carl Zeiss MicroImaging, Inc.), and images were captured with a digital camera (Orca ER; Hamamatsu) and processed using Axiovision 4.0 (Carl Zeiss MicroImaging, Inc.).
Sequence analysis
-----------------
Homologues of Mps3 were detected through iterative searches of the nonredundant protein sequence database (National Center for Biotechnology Information) using the PSI-BLAST program ([@bib1]). Sequences corresponding to the SUN domain of Mps3 homologues and C termini of putative SUN binding proteins were aligned using ClustalW, and phylogenetic analysis was performed using the MEGA3 software.
Online supplemental material
----------------------------
Fig. S1 shows that ts SUN domain mutants arrest in mitosis because of a defect in SPB duplication. Fig. S2 shows a phylogenetic analysis of SUN domains. Table S1 lists yeast strains. Table S2 shows SUN domain mutants. Table S3 gives copy number--dependent SUN domain mutants. Online supplemental material is available at <http://www.jcb.org/cgi/content/full/jcb.200601062/DC1>.
Supplementary Material
======================
###### \[Supplemental Material Index\]
We thank I. Hagan and T. Davis for reagents; K. Delventhal, J. Wunderlich, and J. Schwartz for technical assistance; and D. Starr, J. Gerton, K. Lee, C. Pearson, and S. Hawley for valuable discussions and comments on the manuscript. We are especially grateful to S. Shelton, J. Bupp, and E. Hoffman for their contributions to this project.
This work was supported by funding from the National Institutes of General Medical Sciences (grant GM51312 to M. Winey) and the Leukemia and Lymphoma Society (to S.L. Jaspersen). S.L. Jaspersen and A. Mushegian are also funded by the Stowers Institute for Medical Research.
[^1]: Correspondence to Sue L. Jaspersen: <[email protected]>
|
product description page
Sticker Art Jungle (Paperback)
About this item
Create your own colorful jungle animal portraits with this new sticker series for animal enthusiasts of all ages. With eight sticker by number portraits for hours of fun, each portrait features facts to keep young readers interested.
|
You can go slow carb than no carb at all
It has become a trend to go on a low-carb diet or even a no-carb diet. This can surely help in quick weight loss. It can be done for a temporary basis, but ditching carbs completely over the long run can be tough. For the beginning it can be like swimming up-stream. In the US the average adults get about 50 percent of their everyday calories from carbohydrates.
The fact is that if you are cutting completely from carbohydrates, that will mean that you will have to give up on fruits, whole grains, vegetables which are the building blocks of a healthy diet. Dr. David Ludwig, the professor of nutrition at the Harvard School of Public Health and the co-editor of the New Balance Foundation Obesity Prevention Centre Boston Children’s Hospital said, “We’ve known for decades that different foods affect the body differently”.
While shopping on the bread side, you can pick up the white bread or the whole grain bread and they have near about the same number of calories but the whole grains have a lot more going for it. Ludwig has further explained, “When you eat a whole-kernel, minimally processed grain … they take a while to digest. Blood sugar rises relatively more gently. You produce less insulin calorie for calorie”. So the whole grains can be called as slow carbs because of its slow digestion and the other slow carbs include vegetables, fruits, beans and grains.
It is the visualizing game that works as when you eat whole grain bread, you are getting everything that comes in the wheat kernel and includes fibre-rich bran. It also includes the germ which is the embryo of the seed and contains everything that is needed to nurture a new life. But with white bread all the good stuff has been stripped off out during processing. So all that is left is starch, which is one step away from turning to sugar in the body.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.